selection         511 ompi/mca/topo/treematch/treematch/tm_tree.c int independent_groups(group_list_t **selection, int d, group_list_t *elem, int arity)
selection         521 ompi/mca/topo/treematch/treematch/tm_tree.c 	if(elem->tab[i]->id == selection[j]->tab[k]->id)
selection         528 ompi/mca/topo/treematch/treematch/tm_tree.c void display_selection (group_list_t** selection, int M, int arity, double val)
selection         539 ompi/mca/topo/treematch/treematch/tm_tree.c       printf("%d ", selection[i]->tab[j]->id);
selection         540 ompi/mca/topo/treematch/treematch/tm_tree.c     printf("(%d)-- ", selection[i]->id);
selection         541 ompi/mca/topo/treematch/treematch/tm_tree.c     local_val+=selection[i]->val;
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)
selection         574 ompi/mca/topo/treematch/treematch/tm_tree.c       display_selection(selection, M, arity, val);
selection         578 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
selection         586 ompi/mca/topo/treematch/treematch/tm_tree.c     if(independent_groups(selection, d, elem, arity)){
selection         589 ompi/mca/topo/treematch/treematch/tm_tree.c       selection[d] = elem;
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);
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)
selection         611 ompi/mca/topo/treematch/treematch/tm_tree.c     if(independent_groups(selection, d, elem, arity)){
selection         613 ompi/mca/topo/treematch/treematch/tm_tree.c       selection[d] = elem;
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);
selection         686 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
selection         701 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*M);
selection         705 ompi/mca/topo/treematch/treematch/tm_tree.c     selection[0] = tab_group[i];
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);
selection         712 ompi/mca/topo/treematch/treematch/tm_tree.c 	FREE(selection);
selection         717 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(selection);
selection         754 ompi/mca/topo/treematch/treematch/tm_tree.c static int independent_groups_mat(group_list_t **selection, int selection_size, group_list_t *elem, int8_t **indep_mat)
selection         765 ompi/mca/topo/treematch/treematch/tm_tree.c     id_select = selection[i] -> id;
selection         778 ompi/mca/topo/treematch/treematch/tm_tree.c 				      double val, double *best_val, group_list_t **selection, group_list_t **best_selection,
selection         791 ompi/mca/topo/treematch/treematch/tm_tree.c       display_selection(selection, solution_size, arity, val);
selection         798 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
selection         833 ompi/mca/topo/treematch/treematch/tm_tree.c       if(independent_groups_mat(selection, depth, elem, indep_mat)){
selection         836 ompi/mca/topo/treematch/treematch/tm_tree.c 	selection[depth] = elem;
selection         837 ompi/mca/topo/treematch/treematch/tm_tree.c 	val += selection[depth]->val;
selection         844 ompi/mca/topo/treematch/treematch/tm_tree.c 	val -= selection[depth]->val;
selection         927 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
selection         959 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
selection         996 ompi/mca/topo/treematch/treematch/tm_tree.c 	selection[i] = tab_group[id];
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);
selection        1015 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(selection);
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)
selection        1238 ompi/mca/topo/treematch/treematch/tm_tree.c       display_selection(selection, solution_size, arity, val);
selection        1242 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
selection        1255 ompi/mca/topo/treematch/treematch/tm_tree.c       if(independent_groups_mat(selection, d, elem, indep_mat)){
selection        1258 ompi/mca/topo/treematch/treematch/tm_tree.c 	selection[d] = elem;
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);
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)
selection        1279 ompi/mca/topo/treematch/treematch/tm_tree.c       display_selection(selection, solution_size, arity, val);
selection        1283 ompi/mca/topo/treematch/treematch/tm_tree.c 	best_selection[i] = selection[i];
selection        1299 ompi/mca/topo/treematch/treematch/tm_tree.c       if(independent_groups_mat(selection, d, elem, indep_mat)){
selection        1302 ompi/mca/topo/treematch/treematch/tm_tree.c 	selection[d] = elem;
selection        1303 ompi/mca/topo/treematch/treematch/tm_tree.c 	val += selection[d]->val;
selection        1310 ompi/mca/topo/treematch/treematch/tm_tree.c 	val -= selection[d]->val;
selection        1329 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
selection        1353 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
selection        1359 ompi/mca/topo/treematch/treematch/tm_tree.c     selection[0] = tab_group[i];
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);
selection        1368 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(selection);
selection        1391 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
selection        1395 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
selection        1400 ompi/mca/topo/treematch/treematch/tm_tree.c     selection[0] = tab_group[i];
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);
selection        1407 ompi/mca/topo/treematch/treematch/tm_tree.c       FREE(selection);
selection        1414 ompi/mca/topo/treematch/treematch/tm_tree.c 	FREE(selection);
selection        1420 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(selection);