202     RBBINode *n       = NULL;  in doParseActions()
209         pushNewNode(RBBINode::opStart);  in doParseActions()
222             fixOpStack(RBBINode::precOpCat);  in doParseActions()
223             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];  in doParseActions()
224             RBBINode  *orNode      = pushNewNode(RBBINode::opOr);  in doParseActions()
239             fixOpStack(RBBINode::precOpCat);  in doParseActions()
240             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];  in doParseActions()
241             RBBINode  *catNode     = pushNewNode(RBBINode::opCat);  in doParseActions()
256         pushNewNode(RBBINode::opLParen);  in doParseActions()
260         fixOpStack(RBBINode::precLParen);  in doParseActions()
279         pushNewNode(RBBINode::opStart);  in doParseActions()
291             fixOpStack(RBBINode::precStart);  in doParseActions()
293             RBBINode *startExprNode  = fNodeStack[fNodeStackPtr-2];  in doParseActions()
294             RBBINode *varRefNode     = fNodeStack[fNodeStackPtr-1];  in doParseActions()
295             RBBINode *RHSExprNode    = fNodeStack[fNodeStackPtr];  in doParseActions()
325         fixOpStack(RBBINode::precStart);      // Terminate expression, leaves expression  in doParseActions()
333         RBBINode *thisRule = fNodeStack[fNodeStackPtr];  in doParseActions()
338             RBBINode  *endNode        = pushNewNode(RBBINode::endMark);  in doParseActions()
339             RBBINode  *catNode        = pushNewNode(RBBINode::opCat);  in doParseActions()
375         RBBINode **destRules = (fReverseRule? &fRB->fSafeRevTree : fRB->fDefaultTree);  in doParseActions()
384             RBBINode  *prevRules   = *destRules;  in doParseActions()
385             RBBINode  *orNode      = pushNewNode(RBBINode::opOr);  in doParseActions()
428             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];  in doParseActions()
429             RBBINode  *plusNode    = pushNewNode(RBBINode::opPlus);  in doParseActions()
440             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];  in doParseActions()
441             RBBINode  *qNode       = pushNewNode(RBBINode::opQuestion);  in doParseActions()
452             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];  in doParseActions()
453             RBBINode  *starNode    = pushNewNode(RBBINode::opStar);  in doParseActions()
469             n = pushNewNode(RBBINode::setRef);  in doParseActions()
483             n = pushNewNode(RBBINode::setRef);  in doParseActions()
496         n = pushNewNode(RBBINode::lookAhead);  in doParseActions()
510         n = pushNewNode(RBBINode::tag);  in doParseActions()
577         n = pushNewNode(RBBINode::varRef);  in doParseActions()
586         if (n==NULL || n->fType != RBBINode::varRef) {  in doParseActions()
670 void RBBIRuleScanner::fixOpStack(RBBINode::OpPrecedence p) {  in fixOpStack()
671     RBBINode *n;  in fixOpStack()
681         if (n->fPrecedence < p || n->fPrecedence <= RBBINode::precLParen) {  in fixOpStack()
695     if (p <= RBBINode::precLParen) {  in fixOpStack()
732 void RBBIRuleScanner::findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt) {  in findSetFor()
743         U_ASSERT(node->fLeftChild->fType == RBBINode::uset);  in findSetFor()
764     RBBINode *usetNode    = new RBBINode(RBBINode::uset);  in findSetFor()
1134         RBBINode::printTree(fRB->fForwardTree, TRUE);  in parse()
1136         RBBINode::printTree(fRB->fReverseTree, TRUE);  in parse()
1138         RBBINode::printTree(fRB->fSafeFwdTree, TRUE);  in parse()
1140         RBBINode::printTree(fRB->fSafeRevTree, TRUE);  in parse()
1155     for (i=fNodeStackPtr; i>0; i--) {RBBINode::printTree(fNodeStack[i], TRUE);}  in printNodeStack()
1168 RBBINode  *RBBIRuleScanner::pushNewNode(RBBINode::NodeType  t) {  in pushNewNode()
1178     fNodeStack[fNodeStackPtr] = new RBBINode(t);  in pushNewNode()
1257         RBBINode         *n;  in scanSet()
1259         n = pushNewNode(RBBINode::setRef);  in scanSet()