treeptr            87 ompi/mca/topo/treematch/treematch/fibo.c FiboTree * const            treeptr,
treeptr            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 */
treeptr            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 */
treeptr            95 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.prevptr =              /* Link root node to itself */
treeptr            96 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.nextptr = &treeptr->rootdat;
treeptr            97 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->cmpfptr = cmpfptr;
treeptr           110 ompi/mca/topo/treematch/treematch/fibo.c FiboTree * const            treeptr)
treeptr           112 ompi/mca/topo/treematch/treematch/fibo.c   if (treeptr->degrtab != NULL)
treeptr           113 ompi/mca/topo/treematch/treematch/fibo.c     memFree (treeptr->degrtab);
treeptr           126 ompi/mca/topo/treematch/treematch/fibo.c FiboTree * const            treeptr)
treeptr           128 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.prevptr =              /* Link root node to itself */
treeptr           129 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.nextptr = &treeptr->rootdat;
treeptr           143 ompi/mca/topo/treematch/treematch/fibo.c FiboTree * const            treeptr)
treeptr           152 ompi/mca/topo/treematch/treematch/fibo.c   degrtab = treeptr->degrtab;
treeptr           154 ompi/mca/topo/treematch/treematch/fibo.c   for (rootptr = treeptr->rootdat.linkdat.nextptr, nextptr = rootptr->linkdat.nextptr, degrmax = 0; /* For all roots in root list */
treeptr           155 ompi/mca/topo/treematch/treematch/fibo.c        rootptr != &treeptr->rootdat; ) {
treeptr           174 ompi/mca/topo/treematch/treematch/fibo.c       if (treeptr->cmpfptr (oldrptr, rootptr) <= 0) { /* If old root is still better    */
treeptr           209 ompi/mca/topo/treematch/treematch/fibo.c       if (treeptr->cmpfptr (degrtab[degrval], bestptr) < 0) /* If new root is better */
treeptr           233 ompi/mca/topo/treematch/treematch/fibo.c FiboTree * const            treeptr)
treeptr           237 ompi/mca/topo/treematch/treematch/fibo.c   bestptr = fiboTreeMinMacro (treeptr);
treeptr           240 ompi/mca/topo/treematch/treematch/fibo.c   fiboTreeCheck (treeptr);
treeptr           259 ompi/mca/topo/treematch/treematch/fibo.c FiboTree * const            treeptr,
treeptr           262 ompi/mca/topo/treematch/treematch/fibo.c   fiboTreeAddMacro (treeptr, nodeptr);
treeptr           265 ompi/mca/topo/treematch/treematch/fibo.c   fiboTreeCheck (treeptr);
treeptr           283 ompi/mca/topo/treematch/treematch/fibo.c FiboTree * const            treeptr,
treeptr           286 ompi/mca/topo/treematch/treematch/fibo.c   fiboTreeDelMacro (treeptr, nodeptr);
treeptr           294 ompi/mca/topo/treematch/treematch/fibo.c   fiboTreeCheck (treeptr);
treeptr           349 ompi/mca/topo/treematch/treematch/fibo.c const FiboTree * const      treeptr)
treeptr           353 ompi/mca/topo/treematch/treematch/fibo.c   for (nodeptr = treeptr->rootdat.linkdat.nextptr;
treeptr           354 ompi/mca/topo/treematch/treematch/fibo.c        nodeptr != &treeptr->rootdat; nodeptr = nodeptr->linkdat.nextptr) {