Lines Matching defs:alternative
810 // fails to find a match and needs to try an alternative.
2379 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2391 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2889 GuardedAlternative alternative = alternatives_->at(i);
2890 if (alternative.guards() != NULL && alternative.guards()->length() != 0) {
2899 GuardedAlternative alternative = alternatives_->at(i);
2901 alternative.node()->FilterASCII(depth - 1, ignore_case);
2938 // Alternative 0 is the negative lookahead, alternative 1 is what comes
3469 // this alternative and back to this choice node. If there are variable
3473 GuardedAlternative* alternative) {
3475 RegExpNode* node = alternative->node();
3553 // records the way the alternative is being code generated.
3851 * fallthrough. Alternatives 1 and 2 have quick checks. Alternative
3926 GuardedAlternative alternative = alternatives_->at(i);
3927 ZoneList<Guard*>* guards = alternative.guards();
4043 alternative = alternatives_->at(i);
4046 ZoneList<Guard*>* guards = alternative.guards();
4061 alternative.node()->EmitQuickCheck(compiler,
4107 alternative.node()->Emit(compiler, &new_trace);
4145 GuardedAlternative alternative,
4157 ZoneList<Guard*>* guards = alternative.guards();
4165 alternative.node()->Emit(compiler, &out_of_line_trace);
4180 alternative.node()->Emit(compiler, &out_of_line_trace);
4809 GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,
4811 result->AddAlternative(alternative);
5102 // first alternative and the expression after the lookahead of the second
5103 // alternative. If the first alternative succeeds then the
5105 // choice node set up and backtrack. If the first alternative fails then
5106 // the second alternative is tried, which is exactly the desired result
