Searched refs:fNodeStack (Results 1 – 3 of 3) sorted by relevance
97 fNodeStack[0] = NULL; in RBBIRuleScanner()176 delete fNodeStack[fNodeStackPtr]; in ~RBBIRuleScanner()213 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()227 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()258 n = fNodeStack[fNodeStackPtr-1]; in doParseActions()277 RBBINode *startExprNode = fNodeStack[fNodeStackPtr-2]; in doParseActions()278 RBBINode *varRefNode = fNodeStack[fNodeStackPtr-1]; in doParseActions()279 RBBINode *RHSExprNode = fNodeStack[fNodeStackPtr]; in doParseActions()321 RBBINode *thisRule = fNodeStack[fNodeStackPtr]; in doParseActions()327 fNodeStack[fNodeStackPtr] = catNode; in doParseActions()[all …]
231 UStack fNodeStack; // Stack of nodes to process member in MutableTrieEnumeration246 : fNodeStack(status), fBranchStack(status) { in MutableTrieEnumeration()248 fNodeStack.push(root, status); in MutableTrieEnumeration()262 if (fNodeStack.empty() || U_FAILURE(status)) { in snext()265 TernaryNode *node = (TernaryNode *) fNodeStack.peek(); in snext()267 while (!fNodeStack.empty() && U_SUCCESS(status)) { in snext()275 node = (TernaryNode *) fNodeStack.push(node->low, status); in snext()291 node = (TernaryNode *) fNodeStack.push(node->equal, status); in snext()307 node = (TernaryNode *) fNodeStack.push(node->high, status); in snext()312 fNodeStack.pop(); in snext()[all …]
120 RBBINode *fNodeStack[kStackSize]; // Node stack, holds nodes created variable