Lines Matching full:alternative
788 // fails to find a match and needs to try an alternative.
2351 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2363 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2869 GuardedAlternative alternative = alternatives_->at(i);
2870 if (alternative.guards() != NULL && alternative.guards()->length() != 0) {
2879 GuardedAlternative alternative = alternatives_->at(i);
2881 alternative.node()->FilterOneByte(depth - 1, ignore_case);
2918 // Alternative 0 is the negative lookahead, alternative 1 is what comes
3443 // this alternative and back to this choice node. If there are variable
3447 GuardedAlternative* alternative) {
3449 RegExpNode* node = alternative->node();
3528 // records the way the alternative is being code generated.
3828 * fallthrough. Alternatives 1 and 2 have quick checks. Alternative
3904 GuardedAlternative alternative = alternatives_->at(i);
3905 ZoneList<Guard*>* guards = alternative.guards();
4120 GuardedAlternative alternative = alternatives_->at(i);
4123 ZoneList<Guard*>* guards = alternative.guards();
4141 alternative.node()->EmitQuickCheck(compiler,
4184 alternative.node()->Emit(compiler, &new_trace);
4194 GuardedAlternative alternative,
4206 ZoneList<Guard*>* guards = alternative.guards();
4214 alternative.node()->Emit(compiler, &out_of_line_trace);
4229 alternative.node()->Emit(compiler, &out_of_line_trace);
4850 GuardedAlternative alternative(alternatives->at(i)->ToNode(compiler,
4852 result->AddAlternative(alternative);
5143 // first alternative and the expression after the lookahead of the second
5144 // alternative. If the first alternative succeeds then the
5146 // choice node set up and backtrack. If the first alternative fails then
5147 // the second alternative is tried, which is exactly the desired result
