FiboNode 7 ompi/mca/topo/treematch/treematch/PriorityQueue.c int compfunc(const FiboNode * const, const FiboNode * const); FiboNode 11 ompi/mca/topo/treematch/treematch/PriorityQueue.c static int compFunc(const FiboNode * const node1, const FiboNode * const node2) FiboNode 64 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeAdd((FiboTree *)q, (FiboNode *)(e)); FiboNode 71 ompi/mca/topo/treematch/treematch/PriorityQueue.c fiboTreeDel((FiboTree *)q, (FiboNode *)(e)); FiboNode 12 ompi/mca/topo/treematch/treematch/PriorityQueue.h FiboNode node; /*the node used to insert the element in a FiboTree*/ FiboNode 88 ompi/mca/topo/treematch/treematch/fibo.c int (* cmpfptr) (const FiboNode * const, const FiboNode * const)) FiboNode 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 */ FiboNode 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 */ FiboNode 141 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * FiboNode 145 ompi/mca/topo/treematch/treematch/fibo.c FiboNode ** restrict degrtab; FiboNode 148 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * rootptr; FiboNode 149 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * nextptr; FiboNode 150 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * bestptr; FiboNode 170 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * oldrptr; /* Root which will no longer be a root */ FiboNode 171 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * chldptr; FiboNode 231 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * FiboNode 235 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * bestptr; FiboNode 260 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * const nodeptr) FiboNode 284 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * const nodeptr) FiboNode 312 ompi/mca/topo/treematch/treematch/fibo.c const FiboNode * const nodeptr) FiboNode 314 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * chldptr; FiboNode 351 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * nodeptr; FiboNode 91 ompi/mca/topo/treematch/treematch/fibo.h FiboNode rootdat; /*+ Dummy node for fast root insertion +*/ FiboNode 92 ompi/mca/topo/treematch/treematch/fibo.h FiboNode ** restrict degrtab; /*+ Consolidation array of size "bitsizeof (INT)" +*/ FiboNode 93 ompi/mca/topo/treematch/treematch/fibo.h int (* cmpfptr) (const FiboNode * const, const FiboNode * const); /*+ Comparison routine +*/ FiboNode 105 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * nextptr; \ FiboNode 128 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * chldptr; \ FiboNode 131 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * cendptr; \ FiboNode 134 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * nextptr; \ FiboNode 144 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * pareptr; \ FiboNode 145 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * rghtptr; \ FiboNode 153 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * gdpaptr; \ FiboNode 187 ompi/mca/topo/treematch/treematch/fibo.h int fiboTreeInit (FiboTree * const, int (*) (const FiboNode * const, const FiboNode * const)); FiboNode 190 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * fiboTreeConsolidate (FiboTree * const); FiboNode 192 ompi/mca/topo/treematch/treematch/fibo.h void fiboTreeAdd (FiboTree * const, FiboNode * const); FiboNode 195 ompi/mca/topo/treematch/treematch/fibo.h void fiboTreeDel (FiboTree * const, FiboNode * const); FiboNode 198 ompi/mca/topo/treematch/treematch/fibo.h FiboNode * fiboTreeMin (FiboTree * const); FiboNode 202 ompi/mca/topo/treematch/treematch/fibo.h static int fiboTreeCheck2 (const FiboNode * const);