1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /*@@ This file should be rewritten to use an arbitrary precision
23 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
24 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
25 @@ The routines that translate from the ap rep should
26 @@ warn if precision et. al. is lost.
27 @@ This would also make life easier when this technology is used
28 @@ for cross-compilers. */
30 /* The entry points in this file are fold, size_int_wide, size_binop
33 fold takes a tree as argument and returns a simplified tree.
35 size_binop takes a tree code for an arithmetic operation
36 and two operands that are trees, and produces a tree for the
37 result, assuming the type comes from `sizetype'.
39 size_int takes an integer value, and creates a tree constant
40 with type from `sizetype'.
42 force_fit_type takes a constant, an overflowable flag and prior
43 overflow indicators. It forces the value to fit the type and sets
44 TREE_OVERFLOW and TREE_CONSTANT_OVERFLOW as appropriate. */
48 #include "coretypes.h"
59 #include "langhooks.h"
62 /* The following constants represent a bit based encoding of GCC's
63 comparison operators. This encoding simplifies transformations
64 on relational comparison operators, such as AND and OR. */
65 enum comparison_code {
84 static void encode (HOST_WIDE_INT *, unsigned HOST_WIDE_INT, HOST_WIDE_INT);
85 static void decode (HOST_WIDE_INT *, unsigned HOST_WIDE_INT *, HOST_WIDE_INT *);
86 static bool negate_mathfn_p (enum built_in_function);
87 static bool negate_expr_p (tree);
88 static tree negate_expr (tree);
89 static tree split_tree (tree, enum tree_code, tree *, tree *, tree *, int);
90 static tree associate_trees (tree, tree, enum tree_code, tree);
91 static tree const_binop (enum tree_code, tree, tree, int);
92 static enum tree_code invert_tree_comparison (enum tree_code, bool);
93 static enum comparison_code comparison_to_compcode (enum tree_code);
94 static enum tree_code compcode_to_comparison (enum comparison_code);
95 static tree combine_comparisons (enum tree_code, enum tree_code,
96 enum tree_code, tree, tree, tree);
97 static int truth_value_p (enum tree_code);
98 static int operand_equal_for_comparison_p (tree, tree, tree);
99 static int twoval_comparison_p (tree, tree *, tree *, int *);
100 static tree eval_subst (tree, tree, tree, tree, tree);
101 static tree pedantic_omit_one_operand (tree, tree, tree);
102 static tree distribute_bit_expr (enum tree_code, tree, tree, tree);
103 static tree make_bit_field_ref (tree, tree, int, int, int);
104 static tree optimize_bit_field_compare (enum tree_code, tree, tree, tree);
105 static tree decode_field_reference (tree, HOST_WIDE_INT *, HOST_WIDE_INT *,
106 enum machine_mode *, int *, int *,
108 static int all_ones_mask_p (tree, int);
109 static tree sign_bit_p (tree, tree);
110 static int simple_operand_p (tree);
111 static tree range_binop (enum tree_code, tree, tree, int, tree, int);
112 static tree make_range (tree, int *, tree *, tree *);
113 static tree build_range_check (tree, tree, int, tree, tree);
114 static int merge_ranges (int *, tree *, tree *, int, tree, tree, int, tree,
116 static tree fold_range_test (enum tree_code, tree, tree, tree);
117 static tree fold_cond_expr_with_comparison (tree, tree, tree, tree);
118 static tree unextend (tree, int, int, tree);
119 static tree fold_truthop (enum tree_code, tree, tree, tree);
120 static tree optimize_minmax_comparison (enum tree_code, tree, tree, tree);
121 static tree extract_muldiv (tree, tree, enum tree_code, tree);
122 static tree extract_muldiv_1 (tree, tree, enum tree_code, tree);
123 static int multiple_of_p (tree, tree, tree);
124 static tree fold_binary_op_with_conditional_arg (enum tree_code, tree,
127 static bool fold_real_zero_addition_p (tree, tree, int);
128 static tree fold_mathfn_compare (enum built_in_function, enum tree_code,
130 static tree fold_inf_compare (enum tree_code, tree, tree, tree);
131 static tree fold_div_compare (enum tree_code, tree, tree, tree);
132 static bool reorder_operands_p (tree, tree);
133 static tree fold_negate_const (tree, tree);
134 static tree fold_not_const (tree, tree);
135 static tree fold_relational_const (enum tree_code, tree, tree, tree);
136 static tree fold_relational_hi_lo (enum tree_code *, const tree,
138 static bool tree_expr_nonzero_p (tree);
140 /* We know that A1 + B1 = SUM1, using 2's complement arithmetic and ignoring
141 overflow. Suppose A, B and SUM have the same respective signs as A1, B1,
142 and SUM1. Then this yields nonzero if overflow occurred during the
145 Overflow occurs if A and B have the same sign, but A and SUM differ in
146 sign. Use `^' to test whether signs differ, and `< 0' to isolate the
148 #define OVERFLOW_SUM_SIGN(a, b, sum) ((~((a) ^ (b)) & ((a) ^ (sum))) < 0)
150 /* To do constant folding on INTEGER_CST nodes requires two-word arithmetic.
151 We do that by representing the two-word integer in 4 words, with only
152 HOST_BITS_PER_WIDE_INT / 2 bits stored in each word, as a positive
153 number. The value of the word is LOWPART + HIGHPART * BASE. */
156 ((x) & (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) - 1))
157 #define HIGHPART(x) \
158 ((unsigned HOST_WIDE_INT) (x) >> HOST_BITS_PER_WIDE_INT / 2)
159 #define BASE ((unsigned HOST_WIDE_INT) 1 << HOST_BITS_PER_WIDE_INT / 2)
161 /* Unpack a two-word integer into 4 words.
162 LOW and HI are the integer, as two `HOST_WIDE_INT' pieces.
163 WORDS points to the array of HOST_WIDE_INTs. */
166 encode (HOST_WIDE_INT *words, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
168 words[0] = LOWPART (low);
169 words[1] = HIGHPART (low);
170 words[2] = LOWPART (hi);
171 words[3] = HIGHPART (hi);
174 /* Pack an array of 4 words into a two-word integer.
175 WORDS points to the array of words.
176 The integer is stored into *LOW and *HI as two `HOST_WIDE_INT' pieces. */
179 decode (HOST_WIDE_INT *words, unsigned HOST_WIDE_INT *low,
182 *low = words[0] + words[1] * BASE;
183 *hi = words[2] + words[3] * BASE;
186 /* T is an INT_CST node. OVERFLOWABLE indicates if we are interested
187 in overflow of the value, when >0 we are only interested in signed
188 overflow, for <0 we are interested in any overflow. OVERFLOWED
189 indicates whether overflow has already occurred. CONST_OVERFLOWED
190 indicates whether constant overflow has already occurred. We force
191 T's value to be within range of T's type (by setting to 0 or 1 all
192 the bits outside the type's range). We set TREE_OVERFLOWED if,
193 OVERFLOWED is nonzero,
194 or OVERFLOWABLE is >0 and signed overflow occurs
195 or OVERFLOWABLE is <0 and any overflow occurs
196 We set TREE_CONSTANT_OVERFLOWED if,
197 CONST_OVERFLOWED is nonzero
198 or we set TREE_OVERFLOWED.
199 We return either the original T, or a copy. */
202 force_fit_type (tree t, int overflowable,
203 bool overflowed, bool overflowed_const)
205 unsigned HOST_WIDE_INT low;
208 int sign_extended_type;
210 gcc_assert (TREE_CODE (t) == INTEGER_CST);
212 low = TREE_INT_CST_LOW (t);
213 high = TREE_INT_CST_HIGH (t);
215 if (POINTER_TYPE_P (TREE_TYPE (t))
216 || TREE_CODE (TREE_TYPE (t)) == OFFSET_TYPE)
219 prec = TYPE_PRECISION (TREE_TYPE (t));
220 /* Size types *are* sign extended. */
221 sign_extended_type = (!TYPE_UNSIGNED (TREE_TYPE (t))
222 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
223 && TYPE_IS_SIZETYPE (TREE_TYPE (t))));
225 /* First clear all bits that are beyond the type's precision. */
227 if (prec >= 2 * HOST_BITS_PER_WIDE_INT)
229 else if (prec > HOST_BITS_PER_WIDE_INT)
230 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
234 if (prec < HOST_BITS_PER_WIDE_INT)
235 low &= ~((HOST_WIDE_INT) (-1) << prec);
238 if (!sign_extended_type)
239 /* No sign extension */;
240 else if (prec >= 2 * HOST_BITS_PER_WIDE_INT)
241 /* Correct width already. */;
242 else if (prec > HOST_BITS_PER_WIDE_INT)
244 /* Sign extend top half? */
245 if (high & ((unsigned HOST_WIDE_INT)1
246 << (prec - HOST_BITS_PER_WIDE_INT - 1)))
247 high |= (HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT);
249 else if (prec == HOST_BITS_PER_WIDE_INT)
251 if ((HOST_WIDE_INT)low < 0)
256 /* Sign extend bottom half? */
257 if (low & ((unsigned HOST_WIDE_INT)1 << (prec - 1)))
260 low |= (HOST_WIDE_INT)(-1) << prec;
264 /* If the value changed, return a new node. */
265 if (overflowed || overflowed_const
266 || low != TREE_INT_CST_LOW (t) || high != TREE_INT_CST_HIGH (t))
268 t = build_int_cst_wide (TREE_TYPE (t), low, high);
272 || (overflowable > 0 && sign_extended_type))
275 TREE_OVERFLOW (t) = 1;
276 TREE_CONSTANT_OVERFLOW (t) = 1;
278 else if (overflowed_const)
281 TREE_CONSTANT_OVERFLOW (t) = 1;
288 /* Add two doubleword integers with doubleword result.
289 Each argument is given as two `HOST_WIDE_INT' pieces.
290 One argument is L1 and H1; the other, L2 and H2.
291 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
294 add_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
295 unsigned HOST_WIDE_INT l2, HOST_WIDE_INT h2,
296 unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
298 unsigned HOST_WIDE_INT l;
302 h = h1 + h2 + (l < l1);
306 return OVERFLOW_SUM_SIGN (h1, h2, h);
309 /* Negate a doubleword integer with doubleword result.
310 Return nonzero if the operation overflows, assuming it's signed.
311 The argument is given as two `HOST_WIDE_INT' pieces in L1 and H1.
312 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
315 neg_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
316 unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
322 return (*hv & h1) < 0;
332 /* Multiply two doubleword integers with doubleword result.
333 Return nonzero if the operation overflows, assuming it's signed.
334 Each argument is given as two `HOST_WIDE_INT' pieces.
335 One argument is L1 and H1; the other, L2 and H2.
336 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
339 mul_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
340 unsigned HOST_WIDE_INT l2, HOST_WIDE_INT h2,
341 unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
343 HOST_WIDE_INT arg1[4];
344 HOST_WIDE_INT arg2[4];
345 HOST_WIDE_INT prod[4 * 2];
346 unsigned HOST_WIDE_INT carry;
348 unsigned HOST_WIDE_INT toplow, neglow;
349 HOST_WIDE_INT tophigh, neghigh;
351 encode (arg1, l1, h1);
352 encode (arg2, l2, h2);
354 memset (prod, 0, sizeof prod);
356 for (i = 0; i < 4; i++)
359 for (j = 0; j < 4; j++)
362 /* This product is <= 0xFFFE0001, the sum <= 0xFFFF0000. */
363 carry += arg1[i] * arg2[j];
364 /* Since prod[p] < 0xFFFF, this sum <= 0xFFFFFFFF. */
366 prod[k] = LOWPART (carry);
367 carry = HIGHPART (carry);
372 decode (prod, lv, hv); /* This ignores prod[4] through prod[4*2-1] */
374 /* Check for overflow by calculating the top half of the answer in full;
375 it should agree with the low half's sign bit. */
376 decode (prod + 4, &toplow, &tophigh);
379 neg_double (l2, h2, &neglow, &neghigh);
380 add_double (neglow, neghigh, toplow, tophigh, &toplow, &tophigh);
384 neg_double (l1, h1, &neglow, &neghigh);
385 add_double (neglow, neghigh, toplow, tophigh, &toplow, &tophigh);
387 return (*hv < 0 ? ~(toplow & tophigh) : toplow | tophigh) != 0;
390 /* Shift the doubleword integer in L1, H1 left by COUNT places
391 keeping only PREC bits of result.
392 Shift right if COUNT is negative.
393 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
394 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
397 lshift_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
398 HOST_WIDE_INT count, unsigned int prec,
399 unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv, int arith)
401 unsigned HOST_WIDE_INT signmask;
405 rshift_double (l1, h1, -count, prec, lv, hv, arith);
409 if (SHIFT_COUNT_TRUNCATED)
412 if (count >= 2 * HOST_BITS_PER_WIDE_INT)
414 /* Shifting by the host word size is undefined according to the
415 ANSI standard, so we must handle this as a special case. */
419 else if (count >= HOST_BITS_PER_WIDE_INT)
421 *hv = l1 << (count - HOST_BITS_PER_WIDE_INT);
426 *hv = (((unsigned HOST_WIDE_INT) h1 << count)
427 | (l1 >> (HOST_BITS_PER_WIDE_INT - count - 1) >> 1));
431 /* Sign extend all bits that are beyond the precision. */
433 signmask = -((prec > HOST_BITS_PER_WIDE_INT
434 ? ((unsigned HOST_WIDE_INT) *hv
435 >> (prec - HOST_BITS_PER_WIDE_INT - 1))
436 : (*lv >> (prec - 1))) & 1);
438 if (prec >= 2 * HOST_BITS_PER_WIDE_INT)
440 else if (prec >= HOST_BITS_PER_WIDE_INT)
442 *hv &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
443 *hv |= signmask << (prec - HOST_BITS_PER_WIDE_INT);
448 *lv &= ~((unsigned HOST_WIDE_INT) (-1) << prec);
449 *lv |= signmask << prec;
453 /* Shift the doubleword integer in L1, H1 right by COUNT places
454 keeping only PREC bits of result. COUNT must be positive.
455 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
456 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
459 rshift_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
460 HOST_WIDE_INT count, unsigned int prec,
461 unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv,
464 unsigned HOST_WIDE_INT signmask;
467 ? -((unsigned HOST_WIDE_INT) h1 >> (HOST_BITS_PER_WIDE_INT - 1))
470 if (SHIFT_COUNT_TRUNCATED)
473 if (count >= 2 * HOST_BITS_PER_WIDE_INT)
475 /* Shifting by the host word size is undefined according to the
476 ANSI standard, so we must handle this as a special case. */
480 else if (count >= HOST_BITS_PER_WIDE_INT)
483 *lv = (unsigned HOST_WIDE_INT) h1 >> (count - HOST_BITS_PER_WIDE_INT);
487 *hv = (unsigned HOST_WIDE_INT) h1 >> count;
489 | ((unsigned HOST_WIDE_INT) h1 << (HOST_BITS_PER_WIDE_INT - count - 1) << 1));
492 /* Zero / sign extend all bits that are beyond the precision. */
494 if (count >= (HOST_WIDE_INT)prec)
499 else if ((prec - count) >= 2 * HOST_BITS_PER_WIDE_INT)
501 else if ((prec - count) >= HOST_BITS_PER_WIDE_INT)
503 *hv &= ~((HOST_WIDE_INT) (-1) << (prec - count - HOST_BITS_PER_WIDE_INT));
504 *hv |= signmask << (prec - count - HOST_BITS_PER_WIDE_INT);
509 *lv &= ~((unsigned HOST_WIDE_INT) (-1) << (prec - count));
510 *lv |= signmask << (prec - count);
514 /* Rotate the doubleword integer in L1, H1 left by COUNT places
515 keeping only PREC bits of result.
516 Rotate right if COUNT is negative.
517 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
520 lrotate_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
521 HOST_WIDE_INT count, unsigned int prec,
522 unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
524 unsigned HOST_WIDE_INT s1l, s2l;
525 HOST_WIDE_INT s1h, s2h;
531 lshift_double (l1, h1, count, prec, &s1l, &s1h, 0);
532 rshift_double (l1, h1, prec - count, prec, &s2l, &s2h, 0);
537 /* Rotate the doubleword integer in L1, H1 left by COUNT places
538 keeping only PREC bits of result. COUNT must be positive.
539 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
542 rrotate_double (unsigned HOST_WIDE_INT l1, HOST_WIDE_INT h1,
543 HOST_WIDE_INT count, unsigned int prec,
544 unsigned HOST_WIDE_INT *lv, HOST_WIDE_INT *hv)
546 unsigned HOST_WIDE_INT s1l, s2l;
547 HOST_WIDE_INT s1h, s2h;
553 rshift_double (l1, h1, count, prec, &s1l, &s1h, 0);
554 lshift_double (l1, h1, prec - count, prec, &s2l, &s2h, 0);
559 /* Divide doubleword integer LNUM, HNUM by doubleword integer LDEN, HDEN
560 for a quotient (stored in *LQUO, *HQUO) and remainder (in *LREM, *HREM).
561 CODE is a tree code for a kind of division, one of
562 TRUNC_DIV_EXPR, FLOOR_DIV_EXPR, CEIL_DIV_EXPR, ROUND_DIV_EXPR
564 It controls how the quotient is rounded to an integer.
565 Return nonzero if the operation overflows.
566 UNS nonzero says do unsigned division. */
569 div_and_round_double (enum tree_code code, int uns,
570 unsigned HOST_WIDE_INT lnum_orig, /* num == numerator == dividend */
571 HOST_WIDE_INT hnum_orig,
572 unsigned HOST_WIDE_INT lden_orig, /* den == denominator == divisor */
573 HOST_WIDE_INT hden_orig,
574 unsigned HOST_WIDE_INT *lquo,
575 HOST_WIDE_INT *hquo, unsigned HOST_WIDE_INT *lrem,
579 HOST_WIDE_INT num[4 + 1]; /* extra element for scaling. */
580 HOST_WIDE_INT den[4], quo[4];
582 unsigned HOST_WIDE_INT work;
583 unsigned HOST_WIDE_INT carry = 0;
584 unsigned HOST_WIDE_INT lnum = lnum_orig;
585 HOST_WIDE_INT hnum = hnum_orig;
586 unsigned HOST_WIDE_INT lden = lden_orig;
587 HOST_WIDE_INT hden = hden_orig;
590 if (hden == 0 && lden == 0)
591 overflow = 1, lden = 1;
593 /* Calculate quotient sign and convert operands to unsigned. */
599 /* (minimum integer) / (-1) is the only overflow case. */
600 if (neg_double (lnum, hnum, &lnum, &hnum)
601 && ((HOST_WIDE_INT) lden & hden) == -1)
607 neg_double (lden, hden, &lden, &hden);
611 if (hnum == 0 && hden == 0)
612 { /* single precision */
614 /* This unsigned division rounds toward zero. */
620 { /* trivial case: dividend < divisor */
621 /* hden != 0 already checked. */
628 memset (quo, 0, sizeof quo);
630 memset (num, 0, sizeof num); /* to zero 9th element */
631 memset (den, 0, sizeof den);
633 encode (num, lnum, hnum);
634 encode (den, lden, hden);
636 /* Special code for when the divisor < BASE. */
637 if (hden == 0 && lden < (unsigned HOST_WIDE_INT) BASE)
639 /* hnum != 0 already checked. */
640 for (i = 4 - 1; i >= 0; i--)
642 work = num[i] + carry * BASE;
643 quo[i] = work / lden;
649 /* Full double precision division,
650 with thanks to Don Knuth's "Seminumerical Algorithms". */
651 int num_hi_sig, den_hi_sig;
652 unsigned HOST_WIDE_INT quo_est, scale;
654 /* Find the highest nonzero divisor digit. */
655 for (i = 4 - 1;; i--)
662 /* Insure that the first digit of the divisor is at least BASE/2.
663 This is required by the quotient digit estimation algorithm. */
665 scale = BASE / (den[den_hi_sig] + 1);
667 { /* scale divisor and dividend */
669 for (i = 0; i <= 4 - 1; i++)
671 work = (num[i] * scale) + carry;
672 num[i] = LOWPART (work);
673 carry = HIGHPART (work);
678 for (i = 0; i <= 4 - 1; i++)
680 work = (den[i] * scale) + carry;
681 den[i] = LOWPART (work);
682 carry = HIGHPART (work);
683 if (den[i] != 0) den_hi_sig = i;
690 for (i = num_hi_sig - den_hi_sig - 1; i >= 0; i--)
692 /* Guess the next quotient digit, quo_est, by dividing the first
693 two remaining dividend digits by the high order quotient digit.
694 quo_est is never low and is at most 2 high. */
695 unsigned HOST_WIDE_INT tmp;
697 num_hi_sig = i + den_hi_sig + 1;
698 work = num[num_hi_sig] * BASE + num[num_hi_sig - 1];
699 if (num[num_hi_sig] != den[den_hi_sig])
700 quo_est = work / den[den_hi_sig];
704 /* Refine quo_est so it's usually correct, and at most one high. */
705 tmp = work - quo_est * den[den_hi_sig];
707 && (den[den_hi_sig - 1] * quo_est
708 > (tmp * BASE + num[num_hi_sig - 2])))
711 /* Try QUO_EST as the quotient digit, by multiplying the
712 divisor by QUO_EST and subtracting from the remaining dividend.
713 Keep in mind that QUO_EST is the I - 1st digit. */
716 for (j = 0; j <= den_hi_sig; j++)
718 work = quo_est * den[j] + carry;
719 carry = HIGHPART (work);
720 work = num[i + j] - LOWPART (work);
721 num[i + j] = LOWPART (work);
722 carry += HIGHPART (work) != 0;
725 /* If quo_est was high by one, then num[i] went negative and
726 we need to correct things. */
727 if (num[num_hi_sig] < (HOST_WIDE_INT) carry)
730 carry = 0; /* add divisor back in */
731 for (j = 0; j <= den_hi_sig; j++)
733 work = num[i + j] + den[j] + carry;
734 carry = HIGHPART (work);
735 num[i + j] = LOWPART (work);
738 num [num_hi_sig] += carry;
741 /* Store the quotient digit. */
746 decode (quo, lquo, hquo);
749 /* If result is negative, make it so. */
751 neg_double (*lquo, *hquo, lquo, hquo);
753 /* Compute trial remainder: rem = num - (quo * den) */
754 mul_double (*lquo, *hquo, lden_orig, hden_orig, lrem, hrem);
755 neg_double (*lrem, *hrem, lrem, hrem);
756 add_double (lnum_orig, hnum_orig, *lrem, *hrem, lrem, hrem);
761 case TRUNC_MOD_EXPR: /* round toward zero */
762 case EXACT_DIV_EXPR: /* for this one, it shouldn't matter */
766 case FLOOR_MOD_EXPR: /* round toward negative infinity */
767 if (quo_neg && (*lrem != 0 || *hrem != 0)) /* ratio < 0 && rem != 0 */
770 add_double (*lquo, *hquo, (HOST_WIDE_INT) -1, (HOST_WIDE_INT) -1,
778 case CEIL_MOD_EXPR: /* round toward positive infinity */
779 if (!quo_neg && (*lrem != 0 || *hrem != 0)) /* ratio > 0 && rem != 0 */
781 add_double (*lquo, *hquo, (HOST_WIDE_INT) 1, (HOST_WIDE_INT) 0,
789 case ROUND_MOD_EXPR: /* round to closest integer */
791 unsigned HOST_WIDE_INT labs_rem = *lrem;
792 HOST_WIDE_INT habs_rem = *hrem;
793 unsigned HOST_WIDE_INT labs_den = lden, ltwice;
794 HOST_WIDE_INT habs_den = hden, htwice;
796 /* Get absolute values. */
798 neg_double (*lrem, *hrem, &labs_rem, &habs_rem);
800 neg_double (lden, hden, &labs_den, &habs_den);
802 /* If (2 * abs (lrem) >= abs (lden)) */
803 mul_double ((HOST_WIDE_INT) 2, (HOST_WIDE_INT) 0,
804 labs_rem, habs_rem, <wice, &htwice);
806 if (((unsigned HOST_WIDE_INT) habs_den
807 < (unsigned HOST_WIDE_INT) htwice)
808 || (((unsigned HOST_WIDE_INT) habs_den
809 == (unsigned HOST_WIDE_INT) htwice)
810 && (labs_den < ltwice)))
814 add_double (*lquo, *hquo,
815 (HOST_WIDE_INT) -1, (HOST_WIDE_INT) -1, lquo, hquo);
818 add_double (*lquo, *hquo, (HOST_WIDE_INT) 1, (HOST_WIDE_INT) 0,
830 /* Compute true remainder: rem = num - (quo * den) */
831 mul_double (*lquo, *hquo, lden_orig, hden_orig, lrem, hrem);
832 neg_double (*lrem, *hrem, lrem, hrem);
833 add_double (lnum_orig, hnum_orig, *lrem, *hrem, lrem, hrem);
837 /* Return true if built-in mathematical function specified by CODE
838 preserves the sign of it argument, i.e. -f(x) == f(-x). */
841 negate_mathfn_p (enum built_in_function code)
865 /* Check whether we may negate an integer constant T without causing
869 may_negate_without_overflow_p (tree t)
871 unsigned HOST_WIDE_INT val;
875 gcc_assert (TREE_CODE (t) == INTEGER_CST);
877 type = TREE_TYPE (t);
878 if (TYPE_UNSIGNED (type))
881 prec = TYPE_PRECISION (type);
882 if (prec > HOST_BITS_PER_WIDE_INT)
884 if (TREE_INT_CST_LOW (t) != 0)
886 prec -= HOST_BITS_PER_WIDE_INT;
887 val = TREE_INT_CST_HIGH (t);
890 val = TREE_INT_CST_LOW (t);
891 if (prec < HOST_BITS_PER_WIDE_INT)
892 val &= ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
893 return val != ((unsigned HOST_WIDE_INT) 1 << (prec - 1));
896 /* Determine whether an expression T can be cheaply negated using
897 the function negate_expr. */
900 negate_expr_p (tree t)
907 type = TREE_TYPE (t);
910 switch (TREE_CODE (t))
913 if (TYPE_UNSIGNED (type) || ! flag_trapv)
916 /* Check that -CST will not overflow type. */
917 return may_negate_without_overflow_p (t);
924 return negate_expr_p (TREE_REALPART (t))
925 && negate_expr_p (TREE_IMAGPART (t));
928 if (FLOAT_TYPE_P (type) && !flag_unsafe_math_optimizations)
930 /* -(A + B) -> (-B) - A. */
931 if (negate_expr_p (TREE_OPERAND (t, 1))
932 && reorder_operands_p (TREE_OPERAND (t, 0),
933 TREE_OPERAND (t, 1)))
935 /* -(A + B) -> (-A) - B. */
936 return negate_expr_p (TREE_OPERAND (t, 0));
939 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
940 return (! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations)
941 && reorder_operands_p (TREE_OPERAND (t, 0),
942 TREE_OPERAND (t, 1));
945 if (TYPE_UNSIGNED (TREE_TYPE (t)))
951 if (! HONOR_SIGN_DEPENDENT_ROUNDING (TYPE_MODE (TREE_TYPE (t))))
952 return negate_expr_p (TREE_OPERAND (t, 1))
953 || negate_expr_p (TREE_OPERAND (t, 0));
957 /* Negate -((double)float) as (double)(-float). */
958 if (TREE_CODE (type) == REAL_TYPE)
960 tree tem = strip_float_extensions (t);
962 return negate_expr_p (tem);
967 /* Negate -f(x) as f(-x). */
968 if (negate_mathfn_p (builtin_mathfn_code (t)))
969 return negate_expr_p (TREE_VALUE (TREE_OPERAND (t, 1)));
973 /* Optimize -((int)x >> 31) into (unsigned)x >> 31. */
974 if (TREE_CODE (TREE_OPERAND (t, 1)) == INTEGER_CST)
976 tree op1 = TREE_OPERAND (t, 1);
977 if (TREE_INT_CST_HIGH (op1) == 0
978 && (unsigned HOST_WIDE_INT) (TYPE_PRECISION (type) - 1)
979 == TREE_INT_CST_LOW (op1))
990 /* Given T, an expression, return the negation of T. Allow for T to be
991 null, in which case return null. */
1002 type = TREE_TYPE (t);
1003 STRIP_SIGN_NOPS (t);
1005 switch (TREE_CODE (t))
1008 tem = fold_negate_const (t, type);
1009 if (! TREE_OVERFLOW (tem)
1010 || TYPE_UNSIGNED (type)
1016 tem = fold_negate_const (t, type);
1017 /* Two's complement FP formats, such as c4x, may overflow. */
1018 if (! TREE_OVERFLOW (tem) || ! flag_trapping_math)
1019 return fold_convert (type, tem);
1024 tree rpart = negate_expr (TREE_REALPART (t));
1025 tree ipart = negate_expr (TREE_IMAGPART (t));
1027 if ((TREE_CODE (rpart) == REAL_CST
1028 && TREE_CODE (ipart) == REAL_CST)
1029 || (TREE_CODE (rpart) == INTEGER_CST
1030 && TREE_CODE (ipart) == INTEGER_CST))
1031 return build_complex (type, rpart, ipart);
1036 return fold_convert (type, TREE_OPERAND (t, 0));
1039 if (! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations)
1041 /* -(A + B) -> (-B) - A. */
1042 if (negate_expr_p (TREE_OPERAND (t, 1))
1043 && reorder_operands_p (TREE_OPERAND (t, 0),
1044 TREE_OPERAND (t, 1)))
1046 tem = negate_expr (TREE_OPERAND (t, 1));
1047 tem = fold (build2 (MINUS_EXPR, TREE_TYPE (t),
1048 tem, TREE_OPERAND (t, 0)));
1049 return fold_convert (type, tem);
1052 /* -(A + B) -> (-A) - B. */
1053 if (negate_expr_p (TREE_OPERAND (t, 0)))
1055 tem = negate_expr (TREE_OPERAND (t, 0));
1056 tem = fold (build2 (MINUS_EXPR, TREE_TYPE (t),
1057 tem, TREE_OPERAND (t, 1)));
1058 return fold_convert (type, tem);
1064 /* - (A - B) -> B - A */
1065 if ((! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations)
1066 && reorder_operands_p (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1)))
1067 return fold_convert (type,
1068 fold (build2 (MINUS_EXPR, TREE_TYPE (t),
1069 TREE_OPERAND (t, 1),
1070 TREE_OPERAND (t, 0))));
1074 if (TYPE_UNSIGNED (TREE_TYPE (t)))
1080 if (! HONOR_SIGN_DEPENDENT_ROUNDING (TYPE_MODE (TREE_TYPE (t))))
1082 tem = TREE_OPERAND (t, 1);
1083 if (negate_expr_p (tem))
1084 return fold_convert (type,
1085 fold (build2 (TREE_CODE (t), TREE_TYPE (t),
1086 TREE_OPERAND (t, 0),
1087 negate_expr (tem))));
1088 tem = TREE_OPERAND (t, 0);
1089 if (negate_expr_p (tem))
1090 return fold_convert (type,
1091 fold (build2 (TREE_CODE (t), TREE_TYPE (t),
1093 TREE_OPERAND (t, 1))));
1098 /* Convert -((double)float) into (double)(-float). */
1099 if (TREE_CODE (type) == REAL_TYPE)
1101 tem = strip_float_extensions (t);
1102 if (tem != t && negate_expr_p (tem))
1103 return fold_convert (type, negate_expr (tem));
1108 /* Negate -f(x) as f(-x). */
1109 if (negate_mathfn_p (builtin_mathfn_code (t))
1110 && negate_expr_p (TREE_VALUE (TREE_OPERAND (t, 1))))
1112 tree fndecl, arg, arglist;
1114 fndecl = get_callee_fndecl (t);
1115 arg = negate_expr (TREE_VALUE (TREE_OPERAND (t, 1)));
1116 arglist = build_tree_list (NULL_TREE, arg);
1117 return build_function_call_expr (fndecl, arglist);
1122 /* Optimize -((int)x >> 31) into (unsigned)x >> 31. */
1123 if (TREE_CODE (TREE_OPERAND (t, 1)) == INTEGER_CST)
1125 tree op1 = TREE_OPERAND (t, 1);
1126 if (TREE_INT_CST_HIGH (op1) == 0
1127 && (unsigned HOST_WIDE_INT) (TYPE_PRECISION (type) - 1)
1128 == TREE_INT_CST_LOW (op1))
1130 tree ntype = TYPE_UNSIGNED (type)
1131 ? lang_hooks.types.signed_type (type)
1132 : lang_hooks.types.unsigned_type (type);
1133 tree temp = fold_convert (ntype, TREE_OPERAND (t, 0));
1134 temp = fold (build2 (RSHIFT_EXPR, ntype, temp, op1));
1135 return fold_convert (type, temp);
1144 tem = fold (build1 (NEGATE_EXPR, TREE_TYPE (t), t));
1145 return fold_convert (type, tem);
1148 /* Split a tree IN into a constant, literal and variable parts that could be
1149 combined with CODE to make IN. "constant" means an expression with
1150 TREE_CONSTANT but that isn't an actual constant. CODE must be a
1151 commutative arithmetic operation. Store the constant part into *CONP,
1152 the literal in *LITP and return the variable part. If a part isn't
1153 present, set it to null. If the tree does not decompose in this way,
1154 return the entire tree as the variable part and the other parts as null.
1156 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
1157 case, we negate an operand that was subtracted. Except if it is a
1158 literal for which we use *MINUS_LITP instead.
1160 If NEGATE_P is true, we are negating all of IN, again except a literal
1161 for which we use *MINUS_LITP instead.
1163 If IN is itself a literal or constant, return it as appropriate.
1165 Note that we do not guarantee that any of the three values will be the
1166 same type as IN, but they will have the same signedness and mode. */
1169 split_tree (tree in, enum tree_code code, tree *conp, tree *litp,
1170 tree *minus_litp, int negate_p)
1178 /* Strip any conversions that don't change the machine mode or signedness. */
1179 STRIP_SIGN_NOPS (in);
1181 if (TREE_CODE (in) == INTEGER_CST || TREE_CODE (in) == REAL_CST)
1183 else if (TREE_CODE (in) == code
1184 || (! FLOAT_TYPE_P (TREE_TYPE (in))
1185 /* We can associate addition and subtraction together (even
1186 though the C standard doesn't say so) for integers because
1187 the value is not affected. For reals, the value might be
1188 affected, so we can't. */
1189 && ((code == PLUS_EXPR && TREE_CODE (in) == MINUS_EXPR)
1190 || (code == MINUS_EXPR && TREE_CODE (in) == PLUS_EXPR))))
1192 tree op0 = TREE_OPERAND (in, 0);
1193 tree op1 = TREE_OPERAND (in, 1);
1194 int neg1_p = TREE_CODE (in) == MINUS_EXPR;
1195 int neg_litp_p = 0, neg_conp_p = 0, neg_var_p = 0;
1197 /* First see if either of the operands is a literal, then a constant. */
1198 if (TREE_CODE (op0) == INTEGER_CST || TREE_CODE (op0) == REAL_CST)
1199 *litp = op0, op0 = 0;
1200 else if (TREE_CODE (op1) == INTEGER_CST || TREE_CODE (op1) == REAL_CST)
1201 *litp = op1, neg_litp_p = neg1_p, op1 = 0;
1203 if (op0 != 0 && TREE_CONSTANT (op0))
1204 *conp = op0, op0 = 0;
1205 else if (op1 != 0 && TREE_CONSTANT (op1))
1206 *conp = op1, neg_conp_p = neg1_p, op1 = 0;
1208 /* If we haven't dealt with either operand, this is not a case we can
1209 decompose. Otherwise, VAR is either of the ones remaining, if any. */
1210 if (op0 != 0 && op1 != 0)
1215 var = op1, neg_var_p = neg1_p;
1217 /* Now do any needed negations. */
1219 *minus_litp = *litp, *litp = 0;
1221 *conp = negate_expr (*conp);
1223 var = negate_expr (var);
1225 else if (TREE_CONSTANT (in))
1233 *minus_litp = *litp, *litp = 0;
1234 else if (*minus_litp)
1235 *litp = *minus_litp, *minus_litp = 0;
1236 *conp = negate_expr (*conp);
1237 var = negate_expr (var);
1243 /* Re-associate trees split by the above function. T1 and T2 are either
1244 expressions to associate or null. Return the new expression, if any. If
1245 we build an operation, do it in TYPE and with CODE. */
1248 associate_trees (tree t1, tree t2, enum tree_code code, tree type)
1255 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
1256 try to fold this since we will have infinite recursion. But do
1257 deal with any NEGATE_EXPRs. */
1258 if (TREE_CODE (t1) == code || TREE_CODE (t2) == code
1259 || TREE_CODE (t1) == MINUS_EXPR || TREE_CODE (t2) == MINUS_EXPR)
1261 if (code == PLUS_EXPR)
1263 if (TREE_CODE (t1) == NEGATE_EXPR)
1264 return build2 (MINUS_EXPR, type, fold_convert (type, t2),
1265 fold_convert (type, TREE_OPERAND (t1, 0)));
1266 else if (TREE_CODE (t2) == NEGATE_EXPR)
1267 return build2 (MINUS_EXPR, type, fold_convert (type, t1),
1268 fold_convert (type, TREE_OPERAND (t2, 0)));
1269 else if (integer_zerop (t2))
1270 return fold_convert (type, t1);
1272 else if (code == MINUS_EXPR)
1274 if (integer_zerop (t2))
1275 return fold_convert (type, t1);
1278 return build2 (code, type, fold_convert (type, t1),
1279 fold_convert (type, t2));
1282 return fold (build2 (code, type, fold_convert (type, t1),
1283 fold_convert (type, t2)));
1286 /* Combine two integer constants ARG1 and ARG2 under operation CODE
1287 to produce a new constant.
1289 If NOTRUNC is nonzero, do not truncate the result to fit the data type. */
1292 int_const_binop (enum tree_code code, tree arg1, tree arg2, int notrunc)
1294 unsigned HOST_WIDE_INT int1l, int2l;
1295 HOST_WIDE_INT int1h, int2h;
1296 unsigned HOST_WIDE_INT low;
1298 unsigned HOST_WIDE_INT garbagel;
1299 HOST_WIDE_INT garbageh;
1301 tree type = TREE_TYPE (arg1);
1302 int uns = TYPE_UNSIGNED (type);
1304 = (TREE_CODE (type) == INTEGER_TYPE && TYPE_IS_SIZETYPE (type));
1307 int1l = TREE_INT_CST_LOW (arg1);
1308 int1h = TREE_INT_CST_HIGH (arg1);
1309 int2l = TREE_INT_CST_LOW (arg2);
1310 int2h = TREE_INT_CST_HIGH (arg2);
1315 low = int1l | int2l, hi = int1h | int2h;
1319 low = int1l ^ int2l, hi = int1h ^ int2h;
1323 low = int1l & int2l, hi = int1h & int2h;
1329 /* It's unclear from the C standard whether shifts can overflow.
1330 The following code ignores overflow; perhaps a C standard
1331 interpretation ruling is needed. */
1332 lshift_double (int1l, int1h, int2l, TYPE_PRECISION (type),
1339 lrotate_double (int1l, int1h, int2l, TYPE_PRECISION (type),
1344 overflow = add_double (int1l, int1h, int2l, int2h, &low, &hi);
1348 neg_double (int2l, int2h, &low, &hi);
1349 add_double (int1l, int1h, low, hi, &low, &hi);
1350 overflow = OVERFLOW_SUM_SIGN (hi, int2h, int1h);
1354 overflow = mul_double (int1l, int1h, int2l, int2h, &low, &hi);
1357 case TRUNC_DIV_EXPR:
1358 case FLOOR_DIV_EXPR: case CEIL_DIV_EXPR:
1359 case EXACT_DIV_EXPR:
1360 /* This is a shortcut for a common special case. */
1361 if (int2h == 0 && (HOST_WIDE_INT) int2l > 0
1362 && ! TREE_CONSTANT_OVERFLOW (arg1)
1363 && ! TREE_CONSTANT_OVERFLOW (arg2)
1364 && int1h == 0 && (HOST_WIDE_INT) int1l >= 0)
1366 if (code == CEIL_DIV_EXPR)
1369 low = int1l / int2l, hi = 0;
1373 /* ... fall through ... */
1375 case ROUND_DIV_EXPR:
1376 if (int2h == 0 && int2l == 1)
1378 low = int1l, hi = int1h;
1381 if (int1l == int2l && int1h == int2h
1382 && ! (int1l == 0 && int1h == 0))
1387 overflow = div_and_round_double (code, uns, int1l, int1h, int2l, int2h,
1388 &low, &hi, &garbagel, &garbageh);
1391 case TRUNC_MOD_EXPR:
1392 case FLOOR_MOD_EXPR: case CEIL_MOD_EXPR:
1393 /* This is a shortcut for a common special case. */
1394 if (int2h == 0 && (HOST_WIDE_INT) int2l > 0
1395 && ! TREE_CONSTANT_OVERFLOW (arg1)
1396 && ! TREE_CONSTANT_OVERFLOW (arg2)
1397 && int1h == 0 && (HOST_WIDE_INT) int1l >= 0)
1399 if (code == CEIL_MOD_EXPR)
1401 low = int1l % int2l, hi = 0;
1405 /* ... fall through ... */
1407 case ROUND_MOD_EXPR:
1408 overflow = div_and_round_double (code, uns,
1409 int1l, int1h, int2l, int2h,
1410 &garbagel, &garbageh, &low, &hi);
1416 low = (((unsigned HOST_WIDE_INT) int1h
1417 < (unsigned HOST_WIDE_INT) int2h)
1418 || (((unsigned HOST_WIDE_INT) int1h
1419 == (unsigned HOST_WIDE_INT) int2h)
1422 low = (int1h < int2h
1423 || (int1h == int2h && int1l < int2l));
1425 if (low == (code == MIN_EXPR))
1426 low = int1l, hi = int1h;
1428 low = int2l, hi = int2h;
1435 t = build_int_cst_wide (TREE_TYPE (arg1), low, hi);
1439 /* Propagate overflow flags ourselves. */
1440 if (((!uns || is_sizetype) && overflow)
1441 | TREE_OVERFLOW (arg1) | TREE_OVERFLOW (arg2))
1444 TREE_OVERFLOW (t) = 1;
1445 TREE_CONSTANT_OVERFLOW (t) = 1;
1447 else if (TREE_CONSTANT_OVERFLOW (arg1) | TREE_CONSTANT_OVERFLOW (arg2))
1450 TREE_CONSTANT_OVERFLOW (t) = 1;
1454 t = force_fit_type (t, 1,
1455 ((!uns || is_sizetype) && overflow)
1456 | TREE_OVERFLOW (arg1) | TREE_OVERFLOW (arg2),
1457 TREE_CONSTANT_OVERFLOW (arg1)
1458 | TREE_CONSTANT_OVERFLOW (arg2));
1463 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1464 constant. We assume ARG1 and ARG2 have the same data type, or at least
1465 are the same kind of constant and the same machine mode.
1467 If NOTRUNC is nonzero, do not truncate the result to fit the data type. */
1470 const_binop (enum tree_code code, tree arg1, tree arg2, int notrunc)
1475 if (TREE_CODE (arg1) == INTEGER_CST)
1476 return int_const_binop (code, arg1, arg2, notrunc);
1478 if (TREE_CODE (arg1) == REAL_CST)
1480 enum machine_mode mode;
1483 REAL_VALUE_TYPE value;
1484 REAL_VALUE_TYPE result;
1488 d1 = TREE_REAL_CST (arg1);
1489 d2 = TREE_REAL_CST (arg2);
1491 type = TREE_TYPE (arg1);
1492 mode = TYPE_MODE (type);
1494 /* Don't perform operation if we honor signaling NaNs and
1495 either operand is a NaN. */
1496 if (HONOR_SNANS (mode)
1497 && (REAL_VALUE_ISNAN (d1) || REAL_VALUE_ISNAN (d2)))
1500 /* Don't perform operation if it would raise a division
1501 by zero exception. */
1502 if (code == RDIV_EXPR
1503 && REAL_VALUES_EQUAL (d2, dconst0)
1504 && (flag_trapping_math || ! MODE_HAS_INFINITIES (mode)))
1507 /* If either operand is a NaN, just return it. Otherwise, set up
1508 for floating-point trap; we return an overflow. */
1509 if (REAL_VALUE_ISNAN (d1))
1511 else if (REAL_VALUE_ISNAN (d2))
1514 inexact = real_arithmetic (&value, code, &d1, &d2);
1515 real_convert (&result, mode, &value);
1517 /* Don't constant fold this floating point operation if the
1518 result may dependent upon the run-time rounding mode and
1519 flag_rounding_math is set, or if GCC's software emulation
1520 is unable to accurately represent the result. */
1522 if ((flag_rounding_math
1523 || (REAL_MODE_FORMAT_COMPOSITE_P (mode)
1524 && !flag_unsafe_math_optimizations))
1525 && (inexact || !real_identical (&result, &value)))
1528 t = build_real (type, result);
1530 TREE_OVERFLOW (t) = TREE_OVERFLOW (arg1) | TREE_OVERFLOW (arg2);
1531 TREE_CONSTANT_OVERFLOW (t)
1533 | TREE_CONSTANT_OVERFLOW (arg1)
1534 | TREE_CONSTANT_OVERFLOW (arg2);
1537 if (TREE_CODE (arg1) == COMPLEX_CST)
1539 tree type = TREE_TYPE (arg1);
1540 tree r1 = TREE_REALPART (arg1);
1541 tree i1 = TREE_IMAGPART (arg1);
1542 tree r2 = TREE_REALPART (arg2);
1543 tree i2 = TREE_IMAGPART (arg2);
1549 t = build_complex (type,
1550 const_binop (PLUS_EXPR, r1, r2, notrunc),
1551 const_binop (PLUS_EXPR, i1, i2, notrunc));
1555 t = build_complex (type,
1556 const_binop (MINUS_EXPR, r1, r2, notrunc),
1557 const_binop (MINUS_EXPR, i1, i2, notrunc));
1561 t = build_complex (type,
1562 const_binop (MINUS_EXPR,
1563 const_binop (MULT_EXPR,
1565 const_binop (MULT_EXPR,
1568 const_binop (PLUS_EXPR,
1569 const_binop (MULT_EXPR,
1571 const_binop (MULT_EXPR,
1579 = const_binop (PLUS_EXPR,
1580 const_binop (MULT_EXPR, r2, r2, notrunc),
1581 const_binop (MULT_EXPR, i2, i2, notrunc),
1584 t = build_complex (type,
1586 (INTEGRAL_TYPE_P (TREE_TYPE (r1))
1587 ? TRUNC_DIV_EXPR : RDIV_EXPR,
1588 const_binop (PLUS_EXPR,
1589 const_binop (MULT_EXPR, r1, r2,
1591 const_binop (MULT_EXPR, i1, i2,
1594 magsquared, notrunc),
1596 (INTEGRAL_TYPE_P (TREE_TYPE (r1))
1597 ? TRUNC_DIV_EXPR : RDIV_EXPR,
1598 const_binop (MINUS_EXPR,
1599 const_binop (MULT_EXPR, i1, r2,
1601 const_binop (MULT_EXPR, r1, i2,
1604 magsquared, notrunc));
1616 /* Create a size type INT_CST node with NUMBER sign extended. KIND
1617 indicates which particular sizetype to create. */
1620 size_int_kind (HOST_WIDE_INT number, enum size_type_kind kind)
1622 return build_int_cst (sizetype_tab[(int) kind], number);
1625 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1626 is a tree code. The type of the result is taken from the operands.
1627 Both must be the same type integer type and it must be a size type.
1628 If the operands are constant, so is the result. */
1631 size_binop (enum tree_code code, tree arg0, tree arg1)
1633 tree type = TREE_TYPE (arg0);
1635 gcc_assert (TREE_CODE (type) == INTEGER_TYPE && TYPE_IS_SIZETYPE (type)
1636 && type == TREE_TYPE (arg1));
1638 /* Handle the special case of two integer constants faster. */
1639 if (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST)
1641 /* And some specific cases even faster than that. */
1642 if (code == PLUS_EXPR && integer_zerop (arg0))
1644 else if ((code == MINUS_EXPR || code == PLUS_EXPR)
1645 && integer_zerop (arg1))
1647 else if (code == MULT_EXPR && integer_onep (arg0))
1650 /* Handle general case of two integer constants. */
1651 return int_const_binop (code, arg0, arg1, 0);
1654 if (arg0 == error_mark_node || arg1 == error_mark_node)
1655 return error_mark_node;
1657 return fold (build2 (code, type, arg0, arg1));
1660 /* Given two values, either both of sizetype or both of bitsizetype,
1661 compute the difference between the two values. Return the value
1662 in signed type corresponding to the type of the operands. */
1665 size_diffop (tree arg0, tree arg1)
1667 tree type = TREE_TYPE (arg0);
1670 gcc_assert (TREE_CODE (type) == INTEGER_TYPE && TYPE_IS_SIZETYPE (type)
1671 && type == TREE_TYPE (arg1));
1673 /* If the type is already signed, just do the simple thing. */
1674 if (!TYPE_UNSIGNED (type))
1675 return size_binop (MINUS_EXPR, arg0, arg1);
1677 ctype = type == bitsizetype ? sbitsizetype : ssizetype;
1679 /* If either operand is not a constant, do the conversions to the signed
1680 type and subtract. The hardware will do the right thing with any
1681 overflow in the subtraction. */
1682 if (TREE_CODE (arg0) != INTEGER_CST || TREE_CODE (arg1) != INTEGER_CST)
1683 return size_binop (MINUS_EXPR, fold_convert (ctype, arg0),
1684 fold_convert (ctype, arg1));
1686 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1687 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1688 overflow) and negate (which can't either). Special-case a result
1689 of zero while we're here. */
1690 if (tree_int_cst_equal (arg0, arg1))
1691 return fold_convert (ctype, integer_zero_node);
1692 else if (tree_int_cst_lt (arg1, arg0))
1693 return fold_convert (ctype, size_binop (MINUS_EXPR, arg0, arg1));
1695 return size_binop (MINUS_EXPR, fold_convert (ctype, integer_zero_node),
1696 fold_convert (ctype, size_binop (MINUS_EXPR,
1700 /* A subroutine of fold_convert_const handling conversions of an
1701 INTEGER_CST to another integer type. */
1704 fold_convert_const_int_from_int (tree type, tree arg1)
1708 /* Given an integer constant, make new constant with new type,
1709 appropriately sign-extended or truncated. */
1710 t = build_int_cst_wide (type, TREE_INT_CST_LOW (arg1),
1711 TREE_INT_CST_HIGH (arg1));
1713 t = force_fit_type (t,
1714 /* Don't set the overflow when
1715 converting a pointer */
1716 !POINTER_TYPE_P (TREE_TYPE (arg1)),
1717 (TREE_INT_CST_HIGH (arg1) < 0
1718 && (TYPE_UNSIGNED (type)
1719 < TYPE_UNSIGNED (TREE_TYPE (arg1))))
1720 | TREE_OVERFLOW (arg1),
1721 TREE_CONSTANT_OVERFLOW (arg1));
1726 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1727 to an integer type. */
1730 fold_convert_const_int_from_real (enum tree_code code, tree type, tree arg1)
1735 /* The following code implements the floating point to integer
1736 conversion rules required by the Java Language Specification,
1737 that IEEE NaNs are mapped to zero and values that overflow
1738 the target precision saturate, i.e. values greater than
1739 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1740 are mapped to INT_MIN. These semantics are allowed by the
1741 C and C++ standards that simply state that the behavior of
1742 FP-to-integer conversion is unspecified upon overflow. */
1744 HOST_WIDE_INT high, low;
1746 REAL_VALUE_TYPE x = TREE_REAL_CST (arg1);
1750 case FIX_TRUNC_EXPR:
1751 real_trunc (&r, VOIDmode, &x);
1755 real_ceil (&r, VOIDmode, &x);
1758 case FIX_FLOOR_EXPR:
1759 real_floor (&r, VOIDmode, &x);
1762 case FIX_ROUND_EXPR:
1763 real_round (&r, VOIDmode, &x);
1770 /* If R is NaN, return zero and show we have an overflow. */
1771 if (REAL_VALUE_ISNAN (r))
1778 /* See if R is less than the lower bound or greater than the
1783 tree lt = TYPE_MIN_VALUE (type);
1784 REAL_VALUE_TYPE l = real_value_from_int_cst (NULL_TREE, lt);
1785 if (REAL_VALUES_LESS (r, l))
1788 high = TREE_INT_CST_HIGH (lt);
1789 low = TREE_INT_CST_LOW (lt);
1795 tree ut = TYPE_MAX_VALUE (type);
1798 REAL_VALUE_TYPE u = real_value_from_int_cst (NULL_TREE, ut);
1799 if (REAL_VALUES_LESS (u, r))
1802 high = TREE_INT_CST_HIGH (ut);
1803 low = TREE_INT_CST_LOW (ut);
1809 REAL_VALUE_TO_INT (&low, &high, r);
1811 t = build_int_cst_wide (type, low, high);
1813 t = force_fit_type (t, -1, overflow | TREE_OVERFLOW (arg1),
1814 TREE_CONSTANT_OVERFLOW (arg1));
1818 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1819 to another floating point type. */
1822 fold_convert_const_real_from_real (tree type, tree arg1)
1824 REAL_VALUE_TYPE value;
1827 real_convert (&value, TYPE_MODE (type), &TREE_REAL_CST (arg1));
1828 t = build_real (type, value);
1830 TREE_OVERFLOW (t) = TREE_OVERFLOW (arg1);
1831 TREE_CONSTANT_OVERFLOW (t)
1832 = TREE_OVERFLOW (t) | TREE_CONSTANT_OVERFLOW (arg1);
1836 /* Attempt to fold type conversion operation CODE of expression ARG1 to
1837 type TYPE. If no simplification can be done return NULL_TREE. */
1840 fold_convert_const (enum tree_code code, tree type, tree arg1)
1842 if (TREE_TYPE (arg1) == type)
1845 if (POINTER_TYPE_P (type) || INTEGRAL_TYPE_P (type))
1847 if (TREE_CODE (arg1) == INTEGER_CST)
1848 return fold_convert_const_int_from_int (type, arg1);
1849 else if (TREE_CODE (arg1) == REAL_CST)
1850 return fold_convert_const_int_from_real (code, type, arg1);
1852 else if (TREE_CODE (type) == REAL_TYPE)
1854 if (TREE_CODE (arg1) == INTEGER_CST)
1855 return build_real_from_int_cst (type, arg1);
1856 if (TREE_CODE (arg1) == REAL_CST)
1857 return fold_convert_const_real_from_real (type, arg1);
1862 /* Construct a vector of zero elements of vector type TYPE. */
1865 build_zero_vector (tree type)
1870 elem = fold_convert_const (NOP_EXPR, TREE_TYPE (type), integer_zero_node);
1871 units = TYPE_VECTOR_SUBPARTS (type);
1874 for (i = 0; i < units; i++)
1875 list = tree_cons (NULL_TREE, elem, list);
1876 return build_vector (type, list);
1879 /* Convert expression ARG to type TYPE. Used by the middle-end for
1880 simple conversions in preference to calling the front-end's convert. */
1883 fold_convert (tree type, tree arg)
1885 tree orig = TREE_TYPE (arg);
1891 if (TREE_CODE (arg) == ERROR_MARK
1892 || TREE_CODE (type) == ERROR_MARK
1893 || TREE_CODE (orig) == ERROR_MARK)
1894 return error_mark_node;
1896 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (orig)
1897 || lang_hooks.types_compatible_p (TYPE_MAIN_VARIANT (type),
1898 TYPE_MAIN_VARIANT (orig)))
1899 return fold (build1 (NOP_EXPR, type, arg));
1901 switch (TREE_CODE (type))
1903 case INTEGER_TYPE: case CHAR_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1904 case POINTER_TYPE: case REFERENCE_TYPE:
1906 if (TREE_CODE (arg) == INTEGER_CST)
1908 tem = fold_convert_const (NOP_EXPR, type, arg);
1909 if (tem != NULL_TREE)
1912 if (INTEGRAL_TYPE_P (orig) || POINTER_TYPE_P (orig)
1913 || TREE_CODE (orig) == OFFSET_TYPE)
1914 return fold (build1 (NOP_EXPR, type, arg));
1915 if (TREE_CODE (orig) == COMPLEX_TYPE)
1917 tem = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg));
1918 return fold_convert (type, tem);
1920 gcc_assert (TREE_CODE (orig) == VECTOR_TYPE
1921 && tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (orig)));
1922 return fold (build1 (NOP_EXPR, type, arg));
1925 if (TREE_CODE (arg) == INTEGER_CST)
1927 tem = fold_convert_const (FLOAT_EXPR, type, arg);
1928 if (tem != NULL_TREE)
1931 else if (TREE_CODE (arg) == REAL_CST)
1933 tem = fold_convert_const (NOP_EXPR, type, arg);
1934 if (tem != NULL_TREE)
1938 switch (TREE_CODE (orig))
1940 case INTEGER_TYPE: case CHAR_TYPE:
1941 case BOOLEAN_TYPE: case ENUMERAL_TYPE:
1942 case POINTER_TYPE: case REFERENCE_TYPE:
1943 return fold (build1 (FLOAT_EXPR, type, arg));
1946 return fold (build1 (flag_float_store ? CONVERT_EXPR : NOP_EXPR,
1950 tem = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg));
1951 return fold_convert (type, tem);
1958 switch (TREE_CODE (orig))
1960 case INTEGER_TYPE: case CHAR_TYPE:
1961 case BOOLEAN_TYPE: case ENUMERAL_TYPE:
1962 case POINTER_TYPE: case REFERENCE_TYPE:
1964 return build2 (COMPLEX_EXPR, type,
1965 fold_convert (TREE_TYPE (type), arg),
1966 fold_convert (TREE_TYPE (type), integer_zero_node));
1971 if (TREE_CODE (arg) == COMPLEX_EXPR)
1973 rpart = fold_convert (TREE_TYPE (type), TREE_OPERAND (arg, 0));
1974 ipart = fold_convert (TREE_TYPE (type), TREE_OPERAND (arg, 1));
1975 return fold (build2 (COMPLEX_EXPR, type, rpart, ipart));
1978 arg = save_expr (arg);
1979 rpart = fold (build1 (REALPART_EXPR, TREE_TYPE (orig), arg));
1980 ipart = fold (build1 (IMAGPART_EXPR, TREE_TYPE (orig), arg));
1981 rpart = fold_convert (TREE_TYPE (type), rpart);
1982 ipart = fold_convert (TREE_TYPE (type), ipart);
1983 return fold (build2 (COMPLEX_EXPR, type, rpart, ipart));
1991 if (integer_zerop (arg))
1992 return build_zero_vector (type);
1993 gcc_assert (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (orig)));
1994 gcc_assert (INTEGRAL_TYPE_P (orig) || POINTER_TYPE_P (orig)
1995 || TREE_CODE (orig) == VECTOR_TYPE);
1996 return fold (build1 (NOP_EXPR, type, arg));
1999 return fold (build1 (CONVERT_EXPR, type, fold_ignored_result (arg)));
2006 /* Return an expr equal to X but certainly not valid as an lvalue. */
2011 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2016 /* We only need to wrap lvalue tree codes. */
2017 switch (TREE_CODE (x))
2028 case ALIGN_INDIRECT_REF:
2029 case MISALIGNED_INDIRECT_REF:
2031 case ARRAY_RANGE_REF:
2037 case PREINCREMENT_EXPR:
2038 case PREDECREMENT_EXPR:
2040 case TRY_CATCH_EXPR:
2041 case WITH_CLEANUP_EXPR:
2052 /* Assume the worst for front-end tree codes. */
2053 if ((int)TREE_CODE (x) >= NUM_TREE_CODES)
2057 return build1 (NON_LVALUE_EXPR, TREE_TYPE (x), x);
2060 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2061 Zero means allow extended lvalues. */
2063 int pedantic_lvalues;
2065 /* When pedantic, return an expr equal to X but certainly not valid as a
2066 pedantic lvalue. Otherwise, return X. */
2069 pedantic_non_lvalue (tree x)
2071 if (pedantic_lvalues)
2072 return non_lvalue (x);
2077 /* Given a tree comparison code, return the code that is the logical inverse
2078 of the given code. It is not safe to do this for floating-point
2079 comparisons, except for NE_EXPR and EQ_EXPR, so we receive a machine mode
2080 as well: if reversing the comparison is unsafe, return ERROR_MARK. */
2082 static enum tree_code
2083 invert_tree_comparison (enum tree_code code, bool honor_nans)
2085 if (honor_nans && flag_trapping_math)
2095 return honor_nans ? UNLE_EXPR : LE_EXPR;
2097 return honor_nans ? UNLT_EXPR : LT_EXPR;
2099 return honor_nans ? UNGE_EXPR : GE_EXPR;
2101 return honor_nans ? UNGT_EXPR : GT_EXPR;
2115 return UNORDERED_EXPR;
2116 case UNORDERED_EXPR:
2117 return ORDERED_EXPR;
2123 /* Similar, but return the comparison that results if the operands are
2124 swapped. This is safe for floating-point. */
2127 swap_tree_comparison (enum tree_code code)
2148 /* Convert a comparison tree code from an enum tree_code representation
2149 into a compcode bit-based encoding. This function is the inverse of
2150 compcode_to_comparison. */
2152 static enum comparison_code
2153 comparison_to_compcode (enum tree_code code)
2170 return COMPCODE_ORD;
2171 case UNORDERED_EXPR:
2172 return COMPCODE_UNORD;
2174 return COMPCODE_UNLT;
2176 return COMPCODE_UNEQ;
2178 return COMPCODE_UNLE;
2180 return COMPCODE_UNGT;
2182 return COMPCODE_LTGT;
2184 return COMPCODE_UNGE;
2190 /* Convert a compcode bit-based encoding of a comparison operator back
2191 to GCC's enum tree_code representation. This function is the
2192 inverse of comparison_to_compcode. */
2194 static enum tree_code
2195 compcode_to_comparison (enum comparison_code code)
2212 return ORDERED_EXPR;
2213 case COMPCODE_UNORD:
2214 return UNORDERED_EXPR;
2232 /* Return a tree for the comparison which is the combination of
2233 doing the AND or OR (depending on CODE) of the two operations LCODE
2234 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2235 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2236 if this makes the transformation invalid. */
2239 combine_comparisons (enum tree_code code, enum tree_code lcode,
2240 enum tree_code rcode, tree truth_type,
2241 tree ll_arg, tree lr_arg)
2243 bool honor_nans = HONOR_NANS (TYPE_MODE (TREE_TYPE (ll_arg)));
2244 enum comparison_code lcompcode = comparison_to_compcode (lcode);
2245 enum comparison_code rcompcode = comparison_to_compcode (rcode);
2246 enum comparison_code compcode;
2250 case TRUTH_AND_EXPR: case TRUTH_ANDIF_EXPR:
2251 compcode = lcompcode & rcompcode;
2254 case TRUTH_OR_EXPR: case TRUTH_ORIF_EXPR:
2255 compcode = lcompcode | rcompcode;
2264 /* Eliminate unordered comparisons, as well as LTGT and ORD
2265 which are not used unless the mode has NaNs. */
2266 compcode &= ~COMPCODE_UNORD;
2267 if (compcode == COMPCODE_LTGT)
2268 compcode = COMPCODE_NE;
2269 else if (compcode == COMPCODE_ORD)
2270 compcode = COMPCODE_TRUE;
2272 else if (flag_trapping_math)
2274 /* Check that the original operation and the optimized ones will trap
2275 under the same condition. */
2276 bool ltrap = (lcompcode & COMPCODE_UNORD) == 0
2277 && (lcompcode != COMPCODE_EQ)
2278 && (lcompcode != COMPCODE_ORD);
2279 bool rtrap = (rcompcode & COMPCODE_UNORD) == 0
2280 && (rcompcode != COMPCODE_EQ)
2281 && (rcompcode != COMPCODE_ORD);
2282 bool trap = (compcode & COMPCODE_UNORD) == 0
2283 && (compcode != COMPCODE_EQ)
2284 && (compcode != COMPCODE_ORD);
2286 /* In a short-circuited boolean expression the LHS might be
2287 such that the RHS, if evaluated, will never trap. For
2288 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2289 if neither x nor y is NaN. (This is a mixed blessing: for
2290 example, the expression above will never trap, hence
2291 optimizing it to x < y would be invalid). */
2292 if ((code == TRUTH_ORIF_EXPR && (lcompcode & COMPCODE_UNORD))
2293 || (code == TRUTH_ANDIF_EXPR && !(lcompcode & COMPCODE_UNORD)))
2296 /* If the comparison was short-circuited, and only the RHS
2297 trapped, we may now generate a spurious trap. */
2299 && (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR))
2302 /* If we changed the conditions that cause a trap, we lose. */
2303 if ((ltrap || rtrap) != trap)
2307 if (compcode == COMPCODE_TRUE)
2308 return constant_boolean_node (true, truth_type);
2309 else if (compcode == COMPCODE_FALSE)
2310 return constant_boolean_node (false, truth_type);
2312 return fold (build2 (compcode_to_comparison (compcode),
2313 truth_type, ll_arg, lr_arg));
2316 /* Return nonzero if CODE is a tree code that represents a truth value. */
2319 truth_value_p (enum tree_code code)
2321 return (TREE_CODE_CLASS (code) == tcc_comparison
2322 || code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
2323 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
2324 || code == TRUTH_XOR_EXPR || code == TRUTH_NOT_EXPR);
2327 /* Return nonzero if two operands (typically of the same tree node)
2328 are necessarily equal. If either argument has side-effects this
2329 function returns zero. FLAGS modifies behavior as follows:
2331 If OEP_ONLY_CONST is set, only return nonzero for constants.
2332 This function tests whether the operands are indistinguishable;
2333 it does not test whether they are equal using C's == operation.
2334 The distinction is important for IEEE floating point, because
2335 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2336 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2338 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2339 even though it may hold multiple values during a function.
2340 This is because a GCC tree node guarantees that nothing else is
2341 executed between the evaluation of its "operands" (which may often
2342 be evaluated in arbitrary order). Hence if the operands themselves
2343 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2344 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2345 unset means assuming isochronic (or instantaneous) tree equivalence.
2346 Unless comparing arbitrary expression trees, such as from different
2347 statements, this flag can usually be left unset.
2349 If OEP_PURE_SAME is set, then pure functions with identical arguments
2350 are considered the same. It is used when the caller has other ways
2351 to ensure that global memory is unchanged in between. */
2354 operand_equal_p (tree arg0, tree arg1, unsigned int flags)
2356 /* If either is ERROR_MARK, they aren't equal. */
2357 if (TREE_CODE (arg0) == ERROR_MARK || TREE_CODE (arg1) == ERROR_MARK)
2360 /* If both types don't have the same signedness, then we can't consider
2361 them equal. We must check this before the STRIP_NOPS calls
2362 because they may change the signedness of the arguments. */
2363 if (TYPE_UNSIGNED (TREE_TYPE (arg0)) != TYPE_UNSIGNED (TREE_TYPE (arg1)))
2369 if (TREE_CODE (arg0) != TREE_CODE (arg1)
2370 /* This is needed for conversions and for COMPONENT_REF.
2371 Might as well play it safe and always test this. */
2372 || TREE_CODE (TREE_TYPE (arg0)) == ERROR_MARK
2373 || TREE_CODE (TREE_TYPE (arg1)) == ERROR_MARK
2374 || TYPE_MODE (TREE_TYPE (arg0)) != TYPE_MODE (TREE_TYPE (arg1)))
2377 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2378 We don't care about side effects in that case because the SAVE_EXPR
2379 takes care of that for us. In all other cases, two expressions are
2380 equal if they have no side effects. If we have two identical
2381 expressions with side effects that should be treated the same due
2382 to the only side effects being identical SAVE_EXPR's, that will
2383 be detected in the recursive calls below. */
2384 if (arg0 == arg1 && ! (flags & OEP_ONLY_CONST)
2385 && (TREE_CODE (arg0) == SAVE_EXPR
2386 || (! TREE_SIDE_EFFECTS (arg0) && ! TREE_SIDE_EFFECTS (arg1))))
2389 /* Next handle constant cases, those for which we can return 1 even
2390 if ONLY_CONST is set. */
2391 if (TREE_CONSTANT (arg0) && TREE_CONSTANT (arg1))
2392 switch (TREE_CODE (arg0))
2395 return (! TREE_CONSTANT_OVERFLOW (arg0)
2396 && ! TREE_CONSTANT_OVERFLOW (arg1)
2397 && tree_int_cst_equal (arg0, arg1));
2400 return (! TREE_CONSTANT_OVERFLOW (arg0)
2401 && ! TREE_CONSTANT_OVERFLOW (arg1)
2402 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (arg0),
2403 TREE_REAL_CST (arg1)));
2409 if (TREE_CONSTANT_OVERFLOW (arg0)
2410 || TREE_CONSTANT_OVERFLOW (arg1))
2413 v1 = TREE_VECTOR_CST_ELTS (arg0);
2414 v2 = TREE_VECTOR_CST_ELTS (arg1);
2417 if (!operand_equal_p (TREE_VALUE (v1), TREE_VALUE (v2),
2420 v1 = TREE_CHAIN (v1);
2421 v2 = TREE_CHAIN (v2);
2428 return (operand_equal_p (TREE_REALPART (arg0), TREE_REALPART (arg1),
2430 && operand_equal_p (TREE_IMAGPART (arg0), TREE_IMAGPART (arg1),
2434 return (TREE_STRING_LENGTH (arg0) == TREE_STRING_LENGTH (arg1)
2435 && ! memcmp (TREE_STRING_POINTER (arg0),
2436 TREE_STRING_POINTER (arg1),
2437 TREE_STRING_LENGTH (arg0)));
2440 return operand_equal_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 0),
2446 if (flags & OEP_ONLY_CONST)
2449 /* Define macros to test an operand from arg0 and arg1 for equality and a
2450 variant that allows null and views null as being different from any
2451 non-null value. In the latter case, if either is null, the both
2452 must be; otherwise, do the normal comparison. */
2453 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2454 TREE_OPERAND (arg1, N), flags)
2456 #define OP_SAME_WITH_NULL(N) \
2457 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2458 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2460 switch (TREE_CODE_CLASS (TREE_CODE (arg0)))
2463 /* Two conversions are equal only if signedness and modes match. */
2464 switch (TREE_CODE (arg0))
2469 case FIX_TRUNC_EXPR:
2470 case FIX_FLOOR_EXPR:
2471 case FIX_ROUND_EXPR:
2472 if (TYPE_UNSIGNED (TREE_TYPE (arg0))
2473 != TYPE_UNSIGNED (TREE_TYPE (arg1)))
2483 case tcc_comparison:
2485 if (OP_SAME (0) && OP_SAME (1))
2488 /* For commutative ops, allow the other order. */
2489 return (commutative_tree_code (TREE_CODE (arg0))
2490 && operand_equal_p (TREE_OPERAND (arg0, 0),
2491 TREE_OPERAND (arg1, 1), flags)
2492 && operand_equal_p (TREE_OPERAND (arg0, 1),
2493 TREE_OPERAND (arg1, 0), flags));
2496 /* If either of the pointer (or reference) expressions we are
2497 dereferencing contain a side effect, these cannot be equal. */
2498 if (TREE_SIDE_EFFECTS (arg0)
2499 || TREE_SIDE_EFFECTS (arg1))
2502 switch (TREE_CODE (arg0))
2505 case ALIGN_INDIRECT_REF:
2506 case MISALIGNED_INDIRECT_REF:
2512 case ARRAY_RANGE_REF:
2513 /* Operands 2 and 3 may be null. */
2516 && OP_SAME_WITH_NULL (2)
2517 && OP_SAME_WITH_NULL (3));
2520 /* Handle operand 2 the same as for ARRAY_REF. */
2521 return OP_SAME (0) && OP_SAME (1) && OP_SAME_WITH_NULL (2);
2524 return OP_SAME (0) && OP_SAME (1) && OP_SAME (2);
2530 case tcc_expression:
2531 switch (TREE_CODE (arg0))
2534 case TRUTH_NOT_EXPR:
2537 case TRUTH_ANDIF_EXPR:
2538 case TRUTH_ORIF_EXPR:
2539 return OP_SAME (0) && OP_SAME (1);
2541 case TRUTH_AND_EXPR:
2543 case TRUTH_XOR_EXPR:
2544 if (OP_SAME (0) && OP_SAME (1))
2547 /* Otherwise take into account this is a commutative operation. */
2548 return (operand_equal_p (TREE_OPERAND (arg0, 0),
2549 TREE_OPERAND (arg1, 1), flags)
2550 && operand_equal_p (TREE_OPERAND (arg0, 1),
2551 TREE_OPERAND (arg1, 0), flags));
2554 /* If the CALL_EXPRs call different functions, then they
2555 clearly can not be equal. */
2560 unsigned int cef = call_expr_flags (arg0);
2561 if (flags & OEP_PURE_SAME)
2562 cef &= ECF_CONST | ECF_PURE;
2569 /* Now see if all the arguments are the same. operand_equal_p
2570 does not handle TREE_LIST, so we walk the operands here
2571 feeding them to operand_equal_p. */
2572 arg0 = TREE_OPERAND (arg0, 1);
2573 arg1 = TREE_OPERAND (arg1, 1);
2574 while (arg0 && arg1)
2576 if (! operand_equal_p (TREE_VALUE (arg0), TREE_VALUE (arg1),
2580 arg0 = TREE_CHAIN (arg0);
2581 arg1 = TREE_CHAIN (arg1);
2584 /* If we get here and both argument lists are exhausted
2585 then the CALL_EXPRs are equal. */
2586 return ! (arg0 || arg1);
2592 case tcc_declaration:
2593 /* Consider __builtin_sqrt equal to sqrt. */
2594 return (TREE_CODE (arg0) == FUNCTION_DECL
2595 && DECL_BUILT_IN (arg0) && DECL_BUILT_IN (arg1)
2596 && DECL_BUILT_IN_CLASS (arg0) == DECL_BUILT_IN_CLASS (arg1)
2597 && DECL_FUNCTION_CODE (arg0) == DECL_FUNCTION_CODE (arg1));
2604 #undef OP_SAME_WITH_NULL
2607 /* Similar to operand_equal_p, but see if ARG0 might have been made by
2608 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
2610 When in doubt, return 0. */
2613 operand_equal_for_comparison_p (tree arg0, tree arg1, tree other)
2615 int unsignedp1, unsignedpo;
2616 tree primarg0, primarg1, primother;
2617 unsigned int correct_width;
2619 if (operand_equal_p (arg0, arg1, 0))
2622 if (! INTEGRAL_TYPE_P (TREE_TYPE (arg0))
2623 || ! INTEGRAL_TYPE_P (TREE_TYPE (arg1)))
2626 /* Discard any conversions that don't change the modes of ARG0 and ARG1
2627 and see if the inner values are the same. This removes any
2628 signedness comparison, which doesn't matter here. */
2629 primarg0 = arg0, primarg1 = arg1;
2630 STRIP_NOPS (primarg0);
2631 STRIP_NOPS (primarg1);
2632 if (operand_equal_p (primarg0, primarg1, 0))
2635 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
2636 actual comparison operand, ARG0.
2638 First throw away any conversions to wider types
2639 already present in the operands. */
2641 primarg1 = get_narrower (arg1, &unsignedp1);
2642 primother = get_narrower (other, &unsignedpo);
2644 correct_width = TYPE_PRECISION (TREE_TYPE (arg1));
2645 if (unsignedp1 == unsignedpo
2646 && TYPE_PRECISION (TREE_TYPE (primarg1)) < correct_width
2647 && TYPE_PRECISION (TREE_TYPE (primother)) < correct_width)
2649 tree type = TREE_TYPE (arg0);
2651 /* Make sure shorter operand is extended the right way
2652 to match the longer operand. */
2653 primarg1 = fold_convert (lang_hooks.types.signed_or_unsigned_type
2654 (unsignedp1, TREE_TYPE (primarg1)), primarg1);
2656 if (operand_equal_p (arg0, fold_convert (type, primarg1), 0))
2663 /* See if ARG is an expression that is either a comparison or is performing
2664 arithmetic on comparisons. The comparisons must only be comparing
2665 two different values, which will be stored in *CVAL1 and *CVAL2; if
2666 they are nonzero it means that some operands have already been found.
2667 No variables may be used anywhere else in the expression except in the
2668 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
2669 the expression and save_expr needs to be called with CVAL1 and CVAL2.
2671 If this is true, return 1. Otherwise, return zero. */
2674 twoval_comparison_p (tree arg, tree *cval1, tree *cval2, int *save_p)
2676 enum tree_code code = TREE_CODE (arg);
2677 enum tree_code_class class = TREE_CODE_CLASS (code);
2679 /* We can handle some of the tcc_expression cases here. */
2680 if (class == tcc_expression && code == TRUTH_NOT_EXPR)
2682 else if (class == tcc_expression
2683 && (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR
2684 || code == COMPOUND_EXPR))
2687 else if (class == tcc_expression && code == SAVE_EXPR
2688 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
2690 /* If we've already found a CVAL1 or CVAL2, this expression is
2691 two complex to handle. */
2692 if (*cval1 || *cval2)
2702 return twoval_comparison_p (TREE_OPERAND (arg, 0), cval1, cval2, save_p);
2705 return (twoval_comparison_p (TREE_OPERAND (arg, 0), cval1, cval2, save_p)
2706 && twoval_comparison_p (TREE_OPERAND (arg, 1),
2707 cval1, cval2, save_p));
2712 case tcc_expression:
2713 if (code == COND_EXPR)
2714 return (twoval_comparison_p (TREE_OPERAND (arg, 0),
2715 cval1, cval2, save_p)
2716 && twoval_comparison_p (TREE_OPERAND (arg, 1),
2717 cval1, cval2, save_p)
2718 && twoval_comparison_p (TREE_OPERAND (arg, 2),
2719 cval1, cval2, save_p));
2722 case tcc_comparison:
2723 /* First see if we can handle the first operand, then the second. For
2724 the second operand, we know *CVAL1 can't be zero. It must be that
2725 one side of the comparison is each of the values; test for the
2726 case where this isn't true by failing if the two operands
2729 if (operand_equal_p (TREE_OPERAND (arg, 0),
2730 TREE_OPERAND (arg, 1), 0))
2734 *cval1 = TREE_OPERAND (arg, 0);
2735 else if (operand_equal_p (*cval1, TREE_OPERAND (arg, 0), 0))
2737 else if (*cval2 == 0)
2738 *cval2 = TREE_OPERAND (arg, 0);
2739 else if (operand_equal_p (*cval2, TREE_OPERAND (arg, 0), 0))
2744 if (operand_equal_p (*cval1, TREE_OPERAND (arg, 1), 0))
2746 else if (*cval2 == 0)
2747 *cval2 = TREE_OPERAND (arg, 1);
2748 else if (operand_equal_p (*cval2, TREE_OPERAND (arg, 1), 0))
2760 /* ARG is a tree that is known to contain just arithmetic operations and
2761 comparisons. Evaluate the operations in the tree substituting NEW0 for
2762 any occurrence of OLD0 as an operand of a comparison and likewise for
2766 eval_subst (tree arg, tree old0, tree new0, tree old1, tree new1)
2768 tree type = TREE_TYPE (arg);
2769 enum tree_code code = TREE_CODE (arg);
2770 enum tree_code_class class = TREE_CODE_CLASS (code);
2772 /* We can handle some of the tcc_expression cases here. */
2773 if (class == tcc_expression && code == TRUTH_NOT_EXPR)
2775 else if (class == tcc_expression
2776 && (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR))
2782 return fold (build1 (code, type,
2783 eval_subst (TREE_OPERAND (arg, 0),
2784 old0, new0, old1, new1)));
2787 return fold (build2 (code, type,
2788 eval_subst (TREE_OPERAND (arg, 0),
2789 old0, new0, old1, new1),
2790 eval_subst (TREE_OPERAND (arg, 1),
2791 old0, new0, old1, new1)));
2793 case tcc_expression:
2797 return eval_subst (TREE_OPERAND (arg, 0), old0, new0, old1, new1);
2800 return eval_subst (TREE_OPERAND (arg, 1), old0, new0, old1, new1);
2803 return fold (build3 (code, type,
2804 eval_subst (TREE_OPERAND (arg, 0),
2805 old0, new0, old1, new1),
2806 eval_subst (TREE_OPERAND (arg, 1),
2807 old0, new0, old1, new1),
2808 eval_subst (TREE_OPERAND (arg, 2),
2809 old0, new0, old1, new1)));
2813 /* Fall through - ??? */
2815 case tcc_comparison:
2817 tree arg0 = TREE_OPERAND (arg, 0);
2818 tree arg1 = TREE_OPERAND (arg, 1);
2820 /* We need to check both for exact equality and tree equality. The
2821 former will be true if the operand has a side-effect. In that
2822 case, we know the operand occurred exactly once. */
2824 if (arg0 == old0 || operand_equal_p (arg0, old0, 0))
2826 else if (arg0 == old1 || operand_equal_p (arg0, old1, 0))
2829 if (arg1 == old0 || operand_equal_p (arg1, old0, 0))
2831 else if (arg1 == old1 || operand_equal_p (arg1, old1, 0))
2834 return fold (build2 (code, type, arg0, arg1));
2842 /* Return a tree for the case when the result of an expression is RESULT
2843 converted to TYPE and OMITTED was previously an operand of the expression
2844 but is now not needed (e.g., we folded OMITTED * 0).
2846 If OMITTED has side effects, we must evaluate it. Otherwise, just do
2847 the conversion of RESULT to TYPE. */
2850 omit_one_operand (tree type, tree result, tree omitted)
2852 tree t = fold_convert (type, result);
2854 if (TREE_SIDE_EFFECTS (omitted))
2855 return build2 (COMPOUND_EXPR, type, fold_ignored_result (omitted), t);
2857 return non_lvalue (t);
2860 /* Similar, but call pedantic_non_lvalue instead of non_lvalue. */
2863 pedantic_omit_one_operand (tree type, tree result, tree omitted)
2865 tree t = fold_convert (type, result);
2867 if (TREE_SIDE_EFFECTS (omitted))
2868 return build2 (COMPOUND_EXPR, type, fold_ignored_result (omitted), t);
2870 return pedantic_non_lvalue (t);
2873 /* Return a tree for the case when the result of an expression is RESULT
2874 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
2875 of the expression but are now not needed.
2877 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
2878 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
2879 evaluated before OMITTED2. Otherwise, if neither has side effects,
2880 just do the conversion of RESULT to TYPE. */
2883 omit_two_operands (tree type, tree result, tree omitted1, tree omitted2)
2885 tree t = fold_convert (type, result);
2887 if (TREE_SIDE_EFFECTS (omitted2))
2888 t = build2 (COMPOUND_EXPR, type, omitted2, t);
2889 if (TREE_SIDE_EFFECTS (omitted1))
2890 t = build2 (COMPOUND_EXPR, type, omitted1, t);
2892 return TREE_CODE (t) != COMPOUND_EXPR ? non_lvalue (t) : t;
2896 /* Return a simplified tree node for the truth-negation of ARG. This
2897 never alters ARG itself. We assume that ARG is an operation that
2898 returns a truth value (0 or 1).
2900 FIXME: one would think we would fold the result, but it causes
2901 problems with the dominator optimizer. */
2903 invert_truthvalue (tree arg)
2905 tree type = TREE_TYPE (arg);
2906 enum tree_code code = TREE_CODE (arg);
2908 if (code == ERROR_MARK)
2911 /* If this is a comparison, we can simply invert it, except for
2912 floating-point non-equality comparisons, in which case we just
2913 enclose a TRUTH_NOT_EXPR around what we have. */
2915 if (TREE_CODE_CLASS (code) == tcc_comparison)
2917 tree op_type = TREE_TYPE (TREE_OPERAND (arg, 0));
2918 if (FLOAT_TYPE_P (op_type)
2919 && flag_trapping_math
2920 && code != ORDERED_EXPR && code != UNORDERED_EXPR
2921 && code != NE_EXPR && code != EQ_EXPR)
2922 return build1 (TRUTH_NOT_EXPR, type, arg);
2925 code = invert_tree_comparison (code,
2926 HONOR_NANS (TYPE_MODE (op_type)));
2927 if (code == ERROR_MARK)
2928 return build1 (TRUTH_NOT_EXPR, type, arg);
2930 return build2 (code, type,
2931 TREE_OPERAND (arg, 0), TREE_OPERAND (arg, 1));
2938 return constant_boolean_node (integer_zerop (arg), type);
2940 case TRUTH_AND_EXPR:
2941 return build2 (TRUTH_OR_EXPR, type,
2942 invert_truthvalue (TREE_OPERAND (arg, 0)),
2943 invert_truthvalue (TREE_OPERAND (arg, 1)));
2946 return build2 (TRUTH_AND_EXPR, type,
2947 invert_truthvalue (TREE_OPERAND (arg, 0)),
2948 invert_truthvalue (TREE_OPERAND (arg, 1)));
2950 case TRUTH_XOR_EXPR:
2951 /* Here we can invert either operand. We invert the first operand
2952 unless the second operand is a TRUTH_NOT_EXPR in which case our
2953 result is the XOR of the first operand with the inside of the
2954 negation of the second operand. */
2956 if (TREE_CODE (TREE_OPERAND (arg, 1)) == TRUTH_NOT_EXPR)
2957 return build2 (TRUTH_XOR_EXPR, type, TREE_OPERAND (arg, 0),
2958 TREE_OPERAND (TREE_OPERAND (arg, 1), 0));
2960 return build2 (TRUTH_XOR_EXPR, type,
2961 invert_truthvalue (TREE_OPERAND (arg, 0)),
2962 TREE_OPERAND (arg, 1));
2964 case TRUTH_ANDIF_EXPR:
2965 return build2 (TRUTH_ORIF_EXPR, type,
2966 invert_truthvalue (TREE_OPERAND (arg, 0)),
2967 invert_truthvalue (TREE_OPERAND (arg, 1)));
2969 case TRUTH_ORIF_EXPR:
2970 return build2 (TRUTH_ANDIF_EXPR, type,
2971 invert_truthvalue (TREE_OPERAND (arg, 0)),
2972 invert_truthvalue (TREE_OPERAND (arg, 1)));
2974 case TRUTH_NOT_EXPR:
2975 return TREE_OPERAND (arg, 0);
2978 return build3 (COND_EXPR, type, TREE_OPERAND (arg, 0),
2979 invert_truthvalue (TREE_OPERAND (arg, 1)),
2980 invert_truthvalue (TREE_OPERAND (arg, 2)));
2983 return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg, 0),
2984 invert_truthvalue (TREE_OPERAND (arg, 1)));
2986 case NON_LVALUE_EXPR:
2987 return invert_truthvalue (TREE_OPERAND (arg, 0));
2990 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2995 return build1 (TREE_CODE (arg), type,
2996 invert_truthvalue (TREE_OPERAND (arg, 0)));
2999 if (!integer_onep (TREE_OPERAND (arg, 1)))
3001 return build2 (EQ_EXPR, type, arg,
3002 fold_convert (type, integer_zero_node));
3005 return build1 (TRUTH_NOT_EXPR, type, arg);
3007 case CLEANUP_POINT_EXPR:
3008 return build1 (CLEANUP_POINT_EXPR, type,
3009 invert_truthvalue (TREE_OPERAND (arg, 0)));
3014 gcc_assert (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE);
3015 return build1 (TRUTH_NOT_EXPR, type, arg);
3018 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
3019 operands are another bit-wise operation with a common input. If so,
3020 distribute the bit operations to save an operation and possibly two if
3021 constants are involved. For example, convert
3022 (A | B) & (A | C) into A | (B & C)
3023 Further simplification will occur if B and C are constants.
3025 If this optimization cannot be done, 0 will be returned. */
3028 distribute_bit_expr (enum tree_code code, tree type, tree arg0, tree arg1)
3033 if (TREE_CODE (arg0) != TREE_CODE (arg1)
3034 || TREE_CODE (arg0) == code
3035 || (TREE_CODE (arg0) != BIT_AND_EXPR
3036 && TREE_CODE (arg0) != BIT_IOR_EXPR))
3039 if (operand_equal_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 0), 0))
3041 common = TREE_OPERAND (arg0, 0);
3042 left = TREE_OPERAND (arg0, 1);
3043 right = TREE_OPERAND (arg1, 1);
3045 else if (operand_equal_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 1), 0))
3047 common = TREE_OPERAND (arg0, 0);
3048 left = TREE_OPERAND (arg0, 1);
3049 right = TREE_OPERAND (arg1, 0);
3051 else if (operand_equal_p (TREE_OPERAND (arg0, 1), TREE_OPERAND (arg1, 0), 0))
3053 common = TREE_OPERAND (arg0, 1);
3054 left = TREE_OPERAND (arg0, 0);
3055 right = TREE_OPERAND (arg1, 1);
3057 else if (operand_equal_p (TREE_OPERAND (arg0, 1), TREE_OPERAND (arg1, 1), 0))
3059 common = TREE_OPERAND (arg0, 1);
3060 left = TREE_OPERAND (arg0, 0);
3061 right = TREE_OPERAND (arg1, 0);
3066 return fold (build2 (TREE_CODE (arg0), type, common,
3067 fold (build2 (code, type, left, right))));
3070 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3071 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero. */
3074 make_bit_field_ref (tree inner, tree type, int bitsize, int bitpos,
3081 tree size = TYPE_SIZE (TREE_TYPE (inner));
3082 if ((INTEGRAL_TYPE_P (TREE_TYPE (inner))
3083 || POINTER_TYPE_P (TREE_TYPE (inner)))
3084 && host_integerp (size, 0)
3085 && tree_low_cst (size, 0) == bitsize)
3086 return fold_convert (type, inner);
3089 result = build3 (BIT_FIELD_REF, type, inner,
3090 size_int (bitsize), bitsize_int (bitpos));
3092 BIT_FIELD_REF_UNSIGNED (result) = unsignedp;
3097 /* Optimize a bit-field compare.
3099 There are two cases: First is a compare against a constant and the
3100 second is a comparison of two items where the fields are at the same
3101 bit position relative to the start of a chunk (byte, halfword, word)
3102 large enough to contain it. In these cases we can avoid the shift
3103 implicit in bitfield extractions.
3105 For constants, we emit a compare of the shifted constant with the
3106 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3107 compared. For two fields at the same position, we do the ANDs with the
3108 similar mask and compare the result of the ANDs.
3110 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3111 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3112 are the left and right operands of the comparison, respectively.
3114 If the optimization described above can be done, we return the resulting
3115 tree. Otherwise we return zero. */
3118 optimize_bit_field_compare (enum tree_code code, tree compare_type,
3121 HOST_WIDE_INT lbitpos, lbitsize, rbitpos, rbitsize, nbitpos, nbitsize;
3122 tree type = TREE_TYPE (lhs);
3123 tree signed_type, unsigned_type;
3124 int const_p = TREE_CODE (rhs) == INTEGER_CST;
3125 enum machine_mode lmode, rmode, nmode;
3126 int lunsignedp, runsignedp;
3127 int lvolatilep = 0, rvolatilep = 0;
3128 tree linner, rinner = NULL_TREE;
3132 /* Get all the information about the extractions being done. If the bit size
3133 if the same as the size of the underlying object, we aren't doing an
3134 extraction at all and so can do nothing. We also don't want to
3135 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3136 then will no longer be able to replace it. */
3137 linner = get_inner_reference (lhs, &lbitsize, &lbitpos, &offset, &lmode,
3138 &lunsignedp, &lvolatilep, false);
3139 if (linner == lhs || lbitsize == GET_MODE_BITSIZE (lmode) || lbitsize < 0
3140 || offset != 0 || TREE_CODE (linner) == PLACEHOLDER_EXPR)
3145 /* If this is not a constant, we can only do something if bit positions,
3146 sizes, and signedness are the same. */
3147 rinner = get_inner_reference (rhs, &rbitsize, &rbitpos, &offset, &rmode,
3148 &runsignedp, &rvolatilep, false);
3150 if (rinner == rhs || lbitpos != rbitpos || lbitsize != rbitsize
3151 || lunsignedp != runsignedp || offset != 0
3152 || TREE_CODE (rinner) == PLACEHOLDER_EXPR)
3156 /* See if we can find a mode to refer to this field. We should be able to,
3157 but fail if we can't. */
3158 nmode = get_best_mode (lbitsize, lbitpos,
3159 const_p ? TYPE_ALIGN (TREE_TYPE (linner))
3160 : MIN (TYPE_ALIGN (TREE_TYPE (linner)),
3161 TYPE_ALIGN (TREE_TYPE (rinner))),
3162 word_mode, lvolatilep || rvolatilep);
3163 if (nmode == VOIDmode)
3166 /* Set signed and unsigned types of the precision of this mode for the
3168 signed_type = lang_hooks.types.type_for_mode (nmode, 0);
3169 unsigned_type = lang_hooks.types.type_for_mode (nmode, 1);
3171 /* Compute the bit position and size for the new reference and our offset
3172 within it. If the new reference is the same size as the original, we
3173 won't optimize anything, so return zero. */
3174 nbitsize = GET_MODE_BITSIZE (nmode);
3175 nbitpos = lbitpos & ~ (nbitsize - 1);
3177 if (nbitsize == lbitsize)
3180 if (BYTES_BIG_ENDIAN)
3181 lbitpos = nbitsize - lbitsize - lbitpos;
3183 /* Make the mask to be used against the extracted field. */
3184 mask = build_int_cst (unsigned_type, -1);
3185 mask = force_fit_type (mask, 0, false, false);
3186 mask = fold_convert (unsigned_type, mask);
3187 mask = const_binop (LSHIFT_EXPR, mask, size_int (nbitsize - lbitsize), 0);
3188 mask = const_binop (RSHIFT_EXPR, mask,
3189 size_int (nbitsize - lbitsize - lbitpos), 0);
3192 /* If not comparing with constant, just rework the comparison
3194 return build2 (code, compare_type,
3195 build2 (BIT_AND_EXPR, unsigned_type,
3196 make_bit_field_ref (linner, unsigned_type,
3197 nbitsize, nbitpos, 1),
3199 build2 (BIT_AND_EXPR, unsigned_type,
3200 make_bit_field_ref (rinner, unsigned_type,
3201 nbitsize, nbitpos, 1),
3204 /* Otherwise, we are handling the constant case. See if the constant is too
3205 big for the field. Warn and return a tree of for 0 (false) if so. We do
3206 this not only for its own sake, but to avoid having to test for this
3207 error case below. If we didn't, we might generate wrong code.
3209 For unsigned fields, the constant shifted right by the field length should
3210 be all zero. For signed fields, the high-order bits should agree with
3215 if (! integer_zerop (const_binop (RSHIFT_EXPR,
3216 fold_convert (unsigned_type, rhs),
3217 size_int (lbitsize), 0)))
3219 warning ("comparison is always %d due to width of bit-field",
3221 return constant_boolean_node (code == NE_EXPR, compare_type);
3226 tree tem = const_binop (RSHIFT_EXPR, fold_convert (signed_type, rhs),
3227 size_int (lbitsize - 1), 0);
3228 if (! integer_zerop (tem) && ! integer_all_onesp (tem))
3230 warning ("comparison is always %d due to width of bit-field",
3232 return constant_boolean_node (code == NE_EXPR, compare_type);
3236 /* Single-bit compares should always be against zero. */
3237 if (lbitsize == 1 && ! integer_zerop (rhs))
3239 code = code == EQ_EXPR ? NE_EXPR : EQ_EXPR;
3240 rhs = fold_convert (type, integer_zero_node);
3243 /* Make a new bitfield reference, shift the constant over the
3244 appropriate number of bits and mask it with the computed mask
3245 (in case this was a signed field). If we changed it, make a new one. */
3246 lhs = make_bit_field_ref (linner, unsigned_type, nbitsize, nbitpos, 1);
3249 TREE_SIDE_EFFECTS (lhs) = 1;
3250 TREE_THIS_VOLATILE (lhs) = 1;
3253 rhs = fold (const_binop (BIT_AND_EXPR,
3254 const_binop (LSHIFT_EXPR,
3255 fold_convert (unsigned_type, rhs),
3256 size_int (lbitpos), 0),
3259 return build2 (code, compare_type,
3260 build2 (BIT_AND_EXPR, unsigned_type, lhs, mask),
3264 /* Subroutine for fold_truthop: decode a field reference.
3266 If EXP is a comparison reference, we return the innermost reference.
3268 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
3269 set to the starting bit number.
3271 If the innermost field can be completely contained in a mode-sized
3272 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
3274 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
3275 otherwise it is not changed.
3277 *PUNSIGNEDP is set to the signedness of the field.
3279 *PMASK is set to the mask used. This is either contained in a
3280 BIT_AND_EXPR or derived from the width of the field.
3282 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
3284 Return 0 if this is not a component reference or is one that we can't
3285 do anything with. */
3288 decode_field_reference (tree exp, HOST_WIDE_INT *pbitsize,
3289 HOST_WIDE_INT *pbitpos, enum machine_mode *pmode,
3290 int *punsignedp, int *pvolatilep,
3291 tree *pmask, tree *pand_mask)
3293 tree outer_type = 0;
3295 tree mask, inner, offset;
3297 unsigned int precision;
3299 /* All the optimizations using this function assume integer fields.
3300 There are problems with FP fields since the type_for_size call
3301 below can fail for, e.g., XFmode. */
3302 if (! INTEGRAL_TYPE_P (TREE_TYPE (exp)))
3305 /* We are interested in the bare arrangement of bits, so strip everything
3306 that doesn't affect the machine mode. However, record the type of the
3307 outermost expression if it may matter below. */
3308 if (TREE_CODE (exp) == NOP_EXPR
3309 || TREE_CODE (exp) == CONVERT_EXPR
3310 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3311 outer_type = TREE_TYPE (exp);
3314 if (TREE_CODE (exp) == BIT_AND_EXPR)
3316 and_mask = TREE_OPERAND (exp, 1);
3317 exp = TREE_OPERAND (exp, 0);
3318 STRIP_NOPS (exp); STRIP_NOPS (and_mask);
3319 if (TREE_CODE (and_mask) != INTEGER_CST)
3323 inner = get_inner_reference (exp, pbitsize, pbitpos, &offset, pmode,
3324 punsignedp, pvolatilep, false);
3325 if ((inner == exp && and_mask == 0)
3326 || *pbitsize < 0 || offset != 0
3327 || TREE_CODE (inner) == PLACEHOLDER_EXPR)
3330 /* If the number of bits in the reference is the same as the bitsize of
3331 the outer type, then the outer type gives the signedness. Otherwise
3332 (in case of a small bitfield) the signedness is unchanged. */
3333 if (outer_type && *pbitsize == TYPE_PRECISION (outer_type))
3334 *punsignedp = TYPE_UNSIGNED (outer_type);
3336 /* Compute the mask to access the bitfield. */
3337 unsigned_type = lang_hooks.types.type_for_size (*pbitsize, 1);
3338 precision = TYPE_PRECISION (unsigned_type);
3340 mask = build_int_cst (unsigned_type, -1);
3341 mask = force_fit_type (mask, 0, false, false);
3343 mask = const_binop (LSHIFT_EXPR, mask, size_int (precision - *pbitsize), 0);
3344 mask = const_binop (RSHIFT_EXPR, mask, size_int (precision - *pbitsize), 0);
3346 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
3348 mask = fold (build2 (BIT_AND_EXPR, unsigned_type,
3349 fold_convert (unsigned_type, and_mask), mask));
3352 *pand_mask = and_mask;
3356 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
3360 all_ones_mask_p (tree mask, int size)
3362 tree type = TREE_TYPE (mask);
3363 unsigned int precision = TYPE_PRECISION (type);
3366 tmask = build_int_cst (lang_hooks.types.signed_type (type), -1);
3367 tmask = force_fit_type (tmask, 0, false, false);
3370 tree_int_cst_equal (mask,
3371 const_binop (RSHIFT_EXPR,
3372 const_binop (LSHIFT_EXPR, tmask,
3373 size_int (precision - size),
3375 size_int (precision - size), 0));
3378 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
3379 represents the sign bit of EXP's type. If EXP represents a sign
3380 or zero extension, also test VAL against the unextended type.
3381 The return value is the (sub)expression whose sign bit is VAL,
3382 or NULL_TREE otherwise. */
3385 sign_bit_p (tree exp, tree val)
3387 unsigned HOST_WIDE_INT mask_lo, lo;
3388 HOST_WIDE_INT mask_hi, hi;
3392 /* Tree EXP must have an integral type. */
3393 t = TREE_TYPE (exp);
3394 if (! INTEGRAL_TYPE_P (t))
3397 /* Tree VAL must be an integer constant. */
3398 if (TREE_CODE (val) != INTEGER_CST
3399 || TREE_CONSTANT_OVERFLOW (val))
3402 width = TYPE_PRECISION (t);
3403 if (width > HOST_BITS_PER_WIDE_INT)
3405 hi = (unsigned HOST_WIDE_INT) 1 << (width - HOST_BITS_PER_WIDE_INT - 1);
3408 mask_hi = ((unsigned HOST_WIDE_INT) -1
3409 >> (2 * HOST_BITS_PER_WIDE_INT - width));
3415 lo = (unsigned HOST_WIDE_INT) 1 << (width - 1);
3418 mask_lo = ((unsigned HOST_WIDE_INT) -1
3419 >> (HOST_BITS_PER_WIDE_INT - width));
3422 /* We mask off those bits beyond TREE_TYPE (exp) so that we can
3423 treat VAL as if it were unsigned. */
3424 if ((TREE_INT_CST_HIGH (val) & mask_hi) == hi
3425 && (TREE_INT_CST_LOW (val) & mask_lo) == lo)
3428 /* Handle extension from a narrower type. */
3429 if (TREE_CODE (exp) == NOP_EXPR
3430 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))) < width)
3431 return sign_bit_p (TREE_OPERAND (exp, 0), val);
3436 /* Subroutine for fold_truthop: determine if an operand is simple enough
3437 to be evaluated unconditionally. */
3440 simple_operand_p (tree exp)
3442 /* Strip any conversions that don't change the machine mode. */
3445 return (CONSTANT_CLASS_P (exp)
3446 || TREE_CODE (exp) == SSA_NAME
3448 && ! TREE_ADDRESSABLE (exp)
3449 && ! TREE_THIS_VOLATILE (exp)
3450 && ! DECL_NONLOCAL (exp)
3451 /* Don't regard global variables as simple. They may be
3452 allocated in ways unknown to the compiler (shared memory,
3453 #pragma weak, etc). */
3454 && ! TREE_PUBLIC (exp)
3455 && ! DECL_EXTERNAL (exp)
3456 /* Loading a static variable is unduly expensive, but global
3457 registers aren't expensive. */
3458 && (! TREE_STATIC (exp) || DECL_REGISTER (exp))));
3461 /* The following functions are subroutines to fold_range_test and allow it to
3462 try to change a logical combination of comparisons into a range test.
3465 X == 2 || X == 3 || X == 4 || X == 5
3469 (unsigned) (X - 2) <= 3
3471 We describe each set of comparisons as being either inside or outside
3472 a range, using a variable named like IN_P, and then describe the
3473 range with a lower and upper bound. If one of the bounds is omitted,
3474 it represents either the highest or lowest value of the type.
3476 In the comments below, we represent a range by two numbers in brackets
3477 preceded by a "+" to designate being inside that range, or a "-" to
3478 designate being outside that range, so the condition can be inverted by
3479 flipping the prefix. An omitted bound is represented by a "-". For
3480 example, "- [-, 10]" means being outside the range starting at the lowest
3481 possible value and ending at 10, in other words, being greater than 10.
3482 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
3485 We set up things so that the missing bounds are handled in a consistent
3486 manner so neither a missing bound nor "true" and "false" need to be
3487 handled using a special case. */
3489 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
3490 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
3491 and UPPER1_P are nonzero if the respective argument is an upper bound
3492 and zero for a lower. TYPE, if nonzero, is the type of the result; it
3493 must be specified for a comparison. ARG1 will be converted to ARG0's
3494 type if both are specified. */
3497 range_binop (enum tree_code code, tree type, tree arg0, int upper0_p,
3498 tree arg1, int upper1_p)
3504 /* If neither arg represents infinity, do the normal operation.
3505 Else, if not a comparison, return infinity. Else handle the special
3506 comparison rules. Note that most of the cases below won't occur, but
3507 are handled for consistency. */
3509 if (arg0 != 0 && arg1 != 0)
3511 tem = fold (build2 (code, type != 0 ? type : TREE_TYPE (arg0),
3512 arg0, fold_convert (TREE_TYPE (arg0), arg1)));
3514 return TREE_CODE (tem) == INTEGER_CST ? tem : 0;
3517 if (TREE_CODE_CLASS (code) != tcc_comparison)
3520 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
3521 for neither. In real maths, we cannot assume open ended ranges are
3522 the same. But, this is computer arithmetic, where numbers are finite.
3523 We can therefore make the transformation of any unbounded range with
3524 the value Z, Z being greater than any representable number. This permits
3525 us to treat unbounded ranges as equal. */
3526 sgn0 = arg0 != 0 ? 0 : (upper0_p ? 1 : -1);
3527 sgn1 = arg1 != 0 ? 0 : (upper1_p ? 1 : -1);
3531 result = sgn0 == sgn1;
3534 result = sgn0 != sgn1;
3537 result = sgn0 < sgn1;
3540 result = sgn0 <= sgn1;
3543 result = sgn0 > sgn1;
3546 result = sgn0 >= sgn1;
3552 return constant_boolean_node (result, type);
3555 /* Given EXP, a logical expression, set the range it is testing into
3556 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
3557 actually being tested. *PLOW and *PHIGH will be made of the same type
3558 as the returned expression. If EXP is not a comparison, we will most
3559 likely not be returning a useful value and range. */
3562 make_range (tree exp, int *pin_p, tree *plow, tree *phigh)
3564 enum tree_code code;
3565 tree arg0 = NULL_TREE, arg1 = NULL_TREE;
3566 tree exp_type = NULL_TREE, arg0_type = NULL_TREE;
3568 tree low, high, n_low, n_high;
3570 /* Start with simply saying "EXP != 0" and then look at the code of EXP
3571 and see if we can refine the range. Some of the cases below may not
3572 happen, but it doesn't seem worth worrying about this. We "continue"
3573 the outer loop when we've changed something; otherwise we "break"
3574 the switch, which will "break" the while. */
3577 low = high = fold_convert (TREE_TYPE (exp), integer_zero_node);
3581 code = TREE_CODE (exp);
3582 exp_type = TREE_TYPE (exp);
3584 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
3586 if (TREE_CODE_LENGTH (code) > 0)
3587 arg0 = TREE_OPERAND (exp, 0);
3588 if (TREE_CODE_CLASS (code) == tcc_comparison
3589 || TREE_CODE_CLASS (code) == tcc_unary
3590 || TREE_CODE_CLASS (code) == tcc_binary)
3591 arg0_type = TREE_TYPE (arg0);
3592 if (TREE_CODE_CLASS (code) == tcc_binary
3593 || TREE_CODE_CLASS (code) == tcc_comparison
3594 || (TREE_CODE_CLASS (code) == tcc_expression
3595 && TREE_CODE_LENGTH (code) > 1))
3596 arg1 = TREE_OPERAND (exp, 1);
3601 case TRUTH_NOT_EXPR:
3602 in_p = ! in_p, exp = arg0;
3605 case EQ_EXPR: case NE_EXPR:
3606 case LT_EXPR: case LE_EXPR: case GE_EXPR: case GT_EXPR:
3607 /* We can only do something if the range is testing for zero
3608 and if the second operand is an integer constant. Note that
3609 saying something is "in" the range we make is done by
3610 complementing IN_P since it will set in the initial case of
3611 being not equal to zero; "out" is leaving it alone. */
3612 if (low == 0 || high == 0
3613 || ! integer_zerop (low) || ! integer_zerop (high)
3614 || TREE_CODE (arg1) != INTEGER_CST)
3619 case NE_EXPR: /* - [c, c] */
3622 case EQ_EXPR: /* + [c, c] */
3623 in_p = ! in_p, low = high = arg1;
3625 case GT_EXPR: /* - [-, c] */
3626 low = 0, high = arg1;
3628 case GE_EXPR: /* + [c, -] */
3629 in_p = ! in_p, low = arg1, high = 0;
3631 case LT_EXPR: /* - [c, -] */
3632 low = arg1, high = 0;
3634 case LE_EXPR: /* + [-, c] */
3635 in_p = ! in_p, low = 0, high = arg1;
3641 /* If this is an unsigned comparison, we also know that EXP is
3642 greater than or equal to zero. We base the range tests we make
3643 on that fact, so we record it here so we can parse existing
3644 range tests. We test arg0_type since often the return type
3645 of, e.g. EQ_EXPR, is boolean. */
3646 if (TYPE_UNSIGNED (arg0_type) && (low == 0 || high == 0))
3648 if (! merge_ranges (&n_in_p, &n_low, &n_high,
3650 fold_convert (arg0_type, integer_zero_node),
3654 in_p = n_in_p, low = n_low, high = n_high;
3656 /* If the high bound is missing, but we have a nonzero low
3657 bound, reverse the range so it goes from zero to the low bound
3659 if (high == 0 && low && ! integer_zerop (low))
3662 high = range_binop (MINUS_EXPR, NULL_TREE, low, 0,
3663 integer_one_node, 0);
3664 low = fold_convert (arg0_type, integer_zero_node);
3672 /* (-x) IN [a,b] -> x in [-b, -a] */
3673 n_low = range_binop (MINUS_EXPR, exp_type,
3674 fold_convert (exp_type, integer_zero_node),
3676 n_high = range_binop (MINUS_EXPR, exp_type,
3677 fold_convert (exp_type, integer_zero_node),
3679 low = n_low, high = n_high;
3685 exp = build2 (MINUS_EXPR, exp_type, negate_expr (arg0),
3686 fold_convert (exp_type, integer_one_node));
3689 case PLUS_EXPR: case MINUS_EXPR:
3690 if (TREE_CODE (arg1) != INTEGER_CST)
3693 /* If EXP is signed, any overflow in the computation is undefined,
3694 so we don't worry about it so long as our computations on
3695 the bounds don't overflow. For unsigned, overflow is defined
3696 and this is exactly the right thing. */
3697 n_low = range_binop (code == MINUS_EXPR ? PLUS_EXPR : MINUS_EXPR,
3698 arg0_type, low, 0, arg1, 0);
3699 n_high = range_binop (code == MINUS_EXPR ? PLUS_EXPR : MINUS_EXPR,
3700 arg0_type, high, 1, arg1, 0);
3701 if ((n_low != 0 && TREE_OVERFLOW (n_low))
3702 || (n_high != 0 && TREE_OVERFLOW (n_high)))
3705 /* Check for an unsigned range which has wrapped around the maximum
3706 value thus making n_high < n_low, and normalize it. */
3707 if (n_low && n_high && tree_int_cst_lt (n_high, n_low))
3709 low = range_binop (PLUS_EXPR, arg0_type, n_high, 0,
3710 integer_one_node, 0);
3711 high = range_binop (MINUS_EXPR, arg0_type, n_low, 0,
3712 integer_one_node, 0);
3714 /* If the range is of the form +/- [ x+1, x ], we won't
3715 be able to normalize it. But then, it represents the
3716 whole range or the empty set, so make it
3718 if (tree_int_cst_equal (n_low, low)
3719 && tree_int_cst_equal (n_high, high))
3725 low = n_low, high = n_high;
3730 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
3731 if (TYPE_PRECISION (arg0_type) > TYPE_PRECISION (exp_type))
3734 if (! INTEGRAL_TYPE_P (arg0_type)
3735 || (low != 0 && ! int_fits_type_p (low, arg0_type))
3736 || (high != 0 && ! int_fits_type_p (high, arg0_type)))
3739 n_low = low, n_high = high;
3742 n_low = fold_convert (arg0_type, n_low);
3745 n_high = fold_convert (arg0_type, n_high);
3748 /* If we're converting arg0 from an unsigned type, to exp,
3749 a signed type, we will be doing the comparison as unsigned.
3750 The tests above have already verified that LOW and HIGH
3753 So we have to ensure that we will handle large unsigned
3754 values the same way that the current signed bounds treat
3757 if (!TYPE_UNSIGNED (exp_type) && TYPE_UNSIGNED (arg0_type))
3760 tree equiv_type = lang_hooks.types.type_for_mode
3761 (TYPE_MODE (arg0_type), 1);
3763 /* A range without an upper bound is, naturally, unbounded.
3764 Since convert would have cropped a very large value, use
3765 the max value for the destination type. */
3767 = TYPE_MAX_VALUE (equiv_type) ? TYPE_MAX_VALUE (equiv_type)
3768 : TYPE_MAX_VALUE (arg0_type);
3770 if (TYPE_PRECISION (exp_type) == TYPE_PRECISION (arg0_type))
3771 high_positive = fold (build2 (RSHIFT_EXPR, arg0_type,
3772 fold_convert (arg0_type,
3774 fold_convert (arg0_type,
3775 integer_one_node)));
3777 /* If the low bound is specified, "and" the range with the
3778 range for which the original unsigned value will be
3782 if (! merge_ranges (&n_in_p, &n_low, &n_high,
3783 1, n_low, n_high, 1,
3784 fold_convert (arg0_type,
3789 in_p = (n_in_p == in_p);
3793 /* Otherwise, "or" the range with the range of the input
3794 that will be interpreted as negative. */
3795 if (! merge_ranges (&n_in_p, &n_low, &n_high,
3796 0, n_low, n_high, 1,
3797 fold_convert (arg0_type,
3802 in_p = (in_p != n_in_p);
3807 low = n_low, high = n_high;
3817 /* If EXP is a constant, we can evaluate whether this is true or false. */
3818 if (TREE_CODE (exp) == INTEGER_CST)
3820 in_p = in_p == (integer_onep (range_binop (GE_EXPR, integer_type_node,
3822 && integer_onep (range_binop (LE_EXPR, integer_type_node,
3828 *pin_p = in_p, *plow = low, *phigh = high;
3832 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
3833 type, TYPE, return an expression to test if EXP is in (or out of, depending
3834 on IN_P) the range. Return 0 if the test couldn't be created. */
3837 build_range_check (tree type, tree exp, int in_p, tree low, tree high)
3839 tree etype = TREE_TYPE (exp);
3844 value = build_range_check (type, exp, 1, low, high);
3846 return invert_truthvalue (value);
3851 if (low == 0 && high == 0)
3852 return fold_convert (type, integer_one_node);
3855 return fold (build2 (LE_EXPR, type, exp, high));
3858 return fold (build2 (GE_EXPR, type, exp, low));
3860 if (operand_equal_p (low, high, 0))
3861 return fold (build2 (EQ_EXPR, type, exp, low));
3863 if (integer_zerop (low))
3865 if (! TYPE_UNSIGNED (etype))
3867 etype = lang_hooks.types.unsigned_type (etype);
3868 high = fold_convert (etype, high);
3869 exp = fold_convert (etype, exp);
3871 return build_range_check (type, exp, 1, 0, high);
3874 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
3875 if (integer_onep (low) && TREE_CODE (high) == INTEGER_CST)
3877 unsigned HOST_WIDE_INT lo;
3881 prec = TYPE_PRECISION (etype);
3882 if (prec <= HOST_BITS_PER_WIDE_INT)
3885 lo = ((unsigned HOST_WIDE_INT) 1 << (prec - 1)) - 1;
3889 hi = ((HOST_WIDE_INT) 1 << (prec - HOST_BITS_PER_WIDE_INT - 1)) - 1;
3890 lo = (unsigned HOST_WIDE_INT) -1;
3893 if (TREE_INT_CST_HIGH (high) == hi && TREE_INT_CST_LOW (high) == lo)
3895 if (TYPE_UNSIGNED (etype))
3897 etype = lang_hooks.types.signed_type (etype);
3898 exp = fold_convert (etype, exp);
3900 return fold (build2 (GT_EXPR, type, exp,
3901 fold_convert (etype, integer_zero_node)));
3905 value = const_binop (MINUS_EXPR, high, low, 0);
3906 if (value != 0 && TREE_OVERFLOW (value) && ! TYPE_UNSIGNED (etype))
3908 tree utype, minv, maxv;
3910 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
3911 for the type in question, as we rely on this here. */
3912 switch (TREE_CODE (etype))
3917 utype = lang_hooks.types.unsigned_type (etype);
3918 maxv = fold_convert (utype, TYPE_MAX_VALUE (etype));
3919 maxv = range_binop (PLUS_EXPR, NULL_TREE, maxv, 1,
3920 integer_one_node, 1);
3921 minv = fold_convert (utype, TYPE_MIN_VALUE (etype));
3922 if (integer_zerop (range_binop (NE_EXPR, integer_type_node,
3926 high = fold_convert (etype, high);
3927 low = fold_convert (etype, low);
3928 exp = fold_convert (etype, exp);
3929 value = const_binop (MINUS_EXPR, high, low, 0);
3937 if (value != 0 && ! TREE_OVERFLOW (value))
3938 return build_range_check (type,
3939 fold (build2 (MINUS_EXPR, etype, exp, low)),
3940 1, fold_convert (etype, integer_zero_node),
3946 /* Given two ranges, see if we can merge them into one. Return 1 if we
3947 can, 0 if we can't. Set the output range into the specified parameters. */
3950 merge_ranges (int *pin_p, tree *plow, tree *phigh, int in0_p, tree low0,
3951 tree high0, int in1_p, tree low1, tree high1)
3959 int lowequal = ((low0 == 0 && low1 == 0)
3960 || integer_onep (range_binop (EQ_EXPR, integer_type_node,
3961 low0, 0, low1, 0)));
3962 int highequal = ((high0 == 0 && high1 == 0)
3963 || integer_onep (range_binop (EQ_EXPR, integer_type_node,
3964 high0, 1, high1, 1)));
3966 /* Make range 0 be the range that starts first, or ends last if they
3967 start at the same value. Swap them if it isn't. */
3968 if (integer_onep (range_binop (GT_EXPR, integer_type_node,
3971 && integer_onep (range_binop (GT_EXPR, integer_type_node,
3972 high1, 1, high0, 1))))
3974 temp = in0_p, in0_p = in1_p, in1_p = temp;
3975 tem = low0, low0 = low1, low1 = tem;
3976 tem = high0, high0 = high1, high1 = tem;
3979 /* Now flag two cases, whether the ranges are disjoint or whether the
3980 second range is totally subsumed in the first. Note that the tests
3981 below are simplified by the ones above. */
3982 no_overlap = integer_onep (range_binop (LT_EXPR, integer_type_node,
3983 high0, 1, low1, 0));
3984 subset = integer_onep (range_binop (LE_EXPR, integer_type_node,
3985 high1, 1, high0, 1));
3987 /* We now have four cases, depending on whether we are including or
3988 excluding the two ranges. */
3991 /* If they don't overlap, the result is false. If the second range
3992 is a subset it is the result. Otherwise, the range is from the start
3993 of the second to the end of the first. */
3995 in_p = 0, low = high = 0;
3997 in_p = 1, low = low1, high = high1;
3999 in_p = 1, low = low1, high = high0;
4002 else if (in0_p && ! in1_p)
4004 /* If they don't overlap, the result is the first range. If they are
4005 equal, the result is false. If the second range is a subset of the
4006 first, and the ranges begin at the same place, we go from just after
4007 the end of the first range to the end of the second. If the second
4008 range is not a subset of the first, or if it is a subset and both
4009 ranges end at the same place, the range starts at the start of the
4010 first range and ends just before the second range.
4011 Otherwise, we can't describe this as a single range. */
4013 in_p = 1, low = low0, high = high0;
4014 else if (lowequal && highequal)
4015 in_p = 0, low = high = 0;
4016 else if (subset && lowequal)
4018 in_p = 1, high = high0;
4019 low = range_binop (PLUS_EXPR, NULL_TREE, high1, 0,
4020 integer_one_node, 0);
4022 else if (! subset || highequal)
4024 in_p = 1, low = low0;
4025 high = range_binop (MINUS_EXPR, NULL_TREE, low1, 0,
4026 integer_one_node, 0);
4032 else if (! in0_p && in1_p)
4034 /* If they don't overlap, the result is the second range. If the second
4035 is a subset of the first, the result is false. Otherwise,
4036 the range starts just after the first range and ends at the
4037 end of the second. */
4039 in_p = 1, low = low1, high = high1;
4040 else if (subset || highequal)
4041 in_p = 0, low = high = 0;
4044 in_p = 1, high = high1;
4045 low = range_binop (PLUS_EXPR, NULL_TREE, high0, 1,
4046 integer_one_node, 0);
4052 /* The case where we are excluding both ranges. Here the complex case
4053 is if they don't overlap. In that case, the only time we have a
4054 range is if they are adjacent. If the second is a subset of the
4055 first, the result is the first. Otherwise, the range to exclude
4056 starts at the beginning of the first range and ends at the end of the
4060 if (integer_onep (range_binop (EQ_EXPR, integer_type_node,
4061 range_binop (PLUS_EXPR, NULL_TREE,
4063 integer_one_node, 1),
4065 in_p = 0, low = low0, high = high1;
4068 /* Canonicalize - [min, x] into - [-, x]. */
4069 if (low0 && TREE_CODE (low0) == INTEGER_CST)
4070 switch (TREE_CODE (TREE_TYPE (low0)))
4073 if (TYPE_PRECISION (TREE_TYPE (low0))
4074 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (low0))))
4079 if (tree_int_cst_equal (low0,
4080 TYPE_MIN_VALUE (TREE_TYPE (low0))))
4084 if (TYPE_UNSIGNED (TREE_TYPE (low0))
4085 && integer_zerop (low0))
4092 /* Canonicalize - [x, max] into - [x, -]. */
4093 if (high1 && TREE_CODE (high1) == INTEGER_CST)
4094 switch (TREE_CODE (TREE_TYPE (high1)))
4097 if (TYPE_PRECISION (TREE_TYPE (high1))
4098 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (high1))))
4103 if (tree_int_cst_equal (high1,
4104 TYPE_MAX_VALUE (TREE_TYPE (high1))))
4108 if (TYPE_UNSIGNED (TREE_TYPE (high1))
4109 && integer_zerop (range_binop (PLUS_EXPR, NULL_TREE,
4111 integer_one_node, 1)))
4118 /* The ranges might be also adjacent between the maximum and
4119 minimum values of the given type. For
4120 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
4121 return + [x + 1, y - 1]. */
4122 if (low0 == 0 && high1 == 0)
4124 low = range_binop (PLUS_EXPR, NULL_TREE, high0, 1,
4125 integer_one_node, 1);
4126 high = range_binop (MINUS_EXPR, NULL_TREE, low1, 0,
4127 integer_one_node, 0);
4128 if (low == 0 || high == 0)
4138 in_p = 0, low = low0, high = high0;
4140 in_p = 0, low = low0, high = high1;
4143 *pin_p = in_p, *plow = low, *phigh = high;
4148 /* Subroutine of fold, looking inside expressions of the form
4149 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
4150 of the COND_EXPR. This function is being used also to optimize
4151 A op B ? C : A, by reversing the comparison first.
4153 Return a folded expression whose code is not a COND_EXPR
4154 anymore, or NULL_TREE if no folding opportunity is found. */
4157 fold_cond_expr_with_comparison (tree type, tree arg0, tree arg1, tree arg2)
4159 enum tree_code comp_code = TREE_CODE (arg0);
4160 tree arg00 = TREE_OPERAND (arg0, 0);
4161 tree arg01 = TREE_OPERAND (arg0, 1);
4162 tree arg1_type = TREE_TYPE (arg1);
4168 /* If we have A op 0 ? A : -A, consider applying the following
4171 A == 0? A : -A same as -A
4172 A != 0? A : -A same as A
4173 A >= 0? A : -A same as abs (A)
4174 A > 0? A : -A same as abs (A)
4175 A <= 0? A : -A same as -abs (A)
4176 A < 0? A : -A same as -abs (A)
4178 None of these transformations work for modes with signed
4179 zeros. If A is +/-0, the first two transformations will
4180 change the sign of the result (from +0 to -0, or vice
4181 versa). The last four will fix the sign of the result,
4182 even though the original expressions could be positive or
4183 negative, depending on the sign of A.
4185 Note that all these transformations are correct if A is
4186 NaN, since the two alternatives (A and -A) are also NaNs. */
4187 if ((FLOAT_TYPE_P (TREE_TYPE (arg01))
4188 ? real_zerop (arg01)
4189 : integer_zerop (arg01))
4190 && TREE_CODE (arg2) == NEGATE_EXPR
4191 && operand_equal_p (TREE_OPERAND (arg2, 0), arg1, 0))
4196 tem = fold_convert (arg1_type, arg1);
4197 return pedantic_non_lvalue (fold_convert (type, negate_expr (tem)));
4200 return pedantic_non_lvalue (fold_convert (type, arg1));
4203 if (flag_trapping_math)
4208 if (TYPE_UNSIGNED (TREE_TYPE (arg1)))
4209 arg1 = fold_convert (lang_hooks.types.signed_type
4210 (TREE_TYPE (arg1)), arg1);
4211 tem = fold (build1 (ABS_EXPR, TREE_TYPE (arg1), arg1));
4212 return pedantic_non_lvalue (fold_convert (type, tem));
4215 if (flag_trapping_math)
4219 if (TYPE_UNSIGNED (TREE_TYPE (arg1)))
4220 arg1 = fold_convert (lang_hooks.types.signed_type
4221 (TREE_TYPE (arg1)), arg1);
4222 tem = fold (build1 (ABS_EXPR, TREE_TYPE (arg1), arg1));
4223 return negate_expr (fold_convert (type, tem));
4225 gcc_assert (TREE_CODE_CLASS (comp_code) == tcc_comparison);
4229 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
4230 A == 0 ? A : 0 is always 0 unless A is -0. Note that
4231 both transformations are correct when A is NaN: A != 0
4232 is then true, and A == 0 is false. */
4234 if (integer_zerop (arg01) && integer_zerop (arg2))
4236 if (comp_code == NE_EXPR)
4237 return pedantic_non_lvalue (fold_convert (type, arg1));
4238 else if (comp_code == EQ_EXPR)
4239 return fold_convert (type, integer_zero_node);
4242 /* Try some transformations of A op B ? A : B.
4244 A == B? A : B same as B
4245 A != B? A : B same as A
4246 A >= B? A : B same as max (A, B)
4247 A > B? A : B same as max (B, A)
4248 A <= B? A : B same as min (A, B)
4249 A < B? A : B same as min (B, A)
4251 As above, these transformations don't work in the presence
4252 of signed zeros. For example, if A and B are zeros of
4253 opposite sign, the first two transformations will change
4254 the sign of the result. In the last four, the original
4255 expressions give different results for (A=+0, B=-0) and
4256 (A=-0, B=+0), but the transformed expressions do not.
4258 The first two transformations are correct if either A or B
4259 is a NaN. In the first transformation, the condition will
4260 be false, and B will indeed be chosen. In the case of the
4261 second transformation, the condition A != B will be true,
4262 and A will be chosen.
4264 The conversions to max() and min() are not correct if B is
4265 a number and A is not. The conditions in the original
4266 expressions will be false, so all four give B. The min()
4267 and max() versions would give a NaN instead. */
4268 if (operand_equal_for_comparison_p (arg01, arg2, arg00))
4270 tree comp_op0 = arg00;
4271 tree comp_op1 = arg01;
4272 tree comp_type = TREE_TYPE (comp_op0);
4274 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
4275 if (TYPE_MAIN_VARIANT (comp_type) == TYPE_MAIN_VARIANT (type))
4285 return pedantic_non_lvalue (fold_convert (type, arg2));
4287 return pedantic_non_lvalue (fold_convert (type, arg1));
4292 /* In C++ a ?: expression can be an lvalue, so put the
4293 operand which will be used if they are equal first
4294 so that we can convert this back to the
4295 corresponding COND_EXPR. */
4296 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
4298 comp_op0 = fold_convert (comp_type, comp_op0);
4299 comp_op1 = fold_convert (comp_type, comp_op1);
4300 tem = (comp_code == LE_EXPR || comp_code == UNLE_EXPR)
4301 ? fold (build2 (MIN_EXPR, comp_type, comp_op0, comp_op1))
4302 : fold (build2 (MIN_EXPR, comp_type, comp_op1, comp_op0));
4303 return pedantic_non_lvalue (fold_convert (type, tem));
4310 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
4312 comp_op0 = fold_convert (comp_type, comp_op0);
4313 comp_op1 = fold_convert (comp_type, comp_op1);
4314 tem = (comp_code == GE_EXPR || comp_code == UNGE_EXPR)
4315 ? fold (build2 (MAX_EXPR, comp_type, comp_op0, comp_op1))
4316 : fold (build2 (MAX_EXPR, comp_type, comp_op1, comp_op0));
4317 return pedantic_non_lvalue (fold_convert (type, tem));
4321 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
4322 return pedantic_non_lvalue (fold_convert (type, arg2));
4325 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg1))))
4326 return pedantic_non_lvalue (fold_convert (type, arg1));
4329 gcc_assert (TREE_CODE_CLASS (comp_code) == tcc_comparison);
4334 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
4335 we might still be able to simplify this. For example,
4336 if C1 is one less or one more than C2, this might have started
4337 out as a MIN or MAX and been transformed by this function.
4338 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
4340 if (INTEGRAL_TYPE_P (type)
4341 && TREE_CODE (arg01) == INTEGER_CST
4342 && TREE_CODE (arg2) == INTEGER_CST)
4346 /* We can replace A with C1 in this case. */
4347 arg1 = fold_convert (type, arg01);
4348 return fold (build3 (COND_EXPR, type, arg0, arg1, arg2));
4351 /* If C1 is C2 + 1, this is min(A, C2). */
4352 if (! operand_equal_p (arg2, TYPE_MAX_VALUE (type),
4354 && operand_equal_p (arg01,
4355 const_binop (PLUS_EXPR, arg2,
4356 integer_one_node, 0),
4358 return pedantic_non_lvalue (fold (build2 (MIN_EXPR,
4359 type, arg1, arg2)));
4363 /* If C1 is C2 - 1, this is min(A, C2). */
4364 if (! operand_equal_p (arg2, TYPE_MIN_VALUE (type),
4366 && operand_equal_p (arg01,
4367 const_binop (MINUS_EXPR, arg2,
4368 integer_one_node, 0),
4370 return pedantic_non_lvalue (fold (build2 (MIN_EXPR,
4371 type, arg1, arg2)));
4375 /* If C1 is C2 - 1, this is max(A, C2). */
4376 if (! operand_equal_p (arg2, TYPE_MIN_VALUE (type),
4378 && operand_equal_p (arg01,
4379 const_binop (MINUS_EXPR, arg2,
4380 integer_one_node, 0),
4382 return pedantic_non_lvalue (fold (build2 (MAX_EXPR,
4383 type, arg1, arg2)));
4387 /* If C1 is C2 + 1, this is max(A, C2). */
4388 if (! operand_equal_p (arg2, TYPE_MAX_VALUE (type),
4390 && operand_equal_p (arg01,
4391 const_binop (PLUS_EXPR, arg2,
4392 integer_one_node, 0),
4394 return pedantic_non_lvalue (fold (build2 (MAX_EXPR,
4395 type, arg1, arg2)));
4408 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
4409 #define LOGICAL_OP_NON_SHORT_CIRCUIT (BRANCH_COST >= 2)
4412 /* EXP is some logical combination of boolean tests. See if we can
4413 merge it into some range test. Return the new tree if so. */
4416 fold_range_test (enum tree_code code, tree type, tree op0, tree op1)
4418 int or_op = (code == TRUTH_ORIF_EXPR
4419 || code == TRUTH_OR_EXPR);
4420 int in0_p, in1_p, in_p;
4421 tree low0, low1, low, high0, high1, high;
4422 tree lhs = make_range (op0, &in0_p, &low0, &high0);
4423 tree rhs = make_range (op1, &in1_p, &low1, &high1);
4426 /* If this is an OR operation, invert both sides; we will invert
4427 again at the end. */
4429 in0_p = ! in0_p, in1_p = ! in1_p;
4431 /* If both expressions are the same, if we can merge the ranges, and we
4432 can build the range test, return it or it inverted. If one of the
4433 ranges is always true or always false, consider it to be the same
4434 expression as the other. */
4435 if ((lhs == 0 || rhs == 0 || operand_equal_p (lhs, rhs, 0))
4436 && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
4438 && 0 != (tem = (build_range_check (type,
4440 : rhs != 0 ? rhs : integer_zero_node,
4442 return or_op ? invert_truthvalue (tem) : tem;
4444 /* On machines where the branch cost is expensive, if this is a
4445 short-circuited branch and the underlying object on both sides
4446 is the same, make a non-short-circuit operation. */
4447 else if (LOGICAL_OP_NON_SHORT_CIRCUIT
4448 && lhs != 0 && rhs != 0
4449 && (code == TRUTH_ANDIF_EXPR
4450 || code == TRUTH_ORIF_EXPR)
4451 && operand_equal_p (lhs, rhs, 0))
4453 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
4454 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
4455 which cases we can't do this. */
4456 if (simple_operand_p (lhs))
4457 return build2 (code == TRUTH_ANDIF_EXPR
4458 ? TRUTH_AND_EXPR : TRUTH_OR_EXPR,
4461 else if (lang_hooks.decls.global_bindings_p () == 0
4462 && ! CONTAINS_PLACEHOLDER_P (lhs))
4464 tree common = save_expr (lhs);
4466 if (0 != (lhs = build_range_check (type, common,
4467 or_op ? ! in0_p : in0_p,
4469 && (0 != (rhs = build_range_check (type, common,
4470 or_op ? ! in1_p : in1_p,
4472 return build2 (code == TRUTH_ANDIF_EXPR
4473 ? TRUTH_AND_EXPR : TRUTH_OR_EXPR,
4481 /* Subroutine for fold_truthop: C is an INTEGER_CST interpreted as a P
4482 bit value. Arrange things so the extra bits will be set to zero if and
4483 only if C is signed-extended to its full width. If MASK is nonzero,
4484 it is an INTEGER_CST that should be AND'ed with the extra bits. */
4487 unextend (tree c, int p, int unsignedp, tree mask)
4489 tree type = TREE_TYPE (c);
4490 int modesize = GET_MODE_BITSIZE (TYPE_MODE (type));
4493 if (p == modesize || unsignedp)
4496 /* We work by getting just the sign bit into the low-order bit, then
4497 into the high-order bit, then sign-extend. We then XOR that value
4499 temp = const_binop (RSHIFT_EXPR, c, size_int (p - 1), 0);
4500 temp = const_binop (BIT_AND_EXPR, temp, size_int (1), 0);
4502 /* We must use a signed type in order to get an arithmetic right shift.
4503 However, we must also avoid introducing accidental overflows, so that
4504 a subsequent call to integer_zerop will work. Hence we must
4505 do the type conversion here. At this point, the constant is either
4506 zero or one, and the conversion to a signed type can never overflow.
4507 We could get an overflow if this conversion is done anywhere else. */
4508 if (TYPE_UNSIGNED (type))
4509 temp = fold_convert (lang_hooks.types.signed_type (type), temp);
4511 temp = const_binop (LSHIFT_EXPR, temp, size_int (modesize - 1), 0);
4512 temp = const_binop (RSHIFT_EXPR, temp, size_int (modesize - p - 1), 0);
4514 temp = const_binop (BIT_AND_EXPR, temp,
4515 fold_convert (TREE_TYPE (c), mask), 0);
4516 /* If necessary, convert the type back to match the type of C. */
4517 if (TYPE_UNSIGNED (type))
4518 temp = fold_convert (type, temp);
4520 return fold_convert (type, const_binop (BIT_XOR_EXPR, c, temp, 0));
4523 /* Find ways of folding logical expressions of LHS and RHS:
4524 Try to merge two comparisons to the same innermost item.
4525 Look for range tests like "ch >= '0' && ch <= '9'".
4526 Look for combinations of simple terms on machines with expensive branches
4527 and evaluate the RHS unconditionally.
4529 For example, if we have p->a == 2 && p->b == 4 and we can make an
4530 object large enough to span both A and B, we can do this with a comparison
4531 against the object ANDed with the a mask.
4533 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
4534 operations to do this with one comparison.
4536 We check for both normal comparisons and the BIT_AND_EXPRs made this by
4537 function and the one above.
4539 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
4540 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
4542 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
4545 We return the simplified tree or 0 if no optimization is possible. */
4548 fold_truthop (enum tree_code code, tree truth_type, tree lhs, tree rhs)
4550 /* If this is the "or" of two comparisons, we can do something if
4551 the comparisons are NE_EXPR. If this is the "and", we can do something
4552 if the comparisons are EQ_EXPR. I.e.,
4553 (a->b == 2 && a->c == 4) can become (a->new == NEW).
4555 WANTED_CODE is this operation code. For single bit fields, we can
4556 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
4557 comparison for one-bit fields. */
4559 enum tree_code wanted_code;
4560 enum tree_code lcode, rcode;
4561 tree ll_arg, lr_arg, rl_arg, rr_arg;
4562 tree ll_inner, lr_inner, rl_inner, rr_inner;
4563 HOST_WIDE_INT ll_bitsize, ll_bitpos, lr_bitsize, lr_bitpos;
4564 HOST_WIDE_INT rl_bitsize, rl_bitpos, rr_bitsize, rr_bitpos;
4565 HOST_WIDE_INT xll_bitpos, xlr_bitpos, xrl_bitpos, xrr_bitpos;
4566 HOST_WIDE_INT lnbitsize, lnbitpos, rnbitsize, rnbitpos;
4567 int ll_unsignedp, lr_unsignedp, rl_unsignedp, rr_unsignedp;
4568 enum machine_mode ll_mode, lr_mode, rl_mode, rr_mode;
4569 enum machine_mode lnmode, rnmode;
4570 tree ll_mask, lr_mask, rl_mask, rr_mask;
4571 tree ll_and_mask, lr_and_mask, rl_and_mask, rr_and_mask;
4572 tree l_const, r_const;
4573 tree lntype, rntype, result;
4574 int first_bit, end_bit;
4577 /* Start by getting the comparison codes. Fail if anything is volatile.
4578 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
4579 it were surrounded with a NE_EXPR. */
4581 if (TREE_SIDE_EFFECTS (lhs) || TREE_SIDE_EFFECTS (rhs))
4584 lcode = TREE_CODE (lhs);
4585 rcode = TREE_CODE (rhs);
4587 if (lcode == BIT_AND_EXPR && integer_onep (TREE_OPERAND (lhs, 1)))
4589 lhs = build2 (NE_EXPR, truth_type, lhs,
4590 fold_convert (TREE_TYPE (lhs), integer_zero_node));
4594 if (rcode == BIT_AND_EXPR && integer_onep (TREE_OPERAND (rhs, 1)))
4596 rhs = build2 (NE_EXPR, truth_type, rhs,
4597 fold_convert (TREE_TYPE (rhs), integer_zero_node));
4601 if (TREE_CODE_CLASS (lcode) != tcc_comparison
4602 || TREE_CODE_CLASS (rcode) != tcc_comparison)
4605 ll_arg = TREE_OPERAND (lhs, 0);
4606 lr_arg = TREE_OPERAND (lhs, 1);
4607 rl_arg = TREE_OPERAND (rhs, 0);
4608 rr_arg = TREE_OPERAND (rhs, 1);
4610 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
4611 if (simple_operand_p (ll_arg)
4612 && simple_operand_p (lr_arg))
4615 if (operand_equal_p (ll_arg, rl_arg, 0)
4616 && operand_equal_p (lr_arg, rr_arg, 0))
4618 result = combine_comparisons (code, lcode, rcode,
4619 truth_type, ll_arg, lr_arg);
4623 else if (operand_equal_p (ll_arg, rr_arg, 0)
4624 && operand_equal_p (lr_arg, rl_arg, 0))
4626 result = combine_comparisons (code, lcode,
4627 swap_tree_comparison (rcode),
4628 truth_type, ll_arg, lr_arg);
4634 code = ((code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR)
4635 ? TRUTH_AND_EXPR : TRUTH_OR_EXPR);
4637 /* If the RHS can be evaluated unconditionally and its operands are
4638 simple, it wins to evaluate the RHS unconditionally on machines
4639 with expensive branches. In this case, this isn't a comparison
4640 that can be merged. Avoid doing this if the RHS is a floating-point
4641 comparison since those can trap. */
4643 if (BRANCH_COST >= 2
4644 && ! FLOAT_TYPE_P (TREE_TYPE (rl_arg))
4645 && simple_operand_p (rl_arg)
4646 && simple_operand_p (rr_arg))
4648 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
4649 if (code == TRUTH_OR_EXPR
4650 && lcode == NE_EXPR && integer_zerop (lr_arg)
4651 && rcode == NE_EXPR && integer_zerop (rr_arg)
4652 && TREE_TYPE (ll_arg) == TREE_TYPE (rl_arg))
4653 return build2 (NE_EXPR, truth_type,
4654 build2 (BIT_IOR_EXPR, TREE_TYPE (ll_arg),
4656 fold_convert (TREE_TYPE (ll_arg), integer_zero_node));
4658 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
4659 if (code == TRUTH_AND_EXPR
4660 && lcode == EQ_EXPR && integer_zerop (lr_arg)
4661 && rcode == EQ_EXPR && integer_zerop (rr_arg)
4662 && TREE_TYPE (ll_arg) == TREE_TYPE (rl_arg))
4663 return build2 (EQ_EXPR, truth_type,
4664 build2 (BIT_IOR_EXPR, TREE_TYPE (ll_arg),
4666 fold_convert (TREE_TYPE (ll_arg), integer_zero_node));
4668 if (LOGICAL_OP_NON_SHORT_CIRCUIT)
4669 return build2 (code, truth_type, lhs, rhs);
4672 /* See if the comparisons can be merged. Then get all the parameters for
4675 if ((lcode != EQ_EXPR && lcode != NE_EXPR)
4676 || (rcode != EQ_EXPR && rcode != NE_EXPR))
4680 ll_inner = decode_field_reference (ll_arg,
4681 &ll_bitsize, &ll_bitpos, &ll_mode,
4682 &ll_unsignedp, &volatilep, &ll_mask,
4684 lr_inner = decode_field_reference (lr_arg,
4685 &lr_bitsize, &lr_bitpos, &lr_mode,
4686 &lr_unsignedp, &volatilep, &lr_mask,
4688 rl_inner = decode_field_reference (rl_arg,
4689 &rl_bitsize, &rl_bitpos, &rl_mode,
4690 &rl_unsignedp, &volatilep, &rl_mask,
4692 rr_inner = decode_field_reference (rr_arg,
4693 &rr_bitsize, &rr_bitpos, &rr_mode,
4694 &rr_unsignedp, &volatilep, &rr_mask,
4697 /* It must be true that the inner operation on the lhs of each
4698 comparison must be the same if we are to be able to do anything.
4699 Then see if we have constants. If not, the same must be true for
4701 if (volatilep || ll_inner == 0 || rl_inner == 0
4702 || ! operand_equal_p (ll_inner, rl_inner, 0))
4705 if (TREE_CODE (lr_arg) == INTEGER_CST
4706 && TREE_CODE (rr_arg) == INTEGER_CST)
4707 l_const = lr_arg, r_const = rr_arg;
4708 else if (lr_inner == 0 || rr_inner == 0
4709 || ! operand_equal_p (lr_inner, rr_inner, 0))
4712 l_const = r_const = 0;
4714 /* If either comparison code is not correct for our logical operation,
4715 fail. However, we can convert a one-bit comparison against zero into
4716 the opposite comparison against that bit being set in the field. */
4718 wanted_code = (code == TRUTH_AND_EXPR ? EQ_EXPR : NE_EXPR);
4719 if (lcode != wanted_code)
4721 if (l_const && integer_zerop (l_const) && integer_pow2p (ll_mask))
4723 /* Make the left operand unsigned, since we are only interested
4724 in the value of one bit. Otherwise we are doing the wrong
4733 /* This is analogous to the code for l_const above. */
4734 if (rcode != wanted_code)
4736 if (r_const && integer_zerop (r_const) && integer_pow2p (rl_mask))
4745 /* After this point all optimizations will generate bit-field
4746 references, which we might not want. */
4747 if (! lang_hooks.can_use_bit_fields_p ())
4750 /* See if we can find a mode that contains both fields being compared on
4751 the left. If we can't, fail. Otherwise, update all constants and masks
4752 to be relative to a field of that size. */
4753 first_bit = MIN (ll_bitpos, rl_bitpos);
4754 end_bit = MAX (ll_bitpos + ll_bitsize, rl_bitpos + rl_bitsize);
4755 lnmode = get_best_mode (end_bit - first_bit, first_bit,
4756 TYPE_ALIGN (TREE_TYPE (ll_inner)), word_mode,
4758 if (lnmode == VOIDmode)
4761 lnbitsize = GET_MODE_BITSIZE (lnmode);
4762 lnbitpos = first_bit & ~ (lnbitsize - 1);
4763 lntype = lang_hooks.types.type_for_size (lnbitsize, 1);
4764 xll_bitpos = ll_bitpos - lnbitpos, xrl_bitpos = rl_bitpos - lnbitpos;
4766 if (BYTES_BIG_ENDIAN)
4768 xll_bitpos = lnbitsize - xll_bitpos - ll_bitsize;
4769 xrl_bitpos = lnbitsize - xrl_bitpos - rl_bitsize;
4772 ll_mask = const_binop (LSHIFT_EXPR, fold_convert (lntype, ll_mask),
4773 size_int (xll_bitpos), 0);
4774 rl_mask = const_binop (LSHIFT_EXPR, fold_convert (lntype, rl_mask),
4775 size_int (xrl_bitpos), 0);
4779 l_const = fold_convert (lntype, l_const);
4780 l_const = unextend (l_const, ll_bitsize, ll_unsignedp, ll_and_mask);
4781 l_const = const_binop (LSHIFT_EXPR, l_const, size_int (xll_bitpos), 0);
4782 if (! integer_zerop (const_binop (BIT_AND_EXPR, l_const,
4783 fold (build1 (BIT_NOT_EXPR,
4787 warning ("comparison is always %d", wanted_code == NE_EXPR);
4789 return constant_boolean_node (wanted_code == NE_EXPR, truth_type);
4794 r_const = fold_convert (lntype, r_const);
4795 r_const = unextend (r_const, rl_bitsize, rl_unsignedp, rl_and_mask);
4796 r_const = const_binop (LSHIFT_EXPR, r_const, size_int (xrl_bitpos), 0);
4797 if (! integer_zerop (const_binop (BIT_AND_EXPR, r_const,
4798 fold (build1 (BIT_NOT_EXPR,
4802 warning ("comparison is always %d", wanted_code == NE_EXPR);
4804 return constant_boolean_node (wanted_code == NE_EXPR, truth_type);
4808 /* If the right sides are not constant, do the same for it. Also,
4809 disallow this optimization if a size or signedness mismatch occurs
4810 between the left and right sides. */
4813 if (ll_bitsize != lr_bitsize || rl_bitsize != rr_bitsize
4814 || ll_unsignedp != lr_unsignedp || rl_unsignedp != rr_unsignedp
4815 /* Make sure the two fields on the right
4816 correspond to the left without being swapped. */
4817 || ll_bitpos - rl_bitpos != lr_bitpos - rr_bitpos)
4820 first_bit = MIN (lr_bitpos, rr_bitpos);
4821 end_bit = MAX (lr_bitpos + lr_bitsize, rr_bitpos + rr_bitsize);
4822 rnmode = get_best_mode (end_bit - first_bit, first_bit,
4823 TYPE_ALIGN (TREE_TYPE (lr_inner)), word_mode,
4825 if (rnmode == VOIDmode)
4828 rnbitsize = GET_MODE_BITSIZE (rnmode);
4829 rnbitpos = first_bit & ~ (rnbitsize - 1);
4830 rntype = lang_hooks.types.type_for_size (rnbitsize, 1);
4831 xlr_bitpos = lr_bitpos - rnbitpos, xrr_bitpos = rr_bitpos - rnbitpos;
4833 if (BYTES_BIG_ENDIAN)
4835 xlr_bitpos = rnbitsize - xlr_bitpos - lr_bitsize;
4836 xrr_bitpos = rnbitsize - xrr_bitpos - rr_bitsize;
4839 lr_mask = const_binop (LSHIFT_EXPR, fold_convert (rntype, lr_mask),
4840 size_int (xlr_bitpos), 0);
4841 rr_mask = const_binop (LSHIFT_EXPR, fold_convert (rntype, rr_mask),
4842 size_int (xrr_bitpos), 0);
4844 /* Make a mask that corresponds to both fields being compared.
4845 Do this for both items being compared. If the operands are the
4846 same size and the bits being compared are in the same position
4847 then we can do this by masking both and comparing the masked
4849 ll_mask = const_binop (BIT_IOR_EXPR, ll_mask, rl_mask, 0);
4850 lr_mask = const_binop (BIT_IOR_EXPR, lr_mask, rr_mask, 0);
4851 if (lnbitsize == rnbitsize && xll_bitpos == xlr_bitpos)
4853 lhs = make_bit_field_ref (ll_inner, lntype, lnbitsize, lnbitpos,
4854 ll_unsignedp || rl_unsignedp);
4855 if (! all_ones_mask_p (ll_mask, lnbitsize))
4856 lhs = build2 (BIT_AND_EXPR, lntype, lhs, ll_mask);
4858 rhs = make_bit_field_ref (lr_inner, rntype, rnbitsize, rnbitpos,
4859 lr_unsignedp || rr_unsignedp);
4860 if (! all_ones_mask_p (lr_mask, rnbitsize))
4861 rhs = build2 (BIT_AND_EXPR, rntype, rhs, lr_mask);
4863 return build2 (wanted_code, truth_type, lhs, rhs);
4866 /* There is still another way we can do something: If both pairs of
4867 fields being compared are adjacent, we may be able to make a wider
4868 field containing them both.
4870 Note that we still must mask the lhs/rhs expressions. Furthermore,
4871 the mask must be shifted to account for the shift done by
4872 make_bit_field_ref. */
4873 if ((ll_bitsize + ll_bitpos == rl_bitpos
4874 && lr_bitsize + lr_bitpos == rr_bitpos)
4875 || (ll_bitpos == rl_bitpos + rl_bitsize
4876 && lr_bitpos == rr_bitpos + rr_bitsize))
4880 lhs = make_bit_field_ref (ll_inner, lntype, ll_bitsize + rl_bitsize,
4881 MIN (ll_bitpos, rl_bitpos), ll_unsignedp);
4882 rhs = make_bit_field_ref (lr_inner, rntype, lr_bitsize + rr_bitsize,
4883 MIN (lr_bitpos, rr_bitpos), lr_unsignedp);
4885 ll_mask = const_binop (RSHIFT_EXPR, ll_mask,
4886 size_int (MIN (xll_bitpos, xrl_bitpos)), 0);
4887 lr_mask = const_binop (RSHIFT_EXPR, lr_mask,
4888 size_int (MIN (xlr_bitpos, xrr_bitpos)), 0);
4890 /* Convert to the smaller type before masking out unwanted bits. */
4892 if (lntype != rntype)
4894 if (lnbitsize > rnbitsize)
4896 lhs = fold_convert (rntype, lhs);
4897 ll_mask = fold_convert (rntype, ll_mask);
4900 else if (lnbitsize < rnbitsize)
4902 rhs = fold_convert (lntype, rhs);
4903 lr_mask = fold_convert (lntype, lr_mask);
4908 if (! all_ones_mask_p (ll_mask, ll_bitsize + rl_bitsize))
4909 lhs = build2 (BIT_AND_EXPR, type, lhs, ll_mask);
4911 if (! all_ones_mask_p (lr_mask, lr_bitsize + rr_bitsize))
4912 rhs = build2 (BIT_AND_EXPR, type, rhs, lr_mask);
4914 return build2 (wanted_code, truth_type, lhs, rhs);
4920 /* Handle the case of comparisons with constants. If there is something in
4921 common between the masks, those bits of the constants must be the same.
4922 If not, the condition is always false. Test for this to avoid generating
4923 incorrect code below. */
4924 result = const_binop (BIT_AND_EXPR, ll_mask, rl_mask, 0);
4925 if (! integer_zerop (result)
4926 && simple_cst_equal (const_binop (BIT_AND_EXPR, result, l_const, 0),
4927 const_binop (BIT_AND_EXPR, result, r_const, 0)) != 1)
4929 if (wanted_code == NE_EXPR)
4931 warning ("%<or%> of unmatched not-equal tests is always 1");
4932 return constant_boolean_node (true, truth_type);
4936 warning ("%<and%> of mutually exclusive equal-tests is always 0");
4937 return constant_boolean_node (false, truth_type);
4941 /* Construct the expression we will return. First get the component
4942 reference we will make. Unless the mask is all ones the width of
4943 that field, perform the mask operation. Then compare with the
4945 result = make_bit_field_ref (ll_inner, lntype, lnbitsize, lnbitpos,
4946 ll_unsignedp || rl_unsignedp);
4948 ll_mask = const_binop (BIT_IOR_EXPR, ll_mask, rl_mask, 0);
4949 if (! all_ones_mask_p (ll_mask, lnbitsize))
4950 result = build2 (BIT_AND_EXPR, lntype, result, ll_mask);
4952 return build2 (wanted_code, truth_type, result,
4953 const_binop (BIT_IOR_EXPR, l_const, r_const, 0));
4956 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
4960 optimize_minmax_comparison (enum tree_code code, tree type, tree op0, tree op1)
4963 enum tree_code op_code;
4964 tree comp_const = op1;
4966 int consts_equal, consts_lt;
4969 STRIP_SIGN_NOPS (arg0);
4971 op_code = TREE_CODE (arg0);
4972 minmax_const = TREE_OPERAND (arg0, 1);
4973 consts_equal = tree_int_cst_equal (minmax_const, comp_const);
4974 consts_lt = tree_int_cst_lt (minmax_const, comp_const);
4975 inner = TREE_OPERAND (arg0, 0);
4977 /* If something does not permit us to optimize, return the original tree. */
4978 if ((op_code != MIN_EXPR && op_code != MAX_EXPR)
4979 || TREE_CODE (comp_const) != INTEGER_CST
4980 || TREE_CONSTANT_OVERFLOW (comp_const)
4981 || TREE_CODE (minmax_const) != INTEGER_CST
4982 || TREE_CONSTANT_OVERFLOW (minmax_const))
4985 /* Now handle all the various comparison codes. We only handle EQ_EXPR
4986 and GT_EXPR, doing the rest with recursive calls using logical
4990 case NE_EXPR: case LT_EXPR: case LE_EXPR:
4992 /* FIXME: We should be able to invert code without building a
4993 scratch tree node, but doing so would require us to
4994 duplicate a part of invert_truthvalue here. */
4995 tree tem = invert_truthvalue (build2 (code, type, op0, op1));
4996 tem = optimize_minmax_comparison (TREE_CODE (tem),
4998 TREE_OPERAND (tem, 0),
4999 TREE_OPERAND (tem, 1));
5000 return invert_truthvalue (tem);
5005 fold (build2 (TRUTH_ORIF_EXPR, type,
5006 optimize_minmax_comparison
5007 (EQ_EXPR, type, arg0, comp_const),
5008 optimize_minmax_comparison
5009 (GT_EXPR, type, arg0, comp_const)));
5012 if (op_code == MAX_EXPR && consts_equal)
5013 /* MAX (X, 0) == 0 -> X <= 0 */
5014 return fold (build2 (LE_EXPR, type, inner, comp_const));
5016 else if (op_code == MAX_EXPR && consts_lt)
5017 /* MAX (X, 0) == 5 -> X == 5 */
5018 return fold (build2 (EQ_EXPR, type, inner, comp_const));
5020 else if (op_code == MAX_EXPR)
5021 /* MAX (X, 0) == -1 -> false */
5022 return omit_one_operand (type, integer_zero_node, inner);
5024 else if (consts_equal)
5025 /* MIN (X, 0) == 0 -> X >= 0 */
5026 return fold (build2 (GE_EXPR, type, inner, comp_const));
5029 /* MIN (X, 0) == 5 -> false */
5030 return omit_one_operand (type, integer_zero_node, inner);
5033 /* MIN (X, 0) == -1 -> X == -1 */
5034 return fold (build2 (EQ_EXPR, type, inner, comp_const));
5037 if (op_code == MAX_EXPR && (consts_equal || consts_lt))
5038 /* MAX (X, 0) > 0 -> X > 0
5039 MAX (X, 0) > 5 -> X > 5 */
5040 return fold (build2 (GT_EXPR, type, inner, comp_const));
5042 else if (op_code == MAX_EXPR)
5043 /* MAX (X, 0) > -1 -> true */
5044 return omit_one_operand (type, integer_one_node, inner);
5046 else if (op_code == MIN_EXPR && (consts_equal || consts_lt))
5047 /* MIN (X, 0) > 0 -> false
5048 MIN (X, 0) > 5 -> false */
5049 return omit_one_operand (type, integer_zero_node, inner);
5052 /* MIN (X, 0) > -1 -> X > -1 */
5053 return fold (build2 (GT_EXPR, type, inner, comp_const));
5060 /* T is an integer expression that is being multiplied, divided, or taken a
5061 modulus (CODE says which and what kind of divide or modulus) by a
5062 constant C. See if we can eliminate that operation by folding it with
5063 other operations already in T. WIDE_TYPE, if non-null, is a type that
5064 should be used for the computation if wider than our type.
5066 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5067 (X * 2) + (Y * 4). We must, however, be assured that either the original
5068 expression would not overflow or that overflow is undefined for the type
5069 in the language in question.
5071 We also canonicalize (X + 7) * 4 into X * 4 + 28 in the hope that either
5072 the machine has a multiply-accumulate insn or that this is part of an
5073 addressing calculation.
5075 If we return a non-null expression, it is an equivalent form of the
5076 original computation, but need not be in the original type. */
5079 extract_muldiv (tree t, tree c, enum tree_code code, tree wide_type)
5081 /* To avoid exponential search depth, refuse to allow recursion past
5082 three levels. Beyond that (1) it's highly unlikely that we'll find
5083 something interesting and (2) we've probably processed it before
5084 when we built the inner expression. */
5093 ret = extract_muldiv_1 (t, c, code, wide_type);
5100 extract_muldiv_1 (tree t, tree c, enum tree_code code, tree wide_type)
5102 tree type = TREE_TYPE (t);
5103 enum tree_code tcode = TREE_CODE (t);
5104 tree ctype = (wide_type != 0 && (GET_MODE_SIZE (TYPE_MODE (wide_type))
5105 > GET_MODE_SIZE (TYPE_MODE (type)))
5106 ? wide_type : type);
5108 int same_p = tcode == code;
5109 tree op0 = NULL_TREE, op1 = NULL_TREE;
5111 /* Don't deal with constants of zero here; they confuse the code below. */
5112 if (integer_zerop (c))
5115 if (TREE_CODE_CLASS (tcode) == tcc_unary)
5116 op0 = TREE_OPERAND (t, 0);
5118 if (TREE_CODE_CLASS (tcode) == tcc_binary)
5119 op0 = TREE_OPERAND (t, 0), op1 = TREE_OPERAND (t, 1);
5121 /* Note that we need not handle conditional operations here since fold
5122 already handles those cases. So just do arithmetic here. */
5126 /* For a constant, we can always simplify if we are a multiply
5127 or (for divide and modulus) if it is a multiple of our constant. */
5128 if (code == MULT_EXPR
5129 || integer_zerop (const_binop (TRUNC_MOD_EXPR, t, c, 0)))
5130 return const_binop (code, fold_convert (ctype, t),
5131 fold_convert (ctype, c), 0);
5134 case CONVERT_EXPR: case NON_LVALUE_EXPR: case NOP_EXPR:
5135 /* If op0 is an expression ... */
5136 if ((COMPARISON_CLASS_P (op0)
5137 || UNARY_CLASS_P (op0)
5138 || BINARY_CLASS_P (op0)
5139 || EXPRESSION_CLASS_P (op0))
5140 /* ... and is unsigned, and its type is smaller than ctype,
5141 then we cannot pass through as widening. */
5142 && ((TYPE_UNSIGNED (TREE_TYPE (op0))
5143 && ! (TREE_CODE (TREE_TYPE (op0)) == INTEGER_TYPE
5144 && TYPE_IS_SIZETYPE (TREE_TYPE (op0)))
5145 && (GET_MODE_SIZE (TYPE_MODE (ctype))
5146 > GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))))
5147 /* ... or this is a truncation (t is narrower than op0),
5148 then we cannot pass through this narrowing. */
5149 || (GET_MODE_SIZE (TYPE_MODE (type))
5150 < GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0))))
5151 /* ... or signedness changes for division or modulus,
5152 then we cannot pass through this conversion. */
5153 || (code != MULT_EXPR
5154 && (TYPE_UNSIGNED (ctype)
5155 != TYPE_UNSIGNED (TREE_TYPE (op0))))))
5158 /* Pass the constant down and see if we can make a simplification. If
5159 we can, replace this expression with the inner simplification for
5160 possible later conversion to our or some other type. */
5161 if ((t2 = fold_convert (TREE_TYPE (op0), c)) != 0
5162 && TREE_CODE (t2) == INTEGER_CST
5163 && ! TREE_CONSTANT_OVERFLOW (t2)
5164 && (0 != (t1 = extract_muldiv (op0, t2, code,
5166 ? ctype : NULL_TREE))))
5171 /* If widening the type changes it from signed to unsigned, then we
5172 must avoid building ABS_EXPR itself as unsigned. */
5173 if (TYPE_UNSIGNED (ctype) && !TYPE_UNSIGNED (type))
5175 tree cstype = (*lang_hooks.types.signed_type) (ctype);
5176 if ((t1 = extract_muldiv (op0, c, code, cstype)) != 0)
5178 t1 = fold (build1 (tcode, cstype, fold_convert (cstype, t1)));
5179 return fold_convert (ctype, t1);
5185 if ((t1 = extract_muldiv (op0, c, code, wide_type)) != 0)
5186 return fold (build1 (tcode, ctype, fold_convert (ctype, t1)));
5189 case MIN_EXPR: case MAX_EXPR:
5190 /* If widening the type changes the signedness, then we can't perform
5191 this optimization as that changes the result. */
5192 if (TYPE_UNSIGNED (ctype) != TYPE_UNSIGNED (type))
5195 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
5196 if ((t1 = extract_muldiv (op0, c, code, wide_type)) != 0
5197 && (t2 = extract_muldiv (op1, c, code, wide_type)) != 0)
5199 if (tree_int_cst_sgn (c) < 0)
5200 tcode = (tcode == MIN_EXPR ? MAX_EXPR : MIN_EXPR);
5202 return fold (build2 (tcode, ctype, fold_convert (ctype, t1),
5203 fold_convert (ctype, t2)));
5207 case LSHIFT_EXPR: case RSHIFT_EXPR:
5208 /* If the second operand is constant, this is a multiplication
5209 or floor division, by a power of two, so we can treat it that
5210 way unless the multiplier or divisor overflows. Signed
5211 left-shift overflow is implementation-defined rather than
5212 undefined in C90, so do not convert signed left shift into
5214 if (TREE_CODE (op1) == INTEGER_CST
5215 && (tcode == RSHIFT_EXPR || TYPE_UNSIGNED (TREE_TYPE (op0)))
5216 /* const_binop may not detect overflow correctly,
5217 so check for it explicitly here. */
5218 && TYPE_PRECISION (TREE_TYPE (size_one_node)) > TREE_INT_CST_LOW (op1)
5219 && TREE_INT_CST_HIGH (op1) == 0
5220 && 0 != (t1 = fold_convert (ctype,
5221 const_binop (LSHIFT_EXPR,
5224 && ! TREE_OVERFLOW (t1))
5225 return extract_muldiv (build2 (tcode == LSHIFT_EXPR
5226 ? MULT_EXPR : FLOOR_DIV_EXPR,
5227 ctype, fold_convert (ctype, op0), t1),
5228 c, code, wide_type);
5231 case PLUS_EXPR: case MINUS_EXPR:
5232 /* See if we can eliminate the operation on both sides. If we can, we
5233 can return a new PLUS or MINUS. If we can't, the only remaining
5234 cases where we can do anything are if the second operand is a
5236 t1 = extract_muldiv (op0, c, code, wide_type);
5237 t2 = extract_muldiv (op1, c, code, wide_type);
5238 if (t1 != 0 && t2 != 0
5239 && (code == MULT_EXPR
5240 /* If not multiplication, we can only do this if both operands
5241 are divisible by c. */
5242 || (multiple_of_p (ctype, op0, c)
5243 && multiple_of_p (ctype, op1, c))))
5244 return fold (build2 (tcode, ctype, fold_convert (ctype, t1),
5245 fold_convert (ctype, t2)));
5247 /* If this was a subtraction, negate OP1 and set it to be an addition.
5248 This simplifies the logic below. */
5249 if (tcode == MINUS_EXPR)
5250 tcode = PLUS_EXPR, op1 = negate_expr (op1);
5252 if (TREE_CODE (op1) != INTEGER_CST)
5255 /* If either OP1 or C are negative, this optimization is not safe for
5256 some of the division and remainder types while for others we need
5257 to change the code. */
5258 if (tree_int_cst_sgn (op1) < 0 || tree_int_cst_sgn (c) < 0)
5260 if (code == CEIL_DIV_EXPR)
5261 code = FLOOR_DIV_EXPR;
5262 else if (code == FLOOR_DIV_EXPR)
5263 code = CEIL_DIV_EXPR;
5264 else if (code != MULT_EXPR
5265 && code != CEIL_MOD_EXPR && code != FLOOR_MOD_EXPR)
5269 /* If it's a multiply or a division/modulus operation of a multiple
5270 of our constant, do the operation and verify it doesn't overflow. */
5271 if (code == MULT_EXPR
5272 || integer_zerop (const_binop (TRUNC_MOD_EXPR, op1, c, 0)))
5274 op1 = const_binop (code, fold_convert (ctype, op1),
5275 fold_convert (ctype, c), 0);
5276 /* We allow the constant to overflow with wrapping semantics. */
5278 || (TREE_OVERFLOW (op1) && ! flag_wrapv))
5284 /* If we have an unsigned type is not a sizetype, we cannot widen
5285 the operation since it will change the result if the original
5286 computation overflowed. */
5287 if (TYPE_UNSIGNED (ctype)
5288 && ! (TREE_CODE (ctype) == INTEGER_TYPE && TYPE_IS_SIZETYPE (ctype))
5292 /* If we were able to eliminate our operation from the first side,
5293 apply our operation to the second side and reform the PLUS. */
5294 if (t1 != 0 && (TREE_CODE (t1) != code || code == MULT_EXPR))
5295 return fold (build2 (tcode, ctype, fold_convert (ctype, t1), op1));
5297 /* The last case is if we are a multiply. In that case, we can
5298 apply the distributive law to commute the multiply and addition
5299 if the multiplication of the constants doesn't overflow. */
5300 if (code == MULT_EXPR)
5301 return fold (build2 (tcode, ctype,
5302 fold (build2 (code, ctype,
5303 fold_convert (ctype, op0),
5304 fold_convert (ctype, c))),
5310 /* We have a special case here if we are doing something like
5311 (C * 8) % 4 since we know that's zero. */
5312 if ((code == TRUNC_MOD_EXPR || code == CEIL_MOD_EXPR
5313 || code == FLOOR_MOD_EXPR || code == ROUND_MOD_EXPR)
5314 && TREE_CODE (TREE_OPERAND (t, 1)) == INTEGER_CST
5315 && integer_zerop (const_binop (TRUNC_MOD_EXPR, op1, c, 0)))
5316 return omit_one_operand (type, integer_zero_node, op0);
5318 /* ... fall through ... */
5320 case TRUNC_DIV_EXPR: case CEIL_DIV_EXPR: case FLOOR_DIV_EXPR:
5321 case ROUND_DIV_EXPR: case EXACT_DIV_EXPR:
5322 /* If we can extract our operation from the LHS, do so and return a
5323 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
5324 do something only if the second operand is a constant. */
5326 && (t1 = extract_muldiv (op0, c, code, wide_type)) != 0)
5327 return fold (build2 (tcode, ctype, fold_convert (ctype, t1),
5328 fold_convert (ctype, op1)));
5329 else if (tcode == MULT_EXPR && code == MULT_EXPR
5330 && (t1 = extract_muldiv (op1, c, code, wide_type)) != 0)
5331 return fold (build2 (tcode, ctype, fold_convert (ctype, op0),
5332 fold_convert (ctype, t1)));
5333 else if (TREE_CODE (op1) != INTEGER_CST)
5336 /* If these are the same operation types, we can associate them
5337 assuming no overflow. */
5339 && 0 != (t1 = const_binop (MULT_EXPR, fold_convert (ctype, op1),
5340 fold_convert (ctype, c), 0))
5341 && ! TREE_OVERFLOW (t1))
5342 return fold (build2 (tcode, ctype, fold_convert (ctype, op0), t1));
5344 /* If these operations "cancel" each other, we have the main
5345 optimizations of this pass, which occur when either constant is a
5346 multiple of the other, in which case we replace this with either an
5347 operation or CODE or TCODE.
5349 If we have an unsigned type that is not a sizetype, we cannot do
5350 this since it will change the result if the original computation
5352 if ((! TYPE_UNSIGNED (ctype)
5353 || (TREE_CODE (ctype) == INTEGER_TYPE && TYPE_IS_SIZETYPE (ctype)))
5355 && ((code == MULT_EXPR && tcode == EXACT_DIV_EXPR)
5356 || (tcode == MULT_EXPR
5357 && code != TRUNC_MOD_EXPR && code != CEIL_MOD_EXPR
5358 && code != FLOOR_MOD_EXPR && code != ROUND_MOD_EXPR)))
5360 if (integer_zerop (const_binop (TRUNC_MOD_EXPR, op1, c, 0)))
5361 return fold (build2 (tcode, ctype, fold_convert (ctype, op0),
5362 fold_convert (ctype,
5363 const_binop (TRUNC_DIV_EXPR,
5365 else if (integer_zerop (const_binop (TRUNC_MOD_EXPR, c, op1, 0)))
5366 return fold (build2 (code, ctype, fold_convert (ctype, op0),
5367 fold_convert (ctype,
5368 const_binop (TRUNC_DIV_EXPR,
5380 /* Return a node which has the indicated constant VALUE (either 0 or
5381 1), and is of the indicated TYPE. */
5384 constant_boolean_node (int value, tree type)
5386 if (type == integer_type_node)
5387 return value ? integer_one_node : integer_zero_node;
5388 else if (type == boolean_type_node)
5389 return value ? boolean_true_node : boolean_false_node;
5391 return build_int_cst (type, value);
5395 /* Return true if expr looks like an ARRAY_REF and set base and
5396 offset to the appropriate trees. If there is no offset,
5397 offset is set to NULL_TREE. */
5400 extract_array_ref (tree expr, tree *base, tree *offset)
5402 /* We have to be careful with stripping nops as with the
5403 base type the meaning of the offset can change. */
5404 tree inner_expr = expr;
5405 STRIP_NOPS (inner_expr);
5406 /* One canonical form is a PLUS_EXPR with the first
5407 argument being an ADDR_EXPR with a possible NOP_EXPR
5409 if (TREE_CODE (expr) == PLUS_EXPR)
5411 tree op0 = TREE_OPERAND (expr, 0);
5413 if (TREE_CODE (op0) == ADDR_EXPR)
5415 *base = TREE_OPERAND (expr, 0);
5416 *offset = TREE_OPERAND (expr, 1);
5420 /* Other canonical form is an ADDR_EXPR of an ARRAY_REF,
5421 which we transform into an ADDR_EXPR with appropriate
5422 offset. For other arguments to the ADDR_EXPR we assume
5423 zero offset and as such do not care about the ADDR_EXPR
5424 type and strip possible nops from it. */
5425 else if (TREE_CODE (inner_expr) == ADDR_EXPR)
5427 tree op0 = TREE_OPERAND (inner_expr, 0);
5428 if (TREE_CODE (op0) == ARRAY_REF)
5430 *base = build_fold_addr_expr (TREE_OPERAND (op0, 0));
5431 *offset = TREE_OPERAND (op0, 1);
5436 *offset = NULL_TREE;
5445 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
5446 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
5447 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
5448 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
5449 COND is the first argument to CODE; otherwise (as in the example
5450 given here), it is the second argument. TYPE is the type of the
5451 original expression. Return NULL_TREE if no simplification is
5455 fold_binary_op_with_conditional_arg (enum tree_code code,
5456 tree type, tree op0, tree op1,
5457 tree cond, tree arg, int cond_first_p)
5459 tree cond_type = cond_first_p ? TREE_TYPE (op0) : TREE_TYPE (op1);
5460 tree arg_type = cond_first_p ? TREE_TYPE (op1) : TREE_TYPE (op0);
5461 tree test, true_value, false_value;
5462 tree lhs = NULL_TREE;
5463 tree rhs = NULL_TREE;
5465 /* This transformation is only worthwhile if we don't have to wrap
5466 arg in a SAVE_EXPR, and the operation can be simplified on at least
5467 one of the branches once its pushed inside the COND_EXPR. */
5468 if (!TREE_CONSTANT (arg))
5471 if (TREE_CODE (cond) == COND_EXPR)
5473 test = TREE_OPERAND (cond, 0);
5474 true_value = TREE_OPERAND (cond, 1);
5475 false_value = TREE_OPERAND (cond, 2);
5476 /* If this operand throws an expression, then it does not make
5477 sense to try to perform a logical or arithmetic operation
5479 if (VOID_TYPE_P (TREE_TYPE (true_value)))
5481 if (VOID_TYPE_P (TREE_TYPE (false_value)))
5486 tree testtype = TREE_TYPE (cond);
5488 true_value = constant_boolean_node (true, testtype);
5489 false_value = constant_boolean_node (false, testtype);
5492 arg = fold_convert (arg_type, arg);
5495 true_value = fold_convert (cond_type, true_value);
5496 lhs = fold (cond_first_p ? build2 (code, type, true_value, arg)
5497 : build2 (code, type, arg, true_value));
5501 false_value = fold_convert (cond_type, false_value);
5502 rhs = fold (cond_first_p ? build2 (code, type, false_value, arg)
5503 : build2 (code, type, arg, false_value));
5506 test = fold (build3 (COND_EXPR, type, test, lhs, rhs));
5507 return fold_convert (type, test);
5511 /* Subroutine of fold() that checks for the addition of +/- 0.0.
5513 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
5514 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
5515 ADDEND is the same as X.
5517 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
5518 and finite. The problematic cases are when X is zero, and its mode
5519 has signed zeros. In the case of rounding towards -infinity,
5520 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
5521 modes, X + 0 is not the same as X because -0 + 0 is 0. */
5524 fold_real_zero_addition_p (tree type, tree addend, int negate)
5526 if (!real_zerop (addend))
5529 /* Don't allow the fold with -fsignaling-nans. */
5530 if (HONOR_SNANS (TYPE_MODE (type)))
5533 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
5534 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (type)))
5537 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
5538 if (TREE_CODE (addend) == REAL_CST
5539 && REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (addend)))
5542 /* The mode has signed zeros, and we have to honor their sign.
5543 In this situation, there is only one case we can return true for.
5544 X - 0 is the same as X unless rounding towards -infinity is
5546 return negate && !HONOR_SIGN_DEPENDENT_ROUNDING (TYPE_MODE (type));
5549 /* Subroutine of fold() that checks comparisons of built-in math
5550 functions against real constants.
5552 FCODE is the DECL_FUNCTION_CODE of the built-in, CODE is the comparison
5553 operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR, GE_EXPR or LE_EXPR. TYPE
5554 is the type of the result and ARG0 and ARG1 are the operands of the
5555 comparison. ARG1 must be a TREE_REAL_CST.
5557 The function returns the constant folded tree if a simplification
5558 can be made, and NULL_TREE otherwise. */
5561 fold_mathfn_compare (enum built_in_function fcode, enum tree_code code,
5562 tree type, tree arg0, tree arg1)
5566 if (BUILTIN_SQRT_P (fcode))
5568 tree arg = TREE_VALUE (TREE_OPERAND (arg0, 1));
5569 enum machine_mode mode = TYPE_MODE (TREE_TYPE (arg0));
5571 c = TREE_REAL_CST (arg1);
5572 if (REAL_VALUE_NEGATIVE (c))
5574 /* sqrt(x) < y is always false, if y is negative. */
5575 if (code == EQ_EXPR || code == LT_EXPR || code == LE_EXPR)
5576 return omit_one_operand (type, integer_zero_node, arg);
5578 /* sqrt(x) > y is always true, if y is negative and we
5579 don't care about NaNs, i.e. negative values of x. */
5580 if (code == NE_EXPR || !HONOR_NANS (mode))
5581 return omit_one_operand (type, integer_one_node, arg);
5583 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
5584 return fold (build2 (GE_EXPR, type, arg,
5585 build_real (TREE_TYPE (arg), dconst0)));
5587 else if (code == GT_EXPR || code == GE_EXPR)
5591 REAL_ARITHMETIC (c2, MULT_EXPR, c, c);
5592 real_convert (&c2, mode, &c2);
5594 if (REAL_VALUE_ISINF (c2))
5596 /* sqrt(x) > y is x == +Inf, when y is very large. */
5597 if (HONOR_INFINITIES (mode))
5598 return fold (build2 (EQ_EXPR, type, arg,
5599 build_real (TREE_TYPE (arg), c2)));
5601 /* sqrt(x) > y is always false, when y is very large
5602 and we don't care about infinities. */
5603 return omit_one_operand (type, integer_zero_node, arg);
5606 /* sqrt(x) > c is the same as x > c*c. */
5607 return fold (build2 (code, type, arg,
5608 build_real (TREE_TYPE (arg), c2)));
5610 else if (code == LT_EXPR || code == LE_EXPR)
5614 REAL_ARITHMETIC (c2, MULT_EXPR, c, c);
5615 real_convert (&c2, mode, &c2);
5617 if (REAL_VALUE_ISINF (c2))
5619 /* sqrt(x) < y is always true, when y is a very large
5620 value and we don't care about NaNs or Infinities. */
5621 if (! HONOR_NANS (mode) && ! HONOR_INFINITIES (mode))
5622 return omit_one_operand (type, integer_one_node, arg);
5624 /* sqrt(x) < y is x != +Inf when y is very large and we
5625 don't care about NaNs. */
5626 if (! HONOR_NANS (mode))
5627 return fold (build2 (NE_EXPR, type, arg,
5628 build_real (TREE_TYPE (arg), c2)));
5630 /* sqrt(x) < y is x >= 0 when y is very large and we
5631 don't care about Infinities. */
5632 if (! HONOR_INFINITIES (mode))
5633 return fold (build2 (GE_EXPR, type, arg,
5634 build_real (TREE_TYPE (arg), dconst0)));
5636 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
5637 if (lang_hooks.decls.global_bindings_p () != 0
5638 || CONTAINS_PLACEHOLDER_P (arg))
5641 arg = save_expr (arg);
5642 return fold (build2 (TRUTH_ANDIF_EXPR, type,
5643 fold (build2 (GE_EXPR, type, arg,
5644 build_real (TREE_TYPE (arg),
5646 fold (build2 (NE_EXPR, type, arg,
5647 build_real (TREE_TYPE (arg),
5651 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
5652 if (! HONOR_NANS (mode))
5653 return fold (build2 (code, type, arg,
5654 build_real (TREE_TYPE (arg), c2)));
5656 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
5657 if (lang_hooks.decls.global_bindings_p () == 0
5658 && ! CONTAINS_PLACEHOLDER_P (arg))
5660 arg = save_expr (arg);
5661 return fold (build2 (TRUTH_ANDIF_EXPR, type,
5662 fold (build2 (GE_EXPR, type, arg,
5663 build_real (TREE_TYPE (arg),
5665 fold (build2 (code, type, arg,
5666 build_real (TREE_TYPE (arg),
5675 /* Subroutine of fold() that optimizes comparisons against Infinities,
5676 either +Inf or -Inf.
5678 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
5679 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
5680 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
5682 The function returns the constant folded tree if a simplification
5683 can be made, and NULL_TREE otherwise. */
5686 fold_inf_compare (enum tree_code code, tree type, tree arg0, tree arg1)
5688 enum machine_mode mode;
5689 REAL_VALUE_TYPE max;
5693 mode = TYPE_MODE (TREE_TYPE (arg0));
5695 /* For negative infinity swap the sense of the comparison. */
5696 neg = REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1));
5698 code = swap_tree_comparison (code);
5703 /* x > +Inf is always false, if with ignore sNANs. */
5704 if (HONOR_SNANS (mode))
5706 return omit_one_operand (type, integer_zero_node, arg0);
5709 /* x <= +Inf is always true, if we don't case about NaNs. */
5710 if (! HONOR_NANS (mode))
5711 return omit_one_operand (type, integer_one_node, arg0);
5713 /* x <= +Inf is the same as x == x, i.e. isfinite(x). */
5714 if (lang_hooks.decls.global_bindings_p () == 0
5715 && ! CONTAINS_PLACEHOLDER_P (arg0))
5717 arg0 = save_expr (arg0);
5718 return fold (build2 (EQ_EXPR, type, arg0, arg0));
5724 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */
5725 real_maxval (&max, neg, mode);
5726 return fold (build2 (neg ? LT_EXPR : GT_EXPR, type,
5727 arg0, build_real (TREE_TYPE (arg0), max)));
5730 /* x < +Inf is always equal to x <= DBL_MAX. */
5731 real_maxval (&max, neg, mode);
5732 return fold (build2 (neg ? GE_EXPR : LE_EXPR, type,
5733 arg0, build_real (TREE_TYPE (arg0), max)));
5736 /* x != +Inf is always equal to !(x > DBL_MAX). */
5737 real_maxval (&max, neg, mode);
5738 if (! HONOR_NANS (mode))
5739 return fold (build2 (neg ? GE_EXPR : LE_EXPR, type,
5740 arg0, build_real (TREE_TYPE (arg0), max)));
5742 /* The transformation below creates non-gimple code and thus is
5743 not appropriate if we are in gimple form. */
5747 temp = fold (build2 (neg ? LT_EXPR : GT_EXPR, type,
5748 arg0, build_real (TREE_TYPE (arg0), max)));
5749 return fold (build1 (TRUTH_NOT_EXPR, type, temp));
5758 /* Subroutine of fold() that optimizes comparisons of a division by
5759 a nonzero integer constant against an integer constant, i.e.
5762 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
5763 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
5764 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
5766 The function returns the constant folded tree if a simplification
5767 can be made, and NULL_TREE otherwise. */
5770 fold_div_compare (enum tree_code code, tree type, tree arg0, tree arg1)
5772 tree prod, tmp, hi, lo;
5773 tree arg00 = TREE_OPERAND (arg0, 0);
5774 tree arg01 = TREE_OPERAND (arg0, 1);
5775 unsigned HOST_WIDE_INT lpart;
5776 HOST_WIDE_INT hpart;
5779 /* We have to do this the hard way to detect unsigned overflow.
5780 prod = int_const_binop (MULT_EXPR, arg01, arg1, 0); */
5781 overflow = mul_double (TREE_INT_CST_LOW (arg01),
5782 TREE_INT_CST_HIGH (arg01),
5783 TREE_INT_CST_LOW (arg1),
5784 TREE_INT_CST_HIGH (arg1), &lpart, &hpart);
5785 prod = build_int_cst_wide (TREE_TYPE (arg00), lpart, hpart);
5786 prod = force_fit_type (prod, -1, overflow, false);
5788 if (TYPE_UNSIGNED (TREE_TYPE (arg0)))
5790 tmp = int_const_binop (MINUS_EXPR, arg01, integer_one_node, 0);
5793 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp, 0). */
5794 overflow = add_double (TREE_INT_CST_LOW (prod),
5795 TREE_INT_CST_HIGH (prod),
5796 TREE_INT_CST_LOW (tmp),
5797 TREE_INT_CST_HIGH (tmp),
5799 hi = build_int_cst_wide (TREE_TYPE (arg00), lpart, hpart);
5800 hi = force_fit_type (hi, -1, overflow | TREE_OVERFLOW (prod),
5801 TREE_CONSTANT_OVERFLOW (prod));
5803 else if (tree_int_cst_sgn (arg01) >= 0)
5805 tmp = int_const_binop (MINUS_EXPR, arg01, integer_one_node, 0);
5806 switch (tree_int_cst_sgn (arg1))
5809 lo = int_const_binop (MINUS_EXPR, prod, tmp, 0);
5814 lo = fold_negate_const (tmp, TREE_TYPE (arg0));
5819 hi = int_const_binop (PLUS_EXPR, prod, tmp, 0);
5829 /* A negative divisor reverses the relational operators. */
5830 code = swap_tree_comparison (code);
5832 tmp = int_const_binop (PLUS_EXPR, arg01, integer_one_node, 0);
5833 switch (tree_int_cst_sgn (arg1))
5836 hi = int_const_binop (MINUS_EXPR, prod, tmp, 0);
5841 hi = fold_negate_const (tmp, TREE_TYPE (arg0));
5846 lo = int_const_binop (PLUS_EXPR, prod, tmp, 0);
5858 if (TREE_OVERFLOW (lo) && TREE_OVERFLOW (hi))
5859 return omit_one_operand (type, integer_zero_node, arg00);
5860 if (TREE_OVERFLOW (hi))
5861 return fold (build2 (GE_EXPR, type, arg00, lo));
5862 if (TREE_OVERFLOW (lo))
5863 return fold (build2 (LE_EXPR, type, arg00, hi));
5864 return build_range_check (type, arg00, 1, lo, hi);
5867 if (TREE_OVERFLOW (lo) && TREE_OVERFLOW (hi))
5868 return omit_one_operand (type, integer_one_node, arg00);
5869 if (TREE_OVERFLOW (hi))
5870 return fold (build2 (LT_EXPR, type, arg00, lo));
5871 if (TREE_OVERFLOW (lo))
5872 return fold (build2 (GT_EXPR, type, arg00, hi));
5873 return build_range_check (type, arg00, 0, lo, hi);
5876 if (TREE_OVERFLOW (lo))
5877 return omit_one_operand (type, integer_zero_node, arg00);
5878 return fold (build2 (LT_EXPR, type, arg00, lo));
5881 if (TREE_OVERFLOW (hi))
5882 return omit_one_operand (type, integer_one_node, arg00);
5883 return fold (build2 (LE_EXPR, type, arg00, hi));
5886 if (TREE_OVERFLOW (hi))
5887 return omit_one_operand (type, integer_zero_node, arg00);
5888 return fold (build2 (GT_EXPR, type, arg00, hi));
5891 if (TREE_OVERFLOW (lo))
5892 return omit_one_operand (type, integer_one_node, arg00);
5893 return fold (build2 (GE_EXPR, type, arg00, lo));
5903 /* If CODE with arguments ARG0 and ARG1 represents a single bit
5904 equality/inequality test, then return a simplified form of
5905 the test using shifts and logical operations. Otherwise return
5906 NULL. TYPE is the desired result type. */
5909 fold_single_bit_test (enum tree_code code, tree arg0, tree arg1,
5912 /* If this is testing a single bit, we can optimize the test. */
5913 if ((code == NE_EXPR || code == EQ_EXPR)
5914 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
5915 && integer_pow2p (TREE_OPERAND (arg0, 1)))
5917 tree inner = TREE_OPERAND (arg0, 0);
5918 tree type = TREE_TYPE (arg0);
5919 int bitnum = tree_log2 (TREE_OPERAND (arg0, 1));
5920 enum machine_mode operand_mode = TYPE_MODE (type);
5922 tree signed_type, unsigned_type, intermediate_type;
5925 /* If we have (A & C) != 0 where C is the sign bit of A, convert
5926 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
5927 arg00 = sign_bit_p (TREE_OPERAND (arg0, 0), TREE_OPERAND (arg0, 1));
5928 if (arg00 != NULL_TREE
5929 /* This is only a win if casting to a signed type is cheap,
5930 i.e. when arg00's type is not a partial mode. */
5931 && TYPE_PRECISION (TREE_TYPE (arg00))
5932 == GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (arg00))))
5934 tree stype = lang_hooks.types.signed_type (TREE_TYPE (arg00));
5935 return fold (build2 (code == EQ_EXPR ? GE_EXPR : LT_EXPR,
5936 result_type, fold_convert (stype, arg00),
5937 fold_convert (stype, integer_zero_node)));
5940 /* Otherwise we have (A & C) != 0 where C is a single bit,
5941 convert that into ((A >> C2) & 1). Where C2 = log2(C).
5942 Similarly for (A & C) == 0. */
5944 /* If INNER is a right shift of a constant and it plus BITNUM does
5945 not overflow, adjust BITNUM and INNER. */
5946 if (TREE_CODE (inner) == RSHIFT_EXPR
5947 && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST
5948 && TREE_INT_CST_HIGH (TREE_OPERAND (inner, 1)) == 0
5949 && bitnum < TYPE_PRECISION (type)
5950 && 0 > compare_tree_int (TREE_OPERAND (inner, 1),
5951 bitnum - TYPE_PRECISION (type)))
5953 bitnum += TREE_INT_CST_LOW (TREE_OPERAND (inner, 1));
5954 inner = TREE_OPERAND (inner, 0);
5957 /* If we are going to be able to omit the AND below, we must do our
5958 operations as unsigned. If we must use the AND, we have a choice.
5959 Normally unsigned is faster, but for some machines signed is. */
5960 #ifdef LOAD_EXTEND_OP
5961 ops_unsigned = (LOAD_EXTEND_OP (operand_mode) == SIGN_EXTEND
5962 && !flag_syntax_only) ? 0 : 1;
5967 signed_type = lang_hooks.types.type_for_mode (operand_mode, 0);
5968 unsigned_type = lang_hooks.types.type_for_mode (operand_mode, 1);
5969 intermediate_type = ops_unsigned ? unsigned_type : signed_type;
5970 inner = fold_convert (intermediate_type, inner);
5973 inner = build2 (RSHIFT_EXPR, intermediate_type,
5974 inner, size_int (bitnum));
5976 if (code == EQ_EXPR)
5977 inner = fold (build2 (BIT_XOR_EXPR, intermediate_type,
5978 inner, integer_one_node));
5980 /* Put the AND last so it can combine with more things. */
5981 inner = build2 (BIT_AND_EXPR, intermediate_type,
5982 inner, integer_one_node);
5984 /* Make sure to return the proper type. */
5985 inner = fold_convert (result_type, inner);
5992 /* Check whether we are allowed to reorder operands arg0 and arg1,
5993 such that the evaluation of arg1 occurs before arg0. */
5996 reorder_operands_p (tree arg0, tree arg1)
5998 if (! flag_evaluation_order)
6000 if (TREE_CONSTANT (arg0) || TREE_CONSTANT (arg1))
6002 return ! TREE_SIDE_EFFECTS (arg0)
6003 && ! TREE_SIDE_EFFECTS (arg1);
6006 /* Test whether it is preferable two swap two operands, ARG0 and
6007 ARG1, for example because ARG0 is an integer constant and ARG1
6008 isn't. If REORDER is true, only recommend swapping if we can
6009 evaluate the operands in reverse order. */
6012 tree_swap_operands_p (tree arg0, tree arg1, bool reorder)
6014 STRIP_SIGN_NOPS (arg0);
6015 STRIP_SIGN_NOPS (arg1);
6017 if (TREE_CODE (arg1) == INTEGER_CST)
6019 if (TREE_CODE (arg0) == INTEGER_CST)
6022 if (TREE_CODE (arg1) == REAL_CST)
6024 if (TREE_CODE (arg0) == REAL_CST)
6027 if (TREE_CODE (arg1) == COMPLEX_CST)
6029 if (TREE_CODE (arg0) == COMPLEX_CST)
6032 if (TREE_CONSTANT (arg1))
6034 if (TREE_CONSTANT (arg0))
6040 if (reorder && flag_evaluation_order
6041 && (TREE_SIDE_EFFECTS (arg0) || TREE_SIDE_EFFECTS (arg1)))
6049 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6050 for commutative and comparison operators. Ensuring a canonical
6051 form allows the optimizers to find additional redundancies without
6052 having to explicitly check for both orderings. */
6053 if (TREE_CODE (arg0) == SSA_NAME
6054 && TREE_CODE (arg1) == SSA_NAME
6055 && SSA_NAME_VERSION (arg0) > SSA_NAME_VERSION (arg1))
6061 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where
6062 ARG0 is extended to a wider type. */
6065 fold_widened_comparison (enum tree_code code, tree type, tree arg0, tree arg1)
6067 tree arg0_unw = get_unwidened (arg0, NULL_TREE);
6069 tree shorter_type, outer_type;
6073 if (arg0_unw == arg0)
6075 shorter_type = TREE_TYPE (arg0_unw);
6077 #ifdef HAVE_canonicalize_funcptr_for_compare
6078 /* Disable this optimization if we're casting a function pointer
6079 type on targets that require function pointer canonicalization. */
6080 if (HAVE_canonicalize_funcptr_for_compare
6081 && TREE_CODE (shorter_type) == POINTER_TYPE
6082 && TREE_CODE (TREE_TYPE (shorter_type)) == FUNCTION_TYPE)
6086 if (TYPE_PRECISION (TREE_TYPE (arg0)) <= TYPE_PRECISION (shorter_type))
6089 arg1_unw = get_unwidened (arg1, shorter_type);
6093 /* If possible, express the comparison in the shorter mode. */
6094 if ((code == EQ_EXPR || code == NE_EXPR
6095 || TYPE_UNSIGNED (TREE_TYPE (arg0)) == TYPE_UNSIGNED (shorter_type))
6096 && (TREE_TYPE (arg1_unw) == shorter_type
6097 || (TREE_CODE (arg1_unw) == INTEGER_CST
6098 && TREE_CODE (shorter_type) == INTEGER_TYPE
6099 && int_fits_type_p (arg1_unw, shorter_type))))
6100 return fold (build (code, type, arg0_unw,
6101 fold_convert (shorter_type, arg1_unw)));
6103 if (TREE_CODE (arg1_unw) != INTEGER_CST)
6106 /* If we are comparing with the integer that does not fit into the range
6107 of the shorter type, the result is known. */
6108 outer_type = TREE_TYPE (arg1_unw);
6109 min = lower_bound_in_type (outer_type, shorter_type);
6110 max = upper_bound_in_type (outer_type, shorter_type);
6112 above = integer_nonzerop (fold_relational_const (LT_EXPR, type,
6114 below = integer_nonzerop (fold_relational_const (LT_EXPR, type,
6121 return omit_one_operand (type, integer_zero_node, arg0);
6126 return omit_one_operand (type, integer_one_node, arg0);
6132 return omit_one_operand (type, integer_one_node, arg0);
6134 return omit_one_operand (type, integer_zero_node, arg0);
6139 return omit_one_operand (type, integer_zero_node, arg0);
6141 return omit_one_operand (type, integer_one_node, arg0);
6150 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where for
6151 ARG0 just the signedness is changed. */
6154 fold_sign_changed_comparison (enum tree_code code, tree type,
6155 tree arg0, tree arg1)
6157 tree arg0_inner, tmp;
6158 tree inner_type, outer_type;
6160 if (TREE_CODE (arg0) != NOP_EXPR
6161 && TREE_CODE (arg0) != CONVERT_EXPR)
6164 outer_type = TREE_TYPE (arg0);
6165 arg0_inner = TREE_OPERAND (arg0, 0);
6166 inner_type = TREE_TYPE (arg0_inner);
6168 #ifdef HAVE_canonicalize_funcptr_for_compare
6169 /* Disable this optimization if we're casting a function pointer
6170 type on targets that require function pointer canonicalization. */
6171 if (HAVE_canonicalize_funcptr_for_compare
6172 && TREE_CODE (inner_type) == POINTER_TYPE
6173 && TREE_CODE (TREE_TYPE (inner_type)) == FUNCTION_TYPE)
6177 if (TYPE_PRECISION (inner_type) != TYPE_PRECISION (outer_type))
6180 if (TREE_CODE (arg1) != INTEGER_CST
6181 && !((TREE_CODE (arg1) == NOP_EXPR
6182 || TREE_CODE (arg1) == CONVERT_EXPR)
6183 && TREE_TYPE (TREE_OPERAND (arg1, 0)) == inner_type))
6186 if (TYPE_UNSIGNED (inner_type) != TYPE_UNSIGNED (outer_type)
6191 if (TREE_CODE (arg1) == INTEGER_CST)
6193 tmp = build_int_cst_wide (inner_type,
6194 TREE_INT_CST_LOW (arg1),
6195 TREE_INT_CST_HIGH (arg1));
6196 arg1 = force_fit_type (tmp, 0,
6197 TREE_OVERFLOW (arg1),
6198 TREE_CONSTANT_OVERFLOW (arg1));
6201 arg1 = fold_convert (inner_type, arg1);
6203 return fold (build2 (code, type, arg0_inner, arg1));
6206 /* Tries to replace &a[idx] CODE s * delta with &a[idx CODE delta], if s is
6207 step of the array. ADDR is the address. MULT is the multiplicative expression.
6208 If the function succeeds, the new address expression is returned. Otherwise
6209 NULL_TREE is returned. */
6212 try_move_mult_to_index (enum tree_code code, tree addr, tree mult)
6214 tree s, delta, step;
6215 tree arg0 = TREE_OPERAND (mult, 0), arg1 = TREE_OPERAND (mult, 1);
6216 tree ref = TREE_OPERAND (addr, 0), pref;
6223 if (TREE_CODE (arg0) == INTEGER_CST)
6228 else if (TREE_CODE (arg1) == INTEGER_CST)
6236 for (;; ref = TREE_OPERAND (ref, 0))
6238 if (TREE_CODE (ref) == ARRAY_REF)
6240 step = array_ref_element_size (ref);
6242 if (TREE_CODE (step) != INTEGER_CST)
6245 itype = TREE_TYPE (step);
6247 /* If the type sizes do not match, we might run into problems
6248 when one of them would overflow. */
6249 if (TYPE_PRECISION (itype) != TYPE_PRECISION (TREE_TYPE (s)))
6252 if (!operand_equal_p (step, fold_convert (itype, s), 0))
6255 delta = fold_convert (itype, delta);
6259 if (!handled_component_p (ref))
6263 /* We found the suitable array reference. So copy everything up to it,
6264 and replace the index. */
6266 pref = TREE_OPERAND (addr, 0);
6267 ret = copy_node (pref);
6272 pref = TREE_OPERAND (pref, 0);
6273 TREE_OPERAND (pos, 0) = copy_node (pref);
6274 pos = TREE_OPERAND (pos, 0);
6277 TREE_OPERAND (pos, 1) = fold (build2 (code, itype,
6278 TREE_OPERAND (pos, 1),
6281 return build1 (ADDR_EXPR, TREE_TYPE (addr), ret);
6285 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6286 means A >= Y && A != MAX, but in this case we know that
6287 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6290 fold_to_nonsharp_ineq_using_bound (tree ineq, tree bound)
6292 tree a, typea, type = TREE_TYPE (ineq), a1, diff, y;
6294 if (TREE_CODE (bound) == LT_EXPR)
6295 a = TREE_OPERAND (bound, 0);
6296 else if (TREE_CODE (bound) == GT_EXPR)
6297 a = TREE_OPERAND (bound, 1);
6301 typea = TREE_TYPE (a);
6302 if (!INTEGRAL_TYPE_P (typea)
6303 && !POINTER_TYPE_P (typea))
6306 if (TREE_CODE (ineq) == LT_EXPR)
6308 a1 = TREE_OPERAND (ineq, 1);
6309 y = TREE_OPERAND (ineq, 0);
6311 else if (TREE_CODE (ineq) == GT_EXPR)
6313 a1 = TREE_OPERAND (ineq, 0);
6314 y = TREE_OPERAND (ineq, 1);
6319 if (TREE_TYPE (a1) != typea)
6322 diff = fold (build2 (MINUS_EXPR, typea, a1, a));
6323 if (!integer_onep (diff))
6326 return fold (build2 (GE_EXPR, type, a, y));
6329 /* Fold complex addition when both components are accessible by parts.
6330 Return non-null if successful. CODE should be PLUS_EXPR for addition,
6331 or MINUS_EXPR for subtraction. */
6334 fold_complex_add (tree type, tree ac, tree bc, enum tree_code code)
6336 tree ar, ai, br, bi, rr, ri, inner_type;
6338 if (TREE_CODE (ac) == COMPLEX_EXPR)
6339 ar = TREE_OPERAND (ac, 0), ai = TREE_OPERAND (ac, 1);
6340 else if (TREE_CODE (ac) == COMPLEX_CST)
6341 ar = TREE_REALPART (ac), ai = TREE_IMAGPART (ac);
6345 if (TREE_CODE (bc) == COMPLEX_EXPR)
6346 br = TREE_OPERAND (bc, 0), bi = TREE_OPERAND (bc, 1);
6347 else if (TREE_CODE (bc) == COMPLEX_CST)
6348 br = TREE_REALPART (bc), bi = TREE_IMAGPART (bc);
6352 inner_type = TREE_TYPE (type);
6354 rr = fold (build2 (code, inner_type, ar, br));
6355 ri = fold (build2 (code, inner_type, ai, bi));
6357 return fold (build2 (COMPLEX_EXPR, type, rr, ri));
6360 /* Perform some simplifications of complex multiplication when one or more
6361 of the components are constants or zeros. Return non-null if successful. */
6364 fold_complex_mult_parts (tree type, tree ar, tree ai, tree br, tree bi)
6366 tree rr, ri, inner_type, zero;
6367 bool ar0, ai0, br0, bi0, bi1;
6369 inner_type = TREE_TYPE (type);
6372 if (SCALAR_FLOAT_TYPE_P (inner_type))
6374 ar0 = ai0 = br0 = bi0 = bi1 = false;
6376 /* We're only interested in +0.0 here, thus we don't use real_zerop. */
6378 if (TREE_CODE (ar) == REAL_CST
6379 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ar), dconst0))
6380 ar0 = true, zero = ar;
6382 if (TREE_CODE (ai) == REAL_CST
6383 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst0))
6384 ai0 = true, zero = ai;
6386 if (TREE_CODE (br) == REAL_CST
6387 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (br), dconst0))
6388 br0 = true, zero = br;
6390 if (TREE_CODE (bi) == REAL_CST)
6392 if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst0))
6393 bi0 = true, zero = bi;
6394 else if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst1))
6400 ar0 = integer_zerop (ar);
6403 ai0 = integer_zerop (ai);
6406 br0 = integer_zerop (br);
6409 bi0 = integer_zerop (bi);
6416 bi1 = integer_onep (bi);
6419 /* We won't optimize anything below unless something is zero. */
6423 if (ai0 && br0 && bi1)
6428 else if (ai0 && bi0)
6430 rr = fold (build2 (MULT_EXPR, inner_type, ar, br));
6433 else if (ai0 && br0)
6436 ri = fold (build2 (MULT_EXPR, inner_type, ar, bi));
6438 else if (ar0 && bi0)
6441 ri = fold (build2 (MULT_EXPR, inner_type, ai, br));
6443 else if (ar0 && br0)
6445 rr = fold (build2 (MULT_EXPR, inner_type, ai, bi));
6446 rr = fold (build1 (NEGATE_EXPR, inner_type, rr));
6451 rr = fold (build2 (MULT_EXPR, inner_type, ar, br));
6452 ri = fold (build2 (MULT_EXPR, inner_type, ai, br));
6456 rr = fold (build2 (MULT_EXPR, inner_type, ar, br));
6457 ri = fold (build2 (MULT_EXPR, inner_type, ar, bi));
6461 rr = fold (build2 (MULT_EXPR, inner_type, ai, bi));
6462 rr = fold (build1 (NEGATE_EXPR, inner_type, rr));
6463 ri = fold (build2 (MULT_EXPR, inner_type, ar, bi));
6467 rr = fold (build2 (MULT_EXPR, inner_type, ai, bi));
6468 rr = fold (build1 (NEGATE_EXPR, inner_type, rr));
6469 ri = fold (build2 (MULT_EXPR, inner_type, ai, br));
6474 return fold (build2 (COMPLEX_EXPR, type, rr, ri));
6478 fold_complex_mult (tree type, tree ac, tree bc)
6480 tree ar, ai, br, bi;
6482 if (TREE_CODE (ac) == COMPLEX_EXPR)
6483 ar = TREE_OPERAND (ac, 0), ai = TREE_OPERAND (ac, 1);
6484 else if (TREE_CODE (ac) == COMPLEX_CST)
6485 ar = TREE_REALPART (ac), ai = TREE_IMAGPART (ac);
6489 if (TREE_CODE (bc) == COMPLEX_EXPR)
6490 br = TREE_OPERAND (bc, 0), bi = TREE_OPERAND (bc, 1);
6491 else if (TREE_CODE (bc) == COMPLEX_CST)
6492 br = TREE_REALPART (bc), bi = TREE_IMAGPART (bc);
6496 return fold_complex_mult_parts (type, ar, ai, br, bi);
6499 /* Perform some simplifications of complex division when one or more of
6500 the components are constants or zeros. Return non-null if successful. */
6503 fold_complex_div_parts (tree type, tree ar, tree ai, tree br, tree bi,
6504 enum tree_code code)
6506 tree rr, ri, inner_type, zero;
6507 bool ar0, ai0, br0, bi0, bi1;
6509 inner_type = TREE_TYPE (type);
6512 if (SCALAR_FLOAT_TYPE_P (inner_type))
6514 ar0 = ai0 = br0 = bi0 = bi1 = false;
6516 /* We're only interested in +0.0 here, thus we don't use real_zerop. */
6518 if (TREE_CODE (ar) == REAL_CST
6519 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ar), dconst0))
6520 ar0 = true, zero = ar;
6522 if (TREE_CODE (ai) == REAL_CST
6523 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst0))
6524 ai0 = true, zero = ai;
6526 if (TREE_CODE (br) == REAL_CST
6527 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (br), dconst0))
6528 br0 = true, zero = br;
6530 if (TREE_CODE (bi) == REAL_CST)
6532 if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst0))
6533 bi0 = true, zero = bi;
6534 else if (REAL_VALUES_IDENTICAL (TREE_REAL_CST (bi), dconst1))
6540 ar0 = integer_zerop (ar);
6543 ai0 = integer_zerop (ai);
6546 br0 = integer_zerop (br);
6549 bi0 = integer_zerop (bi);
6556 bi1 = integer_onep (bi);
6559 /* We won't optimize anything below unless something is zero. */
6565 rr = fold (build2 (code, inner_type, ar, br));
6568 else if (ai0 && br0)
6571 ri = fold (build2 (code, inner_type, ar, bi));
6572 ri = fold (build1 (NEGATE_EXPR, inner_type, ri));
6574 else if (ar0 && bi0)
6577 ri = fold (build2 (code, inner_type, ai, br));
6579 else if (ar0 && br0)
6581 rr = fold (build2 (code, inner_type, ai, bi));
6586 rr = fold (build2 (code, inner_type, ar, br));
6587 ri = fold (build2 (code, inner_type, ai, br));
6591 rr = fold (build2 (code, inner_type, ai, bi));
6592 ri = fold (build2 (code, inner_type, ar, bi));
6593 ri = fold (build1 (NEGATE_EXPR, inner_type, ri));
6598 return fold (build2 (COMPLEX_EXPR, type, rr, ri));
6602 fold_complex_div (tree type, tree ac, tree bc, enum tree_code code)
6604 tree ar, ai, br, bi;
6606 if (TREE_CODE (ac) == COMPLEX_EXPR)
6607 ar = TREE_OPERAND (ac, 0), ai = TREE_OPERAND (ac, 1);
6608 else if (TREE_CODE (ac) == COMPLEX_CST)
6609 ar = TREE_REALPART (ac), ai = TREE_IMAGPART (ac);
6613 if (TREE_CODE (bc) == COMPLEX_EXPR)
6614 br = TREE_OPERAND (bc, 0), bi = TREE_OPERAND (bc, 1);
6615 else if (TREE_CODE (bc) == COMPLEX_CST)
6616 br = TREE_REALPART (bc), bi = TREE_IMAGPART (bc);
6620 return fold_complex_div_parts (type, ar, ai, br, bi, code);
6623 /* Fold a unary expression of code CODE and type TYPE with operand
6624 OP0. Return the folded expression if folding is successful.
6625 Otherwise, return NULL_TREE. */
6628 fold_unary (enum tree_code code, tree type, tree op0)
6632 enum tree_code_class kind = TREE_CODE_CLASS (code);
6634 gcc_assert (IS_EXPR_CODE_CLASS (kind)
6635 && TREE_CODE_LENGTH (code) == 1);
6640 if (code == NOP_EXPR || code == FLOAT_EXPR || code == CONVERT_EXPR)
6642 /* Don't use STRIP_NOPS, because signedness of argument type matters. */
6643 STRIP_SIGN_NOPS (arg0);
6647 /* Strip any conversions that don't change the mode. This
6648 is safe for every expression, except for a comparison
6649 expression because its signedness is derived from its
6652 Note that this is done as an internal manipulation within
6653 the constant folder, in order to find the simplest
6654 representation of the arguments so that their form can be
6655 studied. In any cases, the appropriate type conversions
6656 should be put back in the tree that will get out of the
6662 if (TREE_CODE_CLASS (code) == tcc_unary)
6664 if (TREE_CODE (arg0) == COMPOUND_EXPR)
6665 return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg0, 0),
6666 fold (build1 (code, type, TREE_OPERAND (arg0, 1))));
6667 else if (TREE_CODE (arg0) == COND_EXPR)
6669 tree arg01 = TREE_OPERAND (arg0, 1);
6670 tree arg02 = TREE_OPERAND (arg0, 2);
6671 if (! VOID_TYPE_P (TREE_TYPE (arg01)))
6672 arg01 = fold (build1 (code, type, arg01));
6673 if (! VOID_TYPE_P (TREE_TYPE (arg02)))
6674 arg02 = fold (build1 (code, type, arg02));
6675 tem = fold (build3 (COND_EXPR, type, TREE_OPERAND (arg0, 0),
6678 /* If this was a conversion, and all we did was to move into
6679 inside the COND_EXPR, bring it back out. But leave it if
6680 it is a conversion from integer to integer and the
6681 result precision is no wider than a word since such a
6682 conversion is cheap and may be optimized away by combine,
6683 while it couldn't if it were outside the COND_EXPR. Then return
6684 so we don't get into an infinite recursion loop taking the
6685 conversion out and then back in. */
6687 if ((code == NOP_EXPR || code == CONVERT_EXPR
6688 || code == NON_LVALUE_EXPR)
6689 && TREE_CODE (tem) == COND_EXPR
6690 && TREE_CODE (TREE_OPERAND (tem, 1)) == code
6691 && TREE_CODE (TREE_OPERAND (tem, 2)) == code
6692 && ! VOID_TYPE_P (TREE_OPERAND (tem, 1))
6693 && ! VOID_TYPE_P (TREE_OPERAND (tem, 2))
6694 && (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem, 1), 0))
6695 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem, 2), 0)))
6696 && (! (INTEGRAL_TYPE_P (TREE_TYPE (tem))
6698 (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (tem, 1), 0))))
6699 && TYPE_PRECISION (TREE_TYPE (tem)) <= BITS_PER_WORD)
6700 || flag_syntax_only))
6701 tem = build1 (code, type,
6703 TREE_TYPE (TREE_OPERAND
6704 (TREE_OPERAND (tem, 1), 0)),
6705 TREE_OPERAND (tem, 0),
6706 TREE_OPERAND (TREE_OPERAND (tem, 1), 0),
6707 TREE_OPERAND (TREE_OPERAND (tem, 2), 0)));
6710 else if (COMPARISON_CLASS_P (arg0))
6712 if (TREE_CODE (type) == BOOLEAN_TYPE)
6714 arg0 = copy_node (arg0);
6715 TREE_TYPE (arg0) = type;
6718 else if (TREE_CODE (type) != INTEGER_TYPE)
6719 return fold (build3 (COND_EXPR, type, arg0,
6720 fold (build1 (code, type,
6722 fold (build1 (code, type,
6723 integer_zero_node))));
6732 case FIX_TRUNC_EXPR:
6734 case FIX_FLOOR_EXPR:
6735 case FIX_ROUND_EXPR:
6736 if (TREE_TYPE (op0) == type)
6739 /* Handle cases of two conversions in a row. */
6740 if (TREE_CODE (op0) == NOP_EXPR
6741 || TREE_CODE (op0) == CONVERT_EXPR)
6743 tree inside_type = TREE_TYPE (TREE_OPERAND (op0, 0));
6744 tree inter_type = TREE_TYPE (op0);
6745 int inside_int = INTEGRAL_TYPE_P (inside_type);
6746 int inside_ptr = POINTER_TYPE_P (inside_type);
6747 int inside_float = FLOAT_TYPE_P (inside_type);
6748 unsigned int inside_prec = TYPE_PRECISION (inside_type);
6749 int inside_unsignedp = TYPE_UNSIGNED (inside_type);
6750 int inter_int = INTEGRAL_TYPE_P (inter_type);
6751 int inter_ptr = POINTER_TYPE_P (inter_type);
6752 int inter_float = FLOAT_TYPE_P (inter_type);
6753 unsigned int inter_prec = TYPE_PRECISION (inter_type);
6754 int inter_unsignedp = TYPE_UNSIGNED (inter_type);
6755 int final_int = INTEGRAL_TYPE_P (type);
6756 int final_ptr = POINTER_TYPE_P (type);
6757 int final_float = FLOAT_TYPE_P (type);
6758 unsigned int final_prec = TYPE_PRECISION (type);
6759 int final_unsignedp = TYPE_UNSIGNED (type);
6761 /* In addition to the cases of two conversions in a row
6762 handled below, if we are converting something to its own
6763 type via an object of identical or wider precision, neither
6764 conversion is needed. */
6765 if (TYPE_MAIN_VARIANT (inside_type) == TYPE_MAIN_VARIANT (type)
6766 && ((inter_int && final_int) || (inter_float && final_float))
6767 && inter_prec >= final_prec)
6768 return fold (build1 (code, type, TREE_OPERAND (op0, 0)));
6770 /* Likewise, if the intermediate and final types are either both
6771 float or both integer, we don't need the middle conversion if
6772 it is wider than the final type and doesn't change the signedness
6773 (for integers). Avoid this if the final type is a pointer
6774 since then we sometimes need the inner conversion. Likewise if
6775 the outer has a precision not equal to the size of its mode. */
6776 if ((((inter_int || inter_ptr) && (inside_int || inside_ptr))
6777 || (inter_float && inside_float))
6778 && inter_prec >= inside_prec
6779 && (inter_float || inter_unsignedp == inside_unsignedp)
6780 && ! (final_prec != GET_MODE_BITSIZE (TYPE_MODE (type))
6781 && TYPE_MODE (type) == TYPE_MODE (inter_type))
6783 return fold (build1 (code, type, TREE_OPERAND (op0, 0)));
6785 /* If we have a sign-extension of a zero-extended value, we can
6786 replace that by a single zero-extension. */
6787 if (inside_int && inter_int && final_int
6788 && inside_prec < inter_prec && inter_prec < final_prec
6789 && inside_unsignedp && !inter_unsignedp)
6790 return fold (build1 (code, type, TREE_OPERAND (op0, 0)));
6792 /* Two conversions in a row are not needed unless:
6793 - some conversion is floating-point (overstrict for now), or
6794 - the intermediate type is narrower than both initial and
6796 - the intermediate type and innermost type differ in signedness,
6797 and the outermost type is wider than the intermediate, or
6798 - the initial type is a pointer type and the precisions of the
6799 intermediate and final types differ, or
6800 - the final type is a pointer type and the precisions of the
6801 initial and intermediate types differ. */
6802 if (! inside_float && ! inter_float && ! final_float
6803 && (inter_prec > inside_prec || inter_prec > final_prec)
6804 && ! (inside_int && inter_int
6805 && inter_unsignedp != inside_unsignedp
6806 && inter_prec < final_prec)
6807 && ((inter_unsignedp && inter_prec > inside_prec)
6808 == (final_unsignedp && final_prec > inter_prec))
6809 && ! (inside_ptr && inter_prec != final_prec)
6810 && ! (final_ptr && inside_prec != inter_prec)
6811 && ! (final_prec != GET_MODE_BITSIZE (TYPE_MODE (type))
6812 && TYPE_MODE (type) == TYPE_MODE (inter_type))
6814 return fold (build1 (code, type, TREE_OPERAND (op0, 0)));
6817 if (TREE_CODE (op0) == MODIFY_EXPR
6818 && TREE_CONSTANT (TREE_OPERAND (op0, 1))
6819 /* Detect assigning a bitfield. */
6820 && !(TREE_CODE (TREE_OPERAND (op0, 0)) == COMPONENT_REF
6821 && DECL_BIT_FIELD (TREE_OPERAND (TREE_OPERAND (op0, 0), 1))))
6823 /* Don't leave an assignment inside a conversion
6824 unless assigning a bitfield. */
6825 tem = build1 (code, type, TREE_OPERAND (op0, 1));
6826 /* First do the assignment, then return converted constant. */
6827 tem = build2 (COMPOUND_EXPR, TREE_TYPE (tem), op0, fold (tem));
6828 TREE_NO_WARNING (tem) = 1;
6829 TREE_USED (tem) = 1;
6833 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
6834 constants (if x has signed type, the sign bit cannot be set
6835 in c). This folds extension into the BIT_AND_EXPR. */
6836 if (INTEGRAL_TYPE_P (type)
6837 && TREE_CODE (type) != BOOLEAN_TYPE
6838 && TREE_CODE (op0) == BIT_AND_EXPR
6839 && TREE_CODE (TREE_OPERAND (op0, 1)) == INTEGER_CST)
6842 tree and0 = TREE_OPERAND (and, 0), and1 = TREE_OPERAND (and, 1);
6845 if (TYPE_UNSIGNED (TREE_TYPE (and))
6846 || (TYPE_PRECISION (type)
6847 <= TYPE_PRECISION (TREE_TYPE (and))))
6849 else if (TYPE_PRECISION (TREE_TYPE (and1))
6850 <= HOST_BITS_PER_WIDE_INT
6851 && host_integerp (and1, 1))
6853 unsigned HOST_WIDE_INT cst;
6855 cst = tree_low_cst (and1, 1);
6856 cst &= (HOST_WIDE_INT) -1
6857 << (TYPE_PRECISION (TREE_TYPE (and1)) - 1);
6858 change = (cst == 0);
6859 #ifdef LOAD_EXTEND_OP
6861 && !flag_syntax_only
6862 && (LOAD_EXTEND_OP (TYPE_MODE (TREE_TYPE (and0)))
6865 tree uns = lang_hooks.types.unsigned_type (TREE_TYPE (and0));
6866 and0 = fold_convert (uns, and0);
6867 and1 = fold_convert (uns, and1);
6873 tem = build_int_cst_wide (type, TREE_INT_CST_LOW (and1),
6874 TREE_INT_CST_HIGH (and1));
6875 tem = force_fit_type (tem, 0, TREE_OVERFLOW (and1),
6876 TREE_CONSTANT_OVERFLOW (and1));
6877 return fold (build2 (BIT_AND_EXPR, type,
6878 fold_convert (type, and0), tem));
6882 /* Convert (T1)((T2)X op Y) into (T1)X op Y, for pointer types T1 and
6883 T2 being pointers to types of the same size. */
6884 if (POINTER_TYPE_P (type)
6885 && BINARY_CLASS_P (arg0)
6886 && TREE_CODE (TREE_OPERAND (arg0, 0)) == NOP_EXPR
6887 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg0, 0))))
6889 tree arg00 = TREE_OPERAND (arg0, 0);
6891 tree t1 = TREE_TYPE (arg00);
6892 tree tt0 = TREE_TYPE (t0);
6893 tree tt1 = TREE_TYPE (t1);
6894 tree s0 = TYPE_SIZE (tt0);
6895 tree s1 = TYPE_SIZE (tt1);
6897 if (s0 && s1 && operand_equal_p (s0, s1, OEP_ONLY_CONST))
6898 return build2 (TREE_CODE (arg0), t0, fold_convert (t0, arg00),
6899 TREE_OPERAND (arg0, 1));
6902 tem = fold_convert_const (code, type, arg0);
6903 return tem ? tem : NULL_TREE;
6905 case VIEW_CONVERT_EXPR:
6906 if (TREE_CODE (op0) == VIEW_CONVERT_EXPR)
6907 return build1 (VIEW_CONVERT_EXPR, type, TREE_OPERAND (op0, 0));
6911 if (negate_expr_p (arg0))
6912 return fold_convert (type, negate_expr (arg0));
6913 /* Convert - (~A) to A + 1. */
6914 if (INTEGRAL_TYPE_P (type) && TREE_CODE (arg0) == BIT_NOT_EXPR)
6915 return fold (build2 (PLUS_EXPR, type, TREE_OPERAND (arg0, 0),
6916 build_int_cst (type, 1)));
6920 if (TREE_CODE (arg0) == INTEGER_CST || TREE_CODE (arg0) == REAL_CST)
6921 return fold_abs_const (arg0, type);
6922 else if (TREE_CODE (arg0) == NEGATE_EXPR)
6923 return fold (build1 (ABS_EXPR, type, TREE_OPERAND (arg0, 0)));
6924 /* Convert fabs((double)float) into (double)fabsf(float). */
6925 else if (TREE_CODE (arg0) == NOP_EXPR
6926 && TREE_CODE (type) == REAL_TYPE)
6928 tree targ0 = strip_float_extensions (arg0);
6930 return fold_convert (type, fold (build1 (ABS_EXPR,
6934 else if (tree_expr_nonnegative_p (arg0))
6937 /* Strip sign ops from argument. */
6938 if (TREE_CODE (type) == REAL_TYPE)
6940 tem = fold_strip_sign_ops (arg0);
6942 return fold (build1 (ABS_EXPR, type, fold_convert (type, tem)));
6947 if (TREE_CODE (TREE_TYPE (arg0)) != COMPLEX_TYPE)
6948 return fold_convert (type, arg0);
6949 else if (TREE_CODE (arg0) == COMPLEX_EXPR)
6950 return build2 (COMPLEX_EXPR, type,
6951 TREE_OPERAND (arg0, 0),
6952 negate_expr (TREE_OPERAND (arg0, 1)));
6953 else if (TREE_CODE (arg0) == COMPLEX_CST)
6954 return build_complex (type, TREE_REALPART (arg0),
6955 negate_expr (TREE_IMAGPART (arg0)));
6956 else if (TREE_CODE (arg0) == PLUS_EXPR || TREE_CODE (arg0) == MINUS_EXPR)
6957 return fold (build2 (TREE_CODE (arg0), type,
6958 fold (build1 (CONJ_EXPR, type,
6959 TREE_OPERAND (arg0, 0))),
6960 fold (build1 (CONJ_EXPR, type,
6961 TREE_OPERAND (arg0, 1)))));
6962 else if (TREE_CODE (arg0) == CONJ_EXPR)
6963 return TREE_OPERAND (arg0, 0);
6967 if (TREE_CODE (arg0) == INTEGER_CST)
6968 return fold_not_const (arg0, type);
6969 else if (TREE_CODE (arg0) == BIT_NOT_EXPR)
6970 return TREE_OPERAND (arg0, 0);
6971 /* Convert ~ (-A) to A - 1. */
6972 else if (INTEGRAL_TYPE_P (type) && TREE_CODE (arg0) == NEGATE_EXPR)
6973 return fold (build2 (MINUS_EXPR, type, TREE_OPERAND (arg0, 0),
6974 build_int_cst (type, 1)));
6975 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
6976 else if (INTEGRAL_TYPE_P (type)
6977 && ((TREE_CODE (arg0) == MINUS_EXPR
6978 && integer_onep (TREE_OPERAND (arg0, 1)))
6979 || (TREE_CODE (arg0) == PLUS_EXPR
6980 && integer_all_onesp (TREE_OPERAND (arg0, 1)))))
6981 return fold (build1 (NEGATE_EXPR, type, TREE_OPERAND (arg0, 0)));
6984 case TRUTH_NOT_EXPR:
6985 /* The argument to invert_truthvalue must have Boolean type. */
6986 if (TREE_CODE (TREE_TYPE (arg0)) != BOOLEAN_TYPE)
6987 arg0 = fold_convert (boolean_type_node, arg0);
6989 /* Note that the operand of this must be an int
6990 and its values must be 0 or 1.
6991 ("true" is a fixed value perhaps depending on the language,
6992 but we don't handle values other than 1 correctly yet.) */
6993 tem = invert_truthvalue (arg0);
6994 /* Avoid infinite recursion. */
6995 if (TREE_CODE (tem) == TRUTH_NOT_EXPR)
6997 return fold_convert (type, tem);
7000 if (TREE_CODE (TREE_TYPE (arg0)) != COMPLEX_TYPE)
7002 else if (TREE_CODE (arg0) == COMPLEX_EXPR)
7003 return omit_one_operand (type, TREE_OPERAND (arg0, 0),
7004 TREE_OPERAND (arg0, 1));
7005 else if (TREE_CODE (arg0) == COMPLEX_CST)
7006 return TREE_REALPART (arg0);
7007 else if (TREE_CODE (arg0) == PLUS_EXPR || TREE_CODE (arg0) == MINUS_EXPR)
7008 return fold (build2 (TREE_CODE (arg0), type,
7009 fold (build1 (REALPART_EXPR, type,
7010 TREE_OPERAND (arg0, 0))),
7011 fold (build1 (REALPART_EXPR, type,
7012 TREE_OPERAND (arg0, 1)))));
7016 if (TREE_CODE (TREE_TYPE (arg0)) != COMPLEX_TYPE)
7017 return fold_convert (type, integer_zero_node);
7018 else if (TREE_CODE (arg0) == COMPLEX_EXPR)
7019 return omit_one_operand (type, TREE_OPERAND (arg0, 1),
7020 TREE_OPERAND (arg0, 0));
7021 else if (TREE_CODE (arg0) == COMPLEX_CST)
7022 return TREE_IMAGPART (arg0);
7023 else if (TREE_CODE (arg0) == PLUS_EXPR || TREE_CODE (arg0) == MINUS_EXPR)
7024 return fold (build2 (TREE_CODE (arg0), type,
7025 fold (build1 (IMAGPART_EXPR, type,
7026 TREE_OPERAND (arg0, 0))),
7027 fold (build1 (IMAGPART_EXPR, type,
7028 TREE_OPERAND (arg0, 1)))));
7033 } /* switch (code) */
7036 /* Fold a binary expression of code CODE and type TYPE with operands
7037 OP0 and OP1. Return the folded expression if folding is
7038 successful. Otherwise, return NULL_TREE. */
7041 fold_binary (enum tree_code code, tree type, tree op0, tree op1)
7043 tree t1 = NULL_TREE;
7045 tree arg0 = NULL_TREE, arg1 = NULL_TREE;
7046 enum tree_code_class kind = TREE_CODE_CLASS (code);
7048 /* WINS will be nonzero when the switch is done
7049 if all operands are constant. */
7052 gcc_assert (IS_EXPR_CODE_CLASS (kind)
7053 && TREE_CODE_LENGTH (code) == 2);
7062 /* Strip any conversions that don't change the mode. This is
7063 safe for every expression, except for a comparison expression
7064 because its signedness is derived from its operands. So, in
7065 the latter case, only strip conversions that don't change the
7068 Note that this is done as an internal manipulation within the
7069 constant folder, in order to find the simplest representation
7070 of the arguments so that their form can be studied. In any
7071 cases, the appropriate type conversions should be put back in
7072 the tree that will get out of the constant folder. */
7073 if (kind == tcc_comparison)
7074 STRIP_SIGN_NOPS (arg0);
7078 if (TREE_CODE (arg0) == COMPLEX_CST)
7079 subop = TREE_REALPART (arg0);
7083 if (TREE_CODE (subop) != INTEGER_CST
7084 && TREE_CODE (subop) != REAL_CST)
7085 /* Note that TREE_CONSTANT isn't enough:
7086 static var addresses are constant but we can't
7087 do arithmetic on them. */
7095 /* Strip any conversions that don't change the mode. This is
7096 safe for every expression, except for a comparison expression
7097 because its signedness is derived from its operands. So, in
7098 the latter case, only strip conversions that don't change the
7101 Note that this is done as an internal manipulation within the
7102 constant folder, in order to find the simplest representation
7103 of the arguments so that their form can be studied. In any
7104 cases, the appropriate type conversions should be put back in
7105 the tree that will get out of the constant folder. */
7106 if (kind == tcc_comparison)
7107 STRIP_SIGN_NOPS (arg1);
7111 if (TREE_CODE (arg1) == COMPLEX_CST)
7112 subop = TREE_REALPART (arg1);
7116 if (TREE_CODE (subop) != INTEGER_CST
7117 && TREE_CODE (subop) != REAL_CST)
7118 /* Note that TREE_CONSTANT isn't enough:
7119 static var addresses are constant but we can't
7120 do arithmetic on them. */
7124 /* If this is a commutative operation, and ARG0 is a constant, move it
7125 to ARG1 to reduce the number of tests below. */
7126 if (commutative_tree_code (code)
7127 && tree_swap_operands_p (arg0, arg1, true))
7128 return fold (build2 (code, type, op1, op0));
7130 /* Now WINS is set as described above,
7131 ARG0 is the first operand of EXPR,
7132 and ARG1 is the second operand (if it has more than one operand).
7134 First check for cases where an arithmetic operation is applied to a
7135 compound, conditional, or comparison operation. Push the arithmetic
7136 operation inside the compound or conditional to see if any folding
7137 can then be done. Convert comparison to conditional for this purpose.
7138 The also optimizes non-constant cases that used to be done in
7141 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
7142 one of the operands is a comparison and the other is a comparison, a
7143 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
7144 code below would make the expression more complex. Change it to a
7145 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
7146 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
7148 if ((code == BIT_AND_EXPR || code == BIT_IOR_EXPR
7149 || code == EQ_EXPR || code == NE_EXPR)
7150 && ((truth_value_p (TREE_CODE (arg0))
7151 && (truth_value_p (TREE_CODE (arg1))
7152 || (TREE_CODE (arg1) == BIT_AND_EXPR
7153 && integer_onep (TREE_OPERAND (arg1, 1)))))
7154 || (truth_value_p (TREE_CODE (arg1))
7155 && (truth_value_p (TREE_CODE (arg0))
7156 || (TREE_CODE (arg0) == BIT_AND_EXPR
7157 && integer_onep (TREE_OPERAND (arg0, 1)))))))
7159 tem = fold (build2 (code == BIT_AND_EXPR ? TRUTH_AND_EXPR
7160 : code == BIT_IOR_EXPR ? TRUTH_OR_EXPR
7163 fold_convert (boolean_type_node, arg0),
7164 fold_convert (boolean_type_node, arg1)));
7166 if (code == EQ_EXPR)
7167 tem = invert_truthvalue (tem);
7169 return fold_convert (type, tem);
7172 if (TREE_CODE_CLASS (code) == tcc_comparison
7173 && TREE_CODE (arg0) == COMPOUND_EXPR)
7174 return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg0, 0),
7175 fold (build2 (code, type, TREE_OPERAND (arg0, 1), arg1)));
7176 else if (TREE_CODE_CLASS (code) == tcc_comparison
7177 && TREE_CODE (arg1) == COMPOUND_EXPR)
7178 return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg1, 0),
7179 fold (build2 (code, type, arg0, TREE_OPERAND (arg1, 1))));
7180 else if (TREE_CODE_CLASS (code) == tcc_binary
7181 || TREE_CODE_CLASS (code) == tcc_comparison)
7183 if (TREE_CODE (arg0) == COMPOUND_EXPR)
7184 return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg0, 0),
7185 fold (build2 (code, type, TREE_OPERAND (arg0, 1),
7187 if (TREE_CODE (arg1) == COMPOUND_EXPR
7188 && reorder_operands_p (arg0, TREE_OPERAND (arg1, 0)))
7189 return build2 (COMPOUND_EXPR, type, TREE_OPERAND (arg1, 0),
7190 fold (build2 (code, type,
7191 arg0, TREE_OPERAND (arg1, 1))));
7193 if (TREE_CODE (arg0) == COND_EXPR || COMPARISON_CLASS_P (arg0))
7195 tem = fold_binary_op_with_conditional_arg (code, type, op0, op1,
7197 /*cond_first_p=*/1);
7198 if (tem != NULL_TREE)
7202 if (TREE_CODE (arg1) == COND_EXPR || COMPARISON_CLASS_P (arg1))
7204 tem = fold_binary_op_with_conditional_arg (code, type, op0, op1,
7206 /*cond_first_p=*/0);
7207 if (tem != NULL_TREE)
7215 /* A + (-B) -> A - B */
7216 if (TREE_CODE (arg1) == NEGATE_EXPR)
7217 return fold (build2 (MINUS_EXPR, type, arg0, TREE_OPERAND (arg1, 0)));
7218 /* (-A) + B -> B - A */
7219 if (TREE_CODE (arg0) == NEGATE_EXPR
7220 && reorder_operands_p (TREE_OPERAND (arg0, 0), arg1))
7221 return fold (build2 (MINUS_EXPR, type, arg1, TREE_OPERAND (arg0, 0)));
7222 /* Convert ~A + 1 to -A. */
7223 if (INTEGRAL_TYPE_P (type)
7224 && TREE_CODE (arg0) == BIT_NOT_EXPR
7225 && integer_onep (arg1))
7226 return fold (build1 (NEGATE_EXPR, type, TREE_OPERAND (arg0, 0)));
7228 if (TREE_CODE (type) == COMPLEX_TYPE)
7230 tem = fold_complex_add (type, arg0, arg1, PLUS_EXPR);
7235 if (! FLOAT_TYPE_P (type))
7237 if (integer_zerop (arg1))
7238 return non_lvalue (fold_convert (type, arg0));
7240 /* If we are adding two BIT_AND_EXPR's, both of which are and'ing
7241 with a constant, and the two constants have no bits in common,
7242 we should treat this as a BIT_IOR_EXPR since this may produce more
7244 if (TREE_CODE (arg0) == BIT_AND_EXPR
7245 && TREE_CODE (arg1) == BIT_AND_EXPR
7246 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
7247 && TREE_CODE (TREE_OPERAND (arg1, 1)) == INTEGER_CST
7248 && integer_zerop (const_binop (BIT_AND_EXPR,
7249 TREE_OPERAND (arg0, 1),
7250 TREE_OPERAND (arg1, 1), 0)))
7252 code = BIT_IOR_EXPR;
7256 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
7257 (plus (plus (mult) (mult)) (foo)) so that we can
7258 take advantage of the factoring cases below. */
7259 if (((TREE_CODE (arg0) == PLUS_EXPR
7260 || TREE_CODE (arg0) == MINUS_EXPR)
7261 && TREE_CODE (arg1) == MULT_EXPR)
7262 || ((TREE_CODE (arg1) == PLUS_EXPR
7263 || TREE_CODE (arg1) == MINUS_EXPR)
7264 && TREE_CODE (arg0) == MULT_EXPR))
7266 tree parg0, parg1, parg, marg;
7267 enum tree_code pcode;
7269 if (TREE_CODE (arg1) == MULT_EXPR)
7270 parg = arg0, marg = arg1;
7272 parg = arg1, marg = arg0;
7273 pcode = TREE_CODE (parg);
7274 parg0 = TREE_OPERAND (parg, 0);
7275 parg1 = TREE_OPERAND (parg, 1);
7279 if (TREE_CODE (parg0) == MULT_EXPR
7280 && TREE_CODE (parg1) != MULT_EXPR)
7281 return fold (build2 (pcode, type,
7282 fold (build2 (PLUS_EXPR, type,
7283 fold_convert (type, parg0),
7284 fold_convert (type, marg))),
7285 fold_convert (type, parg1)));
7286 if (TREE_CODE (parg0) != MULT_EXPR
7287 && TREE_CODE (parg1) == MULT_EXPR)
7288 return fold (build2 (PLUS_EXPR, type,
7289 fold_convert (type, parg0),
7290 fold (build2 (pcode, type,
7291 fold_convert (type, marg),
7296 if (TREE_CODE (arg0) == MULT_EXPR && TREE_CODE (arg1) == MULT_EXPR)
7298 tree arg00, arg01, arg10, arg11;
7299 tree alt0 = NULL_TREE, alt1 = NULL_TREE, same;
7301 /* (A * C) + (B * C) -> (A+B) * C.
7302 We are most concerned about the case where C is a constant,
7303 but other combinations show up during loop reduction. Since
7304 it is not difficult, try all four possibilities. */
7306 arg00 = TREE_OPERAND (arg0, 0);
7307 arg01 = TREE_OPERAND (arg0, 1);
7308 arg10 = TREE_OPERAND (arg1, 0);
7309 arg11 = TREE_OPERAND (arg1, 1);
7312 if (operand_equal_p (arg01, arg11, 0))
7313 same = arg01, alt0 = arg00, alt1 = arg10;
7314 else if (operand_equal_p (arg00, arg10, 0))
7315 same = arg00, alt0 = arg01, alt1 = arg11;
7316 else if (operand_equal_p (arg00, arg11, 0))
7317 same = arg00, alt0 = arg01, alt1 = arg10;
7318 else if (operand_equal_p (arg01, arg10, 0))
7319 same = arg01, alt0 = arg00, alt1 = arg11;
7321 /* No identical multiplicands; see if we can find a common
7322 power-of-two factor in non-power-of-two multiplies. This
7323 can help in multi-dimensional array access. */
7324 else if (TREE_CODE (arg01) == INTEGER_CST
7325 && TREE_CODE (arg11) == INTEGER_CST
7326 && TREE_INT_CST_HIGH (arg01) == 0
7327 && TREE_INT_CST_HIGH (arg11) == 0)
7329 HOST_WIDE_INT int01, int11, tmp;
7330 int01 = TREE_INT_CST_LOW (arg01);
7331 int11 = TREE_INT_CST_LOW (arg11);
7333 /* Move min of absolute values to int11. */
7334 if ((int01 >= 0 ? int01 : -int01)
7335 < (int11 >= 0 ? int11 : -int11))
7337 tmp = int01, int01 = int11, int11 = tmp;
7338 alt0 = arg00, arg00 = arg10, arg10 = alt0;
7339 alt0 = arg01, arg01 = arg11, arg11 = alt0;
7342 if (exact_log2 (int11) > 0 && int01 % int11 == 0)
7344 alt0 = fold (build2 (MULT_EXPR, type, arg00,
7345 build_int_cst (NULL_TREE,
7353 return fold (build2 (MULT_EXPR, type,
7354 fold (build2 (PLUS_EXPR, type,
7355 fold_convert (type, alt0),
7356 fold_convert (type, alt1))),
7360 /* Try replacing &a[i1] + c * i2 with &a[i1 + i2], if c is step
7361 of the array. Loop optimizer sometimes produce this type of
7363 if (TREE_CODE (arg0) == ADDR_EXPR
7364 && TREE_CODE (arg1) == MULT_EXPR)
7366 tem = try_move_mult_to_index (PLUS_EXPR, arg0, arg1);
7368 return fold_convert (type, fold (tem));
7370 else if (TREE_CODE (arg1) == ADDR_EXPR
7371 && TREE_CODE (arg0) == MULT_EXPR)
7373 tem = try_move_mult_to_index (PLUS_EXPR, arg1, arg0);
7375 return fold_convert (type, fold (tem));
7380 /* See if ARG1 is zero and X + ARG1 reduces to X. */
7381 if (fold_real_zero_addition_p (TREE_TYPE (arg0), arg1, 0))
7382 return non_lvalue (fold_convert (type, arg0));
7384 /* Likewise if the operands are reversed. */
7385 if (fold_real_zero_addition_p (TREE_TYPE (arg1), arg0, 0))
7386 return non_lvalue (fold_convert (type, arg1));
7388 /* Convert X + -C into X - C. */
7389 if (TREE_CODE (arg1) == REAL_CST
7390 && REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1)))
7392 tem = fold_negate_const (arg1, type);
7393 if (!TREE_OVERFLOW (arg1) || !flag_trapping_math)
7394 return fold (build2 (MINUS_EXPR, type,
7395 fold_convert (type, arg0),
7396 fold_convert (type, tem)));
7399 /* Convert x+x into x*2.0. */
7400 if (operand_equal_p (arg0, arg1, 0)
7401 && SCALAR_FLOAT_TYPE_P (type))
7402 return fold (build2 (MULT_EXPR, type, arg0,
7403 build_real (type, dconst2)));
7405 /* Convert x*c+x into x*(c+1). */
7406 if (flag_unsafe_math_optimizations
7407 && TREE_CODE (arg0) == MULT_EXPR
7408 && TREE_CODE (TREE_OPERAND (arg0, 1)) == REAL_CST
7409 && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg0, 1))
7410 && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
7414 c = TREE_REAL_CST (TREE_OPERAND (arg0, 1));
7415 real_arithmetic (&c, PLUS_EXPR, &c, &dconst1);
7416 return fold (build2 (MULT_EXPR, type, arg1,
7417 build_real (type, c)));
7420 /* Convert x+x*c into x*(c+1). */
7421 if (flag_unsafe_math_optimizations
7422 && TREE_CODE (arg1) == MULT_EXPR
7423 && TREE_CODE (TREE_OPERAND (arg1, 1)) == REAL_CST
7424 && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg1, 1))
7425 && operand_equal_p (TREE_OPERAND (arg1, 0), arg0, 0))
7429 c = TREE_REAL_CST (TREE_OPERAND (arg1, 1));
7430 real_arithmetic (&c, PLUS_EXPR, &c, &dconst1);
7431 return fold (build2 (MULT_EXPR, type, arg0,
7432 build_real (type, c)));
7435 /* Convert x*c1+x*c2 into x*(c1+c2). */
7436 if (flag_unsafe_math_optimizations
7437 && TREE_CODE (arg0) == MULT_EXPR
7438 && TREE_CODE (arg1) == MULT_EXPR
7439 && TREE_CODE (TREE_OPERAND (arg0, 1)) == REAL_CST
7440 && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg0, 1))
7441 && TREE_CODE (TREE_OPERAND (arg1, 1)) == REAL_CST
7442 && ! TREE_CONSTANT_OVERFLOW (TREE_OPERAND (arg1, 1))
7443 && operand_equal_p (TREE_OPERAND (arg0, 0),
7444 TREE_OPERAND (arg1, 0), 0))
7446 REAL_VALUE_TYPE c1, c2;
7448 c1 = TREE_REAL_CST (TREE_OPERAND (arg0, 1));
7449 c2 = TREE_REAL_CST (TREE_OPERAND (arg1, 1));
7450 real_arithmetic (&c1, PLUS_EXPR, &c1, &c2);
7451 return fold (build2 (MULT_EXPR, type,
7452 TREE_OPERAND (arg0, 0),
7453 build_real (type, c1)));
7455 /* Convert a + (b*c + d*e) into (a + b*c) + d*e. */
7456 if (flag_unsafe_math_optimizations
7457 && TREE_CODE (arg1) == PLUS_EXPR
7458 && TREE_CODE (arg0) != MULT_EXPR)
7460 tree tree10 = TREE_OPERAND (arg1, 0);
7461 tree tree11 = TREE_OPERAND (arg1, 1);
7462 if (TREE_CODE (tree11) == MULT_EXPR
7463 && TREE_CODE (tree10) == MULT_EXPR)
7466 tree0 = fold (build2 (PLUS_EXPR, type, arg0, tree10));
7467 return fold (build2 (PLUS_EXPR, type, tree0, tree11));
7470 /* Convert (b*c + d*e) + a into b*c + (d*e +a). */
7471 if (flag_unsafe_math_optimizations
7472 && TREE_CODE (arg0) == PLUS_EXPR
7473 && TREE_CODE (arg1) != MULT_EXPR)
7475 tree tree00 = TREE_OPERAND (arg0, 0);
7476 tree tree01 = TREE_OPERAND (arg0, 1);
7477 if (TREE_CODE (tree01) == MULT_EXPR
7478 && TREE_CODE (tree00) == MULT_EXPR)
7481 tree0 = fold (build2 (PLUS_EXPR, type, tree01, arg1));
7482 return fold (build2 (PLUS_EXPR, type, tree00, tree0));
7488 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
7489 is a rotate of A by C1 bits. */
7490 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
7491 is a rotate of A by B bits. */
7493 enum tree_code code0, code1;
7494 code0 = TREE_CODE (arg0);
7495 code1 = TREE_CODE (arg1);
7496 if (((code0 == RSHIFT_EXPR && code1 == LSHIFT_EXPR)
7497 || (code1 == RSHIFT_EXPR && code0 == LSHIFT_EXPR))
7498 && operand_equal_p (TREE_OPERAND (arg0, 0),
7499 TREE_OPERAND (arg1, 0), 0)
7500 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0, 0))))
7502 tree tree01, tree11;
7503 enum tree_code code01, code11;
7505 tree01 = TREE_OPERAND (arg0, 1);
7506 tree11 = TREE_OPERAND (arg1, 1);
7507 STRIP_NOPS (tree01);
7508 STRIP_NOPS (tree11);
7509 code01 = TREE_CODE (tree01);
7510 code11 = TREE_CODE (tree11);
7511 if (code01 == INTEGER_CST
7512 && code11 == INTEGER_CST
7513 && TREE_INT_CST_HIGH (tree01) == 0
7514 && TREE_INT_CST_HIGH (tree11) == 0
7515 && ((TREE_INT_CST_LOW (tree01) + TREE_INT_CST_LOW (tree11))
7516 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg0, 0)))))
7517 return build2 (LROTATE_EXPR, type, TREE_OPERAND (arg0, 0),
7518 code0 == LSHIFT_EXPR ? tree01 : tree11);
7519 else if (code11 == MINUS_EXPR)
7521 tree tree110, tree111;
7522 tree110 = TREE_OPERAND (tree11, 0);
7523 tree111 = TREE_OPERAND (tree11, 1);
7524 STRIP_NOPS (tree110);
7525 STRIP_NOPS (tree111);
7526 if (TREE_CODE (tree110) == INTEGER_CST
7527 && 0 == compare_tree_int (tree110,
7529 (TREE_TYPE (TREE_OPERAND
7531 && operand_equal_p (tree01, tree111, 0))
7532 return build2 ((code0 == LSHIFT_EXPR
7535 type, TREE_OPERAND (arg0, 0), tree01);
7537 else if (code01 == MINUS_EXPR)
7539 tree tree010, tree011;
7540 tree010 = TREE_OPERAND (tree01, 0);
7541 tree011 = TREE_OPERAND (tree01, 1);
7542 STRIP_NOPS (tree010);
7543 STRIP_NOPS (tree011);
7544 if (TREE_CODE (tree010) == INTEGER_CST
7545 && 0 == compare_tree_int (tree010,
7547 (TREE_TYPE (TREE_OPERAND
7549 && operand_equal_p (tree11, tree011, 0))
7550 return build2 ((code0 != LSHIFT_EXPR
7553 type, TREE_OPERAND (arg0, 0), tree11);
7559 /* In most languages, can't associate operations on floats through
7560 parentheses. Rather than remember where the parentheses were, we
7561 don't associate floats at all, unless the user has specified
7562 -funsafe-math-optimizations. */
7565 && (! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations))
7567 tree var0, con0, lit0, minus_lit0;
7568 tree var1, con1, lit1, minus_lit1;
7570 /* Split both trees into variables, constants, and literals. Then
7571 associate each group together, the constants with literals,
7572 then the result with variables. This increases the chances of
7573 literals being recombined later and of generating relocatable
7574 expressions for the sum of a constant and literal. */
7575 var0 = split_tree (arg0, code, &con0, &lit0, &minus_lit0, 0);
7576 var1 = split_tree (arg1, code, &con1, &lit1, &minus_lit1,
7577 code == MINUS_EXPR);
7579 /* Only do something if we found more than two objects. Otherwise,
7580 nothing has changed and we risk infinite recursion. */
7581 if (2 < ((var0 != 0) + (var1 != 0)
7582 + (con0 != 0) + (con1 != 0)
7583 + (lit0 != 0) + (lit1 != 0)
7584 + (minus_lit0 != 0) + (minus_lit1 != 0)))
7586 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
7587 if (code == MINUS_EXPR)
7590 var0 = associate_trees (var0, var1, code, type);
7591 con0 = associate_trees (con0, con1, code, type);
7592 lit0 = associate_trees (lit0, lit1, code, type);
7593 minus_lit0 = associate_trees (minus_lit0, minus_lit1, code, type);
7595 /* Preserve the MINUS_EXPR if the negative part of the literal is
7596 greater than the positive part. Otherwise, the multiplicative
7597 folding code (i.e extract_muldiv) may be fooled in case
7598 unsigned constants are subtracted, like in the following
7599 example: ((X*2 + 4) - 8U)/2. */
7600 if (minus_lit0 && lit0)
7602 if (TREE_CODE (lit0) == INTEGER_CST
7603 && TREE_CODE (minus_lit0) == INTEGER_CST
7604 && tree_int_cst_lt (lit0, minus_lit0))
7606 minus_lit0 = associate_trees (minus_lit0, lit0,
7612 lit0 = associate_trees (lit0, minus_lit0,
7620 return fold_convert (type,
7621 associate_trees (var0, minus_lit0,
7625 con0 = associate_trees (con0, minus_lit0,
7627 return fold_convert (type,
7628 associate_trees (var0, con0,
7633 con0 = associate_trees (con0, lit0, code, type);
7634 return fold_convert (type, associate_trees (var0, con0,
7641 t1 = const_binop (code, arg0, arg1, 0);
7642 if (t1 != NULL_TREE)
7644 /* The return value should always have
7645 the same type as the original expression. */
7646 if (TREE_TYPE (t1) != type)
7647 t1 = fold_convert (type, t1);
7654 /* A - (-B) -> A + B */
7655 if (TREE_CODE (arg1) == NEGATE_EXPR)
7656 return fold (build2 (PLUS_EXPR, type, arg0, TREE_OPERAND (arg1, 0)));
7657 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
7658 if (TREE_CODE (arg0) == NEGATE_EXPR
7659 && (FLOAT_TYPE_P (type)
7660 || (INTEGRAL_TYPE_P (type) && flag_wrapv && !flag_trapv))
7661 && negate_expr_p (arg1)
7662 && reorder_operands_p (arg0, arg1))
7663 return fold (build2 (MINUS_EXPR, type, negate_expr (arg1),
7664 TREE_OPERAND (arg0, 0)));
7665 /* Convert -A - 1 to ~A. */
7666 if (INTEGRAL_TYPE_P (type)
7667 && TREE_CODE (arg0) == NEGATE_EXPR
7668 && integer_onep (arg1))
7669 return fold (build1 (BIT_NOT_EXPR, type, TREE_OPERAND (arg0, 0)));
7671 /* Convert -1 - A to ~A. */
7672 if (INTEGRAL_TYPE_P (type)
7673 && integer_all_onesp (arg0))
7674 return fold (build1 (BIT_NOT_EXPR, type, arg1));
7676 if (TREE_CODE (type) == COMPLEX_TYPE)
7678 tem = fold_complex_add (type, arg0, arg1, MINUS_EXPR);
7683 if (! FLOAT_TYPE_P (type))
7685 if (! wins && integer_zerop (arg0))
7686 return negate_expr (fold_convert (type, arg1));
7687 if (integer_zerop (arg1))
7688 return non_lvalue (fold_convert (type, arg0));
7690 /* Fold A - (A & B) into ~B & A. */
7691 if (!TREE_SIDE_EFFECTS (arg0)
7692 && TREE_CODE (arg1) == BIT_AND_EXPR)
7694 if (operand_equal_p (arg0, TREE_OPERAND (arg1, 1), 0))
7695 return fold (build2 (BIT_AND_EXPR, type,
7696 fold (build1 (BIT_NOT_EXPR, type,
7697 TREE_OPERAND (arg1, 0))),
7699 if (operand_equal_p (arg0, TREE_OPERAND (arg1, 0), 0))
7700 return fold (build2 (BIT_AND_EXPR, type,
7701 fold (build1 (BIT_NOT_EXPR, type,
7702 TREE_OPERAND (arg1, 1))),
7706 /* Fold (A & ~B) - (A & B) into (A ^ B) - B, where B is
7707 any power of 2 minus 1. */
7708 if (TREE_CODE (arg0) == BIT_AND_EXPR
7709 && TREE_CODE (arg1) == BIT_AND_EXPR
7710 && operand_equal_p (TREE_OPERAND (arg0, 0),
7711 TREE_OPERAND (arg1, 0), 0))
7713 tree mask0 = TREE_OPERAND (arg0, 1);
7714 tree mask1 = TREE_OPERAND (arg1, 1);
7715 tree tem = fold (build1 (BIT_NOT_EXPR, type, mask0));
7717 if (operand_equal_p (tem, mask1, 0))
7719 tem = fold (build2 (BIT_XOR_EXPR, type,
7720 TREE_OPERAND (arg0, 0), mask1));
7721 return fold (build2 (MINUS_EXPR, type, tem, mask1));
7726 /* See if ARG1 is zero and X - ARG1 reduces to X. */
7727 else if (fold_real_zero_addition_p (TREE_TYPE (arg0), arg1, 1))
7728 return non_lvalue (fold_convert (type, arg0));
7730 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
7731 ARG0 is zero and X + ARG0 reduces to X, since that would mean
7732 (-ARG1 + ARG0) reduces to -ARG1. */
7733 else if (!wins && fold_real_zero_addition_p (TREE_TYPE (arg1), arg0, 0))
7734 return negate_expr (fold_convert (type, arg1));
7736 /* Fold &x - &x. This can happen from &x.foo - &x.
7737 This is unsafe for certain floats even in non-IEEE formats.
7738 In IEEE, it is unsafe because it does wrong for NaNs.
7739 Also note that operand_equal_p is always false if an operand
7742 if ((! FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations)
7743 && operand_equal_p (arg0, arg1, 0))
7744 return fold_convert (type, integer_zero_node);
7746 /* A - B -> A + (-B) if B is easily negatable. */
7747 if (!wins && negate_expr_p (arg1)
7748 && ((FLOAT_TYPE_P (type)
7749 /* Avoid this transformation if B is a positive REAL_CST. */
7750 && (TREE_CODE (arg1) != REAL_CST
7751 || REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg1))))
7752 || (INTEGRAL_TYPE_P (type) && flag_wrapv && !flag_trapv)))
7753 return fold (build2 (PLUS_EXPR, type, arg0, negate_expr (arg1)));
7755 /* Try folding difference of addresses. */
7759 if ((TREE_CODE (arg0) == ADDR_EXPR
7760 || TREE_CODE (arg1) == ADDR_EXPR)
7761 && ptr_difference_const (arg0, arg1, &diff))
7762 return build_int_cst_type (type, diff);
7765 /* Try replacing &a[i1] - c * i2 with &a[i1 - i2], if c is step
7766 of the array. Loop optimizer sometimes produce this type of
7768 if (TREE_CODE (arg0) == ADDR_EXPR
7769 && TREE_CODE (arg1) == MULT_EXPR)
7771 tem = try_move_mult_to_index (MINUS_EXPR, arg0, arg1);
7773 return fold_convert (type, fold (tem));
7776 if (TREE_CODE (arg0) == MULT_EXPR
7777 && TREE_CODE (arg1) == MULT_EXPR
7778 && (!FLOAT_TYPE_P (type) || flag_unsafe_math_optimizations))
7780 /* (A * C) - (B * C) -> (A-B) * C. */
7781 if (operand_equal_p (TREE_OPERAND (arg0, 1),
7782 TREE_OPERAND (arg1, 1), 0))
7783 return fold (build2 (MULT_EXPR, type,
7784 fold (build2 (MINUS_EXPR, type,
7785 TREE_OPERAND (arg0, 0),
7786 TREE_OPERAND (arg1, 0))),
7787 TREE_OPERAND (arg0, 1)));
7788 /* (A * C1) - (A * C2) -> A * (C1-C2). */
7789 if (operand_equal_p (TREE_OPERAND (arg0, 0),
7790 TREE_OPERAND (arg1, 0), 0))
7791 return fold (build2 (MULT_EXPR, type,
7792 TREE_OPERAND (arg0, 0),
7793 fold (build2 (MINUS_EXPR, type,
7794 TREE_OPERAND (arg0, 1),
7795 TREE_OPERAND (arg1, 1)))));
7801 /* (-A) * (-B) -> A * B */
7802 if (TREE_CODE (arg0) == NEGATE_EXPR && negate_expr_p (arg1))
7803 return fold (build2 (MULT_EXPR, type,
7804 TREE_OPERAND (arg0, 0),
7805 negate_expr (arg1)));
7806 if (TREE_CODE (arg1) == NEGATE_EXPR && negate_expr_p (arg0))
7807 return fold (build2 (MULT_EXPR, type,
7809 TREE_OPERAND (arg1, 0)));
7811 if (TREE_CODE (type) == COMPLEX_TYPE)
7813 tem = fold_complex_mult (type, arg0, arg1);
7818 if (! FLOAT_TYPE_P (type))
7820 if (integer_zerop (arg1))
7821 return omit_one_operand (type, arg1, arg0);
7822 if (integer_onep (arg1))
7823 return non_lvalue (fold_convert (type, arg0));
7824 /* Transform x * -1 into -x. */
7825 if (integer_all_onesp (arg1))
7826 return fold_convert (type, negate_expr (arg0));
7828 /* (a * (1 << b)) is (a << b) */
7829 if (TREE_CODE (arg1) == LSHIFT_EXPR
7830 && integer_onep (TREE_OPERAND (arg1, 0)))
7831 return fold (build2 (LSHIFT_EXPR, type, arg0,
7832 TREE_OPERAND (arg1, 1)));
7833 if (TREE_CODE (arg0) == LSHIFT_EXPR
7834 && integer_onep (TREE_OPERAND (arg0, 0)))
7835 return fold (build2 (LSHIFT_EXPR, type, arg1,
7836 TREE_OPERAND (arg0, 1)));
7838 if (TREE_CODE (arg1) == INTEGER_CST
7839 && 0 != (tem = extract_muldiv (op0,
7840 fold_convert (type, arg1),
7842 return fold_convert (type, tem);
7847 /* Maybe fold x * 0 to 0. The expressions aren't the same
7848 when x is NaN, since x * 0 is also NaN. Nor are they the
7849 same in modes with signed zeros, since multiplying a
7850 negative value by 0 gives -0, not +0. */
7851 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0)))
7852 && !HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg0)))
7853 && real_zerop (arg1))
7854 return omit_one_operand (type, arg1, arg0);
7855 /* In IEEE floating point, x*1 is not equivalent to x for snans. */
7856 if (!HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
7857 && real_onep (arg1))
7858 return non_lvalue (fold_convert (type, arg0));
7860 /* Transform x * -1.0 into -x. */
7861 if (!HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
7862 && real_minus_onep (arg1))
7863 return fold_convert (type, negate_expr (arg0));
7865 /* Convert (C1/X)*C2 into (C1*C2)/X. */
7866 if (flag_unsafe_math_optimizations
7867 && TREE_CODE (arg0) == RDIV_EXPR
7868 && TREE_CODE (arg1) == REAL_CST
7869 && TREE_CODE (TREE_OPERAND (arg0, 0)) == REAL_CST)
7871 tree tem = const_binop (MULT_EXPR, TREE_OPERAND (arg0, 0),
7874 return fold (build2 (RDIV_EXPR, type, tem,
7875 TREE_OPERAND (arg0, 1)));
7878 /* Strip sign operations from X in X*X, i.e. -Y*-Y -> Y*Y. */
7879 if (operand_equal_p (arg0, arg1, 0))
7881 tree tem = fold_strip_sign_ops (arg0);
7882 if (tem != NULL_TREE)
7884 tem = fold_convert (type, tem);
7885 return fold (build2 (MULT_EXPR, type, tem, tem));
7889 if (flag_unsafe_math_optimizations)
7891 enum built_in_function fcode0 = builtin_mathfn_code (arg0);
7892 enum built_in_function fcode1 = builtin_mathfn_code (arg1);
7894 /* Optimizations of root(...)*root(...). */
7895 if (fcode0 == fcode1 && BUILTIN_ROOT_P (fcode0))
7897 tree rootfn, arg, arglist;
7898 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
7899 tree arg10 = TREE_VALUE (TREE_OPERAND (arg1, 1));
7901 /* Optimize sqrt(x)*sqrt(x) as x. */
7902 if (BUILTIN_SQRT_P (fcode0)
7903 && operand_equal_p (arg00, arg10, 0)
7904 && ! HONOR_SNANS (TYPE_MODE (type)))
7907 /* Optimize root(x)*root(y) as root(x*y). */
7908 rootfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
7909 arg = fold (build2 (MULT_EXPR, type, arg00, arg10));
7910 arglist = build_tree_list (NULL_TREE, arg);
7911 return build_function_call_expr (rootfn, arglist);
7914 /* Optimize expN(x)*expN(y) as expN(x+y). */
7915 if (fcode0 == fcode1 && BUILTIN_EXPONENT_P (fcode0))
7917 tree expfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
7918 tree arg = build2 (PLUS_EXPR, type,
7919 TREE_VALUE (TREE_OPERAND (arg0, 1)),
7920 TREE_VALUE (TREE_OPERAND (arg1, 1)));
7921 tree arglist = build_tree_list (NULL_TREE, fold (arg));
7922 return build_function_call_expr (expfn, arglist);
7925 /* Optimizations of pow(...)*pow(...). */
7926 if ((fcode0 == BUILT_IN_POW && fcode1 == BUILT_IN_POW)
7927 || (fcode0 == BUILT_IN_POWF && fcode1 == BUILT_IN_POWF)
7928 || (fcode0 == BUILT_IN_POWL && fcode1 == BUILT_IN_POWL))
7930 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
7931 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0,
7933 tree arg10 = TREE_VALUE (TREE_OPERAND (arg1, 1));
7934 tree arg11 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg1,
7937 /* Optimize pow(x,y)*pow(z,y) as pow(x*z,y). */
7938 if (operand_equal_p (arg01, arg11, 0))
7940 tree powfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
7941 tree arg = build2 (MULT_EXPR, type, arg00, arg10);
7942 tree arglist = tree_cons (NULL_TREE, fold (arg),
7943 build_tree_list (NULL_TREE,
7945 return build_function_call_expr (powfn, arglist);
7948 /* Optimize pow(x,y)*pow(x,z) as pow(x,y+z). */
7949 if (operand_equal_p (arg00, arg10, 0))
7951 tree powfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
7952 tree arg = fold (build2 (PLUS_EXPR, type, arg01, arg11));
7953 tree arglist = tree_cons (NULL_TREE, arg00,
7954 build_tree_list (NULL_TREE,
7956 return build_function_call_expr (powfn, arglist);
7960 /* Optimize tan(x)*cos(x) as sin(x). */
7961 if (((fcode0 == BUILT_IN_TAN && fcode1 == BUILT_IN_COS)
7962 || (fcode0 == BUILT_IN_TANF && fcode1 == BUILT_IN_COSF)
7963 || (fcode0 == BUILT_IN_TANL && fcode1 == BUILT_IN_COSL)
7964 || (fcode0 == BUILT_IN_COS && fcode1 == BUILT_IN_TAN)
7965 || (fcode0 == BUILT_IN_COSF && fcode1 == BUILT_IN_TANF)
7966 || (fcode0 == BUILT_IN_COSL && fcode1 == BUILT_IN_TANL))
7967 && operand_equal_p (TREE_VALUE (TREE_OPERAND (arg0, 1)),
7968 TREE_VALUE (TREE_OPERAND (arg1, 1)), 0))
7970 tree sinfn = mathfn_built_in (type, BUILT_IN_SIN);
7972 if (sinfn != NULL_TREE)
7973 return build_function_call_expr (sinfn,
7974 TREE_OPERAND (arg0, 1));
7977 /* Optimize x*pow(x,c) as pow(x,c+1). */
7978 if (fcode1 == BUILT_IN_POW
7979 || fcode1 == BUILT_IN_POWF
7980 || fcode1 == BUILT_IN_POWL)
7982 tree arg10 = TREE_VALUE (TREE_OPERAND (arg1, 1));
7983 tree arg11 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg1,
7985 if (TREE_CODE (arg11) == REAL_CST
7986 && ! TREE_CONSTANT_OVERFLOW (arg11)
7987 && operand_equal_p (arg0, arg10, 0))
7989 tree powfn = TREE_OPERAND (TREE_OPERAND (arg1, 0), 0);
7993 c = TREE_REAL_CST (arg11);
7994 real_arithmetic (&c, PLUS_EXPR, &c, &dconst1);
7995 arg = build_real (type, c);
7996 arglist = build_tree_list (NULL_TREE, arg);
7997 arglist = tree_cons (NULL_TREE, arg0, arglist);
7998 return build_function_call_expr (powfn, arglist);
8002 /* Optimize pow(x,c)*x as pow(x,c+1). */
8003 if (fcode0 == BUILT_IN_POW
8004 || fcode0 == BUILT_IN_POWF
8005 || fcode0 == BUILT_IN_POWL)
8007 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
8008 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0,
8010 if (TREE_CODE (arg01) == REAL_CST
8011 && ! TREE_CONSTANT_OVERFLOW (arg01)
8012 && operand_equal_p (arg1, arg00, 0))
8014 tree powfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
8018 c = TREE_REAL_CST (arg01);
8019 real_arithmetic (&c, PLUS_EXPR, &c, &dconst1);
8020 arg = build_real (type, c);
8021 arglist = build_tree_list (NULL_TREE, arg);
8022 arglist = tree_cons (NULL_TREE, arg1, arglist);
8023 return build_function_call_expr (powfn, arglist);
8027 /* Optimize x*x as pow(x,2.0), which is expanded as x*x. */
8029 && operand_equal_p (arg0, arg1, 0))
8031 tree powfn = mathfn_built_in (type, BUILT_IN_POW);
8035 tree arg = build_real (type, dconst2);
8036 tree arglist = build_tree_list (NULL_TREE, arg);
8037 arglist = tree_cons (NULL_TREE, arg0, arglist);
8038 return build_function_call_expr (powfn, arglist);
8047 if (integer_all_onesp (arg1))
8048 return omit_one_operand (type, arg1, arg0);
8049 if (integer_zerop (arg1))
8050 return non_lvalue (fold_convert (type, arg0));
8051 if (operand_equal_p (arg0, arg1, 0))
8052 return non_lvalue (fold_convert (type, arg0));
8055 if (TREE_CODE (arg0) == BIT_NOT_EXPR
8056 && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
8058 t1 = build_int_cst (type, -1);
8059 t1 = force_fit_type (t1, 0, false, false);
8060 return omit_one_operand (type, t1, arg1);
8064 if (TREE_CODE (arg1) == BIT_NOT_EXPR
8065 && operand_equal_p (arg0, TREE_OPERAND (arg1, 0), 0))
8067 t1 = build_int_cst (type, -1);
8068 t1 = force_fit_type (t1, 0, false, false);
8069 return omit_one_operand (type, t1, arg0);
8072 t1 = distribute_bit_expr (code, type, arg0, arg1);
8073 if (t1 != NULL_TREE)
8076 /* Convert (or (not arg0) (not arg1)) to (not (and (arg0) (arg1))).
8078 This results in more efficient code for machines without a NAND
8079 instruction. Combine will canonicalize to the first form
8080 which will allow use of NAND instructions provided by the
8081 backend if they exist. */
8082 if (TREE_CODE (arg0) == BIT_NOT_EXPR
8083 && TREE_CODE (arg1) == BIT_NOT_EXPR)
8085 return fold (build1 (BIT_NOT_EXPR, type,
8086 build2 (BIT_AND_EXPR, type,
8087 TREE_OPERAND (arg0, 0),
8088 TREE_OPERAND (arg1, 0))));
8091 /* See if this can be simplified into a rotate first. If that
8092 is unsuccessful continue in the association code. */
8096 if (integer_zerop (arg1))
8097 return non_lvalue (fold_convert (type, arg0));
8098 if (integer_all_onesp (arg1))
8099 return fold (build1 (BIT_NOT_EXPR, type, arg0));
8100 if (operand_equal_p (arg0, arg1, 0))
8101 return omit_one_operand (type, integer_zero_node, arg0);
8104 if (TREE_CODE (arg0) == BIT_NOT_EXPR
8105 && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
8107 t1 = build_int_cst (type, -1);
8108 t1 = force_fit_type (t1, 0, false, false);
8109 return omit_one_operand (type, t1, arg1);
8113 if (TREE_CODE (arg1) == BIT_NOT_EXPR
8114 && operand_equal_p (arg0, TREE_OPERAND (arg1, 0), 0))
8116 t1 = build_int_cst (type, -1);
8117 t1 = force_fit_type (t1, 0, false, false);
8118 return omit_one_operand (type, t1, arg0);
8121 /* If we are XORing two BIT_AND_EXPR's, both of which are and'ing
8122 with a constant, and the two constants have no bits in common,
8123 we should treat this as a BIT_IOR_EXPR since this may produce more
8125 if (TREE_CODE (arg0) == BIT_AND_EXPR
8126 && TREE_CODE (arg1) == BIT_AND_EXPR
8127 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
8128 && TREE_CODE (TREE_OPERAND (arg1, 1)) == INTEGER_CST
8129 && integer_zerop (const_binop (BIT_AND_EXPR,
8130 TREE_OPERAND (arg0, 1),
8131 TREE_OPERAND (arg1, 1), 0)))
8133 code = BIT_IOR_EXPR;
8137 /* See if this can be simplified into a rotate first. If that
8138 is unsuccessful continue in the association code. */
8142 if (integer_all_onesp (arg1))
8143 return non_lvalue (fold_convert (type, arg0));
8144 if (integer_zerop (arg1))
8145 return omit_one_operand (type, arg1, arg0);
8146 if (operand_equal_p (arg0, arg1, 0))
8147 return non_lvalue (fold_convert (type, arg0));
8149 /* ~X & X is always zero. */
8150 if (TREE_CODE (arg0) == BIT_NOT_EXPR
8151 && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
8152 return omit_one_operand (type, integer_zero_node, arg1);
8154 /* X & ~X is always zero. */
8155 if (TREE_CODE (arg1) == BIT_NOT_EXPR
8156 && operand_equal_p (arg0, TREE_OPERAND (arg1, 0), 0))
8157 return omit_one_operand (type, integer_zero_node, arg0);
8159 t1 = distribute_bit_expr (code, type, arg0, arg1);
8160 if (t1 != NULL_TREE)
8162 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
8163 if (TREE_CODE (arg1) == INTEGER_CST && TREE_CODE (arg0) == NOP_EXPR
8164 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (arg0, 0))))
8167 = TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg0, 0)));
8169 if (prec < BITS_PER_WORD && prec < HOST_BITS_PER_WIDE_INT
8170 && (~TREE_INT_CST_LOW (arg1)
8171 & (((HOST_WIDE_INT) 1 << prec) - 1)) == 0)
8172 return fold_convert (type, TREE_OPERAND (arg0, 0));
8175 /* Convert (and (not arg0) (not arg1)) to (not (or (arg0) (arg1))).
8177 This results in more efficient code for machines without a NOR
8178 instruction. Combine will canonicalize to the first form
8179 which will allow use of NOR instructions provided by the
8180 backend if they exist. */
8181 if (TREE_CODE (arg0) == BIT_NOT_EXPR
8182 && TREE_CODE (arg1) == BIT_NOT_EXPR)
8184 return fold (build1 (BIT_NOT_EXPR, type,
8185 build2 (BIT_IOR_EXPR, type,
8186 TREE_OPERAND (arg0, 0),
8187 TREE_OPERAND (arg1, 0))));
8193 /* Don't touch a floating-point divide by zero unless the mode
8194 of the constant can represent infinity. */
8195 if (TREE_CODE (arg1) == REAL_CST
8196 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (arg1)))
8197 && real_zerop (arg1))
8200 /* (-A) / (-B) -> A / B */
8201 if (TREE_CODE (arg0) == NEGATE_EXPR && negate_expr_p (arg1))
8202 return fold (build2 (RDIV_EXPR, type,
8203 TREE_OPERAND (arg0, 0),
8204 negate_expr (arg1)));
8205 if (TREE_CODE (arg1) == NEGATE_EXPR && negate_expr_p (arg0))
8206 return fold (build2 (RDIV_EXPR, type,
8208 TREE_OPERAND (arg1, 0)));
8210 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
8211 if (!HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
8212 && real_onep (arg1))
8213 return non_lvalue (fold_convert (type, arg0));
8215 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
8216 if (!HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0)))
8217 && real_minus_onep (arg1))
8218 return non_lvalue (fold_convert (type, negate_expr (arg0)));
8220 /* If ARG1 is a constant, we can convert this to a multiply by the
8221 reciprocal. This does not have the same rounding properties,
8222 so only do this if -funsafe-math-optimizations. We can actually
8223 always safely do it if ARG1 is a power of two, but it's hard to
8224 tell if it is or not in a portable manner. */
8225 if (TREE_CODE (arg1) == REAL_CST)
8227 if (flag_unsafe_math_optimizations
8228 && 0 != (tem = const_binop (code, build_real (type, dconst1),
8230 return fold (build2 (MULT_EXPR, type, arg0, tem));
8231 /* Find the reciprocal if optimizing and the result is exact. */
8235 r = TREE_REAL_CST (arg1);
8236 if (exact_real_inverse (TYPE_MODE(TREE_TYPE(arg0)), &r))
8238 tem = build_real (type, r);
8239 return fold (build2 (MULT_EXPR, type, arg0, tem));
8243 /* Convert A/B/C to A/(B*C). */
8244 if (flag_unsafe_math_optimizations
8245 && TREE_CODE (arg0) == RDIV_EXPR)
8246 return fold (build2 (RDIV_EXPR, type, TREE_OPERAND (arg0, 0),
8247 fold (build2 (MULT_EXPR, type,
8248 TREE_OPERAND (arg0, 1), arg1))));
8250 /* Convert A/(B/C) to (A/B)*C. */
8251 if (flag_unsafe_math_optimizations
8252 && TREE_CODE (arg1) == RDIV_EXPR)
8253 return fold (build2 (MULT_EXPR, type,
8254 fold (build2 (RDIV_EXPR, type, arg0,
8255 TREE_OPERAND (arg1, 0))),
8256 TREE_OPERAND (arg1, 1)));
8258 /* Convert C1/(X*C2) into (C1/C2)/X. */
8259 if (flag_unsafe_math_optimizations
8260 && TREE_CODE (arg1) == MULT_EXPR
8261 && TREE_CODE (arg0) == REAL_CST
8262 && TREE_CODE (TREE_OPERAND (arg1, 1)) == REAL_CST)
8264 tree tem = const_binop (RDIV_EXPR, arg0,
8265 TREE_OPERAND (arg1, 1), 0);
8267 return fold (build2 (RDIV_EXPR, type, tem,
8268 TREE_OPERAND (arg1, 0)));
8271 if (TREE_CODE (type) == COMPLEX_TYPE)
8273 tem = fold_complex_div (type, arg0, arg1, code);
8278 if (flag_unsafe_math_optimizations)
8280 enum built_in_function fcode = builtin_mathfn_code (arg1);
8281 /* Optimize x/expN(y) into x*expN(-y). */
8282 if (BUILTIN_EXPONENT_P (fcode))
8284 tree expfn = TREE_OPERAND (TREE_OPERAND (arg1, 0), 0);
8285 tree arg = negate_expr (TREE_VALUE (TREE_OPERAND (arg1, 1)));
8286 tree arglist = build_tree_list (NULL_TREE,
8287 fold_convert (type, arg));
8288 arg1 = build_function_call_expr (expfn, arglist);
8289 return fold (build2 (MULT_EXPR, type, arg0, arg1));
8292 /* Optimize x/pow(y,z) into x*pow(y,-z). */
8293 if (fcode == BUILT_IN_POW
8294 || fcode == BUILT_IN_POWF
8295 || fcode == BUILT_IN_POWL)
8297 tree powfn = TREE_OPERAND (TREE_OPERAND (arg1, 0), 0);
8298 tree arg10 = TREE_VALUE (TREE_OPERAND (arg1, 1));
8299 tree arg11 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg1, 1)));
8300 tree neg11 = fold_convert (type, negate_expr (arg11));
8301 tree arglist = tree_cons(NULL_TREE, arg10,
8302 build_tree_list (NULL_TREE, neg11));
8303 arg1 = build_function_call_expr (powfn, arglist);
8304 return fold (build2 (MULT_EXPR, type, arg0, arg1));
8308 if (flag_unsafe_math_optimizations)
8310 enum built_in_function fcode0 = builtin_mathfn_code (arg0);
8311 enum built_in_function fcode1 = builtin_mathfn_code (arg1);
8313 /* Optimize sin(x)/cos(x) as tan(x). */
8314 if (((fcode0 == BUILT_IN_SIN && fcode1 == BUILT_IN_COS)
8315 || (fcode0 == BUILT_IN_SINF && fcode1 == BUILT_IN_COSF)
8316 || (fcode0 == BUILT_IN_SINL && fcode1 == BUILT_IN_COSL))
8317 && operand_equal_p (TREE_VALUE (TREE_OPERAND (arg0, 1)),
8318 TREE_VALUE (TREE_OPERAND (arg1, 1)), 0))
8320 tree tanfn = mathfn_built_in (type, BUILT_IN_TAN);
8322 if (tanfn != NULL_TREE)
8323 return build_function_call_expr (tanfn,
8324 TREE_OPERAND (arg0, 1));
8327 /* Optimize cos(x)/sin(x) as 1.0/tan(x). */
8328 if (((fcode0 == BUILT_IN_COS && fcode1 == BUILT_IN_SIN)
8329 || (fcode0 == BUILT_IN_COSF && fcode1 == BUILT_IN_SINF)
8330 || (fcode0 == BUILT_IN_COSL && fcode1 == BUILT_IN_SINL))
8331 && operand_equal_p (TREE_VALUE (TREE_OPERAND (arg0, 1)),
8332 TREE_VALUE (TREE_OPERAND (arg1, 1)), 0))
8334 tree tanfn = mathfn_built_in (type, BUILT_IN_TAN);
8336 if (tanfn != NULL_TREE)
8338 tree tmp = TREE_OPERAND (arg0, 1);
8339 tmp = build_function_call_expr (tanfn, tmp);
8340 return fold (build2 (RDIV_EXPR, type,
8341 build_real (type, dconst1), tmp));
8345 /* Optimize pow(x,c)/x as pow(x,c-1). */
8346 if (fcode0 == BUILT_IN_POW
8347 || fcode0 == BUILT_IN_POWF
8348 || fcode0 == BUILT_IN_POWL)
8350 tree arg00 = TREE_VALUE (TREE_OPERAND (arg0, 1));
8351 tree arg01 = TREE_VALUE (TREE_CHAIN (TREE_OPERAND (arg0, 1)));
8352 if (TREE_CODE (arg01) == REAL_CST
8353 && ! TREE_CONSTANT_OVERFLOW (arg01)
8354 && operand_equal_p (arg1, arg00, 0))
8356 tree powfn = TREE_OPERAND (TREE_OPERAND (arg0, 0), 0);
8360 c = TREE_REAL_CST (arg01);
8361 real_arithmetic (&c, MINUS_EXPR, &c, &dconst1);
8362 arg = build_real (type, c);
8363 arglist = build_tree_list (NULL_TREE, arg);
8364 arglist = tree_cons (NULL_TREE, arg1, arglist);
8365 return build_function_call_expr (powfn, arglist);
8371 case TRUNC_DIV_EXPR:
8372 case ROUND_DIV_EXPR:
8373 case FLOOR_DIV_EXPR:
8375 case EXACT_DIV_EXPR:
8376 if (integer_onep (arg1))
8377 return non_lvalue (fold_convert (type, arg0));
8378 if (integer_zerop (arg1))
8381 if (!TYPE_UNSIGNED (type)
8382 && TREE_CODE (arg1) == INTEGER_CST
8383 && TREE_INT_CST_LOW (arg1) == (unsigned HOST_WIDE_INT) -1
8384 && TREE_INT_CST_HIGH (arg1) == -1)
8385 return fold_convert (type, negate_expr (arg0));
8387 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
8388 operation, EXACT_DIV_EXPR.
8390 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
8391 At one time others generated faster code, it's not clear if they do
8392 after the last round to changes to the DIV code in expmed.c. */
8393 if ((code == CEIL_DIV_EXPR || code == FLOOR_DIV_EXPR)
8394 && multiple_of_p (type, arg0, arg1))
8395 return fold (build2 (EXACT_DIV_EXPR, type, arg0, arg1));
8397 if (TREE_CODE (arg1) == INTEGER_CST
8398 && 0 != (tem = extract_muldiv (op0, arg1, code, NULL_TREE)))
8399 return fold_convert (type, tem);
8401 if (TREE_CODE (type) == COMPLEX_TYPE)
8403 tem = fold_complex_div (type, arg0, arg1, code);
8410 case FLOOR_MOD_EXPR:
8411 case ROUND_MOD_EXPR:
8412 case TRUNC_MOD_EXPR:
8413 /* X % 1 is always zero, but be sure to preserve any side
8415 if (integer_onep (arg1))
8416 return omit_one_operand (type, integer_zero_node, arg0);
8418 /* X % 0, return X % 0 unchanged so that we can get the
8419 proper warnings and errors. */
8420 if (integer_zerop (arg1))
8423 /* 0 % X is always zero, but be sure to preserve any side
8424 effects in X. Place this after checking for X == 0. */
8425 if (integer_zerop (arg0))
8426 return omit_one_operand (type, integer_zero_node, arg1);
8428 /* X % -1 is zero. */
8429 if (!TYPE_UNSIGNED (type)
8430 && TREE_CODE (arg1) == INTEGER_CST
8431 && TREE_INT_CST_LOW (arg1) == (unsigned HOST_WIDE_INT) -1
8432 && TREE_INT_CST_HIGH (arg1) == -1)
8433 return omit_one_operand (type, integer_zero_node, arg0);
8435 /* Optimize unsigned TRUNC_MOD_EXPR by a power of two into a
8436 BIT_AND_EXPR, i.e. "X % C" into "X & C2". */
8437 if (code == TRUNC_MOD_EXPR
8438 && TYPE_UNSIGNED (type)
8439 && integer_pow2p (arg1))
8441 unsigned HOST_WIDE_INT high, low;
8445 l = tree_log2 (arg1);
8446 if (l >= HOST_BITS_PER_WIDE_INT)
8448 high = ((unsigned HOST_WIDE_INT) 1
8449 << (l - HOST_BITS_PER_WIDE_INT)) - 1;
8455 low = ((unsigned HOST_WIDE_INT) 1 << l) - 1;
8458 mask = build_int_cst_wide (type, low, high);
8459 return fold (build2 (BIT_AND_EXPR, type,
8460 fold_convert (type, arg0), mask));
8463 /* X % -C is the same as X % C. */
8464 if (code == TRUNC_MOD_EXPR
8465 && !TYPE_UNSIGNED (type)
8466 && TREE_CODE (arg1) == INTEGER_CST
8467 && TREE_INT_CST_HIGH (arg1) < 0
8469 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
8470 && !sign_bit_p (arg1, arg1))
8471 return fold (build2 (code, type, fold_convert (type, arg0),
8472 fold_convert (type, negate_expr (arg1))));
8474 /* X % -Y is the same as X % Y. */
8475 if (code == TRUNC_MOD_EXPR
8476 && !TYPE_UNSIGNED (type)
8477 && TREE_CODE (arg1) == NEGATE_EXPR
8479 return fold (build2 (code, type, fold_convert (type, arg0),
8480 fold_convert (type, TREE_OPERAND (arg1, 0))));
8482 if (TREE_CODE (arg1) == INTEGER_CST
8483 && 0 != (tem = extract_muldiv (op0, arg1, code, NULL_TREE)))
8484 return fold_convert (type, tem);
8490 if (integer_all_onesp (arg0))
8491 return omit_one_operand (type, arg0, arg1);
8495 /* Optimize -1 >> x for arithmetic right shifts. */
8496 if (integer_all_onesp (arg0) && !TYPE_UNSIGNED (type))
8497 return omit_one_operand (type, arg0, arg1);
8498 /* ... fall through ... */
8502 if (integer_zerop (arg1))
8503 return non_lvalue (fold_convert (type, arg0));
8504 if (integer_zerop (arg0))
8505 return omit_one_operand (type, arg0, arg1);
8507 /* Since negative shift count is not well-defined,
8508 don't try to compute it in the compiler. */
8509 if (TREE_CODE (arg1) == INTEGER_CST && tree_int_cst_sgn (arg1) < 0)
8511 /* Rewrite an LROTATE_EXPR by a constant into an
8512 RROTATE_EXPR by a new constant. */
8513 if (code == LROTATE_EXPR && TREE_CODE (arg1) == INTEGER_CST)
8515 tree tem = build_int_cst (NULL_TREE,
8516 GET_MODE_BITSIZE (TYPE_MODE (type)));
8517 tem = fold_convert (TREE_TYPE (arg1), tem);
8518 tem = const_binop (MINUS_EXPR, tem, arg1, 0);
8519 return fold (build2 (RROTATE_EXPR, type, arg0, tem));
8522 /* If we have a rotate of a bit operation with the rotate count and
8523 the second operand of the bit operation both constant,
8524 permute the two operations. */
8525 if (code == RROTATE_EXPR && TREE_CODE (arg1) == INTEGER_CST
8526 && (TREE_CODE (arg0) == BIT_AND_EXPR
8527 || TREE_CODE (arg0) == BIT_IOR_EXPR
8528 || TREE_CODE (arg0) == BIT_XOR_EXPR)
8529 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST)
8530 return fold (build2 (TREE_CODE (arg0), type,
8531 fold (build2 (code, type,
8532 TREE_OPERAND (arg0, 0), arg1)),
8533 fold (build2 (code, type,
8534 TREE_OPERAND (arg0, 1), arg1))));
8536 /* Two consecutive rotates adding up to the width of the mode can
8538 if (code == RROTATE_EXPR && TREE_CODE (arg1) == INTEGER_CST
8539 && TREE_CODE (arg0) == RROTATE_EXPR
8540 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
8541 && TREE_INT_CST_HIGH (arg1) == 0
8542 && TREE_INT_CST_HIGH (TREE_OPERAND (arg0, 1)) == 0
8543 && ((TREE_INT_CST_LOW (arg1)
8544 + TREE_INT_CST_LOW (TREE_OPERAND (arg0, 1)))
8545 == (unsigned int) GET_MODE_BITSIZE (TYPE_MODE (type))))
8546 return TREE_OPERAND (arg0, 0);
8551 if (operand_equal_p (arg0, arg1, 0))
8552 return omit_one_operand (type, arg0, arg1);
8553 if (INTEGRAL_TYPE_P (type)
8554 && operand_equal_p (arg1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
8555 return omit_one_operand (type, arg1, arg0);
8559 if (operand_equal_p (arg0, arg1, 0))
8560 return omit_one_operand (type, arg0, arg1);
8561 if (INTEGRAL_TYPE_P (type)
8562 && TYPE_MAX_VALUE (type)
8563 && operand_equal_p (arg1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
8564 return omit_one_operand (type, arg1, arg0);
8567 case TRUTH_ANDIF_EXPR:
8568 /* Note that the operands of this must be ints
8569 and their values must be 0 or 1.
8570 ("true" is a fixed value perhaps depending on the language.) */
8571 /* If first arg is constant zero, return it. */
8572 if (integer_zerop (arg0))
8573 return fold_convert (type, arg0);
8574 case TRUTH_AND_EXPR:
8575 /* If either arg is constant true, drop it. */
8576 if (TREE_CODE (arg0) == INTEGER_CST && ! integer_zerop (arg0))
8577 return non_lvalue (fold_convert (type, arg1));
8578 if (TREE_CODE (arg1) == INTEGER_CST && ! integer_zerop (arg1)
8579 /* Preserve sequence points. */
8580 && (code != TRUTH_ANDIF_EXPR || ! TREE_SIDE_EFFECTS (arg0)))
8581 return non_lvalue (fold_convert (type, arg0));
8582 /* If second arg is constant zero, result is zero, but first arg
8583 must be evaluated. */
8584 if (integer_zerop (arg1))
8585 return omit_one_operand (type, arg1, arg0);
8586 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
8587 case will be handled here. */
8588 if (integer_zerop (arg0))
8589 return omit_one_operand (type, arg0, arg1);
8591 /* !X && X is always false. */
8592 if (TREE_CODE (arg0) == TRUTH_NOT_EXPR
8593 && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
8594 return omit_one_operand (type, integer_zero_node, arg1);
8595 /* X && !X is always false. */
8596 if (TREE_CODE (arg1) == TRUTH_NOT_EXPR
8597 && operand_equal_p (arg0, TREE_OPERAND (arg1, 0), 0))
8598 return omit_one_operand (type, integer_zero_node, arg0);
8600 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
8601 means A >= Y && A != MAX, but in this case we know that
8604 if (!TREE_SIDE_EFFECTS (arg0)
8605 && !TREE_SIDE_EFFECTS (arg1))
8607 tem = fold_to_nonsharp_ineq_using_bound (arg0, arg1);
8609 return fold (build2 (code, type, tem, arg1));
8611 tem = fold_to_nonsharp_ineq_using_bound (arg1, arg0);
8613 return fold (build2 (code, type, arg0, tem));
8617 /* We only do these simplifications if we are optimizing. */
8621 /* Check for things like (A || B) && (A || C). We can convert this
8622 to A || (B && C). Note that either operator can be any of the four
8623 truth and/or operations and the transformation will still be
8624 valid. Also note that we only care about order for the
8625 ANDIF and ORIF operators. If B contains side effects, this
8626 might change the truth-value of A. */
8627 if (TREE_CODE (arg0) == TREE_CODE (arg1)
8628 && (TREE_CODE (arg0) == TRUTH_ANDIF_EXPR
8629 || TREE_CODE (arg0) == TRUTH_ORIF_EXPR
8630 || TREE_CODE (arg0) == TRUTH_AND_EXPR
8631 || TREE_CODE (arg0) == TRUTH_OR_EXPR)
8632 && ! TREE_SIDE_EFFECTS (TREE_OPERAND (arg0, 1)))
8634 tree a00 = TREE_OPERAND (arg0, 0);
8635 tree a01 = TREE_OPERAND (arg0, 1);
8636 tree a10 = TREE_OPERAND (arg1, 0);
8637 tree a11 = TREE_OPERAND (arg1, 1);
8638 int commutative = ((TREE_CODE (arg0) == TRUTH_OR_EXPR
8639 || TREE_CODE (arg0) == TRUTH_AND_EXPR)
8640 && (code == TRUTH_AND_EXPR
8641 || code == TRUTH_OR_EXPR));
8643 if (operand_equal_p (a00, a10, 0))
8644 return fold (build2 (TREE_CODE (arg0), type, a00,
8645 fold (build2 (code, type, a01, a11))));
8646 else if (commutative && operand_equal_p (a00, a11, 0))
8647 return fold (build2 (TREE_CODE (arg0), type, a00,
8648 fold (build2 (code, type, a01, a10))));
8649 else if (commutative && operand_equal_p (a01, a10, 0))
8650 return fold (build2 (TREE_CODE (arg0), type, a01,
8651 fold (build2 (code, type, a00, a11))));
8653 /* This case if tricky because we must either have commutative
8654 operators or else A10 must not have side-effects. */
8656 else if ((commutative || ! TREE_SIDE_EFFECTS (a10))
8657 && operand_equal_p (a01, a11, 0))
8658 return fold (build2 (TREE_CODE (arg0), type,
8659 fold (build2 (code, type, a00, a10)),
8663 /* See if we can build a range comparison. */
8664 if (0 != (tem = fold_range_test (code, type, op0, op1)))
8667 /* Check for the possibility of merging component references. If our
8668 lhs is another similar operation, try to merge its rhs with our
8669 rhs. Then try to merge our lhs and rhs. */
8670 if (TREE_CODE (arg0) == code
8671 && 0 != (tem = fold_truthop (code, type,
8672 TREE_OPERAND (arg0, 1), arg1)))
8673 return fold (build2 (code, type, TREE_OPERAND (arg0, 0), tem));
8675 if ((tem = fold_truthop (code, type, arg0, arg1)) != 0)
8680 case TRUTH_ORIF_EXPR:
8681 /* Note that the operands of this must be ints
8682 and their values must be 0 or true.
8683 ("true" is a fixed value perhaps depending on the language.) */
8684 /* If first arg is constant true, return it. */
8685 if (TREE_CODE (arg0) == INTEGER_CST && ! integer_zerop (arg0))
8686 return fold_convert (type, arg0);
8688 /* If either arg is constant zero, drop it. */
8689 if (TREE_CODE (arg0) == INTEGER_CST && integer_zerop (arg0))
8690 return non_lvalue (fold_convert (type, arg1));
8691 if (TREE_CODE (arg1) == INTEGER_CST && integer_zerop (arg1)
8692 /* Preserve sequence points. */
8693 && (code != TRUTH_ORIF_EXPR || ! TREE_SIDE_EFFECTS (arg0)))
8694 return non_lvalue (fold_convert (type, arg0));
8695 /* If second arg is constant true, result is true, but we must
8696 evaluate first arg. */
8697 if (TREE_CODE (arg1) == INTEGER_CST && ! integer_zerop (arg1))
8698 return omit_one_operand (type, arg1, arg0);
8699 /* Likewise for first arg, but note this only occurs here for
8701 if (TREE_CODE (arg0) == INTEGER_CST && ! integer_zerop (arg0))
8702 return omit_one_operand (type, arg0, arg1);
8704 /* !X || X is always true. */
8705 if (TREE_CODE (arg0) == TRUTH_NOT_EXPR
8706 && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
8707 return omit_one_operand (type, integer_one_node, arg1);
8708 /* X || !X is always true. */
8709 if (TREE_CODE (arg1) == TRUTH_NOT_EXPR
8710 && operand_equal_p (arg0, TREE_OPERAND (arg1, 0), 0))
8711 return omit_one_operand (type, integer_one_node, arg0);
8715 case TRUTH_XOR_EXPR:
8716 /* If the second arg is constant zero, drop it. */
8717 if (integer_zerop (arg1))
8718 return non_lvalue (fold_convert (type, arg0));
8719 /* If the second arg is constant true, this is a logical inversion. */
8720 if (integer_onep (arg1))
8722 /* Only call invert_truthvalue if operand is a truth value. */
8723 if (TREE_CODE (TREE_TYPE (arg0)) != BOOLEAN_TYPE)
8724 tem = fold (build1 (TRUTH_NOT_EXPR, TREE_TYPE (arg0), arg0));
8726 tem = invert_truthvalue (arg0);
8727 return non_lvalue (fold_convert (type, tem));
8729 /* Identical arguments cancel to zero. */
8730 if (operand_equal_p (arg0, arg1, 0))
8731 return omit_one_operand (type, integer_zero_node, arg0);
8733 /* !X ^ X is always true. */
8734 if (TREE_CODE (arg0) == TRUTH_NOT_EXPR
8735 && operand_equal_p (TREE_OPERAND (arg0, 0), arg1, 0))
8736 return omit_one_operand (type, integer_one_node, arg1);
8738 /* X ^ !X is always true. */
8739 if (TREE_CODE (arg1) == TRUTH_NOT_EXPR
8740 && operand_equal_p (arg0, TREE_OPERAND (arg1, 0), 0))
8741 return omit_one_operand (type, integer_one_node, arg0);
8751 /* If one arg is a real or integer constant, put it last. */
8752 if (tree_swap_operands_p (arg0, arg1, true))
8753 return fold (build2 (swap_tree_comparison (code), type, arg1, arg0));
8755 /* If this is an equality comparison of the address of a non-weak
8756 object against zero, then we know the result. */
8757 if ((code == EQ_EXPR || code == NE_EXPR)
8758 && TREE_CODE (arg0) == ADDR_EXPR
8759 && DECL_P (TREE_OPERAND (arg0, 0))
8760 && ! DECL_WEAK (TREE_OPERAND (arg0, 0))
8761 && integer_zerop (arg1))
8762 return constant_boolean_node (code != EQ_EXPR, type);
8764 /* If this is an equality comparison of the address of two non-weak,
8765 unaliased symbols neither of which are extern (since we do not
8766 have access to attributes for externs), then we know the result. */
8767 if ((code == EQ_EXPR || code == NE_EXPR)
8768 && TREE_CODE (arg0) == ADDR_EXPR
8769 && DECL_P (TREE_OPERAND (arg0, 0))
8770 && ! DECL_WEAK (TREE_OPERAND (arg0, 0))
8771 && ! lookup_attribute ("alias",
8772 DECL_ATTRIBUTES (TREE_OPERAND (arg0, 0)))
8773 && ! DECL_EXTERNAL (TREE_OPERAND (arg0, 0))
8774 && TREE_CODE (arg1) == ADDR_EXPR
8775 && DECL_P (TREE_OPERAND (arg1, 0))
8776 && ! DECL_WEAK (TREE_OPERAND (arg1, 0))
8777 && ! lookup_attribute ("alias",
8778 DECL_ATTRIBUTES (TREE_OPERAND (arg1, 0)))
8779 && ! DECL_EXTERNAL (TREE_OPERAND (arg1, 0)))
8780 return constant_boolean_node (operand_equal_p (arg0, arg1, 0)
8781 ? code == EQ_EXPR : code != EQ_EXPR,
8784 /* If this is a comparison of two exprs that look like an
8785 ARRAY_REF of the same object, then we can fold this to a
8786 comparison of the two offsets. */
8787 if (TREE_CODE_CLASS (code) == tcc_comparison)
8789 tree base0, offset0, base1, offset1;
8791 if (extract_array_ref (arg0, &base0, &offset0)
8792 && extract_array_ref (arg1, &base1, &offset1)
8793 && operand_equal_p (base0, base1, 0))
8795 if (offset0 == NULL_TREE
8796 && offset1 == NULL_TREE)
8798 offset0 = integer_zero_node;
8799 offset1 = integer_zero_node;
8801 else if (offset0 == NULL_TREE)
8802 offset0 = build_int_cst (TREE_TYPE (offset1), 0);
8803 else if (offset1 == NULL_TREE)
8804 offset1 = build_int_cst (TREE_TYPE (offset0), 0);
8806 if (TREE_TYPE (offset0) == TREE_TYPE (offset1))
8807 return fold (build2 (code, type, offset0, offset1));
8811 if (FLOAT_TYPE_P (TREE_TYPE (arg0)))
8813 tree targ0 = strip_float_extensions (arg0);
8814 tree targ1 = strip_float_extensions (arg1);
8815 tree newtype = TREE_TYPE (targ0);
8817 if (TYPE_PRECISION (TREE_TYPE (targ1)) > TYPE_PRECISION (newtype))
8818 newtype = TREE_TYPE (targ1);
8820 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
8821 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (TREE_TYPE (arg0)))
8822 return fold (build2 (code, type, fold_convert (newtype, targ0),
8823 fold_convert (newtype, targ1)));
8825 /* (-a) CMP (-b) -> b CMP a */
8826 if (TREE_CODE (arg0) == NEGATE_EXPR
8827 && TREE_CODE (arg1) == NEGATE_EXPR)
8828 return fold (build2 (code, type, TREE_OPERAND (arg1, 0),
8829 TREE_OPERAND (arg0, 0)));
8831 if (TREE_CODE (arg1) == REAL_CST)
8833 REAL_VALUE_TYPE cst;
8834 cst = TREE_REAL_CST (arg1);
8836 /* (-a) CMP CST -> a swap(CMP) (-CST) */
8837 if (TREE_CODE (arg0) == NEGATE_EXPR)
8839 fold (build2 (swap_tree_comparison (code), type,
8840 TREE_OPERAND (arg0, 0),
8841 build_real (TREE_TYPE (arg1),
8842 REAL_VALUE_NEGATE (cst))));
8844 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
8845 /* a CMP (-0) -> a CMP 0 */
8846 if (REAL_VALUE_MINUS_ZERO (cst))
8847 return fold (build2 (code, type, arg0,
8848 build_real (TREE_TYPE (arg1), dconst0)));
8850 /* x != NaN is always true, other ops are always false. */
8851 if (REAL_VALUE_ISNAN (cst)
8852 && ! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1))))
8854 tem = (code == NE_EXPR) ? integer_one_node : integer_zero_node;
8855 return omit_one_operand (type, tem, arg0);
8858 /* Fold comparisons against infinity. */
8859 if (REAL_VALUE_ISINF (cst))
8861 tem = fold_inf_compare (code, type, arg0, arg1);
8862 if (tem != NULL_TREE)
8867 /* If this is a comparison of a real constant with a PLUS_EXPR
8868 or a MINUS_EXPR of a real constant, we can convert it into a
8869 comparison with a revised real constant as long as no overflow
8870 occurs when unsafe_math_optimizations are enabled. */
8871 if (flag_unsafe_math_optimizations
8872 && TREE_CODE (arg1) == REAL_CST
8873 && (TREE_CODE (arg0) == PLUS_EXPR
8874 || TREE_CODE (arg0) == MINUS_EXPR)
8875 && TREE_CODE (TREE_OPERAND (arg0, 1)) == REAL_CST
8876 && 0 != (tem = const_binop (TREE_CODE (arg0) == PLUS_EXPR
8877 ? MINUS_EXPR : PLUS_EXPR,
8878 arg1, TREE_OPERAND (arg0, 1), 0))
8879 && ! TREE_CONSTANT_OVERFLOW (tem))
8880 return fold (build2 (code, type, TREE_OPERAND (arg0, 0), tem));
8882 /* Likewise, we can simplify a comparison of a real constant with
8883 a MINUS_EXPR whose first operand is also a real constant, i.e.
8884 (c1 - x) < c2 becomes x > c1-c2. */
8885 if (flag_unsafe_math_optimizations
8886 && TREE_CODE (arg1) == REAL_CST
8887 && TREE_CODE (arg0) == MINUS_EXPR
8888 && TREE_CODE (TREE_OPERAND (arg0, 0)) == REAL_CST
8889 && 0 != (tem = const_binop (MINUS_EXPR, TREE_OPERAND (arg0, 0),
8891 && ! TREE_CONSTANT_OVERFLOW (tem))
8892 return fold (build2 (swap_tree_comparison (code), type,
8893 TREE_OPERAND (arg0, 1), tem));
8895 /* Fold comparisons against built-in math functions. */
8896 if (TREE_CODE (arg1) == REAL_CST
8897 && flag_unsafe_math_optimizations
8898 && ! flag_errno_math)
8900 enum built_in_function fcode = builtin_mathfn_code (arg0);
8902 if (fcode != END_BUILTINS)
8904 tem = fold_mathfn_compare (fcode, code, type, arg0, arg1);
8905 if (tem != NULL_TREE)
8911 /* Convert foo++ == CONST into ++foo == CONST + INCR. */
8912 if (TREE_CONSTANT (arg1)
8913 && (TREE_CODE (arg0) == POSTINCREMENT_EXPR
8914 || TREE_CODE (arg0) == POSTDECREMENT_EXPR)
8915 /* This optimization is invalid for ordered comparisons
8916 if CONST+INCR overflows or if foo+incr might overflow.
8917 This optimization is invalid for floating point due to rounding.
8918 For pointer types we assume overflow doesn't happen. */
8919 && (POINTER_TYPE_P (TREE_TYPE (arg0))
8920 || (INTEGRAL_TYPE_P (TREE_TYPE (arg0))
8921 && (code == EQ_EXPR || code == NE_EXPR))))
8923 tree varop, newconst;
8925 if (TREE_CODE (arg0) == POSTINCREMENT_EXPR)
8927 newconst = fold (build2 (PLUS_EXPR, TREE_TYPE (arg0),
8928 arg1, TREE_OPERAND (arg0, 1)));
8929 varop = build2 (PREINCREMENT_EXPR, TREE_TYPE (arg0),
8930 TREE_OPERAND (arg0, 0),
8931 TREE_OPERAND (arg0, 1));
8935 newconst = fold (build2 (MINUS_EXPR, TREE_TYPE (arg0),
8936 arg1, TREE_OPERAND (arg0, 1)));
8937 varop = build2 (PREDECREMENT_EXPR, TREE_TYPE (arg0),
8938 TREE_OPERAND (arg0, 0),
8939 TREE_OPERAND (arg0, 1));
8943 /* If VAROP is a reference to a bitfield, we must mask
8944 the constant by the width of the field. */
8945 if (TREE_CODE (TREE_OPERAND (varop, 0)) == COMPONENT_REF
8946 && DECL_BIT_FIELD (TREE_OPERAND (TREE_OPERAND (varop, 0), 1))
8947 && host_integerp (DECL_SIZE (TREE_OPERAND
8948 (TREE_OPERAND (varop, 0), 1)), 1))
8950 tree fielddecl = TREE_OPERAND (TREE_OPERAND (varop, 0), 1);
8951 HOST_WIDE_INT size = tree_low_cst (DECL_SIZE (fielddecl), 1);
8952 tree folded_compare, shift;
8954 /* First check whether the comparison would come out
8955 always the same. If we don't do that we would
8956 change the meaning with the masking. */
8957 folded_compare = fold (build2 (code, type,
8958 TREE_OPERAND (varop, 0), arg1));
8959 if (integer_zerop (folded_compare)
8960 || integer_onep (folded_compare))
8961 return omit_one_operand (type, folded_compare, varop);
8963 shift = build_int_cst (NULL_TREE,
8964 TYPE_PRECISION (TREE_TYPE (varop)) - size);
8965 shift = fold_convert (TREE_TYPE (varop), shift);
8966 newconst = fold (build2 (LSHIFT_EXPR, TREE_TYPE (varop),
8968 newconst = fold (build2 (RSHIFT_EXPR, TREE_TYPE (varop),
8972 return fold (build2 (code, type, varop, newconst));
8975 /* Change X >= C to X > (C - 1) and X < C to X <= (C - 1) if C > 0.
8976 This transformation affects the cases which are handled in later
8977 optimizations involving comparisons with non-negative constants. */
8978 if (TREE_CODE (arg1) == INTEGER_CST
8979 && TREE_CODE (arg0) != INTEGER_CST
8980 && tree_int_cst_sgn (arg1) > 0)
8985 arg1 = const_binop (MINUS_EXPR, arg1, integer_one_node, 0);
8986 return fold (build2 (GT_EXPR, type, arg0, arg1));
8989 arg1 = const_binop (MINUS_EXPR, arg1, integer_one_node, 0);
8990 return fold (build2 (LE_EXPR, type, arg0, arg1));
8997 /* Comparisons with the highest or lowest possible integer of
8998 the specified size will have known values.
9000 This is quite similar to fold_relational_hi_lo, however,
9001 attempts to share the code have been nothing but trouble. */
9003 int width = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (arg1)));
9005 if (TREE_CODE (arg1) == INTEGER_CST
9006 && ! TREE_CONSTANT_OVERFLOW (arg1)
9007 && width <= 2 * HOST_BITS_PER_WIDE_INT
9008 && (INTEGRAL_TYPE_P (TREE_TYPE (arg1))
9009 || POINTER_TYPE_P (TREE_TYPE (arg1))))
9011 HOST_WIDE_INT signed_max_hi;
9012 unsigned HOST_WIDE_INT signed_max_lo;
9013 unsigned HOST_WIDE_INT max_hi, max_lo, min_hi, min_lo;
9015 if (width <= HOST_BITS_PER_WIDE_INT)
9017 signed_max_lo = ((unsigned HOST_WIDE_INT) 1 << (width - 1))
9022 if (TYPE_UNSIGNED (TREE_TYPE (arg1)))
9024 max_lo = ((unsigned HOST_WIDE_INT) 2 << (width - 1)) - 1;
9030 max_lo = signed_max_lo;
9031 min_lo = ((unsigned HOST_WIDE_INT) -1 << (width - 1));
9037 width -= HOST_BITS_PER_WIDE_INT;
9039 signed_max_hi = ((unsigned HOST_WIDE_INT) 1 << (width - 1))
9044 if (TYPE_UNSIGNED (TREE_TYPE (arg1)))
9046 max_hi = ((unsigned HOST_WIDE_INT) 2 << (width - 1)) - 1;
9051 max_hi = signed_max_hi;
9052 min_hi = ((unsigned HOST_WIDE_INT) -1 << (width - 1));
9056 if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (arg1) == max_hi
9057 && TREE_INT_CST_LOW (arg1) == max_lo)
9061 return omit_one_operand (type, integer_zero_node, arg0);
9064 return fold (build2 (EQ_EXPR, type, arg0, arg1));
9067 return omit_one_operand (type, integer_one_node, arg0);
9070 return fold (build2 (NE_EXPR, type, arg0, arg1));
9072 /* The GE_EXPR and LT_EXPR cases above are not normally
9073 reached because of previous transformations. */
9078 else if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (arg1)
9080 && TREE_INT_CST_LOW (arg1) == max_lo - 1)
9084 arg1 = const_binop (PLUS_EXPR, arg1, integer_one_node, 0);
9085 return fold (build2 (EQ_EXPR, type, arg0, arg1));
9087 arg1 = const_binop (PLUS_EXPR, arg1, integer_one_node, 0);
9088 return fold (build2 (NE_EXPR, type, arg0, arg1));
9092 else if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (arg1)
9094 && TREE_INT_CST_LOW (arg1) == min_lo)
9098 return omit_one_operand (type, integer_zero_node, arg0);
9101 return fold (build2 (EQ_EXPR, type, arg0, arg1));
9104 return omit_one_operand (type, integer_one_node, arg0);
9107 return fold (build2 (NE_EXPR, type, arg0, arg1));
9112 else if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (arg1)
9114 && TREE_INT_CST_LOW (arg1) == min_lo + 1)
9118 arg1 = const_binop (MINUS_EXPR, arg1, integer_one_node, 0);
9119 return fold (build2 (NE_EXPR, type, arg0, arg1));
9121 arg1 = const_binop (MINUS_EXPR, arg1, integer_one_node, 0);
9122 return fold (build2 (EQ_EXPR, type, arg0, arg1));
9127 else if (!in_gimple_form
9128 && TREE_INT_CST_HIGH (arg1) == signed_max_hi
9129 && TREE_INT_CST_LOW (arg1) == signed_max_lo
9130 && TYPE_UNSIGNED (TREE_TYPE (arg1))
9131 /* signed_type does not work on pointer types. */
9132 && INTEGRAL_TYPE_P (TREE_TYPE (arg1)))
9134 /* The following case also applies to X < signed_max+1
9135 and X >= signed_max+1 because previous transformations. */
9136 if (code == LE_EXPR || code == GT_EXPR)
9139 st0 = lang_hooks.types.signed_type (TREE_TYPE (arg0));
9140 st1 = lang_hooks.types.signed_type (TREE_TYPE (arg1));
9142 (build2 (code == LE_EXPR ? GE_EXPR: LT_EXPR,
9143 type, fold_convert (st0, arg0),
9144 fold_convert (st1, integer_zero_node)));
9150 /* If this is an EQ or NE comparison of a constant with a PLUS_EXPR or
9151 a MINUS_EXPR of a constant, we can convert it into a comparison with
9152 a revised constant as long as no overflow occurs. */
9153 if ((code == EQ_EXPR || code == NE_EXPR)
9154 && TREE_CODE (arg1) == INTEGER_CST
9155 && (TREE_CODE (arg0) == PLUS_EXPR
9156 || TREE_CODE (arg0) == MINUS_EXPR)
9157 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
9158 && 0 != (tem = const_binop (TREE_CODE (arg0) == PLUS_EXPR
9159 ? MINUS_EXPR : PLUS_EXPR,
9160 arg1, TREE_OPERAND (arg0, 1), 0))
9161 && ! TREE_CONSTANT_OVERFLOW (tem))
9162 return fold (build2 (code, type, TREE_OPERAND (arg0, 0), tem));
9164 /* Similarly for a NEGATE_EXPR. */
9165 else if ((code == EQ_EXPR || code == NE_EXPR)
9166 && TREE_CODE (arg0) == NEGATE_EXPR
9167 && TREE_CODE (arg1) == INTEGER_CST
9168 && 0 != (tem = negate_expr (arg1))
9169 && TREE_CODE (tem) == INTEGER_CST
9170 && ! TREE_CONSTANT_OVERFLOW (tem))
9171 return fold (build2 (code, type, TREE_OPERAND (arg0, 0), tem));
9173 /* If we have X - Y == 0, we can convert that to X == Y and similarly
9174 for !=. Don't do this for ordered comparisons due to overflow. */
9175 else if ((code == NE_EXPR || code == EQ_EXPR)
9176 && integer_zerop (arg1) && TREE_CODE (arg0) == MINUS_EXPR)
9177 return fold (build2 (code, type,
9178 TREE_OPERAND (arg0, 0), TREE_OPERAND (arg0, 1)));
9180 else if (TREE_CODE (TREE_TYPE (arg0)) == INTEGER_TYPE
9181 && (TREE_CODE (arg0) == NOP_EXPR
9182 || TREE_CODE (arg0) == CONVERT_EXPR))
9184 /* If we are widening one operand of an integer comparison,
9185 see if the other operand is similarly being widened. Perhaps we
9186 can do the comparison in the narrower type. */
9187 tem = fold_widened_comparison (code, type, arg0, arg1);
9191 /* Or if we are changing signedness. */
9192 tem = fold_sign_changed_comparison (code, type, arg0, arg1);
9197 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
9198 constant, we can simplify it. */
9199 else if (TREE_CODE (arg1) == INTEGER_CST
9200 && (TREE_CODE (arg0) == MIN_EXPR
9201 || TREE_CODE (arg0) == MAX_EXPR)
9202 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST)
9204 tem = optimize_minmax_comparison (code, type, op0, op1);
9211 /* If we are comparing an ABS_EXPR with a constant, we can
9212 convert all the cases into explicit comparisons, but they may
9213 well not be faster than doing the ABS and one comparison.
9214 But ABS (X) <= C is a range comparison, which becomes a subtraction
9215 and a comparison, and is probably faster. */
9216 else if (code == LE_EXPR && TREE_CODE (arg1) == INTEGER_CST
9217 && TREE_CODE (arg0) == ABS_EXPR
9218 && ! TREE_SIDE_EFFECTS (arg0)
9219 && (0 != (tem = negate_expr (arg1)))
9220 && TREE_CODE (tem) == INTEGER_CST
9221 && ! TREE_CONSTANT_OVERFLOW (tem))
9222 return fold (build2 (TRUTH_ANDIF_EXPR, type,
9223 build2 (GE_EXPR, type,
9224 TREE_OPERAND (arg0, 0), tem),
9225 build2 (LE_EXPR, type,
9226 TREE_OPERAND (arg0, 0), arg1)));
9228 /* Convert ABS_EXPR<x> >= 0 to true. */
9229 else if (code == GE_EXPR
9230 && tree_expr_nonnegative_p (arg0)
9231 && (integer_zerop (arg1)
9232 || (! HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0)))
9233 && real_zerop (arg1))))
9234 return omit_one_operand (type, integer_one_node, arg0);
9236 /* Convert ABS_EXPR<x> < 0 to false. */
9237 else if (code == LT_EXPR
9238 && tree_expr_nonnegative_p (arg0)
9239 && (integer_zerop (arg1) || real_zerop (arg1)))
9240 return omit_one_operand (type, integer_zero_node, arg0);
9242 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
9243 else if ((code == EQ_EXPR || code == NE_EXPR)
9244 && TREE_CODE (arg0) == ABS_EXPR
9245 && (integer_zerop (arg1) || real_zerop (arg1)))
9246 return fold (build2 (code, type, TREE_OPERAND (arg0, 0), arg1));
9248 /* If this is an EQ or NE comparison with zero and ARG0 is
9249 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
9250 two operations, but the latter can be done in one less insn
9251 on machines that have only two-operand insns or on which a
9252 constant cannot be the first operand. */
9253 if (integer_zerop (arg1) && (code == EQ_EXPR || code == NE_EXPR)
9254 && TREE_CODE (arg0) == BIT_AND_EXPR)
9256 tree arg00 = TREE_OPERAND (arg0, 0);
9257 tree arg01 = TREE_OPERAND (arg0, 1);
9258 if (TREE_CODE (arg00) == LSHIFT_EXPR
9259 && integer_onep (TREE_OPERAND (arg00, 0)))
9261 fold (build2 (code, type,
9262 build2 (BIT_AND_EXPR, TREE_TYPE (arg0),
9263 build2 (RSHIFT_EXPR, TREE_TYPE (arg00),
9264 arg01, TREE_OPERAND (arg00, 1)),
9265 fold_convert (TREE_TYPE (arg0),
9268 else if (TREE_CODE (TREE_OPERAND (arg0, 1)) == LSHIFT_EXPR
9269 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg0, 1), 0)))
9271 fold (build2 (code, type,
9272 build2 (BIT_AND_EXPR, TREE_TYPE (arg0),
9273 build2 (RSHIFT_EXPR, TREE_TYPE (arg01),
9274 arg00, TREE_OPERAND (arg01, 1)),
9275 fold_convert (TREE_TYPE (arg0),
9280 /* If this is an NE or EQ comparison of zero against the result of a
9281 signed MOD operation whose second operand is a power of 2, make
9282 the MOD operation unsigned since it is simpler and equivalent. */
9283 if ((code == NE_EXPR || code == EQ_EXPR)
9284 && integer_zerop (arg1)
9285 && !TYPE_UNSIGNED (TREE_TYPE (arg0))
9286 && (TREE_CODE (arg0) == TRUNC_MOD_EXPR
9287 || TREE_CODE (arg0) == CEIL_MOD_EXPR
9288 || TREE_CODE (arg0) == FLOOR_MOD_EXPR
9289 || TREE_CODE (arg0) == ROUND_MOD_EXPR)
9290 && integer_pow2p (TREE_OPERAND (arg0, 1)))
9292 tree newtype = lang_hooks.types.unsigned_type (TREE_TYPE (arg0));
9293 tree newmod = fold (build2 (TREE_CODE (arg0), newtype,
9294 fold_convert (newtype,
9295 TREE_OPERAND (arg0, 0)),
9296 fold_convert (newtype,
9297 TREE_OPERAND (arg0, 1))));
9299 return fold (build2 (code, type, newmod,
9300 fold_convert (newtype, arg1)));
9303 /* If this is an NE comparison of zero with an AND of one, remove the
9304 comparison since the AND will give the correct value. */
9305 if (code == NE_EXPR && integer_zerop (arg1)
9306 && TREE_CODE (arg0) == BIT_AND_EXPR
9307 && integer_onep (TREE_OPERAND (arg0, 1)))
9308 return fold_convert (type, arg0);
9310 /* If we have (A & C) == C where C is a power of 2, convert this into
9311 (A & C) != 0. Similarly for NE_EXPR. */
9312 if ((code == EQ_EXPR || code == NE_EXPR)
9313 && TREE_CODE (arg0) == BIT_AND_EXPR
9314 && integer_pow2p (TREE_OPERAND (arg0, 1))
9315 && operand_equal_p (TREE_OPERAND (arg0, 1), arg1, 0))
9316 return fold (build2 (code == EQ_EXPR ? NE_EXPR : EQ_EXPR, type,
9317 arg0, fold_convert (TREE_TYPE (arg0),
9318 integer_zero_node)));
9320 /* If we have (A & C) != 0 or (A & C) == 0 and C is a power of
9321 2, then fold the expression into shifts and logical operations. */
9322 tem = fold_single_bit_test (code, arg0, arg1, type);
9326 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
9327 Similarly for NE_EXPR. */
9328 if ((code == EQ_EXPR || code == NE_EXPR)
9329 && TREE_CODE (arg0) == BIT_AND_EXPR
9330 && TREE_CODE (arg1) == INTEGER_CST
9331 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST)
9333 tree notc = fold (build1 (BIT_NOT_EXPR,
9334 TREE_TYPE (TREE_OPERAND (arg0, 1)),
9335 TREE_OPERAND (arg0, 1)));
9336 tree dandnotc = fold (build2 (BIT_AND_EXPR, TREE_TYPE (arg0),
9338 tree rslt = code == EQ_EXPR ? integer_zero_node : integer_one_node;
9339 if (integer_nonzerop (dandnotc))
9340 return omit_one_operand (type, rslt, arg0);
9343 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
9344 Similarly for NE_EXPR. */
9345 if ((code == EQ_EXPR || code == NE_EXPR)
9346 && TREE_CODE (arg0) == BIT_IOR_EXPR
9347 && TREE_CODE (arg1) == INTEGER_CST
9348 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST)
9350 tree notd = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (arg1), arg1));
9351 tree candnotd = fold (build2 (BIT_AND_EXPR, TREE_TYPE (arg0),
9352 TREE_OPERAND (arg0, 1), notd));
9353 tree rslt = code == EQ_EXPR ? integer_zero_node : integer_one_node;
9354 if (integer_nonzerop (candnotd))
9355 return omit_one_operand (type, rslt, arg0);
9358 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
9359 and similarly for >= into !=. */
9360 if ((code == LT_EXPR || code == GE_EXPR)
9361 && TYPE_UNSIGNED (TREE_TYPE (arg0))
9362 && TREE_CODE (arg1) == LSHIFT_EXPR
9363 && integer_onep (TREE_OPERAND (arg1, 0)))
9364 return build2 (code == LT_EXPR ? EQ_EXPR : NE_EXPR, type,
9365 build2 (RSHIFT_EXPR, TREE_TYPE (arg0), arg0,
9366 TREE_OPERAND (arg1, 1)),
9367 fold_convert (TREE_TYPE (arg0), integer_zero_node));
9369 else if ((code == LT_EXPR || code == GE_EXPR)
9370 && TYPE_UNSIGNED (TREE_TYPE (arg0))
9371 && (TREE_CODE (arg1) == NOP_EXPR
9372 || TREE_CODE (arg1) == CONVERT_EXPR)
9373 && TREE_CODE (TREE_OPERAND (arg1, 0)) == LSHIFT_EXPR
9374 && integer_onep (TREE_OPERAND (TREE_OPERAND (arg1, 0), 0)))
9376 build2 (code == LT_EXPR ? EQ_EXPR : NE_EXPR, type,
9377 fold_convert (TREE_TYPE (arg0),
9378 build2 (RSHIFT_EXPR, TREE_TYPE (arg0), arg0,
9379 TREE_OPERAND (TREE_OPERAND (arg1, 0),
9381 fold_convert (TREE_TYPE (arg0), integer_zero_node));
9383 /* Simplify comparison of something with itself. (For IEEE
9384 floating-point, we can only do some of these simplifications.) */
9385 if (operand_equal_p (arg0, arg1, 0))
9390 if (! FLOAT_TYPE_P (TREE_TYPE (arg0))
9391 || ! HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
9392 return constant_boolean_node (1, type);
9397 if (! FLOAT_TYPE_P (TREE_TYPE (arg0))
9398 || ! HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
9399 return constant_boolean_node (1, type);
9400 return fold (build2 (EQ_EXPR, type, arg0, arg1));
9403 /* For NE, we can only do this simplification if integer
9404 or we don't honor IEEE floating point NaNs. */
9405 if (FLOAT_TYPE_P (TREE_TYPE (arg0))
9406 && HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))))
9408 /* ... fall through ... */
9411 return constant_boolean_node (0, type);
9417 /* If we are comparing an expression that just has comparisons
9418 of two integer values, arithmetic expressions of those comparisons,
9419 and constants, we can simplify it. There are only three cases
9420 to check: the two values can either be equal, the first can be
9421 greater, or the second can be greater. Fold the expression for
9422 those three values. Since each value must be 0 or 1, we have
9423 eight possibilities, each of which corresponds to the constant 0
9424 or 1 or one of the six possible comparisons.
9426 This handles common cases like (a > b) == 0 but also handles
9427 expressions like ((x > y) - (y > x)) > 0, which supposedly
9428 occur in macroized code. */
9430 if (TREE_CODE (arg1) == INTEGER_CST && TREE_CODE (arg0) != INTEGER_CST)
9432 tree cval1 = 0, cval2 = 0;
9435 if (twoval_comparison_p (arg0, &cval1, &cval2, &save_p)
9436 /* Don't handle degenerate cases here; they should already
9437 have been handled anyway. */
9438 && cval1 != 0 && cval2 != 0
9439 && ! (TREE_CONSTANT (cval1) && TREE_CONSTANT (cval2))
9440 && TREE_TYPE (cval1) == TREE_TYPE (cval2)
9441 && INTEGRAL_TYPE_P (TREE_TYPE (cval1))
9442 && TYPE_MAX_VALUE (TREE_TYPE (cval1))
9443 && TYPE_MAX_VALUE (TREE_TYPE (cval2))
9444 && ! operand_equal_p (TYPE_MIN_VALUE (TREE_TYPE (cval1)),
9445 TYPE_MAX_VALUE (TREE_TYPE (cval2)), 0))
9447 tree maxval = TYPE_MAX_VALUE (TREE_TYPE (cval1));
9448 tree minval = TYPE_MIN_VALUE (TREE_TYPE (cval1));
9450 /* We can't just pass T to eval_subst in case cval1 or cval2
9451 was the same as ARG1. */
9454 = fold (build2 (code, type,
9455 eval_subst (arg0, cval1, maxval,
9459 = fold (build2 (code, type,
9460 eval_subst (arg0, cval1, maxval,
9464 = fold (build2 (code, type,
9465 eval_subst (arg0, cval1, minval,
9469 /* All three of these results should be 0 or 1. Confirm they
9470 are. Then use those values to select the proper code
9473 if ((integer_zerop (high_result)
9474 || integer_onep (high_result))
9475 && (integer_zerop (equal_result)
9476 || integer_onep (equal_result))
9477 && (integer_zerop (low_result)
9478 || integer_onep (low_result)))
9480 /* Make a 3-bit mask with the high-order bit being the
9481 value for `>', the next for '=', and the low for '<'. */
9482 switch ((integer_onep (high_result) * 4)
9483 + (integer_onep (equal_result) * 2)
9484 + integer_onep (low_result))
9488 return omit_one_operand (type, integer_zero_node, arg0);
9509 return omit_one_operand (type, integer_one_node, arg0);
9512 tem = build2 (code, type, cval1, cval2);
9514 return save_expr (tem);
9521 /* If this is a comparison of a field, we may be able to simplify it. */
9522 if (((TREE_CODE (arg0) == COMPONENT_REF
9523 && lang_hooks.can_use_bit_fields_p ())
9524 || TREE_CODE (arg0) == BIT_FIELD_REF)
9525 && (code == EQ_EXPR || code == NE_EXPR)
9526 /* Handle the constant case even without -O
9527 to make sure the warnings are given. */
9528 && (optimize || TREE_CODE (arg1) == INTEGER_CST))
9530 t1 = optimize_bit_field_compare (code, type, arg0, arg1);
9535 /* If this is a comparison of complex values and either or both sides
9536 are a COMPLEX_EXPR or COMPLEX_CST, it is best to split up the
9537 comparisons and join them with a TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR.
9538 This may prevent needless evaluations. */
9539 if ((code == EQ_EXPR || code == NE_EXPR)
9540 && TREE_CODE (TREE_TYPE (arg0)) == COMPLEX_TYPE
9541 && (TREE_CODE (arg0) == COMPLEX_EXPR
9542 || TREE_CODE (arg1) == COMPLEX_EXPR
9543 || TREE_CODE (arg0) == COMPLEX_CST
9544 || TREE_CODE (arg1) == COMPLEX_CST))
9546 tree subtype = TREE_TYPE (TREE_TYPE (arg0));
9547 tree real0, imag0, real1, imag1;
9549 arg0 = save_expr (arg0);
9550 arg1 = save_expr (arg1);
9551 real0 = fold (build1 (REALPART_EXPR, subtype, arg0));
9552 imag0 = fold (build1 (IMAGPART_EXPR, subtype, arg0));
9553 real1 = fold (build1 (REALPART_EXPR, subtype, arg1));
9554 imag1 = fold (build1 (IMAGPART_EXPR, subtype, arg1));
9556 return fold (build2 ((code == EQ_EXPR ? TRUTH_ANDIF_EXPR
9559 fold (build2 (code, type, real0, real1)),
9560 fold (build2 (code, type, imag0, imag1))));
9563 /* Optimize comparisons of strlen vs zero to a compare of the
9564 first character of the string vs zero. To wit,
9565 strlen(ptr) == 0 => *ptr == 0
9566 strlen(ptr) != 0 => *ptr != 0
9567 Other cases should reduce to one of these two (or a constant)
9568 due to the return value of strlen being unsigned. */
9569 if ((code == EQ_EXPR || code == NE_EXPR)
9570 && integer_zerop (arg1)
9571 && TREE_CODE (arg0) == CALL_EXPR)
9573 tree fndecl = get_callee_fndecl (arg0);
9577 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
9578 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_STRLEN
9579 && (arglist = TREE_OPERAND (arg0, 1))
9580 && TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) == POINTER_TYPE
9581 && ! TREE_CHAIN (arglist))
9582 return fold (build2 (code, type,
9583 build1 (INDIRECT_REF, char_type_node,
9584 TREE_VALUE (arglist)),
9585 fold_convert (char_type_node,
9586 integer_zero_node)));
9589 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
9590 into a single range test. */
9591 if ((TREE_CODE (arg0) == TRUNC_DIV_EXPR
9592 || TREE_CODE (arg0) == EXACT_DIV_EXPR)
9593 && TREE_CODE (arg1) == INTEGER_CST
9594 && TREE_CODE (TREE_OPERAND (arg0, 1)) == INTEGER_CST
9595 && !integer_zerop (TREE_OPERAND (arg0, 1))
9596 && !TREE_OVERFLOW (TREE_OPERAND (arg0, 1))
9597 && !TREE_OVERFLOW (arg1))
9599 t1 = fold_div_compare (code, type, arg0, arg1);
9600 if (t1 != NULL_TREE)
9604 if ((code == EQ_EXPR || code == NE_EXPR)
9605 && !TREE_SIDE_EFFECTS (arg0)
9606 && integer_zerop (arg1)
9607 && tree_expr_nonzero_p (arg0))
9608 return constant_boolean_node (code==NE_EXPR, type);
9610 t1 = fold_relational_const (code, type, arg0, arg1);
9611 return t1 == NULL_TREE ? NULL_TREE : t1;
9613 case UNORDERED_EXPR:
9621 if (TREE_CODE (arg0) == REAL_CST && TREE_CODE (arg1) == REAL_CST)
9623 t1 = fold_relational_const (code, type, arg0, arg1);
9624 if (t1 != NULL_TREE)
9628 /* If the first operand is NaN, the result is constant. */
9629 if (TREE_CODE (arg0) == REAL_CST
9630 && REAL_VALUE_ISNAN (TREE_REAL_CST (arg0))
9631 && (code != LTGT_EXPR || ! flag_trapping_math))
9633 t1 = (code == ORDERED_EXPR || code == LTGT_EXPR)
9636 return omit_one_operand (type, t1, arg1);
9639 /* If the second operand is NaN, the result is constant. */
9640 if (TREE_CODE (arg1) == REAL_CST
9641 && REAL_VALUE_ISNAN (TREE_REAL_CST (arg1))
9642 && (code != LTGT_EXPR || ! flag_trapping_math))
9644 t1 = (code == ORDERED_EXPR || code == LTGT_EXPR)
9647 return omit_one_operand (type, t1, arg0);
9650 /* Simplify unordered comparison of something with itself. */
9651 if ((code == UNLE_EXPR || code == UNGE_EXPR || code == UNEQ_EXPR)
9652 && operand_equal_p (arg0, arg1, 0))
9653 return constant_boolean_node (1, type);
9655 if (code == LTGT_EXPR
9656 && !flag_trapping_math
9657 && operand_equal_p (arg0, arg1, 0))
9658 return constant_boolean_node (0, type);
9660 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
9662 tree targ0 = strip_float_extensions (arg0);
9663 tree targ1 = strip_float_extensions (arg1);
9664 tree newtype = TREE_TYPE (targ0);
9666 if (TYPE_PRECISION (TREE_TYPE (targ1)) > TYPE_PRECISION (newtype))
9667 newtype = TREE_TYPE (targ1);
9669 if (TYPE_PRECISION (newtype) < TYPE_PRECISION (TREE_TYPE (arg0)))
9670 return fold (build2 (code, type, fold_convert (newtype, targ0),
9671 fold_convert (newtype, targ1)));
9677 /* When pedantic, a compound expression can be neither an lvalue
9678 nor an integer constant expression. */
9679 if (TREE_SIDE_EFFECTS (arg0) || TREE_CONSTANT (arg1))
9681 /* Don't let (0, 0) be null pointer constant. */
9682 tem = integer_zerop (arg1) ? build1 (NOP_EXPR, type, arg1)
9683 : fold_convert (type, arg1);
9684 return pedantic_non_lvalue (tem);
9688 return build_complex (type, arg0, arg1);
9693 } /* switch (code) */
9696 /* Fold a ternary expression EXPR. Return the folded expression if
9697 folding is successful. Otherwise, return the original
9701 fold_ternary (tree expr)
9703 const tree t = expr;
9704 const tree type = TREE_TYPE (expr);
9707 tree arg0 = NULL_TREE, arg1 = NULL_TREE;
9708 enum tree_code code = TREE_CODE (t);
9709 enum tree_code_class kind = TREE_CODE_CLASS (code);
9711 gcc_assert (IS_EXPR_CODE_CLASS (kind)
9712 && TREE_CODE_LENGTH (code) == 3);
9714 op0 = TREE_OPERAND (t, 0);
9715 op1 = TREE_OPERAND (t, 1);
9716 op2 = TREE_OPERAND (t, 2);
9718 /* Strip any conversions that don't change the mode. This is safe
9719 for every expression, except for a comparison expression because
9720 its signedness is derived from its operands. So, in the latter
9721 case, only strip conversions that don't change the signedness.
9723 Note that this is done as an internal manipulation within the
9724 constant folder, in order to find the simplest representation of
9725 the arguments so that their form can be studied. In any cases,
9726 the appropriate type conversions should be put back in the tree
9727 that will get out of the constant folder. */
9743 if (TREE_CODE (arg0) == CONSTRUCTOR
9744 && ! type_contains_placeholder_p (TREE_TYPE (arg0)))
9746 tree m = purpose_member (arg1, CONSTRUCTOR_ELTS (arg0));
9748 return TREE_VALUE (m);
9753 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
9754 so all simple results must be passed through pedantic_non_lvalue. */
9755 if (TREE_CODE (arg0) == INTEGER_CST)
9757 tem = integer_zerop (arg0) ? op2 : op1;
9758 /* Only optimize constant conditions when the selected branch
9759 has the same type as the COND_EXPR. This avoids optimizing
9760 away "c ? x : throw", where the throw has a void type. */
9761 if (! VOID_TYPE_P (TREE_TYPE (tem))
9762 || VOID_TYPE_P (type))
9763 return pedantic_non_lvalue (tem);
9766 if (operand_equal_p (arg1, op2, 0))
9767 return pedantic_omit_one_operand (type, arg1, arg0);
9769 /* If we have A op B ? A : C, we may be able to convert this to a
9770 simpler expression, depending on the operation and the values
9771 of B and C. Signed zeros prevent all of these transformations,
9772 for reasons given above each one.
9774 Also try swapping the arguments and inverting the conditional. */
9775 if (COMPARISON_CLASS_P (arg0)
9776 && operand_equal_for_comparison_p (TREE_OPERAND (arg0, 0),
9777 arg1, TREE_OPERAND (arg0, 1))
9778 && !HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg1))))
9780 tem = fold_cond_expr_with_comparison (type, arg0, op1, op2);
9785 if (COMPARISON_CLASS_P (arg0)
9786 && operand_equal_for_comparison_p (TREE_OPERAND (arg0, 0),
9788 TREE_OPERAND (arg0, 1))
9789 && !HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (op2))))
9791 tem = invert_truthvalue (arg0);
9792 if (COMPARISON_CLASS_P (tem))
9794 tem = fold_cond_expr_with_comparison (type, tem, op2, op1);
9800 /* If the second operand is simpler than the third, swap them
9801 since that produces better jump optimization results. */
9802 if (tree_swap_operands_p (op1, op2, false))
9804 /* See if this can be inverted. If it can't, possibly because
9805 it was a floating-point inequality comparison, don't do
9807 tem = invert_truthvalue (arg0);
9809 if (TREE_CODE (tem) != TRUTH_NOT_EXPR)
9810 return fold (build3 (code, type, tem, op2, op1));
9813 /* Convert A ? 1 : 0 to simply A. */
9814 if (integer_onep (op1)
9815 && integer_zerop (op2)
9816 /* If we try to convert OP0 to our type, the
9817 call to fold will try to move the conversion inside
9818 a COND, which will recurse. In that case, the COND_EXPR
9819 is probably the best choice, so leave it alone. */
9820 && type == TREE_TYPE (arg0))
9821 return pedantic_non_lvalue (arg0);
9823 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
9824 over COND_EXPR in cases such as floating point comparisons. */
9825 if (integer_zerop (op1)
9826 && integer_onep (op2)
9827 && truth_value_p (TREE_CODE (arg0)))
9828 return pedantic_non_lvalue (fold_convert (type,
9829 invert_truthvalue (arg0)));
9831 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
9832 if (TREE_CODE (arg0) == LT_EXPR
9833 && integer_zerop (TREE_OPERAND (arg0, 1))
9834 && integer_zerop (op2)
9835 && (tem = sign_bit_p (TREE_OPERAND (arg0, 0), arg1)))
9836 return fold_convert (type, fold (build2 (BIT_AND_EXPR,
9837 TREE_TYPE (tem), tem, arg1)));
9839 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
9840 already handled above. */
9841 if (TREE_CODE (arg0) == BIT_AND_EXPR
9842 && integer_onep (TREE_OPERAND (arg0, 1))
9843 && integer_zerop (op2)
9844 && integer_pow2p (arg1))
9846 tree tem = TREE_OPERAND (arg0, 0);
9848 if (TREE_CODE (tem) == RSHIFT_EXPR
9849 && TREE_CODE (TREE_OPERAND (tem, 1)) == INTEGER_CST
9850 && (unsigned HOST_WIDE_INT) tree_log2 (arg1) ==
9851 TREE_INT_CST_LOW (TREE_OPERAND (tem, 1)))
9852 return fold (build2 (BIT_AND_EXPR, type,
9853 TREE_OPERAND (tem, 0), arg1));
9856 /* A & N ? N : 0 is simply A & N if N is a power of two. This
9857 is probably obsolete because the first operand should be a
9858 truth value (that's why we have the two cases above), but let's
9859 leave it in until we can confirm this for all front-ends. */
9860 if (integer_zerop (op2)
9861 && TREE_CODE (arg0) == NE_EXPR
9862 && integer_zerop (TREE_OPERAND (arg0, 1))
9863 && integer_pow2p (arg1)
9864 && TREE_CODE (TREE_OPERAND (arg0, 0)) == BIT_AND_EXPR
9865 && operand_equal_p (TREE_OPERAND (TREE_OPERAND (arg0, 0), 1),
9866 arg1, OEP_ONLY_CONST))
9867 return pedantic_non_lvalue (fold_convert (type,
9868 TREE_OPERAND (arg0, 0)));
9870 /* Convert A ? B : 0 into A && B if A and B are truth values. */
9871 if (integer_zerop (op2)
9872 && truth_value_p (TREE_CODE (arg0))
9873 && truth_value_p (TREE_CODE (arg1)))
9874 return fold (build2 (TRUTH_ANDIF_EXPR, type, arg0, arg1));
9876 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
9877 if (integer_onep (op2)
9878 && truth_value_p (TREE_CODE (arg0))
9879 && truth_value_p (TREE_CODE (arg1)))
9881 /* Only perform transformation if ARG0 is easily inverted. */
9882 tem = invert_truthvalue (arg0);
9883 if (TREE_CODE (tem) != TRUTH_NOT_EXPR)
9884 return fold (build2 (TRUTH_ORIF_EXPR, type, tem, arg1));
9887 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
9888 if (integer_zerop (arg1)
9889 && truth_value_p (TREE_CODE (arg0))
9890 && truth_value_p (TREE_CODE (op2)))
9892 /* Only perform transformation if ARG0 is easily inverted. */
9893 tem = invert_truthvalue (arg0);
9894 if (TREE_CODE (tem) != TRUTH_NOT_EXPR)
9895 return fold (build2 (TRUTH_ANDIF_EXPR, type, tem, op2));
9898 /* Convert A ? 1 : B into A || B if A and B are truth values. */
9899 if (integer_onep (arg1)
9900 && truth_value_p (TREE_CODE (arg0))
9901 && truth_value_p (TREE_CODE (op2)))
9902 return fold (build2 (TRUTH_ORIF_EXPR, type, arg0, op2));
9907 /* Check for a built-in function. */
9908 if (TREE_CODE (op0) == ADDR_EXPR
9909 && TREE_CODE (TREE_OPERAND (op0, 0)) == FUNCTION_DECL
9910 && DECL_BUILT_IN (TREE_OPERAND (op0, 0)))
9912 tree fndecl = get_callee_fndecl (t);
9913 tree arglist = TREE_OPERAND (t, 1);
9914 tree tmp = fold_builtin (fndecl, arglist, false);
9922 } /* switch (code) */
9925 /* Perform constant folding and related simplification of EXPR.
9926 The related simplifications include x*1 => x, x*0 => 0, etc.,
9927 and application of the associative law.
9928 NOP_EXPR conversions may be removed freely (as long as we
9929 are careful not to change the type of the overall expression).
9930 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
9931 but we can constant-fold them if they have constant operands. */
9933 #ifdef ENABLE_FOLD_CHECKING
9934 # define fold(x) fold_1 (x)
9935 static tree fold_1 (tree);
9941 const tree t = expr;
9942 enum tree_code code = TREE_CODE (t);
9943 enum tree_code_class kind = TREE_CODE_CLASS (code);
9946 /* Return right away if a constant. */
9947 if (kind == tcc_constant)
9950 if (IS_EXPR_CODE_CLASS (kind))
9952 tree type = TREE_TYPE (t);
9955 switch (TREE_CODE_LENGTH (code))
9958 op0 = TREE_OPERAND (t, 0);
9959 tem = fold_unary (code, type, op0);
9960 return tem ? tem : expr;
9962 op0 = TREE_OPERAND (t, 0);
9963 op1 = TREE_OPERAND (t, 1);
9964 tem = fold_binary (code, type, op0, op1);
9965 return tem ? tem : expr;
9967 tem = fold_ternary (expr);
9968 return tem ? tem : expr;
9977 return fold (DECL_INITIAL (t));
9981 } /* switch (code) */
9984 #ifdef ENABLE_FOLD_CHECKING
9987 static void fold_checksum_tree (tree, struct md5_ctx *, htab_t);
9988 static void fold_check_failed (tree, tree);
9989 void print_fold_checksum (tree);
9991 /* When --enable-checking=fold, compute a digest of expr before
9992 and after actual fold call to see if fold did not accidentally
9993 change original expr. */
10000 unsigned char checksum_before[16], checksum_after[16];
10003 ht = htab_create (32, htab_hash_pointer, htab_eq_pointer, NULL);
10004 md5_init_ctx (&ctx);
10005 fold_checksum_tree (expr, &ctx, ht);
10006 md5_finish_ctx (&ctx, checksum_before);
10009 ret = fold_1 (expr);
10011 md5_init_ctx (&ctx);
10012 fold_checksum_tree (expr, &ctx, ht);
10013 md5_finish_ctx (&ctx, checksum_after);
10016 if (memcmp (checksum_before, checksum_after, 16))
10017 fold_check_failed (expr, ret);
10023 print_fold_checksum (tree expr)
10025 struct md5_ctx ctx;
10026 unsigned char checksum[16], cnt;
10029 ht = htab_create (32, htab_hash_pointer, htab_eq_pointer, NULL);
10030 md5_init_ctx (&ctx);
10031 fold_checksum_tree (expr, &ctx, ht);
10032 md5_finish_ctx (&ctx, checksum);
10034 for (cnt = 0; cnt < 16; ++cnt)
10035 fprintf (stderr, "%02x", checksum[cnt]);
10036 putc ('\n', stderr);
10040 fold_check_failed (tree expr ATTRIBUTE_UNUSED, tree ret ATTRIBUTE_UNUSED)
10042 internal_error ("fold check: original tree changed by fold");
10046 fold_checksum_tree (tree expr, struct md5_ctx *ctx, htab_t ht)
10049 enum tree_code code;
10050 char buf[sizeof (struct tree_decl)];
10053 gcc_assert ((sizeof (struct tree_exp) + 5 * sizeof (tree)
10054 <= sizeof (struct tree_decl))
10055 && sizeof (struct tree_type) <= sizeof (struct tree_decl));
10058 slot = htab_find_slot (ht, expr, INSERT);
10062 code = TREE_CODE (expr);
10063 if (TREE_CODE_CLASS (code) == tcc_declaration
10064 && DECL_ASSEMBLER_NAME_SET_P (expr))
10066 /* Allow DECL_ASSEMBLER_NAME to be modified. */
10067 memcpy (buf, expr, tree_size (expr));
10069 SET_DECL_ASSEMBLER_NAME (expr, NULL);
10071 else if (TREE_CODE_CLASS (code) == tcc_type
10072 && (TYPE_POINTER_TO (expr) || TYPE_REFERENCE_TO (expr)
10073 || TYPE_CACHED_VALUES_P (expr)))
10075 /* Allow these fields to be modified. */
10076 memcpy (buf, expr, tree_size (expr));
10078 TYPE_POINTER_TO (expr) = NULL;
10079 TYPE_REFERENCE_TO (expr) = NULL;
10080 if (TYPE_CACHED_VALUES_P (expr))
10082 TYPE_CACHED_VALUES_P (expr) = 0;
10083 TYPE_CACHED_VALUES (expr) = NULL;
10086 md5_process_bytes (expr, tree_size (expr), ctx);
10087 fold_checksum_tree (TREE_TYPE (expr), ctx, ht);
10088 if (TREE_CODE_CLASS (code) != tcc_type
10089 && TREE_CODE_CLASS (code) != tcc_declaration)
10090 fold_checksum_tree (TREE_CHAIN (expr), ctx, ht);
10091 switch (TREE_CODE_CLASS (code))
10097 md5_process_bytes (TREE_STRING_POINTER (expr),
10098 TREE_STRING_LENGTH (expr), ctx);
10101 fold_checksum_tree (TREE_REALPART (expr), ctx, ht);
10102 fold_checksum_tree (TREE_IMAGPART (expr), ctx, ht);
10105 fold_checksum_tree (TREE_VECTOR_CST_ELTS (expr), ctx, ht);
10111 case tcc_exceptional:
10115 fold_checksum_tree (TREE_PURPOSE (expr), ctx, ht);
10116 fold_checksum_tree (TREE_VALUE (expr), ctx, ht);
10119 for (i = 0; i < TREE_VEC_LENGTH (expr); ++i)
10120 fold_checksum_tree (TREE_VEC_ELT (expr, i), ctx, ht);
10126 case tcc_expression:
10127 case tcc_reference:
10128 case tcc_comparison:
10131 case tcc_statement:
10132 len = TREE_CODE_LENGTH (code);
10133 for (i = 0; i < len; ++i)
10134 fold_checksum_tree (TREE_OPERAND (expr, i), ctx, ht);
10136 case tcc_declaration:
10137 fold_checksum_tree (DECL_SIZE (expr), ctx, ht);
10138 fold_checksum_tree (DECL_SIZE_UNIT (expr), ctx, ht);
10139 fold_checksum_tree (DECL_NAME (expr), ctx, ht);
10140 fold_checksum_tree (DECL_CONTEXT (expr), ctx, ht);
10141 fold_checksum_tree (DECL_ARGUMENTS (expr), ctx, ht);
10142 fold_checksum_tree (DECL_RESULT_FLD (expr), ctx, ht);
10143 fold_checksum_tree (DECL_INITIAL (expr), ctx, ht);
10144 fold_checksum_tree (DECL_ABSTRACT_ORIGIN (expr), ctx, ht);
10145 fold_checksum_tree (DECL_SECTION_NAME (expr), ctx, ht);
10146 fold_checksum_tree (DECL_ATTRIBUTES (expr), ctx, ht);
10147 fold_checksum_tree (DECL_VINDEX (expr), ctx, ht);
10150 if (TREE_CODE (expr) == ENUMERAL_TYPE)
10151 fold_checksum_tree (TYPE_VALUES (expr), ctx, ht);
10152 fold_checksum_tree (TYPE_SIZE (expr), ctx, ht);
10153 fold_checksum_tree (TYPE_SIZE_UNIT (expr), ctx, ht);
10154 fold_checksum_tree (TYPE_ATTRIBUTES (expr), ctx, ht);
10155 fold_checksum_tree (TYPE_NAME (expr), ctx, ht);
10156 if (INTEGRAL_TYPE_P (expr)
10157 || SCALAR_FLOAT_TYPE_P (expr))
10159 fold_checksum_tree (TYPE_MIN_VALUE (expr), ctx, ht);
10160 fold_checksum_tree (TYPE_MAX_VALUE (expr), ctx, ht);
10162 fold_checksum_tree (TYPE_MAIN_VARIANT (expr), ctx, ht);
10163 if (TREE_CODE (expr) == RECORD_TYPE
10164 || TREE_CODE (expr) == UNION_TYPE
10165 || TREE_CODE (expr) == QUAL_UNION_TYPE)
10166 fold_checksum_tree (TYPE_BINFO (expr), ctx, ht);
10167 fold_checksum_tree (TYPE_CONTEXT (expr), ctx, ht);
10176 /* Perform constant folding and related simplification of initializer
10177 expression EXPR. This behaves identically to "fold" but ignores
10178 potential run-time traps and exceptions that fold must preserve. */
10181 fold_initializer (tree expr)
10183 int saved_signaling_nans = flag_signaling_nans;
10184 int saved_trapping_math = flag_trapping_math;
10185 int saved_rounding_math = flag_rounding_math;
10186 int saved_trapv = flag_trapv;
10189 flag_signaling_nans = 0;
10190 flag_trapping_math = 0;
10191 flag_rounding_math = 0;
10194 result = fold (expr);
10196 flag_signaling_nans = saved_signaling_nans;
10197 flag_trapping_math = saved_trapping_math;
10198 flag_rounding_math = saved_rounding_math;
10199 flag_trapv = saved_trapv;
10204 /* Determine if first argument is a multiple of second argument. Return 0 if
10205 it is not, or we cannot easily determined it to be.
10207 An example of the sort of thing we care about (at this point; this routine
10208 could surely be made more general, and expanded to do what the *_DIV_EXPR's
10209 fold cases do now) is discovering that
10211 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
10217 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
10219 This code also handles discovering that
10221 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
10223 is a multiple of 8 so we don't have to worry about dealing with a
10224 possible remainder.
10226 Note that we *look* inside a SAVE_EXPR only to determine how it was
10227 calculated; it is not safe for fold to do much of anything else with the
10228 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
10229 at run time. For example, the latter example above *cannot* be implemented
10230 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
10231 evaluation time of the original SAVE_EXPR is not necessarily the same at
10232 the time the new expression is evaluated. The only optimization of this
10233 sort that would be valid is changing
10235 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
10239 SAVE_EXPR (I) * SAVE_EXPR (J)
10241 (where the same SAVE_EXPR (J) is used in the original and the
10242 transformed version). */
10245 multiple_of_p (tree type, tree top, tree bottom)
10247 if (operand_equal_p (top, bottom, 0))
10250 if (TREE_CODE (type) != INTEGER_TYPE)
10253 switch (TREE_CODE (top))
10256 /* Bitwise and provides a power of two multiple. If the mask is
10257 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
10258 if (!integer_pow2p (bottom))
10263 return (multiple_of_p (type, TREE_OPERAND (top, 0), bottom)
10264 || multiple_of_p (type, TREE_OPERAND (top, 1), bottom));
10268 return (multiple_of_p (type, TREE_OPERAND (top, 0), bottom)
10269 && multiple_of_p (type, TREE_OPERAND (top, 1), bottom));
10272 if (TREE_CODE (TREE_OPERAND (top, 1)) == INTEGER_CST)
10276 op1 = TREE_OPERAND (top, 1);
10277 /* const_binop may not detect overflow correctly,
10278 so check for it explicitly here. */
10279 if (TYPE_PRECISION (TREE_TYPE (size_one_node))
10280 > TREE_INT_CST_LOW (op1)
10281 && TREE_INT_CST_HIGH (op1) == 0
10282 && 0 != (t1 = fold_convert (type,
10283 const_binop (LSHIFT_EXPR,
10286 && ! TREE_OVERFLOW (t1))
10287 return multiple_of_p (type, t1, bottom);
10292 /* Can't handle conversions from non-integral or wider integral type. */
10293 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (top, 0))) != INTEGER_TYPE)
10294 || (TYPE_PRECISION (type)
10295 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (top, 0)))))
10298 /* .. fall through ... */
10301 return multiple_of_p (type, TREE_OPERAND (top, 0), bottom);
10304 if (TREE_CODE (bottom) != INTEGER_CST
10305 || (TYPE_UNSIGNED (type)
10306 && (tree_int_cst_sgn (top) < 0
10307 || tree_int_cst_sgn (bottom) < 0)))
10309 return integer_zerop (const_binop (TRUNC_MOD_EXPR,
10317 /* Return true if `t' is known to be non-negative. */
10320 tree_expr_nonnegative_p (tree t)
10322 switch (TREE_CODE (t))
10328 return tree_int_cst_sgn (t) >= 0;
10331 return ! REAL_VALUE_NEGATIVE (TREE_REAL_CST (t));
10334 if (FLOAT_TYPE_P (TREE_TYPE (t)))
10335 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10336 && tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10338 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
10339 both unsigned and at least 2 bits shorter than the result. */
10340 if (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
10341 && TREE_CODE (TREE_OPERAND (t, 0)) == NOP_EXPR
10342 && TREE_CODE (TREE_OPERAND (t, 1)) == NOP_EXPR)
10344 tree inner1 = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
10345 tree inner2 = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (t, 1), 0));
10346 if (TREE_CODE (inner1) == INTEGER_TYPE && TYPE_UNSIGNED (inner1)
10347 && TREE_CODE (inner2) == INTEGER_TYPE && TYPE_UNSIGNED (inner2))
10349 unsigned int prec = MAX (TYPE_PRECISION (inner1),
10350 TYPE_PRECISION (inner2)) + 1;
10351 return prec < TYPE_PRECISION (TREE_TYPE (t));
10357 if (FLOAT_TYPE_P (TREE_TYPE (t)))
10359 /* x * x for floating point x is always non-negative. */
10360 if (operand_equal_p (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1), 0))
10362 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10363 && tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10366 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
10367 both unsigned and their total bits is shorter than the result. */
10368 if (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
10369 && TREE_CODE (TREE_OPERAND (t, 0)) == NOP_EXPR
10370 && TREE_CODE (TREE_OPERAND (t, 1)) == NOP_EXPR)
10372 tree inner1 = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (t, 0), 0));
10373 tree inner2 = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (t, 1), 0));
10374 if (TREE_CODE (inner1) == INTEGER_TYPE && TYPE_UNSIGNED (inner1)
10375 && TREE_CODE (inner2) == INTEGER_TYPE && TYPE_UNSIGNED (inner2))
10376 return TYPE_PRECISION (inner1) + TYPE_PRECISION (inner2)
10377 < TYPE_PRECISION (TREE_TYPE (t));
10381 case TRUNC_DIV_EXPR:
10382 case CEIL_DIV_EXPR:
10383 case FLOOR_DIV_EXPR:
10384 case ROUND_DIV_EXPR:
10385 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10386 && tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10388 case TRUNC_MOD_EXPR:
10389 case CEIL_MOD_EXPR:
10390 case FLOOR_MOD_EXPR:
10391 case ROUND_MOD_EXPR:
10392 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10395 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10396 && tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10399 return tree_expr_nonnegative_p (TREE_OPERAND (t, 1))
10400 || tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10403 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10404 && tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10408 tree inner_type = TREE_TYPE (TREE_OPERAND (t, 0));
10409 tree outer_type = TREE_TYPE (t);
10411 if (TREE_CODE (outer_type) == REAL_TYPE)
10413 if (TREE_CODE (inner_type) == REAL_TYPE)
10414 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10415 if (TREE_CODE (inner_type) == INTEGER_TYPE)
10417 if (TYPE_UNSIGNED (inner_type))
10419 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10422 else if (TREE_CODE (outer_type) == INTEGER_TYPE)
10424 if (TREE_CODE (inner_type) == REAL_TYPE)
10425 return tree_expr_nonnegative_p (TREE_OPERAND (t,0));
10426 if (TREE_CODE (inner_type) == INTEGER_TYPE)
10427 return TYPE_PRECISION (inner_type) < TYPE_PRECISION (outer_type)
10428 && TYPE_UNSIGNED (inner_type);
10434 return tree_expr_nonnegative_p (TREE_OPERAND (t, 1))
10435 && tree_expr_nonnegative_p (TREE_OPERAND (t, 2));
10436 case COMPOUND_EXPR:
10437 return tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10439 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10440 && tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10442 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10443 || tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10445 return tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10447 return tree_expr_nonnegative_p (expr_last (TREE_OPERAND (t, 1)));
10449 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10450 case NON_LVALUE_EXPR:
10451 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10453 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10457 tree temp = TARGET_EXPR_SLOT (t);
10458 t = TARGET_EXPR_INITIAL (t);
10460 /* If the initializer is non-void, then it's a normal expression
10461 that will be assigned to the slot. */
10462 if (!VOID_TYPE_P (t))
10463 return tree_expr_nonnegative_p (t);
10465 /* Otherwise, the initializer sets the slot in some way. One common
10466 way is an assignment statement at the end of the initializer. */
10469 if (TREE_CODE (t) == BIND_EXPR)
10470 t = expr_last (BIND_EXPR_BODY (t));
10471 else if (TREE_CODE (t) == TRY_FINALLY_EXPR
10472 || TREE_CODE (t) == TRY_CATCH_EXPR)
10473 t = expr_last (TREE_OPERAND (t, 0));
10474 else if (TREE_CODE (t) == STATEMENT_LIST)
10479 if (TREE_CODE (t) == MODIFY_EXPR
10480 && TREE_OPERAND (t, 0) == temp)
10481 return tree_expr_nonnegative_p (TREE_OPERAND (t, 1));
10488 tree fndecl = get_callee_fndecl (t);
10489 tree arglist = TREE_OPERAND (t, 1);
10490 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
10491 switch (DECL_FUNCTION_CODE (fndecl))
10493 #define CASE_BUILTIN_F(BUILT_IN_FN) \
10494 case BUILT_IN_FN: case BUILT_IN_FN##F: case BUILT_IN_FN##L:
10495 #define CASE_BUILTIN_I(BUILT_IN_FN) \
10496 case BUILT_IN_FN: case BUILT_IN_FN##L: case BUILT_IN_FN##LL:
10498 CASE_BUILTIN_F (BUILT_IN_ACOS)
10499 CASE_BUILTIN_F (BUILT_IN_ACOSH)
10500 CASE_BUILTIN_F (BUILT_IN_CABS)
10501 CASE_BUILTIN_F (BUILT_IN_COSH)
10502 CASE_BUILTIN_F (BUILT_IN_ERFC)
10503 CASE_BUILTIN_F (BUILT_IN_EXP)
10504 CASE_BUILTIN_F (BUILT_IN_EXP10)
10505 CASE_BUILTIN_F (BUILT_IN_EXP2)
10506 CASE_BUILTIN_F (BUILT_IN_FABS)
10507 CASE_BUILTIN_F (BUILT_IN_FDIM)
10508 CASE_BUILTIN_F (BUILT_IN_FREXP)
10509 CASE_BUILTIN_F (BUILT_IN_HYPOT)
10510 CASE_BUILTIN_F (BUILT_IN_POW10)
10511 CASE_BUILTIN_I (BUILT_IN_FFS)
10512 CASE_BUILTIN_I (BUILT_IN_PARITY)
10513 CASE_BUILTIN_I (BUILT_IN_POPCOUNT)
10517 CASE_BUILTIN_F (BUILT_IN_SQRT)
10518 /* sqrt(-0.0) is -0.0. */
10519 if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (t))))
10521 return tree_expr_nonnegative_p (TREE_VALUE (arglist));
10523 CASE_BUILTIN_F (BUILT_IN_ASINH)
10524 CASE_BUILTIN_F (BUILT_IN_ATAN)
10525 CASE_BUILTIN_F (BUILT_IN_ATANH)
10526 CASE_BUILTIN_F (BUILT_IN_CBRT)
10527 CASE_BUILTIN_F (BUILT_IN_CEIL)
10528 CASE_BUILTIN_F (BUILT_IN_ERF)
10529 CASE_BUILTIN_F (BUILT_IN_EXPM1)
10530 CASE_BUILTIN_F (BUILT_IN_FLOOR)
10531 CASE_BUILTIN_F (BUILT_IN_FMOD)
10532 CASE_BUILTIN_F (BUILT_IN_LDEXP)
10533 CASE_BUILTIN_F (BUILT_IN_LLRINT)
10534 CASE_BUILTIN_F (BUILT_IN_LLROUND)
10535 CASE_BUILTIN_F (BUILT_IN_LRINT)
10536 CASE_BUILTIN_F (BUILT_IN_LROUND)
10537 CASE_BUILTIN_F (BUILT_IN_MODF)
10538 CASE_BUILTIN_F (BUILT_IN_NEARBYINT)
10539 CASE_BUILTIN_F (BUILT_IN_POW)
10540 CASE_BUILTIN_F (BUILT_IN_RINT)
10541 CASE_BUILTIN_F (BUILT_IN_ROUND)
10542 CASE_BUILTIN_F (BUILT_IN_SIGNBIT)
10543 CASE_BUILTIN_F (BUILT_IN_SINH)
10544 CASE_BUILTIN_F (BUILT_IN_TANH)
10545 CASE_BUILTIN_F (BUILT_IN_TRUNC)
10546 /* True if the 1st argument is nonnegative. */
10547 return tree_expr_nonnegative_p (TREE_VALUE (arglist));
10549 CASE_BUILTIN_F (BUILT_IN_FMAX)
10550 /* True if the 1st OR 2nd arguments are nonnegative. */
10551 return tree_expr_nonnegative_p (TREE_VALUE (arglist))
10552 || tree_expr_nonnegative_p (TREE_VALUE (TREE_CHAIN (arglist)));
10554 CASE_BUILTIN_F (BUILT_IN_FMIN)
10555 /* True if the 1st AND 2nd arguments are nonnegative. */
10556 return tree_expr_nonnegative_p (TREE_VALUE (arglist))
10557 && tree_expr_nonnegative_p (TREE_VALUE (TREE_CHAIN (arglist)));
10559 CASE_BUILTIN_F (BUILT_IN_COPYSIGN)
10560 /* True if the 2nd argument is nonnegative. */
10561 return tree_expr_nonnegative_p (TREE_VALUE (TREE_CHAIN (arglist)));
10565 #undef CASE_BUILTIN_F
10566 #undef CASE_BUILTIN_I
10570 /* ... fall through ... */
10573 if (truth_value_p (TREE_CODE (t)))
10574 /* Truth values evaluate to 0 or 1, which is nonnegative. */
10578 /* We don't know sign of `t', so be conservative and return false. */
10582 /* Return true when T is an address and is known to be nonzero.
10583 For floating point we further ensure that T is not denormal.
10584 Similar logic is present in nonzero_address in rtlanal.h. */
10587 tree_expr_nonzero_p (tree t)
10589 tree type = TREE_TYPE (t);
10591 /* Doing something useful for floating point would need more work. */
10592 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
10595 switch (TREE_CODE (t))
10598 if (!TYPE_UNSIGNED (type) && !flag_wrapv)
10599 return tree_expr_nonzero_p (TREE_OPERAND (t, 0));
10602 /* We used to test for !integer_zerop here. This does not work correctly
10603 if TREE_CONSTANT_OVERFLOW (t). */
10604 return (TREE_INT_CST_LOW (t) != 0
10605 || TREE_INT_CST_HIGH (t) != 0);
10608 if (!TYPE_UNSIGNED (type) && !flag_wrapv)
10610 /* With the presence of negative values it is hard
10611 to say something. */
10612 if (!tree_expr_nonnegative_p (TREE_OPERAND (t, 0))
10613 || !tree_expr_nonnegative_p (TREE_OPERAND (t, 1)))
10615 /* One of operands must be positive and the other non-negative. */
10616 return (tree_expr_nonzero_p (TREE_OPERAND (t, 0))
10617 || tree_expr_nonzero_p (TREE_OPERAND (t, 1)));
10622 if (!TYPE_UNSIGNED (type) && !flag_wrapv)
10624 return (tree_expr_nonzero_p (TREE_OPERAND (t, 0))
10625 && tree_expr_nonzero_p (TREE_OPERAND (t, 1)));
10631 tree inner_type = TREE_TYPE (TREE_OPERAND (t, 0));
10632 tree outer_type = TREE_TYPE (t);
10634 return (TYPE_PRECISION (inner_type) >= TYPE_PRECISION (outer_type)
10635 && tree_expr_nonzero_p (TREE_OPERAND (t, 0)));
10641 tree base = get_base_address (TREE_OPERAND (t, 0));
10646 /* Weak declarations may link to NULL. */
10648 return !DECL_WEAK (base);
10650 /* Constants are never weak. */
10651 if (CONSTANT_CLASS_P (base))
10658 return (tree_expr_nonzero_p (TREE_OPERAND (t, 1))
10659 && tree_expr_nonzero_p (TREE_OPERAND (t, 2)));
10662 return (tree_expr_nonzero_p (TREE_OPERAND (t, 0))
10663 && tree_expr_nonzero_p (TREE_OPERAND (t, 1)));
10666 if (tree_expr_nonzero_p (TREE_OPERAND (t, 0)))
10668 /* When both operands are nonzero, then MAX must be too. */
10669 if (tree_expr_nonzero_p (TREE_OPERAND (t, 1)))
10672 /* MAX where operand 0 is positive is positive. */
10673 return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
10675 /* MAX where operand 1 is positive is positive. */
10676 else if (tree_expr_nonzero_p (TREE_OPERAND (t, 1))
10677 && tree_expr_nonnegative_p (TREE_OPERAND (t, 1)))
10681 case COMPOUND_EXPR:
10684 return tree_expr_nonzero_p (TREE_OPERAND (t, 1));
10687 case NON_LVALUE_EXPR:
10688 return tree_expr_nonzero_p (TREE_OPERAND (t, 0));
10691 return tree_expr_nonzero_p (TREE_OPERAND (t, 1))
10692 || tree_expr_nonzero_p (TREE_OPERAND (t, 0));
10700 /* See if we are applying CODE, a relational to the highest or lowest
10701 possible integer of TYPE. If so, then the result is a compile
10705 fold_relational_hi_lo (enum tree_code *code_p, const tree type, tree *op0_p,
10710 enum tree_code code = *code_p;
10711 int width = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (op1)));
10713 if (TREE_CODE (op1) == INTEGER_CST
10714 && ! TREE_CONSTANT_OVERFLOW (op1)
10715 && width <= HOST_BITS_PER_WIDE_INT
10716 && (INTEGRAL_TYPE_P (TREE_TYPE (op1))
10717 || POINTER_TYPE_P (TREE_TYPE (op1))))
10719 unsigned HOST_WIDE_INT signed_max;
10720 unsigned HOST_WIDE_INT max, min;
10722 signed_max = ((unsigned HOST_WIDE_INT) 1 << (width - 1)) - 1;
10724 if (TYPE_UNSIGNED (TREE_TYPE (op1)))
10726 max = ((unsigned HOST_WIDE_INT) 2 << (width - 1)) - 1;
10732 min = ((unsigned HOST_WIDE_INT) -1 << (width - 1));
10735 if (TREE_INT_CST_HIGH (op1) == 0
10736 && TREE_INT_CST_LOW (op1) == max)
10740 return omit_one_operand (type, integer_zero_node, op0);
10746 return omit_one_operand (type, integer_one_node, op0);
10752 /* The GE_EXPR and LT_EXPR cases above are not normally
10753 reached because of previous transformations. */
10758 else if (TREE_INT_CST_HIGH (op1) == 0
10759 && TREE_INT_CST_LOW (op1) == max - 1)
10764 *op1_p = const_binop (PLUS_EXPR, op1, integer_one_node, 0);
10768 *op1_p = const_binop (PLUS_EXPR, op1, integer_one_node, 0);
10773 else if (TREE_INT_CST_HIGH (op1) == (min ? -1 : 0)
10774 && TREE_INT_CST_LOW (op1) == min)
10778 return omit_one_operand (type, integer_zero_node, op0);
10785 return omit_one_operand (type, integer_one_node, op0);
10794 else if (TREE_INT_CST_HIGH (op1) == (min ? -1 : 0)
10795 && TREE_INT_CST_LOW (op1) == min + 1)
10800 *op1_p = const_binop (MINUS_EXPR, op1, integer_one_node, 0);
10804 *op1_p = const_binop (MINUS_EXPR, op1, integer_one_node, 0);
10810 else if (TREE_INT_CST_HIGH (op1) == 0
10811 && TREE_INT_CST_LOW (op1) == signed_max
10812 && TYPE_UNSIGNED (TREE_TYPE (op1))
10813 /* signed_type does not work on pointer types. */
10814 && INTEGRAL_TYPE_P (TREE_TYPE (op1)))
10816 /* The following case also applies to X < signed_max+1
10817 and X >= signed_max+1 because previous transformations. */
10818 if (code == LE_EXPR || code == GT_EXPR)
10820 tree st0, st1, exp, retval;
10821 st0 = lang_hooks.types.signed_type (TREE_TYPE (op0));
10822 st1 = lang_hooks.types.signed_type (TREE_TYPE (op1));
10824 exp = build2 (code == LE_EXPR ? GE_EXPR: LT_EXPR,
10826 fold_convert (st0, op0),
10827 fold_convert (st1, integer_zero_node));
10829 retval = fold_binary_to_constant (TREE_CODE (exp),
10831 TREE_OPERAND (exp, 0),
10832 TREE_OPERAND (exp, 1));
10834 /* If we are in gimple form, then returning EXP would create
10835 non-gimple expressions. Clearing it is safe and insures
10836 we do not allow a non-gimple expression to escape. */
10837 if (in_gimple_form)
10840 return (retval ? retval : exp);
10849 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
10850 attempt to fold the expression to a constant without modifying TYPE,
10853 If the expression could be simplified to a constant, then return
10854 the constant. If the expression would not be simplified to a
10855 constant, then return NULL_TREE.
10857 Note this is primarily designed to be called after gimplification
10858 of the tree structures and when at least one operand is a constant.
10859 As a result of those simplifying assumptions this routine is far
10860 simpler than the generic fold routine. */
10863 fold_binary_to_constant (enum tree_code code, tree type, tree op0, tree op1)
10870 /* If this is a commutative operation, and ARG0 is a constant, move it
10871 to ARG1 to reduce the number of tests below. */
10872 if (commutative_tree_code (code)
10873 && (TREE_CODE (op0) == INTEGER_CST || TREE_CODE (op0) == REAL_CST))
10880 /* If either operand is a complex type, extract its real component. */
10881 if (TREE_CODE (op0) == COMPLEX_CST)
10882 subop0 = TREE_REALPART (op0);
10886 if (TREE_CODE (op1) == COMPLEX_CST)
10887 subop1 = TREE_REALPART (op1);
10891 /* Note if either argument is not a real or integer constant.
10892 With a few exceptions, simplification is limited to cases
10893 where both arguments are constants. */
10894 if ((TREE_CODE (subop0) != INTEGER_CST
10895 && TREE_CODE (subop0) != REAL_CST)
10896 || (TREE_CODE (subop1) != INTEGER_CST
10897 && TREE_CODE (subop1) != REAL_CST))
10903 /* (plus (address) (const_int)) is a constant. */
10904 if (TREE_CODE (op0) == PLUS_EXPR
10905 && TREE_CODE (op1) == INTEGER_CST
10906 && (TREE_CODE (TREE_OPERAND (op0, 0)) == ADDR_EXPR
10907 || (TREE_CODE (TREE_OPERAND (op0, 0)) == NOP_EXPR
10908 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (op0, 0), 0))
10910 && TREE_CODE (TREE_OPERAND (op0, 1)) == INTEGER_CST)
10912 return build2 (PLUS_EXPR, type, TREE_OPERAND (op0, 0),
10913 const_binop (PLUS_EXPR, op1,
10914 TREE_OPERAND (op0, 1), 0));
10922 /* Both arguments are constants. Simplify. */
10923 tem = const_binop (code, op0, op1, 0);
10924 if (tem != NULL_TREE)
10926 /* The return value should always have the same type as
10927 the original expression. */
10928 if (TREE_TYPE (tem) != type)
10929 tem = fold_convert (type, tem);
10936 /* Fold &x - &x. This can happen from &x.foo - &x.
10937 This is unsafe for certain floats even in non-IEEE formats.
10938 In IEEE, it is unsafe because it does wrong for NaNs.
10939 Also note that operand_equal_p is always false if an
10940 operand is volatile. */
10941 if (! FLOAT_TYPE_P (type) && operand_equal_p (op0, op1, 0))
10942 return fold_convert (type, integer_zero_node);
10948 /* Special case multiplication or bitwise AND where one argument
10950 if (! FLOAT_TYPE_P (type) && integer_zerop (op1))
10951 return omit_one_operand (type, op1, op0);
10953 if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (op0)))
10954 && !HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (op0)))
10955 && real_zerop (op1))
10956 return omit_one_operand (type, op1, op0);
10961 /* Special case when we know the result will be all ones. */
10962 if (integer_all_onesp (op1))
10963 return omit_one_operand (type, op1, op0);
10967 case TRUNC_DIV_EXPR:
10968 case ROUND_DIV_EXPR:
10969 case FLOOR_DIV_EXPR:
10970 case CEIL_DIV_EXPR:
10971 case EXACT_DIV_EXPR:
10972 case TRUNC_MOD_EXPR:
10973 case ROUND_MOD_EXPR:
10974 case FLOOR_MOD_EXPR:
10975 case CEIL_MOD_EXPR:
10977 /* Division by zero is undefined. */
10978 if (integer_zerop (op1))
10981 if (TREE_CODE (op1) == REAL_CST
10982 && !MODE_HAS_INFINITIES (TYPE_MODE (TREE_TYPE (op1)))
10983 && real_zerop (op1))
10989 if (INTEGRAL_TYPE_P (type)
10990 && operand_equal_p (op1, TYPE_MIN_VALUE (type), OEP_ONLY_CONST))
10991 return omit_one_operand (type, op1, op0);
10996 if (INTEGRAL_TYPE_P (type)
10997 && TYPE_MAX_VALUE (type)
10998 && operand_equal_p (op1, TYPE_MAX_VALUE (type), OEP_ONLY_CONST))
10999 return omit_one_operand (type, op1, op0);
11004 /* Optimize -1 >> x for arithmetic right shifts. */
11005 if (integer_all_onesp (op0) && ! TYPE_UNSIGNED (type))
11006 return omit_one_operand (type, op0, op1);
11007 /* ... fall through ... */
11010 if (integer_zerop (op0))
11011 return omit_one_operand (type, op0, op1);
11013 /* Since negative shift count is not well-defined, don't
11014 try to compute it in the compiler. */
11015 if (TREE_CODE (op1) == INTEGER_CST && tree_int_cst_sgn (op1) < 0)
11022 /* -1 rotated either direction by any amount is still -1. */
11023 if (integer_all_onesp (op0))
11024 return omit_one_operand (type, op0, op1);
11026 /* 0 rotated either direction by any amount is still zero. */
11027 if (integer_zerop (op0))
11028 return omit_one_operand (type, op0, op1);
11034 return build_complex (type, op0, op1);
11043 /* If one arg is a real or integer constant, put it last. */
11044 if ((TREE_CODE (op0) == INTEGER_CST
11045 && TREE_CODE (op1) != INTEGER_CST)
11046 || (TREE_CODE (op0) == REAL_CST
11047 && TREE_CODE (op0) != REAL_CST))
11054 code = swap_tree_comparison (code);
11057 /* Change X >= C to X > (C - 1) and X < C to X <= (C - 1) if C > 0.
11058 This transformation affects the cases which are handled in later
11059 optimizations involving comparisons with non-negative constants. */
11060 if (TREE_CODE (op1) == INTEGER_CST
11061 && TREE_CODE (op0) != INTEGER_CST
11062 && tree_int_cst_sgn (op1) > 0)
11068 op1 = const_binop (MINUS_EXPR, op1, integer_one_node, 0);
11073 op1 = const_binop (MINUS_EXPR, op1, integer_one_node, 0);
11081 tem = fold_relational_hi_lo (&code, type, &op0, &op1);
11085 /* Fall through. */
11088 case UNORDERED_EXPR:
11098 return fold_relational_const (code, type, op0, op1);
11101 /* This could probably be handled. */
11104 case TRUTH_AND_EXPR:
11105 /* If second arg is constant zero, result is zero, but first arg
11106 must be evaluated. */
11107 if (integer_zerop (op1))
11108 return omit_one_operand (type, op1, op0);
11109 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
11110 case will be handled here. */
11111 if (integer_zerop (op0))
11112 return omit_one_operand (type, op0, op1);
11113 if (TREE_CODE (op0) == INTEGER_CST && TREE_CODE (op1) == INTEGER_CST)
11114 return constant_boolean_node (true, type);
11117 case TRUTH_OR_EXPR:
11118 /* If second arg is constant true, result is true, but we must
11119 evaluate first arg. */
11120 if (TREE_CODE (op1) == INTEGER_CST && ! integer_zerop (op1))
11121 return omit_one_operand (type, op1, op0);
11122 /* Likewise for first arg, but note this only occurs here for
11124 if (TREE_CODE (op0) == INTEGER_CST && ! integer_zerop (op0))
11125 return omit_one_operand (type, op0, op1);
11126 if (TREE_CODE (op0) == INTEGER_CST && TREE_CODE (op1) == INTEGER_CST)
11127 return constant_boolean_node (false, type);
11130 case TRUTH_XOR_EXPR:
11131 if (TREE_CODE (op0) == INTEGER_CST && TREE_CODE (op1) == INTEGER_CST)
11133 int x = ! integer_zerop (op0) ^ ! integer_zerop (op1);
11134 return constant_boolean_node (x, type);
11143 /* Given the components of a unary expression CODE, TYPE and OP0,
11144 attempt to fold the expression to a constant without modifying
11147 If the expression could be simplified to a constant, then return
11148 the constant. If the expression would not be simplified to a
11149 constant, then return NULL_TREE.
11151 Note this is primarily designed to be called after gimplification
11152 of the tree structures and when op0 is a constant. As a result
11153 of those simplifying assumptions this routine is far simpler than
11154 the generic fold routine. */
11157 fold_unary_to_constant (enum tree_code code, tree type, tree op0)
11159 /* Make sure we have a suitable constant argument. */
11160 if (code == NOP_EXPR || code == FLOAT_EXPR || code == CONVERT_EXPR)
11164 if (TREE_CODE (op0) == COMPLEX_CST)
11165 subop = TREE_REALPART (op0);
11169 if (TREE_CODE (subop) != INTEGER_CST && TREE_CODE (subop) != REAL_CST)
11178 case FIX_TRUNC_EXPR:
11179 case FIX_FLOOR_EXPR:
11180 case FIX_CEIL_EXPR:
11181 case FIX_ROUND_EXPR:
11182 return fold_convert_const (code, type, op0);
11185 if (TREE_CODE (op0) == INTEGER_CST || TREE_CODE (op0) == REAL_CST)
11186 return fold_negate_const (op0, type);
11191 if (TREE_CODE (op0) == INTEGER_CST || TREE_CODE (op0) == REAL_CST)
11192 return fold_abs_const (op0, type);
11197 if (TREE_CODE (op0) == INTEGER_CST)
11198 return fold_not_const (op0, type);
11202 case REALPART_EXPR:
11203 if (TREE_CODE (op0) == COMPLEX_CST)
11204 return TREE_REALPART (op0);
11208 case IMAGPART_EXPR:
11209 if (TREE_CODE (op0) == COMPLEX_CST)
11210 return TREE_IMAGPART (op0);
11215 if (TREE_CODE (op0) == COMPLEX_CST
11216 && TREE_CODE (TREE_TYPE (op0)) == COMPLEX_TYPE)
11217 return build_complex (type, TREE_REALPART (op0),
11218 negate_expr (TREE_IMAGPART (op0)));
11226 /* If EXP represents referencing an element in a constant string
11227 (either via pointer arithmetic or array indexing), return the
11228 tree representing the value accessed, otherwise return NULL. */
11231 fold_read_from_constant_string (tree exp)
11233 if (TREE_CODE (exp) == INDIRECT_REF || TREE_CODE (exp) == ARRAY_REF)
11235 tree exp1 = TREE_OPERAND (exp, 0);
11239 if (TREE_CODE (exp) == INDIRECT_REF)
11240 string = string_constant (exp1, &index);
11243 tree low_bound = array_ref_low_bound (exp);
11244 index = fold_convert (sizetype, TREE_OPERAND (exp, 1));
11246 /* Optimize the special-case of a zero lower bound.
11248 We convert the low_bound to sizetype to avoid some problems
11249 with constant folding. (E.g. suppose the lower bound is 1,
11250 and its mode is QI. Without the conversion,l (ARRAY
11251 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
11252 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
11253 if (! integer_zerop (low_bound))
11254 index = size_diffop (index, fold_convert (sizetype, low_bound));
11260 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (string))
11261 && TREE_CODE (string) == STRING_CST
11262 && TREE_CODE (index) == INTEGER_CST
11263 && compare_tree_int (index, TREE_STRING_LENGTH (string)) < 0
11264 && (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (TREE_TYPE (string))))
11266 && (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (string)))) == 1))
11267 return fold_convert (TREE_TYPE (exp),
11268 build_int_cst (NULL_TREE,
11269 (TREE_STRING_POINTER (string)
11270 [TREE_INT_CST_LOW (index)])));
11275 /* Return the tree for neg (ARG0) when ARG0 is known to be either
11276 an integer constant or real constant.
11278 TYPE is the type of the result. */
11281 fold_negate_const (tree arg0, tree type)
11283 tree t = NULL_TREE;
11285 switch (TREE_CODE (arg0))
11289 unsigned HOST_WIDE_INT low;
11290 HOST_WIDE_INT high;
11291 int overflow = neg_double (TREE_INT_CST_LOW (arg0),
11292 TREE_INT_CST_HIGH (arg0),
11294 t = build_int_cst_wide (type, low, high);
11295 t = force_fit_type (t, 1,
11296 (overflow | TREE_OVERFLOW (arg0))
11297 && !TYPE_UNSIGNED (type),
11298 TREE_CONSTANT_OVERFLOW (arg0));
11303 t = build_real (type, REAL_VALUE_NEGATE (TREE_REAL_CST (arg0)));
11307 gcc_unreachable ();
11313 /* Return the tree for abs (ARG0) when ARG0 is known to be either
11314 an integer constant or real constant.
11316 TYPE is the type of the result. */
11319 fold_abs_const (tree arg0, tree type)
11321 tree t = NULL_TREE;
11323 switch (TREE_CODE (arg0))
11326 /* If the value is unsigned, then the absolute value is
11327 the same as the ordinary value. */
11328 if (TYPE_UNSIGNED (type))
11330 /* Similarly, if the value is non-negative. */
11331 else if (INT_CST_LT (integer_minus_one_node, arg0))
11333 /* If the value is negative, then the absolute value is
11337 unsigned HOST_WIDE_INT low;
11338 HOST_WIDE_INT high;
11339 int overflow = neg_double (TREE_INT_CST_LOW (arg0),
11340 TREE_INT_CST_HIGH (arg0),
11342 t = build_int_cst_wide (type, low, high);
11343 t = force_fit_type (t, -1, overflow | TREE_OVERFLOW (arg0),
11344 TREE_CONSTANT_OVERFLOW (arg0));
11349 if (REAL_VALUE_NEGATIVE (TREE_REAL_CST (arg0)))
11350 t = build_real (type, REAL_VALUE_NEGATE (TREE_REAL_CST (arg0)));
11356 gcc_unreachable ();
11362 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
11363 constant. TYPE is the type of the result. */
11366 fold_not_const (tree arg0, tree type)
11368 tree t = NULL_TREE;
11370 gcc_assert (TREE_CODE (arg0) == INTEGER_CST);
11372 t = build_int_cst_wide (type,
11373 ~ TREE_INT_CST_LOW (arg0),
11374 ~ TREE_INT_CST_HIGH (arg0));
11375 t = force_fit_type (t, 0, TREE_OVERFLOW (arg0),
11376 TREE_CONSTANT_OVERFLOW (arg0));
11381 /* Given CODE, a relational operator, the target type, TYPE and two
11382 constant operands OP0 and OP1, return the result of the
11383 relational operation. If the result is not a compile time
11384 constant, then return NULL_TREE. */
11387 fold_relational_const (enum tree_code code, tree type, tree op0, tree op1)
11389 int result, invert;
11391 /* From here on, the only cases we handle are when the result is
11392 known to be a constant. */
11394 if (TREE_CODE (op0) == REAL_CST && TREE_CODE (op1) == REAL_CST)
11396 const REAL_VALUE_TYPE *c0 = TREE_REAL_CST_PTR (op0);
11397 const REAL_VALUE_TYPE *c1 = TREE_REAL_CST_PTR (op1);
11399 /* Handle the cases where either operand is a NaN. */
11400 if (real_isnan (c0) || real_isnan (c1))
11410 case UNORDERED_EXPR:
11424 if (flag_trapping_math)
11430 gcc_unreachable ();
11433 return constant_boolean_node (result, type);
11436 return constant_boolean_node (real_compare (code, c0, c1), type);
11439 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
11441 To compute GT, swap the arguments and do LT.
11442 To compute GE, do LT and invert the result.
11443 To compute LE, swap the arguments, do LT and invert the result.
11444 To compute NE, do EQ and invert the result.
11446 Therefore, the code below must handle only EQ and LT. */
11448 if (code == LE_EXPR || code == GT_EXPR)
11453 code = swap_tree_comparison (code);
11456 /* Note that it is safe to invert for real values here because we
11457 have already handled the one case that it matters. */
11460 if (code == NE_EXPR || code == GE_EXPR)
11463 code = invert_tree_comparison (code, false);
11466 /* Compute a result for LT or EQ if args permit;
11467 Otherwise return T. */
11468 if (TREE_CODE (op0) == INTEGER_CST && TREE_CODE (op1) == INTEGER_CST)
11470 if (code == EQ_EXPR)
11471 result = tree_int_cst_equal (op0, op1);
11472 else if (TYPE_UNSIGNED (TREE_TYPE (op0)))
11473 result = INT_CST_LT_UNSIGNED (op0, op1);
11475 result = INT_CST_LT (op0, op1);
11482 return constant_boolean_node (result, type);
11485 /* Build an expression for the a clean point containing EXPR with type TYPE.
11486 Don't build a cleanup point expression for EXPR which don't have side
11490 fold_build_cleanup_point_expr (tree type, tree expr)
11492 /* If the expression does not have side effects then we don't have to wrap
11493 it with a cleanup point expression. */
11494 if (!TREE_SIDE_EFFECTS (expr))
11497 /* If the expression is a return, check to see if the expression inside the
11498 return has no side effects or the right hand side of the modify expression
11499 inside the return. If either don't have side effects set we don't need to
11500 wrap the expression in a cleanup point expression. Note we don't check the
11501 left hand side of the modify because it should always be a return decl. */
11502 if (TREE_CODE (expr) == RETURN_EXPR)
11504 tree op = TREE_OPERAND (expr, 0);
11505 if (!op || !TREE_SIDE_EFFECTS (op))
11507 op = TREE_OPERAND (op, 1);
11508 if (!TREE_SIDE_EFFECTS (op))
11512 return build1 (CLEANUP_POINT_EXPR, type, expr);
11515 /* Build an expression for the address of T. Folds away INDIRECT_REF to
11516 avoid confusing the gimplify process. */
11519 build_fold_addr_expr_with_type (tree t, tree ptrtype)
11521 /* The size of the object is not relevant when talking about its address. */
11522 if (TREE_CODE (t) == WITH_SIZE_EXPR)
11523 t = TREE_OPERAND (t, 0);
11525 /* Note: doesn't apply to ALIGN_INDIRECT_REF */
11526 if (TREE_CODE (t) == INDIRECT_REF
11527 || TREE_CODE (t) == MISALIGNED_INDIRECT_REF)
11529 t = TREE_OPERAND (t, 0);
11530 if (TREE_TYPE (t) != ptrtype)
11531 t = build1 (NOP_EXPR, ptrtype, t);
11537 while (handled_component_p (base))
11538 base = TREE_OPERAND (base, 0);
11540 TREE_ADDRESSABLE (base) = 1;
11542 t = build1 (ADDR_EXPR, ptrtype, t);
11549 build_fold_addr_expr (tree t)
11551 return build_fold_addr_expr_with_type (t, build_pointer_type (TREE_TYPE (t)));
11554 /* Given a pointer value T, return a simplified version of an indirection
11555 through T, or NULL_TREE if no simplification is possible. */
11558 fold_indirect_ref_1 (tree t)
11560 tree type = TREE_TYPE (TREE_TYPE (t));
11565 subtype = TREE_TYPE (sub);
11566 if (!POINTER_TYPE_P (subtype))
11569 if (TREE_CODE (sub) == ADDR_EXPR)
11571 tree op = TREE_OPERAND (sub, 0);
11572 tree optype = TREE_TYPE (op);
11574 if (lang_hooks.types_compatible_p (type, optype))
11576 /* *(foo *)&fooarray => fooarray[0] */
11577 else if (TREE_CODE (optype) == ARRAY_TYPE
11578 && lang_hooks.types_compatible_p (type, TREE_TYPE (optype)))
11580 tree type_domain = TYPE_DOMAIN (optype);
11581 tree min_val = size_zero_node;
11582 if (type_domain && TYPE_MIN_VALUE (type_domain))
11583 min_val = TYPE_MIN_VALUE (type_domain);
11584 return build4 (ARRAY_REF, type, op, min_val, NULL_TREE, NULL_TREE);
11588 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
11589 if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
11590 && lang_hooks.types_compatible_p (type, TREE_TYPE (TREE_TYPE (subtype))))
11593 tree min_val = size_zero_node;
11594 sub = build_fold_indirect_ref (sub);
11595 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
11596 if (type_domain && TYPE_MIN_VALUE (type_domain))
11597 min_val = TYPE_MIN_VALUE (type_domain);
11598 return build4 (ARRAY_REF, type, sub, min_val, NULL_TREE, NULL_TREE);
11604 /* Builds an expression for an indirection through T, simplifying some
11608 build_fold_indirect_ref (tree t)
11610 tree sub = fold_indirect_ref_1 (t);
11615 return build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (t)), t);
11618 /* Given an INDIRECT_REF T, return either T or a simplified version. */
11621 fold_indirect_ref (tree t)
11623 tree sub = fold_indirect_ref_1 (TREE_OPERAND (t, 0));
11631 /* Strip non-trapping, non-side-effecting tree nodes from an expression
11632 whose result is ignored. The type of the returned tree need not be
11633 the same as the original expression. */
11636 fold_ignored_result (tree t)
11638 if (!TREE_SIDE_EFFECTS (t))
11639 return integer_zero_node;
11642 switch (TREE_CODE_CLASS (TREE_CODE (t)))
11645 t = TREE_OPERAND (t, 0);
11649 case tcc_comparison:
11650 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1)))
11651 t = TREE_OPERAND (t, 0);
11652 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (t, 0)))
11653 t = TREE_OPERAND (t, 1);
11658 case tcc_expression:
11659 switch (TREE_CODE (t))
11661 case COMPOUND_EXPR:
11662 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1)))
11664 t = TREE_OPERAND (t, 0);
11668 if (TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1))
11669 || TREE_SIDE_EFFECTS (TREE_OPERAND (t, 2)))
11671 t = TREE_OPERAND (t, 0);
11684 /* Return the value of VALUE, rounded up to a multiple of DIVISOR.
11685 This can only be applied to objects of a sizetype. */
11688 round_up (tree value, int divisor)
11690 tree div = NULL_TREE;
11692 gcc_assert (divisor > 0);
11696 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
11697 have to do anything. Only do this when we are not given a const,
11698 because in that case, this check is more expensive than just
11700 if (TREE_CODE (value) != INTEGER_CST)
11702 div = build_int_cst (TREE_TYPE (value), divisor);
11704 if (multiple_of_p (TREE_TYPE (value), value, div))
11708 /* If divisor is a power of two, simplify this to bit manipulation. */
11709 if (divisor == (divisor & -divisor))
11713 t = build_int_cst (TREE_TYPE (value), divisor - 1);
11714 value = size_binop (PLUS_EXPR, value, t);
11715 t = build_int_cst (TREE_TYPE (value), -divisor);
11716 value = size_binop (BIT_AND_EXPR, value, t);
11721 div = build_int_cst (TREE_TYPE (value), divisor);
11722 value = size_binop (CEIL_DIV_EXPR, value, div);
11723 value = size_binop (MULT_EXPR, value, div);
11729 /* Likewise, but round down. */
11732 round_down (tree value, int divisor)
11734 tree div = NULL_TREE;
11736 gcc_assert (divisor > 0);
11740 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
11741 have to do anything. Only do this when we are not given a const,
11742 because in that case, this check is more expensive than just
11744 if (TREE_CODE (value) != INTEGER_CST)
11746 div = build_int_cst (TREE_TYPE (value), divisor);
11748 if (multiple_of_p (TREE_TYPE (value), value, div))
11752 /* If divisor is a power of two, simplify this to bit manipulation. */
11753 if (divisor == (divisor & -divisor))
11757 t = build_int_cst (TREE_TYPE (value), -divisor);
11758 value = size_binop (BIT_AND_EXPR, value, t);
11763 div = build_int_cst (TREE_TYPE (value), divisor);
11764 value = size_binop (FLOOR_DIV_EXPR, value, div);
11765 value = size_binop (MULT_EXPR, value, div);
11771 /* Returns the pointer to the base of the object addressed by EXP and
11772 extracts the information about the offset of the access, storing it
11773 to PBITPOS and POFFSET. */
11776 split_address_to_core_and_offset (tree exp,
11777 HOST_WIDE_INT *pbitpos, tree *poffset)
11780 enum machine_mode mode;
11781 int unsignedp, volatilep;
11782 HOST_WIDE_INT bitsize;
11784 if (TREE_CODE (exp) == ADDR_EXPR)
11786 core = get_inner_reference (TREE_OPERAND (exp, 0), &bitsize, pbitpos,
11787 poffset, &mode, &unsignedp, &volatilep,
11790 if (TREE_CODE (core) == INDIRECT_REF)
11791 core = TREE_OPERAND (core, 0);
11797 *poffset = NULL_TREE;
11803 /* Returns true if addresses of E1 and E2 differ by a constant, false
11804 otherwise. If they do, E1 - E2 is stored in *DIFF. */
11807 ptr_difference_const (tree e1, tree e2, HOST_WIDE_INT *diff)
11810 HOST_WIDE_INT bitpos1, bitpos2;
11811 tree toffset1, toffset2, tdiff, type;
11813 core1 = split_address_to_core_and_offset (e1, &bitpos1, &toffset1);
11814 core2 = split_address_to_core_and_offset (e2, &bitpos2, &toffset2);
11816 if (bitpos1 % BITS_PER_UNIT != 0
11817 || bitpos2 % BITS_PER_UNIT != 0
11818 || !operand_equal_p (core1, core2, 0))
11821 if (toffset1 && toffset2)
11823 type = TREE_TYPE (toffset1);
11824 if (type != TREE_TYPE (toffset2))
11825 toffset2 = fold_convert (type, toffset2);
11827 tdiff = fold (build2 (MINUS_EXPR, type, toffset1, toffset2));
11828 if (!host_integerp (tdiff, 0))
11831 *diff = tree_low_cst (tdiff, 0);
11833 else if (toffset1 || toffset2)
11835 /* If only one of the offsets is non-constant, the difference cannot
11842 *diff += (bitpos1 - bitpos2) / BITS_PER_UNIT;
11846 /* Simplify the floating point expression EXP when the sign of the
11847 result is not significant. Return NULL_TREE if no simplification
11851 fold_strip_sign_ops (tree exp)
11855 switch (TREE_CODE (exp))
11859 arg0 = fold_strip_sign_ops (TREE_OPERAND (exp, 0));
11860 return arg0 ? arg0 : TREE_OPERAND (exp, 0);
11864 if (HONOR_SIGN_DEPENDENT_ROUNDING (TYPE_MODE (TREE_TYPE (exp))))
11866 arg0 = fold_strip_sign_ops (TREE_OPERAND (exp, 0));
11867 arg1 = fold_strip_sign_ops (TREE_OPERAND (exp, 1));
11868 if (arg0 != NULL_TREE || arg1 != NULL_TREE)
11869 return fold (build2 (TREE_CODE (exp), TREE_TYPE (exp),
11870 arg0 ? arg0 : TREE_OPERAND (exp, 0),
11871 arg1 ? arg1 : TREE_OPERAND (exp, 1)));