my_node 129 ompi/patterns/net/netpatterns.h netpatterns_tree_node_t *my_node); my_node 132 ompi/patterns/net/netpatterns.h netpatterns_narray_knomial_tree_node_t *my_node); my_node 134 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC void ompi_netpatterns_cleanup_narray_knomial_tree (netpatterns_narray_knomial_tree_node_t *my_node); my_node 37 ompi/patterns/net/netpatterns_nary_tree.c netpatterns_tree_node_t *my_node) my_node 50 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_rank=my_rank; my_node 51 ompi/patterns/net/netpatterns_nary_tree.c my_node->tree_size=num_nodes; my_node 75 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_parents=0; my_node 76 ompi/patterns/net/netpatterns_nary_tree.c my_node->parent_rank=-1; my_node 79 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_parents=1; my_node 90 ompi/patterns/net/netpatterns_nary_tree.c my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; my_node 105 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks=(int *)NULL; my_node 110 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_children=0; my_node 127 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_children=end_index-start_index+1; my_node 129 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_children=0; my_node 132 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks=NULL; my_node 133 ompi/patterns/net/netpatterns_nary_tree.c if( 0 < my_node->n_children ) { my_node 134 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks= my_node 135 ompi/patterns/net/netpatterns_nary_tree.c (int *)malloc( sizeof(int)*my_node->n_children); my_node 136 ompi/patterns/net/netpatterns_nary_tree.c if( NULL == my_node->children_ranks) { my_node 140 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks[lvl-start_index]=lvl; my_node 145 ompi/patterns/net/netpatterns_nary_tree.c if( 0 == my_node->n_parents ) { my_node 146 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_node_type=ROOT_NODE; my_node 147 ompi/patterns/net/netpatterns_nary_tree.c } else if ( 0 == my_node->n_children ) { my_node 148 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_node_type=LEAF_NODE; my_node 150 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_node_type=INTERIOR_NODE; my_node 163 ompi/patterns/net/netpatterns_nary_tree.c void ompi_netpatterns_cleanup_narray_knomial_tree (netpatterns_narray_knomial_tree_node_t *my_node) my_node 165 ompi/patterns/net/netpatterns_nary_tree.c if (my_node->children_ranks) { my_node 166 ompi/patterns/net/netpatterns_nary_tree.c free (my_node->children_ranks); my_node 167 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks = NULL; my_node 170 ompi/patterns/net/netpatterns_nary_tree.c if (0 != my_node->my_rank) { my_node 171 ompi/patterns/net/netpatterns_nary_tree.c ompi_netpatterns_cleanup_recursive_knomial_tree_node (&my_node->k_node); my_node 177 ompi/patterns/net/netpatterns_nary_tree.c netpatterns_narray_knomial_tree_node_t *my_node) my_node 191 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_rank=my_rank; my_node 192 ompi/patterns/net/netpatterns_nary_tree.c my_node->tree_size=num_nodes; my_node 216 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_parents=0; my_node 217 ompi/patterns/net/netpatterns_nary_tree.c my_node->parent_rank=-1; my_node 220 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_parents=1; my_node 230 ompi/patterns/net/netpatterns_nary_tree.c my_node->rank_on_level = my_node 233 ompi/patterns/net/netpatterns_nary_tree.c my_node->level_size = cnt; my_node 236 ompi/patterns/net/netpatterns_nary_tree.c my_node->level_size, my_node->rank_on_level, my_node 237 ompi/patterns/net/netpatterns_nary_tree.c tree_order, &my_node->k_node); my_node 243 ompi/patterns/net/netpatterns_nary_tree.c my_node->parent_rank=cum_cnt-cnt/tree_order+my_rank_in_my_level/tree_order; my_node 263 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks=(int *)NULL; my_node 268 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_children=0; my_node 285 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_children=end_index-start_index+1; my_node 287 ompi/patterns/net/netpatterns_nary_tree.c my_node->n_children=0; my_node 290 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks=NULL; my_node 291 ompi/patterns/net/netpatterns_nary_tree.c if( 0 < my_node->n_children ) { my_node 292 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks= my_node 293 ompi/patterns/net/netpatterns_nary_tree.c (int *)malloc( sizeof(int)*my_node->n_children); my_node 294 ompi/patterns/net/netpatterns_nary_tree.c if( NULL == my_node->children_ranks) { my_node 298 ompi/patterns/net/netpatterns_nary_tree.c my_node->children_ranks[lvl-start_index]=lvl; my_node 303 ompi/patterns/net/netpatterns_nary_tree.c if( 0 == my_node->n_parents ) { my_node 304 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_node_type=ROOT_NODE; my_node 305 ompi/patterns/net/netpatterns_nary_tree.c } else if ( 0 == my_node->n_children ) { my_node 306 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_node_type=LEAF_NODE; my_node 308 ompi/patterns/net/netpatterns_nary_tree.c my_node->my_node_type=INTERIOR_NODE; my_node 343 ompi/patterns/net/netpatterns_nary_tree.c static int fill_in_node_data(int tree_order, int num_nodes, int my_node, my_node 364 ompi/patterns/net/netpatterns_nary_tree.c nodes_data[my_node].n_children=num_children; my_node 366 ompi/patterns/net/netpatterns_nary_tree.c nodes_data[my_node].children_ranks=(int *) my_node 368 ompi/patterns/net/netpatterns_nary_tree.c if(!nodes_data[my_node].children_ranks) { my_node 370 ompi/patterns/net/netpatterns_nary_tree.c if ( NULL == nodes_data[my_node].children_ranks ) my_node 379 ompi/patterns/net/netpatterns_nary_tree.c rank = my_node; my_node 384 ompi/patterns/net/netpatterns_nary_tree.c nodes_data[rank].parent_rank=my_node; my_node 394 ompi/patterns/net/netpatterns_nary_tree.c rank=my_node+1+child*num_ranks_per_child; my_node 399 ompi/patterns/net/netpatterns_nary_tree.c nodes_data[rank].parent_rank=my_node; my_node 407 ompi/patterns/net/netpatterns_nary_tree.c nodes_data[my_node].children_ranks[child]=rank; my_node 300 opal/mca/pmix/cray/pmix_cray.c int i, spawned, size, rank, appnum, my_node; my_node 403 opal/mca/pmix/cray/pmix_cray.c pmix_lranks = pmix_cray_parse_pmap(pmapping, pmix_rank, &my_node, &pmix_nlranks); my_node 76 opal/mca/pmix/cray/pmix_cray_pmap_parser.c static int *find_lrs(char *map, int my_node, int *nlrs) my_node 95 opal/mca/pmix/cray/pmix_cray_pmap_parser.c if (base <= my_node && my_node < base + H) { my_node 109 opal/mca/pmix/cray/pmix_cray_pmap_parser.c lrs[*nlrs] = (my_node - base) * L + i + abs_rank; my_node 16 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi2.c static int my_rank, my_node; my_node 69 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi2.c *local_ranks = mca_common_pmi2_parse_pmap(pmapping, my_rank, &my_node, local_cnt); my_node 77 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi2_pmap_parser.c static int *find_lrs(char *map, int my_node, int *nlrs) my_node 96 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi2_pmap_parser.c if (base <= my_node && my_node < base + H) { my_node 110 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi2_pmap_parser.c lrs[*nlrs] = (my_node - base) * L + i + abs_rank; my_node 74 opal/mca/pmix/s2/pmi2_pmap_parser.c static int *find_lrs(char *map, int my_node, int *nlrs) my_node 93 opal/mca/pmix/s2/pmi2_pmap_parser.c if (base <= my_node && my_node < base + H) { my_node 107 opal/mca/pmix/s2/pmi2_pmap_parser.c lrs[*nlrs] = (my_node - base) * L + i + abs_rank; my_node 167 opal/mca/pmix/s2/pmix_s2.c int my_node; my_node 329 opal/mca/pmix/s2/pmix_s2.c s2_lranks = mca_common_pmi2_parse_pmap(pmapping, s2_pname.vpid, &my_node, &s2_nlranks); my_node 27 orte/test/mpi/ziaprobe.c int ppn, my_node; my_node 85 orte/test/mpi/ziaprobe.c my_node = rank / ppn; my_node 87 orte/test/mpi/ziaprobe.c if (0 != (my_node % 2)) { my_node 128 orte/test/mpi/ziaprobe.c if (odd_nnodes && 0 == my_node) {