]>
Commit | Line | Data |
---|---|---|
48fefb59 | 1 | /* Convert tree expression to rtl instructions, for GNU compiler. |
fbd26352 | 2 | Copyright (C) 1988-2019 Free Software Foundation, Inc. |
48fefb59 | 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 | |
8c4c00c1 | 8 | Software Foundation; either version 3, or (at your option) any later |
48fefb59 | 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 | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
48fefb59 | 19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
9ef16211 | 23 | #include "backend.h" |
7c29e30e | 24 | #include "target.h" |
48fefb59 | 25 | #include "rtl.h" |
26 | #include "tree.h" | |
7c29e30e | 27 | #include "predict.h" |
ad7b10a2 | 28 | #include "memmodel.h" |
7c29e30e | 29 | #include "tm_p.h" |
7c29e30e | 30 | #include "optabs.h" |
31 | #include "emit-rtl.h" | |
b20a8bb4 | 32 | #include "fold-const.h" |
9ed99284 | 33 | #include "stor-layout.h" |
48fefb59 | 34 | /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */ |
d53441c8 | 35 | #include "dojump.h" |
36 | #include "explow.h" | |
48fefb59 | 37 | #include "expr.h" |
48fefb59 | 38 | #include "langhooks.h" |
39 | ||
f77c4496 | 40 | static bool prefer_and_bit_test (scalar_int_mode, int); |
2c0b7348 | 41 | static void do_jump (tree, rtx_code_label *, rtx_code_label *, |
42 | profile_probability); | |
029b355d | 43 | static void do_jump_by_parts_greater (scalar_int_mode, tree, tree, int, |
720cfc43 | 44 | rtx_code_label *, rtx_code_label *, |
45 | profile_probability); | |
029b355d | 46 | static void do_jump_by_parts_equality (scalar_int_mode, tree, tree, |
47 | rtx_code_label *, rtx_code_label *, | |
48 | profile_probability); | |
f9a00e9e | 49 | static void do_compare_and_jump (tree, tree, enum rtx_code, enum rtx_code, |
720cfc43 | 50 | rtx_code_label *, rtx_code_label *, |
51 | profile_probability); | |
48fefb59 | 52 | |
53 | /* At the start of a function, record that we have no previously-pushed | |
54 | arguments waiting to be popped. */ | |
55 | ||
56 | void | |
8ec3a57b | 57 | init_pending_stack_adjust (void) |
48fefb59 | 58 | { |
59 | pending_stack_adjust = 0; | |
60 | } | |
61 | ||
05ae776c | 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. */ | |
2e2fd8fe | 65 | void |
66 | discard_pending_stack_adjust (void) | |
05ae776c | 67 | { |
68 | stack_pointer_delta -= pending_stack_adjust; | |
69 | pending_stack_adjust = 0; | |
70 | } | |
71 | ||
48fefb59 | 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 | |
8ec3a57b | 79 | clear_pending_stack_adjust (void) |
48fefb59 | 80 | { |
48fefb59 | 81 | if (optimize > 0 |
18d50ae6 | 82 | && (! flag_omit_frame_pointer || cfun->calls_alloca) |
8d8c4c8d | 83 | && EXIT_IGNORE_STACK) |
05ae776c | 84 | discard_pending_stack_adjust (); |
48fefb59 | 85 | } |
86 | ||
87 | /* Pop any previously-pushed arguments that have not been popped yet. */ | |
88 | ||
89 | void | |
8ec3a57b | 90 | do_pending_stack_adjust (void) |
48fefb59 | 91 | { |
92 | if (inhibit_defer_pop == 0) | |
93 | { | |
e0deb08c | 94 | if (maybe_ne (pending_stack_adjust, 0)) |
95 | adjust_stack (gen_int_mode (pending_stack_adjust, Pmode)); | |
48fefb59 | 96 | pending_stack_adjust = 0; |
97 | } | |
98 | } | |
b6d206a2 | 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 | } | |
48fefb59 | 122 | \f |
d9e19419 | 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 | |
f77c4496 | 134 | prefer_and_bit_test (scalar_int_mode mode, int bitnum) |
d9e19419 | 135 | { |
20d892d1 | 136 | bool speed_p; |
796b6678 | 137 | wide_int mask = wi::set_bit_in_zero (bitnum, GET_MODE_PRECISION (mode)); |
20d892d1 | 138 | |
d9e19419 | 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. */ | |
dcd6d0f4 | 143 | and_reg = gen_rtx_REG (mode, LAST_VIRTUAL_REGISTER + 1); |
d9e19419 | 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. */ | |
e913b5cd | 158 | XEXP (and_test, 1) = immed_wide_int_const (mask, mode); |
d9e19419 | 159 | XEXP (XEXP (shift_test, 0), 1) = GEN_INT (bitnum); |
160 | ||
20d892d1 | 161 | speed_p = optimize_insn_for_speed_p (); |
5ae4887d | 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)); | |
d9e19419 | 164 | } |
165 | ||
235978c1 | 166 | /* Subroutine of do_jump, dealing with exploded comparisons of the type |
79ab74cc | 167 | OP0 CODE OP1 . IF_FALSE_LABEL and IF_TRUE_LABEL like in do_jump. |
720cfc43 | 168 | PROB is probability of jump to if_true_label. */ |
235978c1 | 169 | |
2c0b7348 | 170 | static void |
235978c1 | 171 | do_jump_1 (enum tree_code code, tree op0, tree op1, |
f9a00e9e | 172 | rtx_code_label *if_false_label, rtx_code_label *if_true_label, |
720cfc43 | 173 | profile_probability prob) |
235978c1 | 174 | { |
3754d046 | 175 | machine_mode mode; |
79f6a8ed | 176 | rtx_code_label *drop_through_label = 0; |
8b449599 | 177 | scalar_int_mode int_mode; |
235978c1 | 178 | |
179 | switch (code) | |
180 | { | |
181 | case EQ_EXPR: | |
182 | { | |
183 | tree inner_type = TREE_TYPE (op0); | |
184 | ||
185 | gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) | |
186 | != MODE_COMPLEX_FLOAT); | |
187 | gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) | |
188 | != MODE_COMPLEX_INT); | |
189 | ||
190 | if (integer_zerop (op1)) | |
720cfc43 | 191 | do_jump (op0, if_true_label, if_false_label, |
192 | prob.invert ()); | |
8b449599 | 193 | else if (is_int_mode (TYPE_MODE (inner_type), &int_mode) |
194 | && !can_compare_p (EQ, int_mode, ccp_jump)) | |
029b355d | 195 | do_jump_by_parts_equality (int_mode, op0, op1, if_false_label, |
196 | if_true_label, prob); | |
235978c1 | 197 | else |
79ab74cc | 198 | do_compare_and_jump (op0, op1, EQ, EQ, if_false_label, if_true_label, |
199 | prob); | |
235978c1 | 200 | break; |
201 | } | |
202 | ||
203 | case NE_EXPR: | |
204 | { | |
205 | tree inner_type = TREE_TYPE (op0); | |
206 | ||
207 | gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) | |
208 | != MODE_COMPLEX_FLOAT); | |
209 | gcc_assert (GET_MODE_CLASS (TYPE_MODE (inner_type)) | |
210 | != MODE_COMPLEX_INT); | |
211 | ||
212 | if (integer_zerop (op1)) | |
79ab74cc | 213 | do_jump (op0, if_false_label, if_true_label, prob); |
8b449599 | 214 | else if (is_int_mode (TYPE_MODE (inner_type), &int_mode) |
215 | && !can_compare_p (NE, int_mode, ccp_jump)) | |
029b355d | 216 | do_jump_by_parts_equality (int_mode, op0, op1, if_true_label, |
217 | if_false_label, prob.invert ()); | |
235978c1 | 218 | else |
79ab74cc | 219 | do_compare_and_jump (op0, op1, NE, NE, if_false_label, if_true_label, |
220 | prob); | |
235978c1 | 221 | break; |
222 | } | |
223 | ||
224 | case LT_EXPR: | |
225 | mode = TYPE_MODE (TREE_TYPE (op0)); | |
8b449599 | 226 | if (is_int_mode (mode, &int_mode) |
227 | && ! can_compare_p (LT, int_mode, ccp_jump)) | |
029b355d | 228 | do_jump_by_parts_greater (int_mode, op0, op1, 1, if_false_label, |
8b449599 | 229 | if_true_label, prob); |
235978c1 | 230 | else |
79ab74cc | 231 | do_compare_and_jump (op0, op1, LT, LTU, if_false_label, if_true_label, |
232 | prob); | |
235978c1 | 233 | break; |
234 | ||
235 | case LE_EXPR: | |
236 | mode = TYPE_MODE (TREE_TYPE (op0)); | |
8b449599 | 237 | if (is_int_mode (mode, &int_mode) |
238 | && ! can_compare_p (LE, int_mode, ccp_jump)) | |
029b355d | 239 | do_jump_by_parts_greater (int_mode, op0, op1, 0, if_true_label, |
240 | if_false_label, prob.invert ()); | |
235978c1 | 241 | else |
79ab74cc | 242 | do_compare_and_jump (op0, op1, LE, LEU, if_false_label, if_true_label, |
243 | prob); | |
235978c1 | 244 | break; |
245 | ||
246 | case GT_EXPR: | |
247 | mode = TYPE_MODE (TREE_TYPE (op0)); | |
8b449599 | 248 | if (is_int_mode (mode, &int_mode) |
249 | && ! can_compare_p (GT, int_mode, ccp_jump)) | |
029b355d | 250 | do_jump_by_parts_greater (int_mode, op0, op1, 0, if_false_label, |
8b449599 | 251 | if_true_label, prob); |
235978c1 | 252 | else |
79ab74cc | 253 | do_compare_and_jump (op0, op1, GT, GTU, if_false_label, if_true_label, |
254 | prob); | |
235978c1 | 255 | break; |
256 | ||
257 | case GE_EXPR: | |
258 | mode = TYPE_MODE (TREE_TYPE (op0)); | |
8b449599 | 259 | if (is_int_mode (mode, &int_mode) |
260 | && ! can_compare_p (GE, int_mode, ccp_jump)) | |
029b355d | 261 | do_jump_by_parts_greater (int_mode, op0, op1, 1, if_true_label, |
262 | if_false_label, prob.invert ()); | |
235978c1 | 263 | else |
79ab74cc | 264 | do_compare_and_jump (op0, op1, GE, GEU, if_false_label, if_true_label, |
265 | prob); | |
235978c1 | 266 | break; |
267 | ||
268 | case ORDERED_EXPR: | |
269 | do_compare_and_jump (op0, op1, ORDERED, ORDERED, | |
79ab74cc | 270 | if_false_label, if_true_label, prob); |
235978c1 | 271 | break; |
272 | ||
273 | case UNORDERED_EXPR: | |
274 | do_compare_and_jump (op0, op1, UNORDERED, UNORDERED, | |
79ab74cc | 275 | if_false_label, if_true_label, prob); |
235978c1 | 276 | break; |
277 | ||
278 | case UNLT_EXPR: | |
79ab74cc | 279 | do_compare_and_jump (op0, op1, UNLT, UNLT, if_false_label, if_true_label, |
280 | prob); | |
235978c1 | 281 | break; |
282 | ||
283 | case UNLE_EXPR: | |
79ab74cc | 284 | do_compare_and_jump (op0, op1, UNLE, UNLE, if_false_label, if_true_label, |
285 | prob); | |
235978c1 | 286 | break; |
287 | ||
288 | case UNGT_EXPR: | |
79ab74cc | 289 | do_compare_and_jump (op0, op1, UNGT, UNGT, if_false_label, if_true_label, |
290 | prob); | |
235978c1 | 291 | break; |
292 | ||
293 | case UNGE_EXPR: | |
79ab74cc | 294 | do_compare_and_jump (op0, op1, UNGE, UNGE, if_false_label, if_true_label, |
295 | prob); | |
235978c1 | 296 | break; |
297 | ||
298 | case UNEQ_EXPR: | |
79ab74cc | 299 | do_compare_and_jump (op0, op1, UNEQ, UNEQ, if_false_label, if_true_label, |
300 | prob); | |
235978c1 | 301 | break; |
302 | ||
303 | case LTGT_EXPR: | |
79ab74cc | 304 | do_compare_and_jump (op0, op1, LTGT, LTGT, if_false_label, if_true_label, |
305 | prob); | |
235978c1 | 306 | break; |
307 | ||
308 | case TRUTH_ANDIF_EXPR: | |
262da27c | 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). */ | |
720cfc43 | 316 | profile_probability op0_prob = profile_probability::uninitialized (); |
317 | profile_probability op1_prob = profile_probability::uninitialized (); | |
318 | if (prob.initialized_p ()) | |
262da27c | 319 | { |
638bea04 | 320 | op1_prob = prob.invert (); |
321 | op0_prob = op1_prob.split (profile_probability::even ()); | |
262da27c | 322 | /* Get the probability that each jump below is true. */ |
638bea04 | 323 | op0_prob = op0_prob.invert (); |
324 | op1_prob = op1_prob.invert (); | |
262da27c | 325 | } |
f9a00e9e | 326 | if (if_false_label == NULL) |
262da27c | 327 | { |
328 | drop_through_label = gen_label_rtx (); | |
f9a00e9e | 329 | do_jump (op0, drop_through_label, NULL, op0_prob); |
330 | do_jump (op1, NULL, if_true_label, op1_prob); | |
262da27c | 331 | } |
332 | else | |
333 | { | |
f9a00e9e | 334 | do_jump (op0, if_false_label, NULL, op0_prob); |
262da27c | 335 | do_jump (op1, if_false_label, if_true_label, op1_prob); |
336 | } | |
337 | break; | |
338 | } | |
235978c1 | 339 | |
340 | case TRUTH_ORIF_EXPR: | |
262da27c | 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). */ | |
720cfc43 | 347 | profile_probability op0_prob = profile_probability::uninitialized (); |
348 | profile_probability op1_prob = profile_probability::uninitialized (); | |
349 | if (prob.initialized_p ()) | |
262da27c | 350 | { |
638bea04 | 351 | op1_prob = prob; |
352 | op0_prob = op1_prob.split (profile_probability::even ()); | |
f9a00e9e | 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 | } | |
262da27c | 365 | break; |
366 | } | |
235978c1 | 367 | |
368 | default: | |
369 | gcc_unreachable (); | |
370 | } | |
371 | ||
372 | if (drop_through_label) | |
373 | { | |
374 | do_pending_stack_adjust (); | |
375 | emit_label (drop_through_label); | |
376 | } | |
377 | } | |
378 | ||
48fefb59 | 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 | |
79ab74cc | 386 | is when EXP is `(foo (), 0)' and IF_FALSE_LABEL is null. |
387 | ||
720cfc43 | 388 | PROB is probability of jump to if_true_label. */ |
48fefb59 | 389 | |
2c0b7348 | 390 | static void |
f9a00e9e | 391 | do_jump (tree exp, rtx_code_label *if_false_label, |
720cfc43 | 392 | rtx_code_label *if_true_label, profile_probability prob) |
48fefb59 | 393 | { |
394 | enum tree_code code = TREE_CODE (exp); | |
48fefb59 | 395 | rtx temp; |
396 | int i; | |
397 | tree type; | |
f77c4496 | 398 | scalar_int_mode mode; |
f9a00e9e | 399 | rtx_code_label *drop_through_label = NULL; |
48fefb59 | 400 | |
48fefb59 | 401 | switch (code) |
402 | { | |
403 | case ERROR_MARK: | |
404 | break; | |
405 | ||
406 | case INTEGER_CST: | |
f9a00e9e | 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 | } | |
48fefb59 | 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; | |
e3533433 | 430 | /* FALLTHRU */ |
48fefb59 | 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; | |
e3533433 | 437 | /* FALLTHRU */ |
48fefb59 | 438 | case NON_LVALUE_EXPR: |
48fefb59 | 439 | case ABS_EXPR: |
1c67942e | 440 | case ABSU_EXPR: |
48fefb59 | 441 | case NEGATE_EXPR: |
442 | case LROTATE_EXPR: | |
443 | case RROTATE_EXPR: | |
444 | /* These cannot change zero->nonzero or vice versa. */ | |
79ab74cc | 445 | do_jump (TREE_OPERAND (exp, 0), if_false_label, if_true_label, prob); |
48fefb59 | 446 | break; |
447 | ||
48fefb59 | 448 | case TRUTH_NOT_EXPR: |
efa5aca5 | 449 | do_jump (TREE_OPERAND (exp, 0), if_true_label, if_false_label, |
720cfc43 | 450 | prob.invert ()); |
48fefb59 | 451 | break; |
452 | ||
90b35651 | 453 | case COND_EXPR: |
454 | { | |
79f6a8ed | 455 | rtx_code_label *label1 = gen_label_rtx (); |
90b35651 | 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 (); | |
720cfc43 | 466 | do_jump (TREE_OPERAND (exp, 0), label1, NULL, |
467 | profile_probability::uninitialized ()); | |
79ab74cc | 468 | do_jump (TREE_OPERAND (exp, 1), if_false_label, if_true_label, prob); |
90b35651 | 469 | emit_label (label1); |
79ab74cc | 470 | do_jump (TREE_OPERAND (exp, 2), if_false_label, if_true_label, prob); |
90b35651 | 471 | break; |
472 | } | |
473 | ||
48fefb59 | 474 | case COMPOUND_EXPR: |
a1ad7483 | 475 | /* Lowered by gimplify.c. */ |
7bd4f6b6 | 476 | gcc_unreachable (); |
48fefb59 | 477 | |
ff9e4fb2 | 478 | case MINUS_EXPR: |
479 | /* Nonzero iff operands of minus differ. */ | |
235978c1 | 480 | code = NE_EXPR; |
481 | ||
ff9e4fb2 | 482 | /* FALLTHRU */ |
235978c1 | 483 | case EQ_EXPR: |
48fefb59 | 484 | case NE_EXPR: |
48fefb59 | 485 | case LT_EXPR: |
48fefb59 | 486 | case LE_EXPR: |
48fefb59 | 487 | case GT_EXPR: |
48fefb59 | 488 | case GE_EXPR: |
48fefb59 | 489 | case ORDERED_EXPR: |
3fcf767f | 490 | case UNORDERED_EXPR: |
3fcf767f | 491 | case UNLT_EXPR: |
3fcf767f | 492 | case UNLE_EXPR: |
3fcf767f | 493 | case UNGT_EXPR: |
3fcf767f | 494 | case UNGE_EXPR: |
3fcf767f | 495 | case UNEQ_EXPR: |
3fcf767f | 496 | case LTGT_EXPR: |
235978c1 | 497 | case TRUTH_ANDIF_EXPR: |
498 | case TRUTH_ORIF_EXPR: | |
8414b150 | 499 | other_code: |
235978c1 | 500 | do_jump_1 (code, TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1), |
79ab74cc | 501 | if_false_label, if_true_label, prob); |
48fefb59 | 502 | break; |
e31161b3 | 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); | |
f9a00e9e | 511 | rtx_code_label *set_label, *clr_label; |
720cfc43 | 512 | profile_probability setclr_prob = prob; |
e31161b3 | 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; | |
720cfc43 | 528 | setclr_prob = prob.invert (); |
e31161b3 | 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 | |
03b7a719 | 544 | && prefer_and_bit_test (SCALAR_INT_TYPE_MODE (argtype), |
f9ae6f95 | 545 | TREE_INT_CST_LOW (shift))) |
e31161b3 | 546 | { |
7ad40ea1 | 547 | unsigned HOST_WIDE_INT mask |
edc19fd0 | 548 | = HOST_WIDE_INT_1U << TREE_INT_CST_LOW (shift); |
e31161b3 | 549 | do_jump (build2 (BIT_AND_EXPR, argtype, arg, |
c5083e8b | 550 | build_int_cstu (argtype, mask)), |
79ab74cc | 551 | clr_label, set_label, setclr_prob); |
e31161b3 | 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 | |
44504d18 | 568 | && int_mode_for_size (i + 1, 0).exists (&mode) |
e31161b3 | 569 | && (type = lang_hooks.types.type_for_mode (mode, 1)) != 0 |
570 | && TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (exp)) | |
0d79facf | 571 | && have_insn_for (COMPARE, TYPE_MODE (type))) |
e31161b3 | 572 | { |
79ab74cc | 573 | do_jump (fold_convert (type, exp), if_false_label, if_true_label, |
574 | prob); | |
e31161b3 | 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. */ | |
e3533433 | 583 | /* FALLTHRU */ |
48fefb59 | 584 | |
0ff20612 | 585 | case TRUTH_AND_EXPR: |
57bf1c08 | 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. */ | |
4a9d7ef7 | 589 | if (BRANCH_COST (optimize_insn_for_speed_p (), |
590 | false) >= 4 | |
591 | || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1))) | |
0ff20612 | 592 | goto normal; |
8414b150 | 593 | code = TRUTH_ANDIF_EXPR; |
594 | goto other_code; | |
0ff20612 | 595 | |
e31161b3 | 596 | case BIT_IOR_EXPR: |
0ff20612 | 597 | case TRUTH_OR_EXPR: |
57bf1c08 | 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. */ | |
79ab74cc | 601 | if (BRANCH_COST (optimize_insn_for_speed_p (), false) >= 4 |
4a9d7ef7 | 602 | || TREE_SIDE_EFFECTS (TREE_OPERAND (exp, 1))) |
0ff20612 | 603 | goto normal; |
8414b150 | 604 | code = TRUTH_ORIF_EXPR; |
605 | goto other_code; | |
0ff20612 | 606 | |
b4b174c3 | 607 | /* Fall through and generate the normal code. */ |
48fefb59 | 608 | default: |
609 | normal: | |
8ec3c5c2 | 610 | temp = expand_normal (exp); |
48fefb59 | 611 | do_pending_stack_adjust (); |
85afca2d | 612 | /* The RTL optimizers prefer comparisons against pseudos. */ |
613 | if (GET_CODE (temp) == SUBREG) | |
6cd6518b | 614 | { |
85afca2d | 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); | |
6cd6518b | 621 | } |
85afca2d | 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, | |
79ab74cc | 625 | if_false_label, if_true_label, prob); |
48fefb59 | 626 | } |
90b35651 | 627 | |
628 | if (drop_through_label) | |
629 | { | |
630 | do_pending_stack_adjust (); | |
631 | emit_label (drop_through_label); | |
632 | } | |
48fefb59 | 633 | } |
634 | \f | |
48fefb59 | 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 | ||
c071a2df | 639 | static void |
029b355d | 640 | do_jump_by_parts_greater_rtx (scalar_int_mode mode, int unsignedp, rtx op0, |
f9a00e9e | 641 | rtx op1, rtx_code_label *if_false_label, |
642 | rtx_code_label *if_true_label, | |
720cfc43 | 643 | profile_probability prob) |
48fefb59 | 644 | { |
645 | int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD); | |
f9a00e9e | 646 | rtx_code_label *drop_through_label = 0; |
3064d0d2 | 647 | bool drop_through_if_true = false, drop_through_if_false = false; |
648 | enum rtx_code code = GT; | |
48fefb59 | 649 | int i; |
650 | ||
651 | if (! if_true_label || ! if_false_label) | |
652 | drop_through_label = gen_label_rtx (); | |
653 | if (! if_true_label) | |
3064d0d2 | 654 | { |
655 | if_true_label = drop_through_label; | |
656 | drop_through_if_true = true; | |
657 | } | |
48fefb59 | 658 | if (! if_false_label) |
3064d0d2 | 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; | |
720cfc43 | 673 | prob = prob.invert (); |
3064d0d2 | 674 | } |
48fefb59 | 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. */ | |
3064d0d2 | 693 | do_compare_rtx_and_jump (op0_word, op1_word, code, (unsignedp || i > 0), |
f9a00e9e | 694 | word_mode, NULL_RTX, NULL, if_true_label, |
3064d0d2 | 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; | |
48fefb59 | 700 | |
701 | /* Consider lower words only if these are equal. */ | |
702 | do_compare_rtx_and_jump (op0_word, op1_word, NE, unsignedp, word_mode, | |
720cfc43 | 703 | NULL_RTX, NULL, if_false_label, |
704 | prob.invert ()); | |
48fefb59 | 705 | } |
706 | ||
3064d0d2 | 707 | if (!drop_through_if_false) |
48fefb59 | 708 | emit_jump (if_false_label); |
709 | if (drop_through_label) | |
710 | emit_label (drop_through_label); | |
711 | } | |
c071a2df | 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, | |
029b355d | 716 | and LT if SWAP is 1. MODE is the mode of the two operands. */ |
c071a2df | 717 | |
718 | static void | |
029b355d | 719 | do_jump_by_parts_greater (scalar_int_mode mode, tree treeop0, tree treeop1, |
720 | int swap, rtx_code_label *if_false_label, | |
720cfc43 | 721 | rtx_code_label *if_true_label, |
722 | profile_probability prob) | |
c071a2df | 723 | { |
235978c1 | 724 | rtx op0 = expand_normal (swap ? treeop1 : treeop0); |
725 | rtx op1 = expand_normal (swap ? treeop0 : treeop1); | |
235978c1 | 726 | int unsignedp = TYPE_UNSIGNED (TREE_TYPE (treeop0)); |
c071a2df | 727 | |
728 | do_jump_by_parts_greater_rtx (mode, unsignedp, op0, op1, if_false_label, | |
79ab74cc | 729 | if_true_label, prob); |
c071a2df | 730 | } |
48fefb59 | 731 | \f |
85afca2d | 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 | |
f9a00e9e | 734 | Either (but not both) of IF_TRUE_LABEL and IF_FALSE_LABEL may be NULL |
85afca2d | 735 | to indicate drop through. */ |
48fefb59 | 736 | |
85afca2d | 737 | static void |
029b355d | 738 | do_jump_by_parts_zero_rtx (scalar_int_mode mode, rtx op0, |
f9a00e9e | 739 | rtx_code_label *if_false_label, |
720cfc43 | 740 | rtx_code_label *if_true_label, |
741 | profile_probability prob) | |
48fefb59 | 742 | { |
85afca2d | 743 | int nwords = GET_MODE_SIZE (mode) / UNITS_PER_WORD; |
48fefb59 | 744 | rtx part; |
745 | int i; | |
f9a00e9e | 746 | rtx_code_label *drop_through_label = NULL; |
48fefb59 | 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); | |
70b6a6e8 | 754 | emit_move_insn (part, operand_subword_force (op0, 0, mode)); |
48fefb59 | 755 | for (i = 1; i < nwords && part != 0; i++) |
756 | part = expand_binop (word_mode, ior_optab, part, | |
70b6a6e8 | 757 | operand_subword_force (op0, i, mode), |
48fefb59 | 758 | part, 1, OPTAB_WIDEN); |
759 | ||
760 | if (part != 0) | |
761 | { | |
762 | do_compare_rtx_and_jump (part, const0_rtx, EQ, 1, word_mode, | |
79ab74cc | 763 | NULL_RTX, if_false_label, if_true_label, prob); |
48fefb59 | 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) | |
f9a00e9e | 769 | if_false_label = drop_through_label = gen_label_rtx (); |
48fefb59 | 770 | |
771 | for (i = 0; i < nwords; i++) | |
70b6a6e8 | 772 | do_compare_rtx_and_jump (operand_subword_force (op0, i, mode), |
48fefb59 | 773 | const0_rtx, EQ, 1, word_mode, NULL_RTX, |
f9a00e9e | 774 | if_false_label, NULL, prob); |
48fefb59 | 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 | } | |
85afca2d | 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 | |
029b355d | 789 | do_jump_by_parts_equality_rtx (scalar_int_mode mode, rtx op0, rtx op1, |
f9a00e9e | 790 | rtx_code_label *if_false_label, |
720cfc43 | 791 | rtx_code_label *if_true_label, |
792 | profile_probability prob) | |
85afca2d | 793 | { |
794 | int nwords = (GET_MODE_SIZE (mode) / UNITS_PER_WORD); | |
f9a00e9e | 795 | rtx_code_label *drop_through_label = NULL; |
85afca2d | 796 | int i; |
797 | ||
798 | if (op1 == const0_rtx) | |
799 | { | |
79ab74cc | 800 | do_jump_by_parts_zero_rtx (mode, op0, if_false_label, if_true_label, |
801 | prob); | |
85afca2d | 802 | return; |
803 | } | |
804 | else if (op0 == const0_rtx) | |
805 | { | |
79ab74cc | 806 | do_jump_by_parts_zero_rtx (mode, op1, if_false_label, if_true_label, |
807 | prob); | |
85afca2d | 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, | |
f9a00e9e | 818 | if_false_label, NULL, prob); |
85afca2d | 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 | |
029b355d | 827 | with one insn, test the comparison and jump to the appropriate label. |
828 | MODE is the mode of the two operands. */ | |
85afca2d | 829 | |
830 | static void | |
029b355d | 831 | do_jump_by_parts_equality (scalar_int_mode mode, tree treeop0, tree treeop1, |
f9a00e9e | 832 | rtx_code_label *if_false_label, |
720cfc43 | 833 | rtx_code_label *if_true_label, |
834 | profile_probability prob) | |
85afca2d | 835 | { |
235978c1 | 836 | rtx op0 = expand_normal (treeop0); |
837 | rtx op1 = expand_normal (treeop1); | |
85afca2d | 838 | do_jump_by_parts_equality_rtx (mode, op0, op1, if_false_label, |
79ab74cc | 839 | if_true_label, prob); |
85afca2d | 840 | } |
48fefb59 | 841 | \f |
3fcf767f | 842 | /* Split a comparison into two others, the second of which has the other |
843 | "orderedness". The first is always ORDERED or UNORDERED if MODE | |
844 | does not honor NaNs (which means that it can be skipped in that case; | |
845 | see do_compare_rtx_and_jump). | |
846 | ||
847 | The two conditions are written in *CODE1 and *CODE2. Return true if | |
848 | the conditions must be ANDed, false if they must be ORed. */ | |
849 | ||
850 | bool | |
3754d046 | 851 | split_comparison (enum rtx_code code, machine_mode mode, |
3fcf767f | 852 | enum rtx_code *code1, enum rtx_code *code2) |
853 | { | |
854 | switch (code) | |
855 | { | |
856 | case LT: | |
857 | *code1 = ORDERED; | |
858 | *code2 = UNLT; | |
859 | return true; | |
860 | case LE: | |
861 | *code1 = ORDERED; | |
862 | *code2 = UNLE; | |
863 | return true; | |
864 | case GT: | |
865 | *code1 = ORDERED; | |
866 | *code2 = UNGT; | |
867 | return true; | |
868 | case GE: | |
869 | *code1 = ORDERED; | |
870 | *code2 = UNGE; | |
871 | return true; | |
872 | case EQ: | |
873 | *code1 = ORDERED; | |
874 | *code2 = UNEQ; | |
875 | return true; | |
876 | case NE: | |
877 | *code1 = UNORDERED; | |
878 | *code2 = LTGT; | |
879 | return false; | |
880 | case UNLT: | |
881 | *code1 = UNORDERED; | |
882 | *code2 = LT; | |
883 | return false; | |
884 | case UNLE: | |
885 | *code1 = UNORDERED; | |
886 | *code2 = LE; | |
887 | return false; | |
888 | case UNGT: | |
889 | *code1 = UNORDERED; | |
890 | *code2 = GT; | |
891 | return false; | |
892 | case UNGE: | |
893 | *code1 = UNORDERED; | |
894 | *code2 = GE; | |
895 | return false; | |
896 | case UNEQ: | |
897 | *code1 = UNORDERED; | |
898 | *code2 = EQ; | |
899 | return false; | |
900 | case LTGT: | |
901 | /* Do not turn a trapping comparison into a non-trapping one. */ | |
902 | if (HONOR_SNANS (mode)) | |
903 | { | |
904 | *code1 = LT; | |
905 | *code2 = GT; | |
906 | return false; | |
907 | } | |
908 | else | |
909 | { | |
910 | *code1 = ORDERED; | |
911 | *code2 = NE; | |
912 | return true; | |
913 | } | |
914 | default: | |
915 | gcc_unreachable (); | |
916 | } | |
917 | } | |
918 | ||
2c0b7348 | 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 | } | |
3fcf767f | 956 | |
48fefb59 | 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 | |
8ec3a57b | 964 | do_compare_rtx_and_jump (rtx op0, rtx op1, enum rtx_code code, int unsignedp, |
f9a00e9e | 965 | machine_mode mode, rtx size, |
966 | rtx_code_label *if_false_label, | |
720cfc43 | 967 | rtx_code_label *if_true_label, |
968 | profile_probability prob) | |
48fefb59 | 969 | { |
48fefb59 | 970 | rtx tem; |
f9a00e9e | 971 | rtx_code_label *dummy_label = NULL; |
48fefb59 | 972 | |
973 | /* Reverse the comparison if that is safe and we want to jump if it is | |
3fcf767f | 974 | false. Also convert to the reverse comparison if the target can |
975 | implement it. */ | |
976 | if ((! if_true_label | |
977 | || ! can_compare_p (code, mode, ccp_jump)) | |
978 | && (! FLOAT_MODE_P (mode) | |
979 | || code == ORDERED || code == UNORDERED | |
980 | || (! HONOR_NANS (mode) && (code == LTGT || code == UNEQ)) | |
981 | || (! HONOR_SNANS (mode) && (code == EQ || code == NE)))) | |
48fefb59 | 982 | { |
3fcf767f | 983 | enum rtx_code rcode; |
984 | if (FLOAT_MODE_P (mode)) | |
985 | rcode = reverse_condition_maybe_unordered (code); | |
986 | else | |
987 | rcode = reverse_condition (code); | |
988 | ||
989 | /* Canonicalize to UNORDERED for the libcall. */ | |
990 | if (can_compare_p (rcode, mode, ccp_jump) | |
991 | || (code == ORDERED && ! can_compare_p (ORDERED, mode, ccp_jump))) | |
992 | { | |
1d1a557c | 993 | std::swap (if_true_label, if_false_label); |
3fcf767f | 994 | code = rcode; |
720cfc43 | 995 | prob = prob.invert (); |
3fcf767f | 996 | } |
48fefb59 | 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 | { | |
1d1a557c | 1004 | std::swap (op0, op1); |
48fefb59 | 1005 | code = swap_condition (code); |
1006 | } | |
1007 | ||
48fefb59 | 1008 | do_pending_stack_adjust (); |
1009 | ||
ac503e50 | 1010 | code = unsignedp ? unsigned_condition (code) : code; |
c9281ef8 | 1011 | if ((tem = simplify_relational_operation (code, mode, VOIDmode, |
1012 | op0, op1)) != 0) | |
48fefb59 | 1013 | { |
ac503e50 | 1014 | if (CONSTANT_P (tem)) |
1015 | { | |
f9a00e9e | 1016 | rtx_code_label *label = (tem == const0_rtx |
1017 | || tem == CONST0_RTX (mode)) | |
1018 | ? if_false_label : if_true_label; | |
ac503e50 | 1019 | if (label) |
1020 | emit_jump (label); | |
1021 | return; | |
1022 | } | |
48fefb59 | 1023 | |
ac503e50 | 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); | |
48fefb59 | 1029 | } |
48fefb59 | 1030 | |
1031 | if (! if_true_label) | |
3fcf767f | 1032 | dummy_label = if_true_label = gen_label_rtx (); |
48fefb59 | 1033 | |
8b449599 | 1034 | scalar_int_mode int_mode; |
1035 | if (is_int_mode (mode, &int_mode) | |
1036 | && ! can_compare_p (code, int_mode, ccp_jump)) | |
85afca2d | 1037 | { |
1038 | switch (code) | |
1039 | { | |
1040 | case LTU: | |
8b449599 | 1041 | do_jump_by_parts_greater_rtx (int_mode, 1, op1, op0, |
79ab74cc | 1042 | if_false_label, if_true_label, prob); |
85afca2d | 1043 | break; |
1044 | ||
1045 | case LEU: | |
8b449599 | 1046 | do_jump_by_parts_greater_rtx (int_mode, 1, op0, op1, |
79ab74cc | 1047 | if_true_label, if_false_label, |
720cfc43 | 1048 | prob.invert ()); |
85afca2d | 1049 | break; |
1050 | ||
9f596ec0 | 1051 | case GTU: |
8b449599 | 1052 | do_jump_by_parts_greater_rtx (int_mode, 1, op0, op1, |
79ab74cc | 1053 | if_false_label, if_true_label, prob); |
9f596ec0 | 1054 | break; |
1055 | ||
1056 | case GEU: | |
8b449599 | 1057 | do_jump_by_parts_greater_rtx (int_mode, 1, op1, op0, |
79ab74cc | 1058 | if_true_label, if_false_label, |
720cfc43 | 1059 | prob.invert ()); |
9f596ec0 | 1060 | break; |
1061 | ||
85afca2d | 1062 | case LT: |
8b449599 | 1063 | do_jump_by_parts_greater_rtx (int_mode, 0, op1, op0, |
79ab74cc | 1064 | if_false_label, if_true_label, prob); |
85afca2d | 1065 | break; |
1066 | ||
2244ee93 | 1067 | case LE: |
8b449599 | 1068 | do_jump_by_parts_greater_rtx (int_mode, 0, op0, op1, |
79ab74cc | 1069 | if_true_label, if_false_label, |
720cfc43 | 1070 | prob.invert ()); |
2244ee93 | 1071 | break; |
1072 | ||
85afca2d | 1073 | case GT: |
8b449599 | 1074 | do_jump_by_parts_greater_rtx (int_mode, 0, op0, op1, |
79ab74cc | 1075 | if_false_label, if_true_label, prob); |
85afca2d | 1076 | break; |
1077 | ||
1078 | case GE: | |
8b449599 | 1079 | do_jump_by_parts_greater_rtx (int_mode, 0, op1, op0, |
79ab74cc | 1080 | if_true_label, if_false_label, |
720cfc43 | 1081 | prob.invert ()); |
85afca2d | 1082 | break; |
1083 | ||
1084 | case EQ: | |
8b449599 | 1085 | do_jump_by_parts_equality_rtx (int_mode, op0, op1, if_false_label, |
79ab74cc | 1086 | if_true_label, prob); |
85afca2d | 1087 | break; |
1088 | ||
1089 | case NE: | |
8b449599 | 1090 | do_jump_by_parts_equality_rtx (int_mode, op0, op1, if_true_label, |
720cfc43 | 1091 | if_false_label, |
1092 | prob.invert ()); | |
85afca2d | 1093 | break; |
1094 | ||
1095 | default: | |
1096 | gcc_unreachable (); | |
1097 | } | |
1098 | } | |
1099 | else | |
3fcf767f | 1100 | { |
670fc240 | 1101 | if (SCALAR_FLOAT_MODE_P (mode) |
3fcf767f | 1102 | && ! can_compare_p (code, mode, ccp_jump) |
fb425e71 | 1103 | && can_compare_p (swap_condition (code), mode, ccp_jump)) |
1104 | { | |
fb425e71 | 1105 | code = swap_condition (code); |
dfcf26a5 | 1106 | std::swap (op0, op1); |
fb425e71 | 1107 | } |
670fc240 | 1108 | else if (SCALAR_FLOAT_MODE_P (mode) |
fb425e71 | 1109 | && ! can_compare_p (code, mode, ccp_jump) |
6cdd383a | 1110 | /* Never split ORDERED and UNORDERED. |
1111 | These must be implemented. */ | |
fb425e71 | 1112 | && (code != ORDERED && code != UNORDERED) |
6cdd383a | 1113 | /* Split a floating-point comparison if |
1114 | we can jump on other conditions... */ | |
fb425e71 | 1115 | && (have_insn_for (COMPARE, mode) |
fb425e71 | 1116 | /* ... or if there is no libcall for it. */ |
ebb6e3c1 | 1117 | || code_to_optab (code) == unknown_optab)) |
3fcf767f | 1118 | { |
1119 | enum rtx_code first_code; | |
1120 | bool and_them = split_comparison (code, mode, &first_code, &code); | |
1121 | ||
1122 | /* If there are no NaNs, the first comparison should always fall | |
1123 | through. */ | |
1124 | if (!HONOR_NANS (mode)) | |
1125 | gcc_assert (first_code == (and_them ? ORDERED : UNORDERED)); | |
1126 | ||
1127 | else | |
1128 | { | |
638bea04 | 1129 | profile_probability cprob |
1130 | = profile_probability::guessed_always (); | |
bb0803fb | 1131 | if (first_code == UNORDERED) |
638bea04 | 1132 | cprob = cprob.apply_scale (1, 100); |
bb0803fb | 1133 | else if (first_code == ORDERED) |
638bea04 | 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. */ | |
3fcf767f | 1144 | if (and_them) |
1145 | { | |
f9a00e9e | 1146 | rtx_code_label *dest_label; |
638bea04 | 1147 | prob = prob.invert (); |
1148 | profile_probability first_prob = prob.split (cprob).invert (); | |
1149 | prob = prob.invert (); | |
3fcf767f | 1150 | /* If we only jump if true, just bypass the second jump. */ |
1151 | if (! if_false_label) | |
1152 | { | |
1153 | if (! dummy_label) | |
1154 | dummy_label = gen_label_rtx (); | |
1155 | dest_label = dummy_label; | |
1156 | } | |
1157 | else | |
1158 | dest_label = if_false_label; | |
1159 | do_compare_rtx_and_jump (op0, op1, first_code, unsignedp, mode, | |
f9a00e9e | 1160 | size, dest_label, NULL, first_prob); |
3fcf767f | 1161 | } |
1162 | else | |
638bea04 | 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 | } | |
3fcf767f | 1168 | } |
1169 | } | |
1170 | ||
1171 | emit_cmp_and_jump_insns (op0, op1, code, size, mode, unsignedp, | |
584abc98 | 1172 | if_true_label, prob); |
3fcf767f | 1173 | } |
48fefb59 | 1174 | |
1175 | if (if_false_label) | |
1176 | emit_jump (if_false_label); | |
3fcf767f | 1177 | if (dummy_label) |
1178 | emit_label (dummy_label); | |
48fefb59 | 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 | |
235978c1 | 1192 | do_compare_and_jump (tree treeop0, tree treeop1, enum rtx_code signed_code, |
f9a00e9e | 1193 | enum rtx_code unsigned_code, |
1194 | rtx_code_label *if_false_label, | |
720cfc43 | 1195 | rtx_code_label *if_true_label, profile_probability prob) |
48fefb59 | 1196 | { |
1197 | rtx op0, op1; | |
1198 | tree type; | |
3754d046 | 1199 | machine_mode mode; |
48fefb59 | 1200 | int unsignedp; |
1201 | enum rtx_code code; | |
1202 | ||
1203 | /* Don't crash if the comparison was erroneous. */ | |
235978c1 | 1204 | op0 = expand_normal (treeop0); |
1205 | if (TREE_CODE (treeop0) == ERROR_MARK) | |
48fefb59 | 1206 | return; |
1207 | ||
235978c1 | 1208 | op1 = expand_normal (treeop1); |
1209 | if (TREE_CODE (treeop1) == ERROR_MARK) | |
48fefb59 | 1210 | return; |
1211 | ||
235978c1 | 1212 | type = TREE_TYPE (treeop0); |
235978c1 | 1213 | if (TREE_CODE (treeop0) == INTEGER_CST |
1214 | && (TREE_CODE (treeop1) != INTEGER_CST | |
03b7a719 | 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); | |
78a8ed03 | 1221 | unsignedp = TYPE_UNSIGNED (type); |
48fefb59 | 1222 | code = unsignedp ? unsigned_code : signed_code; |
1223 | ||
48fefb59 | 1224 | /* If function pointers need to be "canonicalized" before they can |
20530c6b | 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. */ | |
a84cae90 | 1229 | if (targetm.have_canonicalize_funcptr_for_compare () |
20530c6b | 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)))))) | |
48fefb59 | 1234 | { |
1235 | rtx new_op0 = gen_reg_rtx (mode); | |
dce9431b | 1236 | rtx new_op1 = gen_reg_rtx (mode); |
48fefb59 | 1237 | |
a84cae90 | 1238 | emit_insn (targetm.gen_canonicalize_funcptr_for_compare (new_op0, op0)); |
48fefb59 | 1239 | op0 = new_op0; |
48fefb59 | 1240 | |
a84cae90 | 1241 | emit_insn (targetm.gen_canonicalize_funcptr_for_compare (new_op1, op1)); |
48fefb59 | 1242 | op1 = new_op1; |
1243 | } | |
48fefb59 | 1244 | |
48fefb59 | 1245 | do_compare_rtx_and_jump (op0, op1, code, unsignedp, mode, |
1246 | ((mode == BLKmode) | |
235978c1 | 1247 | ? expr_size (treeop0) : NULL_RTX), |
79ab74cc | 1248 | if_false_label, if_true_label, prob); |
48fefb59 | 1249 | } |
d9e19419 | 1250 | |
1251 | #include "gt-dojump.h" |