Cross Reference: /external/icu4c/common/rbbiscan.cpp

Lines Matching refs:RBBINode
198     RBBINode *n       = NULL;
205         pushNewNode(RBBINode::opStart);
212             fixOpStack(RBBINode::precOpCat);
213             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];
214             RBBINode  *orNode      = pushNewNode(RBBINode::opOr);
226             fixOpStack(RBBINode::precOpCat);
227             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];
228             RBBINode  *catNode     = pushNewNode(RBBINode::opCat);
240         pushNewNode(RBBINode::opLParen);
244         fixOpStack(RBBINode::precLParen);
263         pushNewNode(RBBINode::opStart);
275             fixOpStack(RBBINode::precStart);
277             RBBINode *startExprNode  = fNodeStack[fNodeStackPtr-2];
278             RBBINode *varRefNode     = fNodeStack[fNodeStackPtr-1];
279             RBBINode *RHSExprNode    = fNodeStack[fNodeStackPtr];
309         fixOpStack(RBBINode::precStart);      // Terminate expression, leaves expression
321             RBBINode  *thisRule       = fNodeStack[fNodeStackPtr];
322             RBBINode  *endNode        = pushNewNode(RBBINode::endMark);
323             RBBINode  *catNode        = pushNewNode(RBBINode::opCat);
340         RBBINode **destRules = (fReverseRule? &fRB->fReverseTree : fRB->fDefaultTree);
348             RBBINode  *thisRule    = fNodeStack[fNodeStackPtr];
349             RBBINode  *prevRules   = *destRules;
350             RBBINode  *orNode      = pushNewNode(RBBINode::opOr);
389             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];
390             RBBINode  *plusNode    = pushNewNode(RBBINode::opPlus);
398             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];
399             RBBINode  *qNode       = pushNewNode(RBBINode::opQuestion);
407             RBBINode  *operandNode = fNodeStack[fNodeStackPtr--];
408             RBBINode  *starNode    = pushNewNode(RBBINode::opStar);
421             n = pushNewNode(RBBINode::setRef);
432             n = pushNewNode(RBBINode::setRef);
442         n = pushNewNode(RBBINode::lookAhead);
453         n = pushNewNode(RBBINode::tag);
513         n = pushNewNode(RBBINode::varRef);
522         if (n==NULL || n->fType != RBBINode::varRef) {
606 void RBBIRuleScanner::fixOpStack(RBBINode::OpPrecedence p) {
607     RBBINode *n;
617         if (n->fPrecedence < p || n->fPrecedence <= RBBINode::precLParen) {
631     if (p <= RBBINode::precLParen) {
668 void RBBIRuleScanner::findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt) {
679         U_ASSERT(node->fLeftChild->fType == RBBINode::uset);
700     RBBINode *usetNode    = new RBBINode(RBBINode::uset);
1052         fRB->fReverseTree  = pushNewNode(RBBINode::opStar);
1053         RBBINode  *operand = pushNewNode(RBBINode::setRef);
1101 //  pushNewNode   create a new RBBINode of the specified type and push it
1105 RBBINode  *RBBIRuleScanner::pushNewNode(RBBINode::NodeType  t) {
1113     fNodeStack[fNodeStackPtr] = new RBBINode(t);
1191         RBBINode         *n;
1193         n = pushNewNode(RBBINode::setRef);