parttab           126 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int  check_partition(SCOTCH_Num *parttab, int k, int n){
parttab           130 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     count[parttab[i]]++;
parttab           156 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num   *parttab = (SCOTCH_Num *)MALLOC(sizeof(SCOTCH_Num) * n);
parttab           169 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     parttab[i] = -1;
parttab           219 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	parttab[dumb_id] = i;
parttab           226 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	parttab[dumb_id] = i;
parttab           247 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       printf("%d ",(int)parttab[i]);
parttab           252 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   if(SCOTCH_graphPartFixed(graphptr, partnbr, &strat, parttab) == 0){
parttab           256 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	printf("%d ",(int)parttab[i]);
parttab           267 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   if(!check_partition(parttab, partnbr, n)){
parttab           275 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       partition[i] = parttab [i];
parttab           281 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   FREE(parttab);