| blob | 6db16b514f1f32efd2e0a9beb2bb402c6137a398 |
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2017 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. */
83 /* Nonzero if we are folding constants inside an initializer; zero
84 otherwise. */
87 /* The following constants represent a bit based encoding of GCC's
88 comparison operators. This encoding simplifies transformations
89 on relational comparison operators, such as AND and OR. */
107 };
145 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
146 Otherwise, return LOC. */
148 static location_t
150 {
153 }
155 /* Similar to protected_set_expr_location, but never modify x in place,
156 if location can and needs to be set, unshare it. */
160 {
166 {
169 }
171 }
172 \f
173 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
174 division and returns the quotient. Otherwise returns
175 NULL_TREE. */
177 tree
179 {
180 widest_int quo;
187 }
188 \f
189 /* This is nonzero if we should defer warnings about undefined
190 overflow. This facility exists because these warnings are a
191 special case. The code to estimate loop iterations does not want
192 to issue any warnings, since it works with expressions which do not
193 occur in user code. Various bits of cleanup code call fold(), but
194 only use the result if it has certain characteristics (e.g., is a
195 constant); that code only wants to issue a warning if the result is
196 used. */
200 /* If a warning about undefined overflow is deferred, this is the
201 warning. Note that this may cause us to turn two warnings into
202 one, but that is fine since it is sufficient to only give one
203 warning per expression. */
207 /* If a warning about undefined overflow is deferred, this is the
208 level at which the warning should be emitted. */
212 /* Start deferring overflow warnings. We could use a stack here to
213 permit nested calls, but at present it is not necessary. */
215 void
217 {
219 }
221 /* Stop deferring overflow warnings. If there is a pending warning,
222 and ISSUE is true, then issue the warning if appropriate. STMT is
223 the statement with which the warning should be associated (used for
224 location information); STMT may be NULL. CODE is the level of the
225 warning--a warn_strict_overflow_code value. This function will use
226 the smaller of CODE and the deferred code when deciding whether to
227 issue the warning. CODE may be zero to mean to always use the
228 deferred code. */
230 void
232 {
234 location_t locus;
239 {
245 }
256 /* Use the smallest code level when deciding to issue the
257 warning. */
266 else
269 }
271 /* Stop deferring overflow warnings, ignoring any deferred
272 warnings. */
274 void
276 {
278 }
280 /* Whether we are deferring overflow warnings. */
282 bool
284 {
286 }
288 /* This is called when we fold something based on the fact that signed
289 overflow is undefined. */
291 void
293 {
295 {
298 {
301 }
302 }
305 }
306 \f
307 /* Return true if the built-in mathematical function specified by CODE
308 is odd, i.e. -f(x) == f(-x). */
310 bool
312 {
314 {
315 CASE_CFN_ASIN:
316 CASE_CFN_ASINH:
317 CASE_CFN_ATAN:
318 CASE_CFN_ATANH:
319 CASE_CFN_CASIN:
320 CASE_CFN_CASINH:
321 CASE_CFN_CATAN:
322 CASE_CFN_CATANH:
323 CASE_CFN_CBRT:
324 CASE_CFN_CPROJ:
325 CASE_CFN_CSIN:
326 CASE_CFN_CSINH:
327 CASE_CFN_CTAN:
328 CASE_CFN_CTANH:
329 CASE_CFN_ERF:
330 CASE_CFN_LLROUND:
331 CASE_CFN_LROUND:
332 CASE_CFN_ROUND:
333 CASE_CFN_SIN:
334 CASE_CFN_SINH:
335 CASE_CFN_TAN:
336 CASE_CFN_TANH:
337 CASE_CFN_TRUNC:
340 CASE_CFN_LLRINT:
341 CASE_CFN_LRINT:
342 CASE_CFN_NEARBYINT:
343 CASE_CFN_RINT:
348 }
350 }
352 /* Check whether we may negate an integer constant T without causing
353 overflow. */
355 bool
357 {
358 tree type;
367 }
369 /* Determine whether an expression T can be cheaply negated using
370 the function negate_expr without introducing undefined overflow. */
372 static bool
374 {
375 tree type;
384 {
389 /* Check that -CST will not overflow type. */
402 /* We want to canonicalize to positive real constants. Pretend
403 that only negative ones can be easily negated. */
411 {
422 }
437 /* -(A + B) -> (-B) - A. */
440 /* -(A + B) -> (-A) - B. */
444 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
453 /* INT_MIN/n * n doesn't overflow while negating one operand it does
454 if n is a (negative) power of two. */
463 /* Fall through. */
478 /* In general we can't negate B in A / B, because if A is INT_MIN and
479 B is 1, we may turn this into INT_MIN / -1 which is undefined
480 and actually traps on some architectures. */
489 /* Negate -((double)float) as (double)(-float). */
491 {
495 }
499 /* Negate -f(x) as f(-x). */
505 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
507 {
511 }
516 }
518 }
520 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
521 simplification is possible.
522 If negate_expr_p would return true for T, NULL_TREE will never be
523 returned. */
525 static tree
527 {
529 tree tem;
532 {
533 /* Convert - (~A) to A + 1. */
559 {
564 }
568 {
573 {
577 }
580 }
603 {
604 /* -(A + B) -> (-B) - A. */
606 {
610 }
612 /* -(A + B) -> (-A) - B. */
614 {
618 }
619 }
623 /* - (A - B) -> B - A */
634 /* Fall through. */
638 {
647 }
659 /* In general we can't negate B in A / B, because if A is INT_MIN and
660 B is 1, we may turn this into INT_MIN / -1 which is undefined
661 and actually traps on some architectures. */
673 /* Convert -((double)float) into (double)(-float). */
675 {
679 }
683 /* Negate -f(x) as f(-x). */
686 {
692 }
696 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
698 {
701 {
708 }
709 }
714 }
717 }
719 /* A wrapper for fold_negate_expr_1. */
721 static tree
723 {
730 }
732 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
733 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
734 return NULL_TREE. */
736 static tree
738 {
740 location_t loc;
753 }
754 \f
755 /* Split a tree IN into a constant, literal and variable parts that could be
756 combined with CODE to make IN. "constant" means an expression with
757 TREE_CONSTANT but that isn't an actual constant. CODE must be a
758 commutative arithmetic operation. Store the constant part into *CONP,
759 the literal in *LITP and return the variable part. If a part isn't
760 present, set it to null. If the tree does not decompose in this way,
761 return the entire tree as the variable part and the other parts as null.
763 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
764 case, we negate an operand that was subtracted. Except if it is a
765 literal for which we use *MINUS_LITP instead.
767 If NEGATE_P is true, we are negating all of IN, again except a literal
768 for which we use *MINUS_LITP instead. If a variable part is of pointer
769 type, it is negated after converting to TYPE. This prevents us from
770 generating illegal MINUS pointer expression. LOC is the location of
771 the converted variable part.
773 If IN is itself a literal or constant, return it as appropriate.
775 Note that we do not guarantee that any of the three values will be the
776 same type as IN, but they will have the same signedness and mode. */
778 static tree
781 {
788 /* Strip any conversions that don't change the machine mode or signedness. */
797 /* We can associate addition and subtraction together (even
798 though the C standard doesn't say so) for integers because
799 the value is not affected. For reals, the value might be
800 affected, so we can't. */
803 {
809 /* First see if either of the operands is a literal, then a constant. */
822 /* If we haven't dealt with either operand, this is not a case we can
823 decompose. Otherwise, VAR is either of the ones remaining, if any. */
828 else
831 /* Now do any needed negations. */
837 {
838 /* Convert to TYPE before negating. */
841 }
842 }
847 {
848 /* -X - 1 is folded to ~X, undo that here. Do _not_ do this
849 when IN is constant. */
852 }
853 else
857 {
864 {
865 /* Convert to TYPE before negating. */
868 }
869 }
872 }
874 /* Re-associate trees split by the above function. T1 and T2 are
875 either expressions to associate or null. Return the new
876 expression, if any. LOC is the location of the new expression. If
877 we build an operation, do it in TYPE and with CODE. */
879 static tree
881 {
887 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
888 try to fold this since we will have infinite recursion. But do
889 deal with any NEGATE_EXPRs. */
892 {
894 {
907 }
909 {
912 }
916 }
920 }
921 \f
922 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
923 for use in int_const_binop, size_binop and size_diffop. */
925 static bool
927 {
934 {
943 }
948 }
951 /* Combine two integer constants ARG1 and ARG2 under operation CODE
952 to produce a new constant. Return NULL_TREE if we don't know how
953 to evaluate CODE at compile-time. */
955 static tree
958 {
959 wide_int res;
960 tree t;
968 {
984 {
988 else
990 }
993 /* It's unclear from the C standard whether shifts can overflow.
994 The following code ignores overflow; perhaps a C standard
995 interpretation ruling is needed. */
997 else
1004 {
1008 else
1010 }
1014 else
1093 }
1101 }
1103 tree
1105 {
1107 }
1109 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1110 constant. We assume ARG1 and ARG2 have the same data type, or at least
1111 are the same kind of constant and the same machine mode. Return zero if
1112 combining the constants is not allowed in the current operating mode. */
1114 static tree
1116 {
1117 /* Sanity check for the recursive cases. */
1125 {
1131 }
1134 {
1135 machine_mode mode;
1136 REAL_VALUE_TYPE d1;
1137 REAL_VALUE_TYPE d2;
1138 REAL_VALUE_TYPE value;
1139 REAL_VALUE_TYPE result;
1143 /* The following codes are handled by real_arithmetic. */
1145 {
1156 }
1164 /* Don't perform operation if we honor signaling NaNs and
1165 either operand is a signaling NaN. */
1171 /* Don't perform operation if it would raise a division
1172 by zero exception. */
1178 /* If either operand is a NaN, just return it. Otherwise, set up
1179 for floating-point trap; we return an overflow. */
1181 {
1182 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1183 is off. */
1187 }
1189 {
1190 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1191 is off. */
1195 }
1200 /* Don't constant fold this floating point operation if
1201 the result has overflowed and flag_trapping_math. */
1209 /* Don't constant fold this floating point operation if the
1210 result may dependent upon the run-time rounding mode and
1211 flag_rounding_math is set, or if GCC's software emulation
1212 is unable to accurately represent the result. */
1222 }
1225 {
1226 FIXED_VALUE_TYPE f1;
1227 FIXED_VALUE_TYPE f2;
1228 FIXED_VALUE_TYPE result;
1233 /* The following codes are handled by fixed_arithmetic. */
1235 {
1247 {
1254 }
1259 }
1266 /* Propagate overflow flags. */
1270 }
1273 {
1282 {
1293 mpc_mul);
1307 mpc_div);
1308 /* Fallthru. */
1314 {
1315 /* Keep this algorithm in sync with
1316 tree-complex.c:expand_complex_div_straight().
1318 Expand complex division to scalars, straightforward algorithm.
1319 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1320 t = br*br + bi*bi
1321 */
1322 tree magsquared
1326 tree t1
1330 tree t2
1337 }
1338 else
1339 {
1340 /* Keep this algorithm in sync with
1341 tree-complex.c:expand_complex_div_wide().
1343 Expand complex division to scalars, modified algorithm to minimize
1344 overflow with wide input ranges. */
1350 {
1351 /* In the TRUE branch, we compute
1352 ratio = br/bi;
1353 div = (br * ratio) + bi;
1354 tr = (ar * ratio) + ai;
1355 ti = (ai * ratio) - ar;
1356 tr = tr / div;
1357 ti = ti / div; */
1368 }
1369 else
1370 {
1371 /* In the FALSE branch, we compute
1372 ratio = d/c;
1373 divisor = (d * ratio) + c;
1374 tr = (b * ratio) + a;
1375 ti = b - (a * ratio);
1376 tr = tr / div;
1377 ti = ti / div; */
1389 }
1390 }
1395 }
1399 }
1403 {
1409 {
1415 /* It is possible that const_binop cannot handle the given
1416 code and return NULL_TREE */
1419 }
1422 }
1424 /* Shifts allow a scalar offset for a vector. */
1427 {
1433 {
1438 /* It is possible that const_binop cannot handle the given
1439 code and return NULL_TREE. */
1442 }
1445 }
1447 }
1449 /* Overload that adds a TYPE parameter to be able to dispatch
1450 to fold_relational_const. */
1452 tree
1454 {
1458 /* ??? Until we make the const_binop worker take the type of the
1459 result as argument put those cases that need it here. */
1461 {
1472 {
1488 {
1494 }
1497 }
1503 {
1528 {
1541 }
1544 }
1547 }
1552 /* Make sure type and arg0 have the same saturating flag. */
1557 }
1559 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1560 Return zero if computing the constants is not possible. */
1562 tree
1564 {
1565 /* Don't perform the operation, other than NEGATE and ABS, if
1566 flag_signaling_nans is on and the operand is a signaling NaN. */
1575 {
1576 CASE_CONVERT:
1583 /* If the source address is 0, and the source address space
1584 cannot have a valid object at 0, fold to dest type null. */
1595 {
1596 /* Can't call fold_negate_const directly here as that doesn't
1597 handle all cases and we might not be able to negate some
1598 constants. */
1603 }
1612 {
1616 }
1622 /* Perform BIT_NOT_EXPR on each element individually. */
1624 {
1626 tree elem;
1631 {
1637 }
1640 }
1662 {
1681 else
1685 {
1689 }
1692 }
1697 {
1711 {
1716 }
1719 {
1723 }
1726 }
1730 }
1733 }
1735 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1736 indicates which particular sizetype to create. */
1738 tree
1740 {
1742 }
1743 \f
1744 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1745 is a tree code. The type of the result is taken from the operands.
1746 Both must be equivalent integer types, ala int_binop_types_match_p.
1747 If the operands are constant, so is the result. */
1749 tree
1751 {
1760 /* Handle the special case of two integer constants faster. */
1762 {
1763 /* And some specific cases even faster than that. */
1765 {
1770 }
1772 {
1775 }
1777 {
1780 }
1782 /* Handle general case of two integer constants. For sizetype
1783 constant calculations we always want to know about overflow,
1784 even in the unsigned case. */
1786 }
1789 }
1791 /* Given two values, either both of sizetype or both of bitsizetype,
1792 compute the difference between the two values. Return the value
1793 in signed type corresponding to the type of the operands. */
1795 tree
1797 {
1799 tree ctype;
1804 /* If the type is already signed, just do the simple thing. */
1812 else
1815 /* If either operand is not a constant, do the conversions to the signed
1816 type and subtract. The hardware will do the right thing with any
1817 overflow in the subtraction. */
1823 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1824 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1825 overflow) and negate (which can't either). Special-case a result
1826 of zero while we're here. */
1832 else
1836 MINUS_EXPR,
1838 }
1839 \f
1840 /* A subroutine of fold_convert_const handling conversions of an
1841 INTEGER_CST to another integer type. */
1843 static tree
1845 {
1846 /* Given an integer constant, make new constant with new type,
1847 appropriately sign-extended or truncated. Use widest_int
1848 so that any extension is done according ARG1's type. */
1852 }
1854 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1855 to an integer type. */
1857 static tree
1859 {
1861 tree t;
1863 /* The following code implements the floating point to integer
1864 conversion rules required by the Java Language Specification,
1865 that IEEE NaNs are mapped to zero and values that overflow
1866 the target precision saturate, i.e. values greater than
1867 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1868 are mapped to INT_MIN. These semantics are allowed by the
1869 C and C++ standards that simply state that the behavior of
1870 FP-to-integer conversion is unspecified upon overflow. */
1872 wide_int val;
1873 REAL_VALUE_TYPE r;
1877 {
1884 }
1886 /* If R is NaN, return zero and show we have an overflow. */
1888 {
1891 }
1893 /* See if R is less than the lower bound or greater than the
1894 upper bound. */
1897 {
1901 {
1904 }
1905 }
1908 {
1911 {
1914 {
1917 }
1918 }
1919 }
1926 }
1928 /* A subroutine of fold_convert_const handling conversions of a
1929 FIXED_CST to an integer type. */
1931 static tree
1933 {
1934 tree t;
1938 /* Right shift FIXED_CST to temp by fbit. */
1942 {
1944 HOST_BITS_PER_DOUBLE_INT,
1947 /* Left shift temp to temp_trunc by fbit. */
1949 HOST_BITS_PER_DOUBLE_INT,
1951 }
1952 else
1953 {
1956 }
1958 /* If FIXED_CST is negative, we need to round the value toward 0.
1959 By checking if the fractional bits are not zero to add 1 to temp. */
1965 /* Given a fixed-point constant, make new constant with new type,
1966 appropriately sign-extended or truncated. */
1974 }
1976 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1977 to another floating point type. */
1979 static tree
1981 {
1982 REAL_VALUE_TYPE value;
1983 tree t;
1985 /* Don't perform the operation if flag_signaling_nans is on
1986 and the operand is a signaling NaN. */
1994 /* If converting an infinity or NAN to a representation that doesn't
1995 have one, set the overflow bit so that we can produce some kind of
1996 error message at the appropriate point if necessary. It's not the
1997 most user-friendly message, but it's better than nothing. */
2004 /* Regular overflow, conversion produced an infinity in a mode that
2005 can't represent them. */
2010 else
2013 }
2015 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2016 to a floating point type. */
2018 static tree
2020 {
2021 REAL_VALUE_TYPE value;
2022 tree t;
2029 }
2031 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2032 to another fixed-point type. */
2034 static tree
2036 {
2037 FIXED_VALUE_TYPE value;
2038 tree t;
2045 /* Propagate overflow flags. */
2049 }
2051 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2052 to a fixed-point type. */
2054 static tree
2056 {
2057 FIXED_VALUE_TYPE value;
2058 tree t;
2060 double_int di;
2067 else
2075 /* Propagate overflow flags. */
2079 }
2081 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2082 to a fixed-point type. */
2084 static tree
2086 {
2087 FIXED_VALUE_TYPE value;
2088 tree t;
2096 /* Propagate overflow flags. */
2100 }
2102 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2103 type TYPE. If no simplification can be done return NULL_TREE. */
2105 static tree
2107 {
2113 {
2120 }
2122 {
2129 }
2131 {
2138 }
2140 {
2143 {
2148 {
2154 }
2156 }
2157 }
2159 }
2161 /* Construct a vector of zero elements of vector type TYPE. */
2163 static tree
2165 {
2166 tree t;
2170 }
2172 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2174 bool
2176 {
2191 {
2206 }
2207 }
2209 /* Convert expression ARG to type TYPE. Used by the middle-end for
2210 simple conversions in preference to calling the front-end's convert. */
2212 tree
2214 {
2216 tree tem;
2227 {
2230 /* Handle conversions between pointers to different address spaces. */
2235 /* fall through */
2240 {
2244 }
2258 {
2262 }
2264 {
2268 }
2270 {
2274 }
2277 {
2295 }
2300 {
2304 }
2307 {
2321 }
2325 {
2334 integer_zero_node));
2336 {
2340 {
2346 }
2354 }
2358 }
2376 }
2377 fold_convert_exit:
2380 }
2381 \f
2382 /* Return false if expr can be assumed not to be an lvalue, true
2383 otherwise. */
2385 static bool
2387 {
2388 /* We only need to wrap lvalue tree codes. */
2390 {
2421 /* Assume the worst for front-end tree codes. */
2425 }
2428 }
2430 /* Return an expr equal to X but certainly not valid as an lvalue. */
2432 tree
2434 {
2435 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2436 us. */
2443 }
2445 /* When pedantic, return an expr equal to X but certainly not valid as a
2446 pedantic lvalue. Otherwise, return X. */
2448 static tree
2450 {
2452 }
2453 \f
2454 /* Given a tree comparison code, return the code that is the logical inverse.
2455 It is generally not safe to do this for floating-point comparisons, except
2456 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2457 ERROR_MARK in this case. */
2459 enum tree_code
2461 {
2467 {
2498 }
2499 }
2501 /* Similar, but return the comparison that results if the operands are
2502 swapped. This is safe for floating-point. */
2504 enum tree_code
2506 {
2508 {
2534 }
2535 }
2538 /* Convert a comparison tree code from an enum tree_code representation
2539 into a compcode bit-based encoding. This function is the inverse of
2540 compcode_to_comparison. */
2542 static enum comparison_code
2544 {
2546 {
2577 }
2578 }
2580 /* Convert a compcode bit-based encoding of a comparison operator back
2581 to GCC's enum tree_code representation. This function is the
2582 inverse of comparison_to_compcode. */
2584 static enum tree_code
2586 {
2588 {
2619 }
2620 }
2622 /* Return a tree for the comparison which is the combination of
2623 doing the AND or OR (depending on CODE) of the two operations LCODE
2624 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2625 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2626 if this makes the transformation invalid. */
2628 tree
2633 {
2640 {
2651 }
2654 {
2655 /* Eliminate unordered comparisons, as well as LTGT and ORD
2656 which are not used unless the mode has NaNs. */
2662 }
2664 {
2665 /* Check that the original operation and the optimized ones will trap
2666 under the same condition. */
2677 /* In a short-circuited boolean expression the LHS might be
2678 such that the RHS, if evaluated, will never trap. For
2679 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2680 if neither x nor y is NaN. (This is a mixed blessing: for
2681 example, the expression above will never trap, hence
2682 optimizing it to x < y would be invalid). */
2687 /* If the comparison was short-circuited, and only the RHS
2688 trapped, we may now generate a spurious trap. */
2693 /* If we changed the conditions that cause a trap, we lose. */
2696 }
2702 else
2703 {
2708 }
2709 }
2710 \f
2711 /* Return nonzero if two operands (typically of the same tree node)
2712 are necessarily equal. FLAGS modifies behavior as follows:
2714 If OEP_ONLY_CONST is set, only return nonzero for constants.
2715 This function tests whether the operands are indistinguishable;
2716 it does not test whether they are equal using C's == operation.
2717 The distinction is important for IEEE floating point, because
2718 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2719 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2721 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2722 even though it may hold multiple values during a function.
2723 This is because a GCC tree node guarantees that nothing else is
2724 executed between the evaluation of its "operands" (which may often
2725 be evaluated in arbitrary order). Hence if the operands themselves
2726 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2727 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2728 unset means assuming isochronic (or instantaneous) tree equivalence.
2729 Unless comparing arbitrary expression trees, such as from different
2730 statements, this flag can usually be left unset.
2732 If OEP_PURE_SAME is set, then pure functions with identical arguments
2733 are considered the same. It is used when the caller has other ways
2734 to ensure that global memory is unchanged in between.
2736 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2737 not values of expressions.
2739 If OEP_LEXICOGRAPHIC is set, then also handle expressions with side-effects
2740 such as MODIFY_EXPR, RETURN_EXPR, as well as STATEMENT_LISTs.
2742 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2743 any operand with side effect. This is unnecesarily conservative in the
2744 case we know that arg0 and arg1 are in disjoint code paths (such as in
2745 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2746 addresses with TREE_CONSTANT flag set so we know that &var == &var
2747 even if var is volatile. */
2749 int
2751 {
2752 /* When checking, verify at the outermost operand_equal_p call that
2753 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
2754 hash value. */
2756 {
2758 {
2760 {
2767 }
2769 }
2770 else
2772 }
2774 /* If either is ERROR_MARK, they aren't equal. */
2780 /* Similar, if either does not have a type (like a released SSA name),
2781 they aren't equal. */
2785 /* We cannot consider pointers to different address space equal. */
2792 /* Check equality of integer constants before bailing out due to
2793 precision differences. */
2795 {
2796 /* Address of INTEGER_CST is not defined; check that we did not forget
2797 to drop the OEP_ADDRESS_OF flags. */
2800 }
2803 {
2804 /* If both types don't have the same signedness, then we can't consider
2805 them equal. We must check this before the STRIP_NOPS calls
2806 because they may change the signedness of the arguments. As pointers
2807 strictly don't have a signedness, require either two pointers or
2808 two non-pointers as well. */
2814 /* If both types don't have the same precision, then it is not safe
2815 to strip NOPs. */
2822 }
2823 #if 0
2824 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
2825 sanity check once the issue is solved. */
2826 else
2827 /* Addresses of conversions and SSA_NAMEs (and many other things)
2828 are not defined. Check that we did not forget to drop the
2829 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
2832 #endif
2834 /* In case both args are comparisons but with different comparison
2835 code, try to swap the comparison operands of one arg to produce
2836 a match and compare that variant. */
2840 {
2848 }
2851 {
2852 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2854 ;
2856 {
2857 /* If we are interested in comparing addresses ignore
2858 MEM_REF wrappings of the base that can appear just for
2859 TBAA reasons. */
2873 }
2874 else
2876 }
2878 /* When not checking adddresses, this is needed for conversions and for
2879 COMPONENT_REF. Might as well play it safe and always test this. */
2886 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2887 We don't care about side effects in that case because the SAVE_EXPR
2888 takes care of that for us. In all other cases, two expressions are
2889 equal if they have no side effects. If we have two identical
2890 expressions with side effects that should be treated the same due
2891 to the only side effects being identical SAVE_EXPR's, that will
2892 be detected in the recursive calls below.
2893 If we are taking an invariant address of two identical objects
2894 they are necessarily equal as well. */
2901 /* Next handle constant cases, those for which we can return 1 even
2902 if ONLY_CONST is set. */
2905 {
2919 {
2920 /* If we do not distinguish between signed and unsigned zero,
2921 consider them equal. */
2924 }
2928 {
2935 {
2939 }
2941 }
2945 flags)
2947 flags));
2958 flags | OEP_ADDRESS_OF
2961 /* In GIMPLE empty constructors are allowed in initializers of
2962 aggregates. */
2966 }
2971 /* Define macros to test an operand from arg0 and arg1 for equality and a
2972 variant that allows null and views null as being different from any
2973 non-null value. In the latter case, if either is null, the both
2974 must be; otherwise, do the normal comparison. */
2975 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2976 TREE_OPERAND (arg1, N), flags)
2978 #define OP_SAME_WITH_NULL(N) \
2979 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2980 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2983 {
2985 /* Two conversions are equal only if signedness and modes match. */
2987 {
2988 CASE_CONVERT:
2996 }
3006 /* For commutative ops, allow the other order. */
3014 /* If either of the pointer (or reference) expressions we are
3015 dereferencing contain a side effect, these cannot be equal,
3016 but their addresses can be. */
3023 {
3033 /* Require the same offset. */
3039 /* Fallthru. */
3047 {
3048 /* Require equal access sizes */
3054 flags)))
3056 /* Verify that access happens in similar types. */
3059 /* Verify that accesses are TBAA compatible. */
3068 /* Verify that alignment is compatible. */
3072 }
3075 /* TARGET_MEM_REF require equal extra operands. */
3086 /* Compare the array index by value if it is constant first as we
3087 may have different types but same value here. */
3093 /* Compare low bound and element size as with OEP_ADDRESS_OF
3094 we have to account for the offset of the ref. */
3099 array_ref_low_bound
3103 array_ref_element_size
3105 flags))));
3108 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3109 may be NULL when we're called to compare MEM_EXPRs. */
3124 }
3128 {
3130 /* Be sure we pass right ADDRESS_OF flag. */
3148 /* The multiplcation operands are commutative. */
3149 /* FALLTHRU */
3157 /* Otherwise take into account this is a commutative operation. */
3193 }
3197 {
3201 /* If not both CALL_EXPRs are either internal or normal function
3202 functions, then they are not equal. */
3205 {
3206 /* If the CALL_EXPRs call different internal functions, then they
3207 are not equal. */
3210 }
3211 else
3212 {
3213 /* If the CALL_EXPRs call different functions, then they are not
3214 equal. */
3216 flags))
3218 }
3220 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3221 {
3225 else
3229 }
3231 /* Now see if all the arguments are the same. */
3232 {
3243 /* If we get here and both argument lists are exhausted
3244 then the CALL_EXPRs are equal. */
3246 }
3249 }
3252 /* Consider __builtin_sqrt equal to sqrt. */
3260 {
3261 /* In GIMPLE constructors are used only to build vectors from
3262 elements. Individual elements in the constructor must be
3263 indexed in increasing order and form an initial sequence.
3265 We make no effort to compare constructors in generic.
3266 (see sem_variable::equals in ipa-icf which can do so for
3267 constants). */
3272 /* Be sure that vectors constructed have the same representation.
3273 We only tested element precision and modes to match.
3274 Vectors may be BLKmode and thus also check that the number of
3275 parts match. */
3288 {
3293 /* In GIMPLE the indexes can be either NULL or matching i.
3294 Double check this so we won't get false
3295 positives for GENERIC. */
3303 }
3305 }
3308 {
3309 /* Compare the STATEMENT_LISTs. */
3315 {
3316 /* The lists don't have the same number of statements. */
3322 OEP_LEXICOGRAPHIC))
3324 }
3325 }
3330 {
3337 }
3341 }
3343 #undef OP_SAME
3344 #undef OP_SAME_WITH_NULL
3345 }
3346 \f
3347 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3348 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3350 When in doubt, return 0. */
3352 static int
3354 {
3366 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3367 and see if the inner values are the same. This removes any
3368 signedness comparison, which doesn't matter here. */
3375 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3376 actual comparison operand, ARG0.
3378 First throw away any conversions to wider types
3379 already present in the operands. */
3388 {
3391 /* Make sure shorter operand is extended the right way
3392 to match the longer operand. */
3398 }
3401 }
3402 \f
3403 /* See if ARG is an expression that is either a comparison or is performing
3404 arithmetic on comparisons. The comparisons must only be comparing
3405 two different values, which will be stored in *CVAL1 and *CVAL2; if
3406 they are nonzero it means that some operands have already been found.
3407 No variables may be used anywhere else in the expression except in the
3408 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3409 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3411 If this is true, return 1. Otherwise, return zero. */
3413 static int
3415 {
3419 /* We can handle some of the tcc_expression cases here. */
3429 {
3430 /* If we've already found a CVAL1 or CVAL2, this expression is
3431 two complex to handle. */
3437 }
3440 {
3463 /* First see if we can handle the first operand, then the second. For
3464 the second operand, we know *CVAL1 can't be zero. It must be that
3465 one side of the comparison is each of the values; test for the
3466 case where this isn't true by failing if the two operands
3467 are the same. */
3476 ;
3480 ;
3481 else
3485 ;
3489 ;
3490 else
3497 }
3498 }
3499 \f
3500 /* ARG is a tree that is known to contain just arithmetic operations and
3501 comparisons. Evaluate the operations in the tree substituting NEW0 for
3502 any occurrence of OLD0 as an operand of a comparison and likewise for
3503 NEW1 and OLD1. */
3505 static tree
3508 {
3513 /* We can handle some of the tcc_expression cases here. */
3521 {
3536 {
3555 }
3556 /* Fall through - ??? */
3559 {
3563 /* We need to check both for exact equality and tree equality. The
3564 former will be true if the operand has a side-effect. In that
3565 case, we know the operand occurred exactly once. */
3578 }
3582 }
3583 }
3584 \f
3585 /* Return a tree for the case when the result of an expression is RESULT
3586 converted to TYPE and OMITTED was previously an operand of the expression
3587 but is now not needed (e.g., we folded OMITTED * 0).
3589 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3590 the conversion of RESULT to TYPE. */
3592 tree
3594 {
3597 /* If the resulting operand is an empty statement, just return the omitted
3598 statement casted to void. */
3608 }
3610 /* Return a tree for the case when the result of an expression is RESULT
3611 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3612 of the expression but are now not needed.
3614 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3615 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3616 evaluated before OMITTED2. Otherwise, if neither has side effects,
3617 just do the conversion of RESULT to TYPE. */
3619 tree
3622 {
3631 }
3633 \f
3634 /* Return a simplified tree node for the truth-negation of ARG. This
3635 never alters ARG itself. We assume that ARG is an operation that
3636 returns a truth value (0 or 1).
3638 FIXME: one would think we would fold the result, but it causes
3639 problems with the dominator optimizer. */
3641 static tree
3643 {
3648 /* If this is a comparison, we can simply invert it, except for
3649 floating-point non-equality comparisons, in which case we just
3650 enclose a TRUTH_NOT_EXPR around what we have. */
3653 {
3656 && flag_trapping_math
3670 }
3673 {
3692 /* Here we can invert either operand. We invert the first operand
3693 unless the second operand is a TRUTH_NOT_EXPR in which case our
3694 result is the XOR of the first operand with the inside of the
3695 negation of the second operand. */
3700 else
3723 {
3730 /* A COND_EXPR may have a throw as one operand, which
3731 then has void type. Just leave void operands
3732 as they are. */
3738 }
3750 CASE_CONVERT:
3754 /* fall through */
3776 }
3777 }
3779 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3780 assume that ARG is an operation that returns a truth value (0 or 1
3781 for scalars, 0 or -1 for vectors). Return the folded expression if
3782 folding is successful. Otherwise, return NULL_TREE. */
3784 static tree
3786 {
3789 ? BIT_NOT_EXPR
3792 }
3794 /* Return a simplified tree node for the truth-negation of ARG. This
3795 never alters ARG itself. We assume that ARG is an operation that
3796 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3798 tree
3800 {
3806 ? BIT_NOT_EXPR
3809 }
3811 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3812 with code CODE. This optimization is unsafe. */
3813 static tree
3816 {
3820 /* (A / C) +- (B / C) -> (A +- B) / C. */
3830 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3835 {
3847 }
3850 }
3851 \f
3852 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3853 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
3854 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
3855 is the original memory reference used to preserve the alias set of
3856 the access. */
3858 static tree
3862 {
3865 /* Attempt not to lose the access path if possible. */
3867 {
3869 machine_mode nmode;
3871 tree noffset;
3881 && !reversep
3882 && !nreversep
3884 {
3887 }
3888 }
3897 {
3904 }
3919 }
3921 /* Optimize a bit-field compare.
3923 There are two cases: First is a compare against a constant and the
3924 second is a comparison of two items where the fields are at the same
3925 bit position relative to the start of a chunk (byte, halfword, word)
3926 large enough to contain it. In these cases we can avoid the shift
3927 implicit in bitfield extractions.
3929 For constants, we emit a compare of the shifted constant with the
3930 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3931 compared. For two fields at the same position, we do the ANDs with the
3932 similar mask and compare the result of the ANDs.
3934 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3935 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3936 are the left and right operands of the comparison, respectively.
3938 If the optimization described above can be done, we return the resulting
3939 tree. Otherwise we return zero. */
3941 static tree
3944 {
3947 tree unsigned_type;
3954 tree mask;
3955 tree offset;
3957 /* Get all the information about the extractions being done. If the bit size
3958 if the same as the size of the underlying object, we aren't doing an
3959 extraction at all and so can do nothing. We also don't want to
3960 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3961 then will no longer be able to replace it. */
3970 else
3971 {
3972 /* If this is not a constant, we can only do something if bit positions,
3973 sizes, signedness and storage order are the same. */
3974 rinner
3982 }
3984 /* Honor the C++ memory model and mimic what RTL expansion does. */
3988 {
3992 }
3994 /* See if we can find a mode to refer to this field. We should be able to,
3995 but fail if we can't. */
4004 /* Set signed and unsigned types of the precision of this mode for the
4005 shifts below. */
4008 /* Compute the bit position and size for the new reference and our offset
4009 within it. If the new reference is the same size as the original, we
4010 won't optimize anything, so return zero. */
4020 /* Make the mask to be used against the extracted field. */
4027 /* If not comparing with constant, just rework the comparison
4028 and return. */
4032 unsigned_type,
4035 mask),
4038 unsigned_type,
4041 mask));
4043 /* Otherwise, we are handling the constant case. See if the constant is too
4044 big for the field. Warn and return a tree for 0 (false) if so. We do
4045 this not only for its own sake, but to avoid having to test for this
4046 error case below. If we didn't, we might generate wrong code.
4048 For unsigned fields, the constant shifted right by the field length should
4049 be all zero. For signed fields, the high-order bits should agree with
4050 the sign bit. */
4053 {
4055 {
4059 }
4060 }
4061 else
4062 {
4065 {
4069 }
4070 }
4072 /* Single-bit compares should always be against zero. */
4074 {
4077 }
4079 /* Make a new bitfield reference, shift the constant over the
4080 appropriate number of bits and mask it with the computed mask
4081 (in case this was a signed field). If we changed it, make a new one. */
4089 mask);
4094 }
4095 \f
4096 /* Subroutine for fold_truth_andor_1: decode a field reference.
4098 If EXP is a comparison reference, we return the innermost reference.
4100 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4101 set to the starting bit number.
4103 If the innermost field can be completely contained in a mode-sized
4104 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4106 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4107 otherwise it is not changed.
4109 *PUNSIGNEDP is set to the signedness of the field.
4111 *PREVERSEP is set to the storage order of the field.
4113 *PMASK is set to the mask used. This is either contained in a
4114 BIT_AND_EXPR or derived from the width of the field.
4116 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4118 Return 0 if this is not a component reference or is one that we can't
4119 do anything with. */
4121 static tree
4126 {
4131 tree unsigned_type;
4134 /* All the optimizations using this function assume integer fields.
4135 There are problems with FP fields since the type_for_size call
4136 below can fail for, e.g., XFmode. */
4140 /* We are interested in the bare arrangement of bits, so strip everything
4141 that doesn't affect the machine mode. However, record the type of the
4142 outermost expression if it may matter below. */
4149 {
4155 }
4162 /* Reject out-of-bound accesses (PR79731). */
4170 /* If the number of bits in the reference is the same as the bitsize of
4171 the outer type, then the outer type gives the signedness. Otherwise
4172 (in case of a small bitfield) the signedness is unchanged. */
4176 /* Compute the mask to access the bitfield. */
4185 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4193 }
4195 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4196 bit positions and MASK is SIGNED. */
4198 static int
4200 {
4204 /* If this function returns true when the type of the mask is
4205 UNSIGNED, then there will be errors. In particular see
4206 gcc.c-torture/execute/990326-1.c. There does not appear to be
4207 any documentation paper trail as to why this is so. But the pre
4208 wide-int worked with that restriction and it has been preserved
4209 here. */
4214 }
4216 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4217 represents the sign bit of EXP's type. If EXP represents a sign
4218 or zero extension, also test VAL against the unextended type.
4219 The return value is the (sub)expression whose sign bit is VAL,
4220 or NULL_TREE otherwise. */
4222 tree
4224 {
4226 tree t;
4228 /* Tree EXP must have an integral type. */
4233 /* Tree VAL must be an integer constant. */
4242 /* Handle extension from a narrower type. */
4248 }
4250 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4251 to be evaluated unconditionally. */
4253 static int
4255 {
4256 /* Strip any conversions that don't change the machine mode. */
4265 /* Don't regard global variables as simple. They may be
4266 allocated in ways unknown to the compiler (shared memory,
4267 #pragma weak, etc). */
4270 /* Weakrefs are not safe to be read, since they can be NULL.
4271 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4272 have DECL_WEAK flag set. */
4274 /* Loading a static variable is unduly expensive, but global
4275 registers aren't expensive. */
4277 }
4279 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4280 to be evaluated unconditionally.
4281 I addition to simple_operand_p, we assume that comparisons, conversions,
4282 and logic-not operations are simple, if their operands are simple, too. */
4284 static bool
4286 {
4306 }
4308 \f
4309 /* The following functions are subroutines to fold_range_test and allow it to
4310 try to change a logical combination of comparisons into a range test.
4312 For example, both
4313 X == 2 || X == 3 || X == 4 || X == 5
4314 and
4315 X >= 2 && X <= 5
4316 are converted to
4317 (unsigned) (X - 2) <= 3
4319 We describe each set of comparisons as being either inside or outside
4320 a range, using a variable named like IN_P, and then describe the
4321 range with a lower and upper bound. If one of the bounds is omitted,
4322 it represents either the highest or lowest value of the type.
4324 In the comments below, we represent a range by two numbers in brackets
4325 preceded by a "+" to designate being inside that range, or a "-" to
4326 designate being outside that range, so the condition can be inverted by
4327 flipping the prefix. An omitted bound is represented by a "-". For
4328 example, "- [-, 10]" means being outside the range starting at the lowest
4329 possible value and ending at 10, in other words, being greater than 10.
4330 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4331 always false.
4333 We set up things so that the missing bounds are handled in a consistent
4334 manner so neither a missing bound nor "true" and "false" need to be
4335 handled using a special case. */
4337 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4338 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4339 and UPPER1_P are nonzero if the respective argument is an upper bound
4340 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4341 must be specified for a comparison. ARG1 will be converted to ARG0's
4342 type if both are specified. */
4344 static tree
4347 {
4348 tree tem;
4352 /* If neither arg represents infinity, do the normal operation.
4353 Else, if not a comparison, return infinity. Else handle the special
4354 comparison rules. Note that most of the cases below won't occur, but
4355 are handled for consistency. */
4358 {
4363 }
4368 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4369 for neither. In real maths, we cannot assume open ended ranges are
4370 the same. But, this is computer arithmetic, where numbers are finite.
4371 We can therefore make the transformation of any unbounded range with
4372 the value Z, Z being greater than any representable number. This permits
4373 us to treat unbounded ranges as equal. */
4377 {
4398 }
4401 }
4402 \f
4403 /* Helper routine for make_range. Perform one step for it, return
4404 new expression if the loop should continue or NULL_TREE if it should
4405 stop. */
4407 tree
4411 {
4417 {
4419 /* We can only do something if the range is testing for zero. */
4428 /* We can only do something if the range is testing for zero
4429 and if the second operand is an integer constant. Note that
4430 saying something is "in" the range we make is done by
4431 complementing IN_P since it will set in the initial case of
4432 being not equal to zero; "out" is leaving it alone. */
4439 {
4460 }
4462 /* If this is an unsigned comparison, we also know that EXP is
4463 greater than or equal to zero. We base the range tests we make
4464 on that fact, so we record it here so we can parse existing
4465 range tests. We test arg0_type since often the return type
4466 of, e.g. EQ_EXPR, is boolean. */
4468 {
4472 NULL_TREE))
4477 /* If the high bound is missing, but we have a nonzero low
4478 bound, reverse the range so it goes from zero to the low bound
4479 minus 1. */
4481 {
4486 }
4487 }
4495 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4496 low and high are non-NULL, then normalize will DTRT. */
4499 {
4504 }
4506 /* (-x) IN [a,b] -> x in [-b, -a] */
4518 /* ~ X -> -X - 1 */
4527 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4528 move a constant to the other side. */
4533 /* If EXP is signed, any overflow in the computation is undefined,
4534 so we don't worry about it so long as our computations on
4535 the bounds don't overflow. For unsigned, overflow is defined
4536 and this is exactly the right thing. */
4548 normalize:
4549 /* Check for an unsigned range which has wrapped around the maximum
4550 value thus making n_high < n_low, and normalize it. */
4552 {
4558 /* If the range is of the form +/- [ x+1, x ], we won't
4559 be able to normalize it. But then, it represents the
4560 whole range or the empty set, so make it
4561 +/- [ -, - ]. */
4565 else
4567 }
4568 else
4576 CASE_CONVERT:
4594 /* If we're converting arg0 from an unsigned type, to exp,
4595 a signed type, we will be doing the comparison as unsigned.
4596 The tests above have already verified that LOW and HIGH
4597 are both positive.
4599 So we have to ensure that we will handle large unsigned
4600 values the same way that the current signed bounds treat
4601 negative values. */
4604 {
4605 tree high_positive;
4606 tree equiv_type;
4607 /* For fixed-point modes, we need to pass the saturating flag
4608 as the 2nd parameter. */
4610 equiv_type
4613 else
4614 equiv_type
4617 /* A range without an upper bound is, naturally, unbounded.
4618 Since convert would have cropped a very large value, use
4619 the max value for the destination type. */
4620 high_positive
4627 high_positive),
4630 /* If the low bound is specified, "and" the range with the
4631 range for which the original unsigned value will be
4632 positive. */
4634 {
4637 integer_zero_node),
4638 high_positive))
4642 }
4643 else
4644 {
4645 /* Otherwise, "or" the range with the range of the input
4646 that will be interpreted as negative. */
4649 integer_zero_node),
4650 high_positive))
4654 }
4655 }
4664 }
4665 }
4667 /* Given EXP, a logical expression, set the range it is testing into
4668 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4669 actually being tested. *PLOW and *PHIGH will be made of the same
4670 type as the returned expression. If EXP is not a comparison, we
4671 will most likely not be returning a useful value and range. Set
4672 *STRICT_OVERFLOW_P to true if the return value is only valid
4673 because signed overflow is undefined; otherwise, do not change
4674 *STRICT_OVERFLOW_P. */
4676 tree
4679 {
4687 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4688 and see if we can refine the range. Some of the cases below may not
4689 happen, but it doesn't seem worth worrying about this. We "continue"
4690 the outer loop when we've changed something; otherwise we "break"
4691 the switch, which will "break" the while. */
4697 {
4703 {
4711 }
4720 }
4722 /* If EXP is a constant, we can evaluate whether this is true or false. */
4724 {
4731 }
4735 }
4736 \f
4737 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4738 type, TYPE, return an expression to test if EXP is in (or out of, depending
4739 on IN_P) the range. Return 0 if the test couldn't be created. */
4741 tree
4744 {
4747 /* Disable this optimization for function pointer expressions
4748 on targets that require function pointer canonicalization. */
4755 {
4761 }
4779 {
4781 {
4785 }
4787 }
4789 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4791 {
4795 {
4797 {
4800 etype
4802 else
4805 }
4808 }
4809 }
4811 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4812 This requires wrap-around arithmetics for the type of the expression.
4813 First make sure that arithmetics in this type is valid, then make sure
4814 that it wraps around. */
4820 {
4823 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4824 for the type in question, as we rely on this here. */
4834 else
4836 }
4846 {
4848 {
4853 }
4855 }
4863 }
4864 \f
4865 /* Return the predecessor of VAL in its type, handling the infinite case. */
4867 static tree
4869 {
4875 else
4878 }
4880 /* Return the successor of VAL in its type, handling the infinite case. */
4882 static tree
4884 {
4890 else
4893 }
4895 /* Given two ranges, see if we can merge them into one. Return 1 if we
4896 can, 0 if we can't. Set the output range into the specified parameters. */
4898 bool
4901 {
4905 tree tem;
4915 /* Make range 0 be the range that starts first, or ends last if they
4916 start at the same value. Swap them if it isn't. */
4919 || (lowequal
4922 {
4926 }
4928 /* Now flag two cases, whether the ranges are disjoint or whether the
4929 second range is totally subsumed in the first. Note that the tests
4930 below are simplified by the ones above. */
4936 /* We now have four cases, depending on whether we are including or
4937 excluding the two ranges. */
4939 {
4940 /* If they don't overlap, the result is false. If the second range
4941 is a subset it is the result. Otherwise, the range is from the start
4942 of the second to the end of the first. */
4947 else
4949 }
4952 {
4953 /* If they don't overlap, the result is the first range. If they are
4954 equal, the result is false. If the second range is a subset of the
4955 first, and the ranges begin at the same place, we go from just after
4956 the end of the second range to the end of the first. If the second
4957 range is not a subset of the first, or if it is a subset and both
4958 ranges end at the same place, the range starts at the start of the
4959 first range and ends just before the second range.
4960 Otherwise, we can't describe this as a single range. */
4966 {
4971 {
4972 /* We are in the weird situation where high0 > high1 but
4973 high1 has no successor. Punt. */
4975 }
4976 }
4978 {
4983 {
4984 /* low0 < low1 but low1 has no predecessor. Punt. */
4986 }
4987 }
4988 else
4990 }
4993 {
4994 /* If they don't overlap, the result is the second range. If the second
4995 is a subset of the first, the result is false. Otherwise,
4996 the range starts just after the first range and ends at the
4997 end of the second. */
5002 else
5003 {
5008 {
5009 /* high1 > high0 but high0 has no successor. Punt. */
5011 }
5012 }
5013 }
5015 else
5016 {
5017 /* The case where we are excluding both ranges. Here the complex case
5018 is if they don't overlap. In that case, the only time we have a
5019 range is if they are adjacent. If the second is a subset of the
5020 first, the result is the first. Otherwise, the range to exclude
5021 starts at the beginning of the first range and ends at the end of the
5022 second. */
5024 {
5029 else
5030 {
5031 /* Canonicalize - [min, x] into - [-, x]. */
5034 {
5039 /* FALLTHROUGH */
5052 }
5054 /* Canonicalize - [x, max] into - [x, -]. */
5057 {
5062 /* FALLTHROUGH */
5078 }
5080 /* The ranges might be also adjacent between the maximum and
5081 minimum values of the given type. For
5082 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5083 return + [x + 1, y - 1]. */
5085 {
5092 }
5093 else
5095 }
5096 }
5099 else
5101 }
5105 }
5106 \f
5108 /* Subroutine of fold, looking inside expressions of the form
5109 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5110 of the COND_EXPR. This function is being used also to optimize
5111 A op B ? C : A, by reversing the comparison first.
5113 Return a folded expression whose code is not a COND_EXPR
5114 anymore, or NULL_TREE if no folding opportunity is found. */
5116 static tree
5119 {
5124 tree tem;
5129 /* If we have A op 0 ? A : -A, consider applying the following
5130 transformations:
5132 A == 0? A : -A same as -A
5133 A != 0? A : -A same as A
5134 A >= 0? A : -A same as abs (A)
5135 A > 0? A : -A same as abs (A)
5136 A <= 0? A : -A same as -abs (A)
5137 A < 0? A : -A same as -abs (A)
5139 None of these transformations work for modes with signed
5140 zeros. If A is +/-0, the first two transformations will
5141 change the sign of the result (from +0 to -0, or vice
5142 versa). The last four will fix the sign of the result,
5143 even though the original expressions could be positive or
5144 negative, depending on the sign of A.
5146 Note that all these transformations are correct if A is
5147 NaN, since the two alternatives (A and -A) are also NaNs. */
5154 /* In the case that A is of the form X-Y, '-A' (arg2) may
5155 have already been folded to Y-X, check for that. */
5163 {
5175 /* Fall through. */
5186 /* FALLTHRU */
5196 }
5198 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5199 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5200 both transformations are correct when A is NaN: A != 0
5201 is then true, and A == 0 is false. */
5205 {
5210 }
5212 /* Try some transformations of A op B ? A : B.
5214 A == B? A : B same as B
5215 A != B? A : B same as A
5216 A >= B? A : B same as max (A, B)
5217 A > B? A : B same as max (B, A)
5218 A <= B? A : B same as min (A, B)
5219 A < B? A : B same as min (B, A)
5221 As above, these transformations don't work in the presence
5222 of signed zeros. For example, if A and B are zeros of
5223 opposite sign, the first two transformations will change
5224 the sign of the result. In the last four, the original
5225 expressions give different results for (A=+0, B=-0) and
5226 (A=-0, B=+0), but the transformed expressions do not.
5228 The first two transformations are correct if either A or B
5229 is a NaN. In the first transformation, the condition will
5230 be false, and B will indeed be chosen. In the case of the
5231 second transformation, the condition A != B will be true,
5232 and A will be chosen.
5234 The conversions to max() and min() are not correct if B is
5235 a number and A is not. The conditions in the original
5236 expressions will be false, so all four give B. The min()
5237 and max() versions would give a NaN instead. */
5240 /* Avoid these transformations if the COND_EXPR may be used
5241 as an lvalue in the C++ front-end. PR c++/19199. */
5242 && (in_gimple_form
5248 {
5254 {
5263 /* In C++ a ?: expression can be an lvalue, so put the
5264 operand which will be used if they are equal first
5265 so that we can convert this back to the
5266 corresponding COND_EXPR. */
5268 {
5276 }
5283 {
5291 }
5304 }
5305 }
5308 }
5311 \f
5312 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5313 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5314 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5315 false) >= 2)
5316 #endif
5318 /* EXP is some logical combination of boolean tests. See if we can
5319 merge it into some range test. Return the new tree if so. */
5321 static tree
5324 {
5340 /* If this is an OR operation, invert both sides; we will invert
5341 again at the end. */
5345 /* If both expressions are the same, if we can merge the ranges, and we
5346 can build the range test, return it or it inverted. If one of the
5347 ranges is always true or always false, consider it to be the same
5348 expression as the other. */
5356 {
5360 }
5362 /* On machines where the branch cost is expensive, if this is a
5363 short-circuited branch and the underlying object on both sides
5364 is the same, make a non-short-circuit operation. */
5370 {
5371 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5372 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5373 which cases we can't do this. */
5381 {
5390 {
5393 WARN_STRICT_OVERFLOW_COMPARISON);
5397 }
5398 }
5399 }
5402 }
5403 \f
5404 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5405 bit value. Arrange things so the extra bits will be set to zero if and
5406 only if C is signed-extended to its full width. If MASK is nonzero,
5407 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5409 static tree
5411 {
5414 tree temp;
5419 /* We work by getting just the sign bit into the low-order bit, then
5420 into the high-order bit, then sign-extend. We then XOR that value
5421 with C. */
5424 /* We must use a signed type in order to get an arithmetic right shift.
5425 However, we must also avoid introducing accidental overflows, so that
5426 a subsequent call to integer_zerop will work. Hence we must
5427 do the type conversion here. At this point, the constant is either
5428 zero or one, and the conversion to a signed type can never overflow.
5429 We could get an overflow if this conversion is done anywhere else. */
5438 /* If necessary, convert the type back to match the type of C. */
5443 }
5444 \f
5445 /* For an expression that has the form
5446 (A && B) || ~B
5447 or
5448 (A || B) && ~B,
5449 we can drop one of the inner expressions and simplify to
5450 A || ~B
5451 or
5452 A && ~B
5453 LOC is the location of the resulting expression. OP is the inner
5454 logical operation; the left-hand side in the examples above, while CMPOP
5455 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5456 removing a condition that guards another, as in
5457 (A != NULL && A->...) || A == NULL
5458 which we must not transform. If RHS_ONLY is true, only eliminate the
5459 right-most operand of the inner logical operation. */
5461 static tree
5464 {
5482 {
5485 {
5488 }
5489 }
5491 {
5494 {
5497 }
5498 }
5513 }
5515 /* Find ways of folding logical expressions of LHS and RHS:
5516 Try to merge two comparisons to the same innermost item.
5517 Look for range tests like "ch >= '0' && ch <= '9'".
5518 Look for combinations of simple terms on machines with expensive branches
5519 and evaluate the RHS unconditionally.
5521 For example, if we have p->a == 2 && p->b == 4 and we can make an
5522 object large enough to span both A and B, we can do this with a comparison
5523 against the object ANDed with the a mask.
5525 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5526 operations to do this with one comparison.
5528 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5529 function and the one above.
5531 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5532 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5534 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5535 two operands.
5537 We return the simplified tree or 0 if no optimization is possible. */
5539 static tree
5542 {
5543 /* If this is the "or" of two comparisons, we can do something if
5544 the comparisons are NE_EXPR. If this is the "and", we can do something
5545 if the comparisons are EQ_EXPR. I.e.,
5546 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5548 WANTED_CODE is this operation code. For single bit fields, we can
5549 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5550 comparison for one-bit fields. */
5571 /* Start by getting the comparison codes. Fail if anything is volatile.
5572 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5573 it were surrounded with a NE_EXPR. */
5582 {
5586 }
5589 {
5593 }
5604 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5607 {
5610 {
5615 }
5618 {
5624 }
5625 }
5630 /* If the RHS can be evaluated unconditionally and its operands are
5631 simple, it wins to evaluate the RHS unconditionally on machines
5632 with expensive branches. In this case, this isn't a comparison
5633 that can be merged. */
5640 {
5641 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5652 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5662 }
5664 /* See if the comparisons can be merged. Then get all the parameters for
5665 each side. */
5690 /* It must be true that the inner operation on the lhs of each
5691 comparison must be the same if we are to be able to do anything.
5692 Then see if we have constants. If not, the same must be true for
5693 the rhs's. */
5702 {
5705 }
5710 else
5713 /* If either comparison code is not correct for our logical operation,
5714 fail. However, we can convert a one-bit comparison against zero into
5715 the opposite comparison against that bit being set in the field. */
5719 {
5721 {
5722 /* Make the left operand unsigned, since we are only interested
5723 in the value of one bit. Otherwise we are doing the wrong
5724 thing below. */
5727 }
5728 else
5730 }
5732 /* This is analogous to the code for l_const above. */
5734 {
5736 {
5739 }
5740 else
5742 }
5744 /* See if we can find a mode that contains both fields being compared on
5745 the left. If we can't, fail. Otherwise, update all constants and masks
5746 to be relative to a field of that size. */
5751 volatilep);
5761 {
5764 }
5772 {
5779 {
5783 }
5784 }
5786 {
5793 {
5797 }
5798 }
5800 /* If the right sides are not constant, do the same for it. Also,
5801 disallow this optimization if a size or signedness mismatch occurs
5802 between the left and right sides. */
5804 {
5807 /* Make sure the two fields on the right
5808 correspond to the left without being swapped. */
5816 volatilep);
5826 {
5829 }
5838 /* Make a mask that corresponds to both fields being compared.
5839 Do this for both items being compared. If the operands are the
5840 same size and the bits being compared are in the same position
5841 then we can do this by masking both and comparing the masked
5842 results. */
5846 {
5860 }
5862 /* There is still another way we can do something: If both pairs of
5863 fields being compared are adjacent, we may be able to make a wider
5864 field containing them both.
5866 Note that we still must mask the lhs/rhs expressions. Furthermore,
5867 the mask must be shifted to account for the shift done by
5868 make_bit_field_ref. */
5873 {
5874 tree type;
5890 /* Convert to the smaller type before masking out unwanted bits. */
5893 {
5895 {
5899 }
5901 {
5905 }
5906 }
5915 }
5918 }
5920 /* Handle the case of comparisons with constants. If there is something in
5921 common between the masks, those bits of the constants must be the same.
5922 If not, the condition is always false. Test for this to avoid generating
5923 incorrect code below. */
5928 {
5930 {
5933 }
5934 else
5935 {
5938 }
5939 }
5941 /* Construct the expression we will return. First get the component
5942 reference we will make. Unless the mask is all ones the width of
5943 that field, perform the mask operation. Then compare with the
5944 merged constant. */
5955 }
5956 \f
5957 /* T is an integer expression that is being multiplied, divided, or taken a
5958 modulus (CODE says which and what kind of divide or modulus) by a
5959 constant C. See if we can eliminate that operation by folding it with
5960 other operations already in T. WIDE_TYPE, if non-null, is a type that
5961 should be used for the computation if wider than our type.
5963 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5964 (X * 2) + (Y * 4). We must, however, be assured that either the original
5965 expression would not overflow or that overflow is undefined for the type
5966 in the language in question.
5968 If we return a non-null expression, it is an equivalent form of the
5969 original computation, but need not be in the original type.
5971 We set *STRICT_OVERFLOW_P to true if the return values depends on
5972 signed overflow being undefined. Otherwise we do not change
5973 *STRICT_OVERFLOW_P. */
5975 static tree
5978 {
5979 /* To avoid exponential search depth, refuse to allow recursion past
5980 three levels. Beyond that (1) it's highly unlikely that we'll find
5981 something interesting and (2) we've probably processed it before
5982 when we built the inner expression. */
5985 tree ret;
5990 depth++;
5992 depth--;
5995 }
5997 static tree
6000 {
6011 /* Don't deal with constants of zero here; they confuse the code below. */
6021 /* Note that we need not handle conditional operations here since fold
6022 already handles those cases. So just do arithmetic here. */
6024 {
6026 /* For a constant, we can always simplify if we are a multiply
6027 or (for divide and modulus) if it is a multiple of our constant. */
6030 {
6033 /* If the multiplication overflowed, we lost information on it.
6034 See PR68142 and PR69845. */
6038 }
6042 /* If op0 is an expression ... */
6048 /* ... and has wrapping overflow, and its type is smaller
6049 than ctype, then we cannot pass through as widening. */
6054 /* ... or this is a truncation (t is narrower than op0),
6055 then we cannot pass through this narrowing. */
6058 /* ... or signedness changes for division or modulus,
6059 then we cannot pass through this conversion. */
6063 /* ... or has undefined overflow while the converted to
6064 type has not, we cannot do the operation in the inner type
6065 as that would introduce undefined overflow. */
6071 /* Pass the constant down and see if we can make a simplification. If
6072 we can, replace this expression with the inner simplification for
6073 possible later conversion to our or some other type. */
6078 code == MULT_EXPR
6080 strict_overflow_p))))
6085 /* If widening the type changes it from signed to unsigned, then we
6086 must avoid building ABS_EXPR itself as unsigned. */
6088 {
6092 {
6095 }
6097 }
6098 /* If the constant is negative, we cannot simplify this. */
6101 /* FALLTHROUGH */
6103 /* For division and modulus, type can't be unsigned, as e.g.
6104 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6105 For signed types, even with wrapping overflow, this is fine. */
6114 /* If widening the type changes the signedness, then we can't perform
6115 this optimization as that changes the result. */
6119 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6125 {
6132 }
6136 /* If the second operand is constant, this is a multiplication
6137 or floor division, by a power of two, so we can treat it that
6138 way unless the multiplier or divisor overflows. Signed
6139 left-shift overflow is implementation-defined rather than
6140 undefined in C90, so do not convert signed left shift into
6141 multiplication. */
6144 /* const_binop may not detect overflow correctly,
6145 so check for it explicitly here. */
6149 size_one_node,
6150 op1)))
6154 ctype,
6156 t1),
6161 /* See if we can eliminate the operation on both sides. If we can, we
6162 can return a new PLUS or MINUS. If we can't, the only remaining
6163 cases where we can do anything are if the second operand is a
6164 constant. */
6170 /* If not multiplication, we can only do this if both operands
6171 are divisible by c. */
6174 {
6179 }
6181 /* If this was a subtraction, negate OP1 and set it to be an addition.
6182 This simplifies the logic below. */
6184 {
6186 /* If OP1 was not easily negatable, the constant may be OP0. */
6188 {
6191 }
6192 }
6197 /* If either OP1 or C are negative, this optimization is not safe for
6198 some of the division and remainder types while for others we need
6199 to change the code. */
6201 {
6209 }
6211 /* If it's a multiply or a division/modulus operation of a multiple
6212 of our constant, do the operation and verify it doesn't overflow. */
6215 {
6218 /* We allow the constant to overflow with wrapping semantics. */
6222 }
6223 else
6226 /* If we have an unsigned type, we cannot widen the operation since it
6227 will change the result if the original computation overflowed. */
6231 /* If we were able to eliminate our operation from the first side,
6232 apply our operation to the second side and reform the PLUS. */
6236 /* The last case is if we are a multiply. In that case, we can
6237 apply the distributive law to commute the multiply and addition
6238 if the multiplication of the constants doesn't overflow
6239 and overflow is defined. With undefined overflow
6240 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6246 op1);
6251 /* We have a special case here if we are doing something like
6252 (C * 8) % 4 since we know that's zero. */
6255 /* If the multiplication can overflow we cannot optimize this. */
6259 {
6262 }
6264 /* ... fall through ... */
6268 /* If we can extract our operation from the LHS, do so and return a
6269 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6270 do something only if the second operand is a constant. */
6284 /* If these are the same operation types, we can associate them
6285 assuming no overflow. */
6287 {
6302 }
6304 /* If these operations "cancel" each other, we have the main
6305 optimizations of this pass, which occur when either constant is a
6306 multiple of the other, in which case we replace this with either an
6307 operation or CODE or TCODE.
6309 If we have an unsigned type, we cannot do this since it will change
6310 the result if the original computation overflowed. */
6317 {
6319 {
6326 }
6328 {
6335 }
6336 }
6341 }
6344 }
6345 \f
6346 /* Return a node which has the indicated constant VALUE (either 0 or
6347 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6348 and is of the indicated TYPE. */
6350 tree
6352 {
6361 else
6363 }
6366 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6367 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6368 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6369 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6370 COND is the first argument to CODE; otherwise (as in the example
6371 given here), it is the second argument. TYPE is the type of the
6372 original expression. Return NULL_TREE if no simplification is
6373 possible. */
6375 static tree
6380 {
6390 {
6394 /* If this operand throws an expression, then it does not make
6395 sense to try to perform a logical or arithmetic operation
6396 involving it. */
6401 }
6404 {
6409 }
6410 else
6411 /* Detect the case of mixing vector and scalar types - bail out. */
6417 /* This transformation is only worthwhile if we don't have to wrap ARG
6418 in a SAVE_EXPR and the operation can be simplified without recursing
6419 on at least one of the branches once its pushed inside the COND_EXPR. */
6428 {
6432 else
6434 }
6436 {
6440 else
6442 }
6444 /* Check that we have simplified at least one of the branches. */
6449 }
6451 \f
6452 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6454 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6455 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6456 ADDEND is the same as X.
6458 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6459 and finite. The problematic cases are when X is zero, and its mode
6460 has signed zeros. In the case of rounding towards -infinity,
6461 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6462 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6464 bool
6466 {
6470 /* Don't allow the fold with -fsignaling-nans. */
6474 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6478 /* In a vector or complex, we would need to check the sign of all zeros. */
6482 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6486 /* The mode has signed zeros, and we have to honor their sign.
6487 In this situation, there is only one case we can return true for.
6488 X - 0 is the same as X unless rounding towards -infinity is
6489 supported. */
6491 }
6493 /* Subroutine of fold() that optimizes comparisons of a division by
6494 a nonzero integer constant against an integer constant, i.e.
6495 X/C1 op C2.
6497 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6498 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6499 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6501 The function returns the constant folded tree if a simplification
6502 can be made, and NULL_TREE otherwise. */
6504 static tree
6507 {
6515 /* We have to do this the hard way to detect unsigned overflow.
6516 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6522 {
6527 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6531 }
6533 {
6537 {
6556 }
6557 }
6558 else
6559 {
6560 /* A negative divisor reverses the relational operators. */
6566 {
6585 }
6586 }
6589 {
6610 {
6613 }
6618 {
6621 }
6626 {
6629 }
6634 {
6637 }
6642 }
6645 }
6648 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6649 equality/inequality test, then return a simplified form of the test
6650 using a sign testing. Otherwise return NULL. TYPE is the desired
6651 result type. */
6653 static tree
6656 tree result_type)
6657 {
6658 /* If this is testing a single bit, we can optimize the test. */
6662 {
6663 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6664 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6668 /* This is only a win if casting to a signed type is cheap,
6669 i.e. when arg00's type is not a partial mode. */
6672 {
6675 result_type,
6678 }
6679 }
6682 }
6684 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6685 equality/inequality test, then return a simplified form of
6686 the test using shifts and logical operations. Otherwise return
6687 NULL. TYPE is the desired result type. */
6689 tree
6692 {
6693 /* If this is testing a single bit, we can optimize the test. */
6697 {
6706 /* First, see if we can fold the single bit test into a sign-bit
6707 test. */
6709 result_type);
6713 /* Otherwise we have (A & C) != 0 where C is a single bit,
6714 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6715 Similarly for (A & C) == 0. */
6717 /* If INNER is a right shift of a constant and it plus BITNUM does
6718 not overflow, adjust BITNUM and INNER. */
6724 {
6727 }
6729 /* If we are going to be able to omit the AND below, we must do our
6730 operations as unsigned. If we must use the AND, we have a choice.
6731 Normally unsigned is faster, but for some machines signed is. */
6749 /* Put the AND last so it can combine with more things. */
6752 /* Make sure to return the proper type. */
6756 }
6758 }
6760 /* Test whether it is preferable two swap two operands, ARG0 and
6761 ARG1, for example because ARG0 is an integer constant and ARG1
6762 isn't. */
6764 bool
6766 {
6780 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6781 for commutative and comparison operators. Ensuring a canonical
6782 form allows the optimizers to find additional redundancies without
6783 having to explicitly check for both orderings. */
6789 /* Put SSA_NAMEs last. */
6795 /* Put variables last. */
6802 }
6805 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6806 means A >= Y && A != MAX, but in this case we know that
6807 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6809 static tree
6811 {
6818 else
6827 {
6830 }
6832 {
6835 }
6836 else
6843 {
6844 /* Convert the pointer types into integer before taking the difference. */
6848 }
6849 else
6856 }
6858 /* Fold a sum or difference of at least one multiplication.
6859 Returns the folded tree or NULL if no simplification could be made. */
6861 static tree
6864 {
6868 /* (A * C) +- (B * C) -> (A+-B) * C.
6869 (A * C) +- A -> A * (C+-1).
6870 We are most concerned about the case where C is a constant,
6871 but other combinations show up during loop reduction. Since
6872 it is not difficult, try all four possibilities. */
6875 {
6878 }
6880 {
6883 }
6884 else
6885 {
6886 /* We cannot generate constant 1 for fract. */
6891 }
6893 {
6896 }
6898 {
6900 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
6901 the purpose of this canonicalization. */
6905 {
6908 }
6909 else
6911 }
6912 else
6913 {
6914 /* We cannot generate constant 1 for fract. */
6919 }
6931 /* No identical multiplicands; see if we can find a common
6932 power-of-two factor in non-power-of-two multiplies. This
6933 can help in multi-dimensional array access. */
6936 {
6939 tree maybe_same;
6943 /* Move min of absolute values to int11. */
6945 {
6950 }
6951 else
6955 /* The remainder should not be a constant, otherwise we
6956 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
6957 increased the number of multiplications necessary. */
6959 {
6967 }
6968 }
6978 }
6980 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
6981 specified by EXPR into the buffer PTR of length LEN bytes.
6982 Return the number of bytes placed in the buffer, or zero
6983 upon failure. */
6985 static int
6987 {
7001 {
7003 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7004 number of bytes. */
7008 {
7015 else
7017 }
7018 else
7023 }
7025 }
7028 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7029 specified by EXPR into the buffer PTR of length LEN bytes.
7030 Return the number of bytes placed in the buffer, or zero
7031 upon failure. */
7033 static int
7035 {
7039 FIXED_VALUE_TYPE value;
7055 }
7058 /* Subroutine of native_encode_expr. Encode the REAL_CST
7059 specified by EXPR into the buffer PTR of length LEN bytes.
7060 Return the number of bytes placed in the buffer, or zero
7061 upon failure. */
7063 static int
7065 {
7071 /* There are always 32 bits in each long, no matter the size of
7072 the hosts long. We handle floating point representations with
7073 up to 192 bits. */
7087 {
7092 {
7099 else
7101 }
7102 else
7103 {
7106 {
7107 /* Reverse bytes within each long, or within the entire float
7108 if it's smaller than a long (for HFmode). */
7111 }
7112 }
7117 }
7119 }
7121 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7122 specified by EXPR into the buffer PTR of length LEN bytes.
7123 Return the number of bytes placed in the buffer, or zero
7124 upon failure. */
7126 static int
7128 {
7130 tree part;
7145 }
7148 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7149 specified by EXPR into the buffer PTR of length LEN bytes.
7150 Return the number of bytes placed in the buffer, or zero
7151 upon failure. */
7153 static int
7155 {
7165 {
7167 {
7170 }
7181 }
7183 }
7186 /* Subroutine of native_encode_expr. Encode the STRING_CST
7187 specified by EXPR into the buffer PTR of length LEN bytes.
7188 Return the number of bytes placed in the buffer, or zero
7189 upon failure. */
7191 static int
7193 {
7195 HOST_WIDE_INT total_bytes;
7209 {
7212 {
7215 }
7218 }
7219 else
7222 }
7225 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7226 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7227 buffer PTR of length LEN bytes. If OFF is not -1 then start
7228 the encoding at byte offset OFF and encode at most LEN bytes.
7229 Return the number of bytes placed in the buffer, or zero upon failure. */
7231 int
7233 {
7234 /* We don't support starting at negative offset and -1 is special. */
7239 {
7260 }
7261 }
7264 /* Subroutine of native_interpret_expr. Interpret the contents of
7265 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7266 If the buffer cannot be interpreted, return NULL_TREE. */
7268 static tree
7270 {
7280 }
7283 /* Subroutine of native_interpret_expr. Interpret the contents of
7284 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7285 If the buffer cannot be interpreted, return NULL_TREE. */
7287 static tree
7289 {
7291 double_int result;
7292 FIXED_VALUE_TYPE fixed_value;
7302 }
7305 /* Subroutine of native_interpret_expr. Interpret the contents of
7306 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7307 If the buffer cannot be interpreted, return NULL_TREE. */
7309 static tree
7311 {
7315 /* There are always 32 bits in each long, no matter the size of
7316 the hosts long. We handle floating point representations with
7317 up to 192 bits. */
7318 REAL_VALUE_TYPE r;
7329 {
7330 /* Both OFFSET and BYTE index within a long;
7331 bitpos indexes the whole float. */
7334 {
7341 else
7343 }
7344 else
7345 {
7348 {
7349 /* Reverse bytes within each long, or within the entire float
7350 if it's smaller than a long (for HFmode). */
7353 }
7354 }
7358 }
7362 }
7365 /* Subroutine of native_interpret_expr. Interpret the contents of
7366 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7367 If the buffer cannot be interpreted, return NULL_TREE. */
7369 static tree
7371 {
7386 }
7389 /* Subroutine of native_interpret_expr. Interpret the contents of
7390 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7391 If the buffer cannot be interpreted, return NULL_TREE. */
7393 static tree
7395 {
7408 {
7413 }
7415 }
7418 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7419 the buffer PTR of length LEN as a constant of type TYPE. For
7420 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7421 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7422 return NULL_TREE. */
7424 tree
7426 {
7428 {
7450 }
7451 }
7453 /* Returns true if we can interpret the contents of a native encoding
7454 as TYPE. */
7456 static bool
7458 {
7460 {
7473 }
7474 }
7476 /* Return true iff a constant of type TYPE is accepted by
7477 native_encode_expr. */
7479 bool
7481 {
7483 {
7493 }
7494 }
7496 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7497 TYPE at compile-time. If we're unable to perform the conversion
7498 return NULL_TREE. */
7500 static tree
7502 {
7503 /* We support up to 512-bit values (for V8DFmode). */
7507 /* Check that the host and target are sane. */
7516 }
7518 /* Build an expression for the address of T. Folds away INDIRECT_REF
7519 to avoid confusing the gimplify process. */
7521 tree
7523 {
7524 /* The size of the object is not relevant when talking about its address. */
7529 {
7534 }
7544 {
7549 }
7550 else
7554 }
7556 /* Build an expression for the address of T. */
7558 tree
7560 {
7564 }
7566 /* Fold a unary expression of code CODE and type TYPE with operand
7567 OP0. Return the folded expression if folding is successful.
7568 Otherwise, return NULL_TREE. */
7570 tree
7572 {
7573 tree tem;
7574 tree arg0;
7582 {
7585 {
7586 /* Don't use STRIP_NOPS, because signedness of argument type
7587 matters. */
7589 }
7590 else
7591 {
7592 /* Strip any conversions that don't change the mode. This
7593 is safe for every expression, except for a comparison
7594 expression because its signedness is derived from its
7595 operands.
7597 Note that this is done as an internal manipulation within
7598 the constant folder, in order to find the simplest
7599 representation of the arguments so that their form can be
7600 studied. In any cases, the appropriate type conversions
7601 should be put back in the tree that will get out of the
7602 constant folder. */
7604 }
7607 {
7610 {
7614 }
7615 }
7616 }
7623 {
7630 {
7644 /* If this was a conversion, and all we did was to move into
7645 inside the COND_EXPR, bring it back out. But leave it if
7646 it is a conversion from integer to integer and the
7647 result precision is no wider than a word since such a
7648 conversion is cheap and may be optimized away by combine,
7649 while it couldn't if it were outside the COND_EXPR. Then return
7650 so we don't get into an infinite recursion loop taking the
7651 conversion out and then back in. */
7663 && (INTEGRAL_TYPE_P
7676 }
7677 }
7680 {
7686 CASE_CONVERT:
7690 {
7691 /* If we have (type) (a CMP b) and type is an integral type, return
7692 new expression involving the new type. Canonicalize
7693 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7694 non-integral type.
7695 Do not fold the result as that would not simplify further, also
7696 folding again results in recursions. */
7706 }
7708 /* Handle (T *)&A.B.C for A being of type T and B and C
7709 living at offset zero. This occurs frequently in
7710 C++ upcasting and then accessing the base. */
7714 {
7716 tree offset;
7717 machine_mode mode;
7719 tree base
7723 /* If the reference was to a (constant) zero offset, we can use
7724 the address of the base if it has the same base type
7725 as the result type and the pointer type is unqualified. */
7732 }
7736 /* Detect assigning a bitfield. */
7738 && DECL_BIT_FIELD
7740 {
7741 /* Don't leave an assignment inside a conversion
7742 unless assigning a bitfield. */
7744 /* First do the assignment, then return converted constant. */
7749 }
7751 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7752 constants (if x has signed type, the sign bit cannot be set
7753 in c). This folds extension into the BIT_AND_EXPR.
7754 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7755 very likely don't have maximal range for their precision and this
7756 transformation effectively doesn't preserve non-maximal ranges. */
7760 {
7771 <= HOST_BITS_PER_WIDE_INT
7773 {
7777 cst &= HOST_WIDE_INT_M1U
7781 && !flag_syntax_only
7784 {
7788 }
7789 }
7791 {
7796 }
7797 }
7799 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
7800 cast (T1)X will fold away. We assume that this happens when X itself
7801 is a cast. */
7805 {
7809 return fold_build_pointer_plus_loc
7811 }
7813 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7814 of the same precision, and X is an integer type not narrower than
7815 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7821 {
7827 }
7829 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7830 type of X and Y (integer types only). */
7835 {
7836 /* Be careful not to introduce new overflows. */
7837 tree mult_type;
7840 else
7844 {
7851 }
7852 }
7858 {
7865 }
7876 /* Convert fabs((double)float) into (double)fabsf(float). */
7879 {
7885 targ0));
7886 }
7890 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
7909 /* Note that the operand of this must be an int
7910 and its values must be 0 or 1.
7911 ("true" is a fixed value perhaps depending on the language,
7912 but we don't handle values other than 1 correctly yet.) */
7919 /* Fold *&X to X if X is an lvalue. */
7921 {
7928 }
7934 }
7937 /* If the operation was a conversion do _not_ mark a resulting constant
7938 with TREE_OVERFLOW if the original constant was not. These conversions
7939 have implementation defined behavior and retaining the TREE_OVERFLOW
7940 flag here would confuse later passes such as VRP. */
7941 tree
7944 {
7953 }
7955 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
7956 operands OP0 and OP1. LOC is the location of the resulting expression.
7957 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
7958 Return the folded expression if folding is successful. Otherwise,
7959 return NULL_TREE. */
7960 static tree
7963 {
7964 tree tem;
7966 /* We only do these simplifications if we are optimizing. */
7970 /* Check for things like (A || B) && (A || C). We can convert this
7971 to A || (B && C). Note that either operator can be any of the four
7972 truth and/or operations and the transformation will still be
7973 valid. Also note that we only care about order for the
7974 ANDIF and ORIF operators. If B contains side effects, this
7975 might change the truth-value of A. */
7982 {
8002 /* This case if tricky because we must either have commutative
8003 operators or else A10 must not have side-effects. */
8009 a01);
8010 }
8012 /* See if we can build a range comparison. */
8018 {
8022 }
8026 {
8030 }
8032 /* Check for the possibility of merging component references. If our
8033 lhs is another similar operation, try to merge its rhs with our
8034 rhs. Then try to merge our lhs and rhs. */
8048 {
8055 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8056 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8057 We don't want to pack more than two leafs to a non-IF AND/OR
8058 expression.
8059 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8060 equal to IF-CODE, then we don't want to add right-hand operand.
8061 If the inner right-hand side of left-hand operand has
8062 side-effects, or isn't simple, then we can't add to it,
8063 as otherwise we might destroy if-sequence. */
8066 /* Needed for sequence points to handle trappings, and
8067 side-effects. */
8069 {
8071 arg1);
8073 tem);
8074 }
8075 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8076 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8079 /* Needed for sequence points to handle trappings, and
8080 side-effects. */
8082 {
8087 }
8088 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8089 into (A OR B).
8090 For sequence point consistancy, we need to check for trapping,
8091 and side-effects. */
8095 }
8098 }
8100 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8101 by changing CODE to reduce the magnitude of constants involved in
8102 ARG0 of the comparison.
8103 Returns a canonicalized comparison tree if a simplification was
8104 possible, otherwise returns NULL_TREE.
8105 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8106 valid if signed overflow is undefined. */
8108 static tree
8112 {
8117 /* Match A +- CST code arg1. We can change this only if overflow
8118 is undefined. */
8121 /* In principle pointers also have undefined overflow behavior,
8122 but that causes problems elsewhere. */
8129 /* Identify the constant in arg0 and its sign. */
8133 /* Overflowed constants and zero will cause problems. */
8138 /* See if we can reduce the magnitude of the constant in
8139 arg0 by changing the comparison code. */
8140 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8144 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8148 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8152 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8156 else
8160 /* Now build the constant reduced in magnitude. But not if that
8161 would produce one outside of its types range. */
8177 }
8179 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8180 overflow further. Try to decrease the magnitude of constants involved
8181 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8182 and put sole constants at the second argument position.
8183 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8185 static tree
8188 {
8189 tree t;
8194 /* Try canonicalization by simplifying arg0. */
8199 {
8203 }
8205 /* Try canonicalization by simplifying arg1 using the swapped
8206 comparison. */
8214 }
8216 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8217 space. This is used to avoid issuing overflow warnings for
8218 expressions like &p->x which can not wrap. */
8220 static bool
8222 {
8229 wide_int wi_offset;
8235 else
8251 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8252 array. */
8254 {
8255 HOST_WIDE_INT base_size;
8260 }
8263 }
8265 /* Return a positive integer when the symbol DECL is known to have
8266 a nonzero address, zero when it's known not to (e.g., it's a weak
8267 symbol), and a negative integer when the symbol is not yet in the
8268 symbol table and so whether or not its address is zero is unknown.
8269 For function local objects always return positive integer. */
8270 static int
8272 {
8277 /* Function local objects are never NULL. */
8285 }
8287 /* Subroutine of fold_binary. This routine performs all of the
8288 transformations that are common to the equality/inequality
8289 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8290 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8291 fold_binary should call fold_binary. Fold a comparison with
8292 tree code CODE and type TYPE with operands OP0 and OP1. Return
8293 the folded comparison or NULL_TREE. */
8295 static tree
8298 {
8308 /* For comparisons of pointers we can decompose it to a compile time
8309 comparison of the base objects and the offsets into the object.
8310 This requires at least one operand being an ADDR_EXPR or a
8311 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8317 {
8320 machine_mode mode;
8324 /* Get base and offset for the access. Strip ADDR_EXPR for
8325 get_inner_reference, but put it back by stripping INDIRECT_REF
8326 off the base object if possible. indirect_baseN will be true
8327 if baseN is not an address but refers to the object itself. */
8330 {
8331 base0
8337 else
8339 }
8341 {
8345 {
8346 base0
8352 else
8354 }
8357 else
8361 {
8367 {
8370 }
8371 }
8372 }
8376 {
8377 base1
8383 else
8385 }
8387 {
8391 {
8392 base1
8398 else
8400 }
8403 else
8407 {
8413 {
8416 }
8417 }
8418 }
8420 /* If we have equivalent bases we might be able to simplify. */
8424 {
8425 /* We can fold this expression to a constant if the non-constant
8426 offset parts are equal. */
8430 && (equality_code
8431 || (indirect_base0
8435 {
8441 "occur when comparing P +- C1 with "
8443 WARN_STRICT_OVERFLOW_CONDITIONAL);
8446 {
8460 }
8461 }
8462 /* We can simplify the comparison to a comparison of the variable
8463 offset parts if the constant offset parts are equal.
8464 Be careful to use signed sizetype here because otherwise we
8465 mess with array offsets in the wrong way. This is possible
8466 because pointer arithmetic is restricted to retain within an
8467 object and overflow on pointer differences is undefined as of
8468 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8470 && (equality_code
8471 || (indirect_base0
8474 {
8475 /* By converting to signed sizetype we cover middle-end pointer
8476 arithmetic which operates on unsigned pointer types of size
8477 type size and ARRAY_REF offsets which are properly sign or
8478 zero extended from their type in case it is narrower than
8479 sizetype. */
8482 else
8486 else
8493 "occur when comparing P +- C1 with "
8495 WARN_STRICT_OVERFLOW_COMPARISON);
8498 }
8499 }
8500 /* For equal offsets we can simplify to a comparison of the
8501 base addresses. */
8503 && (indirect_base0
8505 && (indirect_base1
8510 {
8516 }
8517 /* Comparison between an ordinary (non-weak) symbol and a null
8518 pointer can be eliminated since such symbols must have a non
8519 null address. In C, relational expressions between pointers
8520 to objects and null pointers are undefined. The results
8521 below follow the C++ rules with the additional property that
8522 every object pointer compares greater than a null pointer.
8523 */
8526 /* Avoid folding references to struct members at offset 0 to
8527 prevent tests like '&ptr->firstmember == 0' from getting
8528 eliminated. When ptr is null, although the -> expression
8529 is strictly speaking invalid, GCC retains it as a matter
8530 of QoI. See PR c/44555. */
8533 && indirect_base0
8534 /* The caller guarantees that when one of the arguments is
8535 constant (i.e., null in this case) it is second. */
8537 {
8539 {
8550 }
8551 }
8552 }
8554 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8555 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8556 the resulting offset is smaller in absolute value than the
8557 original one and has the same sign. */
8566 {
8571 tree cst;
8573 "occur when combining constants around "
8576 /* Put the constant on the side where it doesn't overflow and is
8577 of lower absolute value and of same sign than before. */
8584 {
8587 variable1,
8591 }
8599 {
8605 variable2);
8606 }
8607 }
8613 /* If we are comparing an expression that just has comparisons
8614 of two integer values, arithmetic expressions of those comparisons,
8615 and constants, we can simplify it. There are only three cases
8616 to check: the two values can either be equal, the first can be
8617 greater, or the second can be greater. Fold the expression for
8618 those three values. Since each value must be 0 or 1, we have
8619 eight possibilities, each of which corresponds to the constant 0
8620 or 1 or one of the six possible comparisons.
8622 This handles common cases like (a > b) == 0 but also handles
8623 expressions like ((x > y) - (y > x)) > 0, which supposedly
8624 occur in macroized code. */
8627 {
8632 /* Don't handle degenerate cases here; they should already
8633 have been handled anyway. */
8642 {
8646 /* We can't just pass T to eval_subst in case cval1 or cval2
8647 was the same as ARG1. */
8649 tree high_result
8653 arg1);
8654 tree equal_result
8658 arg1);
8659 tree low_result
8663 arg1);
8665 /* All three of these results should be 0 or 1. Confirm they are.
8666 Then use those values to select the proper code to use. */
8671 {
8672 /* Make a 3-bit mask with the high-order bit being the
8673 value for `>', the next for '=', and the low for '<'. */
8677 {
8679 /* Always false. */
8700 /* Always true. */
8702 }
8705 {
8709 }
8711 }
8712 }
8713 }
8715 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
8716 into a single range test. */
8723 {
8727 }
8730 }
8733 /* Subroutine of fold_binary. Optimize complex multiplications of the
8734 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8735 argument EXPR represents the expression "z" of type TYPE. */
8737 static tree
8739 {
8744 {
8747 }
8749 {
8752 }
8753 else
8754 {
8758 }
8767 }
8770 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8771 CONSTRUCTOR ARG into array ELTS and return true if successful. */
8773 static bool
8775 {
8779 {
8782 }
8784 {
8790 else
8792 }
8793 else
8799 }
8801 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8802 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8803 NULL_TREE otherwise. */
8805 static tree
8807 {
8824 {
8828 }
8831 {
8837 }
8838 else
8840 }
8842 /* Try to fold a pointer difference of type TYPE two address expressions of
8843 array references AREF0 and AREF1 using location LOC. Return a
8844 simplified expression for the difference or NULL_TREE. */
8846 static tree
8849 {
8854 /* If the bases are array references as well, recurse. If the bases
8855 are pointer indirections compute the difference of the pointers.
8856 If the bases are equal, we are set. */
8859 && (base_offset
8863 && (base_offset
8869 {
8875 base_offset,
8878 }
8880 }
8882 /* If the real or vector real constant CST of type TYPE has an exact
8883 inverse, return it, else return NULL. */
8885 tree
8887 {
8888 REAL_VALUE_TYPE r;
8890 machine_mode mode;
8894 {
8910 {
8915 }
8921 }
8922 }
8924 /* Mask out the tz least significant bits of X of type TYPE where
8925 tz is the number of trailing zeroes in Y. */
8926 static wide_int
8928 {
8933 }
8935 /* Return true when T is an address and is known to be nonzero.
8936 For floating point we further ensure that T is not denormal.
8937 Similar logic is present in nonzero_address in rtlanal.h.
8939 If the return value is based on the assumption that signed overflow
8940 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
8941 change *STRICT_OVERFLOW_P. */
8943 static bool
8945 {
8949 /* Doing something useful for floating point would need more work. */
8955 {
8958 strict_overflow_p);
8964 strict_overflow_p);
8972 }
8975 {
8978 strict_overflow_p);
8986 strict_overflow_p);
9001 strict_overflow_p);
9005 strict_overflow_p);
9008 {
9020 }
9024 }
9026 }
9028 /* Return true when T is an address and is known to be nonzero.
9029 Handle warnings about undefined signed overflow. */
9031 bool
9033 {
9040 "determining that expression is always "
9042 WARN_STRICT_OVERFLOW_MISC);
9044 }
9046 /* Return true if T is known not to be equal to an integer W. */
9048 bool
9050 {
9052 value_range_type rtype;
9054 {
9063 {
9068 }
9073 /* If T has some known zero bits and W has any of those bits set,
9074 then T is known not to be equal to W. */
9082 }
9083 }
9085 /* Fold a binary expression of code CODE and type TYPE with operands
9086 OP0 and OP1. LOC is the location of the resulting expression.
9087 Return the folded expression if folding is successful. Otherwise,
9088 return NULL_TREE. */
9090 tree
9093 {
9108 /* Strip any conversions that don't change the mode. This is
9109 safe for every expression, except for a comparison expression
9110 because its signedness is derived from its operands. So, in
9111 the latter case, only strip conversions that don't change the
9112 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9113 preserved.
9115 Note that this is done as an internal manipulation within the
9116 constant folder, in order to find the simplest representation
9117 of the arguments so that their form can be studied. In any
9118 cases, the appropriate type conversions should be put back in
9119 the tree that will get out of the constant folder. */
9122 {
9125 }
9126 else
9127 {
9130 }
9132 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9133 constant but we can't do arithmetic on them. */
9135 {
9138 {
9142 }
9143 }
9145 /* If this is a commutative operation, and ARG0 is a constant, move it
9146 to ARG1 to reduce the number of tests below. */
9151 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9152 to ARG1 to reduce the number of tests below. */
9161 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9163 First check for cases where an arithmetic operation is applied to a
9164 compound, conditional, or comparison operation. Push the arithmetic
9165 operation inside the compound or conditional to see if any folding
9166 can then be done. Convert comparison to conditional for this purpose.
9167 The also optimizes non-constant cases that used to be done in
9168 expand_expr.
9170 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9171 one of the operands is a comparison and the other is a comparison, a
9172 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9173 code below would make the expression more complex. Change it to a
9174 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9175 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9188 {
9192 boolean_type_node,
9200 }
9204 {
9206 {
9211 tem);
9212 }
9214 {
9219 tem);
9220 }
9225 {
9231 }
9236 {
9242 }
9243 }
9246 {
9248 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9251 {
9257 }
9259 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9262 {
9263 tree base;
9264 HOST_WIDE_INT coffset;
9273 }
9278 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9284 arg1),
9286 arg0)));
9292 {
9293 /* X + (X / CST) * -CST is X % CST. */
9298 {
9307 cst0));
9308 }
9309 }
9311 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9312 one. Make sure the type is not saturating and has the signedness of
9313 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9314 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9321 {
9325 }
9328 {
9329 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9330 (plus (plus (mult) (mult)) (foo)) so that we can
9331 take advantage of the factoring cases below. */
9340 {
9346 else
9359 parg0),
9361 marg)),
9365 return
9371 parg1)));
9372 }
9373 }
9374 else
9375 {
9376 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9377 to __complex__ ( x, y ). This is not the same for SNaNs or
9378 if signed zeros are involved. */
9382 {
9389 {
9393 {
9399 }
9401 {
9407 }
9408 }
9409 }
9417 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9418 We associate floats only if the user has specified
9419 -fassociative-math. */
9423 {
9428 {
9429 tree tree0;
9432 }
9433 }
9434 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9435 We associate floats only if the user has specified
9436 -fassociative-math. */
9440 {
9445 {
9446 tree tree0;
9449 }
9450 }
9451 }
9453 bit_rotate:
9454 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9455 is a rotate of A by C1 bits. */
9456 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9457 is a rotate of A by B bits. */
9458 {
9460 tree rtype;
9469 /* Only create rotates in complete modes. Other cases are not
9470 expanded properly. */
9473 {
9487 {
9491 code0 == LSHIFT_EXPR
9495 }
9497 {
9505 element_precision
9509 return
9512 ? LROTATE_EXPR
9517 }
9519 {
9527 element_precision
9531 return fold_convert_loc
9534 ? LROTATE_EXPR
9538 }
9539 }
9540 }
9542 associate:
9543 /* In most languages, can't associate operations on floats through
9544 parentheses. Rather than remember where the parentheses were, we
9545 don't associate floats at all, unless the user has specified
9546 -fassociative-math.
9547 And, we need to make sure type is not saturating. */
9551 {
9557 /* Split both trees into variables, constants, and literals. Then
9558 associate each group together, the constants with literals,
9559 then the result with variables. This increases the chances of
9560 literals being recombined later and of generating relocatable
9561 expressions for the sum of a constant and literal. */
9567 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9571 /* With undefined overflow prefer doing association in a type
9572 which wraps on overflow, if that is one of the operand types. */
9575 {
9583 }
9585 /* With undefined overflow we can only associate constants with one
9586 variable, and constants whose association doesn't overflow. */
9589 {
9591 {
9597 {
9600 }
9607 {
9610 }
9616 /* The only case we can still associate with two variables
9617 is if they cancel out. */
9621 }
9622 }
9624 /* Only do something if we found more than two objects. Otherwise,
9625 nothing has changed and we risk infinite recursion. */
9631 {
9643 /* Preserve the MINUS_EXPR if the negative part of the literal is
9644 greater than the positive part. Otherwise, the multiplicative
9645 folding code (i.e extract_muldiv) may be fooled in case
9646 unsigned constants are subtracted, like in the following
9647 example: ((X*2 + 4) - 8U)/2. */
9649 {
9653 {
9657 }
9658 else
9659 {
9663 }
9664 }
9666 /* Don't introduce overflows through reassociation. */
9673 {
9675 return
9679 else
9680 {
9683 return
9687 }
9688 }
9691 return
9694 }
9695 }
9700 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9708 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9709 __complex__ ( x, -y ). This is not the same for SNaNs or if
9710 signed zeros are involved. */
9714 {
9721 {
9725 {
9727 arg1r ? arg1r
9732 }
9734 {
9738 arg1i ? arg1i
9741 }
9742 }
9743 }
9745 /* A - B -> A + (-B) if B is easily negatable. */
9749 /* Avoid this transformation if B is a positive REAL_CST. */
9757 /* Fold &a[i] - &a[j] to i-j. */
9762 {
9768 }
9771 && flag_unsafe_math_optimizations
9777 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9778 one. Make sure the type is not saturating and has the signedness of
9779 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9780 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9787 {
9791 }
9797 {
9798 /* Transform x * -C into -x * C if x is easily negatable. */
9812 {
9815 "occur when simplifying "
9817 WARN_STRICT_OVERFLOW_MISC);
9819 }
9821 /* Optimize z * conj(z) for integer complex numbers. */
9828 }
9829 else
9830 {
9831 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
9832 This is not the same for NaNs or if signed zeros are
9833 involved. */
9839 {
9842 return
9848 return
9853 }
9855 /* Optimize z * conj(z) for floating point complex numbers.
9856 Guarded by flag_unsafe_math_optimizations as non-finite
9857 imaginary components don't produce scalar results. */
9866 }
9870 /* Canonicalize (X & C1) | C2. */
9874 {
9879 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
9887 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
9892 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
9893 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
9894 mode which allows further optimizations. */
9899 {
9903 {
9906 }
9907 }
9914 c3)),
9915 arg1);
9916 }
9918 /* See if this can be simplified into a rotate first. If that
9919 is unsuccessful continue in the association code. */
9923 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
9931 /* See if this can be simplified into a rotate first. If that
9932 is unsuccessful continue in the association code. */
9936 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
9941 {
9942 tree tem2;
9949 }
9950 /* Fold ~X & 1 as (X & 1) == 0. */
9954 {
9955 tree tem2;
9962 }
9963 /* Fold !X & 1 as X == 0. */
9966 {
9970 }
9972 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
9973 multiple of 1 << CST. */
9975 {
9982 }
9984 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
9985 bits from CST2. */
9989 {
9997 {
9998 /* Avoid the transform if arg1 is a mask of some
9999 mode which allows further optimizations. */
10006 }
10007 }
10009 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10010 ((A & N) + B) & M -> (A + B) & M
10011 Similarly if (N & M) == 0,
10012 ((A | N) + B) & M -> (A + B) & M
10013 and for - instead of + (or unary - instead of +)
10014 and/or ^ instead of |.
10015 If B is constant and (B & M) == 0, fold into A & M. */
10017 {
10026 {
10029 wide_int cst0;
10031 /* Now we know that arg0 is (C + D) or (C - D) or
10032 -C and arg1 (M) is == (1LL << cst) - 1.
10033 Store C into PMOP[0] and D into PMOP[1]. */
10037 {
10040 }
10047 {
10057 {
10060 }
10063 /* If C or D is of the form (A & N) where
10064 (N & M) == M, or of the form (A | N) or
10065 (A ^ N) where (N & M) == 0, replace it with A. */
10069 /* If C or D is a N where (N & M) == 0, it can be
10070 omitted (assumed 0). */
10078 }
10080 /* Only build anything new if we optimized one or both arguments
10081 above. */
10085 {
10088 {
10089 /* Perform the operations in a type that has defined
10090 overflow behavior. */
10096 }
10101 {
10109 else
10111 }
10114 else
10117 /* TEM is now the new binary +, - or unary - replacement. */
10121 }
10122 }
10123 }
10125 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10128 {
10133 return
10135 }
10140 /* Don't touch a floating-point divide by zero unless the mode
10141 of the constant can represent infinity. */
10147 /* (-A) / (-B) -> A / B */
10159 /* Fall through */
10162 /* Simplify A / (B << N) where A and B are positive and B is
10163 a power of 2, to A >> (N + log2(B)). */
10168 {
10171 {
10179 WARN_STRICT_OVERFLOW_MISC);
10185 }
10186 }
10188 /* Fall through */
10196 /* Convert -A / -B to A / B when the type is signed and overflow is
10197 undefined. */
10201 {
10204 "when distributing negation across "
10206 WARN_STRICT_OVERFLOW_MISC);
10211 }
10215 {
10218 "when distributing negation across "
10220 WARN_STRICT_OVERFLOW_MISC);
10225 }
10227 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10228 operation, EXACT_DIV_EXPR.
10230 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10231 At one time others generated faster code, it's not clear if they do
10232 after the last round to changes to the DIV code in expmed.c. */
10243 {
10247 WARN_STRICT_OVERFLOW_MISC);
10249 }
10261 {
10265 WARN_STRICT_OVERFLOW_MISC);
10267 }
10275 /* Since negative shift count is not well-defined,
10276 don't try to compute it in the compiler. */
10282 /* If we have a rotate of a bit operation with the rotate count and
10283 the second operand of the bit operation both constant,
10284 permute the two operations. */
10290 {
10298 }
10300 /* Two consecutive rotates adding up to the some integer
10301 multiple of the precision of the type can be ignored. */
10316 /* Note that the operands of this must be ints
10317 and their values must be 0 or 1.
10318 ("true" is a fixed value perhaps depending on the language.) */
10319 /* If first arg is constant zero, return it. */
10322 /* FALLTHRU */
10324 /* If either arg is constant true, drop it. */
10328 /* Preserve sequence points. */
10331 /* If second arg is constant zero, result is zero, but first arg
10332 must be evaluated. */
10335 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10336 case will be handled here. */
10340 /* !X && X is always false. */
10344 /* X && !X is always false. */
10349 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10350 means A >= Y && A != MAX, but in this case we know that
10351 A < X <= MAX. */
10355 {
10363 }
10372 /* Note that the operands of this must be ints
10373 and their values must be 0 or true.
10374 ("true" is a fixed value perhaps depending on the language.) */
10375 /* If first arg is constant true, return it. */
10378 /* FALLTHRU */
10380 /* If either arg is constant zero, drop it. */
10384 /* Preserve sequence points. */
10387 /* If second arg is constant true, result is true, but we must
10388 evaluate first arg. */
10391 /* Likewise for first arg, but note this only occurs here for
10392 TRUTH_OR_EXPR. */
10396 /* !X || X is always true. */
10400 /* X || !X is always true. */
10405 /* (X && !Y) || (!X && Y) is X ^ Y */
10408 {
10425 }
10434 /* If the second arg is constant zero, drop it. */
10437 /* If the second arg is constant true, this is a logical inversion. */
10439 {
10442 }
10443 /* Identical arguments cancel to zero. */
10447 /* !X ^ X is always true. */
10452 /* X ^ !X is always true. */
10468 /* bool_var != 1 becomes !bool_var. */
10475 /* bool_var == 0 becomes !bool_var. */
10482 /* !exp != 0 becomes !exp */
10487 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
10496 {
10502 }
10504 /* Transform comparisons of the form X CMP X +- Y to Y CMP 0. */
10513 {
10519 }
10521 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
10529 code == NE_EXPR
10533 /* Transform comparisons of the form X CMP C - X if C % 2 == 1. */
10541 code == NE_EXPR
10545 /* If this is an EQ or NE comparison with zero and ARG0 is
10546 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10547 two operations, but the latter can be done in one less insn
10548 on machines that have only two-operand insns or on which a
10549 constant cannot be the first operand. */
10552 {
10557 {
10564 arg1);
10565 }
10568 {
10575 arg1);
10576 }
10577 }
10579 /* If this is an NE or EQ comparison of zero against the result of a
10580 signed MOD operation whose second operand is a power of 2, make
10581 the MOD operation unsigned since it is simpler and equivalent. */
10589 {
10599 }
10601 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10602 C1 is a valid shift constant, and C2 is a power of two, i.e.
10603 a single bit. */
10607 == INTEGER_CST
10610 {
10615 /* Check for a valid shift count. */
10617 {
10621 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10622 can be rewritten as (X & (C2 << C1)) != 0. */
10624 {
10629 }
10630 /* Otherwise, for signed (arithmetic) shifts,
10631 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10632 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10636 /* Otherwise, of unsigned (logical) shifts,
10637 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10638 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10639 else
10643 arg000);
10644 }
10645 }
10647 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
10648 Similarly for NE_EXPR. */
10652 {
10656 tree dandnotc
10659 notc);
10663 }
10665 /* If this is a comparison of a field, we may be able to simplify it. */
10668 /* Handle the constant case even without -O
10669 to make sure the warnings are given. */
10671 {
10675 }
10677 /* Optimize comparisons of strlen vs zero to a compare of the
10678 first character of the string vs zero. To wit,
10679 strlen(ptr) == 0 => *ptr == 0
10680 strlen(ptr) != 0 => *ptr != 0
10681 Other cases should reduce to one of these two (or a constant)
10682 due to the return value of strlen being unsigned. */
10685 {
10693 {
10698 }
10699 }
10701 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10702 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10706 {
10711 {
10713 {
10716 }
10719 }
10720 }
10722 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10723 (X & C) == 0 when C is a single bit. */
10728 {
10735 arg1));
10736 }
10738 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10739 constant C is a power of two, i.e. a single bit. */
10746 {
10750 }
10752 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10753 when is C is a power of two, i.e. a single bit. */
10760 {
10766 }
10770 {
10773 }
10775 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10778 {
10791 arg01),
10800 arg01),
10809 arg00),
10818 arg00),
10820 }
10824 {
10831 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
10832 operand_equal_p guarantees no side-effects so we don't need
10833 to use omit_one_operand on Z. */
10837 arg10));
10841 arg11));
10845 arg10));
10849 arg11));
10851 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
10854 {
10860 }
10861 }
10863 /* Attempt to simplify equality/inequality comparisons of complex
10864 values. Only lower the comparison if the result is known or
10865 can be simplified to a single scalar comparison. */
10870 {
10875 {
10878 }
10879 else
10880 {
10883 }
10886 {
10889 }
10890 else
10891 {
10894 }
10898 {
10900 {
10905 }
10906 else
10907 {
10912 }
10913 }
10917 {
10919 {
10924 }
10925 else
10926 {
10931 }
10932 }
10933 }
10945 /* Transform comparisons of the form X +- C CMP X. */
10952 {
10959 else
10962 /* (X - c) > X becomes false. */
10966 {
10970 "occur when assuming that (X - c) > X "
10972 WARN_STRICT_OVERFLOW_ALL);
10974 }
10976 /* Likewise (X + c) < X becomes false. */
10980 {
10984 "occur when assuming that "
10986 WARN_STRICT_OVERFLOW_ALL);
10988 }
10990 /* Convert (X - c) <= X to true. */
10995 {
10999 "occur when assuming that "
11001 WARN_STRICT_OVERFLOW_ALL);
11003 }
11005 /* Convert (X + c) >= X to true. */
11010 {
11014 "occur when assuming that "
11016 WARN_STRICT_OVERFLOW_ALL);
11018 }
11021 {
11022 /* Convert X + c > X and X - c < X to true for integers. */
11026 {
11029 "not occur when assuming that "
11031 WARN_STRICT_OVERFLOW_ALL);
11033 }
11038 {
11041 "not occur when assuming that "
11043 WARN_STRICT_OVERFLOW_ALL);
11045 }
11047 /* Convert X + c <= X and X - c >= X to false for integers. */
11051 {
11054 "not occur when assuming that "
11056 WARN_STRICT_OVERFLOW_ALL);
11058 }
11063 {
11066 "not occur when assuming that "
11068 WARN_STRICT_OVERFLOW_ALL);
11070 }
11071 }
11072 }
11074 /* If we are comparing an ABS_EXPR with a constant, we can
11075 convert all the cases into explicit comparisons, but they may
11076 well not be faster than doing the ABS and one comparison.
11077 But ABS (X) <= C is a range comparison, which becomes a subtraction
11078 and a comparison, and is probably faster. */
11092 /* Convert ABS_EXPR<x> >= 0 to true. */
11099 {
11102 "when simplifying comparison of "
11104 WARN_STRICT_OVERFLOW_CONDITIONAL);
11107 arg0);
11108 }
11110 /* Convert ABS_EXPR<x> < 0 to false. */
11115 {
11118 "when simplifying comparison of "
11120 WARN_STRICT_OVERFLOW_CONDITIONAL);
11123 arg0);
11124 }
11126 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11127 and similarly for >= into !=. */
11137 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11138 otherwise Y might be >= # of bits in X's type and thus e.g.
11139 (unsigned char) (1 << Y) for Y 15 might be 0.
11140 If the cast is widening, then 1 << Y should have unsigned type,
11141 otherwise if Y is number of bits in the signed shift type minus 1,
11142 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11143 31 might be 0xffffffff80000000. */
11154 {
11160 }
11172 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11173 {
11185 }
11190 /* When pedantic, a compound expression can be neither an lvalue
11191 nor an integer constant expression. */
11194 /* Don't let (0, 0) be null pointer constant. */
11200 /* An ASSERT_EXPR should never be passed to fold_binary. */
11206 }
11208 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11209 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
11210 of GOTO_EXPR. */
11212 static tree
11214 {
11216 {
11223 /* fall through */
11227 }
11228 }
11230 /* Return whether the sub-tree ST contains a label which is accessible from
11231 outside the sub-tree. */
11233 static bool
11235 {
11236 return
11238 }
11240 /* Fold a ternary expression of code CODE and type TYPE with operands
11241 OP0, OP1, and OP2. Return the folded expression if folding is
11242 successful. Otherwise, return NULL_TREE. */
11244 tree
11247 {
11248 tree tem;
11255 /* If this is a commutative operation, and OP0 is a constant, move it
11256 to OP1 to reduce the number of tests below. */
11265 /* Strip any conversions that don't change the mode. This is safe
11266 for every expression, except for a comparison expression because
11267 its signedness is derived from its operands. So, in the latter
11268 case, only strip conversions that don't change the signedness.
11270 Note that this is done as an internal manipulation within the
11271 constant folder, in order to find the simplest representation of
11272 the arguments so that their form can be studied. In any cases,
11273 the appropriate type conversions should be put back in the tree
11274 that will get out of the constant folder. */
11276 {
11279 }
11282 {
11285 }
11288 {
11291 }
11294 {
11298 {
11304 }
11309 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11310 so all simple results must be passed through pedantic_non_lvalue. */
11312 {
11315 /* Only optimize constant conditions when the selected branch
11316 has the same type as the COND_EXPR. This avoids optimizing
11317 away "c ? x : throw", where the throw has a void type.
11318 Avoid throwing away that operand which contains label. */
11325 }
11327 {
11332 {
11337 {
11345 }
11349 }
11350 }
11352 /* If we have A op B ? A : C, we may be able to convert this to a
11353 simpler expression, depending on the operation and the values
11354 of B and C. Signed zeros prevent all of these transformations,
11355 for reasons given above each one.
11357 Also try swapping the arguments and inverting the conditional. */
11362 {
11366 }
11370 op2,
11373 {
11377 {
11381 }
11382 }
11384 /* If the second operand is simpler than the third, swap them
11385 since that produces better jump optimization results. */
11388 {
11390 /* See if this can be inverted. If it can't, possibly because
11391 it was a floating-point inequality comparison, don't do
11392 anything. */
11396 }
11398 /* Convert A ? 1 : 0 to simply A. */
11403 /* If we try to convert OP0 to our type, the
11404 call to fold will try to move the conversion inside
11405 a COND, which will recurse. In that case, the COND_EXPR
11406 is probably the best choice, so leave it alone. */
11410 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11411 over COND_EXPR in cases such as floating point comparisons. */
11420 arg0)));
11422 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11427 {
11428 /* sign_bit_p looks through both zero and sign extensions,
11429 but for this optimization only sign extensions are
11430 usable. */
11433 {
11436 {
11439 }
11441 }
11442 /* sign_bit_p only checks ARG1 bits within A's precision.
11443 If <sign bit of A> has wider type than A, bits outside
11444 of A's precision in <sign bit of A> need to be checked.
11445 If they are all 0, this optimization needs to be done
11446 in unsigned A's type, if they are all 1 in signed A's type,
11447 otherwise this can't be done. */
11453 {
11455 tree tem_type;
11468 {
11471 }
11473 {
11476 }
11477 else
11479 }
11482 return
11488 arg1)));
11489 }
11491 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11492 already handled above. */
11497 {
11506 }
11508 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11509 is probably obsolete because the first operand should be a
11510 truth value (that's why we have the two cases above), but let's
11511 leave it in until we can confirm this for all front-ends. */
11523 /* Disable the transformations below for vectors, since
11524 fold_binary_op_with_conditional_arg may undo them immediately,
11525 yielding an infinite loop. */
11529 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11538 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11543 {
11545 /* Only perform transformation if ARG0 is easily inverted. */
11549 ? BIT_IOR_EXPR
11552 arg1);
11553 }
11555 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11560 {
11562 /* Only perform transformation if ARG0 is easily inverted. */
11568 op2);
11569 }
11571 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11583 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11584 of fold_ternary on them. */
11592 {
11602 {
11607 {
11615 }
11616 }
11617 }
11619 /* On constants we can use native encode/interpret to constant
11620 fold (nearly) all BIT_FIELD_REFs. */
11624 {
11627 /* Limit us to a reasonable amount of work. To relax the
11628 other limitations we need bit-shifting of the buffer
11629 and rounding up the size. */
11633 {
11635 unsigned HOST_WIDE_INT len
11640 {
11645 }
11646 }
11647 }
11652 /* For integers we can decompose the FMA if possible. */
11664 {
11680 {
11685 /* Make sure that the perm value is in an acceptable
11686 range. */
11695 else
11700 }
11703 {
11708 }
11713 {
11718 }
11724 {
11728 }
11733 /* Some targets are deficient and fail to expand a single
11734 argument permutation while still allowing an equivalent
11735 2-argument version. */
11739 {
11742 }
11745 {
11752 }
11756 }
11760 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
11763 {
11769 wide_int tem2
11773 }
11778 {
11780 unsigned HOST_WIDE_INT elsize
11783 {
11787 else
11788 {
11794 }
11795 }
11796 }
11802 }
11804 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
11805 of an array (or vector). */
11807 tree
11809 {
11814 {
11817 {
11818 /* Static constructors for variably sized objects makes no sense. */
11822 }
11823 }
11834 offset_int max_index;
11839 {
11840 /* Array constructor might explicitly set index, or specify a range,
11841 or leave index NULL meaning that it is next index after previous
11842 one. */
11844 {
11847 else
11848 {
11852 }
11853 }
11854 else
11855 {
11861 }
11863 /* Do we have match? */
11867 }
11869 }
11871 /* Perform constant folding and related simplification of EXPR.
11872 The related simplifications include x*1 => x, x*0 => 0, etc.,
11873 and application of the associative law.
11874 NOP_EXPR conversions may be removed freely (as long as we
11875 are careful not to change the type of the overall expression).
11876 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
11877 but we can constant-fold them if they have constant operands. */
11879 #ifdef ENABLE_FOLD_CHECKING
11880 # define fold(x) fold_1 (x)
11882 static
11883 #endif
11884 tree
11886 {
11890 tree tem;
11893 /* Return right away if a constant. */
11897 /* CALL_EXPR-like objects with variable numbers of operands are
11898 treated specially. */
11900 {
11902 {
11905 }
11907 }
11910 {
11915 {
11933 }
11934 }
11937 {
11939 {
11946 {
11951 }
11954 }
11956 /* Return a VECTOR_CST if possible. */
11958 {
11964 tree val;
11970 }
11978 }
11980 #ifdef ENABLE_FOLD_CHECKING
11981 #undef fold
11988 /* When --enable-checking=fold, compute a digest of expr before
11989 and after actual fold call to see if fold did not accidentally
11990 change original expr. */
11992 tree
11994 {
11995 tree ret;
12015 }
12017 void
12019 {
12030 }
12032 static void
12034 {
12036 }
12038 static void
12041 {
12047 recursive_label:
12057 {
12058 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12063 }
12071 {
12072 /* Allow these fields to be modified. */
12073 tree tmp;
12082 {
12085 }
12086 }
12097 {
12100 {
12115 }
12119 {
12132 }
12149 {
12155 }
12158 {
12160 {
12163 }
12165 }
12176 {
12179 }
12189 }
12190 }
12192 /* Helper function for outputting the checksum of a tree T. When
12193 debugging with gdb, you can "define mynext" to be "next" followed
12194 by "call debug_fold_checksum (op0)", then just trace down till the
12195 outputs differ. */
12197 DEBUG_FUNCTION void
12199 {
12214 }
12216 #endif
12218 /* Fold a unary tree expression with code CODE of type TYPE with an
12219 operand OP0. LOC is the location of the resulting expression.
12220 Return a folded expression if successful. Otherwise, return a tree
12221 expression with code CODE of type TYPE with an operand OP0. */
12223 tree
12226 {
12227 tree tem;
12228 #ifdef ENABLE_FOLD_CHECKING
12237 #endif
12243 #ifdef ENABLE_FOLD_CHECKING
12250 #endif
12252 }
12254 /* Fold a binary tree expression with code CODE of type TYPE with
12255 operands OP0 and OP1. LOC is the location of the resulting
12256 expression. Return a folded expression if successful. Otherwise,
12257 return a tree expression with code CODE of type TYPE with operands
12258 OP0 and OP1. */
12260 tree
12263 MEM_STAT_DECL)
12264 {
12265 tree tem;
12266 #ifdef ENABLE_FOLD_CHECKING
12283 #endif
12289 #ifdef ENABLE_FOLD_CHECKING
12304 #endif
12306 }
12308 /* Fold a ternary tree expression with code CODE of type TYPE with
12309 operands OP0, OP1, and OP2. Return a folded expression if
12310 successful. Otherwise, return a tree expression with code CODE of
12311 type TYPE with operands OP0, OP1, and OP2. */
12313 tree
12316 {
12317 tree tem;
12318 #ifdef ENABLE_FOLD_CHECKING
12342 #endif
12349 #ifdef ENABLE_FOLD_CHECKING
12372 #endif
12374 }
12376 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12377 arguments in ARGARRAY, and a null static chain.
12378 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12379 of type TYPE from the given operands as constructed by build_call_array. */
12381 tree
12384 {
12385 tree tem;
12386 #ifdef ENABLE_FOLD_CHECKING
12405 #endif
12411 #ifdef ENABLE_FOLD_CHECKING
12427 #endif
12429 }
12431 /* Perform constant folding and related simplification of initializer
12432 expression EXPR. These behave identically to "fold_buildN" but ignore
12433 potential run-time traps and exceptions that fold must preserve. */
12435 #define START_FOLD_INIT \
12436 int saved_signaling_nans = flag_signaling_nans;\
12437 int saved_trapping_math = flag_trapping_math;\
12438 int saved_rounding_math = flag_rounding_math;\
12439 int saved_trapv = flag_trapv;\
12440 int saved_folding_initializer = folding_initializer;\
12441 flag_signaling_nans = 0;\
12442 flag_trapping_math = 0;\
12443 flag_rounding_math = 0;\
12444 flag_trapv = 0;\
12445 folding_initializer = 1;
12447 #define END_FOLD_INIT \
12448 flag_signaling_nans = saved_signaling_nans;\
12449 flag_trapping_math = saved_trapping_math;\
12450 flag_rounding_math = saved_rounding_math;\
12451 flag_trapv = saved_trapv;\
12452 folding_initializer = saved_folding_initializer;
12454 tree
12457 {
12458 tree result;
12459 START_FOLD_INIT;
12463 END_FOLD_INIT;
12465 }
12467 tree
12470 {
12471 tree result;
12472 START_FOLD_INIT;
12476 END_FOLD_INIT;
12478 }
12480 tree
12483 {
12484 tree result;
12485 START_FOLD_INIT;
12489 END_FOLD_INIT;
12491 }
12493 #undef START_FOLD_INIT
12494 #undef END_FOLD_INIT
12496 /* Determine if first argument is a multiple of second argument. Return 0 if
12497 it is not, or we cannot easily determined it to be.
12499 An example of the sort of thing we care about (at this point; this routine
12500 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12501 fold cases do now) is discovering that
12503 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12505 is a multiple of
12507 SAVE_EXPR (J * 8)
12509 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12511 This code also handles discovering that
12513 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12515 is a multiple of 8 so we don't have to worry about dealing with a
12516 possible remainder.
12518 Note that we *look* inside a SAVE_EXPR only to determine how it was
12519 calculated; it is not safe for fold to do much of anything else with the
12520 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12521 at run time. For example, the latter example above *cannot* be implemented
12522 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12523 evaluation time of the original SAVE_EXPR is not necessarily the same at
12524 the time the new expression is evaluated. The only optimization of this
12525 sort that would be valid is changing
12527 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12529 divided by 8 to
12531 SAVE_EXPR (I) * SAVE_EXPR (J)
12533 (where the same SAVE_EXPR (J) is used in the original and the
12534 transformed version). */
12536 int
12538 {
12549 {
12551 /* Bitwise and provides a power of two multiple. If the mask is
12552 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12555 /* FALLTHRU */
12562 /* It is impossible to prove if op0 - op1 is multiple of bottom
12563 precisely, so be conservative here checking if both op0 and op1
12564 are multiple of bottom. Note we check the second operand first
12565 since it's usually simpler. */
12570 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
12571 as op0 - 3 if the expression has unsigned type. For example,
12572 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
12582 {
12584 /* const_binop may not detect overflow correctly,
12585 so check for it explicitly here. */
12589 size_one_node,
12590 op1)))
12593 }
12597 /* Can't handle conversions from non-integral or wider integral type. */
12603 /* fall through */
12620 SIGNED);
12626 {
12629 /* Check for special cases to see if top is defined as multiple
12630 of bottom:
12632 top = (X & ~(bottom - 1) ; bottom is power of 2
12634 or
12636 Y = X % bottom
12637 top = X - Y. */
12656 }
12658 /* fall through */
12662 }
12663 }
12665 #define tree_expr_nonnegative_warnv_p(X, Y) \
12668 #define RECURSE(X) \
12669 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
12671 /* Return true if CODE or TYPE is known to be non-negative. */
12673 static bool
12675 {
12678 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12679 have a signed:1 type (where the value is -1 and 0). */
12682 }
12684 /* Return true if (CODE OP0) is known to be non-negative. If the return
12685 value is based on the assumption that signed overflow is undefined,
12686 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12687 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12689 bool
12692 {
12697 {
12699 /* We can't return 1 if flag_wrapv is set because
12700 ABS_EXPR<INT_MIN> = INT_MIN. */
12704 {
12707 }
12715 CASE_CONVERT:
12716 {
12721 {
12725 {
12729 }
12730 }
12732 {
12738 }
12739 }
12744 }
12746 /* We don't know sign of `t', so be conservative and return false. */
12748 }
12750 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12751 value is based on the assumption that signed overflow is undefined,
12752 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12753 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12755 bool
12759 {
12764 {
12770 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12771 both unsigned and at least 2 bits shorter than the result. */
12775 {
12780 {
12784 }
12785 }
12790 {
12791 /* x * x is always non-negative for floating point x
12792 or without overflow. */
12795 {
12800 }
12801 }
12803 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12804 both unsigned and their total bits is shorter than the result. */
12808 {
12827 {
12837 }
12838 }
12865 }
12867 /* We don't know sign of `t', so be conservative and return false. */
12869 }
12871 /* Return true if T is known to be non-negative. If the return
12872 value is based on the assumption that signed overflow is undefined,
12873 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12874 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12876 bool
12878 {
12883 {
12897 /* Limit the depth of recursion to avoid quadratic behavior.
12898 This is expected to catch almost all occurrences in practice.
12899 If this code misses important cases that unbounded recursion
12900 would not, passes that need this information could be revised
12901 to provide it through dataflow propagation. */
12909 }
12910 }
12912 /* Return true if T is known to be non-negative. If the return
12913 value is based on the assumption that signed overflow is undefined,
12914 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12915 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12917 bool
12920 {
12922 {
12923 CASE_CFN_ACOS:
12924 CASE_CFN_ACOSH:
12925 CASE_CFN_CABS:
12926 CASE_CFN_COSH:
12927 CASE_CFN_ERFC:
12928 CASE_CFN_EXP:
12929 CASE_CFN_EXP10:
12930 CASE_CFN_EXP2:
12931 CASE_CFN_FABS:
12932 CASE_CFN_FDIM:
12933 CASE_CFN_HYPOT:
12934 CASE_CFN_POW10:
12935 CASE_CFN_FFS:
12936 CASE_CFN_PARITY:
12937 CASE_CFN_POPCOUNT:
12938 CASE_CFN_CLZ:
12939 CASE_CFN_CLRSB:
12942 /* Always true. */
12945 CASE_CFN_SQRT:
12946 /* sqrt(-0.0) is -0.0. */
12951 CASE_CFN_ASINH:
12952 CASE_CFN_ATAN:
12953 CASE_CFN_ATANH:
12954 CASE_CFN_CBRT:
12955 CASE_CFN_CEIL:
12956 CASE_CFN_ERF:
12957 CASE_CFN_EXPM1:
12958 CASE_CFN_FLOOR:
12959 CASE_CFN_FMOD:
12960 CASE_CFN_FREXP:
12961 CASE_CFN_ICEIL:
12962 CASE_CFN_IFLOOR:
12963 CASE_CFN_IRINT:
12964 CASE_CFN_IROUND:
12965 CASE_CFN_LCEIL:
12966 CASE_CFN_LDEXP:
12967 CASE_CFN_LFLOOR:
12968 CASE_CFN_LLCEIL:
12969 CASE_CFN_LLFLOOR:
12970 CASE_CFN_LLRINT:
12971 CASE_CFN_LLROUND:
12972 CASE_CFN_LRINT:
12973 CASE_CFN_LROUND:
12974 CASE_CFN_MODF:
12975 CASE_CFN_NEARBYINT:
12976 CASE_CFN_RINT:
12977 CASE_CFN_ROUND:
12978 CASE_CFN_SCALB:
12979 CASE_CFN_SCALBLN:
12980 CASE_CFN_SCALBN:
12981 CASE_CFN_SIGNBIT:
12982 CASE_CFN_SIGNIFICAND:
12983 CASE_CFN_SINH:
12984 CASE_CFN_TANH:
12985 CASE_CFN_TRUNC:
12986 /* True if the 1st argument is nonnegative. */
12989 CASE_CFN_FMAX:
12990 /* True if the 1st OR 2nd arguments are nonnegative. */
12993 CASE_CFN_FMIN:
12994 /* True if the 1st AND 2nd arguments are nonnegative. */
12997 CASE_CFN_COPYSIGN:
12998 /* True if the 2nd argument is nonnegative. */
13001 CASE_CFN_POWI:
13002 /* True if the 1st argument is nonnegative or the second
13003 argument is an even integer. */
13009 CASE_CFN_POW:
13010 /* True if the 1st argument is nonnegative or the second
13011 argument is an even integer valued real. */
13013 {
13014 REAL_VALUE_TYPE c;
13015 HOST_WIDE_INT n;
13020 {
13021 REAL_VALUE_TYPE cint;
13025 }
13026 }
13031 }
13033 }
13035 /* Return true if T is known to be non-negative. If the return
13036 value is based on the assumption that signed overflow is undefined,
13037 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13038 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13040 static bool
13042 {
13048 {
13050 {
13054 /* If the initializer is non-void, then it's a normal expression
13055 that will be assigned to the slot. */
13059 /* Otherwise, the initializer sets the slot in some way. One common
13060 way is an assignment statement at the end of the initializer. */
13062 {
13070 else
13072 }
13078 }
13081 {
13087 arg0,
13088 arg1,
13090 }
13103 }
13104 }
13106 #undef RECURSE
13107 #undef tree_expr_nonnegative_warnv_p
13109 /* Return true if T is known to be non-negative. If the return
13110 value is based on the assumption that signed overflow is undefined,
13111 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13112 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13114 bool
13116 {
13123 {
13145 }
13148 {
13174 }
13175 }
13177 /* Return true if `t' is known to be non-negative. Handle warnings
13178 about undefined signed overflow. */
13180 bool
13182 {
13189 "determining that expression is always "
13191 WARN_STRICT_OVERFLOW_MISC);
13193 }
13196 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13197 For floating point we further ensure that T is not denormal.
13198 Similar logic is present in nonzero_address in rtlanal.h.
13200 If the return value is based on the assumption that signed overflow
13201 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13202 change *STRICT_OVERFLOW_P. */
13204 bool
13207 {
13209 {
13212 strict_overflow_p);
13215 {
13221 strict_overflow_p));
13222 }
13227 strict_overflow_p);
13231 }
13234 }
13236 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13237 For floating point we further ensure that T is not denormal.
13238 Similar logic is present in nonzero_address in rtlanal.h.
13240 If the return value is based on the assumption that signed overflow
13241 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13242 change *STRICT_OVERFLOW_P. */
13244 bool
13246 tree type,
13247 tree op0,
13249 {
13252 {
13256 {
13257 /* With the presence of negative values it is hard
13258 to say something. */
13265 /* One of operands must be positive and the other non-negative. */
13266 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13267 overflows, on a twos-complement machine the sum of two
13268 nonnegative numbers can never be zero. */
13270 strict_overflow_p)
13272 strict_overflow_p));
13273 }
13278 {
13280 strict_overflow_p)
13282 strict_overflow_p))
13283 {
13286 }
13287 }
13296 {
13299 }
13306 {
13310 /* When both operands are nonzero, then MAX must be too. */
13312 strict_overflow_p))
13315 /* MAX where operand 0 is positive is positive. */
13317 strict_overflow_p);
13318 }
13319 /* MAX where operand 1 is positive is positive. */
13324 {
13328 }
13333 strict_overflow_p)
13335 strict_overflow_p));
13339 }
13342 }
13344 /* Return true when T is an address and is known to be nonzero.
13345 For floating point we further ensure that T is not denormal.
13346 Similar logic is present in nonzero_address in rtlanal.h.
13348 If the return value is based on the assumption that signed overflow
13349 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13350 change *STRICT_OVERFLOW_P. */
13352 bool
13354 {
13357 {
13362 {
13374 /* For objects in symbol table check if we know they are non-zero.
13375 Don't do anything for variables and functions before symtab is built;
13376 it is quite possible that they will be declared weak later. */
13381 /* Constants are never weak. */
13386 }
13394 {
13398 }
13403 }
13405 }
13407 #define integer_valued_real_p(X) \
13410 #define RECURSE(X) \
13411 ((integer_valued_real_p) (X, depth + 1))
13413 /* Return true if the floating point result of (CODE OP0) has an
13414 integer value. We also allow +Inf, -Inf and NaN to be considered
13415 integer values. Return false for signaling NaN.
13417 DEPTH is the current nesting depth of the query. */
13419 bool
13421 {
13423 {
13430 CASE_CONVERT:
13431 {
13438 }
13442 }
13444 }
13446 /* Return true if the floating point result of (CODE OP0 OP1) has an
13447 integer value. We also allow +Inf, -Inf and NaN to be considered
13448 integer values. Return false for signaling NaN.
13450 DEPTH is the current nesting depth of the query. */
13452 bool
13454 {
13456 {
13466 }
13468 }
13470 /* Return true if the floating point result of calling FNDECL with arguments
13471 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13472 considered integer values. Return false for signaling NaN. If FNDECL
13473 takes fewer than 2 arguments, the remaining ARGn are null.
13475 DEPTH is the current nesting depth of the query. */
13477 bool
13479 {
13481 {
13482 CASE_CFN_CEIL:
13483 CASE_CFN_FLOOR:
13484 CASE_CFN_NEARBYINT:
13485 CASE_CFN_RINT:
13486 CASE_CFN_ROUND:
13487 CASE_CFN_TRUNC:
13490 CASE_CFN_FMIN:
13491 CASE_CFN_FMAX:
13496 }
13498 }
13500 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13501 has an integer value. We also allow +Inf, -Inf and NaN to be
13502 considered integer values. Return false for signaling NaN.
13504 DEPTH is the current nesting depth of the query. */
13506 bool
13508 {
13510 {
13518 /* Limit the depth of recursion to avoid quadratic behavior.
13519 This is expected to catch almost all occurrences in practice.
13520 If this code misses important cases that unbounded recursion
13521 would not, passes that need this information could be revised
13522 to provide it through dataflow propagation. */
13526 depth));
13530 }
13532 }
13534 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
13535 has an integer value. We also allow +Inf, -Inf and NaN to be
13536 considered integer values. Return false for signaling NaN.
13538 DEPTH is the current nesting depth of the query. */
13540 static bool
13542 {
13544 {
13555 }
13557 }
13559 #undef RECURSE
13560 #undef integer_valued_real_p
13562 /* Return true if the floating point expression T has an integer value.
13563 We also allow +Inf, -Inf and NaN to be considered integer values.
13564 Return false for signaling NaN.
13566 DEPTH is the current nesting depth of the query. */
13568 bool
13570 {
13576 {
13592 }
13595 {
13601 {
13610 }
13614 }
13615 }
13617 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13618 attempt to fold the expression to a constant without modifying TYPE,
13619 OP0 or OP1.
13621 If the expression could be simplified to a constant, then return
13622 the constant. If the expression would not be simplified to a
13623 constant, then return NULL_TREE. */
13625 tree
13627 {
13630 }
13632 /* Given the components of a unary expression CODE, TYPE and OP0,
13633 attempt to fold the expression to a constant without modifying
13634 TYPE or OP0.
13636 If the expression could be simplified to a constant, then return
13637 the constant. If the expression would not be simplified to a
13638 constant, then return NULL_TREE. */
13640 tree
13642 {
13645 }
13647 /* If EXP represents referencing an element in a constant string
13648 (either via pointer arithmetic or array indexing), return the
13649 tree representing the value accessed, otherwise return NULL. */
13651 tree
13653 {
13657 {
13659 tree index;
13660 tree string;
13665 else
13666 {
13670 /* Optimize the special-case of a zero lower bound.
13672 We convert the low_bound to sizetype to avoid some problems
13673 with constant folding. (E.g. suppose the lower bound is 1,
13674 and its mode is QI. Without the conversion,l (ARRAY
13675 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13676 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13682 }
13695 }
13697 }
13699 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13700 an integer constant, real, or fixed-point constant.
13702 TYPE is the type of the result. */
13704 static tree
13706 {
13710 {
13712 {
13719 }
13726 {
13727 FIXED_VALUE_TYPE f;
13732 /* Propagate overflow flags. */
13736 }
13740 }
13743 }
13745 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13746 an integer constant or real constant.
13748 TYPE is the type of the result. */
13750 tree
13752 {
13756 {
13758 {
13759 /* If the value is unsigned or non-negative, then the absolute value
13760 is the same as the ordinary value. */
13764 /* If the value is negative, then the absolute value is
13765 its negation. */
13766 else
13767 {
13772 }
13773 }
13779 else
13785 }
13788 }
13790 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13791 constant. TYPE is the type of the result. */
13793 static tree
13795 {
13799 }
13801 /* Given CODE, a relational operator, the target type, TYPE and two
13802 constant operands OP0 and OP1, return the result of the
13803 relational operation. If the result is not a compile time
13804 constant, then return NULL_TREE. */
13806 static tree
13808 {
13811 /* From here on, the only cases we handle are when the result is
13812 known to be a constant. */
13815 {
13819 /* Handle the cases where either operand is a NaN. */
13821 {
13823 {
13851 }
13854 }
13857 }
13860 {
13864 }
13866 /* Handle equality/inequality of complex constants. */
13868 {
13879 else
13881 }
13884 {
13886 {
13887 /* Have vector comparison with scalar boolean result. */
13891 {
13899 }
13901 }
13908 {
13920 }
13923 }
13925 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
13927 To compute GT, swap the arguments and do LT.
13928 To compute GE, do LT and invert the result.
13929 To compute LE, swap the arguments, do LT and invert the result.
13930 To compute NE, do EQ and invert the result.
13932 Therefore, the code below must handle only EQ and LT. */
13935 {
13938 }
13940 /* Note that it is safe to invert for real values here because we
13941 have already handled the one case that it matters. */
13945 {
13948 }
13950 /* Compute a result for LT or EQ if args permit;
13951 Otherwise return T. */
13953 {
13956 else
13958 }
13959 else
13965 }
13967 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
13968 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
13969 itself. */
13971 tree
13973 {
13974 /* If the expression does not have side effects then we don't have to wrap
13975 it with a cleanup point expression. */
13979 /* If the expression is a return, check to see if the expression inside the
13980 return has no side effects or the right hand side of the modify expression
13981 inside the return. If either don't have side effects set we don't need to
13982 wrap the expression in a cleanup point expression. Note we don't check the
13983 left hand side of the modify because it should always be a return decl. */
13985 {
13992 }
13995 }
13997 /* Given a pointer value OP0 and a type TYPE, return a simplified version
13998 of an indirection through OP0, or NULL_TREE if no simplification is
13999 possible. */
14001 tree
14003 {
14005 tree subtype;
14013 {
14016 /* *&CONST_DECL -> to the value of the const decl. */
14019 /* *&p => p; make sure to handle *&"str"[cst] here. */
14021 {
14025 else
14027 }
14028 /* *(foo *)&fooarray => fooarray[0] */
14031 && (!in_gimple_form
14033 {
14043 }
14044 /* *(foo *)&complexfoo => __real__ complexfoo */
14048 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14051 {
14055 }
14056 }
14060 {
14066 {
14067 tree op00type;
14071 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14074 {
14076 unsigned HOST_WIDE_INT max_offset
14081 {
14088 }
14089 }
14090 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14093 {
14097 }
14098 /* ((foo *)&fooarray)[1] => fooarray[1] */
14101 {
14111 }
14112 }
14113 }
14115 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14118 && (!in_gimple_form
14120 {
14121 tree type_domain;
14131 NULL_TREE);
14132 }
14135 }
14137 /* Builds an expression for an indirection through T, simplifying some
14138 cases. */
14140 tree
14142 {
14150 }
14152 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14154 tree
14156 {
14161 else
14163 }
14165 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14166 whose result is ignored. The type of the returned tree need not be
14167 the same as the original expression. */
14169 tree
14171 {
14177 {
14188 else
14194 {
14210 }
14215 }
14216 }
14218 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14220 tree
14222 {
14228 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14229 have to do anything. Only do this when we are not given a const,
14230 because in that case, this check is more expensive than just
14231 doing it. */
14233 {
14238 }
14240 /* If divisor is a power of two, simplify this to bit manipulation. */
14242 {
14244 {
14258 }
14259 else
14260 {
14261 tree t;
14267 }
14268 }
14269 else
14270 {
14275 }
14278 }
14280 /* Likewise, but round down. */
14282 tree
14284 {
14291 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14292 have to do anything. Only do this when we are not given a const,
14293 because in that case, this check is more expensive than just
14294 doing it. */
14296 {
14301 }
14303 /* If divisor is a power of two, simplify this to bit manipulation. */
14305 {
14306 tree t;
14310 }
14311 else
14312 {
14317 }
14320 }
14322 /* Returns the pointer to the base of the object addressed by EXP and
14323 extracts the information about the offset of the access, storing it
14324 to PBITPOS and POFFSET. */
14326 static tree
14329 {
14330 tree core;
14331 machine_mode mode;
14333 HOST_WIDE_INT bitsize;
14337 {
14342 }
14343 else
14344 {
14348 }
14351 }
14353 /* Returns true if addresses of E1 and E2 differ by a constant, false
14354 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14356 bool
14358 {
14372 {
14382 }
14384 {
14385 /* If only one of the offsets is non-constant, the difference cannot
14386 be a constant. */
14388 }
14389 else
14394 }
14396 /* Return OFF converted to a pointer offset type suitable as offset for
14397 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14398 tree
14400 {
14402 }
14404 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14405 tree
14407 {
14410 }
14412 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14413 tree
14415 {
14418 }
14420 /* Return a char pointer for a C string if it is a string constant
14421 or sum of string constant and integer constant. We only support
14422 string constants properly terminated with '\0' character.
14423 If STRLEN is a valid pointer, length (including terminating character)
14424 of returned string is stored to the argument. */
14428 {
14429 tree offset_node;
14440 {
14443 else
14445 }
14450 /* Support only properly null-terminated strings. */
14459 }
14461 #if CHECKING_P
14465 /* Helper functions for writing tests of folding trees. */
14467 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
14469 static void
14471 tree constant)
14472 {
14474 }
14476 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
14477 wrapping WRAPPED_EXPR. */
14479 static void
14481 tree wrapped_expr)
14482 {
14487 }
14489 /* Verify that various arithmetic binary operations are folded
14490 correctly. */
14492 static void
14494 {
14500 /* Addition. */
14501 /* 1 <-- (0 + 1) */
14503 one);
14505 one);
14507 /* (nonlvalue)x <-- (x + 0) */
14509 x);
14511 /* Subtraction. */
14512 /* 0 <-- (x - x) */
14514 zero);
14516 x);
14518 /* Multiplication. */
14519 /* 0 <-- (x * 0) */
14521 zero);
14523 /* (nonlvalue)x <-- (x * 1) */
14525 x);
14526 }
14528 /* Verify that various binary operations on vectors are folded
14529 correctly. */
14531 static void
14533 {
14539 /* Verify equality tests that return a scalar boolean result. */
14545 }
14547 /* Run all of the selftests within this file. */
14549 void
14551 {
14554 }