dumb_id           160 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int          dumb_id, min_nb_dumb = n, sum_dumb = 0, p;
dumb_id           216 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     dumb_id = n - sum_dumb; /* now dumb_id is the number of free vertices*/
dumb_id           219 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	parttab[dumb_id] = i;
dumb_id           220 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	dumb_id++;
dumb_id           223 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     p = dumb_id; 
dumb_id           226 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	parttab[dumb_id] = i;
dumb_id           227 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	dumb_id++;
dumb_id           347 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int dumb_id, nb_dumb;
dumb_id           386 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       dumb_id = n-1;
dumb_id           406 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	  partition[dumb_id] = i;
dumb_id           407 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	  dumb_id--;