new_tab_node 522 ompi/mca/topo/treematch/treematch/tm_bucket.c tm_tree_t *new_tab_node = (tm_tree_t*)args[3]; new_tab_node 533 ompi/mca/topo/treematch/treematch/tm_bucket.c update_val(aff_mat,&new_tab_node[l]); new_tab_node 534 ompi/mca/topo/treematch/treematch/tm_bucket.c *res += new_tab_node[l].val; new_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, new_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)){ new_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)){ new_tab_node 637 ompi/mca/topo/treematch/treematch/tm_bucket.c args[3]=(void*)new_tab_node; new_tab_node 662 ompi/mca/topo/treematch/treematch/tm_bucket.c update_val(aff_mat,&new_tab_node[l]); new_tab_node 663 ompi/mca/topo/treematch/treematch/tm_bucket.c val += new_tab_node[l].val; new_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, new_tab_node 216 ompi/mca/topo/treematch/treematch/tm_tree.c double *aggregate_obj_weight(tm_tree_t *new_tab_node, double *tab, int M) new_tab_node 228 ompi/mca/topo/treematch/treematch/tm_tree.c for( i1 = 0 ; i1 < new_tab_node[i].arity ; i1++ ){ new_tab_node 229 ompi/mca/topo/treematch/treematch/tm_tree.c id1 = new_tab_node[i].child[i1]->id; new_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) new_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)); new_tab_node 1571 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < new_tab_node[l].arity ; i++ ) new_tab_node 1572 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[l].child[i]->parent=&new_tab_node[l]; new_tab_node 1573 ompi/mca/topo/treematch/treematch/tm_tree.c update_val(aff_mat, &new_tab_node[l]); new_tab_node 1574 ompi/mca/topo/treematch/treematch/tm_tree.c if(new_tab_node[l].val != best_val){ new_tab_node 1576 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Error: best_val = %f, new_tab_node[%d].val = %f\n", best_val, l, new_tab_node[l].val); new_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) { new_tab_node 1609 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[i].child[j] = &tab_node[k]; new_tab_node 1610 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[i].child[j]->parent = &new_tab_node[i]; new_tab_node 1614 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[i].arity = arity; new_tab_node 1615 ompi/mca/topo/treematch/treematch/tm_tree.c update_val(aff_mat, &new_tab_node[i]); new_tab_node 1616 ompi/mca/topo/treematch/treematch/tm_tree.c val += new_tab_node[i].val; new_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) new_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)) new_tab_node 1690 ompi/mca/topo/treematch/treematch/tm_tree.c update_val(aff_mat, &new_tab_node[l]); new_tab_node 1691 ompi/mca/topo/treematch/treematch/tm_tree.c val += new_tab_node[l].val; new_tab_node 1703 ompi/mca/topo/treematch/treematch/tm_tree.c display_grouping(new_tab_node, solution_size, arity, val); new_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, new_tab_node 1804 ompi/mca/topo/treematch/treematch/tm_tree.c val = bucket_grouping(cost_mat, tab_node, new_tab_node, arity, solution_size); new_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); new_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); new_tab_node 1820 ompi/mca/topo/treematch/treematch/tm_tree.c display_grouping(new_tab_node, solution_size, arity, val); new_tab_node 1931 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[l].child[j] = best_selection[l]->tab[j]; new_tab_node 1932 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[l].child[j]->parent = &new_tab_node[l]; new_tab_node 1934 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[l].arity = arity; new_tab_node 1937 ompi/mca/topo/treematch/treematch/tm_tree.c update_val(cost_mat, &new_tab_node[l]); new_tab_node 2083 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *new_tab_node = NULL; /*array of node for this level (of size M): there will be linked to the nodes of tab_nodes*/ new_tab_node 2129 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node = (tm_tree_t*)MALLOC(sizeof(tm_tree_t)*M); new_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); new_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); new_tab_node 2149 ompi/mca/topo/treematch/treematch/tm_tree.c new_aff_mat = aggregate_aff_mat(new_tab_node, aff_mat, M); new_tab_node 2157 ompi/mca/topo/treematch/treematch/tm_tree.c new_obj_weight = aggregate_obj_weight(new_tab_node, obj_weight, M); new_tab_node 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);