Mercurial > hg > CbC > CbC_gcc
annotate gcc/dojump.c @ 132:d34655255c78
update gcc-8.2
| author | mir3636 |
|---|---|
| date | Thu, 25 Oct 2018 10:21:07 +0900 |
| parents | 84e7813d76e9 |
| children | 1830386684a0 |
| rev | line source |
|---|---|
| 0 | 1 /* Convert tree expression to rtl instructions, for GNU compiler. |
| 131 | 2 Copyright (C) 1988-2018 Free Software Foundation, Inc. |
| 0 | 3 |
| 4 This file is part of GCC. | |
| 5 | |
| 6 GCC is free software; you can redistribute it and/or modify it under | |
| 7 the terms of the GNU General Public License as published by the Free | |
| 8 Software Foundation; either version 3, or (at your option) any later | |
| 9 version. | |
| 10 | |
| 11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
| 12 WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 14 for more details. | |
| 15 | |
| 16 You should have received a copy of the GNU General Public License | |
| 17 along with GCC; see the file COPYING3. If not see | |
| 18 <http://www.gnu.org/licenses/>. */ | |
| 19 | |
| 20 #include "config.h" | |
| 21 #include "system.h" | |
| 22 #include "coretypes.h" | |
| 111 | 23 #include "backend.h" |
| 24 #include "target.h" | |
| 0 | 25 #include "rtl.h" |
| 26 #include "tree.h" | |
| 111 | 27 #include "predict.h" |
| 28 #include "memmodel.h" | |
| 29 #include "tm_p.h" | |
| 30 #include "optabs.h" | |
| 31 #include "emit-rtl.h" | |
| 32 #include "fold-const.h" | |
| 33 #include "stor-layout.h" | |
| 0 | 34 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */ |
| 111 | 35 #include "dojump.h" |
| 36 #include "explow.h" | |
| 0 | 37 #include "expr.h" |
| 38 #include "langhooks.h" | |
| 39 | |
| 111 | 40 static bool prefer_and_bit_test (scalar_int_mode, int); |
| 131 | 41 static void do_jump (tree, rtx_code_label *, rtx_code_label *, |
| 42 profile_probability); | |
| 111 | 43 static void do_jump_by_parts_greater (scalar_int_mode, tree, tree, int, |
| 44 rtx_code_label *, rtx_code_label *, | |
| 45 profile_probability); | |
| 46 static void do_jump_by_parts_equality (scalar_int_mode, tree, tree, | |
| 47 rtx_code_label *, rtx_code_label *, | |
| 48 profile_probability); | |
| 49 static void do_compare_and_jump (tree, tree, enum rtx_code, enum rtx_code, | |
| 50 rtx_code_label *, rtx_code_label *, | |
| 51 profile_probability); | |
| 0 | 52 |
| 53 /* At the start of a function, record that we have no previously-pushed | |
| 54 arguments waiting to be popped. */ | |
| 55 | |
| 56 void | |
| 57 init_pending_stack_adjust (void) | |
| 58 { | |
| 59 pending_stack_adjust = 0; | |
| 60 } | |
| 61 | |
| 62 /* Discard any pending stack adjustment. This avoid relying on the | |
| 63 RTL optimizers to remove useless adjustments when we know the | |
| 64 stack pointer value is dead. */ | |
| 65 void | |
| 66 discard_pending_stack_adjust (void) | |
| 67 { | |
| 68 stack_pointer_delta -= pending_stack_adjust; | |
| 69 pending_stack_adjust = 0; | |
| 70 } | |
| 71 | |
| 72 /* When exiting from function, if safe, clear out any pending stack adjust | |
| 73 so the adjustment won't get done. | |
| 74 | |
| 75 Note, if the current function calls alloca, then it must have a | |
| 76 frame pointer regardless of the value of flag_omit_frame_pointer. */ | |
| 77 | |
| 78 void | |
| 79 clear_pending_stack_adjust (void) | |
| 80 { | |
| 81 if (optimize > 0 | |
| 82 && (! flag_omit_frame_pointer || cfun->calls_alloca) | |
| 83 && EXIT_IGNORE_STACK) | |
| 84 discard_pending_stack_adjust (); | |
| 85 } | |
| 86 | |
| 87 /* Pop any previously-pushed arguments that have not been popped yet. */ | |
| 88 | |
| 89 void | |
| 90 do_pending_stack_adjust (void) | |
| 91 { | |
| 92 if (inhibit_defer_pop == 0) | |
| 93 { | |
| 131 | 94 if (maybe_ne (pending_stack_adjust, 0)) |
| 95 adjust_stack (gen_int_mode (pending_stack_adjust, Pmode)); | |
| 0 | 96 pending_stack_adjust = 0; |
| 97 } | |
| 98 } | |
| 111 | 99 |
| 100 /* Remember pending_stack_adjust/stack_pointer_delta. | |
| 101 To be used around code that may call do_pending_stack_adjust (), | |
| 102 but the generated code could be discarded e.g. using delete_insns_since. */ | |
| 103 | |
| 104 void | |
| 105 save_pending_stack_adjust (saved_pending_stack_adjust *save) | |
| 106 { | |
| 107 save->x_pending_stack_adjust = pending_stack_adjust; | |
| 108 save->x_stack_pointer_delta = stack_pointer_delta; | |
| 109 } | |
| 110 | |
| 111 /* Restore the saved pending_stack_adjust/stack_pointer_delta. */ | |
| 112 | |
| 113 void | |
| 114 restore_pending_stack_adjust (saved_pending_stack_adjust *save) | |
| 115 { | |
| 116 if (inhibit_defer_pop == 0) | |
| 117 { | |
| 118 pending_stack_adjust = save->x_pending_stack_adjust; | |
| 119 stack_pointer_delta = save->x_stack_pointer_delta; | |
| 120 } | |
| 121 } | |
| 0 | 122 |
| 123 /* Used internally by prefer_and_bit_test. */ | |
| 124 | |
| 125 static GTY(()) rtx and_reg; | |
| 126 static GTY(()) rtx and_test; | |
| 127 static GTY(()) rtx shift_test; | |
| 128 | |
| 129 /* Compare the relative costs of "(X & (1 << BITNUM))" and "(X >> BITNUM) & 1", | |
| 130 where X is an arbitrary register of mode MODE. Return true if the former | |
| 131 is preferred. */ | |
| 132 | |
| 133 static bool | |
| 111 | 134 prefer_and_bit_test (scalar_int_mode mode, int bitnum) |
| 0 | 135 { |
| 111 | 136 bool speed_p; |
| 137 wide_int mask = wi::set_bit_in_zero (bitnum, GET_MODE_PRECISION (mode)); | |
| 138 | |
| 0 | 139 if (and_test == 0) |
| 140 { | |
| 141 /* Set up rtxes for the two variations. Use NULL as a placeholder | |
| 142 for the BITNUM-based constants. */ | |
| 111 | 143 and_reg = gen_rtx_REG (mode, LAST_VIRTUAL_REGISTER + 1); |
| 0 | 144 and_test = gen_rtx_AND (mode, and_reg, NULL); |
| 145 shift_test = gen_rtx_AND (mode, gen_rtx_ASHIFTRT (mode, and_reg, NULL), | |
| 146 const1_rtx); | |
| 147 } | |
| 148 else | |
| 149 { | |
| 150 /* Change the mode of the previously-created rtxes. */ | |
| 151 PUT_MODE (and_reg, mode); | |
| 152 PUT_MODE (and_test, mode); | |
| 153 PUT_MODE (shift_test, mode); | |
| 154 PUT_MODE (XEXP (shift_test, 0), mode); | |
| 155 } | |
| 156 | |
| 157 /* Fill in the integers. */ | |
| 111 | 158 XEXP (and_test, 1) = immed_wide_int_const (mask, mode); |
| 0 | 159 XEXP (XEXP (shift_test, 0), 1) = GEN_INT (bitnum); |
| 160 | |
| 111 | 161 speed_p = optimize_insn_for_speed_p (); |
| 162 return (rtx_cost (and_test, mode, IF_THEN_ELSE, 0, speed_p) | |
| 163 <= rtx_cost (shift_test, mode, IF_THEN_ELSE, 0, speed_p)); | |
| 0 | 164 } |
| 165 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
166 /* Subroutine of do_jump, dealing with exploded comparisons of the type |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
167 OP0 CODE OP1 . IF_FALSE_LABEL and IF_TRUE_LABEL like in do_jump. |
| 111 | 168 PROB is probability of jump to if_true_label. */ |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
169 |
| 131 | 170 static void |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
171 do_jump_1 (enum tree_code code, tree op0, tree op1, |
| 111 | 172 rtx_code_label *if_false_label, rtx_code_label *if_true_label, |
| 173 profile_probability prob) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
174 { |
| 111 | 175 machine_mode mode; |
| 176 rtx_code_label *drop_through_label = 0; | |
| 177 scalar_int_mode int_mode; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
178 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
179 switch (code) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
180 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
181 case EQ_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
182 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
183 tree inner_type = TREE_TYPE (op0); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
184 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
185 gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
186 != MODE_COMPLEX_FLOAT); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
187 gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
188 != MODE_COMPLEX_INT); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
189 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
190 if (integer_zerop (op1)) |
| 111 | 191 do_jump (op0, if_true_label, if_false_label, |
| 192 prob.invert ()); | |
| 193 else if (is_int_mode (TYPE_MODE (inner_type), &int_mode) | |
| 194 && !can_compare_p (EQ, int_mode, ccp_jump)) | |
| 195 do_jump_by_parts_equality (int_mode, op0, op1, if_false_label, | |
| 196 if_true_label, prob); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
197 else |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
198 do_compare_and_jump (op0, op1, EQ, EQ, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
199 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
200 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
201 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
202 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
203 case NE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
204 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
205 tree inner_type = TREE_TYPE (op0); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
206 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
207 gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
208 != MODE_COMPLEX_FLOAT); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
209 gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
210 != MODE_COMPLEX_INT); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
211 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
212 if (integer_zerop (op1)) |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
213 do_jump (op0, if_false_label, if_true_label, prob); |
| 111 | 214 else if (is_int_mode (TYPE_MODE (inner_type), &int_mode) |
| 215 && !can_compare_p (NE, int_mode, ccp_jump)) | |
| 216 do_jump_by_parts_equality (int_mode, op0, op1, if_true_label, | |
| 217 if_false_label, prob.invert ()); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
218 else |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
219 do_compare_and_jump (op0, op1, NE, NE, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
220 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
221 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
222 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
223 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
224 case LT_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
225 mode = TYPE_MODE (TREE_TYPE (op0)); |
| 111 | 226 if (is_int_mode (mode, &int_mode) |
| 227 && ! can_compare_p (LT, int_mode, ccp_jump)) | |
| 228 do_jump_by_parts_greater (int_mode, op0, op1, 1, if_false_label, | |
| 229 if_true_label, prob); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
230 else |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
231 do_compare_and_jump (op0, op1, LT, LTU, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
232 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
233 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
234 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
235 case LE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
236 mode = TYPE_MODE (TREE_TYPE (op0)); |
| 111 | 237 if (is_int_mode (mode, &int_mode) |
| 238 && ! can_compare_p (LE, int_mode, ccp_jump)) | |
| 239 do_jump_by_parts_greater (int_mode, op0, op1, 0, if_true_label, | |
| 240 if_false_label, prob.invert ()); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
241 else |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
242 do_compare_and_jump (op0, op1, LE, LEU, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
243 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
244 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
245 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
246 case GT_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
247 mode = TYPE_MODE (TREE_TYPE (op0)); |
| 111 | 248 if (is_int_mode (mode, &int_mode) |
| 249 && ! can_compare_p (GT, int_mode, ccp_jump)) | |
| 250 do_jump_by_parts_greater (int_mode, op0, op1, 0, if_false_label, | |
| 251 if_true_label, prob); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
252 else |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
253 do_compare_and_jump (op0, op1, GT, GTU, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
254 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
255 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
256 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
257 case GE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
258 mode = TYPE_MODE (TREE_TYPE (op0)); |
| 111 | 259 if (is_int_mode (mode, &int_mode) |
| 260 && ! can_compare_p (GE, int_mode, ccp_jump)) | |
| 261 do_jump_by_parts_greater (int_mode, op0, op1, 1, if_true_label, | |
| 262 if_false_label, prob.invert ()); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
263 else |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
264 do_compare_and_jump (op0, op1, GE, GEU, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
265 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
266 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
267 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
268 case ORDERED_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
269 do_compare_and_jump (op0, op1, ORDERED, ORDERED, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
270 if_false_label, if_true_label, prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
271 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
272 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
273 case UNORDERED_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
274 do_compare_and_jump (op0, op1, UNORDERED, UNORDERED, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
275 if_false_label, if_true_label, prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
276 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
277 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
278 case UNLT_EXPR: |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
279 do_compare_and_jump (op0, op1, UNLT, UNLT, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
280 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
281 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
282 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
283 case UNLE_EXPR: |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
284 do_compare_and_jump (op0, op1, UNLE, UNLE, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
285 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
286 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
287 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
288 case UNGT_EXPR: |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
289 do_compare_and_jump (op0, op1, UNGT, UNGT, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
290 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
291 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
292 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
293 case UNGE_EXPR: |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
294 do_compare_and_jump (op0, op1, UNGE, UNGE, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
295 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
296 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
297 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
298 case UNEQ_EXPR: |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
299 do_compare_and_jump (op0, op1, UNEQ, UNEQ, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
300 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
301 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
302 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
303 case LTGT_EXPR: |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
304 do_compare_and_jump (op0, op1, LTGT, LTGT, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
305 prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
306 break; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
307 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
308 case TRUTH_ANDIF_EXPR: |
| 111 | 309 { |
| 310 /* Spread the probability that the expression is false evenly between | |
| 311 the two conditions. So the first condition is false half the total | |
| 312 probability of being false. The second condition is false the other | |
| 313 half of the total probability of being false, so its jump has a false | |
| 314 probability of half the total, relative to the probability we | |
| 315 reached it (i.e. the first condition was true). */ | |
| 316 profile_probability op0_prob = profile_probability::uninitialized (); | |
| 317 profile_probability op1_prob = profile_probability::uninitialized (); | |
| 318 if (prob.initialized_p ()) | |
| 319 { | |
| 131 | 320 op1_prob = prob.invert (); |
| 321 op0_prob = op1_prob.split (profile_probability::even ()); | |
| 111 | 322 /* Get the probability that each jump below is true. */ |
| 131 | 323 op0_prob = op0_prob.invert (); |
| 324 op1_prob = op1_prob.invert (); | |
| 111 | 325 } |
| 326 if (if_false_label == NULL) | |
| 327 { | |
| 328 drop_through_label = gen_label_rtx (); | |
| 329 do_jump (op0, drop_through_label, NULL, op0_prob); | |
| 330 do_jump (op1, NULL, if_true_label, op1_prob); | |
| 331 } | |
| 332 else | |
| 333 { | |
| 334 do_jump (op0, if_false_label, NULL, op0_prob); | |
| 335 do_jump (op1, if_false_label, if_true_label, op1_prob); | |
| 336 } | |
| 337 break; | |
| 338 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
339 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
340 case TRUTH_ORIF_EXPR: |
| 111 | 341 { |
| 342 /* Spread the probability evenly between the two conditions. So | |
| 343 the first condition has half the total probability of being true. | |
| 344 The second condition has the other half of the total probability, | |
| 345 so its jump has a probability of half the total, relative to | |
| 346 the probability we reached it (i.e. the first condition was false). */ | |
| 347 profile_probability op0_prob = profile_probability::uninitialized (); | |
| 348 profile_probability op1_prob = profile_probability::uninitialized (); | |
| 349 if (prob.initialized_p ()) | |
| 350 { | |
| 131 | 351 op1_prob = prob; |
| 352 op0_prob = op1_prob.split (profile_probability::even ()); | |
| 111 | 353 } |
| 354 if (if_true_label == NULL) | |
| 355 { | |
| 356 drop_through_label = gen_label_rtx (); | |
| 357 do_jump (op0, NULL, drop_through_label, op0_prob); | |
| 358 do_jump (op1, if_false_label, NULL, op1_prob); | |
| 359 } | |
| 360 else | |
| 361 { | |
| 362 do_jump (op0, NULL, if_true_label, op0_prob); | |
| 363 do_jump (op1, if_false_label, if_true_label, op1_prob); | |
| 364 } | |
| 365 break; | |
| 366 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
367 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
368 default: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
369 gcc_unreachable (); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
370 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
371 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
372 if (drop_through_label) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
373 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
374 do_pending_stack_adjust (); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
375 emit_label (drop_through_label); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
376 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
377 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
378 |
| 0 | 379 /* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if |
| 380 the result is zero, or IF_TRUE_LABEL if the result is one. | |
| 381 Either of IF_FALSE_LABEL and IF_TRUE_LABEL may be zero, | |
| 382 meaning fall through in that case. | |
| 383 | |
| 384 do_jump always does any pending stack adjust except when it does not | |
| 385 actually perform a jump. An example where there is no jump | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
386 is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null. |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
387 |
| 111 | 388 PROB is probability of jump to if_true_label. */ |
| 0 | 389 |
| 131 | 390 static void |
| 111 | 391 do_jump (tree exp, rtx_code_label *if_false_label, |
| 392 rtx_code_label *if_true_label, profile_probability prob) | |
| 0 | 393 { |
| 394 enum tree_code code = TREE_CODE (exp); | |
| 395 rtx temp; | |
| 396 int i; | |
| 397 tree type; | |
| 111 | 398 scalar_int_mode mode; |
| 399 rtx_code_label *drop_through_label = NULL; | |
| 0 | 400 |
| 401 switch (code) | |
| 402 { | |
| 403 case ERROR_MARK: | |
| 404 break; | |
| 405 | |
| 406 case INTEGER_CST: | |
| 111 | 407 { |
| 408 rtx_code_label *lab = integer_zerop (exp) ? if_false_label | |
| 409 : if_true_label; | |
| 410 if (lab) | |
| 411 emit_jump (lab); | |
| 412 break; | |
| 413 } | |
| 0 | 414 |
| 415 #if 0 | |
| 416 /* This is not true with #pragma weak */ | |
| 417 case ADDR_EXPR: | |
| 418 /* The address of something can never be zero. */ | |
| 419 if (if_true_label) | |
| 420 emit_jump (if_true_label); | |
| 421 break; | |
| 422 #endif | |
| 423 | |
| 424 case NOP_EXPR: | |
| 425 if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF | |
| 426 || TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF | |
| 427 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_REF | |
| 428 || TREE_CODE (TREE_OPERAND (exp, 0)) == ARRAY_RANGE_REF) | |
| 429 goto normal; | |
| 111 | 430 /* FALLTHRU */ |
| 0 | 431 case CONVERT_EXPR: |
| 432 /* If we are narrowing the operand, we have to do the compare in the | |
| 433 narrower mode. */ | |
| 434 if ((TYPE_PRECISION (TREE_TYPE (exp)) | |
| 435 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))) | |
| 436 goto normal; | |
| 111 | 437 /* FALLTHRU */ |
| 0 | 438 case NON_LVALUE_EXPR: |
| 439 case ABS_EXPR: | |
| 131 | 440 case ABSU_EXPR: |
| 0 | 441 case NEGATE_EXPR: |
| 442 case LROTATE_EXPR: | |
| 443 case RROTATE_EXPR: | |
| 444 /* These cannot change zero->nonzero or vice versa. */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
445 do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label, prob); |
| 0 | 446 break; |
| 447 | |
| 448 case TRUTH_NOT_EXPR: | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
449 do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label, |
| 111 | 450 prob.invert ()); |
| 0 | 451 break; |
| 452 | |
| 453 case COND_EXPR: | |
| 454 { | |
| 111 | 455 rtx_code_label *label1 = gen_label_rtx (); |
| 0 | 456 if (!if_true_label || !if_false_label) |
| 457 { | |
| 458 drop_through_label = gen_label_rtx (); | |
| 459 if (!if_true_label) | |
| 460 if_true_label = drop_through_label; | |
| 461 if (!if_false_label) | |
| 462 if_false_label = drop_through_label; | |
| 463 } | |
| 464 | |
| 465 do_pending_stack_adjust (); | |
| 111 | 466 do_jump (TREE_OPERAND (exp, 0), label1, NULL, |
| 467 profile_probability::uninitialized ()); | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
468 do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label, prob); |
| 0 | 469 emit_label (label1); |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
470 do_jump (TREE_OPERAND (exp, 2), if_false_label, if_true_label, prob); |
| 0 | 471 break; |
| 472 } | |
| 473 | |
| 474 case COMPOUND_EXPR: | |
| 475 /* Lowered by gimplify.c. */ | |
| 476 gcc_unreachable (); | |
| 477 | |
| 478 case MINUS_EXPR: | |
| 479 /* Nonzero iff operands of minus differ. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
480 code = NE_EXPR; |
| 0 | 481 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
482 /* FALLTHRU */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
483 case EQ_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
484 case NE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
485 case LT_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
486 case LE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
487 case GT_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
488 case GE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
489 case ORDERED_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
490 case UNORDERED_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
491 case UNLT_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
492 case UNLE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
493 case UNGT_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
494 case UNGE_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
495 case UNEQ_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
496 case LTGT_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
497 case TRUTH_ANDIF_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
498 case TRUTH_ORIF_EXPR: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
499 other_code: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
500 do_jump_1 (code, TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1), |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
501 if_false_label, if_true_label, prob); |
| 0 | 502 break; |
| 503 | |
| 504 case BIT_AND_EXPR: | |
| 505 /* fold_single_bit_test() converts (X & (1 << C)) into (X >> C) & 1. | |
| 506 See if the former is preferred for jump tests and restore it | |
| 507 if so. */ | |
| 508 if (integer_onep (TREE_OPERAND (exp, 1))) | |
| 509 { | |
| 510 tree exp0 = TREE_OPERAND (exp, 0); | |
| 111 | 511 rtx_code_label *set_label, *clr_label; |
| 512 profile_probability setclr_prob = prob; | |
| 0 | 513 |
| 514 /* Strip narrowing integral type conversions. */ | |
| 515 while (CONVERT_EXPR_P (exp0) | |
| 516 && TREE_OPERAND (exp0, 0) != error_mark_node | |
| 517 && TYPE_PRECISION (TREE_TYPE (exp0)) | |
| 518 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp0, 0)))) | |
| 519 exp0 = TREE_OPERAND (exp0, 0); | |
| 520 | |
| 521 /* "exp0 ^ 1" inverts the sense of the single bit test. */ | |
| 522 if (TREE_CODE (exp0) == BIT_XOR_EXPR | |
| 523 && integer_onep (TREE_OPERAND (exp0, 1))) | |
| 524 { | |
| 525 exp0 = TREE_OPERAND (exp0, 0); | |
| 526 clr_label = if_true_label; | |
| 527 set_label = if_false_label; | |
| 111 | 528 setclr_prob = prob.invert (); |
| 0 | 529 } |
| 530 else | |
| 531 { | |
| 532 clr_label = if_false_label; | |
| 533 set_label = if_true_label; | |
| 534 } | |
| 535 | |
| 536 if (TREE_CODE (exp0) == RSHIFT_EXPR) | |
| 537 { | |
| 538 tree arg = TREE_OPERAND (exp0, 0); | |
| 539 tree shift = TREE_OPERAND (exp0, 1); | |
| 540 tree argtype = TREE_TYPE (arg); | |
| 541 if (TREE_CODE (shift) == INTEGER_CST | |
| 542 && compare_tree_int (shift, 0) >= 0 | |
| 543 && compare_tree_int (shift, HOST_BITS_PER_WIDE_INT) < 0 | |
| 111 | 544 && prefer_and_bit_test (SCALAR_INT_TYPE_MODE (argtype), |
| 0 | 545 TREE_INT_CST_LOW (shift))) |
| 546 { | |
|
19
58ad6c70ea60
update gcc from 4.4.0 to 4.4.1.
kent@firefly.cr.ie.u-ryukyu.ac.jp
parents:
0
diff
changeset
|
547 unsigned HOST_WIDE_INT mask |
| 111 | 548 = HOST_WIDE_INT_1U << TREE_INT_CST_LOW (shift); |
| 0 | 549 do_jump (build2 (BIT_AND_EXPR, argtype, arg, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
550 build_int_cstu (argtype, mask)), |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
551 clr_label, set_label, setclr_prob); |
| 0 | 552 break; |
| 553 } | |
| 554 } | |
| 555 } | |
| 556 | |
| 557 /* If we are AND'ing with a small constant, do this comparison in the | |
| 558 smallest type that fits. If the machine doesn't have comparisons | |
| 559 that small, it will be converted back to the wider comparison. | |
| 560 This helps if we are testing the sign bit of a narrower object. | |
| 561 combine can't do this for us because it can't know whether a | |
| 562 ZERO_EXTRACT or a compare in a smaller mode exists, but we do. */ | |
| 563 | |
| 564 if (! SLOW_BYTE_ACCESS | |
| 565 && TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST | |
| 566 && TYPE_PRECISION (TREE_TYPE (exp)) <= HOST_BITS_PER_WIDE_INT | |
| 567 && (i = tree_floor_log2 (TREE_OPERAND (exp, 1))) >= 0 | |
| 111 | 568 && int_mode_for_size (i + 1, 0).exists (&mode) |
| 0 | 569 && (type = lang_hooks.types.type_for_mode (mode, 1)) != 0 |
| 570 && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp)) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
571 && have_insn_for (COMPARE, TYPE_MODE (type))) |
| 0 | 572 { |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
573 do_jump (fold_convert (type, exp), if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
574 prob); |
| 0 | 575 break; |
| 576 } | |
| 577 | |
| 578 if (TYPE_PRECISION (TREE_TYPE (exp)) > 1 | |
| 579 || TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST) | |
| 580 goto normal; | |
| 581 | |
| 582 /* Boolean comparisons can be compiled as TRUTH_AND_EXPR. */ | |
| 111 | 583 /* FALLTHRU */ |
| 0 | 584 |
| 585 case TRUTH_AND_EXPR: | |
| 586 /* High branch cost, expand as the bitwise AND of the conditions. | |
| 587 Do the same if the RHS has side effects, because we're effectively | |
| 588 turning a TRUTH_AND_EXPR into a TRUTH_ANDIF_EXPR. */ | |
| 589 if (BRANCH_COST (optimize_insn_for_speed_p (), | |
| 590 false) >= 4 | |
| 591 || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1))) | |
| 592 goto normal; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
593 code = TRUTH_ANDIF_EXPR; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
594 goto other_code; |
| 0 | 595 |
| 596 case BIT_IOR_EXPR: | |
| 597 case TRUTH_OR_EXPR: | |
| 598 /* High branch cost, expand as the bitwise OR of the conditions. | |
| 599 Do the same if the RHS has side effects, because we're effectively | |
| 600 turning a TRUTH_OR_EXPR into a TRUTH_ORIF_EXPR. */ | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
601 if (BRANCH_COST (optimize_insn_for_speed_p (), false) >= 4 |
| 0 | 602 || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1))) |
| 603 goto normal; | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
604 code = TRUTH_ORIF_EXPR; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
605 goto other_code; |
| 0 | 606 |
| 607 /* Fall through and generate the normal code. */ | |
| 608 default: | |
| 609 normal: | |
| 610 temp = expand_normal (exp); | |
| 611 do_pending_stack_adjust (); | |
| 612 /* The RTL optimizers prefer comparisons against pseudos. */ | |
| 613 if (GET_CODE (temp) == SUBREG) | |
| 614 { | |
| 615 /* Compare promoted variables in their promoted mode. */ | |
| 616 if (SUBREG_PROMOTED_VAR_P (temp) | |
| 617 && REG_P (XEXP (temp, 0))) | |
| 618 temp = XEXP (temp, 0); | |
| 619 else | |
| 620 temp = copy_to_reg (temp); | |
| 621 } | |
| 622 do_compare_rtx_and_jump (temp, CONST0_RTX (GET_MODE (temp)), | |
| 623 NE, TYPE_UNSIGNED (TREE_TYPE (exp)), | |
| 624 GET_MODE (temp), NULL_RTX, | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
625 if_false_label, if_true_label, prob); |
| 0 | 626 } |
| 627 | |
| 628 if (drop_through_label) | |
| 629 { | |
| 630 do_pending_stack_adjust (); | |
| 631 emit_label (drop_through_label); | |
| 632 } | |
| 633 } | |
| 634 | |
| 635 /* Compare OP0 with OP1, word at a time, in mode MODE. | |
| 636 UNSIGNEDP says to do unsigned comparison. | |
| 637 Jump to IF_TRUE_LABEL if OP0 is greater, IF_FALSE_LABEL otherwise. */ | |
| 638 | |
| 639 static void | |
| 111 | 640 do_jump_by_parts_greater_rtx (scalar_int_mode mode, int unsignedp, rtx op0, |
| 641 rtx op1, rtx_code_label *if_false_label, | |
| 642 rtx_code_label *if_true_label, | |
| 643 profile_probability prob) | |
| 0 | 644 { |
| 645 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD); | |
| 111 | 646 rtx_code_label *drop_through_label = 0; |
| 647 bool drop_through_if_true = false, drop_through_if_false = false; | |
| 648 enum rtx_code code = GT; | |
| 0 | 649 int i; |
| 650 | |
| 651 if (! if_true_label || ! if_false_label) | |
| 652 drop_through_label = gen_label_rtx (); | |
| 653 if (! if_true_label) | |
| 111 | 654 { |
| 655 if_true_label = drop_through_label; | |
| 656 drop_through_if_true = true; | |
| 657 } | |
| 0 | 658 if (! if_false_label) |
| 111 | 659 { |
| 660 if_false_label = drop_through_label; | |
| 661 drop_through_if_false = true; | |
| 662 } | |
| 663 | |
| 664 /* Deal with the special case 0 > x: only one comparison is necessary and | |
| 665 we reverse it to avoid jumping to the drop-through label. */ | |
| 666 if (op0 == const0_rtx && drop_through_if_true && !drop_through_if_false) | |
| 667 { | |
| 668 code = LE; | |
| 669 if_true_label = if_false_label; | |
| 670 if_false_label = drop_through_label; | |
| 671 drop_through_if_true = false; | |
| 672 drop_through_if_false = true; | |
| 673 prob = prob.invert (); | |
| 674 } | |
| 0 | 675 |
| 676 /* Compare a word at a time, high order first. */ | |
| 677 for (i = 0; i < nwords; i++) | |
| 678 { | |
| 679 rtx op0_word, op1_word; | |
| 680 | |
| 681 if (WORDS_BIG_ENDIAN) | |
| 682 { | |
| 683 op0_word = operand_subword_force (op0, i, mode); | |
| 684 op1_word = operand_subword_force (op1, i, mode); | |
| 685 } | |
| 686 else | |
| 687 { | |
| 688 op0_word = operand_subword_force (op0, nwords - 1 - i, mode); | |
| 689 op1_word = operand_subword_force (op1, nwords - 1 - i, mode); | |
| 690 } | |
| 691 | |
| 692 /* All but high-order word must be compared as unsigned. */ | |
| 111 | 693 do_compare_rtx_and_jump (op0_word, op1_word, code, (unsignedp || i > 0), |
| 694 word_mode, NULL_RTX, NULL, if_true_label, | |
| 695 prob); | |
| 696 | |
| 697 /* Emit only one comparison for 0. Do not emit the last cond jump. */ | |
| 698 if (op0 == const0_rtx || i == nwords - 1) | |
| 699 break; | |
| 0 | 700 |
| 701 /* Consider lower words only if these are equal. */ | |
| 702 do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode, | |
| 111 | 703 NULL_RTX, NULL, if_false_label, |
| 704 prob.invert ()); | |
| 0 | 705 } |
| 706 | |
| 111 | 707 if (!drop_through_if_false) |
| 0 | 708 emit_jump (if_false_label); |
| 709 if (drop_through_label) | |
| 710 emit_label (drop_through_label); | |
| 711 } | |
| 712 | |
| 713 /* Given a comparison expression EXP for values too wide to be compared | |
| 714 with one insn, test the comparison and jump to the appropriate label. | |
| 715 The code of EXP is ignored; we always test GT if SWAP is 0, | |
| 111 | 716 and LT if SWAP is 1. MODE is the mode of the two operands. */ |
| 0 | 717 |
| 718 static void | |
| 111 | 719 do_jump_by_parts_greater (scalar_int_mode mode, tree treeop0, tree treeop1, |
| 720 int swap, rtx_code_label *if_false_label, | |
| 721 rtx_code_label *if_true_label, | |
| 722 profile_probability prob) | |
| 0 | 723 { |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
724 rtx op0 = expand_normal (swap ? treeop1 : treeop0); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
725 rtx op1 = expand_normal (swap ? treeop0 : treeop1); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
726 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (treeop0)); |
| 0 | 727 |
| 728 do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
729 if_true_label, prob); |
| 0 | 730 } |
| 731 | |
| 732 /* Jump according to whether OP0 is 0. We assume that OP0 has an integer | |
| 733 mode, MODE, that is too wide for the available compare insns. Either | |
| 111 | 734 Either (but not both) of IF_TRUE_LABEL and IF_FALSE_LABEL may be NULL |
| 0 | 735 to indicate drop through. */ |
| 736 | |
| 737 static void | |
| 111 | 738 do_jump_by_parts_zero_rtx (scalar_int_mode mode, rtx op0, |
| 739 rtx_code_label *if_false_label, | |
| 740 rtx_code_label *if_true_label, | |
| 741 profile_probability prob) | |
| 0 | 742 { |
| 743 int nwords = GET_MODE_SIZE (mode) / UNITS_PER_WORD; | |
| 744 rtx part; | |
| 745 int i; | |
| 111 | 746 rtx_code_label *drop_through_label = NULL; |
| 0 | 747 |
| 748 /* The fastest way of doing this comparison on almost any machine is to | |
| 749 "or" all the words and compare the result. If all have to be loaded | |
| 750 from memory and this is a very wide item, it's possible this may | |
| 751 be slower, but that's highly unlikely. */ | |
| 752 | |
| 753 part = gen_reg_rtx (word_mode); | |
| 754 emit_move_insn (part, operand_subword_force (op0, 0, mode)); | |
| 755 for (i = 1; i < nwords && part != 0; i++) | |
| 756 part = expand_binop (word_mode, ior_optab, part, | |
| 757 operand_subword_force (op0, i, mode), | |
| 758 part, 1, OPTAB_WIDEN); | |
| 759 | |
| 760 if (part != 0) | |
| 761 { | |
| 762 do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode, | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
763 NULL_RTX, if_false_label, if_true_label, prob); |
| 0 | 764 return; |
| 765 } | |
| 766 | |
| 767 /* If we couldn't do the "or" simply, do this with a series of compares. */ | |
| 768 if (! if_false_label) | |
| 111 | 769 if_false_label = drop_through_label = gen_label_rtx (); |
| 0 | 770 |
| 771 for (i = 0; i < nwords; i++) | |
| 772 do_compare_rtx_and_jump (operand_subword_force (op0, i, mode), | |
| 773 const0_rtx, EQ, 1, word_mode, NULL_RTX, | |
| 111 | 774 if_false_label, NULL, prob); |
| 0 | 775 |
| 776 if (if_true_label) | |
| 777 emit_jump (if_true_label); | |
| 778 | |
| 779 if (drop_through_label) | |
| 780 emit_label (drop_through_label); | |
| 781 } | |
| 782 | |
| 783 /* Test for the equality of two RTX expressions OP0 and OP1 in mode MODE, | |
| 784 where MODE is an integer mode too wide to be compared with one insn. | |
| 785 Either (but not both) of IF_TRUE_LABEL and IF_FALSE_LABEL may be NULL_RTX | |
| 786 to indicate drop through. */ | |
| 787 | |
| 788 static void | |
| 111 | 789 do_jump_by_parts_equality_rtx (scalar_int_mode mode, rtx op0, rtx op1, |
| 790 rtx_code_label *if_false_label, | |
| 791 rtx_code_label *if_true_label, | |
| 792 profile_probability prob) | |
| 0 | 793 { |
| 794 int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD); | |
| 111 | 795 rtx_code_label *drop_through_label = NULL; |
| 0 | 796 int i; |
| 797 | |
| 798 if (op1 == const0_rtx) | |
| 799 { | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
800 do_jump_by_parts_zero_rtx (mode, op0, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
801 prob); |
| 0 | 802 return; |
| 803 } | |
| 804 else if (op0 == const0_rtx) | |
| 805 { | |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
806 do_jump_by_parts_zero_rtx (mode, op1, if_false_label, if_true_label, |
|
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
807 prob); |
| 0 | 808 return; |
| 809 } | |
| 810 | |
| 811 if (! if_false_label) | |
| 812 drop_through_label = if_false_label = gen_label_rtx (); | |
| 813 | |
| 814 for (i = 0; i < nwords; i++) | |
| 815 do_compare_rtx_and_jump (operand_subword_force (op0, i, mode), | |
| 816 operand_subword_force (op1, i, mode), | |
| 817 EQ, 0, word_mode, NULL_RTX, | |
| 111 | 818 if_false_label, NULL, prob); |
| 0 | 819 |
| 820 if (if_true_label) | |
| 821 emit_jump (if_true_label); | |
| 822 if (drop_through_label) | |
| 823 emit_label (drop_through_label); | |
| 824 } | |
| 825 | |
| 826 /* Given an EQ_EXPR expression EXP for values too wide to be compared | |
| 111 | 827 with one insn, test the comparison and jump to the appropriate label. |
| 828 MODE is the mode of the two operands. */ | |
| 0 | 829 |
| 830 static void | |
| 111 | 831 do_jump_by_parts_equality (scalar_int_mode mode, tree treeop0, tree treeop1, |
| 832 rtx_code_label *if_false_label, | |
| 833 rtx_code_label *if_true_label, | |
| 834 profile_probability prob) | |
| 0 | 835 { |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
836 rtx op0 = expand_normal (treeop0); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
837 rtx op1 = expand_normal (treeop1); |
| 0 | 838 do_jump_by_parts_equality_rtx (mode, op0, op1, if_false_label, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
839 if_true_label, prob); |
| 0 | 840 } |
| 841 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
842 /* Split a comparison into two others, the second of which has the other |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
843 "orderedness". The first is always ORDERED or UNORDERED if MODE |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
844 does not honor NaNs (which means that it can be skipped in that case; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
845 see do_compare_rtx_and_jump). |
| 0 | 846 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
847 The two conditions are written in *CODE1 and *CODE2. Return true if |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
848 the conditions must be ANDed, false if they must be ORed. */ |
| 0 | 849 |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
850 bool |
| 111 | 851 split_comparison (enum rtx_code code, machine_mode mode, |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
852 enum rtx_code *code1, enum rtx_code *code2) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
853 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
854 switch (code) |
| 0 | 855 { |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
856 case LT: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
857 *code1 = ORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
858 *code2 = UNLT; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
859 return true; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
860 case LE: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
861 *code1 = ORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
862 *code2 = UNLE; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
863 return true; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
864 case GT: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
865 *code1 = ORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
866 *code2 = UNGT; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
867 return true; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
868 case GE: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
869 *code1 = ORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
870 *code2 = UNGE; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
871 return true; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
872 case EQ: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
873 *code1 = ORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
874 *code2 = UNEQ; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
875 return true; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
876 case NE: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
877 *code1 = UNORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
878 *code2 = LTGT; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
879 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
880 case UNLT: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
881 *code1 = UNORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
882 *code2 = LT; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
883 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
884 case UNLE: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
885 *code1 = UNORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
886 *code2 = LE; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
887 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
888 case UNGT: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
889 *code1 = UNORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
890 *code2 = GT; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
891 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
892 case UNGE: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
893 *code1 = UNORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
894 *code2 = GE; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
895 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
896 case UNEQ: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
897 *code1 = UNORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
898 *code2 = EQ; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
899 return false; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
900 case LTGT: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
901 /* Do not turn a trapping comparison into a non-trapping one. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
902 if (HONOR_SNANS (mode)) |
| 0 | 903 { |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
904 *code1 = LT; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
905 *code2 = GT; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
906 return false; |
| 0 | 907 } |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
908 else |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
909 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
910 *code1 = ORDERED; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
911 *code2 = NE; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
912 return true; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
913 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
914 default: |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
915 gcc_unreachable (); |
| 0 | 916 } |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
917 } |
| 0 | 918 |
| 131 | 919 /* Generate code to evaluate EXP and jump to LABEL if the value is nonzero. |
| 920 PROB is probability of jump to LABEL. */ | |
| 921 | |
| 922 void | |
| 923 jumpif (tree exp, rtx_code_label *label, profile_probability prob) | |
| 924 { | |
| 925 do_jump (exp, NULL, label, prob); | |
| 926 } | |
| 927 | |
| 928 /* Similar to jumpif but dealing with exploded comparisons of the type | |
| 929 OP0 CODE OP1 . LABEL and PROB are like in jumpif. */ | |
| 930 | |
| 931 void | |
| 932 jumpif_1 (enum tree_code code, tree op0, tree op1, rtx_code_label *label, | |
| 933 profile_probability prob) | |
| 934 { | |
| 935 do_jump_1 (code, op0, op1, NULL, label, prob); | |
| 936 } | |
| 937 | |
| 938 /* Generate code to evaluate EXP and jump to LABEL if the value is zero. | |
| 939 PROB is probability of jump to LABEL. */ | |
| 940 | |
| 941 void | |
| 942 jumpifnot (tree exp, rtx_code_label *label, profile_probability prob) | |
| 943 { | |
| 944 do_jump (exp, label, NULL, prob.invert ()); | |
| 945 } | |
| 946 | |
| 947 /* Similar to jumpifnot but dealing with exploded comparisons of the type | |
| 948 OP0 CODE OP1 . LABEL and PROB are like in jumpifnot. */ | |
| 949 | |
| 950 void | |
| 951 jumpifnot_1 (enum tree_code code, tree op0, tree op1, rtx_code_label *label, | |
| 952 profile_probability prob) | |
| 953 { | |
| 954 do_jump_1 (code, op0, op1, label, NULL, prob.invert ()); | |
| 955 } | |
| 0 | 956 |
| 957 /* Like do_compare_and_jump but expects the values to compare as two rtx's. | |
| 958 The decision as to signed or unsigned comparison must be made by the caller. | |
| 959 | |
| 960 If MODE is BLKmode, SIZE is an RTX giving the size of the objects being | |
| 961 compared. */ | |
| 962 | |
| 963 void | |
| 964 do_compare_rtx_and_jump (rtx op0, rtx op1, enum rtx_code code, int unsignedp, | |
| 111 | 965 machine_mode mode, rtx size, |
| 966 rtx_code_label *if_false_label, | |
| 967 rtx_code_label *if_true_label, | |
| 968 profile_probability prob) | |
| 0 | 969 { |
| 970 rtx tem; | |
| 111 | 971 rtx_code_label *dummy_label = NULL; |
| 0 | 972 |
| 973 /* Reverse the comparison if that is safe and we want to jump if it is | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
974 false. Also convert to the reverse comparison if the target can |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
975 implement it. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
976 if ((! if_true_label |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
977 || ! can_compare_p (code, mode, ccp_jump)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
978 && (! FLOAT_MODE_P (mode) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
979 || code == ORDERED || code == UNORDERED |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
980 || (! HONOR_NANS (mode) && (code == LTGT || code == UNEQ)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
981 || (! HONOR_SNANS (mode) && (code == EQ || code == NE)))) |
| 0 | 982 { |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
983 enum rtx_code rcode; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
984 if (FLOAT_MODE_P (mode)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
985 rcode = reverse_condition_maybe_unordered (code); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
986 else |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
987 rcode = reverse_condition (code); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
988 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
989 /* Canonicalize to UNORDERED for the libcall. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
990 if (can_compare_p (rcode, mode, ccp_jump) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
991 || (code == ORDERED && ! can_compare_p (ORDERED, mode, ccp_jump))) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
992 { |
| 111 | 993 std::swap (if_true_label, if_false_label); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
994 code = rcode; |
| 111 | 995 prob = prob.invert (); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
996 } |
| 0 | 997 } |
| 998 | |
| 999 /* If one operand is constant, make it the second one. Only do this | |
| 1000 if the other operand is not constant as well. */ | |
| 1001 | |
| 1002 if (swap_commutative_operands_p (op0, op1)) | |
| 1003 { | |
| 111 | 1004 std::swap (op0, op1); |
| 0 | 1005 code = swap_condition (code); |
| 1006 } | |
| 1007 | |
| 1008 do_pending_stack_adjust (); | |
| 1009 | |
| 1010 code = unsignedp ? unsigned_condition (code) : code; | |
| 131 | 1011 if ((tem = simplify_relational_operation (code, mode, VOIDmode, |
| 1012 op0, op1)) != 0) | |
| 0 | 1013 { |
| 1014 if (CONSTANT_P (tem)) | |
| 1015 { | |
| 111 | 1016 rtx_code_label *label = (tem == const0_rtx |
| 1017 || tem == CONST0_RTX (mode)) | |
| 1018 ? if_false_label : if_true_label; | |
| 0 | 1019 if (label) |
| 1020 emit_jump (label); | |
| 1021 return; | |
| 1022 } | |
| 1023 | |
| 1024 code = GET_CODE (tem); | |
| 1025 mode = GET_MODE (tem); | |
| 1026 op0 = XEXP (tem, 0); | |
| 1027 op1 = XEXP (tem, 1); | |
| 1028 unsignedp = (code == GTU || code == LTU || code == GEU || code == LEU); | |
| 1029 } | |
| 1030 | |
| 1031 if (! if_true_label) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1032 dummy_label = if_true_label = gen_label_rtx (); |
| 0 | 1033 |
| 111 | 1034 scalar_int_mode int_mode; |
| 1035 if (is_int_mode (mode, &int_mode) | |
| 1036 && ! can_compare_p (code, int_mode, ccp_jump)) | |
| 0 | 1037 { |
| 1038 switch (code) | |
| 1039 { | |
| 1040 case LTU: | |
| 111 | 1041 do_jump_by_parts_greater_rtx (int_mode, 1, op1, op0, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1042 if_false_label, if_true_label, prob); |
| 0 | 1043 break; |
| 1044 | |
| 1045 case LEU: | |
| 111 | 1046 do_jump_by_parts_greater_rtx (int_mode, 1, op0, op1, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1047 if_true_label, if_false_label, |
| 111 | 1048 prob.invert ()); |
| 0 | 1049 break; |
| 1050 | |
| 1051 case GTU: | |
| 111 | 1052 do_jump_by_parts_greater_rtx (int_mode, 1, op0, op1, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1053 if_false_label, if_true_label, prob); |
| 0 | 1054 break; |
| 1055 | |
| 1056 case GEU: | |
| 111 | 1057 do_jump_by_parts_greater_rtx (int_mode, 1, op1, op0, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1058 if_true_label, if_false_label, |
| 111 | 1059 prob.invert ()); |
| 0 | 1060 break; |
| 1061 | |
| 1062 case LT: | |
| 111 | 1063 do_jump_by_parts_greater_rtx (int_mode, 0, op1, op0, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1064 if_false_label, if_true_label, prob); |
| 0 | 1065 break; |
| 1066 | |
| 1067 case LE: | |
| 111 | 1068 do_jump_by_parts_greater_rtx (int_mode, 0, op0, op1, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1069 if_true_label, if_false_label, |
| 111 | 1070 prob.invert ()); |
| 0 | 1071 break; |
| 1072 | |
| 1073 case GT: | |
| 111 | 1074 do_jump_by_parts_greater_rtx (int_mode, 0, op0, op1, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1075 if_false_label, if_true_label, prob); |
| 0 | 1076 break; |
| 1077 | |
| 1078 case GE: | |
| 111 | 1079 do_jump_by_parts_greater_rtx (int_mode, 0, op1, op0, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1080 if_true_label, if_false_label, |
| 111 | 1081 prob.invert ()); |
| 0 | 1082 break; |
| 1083 | |
| 1084 case EQ: | |
| 111 | 1085 do_jump_by_parts_equality_rtx (int_mode, op0, op1, if_false_label, |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1086 if_true_label, prob); |
| 0 | 1087 break; |
| 1088 | |
| 1089 case NE: | |
| 111 | 1090 do_jump_by_parts_equality_rtx (int_mode, op0, op1, if_true_label, |
| 1091 if_false_label, | |
| 1092 prob.invert ()); | |
| 0 | 1093 break; |
| 1094 | |
| 1095 default: | |
| 1096 gcc_unreachable (); | |
| 1097 } | |
| 1098 } | |
| 1099 else | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1100 { |
| 111 | 1101 if (SCALAR_FLOAT_MODE_P (mode) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1102 && ! can_compare_p (code, mode, ccp_jump) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1103 && can_compare_p (swap_condition (code), mode, ccp_jump)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1104 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1105 code = swap_condition (code); |
| 111 | 1106 std::swap (op0, op1); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1107 } |
| 111 | 1108 else if (SCALAR_FLOAT_MODE_P (mode) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1109 && ! can_compare_p (code, mode, ccp_jump) |
| 111 | 1110 /* Never split ORDERED and UNORDERED. |
| 1111 These must be implemented. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1112 && (code != ORDERED && code != UNORDERED) |
| 111 | 1113 /* Split a floating-point comparison if |
| 1114 we can jump on other conditions... */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1115 && (have_insn_for (COMPARE, mode) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1116 /* ... or if there is no libcall for it. */ |
| 111 | 1117 || code_to_optab (code) == unknown_optab)) |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1118 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1119 enum rtx_code first_code; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1120 bool and_them = split_comparison (code, mode, &first_code, &code); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1121 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1122 /* If there are no NaNs, the first comparison should always fall |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1123 through. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1124 if (!HONOR_NANS (mode)) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1125 gcc_assert (first_code == (and_them ? ORDERED : UNORDERED)); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1126 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1127 else |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1128 { |
| 131 | 1129 profile_probability cprob |
| 1130 = profile_probability::guessed_always (); | |
| 111 | 1131 if (first_code == UNORDERED) |
| 131 | 1132 cprob = cprob.apply_scale (1, 100); |
| 111 | 1133 else if (first_code == ORDERED) |
| 131 | 1134 cprob = cprob.apply_scale (99, 100); |
| 1135 else | |
| 1136 cprob = profile_probability::even (); | |
| 1137 /* We want to split: | |
| 1138 if (x) goto t; // prob; | |
| 1139 into | |
| 1140 if (a) goto t; // first_prob; | |
| 1141 if (b) goto t; // prob; | |
| 1142 such that the overall probability of jumping to t | |
| 1143 remains the same and first_prob is prob * cprob. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1144 if (and_them) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1145 { |
| 111 | 1146 rtx_code_label *dest_label; |
| 131 | 1147 prob = prob.invert (); |
| 1148 profile_probability first_prob = prob.split (cprob).invert (); | |
| 1149 prob = prob.invert (); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1150 /* If we only jump if true, just bypass the second jump. */ |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1151 if (! if_false_label) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1152 { |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1153 if (! dummy_label) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1154 dummy_label = gen_label_rtx (); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1155 dest_label = dummy_label; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1156 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1157 else |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1158 dest_label = if_false_label; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1159 do_compare_rtx_and_jump (op0, op1, first_code, unsignedp, mode, |
| 111 | 1160 size, dest_label, NULL, first_prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1161 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1162 else |
| 131 | 1163 { |
| 1164 profile_probability first_prob = prob.split (cprob); | |
| 1165 do_compare_rtx_and_jump (op0, op1, first_code, unsignedp, mode, | |
| 1166 size, NULL, if_true_label, first_prob); | |
| 1167 } | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1168 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1169 } |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1170 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1171 emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp, |
| 111 | 1172 if_true_label, prob); |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1173 } |
| 0 | 1174 |
| 1175 if (if_false_label) | |
| 1176 emit_jump (if_false_label); | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1177 if (dummy_label) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1178 emit_label (dummy_label); |
| 0 | 1179 } |
| 1180 | |
| 1181 /* Generate code for a comparison expression EXP (including code to compute | |
| 1182 the values to be compared) and a conditional jump to IF_FALSE_LABEL and/or | |
| 1183 IF_TRUE_LABEL. One of the labels can be NULL_RTX, in which case the | |
| 1184 generated code will drop through. | |
| 1185 SIGNED_CODE should be the rtx operation for this comparison for | |
| 1186 signed data; UNSIGNED_CODE, likewise for use if data is unsigned. | |
| 1187 | |
| 1188 We force a stack adjustment unless there are currently | |
| 1189 things pushed on the stack that aren't yet used. */ | |
| 1190 | |
| 1191 static void | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1192 do_compare_and_jump (tree treeop0, tree treeop1, enum rtx_code signed_code, |
| 111 | 1193 enum rtx_code unsigned_code, |
| 1194 rtx_code_label *if_false_label, | |
| 1195 rtx_code_label *if_true_label, profile_probability prob) | |
| 0 | 1196 { |
| 1197 rtx op0, op1; | |
| 1198 tree type; | |
| 111 | 1199 machine_mode mode; |
| 0 | 1200 int unsignedp; |
| 1201 enum rtx_code code; | |
| 1202 | |
| 1203 /* Don't crash if the comparison was erroneous. */ | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1204 op0 = expand_normal (treeop0); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1205 if (TREE_CODE (treeop0) == ERROR_MARK) |
| 0 | 1206 return; |
| 1207 | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1208 op1 = expand_normal (treeop1); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1209 if (TREE_CODE (treeop1) == ERROR_MARK) |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1210 return; |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1211 |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1212 type = TREE_TYPE (treeop0); |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1213 if (TREE_CODE (treeop0) == INTEGER_CST |
|
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1214 && (TREE_CODE (treeop1) != INTEGER_CST |
| 111 | 1215 || (GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE (type)) |
| 1216 > GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE (TREE_TYPE (treeop1)))))) | |
| 1217 /* op0 might have been replaced by promoted constant, in which | |
| 1218 case the type of second argument should be used. */ | |
| 1219 type = TREE_TYPE (treeop1); | |
| 1220 mode = TYPE_MODE (type); | |
| 0 | 1221 unsignedp = TYPE_UNSIGNED (type); |
| 1222 code = unsignedp ? unsigned_code : signed_code; | |
| 1223 | |
| 1224 /* If function pointers need to be "canonicalized" before they can | |
| 131 | 1225 be reliably compared, then canonicalize them. Canonicalize the |
| 1226 expression when one of the operands is a function pointer. This | |
| 1227 handles the case where the other operand is a void pointer. See | |
| 1228 PR middle-end/17564. */ | |
| 111 | 1229 if (targetm.have_canonicalize_funcptr_for_compare () |
| 131 | 1230 && ((POINTER_TYPE_P (TREE_TYPE (treeop0)) |
| 1231 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0)))) | |
| 1232 || (POINTER_TYPE_P (TREE_TYPE (treeop1)) | |
| 1233 && FUNC_OR_METHOD_TYPE_P (TREE_TYPE (TREE_TYPE (treeop1)))))) | |
| 0 | 1234 { |
| 1235 rtx new_op0 = gen_reg_rtx (mode); | |
| 1236 rtx new_op1 = gen_reg_rtx (mode); | |
| 1237 | |
| 111 | 1238 emit_insn (targetm.gen_canonicalize_funcptr_for_compare (new_op0, op0)); |
| 0 | 1239 op0 = new_op0; |
| 1240 | |
| 111 | 1241 emit_insn (targetm.gen_canonicalize_funcptr_for_compare (new_op1, op1)); |
| 0 | 1242 op1 = new_op1; |
| 1243 } | |
| 1244 | |
| 1245 do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode, | |
| 1246 ((mode == BLKmode) | |
|
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
19
diff
changeset
|
1247 ? expr_size (treeop0) : NULL_RTX), |
|
63
b7f97abdc517
update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1248 if_false_label, if_true_label, prob); |
| 0 | 1249 } |
| 1250 | |
| 1251 #include "gt-dojump.h" |