Searched refs:recursionNodeStackTop (Results 1 – 2 of 2) sorted by relevance
91 it->recursionNodeStackTop = 1; in IT_create()799 Assert((it->recursionNodeStackTop == 1), in IT_enumerate()810 if (it->recursionNodeStackTop == it->recursionNodeStackSize) { in IT_enumerate()816 it->recursionNodeStack[it->recursionNodeStackTop].start_node = x; in IT_enumerate()817 it->recursionNodeStack[it->recursionNodeStackTop].tryRightBranch = 0; in IT_enumerate()818 it->recursionNodeStack[it->recursionNodeStackTop].parentIndex = it->currentParent; in IT_enumerate()819 it->currentParent = it->recursionNodeStackTop++; in IT_enumerate()825 while (!stuffToDo && (it->recursionNodeStackTop > 1)) { in IT_enumerate()826 if (it->recursionNodeStack[--it->recursionNodeStackTop].tryRightBranch) { in IT_enumerate()827 x=it->recursionNodeStack[it->recursionNodeStackTop].start_node->right; in IT_enumerate()[all …]
48 unsigned int recursionNodeStackTop; member