tab_node 418 ompi/mca/topo/treematch/treematch/tm_bucket.c int add_edge_3(tm_tree_t *tab_node, tm_tree_t *parent,int i,int j,int *nb_groups) tab_node 421 ompi/mca/topo/treematch/treematch/tm_bucket.c if((!tab_node[i].parent) && (!tab_node[j].parent)){ tab_node 423 ompi/mca/topo/treematch/treematch/tm_bucket.c parent->child[0] = &tab_node[i]; tab_node 424 ompi/mca/topo/treematch/treematch/tm_bucket.c parent->child[1] = &tab_node[j]; tab_node 425 ompi/mca/topo/treematch/treematch/tm_bucket.c tab_node[i].parent = parent; tab_node 426 ompi/mca/topo/treematch/treematch/tm_bucket.c tab_node[j].parent = parent; tab_node 436 ompi/mca/topo/treematch/treematch/tm_bucket.c if( tab_node[i].parent && (!tab_node[j].parent) ){ tab_node 437 ompi/mca/topo/treematch/treematch/tm_bucket.c parent = tab_node[i].parent; tab_node 439 ompi/mca/topo/treematch/treematch/tm_bucket.c parent->child[2] = &tab_node[j]; tab_node 440 ompi/mca/topo/treematch/treematch/tm_bucket.c tab_node[j].parent = parent; tab_node 450 ompi/mca/topo/treematch/treematch/tm_bucket.c if(tab_node[j].parent && (!tab_node[i].parent)){ tab_node 451 ompi/mca/topo/treematch/treematch/tm_bucket.c parent = tab_node[j].parent; tab_node 453 ompi/mca/topo/treematch/treematch/tm_bucket.c parent->child[2] = &tab_node[i]; tab_node 454 ompi/mca/topo/treematch/treematch/tm_bucket.c tab_node[i].parent = parent; tab_node 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) tab_node 473 ompi/mca/topo/treematch/treematch/tm_bucket.c if(tab_node[i].parent) tab_node 475 ompi/mca/topo/treematch/treematch/tm_bucket.c if(tab_node[j].parent) tab_node 478 ompi/mca/topo/treematch/treematch/tm_bucket.c parent->child[0] = &tab_node[i]; tab_node 479 ompi/mca/topo/treematch/treematch/tm_bucket.c parent->child[1] = &tab_node[j]; tab_node 480 ompi/mca/topo/treematch/treematch/tm_bucket.c tab_node[i].parent = parent; tab_node 481 ompi/mca/topo/treematch/treematch/tm_bucket.c tab_node[j].parent = parent; tab_node 487 ompi/mca/topo/treematch/treematch/tm_bucket.c return add_edge_3(tab_node,parent,i,j,nb_groups); tab_node 538 ompi/mca/topo/treematch/treematch/tm_bucket.c double bucket_grouping(tm_affinity_mat_t *aff_mat,tm_tree_t *tab_node, tm_tree_t *new_tab_node, tab_node 579 ompi/mca/topo/treematch/treematch/tm_bucket.c if(try_add_edge(tab_node,&new_tab_node[l],arity,i,j,&nb_groups)){ tab_node 587 ompi/mca/topo/treematch/treematch/tm_bucket.c if(try_add_edge(tab_node,&new_tab_node[l],arity,i,j,&nb_groups)){ tab_node 603 ompi/mca/topo/treematch/treematch/tm_bucket.c try_add_edge(tab_node,NULL,arity,i,j,&nb_groups); tab_node 31 ompi/mca/topo/treematch/treematch/tm_bucket.h double bucket_grouping(tm_affinity_mat_t *aff_mat,tm_tree_t *tab_node, tm_tree_t *new_tab_node, tab_node 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); tab_node 242 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *tab_node = (tm_tree_t*)args[3]; tab_node 263 ompi/mca/topo/treematch/treematch/tm_tree.c for( i1 = 0 ; i1 < tab_node[i].arity ; i1++ ){ tab_node 264 ompi/mca/topo/treematch/treematch/tm_tree.c id1 = tab_node[i].child[i1]->id; tab_node 265 ompi/mca/topo/treematch/treematch/tm_tree.c for( j1 = 0 ; j1 < tab_node[j].arity ; j1++ ){ tab_node 266 ompi/mca/topo/treematch/treematch/tm_tree.c id2 = tab_node[j].child[j1]->id; tab_node 280 ompi/mca/topo/treematch/treematch/tm_tree.c static tm_affinity_mat_t *aggregate_aff_mat(tm_tree_t *tab_node, tm_affinity_mat_t *aff_mat, int M) tab_node 315 ompi/mca/topo/treematch/treematch/tm_tree.c args[3]=(void*)tab_node; tab_node 345 ompi/mca/topo/treematch/treematch/tm_tree.c for( i1 = 0 ; i1 < tab_node[i].arity ; i1++ ){ tab_node 346 ompi/mca/topo/treematch/treematch/tm_tree.c id1 = tab_node[i].child[i1]->id; tab_node 347 ompi/mca/topo/treematch/treematch/tm_tree.c for( j1 = 0 ; j1 < tab_node[j].arity ; j1++ ){ tab_node 348 ompi/mca/topo/treematch/treematch/tm_tree.c id2 = tab_node[j].child[j1]->id; tab_node 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, tab_node 483 ompi/mca/topo/treematch/treematch/tm_tree.c if(tab_node[i].parent) tab_node 485 ompi/mca/topo/treematch/treematch/tm_tree.c cur_group[depth] = &tab_node[i]; tab_node 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); tab_node 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, tab_node 1537 ompi/mca/topo/treematch/treematch/tm_tree.c if(tab_node[i].parent) tab_node 1540 ompi/mca/topo/treematch/treematch/tm_tree.c cur_group[n] = &tab_node[i]; tab_node 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); tab_node 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) tab_node 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)); tab_node 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) { tab_node 1609 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[i].child[j] = &tab_node[k]; tab_node 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) tab_node 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)) tab_node 1762 ompi/mca/topo/treematch/treematch/tm_tree.c void group_nodes(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, tab_node 1804 ompi/mca/topo/treematch/treematch/tm_tree.c val = bucket_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size); tab_node 1808 ompi/mca/topo/treematch/treematch/tm_tree.c val = fast_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size, nbg); tab_node 1812 ompi/mca/topo/treematch/treematch/tm_tree.c val = k_partition_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size); tab_node 1831 ompi/mca/topo/treematch/treematch/tm_tree.c list_all_possible_groups(cost_mat, tab_node, 0, arity, 0, cur_group, &list); tab_node 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, tab_node 2093 ompi/mca/topo/treematch/treematch/tm_tree.c return &tab_node[0]; tab_node 2115 ompi/mca/topo/treematch/treematch/tm_tree.c complete_tab_node(&tab_node, mat_order, K, depth, topology); tab_node 2134 ompi/mca/topo/treematch/treematch/tm_tree.c set_node(&new_tab_node[i], list_child, arity, NULL, i, 0, tab_node, depth); tab_node 2145 ompi/mca/topo/treematch/treematch/tm_tree.c group_nodes(aff_mat, tab_node, new_tab_node, arity, M, obj_weight, speed); tab_node 2164 ompi/mca/topo/treematch/treematch/tm_tree.c tab_node[i].id = -1; tab_node 2180 ompi/mca/topo/treematch/treematch/tm_tree.c set_deb_tab_child(res, tab_node, depth); tab_node 2200 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *res = NULL, *tab_node = NULL; tab_node 2203 ompi/mca/topo/treematch/treematch/tm_tree.c tab_node = (tm_tree_t*)MALLOC(sizeof(tm_tree_t)*mat_order); tab_node 2206 ompi/mca/topo/treematch/treematch/tm_tree.c set_node(&tab_node[i], NULL, 0, NULL, i, 0, NULL, depth); tab_node 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);