HomeSort by: relevance | last modified time | path
    Searched defs:speed_p (Results 1 - 25 of 32) sorted by relevancy

1 2

  /src/external/gpl3/gcc/dist/gcc/
ifcvt.h 104 bool speed_p; member in struct:noce_if_info
ifcvt.h 104 bool speed_p; member in struct:noce_if_info
ccmp.cc 211 int speed_p = optimize_insn_for_speed_p (); local
229 cost1 = seq_cost (prep_seq_1, speed_p);
230 cost1 += seq_cost (gen_seq_1, speed_p);
247 cost2 = seq_cost (prep_seq_2, speed_p);
248 cost2 += seq_cost (gen_seq_2, speed_p);
ccmp.cc 211 int speed_p = optimize_insn_for_speed_p (); local
229 cost1 = seq_cost (prep_seq_1, speed_p);
230 cost1 += seq_cost (gen_seq_1, speed_p);
247 cost2 = seq_cost (prep_seq_2, speed_p);
248 cost2 += seq_cost (gen_seq_2, speed_p);
dojump.cc 137 bool speed_p;
162 speed_p = optimize_insn_for_speed_p ();
163 return (rtx_cost (and_test, mode, IF_THEN_ELSE, 0, speed_p)
164 <= rtx_cost (shift_test, mode, IF_THEN_ELSE, 0, speed_p));
136 bool speed_p; local
dojump.cc 137 bool speed_p;
162 speed_p = optimize_insn_for_speed_p ();
163 return (rtx_cost (and_test, mode, IF_THEN_ELSE, 0, speed_p)
164 <= rtx_cost (shift_test, mode, IF_THEN_ELSE, 0, speed_p));
136 bool speed_p; local
lower-subreg.cc 137 rtxes in RTXES. SPEED_P selects between the speed and size cost. */
140 shift_cost (bool speed_p, struct cost_rtxes *rtxes, enum rtx_code code,
147 return set_src_cost (rtxes->shift, mode, speed_p);
152 of X + BITS_PER_WORD bits. SPEED_P says whether we are testing
160 compute_splitting_shift (bool speed_p, struct cost_rtxes *rtxes,
168 wide_cost = shift_cost (speed_p, rtxes, code, twice_word_mode,
173 narrow_cost = shift_cost (speed_p, rtxes, code, word_mode, i);
180 upper_cost = shift_cost (speed_p, rtxes, code, word_mode,
193 /* Compute what we should do when optimizing for speed or size; SPEED_P
197 compute_costs (bool speed_p, struct cost_rtxes *rtxes
1498 bool speed_p; local
    [all...]
lower-subreg.cc 137 rtxes in RTXES. SPEED_P selects between the speed and size cost. */
140 shift_cost (bool speed_p, struct cost_rtxes *rtxes, enum rtx_code code,
147 return set_src_cost (rtxes->shift, mode, speed_p);
152 of X + BITS_PER_WORD bits. SPEED_P says whether we are testing
160 compute_splitting_shift (bool speed_p, struct cost_rtxes *rtxes,
168 wide_cost = shift_cost (speed_p, rtxes, code, twice_word_mode,
173 narrow_cost = shift_cost (speed_p, rtxes, code, word_mode, i);
180 upper_cost = shift_cost (speed_p, rtxes, code, word_mode,
193 /* Compute what we should do when optimizing for speed or size; SPEED_P
197 compute_costs (bool speed_p, struct cost_rtxes *rtxes
1498 bool speed_p; local
    [all...]
ifcvt.cc 815 bool speed_p = if_info->speed_p;
818 unsigned int cost = seq_cost (seq, speed_p);
825 return speed_p && cost <= if_info->max_seq_cost;
2886 || ((set_src_cost (t, mode, if_info->speed_p)
3331 bool speed_p = optimize_bb_for_speed_p (test_bb);
3336 *cost += pattern_cost (first_set, speed_p);
3352 int potential_cost = pattern_cost (last_set, speed_p);
3375 potential_cost += pattern_cost (sset, speed_p);
3431 *cost = seq_cost (seq, if_info->speed_p);
812 bool speed_p = if_info->speed_p; local
3847 bool speed_p = optimize_bb_for_speed_p (test_bb); local
3968 bool speed_p = optimize_bb_for_speed_p (test_bb); local
4605 bool speed_p = optimize_bb_for_speed_p (test_bb); local
    [all...]
tree-ssa-math-opts.cc 2021 bool speed_p = optimize_bb_for_speed_p (gsi_bb (*gsi)); local
2050 && speed_p
2093 && speed_p
2110 && (speed_p || real_equal (&c, &dconst1_4))
2113 unsigned int max_depth = speed_p
ifcvt.cc 815 bool speed_p = if_info->speed_p;
818 unsigned int cost = seq_cost (seq, speed_p);
825 return speed_p && cost <= if_info->max_seq_cost;
2886 || ((set_src_cost (t, mode, if_info->speed_p)
3331 bool speed_p = optimize_bb_for_speed_p (test_bb);
3336 *cost += pattern_cost (first_set, speed_p);
3352 int potential_cost = pattern_cost (last_set, speed_p);
3375 potential_cost += pattern_cost (sset, speed_p);
3431 *cost = seq_cost (seq, if_info->speed_p);
812 bool speed_p = if_info->speed_p; local
3847 bool speed_p = optimize_bb_for_speed_p (test_bb); local
3968 bool speed_p = optimize_bb_for_speed_p (test_bb); local
4605 bool speed_p = optimize_bb_for_speed_p (test_bb); local
    [all...]
tree-ssa-math-opts.cc 2021 bool speed_p = optimize_bb_for_speed_p (gsi_bb (*gsi)); local
2050 && speed_p
2093 && speed_p
2110 && (speed_p || real_equal (&c, &dconst1_4))
2113 unsigned int max_depth = speed_p
  /src/external/gpl3/gcc.old/dist/gcc/
ifcvt.h 96 bool speed_p; member in struct:noce_if_info
ifcvt.h 96 bool speed_p; member in struct:noce_if_info
ccmp.cc 209 int speed_p = optimize_insn_for_speed_p (); local
227 cost1 = seq_cost (prep_seq_1, speed_p);
228 cost1 += seq_cost (gen_seq_1, speed_p);
245 cost2 = seq_cost (prep_seq_2, speed_p);
246 cost2 += seq_cost (gen_seq_2, speed_p);
ccmp.cc 209 int speed_p = optimize_insn_for_speed_p (); local
227 cost1 = seq_cost (prep_seq_1, speed_p);
228 cost1 += seq_cost (gen_seq_1, speed_p);
245 cost2 = seq_cost (prep_seq_2, speed_p);
246 cost2 += seq_cost (gen_seq_2, speed_p);
dojump.cc 137 bool speed_p;
162 speed_p = optimize_insn_for_speed_p ();
163 return (rtx_cost (and_test, mode, IF_THEN_ELSE, 0, speed_p)
164 <= rtx_cost (shift_test, mode, IF_THEN_ELSE, 0, speed_p));
136 bool speed_p; local
dojump.cc 137 bool speed_p;
162 speed_p = optimize_insn_for_speed_p ();
163 return (rtx_cost (and_test, mode, IF_THEN_ELSE, 0, speed_p)
164 <= rtx_cost (shift_test, mode, IF_THEN_ELSE, 0, speed_p));
136 bool speed_p; local
lower-subreg.cc 136 rtxes in RTXES. SPEED_P selects between the speed and size cost. */
139 shift_cost (bool speed_p, struct cost_rtxes *rtxes, enum rtx_code code,
146 return set_src_cost (rtxes->shift, mode, speed_p);
151 of X + BITS_PER_WORD bits. SPEED_P says whether we are testing
159 compute_splitting_shift (bool speed_p, struct cost_rtxes *rtxes,
167 wide_cost = shift_cost (speed_p, rtxes, code, twice_word_mode,
172 narrow_cost = shift_cost (speed_p, rtxes, code, word_mode, i);
179 upper_cost = shift_cost (speed_p, rtxes, code, word_mode,
192 /* Compute what we should do when optimizing for speed or size; SPEED_P
196 compute_costs (bool speed_p, struct cost_rtxes *rtxes
1469 bool speed_p; local
    [all...]
lower-subreg.cc 136 rtxes in RTXES. SPEED_P selects between the speed and size cost. */
139 shift_cost (bool speed_p, struct cost_rtxes *rtxes, enum rtx_code code,
146 return set_src_cost (rtxes->shift, mode, speed_p);
151 of X + BITS_PER_WORD bits. SPEED_P says whether we are testing
159 compute_splitting_shift (bool speed_p, struct cost_rtxes *rtxes,
167 wide_cost = shift_cost (speed_p, rtxes, code, twice_word_mode,
172 narrow_cost = shift_cost (speed_p, rtxes, code, word_mode, i);
179 upper_cost = shift_cost (speed_p, rtxes, code, word_mode,
192 /* Compute what we should do when optimizing for speed or size; SPEED_P
196 compute_costs (bool speed_p, struct cost_rtxes *rtxes
1469 bool speed_p; local
    [all...]
ifcvt.cc 814 bool speed_p = if_info->speed_p;
817 unsigned int cost = seq_cost (seq, speed_p);
824 return speed_p && cost <= if_info->max_seq_cost;
2849 || ((set_src_cost (t, mode, if_info->speed_p)
3106 bool speed_p = optimize_bb_for_speed_p (test_bb);
3111 *cost += pattern_cost (first_set, speed_p);
3127 int potential_cost = pattern_cost (last_set, speed_p);
3147 potential_cost += pattern_cost (sset, speed_p);
3203 *cost = seq_cost (seq, if_info->speed_p);
811 bool speed_p = if_info->speed_p; local
3657 bool speed_p = optimize_bb_for_speed_p (test_bb); local
3778 bool speed_p = optimize_bb_for_speed_p (test_bb); local
4410 bool speed_p = optimize_bb_for_speed_p (test_bb); local
    [all...]
ifcvt.cc 814 bool speed_p = if_info->speed_p;
817 unsigned int cost = seq_cost (seq, speed_p);
824 return speed_p && cost <= if_info->max_seq_cost;
2849 || ((set_src_cost (t, mode, if_info->speed_p)
3106 bool speed_p = optimize_bb_for_speed_p (test_bb);
3111 *cost += pattern_cost (first_set, speed_p);
3127 int potential_cost = pattern_cost (last_set, speed_p);
3147 potential_cost += pattern_cost (sset, speed_p);
3203 *cost = seq_cost (seq, if_info->speed_p);
811 bool speed_p = if_info->speed_p; local
3657 bool speed_p = optimize_bb_for_speed_p (test_bb); local
3778 bool speed_p = optimize_bb_for_speed_p (test_bb); local
4410 bool speed_p = optimize_bb_for_speed_p (test_bb); local
    [all...]
tree-ssa-math-opts.cc 2016 bool speed_p = optimize_bb_for_speed_p (gsi_bb (*gsi)); local
2045 && speed_p
2088 && speed_p
2105 && (speed_p || real_equal (&c, &dconst1_4))
2108 unsigned int max_depth = speed_p
tree-ssa-math-opts.cc 2016 bool speed_p = optimize_bb_for_speed_p (gsi_bb (*gsi)); local
2045 && speed_p
2088 && speed_p
2105 && (speed_p || real_equal (&c, &dconst1_4))
2108 unsigned int max_depth = speed_p
tree-ssa-reassoc.cc 3411 bool speed_p = optimize_bb_for_speed_p (gimple_bb (stmt)); local
3414 word_mode, speed_p);
3417 word_mode, speed_p);
3420 word_mode, speed_p);

Completed in 132 milliseconds

1 2