| blob | fc72b9b38a2158f2606de4cfa570f7ddd4e0e4a5 |
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, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
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
31 and force_fit_type_double.
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_double takes a constant, an overflowable flag and a
43 prior overflow indicator. It forces the value to fit the type and
44 sets TREE_OVERFLOW.
46 Note: Since the folders get called on non-gimple code as well as
47 gimple code, we need to handle GIMPLE tuples as well as their
48 corresponding tree equivalents. */
69 /* Nonzero if we are folding constants inside an initializer; zero
70 otherwise. */
73 /* The following constants represent a bit based encoding of GCC's
74 comparison operators. This encoding simplifies transformations
75 on relational comparison operators, such as AND and OR. */
93 };
124 tree);
145 /* We know that A1 + B1 = SUM1, using 2's complement arithmetic and ignoring
146 overflow. Suppose A, B and SUM have the same respective signs as A1, B1,
147 and SUM1. Then this yields nonzero if overflow occurred during the
148 addition.
150 Overflow occurs if A and B have the same sign, but A and SUM differ in
151 sign. Use `^' to test whether signs differ, and `< 0' to isolate the
152 sign. */
153 #define OVERFLOW_SUM_SIGN(a, b, sum) ((~((a) ^ (b)) & ((a) ^ (sum))) < 0)
154 \f
155 /* To do constant folding on INTEGER_CST nodes requires two-word arithmetic.
156 We do that by representing the two-word integer in 4 words, with only
157 HOST_BITS_PER_WIDE_INT / 2 bits stored in each word, as a positive
158 number. The value of the word is LOWPART + HIGHPART * BASE. */
160 #define LOWPART(x) \
161 ((x) & (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) - 1))
162 #define HIGHPART(x) \
163 ((unsigned HOST_WIDE_INT) (x) >> HOST_BITS_PER_WIDE_INT / 2)
164 #define BASE ((unsigned HOST_WIDE_INT) 1 << HOST_BITS_PER_WIDE_INT / 2)
166 /* Unpack a two-word integer into 4 words.
167 LOW and HI are the integer, as two `HOST_WIDE_INT' pieces.
168 WORDS points to the array of HOST_WIDE_INTs. */
170 static void
172 {
177 }
179 /* Pack an array of 4 words into a two-word integer.
180 WORDS points to the array of words.
181 The integer is stored into *LOW and *HI as two `HOST_WIDE_INT' pieces. */
183 static void
186 {
189 }
190 \f
191 /* Force the double-word integer L1, H1 to be within the range of the
192 integer type TYPE. Stores the properly truncated and sign-extended
193 double-word integer in *LV, *HV. Returns true if the operation
194 overflows, that is, argument and result are different. */
196 int
199 {
208 else
211 /* Size types *are* sign extended. */
216 /* First clear all bits that are beyond the type's precision. */
218 ;
221 else
222 {
226 }
228 /* Then do sign extension if necessary. */
234 {
235 /* Sign extend top half? */
239 }
241 {
244 }
245 else
246 {
247 /* Sign extend bottom half? */
249 {
252 }
253 }
258 /* If the value didn't fit, signal overflow. */
260 }
262 /* We force the double-int HIGH:LOW to the range of the type TYPE by
263 sign or zero extending it.
264 OVERFLOWABLE indicates if we are interested
265 in overflow of the value, when >0 we are only interested in signed
266 overflow, for <0 we are interested in any overflow. OVERFLOWED
267 indicates whether overflow has already occurred. CONST_OVERFLOWED
268 indicates whether constant overflow has already occurred. We force
269 T's value to be within range of T's type (by setting to 0 or 1 all
270 the bits outside the type's range). We set TREE_OVERFLOWED if,
271 OVERFLOWED is nonzero,
272 or OVERFLOWABLE is >0 and signed overflow occurs
273 or OVERFLOWABLE is <0 and any overflow occurs
274 We return a new tree node for the extended double-int. The node
275 is shared if no overflow flags are set. */
277 tree
281 {
285 /* Size types *are* sign extended. */
292 /* If we need to set overflow flags, return a new unshared node. */
294 {
298 {
305 }
306 }
308 /* Else build a shared node. */
310 }
311 \f
312 /* Add two doubleword integers with doubleword result.
313 Return nonzero if the operation overflows according to UNSIGNED_P.
314 Each argument is given as two `HOST_WIDE_INT' pieces.
315 One argument is L1 and H1; the other, L2 and H2.
316 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
318 int
323 {
325 HOST_WIDE_INT h;
335 else
337 }
339 /* Negate a doubleword integer with doubleword result.
340 Return nonzero if the operation overflows, assuming it's signed.
341 The argument is given as two `HOST_WIDE_INT' pieces in L1 and H1.
342 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
344 int
347 {
349 {
353 }
354 else
355 {
359 }
360 }
361 \f
362 /* Multiply two doubleword integers with doubleword result.
363 Return nonzero if the operation overflows according to UNSIGNED_P.
364 Each argument is given as two `HOST_WIDE_INT' pieces.
365 One argument is L1 and H1; the other, L2 and H2.
366 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
368 int
373 {
388 {
391 {
393 /* This product is <= 0xFFFE0001, the sum <= 0xFFFF0000. */
395 /* Since prod[p] < 0xFFFF, this sum <= 0xFFFFFFFF. */
399 }
401 }
406 /* Unsigned overflow is immediate. */
410 /* Check for signed overflow by calculating the signed representation of the
411 top half of the result; it should agree with the low half's sign bit. */
413 {
416 }
418 {
421 }
423 }
424 \f
425 /* Shift the doubleword integer in L1, H1 left by COUNT places
426 keeping only PREC bits of result.
427 Shift right if COUNT is negative.
428 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
429 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
431 void
435 {
439 {
442 }
448 {
449 /* Shifting by the host word size is undefined according to the
450 ANSI standard, so we must handle this as a special case. */
453 }
455 {
458 }
459 else
460 {
464 }
466 /* Sign extend all bits that are beyond the precision. */
474 ;
476 {
479 }
480 else
481 {
485 }
486 }
488 /* Shift the doubleword integer in L1, H1 right by COUNT places
489 keeping only PREC bits of result. COUNT must be positive.
490 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
491 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
493 void
498 {
501 signmask = (arith
509 {
510 /* Shifting by the host word size is undefined according to the
511 ANSI standard, so we must handle this as a special case. */
514 }
516 {
519 }
520 else
521 {
525 }
527 /* Zero / sign extend all bits that are beyond the precision. */
530 {
533 }
535 ;
537 {
540 }
541 else
542 {
546 }
547 }
548 \f
549 /* Rotate the doubleword integer in L1, H1 left by COUNT places
550 keeping only PREC bits of result.
551 Rotate right if COUNT is negative.
552 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
554 void
558 {
570 }
572 /* Rotate the doubleword integer in L1, H1 left by COUNT places
573 keeping only PREC bits of result. COUNT must be positive.
574 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
576 void
580 {
592 }
593 \f
594 /* Divide doubleword integer LNUM, HNUM by doubleword integer LDEN, HDEN
595 for a quotient (stored in *LQUO, *HQUO) and remainder (in *LREM, *HREM).
596 CODE is a tree code for a kind of division, one of
597 TRUNC_DIV_EXPR, FLOOR_DIV_EXPR, CEIL_DIV_EXPR, ROUND_DIV_EXPR
598 or EXACT_DIV_EXPR
599 It controls how the quotient is rounded to an integer.
600 Return nonzero if the operation overflows.
601 UNS nonzero says do unsigned division. */
603 int
606 HOST_WIDE_INT hnum_orig,
608 HOST_WIDE_INT hden_orig,
612 {
628 /* Calculate quotient sign and convert operands to unsigned. */
630 {
632 {
634 /* (minimum integer) / (-1) is the only overflow case. */
638 }
640 {
643 }
644 }
649 /* This unsigned division rounds toward zero. */
652 }
656 /* hden != 0 already checked. */
661 }
671 /* Special code for when the divisor < BASE. */
673 {
674 /* hnum != 0 already checked. */
676 {
680 }
681 }
682 else
683 {
684 /* Full double precision division,
685 with thanks to Don Knuth's "Seminumerical Algorithms". */
689 /* Find the highest nonzero divisor digit. */
692 {
695 }
697 /* Insure that the first digit of the divisor is at least BASE/2.
698 This is required by the quotient digit estimation algorithm. */
705 {
709 }
714 {
719 }
720 }
724 /* Main loop */
726 {
727 /* Guess the next quotient digit, quo_est, by dividing the first
728 two remaining dividend digits by the high order quotient digit.
729 quo_est is never low and is at most 2 high. */
736 else
739 /* Refine quo_est so it's usually correct, and at most one high. */
744 quo_est--;
746 /* Try QUO_EST as the quotient digit, by multiplying the
747 divisor by QUO_EST and subtracting from the remaining dividend.
748 Keep in mind that QUO_EST is the I - 1st digit. */
752 {
758 }
760 /* If quo_est was high by one, then num[i] went negative and
761 we need to correct things. */
763 {
764 quo_est--;
767 {
771 }
774 }
776 /* Store the quotient digit. */
778 }
779 }
783 finish_up:
784 /* If result is negative, make it so. */
788 /* Compute trial remainder: rem = num - (quo * den) */
794 {
803 {
804 /* quo = quo - 1; */
807 }
808 else
815 {
818 }
819 else
825 {
831 /* Get absolute values. */
837 /* If (2 * abs (lrem) >= abs (lden)) */
846 {
848 /* quo = quo - 1; */
851 else
852 /* quo = quo + 1; */
855 }
856 else
858 }
863 }
865 /* Compute true remainder: rem = num - (quo * den) */
870 }
872 /* If ARG2 divides ARG1 with zero remainder, carries out the division
873 of type CODE and returns the quotient.
874 Otherwise returns NULL_TREE. */
876 static tree
878 {
888 /* &obj[0] + -128 really should be compiled as &obj[-8] rather than
889 &obj[some_exotic_number]. */
891 {
895 type);
896 }
897 else
908 }
909 \f
910 /* This is nonzero if we should defer warnings about undefined
911 overflow. This facility exists because these warnings are a
912 special case. The code to estimate loop iterations does not want
913 to issue any warnings, since it works with expressions which do not
914 occur in user code. Various bits of cleanup code call fold(), but
915 only use the result if it has certain characteristics (e.g., is a
916 constant); that code only wants to issue a warning if the result is
917 used. */
921 /* If a warning about undefined overflow is deferred, this is the
922 warning. Note that this may cause us to turn two warnings into
923 one, but that is fine since it is sufficient to only give one
924 warning per expression. */
928 /* If a warning about undefined overflow is deferred, this is the
929 level at which the warning should be emitted. */
933 /* Start deferring overflow warnings. We could use a stack here to
934 permit nested calls, but at present it is not necessary. */
936 void
938 {
940 }
942 /* Stop deferring overflow warnings. If there is a pending warning,
943 and ISSUE is true, then issue the warning if appropriate. STMT is
944 the statement with which the warning should be associated (used for
945 location information); STMT may be NULL. CODE is the level of the
946 warning--a warn_strict_overflow_code value. This function will use
947 the smaller of CODE and the deferred code when deciding whether to
948 issue the warning. CODE may be zero to mean to always use the
949 deferred code. */
951 void
953 {
955 location_t locus;
960 {
966 }
977 /* Use the smallest code level when deciding to issue the
978 warning. */
987 else
990 }
992 /* Stop deferring overflow warnings, ignoring any deferred
993 warnings. */
995 void
997 {
999 }
1001 /* Whether we are deferring overflow warnings. */
1003 bool
1005 {
1007 }
1009 /* This is called when we fold something based on the fact that signed
1010 overflow is undefined. */
1012 static void
1014 {
1016 {
1019 {
1022 }
1023 }
1026 }
1027 \f
1028 /* Return true if the built-in mathematical function specified by CODE
1029 is odd, i.e. -f(x) == f(-x). */
1031 static bool
1033 {
1035 {
1069 }
1071 }
1073 /* Check whether we may negate an integer constant T without causing
1074 overflow. */
1076 bool
1078 {
1081 tree type;
1091 {
1096 }
1097 else
1102 }
1104 /* Determine whether an expression T can be cheaply negated using
1105 the function negate_expr without introducing undefined overflow. */
1107 static bool
1109 {
1110 tree type;
1119 {
1124 /* Check that -CST will not overflow type. */
1150 /* -(A + B) -> (-B) - A. */
1155 /* -(A + B) -> (-A) - B. */
1159 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
1169 /* Fall through. */
1182 /* In general we can't negate A / B, because if A is INT_MIN and
1183 B is 1, we may turn this into INT_MIN / -1 which is undefined
1184 and actually traps on some architectures. But if overflow is
1185 undefined, we can negate, because - (INT_MIN / 1) is an
1186 overflow. */
1194 /* Negate -((double)float) as (double)(-float). */
1196 {
1200 }
1204 /* Negate -f(x) as f(-x). */
1210 /* Optimize -((int)x >> 31) into (unsigned)x >> 31. */
1212 {
1218 }
1223 }
1225 }
1227 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
1228 simplification is possible.
1229 If negate_expr_p would return true for T, NULL_TREE will never be
1230 returned. */
1232 static tree
1234 {
1236 tree tem;
1239 {
1240 /* Convert - (~A) to A + 1. */
1256 /* Two's complement FP formats, such as c4x, may overflow. */
1266 {
1275 }
1297 {
1298 /* -(A + B) -> (-B) - A. */
1302 {
1306 }
1308 /* -(A + B) -> (-A) - B. */
1310 {
1314 }
1315 }
1319 /* - (A - B) -> B - A */
1331 /* Fall through. */
1335 {
1344 }
1352 /* In general we can't negate A / B, because if A is INT_MIN and
1353 B is 1, we may turn this into INT_MIN / -1 which is undefined
1354 and actually traps on some architectures. But if overflow is
1355 undefined, we can negate, because - (INT_MIN / 1) is an
1356 overflow. */
1358 {
1363 {
1370 }
1373 {
1380 }
1381 }
1385 /* Convert -((double)float) into (double)(-float). */
1387 {
1391 }
1395 /* Negate -f(x) as f(-x). */
1398 {
1404 }
1408 /* Optimize -((int)x >> 31) into (unsigned)x >> 31. */
1410 {
1415 {
1422 }
1423 }
1428 }
1431 }
1433 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
1434 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
1435 return NULL_TREE. */
1437 static tree
1439 {
1452 }
1453 \f
1454 /* Split a tree IN into a constant, literal and variable parts that could be
1455 combined with CODE to make IN. "constant" means an expression with
1456 TREE_CONSTANT but that isn't an actual constant. CODE must be a
1457 commutative arithmetic operation. Store the constant part into *CONP,
1458 the literal in *LITP and return the variable part. If a part isn't
1459 present, set it to null. If the tree does not decompose in this way,
1460 return the entire tree as the variable part and the other parts as null.
1462 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
1463 case, we negate an operand that was subtracted. Except if it is a
1464 literal for which we use *MINUS_LITP instead.
1466 If NEGATE_P is true, we are negating all of IN, again except a literal
1467 for which we use *MINUS_LITP instead.
1469 If IN is itself a literal or constant, return it as appropriate.
1471 Note that we do not guarantee that any of the three values will be the
1472 same type as IN, but they will have the same signedness and mode. */
1474 static tree
1477 {
1484 /* Strip any conversions that don't change the machine mode or signedness. */
1493 /* We can associate addition and subtraction together (even
1494 though the C standard doesn't say so) for integers because
1495 the value is not affected. For reals, the value might be
1496 affected, so we can't. */
1499 {
1505 /* First see if either of the operands is a literal, then a constant. */
1518 /* If we haven't dealt with either operand, this is not a case we can
1519 decompose. Otherwise, VAR is either of the ones remaining, if any. */
1524 else
1527 /* Now do any needed negations. */
1534 }
1537 else
1541 {
1548 }
1551 }
1553 /* Re-associate trees split by the above function. T1 and T2 are either
1554 expressions to associate or null. Return the new expression, if any. If
1555 we build an operation, do it in TYPE and with CODE. */
1557 static tree
1559 {
1565 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
1566 try to fold this since we will have infinite recursion. But do
1567 deal with any NEGATE_EXPRs. */
1570 {
1572 {
1581 }
1583 {
1586 }
1590 }
1594 }
1595 \f
1596 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
1597 for use in int_const_binop, size_binop and size_diffop. */
1599 static bool
1601 {
1608 {
1617 }
1622 }
1625 /* Combine two integer constants ARG1 and ARG2 under operation CODE
1626 to produce a new constant. Return NULL_TREE if we don't know how
1627 to evaluate CODE at compile-time.
1629 If NOTRUNC is nonzero, do not truncate the result to fit the data type. */
1631 tree
1633 {
1637 HOST_WIDE_INT hi;
1639 HOST_WIDE_INT garbageh;
1640 tree t;
1643 int is_sizetype
1653 {
1669 /* It's unclear from the C standard whether shifts can overflow.
1670 The following code ignores overflow; perhaps a C standard
1671 interpretation ruling is needed. */
1700 /* This is a shortcut for a common special case. */
1705 {
1711 }
1713 /* ... fall through ... */
1719 {
1722 }
1725 {
1728 }
1735 /* This is a shortcut for a common special case. */
1740 {
1745 }
1747 /* ... fall through ... */
1765 else
1771 else
1777 }
1780 {
1783 /* Propagate overflow flags ourselves. */
1786 {
1789 }
1790 }
1791 else
1797 }
1799 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1800 constant. We assume ARG1 and ARG2 have the same data type, or at least
1801 are the same kind of constant and the same machine mode. Return zero if
1802 combining the constants is not allowed in the current operating mode.
1804 If NOTRUNC is nonzero, do not truncate the result to fit the data type. */
1806 static tree
1808 {
1809 /* Sanity check for the recursive cases. */
1820 {
1822 REAL_VALUE_TYPE d1;
1823 REAL_VALUE_TYPE d2;
1824 REAL_VALUE_TYPE value;
1825 REAL_VALUE_TYPE result;
1829 /* The following codes are handled by real_arithmetic. */
1831 {
1842 }
1850 /* Don't perform operation if we honor signaling NaNs and
1851 either operand is a NaN. */
1856 /* Don't perform operation if it would raise a division
1857 by zero exception. */
1863 /* If either operand is a NaN, just return it. Otherwise, set up
1864 for floating-point trap; we return an overflow. */
1873 /* Don't constant fold this floating point operation if
1874 the result has overflowed and flag_trapping_math. */
1882 /* Don't constant fold this floating point operation if the
1883 result may dependent upon the run-time rounding mode and
1884 flag_rounding_math is set, or if GCC's software emulation
1885 is unable to accurately represent the result. */
1896 }
1899 {
1900 FIXED_VALUE_TYPE f1;
1901 FIXED_VALUE_TYPE f2;
1902 FIXED_VALUE_TYPE result;
1907 /* The following codes are handled by fixed_arithmetic. */
1909 {
1926 }
1933 /* Propagate overflow flags. */
1935 {
1938 }
1942 }
1945 {
1954 {
1965 notrunc);
1969 notrunc);
1973 {
1974 tree magsquared
1978 notrunc);
1979 tree t1
1983 notrunc);
1984 tree t2
1988 notrunc);
1995 }
2000 }
2004 }
2007 }
2009 /* Create a size type INT_CST node with NUMBER sign extended. KIND
2010 indicates which particular sizetype to create. */
2012 tree
2014 {
2016 }
2017 \f
2018 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
2019 is a tree code. The type of the result is taken from the operands.
2020 Both must be equivalent integer types, ala int_binop_types_match_p.
2021 If the operands are constant, so is the result. */
2023 tree
2025 {
2034 /* Handle the special case of two integer constants faster. */
2036 {
2037 /* And some specific cases even faster than that. */
2039 {
2044 }
2046 {
2049 }
2051 {
2054 }
2056 /* Handle general case of two integer constants. */
2058 }
2061 }
2063 /* Given two values, either both of sizetype or both of bitsizetype,
2064 compute the difference between the two values. Return the value
2065 in signed type corresponding to the type of the operands. */
2067 tree
2069 {
2071 tree ctype;
2076 /* If the type is already signed, just do the simple thing. */
2084 else
2087 /* If either operand is not a constant, do the conversions to the signed
2088 type and subtract. The hardware will do the right thing with any
2089 overflow in the subtraction. */
2094 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
2095 Otherwise, subtract the other way, convert to CTYPE (we know that can't
2096 overflow) and negate (which can't either). Special-case a result
2097 of zero while we're here. */
2102 else
2106 }
2107 \f
2108 /* A subroutine of fold_convert_const handling conversions of an
2109 INTEGER_CST to another integer type. */
2111 static tree
2113 {
2114 tree t;
2116 /* Given an integer constant, make new constant with new type,
2117 appropriately sign-extended or truncated. */
2120 /* Don't set the overflow when
2121 converting from a pointer, */
2123 /* or to a sizetype with same signedness
2124 and the precision is unchanged.
2125 ??? sizetype is always sign-extended,
2126 but its signedness depends on the
2127 frontend. Thus we see spurious overflows
2128 here if we do not check this. */
2143 }
2145 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2146 to an integer type. */
2148 static tree
2150 {
2152 tree t;
2154 /* The following code implements the floating point to integer
2155 conversion rules required by the Java Language Specification,
2156 that IEEE NaNs are mapped to zero and values that overflow
2157 the target precision saturate, i.e. values greater than
2158 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
2159 are mapped to INT_MIN. These semantics are allowed by the
2160 C and C++ standards that simply state that the behavior of
2161 FP-to-integer conversion is unspecified upon overflow. */
2164 REAL_VALUE_TYPE r;
2168 {
2175 }
2177 /* If R is NaN, return zero and show we have an overflow. */
2179 {
2183 }
2185 /* See if R is less than the lower bound or greater than the
2186 upper bound. */
2189 {
2193 {
2197 }
2198 }
2201 {
2204 {
2207 {
2211 }
2212 }
2213 }
2221 }
2223 /* A subroutine of fold_convert_const handling conversions of a
2224 FIXED_CST to an integer type. */
2226 static tree
2228 {
2229 tree t;
2233 /* Right shift FIXED_CST to temp by fbit. */
2237 {
2242 /* Left shift temp to temp_trunc by fbit. */
2247 }
2248 else
2249 {
2254 }
2256 /* If FIXED_CST is negative, we need to round the value toward 0.
2257 By checking if the fractional bits are not zero to add 1 to temp. */
2260 {
2261 double_int one;
2265 }
2267 /* Given a fixed-point constant, make new constant with new type,
2268 appropriately sign-extended or truncated. */
2276 }
2278 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2279 to another floating point type. */
2281 static tree
2283 {
2284 REAL_VALUE_TYPE value;
2285 tree t;
2292 }
2294 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2295 to a floating point type. */
2297 static tree
2299 {
2300 REAL_VALUE_TYPE value;
2301 tree t;
2310 }
2312 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2313 to another fixed-point type. */
2315 static tree
2317 {
2318 FIXED_VALUE_TYPE value;
2319 tree t;
2326 /* Propagate overflow flags. */
2328 {
2331 }
2335 }
2337 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2338 to a fixed-point type. */
2340 static tree
2342 {
2343 FIXED_VALUE_TYPE value;
2344 tree t;
2353 /* Propagate overflow flags. */
2355 {
2358 }
2362 }
2364 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2365 to a fixed-point type. */
2367 static tree
2369 {
2370 FIXED_VALUE_TYPE value;
2371 tree t;
2379 /* Propagate overflow flags. */
2381 {
2384 }
2388 }
2390 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2391 type TYPE. If no simplification can be done return NULL_TREE. */
2393 static tree
2395 {
2400 {
2407 }
2409 {
2416 }
2418 {
2425 }
2427 }
2429 /* Construct a vector of zero elements of vector type TYPE. */
2431 static tree
2433 {
2444 }
2446 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2448 bool
2450 {
2465 {
2484 }
2485 }
2487 /* Convert expression ARG to type TYPE. Used by the middle-end for
2488 simple conversions in preference to calling the front-end's convert. */
2490 tree
2492 {
2494 tree tem;
2508 {
2513 {
2517 }
2522 {
2525 }
2532 {
2536 }
2538 {
2542 }
2544 {
2548 }
2551 {
2569 }
2574 {
2578 }
2581 {
2595 }
2599 {
2609 {
2613 {
2617 }
2625 }
2629 }
2647 }
2648 }
2649 \f
2650 /* Return false if expr can be assumed not to be an lvalue, true
2651 otherwise. */
2653 static bool
2655 {
2656 /* We only need to wrap lvalue tree codes. */
2658 {
2693 /* Assume the worst for front-end tree codes. */
2697 }
2700 }
2702 /* Return an expr equal to X but certainly not valid as an lvalue. */
2704 tree
2706 {
2707 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2708 us. */
2715 }
2717 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
2718 Zero means allow extended lvalues. */
2722 /* When pedantic, return an expr equal to X but certainly not valid as a
2723 pedantic lvalue. Otherwise, return X. */
2725 static tree
2727 {
2730 else
2732 }
2733 \f
2734 /* Given a tree comparison code, return the code that is the logical inverse
2735 of the given code. It is not safe to do this for floating-point
2736 comparisons, except for NE_EXPR and EQ_EXPR, so we receive a machine mode
2737 as well: if reversing the comparison is unsafe, return ERROR_MARK. */
2739 enum tree_code
2741 {
2746 {
2777 }
2778 }
2780 /* Similar, but return the comparison that results if the operands are
2781 swapped. This is safe for floating-point. */
2783 enum tree_code
2785 {
2787 {
2813 }
2814 }
2817 /* Convert a comparison tree code from an enum tree_code representation
2818 into a compcode bit-based encoding. This function is the inverse of
2819 compcode_to_comparison. */
2821 static enum comparison_code
2823 {
2825 {
2856 }
2857 }
2859 /* Convert a compcode bit-based encoding of a comparison operator back
2860 to GCC's enum tree_code representation. This function is the
2861 inverse of comparison_to_compcode. */
2863 static enum tree_code
2865 {
2867 {
2898 }
2899 }
2901 /* Return a tree for the comparison which is the combination of
2902 doing the AND or OR (depending on CODE) of the two operations LCODE
2903 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2904 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2905 if this makes the transformation invalid. */
2907 tree
2911 {
2918 {
2929 }
2932 {
2933 /* Eliminate unordered comparisons, as well as LTGT and ORD
2934 which are not used unless the mode has NaNs. */
2940 }
2942 {
2943 /* Check that the original operation and the optimized ones will trap
2944 under the same condition. */
2955 /* In a short-circuited boolean expression the LHS might be
2956 such that the RHS, if evaluated, will never trap. For
2957 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2958 if neither x nor y is NaN. (This is a mixed blessing: for
2959 example, the expression above will never trap, hence
2960 optimizing it to x < y would be invalid). */
2965 /* If the comparison was short-circuited, and only the RHS
2966 trapped, we may now generate a spurious trap. */
2971 /* If we changed the conditions that cause a trap, we lose. */
2974 }
2980 else
2983 }
2985 /* Return nonzero if CODE is a tree code that represents a truth value. */
2987 static int
2989 {
2994 }
2995 \f
2996 /* Return nonzero if two operands (typically of the same tree node)
2997 are necessarily equal. If either argument has side-effects this
2998 function returns zero. FLAGS modifies behavior as follows:
3000 If OEP_ONLY_CONST is set, only return nonzero for constants.
3001 This function tests whether the operands are indistinguishable;
3002 it does not test whether they are equal using C's == operation.
3003 The distinction is important for IEEE floating point, because
3004 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
3005 (2) two NaNs may be indistinguishable, but NaN!=NaN.
3007 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
3008 even though it may hold multiple values during a function.
3009 This is because a GCC tree node guarantees that nothing else is
3010 executed between the evaluation of its "operands" (which may often
3011 be evaluated in arbitrary order). Hence if the operands themselves
3012 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
3013 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
3014 unset means assuming isochronic (or instantaneous) tree equivalence.
3015 Unless comparing arbitrary expression trees, such as from different
3016 statements, this flag can usually be left unset.
3018 If OEP_PURE_SAME is set, then pure functions with identical arguments
3019 are considered the same. It is used when the caller has other ways
3020 to ensure that global memory is unchanged in between. */
3022 int
3024 {
3025 /* If either is ERROR_MARK, they aren't equal. */
3029 /* Check equality of integer constants before bailing out due to
3030 precision differences. */
3034 /* If both types don't have the same signedness, then we can't consider
3035 them equal. We must check this before the STRIP_NOPS calls
3036 because they may change the signedness of the arguments. As pointers
3037 strictly don't have a signedness, require either two pointers or
3038 two non-pointers as well. */
3043 /* If both types don't have the same precision, then it is not safe
3044 to strip NOPs. */
3051 /* In case both args are comparisons but with different comparison
3052 code, try to swap the comparison operands of one arg to produce
3053 a match and compare that variant. */
3057 {
3065 }
3068 /* This is needed for conversions and for COMPONENT_REF.
3069 Might as well play it safe and always test this. */
3075 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
3076 We don't care about side effects in that case because the SAVE_EXPR
3077 takes care of that for us. In all other cases, two expressions are
3078 equal if they have no side effects. If we have two identical
3079 expressions with side effects that should be treated the same due
3080 to the only side effects being identical SAVE_EXPR's, that will
3081 be detected in the recursive calls below. */
3087 /* Next handle constant cases, those for which we can return 1 even
3088 if ONLY_CONST is set. */
3091 {
3106 {
3107 /* If we do not distinguish between signed and unsigned zero,
3108 consider them equal. */
3111 }
3115 {
3121 {
3123 flags))
3127 }
3130 }
3134 flags)
3136 flags));
3149 }
3154 /* Define macros to test an operand from arg0 and arg1 for equality and a
3155 variant that allows null and views null as being different from any
3156 non-null value. In the latter case, if either is null, the both
3157 must be; otherwise, do the normal comparison. */
3158 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
3159 TREE_OPERAND (arg1, N), flags)
3161 #define OP_SAME_WITH_NULL(N) \
3162 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
3163 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
3166 {
3168 /* Two conversions are equal only if signedness and modes match. */
3170 {
3171 CASE_CONVERT:
3179 }
3189 /* For commutative ops, allow the other order. */
3197 /* If either of the pointer (or reference) expressions we are
3198 dereferencing contain a side effect, these cannot be equal. */
3204 {
3214 /* Operands 2 and 3 may be null.
3215 Compare the array index by value if it is constant first as we
3216 may have different types but same value here. */
3225 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3226 may be NULL when we're called to compare MEM_EXPRs. */
3236 }
3240 {
3255 /* Otherwise take into account this is a commutative operation. */
3266 }
3270 {
3272 /* If the CALL_EXPRs call different functions, then they
3273 clearly can not be equal. */
3275 flags))
3278 {
3282 else
3286 }
3288 /* Now see if all the arguments are the same. */
3289 {
3300 /* If we get here and both argument lists are exhausted
3301 then the CALL_EXPRs are equal. */
3303 }
3306 }
3309 /* Consider __builtin_sqrt equal to sqrt. */
3317 }
3319 #undef OP_SAME
3320 #undef OP_SAME_WITH_NULL
3321 }
3322 \f
3323 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3324 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3326 When in doubt, return 0. */
3328 static int
3330 {
3342 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3343 and see if the inner values are the same. This removes any
3344 signedness comparison, which doesn't matter here. */
3351 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3352 actual comparison operand, ARG0.
3354 First throw away any conversions to wider types
3355 already present in the operands. */
3364 {
3367 /* Make sure shorter operand is extended the right way
3368 to match the longer operand. */
3374 }
3377 }
3378 \f
3379 /* See if ARG is an expression that is either a comparison or is performing
3380 arithmetic on comparisons. The comparisons must only be comparing
3381 two different values, which will be stored in *CVAL1 and *CVAL2; if
3382 they are nonzero it means that some operands have already been found.
3383 No variables may be used anywhere else in the expression except in the
3384 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3385 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3387 If this is true, return 1. Otherwise, return zero. */
3389 static int
3391 {
3395 /* We can handle some of the tcc_expression cases here. */
3405 {
3406 /* If we've already found a CVAL1 or CVAL2, this expression is
3407 two complex to handle. */
3413 }
3416 {
3439 /* First see if we can handle the first operand, then the second. For
3440 the second operand, we know *CVAL1 can't be zero. It must be that
3441 one side of the comparison is each of the values; test for the
3442 case where this isn't true by failing if the two operands
3443 are the same. */
3452 ;
3456 ;
3457 else
3461 ;
3465 ;
3466 else
3473 }
3474 }
3475 \f
3476 /* ARG is a tree that is known to contain just arithmetic operations and
3477 comparisons. Evaluate the operations in the tree substituting NEW0 for
3478 any occurrence of OLD0 as an operand of a comparison and likewise for
3479 NEW1 and OLD1. */
3481 static tree
3483 {
3488 /* We can handle some of the tcc_expression cases here. */
3496 {
3511 {
3528 }
3529 /* Fall through - ??? */
3532 {
3536 /* We need to check both for exact equality and tree equality. The
3537 former will be true if the operand has a side-effect. In that
3538 case, we know the operand occurred exactly once. */
3551 }
3555 }
3556 }
3557 \f
3558 /* Return a tree for the case when the result of an expression is RESULT
3559 converted to TYPE and OMITTED was previously an operand of the expression
3560 but is now not needed (e.g., we folded OMITTED * 0).
3562 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3563 the conversion of RESULT to TYPE. */
3565 tree
3567 {
3570 /* If the resulting operand is an empty statement, just return the omitted
3571 statement casted to void. */
3579 }
3581 /* Similar, but call pedantic_non_lvalue instead of non_lvalue. */
3583 static tree
3585 {
3588 /* If the resulting operand is an empty statement, just return the omitted
3589 statement casted to void. */
3597 }
3599 /* Return a tree for the case when the result of an expression is RESULT
3600 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3601 of the expression but are now not needed.
3603 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3604 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3605 evaluated before OMITTED2. Otherwise, if neither has side effects,
3606 just do the conversion of RESULT to TYPE. */
3608 tree
3610 {
3619 }
3621 \f
3622 /* Return a simplified tree node for the truth-negation of ARG. This
3623 never alters ARG itself. We assume that ARG is an operation that
3624 returns a truth value (0 or 1).
3626 FIXME: one would think we would fold the result, but it causes
3627 problems with the dominator optimizer. */
3629 tree
3631 {
3635 /* If this is a comparison, we can simply invert it, except for
3636 floating-point non-equality comparisons, in which case we just
3637 enclose a TRUTH_NOT_EXPR around what we have. */
3640 {
3643 && flag_trapping_math
3647 else
3648 {
3653 else
3656 }
3657 }
3660 {
3675 /* Here we can invert either operand. We invert the first operand
3676 unless the second operand is a TRUTH_NOT_EXPR in which case our
3677 result is the XOR of the first operand with the inside of the
3678 negation of the second operand. */
3683 else
3702 {
3705 /* A COND_EXPR may have a throw as one operand, which
3706 then has void type. Just leave void operands
3707 as they are. */
3713 }
3746 }
3749 }
3751 /* Return a simplified tree node for the truth-negation of ARG. This
3752 never alters ARG itself. We assume that ARG is an operation that
3753 returns a truth value (0 or 1).
3755 FIXME: one would think we would fold the result, but it causes
3756 problems with the dominator optimizer. */
3758 tree
3760 {
3761 tree tem;
3771 }
3773 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
3774 operands are another bit-wise operation with a common input. If so,
3775 distribute the bit operations to save an operation and possibly two if
3776 constants are involved. For example, convert
3777 (A | B) & (A | C) into A | (B & C)
3778 Further simplification will occur if B and C are constants.
3780 If this optimization cannot be done, 0 will be returned. */
3782 static tree
3784 {
3785 tree common;
3795 {
3799 }
3801 {
3805 }
3807 {
3811 }
3813 {
3817 }
3818 else
3823 }
3825 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3826 with code CODE. This optimization is unsafe. */
3827 static tree
3829 {
3833 /* (A / C) +- (B / C) -> (A +- B) / C. */
3843 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3848 {
3860 }
3863 }
3864 \f
3865 /* Subroutine for fold_truthop: decode a field reference.
3867 If EXP is a comparison reference, we return the innermost reference.
3869 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
3870 set to the starting bit number.
3872 If the innermost field can be completely contained in a mode-sized
3873 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
3875 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
3876 otherwise it is not changed.
3878 *PUNSIGNEDP is set to the signedness of the field.
3880 *PMASK is set to the mask used. This is either contained in a
3881 BIT_AND_EXPR or derived from the width of the field.
3883 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
3885 Return 0 if this is not a component reference or is one that we can't
3886 do anything with. */
3888 static tree
3893 {
3897 tree unsigned_type;
3900 /* All the optimizations using this function assume integer fields.
3901 There are problems with FP fields since the type_for_size call
3902 below can fail for, e.g., XFmode. */
3906 /* We are interested in the bare arrangement of bits, so strip everything
3907 that doesn't affect the machine mode. However, record the type of the
3908 outermost expression if it may matter below. */
3915 {
3921 }
3930 /* If the number of bits in the reference is the same as the bitsize of
3931 the outer type, then the outer type gives the signedness. Otherwise
3932 (in case of a small bitfield) the signedness is unchanged. */
3936 /* Compute the mask to access the bitfield. */
3945 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
3953 }
3955 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
3956 represents the sign bit of EXP's type. If EXP represents a sign
3957 or zero extension, also test VAL against the unextended type.
3958 The return value is the (sub)expression whose sign bit is VAL,
3959 or NULL_TREE otherwise. */
3961 static tree
3963 {
3967 tree t;
3969 /* Tree EXP must have an integral type. */
3974 /* Tree VAL must be an integer constant. */
3981 {
3988 }
3989 else
3990 {
3997 }
3999 /* We mask off those bits beyond TREE_TYPE (exp) so that we can
4000 treat VAL as if it were unsigned. */
4005 /* Handle extension from a narrower type. */
4011 }
4013 /* Subroutine for fold_truthop: determine if an operand is simple enough
4014 to be evaluated unconditionally. */
4016 static int
4018 {
4019 /* Strip any conversions that don't change the machine mode. */
4028 /* Don't regard global variables as simple. They may be
4029 allocated in ways unknown to the compiler (shared memory,
4030 #pragma weak, etc). */
4033 /* Loading a static variable is unduly expensive, but global
4034 registers aren't expensive. */
4036 }
4037 \f
4038 /* The following functions are subroutines to fold_range_test and allow it to
4039 try to change a logical combination of comparisons into a range test.
4041 For example, both
4042 X == 2 || X == 3 || X == 4 || X == 5
4043 and
4044 X >= 2 && X <= 5
4045 are converted to
4046 (unsigned) (X - 2) <= 3
4048 We describe each set of comparisons as being either inside or outside
4049 a range, using a variable named like IN_P, and then describe the
4050 range with a lower and upper bound. If one of the bounds is omitted,
4051 it represents either the highest or lowest value of the type.
4053 In the comments below, we represent a range by two numbers in brackets
4054 preceded by a "+" to designate being inside that range, or a "-" to
4055 designate being outside that range, so the condition can be inverted by
4056 flipping the prefix. An omitted bound is represented by a "-". For
4057 example, "- [-, 10]" means being outside the range starting at the lowest
4058 possible value and ending at 10, in other words, being greater than 10.
4059 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4060 always false.
4062 We set up things so that the missing bounds are handled in a consistent
4063 manner so neither a missing bound nor "true" and "false" need to be
4064 handled using a special case. */
4066 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4067 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4068 and UPPER1_P are nonzero if the respective argument is an upper bound
4069 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4070 must be specified for a comparison. ARG1 will be converted to ARG0's
4071 type if both are specified. */
4073 static tree
4076 {
4077 tree tem;
4081 /* If neither arg represents infinity, do the normal operation.
4082 Else, if not a comparison, return infinity. Else handle the special
4083 comparison rules. Note that most of the cases below won't occur, but
4084 are handled for consistency. */
4087 {
4092 }
4097 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4098 for neither. In real maths, we cannot assume open ended ranges are
4099 the same. But, this is computer arithmetic, where numbers are finite.
4100 We can therefore make the transformation of any unbounded range with
4101 the value Z, Z being greater than any representable number. This permits
4102 us to treat unbounded ranges as equal. */
4106 {
4127 }
4130 }
4131 \f
4132 /* Given EXP, a logical expression, set the range it is testing into
4133 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4134 actually being tested. *PLOW and *PHIGH will be made of the same
4135 type as the returned expression. If EXP is not a comparison, we
4136 will most likely not be returning a useful value and range. Set
4137 *STRICT_OVERFLOW_P to true if the return value is only valid
4138 because signed overflow is undefined; otherwise, do not change
4139 *STRICT_OVERFLOW_P. */
4141 static tree
4144 {
4151 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4152 and see if we can refine the range. Some of the cases below may not
4153 happen, but it doesn't seem worth worrying about this. We "continue"
4154 the outer loop when we've changed something; otherwise we "break"
4155 the switch, which will "break" the while. */
4161 {
4166 {
4178 }
4181 {
4188 /* We can only do something if the range is testing for zero
4189 and if the second operand is an integer constant. Note that
4190 saying something is "in" the range we make is done by
4191 complementing IN_P since it will set in the initial case of
4192 being not equal to zero; "out" is leaving it alone. */
4199 {
4220 }
4222 /* If this is an unsigned comparison, we also know that EXP is
4223 greater than or equal to zero. We base the range tests we make
4224 on that fact, so we record it here so we can parse existing
4225 range tests. We test arg0_type since often the return type
4226 of, e.g. EQ_EXPR, is boolean. */
4228 {
4232 NULL_TREE))
4237 /* If the high bound is missing, but we have a nonzero low
4238 bound, reverse the range so it goes from zero to the low bound
4239 minus 1. */
4241 {
4246 }
4247 }
4253 /* (-x) IN [a,b] -> x in [-b, -a] */
4265 /* ~ X -> -X - 1 */
4274 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4275 move a constant to the other side. */
4280 /* If EXP is signed, any overflow in the computation is undefined,
4281 so we don't worry about it so long as our computations on
4282 the bounds don't overflow. For unsigned, overflow is defined
4283 and this is exactly the right thing. */
4295 /* Check for an unsigned range which has wrapped around the maximum
4296 value thus making n_high < n_low, and normalize it. */
4298 {
4304 /* If the range is of the form +/- [ x+1, x ], we won't
4305 be able to normalize it. But then, it represents the
4306 whole range or the empty set, so make it
4307 +/- [ -, - ]. */
4311 else
4313 }
4314 else
4338 /* If we're converting arg0 from an unsigned type, to exp,
4339 a signed type, we will be doing the comparison as unsigned.
4340 The tests above have already verified that LOW and HIGH
4341 are both positive.
4343 So we have to ensure that we will handle large unsigned
4344 values the same way that the current signed bounds treat
4345 negative values. */
4348 {
4349 tree high_positive;
4350 tree equiv_type;
4351 /* For fixed-point modes, we need to pass the saturating flag
4352 as the 2nd parameter. */
4357 else
4361 /* A range without an upper bound is, naturally, unbounded.
4362 Since convert would have cropped a very large value, use
4363 the max value for the destination type. */
4364 high_positive
4371 high_positive),
4374 /* If the low bound is specified, "and" the range with the
4375 range for which the original unsigned value will be
4376 positive. */
4378 {
4382 integer_zero_node),
4383 high_positive))
4387 }
4388 else
4389 {
4390 /* Otherwise, "or" the range with the range of the input
4391 that will be interpreted as negative. */
4395 integer_zero_node),
4396 high_positive))
4400 }
4401 }
4409 }
4412 }
4414 /* If EXP is a constant, we can evaluate whether this is true or false. */
4416 {
4423 }
4427 }
4428 \f
4429 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4430 type, TYPE, return an expression to test if EXP is in (or out of, depending
4431 on IN_P) the range. Return 0 if the test couldn't be created. */
4433 static tree
4435 {
4437 tree value;
4439 #ifdef HAVE_canonicalize_funcptr_for_compare
4440 /* Disable this optimization for function pointer expressions
4441 on targets that require function pointer canonicalization. */
4446 #endif
4449 {
4455 }
4473 {
4475 {
4479 }
4481 }
4483 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4485 {
4487 HOST_WIDE_INT hi;
4492 {
4495 }
4496 else
4497 {
4500 }
4503 {
4505 {
4508 }
4511 }
4512 }
4514 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4515 This requires wrap-around arithmetics for the type of the expression. */
4517 {
4519 /* There is no requirement that LOW be within the range of ETYPE
4520 if the latter is a subtype. It must, however, be within the base
4521 type of ETYPE. So be sure we do the subtraction in that type. */
4534 }
4536 /* If we don't have wrap-around arithmetics upfront, try to force it. */
4539 {
4542 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4543 for the type in question, as we rely on this here. */
4553 else
4555 }
4565 {
4567 {
4573 }
4575 }
4583 }
4584 \f
4585 /* Return the predecessor of VAL in its type, handling the infinite case. */
4587 static tree
4589 {
4595 else
4597 }
4599 /* Return the successor of VAL in its type, handling the infinite case. */
4601 static tree
4603 {
4609 else
4611 }
4613 /* Given two ranges, see if we can merge them into one. Return 1 if we
4614 can, 0 if we can't. Set the output range into the specified parameters. */
4616 static int
4619 {
4623 tree tem;
4633 /* Make range 0 be the range that starts first, or ends last if they
4634 start at the same value. Swap them if it isn't. */
4637 || (lowequal
4640 {
4644 }
4646 /* Now flag two cases, whether the ranges are disjoint or whether the
4647 second range is totally subsumed in the first. Note that the tests
4648 below are simplified by the ones above. */
4654 /* We now have four cases, depending on whether we are including or
4655 excluding the two ranges. */
4657 {
4658 /* If they don't overlap, the result is false. If the second range
4659 is a subset it is the result. Otherwise, the range is from the start
4660 of the second to the end of the first. */
4665 else
4667 }
4670 {
4671 /* If they don't overlap, the result is the first range. If they are
4672 equal, the result is false. If the second range is a subset of the
4673 first, and the ranges begin at the same place, we go from just after
4674 the end of the second range to the end of the first. If the second
4675 range is not a subset of the first, or if it is a subset and both
4676 ranges end at the same place, the range starts at the start of the
4677 first range and ends just before the second range.
4678 Otherwise, we can't describe this as a single range. */
4684 {
4689 {
4690 /* We are in the weird situation where high0 > high1 but
4691 high1 has no successor. Punt. */
4693 }
4694 }
4696 {
4701 {
4702 /* low0 < low1 but low1 has no predecessor. Punt. */
4704 }
4705 }
4706 else
4708 }
4711 {
4712 /* If they don't overlap, the result is the second range. If the second
4713 is a subset of the first, the result is false. Otherwise,
4714 the range starts just after the first range and ends at the
4715 end of the second. */
4720 else
4721 {
4726 {
4727 /* high1 > high0 but high0 has no successor. Punt. */
4729 }
4730 }
4731 }
4733 else
4734 {
4735 /* The case where we are excluding both ranges. Here the complex case
4736 is if they don't overlap. In that case, the only time we have a
4737 range is if they are adjacent. If the second is a subset of the
4738 first, the result is the first. Otherwise, the range to exclude
4739 starts at the beginning of the first range and ends at the end of the
4740 second. */
4742 {
4747 else
4748 {
4749 /* Canonicalize - [min, x] into - [-, x]. */
4752 {
4757 /* FALLTHROUGH */
4770 }
4772 /* Canonicalize - [x, max] into - [x, -]. */
4775 {
4780 /* FALLTHROUGH */
4795 }
4797 /* The ranges might be also adjacent between the maximum and
4798 minimum values of the given type. For
4799 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
4800 return + [x + 1, y - 1]. */
4802 {
4809 }
4810 else
4812 }
4813 }
4816 else
4818 }
4822 }
4823 \f
4825 /* Subroutine of fold, looking inside expressions of the form
4826 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
4827 of the COND_EXPR. This function is being used also to optimize
4828 A op B ? C : A, by reversing the comparison first.
4830 Return a folded expression whose code is not a COND_EXPR
4831 anymore, or NULL_TREE if no folding opportunity is found. */
4833 static tree
4835 {
4840 tree tem;
4845 /* If we have A op 0 ? A : -A, consider applying the following
4846 transformations:
4848 A == 0? A : -A same as -A
4849 A != 0? A : -A same as A
4850 A >= 0? A : -A same as abs (A)
4851 A > 0? A : -A same as abs (A)
4852 A <= 0? A : -A same as -abs (A)
4853 A < 0? A : -A same as -abs (A)
4855 None of these transformations work for modes with signed
4856 zeros. If A is +/-0, the first two transformations will
4857 change the sign of the result (from +0 to -0, or vice
4858 versa). The last four will fix the sign of the result,
4859 even though the original expressions could be positive or
4860 negative, depending on the sign of A.
4862 Note that all these transformations are correct if A is
4863 NaN, since the two alternatives (A and -A) are also NaNs. */
4870 /* In the case that A is of the form X-Y, '-A' (arg2) may
4871 have already been folded to Y-X, check for that. */
4879 {
4891 /* Fall through. */
4913 }
4915 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
4916 A == 0 ? A : 0 is always 0 unless A is -0. Note that
4917 both transformations are correct when A is NaN: A != 0
4918 is then true, and A == 0 is false. */
4922 {
4927 }
4929 /* Try some transformations of A op B ? A : B.
4931 A == B? A : B same as B
4932 A != B? A : B same as A
4933 A >= B? A : B same as max (A, B)
4934 A > B? A : B same as max (B, A)
4935 A <= B? A : B same as min (A, B)
4936 A < B? A : B same as min (B, A)
4938 As above, these transformations don't work in the presence
4939 of signed zeros. For example, if A and B are zeros of
4940 opposite sign, the first two transformations will change
4941 the sign of the result. In the last four, the original
4942 expressions give different results for (A=+0, B=-0) and
4943 (A=-0, B=+0), but the transformed expressions do not.
4945 The first two transformations are correct if either A or B
4946 is a NaN. In the first transformation, the condition will
4947 be false, and B will indeed be chosen. In the case of the
4948 second transformation, the condition A != B will be true,
4949 and A will be chosen.
4951 The conversions to max() and min() are not correct if B is
4952 a number and A is not. The conditions in the original
4953 expressions will be false, so all four give B. The min()
4954 and max() versions would give a NaN instead. */
4957 /* Avoid these transformations if the COND_EXPR may be used
4958 as an lvalue in the C++ front-end. PR c++/19199. */
4959 && (in_gimple_form
4964 {
4969 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
4971 {
4975 }
4978 {
4987 /* In C++ a ?: expression can be an lvalue, so put the
4988 operand which will be used if they are equal first
4989 so that we can convert this back to the
4990 corresponding COND_EXPR. */
4992 {
4999 }
5006 {
5013 }
5026 }
5027 }
5029 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5030 we might still be able to simplify this. For example,
5031 if C1 is one less or one more than C2, this might have started
5032 out as a MIN or MAX and been transformed by this function.
5033 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5039 {
5041 /* We can replace A with C1 in this case. */
5046 /* If C1 is C2 + 1, this is min(A, C2). */
5048 OEP_ONLY_CONST)
5052 OEP_ONLY_CONST))
5054 type,
5056 arg2));
5060 /* If C1 is C2 - 1, this is min(A, C2). */
5062 OEP_ONLY_CONST)
5066 OEP_ONLY_CONST))
5068 type,
5070 arg2));
5074 /* If C1 is C2 - 1, this is max(A, C2). */
5076 OEP_ONLY_CONST)
5080 OEP_ONLY_CONST))
5082 type,
5084 arg2));
5088 /* If C1 is C2 + 1, this is max(A, C2). */
5090 OEP_ONLY_CONST)
5094 OEP_ONLY_CONST))
5096 type,
5098 arg2));
5104 }
5107 }
5110 \f
5111 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5112 #define LOGICAL_OP_NON_SHORT_CIRCUIT (BRANCH_COST >= 2)
5113 #endif
5115 /* EXP is some logical combination of boolean tests. See if we can
5116 merge it into some range test. Return the new tree if so. */
5118 static tree
5120 {
5128 tree tem;
5132 /* If this is an OR operation, invert both sides; we will invert
5133 again at the end. */
5137 /* If both expressions are the same, if we can merge the ranges, and we
5138 can build the range test, return it or it inverted. If one of the
5139 ranges is always true or always false, consider it to be the same
5140 expression as the other. */
5148 {
5152 }
5154 /* On machines where the branch cost is expensive, if this is a
5155 short-circuited branch and the underlying object on both sides
5156 is the same, make a non-short-circuit operation. */
5162 {
5163 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5164 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5165 which cases we can't do this. */
5173 {
5182 {
5185 WARN_STRICT_OVERFLOW_COMPARISON);
5189 }
5190 }
5191 }
5194 }
5195 \f
5196 /* Subroutine for fold_truthop: C is an INTEGER_CST interpreted as a P
5197 bit value. Arrange things so the extra bits will be set to zero if and
5198 only if C is signed-extended to its full width. If MASK is nonzero,
5199 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5201 static tree
5203 {
5206 tree temp;
5211 /* We work by getting just the sign bit into the low-order bit, then
5212 into the high-order bit, then sign-extend. We then XOR that value
5213 with C. */
5217 /* We must use a signed type in order to get an arithmetic right shift.
5218 However, we must also avoid introducing accidental overflows, so that
5219 a subsequent call to integer_zerop will work. Hence we must
5220 do the type conversion here. At this point, the constant is either
5221 zero or one, and the conversion to a signed type can never overflow.
5222 We could get an overflow if this conversion is done anywhere else. */
5231 /* If necessary, convert the type back to match the type of C. */
5236 }
5237 \f
5238 /* Find ways of folding logical expressions of LHS and RHS:
5239 Try to merge two comparisons to the same innermost item.
5240 Look for range tests like "ch >= '0' && ch <= '9'".
5241 Look for combinations of simple terms on machines with expensive branches
5242 and evaluate the RHS unconditionally.
5244 For example, if we have p->a == 2 && p->b == 4 and we can make an
5245 object large enough to span both A and B, we can do this with a comparison
5246 against the object ANDed with the a mask.
5248 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5249 operations to do this with one comparison.
5251 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5252 function and the one above.
5254 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5255 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5257 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5258 two operands.
5260 We return the simplified tree or 0 if no optimization is possible. */
5262 static tree
5264 {
5265 /* If this is the "or" of two comparisons, we can do something if
5266 the comparisons are NE_EXPR. If this is the "and", we can do something
5267 if the comparisons are EQ_EXPR. I.e.,
5268 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5270 WANTED_CODE is this operation code. For single bit fields, we can
5271 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5272 comparison for one-bit fields. */
5294 /* Start by getting the comparison codes. Fail if anything is volatile.
5295 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5296 it were surrounded with a NE_EXPR. */
5305 {
5309 }
5312 {
5316 }
5327 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5330 {
5331 tree result;
5334 {
5339 }
5342 {
5348 }
5349 }
5354 /* If the RHS can be evaluated unconditionally and its operands are
5355 simple, it wins to evaluate the RHS unconditionally on machines
5356 with expensive branches. In this case, this isn't a comparison
5357 that can be merged. Avoid doing this if the RHS is a floating-point
5358 comparison since those can trap. */
5364 {
5365 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5376 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5388 {
5392 }
5393 }
5395 /* See if the comparisons can be merged. Then get all the parameters for
5396 each side. */
5420 /* It must be true that the inner operation on the lhs of each
5421 comparison must be the same if we are to be able to do anything.
5422 Then see if we have constants. If not, the same must be true for
5423 the rhs's. */
5434 else
5437 /* If either comparison code is not correct for our logical operation,
5438 fail. However, we can convert a one-bit comparison against zero into
5439 the opposite comparison against that bit being set in the field. */
5443 {
5445 {
5446 /* Make the left operand unsigned, since we are only interested
5447 in the value of one bit. Otherwise we are doing the wrong
5448 thing below. */
5451 }
5452 else
5454 }
5456 /* This is analogous to the code for l_const above. */
5458 {
5460 {
5463 }
5464 else
5466 }
5468 /* See if we can find a mode that contains both fields being compared on
5469 the left. If we can't, fail. Otherwise, update all constants and masks
5470 to be relative to a field of that size. */
5475 volatilep);
5485 {
5488 }
5496 {
5504 {
5508 }
5509 }
5511 {
5519 {
5523 }
5524 }
5526 /* Handle the case of comparisons with constants. If there is something in
5527 common between the masks, those bits of the constants must be the same.
5528 If not, the condition is always false. Test for this to avoid generating
5529 incorrect code below. */
5534 {
5536 {
5539 }
5540 else
5541 {
5544 }
5545 }
5548 }
5549 \f
5550 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
5551 constant. */
5553 static tree
5555 {
5558 tree comp_const;
5559 tree minmax_const;
5561 tree inner;
5572 /* If something does not permit us to optimize, return the original tree. */
5580 /* Now handle all the various comparison codes. We only handle EQ_EXPR
5581 and GT_EXPR, doing the rest with recursive calls using logical
5582 simplifications. */
5584 {
5586 {
5592 }
5595 return
5597 optimize_minmax_comparison
5599 optimize_minmax_comparison
5604 /* MAX (X, 0) == 0 -> X <= 0 */
5608 /* MAX (X, 0) == 5 -> X == 5 */
5612 /* MAX (X, 0) == -1 -> false */
5616 /* MIN (X, 0) == 0 -> X >= 0 */
5620 /* MIN (X, 0) == 5 -> false */
5623 else
5624 /* MIN (X, 0) == -1 -> X == -1 */
5629 /* MAX (X, 0) > 0 -> X > 0
5630 MAX (X, 0) > 5 -> X > 5 */
5634 /* MAX (X, 0) > -1 -> true */
5638 /* MIN (X, 0) > 0 -> false
5639 MIN (X, 0) > 5 -> false */
5642 else
5643 /* MIN (X, 0) > -1 -> X > -1 */
5648 }
5649 }
5650 \f
5651 /* T is an integer expression that is being multiplied, divided, or taken a
5652 modulus (CODE says which and what kind of divide or modulus) by a
5653 constant C. See if we can eliminate that operation by folding it with
5654 other operations already in T. WIDE_TYPE, if non-null, is a type that
5655 should be used for the computation if wider than our type.
5657 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5658 (X * 2) + (Y * 4). We must, however, be assured that either the original
5659 expression would not overflow or that overflow is undefined for the type
5660 in the language in question.
5662 We also canonicalize (X + 7) * 4 into X * 4 + 28 in the hope that either
5663 the machine has a multiply-accumulate insn or that this is part of an
5664 addressing calculation.
5666 If we return a non-null expression, it is an equivalent form of the
5667 original computation, but need not be in the original type.
5669 We set *STRICT_OVERFLOW_P to true if the return values depends on
5670 signed overflow being undefined. Otherwise we do not change
5671 *STRICT_OVERFLOW_P. */
5673 static tree
5676 {
5677 /* To avoid exponential search depth, refuse to allow recursion past
5678 three levels. Beyond that (1) it's highly unlikely that we'll find
5679 something interesting and (2) we've probably processed it before
5680 when we built the inner expression. */
5683 tree ret;
5688 depth++;
5690 depth--;
5693 }
5695 static tree
5698 {
5709 /* Don't deal with constants of zero here; they confuse the code below. */
5719 /* Note that we need not handle conditional operations here since fold
5720 already handles those cases. So just do arithmetic here. */
5722 {
5724 /* For a constant, we can always simplify if we are a multiply
5725 or (for divide and modulus) if it is a multiple of our constant. */
5733 /* If op0 is an expression ... */
5739 /* ... and has wrapping overflow, and its type is smaller
5740 than ctype, then we cannot pass through as widening. */
5746 /* ... or this is a truncation (t is narrower than op0),
5747 then we cannot pass through this narrowing. */
5750 /* ... or signedness changes for division or modulus,
5751 then we cannot pass through this conversion. */
5755 /* ... or has undefined overflow while the converted to
5756 type has not, we cannot do the operation in the inner type
5757 as that would introduce undefined overflow. */
5762 /* Pass the constant down and see if we can make a simplification. If
5763 we can, replace this expression with the inner simplification for
5764 possible later conversion to our or some other type. */
5769 code == MULT_EXPR
5771 strict_overflow_p))))
5776 /* If widening the type changes it from signed to unsigned, then we
5777 must avoid building ABS_EXPR itself as unsigned. */
5779 {
5783 {
5786 }
5788 }
5789 /* If the constant is negative, we cannot simplify this. */
5792 /* FALLTHROUGH */
5800 /* If widening the type changes the signedness, then we can't perform
5801 this optimization as that changes the result. */
5805 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
5811 {
5818 }
5822 /* If the second operand is constant, this is a multiplication
5823 or floor division, by a power of two, so we can treat it that
5824 way unless the multiplier or divisor overflows. Signed
5825 left-shift overflow is implementation-defined rather than
5826 undefined in C90, so do not convert signed left shift into
5827 multiplication. */
5830 /* const_binop may not detect overflow correctly,
5831 so check for it explicitly here. */
5836 size_one_node,
5846 /* See if we can eliminate the operation on both sides. If we can, we
5847 can return a new PLUS or MINUS. If we can't, the only remaining
5848 cases where we can do anything are if the second operand is a
5849 constant. */
5855 /* If not multiplication, we can only do this if both operands
5856 are divisible by c. */
5859 {
5864 }
5866 /* If this was a subtraction, negate OP1 and set it to be an addition.
5867 This simplifies the logic below. */
5874 /* If either OP1 or C are negative, this optimization is not safe for
5875 some of the division and remainder types while for others we need
5876 to change the code. */
5878 {
5886 }
5888 /* If it's a multiply or a division/modulus operation of a multiple
5889 of our constant, do the operation and verify it doesn't overflow. */
5892 {
5895 /* We allow the constant to overflow with wrapping semantics. */
5899 }
5900 else
5903 /* If we have an unsigned type is not a sizetype, we cannot widen
5904 the operation since it will change the result if the original
5905 computation overflowed. */
5911 /* If we were able to eliminate our operation from the first side,
5912 apply our operation to the second side and reform the PLUS. */
5916 /* The last case is if we are a multiply. In that case, we can
5917 apply the distributive law to commute the multiply and addition
5918 if the multiplication of the constants doesn't overflow. */
5924 op1);
5929 /* We have a special case here if we are doing something like
5930 (C * 8) % 4 since we know that's zero. */
5937 /* ... fall through ... */
5941 /* If we can extract our operation from the LHS, do so and return a
5942 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
5943 do something only if the second operand is a constant. */
5957 /* If these are the same operation types, we can associate them
5958 assuming no overflow. */
5970 /* If these operations "cancel" each other, we have the main
5971 optimizations of this pass, which occur when either constant is a
5972 multiple of the other, in which case we replace this with either an
5973 operation or CODE or TCODE.
5975 If we have an unsigned type that is not a sizetype, we cannot do
5976 this since it will change the result if the original computation
5977 overflowed. */
5985 {
5987 {
5994 }
5996 {
6003 }
6004 }
6009 }
6012 }
6013 \f
6014 /* Return a node which has the indicated constant VALUE (either 0 or
6015 1), and is of the indicated TYPE. */
6017 tree
6019 {
6024 else
6026 }
6029 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6030 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6031 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6032 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6033 COND is the first argument to CODE; otherwise (as in the example
6034 given here), it is the second argument. TYPE is the type of the
6035 original expression. Return NULL_TREE if no simplification is
6036 possible. */
6038 static tree
6042 {
6049 /* This transformation is only worthwhile if we don't have to wrap
6050 arg in a SAVE_EXPR, and the operation can be simplified on at least
6051 one of the branches once its pushed inside the COND_EXPR. */
6056 {
6060 /* If this operand throws an expression, then it does not make
6061 sense to try to perform a logical or arithmetic operation
6062 involving it. */
6067 }
6068 else
6069 {
6074 }
6078 {
6082 else
6084 }
6086 {
6090 else
6092 }
6096 }
6098 \f
6099 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6101 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6102 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6103 ADDEND is the same as X.
6105 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6106 and finite. The problematic cases are when X is zero, and its mode
6107 has signed zeros. In the case of rounding towards -infinity,
6108 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6109 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6111 bool
6113 {
6117 /* Don't allow the fold with -fsignaling-nans. */
6121 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6125 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6130 /* The mode has signed zeros, and we have to honor their sign.
6131 In this situation, there is only one case we can return true for.
6132 X - 0 is the same as X unless rounding towards -infinity is
6133 supported. */
6135 }
6137 /* Subroutine of fold() that checks comparisons of built-in math
6138 functions against real constants.
6140 FCODE is the DECL_FUNCTION_CODE of the built-in, CODE is the comparison
6141 operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR, GE_EXPR or LE_EXPR. TYPE
6142 is the type of the result and ARG0 and ARG1 are the operands of the
6143 comparison. ARG1 must be a TREE_REAL_CST.
6145 The function returns the constant folded tree if a simplification
6146 can be made, and NULL_TREE otherwise. */
6148 static tree
6151 {
6152 REAL_VALUE_TYPE c;
6155 {
6161 {
6162 /* sqrt(x) < y is always false, if y is negative. */
6166 /* sqrt(x) > y is always true, if y is negative and we
6167 don't care about NaNs, i.e. negative values of x. */
6171 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
6174 }
6176 {
6177 REAL_VALUE_TYPE c2;
6183 {
6184 /* sqrt(x) > y is x == +Inf, when y is very large. */
6189 /* sqrt(x) > y is always false, when y is very large
6190 and we don't care about infinities. */
6192 }
6194 /* sqrt(x) > c is the same as x > c*c. */
6197 }
6199 {
6200 REAL_VALUE_TYPE c2;
6206 {
6207 /* sqrt(x) < y is always true, when y is a very large
6208 value and we don't care about NaNs or Infinities. */
6212 /* sqrt(x) < y is x != +Inf when y is very large and we
6213 don't care about NaNs. */
6218 /* sqrt(x) < y is x >= 0 when y is very large and we
6219 don't care about Infinities. */
6224 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
6233 dconst0)),
6236 c2)));
6237 }
6239 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
6244 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
6247 {
6252 dconst0)),
6255 c2)));
6256 }
6257 }
6258 }
6261 }
6263 /* Subroutine of fold() that optimizes comparisons against Infinities,
6264 either +Inf or -Inf.
6266 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6267 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6268 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6270 The function returns the constant folded tree if a simplification
6271 can be made, and NULL_TREE otherwise. */
6273 static tree
6275 {
6277 REAL_VALUE_TYPE max;
6278 tree temp;
6283 /* For negative infinity swap the sense of the comparison. */
6289 {
6291 /* x > +Inf is always false, if with ignore sNANs. */
6297 /* x <= +Inf is always true, if we don't case about NaNs. */
6301 /* x <= +Inf is the same as x == x, i.e. isfinite(x). */
6304 {
6307 }
6312 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */
6318 /* x < +Inf is always equal to x <= DBL_MAX. */
6324 /* x != +Inf is always equal to !(x > DBL_MAX). */
6336 }
6339 }
6341 /* Subroutine of fold() that optimizes comparisons of a division by
6342 a nonzero integer constant against an integer constant, i.e.
6343 X/C1 op C2.
6345 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6346 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6347 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6349 The function returns the constant folded tree if a simplification
6350 can be made, and NULL_TREE otherwise. */
6352 static tree
6354 {
6359 HOST_WIDE_INT hpart;
6364 /* We have to do this the hard way to detect unsigned overflow.
6365 prod = int_const_binop (MULT_EXPR, arg01, arg1, 0); */
6376 {
6381 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp, 0). */
6389 }
6391 {
6395 {
6414 }
6415 }
6416 else
6417 {
6418 /* A negative divisor reverses the relational operators. */
6424 {
6443 }
6444 }
6447 {
6468 {
6471 }
6476 {
6479 }
6484 {
6487 }
6492 {
6495 }
6500 }
6503 }
6506 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6507 equality/inequality test, then return a simplified form of the test
6508 using a sign testing. Otherwise return NULL. TYPE is the desired
6509 result type. */
6511 static tree
6513 tree result_type)
6514 {
6515 /* If this is testing a single bit, we can optimize the test. */
6519 {
6520 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6521 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6525 /* This is only a win if casting to a signed type is cheap,
6526 i.e. when arg00's type is not a partial mode. */
6529 {
6534 }
6535 }
6538 }
6540 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6541 equality/inequality test, then return a simplified form of
6542 the test using shifts and logical operations. Otherwise return
6543 NULL. TYPE is the desired result type. */
6545 tree
6547 tree result_type)
6548 {
6549 /* If this is testing a single bit, we can optimize the test. */
6553 {
6562 /* First, see if we can fold the single bit test into a sign-bit
6563 test. */
6565 result_type);
6569 /* Otherwise we have (A & C) != 0 where C is a single bit,
6570 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6571 Similarly for (A & C) == 0. */
6573 /* If INNER is a right shift of a constant and it plus BITNUM does
6574 not overflow, adjust BITNUM and INNER. */
6581 {
6584 }
6586 /* If we are going to be able to omit the AND below, we must do our
6587 operations as unsigned. If we must use the AND, we have a choice.
6588 Normally unsigned is faster, but for some machines signed is. */
6589 #ifdef LOAD_EXTEND_OP
6592 #else
6594 #endif
6610 /* Put the AND last so it can combine with more things. */
6613 /* Make sure to return the proper type. */
6617 }
6619 }
6621 /* Check whether we are allowed to reorder operands arg0 and arg1,
6622 such that the evaluation of arg1 occurs before arg0. */
6624 static bool
6626 {
6633 }
6635 /* Test whether it is preferable two swap two operands, ARG0 and
6636 ARG1, for example because ARG0 is an integer constant and ARG1
6637 isn't. If REORDER is true, only recommend swapping if we can
6638 evaluate the operands in reverse order. */
6640 bool
6642 {
6678 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6679 for commutative and comparison operators. Ensuring a canonical
6680 form allows the optimizers to find additional redundancies without
6681 having to explicitly check for both orderings. */
6687 /* Put SSA_NAMEs last. */
6693 /* Put variables last. */
6700 }
6702 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where
6703 ARG0 is extended to a wider type. */
6705 static tree
6707 {
6709 tree arg1_unw;
6718 #ifdef HAVE_canonicalize_funcptr_for_compare
6719 /* Disable this optimization if we're casting a function pointer
6720 type on targets that require function pointer canonicalization. */
6725 #endif
6732 /* If possible, express the comparison in the shorter mode. */
6754 /* If we are comparing with the integer that does not fit into the range
6755 of the shorter type, the result is known. */
6766 {
6793 }
6796 }
6798 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where for
6799 ARG0 just the signedness is changed. */
6801 static tree
6804 {
6805 tree arg0_inner;
6815 #ifdef HAVE_canonicalize_funcptr_for_compare
6816 /* Disable this optimization if we're casting a function pointer
6817 type on targets that require function pointer canonicalization. */
6822 #endif
6827 /* If the conversion is from an integral subtype to its basetype
6828 leave it alone. */
6847 else
6851 }
6853 /* Tries to replace &a[idx] p+ s * delta with &a[idx + delta], if s is
6854 step of the array. Reconstructs s and delta in the case of s * delta
6855 being an integer constant (and thus already folded).
6856 ADDR is the address. MULT is the multiplicative expression.
6857 If the function succeeds, the new address expression is returned. Otherwise
6858 NULL_TREE is returned. */
6860 static tree
6862 {
6866 tree itype;
6869 /* Strip the nops that might be added when converting op1 to sizetype. */
6872 /* Canonicalize op1 into a possibly non-constant delta
6873 and an INTEGER_CST s. */
6875 {
6882 {
6885 }
6887 {
6890 }
6891 else
6893 }
6895 {
6898 }
6899 else
6900 {
6901 /* Simulate we are delta * 1. */
6904 }
6907 {
6909 {
6910 /* Remember if this was a multi-dimensional array. */
6923 {
6926 }
6927 else
6928 {
6929 /* Try if delta is a multiple of step. */
6934 }
6936 /* Only fold here if we can verify we do not overflow one
6937 dimension of a multi-dimensional array. */
6939 {
6940 tree tmp;
6956 }
6959 }
6960 else
6965 }
6967 /* We found the suitable array reference. So copy everything up to it,
6968 and replace the index. */
6975 {
6979 }
6987 }
6990 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6991 means A >= Y && A != MAX, but in this case we know that
6992 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6994 static tree
6996 {
7003 else
7012 {
7015 }
7017 {
7020 }
7021 else
7028 {
7029 /* Convert the pointer types into integer before taking the difference. */
7033 }
7034 else
7041 }
7043 /* Fold a sum or difference of at least one multiplication.
7044 Returns the folded tree or NULL if no simplification could be made. */
7046 static tree
7048 {
7052 /* (A * C) +- (B * C) -> (A+-B) * C.
7053 (A * C) +- A -> A * (C+-1).
7054 We are most concerned about the case where C is a constant,
7055 but other combinations show up during loop reduction. Since
7056 it is not difficult, try all four possibilities. */
7059 {
7062 }
7064 {
7067 }
7068 else
7069 {
7070 /* We cannot generate constant 1 for fract. */
7075 }
7077 {
7080 }
7082 {
7085 }
7086 else
7087 {
7088 /* We cannot generate constant 1 for fract. */
7093 }
7105 /* No identical multiplicands; see if we can find a common
7106 power-of-two factor in non-power-of-two multiplies. This
7107 can help in multi-dimensional array access. */
7110 {
7113 tree maybe_same;
7117 /* Move min of absolute values to int11. */
7120 {
7125 }
7126 else
7130 {
7138 }
7139 }
7149 }
7151 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7152 specified by EXPR into the buffer PTR of length LEN bytes.
7153 Return the number of bytes placed in the buffer, or zero
7154 upon failure. */
7156 static int
7158 {
7169 {
7173 else
7178 {
7185 else
7187 }
7188 else
7191 }
7193 }
7196 /* Subroutine of native_encode_expr. Encode the REAL_CST
7197 specified by EXPR into the buffer PTR of length LEN bytes.
7198 Return the number of bytes placed in the buffer, or zero
7199 upon failure. */
7201 static int
7203 {
7209 /* There are always 32 bits in each long, no matter the size of
7210 the hosts long. We handle floating point representations with
7211 up to 192 bits. */
7222 {
7227 {
7234 else
7236 }
7237 else
7240 }
7242 }
7244 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7245 specified by EXPR into the buffer PTR of length LEN bytes.
7246 Return the number of bytes placed in the buffer, or zero
7247 upon failure. */
7249 static int
7251 {
7253 tree part;
7264 }
7267 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7268 specified by EXPR into the buffer PTR of length LEN bytes.
7269 Return the number of bytes placed in the buffer, or zero
7270 upon failure. */
7272 static int
7274 {
7284 {
7286 {
7289 }
7290 else
7294 {
7297 }
7298 else
7299 {
7303 }
7305 }
7307 }
7310 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7311 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7312 buffer PTR of length LEN bytes. Return the number of bytes
7313 placed in the buffer, or zero upon failure. */
7315 int
7317 {
7319 {
7334 }
7335 }
7338 /* Subroutine of native_interpret_expr. Interpret the contents of
7339 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7340 If the buffer cannot be interpreted, return NULL_TREE. */
7342 static tree
7344 {
7358 {
7361 {
7368 else
7370 }
7371 else
7377 else
7380 }
7383 }
7386 /* Subroutine of native_interpret_expr. Interpret the contents of
7387 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7388 If the buffer cannot be interpreted, return NULL_TREE. */
7390 static tree
7392 {
7397 /* There are always 32 bits in each long, no matter the size of
7398 the hosts long. We handle floating point representations with
7399 up to 192 bits. */
7400 REAL_VALUE_TYPE r;
7411 {
7414 {
7421 else
7423 }
7424 else
7429 }
7433 }
7436 /* Subroutine of native_interpret_expr. Interpret the contents of
7437 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7438 If the buffer cannot be interpreted, return NULL_TREE. */
7440 static tree
7442 {
7457 }
7460 /* Subroutine of native_interpret_expr. Interpret the contents of
7461 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7462 If the buffer cannot be interpreted, return NULL_TREE. */
7464 static tree
7466 {
7478 {
7483 }
7485 }
7488 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7489 the buffer PTR of length LEN as a constant of type TYPE. For
7490 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7491 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7492 return NULL_TREE. */
7494 tree
7496 {
7498 {
7515 }
7516 }
7519 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7520 TYPE at compile-time. If we're unable to perform the conversion
7521 return NULL_TREE. */
7523 static tree
7525 {
7526 /* We support up to 512-bit values (for V8DFmode). */
7530 /* Check that the host and target are sane. */
7539 }
7541 /* Build an expression for the address of T. Folds away INDIRECT_REF
7542 to avoid confusing the gimplify process. When IN_FOLD is true
7543 avoid modifications of T. */
7545 static tree
7547 {
7548 /* The size of the object is not relevant when talking about its address. */
7552 /* Note: doesn't apply to ALIGN_INDIRECT_REF */
7555 {
7560 }
7562 {
7572 }
7573 else
7577 }
7579 /* Build an expression for the address of T with type PTRTYPE. This
7580 function modifies the input parameter 'T' by sometimes setting the
7581 TREE_ADDRESSABLE flag. */
7583 tree
7585 {
7587 }
7589 /* Build an expression for the address of T. This function modifies
7590 the input parameter 'T' by sometimes setting the TREE_ADDRESSABLE
7591 flag. When called from fold functions, use fold_addr_expr instead. */
7593 tree
7595 {
7599 }
7601 /* Same as build_fold_addr_expr, builds an expression for the address
7602 of T, but avoids touching the input node 't'. Fold functions
7603 should use this version. */
7605 static tree
7607 {
7611 }
7613 /* Fold a unary expression of code CODE and type TYPE with operand
7614 OP0. Return the folded expression if folding is successful.
7615 Otherwise, return NULL_TREE. */
7617 tree
7619 {
7620 tree tem;
7621 tree arg0;
7629 {
7632 {
7633 /* Don't use STRIP_NOPS, because signedness of argument type
7634 matters. */
7636 }
7637 else
7638 {
7639 /* Strip any conversions that don't change the mode. This
7640 is safe for every expression, except for a comparison
7641 expression because its signedness is derived from its
7642 operands.
7644 Note that this is done as an internal manipulation within
7645 the constant folder, in order to find the simplest
7646 representation of the arguments so that their form can be
7647 studied. In any cases, the appropriate type conversions
7648 should be put back in the tree that will get out of the
7649 constant folder. */
7651 }
7652 }
7655 {
7660 {
7670 /* If this was a conversion, and all we did was to move into
7671 inside the COND_EXPR, bring it back out. But leave it if
7672 it is a conversion from integer to integer and the
7673 result precision is no wider than a word since such a
7674 conversion is cheap and may be optimized away by combine,
7675 while it couldn't if it were outside the COND_EXPR. Then return
7676 so we don't get into an infinite recursion loop taking the
7677 conversion out and then back in. */
7689 && (INTEGRAL_TYPE_P
7701 }
7703 {
7705 {
7709 }
7713 integer_one_node),
7715 integer_zero_node));
7716 }
7717 }
7720 {
7722 /* Re-association barriers around constants and other re-association
7723 barriers can be removed. */
7729 CASE_CONVERT:
7735 /* If we have (type) (a CMP b) and type is an integral type, return
7736 new expression involving the new type. */
7741 /* Handle cases of two conversions in a row. */
7743 {
7765 /* In addition to the cases of two conversions in a row
7766 handled below, if we are converting something to its own
7767 type via an object of identical or wider precision, neither
7768 conversion is needed. */
7775 /* Likewise, if the intermediate and final types are either both
7776 float or both integer, we don't need the middle conversion if
7777 it is wider than the final type and doesn't change the signedness
7778 (for integers). Avoid this if the final type is a pointer
7779 since then we sometimes need the inner conversion. Likewise if
7780 the outer has a precision not equal to the size of its mode. */
7789 && ! final_ptr
7793 /* If we have a sign-extension of a zero-extended value, we can
7794 replace that by a single zero-extension. */
7800 /* Two conversions in a row are not needed unless:
7801 - some conversion is floating-point (overstrict for now), or
7802 - some conversion is a vector (overstrict for now), or
7803 - the intermediate type is narrower than both initial and
7804 final, or
7805 - the intermediate type and innermost type differ in signedness,
7806 and the outermost type is wider than the intermediate, or
7807 - the initial type is a pointer type and the precisions of the
7808 intermediate and final types differ, or
7809 - the final type is a pointer type and the precisions of the
7810 initial and intermediate types differ. */
7824 }
7826 /* Handle (T *)&A.B.C for A being of type T and B and C
7827 living at offset zero. This occurs frequently in
7828 C++ upcasting and then accessing the base. */
7832 {
7834 tree offset;
7840 /* If the reference was to a (constant) zero offset, we can use
7841 the address of the base if it has the same base type
7842 as the result type. */
7847 }
7852 /* Detect assigning a bitfield. */
7854 && DECL_BIT_FIELD
7856 {
7857 /* Don't leave an assignment inside a conversion
7858 unless assigning a bitfield. */
7860 /* First do the assignment, then return converted constant. */
7865 }
7867 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7868 constants (if x has signed type, the sign bit cannot be set
7869 in c). This folds extension into the BIT_AND_EXPR.
7870 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7871 very likely don't have maximal range for their precision and this
7872 transformation effectively doesn't preserve non-maximal ranges. */
7876 {
7886 <= HOST_BITS_PER_WIDE_INT
7888 {
7895 #ifdef LOAD_EXTEND_OP
7897 && !flag_syntax_only
7900 {
7904 }
7905 #endif
7906 }
7908 {
7914 }
7915 }
7917 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type,
7918 when one of the new casts will fold away. Conservatively we assume
7919 that this happens when X or Y is NOP_EXPR or Y is INTEGER_CST. */
7925 {
7931 }
7933 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7934 of the same precision, and X is an integer type not narrower than
7935 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7941 {
7946 }
7948 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7949 type of X and Y (integer types only). */
7954 {
7955 /* Be careful not to introduce new overflows. */
7956 tree mult_type;
7959 else
7966 }
7981 /* For integral conversions with the same precision or pointer
7982 conversions use a NOP_EXPR instead. */
7988 /* Do not muck with VIEW_CONVERT_EXPRs that convert from
7989 a sub-type to its base type as generated by the Ada FE. */
7994 /* Strip inner integral conversions that do not change the precision. */
8017 /* Convert fabs((double)float) into (double)fabsf(float). */
8020 {
8025 targ0));
8026 }
8027 /* ABS_EXPR<ABS_EXPR<x>> = ABS_EXPR<x> even if flag_wrapv is on. */
8033 /* Strip sign ops from argument. */
8035 {
8039 }
8046 {
8051 }
8053 {
8058 }
8068 /* Convert ~ (-A) to A - 1. */
8073 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
8081 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8094 /* Perform BIT_NOT_EXPR on each element individually. */
8096 {
8101 {
8103 {
8109 }
8110 else
8113 }
8116 }
8121 /* The argument to invert_truthvalue must have Boolean type. */
8125 /* Note that the operand of this must be an int
8126 and its values must be 0 or 1.
8127 ("true" is a fixed value perhaps depending on the language,
8128 but we don't handle values other than 1 correctly yet.) */
8143 {
8151 }
8153 {
8157 }
8159 {
8163 {
8172 }
8173 }
8185 {
8193 }
8195 {
8199 }
8201 {
8205 {
8214 }
8215 }
8221 }
8223 /* Fold a binary expression of code CODE and type TYPE with operands
8224 OP0 and OP1, containing either a MIN-MAX or a MAX-MIN combination.
8225 Return the folded expression if folding is successful. Otherwise,
8226 return NULL_TREE. */
8228 static tree
8230 {
8237 else
8240 /* MIN (MAX (a, b), b) == b. */
8245 /* MIN (MAX (b, a), b) == b. */
8251 /* MIN (a, MAX (a, b)) == a. */
8257 /* MIN (a, MAX (b, a)) == a. */
8264 }
8266 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8267 by changing CODE to reduce the magnitude of constants involved in
8268 ARG0 of the comparison.
8269 Returns a canonicalized comparison tree if a simplification was
8270 possible, otherwise returns NULL_TREE.
8271 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8272 valid if signed overflow is undefined. */
8274 static tree
8278 {
8284 /* Match A +- CST code arg1 and CST code arg1. */
8291 /* Identify the constant in arg0 and its sign. */
8294 else
8298 /* Overflowed constants and zero will cause problems. */
8303 /* See if we can reduce the magnitude of the constant in
8304 arg0 by changing the comparison code. */
8306 {
8307 /* CST <= arg1 -> CST-1 < arg1. */
8310 /* -CST < arg1 -> -CST-1 <= arg1. */
8313 /* CST > arg1 -> CST-1 >= arg1. */
8316 /* -CST >= arg1 -> -CST-1 > arg1. */
8319 else
8321 /* arg1 code' CST' might be more canonical. */
8323 }
8324 else
8325 {
8326 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8330 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8334 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8338 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8342 else
8345 }
8347 /* Now build the constant reduced in magnitude. */
8353 /* If swapping might yield to a more canonical form, do so. */
8356 else
8358 }
8360 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8361 overflow further. Try to decrease the magnitude of constants involved
8362 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8363 and put sole constants at the second argument position.
8364 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8366 static tree
8369 {
8370 tree t;
8375 /* In principle pointers also have undefined overflow behavior,
8376 but that causes problems elsewhere. */
8381 /* Try canonicalization by simplifying arg0. */
8386 {
8390 }
8392 /* Try canonicalization by simplifying arg1 using the swapped
8393 comparison. */
8401 }
8403 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8404 space. This is used to avoid issuing overflow warnings for
8405 expressions like &p->x which can not wrap. */
8407 static bool
8409 {
8420 {
8423 }
8426 else
8427 {
8430 }
8445 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8446 array. */
8448 {
8449 HOST_WIDE_INT base_size;
8454 }
8457 }
8459 /* Subroutine of fold_binary. This routine performs all of the
8460 transformations that are common to the equality/inequality
8461 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8462 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8463 fold_binary should call fold_binary. Fold a comparison with
8464 tree code CODE and type TYPE with operands OP0 and OP1. Return
8465 the folded comparison or NULL_TREE. */
8467 static tree
8469 {
8482 /* If one arg is a real or integer constant, put it last. */
8486 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 +- C1. */
8493 {
8497 tree lhs;
8504 /* If the constant operation overflowed this can be
8505 simplified as a comparison against INT_MAX/INT_MIN. */
8508 {
8512 /* Get the sign of the constant on the lhs if the
8513 operation were VARIABLE + CONST1. */
8517 /* The sign of the constant determines if we overflowed
8518 INT_MAX (const1_sgn == -1) or INT_MIN (const1_sgn == 1).
8519 Canonicalize to the INT_MIN overflow by swapping the comparison
8520 if necessary. */
8524 /* We now can look at the canonicalized case
8525 VARIABLE + 1 CODE2 INT_MIN
8526 and decide on the result. */
8535 }
8540 {
8542 "when changing X +- C1 cmp C2 to "
8544 WARN_STRICT_OVERFLOW_COMPARISON);
8546 }
8547 }
8549 /* For comparisons of pointers we can decompose it to a compile time
8550 comparison of the base objects and the offsets into the object.
8551 This requires at least one operand being an ADDR_EXPR or a
8552 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8558 {
8565 /* Get base and offset for the access. Strip ADDR_EXPR for
8566 get_inner_reference, but put it back by stripping INDIRECT_REF
8567 off the base object if possible. indirect_baseN will be true
8568 if baseN is not an address but refers to the object itself. */
8571 {
8577 else
8579 }
8581 {
8584 }
8588 {
8594 else
8596 }
8598 {
8601 }
8603 /* If we have equivalent bases we might be able to simplify. */
8606 {
8607 /* We can fold this expression to a constant if the non-constant
8608 offset parts are equal. */
8616 {
8623 "occur when comparing P +- C1 with "
8625 WARN_STRICT_OVERFLOW_CONDITIONAL);
8628 {
8642 }
8643 }
8644 /* We can simplify the comparison to a comparison of the variable
8645 offset parts if the constant offset parts are equal.
8646 Be careful to use signed size type here because otherwise we
8647 mess with array offsets in the wrong way. This is possible
8648 because pointer arithmetic is restricted to retain within an
8649 object and overflow on pointer differences is undefined as of
8650 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8654 {
8655 tree signed_size_type_node;
8658 /* By converting to signed size type we cover middle-end pointer
8659 arithmetic which operates on unsigned pointer types of size
8660 type size and ARRAY_REF offsets which are properly sign or
8661 zero extended from their type in case it is narrower than
8662 size type. */
8665 else
8669 else
8677 "occur when comparing P +- C1 with "
8679 WARN_STRICT_OVERFLOW_COMPARISON);
8682 }
8683 }
8684 /* For non-equal bases we can simplify if they are addresses
8685 of local binding decls or constants. */
8687 /* We know that !operand_equal_p (base0, base1, 0)
8688 because the if condition was false. But make
8689 sure two decls are not the same. */
8703 {
8708 }
8709 /* For equal offsets we can simplify to a comparison of the
8710 base addresses. */
8712 && (indirect_base0
8714 && (indirect_base1
8719 {
8725 }
8726 }
8728 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8729 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8730 the resulting offset is smaller in absolute value than the
8731 original one. */
8739 {
8744 tree cst;
8746 "occur when combining constants around "
8749 /* Put the constant on the side where it doesn't overflow and is
8750 of lower absolute value than before. */
8756 {
8759 variable1,
8762 }
8769 {
8774 variable2);
8775 }
8776 }
8778 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
8779 signed arithmetic case. That form is created by the compiler
8780 often enough for folding it to be of value. One example is in
8781 computing loop trip counts after Operator Strength Reduction. */
8787 {
8796 "eliminating multiplication in comparison "
8798 WARN_STRICT_OVERFLOW_COMPARISON);
8800 /* If const1 is negative we swap the sense of the comparison. */
8805 }
8812 {
8820 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
8825 /* (-a) CMP (-b) -> b CMP a */
8832 {
8833 REAL_VALUE_TYPE cst;
8836 /* (-a) CMP CST -> a swap(CMP) (-CST) */
8843 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
8844 /* a CMP (-0) -> a CMP 0 */
8849 /* x != NaN is always true, other ops are always false. */
8852 {
8855 }
8857 /* Fold comparisons against infinity. */
8859 {
8863 }
8864 }
8866 /* If this is a comparison of a real constant with a PLUS_EXPR
8867 or a MINUS_EXPR of a real constant, we can convert it into a
8868 comparison with a revised real constant as long as no overflow
8869 occurs when unsafe_math_optimizations are enabled. */
8881 /* Likewise, we can simplify a comparison of a real constant with
8882 a MINUS_EXPR whose first operand is also a real constant, i.e.
8883 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
8884 floating-point types only if -fassociative-math is set. */
8895 /* Fold comparisons against built-in math functions. */
8897 && flag_unsafe_math_optimizations
8899 {
8903 {
8907 }
8908 }
8909 }
8913 {
8914 /* If we are widening one operand of an integer comparison,
8915 see if the other operand is similarly being widened. Perhaps we
8916 can do the comparison in the narrower type. */
8921 /* Or if we are changing signedness. */
8925 }
8927 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
8928 constant, we can simplify it. */
8933 {
8937 }
8939 /* Simplify comparison of something with itself. (For IEEE
8940 floating-point, we can only do some of these simplifications.) */
8942 {
8944 {
8959 /* For NE, we can only do this simplification if integer
8960 or we don't honor IEEE floating point NaNs. */
8964 /* ... fall through ... */
8970 }
8971 }
8973 /* If we are comparing an expression that just has comparisons
8974 of two integer values, arithmetic expressions of those comparisons,
8975 and constants, we can simplify it. There are only three cases
8976 to check: the two values can either be equal, the first can be
8977 greater, or the second can be greater. Fold the expression for
8978 those three values. Since each value must be 0 or 1, we have
8979 eight possibilities, each of which corresponds to the constant 0
8980 or 1 or one of the six possible comparisons.
8982 This handles common cases like (a > b) == 0 but also handles
8983 expressions like ((x > y) - (y > x)) > 0, which supposedly
8984 occur in macroized code. */
8987 {
8992 /* Don't handle degenerate cases here; they should already
8993 have been handled anyway. */
9002 {
9006 /* We can't just pass T to eval_subst in case cval1 or cval2
9007 was the same as ARG1. */
9009 tree high_result
9013 arg1);
9014 tree equal_result
9018 arg1);
9019 tree low_result
9023 arg1);
9025 /* All three of these results should be 0 or 1. Confirm they are.
9026 Then use those values to select the proper code to use. */
9031 {
9032 /* Make a 3-bit mask with the high-order bit being the
9033 value for `>', the next for '=', and the low for '<'. */
9037 {
9039 /* Always false. */
9060 /* Always true. */
9062 }
9067 }
9068 }
9069 }
9071 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
9072 into a single range test. */
9080 {
9084 }
9086 /* Fold ~X op ~Y as Y op X. */
9089 {
9094 }
9096 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
9099 {
9105 }
9108 }
9111 /* Subroutine of fold_binary. Optimize complex multiplications of the
9112 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
9113 argument EXPR represents the expression "z" of type TYPE. */
9115 static tree
9117 {
9122 {
9125 }
9127 {
9130 }
9131 else
9132 {
9136 }
9145 }
9148 /* Subroutine of fold_binary. If P is the value of EXPR, computes
9149 power-of-two M and (arbitrary) N such that M divides (P-N). This condition
9150 guarantees that P and N have the same least significant log2(M) bits.
9151 N is not otherwise constrained. In particular, N is not normalized to
9152 0 <= N < M as is common. In general, the precise value of P is unknown.
9153 M is chosen as large as possible such that constant N can be determined.
9155 Returns M and sets *RESIDUE to N. */
9157 static unsigned HOST_WIDE_INT
9159 {
9166 {
9169 {
9171 tree offset;
9179 {
9182 else
9183 /* We don't handle more complicated offset expressions. */
9185 }
9186 }
9190 }
9192 {
9205 {
9208 }
9210 {
9213 {
9216 /* Compute the greatest power-of-2 divisor of op1. */
9220 /* If align is non-zero and less than *modulus, replace
9221 *modulus with align., If align is 0, then either op1 is 0
9222 or the greatest power-of-2 divisor of op1 doesn't fit in an
9223 unsigned HOST_WIDE_INT. In either case, no additional
9224 constraint is imposed. */
9229 }
9230 }
9231 }
9233 /* If we get here, we were unable to determine anything useful about the
9234 expression. */
9236 }
9239 /* Fold a binary expression of code CODE and type TYPE with operands
9240 OP0 and OP1. Return the folded expression if folding is
9241 successful. Otherwise, return NULL_TREE. */
9243 tree
9245 {
9260 /* Strip any conversions that don't change the mode. This is
9261 safe for every expression, except for a comparison expression
9262 because its signedness is derived from its operands. So, in
9263 the latter case, only strip conversions that don't change the
9264 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9265 preserved.
9267 Note that this is done as an internal manipulation within the
9268 constant folder, in order to find the simplest representation
9269 of the arguments so that their form can be studied. In any
9270 cases, the appropriate type conversions should be put back in
9271 the tree that will get out of the constant folder. */
9274 {
9277 }
9278 else
9279 {
9282 }
9284 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9285 constant but we can't do arithmetic on them. */
9292 {
9294 {
9295 /* Make sure type and arg0 have the same saturating flag. */
9299 }
9302 else
9306 {
9310 }
9311 }
9313 /* If this is a commutative operation, and ARG0 is a constant, move it
9314 to ARG1 to reduce the number of tests below. */
9319 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9321 First check for cases where an arithmetic operation is applied to a
9322 compound, conditional, or comparison operation. Push the arithmetic
9323 operation inside the compound or conditional to see if any folding
9324 can then be done. Convert comparison to conditional for this purpose.
9325 The also optimizes non-constant cases that used to be done in
9326 expand_expr.
9328 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9329 one of the operands is a comparison and the other is a comparison, a
9330 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9331 code below would make the expression more complex. Change it to a
9332 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9333 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9345 {
9349 boolean_type_node,
9357 }
9361 {
9367 op1));
9376 {
9382 }
9385 {
9391 }
9392 }
9395 {
9397 /* 0 +p index -> (type)index */
9401 /* PTR +p 0 -> PTR */
9405 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9412 /* index +p PTR -> PTR +p index */
9419 /* (PTR +p B) +p A -> PTR +p (B + A) */
9421 {
9422 tree inner;
9430 }
9432 /* PTR_CST +p CST -> CST1 */
9436 /* Try replacing &a[i1] +p c * i2 with &a[i1 + i2], if c is step
9437 of the array. Loop optimizer sometimes produce this type of
9438 expressions. */
9440 {
9444 }
9449 /* PTR + INT -> (INT)(PTR p+ INT) */
9454 arg0,
9456 /* INT + PTR -> (INT)(PTR p+ INT) */
9461 arg1,
9463 /* A + (-B) -> A - B */
9468 /* (-A) + B -> B - A */
9476 {
9477 /* Convert ~A + 1 to -A. */
9482 /* ~X + X is -1. */
9485 {
9490 {
9493 }
9494 }
9496 /* X + ~X is -1. */
9499 {
9504 {
9507 }
9508 }
9510 /* X + (X / CST) * -CST is X % CST. */
9515 {
9523 }
9524 }
9526 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the
9527 same or one. Make sure type is not saturating.
9528 fold_plusminus_mult_expr will re-associate. */
9533 {
9537 }
9540 {
9544 /* If we are adding two BIT_AND_EXPR's, both of which are and'ing
9545 with a constant, and the two constants have no bits in common,
9546 we should treat this as a BIT_IOR_EXPR since this may produce more
9547 simplifications. */
9555 {
9558 }
9560 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9561 (plus (plus (mult) (mult)) (foo)) so that we can
9562 take advantage of the factoring cases below. */
9569 {
9575 else
9597 parg1)));
9598 }
9599 }
9600 else
9601 {
9602 /* See if ARG1 is zero and X + ARG1 reduces to X. */
9606 /* Likewise if the operands are reversed. */
9610 /* Convert X + -C into X - C. */
9613 {
9619 }
9621 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9622 to __complex__ ( x, y ). This is not the same for SNaNs or
9623 if signed zeros are involved. */
9627 {
9634 {
9638 {
9644 }
9646 {
9652 }
9653 }
9654 }
9662 /* Convert x+x into x*2.0. */
9668 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9669 We associate floats only if the user has specified
9670 -fassociative-math. */
9674 {
9679 {
9680 tree tree0;
9683 }
9684 }
9685 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9686 We associate floats only if the user has specified
9687 -fassociative-math. */
9691 {
9696 {
9697 tree tree0;
9700 }
9701 }
9702 }
9704 bit_rotate:
9705 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9706 is a rotate of A by C1 bits. */
9707 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9708 is a rotate of A by B bits. */
9709 {
9711 tree rtype;
9720 /* Only create rotates in complete modes. Other cases are not
9721 expanded properly. */
9723 {
9742 {
9750 TYPE_PRECISION
9755 ? LROTATE_EXPR
9758 }
9760 {
9768 TYPE_PRECISION
9773 ? LROTATE_EXPR
9776 }
9777 }
9778 }
9780 associate:
9781 /* In most languages, can't associate operations on floats through
9782 parentheses. Rather than remember where the parentheses were, we
9783 don't associate floats at all, unless the user has specified
9784 -fassociative-math.
9785 And, we need to make sure type is not saturating. */
9789 {
9794 /* Split both trees into variables, constants, and literals. Then
9795 associate each group together, the constants with literals,
9796 then the result with variables. This increases the chances of
9797 literals being recombined later and of generating relocatable
9798 expressions for the sum of a constant and literal. */
9803 /* With undefined overflow we can only associate constants
9804 with one variable. */
9808 {
9816 /* The only case we can still associate with two variables
9817 is if they are the same, modulo negation. */
9820 }
9822 /* Only do something if we found more than two objects. Otherwise,
9823 nothing has changed and we risk infinite recursion. */
9829 {
9830 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9839 /* Preserve the MINUS_EXPR if the negative part of the literal is
9840 greater than the positive part. Otherwise, the multiplicative
9841 folding code (i.e extract_muldiv) may be fooled in case
9842 unsigned constants are subtracted, like in the following
9843 example: ((X*2 + 4) - 8U)/2. */
9845 {
9849 {
9853 }
9854 else
9855 {
9859 }
9860 }
9862 {
9867 else
9868 {
9874 }
9875 }
9880 }
9881 }
9886 /* Pointer simplifications for subtraction, simple reassociations. */
9888 {
9889 /* (PTR0 p+ A) - (PTR1 p+ B) -> (PTR0 - PTR1) + (A - B) */
9892 {
9900 }
9901 /* (PTR0 p+ A) - PTR1 -> (PTR0 - PTR1) + A, assuming PTR0 - PTR1 simplifies. */
9903 {
9909 }
9910 }
9911 /* A - (-B) -> A + B */
9915 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9924 /* Convert -A - 1 to ~A. */
9932 /* Convert -1 - A to ~A. */
9938 /* X - (X / CST) * CST is X % CST. */
9951 {
9957 /* Fold A - (A & B) into ~B & A. */
9960 {
9962 {
9967 }
9969 {
9974 }
9975 }
9977 /* Fold (A & ~B) - (A & B) into (A ^ B) - B, where B is
9978 any power of 2 minus 1. */
9983 {
9989 {
9993 }
9994 }
9995 }
9997 /* See if ARG1 is zero and X - ARG1 reduces to X. */
10001 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
10002 ARG0 is zero and X + ARG0 reduces to X, since that would mean
10003 (-ARG1 + ARG0) reduces to -ARG1. */
10007 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
10008 __complex__ ( x, -y ). This is not the same for SNaNs or if
10009 signed zeros are involved. */
10013 {
10020 {
10024 {
10026 arg1r ? arg1r
10031 }
10033 {
10037 arg1i ? arg1i
10040 }
10041 }
10042 }
10044 /* Fold &x - &x. This can happen from &x.foo - &x.
10045 This is unsafe for certain floats even in non-IEEE formats.
10046 In IEEE, it is unsafe because it does wrong for NaNs.
10047 Also note that operand_equal_p is always false if an operand
10048 is volatile. */
10054 /* A - B -> A + (-B) if B is easily negatable. */
10057 /* Avoid this transformation if B is a positive REAL_CST. */
10065 /* Try folding difference of addresses. */
10066 {
10067 HOST_WIDE_INT diff;
10073 }
10075 /* Fold &a[i] - &a[j] to i-j. */
10080 {
10085 {
10093 }
10094 }
10102 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the
10103 same or one. Make sure type is not saturating.
10104 fold_plusminus_mult_expr will re-associate. */
10109 {
10113 }
10118 /* (-A) * (-B) -> A * B */
10129 {
10134 /* Transform x * -1 into -x. Make sure to do the negation
10135 on the original operand with conversions not stripped
10136 because we can only strip non-sign-changing conversions. */
10139 /* Transform x * -C into -x * C if x is easily negatable. */
10148 /* (a * (1 << b)) is (a << b) */
10158 /* (A + A) * C -> A * 2 * C */
10173 {
10176 "occur when simplifying "
10178 WARN_STRICT_OVERFLOW_MISC);
10180 }
10182 /* Optimize z * conj(z) for integer complex numbers. */
10189 }
10190 else
10191 {
10192 /* Maybe fold x * 0 to 0. The expressions aren't the same
10193 when x is NaN, since x * 0 is also NaN. Nor are they the
10194 same in modes with signed zeros, since multiplying a
10195 negative value by 0 gives -0, not +0. */
10200 /* In IEEE floating point, x*1 is not equivalent to x for snans. */
10205 /* Transform x * -1.0 into -x. */
10210 /* Convert (C1/X)*C2 into (C1*C2)/X. This transformation may change
10211 the result for floating point types due to rounding so it is applied
10212 only if -fassociative-math was specify. */
10217 {
10223 }
10225 /* Strip sign operations from X in X*X, i.e. -Y*-Y -> Y*Y. */
10227 {
10230 {
10233 }
10234 }
10236 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
10237 This is not the same for NaNs or if signed zeros are
10238 involved. */
10244 {
10256 }
10258 /* Optimize z * conj(z) for floating point complex numbers.
10259 Guarded by flag_unsafe_math_optimizations as non-finite
10260 imaginary components don't produce scalar results. */
10271 {
10275 /* Optimizations of root(...)*root(...). */
10277 {
10282 /* Optimize sqrt(x)*sqrt(x) as x. */
10288 /* Optimize root(x)*root(y) as root(x*y). */
10292 }
10294 /* Optimize expN(x)*expN(y) as expN(x+y). */
10296 {
10302 }
10304 /* Optimizations of pow(...)*pow(...). */
10308 {
10314 /* Optimize pow(x,y)*pow(z,y) as pow(x*z,y). */
10316 {
10320 }
10322 /* Optimize pow(x,y)*pow(x,z) as pow(x,y+z). */
10324 {
10328 }
10329 }
10331 /* Optimize tan(x)*cos(x) as sin(x). */
10340 {
10345 }
10347 /* Optimize x*pow(x,c) as pow(x,c+1). */
10351 {
10357 {
10359 REAL_VALUE_TYPE c;
10360 tree arg;
10366 }
10367 }
10369 /* Optimize pow(x,c)*x as pow(x,c+1). */
10373 {
10379 {
10381 REAL_VALUE_TYPE c;
10382 tree arg;
10388 }
10389 }
10391 /* Optimize x*x as pow(x,2.0), which is expanded as x*x. */
10394 {
10398 {
10401 }
10402 }
10403 }
10404 }
10408 bit_ior:
10416 /* ~X | X is -1. */
10419 {
10423 }
10425 /* X | ~X is -1. */
10428 {
10432 }
10434 /* Canonicalize (X & C1) | C2. */
10438 {
10446 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10451 {
10455 }
10456 else
10457 {
10461 }
10463 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10468 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10469 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10470 mode which allows further optimizations. */
10480 {
10481 unsigned HOST_WIDE_INT mask
10485 {
10489 }
10490 }
10497 arg1);
10498 }
10500 /* (X & Y) | Y is (X, Y). */
10504 /* (X & Y) | X is (Y, X). */
10509 /* X | (X & Y) is (Y, X). */
10514 /* X | (Y & X) is (Y, X). */
10524 /* Convert (or (not arg0) (not arg1)) to (not (and (arg0) (arg1))).
10526 This results in more efficient code for machines without a NAND
10527 instruction. Combine will canonicalize to the first form
10528 which will allow use of NAND instructions provided by the
10529 backend if they exist. */
10532 {
10539 }
10541 /* See if this can be simplified into a rotate first. If that
10542 is unsuccessful continue in the association code. */
10553 /* ~X ^ X is -1. */
10556 {
10560 }
10562 /* X ^ ~X is -1. */
10565 {
10569 }
10571 /* If we are XORing two BIT_AND_EXPR's, both of which are and'ing
10572 with a constant, and the two constants have no bits in common,
10573 we should treat this as a BIT_IOR_EXPR since this may produce more
10574 simplifications. */
10582 {
10585 }
10587 /* (X | Y) ^ X -> Y & ~ X*/
10590 {
10593 arg1);
10597 }
10599 /* (Y | X) ^ X -> Y & ~ X*/
10602 {
10605 arg1);
10609 }
10611 /* X ^ (X | Y) -> Y & ~ X*/
10614 {
10617 arg0);
10621 }
10623 /* X ^ (Y | X) -> Y & ~ X*/
10626 {
10629 arg0);
10633 }
10635 /* Convert ~X ^ ~Y to X ^ Y. */
10642 /* Convert ~X ^ C to X ^ ~C. */
10649 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10656 /* Fold (X & Y) ^ Y as ~X & Y. */
10659 {
10664 }
10665 /* Fold (X & Y) ^ X as ~Y & X. */
10669 {
10674 }
10675 /* Fold X ^ (X & Y) as X & ~Y. */
10678 {
10683 }
10684 /* Fold X ^ (Y & X) as ~Y & X. */
10688 {
10693 }
10695 /* See if this can be simplified into a rotate first. If that
10696 is unsuccessful continue in the association code. */
10707 /* ~X & X is always zero. */
10712 /* X & ~X is always zero. */
10717 /* Canonicalize (X | C1) & C2 as (X & C2) | (C1 & C2). */
10721 {
10730 }
10732 /* (X | Y) & Y is (X, Y). */
10736 /* (X | Y) & X is (Y, X). */
10741 /* X & (X | Y) is (Y, X). */
10746 /* X & (Y | X) is (Y, X). */
10752 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10756 {
10762 }
10763 /* Fold ~X & 1 as (X & 1) == 0. */
10766 {
10772 }
10774 /* Fold (X ^ Y) & Y as ~X & Y. */
10777 {
10782 }
10783 /* Fold (X ^ Y) & X as ~Y & X. */
10787 {
10792 }
10793 /* Fold X & (X ^ Y) as X & ~Y. */
10796 {
10801 }
10802 /* Fold X & (Y ^ X) as ~Y & X. */
10806 {
10811 }
10816 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10819 {
10820 unsigned int prec
10827 }
10829 /* Convert (and (not arg0) (not arg1)) to (not (or (arg0) (arg1))).
10831 This results in more efficient code for machines without a NOR
10832 instruction. Combine will canonicalize to the first form
10833 which will allow use of NOR instructions provided by the
10834 backend if they exist. */
10837 {
10844 }
10846 /* If arg0 is derived from the address of an object or function, we may
10847 be able to fold this expression using the object or function's
10848 alignment. */
10850 {
10856 /* This works because modulus is a power of 2. If this weren't the
10857 case, we'd have to replace it by its greatest power-of-2
10858 divisor: modulus & -modulus. */
10861 }
10863 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
10864 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
10865 if the new mask might be further optimized. */
10874 {
10876 unsigned HOST_WIDE_INT mask
10886 {
10889 /* See if more bits can be proven as zero because of
10890 zero extension. */
10893 {
10898 {
10900 /* See if we can shorten the right shift. */
10903 }
10904 }
10908 /* For arithmetic shift if sign bit could be set, zerobits
10909 can contain actually sign bits, so no transformation is
10910 possible, unless MASK masks them all away. In that
10911 case the shift needs to be converted into logical shift. */
10914 {
10917 else
10919 }
10920 }
10922 /* ((X << 16) & 0xff00) is (X, 0). */
10928 {
10931 /* Only do the transformation if NEWMASK is some integer
10932 mode's mask. */
10939 {
10941 {
10947 }
10948 else
10952 newmask));
10953 }
10954 }
10955 }
10960 /* Don't touch a floating-point divide by zero unless the mode
10961 of the constant can represent infinity. */
10967 /* Optimize A / A to 1.0 if we don't care about
10968 NaNs or Infinities. Skip the transformation
10969 for non-real operands. */
10974 {
10978 }
10980 /* The complex version of the above A / A optimization. */
10983 {
10987 {
10989 /* omit_two_operands will call fold_convert for us. */
10991 }
10992 }
10994 /* (-A) / (-B) -> A / B */
11004 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
11009 /* In IEEE floating point, x/-1 is not equivalent to -x for snans. */
11014 /* If ARG1 is a constant, we can convert this to a multiply by the
11015 reciprocal. This does not have the same rounding properties,
11016 so only do this if -freciprocal-math. We can actually
11017 always safely do it if ARG1 is a power of two, but it's hard to
11018 tell if it is or not in a portable manner. */
11020 {
11025 /* Find the reciprocal if optimizing and the result is exact. */
11027 {
11028 REAL_VALUE_TYPE r;
11031 {
11035 }
11036 }
11037 }
11038 /* Convert A/B/C to A/(B*C). */
11045 /* Convert A/(B/C) to (A/B)*C. */
11053 /* Convert C1/(X*C2) into (C1/C2)/X. */
11058 {
11064 }
11067 {
11071 /* Optimize sin(x)/cos(x) as tan(x). */
11077 {
11082 }
11084 /* Optimize cos(x)/sin(x) as 1.0/tan(x). */
11090 {
11094 {
11098 }
11099 }
11101 /* Optimize sin(x)/tan(x) as cos(x) if we don't care about
11102 NaNs or Infinities. */
11106 {
11113 {
11118 }
11119 }
11121 /* Optimize tan(x)/sin(x) as 1.0/cos(x) if we don't care about
11122 NaNs or Infinities. */
11126 {
11133 {
11137 {
11141 tmp);
11142 }
11143 }
11144 }
11146 /* Optimize pow(x,c)/x as pow(x,c-1). */
11150 {
11156 {
11158 REAL_VALUE_TYPE c;
11159 tree arg;
11165 }
11166 }
11168 /* Optimize a/root(b/c) into a*root(c/b). */
11170 {
11174 {
11183 }
11184 }
11186 /* Optimize x/expN(y) into x*expN(-y). */
11188 {
11193 }
11195 /* Optimize x/pow(y,z) into x*pow(y,-z). */
11199 {
11206 }
11207 }
11212 /* Simplify A / (B << N) where A and B are positive and B is
11213 a power of 2, to A >> (N + log2(B)). */
11218 {
11221 {
11228 WARN_STRICT_OVERFLOW_MISC);
11234 }
11235 }
11237 /* For unsigned integral types, FLOOR_DIV_EXPR is the same as
11238 TRUNC_DIV_EXPR. Rewrite into the latter in this case. */
11244 /* Fall thru */
11253 /* X / -1 is -X. */
11260 /* Convert -A / -B to A / B when the type is signed and overflow is
11261 undefined. */
11265 {
11268 "when distributing negation across "
11270 WARN_STRICT_OVERFLOW_MISC);
11274 }
11278 {
11281 "when distributing negation across "
11283 WARN_STRICT_OVERFLOW_MISC);
11286 }
11288 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
11289 operation, EXACT_DIV_EXPR.
11291 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
11292 At one time others generated faster code, it's not clear if they do
11293 after the last round to changes to the DIV code in expmed.c. */
11302 {
11306 WARN_STRICT_OVERFLOW_MISC);
11308 }
11316 /* X % 1 is always zero, but be sure to preserve any side
11317 effects in X. */
11321 /* X % 0, return X % 0 unchanged so that we can get the
11322 proper warnings and errors. */
11326 /* 0 % X is always zero, but be sure to preserve any side
11327 effects in X. Place this after checking for X == 0. */
11331 /* X % -1 is zero. */
11338 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
11339 i.e. "X % C" into "X & (C - 1)", if X and C are positive. */
11344 {
11346 /* Also optimize A % (C << N) where C is a power of 2,
11347 to A & ((C << N) - 1). */
11352 {
11357 "occur when simplifying "
11359 WARN_STRICT_OVERFLOW_MISC);
11363 }
11364 }
11366 /* X % -C is the same as X % C. */
11373 /* Avoid this transformation if C is INT_MIN, i.e. C == -C. */
11378 /* X % -Y is the same as X % Y. */
11389 {
11393 WARN_STRICT_OVERFLOW_MISC);
11395 }
11406 /* Optimize -1 >> x for arithmetic right shifts. */
11409 /* ... fall through ... */
11412 shift:
11418 /* Since negative shift count is not well-defined,
11419 don't try to compute it in the compiler. */
11423 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
11428 {
11432 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
11433 being well defined. */
11435 {
11440 else
11442 }
11446 }
11448 /* Transform (x >> c) << c into x & (-1<<c), or transform (x << c) >> c
11449 into x & ((unsigned)-1 >> c) for unsigned types. */
11457 {
11460 tree lshift;
11461 tree arg00;
11464 {
11471 }
11472 }
11474 /* Rewrite an LROTATE_EXPR by a constant into an
11475 RROTATE_EXPR by a new constant. */
11477 {
11482 }
11484 /* If we have a rotate of a bit operation with the rotate count and
11485 the second operand of the bit operation both constant,
11486 permute the two operations. */
11498 /* Two consecutive rotates adding up to the precision of the
11499 type can be ignored. */
11510 /* Fold (X & C2) << C1 into (X << C1) & (C2 << C1)
11511 (X & C2) >> C1 into (X >> C1) & (C2 >> C1)
11512 if the latter can be further optimized. */
11517 {
11520 arg1);
11523 arg1);
11527 }
11555 /* Note that the operands of this must be ints
11556 and their values must be 0 or 1.
11557 ("true" is a fixed value perhaps depending on the language.) */
11558 /* If first arg is constant zero, return it. */
11562 /* If either arg is constant true, drop it. */
11566 /* Preserve sequence points. */
11569 /* If second arg is constant zero, result is zero, but first arg
11570 must be evaluated. */
11573 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
11574 case will be handled here. */
11578 /* !X && X is always false. */
11582 /* X && !X is always false. */
11587 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
11588 means A >= Y && A != MAX, but in this case we know that
11589 A < X <= MAX. */
11593 {
11601 }
11603 truth_andor:
11604 /* We only do these simplifications if we are optimizing. */
11608 /* Check for things like (A || B) && (A || C). We can convert this
11609 to A || (B && C). Note that either operator can be any of the four
11610 truth and/or operations and the transformation will still be
11611 valid. Also note that we only care about order for the
11612 ANDIF and ORIF operators. If B contains side effects, this
11613 might change the truth-value of A. */
11620 {
11640 /* This case if tricky because we must either have commutative
11641 operators or else A10 must not have side-effects. */
11647 a01);
11648 }
11650 /* See if we can build a range comparison. */
11654 /* Check for the possibility of merging component references. If our
11655 lhs is another similar operation, try to merge its rhs with our
11656 rhs. Then try to merge our lhs and rhs. */
11668 /* Note that the operands of this must be ints
11669 and their values must be 0 or true.
11670 ("true" is a fixed value perhaps depending on the language.) */
11671 /* If first arg is constant true, return it. */
11675 /* If either arg is constant zero, drop it. */
11679 /* Preserve sequence points. */
11682 /* If second arg is constant true, result is true, but we must
11683 evaluate first arg. */
11686 /* Likewise for first arg, but note this only occurs here for
11687 TRUTH_OR_EXPR. */
11691 /* !X || X is always true. */
11695 /* X || !X is always true. */
11703 /* If the second arg is constant zero, drop it. */
11706 /* If the second arg is constant true, this is a logical inversion. */
11708 {
11709 /* Only call invert_truthvalue if operand is a truth value. */
11712 else
11715 }
11716 /* Identical arguments cancel to zero. */
11720 /* !X ^ X is always true. */
11725 /* X ^ !X is always true. */
11738 /* bool_var != 0 becomes bool_var. */
11743 /* bool_var == 1 becomes bool_var. */
11748 /* bool_var != 1 becomes !bool_var. */
11753 /* bool_var == 0 becomes !bool_var. */
11758 /* If this is an equality comparison of the address of two non-weak,
11759 unaliased symbols neither of which are extern (since we do not
11760 have access to attributes for externs), then we know the result. */
11773 {
11774 /* We know that we're looking at the address of two
11775 non-weak, unaliased, static _DECL nodes.
11777 It is both wasteful and incorrect to call operand_equal_p
11778 to compare the two ADDR_EXPR nodes. It is wasteful in that
11779 all we need to do is test pointer equality for the arguments
11780 to the two ADDR_EXPR nodes. It is incorrect to use
11781 operand_equal_p as that function is NOT equivalent to a
11782 C equality test. It can in fact return false for two
11783 objects which would test as equal using the C equality
11784 operator. */
11788 type);
11789 }
11791 /* If this is an EQ or NE comparison of a constant with a PLUS_EXPR or
11792 a MINUS_EXPR of a constant, we can convert it into a comparison with
11793 a revised constant as long as no overflow occurs. */
11805 /* Similarly for a NEGATE_EXPR. */
11813 /* Similarly for a BIT_XOR_EXPR; X ^ C1 == C2 is X == (C1 ^ C2). */
11822 /* Transform comparisons of the form X +- C CMP X. */
11828 {
11835 else
11838 }
11840 /* If we have X - Y == 0, we can convert that to X == Y and similarly
11841 for !=. Don't do this for ordered comparisons due to overflow. */
11847 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
11852 /* If this is an EQ or NE comparison with zero and ARG0 is
11853 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
11854 two operations, but the latter can be done in one less insn
11855 on machines that have only two-operand insns or on which a
11856 constant cannot be the first operand. */
11859 {
11864 {
11871 }
11874 {
11881 }
11882 }
11884 /* If this is an NE or EQ comparison of zero against the result of a
11885 signed MOD operation whose second operand is a power of 2, make
11886 the MOD operation unsigned since it is simpler and equivalent. */
11894 {
11904 }
11906 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
11907 C1 is a valid shift constant, and C2 is a power of two, i.e.
11908 a single bit. */
11912 == INTEGER_CST
11915 {
11920 /* Check for a valid shift count. */
11923 {
11927 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
11928 can be rewritten as (X & (C2 << C1)) != 0. */
11930 {
11934 }
11935 /* Otherwise, for signed (arithmetic) shifts,
11936 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
11937 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
11941 /* Otherwise, of unsigned (logical) shifts,
11942 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
11943 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
11944 else
11948 arg000);
11949 }
11950 }
11952 /* If this is an NE comparison of zero with an AND of one, remove the
11953 comparison since the AND will give the correct value. */
11960 /* If we have (A & C) == C where C is a power of 2, convert this into
11961 (A & C) != 0. Similarly for NE_EXPR. */
11967 integer_zero_node));
11969 /* If we have (A & C) != 0 or (A & C) == 0 and C is the sign
11970 bit, then fold the expression into A < 0 or A >= 0. */
11975 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
11976 Similarly for NE_EXPR. */
11980 {
11989 }
11991 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
11992 Similarly for NE_EXPR. */
11996 {
12003 }
12005 /* Optimize comparisons of strlen vs zero to a compare of the
12006 first character of the string vs zero. To wit,
12007 strlen(ptr) == 0 => *ptr == 0
12008 strlen(ptr) != 0 => *ptr != 0
12009 Other cases should reduce to one of these two (or a constant)
12010 due to the return value of strlen being unsigned. */
12013 {
12021 {
12025 }
12026 }
12028 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
12029 of X. Similarly fold (X >> C) == 0 into X >= 0. */
12033 {
12040 {
12042 {
12045 }
12048 }
12049 }
12051 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
12057 /* (X ^ Y) == Y becomes X == 0. We know that Y has no side-effects. */
12062 /* Likewise (X ^ Y) == X becomes Y == 0. X has no side-effects. */
12069 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
12077 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
12078 (X & C) == 0 when C is a single bit. */
12083 {
12089 }
12091 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
12092 constant C is a power of two, i.e. a single bit. */
12099 {
12103 }
12105 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
12106 when is C is a power of two, i.e. a single bit. */
12113 {
12119 }
12123 {
12126 }
12128 /* Fold -X op -Y as X op Y, where op is eq/ne. */
12135 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
12138 {
12150 arg01),
12158 arg01),
12166 arg00),
12174 arg00),
12176 }
12180 {
12187 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
12188 operand_equal_p guarantees no side-effects so we don't need
12189 to use omit_one_operand on Z. */
12199 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
12206 arg10);
12207 }
12209 /* Attempt to simplify equality/inequality comparisons of complex
12210 values. Only lower the comparison if the result is known or
12211 can be simplified to a single scalar comparison. */
12216 {
12221 {
12224 }
12225 else
12226 {
12229 }
12232 {
12235 }
12236 else
12237 {
12240 }
12244 {
12246 {
12251 }
12252 else
12253 {
12258 }
12259 }
12263 {
12265 {
12270 }
12271 else
12272 {
12277 }
12278 }
12279 }
12291 /* Transform comparisons of the form X +- C CMP X. */
12298 {
12305 else
12308 /* (X - c) > X becomes false. */
12312 {
12316 "occur when assuming that (X - c) > X "
12318 WARN_STRICT_OVERFLOW_ALL);
12320 }
12322 /* Likewise (X + c) < X becomes false. */
12326 {
12330 "occur when assuming that "
12332 WARN_STRICT_OVERFLOW_ALL);
12334 }
12336 /* Convert (X - c) <= X to true. */
12341 {
12345 "occur when assuming that "
12347 WARN_STRICT_OVERFLOW_ALL);
12349 }
12351 /* Convert (X + c) >= X to true. */
12356 {
12360 "occur when assuming that "
12362 WARN_STRICT_OVERFLOW_ALL);
12364 }
12367 {
12368 /* Convert X + c > X and X - c < X to true for integers. */
12372 {
12375 "not occur when assuming that "
12377 WARN_STRICT_OVERFLOW_ALL);
12379 }
12384 {
12387 "not occur when assuming that "
12389 WARN_STRICT_OVERFLOW_ALL);
12391 }
12393 /* Convert X + c <= X and X - c >= X to false for integers. */
12397 {
12400 "not occur when assuming that "
12402 WARN_STRICT_OVERFLOW_ALL);
12404 }
12409 {
12412 "not occur when assuming that "
12414 WARN_STRICT_OVERFLOW_ALL);
12416 }
12417 }
12418 }
12420 /* Change X >= C to X > (C - 1) and X < C to X <= (C - 1) if C > 0.
12421 This transformation affects the cases which are handled in later
12422 optimizations involving comparisons with non-negative constants. */
12426 {
12428 {
12433 }
12435 {
12440 }
12441 }
12443 /* Comparisons with the highest or lowest possible integer of
12444 the specified precision will have known values. */
12445 {
12453 {
12454 HOST_WIDE_INT signed_max_hi;
12459 {
12466 {
12470 }
12471 else
12472 {
12476 }
12477 }
12478 else
12479 {
12488 {
12491 }
12492 else
12493 {
12496 }
12497 }
12502 {
12515 /* The GE_EXPR and LT_EXPR cases above are not normally
12516 reached because of previous transformations. */
12520 }
12522 == max_hi
12525 {
12531 arg1);
12537 arg1);
12540 }
12542 == min_hi
12545 {
12560 }
12562 == min_hi
12565 {
12570 arg1);
12575 arg1);
12578 }
12583 /* We will flip the signedness of the comparison operator
12584 associated with the mode of arg1, so the sign bit is
12585 specified by this mode. Check that arg1 is the signed
12586 max associated with this sign bit. */
12588 /* signed_type does not work on pointer types. */
12590 {
12591 /* The following case also applies to X < signed_max+1
12592 and X >= signed_max+1 because previous transformations. */
12594 {
12595 tree st;
12600 }
12601 }
12602 }
12603 }
12605 /* If we are comparing an ABS_EXPR with a constant, we can
12606 convert all the cases into explicit comparisons, but they may
12607 well not be faster than doing the ABS and one comparison.
12608 But ABS (X) <= C is a range comparison, which becomes a subtraction
12609 and a comparison, and is probably faster. */
12623 /* Convert ABS_EXPR<x> >= 0 to true. */
12630 {
12633 "when simplifying comparison of "
12635 WARN_STRICT_OVERFLOW_CONDITIONAL);
12637 }
12639 /* Convert ABS_EXPR<x> < 0 to false. */
12644 {
12647 "when simplifying comparison of "
12649 WARN_STRICT_OVERFLOW_CONDITIONAL);
12651 }
12653 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
12654 and similarly for >= into !=. */
12669 return
12688 {
12692 }
12694 /* If the first operand is NaN, the result is constant. */
12698 {
12700 ? integer_zero_node
12703 }
12705 /* If the second operand is NaN, the result is constant. */
12709 {
12711 ? integer_zero_node
12714 }
12716 /* Simplify unordered comparison of something with itself. */
12722 && !flag_trapping_math
12726 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
12727 {
12738 }
12743 /* When pedantic, a compound expression can be neither an lvalue
12744 nor an integer constant expression. */
12747 /* Don't let (0, 0) be null pointer constant. */
12761 /* An ASSERT_EXPR should never be passed to fold_binary. */
12767 }
12769 /* Callback for walk_tree, looking for LABEL_EXPR.
12770 Returns tree TP if it is LABEL_EXPR. Otherwise it returns NULL_TREE.
12771 Do not check the sub-tree of GOTO_EXPR. */
12773 static tree
12777 {
12779 {
12784 /* no break */
12787 }
12788 }
12790 /* Checks whether the sub-tree ST contains a label LABEL_EXPR which is
12791 accessible from outside the sub-tree. Returns NULL_TREE if no
12792 addressable label is found. */
12794 static bool
12796 {
12798 }
12800 /* Fold a ternary expression of code CODE and type TYPE with operands
12801 OP0, OP1, and OP2. Return the folded expression if folding is
12802 successful. Otherwise, return NULL_TREE. */
12804 tree
12806 {
12807 tree tem;
12814 /* Strip any conversions that don't change the mode. This is safe
12815 for every expression, except for a comparison expression because
12816 its signedness is derived from its operands. So, in the latter
12817 case, only strip conversions that don't change the signedness.
12819 Note that this is done as an internal manipulation within the
12820 constant folder, in order to find the simplest representation of
12821 the arguments so that their form can be studied. In any cases,
12822 the appropriate type conversions should be put back in the tree
12823 that will get out of the constant folder. */
12825 {
12828 }
12831 {
12834 }
12837 {
12841 {
12847 }
12851 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
12852 so all simple results must be passed through pedantic_non_lvalue. */
12854 {
12857 /* Only optimize constant conditions when the selected branch
12858 has the same type as the COND_EXPR. This avoids optimizing
12859 away "c ? x : throw", where the throw has a void type.
12860 Avoid throwing away that operand which contains label. */
12867 }
12871 /* If we have A op B ? A : C, we may be able to convert this to a
12872 simpler expression, depending on the operation and the values
12873 of B and C. Signed zeros prevent all of these transformations,
12874 for reasons given above each one.
12876 Also try swapping the arguments and inverting the conditional. */
12881 {
12885 }
12889 op2,
12892 {
12895 {
12899 }
12900 }
12902 /* If the second operand is simpler than the third, swap them
12903 since that produces better jump optimization results. */
12906 {
12907 /* See if this can be inverted. If it can't, possibly because
12908 it was a floating-point inequality comparison, don't do
12909 anything. */
12913 }
12915 /* Convert A ? 1 : 0 to simply A. */
12918 /* If we try to convert OP0 to our type, the
12919 call to fold will try to move the conversion inside
12920 a COND, which will recurse. In that case, the COND_EXPR
12921 is probably the best choice, so leave it alone. */
12925 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
12926 over COND_EXPR in cases such as floating point comparisons. */
12933 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
12938 {
12939 /* sign_bit_p only checks ARG1 bits within A's precision.
12940 If <sign bit of A> has wider type than A, bits outside
12941 of A's precision in <sign bit of A> need to be checked.
12942 If they are all 0, this optimization needs to be done
12943 in unsigned A's type, if they are all 1 in signed A's type,
12944 otherwise this can't be done. */
12949 {
12951 HOST_WIDE_INT mask_hi;
12953 tree tem_type;
12961 {
12965 }
12966 else
12967 {
12971 }
12973 {
12977 }
12978 else
12984 {
12987 }
12990 {
12993 }
12994 else
12996 }
13003 arg1)));
13004 }
13006 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
13007 already handled above. */
13012 {
13021 }
13023 /* A & N ? N : 0 is simply A & N if N is a power of two. This
13024 is probably obsolete because the first operand should be a
13025 truth value (that's why we have the two cases above), but let's
13026 leave it in until we can confirm this for all front-ends. */
13037 /* Convert A ? B : 0 into A && B if A and B are truth values. */
13043 arg1);
13045 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
13049 {
13050 /* Only perform transformation if ARG0 is easily inverted. */
13055 arg1);
13056 }
13058 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
13062 {
13063 /* Only perform transformation if ARG0 is easily inverted. */
13068 op2);
13069 }
13071 /* Convert A ? 1 : B into A || B if A and B are truth values. */
13077 op2);
13082 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
13083 of fold_ternary on them. */
13090 {
13099 {
13104 else
13105 {
13107 tree value;
13111 }
13116 else
13118 }
13119 }
13121 /* A bit-field-ref that referenced the full argument can be stripped. */
13132 }
13134 /* Perform constant folding and related simplification of EXPR.
13135 The related simplifications include x*1 => x, x*0 => 0, etc.,
13136 and application of the associative law.
13137 NOP_EXPR conversions may be removed freely (as long as we
13138 are careful not to change the type of the overall expression).
13139 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
13140 but we can constant-fold them if they have constant operands. */
13142 #ifdef ENABLE_FOLD_CHECKING
13143 # define fold(x) fold_1 (x)
13145 static
13146 #endif
13147 tree
13149 {
13153 tree tem;
13155 /* Return right away if a constant. */
13159 /* CALL_EXPR-like objects with variable numbers of operands are
13160 treated specially. */
13162 {
13164 {
13167 }
13169 }
13173 {
13178 {
13196 }
13197 }
13200 {
13202 {
13209 {
13214 /* Find a matching index by means of a binary search. */
13216 {
13232 else
13234 }
13235 }
13238 }
13246 }
13248 #ifdef ENABLE_FOLD_CHECKING
13249 #undef fold
13255 /* When --enable-checking=fold, compute a digest of expr before
13256 and after actual fold call to see if fold did not accidentally
13257 change original expr. */
13259 tree
13261 {
13262 tree ret;
13265 htab_t ht;
13284 }
13286 void
13288 {
13291 htab_t ht;
13301 }
13303 static void
13305 {
13307 }
13309 static void
13311 {
13317 recursive_label:
13331 {
13332 /* Allow DECL_ASSEMBLER_NAME to be modified. */
13336 }
13341 {
13342 /* Allow these fields to be modified. */
13343 tree tmp;
13350 {
13353 }
13354 }
13363 {
13366 {
13380 }
13384 {
13397 }
13414 {
13420 }
13425 {
13429 }
13440 {
13443 }
13453 }
13454 }
13456 /* Helper function for outputting the checksum of a tree T. When
13457 debugging with gdb, you can "define mynext" to be "next" followed
13458 by "call debug_fold_checksum (op0)", then just trace down till the
13459 outputs differ. */
13461 void
13463 {
13478 }
13480 #endif
13482 /* Fold a unary tree expression with code CODE of type TYPE with an
13483 operand OP0. Return a folded expression if successful. Otherwise,
13484 return a tree expression with code CODE of type TYPE with an
13485 operand OP0. */
13487 tree
13489 {
13490 tree tem;
13491 #ifdef ENABLE_FOLD_CHECKING
13494 htab_t ht;
13501 #endif
13507 #ifdef ENABLE_FOLD_CHECKING
13515 #endif
13517 }
13519 /* Fold a binary tree expression with code CODE of type TYPE with
13520 operands OP0 and OP1. Return a folded expression if successful.
13521 Otherwise, return a tree expression with code CODE of type TYPE
13522 with operands OP0 and OP1. */
13524 tree
13526 MEM_STAT_DECL)
13527 {
13528 tree tem;
13529 #ifdef ENABLE_FOLD_CHECKING
13535 htab_t ht;
13547 #endif
13553 #ifdef ENABLE_FOLD_CHECKING
13569 #endif
13571 }
13573 /* Fold a ternary tree expression with code CODE of type TYPE with
13574 operands OP0, OP1, and OP2. Return a folded expression if
13575 successful. Otherwise, return a tree expression with code CODE of
13576 type TYPE with operands OP0, OP1, and OP2. */
13578 tree
13580 MEM_STAT_DECL)
13581 {
13582 tree tem;
13583 #ifdef ENABLE_FOLD_CHECKING
13591 htab_t ht;
13608 #endif
13615 #ifdef ENABLE_FOLD_CHECKING
13639 #endif
13641 }
13643 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
13644 arguments in ARGARRAY, and a null static chain.
13645 Return a folded expression if successful. Otherwise, return a CALL_EXPR
13646 of type TYPE from the given operands as constructed by build_call_array. */
13648 tree
13650 {
13651 tree tem;
13652 #ifdef ENABLE_FOLD_CHECKING
13658 htab_t ht;
13672 #endif
13676 #ifdef ENABLE_FOLD_CHECKING
13693 #endif
13695 }
13697 /* Perform constant folding and related simplification of initializer
13698 expression EXPR. These behave identically to "fold_buildN" but ignore
13699 potential run-time traps and exceptions that fold must preserve. */
13701 #define START_FOLD_INIT \
13702 int saved_signaling_nans = flag_signaling_nans;\
13703 int saved_trapping_math = flag_trapping_math;\
13704 int saved_rounding_math = flag_rounding_math;\
13705 int saved_trapv = flag_trapv;\
13706 int saved_folding_initializer = folding_initializer;\
13707 flag_signaling_nans = 0;\
13708 flag_trapping_math = 0;\
13709 flag_rounding_math = 0;\
13710 flag_trapv = 0;\
13711 folding_initializer = 1;
13713 #define END_FOLD_INIT \
13714 flag_signaling_nans = saved_signaling_nans;\
13715 flag_trapping_math = saved_trapping_math;\
13716 flag_rounding_math = saved_rounding_math;\
13717 flag_trapv = saved_trapv;\
13718 folding_initializer = saved_folding_initializer;
13720 tree
13722 {
13723 tree result;
13724 START_FOLD_INIT;
13728 END_FOLD_INIT;
13730 }
13732 tree
13734 {
13735 tree result;
13736 START_FOLD_INIT;
13740 END_FOLD_INIT;
13742 }
13744 tree
13746 tree op2)
13747 {
13748 tree result;
13749 START_FOLD_INIT;
13753 END_FOLD_INIT;
13755 }
13757 tree
13760 {
13761 tree result;
13762 START_FOLD_INIT;
13766 END_FOLD_INIT;
13768 }
13770 #undef START_FOLD_INIT
13771 #undef END_FOLD_INIT
13773 /* Determine if first argument is a multiple of second argument. Return 0 if
13774 it is not, or we cannot easily determined it to be.
13776 An example of the sort of thing we care about (at this point; this routine
13777 could surely be made more general, and expanded to do what the *_DIV_EXPR's
13778 fold cases do now) is discovering that
13780 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
13782 is a multiple of
13784 SAVE_EXPR (J * 8)
13786 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
13788 This code also handles discovering that
13790 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
13792 is a multiple of 8 so we don't have to worry about dealing with a
13793 possible remainder.
13795 Note that we *look* inside a SAVE_EXPR only to determine how it was
13796 calculated; it is not safe for fold to do much of anything else with the
13797 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
13798 at run time. For example, the latter example above *cannot* be implemented
13799 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
13800 evaluation time of the original SAVE_EXPR is not necessarily the same at
13801 the time the new expression is evaluated. The only optimization of this
13802 sort that would be valid is changing
13804 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
13806 divided by 8 to
13808 SAVE_EXPR (I) * SAVE_EXPR (J)
13810 (where the same SAVE_EXPR (J) is used in the original and the
13811 transformed version). */
13813 int
13815 {
13823 {
13825 /* Bitwise and provides a power of two multiple. If the mask is
13826 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
13829 /* FALLTHRU */
13842 {
13846 /* const_binop may not detect overflow correctly,
13847 so check for it explicitly here. */
13853 size_one_node,
13857 }
13861 /* Can't handle conversions from non-integral or wider integral type. */
13867 /* .. fall through ... */
13884 }
13885 }
13887 /* Return true if CODE or TYPE is known to be non-negative. */
13889 static bool
13891 {
13894 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
13895 have a signed:1 type (where the value is -1 and 0). */
13898 }
13900 /* Return true if (CODE OP0) is known to be non-negative. If the return
13901 value is based on the assumption that signed overflow is undefined,
13902 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13903 *STRICT_OVERFLOW_P. */
13905 bool
13908 {
13913 {
13915 /* We can't return 1 if flag_wrapv is set because
13916 ABS_EXPR<INT_MIN> = INT_MIN. */
13920 {
13923 }
13930 strict_overflow_p);
13933 {
13938 {
13941 strict_overflow_p);
13943 {
13947 strict_overflow_p);
13948 }
13949 }
13951 {
13954 strict_overflow_p);
13958 }
13959 }
13964 }
13966 /* We don't know sign of `t', so be conservative and return false. */
13968 }
13970 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
13971 value is based on the assumption that signed overflow is undefined,
13972 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13973 *STRICT_OVERFLOW_P. */
13975 bool
13978 {
13983 {
13988 strict_overflow_p)
13990 strict_overflow_p));
13992 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
13993 both unsigned and at least 2 bits shorter than the result. */
13997 {
14002 {
14006 }
14007 }
14012 {
14013 /* x * x for floating point x is always non-negative. */
14017 strict_overflow_p)
14019 strict_overflow_p));
14020 }
14022 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
14023 both unsigned and their total bits is shorter than the result. */
14027 {
14034 }
14040 strict_overflow_p)
14042 strict_overflow_p));
14053 strict_overflow_p)
14055 strict_overflow_p));
14062 strict_overflow_p);
14065 }
14067 /* We don't know sign of `t', so be conservative and return false. */
14069 }
14071 /* Return true if T is known to be non-negative. If the return
14072 value is based on the assumption that signed overflow is undefined,
14073 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14074 *STRICT_OVERFLOW_P. */
14076 bool
14078 {
14083 {
14095 strict_overflow_p)
14097 strict_overflow_p));
14101 }
14102 /* We don't know sign of `t', so be conservative and return false. */
14104 }
14106 /* Return true if T is known to be non-negative. If the return
14107 value is based on the assumption that signed overflow is undefined,
14108 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14109 *STRICT_OVERFLOW_P. */
14111 bool
14114 {
14117 {
14135 /* Always true. */
14139 /* sqrt(-0.0) is -0.0. */
14143 strict_overflow_p);
14176 /* True if the 1st argument is nonnegative. */
14178 strict_overflow_p);
14181 /* True if the 1st OR 2nd arguments are nonnegative. */
14183 strict_overflow_p)
14185 strict_overflow_p)));
14188 /* True if the 1st AND 2nd arguments are nonnegative. */
14190 strict_overflow_p)
14192 strict_overflow_p)));
14195 /* True if the 2nd argument is nonnegative. */
14197 strict_overflow_p);
14200 /* True if the 1st argument is nonnegative or the second
14201 argument is an even integer. */
14206 strict_overflow_p);
14209 /* True if the 1st argument is nonnegative or the second
14210 argument is an even integer valued real. */
14212 {
14213 REAL_VALUE_TYPE c;
14214 HOST_WIDE_INT n;
14219 {
14220 REAL_VALUE_TYPE cint;
14225 }
14226 }
14228 strict_overflow_p);
14232 }
14234 type);
14235 }
14237 /* Return true if T is known to be non-negative. If the return
14238 value is based on the assumption that signed overflow is undefined,
14239 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14240 *STRICT_OVERFLOW_P. */
14242 bool
14244 {
14250 {
14252 {
14256 /* If the initializer is non-void, then it's a normal expression
14257 that will be assigned to the slot. */
14261 /* Otherwise, the initializer sets the slot in some way. One common
14262 way is an assignment statement at the end of the initializer. */
14264 {
14272 else
14274 }
14279 strict_overflow_p);
14282 }
14285 {
14292 arg0,
14293 arg1,
14294 strict_overflow_p);
14295 }
14300 strict_overflow_p);
14303 strict_overflow_p);
14306 strict_overflow_p);
14311 }
14313 /* We don't know sign of `t', so be conservative and return false. */
14315 }
14317 /* Return true if T is known to be non-negative. If the return
14318 value is based on the assumption that signed overflow is undefined,
14319 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14320 *STRICT_OVERFLOW_P. */
14322 bool
14324 {
14331 {
14338 strict_overflow_p);
14344 strict_overflow_p);
14353 }
14356 {
14364 strict_overflow_p);
14369 strict_overflow_p);
14384 }
14385 }
14387 /* Return true if `t' is known to be non-negative. Handle warnings
14388 about undefined signed overflow. */
14390 bool
14392 {
14399 "determining that expression is always "
14401 WARN_STRICT_OVERFLOW_MISC);
14403 }
14406 /* Return true when (CODE OP0) is an address and is known to be nonzero.
14407 For floating point we further ensure that T is not denormal.
14408 Similar logic is present in nonzero_address in rtlanal.h.
14410 If the return value is based on the assumption that signed overflow
14411 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
14412 change *STRICT_OVERFLOW_P. */
14414 bool
14417 {
14419 {
14422 strict_overflow_p);
14425 {
14431 strict_overflow_p));
14432 }
14437 strict_overflow_p);
14441 }
14444 }
14446 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
14447 For floating point we further ensure that T is not denormal.
14448 Similar logic is present in nonzero_address in rtlanal.h.
14450 If the return value is based on the assumption that signed overflow
14451 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
14452 change *STRICT_OVERFLOW_P. */
14454 bool
14456 tree type,
14457 tree op0,
14459 {
14462 {
14466 {
14467 /* With the presence of negative values it is hard
14468 to say something. */
14475 /* One of operands must be positive and the other non-negative. */
14476 /* We don't set *STRICT_OVERFLOW_P here: even if this value
14477 overflows, on a twos-complement machine the sum of two
14478 nonnegative numbers can never be zero. */
14480 strict_overflow_p)
14482 strict_overflow_p));
14483 }
14488 {
14490 strict_overflow_p)
14492 strict_overflow_p))
14493 {
14496 }
14497 }
14506 {
14509 }
14516 {
14520 /* When both operands are nonzero, then MAX must be too. */
14522 strict_overflow_p))
14525 /* MAX where operand 0 is positive is positive. */
14527 strict_overflow_p);
14528 }
14529 /* MAX where operand 1 is positive is positive. */
14534 {
14538 }
14543 strict_overflow_p)
14545 strict_overflow_p));
14549 }
14552 }
14554 /* Return true when T is an address and is known to be nonzero.
14555 For floating point we further ensure that T is not denormal.
14556 Similar logic is present in nonzero_address in rtlanal.h.
14558 If the return value is based on the assumption that signed overflow
14559 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
14560 change *STRICT_OVERFLOW_P. */
14562 bool
14564 {
14567 {
14572 {
14578 /* Weak declarations may link to NULL. */
14582 /* Constants are never weak. */
14587 }
14595 {
14599 }
14604 }
14606 }
14608 /* Return true when T is an address and is known to be nonzero.
14609 For floating point we further ensure that T is not denormal.
14610 Similar logic is present in nonzero_address in rtlanal.h.
14612 If the return value is based on the assumption that signed overflow
14613 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
14614 change *STRICT_OVERFLOW_P. */
14616 bool
14618 {
14622 /* Doing something useful for floating point would need more work. */
14628 {
14631 strict_overflow_p);
14637 strict_overflow_p);
14645 }
14648 {
14651 strict_overflow_p);
14659 strict_overflow_p);
14677 strict_overflow_p);
14681 strict_overflow_p);
14688 }
14690 }
14692 /* Return true when T is an address and is known to be nonzero.
14693 Handle warnings about undefined signed overflow. */
14695 bool
14697 {
14704 "determining that expression is always "
14706 WARN_STRICT_OVERFLOW_MISC);
14708 }
14710 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
14711 attempt to fold the expression to a constant without modifying TYPE,
14712 OP0 or OP1.
14714 If the expression could be simplified to a constant, then return
14715 the constant. If the expression would not be simplified to a
14716 constant, then return NULL_TREE. */
14718 tree
14720 {
14723 }
14725 /* Given the components of a unary expression CODE, TYPE and OP0,
14726 attempt to fold the expression to a constant without modifying
14727 TYPE or OP0.
14729 If the expression could be simplified to a constant, then return
14730 the constant. If the expression would not be simplified to a
14731 constant, then return NULL_TREE. */
14733 tree
14735 {
14738 }
14740 /* If EXP represents referencing an element in a constant string
14741 (either via pointer arithmetic or array indexing), return the
14742 tree representing the value accessed, otherwise return NULL. */
14744 tree
14746 {
14750 {
14752 tree index;
14753 tree string;
14757 else
14758 {
14762 /* Optimize the special-case of a zero lower bound.
14764 We convert the low_bound to sizetype to avoid some problems
14765 with constant folding. (E.g. suppose the lower bound is 1,
14766 and its mode is QI. Without the conversion,l (ARRAY
14767 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
14768 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
14773 }
14786 }
14788 }
14790 /* Return the tree for neg (ARG0) when ARG0 is known to be either
14791 an integer constant, real, or fixed-point constant.
14793 TYPE is the type of the result. */
14795 static tree
14797 {
14801 {
14803 {
14805 HOST_WIDE_INT high;
14813 }
14820 {
14821 FIXED_VALUE_TYPE f;
14826 /* Propagate overflow flags. */
14828 {
14831 }
14835 }
14839 }
14842 }
14844 /* Return the tree for abs (ARG0) when ARG0 is known to be either
14845 an integer constant or real constant.
14847 TYPE is the type of the result. */
14849 tree
14851 {
14855 {
14857 /* If the value is unsigned, then the absolute value is
14858 the same as the ordinary value. */
14861 /* Similarly, if the value is non-negative. */
14864 /* If the value is negative, then the absolute value is
14865 its negation. */
14866 else
14867 {
14869 HOST_WIDE_INT high;
14875 }
14881 else
14887 }
14890 }
14892 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
14893 constant. TYPE is the type of the result. */
14895 static tree
14897 {
14907 }
14909 /* Given CODE, a relational operator, the target type, TYPE and two
14910 constant operands OP0 and OP1, return the result of the
14911 relational operation. If the result is not a compile time
14912 constant, then return NULL_TREE. */
14914 static tree
14916 {
14919 /* From here on, the only cases we handle are when the result is
14920 known to be a constant. */
14923 {
14927 /* Handle the cases where either operand is a NaN. */
14929 {
14931 {
14959 }
14962 }
14965 }
14968 {
14972 }
14974 /* Handle equality/inequality of complex constants. */
14976 {
14987 else
14989 }
14991 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
14993 To compute GT, swap the arguments and do LT.
14994 To compute GE, do LT and invert the result.
14995 To compute LE, swap the arguments, do LT and invert the result.
14996 To compute NE, do EQ and invert the result.
14998 Therefore, the code below must handle only EQ and LT. */
15001 {
15006 }
15008 /* Note that it is safe to invert for real values here because we
15009 have already handled the one case that it matters. */
15013 {
15016 }
15018 /* Compute a result for LT or EQ if args permit;
15019 Otherwise return T. */
15021 {
15026 else
15028 }
15029 else
15035 }
15037 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
15038 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
15039 itself. */
15041 tree
15043 {
15044 /* If the expression does not have side effects then we don't have to wrap
15045 it with a cleanup point expression. */
15049 /* If the expression is a return, check to see if the expression inside the
15050 return has no side effects or the right hand side of the modify expression
15051 inside the return. If either don't have side effects set we don't need to
15052 wrap the expression in a cleanup point expression. Note we don't check the
15053 left hand side of the modify because it should always be a return decl. */
15055 {
15062 }
15065 }
15067 /* Given a pointer value OP0 and a type TYPE, return a simplified version
15068 of an indirection through OP0, or NULL_TREE if no simplification is
15069 possible. */
15071 tree
15073 {
15075 tree subtype;
15083 {
15086 /* *&CONST_DECL -> to the value of the const decl. */
15089 /* *&p => p; make sure to handle *&"str"[cst] here. */
15091 {
15095 else
15097 }
15098 /* *(foo *)&fooarray => fooarray[0] */
15101 {
15107 }
15108 /* *(foo *)&complexfoo => __real__ complexfoo */
15112 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
15115 {
15119 }
15120 }
15122 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
15125 {
15128 tree op00type;
15135 {
15146 }
15147 }
15150 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
15153 {
15156 tree op00type;
15163 {
15167 }
15168 }
15170 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
15173 {
15174 tree type_domain;
15181 }
15184 }
15186 /* Builds an expression for an indirection through T, simplifying some
15187 cases. */
15189 tree
15191 {
15197 else
15199 }
15201 /* Given an INDIRECT_REF T, return either T or a simplified version. */
15203 tree
15205 {
15210 else
15212 }
15214 /* Strip non-trapping, non-side-effecting tree nodes from an expression
15215 whose result is ignored. The type of the returned tree need not be
15216 the same as the original expression. */
15218 tree
15220 {
15226 {
15237 else
15243 {
15259 }
15264 }
15265 }
15267 /* Return the value of VALUE, rounded up to a multiple of DIVISOR.
15268 This can only be applied to objects of a sizetype. */
15270 tree
15272 {
15279 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
15280 have to do anything. Only do this when we are not given a const,
15281 because in that case, this check is more expensive than just
15282 doing it. */
15284 {
15289 }
15291 /* If divisor is a power of two, simplify this to bit manipulation. */
15293 {
15295 {
15308 {
15309 high++;
15312 }
15316 }
15317 else
15318 {
15319 tree t;
15325 }
15326 }
15327 else
15328 {
15333 }
15336 }
15338 /* Likewise, but round down. */
15340 tree
15342 {
15349 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
15350 have to do anything. Only do this when we are not given a const,
15351 because in that case, this check is more expensive than just
15352 doing it. */
15354 {
15359 }
15361 /* If divisor is a power of two, simplify this to bit manipulation. */
15363 {
15364 tree t;
15368 }
15369 else
15370 {
15375 }
15378 }
15380 /* Returns the pointer to the base of the object addressed by EXP and
15381 extracts the information about the offset of the access, storing it
15382 to PBITPOS and POFFSET. */
15384 static tree
15387 {
15388 tree core;
15391 HOST_WIDE_INT bitsize;
15394 {
15399 }
15400 else
15401 {
15405 }
15408 }
15410 /* Returns true if addresses of E1 and E2 differ by a constant, false
15411 otherwise. If they do, E1 - E2 is stored in *DIFF. */
15413 bool
15415 {
15429 {
15439 }
15441 {
15442 /* If only one of the offsets is non-constant, the difference cannot
15443 be a constant. */
15445 }
15446 else
15451 }
15453 /* Simplify the floating point expression EXP when the sign of the
15454 result is not significant. Return NULL_TREE if no simplification
15455 is possible. */
15457 tree
15459 {
15463 {
15498 {
15501 {
15503 /* Strip copysign function call, return the 1st argument. */
15509 /* Strip sign ops from the argument of "odd" math functions. */
15511 {
15515 }
15517 }
15518 }
15523 }
15525 }