node_rank 105 ompi/mca/osc/rdma/osc_rdma_peer.c int node_id, node_rank, array_index; node_rank 122 ompi/mca/osc/rdma/osc_rdma_peer.c node_rank = NODE_ID_TO_RANK(module, array_peer_data, node_id); node_rank 128 ompi/mca/osc/rdma/osc_rdma_peer.c array_endpoint = ompi_osc_rdma_peer_btl_endpoint (module, node_rank); node_rank 134 ompi/mca/osc/rdma/osc_rdma_peer.c ", size: %lu", peer->rank, node_rank, array_index, array_pointer, sizeof (rank_data)); node_rank 602 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_rank = (int *)malloc(num_objs_total*sizeof(int)); node_rank 604 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id[i] = tm_topology->node_rank[i] = -1; node_rank 610 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_rank[obj_mapping[i]] = i; /* after computation by TreeMatch */ node_rank 824 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_rank = (int *)malloc(num_objs_in_node*sizeof(int)); node_rank 826 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id[i] = tm_topology->node_rank[i] = -1; node_rank 833 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_rank[obj_to_rank_in_lcomm[i]] = i; node_rank 65 ompi/mca/topo/treematch/treematch/tm_solution.c f_i = topology->node_rank[i]; node_rank 66 ompi/mca/topo/treematch/treematch/tm_solution.c f_j = topology->node_rank[j]; node_rank 82 ompi/mca/topo/treematch/treematch/tm_solution.c printf("distance(%d,%d):%d\n",topology->node_rank[i], topology->node_rank[j], level); node_rank 207 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_rank[i] = i; node_rank 227 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_rank[objs[i]->os_index] = i; node_rank 311 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_rank = (int*)MALLOC(sizeof(int)*nb_nodes); node_rank 390 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_rank = (int*)MALLOC(sizeof(int)*nb_nodes); node_rank 413 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->node_rank); node_rank 447 ompi/mca/topo/treematch/treematch/tm_topology.c printf("%d ",topology->node_rank[id]); node_rank 793 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_rank = (int*)MALLOC(sizeof(int)*n); node_rank 799 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_rank[id] = j; node_rank 826 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_rank = (int*)MALLOC(sizeof(int)*n); node_rank 839 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_rank[j] = j; node_rank 853 ompi/mca/topo/treematch/treematch/tm_topology.c int *node_id, *node_rank; node_rank 869 ompi/mca/topo/treematch/treematch/tm_topology.c node_rank = (int*)MALLOC(sizeof(int)*n); node_rank 875 ompi/mca/topo/treematch/treematch/tm_topology.c node_rank[id] = j; node_rank 878 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->node_rank); node_rank 880 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_rank = node_rank; node_rank 2252 ompi/mca/topo/treematch/treematch/tm_tree.c (*constraints)[i] = topology->node_rank[topology->constraints[i/topology->oversub_fact]] +shift; node_rank 63 ompi/mca/topo/treematch/treematch/treematch.h int *node_rank ; /* Rank of the nodes of the tree for the last level given its ID: this is the inverse tab of node_id*/ node_rank 40 ompi/patterns/comm/bcast.c int node_rank, peer_rank; node_rank 46 ompi/patterns/comm/bcast.c node_rank=(my_rank_in_group-root+n_peers)%n_peers; node_rank 51 ompi/patterns/comm/bcast.c rc=ompi_netpatterns_setup_narray_tree(2, node_rank, n_peers, node_rank 38 ompi/patterns/net/netpatterns_knomial_tree.c int num_nodes, int node_rank, int tree_order, int *hier_ranks, node_rank 57 ompi/patterns/net/netpatterns_knomial_tree.c num_nodes, node_rank, tree_order)); node_rank 175 ompi/patterns/net/netpatterns_knomial_tree.c if( node_rank == exchange_node->reindex_map[i] ){ node_rank 280 ompi/patterns/net/netpatterns_knomial_tree.c if( node_rank == myid ){ node_rank 324 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->payload_info[i][j].s_len = prev_data[node_rank]; node_rank 536 ompi/patterns/net/netpatterns_knomial_tree.c int num_nodes, int node_rank, int tree_order, node_rank 546 ompi/patterns/net/netpatterns_knomial_tree.c num_nodes, node_rank, tree_order)); node_rank 579 ompi/patterns/net/netpatterns_knomial_tree.c if (node_rank + 1 > cnt) { node_rank 591 ompi/patterns/net/netpatterns_knomial_tree.c for (i = 0, tmp = node_rank * (tree_order - 1) + cnt + i; node_rank 605 ompi/patterns/net/netpatterns_knomial_tree.c for (i = 0, tmp = node_rank * (tree_order - 1) + cnt; node_rank 619 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->rank_extra_sources_array[0] = (node_rank - cnt) / (tree_order - 1); node_rank 644 ompi/patterns/net/netpatterns_knomial_tree.c k_base = node_rank / (kpow_num * tree_order); node_rank 646 ompi/patterns/net/netpatterns_knomial_tree.c peer = node_rank + kpow_num * j; node_rank 701 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order, node_rank 709 ompi/patterns/net/netpatterns_knomial_tree.c NETPATTERNS_VERBOSE(("Enter ompi_netpatterns_setup_recursive_doubling_n_tree_node(num_nodes=%d, node_rank=%d, tree_order=%d)", num_nodes, node_rank, tree_order)); node_rank 756 ompi/patterns/net/netpatterns_knomial_tree.c if ( node_rank + 1 > cnt ) { node_rank 767 ompi/patterns/net/netpatterns_knomial_tree.c for (tmp = node_rank + cnt; tmp < num_nodes; tmp += cnt) { node_rank 776 ompi/patterns/net/netpatterns_knomial_tree.c for (i = 0, tmp = node_rank + cnt; tmp < num_nodes; ++i, tmp += cnt) { node_rank 789 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->rank_extra_sources_array[0] = node_rank & (cnt - 1); node_rank 790 ompi/patterns/net/netpatterns_knomial_tree.c NETPATTERNS_VERBOSE(("extra_source#%d = %d", 0, node_rank & (cnt - 1))); node_rank 812 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->rank_exchanges[i] = node_rank ^ (mask * shift); node_rank 813 ompi/patterns/net/netpatterns_knomial_tree.c NETPATTERNS_VERBOSE(("rank_exchanges#%d/%d = %d", i, tree_order, node_rank ^ (mask * shift))); node_rank 856 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_tree_node(int num_nodes, int node_rank, node_rank 859 ompi/patterns/net/netpatterns_knomial_tree.c return ompi_netpatterns_setup_recursive_doubling_n_tree_node(num_nodes, node_rank, 2, exchange_node); node_rank 864 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank,int tree_order, node_rank 902 ompi/patterns/net/netpatterns_knomial_tree.c if( node_rank+1 > cnt ) { node_rank 915 ompi/patterns/net/netpatterns_knomial_tree.c if( node_rank < n_extra_nodes ) { node_rank 917 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->rank_extra_source=cnt+node_rank; node_rank 925 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->rank_extra_source=node_rank-cnt; node_rank 940 ompi/patterns/net/netpatterns_knomial_tree.c tmp=node_rank; node_rank 944 ompi/patterns/net/netpatterns_knomial_tree.c node_rank-result; node_rank 947 ompi/patterns/net/netpatterns_knomial_tree.c node_rank+result; node_rank 114 ompi/patterns/net/netpatterns_knomial_tree.h OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order, node_rank 120 ompi/patterns/net/netpatterns_knomial_tree.h OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_tree_node(int num_nodes, int node_rank, node_rank 124 ompi/patterns/net/netpatterns_knomial_tree.h int num_nodes, int node_rank, int tree_order, node_rank 131 ompi/patterns/net/netpatterns_knomial_tree.h int num_nodes, int node_rank, int tree_order, int *hier_ranks, node_rank 544 orte/mca/rmaps/base/rmaps_base_map_job.c (unsigned long)proc->node_rank, tmp1); node_rank 795 orte/mca/rmaps/base/rmaps_base_ranking.c if (ORTE_NODE_RANK_INVALID == proc->node_rank && node_rank 810 orte/mca/rmaps/base/rmaps_base_ranking.c psave2->node_rank = node->next_node_rank; node_rank 847 orte/mca/rmaps/base/rmaps_base_ranking.c orte_node_rank_t node_rank; node_rank 865 orte/mca/rmaps/base/rmaps_base_ranking.c node_rank = 0; node_rank 872 orte/mca/rmaps/base/rmaps_base_ranking.c if (node_rank == proc->node_rank) { node_rank 873 orte/mca/rmaps/base/rmaps_base_ranking.c node_rank++; node_rank 877 orte/mca/rmaps/base/rmaps_base_ranking.c newproc->node_rank = node_rank; node_rank 1266 orte/mca/schizo/ompi/schizo_ompi.c if (ORTE_NODE_RANK_INVALID == child->node_rank) { node_rank 1271 orte/mca/schizo/ompi/schizo_ompi.c opal_asprintf(&value, "%lu", (unsigned long) child->node_rank); node_rank 597 orte/orted/orted_main.c proc->node_rank = 0; node_rank 963 orte/orted/pmix/pmix_server_gen.c proc->node_rank = 0; node_rank 471 orte/orted/pmix/pmix_server_register_fns.c kv->data.uint32 = pptr->node_rank; node_rank 373 orte/runtime/data_type_support/orte_dt_packing_fns.c (void*)(&(procs[i]->node_rank)), 1, ORTE_NODE_RANK))) { node_rank 512 orte/runtime/data_type_support/orte_dt_print_fns.c (long)src->pid, (unsigned long)src->local_rank, (unsigned long)src->node_rank, src->app_rank); node_rank 398 orte/runtime/data_type_support/orte_dt_unpacking_fns.c (&(procs[i]->node_rank)), &n, ORTE_NODE_RANK))) { node_rank 499 orte/runtime/orte_globals.c return proct->node_rank; node_rank 793 orte/runtime/orte_globals.c proc->node_rank = ORTE_NODE_RANK_INVALID; node_rank 392 orte/runtime/orte_globals.h orte_node_rank_t node_rank;