nb_levels 553 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_levels = hierarchies[0]; nb_levels 557 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (hierarchies[i*(TM_MAX_LEVELS+1)] < tm_topology->nb_levels) nb_levels 558 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_levels = hierarchies[i*(TM_MAX_LEVELS+1)]; nb_levels 563 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c int suppl = *base_ptr - tm_topology->nb_levels; nb_levels 565 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c *(base_ptr + tm_topology->nb_levels) *= *(base_ptr + tm_topology->nb_levels + j); nb_levels 569 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_levels += 1; nb_levels 570 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity = (int *)calloc(tm_topology->nb_levels, sizeof(int)); nb_levels 572 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 1; i < tm_topology->nb_levels; i++) { /* compute the minimum for each level */ nb_levels 580 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity = (int *)calloc(tm_topology->nb_levels, sizeof(int)); nb_levels 581 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0; i < tm_topology->nb_levels; i++) nb_levels 586 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0; i < tm_topology->nb_levels; i++) { nb_levels 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_levels 594 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 1 ; i < tm_topology->nb_levels; i++) nb_levels 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_levels 614 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->cost = (double*)calloc(tm_topology->nb_levels,sizeof(double)); nb_levels 668 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "====> nb levels : %i\n",tm_topology->nb_levels); nb_levels 796 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_levels = numlevels; nb_levels 797 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity = (int *)calloc(tm_topology->nb_levels, sizeof(int)); nb_levels 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_levels 800 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0 ; i < tm_topology->nb_levels ; i++){ nb_levels 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_levels 837 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->cost = (double*)calloc(tm_topology->nb_levels,sizeof(double)); nb_levels 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_levels 857 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_levels,num_procs_in_node)); nb_levels 858 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0; i < tm_topology->nb_levels ; i++) { nb_levels 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_levels 880 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "====> nb levels : %i\n",tm_topology->nb_levels)); nb_levels 736 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if ( depth == topology->nb_levels - 1 ){ nb_levels 72 ompi/mca/topo/treematch/treematch/tm_mapping.c while(depth < topology->nb_levels-1) nb_levels 545 ompi/mca/topo/treematch/treematch/tm_mapping.c map_topology(topology, comm_tree, topology->nb_levels-1, sigma, sigma_length ,k, k_length); nb_levels 10 ompi/mca/topo/treematch/treematch/tm_mapping.h tm_topology_t *build_synthetic_topology(int *arity, int nb_levels, int *core_numbering, int nb_core_per_nodes); nb_levels 63 ompi/mca/topo/treematch/treematch/tm_solution.c int depth = topology->nb_levels-1; nb_levels 94 ompi/mca/topo/treematch/treematch/tm_solution.c int depth = topology->nb_levels - 1; nb_levels 131 ompi/mca/topo/treematch/treematch/tm_solution.c int depth = topology->nb_levels - 1; nb_levels 290 ompi/mca/topo/treematch/treematch/tm_solution.c depth = topology->nb_levels-1; nb_levels 13 ompi/mca/topo/treematch/treematch/tm_topology.c void optimize_arity(int **arity, double **cost, int *nb_levels,int n); nb_levels 23 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_arity_cpy(tm_topology_t *topology,int **arity,int *nb_levels); nb_levels 29 ompi/mca/topo/treematch/treematch/tm_topology.c tm_topology_t *tm_build_synthetic_topology(int *arity, double *cost, int nb_levels, int *core_numbering, int nb_core_per_nodes); nb_levels 89 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_levels = atoi(strtok(s," "))+1; nb_levels 90 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity = (int*)MALLOC(sizeof(int)*topology->nb_levels); nb_levels 92 ompi/mca/topo/treematch/treematch/tm_topology.c cost = (double*)CALLOC(topology->nb_levels,sizeof(double)); nb_levels 94 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = 0 ; i < topology->nb_levels-1 ; i++ ){ nb_levels 99 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity[topology->nb_levels-1] = 0; nb_levels 103 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = topology->nb_levels-2 ; i >= 0 ; i-- ) nb_levels 286 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_levels = topodepth; nb_levels 287 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_nodes = (size_t*)MALLOC(sizeof(size_t)*res->nb_levels); nb_levels 288 ompi/mca/topo/treematch/treematch/tm_topology.c res->arity = (int*)MALLOC(sizeof(int)*res->nb_levels); nb_levels 321 ompi/mca/topo/treematch/treematch/tm_topology.c cost = (double*)CALLOC(res->nb_levels,sizeof(double)); nb_levels 322 ompi/mca/topo/treematch/treematch/tm_topology.c for(l=0; l<res->nb_levels; l++){ nb_levels 370 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_levels = topodepth; nb_levels 371 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_nodes = (size_t*)MALLOC(sizeof(size_t)*res->nb_levels); nb_levels 372 ompi/mca/topo/treematch/treematch/tm_topology.c res->arity = (int*)MALLOC(sizeof(int)*res->nb_levels); nb_levels 440 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = 0 ; i < topology->nb_levels ; i++ ){ nb_levels 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_levels 459 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_levels, topology->nb_constraints, topology->oversub_fact, topology->nb_proc_units); nb_levels 466 ompi/mca/topo/treematch/treematch/tm_topology.c for(depth=0; depth < topology->nb_levels; depth++){ nb_levels 485 ompi/mca/topo/treematch/treematch/tm_topology.c int depth = topology->nb_levels-1; nb_levels 580 ompi/mca/topo/treematch/treematch/tm_topology.c int nb_levels; nb_levels 583 ompi/mca/topo/treematch/treematch/tm_topology.c nb_levels = topology->nb_levels; nb_levels 584 ompi/mca/topo/treematch/treematch/tm_topology.c *nb_nodes = topology->nb_nodes[nb_levels-1]; nb_levels 591 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_arity_cpy(tm_topology_t *topology,int **arity,int *nb_levels) nb_levels 593 ompi/mca/topo/treematch/treematch/tm_topology.c *nb_levels = topology->nb_levels; nb_levels 594 ompi/mca/topo/treematch/treematch/tm_topology.c *arity = (int*)MALLOC(sizeof(int)*(*nb_levels)); nb_levels 595 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*arity,topology->arity,sizeof(int)*(*nb_levels)); nb_levels 611 ompi/mca/topo/treematch/treematch/tm_topology.c *cost = (double*)MALLOC(sizeof(double)*(topology->nb_levels)); nb_levels 612 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*cost,topology->cost,sizeof(double)*(topology->nb_levels)); nb_levels 615 ompi/mca/topo/treematch/treematch/tm_topology.c void optimize_arity(int **arity, double **cost, int *nb_levels,int n) nb_levels 636 ompi/mca/topo/treematch/treematch/tm_topology.c (*nb_levels)++; nb_levels 638 ompi/mca/topo/treematch/treematch/tm_topology.c new_arity = (int*)MALLOC(sizeof(int)*(*nb_levels)); nb_levels 639 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost = (double*)MALLOC(sizeof(double)*(*nb_levels)); nb_levels 655 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = n+2 ; i < *nb_levels ; i++){ nb_levels 663 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(&new_arity,&new_cost,nb_levels,n); nb_levels 665 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(&new_arity,&new_cost,nb_levels,n+1); nb_levels 669 ompi/mca/topo/treematch/treematch/tm_topology.c (*nb_levels)++; nb_levels 670 ompi/mca/topo/treematch/treematch/tm_topology.c new_arity = (int*)MALLOC(sizeof(int)*(*nb_levels)); nb_levels 671 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost = (double*)MALLOC(sizeof(double)*(*nb_levels)); nb_levels 681 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = n+2 ; i < *nb_levels ; i++ ){ nb_levels 688 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(&new_arity, &new_cost, nb_levels, n); nb_levels 690 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(&new_arity, &new_cost, nb_levels, n+1); nb_levels 694 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(arity, cost, nb_levels,n-1); nb_levels 701 ompi/mca/topo/treematch/treematch/tm_topology.c int *arity = NULL,nb_levels; nb_levels 712 ompi/mca/topo/treematch/treematch/tm_topology.c topology_arity_cpy(*topology,&arity,&nb_levels); nb_levels 718 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(&arity,&cost,&nb_levels,nb_levels-2); nb_levels 719 ompi/mca/topo/treematch/treematch/tm_topology.c new_topo = tm_build_synthetic_topology(arity, NULL, nb_levels,numbering,nb_nodes); nb_levels 766 ompi/mca/topo/treematch/treematch/tm_topology.c tm_topology_t *tm_build_synthetic_topology(int *arity, double *cost, int nb_levels, int *core_numbering, int nb_core_per_nodes) nb_levels 776 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_levels = nb_levels; nb_levels 777 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity = (int*)MALLOC(sizeof(int)*topology->nb_levels); nb_levels 778 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_nodes = (size_t *)MALLOC(sizeof(size_t)*topology->nb_levels); nb_levels 780 ompi/mca/topo/treematch/treematch/tm_topology.c topology->cost = (double*)CALLOC(topology->nb_levels,sizeof(double)); nb_levels 784 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(topology->arity, arity, sizeof(int)*nb_levels); nb_levels 786 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(topology->cost, cost, sizeof(double)*nb_levels); nb_levels 789 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = 0 ; i < topology->nb_levels ; i++ ){ nb_levels 791 ompi/mca/topo/treematch/treematch/tm_topology.c if (i == topology->nb_levels-1){ nb_levels 806 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = topology->nb_levels-2 ; i >= 0 ; i-- ) nb_levels 819 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_nodes = (size_t*) MALLOC(sizeof(size_t)*topology->nb_levels); nb_levels 821 ompi/mca/topo/treematch/treematch/tm_topology.c for( i = 0 ; i < topology->nb_levels ; i++ ){ nb_levels 825 ompi/mca/topo/treematch/treematch/tm_topology.c if (i == topology->nb_levels-1){ nb_levels 858 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> nb_levels ++; nb_levels 859 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> arity = (int*) REALLOC(topology->arity, sizeof(int)*topology->nb_levels); nb_levels 860 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> cost = (double*) REALLOC(topology->cost, sizeof(double)*topology->nb_levels); nb_levels 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_levels 864 ompi/mca/topo/treematch/treematch/tm_topology.c i = topology->nb_levels - 1; nb_levels 7 ompi/mca/topo/treematch/treematch/tm_topology.h void optimize_arity(int **arity, double **cost, int *nb_levels,int n); nb_levels 17 ompi/mca/topo/treematch/treematch/tm_topology.h void topology_arity(tm_topology_t *topology,int **arity,int *nb_levels); nb_levels 2010 ompi/mca/topo/treematch/treematch/tm_tree.c if( depth == topology->nb_levels-1) { nb_levels 2204 ompi/mca/topo/treematch/treematch/tm_tree.c depth = topology->nb_levels; nb_levels 59 ompi/mca/topo/treematch/treematch/treematch.h int nb_levels; /* Number of levels of the tree. Levels are numbered from top to bottom starting at 0*/ nb_levels 139 ompi/mca/topo/treematch/treematch/treematch.h tm_topology_t *tm_build_synthetic_topology(int *arity, double *cost, int nb_levels, int *core_numbering, int nb_core_per_nodes); nb_levels 1320 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-x86.c if (topology->nb_levels == 2 && topology->level_nbobjects[1] == data->nbprocs) { nb_levels 920 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c new->nb_levels = old->nb_levels; nb_levels 921 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(new->nb_levels_allocated >= new->nb_levels); nb_levels 922 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(i=1 /* root level already allocated */ ; i<new->nb_levels; i++) { nb_levels 2225 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(i=topology->nb_levels-1; i>0; i--) { nb_levels 2345 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c (topology->nb_levels-i)*sizeof(topology->levels[i])); nb_levels 2348 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c (topology->nb_levels-i)*sizeof(topology->level_nbobjects[i])); nb_levels 2356 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c (topology->nb_levels-1-i)*sizeof(topology->levels[i])); nb_levels 2359 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c (topology->nb_levels-1-i)*sizeof(topology->level_nbobjects[i])); nb_levels 2363 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->level_nbobjects[topology->nb_levels-1] = 0; nb_levels 2364 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->levels[topology->nb_levels-1] = NULL; nb_levels 2365 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->nb_levels--; nb_levels 2373 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(i=0; i<topology->nb_levels; i++) { nb_levels 2450 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(i=0; i<topology->nb_levels; i++) nb_levels 2745 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(l=1; l<topology->nb_levels; l++) nb_levels 2747 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c memset(topology->levels+1, 0, (topology->nb_levels-1)*sizeof(*topology->levels)); nb_levels 2748 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c memset(topology->level_nbobjects+1, 0, (topology->nb_levels-1)*sizeof(*topology->level_nbobjects)); nb_levels 2749 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->nb_levels = 1; nb_levels 2834 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c taken_objs[i]->depth = (int) topology->nb_levels; nb_levels 2846 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c hwloc_debug(" has number %u\n\n", topology->nb_levels); nb_levels 2849 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->type_depth[top_obj->type] = (int) topology->nb_levels; nb_levels 2855 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (topology->nb_levels == topology->nb_levels_allocated) { nb_levels 2887 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->level_nbobjects[topology->nb_levels] = n_taken_objs; nb_levels 2888 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->levels[topology->nb_levels] = taken_objs; nb_levels 2890 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->nb_levels++; nb_levels 3196 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c topology->nb_levels = 1; /* there's at least SYSTEM */ nb_levels 3507 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for (l=0; l<topology->nb_levels; l++) nb_levels 3801 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c return (int) topology->nb_levels; nb_levels 31 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c if ((unsigned)depth >= topology->nb_levels) nb_levels 77 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c if ((unsigned)depth >= topology->nb_levels) { nb_levels 90 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c if ((unsigned)depth >= topology->nb_levels) { nb_levels 391 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c for(l=0; l<topology->nb_levels; l++) { nb_levels 53 opal/mca/hwloc/hwloc201/hwloc/include/private/private.h unsigned nb_levels; /* Number of horizontal levels */