2320   int choice_count = alternatives_->length();  in EatsAtLeastHelper()  local
2321   budget = (budget - 1) / choice_count;  in EatsAtLeastHelper()
2322   for (int i = 0; i < choice_count; i++) {  in EatsAtLeastHelper()
2805   int choice_count = alternatives_->length();  in FilterOneByte()  local
2807   for (int i = 0; i < choice_count; i++) {  in FilterOneByte()
2818   for (int i = 0; i < choice_count; i++) {  in FilterOneByte()
2831   if (surviving == choice_count) {  in FilterOneByte()
2838   for (int i = 0; i < choice_count; i++) {  in FilterOneByte()
2902   int choice_count = alternatives_->length();  in GetQuickCheckDetails()  local
2903   DCHECK_LT(0, choice_count);  in GetQuickCheckDetails()
2908   for (int i = 1; i < choice_count; i++) {  in GetQuickCheckDetails()
3867   int choice_count = alternatives_->length();  in AssertGuardsMentionRegisters()  local
3868   for (int i = 0; i < choice_count - 1; i++) {  in AssertGuardsMentionRegisters()
3899   int choice_count = alternatives_->length();  in Emit()  local
3901   if (choice_count == 1 && alternatives_->at(0).guards() == nullptr) {  in Emit()
3926   AlternativeGenerationList alt_gens(choice_count, zone());  in Emit()
3928   if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) {  in Emit()
3953   int new_flush_budget = trace->flush_budget() / choice_count;  in Emit()
3954   for (int i = 0; i < choice_count; i++) {  in Emit()
3964         i == choice_count - 1 ? false : alt_gens.at(i + 1)->expects_preload;  in Emit()
4084   int choice_count = alternatives_->length();  in EmitChoices()  local
4086   int new_flush_budget = trace->flush_budget() / choice_count;  in EmitChoices()
4088   for (int i = first_choice; i < choice_count; i++) {  in EmitChoices()
4089     bool is_last = i == choice_count - 1;  in EmitChoices()