Lines Matching defs:all

87 check_counter (tree stmt, const char * name, gcov_type all, gcov_type bb_count)
89 if (all != bb_count)
96 locus, name, (int)all, (int)bb_count);
177 gcov_type all)
232 bb3->count = all - count;
235 bb4->count = all;
244 e13->count = all - count;
253 e34->count = all - count;
265 gcov_type val, count, all;
299 all = histogram->hvalue.counters[2];
301 /* We require that count is at least half of all; this means
304 if (simple_cst_equal (op2, value) != 1 || 2 * count < all)
307 if (check_counter (stmt, "value", all, bb_for_stmt (stmt)->count))
311 prob = (count * REG_BR_PROB_BASE + all / 2) / all;
316 result = tree_divmod_fixed_value (stmt, op, op1, op2, tree_val, prob, count, all);
340 gcov_type count, gcov_type all)
399 bb3->count = all - count;
402 bb4->count = all;
411 e13->count = all - count;
420 e34->count = all - count;
432 gcov_type count, wrong_values, all;
467 /* We require that we hit a power of 2 at least half of all evaluations. */
478 all = count + wrong_values;
479 if (check_counter (stmt, "pow2", all, bb_for_stmt (stmt)->count))
482 prob = (count * REG_BR_PROB_BASE + all / 2) / all;
484 result = tree_mod_pow2 (stmt, op, op1, op2, prob, count, all);
504 gcov_type count1, gcov_type count2, gcov_type all)
567 bb2->count = all - count1;
573 bb3->count = all - count1 - count2;
578 bb4->count = all;
583 e12->count = all - count1;
593 e23->count = all - count1 - count2;
602 e34->count = all - count1 - count2;
614 gcov_type count, wrong_values, all;
647 all = 0;
650 all += histogram->hvalue.counters[i];
654 all += wrong_values;
657 if (check_counter (stmt, "interval", all, bb_for_stmt (stmt)->count))
660 /* We require that we use just subtractions in at least 50% of all
666 if (count * 2 >= all)
679 prob1 = (histogram->hvalue.counters[0] * REG_BR_PROB_BASE + all / 2) / all;
680 prob2 = (histogram->hvalue.counters[1] * REG_BR_PROB_BASE + all / 2) / all;
686 histogram->hvalue.counters[1], all);