Home | History | Annotate | Download | only in common

Lines Matching refs:RBBINode

32 #include "rbbinode.h"
199 RBBINode *n = NULL;
206 pushNewNode(RBBINode::opStart);
213 fixOpStack(RBBINode::precOpCat);
214 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
215 RBBINode *orNode = pushNewNode(RBBINode::opOr);
227 fixOpStack(RBBINode::precOpCat);
228 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
229 RBBINode *catNode = pushNewNode(RBBINode::opCat);
241 pushNewNode(RBBINode::opLParen);
245 fixOpStack(RBBINode::precLParen);
264 pushNewNode(RBBINode::opStart);
276 fixOpStack(RBBINode::precStart);
278 RBBINode *startExprNode = fNodeStack[fNodeStackPtr-2];
279 RBBINode *varRefNode = fNodeStack[fNodeStackPtr-1];
280 RBBINode *RHSExprNode = fNodeStack[fNodeStackPtr];
310 fixOpStack(RBBINode::precStart); // Terminate expression, leaves expression
322 RBBINode *thisRule = fNodeStack[fNodeStackPtr];
323 RBBINode *endNode = pushNewNode(RBBINode::endMark);
324 RBBINode *catNode = pushNewNode(RBBINode::opCat);
341 RBBINode **destRules = (fReverseRule? &fRB->fReverseTree : fRB->fDefaultTree);
349 RBBINode *thisRule = fNodeStack[fNodeStackPtr];
350 RBBINode *prevRules = *destRules;
351 RBBINode *orNode = pushNewNode(RBBINode::opOr);
390 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
391 RBBINode *plusNode = pushNewNode(RBBINode::opPlus);
399 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
400 RBBINode *qNode = pushNewNode(RBBINode::opQuestion);
408 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
409 RBBINode *starNode = pushNewNode(RBBINode::opStar);
422 n = pushNewNode(RBBINode::setRef);
433 n = pushNewNode(RBBINode::setRef);
443 n = pushNewNode(RBBINode::lookAhead);
454 n = pushNewNode(RBBINode::tag);
514 n = pushNewNode(RBBINode::varRef);
523 if (n==NULL || n->fType != RBBINode::varRef) {
607 void RBBIRuleScanner::fixOpStack(RBBINode::OpPrecedence p) {
608 RBBINode *n;
618 if (n->fPrecedence < p || n->fPrecedence <= RBBINode::precLParen) {
632 if (p <= RBBINode::precLParen) {
669 void RBBIRuleScanner::findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt) {
680 U_ASSERT(node->fLeftChild->fType == RBBINode::uset);
701 RBBINode *usetNode = new RBBINode(RBBINode::uset);
1054 fRB->fReverseTree = pushNewNode(RBBINode::opStar);
1055 RBBINode *operand = pushNewNode(RBBINode::setRef);
1103 // pushNewNode create a new RBBINode of the specified type and push it
1107 RBBINode *RBBIRuleScanner::pushNewNode(RBBINode::NodeType t) {
1115 fNodeStack[fNodeStackPtr] = new RBBINode(t);
1194 RBBINode *n;
1196 n = pushNewNode(RBBINode::setRef);