nb_groups         418 ompi/mca/topo/treematch/treematch/tm_bucket.c int add_edge_3(tm_tree_t *tab_node, tm_tree_t *parent,int i,int j,int *nb_groups)
nb_groups         429 ompi/mca/topo/treematch/treematch/tm_bucket.c 	printf("%d: %d-%d\n",*nb_groups,parent->child[0]->id,parent->child[1]->id);
nb_groups         443 ompi/mca/topo/treematch/treematch/tm_bucket.c 	printf("%d: %d-%d-%d\n",*nb_groups,parent->child[0]->id,parent->child[1]->id,parent->child[2]->id);
nb_groups         445 ompi/mca/topo/treematch/treematch/tm_bucket.c       (*nb_groups)++;
nb_groups         457 ompi/mca/topo/treematch/treematch/tm_bucket.c 	printf("%d: %d-%d-%d\n",*nb_groups,parent->child[0]->id,parent->child[1]->id,parent->child[2]->id);
nb_groups         459 ompi/mca/topo/treematch/treematch/tm_bucket.c       (*nb_groups)++;
nb_groups         467 ompi/mca/topo/treematch/treematch/tm_bucket.c int try_add_edge(tm_tree_t *tab_node, tm_tree_t *parent,int arity,int i,int j,int *nb_groups)
nb_groups         483 ompi/mca/topo/treematch/treematch/tm_bucket.c     (*nb_groups)++;
nb_groups         487 ompi/mca/topo/treematch/treematch/tm_bucket.c     return add_edge_3(tab_node,parent,i,j,nb_groups);
nb_groups         543 ompi/mca/topo/treematch/treematch/tm_bucket.c   int l,i,j,nb_groups;
nb_groups         567 ompi/mca/topo/treematch/treematch/tm_bucket.c   nb_groups = 0;
nb_groups         579 ompi/mca/topo/treematch/treematch/tm_bucket.c       if(try_add_edge(tab_node,&new_tab_node[l],arity,i,j,&nb_groups)){
nb_groups         587 ompi/mca/topo/treematch/treematch/tm_bucket.c       if(try_add_edge(tab_node,&new_tab_node[l],arity,i,j,&nb_groups)){
nb_groups         598 ompi/mca/topo/treematch/treematch/tm_bucket.c     printf("l=%d,nb_groups=%d\n",l,nb_groups);
nb_groups         601 ompi/mca/topo/treematch/treematch/tm_bucket.c   while( nb_groups < M ){
nb_groups         603 ompi/mca/topo/treematch/treematch/tm_bucket.c     try_add_edge(tab_node,NULL,arity,i,j,&nb_groups);
nb_groups         611 ompi/mca/topo/treematch/treematch/tm_bucket.c     printf("l=%d,nb_groups=%d\n",l,nb_groups);
nb_groups          33 ompi/mca/topo/treematch/treematch/tm_bucket.h int try_add_edge(tm_tree_t *tab_node, tm_tree_t *parent,int arity,int i,int j,int *nb_groups);
nb_groups         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,
nb_groups         788 ompi/mca/topo/treematch/treematch/tm_tree.c   nb_available_groups = nb_groups - i;
nb_groups         816 ompi/mca/topo/treematch/treematch/tm_tree.c   while( i < nb_groups ){
nb_groups         849 ompi/mca/topo/treematch/treematch/tm_tree.c     nb_available_groups = nb_groups - i;
nb_groups         866 ompi/mca/topo/treematch/treematch/tm_tree.c static group_list_t * group_dup(group_list_t *group, int nb_groups){
nb_groups         870 ompi/mca/topo/treematch/treematch/tm_tree.c    size_t bound_size = nb_groups-group->id+2;
nb_groups         893 ompi/mca/topo/treematch/treematch/tm_tree.c static group_list_t **  tab_group_dup(group_list_t **tab_group, int nb_groups){
nb_groups         897 ompi/mca/topo/treematch/treematch/tm_tree.c   res = (group_list_t**)MALLOC(sizeof(group_list_t*)*nb_groups);
nb_groups         899 ompi/mca/topo/treematch/treematch/tm_tree.c   for(i=0 ; i<nb_groups ; i++){
nb_groups         900 ompi/mca/topo/treematch/treematch/tm_tree.c     res[i] = group_dup(tab_group[i], nb_groups);
nb_groups         982 ompi/mca/topo/treematch/treematch/tm_tree.c       for(i=0;i<work->nb_groups;i++){
nb_groups         984 ompi/mca/topo/treematch/treematch/tm_tree.c 	for(j=i+1;j<work->nb_groups;j++){
nb_groups         994 ompi/mca/topo/treematch/treematch/tm_tree.c       for(i=0;i<work->nb_groups;i++){
nb_groups         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);
nb_groups        1074 ompi/mca/topo/treematch/treematch/tm_tree.c   cur->nb_groups = size;
nb_groups        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,
nb_groups        1145 ompi/mca/topo/treematch/treematch/tm_tree.c   work_list = create_tab_work(nb_groups);
nb_groups        1148 ompi/mca/topo/treematch/treematch/tm_tree.c     for(i=0;i<nb_groups;i++){
nb_groups        1158 ompi/mca/topo/treematch/treematch/tm_tree.c   val_array = (double *)MALLOC(nb_groups*sizeof(double));
nb_groups        1160 ompi/mca/topo/treematch/treematch/tm_tree.c   for( i=nb_groups-1 ; i>=0 ; i--){
nb_groups        1161 ompi/mca/topo/treematch/treematch/tm_tree.c     val_array[nb_groups-i-1] = tab_group[i]->val;
nb_groups        1163 ompi/mca/topo/treematch/treematch/tm_tree.c     tab_group[i]->bound = build_bound_array(val_array,nb_groups-i);
nb_groups        1166 ompi/mca/topo/treematch/treematch/tm_tree.c       printf("-->(%d--%d) %.0f: ", i, nb_groups-i-1, tab_group[i]->val);
nb_groups        1167 ompi/mca/topo/treematch/treematch/tm_tree.c       for(j=1 ; j<nb_groups-i;j++){
nb_groups        1176 ompi/mca/topo/treematch/treematch/tm_tree.c   indep_mat = init_independent_group_mat(nb_groups, tab_group, arity);
nb_groups        1181 ompi/mca/topo/treematch/treematch/tm_tree.c     args[1]=(void*)&nb_groups;
nb_groups        1208 ompi/mca/topo/treematch/treematch/tm_tree.c   for( i=0 ; i<nb_groups ; i++){
nb_groups        1211 ompi/mca/topo/treematch/treematch/tm_tree.c     if(i!=nb_groups-1)
nb_groups        1390 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, dec, nb_groups=0;
nb_groups        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);
nb_groups        1404 ompi/mca/topo/treematch/treematch/tm_tree.c       printf("%d:%d\n", i, nb_groups);
nb_groups        1406 ompi/mca/topo/treematch/treematch/tm_tree.c     if(nb_groups >= bound){
nb_groups        1505 ompi/mca/topo/treematch/treematch/tm_tree.c 		 double *best_val, tm_tree_t **cur_group, int *nb_groups, int max_groups)
nb_groups        1515 ompi/mca/topo/treematch/treematch/tm_tree.c     (*nb_groups)++;
nb_groups        1519 ompi/mca/topo/treematch/treematch/tm_tree.c       printf("Grouping %d: %f\n", *nb_groups, val);
nb_groups        1546 ompi/mca/topo/treematch/treematch/tm_tree.c     fast_group(aff_mat, tab_node, parent, i, arity, n+1, best_val, cur_group, nb_groups, max_groups);
nb_groups        1547 ompi/mca/topo/treematch/treematch/tm_tree.c     if(*nb_groups > max_groups)
nb_groups        1556 ompi/mca/topo/treematch/treematch/tm_tree.c double fast_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size, double nb_groups)
nb_groups        1569 ompi/mca/topo/treematch/treematch/tm_tree.c     fast_group(aff_mat, tab_node, &new_tab_node[l], -1, arity, 0, &best_val, cur_group, &nb_done, MAX(10, (int)(50-CmiLog2(nb_groups))-solution_size/10));
nb_groups        1651 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, e, l, nb_groups;
nb_groups        1684 ompi/mca/topo/treematch/treematch/tm_tree.c   nb_groups = 0;
nb_groups        1686 ompi/mca/topo/treematch/treematch/tm_tree.c     if(try_add_edge(tab_node, &new_tab_node[l], arity, graph[i].i, graph[i].j, &nb_groups))
nb_groups        1823 ompi/mca/topo/treematch/treematch/tm_tree.c     unsigned long int  nb_groups = (unsigned long int) nbg;
nb_groups        1833 ompi/mca/topo/treematch/treematch/tm_tree.c     assert( list_size == nb_groups);
nb_groups        1834 ompi/mca/topo/treematch/treematch/tm_tree.c     tab_group = (group_list_t**)MALLOC(sizeof(group_list_t*)*nb_groups);
nb_groups        1835 ompi/mca/topo/treematch/treematch/tm_tree.c     list_to_tab(list.next, tab_group, nb_groups);
nb_groups        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);
nb_groups        1857 ompi/mca/topo/treematch/treematch/tm_tree.c     qsort(tab_group, nb_groups, sizeof(group_list_t*), group_list_asc);
nb_groups        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);
nb_groups        1870 ompi/mca/topo/treematch/treematch/tm_tree.c     qsort(tab_group, nb_groups, sizeof(group_list_t*), group_list_dsc);
nb_groups        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);
nb_groups        1879 ompi/mca/topo/treematch/treematch/tm_tree.c     if( nb_groups < 1000000 ){
nb_groups        1887 ompi/mca/topo/treematch/treematch/tm_tree.c       compute_weighted_degree(tab_group, nb_groups, arity);
nb_groups        1892 ompi/mca/topo/treematch/treematch/tm_tree.c       qsort(tab_group, nb_groups, sizeof(group_list_t*), weighted_degree_dsc);
nb_groups        1894 ompi/mca/topo/treematch/treematch/tm_tree.c       for( i=0 ; i<nb_groups ; i++)
nb_groups        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);
nb_groups        1912 ompi/mca/topo/treematch/treematch/tm_tree.c 	printf("Running exhaustive search on %ld groups, please wait...\n",nb_groups);
nb_groups        1915 ompi/mca/topo/treematch/treematch/tm_tree.c       thread_exhaustive_search(tab_group, nb_groups, arity, solution_size, &best_val, best_selection);
nb_groups          31 ompi/mca/topo/treematch/treematch/tm_tree.h   int nb_groups;