Searched refs:predictable_p (Results 1 – 8 of 8) sorted by relevance
2295 bool predictable_p = predictable_edge_p (e); in default_max_noce_ifcvt_seq_cost() local2298 = (predictable_p in default_max_noce_ifcvt_seq_cost()2307 return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (3); in default_max_noce_ifcvt_seq_cost()
1313 #define BRANCH_COST(speed_p, predictable_p) 1 argument
1801 #define BRANCH_COST(speed_p, predictable_p) \ argument1802 (!(speed_p) ? 2 : (predictable_p) ? 0 : ix86_branch_cost)
1276 #define BRANCH_COST(speed_p, predictable_p) 1 argument
1978 #define BRANCH_COST(speed_p, predictable_p) \ argument1979 (!(speed_p) ? 2 : (predictable_p) ? 0 : ix86_branch_cost)
50360 bool predictable_p = predictable_edge_p (e); in ix86_max_noce_ifcvt_seq_cost() local50363 = (predictable_p in ix86_max_noce_ifcvt_seq_cost()50372 return BRANCH_COST (true, predictable_p) * COSTS_N_INSNS (2); in ix86_max_noce_ifcvt_seq_cost()
6254 @defmac BRANCH_COST (@var{speed_p}, @var{predictable_p})6259 optimal for code size rather than performance. @var{predictable_p} is
6176 @defmac BRANCH_COST (@var{speed_p}, @var{predictable_p})6181 optimal for code size rather than performance. @var{predictable_p} is