Lines Matching refs:alternative
515 // fails to find a match and needs to try an alternative.
1602 // Alternative 0 is the negative lookahead, alternative 1 is what comes
1614 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2489 // this alternative and back to this choice node. If there are variable
2492 int ChoiceNode::GreedyLoopTextLength(GuardedAlternative* alternative) {
2494 RegExpNode* node = alternative->node();
2570 // records the way the alternative is being code generated.
2623 * fallthrough. Alternatives 1 and 2 have quick checks. Alternative
2699 GuardedAlternative alternative = alternatives_->at(i);
2700 ZoneList<Guard*>* guards = alternative.guards();
2768 alternative = alternatives_->at(i);
2771 ZoneList<Guard*>* guards = alternative.guards();
2786 alternative.node()->EmitQuickCheck(compiler,
2832 alternative.node()->Emit(compiler, &new_trace);
2870 GuardedAlternative alternative,
2882 ZoneList<Guard*>* guards = alternative.guards();
2890 alternative.node()->Emit(compiler, &out_of_line_trace);
2905 alternative.node()->Emit(compiler, &out_of_line_trace);
3547 GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,
3549 result->AddAlternative(alternative);
3787 // first alternative and the expression after the lookahead of the second
3788 // alternative. If the first alternative succeeds then the
3790 // choice node set up and backtrack. If the first alternative fails then
3791 // the second alternative is tried, which is exactly the desired result
4894 GuardedAlternative alternative = alternatives()->at(i);
4895 ZoneList<Guard*>* guards = alternative.guards();
