node_id 187 ompi/mca/osc/rdma/osc_rdma.h int node_id; node_id 948 ompi/mca/osc/rdma/osc_rdma_component.c temp[my_rank].node_id = module->node_id; node_id 1055 ompi/mca/osc/rdma/osc_rdma_component.c module->node_id = values[1]; node_id 25 ompi/mca/osc/rdma/osc_rdma_peer.c #define NODE_ID_TO_RANK(module, peer_data, node_id) ((int)(peer_data)->len) node_id 105 ompi/mca/osc/rdma/osc_rdma_peer.c int node_id, node_rank, array_index; node_id 118 ompi/mca/osc/rdma/osc_rdma_peer.c node_id = peer->rank / RANK_ARRAY_COUNT(module); node_id 119 ompi/mca/osc/rdma/osc_rdma_peer.c array_peer_data = (ompi_osc_rdma_region_t *) ((intptr_t) module->node_comm_info + node_id * module->region_size); node_id 122 ompi/mca/osc/rdma/osc_rdma_peer.c node_rank = NODE_ID_TO_RANK(module, array_peer_data, node_id); node_id 145 ompi/mca/osc/rdma/osc_rdma_peer.c node_peer_data = (ompi_osc_rdma_region_t *) ((intptr_t) module->node_comm_info + rank_data.node_id * module->region_size); node_id 153 ompi/mca/osc/rdma/osc_rdma_peer.c peer->state_endpoint = ompi_osc_rdma_peer_btl_endpoint (module, NODE_ID_TO_RANK(module, node_peer_data, rank_data.node_id)); node_id 116 ompi/mca/osc/rdma/osc_rdma_peer.h unsigned int node_id; node_id 601 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id = (int *)malloc(num_objs_total*sizeof(int)); node_id 604 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id[i] = tm_topology->node_rank[i] = -1; node_id 608 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id[i] = obj_mapping[i]; /* use process ranks instead of core numbers */ node_id 823 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id = (int *)malloc(num_objs_in_node*sizeof(int)); node_id 826 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id[i] = tm_topology->node_rank[i] = -1; node_id 831 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->node_id[i] = obj_to_rank_in_lcomm[i]; node_id 864 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "", "Obj id ", tm_topology->node_id, tm_topology->nb_nodes[tm_topology->nb_levels-1]); node_id 466 ompi/mca/topo/treematch/treematch/tm_mapping.c nodes_id = topology->node_id; node_id 294 ompi/mca/topo/treematch/treematch/tm_solution.c if((!topology->constraints) || (in_tab(topology->constraints, topology->nb_constraints, topology->node_id[i]))){ node_id 296 ompi/mca/topo/treematch/treematch/tm_solution.c printf ("%lu: %d -> %d\n", i, j, topology->node_id[i]); node_id 297 ompi/mca/topo/treematch/treematch/tm_solution.c sigma[j++]=topology->node_id[i]; node_id 337 ompi/mca/topo/treematch/treematch/tm_solution.c nodes_id = topology->node_id; node_id 206 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_id[i] = i; node_id 219 ompi/mca/topo/treematch/treematch/tm_topology.c if((unsigned int)topology->node_id[j] == objs[i]->os_index){ node_id 226 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_id[i] = objs[i]->os_index; node_id 310 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_id = (int*)MALLOC(sizeof(int)*nb_nodes); node_id 389 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_id = (int*)MALLOC(sizeof(int)*nb_nodes); node_id 412 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->node_id); node_id 487 ompi/mca/topo/treematch/treematch/tm_topology.c if(!in_tab(topology->node_id, topology->nb_nodes[depth], topology->constraints[i])){ node_id 588 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*numbering,topology->node_id,sizeof(int)*(*nb_nodes)); node_id 792 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_id = (int*)MALLOC(sizeof(int)*n); node_id 798 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_id[j] = id; node_id 827 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_id = (int*)MALLOC(sizeof(int)*n); node_id 828 ompi/mca/topo/treematch/treematch/tm_topology.c if ( !topology->node_id ){ node_id 838 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_id[j] = j; node_id 853 ompi/mca/topo/treematch/treematch/tm_topology.c int *node_id, *node_rank; node_id 868 ompi/mca/topo/treematch/treematch/tm_topology.c node_id = (int*)MALLOC(sizeof(int)*n); node_id 873 ompi/mca/topo/treematch/treematch/tm_topology.c int id = topology->node_id[j/oversub_fact]; node_id 874 ompi/mca/topo/treematch/treematch/tm_topology.c node_id[j] = id; node_id 877 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->node_id); node_id 879 ompi/mca/topo/treematch/treematch/tm_topology.c topology->node_id = node_id; node_id 62 ompi/mca/topo/treematch/treematch/treematch.h int *node_id; /* ID of the nodes of the tree of the last level*/ node_id 239 opal/mca/hwloc/base/base.h size_t count, int node_id); node_id 133 opal/mca/hwloc/base/hwloc_base_maffinity.c size_t count, int node_id) node_id 153 opal/mca/hwloc/base/hwloc_base_maffinity.c hwloc_bitmap_set(cpuset, node_id); node_id 376 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-x86.c unsigned apic_id, node_id, nodes_per_proc; node_id 387 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-x86.c node_id = 0; node_id 390 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-x86.c node_id = ecx & 0xff; node_id 393 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-x86.c infos->nodeid = node_id; node_id 403 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-x86.c hwloc_debug("topoext %08x, %u nodes, node %u, %u cores in unit %u\n", apic_id, nodes_per_proc, node_id, cores_per_unit, unit_id); node_id 412 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-x86.c hwloc_debug("topoext %08x, %u nodes, node %u, %u threads in core %u\n", apic_id, nodes_per_proc, node_id, threads_per_core, core_id); node_id 349 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define netloc_topology_find_node(topology,node_id,node) \ node_id 350 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h HASH_FIND_STR(topology->nodes, node_id, node)