Lines Matching refs:choice_count
1942 int choice_count = alternatives_->length();
1944 for (int i = 0; i < choice_count; i++) {
1955 for (int i = 0; i < choice_count; i++) {
1969 if (surviving == choice_count) {
1976 for (int i = 0; i < choice_count; i++) {
2075 int choice_count = alternatives_->length();
2076 DCHECK_LT(0, choice_count);
2079 for (int i = 1; i < choice_count; i++) {
3045 int choice_count = alternatives_->length();
3046 for (int i = 0; i < choice_count - 1; i++) {
3073 int choice_count = alternatives_->length();
3075 if (choice_count == 1 && alternatives_->at(0).guards() == nullptr) {
3100 AlternativeGenerationList alt_gens(choice_count, zone());
3102 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) {
3119 int new_flush_budget = trace->flush_budget() / choice_count;
3120 for (int i = 0; i < choice_count; i++) {
3130 i == choice_count - 1 ? false : alt_gens.at(i + 1)->expects_preload;
3234 int choice_count = alternatives_->length();
3236 int new_flush_budget = trace->flush_budget() / choice_count;
3238 for (int i = first_choice; i < choice_count; i++) {
3239 bool is_last = i == choice_count - 1;