rootdat            55 ompi/mca/topo/treematch/treematch/PriorityQueue.c   if(&(tree->rootdat) == (tree->rootdat.linkdat.nextptr)) 
rootdat            95 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.prevptr =              /* Link root node to itself */
rootdat            96 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.nextptr = &treeptr->rootdat;
rootdat           128 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.prevptr =              /* Link root node to itself */
rootdat           129 ompi/mca/topo/treematch/treematch/fibo.c   treeptr->rootdat.linkdat.nextptr = &treeptr->rootdat;
rootdat           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 */
rootdat           155 ompi/mca/topo/treematch/treematch/fibo.c        rootptr != &treeptr->rootdat; ) {
rootdat           353 ompi/mca/topo/treematch/treematch/fibo.c   for (nodeptr = treeptr->rootdat.linkdat.nextptr;
rootdat           354 ompi/mca/topo/treematch/treematch/fibo.c        nodeptr != &treeptr->rootdat; nodeptr = nodeptr->linkdat.nextptr) {
rootdat            91 ompi/mca/topo/treematch/treematch/fibo.h   FiboNode                  rootdat;              /*+ Dummy node for fast root insertion                      +*/
rootdat           122 ompi/mca/topo/treematch/treematch/fibo.h                                       fiboTreeLinkAfter (&((t)->rootdat), (n)); \
rootdat           137 ompi/mca/topo/treematch/treematch/fibo.h                                           fiboTreeLinkAfter (&((t)->rootdat), chldptr); \
rootdat           164 ompi/mca/topo/treematch/treematch/fibo.h                                         fiboTreeLinkAfter (&((t)->rootdat), pareptr);       \