2383   int choice_count = alternatives_->length();  in EatsAtLeastHelper()  local
2384   budget = (budget - 1) / choice_count;  in EatsAtLeastHelper()
2385   for (int i = 0; i < choice_count; i++) {  in EatsAtLeastHelper()
2878   int choice_count = alternatives_->length();  in FilterOneByte()  local
2880   for (int i = 0; i < choice_count; i++) {  in FilterOneByte()
2890   for (int i = 0; i < choice_count; i++) {  in FilterOneByte()
2904   if (surviving == choice_count) {  in FilterOneByte()
2911   for (int i = 0; i < choice_count; i++) {  in FilterOneByte()
2977   int choice_count = alternatives_->length();  in GetQuickCheckDetails()  local
2978   DCHECK(choice_count > 0);  in GetQuickCheckDetails()
2983   for (int i = 1; i < choice_count; i++) {  in GetQuickCheckDetails()
3939   int choice_count = alternatives_->length();  in AssertGuardsMentionRegisters()  local
3940   for (int i = 0; i < choice_count - 1; i++) {  in AssertGuardsMentionRegisters()
3971   int choice_count = alternatives_->length();  in Emit()  local
3973   if (choice_count == 1 && alternatives_->at(0).guards() == NULL) {  in Emit()
3998   AlternativeGenerationList alt_gens(choice_count, zone());  in Emit()
4000   if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) {  in Emit()
4025   int new_flush_budget = trace->flush_budget() / choice_count;  in Emit()
4026   for (int i = 0; i < choice_count; i++) {  in Emit()
4036         i == choice_count - 1 ? false : alt_gens.at(i + 1)->expects_preload;  in Emit()
4156   int choice_count = alternatives_->length();  in EmitChoices()  local
4158   int new_flush_budget = trace->flush_budget() / choice_count;  in EmitChoices()
4160   for (int i = first_choice; i < choice_count; i++) {  in EmitChoices()
4161     bool is_last = i == choice_count - 1;  in EmitChoices()