indep_mat         728 ompi/mca/topo/treematch/treematch/tm_tree.c   int8_t **indep_mat = (int8_t **)MALLOC(sizeof(int8_t*) *n);
indep_mat         731 ompi/mca/topo/treematch/treematch/tm_tree.c     indep_mat[i] = (int8_t *)MALLOC(sizeof(int8_t) *(i+1));
indep_mat         740 ompi/mca/topo/treematch/treematch/tm_tree.c 	    indep_mat[i][j] = 0;
indep_mat         745 ompi/mca/topo/treematch/treematch/tm_tree.c       indep_mat[i][j] = 1;
indep_mat         751 ompi/mca/topo/treematch/treematch/tm_tree.c   return indep_mat;
indep_mat         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)
indep_mat         767 ompi/mca/topo/treematch/treematch/tm_tree.c     if(indep_mat[id_elem][id_select] == 0 )
indep_mat         779 ompi/mca/topo/treematch/treematch/tm_tree.c 				      int8_t **indep_mat, pthread_mutex_t *lock, int thread_id, int *tab_i, int start_depth){
indep_mat         833 ompi/mca/topo/treematch/treematch/tm_tree.c       if(independent_groups_mat(selection, depth, elem, indep_mat)){
indep_mat         937 ompi/mca/topo/treematch/treematch/tm_tree.c   int8_t **indep_mat = (int8_t **) args[6];
indep_mat         986 ompi/mca/topo/treematch/treematch/tm_tree.c 	  if(!indep_mat[id2][id1]){
indep_mat         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);
indep_mat        1134 ompi/mca/topo/treematch/treematch/tm_tree.c   int8_t **indep_mat;
indep_mat        1176 ompi/mca/topo/treematch/treematch/tm_tree.c   indep_mat = init_independent_group_mat(nb_groups, tab_group, arity);
indep_mat        1186 ompi/mca/topo/treematch/treematch/tm_tree.c     args[6]=(void*)indep_mat;
indep_mat        1209 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(indep_mat[i]);
indep_mat        1215 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(indep_mat);
indep_mat        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)
indep_mat        1255 ompi/mca/topo/treematch/treematch/tm_tree.c       if(independent_groups_mat(selection, d, elem, indep_mat)){
indep_mat        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);
indep_mat        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)
indep_mat        1299 ompi/mca/topo/treematch/treematch/tm_tree.c       if(independent_groups_mat(selection, d, elem, indep_mat)){
indep_mat        1335 ompi/mca/topo/treematch/treematch/tm_tree.c   int8_t **indep_mat;
indep_mat        1351 ompi/mca/topo/treematch/treematch/tm_tree.c   indep_mat = init_independent_group_mat(n, tab_group, arity);
indep_mat        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);
indep_mat        1371 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(indep_mat[i]);
indep_mat        1372 ompi/mca/topo/treematch/treematch/tm_tree.c   FREE(indep_mat);