arity 351 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c i, tracker[i]->arity, tracker[i]->depth)); arity 512 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c hierarchies[i+1] = tracker[i]->arity; arity 570 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity = (int *)calloc(tm_topology->nb_levels, sizeof(int)); arity 571 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity[0] = num_nodes; arity 577 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity[i] = min; arity 580 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity = (int *)calloc(tm_topology->nb_levels, sizeof(int)); arity 582 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity[i] = hierarchies[i+1]; arity 588 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "topo_arity[%i] = %i\n", i, tm_topology->arity[i])); arity 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]; arity 797 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity = (int *)calloc(tm_topology->nb_levels, sizeof(int)); arity 803 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity[i] = tracker[i]->arity; arity 861 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c i, tm_topology->nb_nodes[i],tm_topology->arity[i])); arity 467 ompi/mca/topo/treematch/treematch/tm_bucket.c int try_add_edge(tm_tree_t *tab_node, tm_tree_t *parent,int arity,int i,int j,int *nb_groups) arity 471 ompi/mca/topo/treematch/treematch/tm_bucket.c switch(arity){ arity 490 ompi/mca/topo/treematch/treematch/tm_bucket.c fprintf(stderr,"Cannot handle arity %d\n",parent->arity); arity 539 ompi/mca/topo/treematch/treematch/tm_bucket.c int arity,int M) arity 579 ompi/mca/topo/treematch/treematch/tm_bucket.c if(try_add_edge(tab_node,&new_tab_node[l],arity,i,j,&nb_groups)){ arity 587 ompi/mca/topo/treematch/treematch/tm_bucket.c if(try_add_edge(tab_node,&new_tab_node[l],arity,i,j,&nb_groups)){ arity 603 ompi/mca/topo/treematch/treematch/tm_bucket.c try_add_edge(tab_node,NULL,arity,i,j,&nb_groups); arity 32 ompi/mca/topo/treematch/treematch/tm_bucket.h int arity,int M); arity 33 ompi/mca/topo/treematch/treematch/tm_bucket.h int try_add_edge(tm_tree_t *tab_node, tm_tree_t *parent,int arity,int i,int j,int *nb_groups); arity 726 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int k = topology->arity[depth]; arity 73 ompi/mca/topo/treematch/treematch/tm_mapping.c res *= topology->arity[depth++]; arity 409 ompi/mca/topo/treematch/treematch/tm_mapping.c for( j = 0 ; j < comm_tree->arity ; j++ ) arity 420 ompi/mca/topo/treematch/treematch/tm_mapping.c for( j = 0 ; j < comm_tree->arity ; j++) arity 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); arity 60 ompi/mca/topo/treematch/treematch/tm_solution.c int arity; arity 74 ompi/mca/topo/treematch/treematch/tm_solution.c arity = topology->arity[level]; arity 75 ompi/mca/topo/treematch/treematch/tm_solution.c if( arity == 0 ) arity 76 ompi/mca/topo/treematch/treematch/tm_solution.c arity = 1; arity 77 ompi/mca/topo/treematch/treematch/tm_solution.c f_i = f_i/arity; arity 78 ompi/mca/topo/treematch/treematch/tm_solution.c f_j = f_j/arity; arity 13 ompi/mca/topo/treematch/treematch/tm_topology.c void optimize_arity(int **arity, double **cost, int *nb_levels,int n); arity 23 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_arity_cpy(tm_topology_t *topology,int **arity,int *nb_levels); arity 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); arity 90 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity = (int*)MALLOC(sizeof(int)*topology->nb_levels); arity 95 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity[i] = atoi(strtok(NULL," ")); arity 99 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity[topology->nb_levels-1] = 0; arity 179 ompi/mca/topo/treematch/treematch/tm_topology.c unsigned int arity; arity 184 ompi/mca/topo/treematch/treematch/tm_topology.c arity = obj->arity; arity 189 ompi/mca/topo/treematch/treematch/tm_topology.c if( obj->arity != arity){ arity 288 ompi/mca/topo/treematch/treematch/tm_topology.c res->arity = (int*)MALLOC(sizeof(int)*res->nb_levels); arity 301 ompi/mca/topo/treematch/treematch/tm_topology.c res->arity[depth] = objs[0]->arity; arity 304 ompi/mca/topo/treematch/treematch/tm_topology.c printf("\n--%d(%d) **%d**:--\n",res->arity[depth],nb_nodes,res->arity[0]); arity 372 ompi/mca/topo/treematch/treematch/tm_topology.c res->arity = (int*)MALLOC(sizeof(int)*res->nb_levels); arity 384 ompi/mca/topo/treematch/treematch/tm_topology.c res->arity[depth] = objs[0]->arity; arity 416 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->arity); arity 441 ompi/mca/topo/treematch/treematch/tm_topology.c printf("Level %d with arity %d ", i, topology->arity[i]); arity 467 ompi/mca/topo/treematch/treematch/tm_topology.c printf("%d",topology->arity[depth]); arity 591 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_arity_cpy(tm_topology_t *topology,int **arity,int *nb_levels) arity 594 ompi/mca/topo/treematch/treematch/tm_topology.c *arity = (int*)MALLOC(sizeof(int)*(*nb_levels)); arity 595 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*arity,topology->arity,sizeof(int)*(*nb_levels)); arity 615 ompi/mca/topo/treematch/treematch/tm_topology.c void optimize_arity(int **arity, double **cost, int *nb_levels,int n) arity 629 ompi/mca/topo/treematch/treematch/tm_topology.c a = (*arity)[n]; arity 642 ompi/mca/topo/treematch/treematch/tm_topology.c new_arity[i] = (*arity)[i]; arity 656 ompi/mca/topo/treematch/treematch/tm_topology.c new_arity[i] = (*arity)[i-1]; arity 659 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(*arity); arity 666 ompi/mca/topo/treematch/treematch/tm_topology.c *arity=new_arity; arity 673 ompi/mca/topo/treematch/treematch/tm_topology.c new_arity[i] = (*arity)[i]; arity 682 ompi/mca/topo/treematch/treematch/tm_topology.c new_arity[i] = (*arity)[i-1]; arity 685 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(*arity); arity 691 ompi/mca/topo/treematch/treematch/tm_topology.c *arity = new_arity; arity 694 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(arity, cost, nb_levels,n-1); arity 701 ompi/mca/topo/treematch/treematch/tm_topology.c int *arity = NULL,nb_levels; arity 712 ompi/mca/topo/treematch/treematch/tm_topology.c topology_arity_cpy(*topology,&arity,&nb_levels); arity 718 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(&arity,&cost,&nb_levels,nb_levels-2); arity 719 ompi/mca/topo/treematch/treematch/tm_topology.c new_topo = tm_build_synthetic_topology(arity, NULL, nb_levels,numbering,nb_nodes); arity 738 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(arity); arity 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) arity 777 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity = (int*)MALLOC(sizeof(int)*topology->nb_levels); arity 784 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(topology->arity, arity, sizeof(int)*nb_levels); arity 802 ompi/mca/topo/treematch/treematch/tm_topology.c n *= topology->arity[i]; arity 843 ompi/mca/topo/treematch/treematch/tm_topology.c n *= topology->arity[i]; arity 859 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> arity = (int*) REALLOC(topology->arity, sizeof(int)*topology->nb_levels); arity 866 ompi/mca/topo/treematch/treematch/tm_topology.c topology->arity[i-1] = oversub_fact; arity 7 ompi/mca/topo/treematch/treematch/tm_topology.h void optimize_arity(int **arity, double **cost, int *nb_levels,int n); arity 17 ompi/mca/topo/treematch/treematch/tm_topology.h void topology_arity(tm_topology_t *topology,int **arity,int *nb_levels); arity 123 ompi/mca/topo/treematch/treematch/tm_tree.c for(i=0;i<tree->arity;i++) arity 159 ompi/mca/topo/treematch/treematch/tm_tree.c for(i=0;i<tree->arity;i++) arity 177 ompi/mca/topo/treematch/treematch/tm_tree.c void set_node(tm_tree_t *node, tm_tree_t ** child, int arity, tm_tree_t *parent, arity 182 ompi/mca/topo/treematch/treematch/tm_tree.c node->arity = arity; arity 196 ompi/mca/topo/treematch/treematch/tm_tree.c (void *)(node->child), node->arity, (void *)(node->parent), node->id, node->val, node->uniq); arity 206 ompi/mca/topo/treematch/treematch/tm_tree.c new->arity = old->arity; arity 211 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < new->arity ; i++ ) arity 228 ompi/mca/topo/treematch/treematch/tm_tree.c for( i1 = 0 ; i1 < new_tab_node[i].arity ; i1++ ){ arity 263 ompi/mca/topo/treematch/treematch/tm_tree.c for( i1 = 0 ; i1 < tab_node[i].arity ; i1++ ){ arity 265 ompi/mca/topo/treematch/treematch/tm_tree.c for( j1 = 0 ; j1 < tab_node[j].arity ; j1++ ){ arity 345 ompi/mca/topo/treematch/treematch/tm_tree.c for( i1 = 0 ; i1 < tab_node[i].arity ; i1++ ){ arity 347 ompi/mca/topo/treematch/treematch/tm_tree.c for( j1 = 0 ; j1 < tab_node[j].arity ; j1++ ){ arity 406 ompi/mca/topo/treematch/treematch/tm_tree.c double eval_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t **cur_group, int arity) arity 415 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < arity ; i++ ){ arity 420 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < arity ; i++ ){ arity 422 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < arity ; j++ ){ arity 446 ompi/mca/topo/treematch/treematch/tm_tree.c void add_to_list(group_list_t *list, tm_tree_t **cur_group, int arity, double val) arity 452 ompi/mca/topo/treematch/treematch/tm_tree.c tab=(tm_tree_t **)MALLOC(sizeof(tm_tree_t *)*arity); arity 454 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < arity ; i++ ){ arity 469 ompi/mca/topo/treematch/treematch/tm_tree.c void list_all_possible_groups(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, int id, int arity, int depth, arity 476 ompi/mca/topo/treematch/treematch/tm_tree.c if(depth == arity){ arity 477 ompi/mca/topo/treematch/treematch/tm_tree.c val = eval_grouping(aff_mat, cur_group, arity); arity 478 ompi/mca/topo/treematch/treematch/tm_tree.c add_to_list(list, cur_group, arity, val); arity 480 ompi/mca/topo/treematch/treematch/tm_tree.c }else if( (mat_order+depth) >= (arity+id) ){ arity 488 ompi/mca/topo/treematch/treematch/tm_tree.c list_all_possible_groups(aff_mat, tab_node, i+1, arity, depth+1, cur_group, list); arity 497 ompi/mca/topo/treematch/treematch/tm_tree.c parent->val = eval_grouping(aff_mat, parent->child, parent->arity); arity 511 ompi/mca/topo/treematch/treematch/tm_tree.c int independent_groups(group_list_t **selection, int d, group_list_t *elem, int arity) arity 518 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < arity ; i++ ) arity 520 ompi/mca/topo/treematch/treematch/tm_tree.c for( k = 0 ; k < arity ; k++ ) arity 528 ompi/mca/topo/treematch/treematch/tm_tree.c void display_selection (group_list_t** selection, int M, int arity, double val) arity 538 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < arity ; j++ ) arity 547 ompi/mca/topo/treematch/treematch/tm_tree.c void display_grouping (tm_tree_t *father, int M, int arity, double val) arity 556 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < arity ; j++ ) arity 564 ompi/mca/topo/treematch/treematch/tm_tree.c int recurs_select_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection) arity 574 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(selection, M, arity, val); arity 586 ompi/mca/topo/treematch/treematch/tm_tree.c if(independent_groups(selection, d, elem, arity)){ arity 591 ompi/mca/topo/treematch/treematch/tm_tree.c return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection); arity 600 ompi/mca/topo/treematch/treematch/tm_tree.c int test_independent_groups(group_list_t **tab, int i, int n, int arity, int d, int M, double val, double *best_val, group_list_t **selection, group_list_t **best_selection) arity 611 ompi/mca/topo/treematch/treematch/tm_tree.c if(independent_groups(selection, d, elem, arity)){ arity 615 ompi/mca/topo/treematch/treematch/tm_tree.c return recurs_select_independent_groups(tab, i+1, n, arity, d+1, M, val, best_val, selection, best_selection); arity 682 ompi/mca/topo/treematch/treematch/tm_tree.c int select_independent_groups(group_list_t **tab_group, int n, int arity, int M, double *best_val, arity 692 ompi/mca/topo/treematch/treematch/tm_tree.c for(j=0;j<arity;j++){ arity 707 ompi/mca/topo/treematch/treematch/tm_tree.c recurs_select_independent_groups(tab_group, i+1, n, arity, 1, M, val, best_val, selection, best_selection); arity 721 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(best_selection, M, arity, *best_val); arity 726 ompi/mca/topo/treematch/treematch/tm_tree.c static int8_t** init_independent_group_mat(int n, group_list_t **tab_group, int arity){ arity 737 ompi/mca/topo/treematch/treematch/tm_tree.c for( ii = 0 ; ii < arity ; ii++ ){ arity 738 ompi/mca/topo/treematch/treematch/tm_tree.c for( jj = 0 ; jj < arity ; jj++ ){ arity 777 ompi/mca/topo/treematch/treematch/tm_tree.c static int thread_derecurs_exhaustive_search(group_list_t **tab_group, int i, int nb_groups, int arity, int depth, int solution_size, arity 791 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(selection, solution_size, arity, val); arity 930 ompi/mca/topo/treematch/treematch/tm_tree.c int arity = *(int*) args[2]; arity 999 ompi/mca/topo/treematch/treematch/tm_tree.c thread_derecurs_exhaustive_search(tab_group, id+1, n, arity, work->nb_groups, solution_size, val, best_val, selection, best_selection, indep_mat, lock, thread_id, tab_i, work->nb_groups); arity 1124 ompi/mca/topo/treematch/treematch/tm_tree.c static int thread_exhaustive_search(group_list_t **tab_group, int nb_groups, int arity, int solution_size, double *best_val, arity 1149 ompi/mca/topo/treematch/treematch/tm_tree.c for(j=0;j<arity;j++){ arity 1176 ompi/mca/topo/treematch/treematch/tm_tree.c indep_mat = init_independent_group_mat(nb_groups, tab_group, arity); arity 1182 ompi/mca/topo/treematch/treematch/tm_tree.c args[2]=(void*)&arity; arity 1220 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(best_selection, solution_size, arity, *best_val); arity 1230 ompi/mca/topo/treematch/treematch/tm_tree.c static int old_recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat) arity 1238 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(selection, solution_size, arity, val); arity 1260 ompi/mca/topo/treematch/treematch/tm_tree.c old_recurs_exhaustive_search(tab, i+1, n, arity, d+1, solution_size, val, best_val, selection, best_selection, indep_mat); arity 1272 ompi/mca/topo/treematch/treematch/tm_tree.c static int recurs_exhaustive_search(group_list_t **tab, int i, int n, int arity, int d, int solution_size, double val, double *best_val, group_list_t **selection, group_list_t **best_selection, int8_t **indep_mat, int* tab_i) arity 1279 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(selection, solution_size, arity, val); arity 1325 ompi/mca/topo/treematch/treematch/tm_tree.c static int exhaustive_search(group_list_t **tab_group, int n, int arity, int solution_size, double *best_val, arity 1342 ompi/mca/topo/treematch/treematch/tm_tree.c for(j=0;j<arity;j++){ arity 1351 ompi/mca/topo/treematch/treematch/tm_tree.c indep_mat = init_independent_group_mat(n, tab_group, arity); arity 1362 ompi/mca/topo/treematch/treematch/tm_tree.c old_recurs_exhaustive_search(tab_group, i+1, n, arity, 1, solution_size, val, best_val, selection, best_selection, indep_mat); arity 1378 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(best_selection, solution_size, arity, *best_val); arity 1388 ompi/mca/topo/treematch/treematch/tm_tree.c int select_independent_groups_by_largest_index(group_list_t **tab_group, int n, int arity, int solution_size, double *best_val, group_list_t **best_selection, int bound, double max_duration) arity 1402 ompi/mca/topo/treematch/treematch/tm_tree.c nb_groups += test_independent_groups(tab_group, i+1, n, arity, 1, solution_size, val, best_val, selection, best_selection); arity 1423 ompi/mca/topo/treematch/treematch/tm_tree.c display_selection(best_selection, solution_size, arity, *best_val); arity 1448 ompi/mca/topo/treematch/treematch/tm_tree.c void display_tab_group(group_list_t **tab, int n, int arity) arity 1454 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < arity ; j++ ) arity 1460 ompi/mca/topo/treematch/treematch/tm_tree.c int independent_tab(tm_tree_t **tab1, tm_tree_t **tab2, int arity) arity 1463 ompi/mca/topo/treematch/treematch/tm_tree.c for( ii = 0 ; ii < arity ; ii++ ){ arity 1464 ompi/mca/topo/treematch/treematch/tm_tree.c for( jj = 0 ; jj < arity ; jj++ ){ arity 1473 ompi/mca/topo/treematch/treematch/tm_tree.c void compute_weighted_degree(group_list_t **tab, int n, int arity) arity 1482 ompi/mca/topo/treematch/treematch/tm_tree.c if(!independent_tab(tab[i]->tab, tab[j]->tab, arity)){ arity 1504 ompi/mca/topo/treematch/treematch/tm_tree.c void fast_group(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *parent, int id, int arity, int n, arity 1514 ompi/mca/topo/treematch/treematch/tm_tree.c if( n == arity ){ arity 1517 ompi/mca/topo/treematch/treematch/tm_tree.c val = eval_grouping(aff_mat, cur_group, arity); arity 1523 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < arity ; i++ ) arity 1526 ompi/mca/topo/treematch/treematch/tm_tree.c parent->arity = arity; arity 1546 ompi/mca/topo/treematch/treematch/tm_tree.c fast_group(aff_mat, tab_node, parent, i, arity, n+1, best_val, cur_group, nb_groups, max_groups); arity 1556 ompi/mca/topo/treematch/treematch/tm_tree.c double fast_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size, double nb_groups) arity 1562 ompi/mca/topo/treematch/treematch/tm_tree.c cur_group = (tm_tree_t**)MALLOC(sizeof(tm_tree_t*)*arity); arity 1569 ompi/mca/topo/treematch/treematch/tm_tree.c fast_group(aff_mat, tab_node, &new_tab_node[l], -1, arity, 0, &best_val, cur_group, &nb_done, MAX(10, (int)(50-CmiLog2(nb_groups))-solution_size/10)); arity 1571 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < new_tab_node[l].arity ; i++ ) arity 1586 ompi/mca/topo/treematch/treematch/tm_tree.c static double k_partition_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size) { arity 1597 ompi/mca/topo/treematch/treematch/tm_tree.c printf("K-Partitionning: n=%d, solution_size=%d, arity=%d\n",n, solution_size,arity); arity 1614 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[i].arity = arity; arity 1647 ompi/mca/topo/treematch/treematch/tm_tree.c void super_fast_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size) arity 1655 ompi/mca/topo/treematch/treematch/tm_tree.c assert( 2 == arity); arity 1686 ompi/mca/topo/treematch/treematch/tm_tree.c if(try_add_edge(tab_node, &new_tab_node[l], arity, graph[i].i, graph[i].j, &nb_groups)) arity 1703 ompi/mca/topo/treematch/treematch/tm_tree.c display_grouping(new_tab_node, solution_size, arity, val); arity 1763 ompi/mca/topo/treematch/treematch/tm_tree.c int arity, int solution_size, double* obj_weigth, double comm_speed){ arity 1788 ompi/mca/topo/treematch/treematch/tm_tree.c nbg = choose(mat_order, arity); arity 1800 ompi/mca/topo/treematch/treematch/tm_tree.c if( arity <= 2 ){ arity 1804 ompi/mca/topo/treematch/treematch/tm_tree.c val = bucket_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size); arity 1805 ompi/mca/topo/treematch/treematch/tm_tree.c }else if( arity <= 5){ arity 1808 ompi/mca/topo/treematch/treematch/tm_tree.c val = fast_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size, nbg); arity 1812 ompi/mca/topo/treematch/treematch/tm_tree.c val = k_partition_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size); arity 1820 ompi/mca/topo/treematch/treematch/tm_tree.c display_grouping(new_tab_node, solution_size, arity, val); arity 1828 ompi/mca/topo/treematch/treematch/tm_tree.c cur_group = (tm_tree_t**)MALLOC(sizeof(tm_tree_t*)*arity); arity 1831 ompi/mca/topo/treematch/treematch/tm_tree.c list_all_possible_groups(cost_mat, tab_node, 0, arity, 0, cur_group, &list); arity 1843 ompi/mca/topo/treematch/treematch/tm_tree.c timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 1, 100); arity 1859 ompi/mca/topo/treematch/treematch/tm_tree.c timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1); arity 1872 ompi/mca/topo/treematch/treematch/tm_tree.c timeout=select_independent_groups_by_largest_index(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1); arity 1887 ompi/mca/topo/treematch/treematch/tm_tree.c compute_weighted_degree(tab_group, nb_groups, arity); arity 1899 ompi/mca/topo/treematch/treematch/tm_tree.c timeout = select_independent_groups(tab_group, nb_groups, arity, solution_size, &best_val, best_selection, 10, 0.1); arity 1915 ompi/mca/topo/treematch/treematch/tm_tree.c thread_exhaustive_search(tab_group, nb_groups, arity, solution_size, &best_val, best_selection); arity 1930 ompi/mca/topo/treematch/treematch/tm_tree.c for( j = 0 ; j < arity ; j++ ){ arity 1934 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[l].arity = arity; arity 2008 ompi/mca/topo/treematch/treematch/tm_tree.c int arity, i; arity 2015 ompi/mca/topo/treematch/treematch/tm_tree.c arity = topology->arity[depth]; arity 2016 ompi/mca/topo/treematch/treematch/tm_tree.c assert(arity>0); arity 2017 ompi/mca/topo/treematch/treematch/tm_tree.c list_child = (tm_tree_t**)CALLOC(arity, sizeof(tm_tree_t*)); arity 2018 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < arity ; i++ ){ arity 2027 ompi/mca/topo/treematch/treematch/tm_tree.c set_node(node, list_child, arity, NULL, -1, 0, NULL, depth); arity 2076 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *build_level_topology(tm_tree_t *tab_node, tm_affinity_mat_t *aff_mat, int arity, int depth, tm_topology_t *topology, arity 2102 ompi/mca/topo/treematch/treematch/tm_tree.c if( mat_order%arity != 0 ){ arity 2104 ompi/mca/topo/treematch/treematch/tm_tree.c K = arity*((mat_order/arity)+1)-mat_order; arity 2107 ompi/mca/topo/treematch/treematch/tm_tree.c printf("****mat_order=%d arity=%d K=%d\n", mat_order, arity, K); arity 2123 ompi/mca/topo/treematch/treematch/tm_tree.c M = mat_order/arity; arity 2125 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Depth=%d\tnb_nodes=%d\tnb_groups=%d\tsize of groups(arity)=%d\n", depth, mat_order, M, arity); arity 2133 ompi/mca/topo/treematch/treematch/tm_tree.c list_child = (tm_tree_t**)CALLOC(arity, sizeof(tm_tree_t*)); arity 2134 ompi/mca/topo/treematch/treematch/tm_tree.c set_node(&new_tab_node[i], list_child, arity, NULL, i, 0, tab_node, depth); arity 2145 ompi/mca/topo/treematch/treematch/tm_tree.c group_nodes(aff_mat, tab_node, new_tab_node, arity, M, obj_weight, speed); arity 2174 ompi/mca/topo/treematch/treematch/tm_tree.c arity = topology->arity[depth-1]; arity 2176 ompi/mca/topo/treematch/treematch/tm_tree.c arity = 1; arity 2178 ompi/mca/topo/treematch/treematch/tm_tree.c res = build_level_topology(new_tab_node, new_aff_mat, arity, depth, topology, new_obj_weight, comm_speed); arity 2212 ompi/mca/topo/treematch/treematch/tm_tree.c res = build_level_topology(tab_node, aff_mat , topology->arity[depth-2], depth-1, topology, obj_weight, comm_speed); arity 8 ompi/mca/topo/treematch/treematch/tm_tree.h void set_node(tm_tree_t *node,tm_tree_t ** child, int arity,tm_tree_t *parent, arity 45 ompi/mca/topo/treematch/treematch/treematch.h int arity; arity 58 ompi/mca/topo/treematch/treematch/treematch.h int *arity; /* Arity of the nodes of each level*/ arity 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); arity 250 opal/mca/hwloc/base/hwloc_base_dt.c (NULL == prefix) ? "" : prefix, string, obj->arity, arity 285 opal/mca/hwloc/base/hwloc_base_dt.c for (i=0; i < obj->arity; i++) { arity 502 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < obj->arity; k++) { arity 524 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < obj->arity; k++) { arity 922 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < start->arity; k++) { arity 943 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < root->arity; k++) { arity 1923 opal/mca/hwloc/base/hwloc_base_util.c for (i = 0; i < root->arity; i++) { arity 423 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c && parent->sibling_rank == 1 && parent->parent->arity == 2 arity 425 opal/mca/hwloc/hwloc201/hwloc/hwloc/pci-common.c && parent->parent->sibling_rank == 0 && parent->parent->parent->arity == 2) { arity 40 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c unsigned arity; arity 203 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (!data->level[i].arity) { arity 409 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (!curlevel->arity) arity 460 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c data->level[count-1].arity = 0; arity 579 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c data->level[count-1].arity = (unsigned)item; arity 766 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c data->level[1].arity = data->level[0].arity; arity 767 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c data->level[0].arity = 1; arity 800 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c data->level[count-1].arity = 0; arity 923 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (!curlevel->arity) { arity 926 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c for (i = 0; i < curlevel->arity; i++) arity 968 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c for (i = 0; data->level[i].arity > 0; i++) arity 978 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c for (i = 0; i < data->level[0].arity; i++) arity 1244 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c hwloc_obj_t obj, unsigned arity, arity 1253 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (arity != (unsigned)-1) arity 1254 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c snprintf(aritys, sizeof(aritys), ":%u", arity); arity 1405 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c unsigned arity; arity 1493 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c arity = obj->arity; arity 1494 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c while (arity) { arity 1501 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c res = hwloc__export_synthetic_obj(topology, flags, obj, arity, tmp, tmplen); arity 1513 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c arity = obj->arity; arity 2216 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c if (obj->parent->arity > 1 && obj->memory_arity > 1 && parentstate->global->v1_memory_group) { arity 271 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (obj->arity) arity 272 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c hwloc_debug(" arity %u", obj->arity); arity 776 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (src->arity) { arity 777 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newobj->children = hwloc_tma_malloc(tma, src->arity * sizeof(*newobj->children)); arity 781 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newobj->arity = src->arity; arity 815 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (newobj->arity) { arity 817 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(i=1; i<newobj->arity; i++) arity 819 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c newobj->last_child = newobj->children[newobj->arity-1]; arity 2207 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (topology->levels[i-1][j]->arity != 1) arity 2265 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->arity = child->arity; arity 2270 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(k=0; k<parent->arity; k++) arity 2298 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (parent->sibling_rank == parent->parent->arity-1) { arity 2335 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c child->next_sibling = rank < child->parent->arity-1 ? child->parent->children[rank+1] : NULL; arity 2389 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c unsigned arity = root->arity; arity 2396 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (!arity) arity 2415 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (arity == 1) arity 2422 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c HWLOC_VLA(hwloc_obj_t, array, arity); arity 2423 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c memcpy(array, root->children, arity * sizeof(*array)); arity 2427 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(i=1; i<arity; i++) arity 2429 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c || array[i]->arity != array[0]->arity) { arity 2432 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (!array[0]->arity) arity 2436 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(i=0; i<arity; i++) arity 2470 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c unsigned n, oldn = parent->arity; arity 2490 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->arity = n; arity 2592 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for (j = 0; j < current_objs[i]->arity; j++) arity 2769 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c n_objs = topology->levels[0][0]->arity; arity 2811 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c n_new_objs += objs[i]->arity; arity 3865 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c unsigned arity, unsigned i, arity 3883 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (i == arity-1) arity 3899 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c if (!parent->arity) { arity 3920 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c hwloc__check_child_siblings(parent, parent->children, parent->arity, j, child, prev); arity 3925 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(j == parent->arity); arity 3928 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(parent->last_child == parent->children[parent->arity-1]); arity 3932 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(!parent->arity); arity 3951 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(!obj->arity); arity 3955 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(!obj->arity); arity 4165 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c assert(!obj->arity); arity 195 opal/mca/hwloc/hwloc201/hwloc/hwloc/traversal.c for (i=0; i<current->arity; i++) { arity 409 opal/mca/hwloc/hwloc201/hwloc/include/hwloc.h unsigned arity; /**< \brief Number of normal children. arity 849 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h if (!root->arity || chunk <= 1 || root->depth >= until) { arity 866 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/helper.h hwloc_distrib(topology, root->children, root->arity, cpusetp, chunk, until, flags); arity 420 orte/mca/rmaps/ppr/rmaps_ppr.c if (1 < obj->arity) { arity 423 orte/mca/rmaps/ppr/rmaps_ppr.c for (k=0; k < obj->arity; k++) { arity 552 orte/mca/rmaps/ppr/rmaps_ppr.c for (k=0; k < top->arity && limit < nprocs; k++) {