degrtab            90 ompi/mca/topo/treematch/treematch/fibo.c   if ((treeptr->degrtab = (FiboNode **) memAlloc ((sizeof (INT) << 3) * sizeof (FiboNode *))) == NULL) /* As many cells as there are bits in an INT */
degrtab            93 ompi/mca/topo/treematch/treematch/fibo.c   memSet (treeptr->degrtab, 0, (sizeof (INT) << 3) * sizeof (FiboNode *)); /* Make degree array ready for consolidation: all cells set to NULL */
degrtab           112 ompi/mca/topo/treematch/treematch/fibo.c   if (treeptr->degrtab != NULL)
degrtab           113 ompi/mca/topo/treematch/treematch/fibo.c     memFree (treeptr->degrtab);
degrtab           145 ompi/mca/topo/treematch/treematch/fibo.c   FiboNode ** restrict  degrtab;
degrtab           152 ompi/mca/topo/treematch/treematch/fibo.c   degrtab = treeptr->degrtab;
degrtab           161 ompi/mca/topo/treematch/treematch/fibo.c     if (degrtab[degrval] == NULL) {               /* If no tree with same degree already found */
degrtab           165 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = rootptr;                 /* Record tree as first tree with this degree      */
degrtab           173 ompi/mca/topo/treematch/treematch/fibo.c       oldrptr = degrtab[degrval];                 /* Assume old root is worse           */
degrtab           176 ompi/mca/topo/treematch/treematch/fibo.c         rootptr = degrtab[degrval];               /* We will go on processing this root */
degrtab           179 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = NULL;                    /* Remaining root changes degree so leaves this cell */
degrtab           200 ompi/mca/topo/treematch/treematch/fibo.c     if (degrtab[degrval] != NULL) {               /* If some tree is found           */
degrtab           201 ompi/mca/topo/treematch/treematch/fibo.c       bestptr = degrtab[degrval];                 /* Record it as potential best     */
degrtab           202 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = NULL;                    /* Clean-up used part of array     */
degrtab           208 ompi/mca/topo/treematch/treematch/fibo.c     if (degrtab[degrval] != NULL) {
degrtab           209 ompi/mca/topo/treematch/treematch/fibo.c       if (treeptr->cmpfptr (degrtab[degrval], bestptr) < 0) /* If new root is better */
degrtab           210 ompi/mca/topo/treematch/treematch/fibo.c         bestptr = degrtab[degrval];               /* Record new root as best root    */
degrtab           211 ompi/mca/topo/treematch/treematch/fibo.c       degrtab[degrval] = NULL;                    /* Clean-up used part of array     */
degrtab            92 ompi/mca/topo/treematch/treematch/fibo.h   FiboNode ** restrict      degrtab;              /*+ Consolidation array of size "bitsizeof (INT)"           +*/