group_list_t       41 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *new_group_list(tm_tree_t **, double, group_list_t *);
group_list_t       42 ompi/mca/topo/treematch/treematch/tm_tree.c void add_to_list(group_list_t *, tm_tree_t **, int, double);
group_list_t       43 ompi/mca/topo/treematch/treematch/tm_tree.c void  list_all_possible_groups(tm_affinity_mat_t *, tm_tree_t *, int, int, int, tm_tree_t **, group_list_t *);
group_list_t       44 ompi/mca/topo/treematch/treematch/tm_tree.c int independent_groups(group_list_t **, int, group_list_t *, int);
group_list_t       45 ompi/mca/topo/treematch/treematch/tm_tree.c void display_selection (group_list_t**, int, int, double);
group_list_t       47 ompi/mca/topo/treematch/treematch/tm_tree.c int recurs_select_independent_groups(group_list_t **, int, int, int, int,
group_list_t       48 ompi/mca/topo/treematch/treematch/tm_tree.c 				     int, double, double *, group_list_t **, group_list_t **);
group_list_t       49 ompi/mca/topo/treematch/treematch/tm_tree.c int test_independent_groups(group_list_t **, int, int, int, int, int, double, double *,
group_list_t       50 ompi/mca/topo/treematch/treematch/tm_tree.c 			    group_list_t **, group_list_t **);
group_list_t       51 ompi/mca/topo/treematch/treematch/tm_tree.c void delete_group_list(group_list_t *);
group_list_t       57 ompi/mca/topo/treematch/treematch/tm_tree.c int  select_independent_groups(group_list_t **, int, int, int, double *, group_list_t **, int, double);
group_list_t       58 ompi/mca/topo/treematch/treematch/tm_tree.c int  select_independent_groups_by_largest_index(group_list_t **, int, int, int, double *,
group_list_t       59 ompi/mca/topo/treematch/treematch/tm_tree.c 						group_list_t **, int, double);
group_list_t       60 ompi/mca/topo/treematch/treematch/tm_tree.c void list_to_tab(group_list_t *, group_list_t **, int);
group_list_t       61 ompi/mca/topo/treematch/treematch/tm_tree.c void display_tab_group(group_list_t **, int, int);
group_list_t       63 ompi/mca/topo/treematch/treematch/tm_tree.c void compute_weighted_degree(group_list_t **, int, int);
group_list_t      433 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *new_group_list(tm_tree_t **tab, double val, group_list_t *next)
group_list_t      435 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *res = NULL;
group_list_t      437 ompi/mca/topo/treematch/treematch/tm_tree.c   res = (group_list_t *)MALLOC(sizeof(group_list_t));
group_list_t      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)
group_list_t      448 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *elem = NULL;
group_list_t      470 ompi/mca/topo/treematch/treematch/tm_tree.c 			       tm_tree_t **cur_group, group_list_t *list)
group_list_t      511 ompi/mca/topo/treematch/treematch/tm_tree.c int independent_groups(group_list_t **selection, int d, group_list_t *elem, int arity)
group_list_t      528 ompi/mca/topo/treematch/treematch/tm_tree.c void display_selection (group_list_t** selection, int M, int arity, double val)
group_list_t      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)
group_list_t      566 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *elem = NULL;
group_list_t      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)
group_list_t      602 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *elem = NULL;
group_list_t      622 ompi/mca/topo/treematch/treematch/tm_tree.c void  delete_group_list(group_list_t *list)
group_list_t      634 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *e1 = NULL, *e2= NULL;
group_list_t      636 ompi/mca/topo/treematch/treematch/tm_tree.c   e1 = *((group_list_t**)x1);
group_list_t      637 ompi/mca/topo/treematch/treematch/tm_tree.c   e2 = *((group_list_t**)x2);
group_list_t      644 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *e1 = NULL, *e2 = NULL;
group_list_t      646 ompi/mca/topo/treematch/treematch/tm_tree.c   e1 = *((group_list_t**)x1);
group_list_t      647 ompi/mca/topo/treematch/treematch/tm_tree.c   e2 = *((group_list_t**)x2);
group_list_t      654 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *e1 = NULL, *e2 = NULL;
group_list_t      656 ompi/mca/topo/treematch/treematch/tm_tree.c   e1 = *((group_list_t**)x1);
group_list_t      657 ompi/mca/topo/treematch/treematch/tm_tree.c   e2 = *((group_list_t**)x2);
group_list_t      664 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *e1= NULL, *e2 = NULL;
group_list_t      666 ompi/mca/topo/treematch/treematch/tm_tree.c   e1 = *((group_list_t**)x1);
group_list_t      667 ompi/mca/topo/treematch/treematch/tm_tree.c   e2 = *((group_list_t**)x2);
group_list_t      674 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *e1 = NULL, *e2 = NULL;
group_list_t      676 ompi/mca/topo/treematch/treematch/tm_tree.c   e1 = *((group_list_t**)x1);
group_list_t      677 ompi/mca/topo/treematch/treematch/tm_tree.c   e2 = *((group_list_t**)x2);
group_list_t      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,
group_list_t      683 ompi/mca/topo/treematch/treematch/tm_tree.c 			       group_list_t **best_selection, int bound, double max_duration)
group_list_t      686 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
group_list_t      701 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*M);
group_list_t      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){
group_list_t      735 ompi/mca/topo/treematch/treematch/tm_tree.c       group_list_t *elem1 = tab_group[i];
group_list_t      736 ompi/mca/topo/treematch/treematch/tm_tree.c       group_list_t *elem2 = tab_group[j];
group_list_t      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)
group_list_t      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,
group_list_t      778 ompi/mca/topo/treematch/treematch/tm_tree.c 				      double val, double *best_val, group_list_t **selection, group_list_t **best_selection,
group_list_t      782 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *elem = NULL;
group_list_t      866 ompi/mca/topo/treematch/treematch/tm_tree.c static group_list_t * group_dup(group_list_t *group, int nb_groups){
group_list_t      867 ompi/mca/topo/treematch/treematch/tm_tree.c    group_list_t *elem = NULL;
group_list_t      878 ompi/mca/topo/treematch/treematch/tm_tree.c    elem = (group_list_t*) MALLOC(sizeof(group_list_t));
group_list_t      893 ompi/mca/topo/treematch/treematch/tm_tree.c static group_list_t **  tab_group_dup(group_list_t **tab_group, int nb_groups){
group_list_t      894 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **res;
group_list_t      897 ompi/mca/topo/treematch/treematch/tm_tree.c   res = (group_list_t**)MALLOC(sizeof(group_list_t*)*nb_groups);
group_list_t      927 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
group_list_t      932 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **tab_group = (group_list_t **) args[0];
group_list_t      935 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **best_selection = (group_list_t **) args[5];
group_list_t      959 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
group_list_t     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,
group_list_t     1125 ompi/mca/topo/treematch/treematch/tm_tree.c 			 group_list_t **best_selection){
group_list_t     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)
group_list_t     1232 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *elem = NULL;
group_list_t     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)
group_list_t     1274 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t *elem = NULL;
group_list_t     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,
group_list_t     1326 ompi/mca/topo/treematch/treematch/tm_tree.c 			       group_list_t **best_selection)
group_list_t     1329 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
group_list_t     1353 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
group_list_t     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)
group_list_t     1391 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t **selection = NULL;
group_list_t     1395 ompi/mca/topo/treematch/treematch/tm_tree.c   selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
group_list_t     1428 ompi/mca/topo/treematch/treematch/tm_tree.c void list_to_tab(group_list_t *list, group_list_t **tab, int n)
group_list_t     1448 ompi/mca/topo/treematch/treematch/tm_tree.c void display_tab_group(group_list_t **tab, int n, int arity)
group_list_t     1473 ompi/mca/topo/treematch/treematch/tm_tree.c void compute_weighted_degree(group_list_t **tab, int n, int arity)
group_list_t     1774 ompi/mca/topo/treematch/treematch/tm_tree.c   group_list_t list, **best_selection = NULL, **tab_group = NULL;
group_list_t     1829 ompi/mca/topo/treematch/treematch/tm_tree.c     best_selection = (group_list_t **)MALLOC(sizeof(group_list_t*)*solution_size);
group_list_t     1834 ompi/mca/topo/treematch/treematch/tm_tree.c     tab_group = (group_list_t**)MALLOC(sizeof(group_list_t*)*nb_groups);
group_list_t     1857 ompi/mca/topo/treematch/treematch/tm_tree.c     qsort(tab_group, nb_groups, sizeof(group_list_t*), group_list_asc);
group_list_t     1870 ompi/mca/topo/treematch/treematch/tm_tree.c     qsort(tab_group, nb_groups, sizeof(group_list_t*), group_list_dsc);
group_list_t     1892 ompi/mca/topo/treematch/treematch/tm_tree.c       qsort(tab_group, nb_groups, sizeof(group_list_t*), weighted_degree_dsc);
group_list_t     1927 ompi/mca/topo/treematch/treematch/tm_tree.c     qsort(best_selection, solution_size, sizeof(group_list_t*), group_list_id);