| blob | a6b7ec7dfeced0a019ce2b7d4c2ee6abde25e84b |
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /*@@ This file should be rewritten to use an arbitrary precision
21 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
22 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
23 @@ The routines that translate from the ap rep should
24 @@ warn if precision et. al. is lost.
25 @@ This would also make life easier when this technology is used
26 @@ for cross-compilers. */
28 /* The entry points in this file are fold, size_int_wide and size_binop.
30 fold takes a tree as argument and returns a simplified tree.
32 size_binop takes a tree code for an arithmetic operation
33 and two operands that are trees, and produces a tree for the
34 result, assuming the type comes from `sizetype'.
36 size_int takes an integer value, and creates a tree constant
37 with type from `sizetype'.
39 Note: Since the folders get called on non-gimple code as well as
40 gimple code, we need to handle GIMPLE tuples as well as their
41 corresponding tree equivalents. */
82 #ifndef LOAD_EXTEND_OP
83 #define LOAD_EXTEND_OP(M) UNKNOWN
84 #endif
86 /* Nonzero if we are folding constants inside an initializer; zero
87 otherwise. */
90 /* The following constants represent a bit based encoding of GCC's
91 comparison operators. This encoding simplifies transformations
92 on relational comparison operators, such as AND and OR. */
110 };
148 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
149 Otherwise, return LOC. */
151 static location_t
153 {
156 }
158 /* Similar to protected_set_expr_location, but never modify x in place,
159 if location can and needs to be set, unshare it. */
163 {
169 {
172 }
174 }
175 \f
176 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
177 division and returns the quotient. Otherwise returns
178 NULL_TREE. */
180 tree
182 {
183 widest_int quo;
190 }
191 \f
192 /* This is nonzero if we should defer warnings about undefined
193 overflow. This facility exists because these warnings are a
194 special case. The code to estimate loop iterations does not want
195 to issue any warnings, since it works with expressions which do not
196 occur in user code. Various bits of cleanup code call fold(), but
197 only use the result if it has certain characteristics (e.g., is a
198 constant); that code only wants to issue a warning if the result is
199 used. */
203 /* If a warning about undefined overflow is deferred, this is the
204 warning. Note that this may cause us to turn two warnings into
205 one, but that is fine since it is sufficient to only give one
206 warning per expression. */
210 /* If a warning about undefined overflow is deferred, this is the
211 level at which the warning should be emitted. */
215 /* Start deferring overflow warnings. We could use a stack here to
216 permit nested calls, but at present it is not necessary. */
218 void
220 {
222 }
224 /* Stop deferring overflow warnings. If there is a pending warning,
225 and ISSUE is true, then issue the warning if appropriate. STMT is
226 the statement with which the warning should be associated (used for
227 location information); STMT may be NULL. CODE is the level of the
228 warning--a warn_strict_overflow_code value. This function will use
229 the smaller of CODE and the deferred code when deciding whether to
230 issue the warning. CODE may be zero to mean to always use the
231 deferred code. */
233 void
235 {
237 location_t locus;
242 {
248 }
259 /* Use the smallest code level when deciding to issue the
260 warning. */
269 else
272 }
274 /* Stop deferring overflow warnings, ignoring any deferred
275 warnings. */
277 void
279 {
281 }
283 /* Whether we are deferring overflow warnings. */
285 bool
287 {
289 }
291 /* This is called when we fold something based on the fact that signed
292 overflow is undefined. */
294 void
296 {
298 {
301 {
304 }
305 }
308 }
309 \f
310 /* Return true if the built-in mathematical function specified by CODE
311 is odd, i.e. -f(x) == f(-x). */
313 bool
315 {
317 {
318 CASE_CFN_ASIN:
319 CASE_CFN_ASINH:
320 CASE_CFN_ATAN:
321 CASE_CFN_ATANH:
322 CASE_CFN_CASIN:
323 CASE_CFN_CASINH:
324 CASE_CFN_CATAN:
325 CASE_CFN_CATANH:
326 CASE_CFN_CBRT:
327 CASE_CFN_CPROJ:
328 CASE_CFN_CSIN:
329 CASE_CFN_CSINH:
330 CASE_CFN_CTAN:
331 CASE_CFN_CTANH:
332 CASE_CFN_ERF:
333 CASE_CFN_LLROUND:
334 CASE_CFN_LROUND:
335 CASE_CFN_ROUND:
336 CASE_CFN_SIN:
337 CASE_CFN_SINH:
338 CASE_CFN_TAN:
339 CASE_CFN_TANH:
340 CASE_CFN_TRUNC:
343 CASE_CFN_LLRINT:
344 CASE_CFN_LRINT:
345 CASE_CFN_NEARBYINT:
346 CASE_CFN_RINT:
351 }
353 }
355 /* Check whether we may negate an integer constant T without causing
356 overflow. */
358 bool
360 {
361 tree type;
370 }
372 /* Determine whether an expression T can be cheaply negated using
373 the function negate_expr without introducing undefined overflow. */
375 static bool
377 {
378 tree type;
387 {
392 /* Check that -CST will not overflow type. */
405 /* We want to canonicalize to positive real constants. Pretend
406 that only negative ones can be easily negated. */
414 {
425 }
440 /* -(A + B) -> (-B) - A. */
445 /* -(A + B) -> (-A) - B. */
449 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
460 /* INT_MIN/n * n doesn't overflow while negating one operand it does
461 if n is a power of two. */
470 /* Fall through. */
485 /* In general we can't negate B in A / B, because if A is INT_MIN and
486 B is 1, we may turn this into INT_MIN / -1 which is undefined
487 and actually traps on some architectures. */
496 /* Negate -((double)float) as (double)(-float). */
498 {
502 }
506 /* Negate -f(x) as f(-x). */
512 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
514 {
518 }
523 }
525 }
527 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
528 simplification is possible.
529 If negate_expr_p would return true for T, NULL_TREE will never be
530 returned. */
532 static tree
534 {
536 tree tem;
539 {
540 /* Convert - (~A) to A + 1. */
566 {
571 }
575 {
580 {
584 }
587 }
610 {
611 /* -(A + B) -> (-B) - A. */
615 {
619 }
621 /* -(A + B) -> (-A) - B. */
623 {
627 }
628 }
632 /* - (A - B) -> B - A */
644 /* Fall through. */
648 {
657 }
669 /* In general we can't negate B in A / B, because if A is INT_MIN and
670 B is 1, we may turn this into INT_MIN / -1 which is undefined
671 and actually traps on some architectures. */
683 /* Convert -((double)float) into (double)(-float). */
685 {
689 }
693 /* Negate -f(x) as f(-x). */
696 {
702 }
706 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
708 {
711 {
718 }
719 }
724 }
727 }
729 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
730 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
731 return NULL_TREE. */
733 static tree
735 {
737 location_t loc;
750 }
751 \f
752 /* Split a tree IN into a constant, literal and variable parts that could be
753 combined with CODE to make IN. "constant" means an expression with
754 TREE_CONSTANT but that isn't an actual constant. CODE must be a
755 commutative arithmetic operation. Store the constant part into *CONP,
756 the literal in *LITP and return the variable part. If a part isn't
757 present, set it to null. If the tree does not decompose in this way,
758 return the entire tree as the variable part and the other parts as null.
760 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
761 case, we negate an operand that was subtracted. Except if it is a
762 literal for which we use *MINUS_LITP instead.
764 If NEGATE_P is true, we are negating all of IN, again except a literal
765 for which we use *MINUS_LITP instead. If a variable part is of pointer
766 type, it is negated after converting to TYPE. This prevents us from
767 generating illegal MINUS pointer expression. LOC is the location of
768 the converted variable part.
770 If IN is itself a literal or constant, return it as appropriate.
772 Note that we do not guarantee that any of the three values will be the
773 same type as IN, but they will have the same signedness and mode. */
775 static tree
778 {
785 /* Strip any conversions that don't change the machine mode or signedness. */
794 /* We can associate addition and subtraction together (even
795 though the C standard doesn't say so) for integers because
796 the value is not affected. For reals, the value might be
797 affected, so we can't. */
800 {
806 /* First see if either of the operands is a literal, then a constant. */
819 /* If we haven't dealt with either operand, this is not a case we can
820 decompose. Otherwise, VAR is either of the ones remaining, if any. */
825 else
828 /* Now do any needed negations. */
834 {
835 /* Convert to TYPE before negating. */
838 }
839 }
844 {
845 /* -X - 1 is folded to ~X, undo that here. Do _not_ do this
846 when IN is constant. */
849 }
850 else
854 {
861 {
862 /* Convert to TYPE before negating. */
865 }
866 }
869 }
871 /* Re-associate trees split by the above function. T1 and T2 are
872 either expressions to associate or null. Return the new
873 expression, if any. LOC is the location of the new expression. If
874 we build an operation, do it in TYPE and with CODE. */
876 static tree
878 {
884 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
885 try to fold this since we will have infinite recursion. But do
886 deal with any NEGATE_EXPRs. */
889 {
891 {
904 }
906 {
909 }
913 }
917 }
918 \f
919 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
920 for use in int_const_binop, size_binop and size_diffop. */
922 static bool
924 {
931 {
940 }
945 }
948 /* Combine two integer constants ARG1 and ARG2 under operation CODE
949 to produce a new constant. Return NULL_TREE if we don't know how
950 to evaluate CODE at compile-time. */
952 static tree
955 {
956 wide_int res;
957 tree t;
965 {
981 {
985 else
987 }
990 /* It's unclear from the C standard whether shifts can overflow.
991 The following code ignores overflow; perhaps a C standard
992 interpretation ruling is needed. */
994 else
1001 {
1005 else
1007 }
1011 else
1090 }
1098 }
1100 tree
1102 {
1104 }
1106 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1107 constant. We assume ARG1 and ARG2 have the same data type, or at least
1108 are the same kind of constant and the same machine mode. Return zero if
1109 combining the constants is not allowed in the current operating mode. */
1111 static tree
1113 {
1114 /* Sanity check for the recursive cases. */
1122 {
1128 }
1131 {
1132 machine_mode mode;
1133 REAL_VALUE_TYPE d1;
1134 REAL_VALUE_TYPE d2;
1135 REAL_VALUE_TYPE value;
1136 REAL_VALUE_TYPE result;
1140 /* The following codes are handled by real_arithmetic. */
1142 {
1153 }
1161 /* Don't perform operation if we honor signaling NaNs and
1162 either operand is a signaling NaN. */
1168 /* Don't perform operation if it would raise a division
1169 by zero exception. */
1175 /* If either operand is a NaN, just return it. Otherwise, set up
1176 for floating-point trap; we return an overflow. */
1178 {
1179 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1180 is off. */
1184 }
1186 {
1187 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1188 is off. */
1192 }
1197 /* Don't constant fold this floating point operation if
1198 the result has overflowed and flag_trapping_math. */
1206 /* Don't constant fold this floating point operation if the
1207 result may dependent upon the run-time rounding mode and
1208 flag_rounding_math is set, or if GCC's software emulation
1209 is unable to accurately represent the result. */
1219 }
1222 {
1223 FIXED_VALUE_TYPE f1;
1224 FIXED_VALUE_TYPE f2;
1225 FIXED_VALUE_TYPE result;
1230 /* The following codes are handled by fixed_arithmetic. */
1232 {
1244 {
1251 }
1256 }
1263 /* Propagate overflow flags. */
1267 }
1270 {
1279 {
1290 mpc_mul);
1304 mpc_div);
1305 /* Fallthru. */
1311 {
1312 /* Keep this algorithm in sync with
1313 tree-complex.c:expand_complex_div_straight().
1315 Expand complex division to scalars, straightforward algorithm.
1316 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1317 t = br*br + bi*bi
1318 */
1319 tree magsquared
1323 tree t1
1327 tree t2
1334 }
1335 else
1336 {
1337 /* Keep this algorithm in sync with
1338 tree-complex.c:expand_complex_div_wide().
1340 Expand complex division to scalars, modified algorithm to minimize
1341 overflow with wide input ranges. */
1347 {
1348 /* In the TRUE branch, we compute
1349 ratio = br/bi;
1350 div = (br * ratio) + bi;
1351 tr = (ar * ratio) + ai;
1352 ti = (ai * ratio) - ar;
1353 tr = tr / div;
1354 ti = ti / div; */
1365 }
1366 else
1367 {
1368 /* In the FALSE branch, we compute
1369 ratio = d/c;
1370 divisor = (d * ratio) + c;
1371 tr = (b * ratio) + a;
1372 ti = b - (a * ratio);
1373 tr = tr / div;
1374 ti = ti / div; */
1386 }
1387 }
1392 }
1396 }
1400 {
1406 {
1412 /* It is possible that const_binop cannot handle the given
1413 code and return NULL_TREE */
1416 }
1419 }
1421 /* Shifts allow a scalar offset for a vector. */
1424 {
1430 {
1435 /* It is possible that const_binop cannot handle the given
1436 code and return NULL_TREE. */
1439 }
1442 }
1444 }
1446 /* Overload that adds a TYPE parameter to be able to dispatch
1447 to fold_relational_const. */
1449 tree
1451 {
1455 /* ??? Until we make the const_binop worker take the type of the
1456 result as argument put those cases that need it here. */
1458 {
1469 {
1485 {
1491 }
1494 }
1500 {
1525 {
1538 }
1541 }
1544 }
1549 /* Make sure type and arg0 have the same saturating flag. */
1554 }
1556 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1557 Return zero if computing the constants is not possible. */
1559 tree
1561 {
1562 /* Don't perform the operation, other than NEGATE and ABS, if
1563 flag_signaling_nans is on and the operand is a signaling NaN. */
1572 {
1573 CASE_CONVERT:
1580 /* If the source address is 0, and the source address space
1581 cannot have a valid object at 0, fold to dest type null. */
1592 {
1593 /* Can't call fold_negate_const directly here as that doesn't
1594 handle all cases and we might not be able to negate some
1595 constants. */
1600 }
1609 {
1613 }
1619 /* Perform BIT_NOT_EXPR on each element individually. */
1621 {
1623 tree elem;
1628 {
1634 }
1637 }
1659 {
1678 else
1682 {
1686 }
1689 }
1694 {
1708 {
1713 }
1716 {
1720 }
1723 }
1727 }
1730 }
1732 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1733 indicates which particular sizetype to create. */
1735 tree
1737 {
1739 }
1740 \f
1741 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1742 is a tree code. The type of the result is taken from the operands.
1743 Both must be equivalent integer types, ala int_binop_types_match_p.
1744 If the operands are constant, so is the result. */
1746 tree
1748 {
1757 /* Handle the special case of two integer constants faster. */
1759 {
1760 /* And some specific cases even faster than that. */
1762 {
1767 }
1769 {
1772 }
1774 {
1777 }
1779 /* Handle general case of two integer constants. For sizetype
1780 constant calculations we always want to know about overflow,
1781 even in the unsigned case. */
1783 }
1786 }
1788 /* Given two values, either both of sizetype or both of bitsizetype,
1789 compute the difference between the two values. Return the value
1790 in signed type corresponding to the type of the operands. */
1792 tree
1794 {
1796 tree ctype;
1801 /* If the type is already signed, just do the simple thing. */
1809 else
1812 /* If either operand is not a constant, do the conversions to the signed
1813 type and subtract. The hardware will do the right thing with any
1814 overflow in the subtraction. */
1820 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1821 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1822 overflow) and negate (which can't either). Special-case a result
1823 of zero while we're here. */
1829 else
1833 MINUS_EXPR,
1835 }
1836 \f
1837 /* A subroutine of fold_convert_const handling conversions of an
1838 INTEGER_CST to another integer type. */
1840 static tree
1842 {
1843 /* Given an integer constant, make new constant with new type,
1844 appropriately sign-extended or truncated. Use widest_int
1845 so that any extension is done according ARG1's type. */
1849 }
1851 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1852 to an integer type. */
1854 static tree
1856 {
1858 tree t;
1860 /* The following code implements the floating point to integer
1861 conversion rules required by the Java Language Specification,
1862 that IEEE NaNs are mapped to zero and values that overflow
1863 the target precision saturate, i.e. values greater than
1864 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1865 are mapped to INT_MIN. These semantics are allowed by the
1866 C and C++ standards that simply state that the behavior of
1867 FP-to-integer conversion is unspecified upon overflow. */
1869 wide_int val;
1870 REAL_VALUE_TYPE r;
1874 {
1881 }
1883 /* If R is NaN, return zero and show we have an overflow. */
1885 {
1888 }
1890 /* See if R is less than the lower bound or greater than the
1891 upper bound. */
1894 {
1898 {
1901 }
1902 }
1905 {
1908 {
1911 {
1914 }
1915 }
1916 }
1923 }
1925 /* A subroutine of fold_convert_const handling conversions of a
1926 FIXED_CST to an integer type. */
1928 static tree
1930 {
1931 tree t;
1935 /* Right shift FIXED_CST to temp by fbit. */
1939 {
1941 HOST_BITS_PER_DOUBLE_INT,
1944 /* Left shift temp to temp_trunc by fbit. */
1946 HOST_BITS_PER_DOUBLE_INT,
1948 }
1949 else
1950 {
1953 }
1955 /* If FIXED_CST is negative, we need to round the value toward 0.
1956 By checking if the fractional bits are not zero to add 1 to temp. */
1962 /* Given a fixed-point constant, make new constant with new type,
1963 appropriately sign-extended or truncated. */
1971 }
1973 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1974 to another floating point type. */
1976 static tree
1978 {
1979 REAL_VALUE_TYPE value;
1980 tree t;
1982 /* Don't perform the operation if flag_signaling_nans is on
1983 and the operand is a signaling NaN. */
1991 /* If converting an infinity or NAN to a representation that doesn't
1992 have one, set the overflow bit so that we can produce some kind of
1993 error message at the appropriate point if necessary. It's not the
1994 most user-friendly message, but it's better than nothing. */
2001 /* Regular overflow, conversion produced an infinity in a mode that
2002 can't represent them. */
2007 else
2010 }
2012 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2013 to a floating point type. */
2015 static tree
2017 {
2018 REAL_VALUE_TYPE value;
2019 tree t;
2026 }
2028 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2029 to another fixed-point type. */
2031 static tree
2033 {
2034 FIXED_VALUE_TYPE value;
2035 tree t;
2042 /* Propagate overflow flags. */
2046 }
2048 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2049 to a fixed-point type. */
2051 static tree
2053 {
2054 FIXED_VALUE_TYPE value;
2055 tree t;
2057 double_int di;
2064 else
2072 /* Propagate overflow flags. */
2076 }
2078 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2079 to a fixed-point type. */
2081 static tree
2083 {
2084 FIXED_VALUE_TYPE value;
2085 tree t;
2093 /* Propagate overflow flags. */
2097 }
2099 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2100 type TYPE. If no simplification can be done return NULL_TREE. */
2102 static tree
2104 {
2110 {
2117 }
2119 {
2126 }
2128 {
2135 }
2137 {
2140 {
2145 {
2151 }
2153 }
2154 }
2156 }
2158 /* Construct a vector of zero elements of vector type TYPE. */
2160 static tree
2162 {
2163 tree t;
2167 }
2169 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2171 bool
2173 {
2188 {
2203 }
2204 }
2206 /* Convert expression ARG to type TYPE. Used by the middle-end for
2207 simple conversions in preference to calling the front-end's convert. */
2209 tree
2211 {
2213 tree tem;
2224 {
2227 /* Handle conversions between pointers to different address spaces. */
2232 /* fall through */
2237 {
2241 }
2255 {
2259 }
2261 {
2265 }
2267 {
2271 }
2274 {
2292 }
2297 {
2301 }
2304 {
2318 }
2322 {
2331 integer_zero_node));
2333 {
2337 {
2343 }
2351 }
2355 }
2373 }
2374 fold_convert_exit:
2377 }
2378 \f
2379 /* Return false if expr can be assumed not to be an lvalue, true
2380 otherwise. */
2382 static bool
2384 {
2385 /* We only need to wrap lvalue tree codes. */
2387 {
2418 /* Assume the worst for front-end tree codes. */
2422 }
2425 }
2427 /* Return an expr equal to X but certainly not valid as an lvalue. */
2429 tree
2431 {
2432 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2433 us. */
2440 }
2442 /* When pedantic, return an expr equal to X but certainly not valid as a
2443 pedantic lvalue. Otherwise, return X. */
2445 static tree
2447 {
2449 }
2450 \f
2451 /* Given a tree comparison code, return the code that is the logical inverse.
2452 It is generally not safe to do this for floating-point comparisons, except
2453 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2454 ERROR_MARK in this case. */
2456 enum tree_code
2458 {
2464 {
2495 }
2496 }
2498 /* Similar, but return the comparison that results if the operands are
2499 swapped. This is safe for floating-point. */
2501 enum tree_code
2503 {
2505 {
2531 }
2532 }
2535 /* Convert a comparison tree code from an enum tree_code representation
2536 into a compcode bit-based encoding. This function is the inverse of
2537 compcode_to_comparison. */
2539 static enum comparison_code
2541 {
2543 {
2574 }
2575 }
2577 /* Convert a compcode bit-based encoding of a comparison operator back
2578 to GCC's enum tree_code representation. This function is the
2579 inverse of comparison_to_compcode. */
2581 static enum tree_code
2583 {
2585 {
2616 }
2617 }
2619 /* Return a tree for the comparison which is the combination of
2620 doing the AND or OR (depending on CODE) of the two operations LCODE
2621 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2622 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2623 if this makes the transformation invalid. */
2625 tree
2630 {
2637 {
2648 }
2651 {
2652 /* Eliminate unordered comparisons, as well as LTGT and ORD
2653 which are not used unless the mode has NaNs. */
2659 }
2661 {
2662 /* Check that the original operation and the optimized ones will trap
2663 under the same condition. */
2674 /* In a short-circuited boolean expression the LHS might be
2675 such that the RHS, if evaluated, will never trap. For
2676 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2677 if neither x nor y is NaN. (This is a mixed blessing: for
2678 example, the expression above will never trap, hence
2679 optimizing it to x < y would be invalid). */
2684 /* If the comparison was short-circuited, and only the RHS
2685 trapped, we may now generate a spurious trap. */
2690 /* If we changed the conditions that cause a trap, we lose. */
2693 }
2699 else
2700 {
2705 }
2706 }
2707 \f
2708 /* Return nonzero if two operands (typically of the same tree node)
2709 are necessarily equal. FLAGS modifies behavior as follows:
2711 If OEP_ONLY_CONST is set, only return nonzero for constants.
2712 This function tests whether the operands are indistinguishable;
2713 it does not test whether they are equal using C's == operation.
2714 The distinction is important for IEEE floating point, because
2715 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2716 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2718 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2719 even though it may hold multiple values during a function.
2720 This is because a GCC tree node guarantees that nothing else is
2721 executed between the evaluation of its "operands" (which may often
2722 be evaluated in arbitrary order). Hence if the operands themselves
2723 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2724 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2725 unset means assuming isochronic (or instantaneous) tree equivalence.
2726 Unless comparing arbitrary expression trees, such as from different
2727 statements, this flag can usually be left unset.
2729 If OEP_PURE_SAME is set, then pure functions with identical arguments
2730 are considered the same. It is used when the caller has other ways
2731 to ensure that global memory is unchanged in between.
2733 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2734 not values of expressions.
2736 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2737 any operand with side effect. This is unnecesarily conservative in the
2738 case we know that arg0 and arg1 are in disjoint code paths (such as in
2739 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2740 addresses with TREE_CONSTANT flag set so we know that &var == &var
2741 even if var is volatile. */
2743 int
2745 {
2746 /* When checking, verify at the outermost operand_equal_p call that
2747 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
2748 hash value. */
2750 {
2752 {
2754 {
2761 }
2763 }
2764 else
2766 }
2768 /* If either is ERROR_MARK, they aren't equal. */
2774 /* Similar, if either does not have a type (like a released SSA name),
2775 they aren't equal. */
2779 /* We cannot consider pointers to different address space equal. */
2786 /* Check equality of integer constants before bailing out due to
2787 precision differences. */
2789 {
2790 /* Address of INTEGER_CST is not defined; check that we did not forget
2791 to drop the OEP_ADDRESS_OF flags. */
2794 }
2797 {
2798 /* If both types don't have the same signedness, then we can't consider
2799 them equal. We must check this before the STRIP_NOPS calls
2800 because they may change the signedness of the arguments. As pointers
2801 strictly don't have a signedness, require either two pointers or
2802 two non-pointers as well. */
2808 /* If both types don't have the same precision, then it is not safe
2809 to strip NOPs. */
2816 }
2817 #if 0
2818 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
2819 sanity check once the issue is solved. */
2820 else
2821 /* Addresses of conversions and SSA_NAMEs (and many other things)
2822 are not defined. Check that we did not forget to drop the
2823 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
2826 #endif
2828 /* In case both args are comparisons but with different comparison
2829 code, try to swap the comparison operands of one arg to produce
2830 a match and compare that variant. */
2834 {
2842 }
2845 {
2846 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2848 ;
2850 {
2851 /* If we are interested in comparing addresses ignore
2852 MEM_REF wrappings of the base that can appear just for
2853 TBAA reasons. */
2867 }
2868 else
2870 }
2872 /* When not checking adddresses, this is needed for conversions and for
2873 COMPONENT_REF. Might as well play it safe and always test this. */
2880 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2881 We don't care about side effects in that case because the SAVE_EXPR
2882 takes care of that for us. In all other cases, two expressions are
2883 equal if they have no side effects. If we have two identical
2884 expressions with side effects that should be treated the same due
2885 to the only side effects being identical SAVE_EXPR's, that will
2886 be detected in the recursive calls below.
2887 If we are taking an invariant address of two identical objects
2888 they are necessarily equal as well. */
2895 /* Next handle constant cases, those for which we can return 1 even
2896 if ONLY_CONST is set. */
2899 {
2913 {
2914 /* If we do not distinguish between signed and unsigned zero,
2915 consider them equal. */
2918 }
2922 {
2929 {
2933 }
2935 }
2939 flags)
2941 flags));
2952 flags | OEP_ADDRESS_OF
2955 /* In GIMPLE empty constructors are allowed in initializers of
2956 aggregates. */
2960 }
2965 /* Define macros to test an operand from arg0 and arg1 for equality and a
2966 variant that allows null and views null as being different from any
2967 non-null value. In the latter case, if either is null, the both
2968 must be; otherwise, do the normal comparison. */
2969 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2970 TREE_OPERAND (arg1, N), flags)
2972 #define OP_SAME_WITH_NULL(N) \
2973 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2974 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2977 {
2979 /* Two conversions are equal only if signedness and modes match. */
2981 {
2982 CASE_CONVERT:
2990 }
3000 /* For commutative ops, allow the other order. */
3008 /* If either of the pointer (or reference) expressions we are
3009 dereferencing contain a side effect, these cannot be equal,
3010 but their addresses can be. */
3017 {
3027 /* Require the same offset. */
3033 /* Fallthru. */
3041 {
3042 /* Require equal access sizes */
3048 flags)))
3050 /* Verify that access happens in similar types. */
3053 /* Verify that accesses are TBAA compatible. */
3062 /* Verify that alignment is compatible. */
3066 }
3069 /* TARGET_MEM_REF require equal extra operands. */
3080 /* Compare the array index by value if it is constant first as we
3081 may have different types but same value here. */
3087 /* Compare low bound and element size as with OEP_ADDRESS_OF
3088 we have to account for the offset of the ref. */
3093 array_ref_low_bound
3097 array_ref_element_size
3099 flags))));
3102 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3103 may be NULL when we're called to compare MEM_EXPRs. */
3118 }
3122 {
3124 /* Be sure we pass right ADDRESS_OF flag. */
3142 /* The multiplcation operands are commutative. */
3143 /* FALLTHRU */
3151 /* Otherwise take into account this is a commutative operation. */
3170 }
3174 {
3178 /* If not both CALL_EXPRs are either internal or normal function
3179 functions, then they are not equal. */
3182 {
3183 /* If the CALL_EXPRs call different internal functions, then they
3184 are not equal. */
3187 }
3188 else
3189 {
3190 /* If the CALL_EXPRs call different functions, then they are not
3191 equal. */
3193 flags))
3195 }
3197 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3198 {
3202 else
3206 }
3208 /* Now see if all the arguments are the same. */
3209 {
3220 /* If we get here and both argument lists are exhausted
3221 then the CALL_EXPRs are equal. */
3223 }
3226 }
3229 /* Consider __builtin_sqrt equal to sqrt. */
3237 {
3238 /* In GIMPLE constructors are used only to build vectors from
3239 elements. Individual elements in the constructor must be
3240 indexed in increasing order and form an initial sequence.
3242 We make no effort to compare constructors in generic.
3243 (see sem_variable::equals in ipa-icf which can do so for
3244 constants). */
3249 /* Be sure that vectors constructed have the same representation.
3250 We only tested element precision and modes to match.
3251 Vectors may be BLKmode and thus also check that the number of
3252 parts match. */
3265 {
3270 /* In GIMPLE the indexes can be either NULL or matching i.
3271 Double check this so we won't get false
3272 positives for GENERIC. */
3280 }
3282 }
3287 }
3289 #undef OP_SAME
3290 #undef OP_SAME_WITH_NULL
3291 }
3292 \f
3293 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3294 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3296 When in doubt, return 0. */
3298 static int
3300 {
3312 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3313 and see if the inner values are the same. This removes any
3314 signedness comparison, which doesn't matter here. */
3321 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3322 actual comparison operand, ARG0.
3324 First throw away any conversions to wider types
3325 already present in the operands. */
3334 {
3337 /* Make sure shorter operand is extended the right way
3338 to match the longer operand. */
3344 }
3347 }
3348 \f
3349 /* See if ARG is an expression that is either a comparison or is performing
3350 arithmetic on comparisons. The comparisons must only be comparing
3351 two different values, which will be stored in *CVAL1 and *CVAL2; if
3352 they are nonzero it means that some operands have already been found.
3353 No variables may be used anywhere else in the expression except in the
3354 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3355 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3357 If this is true, return 1. Otherwise, return zero. */
3359 static int
3361 {
3365 /* We can handle some of the tcc_expression cases here. */
3375 {
3376 /* If we've already found a CVAL1 or CVAL2, this expression is
3377 two complex to handle. */
3383 }
3386 {
3409 /* First see if we can handle the first operand, then the second. For
3410 the second operand, we know *CVAL1 can't be zero. It must be that
3411 one side of the comparison is each of the values; test for the
3412 case where this isn't true by failing if the two operands
3413 are the same. */
3422 ;
3426 ;
3427 else
3431 ;
3435 ;
3436 else
3443 }
3444 }
3445 \f
3446 /* ARG is a tree that is known to contain just arithmetic operations and
3447 comparisons. Evaluate the operations in the tree substituting NEW0 for
3448 any occurrence of OLD0 as an operand of a comparison and likewise for
3449 NEW1 and OLD1. */
3451 static tree
3454 {
3459 /* We can handle some of the tcc_expression cases here. */
3467 {
3482 {
3501 }
3502 /* Fall through - ??? */
3505 {
3509 /* We need to check both for exact equality and tree equality. The
3510 former will be true if the operand has a side-effect. In that
3511 case, we know the operand occurred exactly once. */
3524 }
3528 }
3529 }
3530 \f
3531 /* Return a tree for the case when the result of an expression is RESULT
3532 converted to TYPE and OMITTED was previously an operand of the expression
3533 but is now not needed (e.g., we folded OMITTED * 0).
3535 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3536 the conversion of RESULT to TYPE. */
3538 tree
3540 {
3543 /* If the resulting operand is an empty statement, just return the omitted
3544 statement casted to void. */
3554 }
3556 /* Return a tree for the case when the result of an expression is RESULT
3557 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3558 of the expression but are now not needed.
3560 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3561 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3562 evaluated before OMITTED2. Otherwise, if neither has side effects,
3563 just do the conversion of RESULT to TYPE. */
3565 tree
3568 {
3577 }
3579 \f
3580 /* Return a simplified tree node for the truth-negation of ARG. This
3581 never alters ARG itself. We assume that ARG is an operation that
3582 returns a truth value (0 or 1).
3584 FIXME: one would think we would fold the result, but it causes
3585 problems with the dominator optimizer. */
3587 static tree
3589 {
3594 /* If this is a comparison, we can simply invert it, except for
3595 floating-point non-equality comparisons, in which case we just
3596 enclose a TRUTH_NOT_EXPR around what we have. */
3599 {
3602 && flag_trapping_math
3616 }
3619 {
3638 /* Here we can invert either operand. We invert the first operand
3639 unless the second operand is a TRUTH_NOT_EXPR in which case our
3640 result is the XOR of the first operand with the inside of the
3641 negation of the second operand. */
3646 else
3669 {
3676 /* A COND_EXPR may have a throw as one operand, which
3677 then has void type. Just leave void operands
3678 as they are. */
3684 }
3696 CASE_CONVERT:
3700 /* fall through */
3722 }
3723 }
3725 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3726 assume that ARG is an operation that returns a truth value (0 or 1
3727 for scalars, 0 or -1 for vectors). Return the folded expression if
3728 folding is successful. Otherwise, return NULL_TREE. */
3730 static tree
3732 {
3735 ? BIT_NOT_EXPR
3738 }
3740 /* Return a simplified tree node for the truth-negation of ARG. This
3741 never alters ARG itself. We assume that ARG is an operation that
3742 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3744 tree
3746 {
3752 ? BIT_NOT_EXPR
3755 }
3757 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3758 with code CODE. This optimization is unsafe. */
3759 static tree
3762 {
3766 /* (A / C) +- (B / C) -> (A +- B) / C. */
3776 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3781 {
3793 }
3796 }
3797 \f
3798 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3799 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
3800 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
3801 is the original memory reference used to preserve the alias set of
3802 the access. */
3804 static tree
3808 {
3814 build_int_cst
3818 {
3825 }
3840 }
3842 /* Optimize a bit-field compare.
3844 There are two cases: First is a compare against a constant and the
3845 second is a comparison of two items where the fields are at the same
3846 bit position relative to the start of a chunk (byte, halfword, word)
3847 large enough to contain it. In these cases we can avoid the shift
3848 implicit in bitfield extractions.
3850 For constants, we emit a compare of the shifted constant with the
3851 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3852 compared. For two fields at the same position, we do the ANDs with the
3853 similar mask and compare the result of the ANDs.
3855 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3856 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3857 are the left and right operands of the comparison, respectively.
3859 If the optimization described above can be done, we return the resulting
3860 tree. Otherwise we return zero. */
3862 static tree
3865 {
3868 tree unsigned_type;
3875 tree mask;
3876 tree offset;
3878 /* Get all the information about the extractions being done. If the bit size
3879 if the same as the size of the underlying object, we aren't doing an
3880 extraction at all and so can do nothing. We also don't want to
3881 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3882 then will no longer be able to replace it. */
3891 else
3892 {
3893 /* If this is not a constant, we can only do something if bit positions,
3894 sizes, signedness and storage order are the same. */
3895 rinner
3903 }
3905 /* Honor the C++ memory model and mimic what RTL expansion does. */
3909 {
3913 }
3915 /* See if we can find a mode to refer to this field. We should be able to,
3916 but fail if we can't. */
3925 /* Set signed and unsigned types of the precision of this mode for the
3926 shifts below. */
3929 /* Compute the bit position and size for the new reference and our offset
3930 within it. If the new reference is the same size as the original, we
3931 won't optimize anything, so return zero. */
3941 /* Make the mask to be used against the extracted field. */
3948 /* If not comparing with constant, just rework the comparison
3949 and return. */
3953 unsigned_type,
3956 mask),
3959 unsigned_type,
3962 mask));
3964 /* Otherwise, we are handling the constant case. See if the constant is too
3965 big for the field. Warn and return a tree for 0 (false) if so. We do
3966 this not only for its own sake, but to avoid having to test for this
3967 error case below. If we didn't, we might generate wrong code.
3969 For unsigned fields, the constant shifted right by the field length should
3970 be all zero. For signed fields, the high-order bits should agree with
3971 the sign bit. */
3974 {
3976 {
3980 }
3981 }
3982 else
3983 {
3986 {
3990 }
3991 }
3993 /* Single-bit compares should always be against zero. */
3995 {
3998 }
4000 /* Make a new bitfield reference, shift the constant over the
4001 appropriate number of bits and mask it with the computed mask
4002 (in case this was a signed field). If we changed it, make a new one. */
4010 mask);
4015 }
4016 \f
4017 /* Subroutine for fold_truth_andor_1: decode a field reference.
4019 If EXP is a comparison reference, we return the innermost reference.
4021 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4022 set to the starting bit number.
4024 If the innermost field can be completely contained in a mode-sized
4025 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4027 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4028 otherwise it is not changed.
4030 *PUNSIGNEDP is set to the signedness of the field.
4032 *PREVERSEP is set to the storage order of the field.
4034 *PMASK is set to the mask used. This is either contained in a
4035 BIT_AND_EXPR or derived from the width of the field.
4037 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4039 Return 0 if this is not a component reference or is one that we can't
4040 do anything with. */
4042 static tree
4047 {
4052 tree unsigned_type;
4055 /* All the optimizations using this function assume integer fields.
4056 There are problems with FP fields since the type_for_size call
4057 below can fail for, e.g., XFmode. */
4061 /* We are interested in the bare arrangement of bits, so strip everything
4062 that doesn't affect the machine mode. However, record the type of the
4063 outermost expression if it may matter below. */
4070 {
4076 }
4087 /* If the number of bits in the reference is the same as the bitsize of
4088 the outer type, then the outer type gives the signedness. Otherwise
4089 (in case of a small bitfield) the signedness is unchanged. */
4093 /* Compute the mask to access the bitfield. */
4102 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4110 }
4112 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4113 bit positions and MASK is SIGNED. */
4115 static int
4117 {
4121 /* If this function returns true when the type of the mask is
4122 UNSIGNED, then there will be errors. In particular see
4123 gcc.c-torture/execute/990326-1.c. There does not appear to be
4124 any documentation paper trail as to why this is so. But the pre
4125 wide-int worked with that restriction and it has been preserved
4126 here. */
4131 }
4133 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4134 represents the sign bit of EXP's type. If EXP represents a sign
4135 or zero extension, also test VAL against the unextended type.
4136 The return value is the (sub)expression whose sign bit is VAL,
4137 or NULL_TREE otherwise. */
4139 tree
4141 {
4143 tree t;
4145 /* Tree EXP must have an integral type. */
4150 /* Tree VAL must be an integer constant. */
4159 /* Handle extension from a narrower type. */
4165 }
4167 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4168 to be evaluated unconditionally. */
4170 static int
4172 {
4173 /* Strip any conversions that don't change the machine mode. */
4182 /* Don't regard global variables as simple. They may be
4183 allocated in ways unknown to the compiler (shared memory,
4184 #pragma weak, etc). */
4187 /* Weakrefs are not safe to be read, since they can be NULL.
4188 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4189 have DECL_WEAK flag set. */
4191 /* Loading a static variable is unduly expensive, but global
4192 registers aren't expensive. */
4194 }
4196 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4197 to be evaluated unconditionally.
4198 I addition to simple_operand_p, we assume that comparisons, conversions,
4199 and logic-not operations are simple, if their operands are simple, too. */
4201 static bool
4203 {
4223 }
4225 \f
4226 /* The following functions are subroutines to fold_range_test and allow it to
4227 try to change a logical combination of comparisons into a range test.
4229 For example, both
4230 X == 2 || X == 3 || X == 4 || X == 5
4231 and
4232 X >= 2 && X <= 5
4233 are converted to
4234 (unsigned) (X - 2) <= 3
4236 We describe each set of comparisons as being either inside or outside
4237 a range, using a variable named like IN_P, and then describe the
4238 range with a lower and upper bound. If one of the bounds is omitted,
4239 it represents either the highest or lowest value of the type.
4241 In the comments below, we represent a range by two numbers in brackets
4242 preceded by a "+" to designate being inside that range, or a "-" to
4243 designate being outside that range, so the condition can be inverted by
4244 flipping the prefix. An omitted bound is represented by a "-". For
4245 example, "- [-, 10]" means being outside the range starting at the lowest
4246 possible value and ending at 10, in other words, being greater than 10.
4247 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4248 always false.
4250 We set up things so that the missing bounds are handled in a consistent
4251 manner so neither a missing bound nor "true" and "false" need to be
4252 handled using a special case. */
4254 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4255 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4256 and UPPER1_P are nonzero if the respective argument is an upper bound
4257 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4258 must be specified for a comparison. ARG1 will be converted to ARG0's
4259 type if both are specified. */
4261 static tree
4264 {
4265 tree tem;
4269 /* If neither arg represents infinity, do the normal operation.
4270 Else, if not a comparison, return infinity. Else handle the special
4271 comparison rules. Note that most of the cases below won't occur, but
4272 are handled for consistency. */
4275 {
4280 }
4285 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4286 for neither. In real maths, we cannot assume open ended ranges are
4287 the same. But, this is computer arithmetic, where numbers are finite.
4288 We can therefore make the transformation of any unbounded range with
4289 the value Z, Z being greater than any representable number. This permits
4290 us to treat unbounded ranges as equal. */
4294 {
4315 }
4318 }
4319 \f
4320 /* Helper routine for make_range. Perform one step for it, return
4321 new expression if the loop should continue or NULL_TREE if it should
4322 stop. */
4324 tree
4328 {
4334 {
4336 /* We can only do something if the range is testing for zero. */
4345 /* We can only do something if the range is testing for zero
4346 and if the second operand is an integer constant. Note that
4347 saying something is "in" the range we make is done by
4348 complementing IN_P since it will set in the initial case of
4349 being not equal to zero; "out" is leaving it alone. */
4356 {
4377 }
4379 /* If this is an unsigned comparison, we also know that EXP is
4380 greater than or equal to zero. We base the range tests we make
4381 on that fact, so we record it here so we can parse existing
4382 range tests. We test arg0_type since often the return type
4383 of, e.g. EQ_EXPR, is boolean. */
4385 {
4389 NULL_TREE))
4394 /* If the high bound is missing, but we have a nonzero low
4395 bound, reverse the range so it goes from zero to the low bound
4396 minus 1. */
4398 {
4403 }
4404 }
4412 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4413 low and high are non-NULL, then normalize will DTRT. */
4416 {
4421 }
4423 /* (-x) IN [a,b] -> x in [-b, -a] */
4435 /* ~ X -> -X - 1 */
4444 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4445 move a constant to the other side. */
4450 /* If EXP is signed, any overflow in the computation is undefined,
4451 so we don't worry about it so long as our computations on
4452 the bounds don't overflow. For unsigned, overflow is defined
4453 and this is exactly the right thing. */
4465 normalize:
4466 /* Check for an unsigned range which has wrapped around the maximum
4467 value thus making n_high < n_low, and normalize it. */
4469 {
4475 /* If the range is of the form +/- [ x+1, x ], we won't
4476 be able to normalize it. But then, it represents the
4477 whole range or the empty set, so make it
4478 +/- [ -, - ]. */
4482 else
4484 }
4485 else
4493 CASE_CONVERT:
4511 /* If we're converting arg0 from an unsigned type, to exp,
4512 a signed type, we will be doing the comparison as unsigned.
4513 The tests above have already verified that LOW and HIGH
4514 are both positive.
4516 So we have to ensure that we will handle large unsigned
4517 values the same way that the current signed bounds treat
4518 negative values. */
4521 {
4522 tree high_positive;
4523 tree equiv_type;
4524 /* For fixed-point modes, we need to pass the saturating flag
4525 as the 2nd parameter. */
4527 equiv_type
4530 else
4531 equiv_type
4534 /* A range without an upper bound is, naturally, unbounded.
4535 Since convert would have cropped a very large value, use
4536 the max value for the destination type. */
4537 high_positive
4544 high_positive),
4547 /* If the low bound is specified, "and" the range with the
4548 range for which the original unsigned value will be
4549 positive. */
4551 {
4554 integer_zero_node),
4555 high_positive))
4559 }
4560 else
4561 {
4562 /* Otherwise, "or" the range with the range of the input
4563 that will be interpreted as negative. */
4566 integer_zero_node),
4567 high_positive))
4571 }
4572 }
4581 }
4582 }
4584 /* Given EXP, a logical expression, set the range it is testing into
4585 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4586 actually being tested. *PLOW and *PHIGH will be made of the same
4587 type as the returned expression. If EXP is not a comparison, we
4588 will most likely not be returning a useful value and range. Set
4589 *STRICT_OVERFLOW_P to true if the return value is only valid
4590 because signed overflow is undefined; otherwise, do not change
4591 *STRICT_OVERFLOW_P. */
4593 tree
4596 {
4604 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4605 and see if we can refine the range. Some of the cases below may not
4606 happen, but it doesn't seem worth worrying about this. We "continue"
4607 the outer loop when we've changed something; otherwise we "break"
4608 the switch, which will "break" the while. */
4614 {
4620 {
4628 }
4637 }
4639 /* If EXP is a constant, we can evaluate whether this is true or false. */
4641 {
4648 }
4652 }
4653 \f
4654 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4655 type, TYPE, return an expression to test if EXP is in (or out of, depending
4656 on IN_P) the range. Return 0 if the test couldn't be created. */
4658 tree
4661 {
4664 /* Disable this optimization for function pointer expressions
4665 on targets that require function pointer canonicalization. */
4672 {
4678 }
4696 {
4698 {
4702 }
4704 }
4706 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4708 {
4712 {
4714 {
4717 etype
4719 else
4722 }
4725 }
4726 }
4728 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4729 This requires wrap-around arithmetics for the type of the expression.
4730 First make sure that arithmetics in this type is valid, then make sure
4731 that it wraps around. */
4737 {
4740 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4741 for the type in question, as we rely on this here. */
4751 else
4753 }
4763 {
4765 {
4770 }
4772 }
4780 }
4781 \f
4782 /* Return the predecessor of VAL in its type, handling the infinite case. */
4784 static tree
4786 {
4792 else
4795 }
4797 /* Return the successor of VAL in its type, handling the infinite case. */
4799 static tree
4801 {
4807 else
4810 }
4812 /* Given two ranges, see if we can merge them into one. Return 1 if we
4813 can, 0 if we can't. Set the output range into the specified parameters. */
4815 bool
4818 {
4822 tree tem;
4832 /* Make range 0 be the range that starts first, or ends last if they
4833 start at the same value. Swap them if it isn't. */
4836 || (lowequal
4839 {
4843 }
4845 /* Now flag two cases, whether the ranges are disjoint or whether the
4846 second range is totally subsumed in the first. Note that the tests
4847 below are simplified by the ones above. */
4853 /* We now have four cases, depending on whether we are including or
4854 excluding the two ranges. */
4856 {
4857 /* If they don't overlap, the result is false. If the second range
4858 is a subset it is the result. Otherwise, the range is from the start
4859 of the second to the end of the first. */
4864 else
4866 }
4869 {
4870 /* If they don't overlap, the result is the first range. If they are
4871 equal, the result is false. If the second range is a subset of the
4872 first, and the ranges begin at the same place, we go from just after
4873 the end of the second range to the end of the first. If the second
4874 range is not a subset of the first, or if it is a subset and both
4875 ranges end at the same place, the range starts at the start of the
4876 first range and ends just before the second range.
4877 Otherwise, we can't describe this as a single range. */
4883 {
4888 {
4889 /* We are in the weird situation where high0 > high1 but
4890 high1 has no successor. Punt. */
4892 }
4893 }
4895 {
4900 {
4901 /* low0 < low1 but low1 has no predecessor. Punt. */
4903 }
4904 }
4905 else
4907 }
4910 {
4911 /* If they don't overlap, the result is the second range. If the second
4912 is a subset of the first, the result is false. Otherwise,
4913 the range starts just after the first range and ends at the
4914 end of the second. */
4919 else
4920 {
4925 {
4926 /* high1 > high0 but high0 has no successor. Punt. */
4928 }
4929 }
4930 }
4932 else
4933 {
4934 /* The case where we are excluding both ranges. Here the complex case
4935 is if they don't overlap. In that case, the only time we have a
4936 range is if they are adjacent. If the second is a subset of the
4937 first, the result is the first. Otherwise, the range to exclude
4938 starts at the beginning of the first range and ends at the end of the
4939 second. */
4941 {
4946 else
4947 {
4948 /* Canonicalize - [min, x] into - [-, x]. */
4951 {
4956 /* FALLTHROUGH */
4969 }
4971 /* Canonicalize - [x, max] into - [x, -]. */
4974 {
4979 /* FALLTHROUGH */
4995 }
4997 /* The ranges might be also adjacent between the maximum and
4998 minimum values of the given type. For
4999 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5000 return + [x + 1, y - 1]. */
5002 {
5009 }
5010 else
5012 }
5013 }
5016 else
5018 }
5022 }
5023 \f
5025 /* Subroutine of fold, looking inside expressions of the form
5026 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5027 of the COND_EXPR. This function is being used also to optimize
5028 A op B ? C : A, by reversing the comparison first.
5030 Return a folded expression whose code is not a COND_EXPR
5031 anymore, or NULL_TREE if no folding opportunity is found. */
5033 static tree
5036 {
5041 tree tem;
5046 /* If we have A op 0 ? A : -A, consider applying the following
5047 transformations:
5049 A == 0? A : -A same as -A
5050 A != 0? A : -A same as A
5051 A >= 0? A : -A same as abs (A)
5052 A > 0? A : -A same as abs (A)
5053 A <= 0? A : -A same as -abs (A)
5054 A < 0? A : -A same as -abs (A)
5056 None of these transformations work for modes with signed
5057 zeros. If A is +/-0, the first two transformations will
5058 change the sign of the result (from +0 to -0, or vice
5059 versa). The last four will fix the sign of the result,
5060 even though the original expressions could be positive or
5061 negative, depending on the sign of A.
5063 Note that all these transformations are correct if A is
5064 NaN, since the two alternatives (A and -A) are also NaNs. */
5071 /* In the case that A is of the form X-Y, '-A' (arg2) may
5072 have already been folded to Y-X, check for that. */
5080 {
5094 /* Fall through. */
5105 /* FALLTHRU */
5115 }
5117 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5118 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5119 both transformations are correct when A is NaN: A != 0
5120 is then true, and A == 0 is false. */
5124 {
5129 }
5131 /* Try some transformations of A op B ? A : B.
5133 A == B? A : B same as B
5134 A != B? A : B same as A
5135 A >= B? A : B same as max (A, B)
5136 A > B? A : B same as max (B, A)
5137 A <= B? A : B same as min (A, B)
5138 A < B? A : B same as min (B, A)
5140 As above, these transformations don't work in the presence
5141 of signed zeros. For example, if A and B are zeros of
5142 opposite sign, the first two transformations will change
5143 the sign of the result. In the last four, the original
5144 expressions give different results for (A=+0, B=-0) and
5145 (A=-0, B=+0), but the transformed expressions do not.
5147 The first two transformations are correct if either A or B
5148 is a NaN. In the first transformation, the condition will
5149 be false, and B will indeed be chosen. In the case of the
5150 second transformation, the condition A != B will be true,
5151 and A will be chosen.
5153 The conversions to max() and min() are not correct if B is
5154 a number and A is not. The conditions in the original
5155 expressions will be false, so all four give B. The min()
5156 and max() versions would give a NaN instead. */
5159 /* Avoid these transformations if the COND_EXPR may be used
5160 as an lvalue in the C++ front-end. PR c++/19199. */
5161 && (in_gimple_form
5167 {
5172 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
5174 {
5178 }
5181 {
5190 /* In C++ a ?: expression can be an lvalue, so put the
5191 operand which will be used if they are equal first
5192 so that we can convert this back to the
5193 corresponding COND_EXPR. */
5195 {
5204 }
5211 {
5220 }
5235 }
5236 }
5238 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5239 we might still be able to simplify this. For example,
5240 if C1 is one less or one more than C2, this might have started
5241 out as a MIN or MAX and been transformed by this function.
5242 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5248 {
5252 /* We can replace A with C1 in this case. */
5257 /* If C1 is C2 + 1, this is min(A, C2), but use ARG00's type for
5258 MIN_EXPR, to preserve the signedness of the comparison. */
5260 OEP_ONLY_CONST)
5264 OEP_ONLY_CONST))
5265 {
5268 arg2));
5271 }
5275 /* If C1 is C2 - 1, this is min(A, C2), with the same care
5276 as above. */
5278 OEP_ONLY_CONST)
5282 OEP_ONLY_CONST))
5283 {
5286 arg2));
5289 }
5293 /* If C1 is C2 - 1, this is max(A, C2), but use ARG00's type for
5294 MAX_EXPR, to preserve the signedness of the comparison. */
5296 OEP_ONLY_CONST)
5300 OEP_ONLY_CONST))
5301 {
5304 arg2));
5306 }
5310 /* If C1 is C2 + 1, this is max(A, C2), with the same care as above. */
5312 OEP_ONLY_CONST)
5316 OEP_ONLY_CONST))
5317 {
5320 arg2));
5322 }
5328 }
5331 }
5334 \f
5335 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5336 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5337 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5338 false) >= 2)
5339 #endif
5341 /* EXP is some logical combination of boolean tests. See if we can
5342 merge it into some range test. Return the new tree if so. */
5344 static tree
5347 {
5363 /* If this is an OR operation, invert both sides; we will invert
5364 again at the end. */
5368 /* If both expressions are the same, if we can merge the ranges, and we
5369 can build the range test, return it or it inverted. If one of the
5370 ranges is always true or always false, consider it to be the same
5371 expression as the other. */
5379 {
5383 }
5385 /* On machines where the branch cost is expensive, if this is a
5386 short-circuited branch and the underlying object on both sides
5387 is the same, make a non-short-circuit operation. */
5393 {
5394 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5395 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5396 which cases we can't do this. */
5404 {
5413 {
5416 WARN_STRICT_OVERFLOW_COMPARISON);
5420 }
5421 }
5422 }
5425 }
5426 \f
5427 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5428 bit value. Arrange things so the extra bits will be set to zero if and
5429 only if C is signed-extended to its full width. If MASK is nonzero,
5430 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5432 static tree
5434 {
5437 tree temp;
5442 /* We work by getting just the sign bit into the low-order bit, then
5443 into the high-order bit, then sign-extend. We then XOR that value
5444 with C. */
5447 /* We must use a signed type in order to get an arithmetic right shift.
5448 However, we must also avoid introducing accidental overflows, so that
5449 a subsequent call to integer_zerop will work. Hence we must
5450 do the type conversion here. At this point, the constant is either
5451 zero or one, and the conversion to a signed type can never overflow.
5452 We could get an overflow if this conversion is done anywhere else. */
5461 /* If necessary, convert the type back to match the type of C. */
5466 }
5467 \f
5468 /* For an expression that has the form
5469 (A && B) || ~B
5470 or
5471 (A || B) && ~B,
5472 we can drop one of the inner expressions and simplify to
5473 A || ~B
5474 or
5475 A && ~B
5476 LOC is the location of the resulting expression. OP is the inner
5477 logical operation; the left-hand side in the examples above, while CMPOP
5478 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5479 removing a condition that guards another, as in
5480 (A != NULL && A->...) || A == NULL
5481 which we must not transform. If RHS_ONLY is true, only eliminate the
5482 right-most operand of the inner logical operation. */
5484 static tree
5487 {
5505 {
5508 {
5511 }
5512 }
5514 {
5517 {
5520 }
5521 }
5536 }
5538 /* Find ways of folding logical expressions of LHS and RHS:
5539 Try to merge two comparisons to the same innermost item.
5540 Look for range tests like "ch >= '0' && ch <= '9'".
5541 Look for combinations of simple terms on machines with expensive branches
5542 and evaluate the RHS unconditionally.
5544 For example, if we have p->a == 2 && p->b == 4 and we can make an
5545 object large enough to span both A and B, we can do this with a comparison
5546 against the object ANDed with the a mask.
5548 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5549 operations to do this with one comparison.
5551 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5552 function and the one above.
5554 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5555 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5557 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5558 two operands.
5560 We return the simplified tree or 0 if no optimization is possible. */
5562 static tree
5565 {
5566 /* If this is the "or" of two comparisons, we can do something if
5567 the comparisons are NE_EXPR. If this is the "and", we can do something
5568 if the comparisons are EQ_EXPR. I.e.,
5569 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5571 WANTED_CODE is this operation code. For single bit fields, we can
5572 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5573 comparison for one-bit fields. */
5594 /* Start by getting the comparison codes. Fail if anything is volatile.
5595 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5596 it were surrounded with a NE_EXPR. */
5605 {
5609 }
5612 {
5616 }
5627 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5630 {
5633 {
5638 }
5641 {
5647 }
5648 }
5653 /* If the RHS can be evaluated unconditionally and its operands are
5654 simple, it wins to evaluate the RHS unconditionally on machines
5655 with expensive branches. In this case, this isn't a comparison
5656 that can be merged. */
5663 {
5664 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5675 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5685 }
5687 /* See if the comparisons can be merged. Then get all the parameters for
5688 each side. */
5713 /* It must be true that the inner operation on the lhs of each
5714 comparison must be the same if we are to be able to do anything.
5715 Then see if we have constants. If not, the same must be true for
5716 the rhs's. */
5725 {
5728 }
5733 else
5736 /* If either comparison code is not correct for our logical operation,
5737 fail. However, we can convert a one-bit comparison against zero into
5738 the opposite comparison against that bit being set in the field. */
5742 {
5744 {
5745 /* Make the left operand unsigned, since we are only interested
5746 in the value of one bit. Otherwise we are doing the wrong
5747 thing below. */
5750 }
5751 else
5753 }
5755 /* This is analogous to the code for l_const above. */
5757 {
5759 {
5762 }
5763 else
5765 }
5767 /* See if we can find a mode that contains both fields being compared on
5768 the left. If we can't, fail. Otherwise, update all constants and masks
5769 to be relative to a field of that size. */
5774 volatilep);
5784 {
5787 }
5795 {
5802 {
5806 }
5807 }
5809 {
5816 {
5820 }
5821 }
5823 /* If the right sides are not constant, do the same for it. Also,
5824 disallow this optimization if a size or signedness mismatch occurs
5825 between the left and right sides. */
5827 {
5830 /* Make sure the two fields on the right
5831 correspond to the left without being swapped. */
5839 volatilep);
5849 {
5852 }
5861 /* Make a mask that corresponds to both fields being compared.
5862 Do this for both items being compared. If the operands are the
5863 same size and the bits being compared are in the same position
5864 then we can do this by masking both and comparing the masked
5865 results. */
5869 {
5883 }
5885 /* There is still another way we can do something: If both pairs of
5886 fields being compared are adjacent, we may be able to make a wider
5887 field containing them both.
5889 Note that we still must mask the lhs/rhs expressions. Furthermore,
5890 the mask must be shifted to account for the shift done by
5891 make_bit_field_ref. */
5896 {
5897 tree type;
5913 /* Convert to the smaller type before masking out unwanted bits. */
5916 {
5918 {
5922 }
5924 {
5928 }
5929 }
5938 }
5941 }
5943 /* Handle the case of comparisons with constants. If there is something in
5944 common between the masks, those bits of the constants must be the same.
5945 If not, the condition is always false. Test for this to avoid generating
5946 incorrect code below. */
5951 {
5953 {
5956 }
5957 else
5958 {
5961 }
5962 }
5964 /* Construct the expression we will return. First get the component
5965 reference we will make. Unless the mask is all ones the width of
5966 that field, perform the mask operation. Then compare with the
5967 merged constant. */
5978 }
5979 \f
5980 /* T is an integer expression that is being multiplied, divided, or taken a
5981 modulus (CODE says which and what kind of divide or modulus) by a
5982 constant C. See if we can eliminate that operation by folding it with
5983 other operations already in T. WIDE_TYPE, if non-null, is a type that
5984 should be used for the computation if wider than our type.
5986 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5987 (X * 2) + (Y * 4). We must, however, be assured that either the original
5988 expression would not overflow or that overflow is undefined for the type
5989 in the language in question.
5991 If we return a non-null expression, it is an equivalent form of the
5992 original computation, but need not be in the original type.
5994 We set *STRICT_OVERFLOW_P to true if the return values depends on
5995 signed overflow being undefined. Otherwise we do not change
5996 *STRICT_OVERFLOW_P. */
5998 static tree
6001 {
6002 /* To avoid exponential search depth, refuse to allow recursion past
6003 three levels. Beyond that (1) it's highly unlikely that we'll find
6004 something interesting and (2) we've probably processed it before
6005 when we built the inner expression. */
6008 tree ret;
6013 depth++;
6015 depth--;
6018 }
6020 static tree
6023 {
6034 /* Don't deal with constants of zero here; they confuse the code below. */
6044 /* Note that we need not handle conditional operations here since fold
6045 already handles those cases. So just do arithmetic here. */
6047 {
6049 /* For a constant, we can always simplify if we are a multiply
6050 or (for divide and modulus) if it is a multiple of our constant. */
6053 {
6056 /* If the multiplication overflowed, we lost information on it.
6057 See PR68142 and PR69845. */
6061 }
6065 /* If op0 is an expression ... */
6071 /* ... and has wrapping overflow, and its type is smaller
6072 than ctype, then we cannot pass through as widening. */
6077 /* ... or this is a truncation (t is narrower than op0),
6078 then we cannot pass through this narrowing. */
6081 /* ... or signedness changes for division or modulus,
6082 then we cannot pass through this conversion. */
6086 /* ... or has undefined overflow while the converted to
6087 type has not, we cannot do the operation in the inner type
6088 as that would introduce undefined overflow. */
6094 /* Pass the constant down and see if we can make a simplification. If
6095 we can, replace this expression with the inner simplification for
6096 possible later conversion to our or some other type. */
6101 code == MULT_EXPR
6103 strict_overflow_p))))
6108 /* If widening the type changes it from signed to unsigned, then we
6109 must avoid building ABS_EXPR itself as unsigned. */
6111 {
6115 {
6118 }
6120 }
6121 /* If the constant is negative, we cannot simplify this. */
6124 /* FALLTHROUGH */
6126 /* For division and modulus, type can't be unsigned, as e.g.
6127 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6128 For signed types, even with wrapping overflow, this is fine. */
6137 /* If widening the type changes the signedness, then we can't perform
6138 this optimization as that changes the result. */
6142 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6148 {
6155 }
6159 /* If the second operand is constant, this is a multiplication
6160 or floor division, by a power of two, so we can treat it that
6161 way unless the multiplier or divisor overflows. Signed
6162 left-shift overflow is implementation-defined rather than
6163 undefined in C90, so do not convert signed left shift into
6164 multiplication. */
6167 /* const_binop may not detect overflow correctly,
6168 so check for it explicitly here. */
6172 size_one_node,
6173 op1)))
6177 ctype,
6179 t1),
6184 /* See if we can eliminate the operation on both sides. If we can, we
6185 can return a new PLUS or MINUS. If we can't, the only remaining
6186 cases where we can do anything are if the second operand is a
6187 constant. */
6193 /* If not multiplication, we can only do this if both operands
6194 are divisible by c. */
6197 {
6202 }
6204 /* If this was a subtraction, negate OP1 and set it to be an addition.
6205 This simplifies the logic below. */
6207 {
6209 /* If OP1 was not easily negatable, the constant may be OP0. */
6211 {
6214 }
6215 }
6220 /* If either OP1 or C are negative, this optimization is not safe for
6221 some of the division and remainder types while for others we need
6222 to change the code. */
6224 {
6232 }
6234 /* If it's a multiply or a division/modulus operation of a multiple
6235 of our constant, do the operation and verify it doesn't overflow. */
6238 {
6241 /* We allow the constant to overflow with wrapping semantics. */
6245 }
6246 else
6249 /* If we have an unsigned type, we cannot widen the operation since it
6250 will change the result if the original computation overflowed. */
6254 /* If we were able to eliminate our operation from the first side,
6255 apply our operation to the second side and reform the PLUS. */
6259 /* The last case is if we are a multiply. In that case, we can
6260 apply the distributive law to commute the multiply and addition
6261 if the multiplication of the constants doesn't overflow
6262 and overflow is defined. With undefined overflow
6263 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6269 op1);
6274 /* We have a special case here if we are doing something like
6275 (C * 8) % 4 since we know that's zero. */
6278 /* If the multiplication can overflow we cannot optimize this. */
6282 {
6285 }
6287 /* ... fall through ... */
6291 /* If we can extract our operation from the LHS, do so and return a
6292 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6293 do something only if the second operand is a constant. */
6307 /* If these are the same operation types, we can associate them
6308 assuming no overflow. */
6310 {
6325 }
6327 /* If these operations "cancel" each other, we have the main
6328 optimizations of this pass, which occur when either constant is a
6329 multiple of the other, in which case we replace this with either an
6330 operation or CODE or TCODE.
6332 If we have an unsigned type, we cannot do this since it will change
6333 the result if the original computation overflowed. */
6340 {
6342 {
6349 }
6351 {
6358 }
6359 }
6364 }
6367 }
6368 \f
6369 /* Return a node which has the indicated constant VALUE (either 0 or
6370 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6371 and is of the indicated TYPE. */
6373 tree
6375 {
6384 else
6386 }
6389 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6390 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6391 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6392 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6393 COND is the first argument to CODE; otherwise (as in the example
6394 given here), it is the second argument. TYPE is the type of the
6395 original expression. Return NULL_TREE if no simplification is
6396 possible. */
6398 static tree
6403 {
6413 {
6417 /* If this operand throws an expression, then it does not make
6418 sense to try to perform a logical or arithmetic operation
6419 involving it. */
6424 }
6427 {
6432 }
6433 else
6434 /* Detect the case of mixing vector and scalar types - bail out. */
6440 /* This transformation is only worthwhile if we don't have to wrap ARG
6441 in a SAVE_EXPR and the operation can be simplified without recursing
6442 on at least one of the branches once its pushed inside the COND_EXPR. */
6451 {
6455 else
6457 }
6459 {
6463 else
6465 }
6467 /* Check that we have simplified at least one of the branches. */
6472 }
6474 \f
6475 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6477 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6478 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6479 ADDEND is the same as X.
6481 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6482 and finite. The problematic cases are when X is zero, and its mode
6483 has signed zeros. In the case of rounding towards -infinity,
6484 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6485 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6487 bool
6489 {
6493 /* Don't allow the fold with -fsignaling-nans. */
6497 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6501 /* In a vector or complex, we would need to check the sign of all zeros. */
6505 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6509 /* The mode has signed zeros, and we have to honor their sign.
6510 In this situation, there is only one case we can return true for.
6511 X - 0 is the same as X unless rounding towards -infinity is
6512 supported. */
6514 }
6516 /* Subroutine of fold() that optimizes comparisons of a division by
6517 a nonzero integer constant against an integer constant, i.e.
6518 X/C1 op C2.
6520 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6521 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6522 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6524 The function returns the constant folded tree if a simplification
6525 can be made, and NULL_TREE otherwise. */
6527 static tree
6530 {
6538 /* We have to do this the hard way to detect unsigned overflow.
6539 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6545 {
6550 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6554 }
6556 {
6560 {
6579 }
6580 }
6581 else
6582 {
6583 /* A negative divisor reverses the relational operators. */
6589 {
6608 }
6609 }
6612 {
6633 {
6636 }
6641 {
6644 }
6649 {
6652 }
6657 {
6660 }
6665 }
6668 }
6671 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6672 equality/inequality test, then return a simplified form of the test
6673 using a sign testing. Otherwise return NULL. TYPE is the desired
6674 result type. */
6676 static tree
6679 tree result_type)
6680 {
6681 /* If this is testing a single bit, we can optimize the test. */
6685 {
6686 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6687 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6691 /* This is only a win if casting to a signed type is cheap,
6692 i.e. when arg00's type is not a partial mode. */
6695 {
6698 result_type,
6701 }
6702 }
6705 }
6707 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6708 equality/inequality test, then return a simplified form of
6709 the test using shifts and logical operations. Otherwise return
6710 NULL. TYPE is the desired result type. */
6712 tree
6715 {
6716 /* If this is testing a single bit, we can optimize the test. */
6720 {
6729 /* First, see if we can fold the single bit test into a sign-bit
6730 test. */
6732 result_type);
6736 /* Otherwise we have (A & C) != 0 where C is a single bit,
6737 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6738 Similarly for (A & C) == 0. */
6740 /* If INNER is a right shift of a constant and it plus BITNUM does
6741 not overflow, adjust BITNUM and INNER. */
6747 {
6750 }
6752 /* If we are going to be able to omit the AND below, we must do our
6753 operations as unsigned. If we must use the AND, we have a choice.
6754 Normally unsigned is faster, but for some machines signed is. */
6772 /* Put the AND last so it can combine with more things. */
6775 /* Make sure to return the proper type. */
6779 }
6781 }
6783 /* Check whether we are allowed to reorder operands arg0 and arg1,
6784 such that the evaluation of arg1 occurs before arg0. */
6786 static bool
6788 {
6795 }
6797 /* Test whether it is preferable two swap two operands, ARG0 and
6798 ARG1, for example because ARG0 is an integer constant and ARG1
6799 isn't. If REORDER is true, only recommend swapping if we can
6800 evaluate the operands in reverse order. */
6802 bool
6804 {
6822 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6823 for commutative and comparison operators. Ensuring a canonical
6824 form allows the optimizers to find additional redundancies without
6825 having to explicitly check for both orderings. */
6831 /* Put SSA_NAMEs last. */
6837 /* Put variables last. */
6844 }
6847 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6848 means A >= Y && A != MAX, but in this case we know that
6849 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6851 static tree
6853 {
6860 else
6869 {
6872 }
6874 {
6877 }
6878 else
6885 {
6886 /* Convert the pointer types into integer before taking the difference. */
6890 }
6891 else
6898 }
6900 /* Fold a sum or difference of at least one multiplication.
6901 Returns the folded tree or NULL if no simplification could be made. */
6903 static tree
6906 {
6910 /* (A * C) +- (B * C) -> (A+-B) * C.
6911 (A * C) +- A -> A * (C+-1).
6912 We are most concerned about the case where C is a constant,
6913 but other combinations show up during loop reduction. Since
6914 it is not difficult, try all four possibilities. */
6917 {
6920 }
6922 {
6925 }
6926 else
6927 {
6928 /* We cannot generate constant 1 for fract. */
6933 }
6935 {
6938 }
6940 {
6942 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
6943 the purpose of this canonicalization. */
6947 {
6950 }
6951 else
6953 }
6954 else
6955 {
6956 /* We cannot generate constant 1 for fract. */
6961 }
6973 /* No identical multiplicands; see if we can find a common
6974 power-of-two factor in non-power-of-two multiplies. This
6975 can help in multi-dimensional array access. */
6978 {
6981 tree maybe_same;
6985 /* Move min of absolute values to int11. */
6987 {
6992 }
6993 else
6997 /* The remainder should not be a constant, otherwise we
6998 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
6999 increased the number of multiplications necessary. */
7001 {
7009 }
7010 }
7020 }
7022 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7023 specified by EXPR into the buffer PTR of length LEN bytes.
7024 Return the number of bytes placed in the buffer, or zero
7025 upon failure. */
7027 static int
7029 {
7043 {
7045 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7046 number of bytes. */
7050 {
7057 else
7059 }
7060 else
7065 }
7067 }
7070 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7071 specified by EXPR into the buffer PTR of length LEN bytes.
7072 Return the number of bytes placed in the buffer, or zero
7073 upon failure. */
7075 static int
7077 {
7081 FIXED_VALUE_TYPE value;
7097 }
7100 /* Subroutine of native_encode_expr. Encode the REAL_CST
7101 specified by EXPR into the buffer PTR of length LEN bytes.
7102 Return the number of bytes placed in the buffer, or zero
7103 upon failure. */
7105 static int
7107 {
7113 /* There are always 32 bits in each long, no matter the size of
7114 the hosts long. We handle floating point representations with
7115 up to 192 bits. */
7129 {
7134 {
7141 else
7143 }
7144 else
7150 }
7152 }
7154 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7155 specified by EXPR into the buffer PTR of length LEN bytes.
7156 Return the number of bytes placed in the buffer, or zero
7157 upon failure. */
7159 static int
7161 {
7163 tree part;
7178 }
7181 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7182 specified by EXPR into the buffer PTR of length LEN bytes.
7183 Return the number of bytes placed in the buffer, or zero
7184 upon failure. */
7186 static int
7188 {
7198 {
7200 {
7203 }
7214 }
7216 }
7219 /* Subroutine of native_encode_expr. Encode the STRING_CST
7220 specified by EXPR into the buffer PTR of length LEN bytes.
7221 Return the number of bytes placed in the buffer, or zero
7222 upon failure. */
7224 static int
7226 {
7228 HOST_WIDE_INT total_bytes;
7242 {
7245 {
7248 }
7251 }
7252 else
7255 }
7258 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7259 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7260 buffer PTR of length LEN bytes. If OFF is not -1 then start
7261 the encoding at byte offset OFF and encode at most LEN bytes.
7262 Return the number of bytes placed in the buffer, or zero upon failure. */
7264 int
7266 {
7267 /* We don't support starting at negative offset and -1 is special. */
7272 {
7293 }
7294 }
7297 /* Subroutine of native_interpret_expr. Interpret the contents of
7298 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7299 If the buffer cannot be interpreted, return NULL_TREE. */
7301 static tree
7303 {
7313 }
7316 /* Subroutine of native_interpret_expr. Interpret the contents of
7317 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7318 If the buffer cannot be interpreted, return NULL_TREE. */
7320 static tree
7322 {
7324 double_int result;
7325 FIXED_VALUE_TYPE fixed_value;
7335 }
7338 /* Subroutine of native_interpret_expr. Interpret the contents of
7339 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7340 If the buffer cannot be interpreted, return NULL_TREE. */
7342 static tree
7344 {
7348 /* There are always 32 bits in each long, no matter the size of
7349 the hosts long. We handle floating point representations with
7350 up to 192 bits. */
7351 REAL_VALUE_TYPE r;
7362 {
7363 /* Both OFFSET and BYTE index within a long;
7364 bitpos indexes the whole float. */
7367 {
7374 else
7376 }
7377 else
7378 {
7381 {
7382 /* Reverse bytes within each long, or within the entire float
7383 if it's smaller than a long (for HFmode). */
7386 }
7387 }
7391 }
7395 }
7398 /* Subroutine of native_interpret_expr. Interpret the contents of
7399 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7400 If the buffer cannot be interpreted, return NULL_TREE. */
7402 static tree
7404 {
7419 }
7422 /* Subroutine of native_interpret_expr. Interpret the contents of
7423 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7424 If the buffer cannot be interpreted, return NULL_TREE. */
7426 static tree
7428 {
7441 {
7446 }
7448 }
7451 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7452 the buffer PTR of length LEN as a constant of type TYPE. For
7453 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7454 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7455 return NULL_TREE. */
7457 tree
7459 {
7461 {
7483 }
7484 }
7486 /* Returns true if we can interpret the contents of a native encoding
7487 as TYPE. */
7489 static bool
7491 {
7493 {
7506 }
7507 }
7509 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7510 TYPE at compile-time. If we're unable to perform the conversion
7511 return NULL_TREE. */
7513 static tree
7515 {
7516 /* We support up to 512-bit values (for V8DFmode). */
7520 /* Check that the host and target are sane. */
7529 }
7531 /* Build an expression for the address of T. Folds away INDIRECT_REF
7532 to avoid confusing the gimplify process. */
7534 tree
7536 {
7537 /* The size of the object is not relevant when talking about its address. */
7542 {
7547 }
7557 {
7562 }
7563 else
7567 }
7569 /* Build an expression for the address of T. */
7571 tree
7573 {
7577 }
7579 /* Fold a unary expression of code CODE and type TYPE with operand
7580 OP0. Return the folded expression if folding is successful.
7581 Otherwise, return NULL_TREE. */
7583 tree
7585 {
7586 tree tem;
7587 tree arg0;
7595 {
7598 {
7599 /* Don't use STRIP_NOPS, because signedness of argument type
7600 matters. */
7602 }
7603 else
7604 {
7605 /* Strip any conversions that don't change the mode. This
7606 is safe for every expression, except for a comparison
7607 expression because its signedness is derived from its
7608 operands.
7610 Note that this is done as an internal manipulation within
7611 the constant folder, in order to find the simplest
7612 representation of the arguments so that their form can be
7613 studied. In any cases, the appropriate type conversions
7614 should be put back in the tree that will get out of the
7615 constant folder. */
7617 }
7620 {
7623 {
7627 }
7628 }
7629 }
7636 {
7643 {
7657 /* If this was a conversion, and all we did was to move into
7658 inside the COND_EXPR, bring it back out. But leave it if
7659 it is a conversion from integer to integer and the
7660 result precision is no wider than a word since such a
7661 conversion is cheap and may be optimized away by combine,
7662 while it couldn't if it were outside the COND_EXPR. Then return
7663 so we don't get into an infinite recursion loop taking the
7664 conversion out and then back in. */
7676 && (INTEGRAL_TYPE_P
7689 }
7690 }
7693 {
7699 CASE_CONVERT:
7703 {
7704 /* If we have (type) (a CMP b) and type is an integral type, return
7705 new expression involving the new type. Canonicalize
7706 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7707 non-integral type.
7708 Do not fold the result as that would not simplify further, also
7709 folding again results in recursions. */
7719 }
7721 /* Handle (T *)&A.B.C for A being of type T and B and C
7722 living at offset zero. This occurs frequently in
7723 C++ upcasting and then accessing the base. */
7727 {
7729 tree offset;
7730 machine_mode mode;
7732 tree base
7736 /* If the reference was to a (constant) zero offset, we can use
7737 the address of the base if it has the same base type
7738 as the result type and the pointer type is unqualified. */
7745 }
7749 /* Detect assigning a bitfield. */
7751 && DECL_BIT_FIELD
7753 {
7754 /* Don't leave an assignment inside a conversion
7755 unless assigning a bitfield. */
7757 /* First do the assignment, then return converted constant. */
7762 }
7764 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7765 constants (if x has signed type, the sign bit cannot be set
7766 in c). This folds extension into the BIT_AND_EXPR.
7767 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7768 very likely don't have maximal range for their precision and this
7769 transformation effectively doesn't preserve non-maximal ranges. */
7773 {
7784 <= HOST_BITS_PER_WIDE_INT
7786 {
7790 cst &= HOST_WIDE_INT_M1U
7794 && !flag_syntax_only
7797 {
7801 }
7802 }
7804 {
7809 }
7810 }
7812 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
7813 cast (T1)X will fold away. We assume that this happens when X itself
7814 is a cast. */
7818 {
7822 return fold_build_pointer_plus_loc
7824 }
7826 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7827 of the same precision, and X is an integer type not narrower than
7828 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7834 {
7840 }
7842 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7843 type of X and Y (integer types only). */
7848 {
7849 /* Be careful not to introduce new overflows. */
7850 tree mult_type;
7853 else
7857 {
7864 }
7865 }
7871 {
7878 }
7889 /* Convert fabs((double)float) into (double)fabsf(float). */
7892 {
7898 targ0));
7899 }
7903 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
7922 /* Note that the operand of this must be an int
7923 and its values must be 0 or 1.
7924 ("true" is a fixed value perhaps depending on the language,
7925 but we don't handle values other than 1 correctly yet.) */
7932 /* Fold *&X to X if X is an lvalue. */
7934 {
7941 }
7947 }
7950 /* If the operation was a conversion do _not_ mark a resulting constant
7951 with TREE_OVERFLOW if the original constant was not. These conversions
7952 have implementation defined behavior and retaining the TREE_OVERFLOW
7953 flag here would confuse later passes such as VRP. */
7954 tree
7957 {
7966 }
7968 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
7969 operands OP0 and OP1. LOC is the location of the resulting expression.
7970 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
7971 Return the folded expression if folding is successful. Otherwise,
7972 return NULL_TREE. */
7973 static tree
7976 {
7977 tree tem;
7979 /* We only do these simplifications if we are optimizing. */
7983 /* Check for things like (A || B) && (A || C). We can convert this
7984 to A || (B && C). Note that either operator can be any of the four
7985 truth and/or operations and the transformation will still be
7986 valid. Also note that we only care about order for the
7987 ANDIF and ORIF operators. If B contains side effects, this
7988 might change the truth-value of A. */
7995 {
8015 /* This case if tricky because we must either have commutative
8016 operators or else A10 must not have side-effects. */
8022 a01);
8023 }
8025 /* See if we can build a range comparison. */
8031 {
8035 }
8039 {
8043 }
8045 /* Check for the possibility of merging component references. If our
8046 lhs is another similar operation, try to merge its rhs with our
8047 rhs. Then try to merge our lhs and rhs. */
8061 {
8068 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8069 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8070 We don't want to pack more than two leafs to a non-IF AND/OR
8071 expression.
8072 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8073 equal to IF-CODE, then we don't want to add right-hand operand.
8074 If the inner right-hand side of left-hand operand has
8075 side-effects, or isn't simple, then we can't add to it,
8076 as otherwise we might destroy if-sequence. */
8079 /* Needed for sequence points to handle trappings, and
8080 side-effects. */
8082 {
8084 arg1);
8086 tem);
8087 }
8088 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8089 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8092 /* Needed for sequence points to handle trappings, and
8093 side-effects. */
8095 {
8100 }
8101 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8102 into (A OR B).
8103 For sequence point consistancy, we need to check for trapping,
8104 and side-effects. */
8108 }
8111 }
8113 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8114 by changing CODE to reduce the magnitude of constants involved in
8115 ARG0 of the comparison.
8116 Returns a canonicalized comparison tree if a simplification was
8117 possible, otherwise returns NULL_TREE.
8118 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8119 valid if signed overflow is undefined. */
8121 static tree
8125 {
8130 /* Match A +- CST code arg1. We can change this only if overflow
8131 is undefined. */
8134 /* In principle pointers also have undefined overflow behavior,
8135 but that causes problems elsewhere. */
8142 /* Identify the constant in arg0 and its sign. */
8146 /* Overflowed constants and zero will cause problems. */
8151 /* See if we can reduce the magnitude of the constant in
8152 arg0 by changing the comparison code. */
8153 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8157 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8161 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8165 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8169 else
8173 /* Now build the constant reduced in magnitude. But not if that
8174 would produce one outside of its types range. */
8190 }
8192 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8193 overflow further. Try to decrease the magnitude of constants involved
8194 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8195 and put sole constants at the second argument position.
8196 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8198 static tree
8201 {
8202 tree t;
8207 /* Try canonicalization by simplifying arg0. */
8212 {
8216 }
8218 /* Try canonicalization by simplifying arg1 using the swapped
8219 comparison. */
8227 }
8229 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8230 space. This is used to avoid issuing overflow warnings for
8231 expressions like &p->x which can not wrap. */
8233 static bool
8235 {
8242 wide_int wi_offset;
8248 else
8264 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8265 array. */
8267 {
8268 HOST_WIDE_INT base_size;
8273 }
8276 }
8278 /* Return a positive integer when the symbol DECL is known to have
8279 a nonzero address, zero when it's known not to (e.g., it's a weak
8280 symbol), and a negative integer when the symbol is not yet in the
8281 symbol table and so whether or not its address is zero is unknown. */
8282 static int
8284 {
8290 }
8292 /* Subroutine of fold_binary. This routine performs all of the
8293 transformations that are common to the equality/inequality
8294 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8295 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8296 fold_binary should call fold_binary. Fold a comparison with
8297 tree code CODE and type TYPE with operands OP0 and OP1. Return
8298 the folded comparison or NULL_TREE. */
8300 static tree
8303 {
8313 /* For comparisons of pointers we can decompose it to a compile time
8314 comparison of the base objects and the offsets into the object.
8315 This requires at least one operand being an ADDR_EXPR or a
8316 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8322 {
8325 machine_mode mode;
8329 /* Get base and offset for the access. Strip ADDR_EXPR for
8330 get_inner_reference, but put it back by stripping INDIRECT_REF
8331 off the base object if possible. indirect_baseN will be true
8332 if baseN is not an address but refers to the object itself. */
8335 {
8336 base0
8342 else
8344 }
8346 {
8350 {
8351 base0
8357 else
8359 }
8362 else
8366 {
8372 {
8375 }
8376 }
8377 }
8381 {
8382 base1
8388 else
8390 }
8392 {
8396 {
8397 base1
8403 else
8405 }
8408 else
8412 {
8418 {
8421 }
8422 }
8423 }
8425 /* If we have equivalent bases we might be able to simplify. */
8429 {
8430 /* We can fold this expression to a constant if the non-constant
8431 offset parts are equal. */
8435 && (equality_code
8436 || (indirect_base0
8440 {
8446 "occur when comparing P +- C1 with "
8448 WARN_STRICT_OVERFLOW_CONDITIONAL);
8451 {
8465 }
8466 }
8467 /* We can simplify the comparison to a comparison of the variable
8468 offset parts if the constant offset parts are equal.
8469 Be careful to use signed sizetype here because otherwise we
8470 mess with array offsets in the wrong way. This is possible
8471 because pointer arithmetic is restricted to retain within an
8472 object and overflow on pointer differences is undefined as of
8473 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8475 && (equality_code
8476 || (indirect_base0
8479 {
8480 /* By converting to signed sizetype we cover middle-end pointer
8481 arithmetic which operates on unsigned pointer types of size
8482 type size and ARRAY_REF offsets which are properly sign or
8483 zero extended from their type in case it is narrower than
8484 sizetype. */
8487 else
8491 else
8498 "occur when comparing P +- C1 with "
8500 WARN_STRICT_OVERFLOW_COMPARISON);
8503 }
8504 }
8505 /* For equal offsets we can simplify to a comparison of the
8506 base addresses. */
8508 && (indirect_base0
8510 && (indirect_base1
8515 {
8521 }
8522 /* Comparison between an ordinary (non-weak) symbol and a null
8523 pointer can be eliminated since such symbols must have a non
8524 null address. In C, relational expressions between pointers
8525 to objects and null pointers are undefined. The results
8526 below follow the C++ rules with the additional property that
8527 every object pointer compares greater than a null pointer.
8528 */
8531 /* Avoid folding references to struct members at offset 0 to
8532 prevent tests like '&ptr->firstmember == 0' from getting
8533 eliminated. When ptr is null, although the -> expression
8534 is strictly speaking invalid, GCC retains it as a matter
8535 of QoI. See PR c/44555. */
8537 /* The caller guarantees that when one of the arguments is
8538 constant (i.e., null in this case) it is second. */
8540 {
8542 {
8553 }
8554 }
8555 }
8557 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8558 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8559 the resulting offset is smaller in absolute value than the
8560 original one and has the same sign. */
8569 {
8574 tree cst;
8576 "occur when combining constants around "
8579 /* Put the constant on the side where it doesn't overflow and is
8580 of lower absolute value and of same sign than before. */
8587 {
8590 variable1,
8594 }
8602 {
8608 variable2);
8609 }
8610 }
8616 /* If we are comparing an expression that just has comparisons
8617 of two integer values, arithmetic expressions of those comparisons,
8618 and constants, we can simplify it. There are only three cases
8619 to check: the two values can either be equal, the first can be
8620 greater, or the second can be greater. Fold the expression for
8621 those three values. Since each value must be 0 or 1, we have
8622 eight possibilities, each of which corresponds to the constant 0
8623 or 1 or one of the six possible comparisons.
8625 This handles common cases like (a > b) == 0 but also handles
8626 expressions like ((x > y) - (y > x)) > 0, which supposedly
8627 occur in macroized code. */
8630 {
8635 /* Don't handle degenerate cases here; they should already
8636 have been handled anyway. */
8645 {
8649 /* We can't just pass T to eval_subst in case cval1 or cval2
8650 was the same as ARG1. */
8652 tree high_result
8656 arg1);
8657 tree equal_result
8661 arg1);
8662 tree low_result
8666 arg1);
8668 /* All three of these results should be 0 or 1. Confirm they are.
8669 Then use those values to select the proper code to use. */
8674 {
8675 /* Make a 3-bit mask with the high-order bit being the
8676 value for `>', the next for '=', and the low for '<'. */
8680 {
8682 /* Always false. */
8703 /* Always true. */
8705 }
8708 {
8712 }
8714 }
8715 }
8716 }
8718 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
8719 into a single range test. */
8727 {
8731 }
8734 }
8737 /* Subroutine of fold_binary. Optimize complex multiplications of the
8738 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8739 argument EXPR represents the expression "z" of type TYPE. */
8741 static tree
8743 {
8748 {
8751 }
8753 {
8756 }
8757 else
8758 {
8762 }
8771 }
8774 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8775 CONSTRUCTOR ARG into array ELTS and return true if successful. */
8777 static bool
8779 {
8783 {
8786 }
8788 {
8794 else
8796 }
8797 else
8803 }
8805 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8806 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8807 NULL_TREE otherwise. */
8809 static tree
8811 {
8828 {
8832 }
8835 {
8841 }
8842 else
8844 }
8846 /* Try to fold a pointer difference of type TYPE two address expressions of
8847 array references AREF0 and AREF1 using location LOC. Return a
8848 simplified expression for the difference or NULL_TREE. */
8850 static tree
8853 {
8858 /* If the bases are array references as well, recurse. If the bases
8859 are pointer indirections compute the difference of the pointers.
8860 If the bases are equal, we are set. */
8863 && (base_offset
8867 && (base_offset
8873 {
8879 base_offset,
8882 }
8884 }
8886 /* If the real or vector real constant CST of type TYPE has an exact
8887 inverse, return it, else return NULL. */
8889 tree
8891 {
8892 REAL_VALUE_TYPE r;
8894 machine_mode mode;
8898 {
8914 {
8919 }
8925 }
8926 }
8928 /* Mask out the tz least significant bits of X of type TYPE where
8929 tz is the number of trailing zeroes in Y. */
8930 static wide_int
8932 {
8937 }
8939 /* Return true when T is an address and is known to be nonzero.
8940 For floating point we further ensure that T is not denormal.
8941 Similar logic is present in nonzero_address in rtlanal.h.
8943 If the return value is based on the assumption that signed overflow
8944 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
8945 change *STRICT_OVERFLOW_P. */
8947 static bool
8949 {
8953 /* Doing something useful for floating point would need more work. */
8959 {
8962 strict_overflow_p);
8968 strict_overflow_p);
8976 }
8979 {
8982 strict_overflow_p);
8990 strict_overflow_p);
9005 strict_overflow_p);
9009 strict_overflow_p);
9012 {
9024 }
9028 }
9030 }
9032 /* Return true when T is an address and is known to be nonzero.
9033 Handle warnings about undefined signed overflow. */
9035 static bool
9037 {
9044 "determining that expression is always "
9046 WARN_STRICT_OVERFLOW_MISC);
9048 }
9050 /* Return true if T is known not to be equal to an integer W. */
9052 bool
9054 {
9056 value_range_type rtype;
9058 {
9067 {
9072 }
9077 /* If T has some known zero bits and W has any of those bits set,
9078 then T is known not to be equal to W. */
9086 }
9087 }
9089 /* Fold a binary expression of code CODE and type TYPE with operands
9090 OP0 and OP1. LOC is the location of the resulting expression.
9091 Return the folded expression if folding is successful. Otherwise,
9092 return NULL_TREE. */
9094 tree
9097 {
9112 /* Strip any conversions that don't change the mode. This is
9113 safe for every expression, except for a comparison expression
9114 because its signedness is derived from its operands. So, in
9115 the latter case, only strip conversions that don't change the
9116 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9117 preserved.
9119 Note that this is done as an internal manipulation within the
9120 constant folder, in order to find the simplest representation
9121 of the arguments so that their form can be studied. In any
9122 cases, the appropriate type conversions should be put back in
9123 the tree that will get out of the constant folder. */
9126 {
9129 }
9130 else
9131 {
9134 }
9136 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9137 constant but we can't do arithmetic on them. */
9139 {
9142 {
9146 }
9147 }
9149 /* If this is a commutative operation, and ARG0 is a constant, move it
9150 to ARG1 to reduce the number of tests below. */
9155 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9156 to ARG1 to reduce the number of tests below. */
9165 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9167 First check for cases where an arithmetic operation is applied to a
9168 compound, conditional, or comparison operation. Push the arithmetic
9169 operation inside the compound or conditional to see if any folding
9170 can then be done. Convert comparison to conditional for this purpose.
9171 The also optimizes non-constant cases that used to be done in
9172 expand_expr.
9174 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9175 one of the operands is a comparison and the other is a comparison, a
9176 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9177 code below would make the expression more complex. Change it to a
9178 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9179 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9192 {
9196 boolean_type_node,
9204 }
9208 {
9210 {
9215 tem);
9216 }
9219 {
9224 tem);
9225 }
9230 {
9236 }
9241 {
9247 }
9248 }
9251 {
9253 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9256 {
9262 }
9264 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9267 {
9268 tree base;
9269 HOST_WIDE_INT coffset;
9278 }
9283 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9289 arg1),
9291 arg0)));
9297 {
9298 /* X + (X / CST) * -CST is X % CST. */
9303 {
9312 cst0));
9313 }
9314 }
9316 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9317 one. Make sure the type is not saturating and has the signedness of
9318 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9319 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9326 {
9330 }
9333 {
9334 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9335 (plus (plus (mult) (mult)) (foo)) so that we can
9336 take advantage of the factoring cases below. */
9345 {
9351 else
9364 parg0),
9366 marg)),
9370 return
9376 parg1)));
9377 }
9378 }
9379 else
9380 {
9381 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9382 to __complex__ ( x, y ). This is not the same for SNaNs or
9383 if signed zeros are involved. */
9387 {
9394 {
9398 {
9404 }
9406 {
9412 }
9413 }
9414 }
9422 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9423 We associate floats only if the user has specified
9424 -fassociative-math. */
9428 {
9433 {
9434 tree tree0;
9437 }
9438 }
9439 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9440 We associate floats only if the user has specified
9441 -fassociative-math. */
9445 {
9450 {
9451 tree tree0;
9454 }
9455 }
9456 }
9458 bit_rotate:
9459 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9460 is a rotate of A by C1 bits. */
9461 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9462 is a rotate of A by B bits. */
9463 {
9465 tree rtype;
9474 /* Only create rotates in complete modes. Other cases are not
9475 expanded properly. */
9478 {
9492 {
9496 code0 == LSHIFT_EXPR
9500 }
9502 {
9510 element_precision
9514 return
9517 ? LROTATE_EXPR
9522 }
9524 {
9532 element_precision
9536 return fold_convert_loc
9539 ? LROTATE_EXPR
9543 }
9544 }
9545 }
9547 associate:
9548 /* In most languages, can't associate operations on floats through
9549 parentheses. Rather than remember where the parentheses were, we
9550 don't associate floats at all, unless the user has specified
9551 -fassociative-math.
9552 And, we need to make sure type is not saturating. */
9556 {
9562 /* Split both trees into variables, constants, and literals. Then
9563 associate each group together, the constants with literals,
9564 then the result with variables. This increases the chances of
9565 literals being recombined later and of generating relocatable
9566 expressions for the sum of a constant and literal. */
9572 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9576 /* With undefined overflow prefer doing association in a type
9577 which wraps on overflow, if that is one of the operand types. */
9580 {
9588 }
9590 /* With undefined overflow we can only associate constants with one
9591 variable, and constants whose association doesn't overflow. */
9594 {
9596 {
9602 {
9605 }
9612 {
9615 }
9621 /* The only case we can still associate with two variables
9622 is if they cancel out. */
9626 }
9627 }
9629 /* Only do something if we found more than two objects. Otherwise,
9630 nothing has changed and we risk infinite recursion. */
9636 {
9648 /* Preserve the MINUS_EXPR if the negative part of the literal is
9649 greater than the positive part. Otherwise, the multiplicative
9650 folding code (i.e extract_muldiv) may be fooled in case
9651 unsigned constants are subtracted, like in the following
9652 example: ((X*2 + 4) - 8U)/2. */
9654 {
9658 {
9662 }
9663 else
9664 {
9668 }
9669 }
9671 /* Don't introduce overflows through reassociation. */
9678 {
9680 return
9684 else
9685 {
9688 return
9692 }
9693 }
9696 return
9699 }
9700 }
9705 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9714 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9715 __complex__ ( x, -y ). This is not the same for SNaNs or if
9716 signed zeros are involved. */
9720 {
9727 {
9731 {
9733 arg1r ? arg1r
9738 }
9740 {
9744 arg1i ? arg1i
9747 }
9748 }
9749 }
9751 /* A - B -> A + (-B) if B is easily negatable. */
9755 /* Avoid this transformation if B is a positive REAL_CST. */
9763 /* Fold &a[i] - &a[j] to i-j. */
9768 {
9774 }
9777 && flag_unsafe_math_optimizations
9783 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9784 one. Make sure the type is not saturating and has the signedness of
9785 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9786 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9793 {
9797 }
9803 {
9804 /* Transform x * -C into -x * C if x is easily negatable. */
9818 {
9821 "occur when simplifying "
9823 WARN_STRICT_OVERFLOW_MISC);
9825 }
9827 /* Optimize z * conj(z) for integer complex numbers. */
9834 }
9835 else
9836 {
9837 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
9838 This is not the same for NaNs or if signed zeros are
9839 involved. */
9845 {
9848 return
9854 return
9859 }
9861 /* Optimize z * conj(z) for floating point complex numbers.
9862 Guarded by flag_unsafe_math_optimizations as non-finite
9863 imaginary components don't produce scalar results. */
9872 }
9876 /* Canonicalize (X & C1) | C2. */
9880 {
9885 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
9893 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
9898 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
9899 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
9900 mode which allows further optimizations. */
9905 {
9909 {
9912 }
9913 }
9920 c3)),
9921 arg1);
9922 }
9924 /* See if this can be simplified into a rotate first. If that
9925 is unsuccessful continue in the association code. */
9929 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
9937 /* See if this can be simplified into a rotate first. If that
9938 is unsuccessful continue in the association code. */
9942 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
9947 {
9948 tree tem2;
9955 }
9956 /* Fold ~X & 1 as (X & 1) == 0. */
9960 {
9961 tree tem2;
9968 }
9969 /* Fold !X & 1 as X == 0. */
9972 {
9976 }
9978 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
9979 multiple of 1 << CST. */
9981 {
9988 }
9990 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
9991 bits from CST2. */
9995 {
10003 {
10004 /* Avoid the transform if arg1 is a mask of some
10005 mode which allows further optimizations. */
10012 }
10013 }
10015 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10016 ((A & N) + B) & M -> (A + B) & M
10017 Similarly if (N & M) == 0,
10018 ((A | N) + B) & M -> (A + B) & M
10019 and for - instead of + (or unary - instead of +)
10020 and/or ^ instead of |.
10021 If B is constant and (B & M) == 0, fold into A & M. */
10023 {
10032 {
10035 wide_int cst0;
10037 /* Now we know that arg0 is (C + D) or (C - D) or
10038 -C and arg1 (M) is == (1LL << cst) - 1.
10039 Store C into PMOP[0] and D into PMOP[1]. */
10043 {
10046 }
10053 {
10063 {
10066 }
10069 /* If C or D is of the form (A & N) where
10070 (N & M) == M, or of the form (A | N) or
10071 (A ^ N) where (N & M) == 0, replace it with A. */
10075 /* If C or D is a N where (N & M) == 0, it can be
10076 omitted (assumed 0). */
10084 }
10086 /* Only build anything new if we optimized one or both arguments
10087 above. */
10091 {
10094 {
10095 /* Perform the operations in a type that has defined
10096 overflow behavior. */
10102 }
10107 {
10115 else
10117 }
10120 else
10123 /* TEM is now the new binary +, - or unary - replacement. */
10127 }
10128 }
10129 }
10131 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10134 {
10139 return
10141 }
10146 /* Don't touch a floating-point divide by zero unless the mode
10147 of the constant can represent infinity. */
10153 /* (-A) / (-B) -> A / B */
10165 /* Fall through */
10168 /* Simplify A / (B << N) where A and B are positive and B is
10169 a power of 2, to A >> (N + log2(B)). */
10174 {
10177 {
10185 WARN_STRICT_OVERFLOW_MISC);
10191 }
10192 }
10194 /* Fall through */
10202 /* Convert -A / -B to A / B when the type is signed and overflow is
10203 undefined. */
10207 {
10210 "when distributing negation across "
10212 WARN_STRICT_OVERFLOW_MISC);
10217 }
10221 {
10224 "when distributing negation across "
10226 WARN_STRICT_OVERFLOW_MISC);
10231 }
10233 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10234 operation, EXACT_DIV_EXPR.
10236 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10237 At one time others generated faster code, it's not clear if they do
10238 after the last round to changes to the DIV code in expmed.c. */
10249 {
10253 WARN_STRICT_OVERFLOW_MISC);
10255 }
10267 {
10271 WARN_STRICT_OVERFLOW_MISC);
10273 }
10281 /* Since negative shift count is not well-defined,
10282 don't try to compute it in the compiler. */
10288 /* If we have a rotate of a bit operation with the rotate count and
10289 the second operand of the bit operation both constant,
10290 permute the two operations. */
10296 {
10304 }
10306 /* Two consecutive rotates adding up to the some integer
10307 multiple of the precision of the type can be ignored. */
10322 /* Note that the operands of this must be ints
10323 and their values must be 0 or 1.
10324 ("true" is a fixed value perhaps depending on the language.) */
10325 /* If first arg is constant zero, return it. */
10328 /* FALLTHRU */
10330 /* If either arg is constant true, drop it. */
10334 /* Preserve sequence points. */
10337 /* If second arg is constant zero, result is zero, but first arg
10338 must be evaluated. */
10341 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10342 case will be handled here. */
10346 /* !X && X is always false. */
10350 /* X && !X is always false. */
10355 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10356 means A >= Y && A != MAX, but in this case we know that
10357 A < X <= MAX. */
10361 {
10369 }
10378 /* Note that the operands of this must be ints
10379 and their values must be 0 or true.
10380 ("true" is a fixed value perhaps depending on the language.) */
10381 /* If first arg is constant true, return it. */
10384 /* FALLTHRU */
10386 /* If either arg is constant zero, drop it. */
10390 /* Preserve sequence points. */
10393 /* If second arg is constant true, result is true, but we must
10394 evaluate first arg. */
10397 /* Likewise for first arg, but note this only occurs here for
10398 TRUTH_OR_EXPR. */
10402 /* !X || X is always true. */
10406 /* X || !X is always true. */
10411 /* (X && !Y) || (!X && Y) is X ^ Y */
10414 {
10431 }
10440 /* If the second arg is constant zero, drop it. */
10443 /* If the second arg is constant true, this is a logical inversion. */
10445 {
10448 }
10449 /* Identical arguments cancel to zero. */
10453 /* !X ^ X is always true. */
10458 /* X ^ !X is always true. */
10474 /* bool_var != 1 becomes !bool_var. */
10481 /* bool_var == 0 becomes !bool_var. */
10488 /* !exp != 0 becomes !exp */
10493 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
10502 {
10508 }
10510 /* Transform comparisons of the form X CMP X +- Y to Y CMP 0. */
10519 {
10525 }
10527 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
10535 code == NE_EXPR
10539 /* Transform comparisons of the form X CMP C - X if C % 2 == 1. */
10547 code == NE_EXPR
10551 /* If this is an EQ or NE comparison with zero and ARG0 is
10552 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10553 two operations, but the latter can be done in one less insn
10554 on machines that have only two-operand insns or on which a
10555 constant cannot be the first operand. */
10558 {
10563 {
10570 arg1);
10571 }
10574 {
10581 arg1);
10582 }
10583 }
10585 /* If this is an NE or EQ comparison of zero against the result of a
10586 signed MOD operation whose second operand is a power of 2, make
10587 the MOD operation unsigned since it is simpler and equivalent. */
10595 {
10605 }
10607 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10608 C1 is a valid shift constant, and C2 is a power of two, i.e.
10609 a single bit. */
10613 == INTEGER_CST
10616 {
10621 /* Check for a valid shift count. */
10623 {
10627 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10628 can be rewritten as (X & (C2 << C1)) != 0. */
10630 {
10635 }
10636 /* Otherwise, for signed (arithmetic) shifts,
10637 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10638 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10642 /* Otherwise, of unsigned (logical) shifts,
10643 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10644 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10645 else
10649 arg000);
10650 }
10651 }
10653 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
10654 Similarly for NE_EXPR. */
10658 {
10662 tree dandnotc
10665 notc);
10669 }
10671 /* If this is a comparison of a field, we may be able to simplify it. */
10674 /* Handle the constant case even without -O
10675 to make sure the warnings are given. */
10677 {
10681 }
10683 /* Optimize comparisons of strlen vs zero to a compare of the
10684 first character of the string vs zero. To wit,
10685 strlen(ptr) == 0 => *ptr == 0
10686 strlen(ptr) != 0 => *ptr != 0
10687 Other cases should reduce to one of these two (or a constant)
10688 due to the return value of strlen being unsigned. */
10691 {
10699 {
10704 }
10705 }
10707 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10708 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10712 {
10717 {
10719 {
10722 }
10725 }
10726 }
10728 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10729 (X & C) == 0 when C is a single bit. */
10734 {
10741 arg1));
10742 }
10744 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10745 constant C is a power of two, i.e. a single bit. */
10752 {
10756 }
10758 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10759 when is C is a power of two, i.e. a single bit. */
10766 {
10772 }
10776 {
10779 }
10781 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10784 {
10797 arg01),
10806 arg01),
10815 arg00),
10824 arg00),
10826 }
10830 {
10837 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
10838 operand_equal_p guarantees no side-effects so we don't need
10839 to use omit_one_operand on Z. */
10843 arg10));
10847 arg11));
10851 arg10));
10855 arg11));
10857 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
10860 {
10866 }
10867 }
10869 /* Attempt to simplify equality/inequality comparisons of complex
10870 values. Only lower the comparison if the result is known or
10871 can be simplified to a single scalar comparison. */
10876 {
10881 {
10884 }
10885 else
10886 {
10889 }
10892 {
10895 }
10896 else
10897 {
10900 }
10904 {
10906 {
10911 }
10912 else
10913 {
10918 }
10919 }
10923 {
10925 {
10930 }
10931 else
10932 {
10937 }
10938 }
10939 }
10951 /* Transform comparisons of the form X +- C CMP X. */
10958 {
10965 else
10968 /* (X - c) > X becomes false. */
10972 {
10976 "occur when assuming that (X - c) > X "
10978 WARN_STRICT_OVERFLOW_ALL);
10980 }
10982 /* Likewise (X + c) < X becomes false. */
10986 {
10990 "occur when assuming that "
10992 WARN_STRICT_OVERFLOW_ALL);
10994 }
10996 /* Convert (X - c) <= X to true. */
11001 {
11005 "occur when assuming that "
11007 WARN_STRICT_OVERFLOW_ALL);
11009 }
11011 /* Convert (X + c) >= X to true. */
11016 {
11020 "occur when assuming that "
11022 WARN_STRICT_OVERFLOW_ALL);
11024 }
11027 {
11028 /* Convert X + c > X and X - c < X to true for integers. */
11032 {
11035 "not occur when assuming that "
11037 WARN_STRICT_OVERFLOW_ALL);
11039 }
11044 {
11047 "not occur when assuming that "
11049 WARN_STRICT_OVERFLOW_ALL);
11051 }
11053 /* Convert X + c <= X and X - c >= X to false for integers. */
11057 {
11060 "not occur when assuming that "
11062 WARN_STRICT_OVERFLOW_ALL);
11064 }
11069 {
11072 "not occur when assuming that "
11074 WARN_STRICT_OVERFLOW_ALL);
11076 }
11077 }
11078 }
11080 /* If we are comparing an ABS_EXPR with a constant, we can
11081 convert all the cases into explicit comparisons, but they may
11082 well not be faster than doing the ABS and one comparison.
11083 But ABS (X) <= C is a range comparison, which becomes a subtraction
11084 and a comparison, and is probably faster. */
11098 /* Convert ABS_EXPR<x> >= 0 to true. */
11105 {
11108 "when simplifying comparison of "
11110 WARN_STRICT_OVERFLOW_CONDITIONAL);
11113 arg0);
11114 }
11116 /* Convert ABS_EXPR<x> < 0 to false. */
11121 {
11124 "when simplifying comparison of "
11126 WARN_STRICT_OVERFLOW_CONDITIONAL);
11129 arg0);
11130 }
11132 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11133 and similarly for >= into !=. */
11143 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11144 otherwise Y might be >= # of bits in X's type and thus e.g.
11145 (unsigned char) (1 << Y) for Y 15 might be 0.
11146 If the cast is widening, then 1 << Y should have unsigned type,
11147 otherwise if Y is number of bits in the signed shift type minus 1,
11148 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11149 31 might be 0xffffffff80000000. */
11160 {
11166 }
11178 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11179 {
11191 }
11196 /* When pedantic, a compound expression can be neither an lvalue
11197 nor an integer constant expression. */
11200 /* Don't let (0, 0) be null pointer constant. */
11206 /* An ASSERT_EXPR should never be passed to fold_binary. */
11212 }
11214 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11215 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
11216 of GOTO_EXPR. */
11218 static tree
11220 {
11222 {
11229 /* fall through */
11233 }
11234 }
11236 /* Return whether the sub-tree ST contains a label which is accessible from
11237 outside the sub-tree. */
11239 static bool
11241 {
11242 return
11244 }
11246 /* Fold a ternary expression of code CODE and type TYPE with operands
11247 OP0, OP1, and OP2. Return the folded expression if folding is
11248 successful. Otherwise, return NULL_TREE. */
11250 tree
11253 {
11254 tree tem;
11261 /* If this is a commutative operation, and OP0 is a constant, move it
11262 to OP1 to reduce the number of tests below. */
11271 /* Strip any conversions that don't change the mode. This is safe
11272 for every expression, except for a comparison expression because
11273 its signedness is derived from its operands. So, in the latter
11274 case, only strip conversions that don't change the signedness.
11276 Note that this is done as an internal manipulation within the
11277 constant folder, in order to find the simplest representation of
11278 the arguments so that their form can be studied. In any cases,
11279 the appropriate type conversions should be put back in the tree
11280 that will get out of the constant folder. */
11282 {
11285 }
11288 {
11291 }
11294 {
11297 }
11300 {
11304 {
11310 }
11315 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11316 so all simple results must be passed through pedantic_non_lvalue. */
11318 {
11321 /* Only optimize constant conditions when the selected branch
11322 has the same type as the COND_EXPR. This avoids optimizing
11323 away "c ? x : throw", where the throw has a void type.
11324 Avoid throwing away that operand which contains label. */
11331 }
11333 {
11338 {
11343 {
11351 }
11355 }
11356 }
11358 /* If we have A op B ? A : C, we may be able to convert this to a
11359 simpler expression, depending on the operation and the values
11360 of B and C. Signed zeros prevent all of these transformations,
11361 for reasons given above each one.
11363 Also try swapping the arguments and inverting the conditional. */
11368 {
11372 }
11376 op2,
11379 {
11383 {
11387 }
11388 }
11390 /* If the second operand is simpler than the third, swap them
11391 since that produces better jump optimization results. */
11394 {
11396 /* See if this can be inverted. If it can't, possibly because
11397 it was a floating-point inequality comparison, don't do
11398 anything. */
11402 }
11404 /* Convert A ? 1 : 0 to simply A. */
11409 /* If we try to convert OP0 to our type, the
11410 call to fold will try to move the conversion inside
11411 a COND, which will recurse. In that case, the COND_EXPR
11412 is probably the best choice, so leave it alone. */
11416 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11417 over COND_EXPR in cases such as floating point comparisons. */
11426 arg0)));
11428 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11433 {
11434 /* sign_bit_p looks through both zero and sign extensions,
11435 but for this optimization only sign extensions are
11436 usable. */
11439 {
11442 {
11445 }
11447 }
11448 /* sign_bit_p only checks ARG1 bits within A's precision.
11449 If <sign bit of A> has wider type than A, bits outside
11450 of A's precision in <sign bit of A> need to be checked.
11451 If they are all 0, this optimization needs to be done
11452 in unsigned A's type, if they are all 1 in signed A's type,
11453 otherwise this can't be done. */
11459 {
11461 tree tem_type;
11474 {
11477 }
11479 {
11482 }
11483 else
11485 }
11488 return
11494 arg1)));
11495 }
11497 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11498 already handled above. */
11503 {
11512 }
11514 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11515 is probably obsolete because the first operand should be a
11516 truth value (that's why we have the two cases above), but let's
11517 leave it in until we can confirm this for all front-ends. */
11529 /* Disable the transformations below for vectors, since
11530 fold_binary_op_with_conditional_arg may undo them immediately,
11531 yielding an infinite loop. */
11535 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11544 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11549 {
11551 /* Only perform transformation if ARG0 is easily inverted. */
11555 ? BIT_IOR_EXPR
11558 arg1);
11559 }
11561 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11566 {
11568 /* Only perform transformation if ARG0 is easily inverted. */
11574 op2);
11575 }
11577 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11589 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11590 of fold_ternary on them. */
11598 {
11608 {
11613 {
11621 }
11622 }
11623 }
11625 /* On constants we can use native encode/interpret to constant
11626 fold (nearly) all BIT_FIELD_REFs. */
11630 {
11633 /* Limit us to a reasonable amount of work. To relax the
11634 other limitations we need bit-shifting of the buffer
11635 and rounding up the size. */
11639 {
11641 unsigned HOST_WIDE_INT len
11646 {
11651 }
11652 }
11653 }
11658 /* For integers we can decompose the FMA if possible. */
11670 {
11686 {
11691 /* Make sure that the perm value is in an acceptable
11692 range. */
11701 else
11706 }
11709 {
11714 }
11719 {
11724 }
11730 {
11734 }
11739 /* Some targets are deficient and fail to expand a single
11740 argument permutation while still allowing an equivalent
11741 2-argument version. */
11745 {
11748 }
11751 {
11758 }
11762 }
11766 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
11769 {
11775 wide_int tem2
11779 }
11784 {
11786 unsigned HOST_WIDE_INT elsize
11789 {
11793 else
11794 {
11800 }
11801 }
11802 }
11808 }
11810 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
11811 of an array (or vector). */
11813 tree
11815 {
11820 {
11823 {
11824 /* Static constructors for variably sized objects makes no sense. */
11828 }
11829 }
11840 offset_int max_index;
11845 {
11846 /* Array constructor might explicitly set index, or specify a range,
11847 or leave index NULL meaning that it is next index after previous
11848 one. */
11850 {
11853 else
11854 {
11858 }
11859 }
11860 else
11861 {
11867 }
11869 /* Do we have match? */
11873 }
11875 }
11877 /* Perform constant folding and related simplification of EXPR.
11878 The related simplifications include x*1 => x, x*0 => 0, etc.,
11879 and application of the associative law.
11880 NOP_EXPR conversions may be removed freely (as long as we
11881 are careful not to change the type of the overall expression).
11882 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
11883 but we can constant-fold them if they have constant operands. */
11885 #ifdef ENABLE_FOLD_CHECKING
11886 # define fold(x) fold_1 (x)
11888 static
11889 #endif
11890 tree
11892 {
11896 tree tem;
11899 /* Return right away if a constant. */
11903 /* CALL_EXPR-like objects with variable numbers of operands are
11904 treated specially. */
11906 {
11908 {
11911 }
11913 }
11916 {
11921 {
11939 }
11940 }
11943 {
11945 {
11952 {
11957 }
11960 }
11962 /* Return a VECTOR_CST if possible. */
11964 {
11970 tree val;
11976 }
11984 }
11986 #ifdef ENABLE_FOLD_CHECKING
11987 #undef fold
11994 /* When --enable-checking=fold, compute a digest of expr before
11995 and after actual fold call to see if fold did not accidentally
11996 change original expr. */
11998 tree
12000 {
12001 tree ret;
12021 }
12023 void
12025 {
12036 }
12038 static void
12040 {
12042 }
12044 static void
12047 {
12053 recursive_label:
12063 {
12064 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12069 }
12077 {
12078 /* Allow these fields to be modified. */
12079 tree tmp;
12088 {
12091 }
12092 }
12103 {
12106 {
12121 }
12125 {
12138 }
12155 {
12161 }
12164 {
12166 {
12169 }
12171 }
12182 {
12185 }
12195 }
12196 }
12198 /* Helper function for outputting the checksum of a tree T. When
12199 debugging with gdb, you can "define mynext" to be "next" followed
12200 by "call debug_fold_checksum (op0)", then just trace down till the
12201 outputs differ. */
12203 DEBUG_FUNCTION void
12205 {
12220 }
12222 #endif
12224 /* Fold a unary tree expression with code CODE of type TYPE with an
12225 operand OP0. LOC is the location of the resulting expression.
12226 Return a folded expression if successful. Otherwise, return a tree
12227 expression with code CODE of type TYPE with an operand OP0. */
12229 tree
12232 {
12233 tree tem;
12234 #ifdef ENABLE_FOLD_CHECKING
12243 #endif
12249 #ifdef ENABLE_FOLD_CHECKING
12256 #endif
12258 }
12260 /* Fold a binary tree expression with code CODE of type TYPE with
12261 operands OP0 and OP1. LOC is the location of the resulting
12262 expression. Return a folded expression if successful. Otherwise,
12263 return a tree expression with code CODE of type TYPE with operands
12264 OP0 and OP1. */
12266 tree
12269 MEM_STAT_DECL)
12270 {
12271 tree tem;
12272 #ifdef ENABLE_FOLD_CHECKING
12289 #endif
12295 #ifdef ENABLE_FOLD_CHECKING
12310 #endif
12312 }
12314 /* Fold a ternary tree expression with code CODE of type TYPE with
12315 operands OP0, OP1, and OP2. Return a folded expression if
12316 successful. Otherwise, return a tree expression with code CODE of
12317 type TYPE with operands OP0, OP1, and OP2. */
12319 tree
12322 {
12323 tree tem;
12324 #ifdef ENABLE_FOLD_CHECKING
12348 #endif
12355 #ifdef ENABLE_FOLD_CHECKING
12378 #endif
12380 }
12382 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12383 arguments in ARGARRAY, and a null static chain.
12384 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12385 of type TYPE from the given operands as constructed by build_call_array. */
12387 tree
12390 {
12391 tree tem;
12392 #ifdef ENABLE_FOLD_CHECKING
12411 #endif
12417 #ifdef ENABLE_FOLD_CHECKING
12433 #endif
12435 }
12437 /* Perform constant folding and related simplification of initializer
12438 expression EXPR. These behave identically to "fold_buildN" but ignore
12439 potential run-time traps and exceptions that fold must preserve. */
12441 #define START_FOLD_INIT \
12442 int saved_signaling_nans = flag_signaling_nans;\
12443 int saved_trapping_math = flag_trapping_math;\
12444 int saved_rounding_math = flag_rounding_math;\
12445 int saved_trapv = flag_trapv;\
12446 int saved_folding_initializer = folding_initializer;\
12447 flag_signaling_nans = 0;\
12448 flag_trapping_math = 0;\
12449 flag_rounding_math = 0;\
12450 flag_trapv = 0;\
12451 folding_initializer = 1;
12453 #define END_FOLD_INIT \
12454 flag_signaling_nans = saved_signaling_nans;\
12455 flag_trapping_math = saved_trapping_math;\
12456 flag_rounding_math = saved_rounding_math;\
12457 flag_trapv = saved_trapv;\
12458 folding_initializer = saved_folding_initializer;
12460 tree
12463 {
12464 tree result;
12465 START_FOLD_INIT;
12469 END_FOLD_INIT;
12471 }
12473 tree
12476 {
12477 tree result;
12478 START_FOLD_INIT;
12482 END_FOLD_INIT;
12484 }
12486 tree
12489 {
12490 tree result;
12491 START_FOLD_INIT;
12495 END_FOLD_INIT;
12497 }
12499 #undef START_FOLD_INIT
12500 #undef END_FOLD_INIT
12502 /* Determine if first argument is a multiple of second argument. Return 0 if
12503 it is not, or we cannot easily determined it to be.
12505 An example of the sort of thing we care about (at this point; this routine
12506 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12507 fold cases do now) is discovering that
12509 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12511 is a multiple of
12513 SAVE_EXPR (J * 8)
12515 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12517 This code also handles discovering that
12519 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12521 is a multiple of 8 so we don't have to worry about dealing with a
12522 possible remainder.
12524 Note that we *look* inside a SAVE_EXPR only to determine how it was
12525 calculated; it is not safe for fold to do much of anything else with the
12526 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12527 at run time. For example, the latter example above *cannot* be implemented
12528 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12529 evaluation time of the original SAVE_EXPR is not necessarily the same at
12530 the time the new expression is evaluated. The only optimization of this
12531 sort that would be valid is changing
12533 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12535 divided by 8 to
12537 SAVE_EXPR (I) * SAVE_EXPR (J)
12539 (where the same SAVE_EXPR (J) is used in the original and the
12540 transformed version). */
12542 int
12544 {
12555 {
12557 /* Bitwise and provides a power of two multiple. If the mask is
12558 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12561 /* FALLTHRU */
12568 /* It is impossible to prove if op0 - op1 is multiple of bottom
12569 precisely, so be conservative here checking if both op0 and op1
12570 are multiple of bottom. Note we check the second operand first
12571 since it's usually simpler. */
12576 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
12577 as op0 - 3 if the expression has unsigned type. For example,
12578 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
12588 {
12590 /* const_binop may not detect overflow correctly,
12591 so check for it explicitly here. */
12595 size_one_node,
12596 op1)))
12599 }
12603 /* Can't handle conversions from non-integral or wider integral type. */
12609 /* fall through */
12626 SIGNED);
12632 {
12635 /* Check for special cases to see if top is defined as multiple
12636 of bottom:
12638 top = (X & ~(bottom - 1) ; bottom is power of 2
12640 or
12642 Y = X % bottom
12643 top = X - Y. */
12662 }
12664 /* fall through */
12668 }
12669 }
12671 #define tree_expr_nonnegative_warnv_p(X, Y) \
12674 #define RECURSE(X) \
12675 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
12677 /* Return true if CODE or TYPE is known to be non-negative. */
12679 static bool
12681 {
12684 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12685 have a signed:1 type (where the value is -1 and 0). */
12688 }
12690 /* Return true if (CODE OP0) is known to be non-negative. If the return
12691 value is based on the assumption that signed overflow is undefined,
12692 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12693 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12695 bool
12698 {
12703 {
12705 /* We can't return 1 if flag_wrapv is set because
12706 ABS_EXPR<INT_MIN> = INT_MIN. */
12710 {
12713 }
12721 CASE_CONVERT:
12722 {
12727 {
12731 {
12735 }
12736 }
12738 {
12744 }
12745 }
12750 }
12752 /* We don't know sign of `t', so be conservative and return false. */
12754 }
12756 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12757 value is based on the assumption that signed overflow is undefined,
12758 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12759 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12761 bool
12765 {
12770 {
12776 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12777 both unsigned and at least 2 bits shorter than the result. */
12781 {
12786 {
12790 }
12791 }
12796 {
12797 /* x * x is always non-negative for floating point x
12798 or without overflow. */
12801 {
12806 }
12807 }
12809 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12810 both unsigned and their total bits is shorter than the result. */
12814 {
12833 {
12843 }
12844 }
12871 }
12873 /* We don't know sign of `t', so be conservative and return false. */
12875 }
12877 /* Return true if T is known to be non-negative. If the return
12878 value is based on the assumption that signed overflow is undefined,
12879 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12880 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12882 bool
12884 {
12889 {
12903 /* Limit the depth of recursion to avoid quadratic behavior.
12904 This is expected to catch almost all occurrences in practice.
12905 If this code misses important cases that unbounded recursion
12906 would not, passes that need this information could be revised
12907 to provide it through dataflow propagation. */
12915 }
12916 }
12918 /* Return true if T is known to be non-negative. If the return
12919 value is based on the assumption that signed overflow is undefined,
12920 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12921 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12923 bool
12926 {
12928 {
12929 CASE_CFN_ACOS:
12930 CASE_CFN_ACOSH:
12931 CASE_CFN_CABS:
12932 CASE_CFN_COSH:
12933 CASE_CFN_ERFC:
12934 CASE_CFN_EXP:
12935 CASE_CFN_EXP10:
12936 CASE_CFN_EXP2:
12937 CASE_CFN_FABS:
12938 CASE_CFN_FDIM:
12939 CASE_CFN_HYPOT:
12940 CASE_CFN_POW10:
12941 CASE_CFN_FFS:
12942 CASE_CFN_PARITY:
12943 CASE_CFN_POPCOUNT:
12944 CASE_CFN_CLZ:
12945 CASE_CFN_CLRSB:
12948 /* Always true. */
12951 CASE_CFN_SQRT:
12952 /* sqrt(-0.0) is -0.0. */
12957 CASE_CFN_ASINH:
12958 CASE_CFN_ATAN:
12959 CASE_CFN_ATANH:
12960 CASE_CFN_CBRT:
12961 CASE_CFN_CEIL:
12962 CASE_CFN_ERF:
12963 CASE_CFN_EXPM1:
12964 CASE_CFN_FLOOR:
12965 CASE_CFN_FMOD:
12966 CASE_CFN_FREXP:
12967 CASE_CFN_ICEIL:
12968 CASE_CFN_IFLOOR:
12969 CASE_CFN_IRINT:
12970 CASE_CFN_IROUND:
12971 CASE_CFN_LCEIL:
12972 CASE_CFN_LDEXP:
12973 CASE_CFN_LFLOOR:
12974 CASE_CFN_LLCEIL:
12975 CASE_CFN_LLFLOOR:
12976 CASE_CFN_LLRINT:
12977 CASE_CFN_LLROUND:
12978 CASE_CFN_LRINT:
12979 CASE_CFN_LROUND:
12980 CASE_CFN_MODF:
12981 CASE_CFN_NEARBYINT:
12982 CASE_CFN_RINT:
12983 CASE_CFN_ROUND:
12984 CASE_CFN_SCALB:
12985 CASE_CFN_SCALBLN:
12986 CASE_CFN_SCALBN:
12987 CASE_CFN_SIGNBIT:
12988 CASE_CFN_SIGNIFICAND:
12989 CASE_CFN_SINH:
12990 CASE_CFN_TANH:
12991 CASE_CFN_TRUNC:
12992 /* True if the 1st argument is nonnegative. */
12995 CASE_CFN_FMAX:
12996 /* True if the 1st OR 2nd arguments are nonnegative. */
12999 CASE_CFN_FMIN:
13000 /* True if the 1st AND 2nd arguments are nonnegative. */
13003 CASE_CFN_COPYSIGN:
13004 /* True if the 2nd argument is nonnegative. */
13007 CASE_CFN_POWI:
13008 /* True if the 1st argument is nonnegative or the second
13009 argument is an even integer. */
13015 CASE_CFN_POW:
13016 /* True if the 1st argument is nonnegative or the second
13017 argument is an even integer valued real. */
13019 {
13020 REAL_VALUE_TYPE c;
13021 HOST_WIDE_INT n;
13026 {
13027 REAL_VALUE_TYPE cint;
13031 }
13032 }
13037 }
13039 }
13041 /* Return true if T is known to be non-negative. If the return
13042 value is based on the assumption that signed overflow is undefined,
13043 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13044 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13046 static bool
13048 {
13054 {
13056 {
13060 /* If the initializer is non-void, then it's a normal expression
13061 that will be assigned to the slot. */
13065 /* Otherwise, the initializer sets the slot in some way. One common
13066 way is an assignment statement at the end of the initializer. */
13068 {
13076 else
13078 }
13084 }
13087 {
13093 arg0,
13094 arg1,
13096 }
13109 }
13110 }
13112 #undef RECURSE
13113 #undef tree_expr_nonnegative_warnv_p
13115 /* Return true if T is known to be non-negative. If the return
13116 value is based on the assumption that signed overflow is undefined,
13117 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13118 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13120 bool
13122 {
13129 {
13151 }
13154 {
13180 }
13181 }
13183 /* Return true if `t' is known to be non-negative. Handle warnings
13184 about undefined signed overflow. */
13186 bool
13188 {
13195 "determining that expression is always "
13197 WARN_STRICT_OVERFLOW_MISC);
13199 }
13202 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13203 For floating point we further ensure that T is not denormal.
13204 Similar logic is present in nonzero_address in rtlanal.h.
13206 If the return value is based on the assumption that signed overflow
13207 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13208 change *STRICT_OVERFLOW_P. */
13210 bool
13213 {
13215 {
13218 strict_overflow_p);
13221 {
13227 strict_overflow_p));
13228 }
13233 strict_overflow_p);
13237 }
13240 }
13242 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13243 For floating point we further ensure that T is not denormal.
13244 Similar logic is present in nonzero_address in rtlanal.h.
13246 If the return value is based on the assumption that signed overflow
13247 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13248 change *STRICT_OVERFLOW_P. */
13250 bool
13252 tree type,
13253 tree op0,
13255 {
13258 {
13262 {
13263 /* With the presence of negative values it is hard
13264 to say something. */
13271 /* One of operands must be positive and the other non-negative. */
13272 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13273 overflows, on a twos-complement machine the sum of two
13274 nonnegative numbers can never be zero. */
13276 strict_overflow_p)
13278 strict_overflow_p));
13279 }
13284 {
13286 strict_overflow_p)
13288 strict_overflow_p))
13289 {
13292 }
13293 }
13302 {
13305 }
13312 {
13316 /* When both operands are nonzero, then MAX must be too. */
13318 strict_overflow_p))
13321 /* MAX where operand 0 is positive is positive. */
13323 strict_overflow_p);
13324 }
13325 /* MAX where operand 1 is positive is positive. */
13330 {
13334 }
13339 strict_overflow_p)
13341 strict_overflow_p));
13345 }
13348 }
13350 /* Return true when T is an address and is known to be nonzero.
13351 For floating point we further ensure that T is not denormal.
13352 Similar logic is present in nonzero_address in rtlanal.h.
13354 If the return value is based on the assumption that signed overflow
13355 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13356 change *STRICT_OVERFLOW_P. */
13358 bool
13360 {
13363 {
13368 {
13380 /* For objects in symbol table check if we know they are non-zero.
13381 Don't do anything for variables and functions before symtab is built;
13382 it is quite possible that they will be declared weak later. */
13387 /* Function local objects are never NULL. */
13394 /* Constants are never weak. */
13399 }
13407 {
13411 }
13416 }
13418 }
13420 #define integer_valued_real_p(X) \
13423 #define RECURSE(X) \
13424 ((integer_valued_real_p) (X, depth + 1))
13426 /* Return true if the floating point result of (CODE OP0) has an
13427 integer value. We also allow +Inf, -Inf and NaN to be considered
13428 integer values. Return false for signaling NaN.
13430 DEPTH is the current nesting depth of the query. */
13432 bool
13434 {
13436 {
13443 CASE_CONVERT:
13444 {
13451 }
13455 }
13457 }
13459 /* Return true if the floating point result of (CODE OP0 OP1) has an
13460 integer value. We also allow +Inf, -Inf and NaN to be considered
13461 integer values. Return false for signaling NaN.
13463 DEPTH is the current nesting depth of the query. */
13465 bool
13467 {
13469 {
13479 }
13481 }
13483 /* Return true if the floating point result of calling FNDECL with arguments
13484 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13485 considered integer values. Return false for signaling NaN. If FNDECL
13486 takes fewer than 2 arguments, the remaining ARGn are null.
13488 DEPTH is the current nesting depth of the query. */
13490 bool
13492 {
13494 {
13495 CASE_CFN_CEIL:
13496 CASE_CFN_FLOOR:
13497 CASE_CFN_NEARBYINT:
13498 CASE_CFN_RINT:
13499 CASE_CFN_ROUND:
13500 CASE_CFN_TRUNC:
13503 CASE_CFN_FMIN:
13504 CASE_CFN_FMAX:
13509 }
13511 }
13513 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13514 has an integer value. We also allow +Inf, -Inf and NaN to be
13515 considered integer values. Return false for signaling NaN.
13517 DEPTH is the current nesting depth of the query. */
13519 bool
13521 {
13523 {
13531 /* Limit the depth of recursion to avoid quadratic behavior.
13532 This is expected to catch almost all occurrences in practice.
13533 If this code misses important cases that unbounded recursion
13534 would not, passes that need this information could be revised
13535 to provide it through dataflow propagation. */
13539 depth));
13543 }
13545 }
13547 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
13548 has an integer value. We also allow +Inf, -Inf and NaN to be
13549 considered integer values. Return false for signaling NaN.
13551 DEPTH is the current nesting depth of the query. */
13553 static bool
13555 {
13557 {
13568 }
13570 }
13572 #undef RECURSE
13573 #undef integer_valued_real_p
13575 /* Return true if the floating point expression T has an integer value.
13576 We also allow +Inf, -Inf and NaN to be considered integer values.
13577 Return false for signaling NaN.
13579 DEPTH is the current nesting depth of the query. */
13581 bool
13583 {
13589 {
13605 }
13608 {
13614 {
13623 }
13627 }
13628 }
13630 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13631 attempt to fold the expression to a constant without modifying TYPE,
13632 OP0 or OP1.
13634 If the expression could be simplified to a constant, then return
13635 the constant. If the expression would not be simplified to a
13636 constant, then return NULL_TREE. */
13638 tree
13640 {
13643 }
13645 /* Given the components of a unary expression CODE, TYPE and OP0,
13646 attempt to fold the expression to a constant without modifying
13647 TYPE or OP0.
13649 If the expression could be simplified to a constant, then return
13650 the constant. If the expression would not be simplified to a
13651 constant, then return NULL_TREE. */
13653 tree
13655 {
13658 }
13660 /* If EXP represents referencing an element in a constant string
13661 (either via pointer arithmetic or array indexing), return the
13662 tree representing the value accessed, otherwise return NULL. */
13664 tree
13666 {
13670 {
13672 tree index;
13673 tree string;
13678 else
13679 {
13683 /* Optimize the special-case of a zero lower bound.
13685 We convert the low_bound to sizetype to avoid some problems
13686 with constant folding. (E.g. suppose the lower bound is 1,
13687 and its mode is QI. Without the conversion,l (ARRAY
13688 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13689 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13695 }
13708 }
13710 }
13712 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13713 an integer constant, real, or fixed-point constant.
13715 TYPE is the type of the result. */
13717 static tree
13719 {
13723 {
13725 {
13732 }
13739 {
13740 FIXED_VALUE_TYPE f;
13745 /* Propagate overflow flags. */
13749 }
13753 }
13756 }
13758 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13759 an integer constant or real constant.
13761 TYPE is the type of the result. */
13763 tree
13765 {
13769 {
13771 {
13772 /* If the value is unsigned or non-negative, then the absolute value
13773 is the same as the ordinary value. */
13777 /* If the value is negative, then the absolute value is
13778 its negation. */
13779 else
13780 {
13785 }
13786 }
13792 else
13798 }
13801 }
13803 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13804 constant. TYPE is the type of the result. */
13806 static tree
13808 {
13812 }
13814 /* Given CODE, a relational operator, the target type, TYPE and two
13815 constant operands OP0 and OP1, return the result of the
13816 relational operation. If the result is not a compile time
13817 constant, then return NULL_TREE. */
13819 static tree
13821 {
13824 /* From here on, the only cases we handle are when the result is
13825 known to be a constant. */
13828 {
13832 /* Handle the cases where either operand is a NaN. */
13834 {
13836 {
13864 }
13867 }
13870 }
13873 {
13877 }
13879 /* Handle equality/inequality of complex constants. */
13881 {
13892 else
13894 }
13897 {
13899 {
13900 /* Have vector comparison with scalar boolean result. */
13904 {
13912 }
13914 }
13921 {
13933 }
13936 }
13938 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
13940 To compute GT, swap the arguments and do LT.
13941 To compute GE, do LT and invert the result.
13942 To compute LE, swap the arguments, do LT and invert the result.
13943 To compute NE, do EQ and invert the result.
13945 Therefore, the code below must handle only EQ and LT. */
13948 {
13951 }
13953 /* Note that it is safe to invert for real values here because we
13954 have already handled the one case that it matters. */
13958 {
13961 }
13963 /* Compute a result for LT or EQ if args permit;
13964 Otherwise return T. */
13966 {
13969 else
13971 }
13972 else
13978 }
13980 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
13981 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
13982 itself. */
13984 tree
13986 {
13987 /* If the expression does not have side effects then we don't have to wrap
13988 it with a cleanup point expression. */
13992 /* If the expression is a return, check to see if the expression inside the
13993 return has no side effects or the right hand side of the modify expression
13994 inside the return. If either don't have side effects set we don't need to
13995 wrap the expression in a cleanup point expression. Note we don't check the
13996 left hand side of the modify because it should always be a return decl. */
13998 {
14005 }
14008 }
14010 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14011 of an indirection through OP0, or NULL_TREE if no simplification is
14012 possible. */
14014 tree
14016 {
14018 tree subtype;
14026 {
14029 /* *&CONST_DECL -> to the value of the const decl. */
14032 /* *&p => p; make sure to handle *&"str"[cst] here. */
14034 {
14038 else
14040 }
14041 /* *(foo *)&fooarray => fooarray[0] */
14044 && (!in_gimple_form
14046 {
14056 }
14057 /* *(foo *)&complexfoo => __real__ complexfoo */
14061 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14064 {
14068 }
14069 }
14073 {
14079 {
14080 tree op00type;
14084 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14087 {
14089 unsigned HOST_WIDE_INT max_offset
14094 {
14101 }
14102 }
14103 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14106 {
14110 }
14111 /* ((foo *)&fooarray)[1] => fooarray[1] */
14114 {
14124 }
14125 }
14126 }
14128 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14131 && (!in_gimple_form
14133 {
14134 tree type_domain;
14144 NULL_TREE);
14145 }
14148 }
14150 /* Builds an expression for an indirection through T, simplifying some
14151 cases. */
14153 tree
14155 {
14163 }
14165 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14167 tree
14169 {
14174 else
14176 }
14178 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14179 whose result is ignored. The type of the returned tree need not be
14180 the same as the original expression. */
14182 tree
14184 {
14190 {
14201 else
14207 {
14223 }
14228 }
14229 }
14231 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14233 tree
14235 {
14241 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14242 have to do anything. Only do this when we are not given a const,
14243 because in that case, this check is more expensive than just
14244 doing it. */
14246 {
14251 }
14253 /* If divisor is a power of two, simplify this to bit manipulation. */
14255 {
14257 {
14271 }
14272 else
14273 {
14274 tree t;
14280 }
14281 }
14282 else
14283 {
14288 }
14291 }
14293 /* Likewise, but round down. */
14295 tree
14297 {
14304 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14305 have to do anything. Only do this when we are not given a const,
14306 because in that case, this check is more expensive than just
14307 doing it. */
14309 {
14314 }
14316 /* If divisor is a power of two, simplify this to bit manipulation. */
14318 {
14319 tree t;
14323 }
14324 else
14325 {
14330 }
14333 }
14335 /* Returns the pointer to the base of the object addressed by EXP and
14336 extracts the information about the offset of the access, storing it
14337 to PBITPOS and POFFSET. */
14339 static tree
14342 {
14343 tree core;
14344 machine_mode mode;
14346 HOST_WIDE_INT bitsize;
14350 {
14355 }
14356 else
14357 {
14361 }
14364 }
14366 /* Returns true if addresses of E1 and E2 differ by a constant, false
14367 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14369 bool
14371 {
14385 {
14395 }
14397 {
14398 /* If only one of the offsets is non-constant, the difference cannot
14399 be a constant. */
14401 }
14402 else
14407 }
14409 /* Return OFF converted to a pointer offset type suitable as offset for
14410 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14411 tree
14413 {
14415 }
14417 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14418 tree
14420 {
14423 }
14425 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14426 tree
14428 {
14431 }
14433 /* Return a char pointer for a C string if it is a string constant
14434 or sum of string constant and integer constant. */
14438 {
14439 tree offset_node;
14452 }
14454 #if CHECKING_P
14458 /* Helper functions for writing tests of folding trees. */
14460 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
14462 static void
14464 tree constant)
14465 {
14467 }
14469 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
14470 wrapping WRAPPED_EXPR. */
14472 static void
14474 tree wrapped_expr)
14475 {
14480 }
14482 /* Verify that various arithmetic binary operations are folded
14483 correctly. */
14485 static void
14487 {
14493 /* Addition. */
14494 /* 1 <-- (0 + 1) */
14496 one);
14498 one);
14500 /* (nonlvalue)x <-- (x + 0) */
14502 x);
14504 /* Subtraction. */
14505 /* 0 <-- (x - x) */
14507 zero);
14509 x);
14511 /* Multiplication. */
14512 /* 0 <-- (x * 0) */
14514 zero);
14516 /* (nonlvalue)x <-- (x * 1) */
14518 x);
14519 }
14521 /* Verify that various binary operations on vectors are folded
14522 correctly. */
14524 static void
14526 {
14532 /* Verify equality tests that return a scalar boolean result. */
14538 }
14540 /* Run all of the selftests within this file. */
14542 void
14544 {
14547 }