HomeSort by: relevance | last modified time | path
    Searched refs:prob2 (Results 1 - 11 of 11) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
basic-block.h 567 /* Given PROB1 and PROB2, return PROB1*PROB2/REG_BR_PROB_BASE.
571 combine_probabilities (int prob1, int prob2)
574 check_probability (prob2);
575 return RDIV (prob1 * prob2, REG_BR_PROB_BASE);
value-prof.cc 1016 the optimal paths are PROB1 and PROB2, which are equivalent to COUNT1/ALL and
1024 profile_probability prob2, int ncounts,
1103 e23->probability = prob2.invert ();
1106 e24->probability = prob2;
1123 profile_probability prob1, prob2; local
1190 prob2 = profile_probability::even ();
1192 prob2 = profile_probability::probability_in_gcov_type (count2, all
1197 prob1 = prob2 = profile_probability::never ();
1202 result = gimple_mod_subtract (stmt, prob1, prob2, i, count1, count2, all);
tree-vect-loop-manip.cc 4024 profile_probability prob2 = profile_probability::always ();
4037 prob2 = prob = prob.sqrt ();
4164 preheader->count = preheader->count.apply_probability (prob * prob2);
4165 scale_loop_frequencies (loop_to_version, prob * prob2);
4176 LOOP_VINFO_SCALAR_LOOP_SCALING (loop_vinfo) = (prob * prob2).invert ();
4196 prob * prob2, (prob * prob2).invert (),
4197 prob * prob2, (prob * prob2).invert (),
4200 both is prob * prob2. *
    [all...]
cfgcleanup.cc 1701 profile_probability prob2;
1704 prob2 = b2->probability;
1707 prob2 = b2->probability.invert ();
1712 if (b1->probability.differs_lot_from_p (prob2))
1720 prob2.dump (dump_file);
ipa-fnsummary.cc 4075 of argument if B that change with probability PROB2, the probability
4076 of change is now PROB1*PROB2. */
4107 int prob2 = inlined_es->param[id].change_prob; local
4108 int prob = combine_probabilities (prob1, prob2);
4110 if (prob1 && prob2 && !prob)
gimple-lower-bitint.cc 773 PROB2 is the probability that the condition 2 is true.
785 profile_probability prob2,
805 e4->probability = prob2;
807 e2->probability = prob2.invert ();
808 bb->count = e2->src->count.apply_probability (prob2);
  /src/external/gpl3/gcc.old/dist/gcc/
basic-block.h 575 /* Given PROB1 and PROB2, return PROB1*PROB2/REG_BR_PROB_BASE.
579 combine_probabilities (int prob1, int prob2)
582 check_probability (prob2);
583 return RDIV (prob1 * prob2, REG_BR_PROB_BASE);
value-prof.cc 1028 the optimal paths are PROB1 and PROB2, which are equivalent to COUNT1/ALL and
1036 profile_probability prob2, int ncounts,
1115 e23->probability = prob2.invert ();
1118 e24->probability = prob2;
1135 profile_probability prob1, prob2; local
1201 prob2 = profile_probability::probability_in_gcov_type (count2, all);
1205 prob1 = prob2 = profile_probability::never ();
1210 result = gimple_mod_subtract (stmt, prob1, prob2, i, count1, count2, all);
cfgcleanup.cc 1701 profile_probability prob2;
1704 prob2 = b2->probability;
1707 prob2 = b2->probability.invert ();
1712 if (b1->probability.differs_lot_from_p (prob2))
1720 prob2.dump (dump_file);
tree-vect-loop-manip.cc 3451 profile_probability prob2 = profile_probability::uninitialized (); local
3464 prob2 = prob.split (prob);
3702 e->probability = prob2;
3703 e2->probability = prob2.invert ();
ipa-fnsummary.cc 3967 of argument if B that change with probability PROB2, the probability
3968 of change is now PROB1*PROB2. */
3999 int prob2 = inlined_es->param[id].change_prob; local
4000 int prob = combine_probabilities (prob1, prob2);
4002 if (prob1 && prob2 && !prob)

Completed in 51 milliseconds