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

  /src/external/gpl3/gcc/dist/gcc/
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);
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)
  /src/external/gpl3/gcc.old/dist/gcc/
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);
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)
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 ();

Completed in 21 milliseconds