rootptr 148 ompi/mca/topo/treematch/treematch/fibo.c FiboNode * rootptr; rootptr 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 */ rootptr 155 ompi/mca/topo/treematch/treematch/fibo.c rootptr != &treeptr->rootdat; ) { rootptr 156 ompi/mca/topo/treematch/treematch/fibo.c degrval = rootptr->deflval >> 1; /* Get degree, getting rid of flag part */ rootptr 165 ompi/mca/topo/treematch/treematch/fibo.c degrtab[degrval] = rootptr; /* Record tree as first tree with this degree */ rootptr 166 ompi/mca/topo/treematch/treematch/fibo.c rootptr = nextptr; /* Process next root in list during next iteration */ rootptr 167 ompi/mca/topo/treematch/treematch/fibo.c nextptr = rootptr->linkdat.nextptr; rootptr 174 ompi/mca/topo/treematch/treematch/fibo.c if (treeptr->cmpfptr (oldrptr, rootptr) <= 0) { /* If old root is still better */ rootptr 175 ompi/mca/topo/treematch/treematch/fibo.c oldrptr = rootptr; /* This root will be be linked to it */ rootptr 176 ompi/mca/topo/treematch/treematch/fibo.c rootptr = degrtab[degrval]; /* We will go on processing this root */ rootptr 182 ompi/mca/topo/treematch/treematch/fibo.c oldrptr->pareptr = rootptr; /* Remaining root is now father of old root */ rootptr 184 ompi/mca/topo/treematch/treematch/fibo.c chldptr = rootptr->chldptr; /* Get first child of remaining root */ rootptr 186 ompi/mca/topo/treematch/treematch/fibo.c rootptr->deflval += 2; /* Increase degree by 1, that is, by 2 with left shift in deflval */ rootptr 190 ompi/mca/topo/treematch/treematch/fibo.c rootptr->deflval = 2; /* Real degree set to 1, and flag set to 0 */ rootptr 191 ompi/mca/topo/treematch/treematch/fibo.c rootptr->chldptr = oldrptr;