best_selection    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)
best_selection    578 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
best_selection    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);
best_selection    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)
best_selection    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);
best_selection    683 ompi/mca/topo/treematch/treematch/tm_tree.c 			       group_list_t **best_selection, int bound, double max_duration)
best_selection    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);
best_selection    721 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, M, arity, *best_val);
best_selection    778 ompi/mca/topo/treematch/treematch/tm_tree.c 				      double val, double *best_val, group_list_t **selection, group_list_t **best_selection,
best_selection    798 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
best_selection    935 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **best_selection = (group_list_t **) args[5];
best_selection    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);
best_selection   1125 ompi/mca/topo/treematch/treematch/tm_tree.c 			 group_list_t **best_selection){
best_selection   1185 ompi/mca/topo/treematch/treematch/tm_tree.c     args[5]=(void*)best_selection;
best_selection   1220 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
best_selection   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)
best_selection   1242 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
best_selection   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);
best_selection   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)
best_selection   1283 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
best_selection   1326 ompi/mca/topo/treematch/treematch/tm_tree.c 			       group_list_t **best_selection)
best_selection   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);
best_selection   1378 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
best_selection   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)
best_selection   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);
best_selection   1423 ompi/mca/topo/treematch/treematch/tm_tree.c     display_selection(best_selection, solution_size, arity, *best_val);
best_selection   1774 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t list, **best_selection = NULL, **tab_group = NULL;
best_selection   1829 ompi/mca/topo/treematch/treematch/tm_tree.c     best_selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
best_selection   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);
best_selection   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);
best_selection   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);
best_selection   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);
best_selection   1915 ompi/mca/topo/treematch/treematch/tm_tree.c       thread_exhaustive_search(tab_group, nb_groups, arity, solution_size, &best_val, best_selection);
best_selection   1927 ompi/mca/topo/treematch/treematch/tm_tree.c     qsort(best_selection, solution_size, sizeof(group_list_t*), group_list_id);
best_selection   1931 ompi/mca/topo/treematch/treematch/tm_tree.c 	new_tab_node[l].child[j]         = best_selection[l]->tab[j];
best_selection   1941 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(best_selection);