nb_nodes 592 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_nodes = (size_t *)calloc(tm_topology->nb_levels, sizeof(size_t)); nb_nodes 593 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_nodes[0] = 1; nb_nodes 595 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_nodes[i] = tm_topology->nb_nodes[i-1] * tm_topology->arity[i-1]; nb_nodes 598 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c assert(num_objs_total == (int)tm_topology->nb_nodes[tm_topology->nb_levels-1]); nb_nodes 798 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_nodes = (size_t *)calloc(tm_topology->nb_levels, sizeof(size_t)); nb_nodes 802 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_nodes[i] = nb_objs; nb_nodes 808 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c assert(num_objs_in_node == (int)tm_topology->nb_nodes[tm_topology->nb_levels-1]); nb_nodes 854 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c assert(num_objs_in_node == (int)tm_topology->nb_nodes[tm_topology->nb_levels-1]); nb_nodes 861 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c i, tm_topology->nb_nodes[i],tm_topology->arity[i])); nb_nodes 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]); nb_nodes 467 ompi/mca/topo/treematch/treematch/tm_mapping.c N = topology->nb_nodes[level]; nb_nodes 292 ompi/mca/topo/treematch/treematch/tm_solution.c for( i = 0 ; i < topology->nb_nodes[depth] ; i++){ nb_nodes 26 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_numbering_cpy(tm_topology_t *topology,int **numbering,int *nb_nodes); nb_nodes 200 ompi/mca/topo/treematch/treematch/tm_topology.c unsigned int nb_nodes = topology->nb_proc_units; nb_nodes 205 ompi/mca/topo/treematch/treematch/tm_topology.c for (i = 0; i < nb_nodes; i++){ nb_nodes 210 ompi/mca/topo/treematch/treematch/tm_topology.c for (i = 0; i < nb_nodes; i++){ nb_nodes 211 ompi/mca/topo/treematch/treematch/tm_topology.c if(objs[i]->os_index > nb_nodes){ nb_nodes 214 ompi/mca/topo/treematch/treematch/tm_topology.c i, objs[i]->os_index, nb_nodes); nb_nodes 244 ompi/mca/topo/treematch/treematch/tm_topology.c unsigned int nb_nodes; nb_nodes 287 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_nodes = (size_t*)MALLOC(sizeof(size_t)*res->nb_levels); nb_nodes 295 ompi/mca/topo/treematch/treematch/tm_topology.c nb_nodes = hwloc_get_nbobjs_by_depth(topology, depth); nb_nodes 296 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_nodes[depth] = nb_nodes; nb_nodes 298 ompi/mca/topo/treematch/treematch/tm_topology.c objs = (hwloc_obj_t*)MALLOC(sizeof(hwloc_obj_t)*nb_nodes); nb_nodes 300 ompi/mca/topo/treematch/treematch/tm_topology.c hwloc_get_closest_objs(topology, objs[0], objs+1, nb_nodes-1); nb_nodes 304 ompi/mca/topo/treematch/treematch/tm_topology.c printf("\n--%d(%d) **%d**:--\n",res->arity[depth],nb_nodes,res->arity[0]); nb_nodes 308 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_constraints = nb_nodes; nb_nodes 309 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_proc_units = nb_nodes; nb_nodes 310 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_id = (int*)MALLOC(sizeof(int)*nb_nodes); nb_nodes 311 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_rank = (int*)MALLOC(sizeof(int)*nb_nodes); nb_nodes 344 ompi/mca/topo/treematch/treematch/tm_topology.c int nb_nodes; nb_nodes 371 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_nodes = (size_t*)MALLOC(sizeof(size_t)*res->nb_levels); nb_nodes 378 ompi/mca/topo/treematch/treematch/tm_topology.c nb_nodes = hwloc_get_nbobjs_by_depth(topology, depth); nb_nodes 379 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_nodes[depth] = nb_nodes; nb_nodes 381 ompi/mca/topo/treematch/treematch/tm_topology.c objs = (hwloc_obj_t*)MALLOC(sizeof(hwloc_obj_t)*nb_nodes); nb_nodes 383 ompi/mca/topo/treematch/treematch/tm_topology.c hwloc_get_closest_objs(topology,objs[0],objs+1,nb_nodes-1); nb_nodes 387 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_constraints = nb_nodes; nb_nodes 388 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_proc_units = nb_nodes; nb_nodes 389 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_id = (int*)MALLOC(sizeof(int)*nb_nodes); nb_nodes 390 ompi/mca/topo/treematch/treematch/tm_topology.c res->node_rank = (int*)MALLOC(sizeof(int)*nb_nodes); nb_nodes 415 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->nb_nodes); nb_nodes 446 ompi/mca/topo/treematch/treematch/tm_topology.c for(id = 0; id < topology->nb_nodes[topology->nb_levels-1]/topology->oversub_fact; id++) nb_nodes 487 ompi/mca/topo/treematch/treematch/tm_topology.c if(!in_tab(topology->node_id, topology->nb_nodes[depth], topology->constraints[i])){ nb_nodes 578 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_numbering_cpy(tm_topology_t *topology,int **numbering,int *nb_nodes) nb_nodes 584 ompi/mca/topo/treematch/treematch/tm_topology.c *nb_nodes = topology->nb_nodes[nb_levels-1]; nb_nodes 586 ompi/mca/topo/treematch/treematch/tm_topology.c printf("nb_nodes=%d\n",*nb_nodes); nb_nodes 587 ompi/mca/topo/treematch/treematch/tm_topology.c *numbering = (int*)MALLOC(sizeof(int)*(*nb_nodes)); nb_nodes 588 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*numbering,topology->node_id,sizeof(int)*(*nb_nodes)); nb_nodes 702 ompi/mca/topo/treematch/treematch/tm_topology.c int *numbering = NULL,nb_nodes; nb_nodes 713 ompi/mca/topo/treematch/treematch/tm_topology.c topology_numbering_cpy(*topology,&numbering,&nb_nodes); nb_nodes 719 ompi/mca/topo/treematch/treematch/tm_topology.c new_topo = tm_build_synthetic_topology(arity, NULL, nb_levels,numbering,nb_nodes); nb_nodes 778 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_nodes = (size_t *)MALLOC(sizeof(size_t)*topology->nb_levels); nb_nodes 790 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_nodes[i] = n; nb_nodes 819 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_nodes = (size_t*) MALLOC(sizeof(size_t)*topology->nb_levels); nb_nodes 823 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_nodes[i] = n; nb_nodes 861 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> nb_nodes = (size_t *)REALLOC(topology->nb_nodes, sizeof(size_t)*topology->nb_levels); nb_nodes 865 ompi/mca/topo/treematch/treematch/tm_topology.c n = topology->nb_nodes[i-1] * oversub_fact; nb_nodes 870 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_nodes[i] = n; nb_nodes 20 ompi/mca/topo/treematch/treematch/tm_topology.h void topology_numbering(tm_topology_t *topology,int **numbering,int *nb_nodes); nb_nodes 60 ompi/mca/topo/treematch/treematch/treematch.h size_t *nb_nodes; /* Number of nodes of each level*/