tab_group 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, tab_group 693 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", tab_group[i]->tab[j]->id); tab_group 695 ompi/mca/topo/treematch/treematch/tm_tree.c printf(" : %f\n", tab_group[i]->val); tab_group 705 ompi/mca/topo/treematch/treematch/tm_tree.c selection[0] = tab_group[i]; tab_group 706 ompi/mca/topo/treematch/treematch/tm_tree.c val = tab_group[i]->val; tab_group 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); tab_group 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){ tab_group 735 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *elem1 = tab_group[i]; tab_group 736 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *elem2 = tab_group[j]; tab_group 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, tab_group 817 ompi/mca/topo/treematch/treematch/tm_tree.c elem = tab_group[i]; tab_group 893 ompi/mca/topo/treematch/treematch/tm_tree.c static group_list_t ** tab_group_dup(group_list_t **tab_group, int nb_groups){ tab_group 900 ompi/mca/topo/treematch/treematch/tm_tree.c res[i] = group_dup(tab_group[i], nb_groups); tab_group 932 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t **tab_group = (group_list_t **) args[0]; tab_group 963 ompi/mca/topo/treematch/treematch/tm_tree.c while(work->tab_group){ tab_group 983 ompi/mca/topo/treematch/treematch/tm_tree.c id1 = work->tab_group[i]; tab_group 985 ompi/mca/topo/treematch/treematch/tm_tree.c id2 = work->tab_group[j]; tab_group 995 ompi/mca/topo/treematch/treematch/tm_tree.c id = work->tab_group[i]; tab_group 996 ompi/mca/topo/treematch/treematch/tm_tree.c selection[i] = tab_group[id]; tab_group 997 ompi/mca/topo/treematch/treematch/tm_tree.c val += tab_group[id]->val; tab_group 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); tab_group 1071 ompi/mca/topo/treematch/treematch/tm_tree.c int *tab_group = MALLOC(size*sizeof(int)); tab_group 1072 ompi/mca/topo/treematch/treematch/tm_tree.c memcpy(tab_group, tab, size*sizeof(int)); tab_group 1073 ompi/mca/topo/treematch/treematch/tm_tree.c cur->tab_group = tab_group; tab_group 1080 ompi/mca/topo/treematch/treematch/tm_tree.c static work_unit_t *generate_work_units(work_unit_t *cur, int i, int id, int *tab_group,int size, int id_max){ tab_group 1082 ompi/mca/topo/treematch/treematch/tm_tree.c tab_group[i] = id; tab_group 1084 ompi/mca/topo/treematch/treematch/tm_tree.c return create_work_unit(cur,tab_group,size); tab_group 1093 ompi/mca/topo/treematch/treematch/tm_tree.c cur = generate_work_units(cur,i+1,id,tab_group, size, id_max); tab_group 1104 ompi/mca/topo/treematch/treematch/tm_tree.c int *tab_group = MALLOC(work_size*sizeof(int)); tab_group 1106 ompi/mca/topo/treematch/treematch/tm_tree.c cur = generate_work_units(cur,0,0,tab_group,3,n); tab_group 1107 ompi/mca/topo/treematch/treematch/tm_tree.c cur = generate_work_units(cur,0,1,tab_group,2,n); tab_group 1108 ompi/mca/topo/treematch/treematch/tm_tree.c cur = generate_work_units(cur,0,2,tab_group,2,n); tab_group 1111 ompi/mca/topo/treematch/treematch/tm_tree.c cur = generate_work_units(cur,0,i,tab_group,1,n); tab_group 1113 ompi/mca/topo/treematch/treematch/tm_tree.c for(cur = res; cur->tab_group; cur = cur-> next) tab_group 1118 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(tab_group); tab_group 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, tab_group 1150 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", tab_group[i]->tab[j]->id); tab_group 1152 ompi/mca/topo/treematch/treematch/tm_tree.c printf(" : %.0f\nb_groups", tab_group[i]->val); tab_group 1161 ompi/mca/topo/treematch/treematch/tm_tree.c val_array[nb_groups-i-1] = tab_group[i]->val; tab_group 1163 ompi/mca/topo/treematch/treematch/tm_tree.c tab_group[i]->bound = build_bound_array(val_array,nb_groups-i); tab_group 1166 ompi/mca/topo/treematch/treematch/tm_tree.c printf("-->(%d--%d) %.0f: ", i, nb_groups-i-1, tab_group[i]->val); tab_group 1168 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%.0f - ",tab_group[i]->bound[j]); tab_group 1176 ompi/mca/topo/treematch/treematch/tm_tree.c indep_mat = init_independent_group_mat(nb_groups, tab_group, arity); tab_group 1180 ompi/mca/topo/treematch/treematch/tm_tree.c args[0]=(void*)tab_group; tab_group 1212 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(tab_group[i]->bound); tab_group 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, tab_group 1343 ompi/mca/topo/treematch/treematch/tm_tree.c printf("%d ", tab_group[i]->tab[j]->id); tab_group 1345 ompi/mca/topo/treematch/treematch/tm_tree.c printf(" : %f\n", tab_group[i]->val); tab_group 1351 ompi/mca/topo/treematch/treematch/tm_tree.c indep_mat = init_independent_group_mat(n, tab_group, arity); tab_group 1359 ompi/mca/topo/treematch/treematch/tm_tree.c selection[0] = tab_group[i]; tab_group 1360 ompi/mca/topo/treematch/treematch/tm_tree.c val = tab_group[i]->val; tab_group 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); tab_group 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) tab_group 1400 ompi/mca/topo/treematch/treematch/tm_tree.c selection[0] = tab_group[i]; tab_group 1401 ompi/mca/topo/treematch/treematch/tm_tree.c val = tab_group[i]->val; tab_group 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); tab_group 1774 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t list, **best_selection = NULL, **tab_group = NULL; tab_group 1834 ompi/mca/topo/treematch/treematch/tm_tree.c tab_group = (group_list_t**)MALLOC(sizeof(group_list_t*)*nb_groups); tab_group 1835 ompi/mca/topo/treematch/treematch/tm_tree.c list_to_tab(list.next, tab_group, nb_groups); tab_group 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); tab_group 1857 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(tab_group, nb_groups, sizeof(group_list_t*), group_list_asc); tab_group 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); tab_group 1870 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(tab_group, nb_groups, sizeof(group_list_t*), group_list_dsc); tab_group 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); tab_group 1887 ompi/mca/topo/treematch/treematch/tm_tree.c compute_weighted_degree(tab_group, nb_groups, arity); tab_group 1892 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(tab_group, nb_groups, sizeof(group_list_t*), weighted_degree_dsc); tab_group 1895 ompi/mca/topo/treematch/treematch/tm_tree.c tab_group[i]->id = i; tab_group 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); tab_group 1915 ompi/mca/topo/treematch/treematch/tm_tree.c thread_exhaustive_search(tab_group, nb_groups, arity, solution_size, &best_val, best_selection); tab_group 1942 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(tab_group); tab_group 32 ompi/mca/topo/treematch/treematch/tm_tree.h int *tab_group;