nb_dumb           159 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int          *nb_dumb = (int *)MALLOC(sizeof(int) * k); /*number of dumb vertices per partition */ 
nb_dumb           188 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       nb_dumb[i] = n/k - (end-start);
nb_dumb           189 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       sum_dumb += nb_dumb[i];
nb_dumb           190 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if(nb_dumb[i] < min_nb_dumb){
nb_dumb           191 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	min_nb_dumb = nb_dumb[i];
nb_dumb           218 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       for( j = 0; j < nb_dumb[i] - min_nb_dumb; j ++ ){
nb_dumb           282 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   FREE(nb_dumb);
nb_dumb           347 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int dumb_id, nb_dumb;
nb_dumb           399 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	nb_dumb = n/k - (end-start);
nb_dumb           405 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	for( j = 0; j < nb_dumb; j ++ ){
nb_dumb           410 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	size[i] += nb_dumb;