2335   RegExpNode* node = alternatives_->at(1).node();  in EatsAtLeast()
2345   RegExpNode* node = alternatives_->at(1).node();  in GetQuickCheckDetails()
2356   int choice_count = alternatives_->length();  in EatsAtLeastHelper()
2359     RegExpNode* node = alternatives_->at(i).node();  in EatsAtLeastHelper()
2851   int choice_count = alternatives_->length();  in FilterOneByte()
2854     GuardedAlternative alternative = alternatives_->at(i);  in FilterOneByte()
2864     GuardedAlternative alternative = alternatives_->at(i);  in FilterOneByte()
2869       alternatives_->at(i).set_node(replacement);  in FilterOneByte()
2886         alternatives_->at(i).node()->FilterOneByte(depth - 1, ignore_case);  in FilterOneByte()
2888       alternatives_->at(i).set_node(replacement);  in FilterOneByte()
2889       new_alternatives->Add(alternatives_->at(i), zone());  in FilterOneByte()
2892   alternatives_ = new_alternatives;  in FilterOneByte()
2905   RegExpNode* node = alternatives_->at(1).node();  in FilterOneByte()
2908   alternatives_->at(1).set_node(replacement);  in FilterOneByte()
2910   RegExpNode* neg_node = alternatives_->at(0).node();  in FilterOneByte()
2915   alternatives_->at(0).set_node(neg_replacement);  in FilterOneByte()
2950   int choice_count = alternatives_->length();  in GetQuickCheckDetails()
2952   alternatives_->at(0).node()->GetQuickCheckDetails(details,  in GetQuickCheckDetails()
2958     RegExpNode* node = alternatives_->at(i).node();  in GetQuickCheckDetails()
3471         GreedyLoopTextLengthForAlternative(&(alternatives_->at(0)));  in Emit()
3885   int choice_count = alternatives_->length();  in AssertGuardsMentionRegisters()
3887     GuardedAlternative alternative = alternatives_->at(i);  in AssertGuardsMentionRegisters()
3917   int choice_count = alternatives_->length();  in Emit()
3938   int text_length = GreedyLoopTextLengthForAlternative(&alternatives_->at(0));  in Emit()
3980                               alternatives_->at(i),  in Emit()
4012   alternatives_->at(0).node()->Emit(compiler, &greedy_match_trace);  in EmitGreedyLoop()
4038   if (alternatives_->length() != 2) return eats_at_least;  in EmitOptimizedUnanchoredSearch()
4040   GuardedAlternative alt1 = alternatives_->at(1);  in EmitOptimizedUnanchoredSearch()
4076       GuardedAlternative alt0 = alternatives_->at(0);  in EmitOptimizedUnanchoredSearch()
4097   int choice_count = alternatives_->length();  in EmitChoices()
4104     GuardedAlternative alternative = alternatives_->at(i);  in EmitChoices()