proc_list 1542 ompi/communicator/comm.c ompi_proc_t **proc_list=NULL; proc_list 1560 ompi/communicator/comm.c proc_list = (ompi_proc_t **) calloc (local_comm->c_local_group->grp_proc_count, proc_list 1563 ompi/communicator/comm.c proc_list[i] = ompi_group_peer_lookup(local_comm->c_local_group,i); proc_list 1564 ompi/communicator/comm.c rc = ompi_proc_pack (proc_list, local_size, sbuf); proc_list 1689 ompi/communicator/comm.c if ( NULL != proc_list ) { proc_list 1690 ompi/communicator/comm.c free ( proc_list ); proc_list 110 ompi/dpm/dpm.c ompi_proc_t **proc_list=NULL, **new_proc_list = NULL; proc_list 163 ompi/dpm/dpm.c proc_list = group->grp_proc_pointers; proc_list 166 ompi/dpm/dpm.c proc_list = (ompi_proc_t**)calloc(group->grp_proc_count, proc_list 169 ompi/dpm/dpm.c if (NULL == (proc_list[i] = ompi_group_peer_lookup(group,i))) { proc_list 172 ompi/dpm/dpm.c free(proc_list); proc_list 180 ompi/dpm/dpm.c if (ompi_proc_is_sentinel (proc_list[i])) { proc_list 181 ompi/dpm/dpm.c proc_name = ompi_proc_sentinel_to_name ((uintptr_t) proc_list[i]); proc_list 183 ompi/dpm/dpm.c proc_name = proc_list[i]->super.proc_name; proc_list 188 ompi/dpm/dpm.c free(proc_list); proc_list 189 ompi/dpm/dpm.c proc_list = NULL; proc_list 197 ompi/dpm/dpm.c free (proc_list); proc_list 203 ompi/dpm/dpm.c free(proc_list); proc_list 204 ompi/dpm/dpm.c proc_list = NULL; proc_list 52 ompi/mca/topo/treematch/treematch/tm_mapping.c void depth_first(tm_tree_t *comm_tree, int *proc_list,int *i); proc_list 401 ompi/mca/topo/treematch/treematch/tm_mapping.c void depth_first(tm_tree_t *comm_tree, int *proc_list,int *i) proc_list 405 ompi/mca/topo/treematch/treematch/tm_mapping.c proc_list[(*i)++] = comm_tree->id; proc_list 410 ompi/mca/topo/treematch/treematch/tm_mapping.c depth_first(comm_tree->child[j],proc_list,i); proc_list 461 ompi/mca/topo/treematch/treematch/tm_mapping.c int *proc_list = NULL; proc_list 478 ompi/mca/topo/treematch/treematch/tm_mapping.c proc_list = (int*)MALLOC(sizeof(int)*M); proc_list 480 ompi/mca/topo/treematch/treematch/tm_mapping.c depth_first(comm_tree,proc_list,&i); proc_list 493 ompi/mca/topo/treematch/treematch/tm_mapping.c if(proc_list[i] != -1){ proc_list 495 ompi/mca/topo/treematch/treematch/tm_mapping.c printf ("%d->%d\n",proc_list[i],nodes_id[i/block_size]); proc_list 497 ompi/mca/topo/treematch/treematch/tm_mapping.c if( proc_list[i] < nb_processes ){ proc_list 498 ompi/mca/topo/treematch/treematch/tm_mapping.c sigma[proc_list[i]] = nodes_id[i/block_size]; proc_list 499 ompi/mca/topo/treematch/treematch/tm_mapping.c set_val(k[nodes_id[i/block_size]], proc_list[i], topology->oversub_fact); proc_list 506 ompi/mca/topo/treematch/treematch/tm_mapping.c if(proc_list[i] != -1){ proc_list 508 ompi/mca/topo/treematch/treematch/tm_mapping.c printf ("%d->%d\n",proc_list[i],nodes_id[i/block_size]); proc_list 509 ompi/mca/topo/treematch/treematch/tm_mapping.c if( proc_list[i] < nb_processes ) proc_list 510 ompi/mca/topo/treematch/treematch/tm_mapping.c sigma[proc_list[i]] = nodes_id[i/block_size]; proc_list 527 ompi/mca/topo/treematch/treematch/tm_mapping.c FREE(proc_list); proc_list 12 ompi/mca/topo/treematch/treematch/tm_mapping.h void depth_first(tm_tree_t *comm_tree, int *proc_list,int *i); proc_list 56 ompi/mpi/c/intercomm_create.c ompi_proc_t **proc_list=NULL; proc_list 154 ompi/mpi/c/intercomm_create.c proc_list = (ompi_proc_t **) calloc (local_comm->c_local_group->grp_proc_count, proc_list 157 ompi/mpi/c/intercomm_create.c proc_list[j] = ompi_group_peer_lookup(local_comm->c_local_group,j); proc_list 160 ompi/mpi/c/intercomm_create.c proc_list, proc_list 220 ompi/mpi/c/intercomm_create.c if ( NULL != proc_list ) { proc_list 221 ompi/mpi/c/intercomm_create.c free ( proc_list ); proc_list 396 orte/mca/errmgr/base/errmgr_base_fns.c opal_list_t *proc_list = NULL; proc_list 405 orte/mca/errmgr/base/errmgr_base_fns.c proc_list = OBJ_NEW(opal_list_t); proc_list 439 orte/mca/errmgr/base/errmgr_base_fns.c if( ORTE_SUCCESS != (ret = orte_errmgr.predicted_fault(proc_list, node_list, suggested_map_list)) ) {