1
1

Include Ralph's suggestions, i.e. keep the hnp and orted management in sync.

This commit was SVN r19872.
Этот коммит содержится в:
George Bosilca 2008-11-01 00:39:46 +00:00
родитель ef3d8cd2a1
Коммит d23fe1bb10
7 изменённых файлов: 16 добавлений и 13 удалений

Просмотреть файл

@ -2,7 +2,7 @@
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana * Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
* University Research and Technology * University Research and Technology
* Corporation. All rights reserved. * Corporation. All rights reserved.
* Copyright (c) 2004-2006 The University of Tennessee and The University * Copyright (c) 2004-2008 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights * of Tennessee Research Foundation. All rights
* reserved. * reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,

Просмотреть файл

@ -2,7 +2,7 @@
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana * Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
* University Research and Technology * University Research and Technology
* Corporation. All rights reserved. * Corporation. All rights reserved.
* Copyright (c) 2004-2005 The University of Tennessee and The University * Copyright (c) 2004-2008 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights * of Tennessee Research Foundation. All rights
* reserved. * reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
@ -272,8 +272,9 @@ static int hnp_close(const orte_process_name_t* peer,
{ {
opal_list_item_t *item, *next_item; opal_list_item_t *item, *next_item;
if( ORTE_IOF_STDIN == source_tag ) { if( ORTE_IOF_STDIN & source_tag ) {
orte_iof_read_event_t* rev; orte_iof_read_event_t* rev;
int rev_fd;
for( item = opal_list_get_first(&mca_iof_hnp_component.read_events); for( item = opal_list_get_first(&mca_iof_hnp_component.read_events);
item != opal_list_get_end(&mca_iof_hnp_component.read_events); item != opal_list_get_end(&mca_iof_hnp_component.read_events);
@ -290,11 +291,12 @@ static int hnp_close(const orte_process_name_t* peer,
opal_list_remove_item(&mca_iof_hnp_component.read_events, opal_list_remove_item(&mca_iof_hnp_component.read_events,
item); item);
/* No need to delete the event, the destructor will automatically /* No need to delete the event, the destructor will automatically
* do it for us. * do it for us.
*/ */
close(rev->ev.ev_fd); rev_fd = rev->ev.ev_fd;
OBJ_RELEASE(item); OBJ_RELEASE(item);
close(rev_fd);
} }
} }
} }
@ -369,6 +371,7 @@ static void stdin_write_handler(int fd, short event, void *cbdata)
OBJ_RELEASE(output); OBJ_RELEASE(output);
} }
ABORT: ABORT:
close(wev->fd);
opal_event_del(&wev->ev); opal_event_del(&wev->ev);
wev->pending = false; wev->pending = false;

Просмотреть файл

@ -2,7 +2,7 @@
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana * Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
* University Research and Technology * University Research and Technology
* Corporation. All rights reserved. * Corporation. All rights reserved.
* Copyright (c) 2004-2005 The University of Tennessee and The University * Copyright (c) 2004-2008 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights * of Tennessee Research Foundation. All rights
* reserved. * reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
@ -202,8 +202,8 @@ void orte_iof_hnp_read_local_handler(int fd, short event, void *cbdata)
CLEAN_RETURN: CLEAN_RETURN:
/* if we read 0 bytes from the stdout/err/diag, there is /* if we read 0 bytes from the stdout/err/diag, there is
* nothing to output - we do not close these file descriptors, * nothing to output - close these file descriptors,
* but we do terminate the event * and terminate the event.
*/ */
if (0 == numbytes) { if (0 == numbytes) {
close(fd); close(fd);

Просмотреть файл

@ -2,7 +2,7 @@
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana * Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
* University Research and Technology * University Research and Technology
* Corporation. All rights reserved. * Corporation. All rights reserved.
* Copyright (c) 2004-2005 The University of Tennessee and The University * Copyright (c) 2004-2008 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights * of Tennessee Research Foundation. All rights
* reserved. * reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,

Просмотреть файл

@ -2,7 +2,7 @@
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana * Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
* University Research and Technology * University Research and Technology
* Corporation. All rights reserved. * Corporation. All rights reserved.
* Copyright (c) 2004-2005 The University of Tennessee and The University * Copyright (c) 2004-2008 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights * of Tennessee Research Foundation. All rights
* reserved. * reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,

Просмотреть файл

@ -2,7 +2,7 @@
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana * Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
* University Research and Technology * University Research and Technology
* Corporation. All rights reserved. * Corporation. All rights reserved.
* Copyright (c) 2004-2007 The University of Tennessee and The University * Copyright (c) 2004-2008 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights * of Tennessee Research Foundation. All rights
* reserved. * reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,

Просмотреть файл

@ -2,7 +2,7 @@
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana * Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
* University Research and Technology * University Research and Technology
* Corporation. All rights reserved. * Corporation. All rights reserved.
* Copyright (c) 2004-2005 The University of Tennessee and The University * Copyright (c) 2004-2008 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights * of Tennessee Research Foundation. All rights
* reserved. * reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart, * Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,