Lines Matching full:choice_count
2404 int choice_count = alternatives_->length();
2405 budget = (budget - 1) / choice_count;
2406 for (int i = 0; i < choice_count; i++) {
2886 int choice_count = alternatives_->length();
2888 for (int i = 0; i < choice_count; i++) {
2898 for (int i = 0; i < choice_count; i++) {
2912 if (surviving == choice_count) {
2919 for (int i = 0; i < choice_count; i++) {
2987 int choice_count = alternatives_->length();
2988 ASSERT(choice_count > 0);
2993 for (int i = 1; i < choice_count; i++) {
3923 int choice_count = alternatives_->length();
3925 for (int i = 0; i < choice_count - 1; i++) {
3939 int new_flush_budget = trace->flush_budget() / choice_count;
3956 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) {
3991 if (!greedy_loop && choice_count == 2) {
4038 AlternativeGenerationList alt_gens(choice_count, zone());
4042 for (int i = first_normal_choice; i < choice_count; i++) {
4066 i < choice_count - 1)) {
4073 if (i == choice_count - 1) {
4081 if (i == choice_count - 1 && !greedy_loop) {
4095 if (i < choice_count - 1) {
4124 for (int i = first_normal_choice; i < choice_count - 1; i++) {
