Lines Matching defs:alternative
627 // fails to find a match and needs to try an alternative.
1763 // Alternative 0 is the negative lookahead, alternative 1 is what comes
1775 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2665 // this alternative and back to this choice node. If there are variable
2669 GuardedAlternative* alternative) {
2671 RegExpNode* node = alternative->node();
2749 // records the way the alternative is being code generated.
2803 * fallthrough. Alternatives 1 and 2 have quick checks. Alternative
2879 GuardedAlternative alternative = alternatives_->at(i);
2880 ZoneList<Guard*>* guards = alternative.guards();
2950 GuardedAlternative alternative = alternatives_->at(i);
2953 ZoneList<Guard*>* guards = alternative.guards();
2968 alternative.node()->EmitQuickCheck(compiler,
3014 alternative.node()->Emit(compiler, &new_trace);
3052 GuardedAlternative alternative,
3064 ZoneList<Guard*>* guards = alternative.guards();
3072 alternative.node()->Emit(compiler, &out_of_line_trace);
3087 alternative.node()->Emit(compiler, &out_of_line_trace);
3728 GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,
3730 result->AddAlternative(alternative);
4014 // first alternative and the expression after the lookahead of the second
4015 // alternative. If the first alternative succeeds then the
4017 // choice node set up and backtrack. If the first alternative fails then
4018 // the second alternative is tried, which is exactly the desired result
4989 GuardedAlternative alternative = alternatives()->at(i);
4990 ZoneList<Guard*>* guards = alternative.guards();
