degrval           147 ompi/mca/topo/treematch/treematch/fibo.c   int                   degrval;
degrval           156 ompi/mca/topo/treematch/treematch/fibo.c     degrval = rootptr->deflval >> 1;              /* Get degree, getting rid of flag part */
degrval           158 ompi/mca/topo/treematch/treematch/fibo.c     if (degrval >= (sizeof (INT) << 3))
degrval           161 ompi/mca/topo/treematch/treematch/fibo.c     if (degrtab[degrval] == NULL) {               /* If no tree with same degree already found */
degrval           162 ompi/mca/topo/treematch/treematch/fibo.c       if (degrval > degrmax)                      /* Record highest degree found               */
degrval           163 ompi/mca/topo/treematch/treematch/fibo.c         degrmax = degrval;
degrval           165 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = rootptr;                 /* Record tree as first tree with this degree      */
degrval           173 ompi/mca/topo/treematch/treematch/fibo.c       oldrptr = degrtab[degrval];                 /* Assume old root is worse           */
degrval           176 ompi/mca/topo/treematch/treematch/fibo.c         rootptr = degrtab[degrval];               /* We will go on processing this root */
degrval           179 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = NULL;                    /* Remaining root changes degree so leaves this cell */
degrval           199 ompi/mca/topo/treematch/treematch/fibo.c   for (degrval = 0; degrval <= degrmax; degrval ++) {
degrval           200 ompi/mca/topo/treematch/treematch/fibo.c     if (degrtab[degrval] != NULL) {               /* If some tree is found           */
degrval           201 ompi/mca/topo/treematch/treematch/fibo.c       bestptr = degrtab[degrval];                 /* Record it as potential best     */
degrval           202 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = NULL;                    /* Clean-up used part of array     */
degrval           203 ompi/mca/topo/treematch/treematch/fibo.c       degrval ++;                                 /* Go on at next cell in next loop */
degrval           207 ompi/mca/topo/treematch/treematch/fibo.c   for ( ; degrval <= degrmax; degrval ++) {       /* For remaining roots once a potential best root has been found */
degrval           208 ompi/mca/topo/treematch/treematch/fibo.c     if (degrtab[degrval] != NULL) {
degrval           209 ompi/mca/topo/treematch/treematch/fibo.c       if (treeptr->cmpfptr (degrtab[degrval], bestptr) < 0) /* If new root is better */
degrval           210 ompi/mca/topo/treematch/treematch/fibo.c         bestptr = degrtab[degrval];               /* Record new root as best root    */
degrval           211 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = NULL;                    /* Clean-up used part of array     */
degrval           315 ompi/mca/topo/treematch/treematch/fibo.c   int                   degrval;
degrval           317 ompi/mca/topo/treematch/treematch/fibo.c   degrval = 0;
degrval           334 ompi/mca/topo/treematch/treematch/fibo.c       degrval ++;
degrval           339 ompi/mca/topo/treematch/treematch/fibo.c   if (degrval != (nodeptr->deflval >> 1)) {       /* Real node degree is obtained by discarding lowest bit */