| blob | fb6e45dd393cd752b181e208647bea3b90d154f4 |
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /*@@ This file should be rewritten to use an arbitrary precision
21 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
22 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
23 @@ The routines that translate from the ap rep should
24 @@ warn if precision et. al. is lost.
25 @@ This would also make life easier when this technology is used
26 @@ for cross-compilers. */
28 /* The entry points in this file are fold, size_int_wide and size_binop.
30 fold takes a tree as argument and returns a simplified tree.
32 size_binop takes a tree code for an arithmetic operation
33 and two operands that are trees, and produces a tree for the
34 result, assuming the type comes from `sizetype'.
36 size_int takes an integer value, and creates a tree constant
37 with type from `sizetype'.
39 Note: Since the folders get called on non-gimple code as well as
40 gimple code, we need to handle GIMPLE tuples as well as their
41 corresponding tree equivalents. */
83 #ifndef LOAD_EXTEND_OP
84 #define LOAD_EXTEND_OP(M) UNKNOWN
85 #endif
87 /* Nonzero if we are folding constants inside an initializer; zero
88 otherwise. */
91 /* The following constants represent a bit based encoding of GCC's
92 comparison operators. This encoding simplifies transformations
93 on relational comparison operators, such as AND and OR. */
111 };
149 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
150 Otherwise, return LOC. */
152 static location_t
154 {
157 }
159 /* Similar to protected_set_expr_location, but never modify x in place,
160 if location can and needs to be set, unshare it. */
164 {
170 {
173 }
175 }
176 \f
177 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
178 division and returns the quotient. Otherwise returns
179 NULL_TREE. */
181 tree
183 {
184 widest_int quo;
191 }
192 \f
193 /* This is nonzero if we should defer warnings about undefined
194 overflow. This facility exists because these warnings are a
195 special case. The code to estimate loop iterations does not want
196 to issue any warnings, since it works with expressions which do not
197 occur in user code. Various bits of cleanup code call fold(), but
198 only use the result if it has certain characteristics (e.g., is a
199 constant); that code only wants to issue a warning if the result is
200 used. */
204 /* If a warning about undefined overflow is deferred, this is the
205 warning. Note that this may cause us to turn two warnings into
206 one, but that is fine since it is sufficient to only give one
207 warning per expression. */
211 /* If a warning about undefined overflow is deferred, this is the
212 level at which the warning should be emitted. */
216 /* Start deferring overflow warnings. We could use a stack here to
217 permit nested calls, but at present it is not necessary. */
219 void
221 {
223 }
225 /* Stop deferring overflow warnings. If there is a pending warning,
226 and ISSUE is true, then issue the warning if appropriate. STMT is
227 the statement with which the warning should be associated (used for
228 location information); STMT may be NULL. CODE is the level of the
229 warning--a warn_strict_overflow_code value. This function will use
230 the smaller of CODE and the deferred code when deciding whether to
231 issue the warning. CODE may be zero to mean to always use the
232 deferred code. */
234 void
236 {
238 location_t locus;
243 {
249 }
260 /* Use the smallest code level when deciding to issue the
261 warning. */
270 else
273 }
275 /* Stop deferring overflow warnings, ignoring any deferred
276 warnings. */
278 void
280 {
282 }
284 /* Whether we are deferring overflow warnings. */
286 bool
288 {
290 }
292 /* This is called when we fold something based on the fact that signed
293 overflow is undefined. */
295 void
297 {
299 {
302 {
305 }
306 }
309 }
310 \f
311 /* Return true if the built-in mathematical function specified by CODE
312 is odd, i.e. -f(x) == f(-x). */
314 bool
316 {
318 {
319 CASE_CFN_ASIN:
320 CASE_CFN_ASINH:
321 CASE_CFN_ATAN:
322 CASE_CFN_ATANH:
323 CASE_CFN_CASIN:
324 CASE_CFN_CASINH:
325 CASE_CFN_CATAN:
326 CASE_CFN_CATANH:
327 CASE_CFN_CBRT:
328 CASE_CFN_CPROJ:
329 CASE_CFN_CSIN:
330 CASE_CFN_CSINH:
331 CASE_CFN_CTAN:
332 CASE_CFN_CTANH:
333 CASE_CFN_ERF:
334 CASE_CFN_LLROUND:
335 CASE_CFN_LROUND:
336 CASE_CFN_ROUND:
337 CASE_CFN_SIN:
338 CASE_CFN_SINH:
339 CASE_CFN_TAN:
340 CASE_CFN_TANH:
341 CASE_CFN_TRUNC:
344 CASE_CFN_LLRINT:
345 CASE_CFN_LRINT:
346 CASE_CFN_NEARBYINT:
347 CASE_CFN_RINT:
352 }
354 }
356 /* Check whether we may negate an integer constant T without causing
357 overflow. */
359 bool
361 {
362 tree type;
371 }
373 /* Determine whether an expression T can be cheaply negated using
374 the function negate_expr without introducing undefined overflow. */
376 static bool
378 {
379 tree type;
388 {
393 /* Check that -CST will not overflow type. */
406 /* We want to canonicalize to positive real constants. Pretend
407 that only negative ones can be easily negated. */
415 {
426 }
441 /* -(A + B) -> (-B) - A. */
446 /* -(A + B) -> (-A) - B. */
450 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
461 /* INT_MIN/n * n doesn't overflow while negating one operand it does
462 if n is a power of two. */
471 /* Fall through. */
486 /* In general we can't negate B in A / B, because if A is INT_MIN and
487 B is 1, we may turn this into INT_MIN / -1 which is undefined
488 and actually traps on some architectures. */
497 /* Negate -((double)float) as (double)(-float). */
499 {
503 }
507 /* Negate -f(x) as f(-x). */
513 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
515 {
519 }
524 }
526 }
528 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
529 simplification is possible.
530 If negate_expr_p would return true for T, NULL_TREE will never be
531 returned. */
533 static tree
535 {
537 tree tem;
540 {
541 /* Convert - (~A) to A + 1. */
567 {
572 }
576 {
581 {
585 }
588 }
611 {
612 /* -(A + B) -> (-B) - A. */
616 {
620 }
622 /* -(A + B) -> (-A) - B. */
624 {
628 }
629 }
633 /* - (A - B) -> B - A */
645 /* Fall through. */
649 {
658 }
670 /* In general we can't negate B in A / B, because if A is INT_MIN and
671 B is 1, we may turn this into INT_MIN / -1 which is undefined
672 and actually traps on some architectures. */
684 /* Convert -((double)float) into (double)(-float). */
686 {
690 }
694 /* Negate -f(x) as f(-x). */
697 {
703 }
707 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
709 {
712 {
719 }
720 }
725 }
728 }
730 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
731 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
732 return NULL_TREE. */
734 static tree
736 {
738 location_t loc;
751 }
752 \f
753 /* Split a tree IN into a constant, literal and variable parts that could be
754 combined with CODE to make IN. "constant" means an expression with
755 TREE_CONSTANT but that isn't an actual constant. CODE must be a
756 commutative arithmetic operation. Store the constant part into *CONP,
757 the literal in *LITP and return the variable part. If a part isn't
758 present, set it to null. If the tree does not decompose in this way,
759 return the entire tree as the variable part and the other parts as null.
761 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
762 case, we negate an operand that was subtracted. Except if it is a
763 literal for which we use *MINUS_LITP instead.
765 If NEGATE_P is true, we are negating all of IN, again except a literal
766 for which we use *MINUS_LITP instead. If a variable part is of pointer
767 type, it is negated after converting to TYPE. This prevents us from
768 generating illegal MINUS pointer expression. LOC is the location of
769 the converted variable part.
771 If IN is itself a literal or constant, return it as appropriate.
773 Note that we do not guarantee that any of the three values will be the
774 same type as IN, but they will have the same signedness and mode. */
776 static tree
779 {
786 /* Strip any conversions that don't change the machine mode or signedness. */
795 /* We can associate addition and subtraction together (even
796 though the C standard doesn't say so) for integers because
797 the value is not affected. For reals, the value might be
798 affected, so we can't. */
801 {
807 /* First see if either of the operands is a literal, then a constant. */
820 /* If we haven't dealt with either operand, this is not a case we can
821 decompose. Otherwise, VAR is either of the ones remaining, if any. */
826 else
829 /* Now do any needed negations. */
835 {
836 /* Convert to TYPE before negating. */
839 }
840 }
845 {
846 /* -X - 1 is folded to ~X, undo that here. Do _not_ do this
847 when IN is constant. */
850 }
851 else
855 {
862 {
863 /* Convert to TYPE before negating. */
866 }
867 }
870 }
872 /* Re-associate trees split by the above function. T1 and T2 are
873 either expressions to associate or null. Return the new
874 expression, if any. LOC is the location of the new expression. If
875 we build an operation, do it in TYPE and with CODE. */
877 static tree
879 {
885 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
886 try to fold this since we will have infinite recursion. But do
887 deal with any NEGATE_EXPRs. */
890 {
892 {
905 }
907 {
910 }
914 }
918 }
919 \f
920 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
921 for use in int_const_binop, size_binop and size_diffop. */
923 static bool
925 {
932 {
941 }
946 }
949 /* Combine two integer constants ARG1 and ARG2 under operation CODE
950 to produce a new constant. Return NULL_TREE if we don't know how
951 to evaluate CODE at compile-time. */
953 static tree
956 {
957 wide_int res;
958 tree t;
966 {
982 {
986 else
988 }
991 /* It's unclear from the C standard whether shifts can overflow.
992 The following code ignores overflow; perhaps a C standard
993 interpretation ruling is needed. */
995 else
1002 {
1006 else
1008 }
1012 else
1091 }
1099 }
1101 tree
1103 {
1105 }
1107 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1108 constant. We assume ARG1 and ARG2 have the same data type, or at least
1109 are the same kind of constant and the same machine mode. Return zero if
1110 combining the constants is not allowed in the current operating mode. */
1112 static tree
1114 {
1115 /* Sanity check for the recursive cases. */
1123 {
1129 }
1132 {
1133 machine_mode mode;
1134 REAL_VALUE_TYPE d1;
1135 REAL_VALUE_TYPE d2;
1136 REAL_VALUE_TYPE value;
1137 REAL_VALUE_TYPE result;
1141 /* The following codes are handled by real_arithmetic. */
1143 {
1154 }
1162 /* Don't perform operation if we honor signaling NaNs and
1163 either operand is a signaling NaN. */
1169 /* Don't perform operation if it would raise a division
1170 by zero exception. */
1176 /* If either operand is a NaN, just return it. Otherwise, set up
1177 for floating-point trap; we return an overflow. */
1179 {
1180 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1181 is off. */
1185 }
1187 {
1188 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1189 is off. */
1193 }
1198 /* Don't constant fold this floating point operation if
1199 the result has overflowed and flag_trapping_math. */
1207 /* Don't constant fold this floating point operation if the
1208 result may dependent upon the run-time rounding mode and
1209 flag_rounding_math is set, or if GCC's software emulation
1210 is unable to accurately represent the result. */
1220 }
1223 {
1224 FIXED_VALUE_TYPE f1;
1225 FIXED_VALUE_TYPE f2;
1226 FIXED_VALUE_TYPE result;
1231 /* The following codes are handled by fixed_arithmetic. */
1233 {
1245 {
1252 }
1257 }
1264 /* Propagate overflow flags. */
1268 }
1271 {
1280 {
1291 mpc_mul);
1305 mpc_div);
1306 /* Fallthru. */
1312 {
1313 /* Keep this algorithm in sync with
1314 tree-complex.c:expand_complex_div_straight().
1316 Expand complex division to scalars, straightforward algorithm.
1317 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1318 t = br*br + bi*bi
1319 */
1320 tree magsquared
1324 tree t1
1328 tree t2
1335 }
1336 else
1337 {
1338 /* Keep this algorithm in sync with
1339 tree-complex.c:expand_complex_div_wide().
1341 Expand complex division to scalars, modified algorithm to minimize
1342 overflow with wide input ranges. */
1348 {
1349 /* In the TRUE branch, we compute
1350 ratio = br/bi;
1351 div = (br * ratio) + bi;
1352 tr = (ar * ratio) + ai;
1353 ti = (ai * ratio) - ar;
1354 tr = tr / div;
1355 ti = ti / div; */
1366 }
1367 else
1368 {
1369 /* In the FALSE branch, we compute
1370 ratio = d/c;
1371 divisor = (d * ratio) + c;
1372 tr = (b * ratio) + a;
1373 ti = b - (a * ratio);
1374 tr = tr / div;
1375 ti = ti / div; */
1387 }
1388 }
1393 }
1397 }
1401 {
1407 {
1413 /* It is possible that const_binop cannot handle the given
1414 code and return NULL_TREE */
1417 }
1420 }
1422 /* Shifts allow a scalar offset for a vector. */
1425 {
1431 {
1436 /* It is possible that const_binop cannot handle the given
1437 code and return NULL_TREE. */
1440 }
1443 }
1445 }
1447 /* Overload that adds a TYPE parameter to be able to dispatch
1448 to fold_relational_const. */
1450 tree
1452 {
1456 /* ??? Until we make the const_binop worker take the type of the
1457 result as argument put those cases that need it here. */
1459 {
1470 {
1486 {
1492 }
1495 }
1501 {
1526 {
1539 }
1542 }
1545 }
1550 /* Make sure type and arg0 have the same saturating flag. */
1555 }
1557 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1558 Return zero if computing the constants is not possible. */
1560 tree
1562 {
1563 /* Don't perform the operation, other than NEGATE and ABS, if
1564 flag_signaling_nans is on and the operand is a signaling NaN. */
1573 {
1574 CASE_CONVERT:
1581 /* If the source address is 0, and the source address space
1582 cannot have a valid object at 0, fold to dest type null. */
1593 {
1594 /* Can't call fold_negate_const directly here as that doesn't
1595 handle all cases and we might not be able to negate some
1596 constants. */
1601 }
1610 {
1614 }
1620 /* Perform BIT_NOT_EXPR on each element individually. */
1622 {
1624 tree elem;
1629 {
1635 }
1638 }
1660 {
1679 else
1683 {
1687 }
1690 }
1695 {
1709 {
1714 }
1717 {
1721 }
1724 }
1728 }
1731 }
1733 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1734 indicates which particular sizetype to create. */
1736 tree
1738 {
1740 }
1741 \f
1742 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1743 is a tree code. The type of the result is taken from the operands.
1744 Both must be equivalent integer types, ala int_binop_types_match_p.
1745 If the operands are constant, so is the result. */
1747 tree
1749 {
1758 /* Handle the special case of two integer constants faster. */
1760 {
1761 /* And some specific cases even faster than that. */
1763 {
1768 }
1770 {
1773 }
1775 {
1778 }
1780 /* Handle general case of two integer constants. For sizetype
1781 constant calculations we always want to know about overflow,
1782 even in the unsigned case. */
1784 }
1787 }
1789 /* Given two values, either both of sizetype or both of bitsizetype,
1790 compute the difference between the two values. Return the value
1791 in signed type corresponding to the type of the operands. */
1793 tree
1795 {
1797 tree ctype;
1802 /* If the type is already signed, just do the simple thing. */
1810 else
1813 /* If either operand is not a constant, do the conversions to the signed
1814 type and subtract. The hardware will do the right thing with any
1815 overflow in the subtraction. */
1821 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1822 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1823 overflow) and negate (which can't either). Special-case a result
1824 of zero while we're here. */
1830 else
1834 MINUS_EXPR,
1836 }
1837 \f
1838 /* A subroutine of fold_convert_const handling conversions of an
1839 INTEGER_CST to another integer type. */
1841 static tree
1843 {
1844 /* Given an integer constant, make new constant with new type,
1845 appropriately sign-extended or truncated. Use widest_int
1846 so that any extension is done according ARG1's type. */
1850 }
1852 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1853 to an integer type. */
1855 static tree
1857 {
1859 tree t;
1861 /* The following code implements the floating point to integer
1862 conversion rules required by the Java Language Specification,
1863 that IEEE NaNs are mapped to zero and values that overflow
1864 the target precision saturate, i.e. values greater than
1865 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1866 are mapped to INT_MIN. These semantics are allowed by the
1867 C and C++ standards that simply state that the behavior of
1868 FP-to-integer conversion is unspecified upon overflow. */
1870 wide_int val;
1871 REAL_VALUE_TYPE r;
1875 {
1882 }
1884 /* If R is NaN, return zero and show we have an overflow. */
1886 {
1889 }
1891 /* See if R is less than the lower bound or greater than the
1892 upper bound. */
1895 {
1899 {
1902 }
1903 }
1906 {
1909 {
1912 {
1915 }
1916 }
1917 }
1924 }
1926 /* A subroutine of fold_convert_const handling conversions of a
1927 FIXED_CST to an integer type. */
1929 static tree
1931 {
1932 tree t;
1936 /* Right shift FIXED_CST to temp by fbit. */
1940 {
1942 HOST_BITS_PER_DOUBLE_INT,
1945 /* Left shift temp to temp_trunc by fbit. */
1947 HOST_BITS_PER_DOUBLE_INT,
1949 }
1950 else
1951 {
1954 }
1956 /* If FIXED_CST is negative, we need to round the value toward 0.
1957 By checking if the fractional bits are not zero to add 1 to temp. */
1963 /* Given a fixed-point constant, make new constant with new type,
1964 appropriately sign-extended or truncated. */
1972 }
1974 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1975 to another floating point type. */
1977 static tree
1979 {
1980 REAL_VALUE_TYPE value;
1981 tree t;
1983 /* Don't perform the operation if flag_signaling_nans is on
1984 and the operand is a signaling NaN. */
1992 /* If converting an infinity or NAN to a representation that doesn't
1993 have one, set the overflow bit so that we can produce some kind of
1994 error message at the appropriate point if necessary. It's not the
1995 most user-friendly message, but it's better than nothing. */
2002 /* Regular overflow, conversion produced an infinity in a mode that
2003 can't represent them. */
2008 else
2011 }
2013 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2014 to a floating point type. */
2016 static tree
2018 {
2019 REAL_VALUE_TYPE value;
2020 tree t;
2027 }
2029 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2030 to another fixed-point type. */
2032 static tree
2034 {
2035 FIXED_VALUE_TYPE value;
2036 tree t;
2043 /* Propagate overflow flags. */
2047 }
2049 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2050 to a fixed-point type. */
2052 static tree
2054 {
2055 FIXED_VALUE_TYPE value;
2056 tree t;
2058 double_int di;
2065 else
2073 /* Propagate overflow flags. */
2077 }
2079 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2080 to a fixed-point type. */
2082 static tree
2084 {
2085 FIXED_VALUE_TYPE value;
2086 tree t;
2094 /* Propagate overflow flags. */
2098 }
2100 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2101 type TYPE. If no simplification can be done return NULL_TREE. */
2103 static tree
2105 {
2111 {
2118 }
2120 {
2127 }
2129 {
2136 }
2138 {
2141 {
2146 {
2152 }
2154 }
2155 }
2157 }
2159 /* Construct a vector of zero elements of vector type TYPE. */
2161 static tree
2163 {
2164 tree t;
2168 }
2170 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2172 bool
2174 {
2189 {
2204 }
2205 }
2207 /* Convert expression ARG to type TYPE. Used by the middle-end for
2208 simple conversions in preference to calling the front-end's convert. */
2210 tree
2212 {
2214 tree tem;
2225 {
2228 /* Handle conversions between pointers to different address spaces. */
2233 /* fall through */
2238 {
2242 }
2256 {
2260 }
2262 {
2266 }
2268 {
2272 }
2275 {
2293 }
2298 {
2302 }
2305 {
2319 }
2323 {
2332 integer_zero_node));
2334 {
2338 {
2344 }
2352 }
2356 }
2374 }
2375 fold_convert_exit:
2378 }
2379 \f
2380 /* Return false if expr can be assumed not to be an lvalue, true
2381 otherwise. */
2383 static bool
2385 {
2386 /* We only need to wrap lvalue tree codes. */
2388 {
2419 /* Assume the worst for front-end tree codes. */
2423 }
2426 }
2428 /* Return an expr equal to X but certainly not valid as an lvalue. */
2430 tree
2432 {
2433 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2434 us. */
2441 }
2443 /* When pedantic, return an expr equal to X but certainly not valid as a
2444 pedantic lvalue. Otherwise, return X. */
2446 static tree
2448 {
2450 }
2451 \f
2452 /* Given a tree comparison code, return the code that is the logical inverse.
2453 It is generally not safe to do this for floating-point comparisons, except
2454 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2455 ERROR_MARK in this case. */
2457 enum tree_code
2459 {
2465 {
2496 }
2497 }
2499 /* Similar, but return the comparison that results if the operands are
2500 swapped. This is safe for floating-point. */
2502 enum tree_code
2504 {
2506 {
2532 }
2533 }
2536 /* Convert a comparison tree code from an enum tree_code representation
2537 into a compcode bit-based encoding. This function is the inverse of
2538 compcode_to_comparison. */
2540 static enum comparison_code
2542 {
2544 {
2575 }
2576 }
2578 /* Convert a compcode bit-based encoding of a comparison operator back
2579 to GCC's enum tree_code representation. This function is the
2580 inverse of comparison_to_compcode. */
2582 static enum tree_code
2584 {
2586 {
2617 }
2618 }
2620 /* Return a tree for the comparison which is the combination of
2621 doing the AND or OR (depending on CODE) of the two operations LCODE
2622 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2623 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2624 if this makes the transformation invalid. */
2626 tree
2631 {
2638 {
2649 }
2652 {
2653 /* Eliminate unordered comparisons, as well as LTGT and ORD
2654 which are not used unless the mode has NaNs. */
2660 }
2662 {
2663 /* Check that the original operation and the optimized ones will trap
2664 under the same condition. */
2675 /* In a short-circuited boolean expression the LHS might be
2676 such that the RHS, if evaluated, will never trap. For
2677 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2678 if neither x nor y is NaN. (This is a mixed blessing: for
2679 example, the expression above will never trap, hence
2680 optimizing it to x < y would be invalid). */
2685 /* If the comparison was short-circuited, and only the RHS
2686 trapped, we may now generate a spurious trap. */
2691 /* If we changed the conditions that cause a trap, we lose. */
2694 }
2700 else
2701 {
2706 }
2707 }
2708 \f
2709 /* Return nonzero if two operands (typically of the same tree node)
2710 are necessarily equal. FLAGS modifies behavior as follows:
2712 If OEP_ONLY_CONST is set, only return nonzero for constants.
2713 This function tests whether the operands are indistinguishable;
2714 it does not test whether they are equal using C's == operation.
2715 The distinction is important for IEEE floating point, because
2716 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2717 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2719 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2720 even though it may hold multiple values during a function.
2721 This is because a GCC tree node guarantees that nothing else is
2722 executed between the evaluation of its "operands" (which may often
2723 be evaluated in arbitrary order). Hence if the operands themselves
2724 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2725 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2726 unset means assuming isochronic (or instantaneous) tree equivalence.
2727 Unless comparing arbitrary expression trees, such as from different
2728 statements, this flag can usually be left unset.
2730 If OEP_PURE_SAME is set, then pure functions with identical arguments
2731 are considered the same. It is used when the caller has other ways
2732 to ensure that global memory is unchanged in between.
2734 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2735 not values of expressions.
2737 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2738 any operand with side effect. This is unnecesarily conservative in the
2739 case we know that arg0 and arg1 are in disjoint code paths (such as in
2740 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2741 addresses with TREE_CONSTANT flag set so we know that &var == &var
2742 even if var is volatile. */
2744 int
2746 {
2747 /* When checking, verify at the outermost operand_equal_p call that
2748 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
2749 hash value. */
2751 {
2753 {
2755 {
2762 }
2764 }
2765 else
2767 }
2769 /* If either is ERROR_MARK, they aren't equal. */
2775 /* Similar, if either does not have a type (like a released SSA name),
2776 they aren't equal. */
2780 /* We cannot consider pointers to different address space equal. */
2787 /* Check equality of integer constants before bailing out due to
2788 precision differences. */
2790 {
2791 /* Address of INTEGER_CST is not defined; check that we did not forget
2792 to drop the OEP_ADDRESS_OF flags. */
2795 }
2798 {
2799 /* If both types don't have the same signedness, then we can't consider
2800 them equal. We must check this before the STRIP_NOPS calls
2801 because they may change the signedness of the arguments. As pointers
2802 strictly don't have a signedness, require either two pointers or
2803 two non-pointers as well. */
2809 /* If both types don't have the same precision, then it is not safe
2810 to strip NOPs. */
2817 }
2818 #if 0
2819 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
2820 sanity check once the issue is solved. */
2821 else
2822 /* Addresses of conversions and SSA_NAMEs (and many other things)
2823 are not defined. Check that we did not forget to drop the
2824 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
2827 #endif
2829 /* In case both args are comparisons but with different comparison
2830 code, try to swap the comparison operands of one arg to produce
2831 a match and compare that variant. */
2835 {
2843 }
2846 {
2847 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2849 ;
2851 {
2852 /* If we are interested in comparing addresses ignore
2853 MEM_REF wrappings of the base that can appear just for
2854 TBAA reasons. */
2868 }
2869 else
2871 }
2873 /* When not checking adddresses, this is needed for conversions and for
2874 COMPONENT_REF. Might as well play it safe and always test this. */
2881 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2882 We don't care about side effects in that case because the SAVE_EXPR
2883 takes care of that for us. In all other cases, two expressions are
2884 equal if they have no side effects. If we have two identical
2885 expressions with side effects that should be treated the same due
2886 to the only side effects being identical SAVE_EXPR's, that will
2887 be detected in the recursive calls below.
2888 If we are taking an invariant address of two identical objects
2889 they are necessarily equal as well. */
2896 /* Next handle constant cases, those for which we can return 1 even
2897 if ONLY_CONST is set. */
2900 {
2914 {
2915 /* If we do not distinguish between signed and unsigned zero,
2916 consider them equal. */
2919 }
2923 {
2930 {
2934 }
2936 }
2940 flags)
2942 flags));
2953 flags | OEP_ADDRESS_OF
2956 /* In GIMPLE empty constructors are allowed in initializers of
2957 aggregates. */
2961 }
2966 /* Define macros to test an operand from arg0 and arg1 for equality and a
2967 variant that allows null and views null as being different from any
2968 non-null value. In the latter case, if either is null, the both
2969 must be; otherwise, do the normal comparison. */
2970 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2971 TREE_OPERAND (arg1, N), flags)
2973 #define OP_SAME_WITH_NULL(N) \
2974 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2975 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2978 {
2980 /* Two conversions are equal only if signedness and modes match. */
2982 {
2983 CASE_CONVERT:
2991 }
3001 /* For commutative ops, allow the other order. */
3009 /* If either of the pointer (or reference) expressions we are
3010 dereferencing contain a side effect, these cannot be equal,
3011 but their addresses can be. */
3018 {
3028 /* Require the same offset. */
3034 /* Fallthru. */
3042 {
3043 /* Require equal access sizes */
3049 flags)))
3051 /* Verify that access happens in similar types. */
3054 /* Verify that accesses are TBAA compatible. */
3063 /* Verify that alignment is compatible. */
3067 }
3070 /* TARGET_MEM_REF require equal extra operands. */
3081 /* Compare the array index by value if it is constant first as we
3082 may have different types but same value here. */
3088 /* Compare low bound and element size as with OEP_ADDRESS_OF
3089 we have to account for the offset of the ref. */
3094 array_ref_low_bound
3098 array_ref_element_size
3100 flags))));
3103 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3104 may be NULL when we're called to compare MEM_EXPRs. */
3119 }
3123 {
3125 /* Be sure we pass right ADDRESS_OF flag. */
3143 /* The multiplcation operands are commutative. */
3144 /* FALLTHRU */
3152 /* Otherwise take into account this is a commutative operation. */
3171 }
3175 {
3179 /* If not both CALL_EXPRs are either internal or normal function
3180 functions, then they are not equal. */
3183 {
3184 /* If the CALL_EXPRs call different internal functions, then they
3185 are not equal. */
3188 }
3189 else
3190 {
3191 /* If the CALL_EXPRs call different functions, then they are not
3192 equal. */
3194 flags))
3196 }
3198 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3199 {
3203 else
3207 }
3209 /* Now see if all the arguments are the same. */
3210 {
3221 /* If we get here and both argument lists are exhausted
3222 then the CALL_EXPRs are equal. */
3224 }
3227 }
3230 /* Consider __builtin_sqrt equal to sqrt. */
3238 {
3239 /* In GIMPLE constructors are used only to build vectors from
3240 elements. Individual elements in the constructor must be
3241 indexed in increasing order and form an initial sequence.
3243 We make no effort to compare constructors in generic.
3244 (see sem_variable::equals in ipa-icf which can do so for
3245 constants). */
3250 /* Be sure that vectors constructed have the same representation.
3251 We only tested element precision and modes to match.
3252 Vectors may be BLKmode and thus also check that the number of
3253 parts match. */
3266 {
3271 /* In GIMPLE the indexes can be either NULL or matching i.
3272 Double check this so we won't get false
3273 positives for GENERIC. */
3281 }
3283 }
3288 }
3290 #undef OP_SAME
3291 #undef OP_SAME_WITH_NULL
3292 }
3293 \f
3294 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3295 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3297 When in doubt, return 0. */
3299 static int
3301 {
3313 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3314 and see if the inner values are the same. This removes any
3315 signedness comparison, which doesn't matter here. */
3322 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3323 actual comparison operand, ARG0.
3325 First throw away any conversions to wider types
3326 already present in the operands. */
3335 {
3338 /* Make sure shorter operand is extended the right way
3339 to match the longer operand. */
3345 }
3348 }
3349 \f
3350 /* See if ARG is an expression that is either a comparison or is performing
3351 arithmetic on comparisons. The comparisons must only be comparing
3352 two different values, which will be stored in *CVAL1 and *CVAL2; if
3353 they are nonzero it means that some operands have already been found.
3354 No variables may be used anywhere else in the expression except in the
3355 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3356 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3358 If this is true, return 1. Otherwise, return zero. */
3360 static int
3362 {
3366 /* We can handle some of the tcc_expression cases here. */
3376 {
3377 /* If we've already found a CVAL1 or CVAL2, this expression is
3378 two complex to handle. */
3384 }
3387 {
3410 /* First see if we can handle the first operand, then the second. For
3411 the second operand, we know *CVAL1 can't be zero. It must be that
3412 one side of the comparison is each of the values; test for the
3413 case where this isn't true by failing if the two operands
3414 are the same. */
3423 ;
3427 ;
3428 else
3432 ;
3436 ;
3437 else
3444 }
3445 }
3446 \f
3447 /* ARG is a tree that is known to contain just arithmetic operations and
3448 comparisons. Evaluate the operations in the tree substituting NEW0 for
3449 any occurrence of OLD0 as an operand of a comparison and likewise for
3450 NEW1 and OLD1. */
3452 static tree
3455 {
3460 /* We can handle some of the tcc_expression cases here. */
3468 {
3483 {
3502 }
3503 /* Fall through - ??? */
3506 {
3510 /* We need to check both for exact equality and tree equality. The
3511 former will be true if the operand has a side-effect. In that
3512 case, we know the operand occurred exactly once. */
3525 }
3529 }
3530 }
3531 \f
3532 /* Return a tree for the case when the result of an expression is RESULT
3533 converted to TYPE and OMITTED was previously an operand of the expression
3534 but is now not needed (e.g., we folded OMITTED * 0).
3536 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3537 the conversion of RESULT to TYPE. */
3539 tree
3541 {
3544 /* If the resulting operand is an empty statement, just return the omitted
3545 statement casted to void. */
3555 }
3557 /* Return a tree for the case when the result of an expression is RESULT
3558 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3559 of the expression but are now not needed.
3561 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3562 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3563 evaluated before OMITTED2. Otherwise, if neither has side effects,
3564 just do the conversion of RESULT to TYPE. */
3566 tree
3569 {
3578 }
3580 \f
3581 /* Return a simplified tree node for the truth-negation of ARG. This
3582 never alters ARG itself. We assume that ARG is an operation that
3583 returns a truth value (0 or 1).
3585 FIXME: one would think we would fold the result, but it causes
3586 problems with the dominator optimizer. */
3588 static tree
3590 {
3595 /* If this is a comparison, we can simply invert it, except for
3596 floating-point non-equality comparisons, in which case we just
3597 enclose a TRUTH_NOT_EXPR around what we have. */
3600 {
3603 && flag_trapping_math
3617 }
3620 {
3639 /* Here we can invert either operand. We invert the first operand
3640 unless the second operand is a TRUTH_NOT_EXPR in which case our
3641 result is the XOR of the first operand with the inside of the
3642 negation of the second operand. */
3647 else
3670 {
3677 /* A COND_EXPR may have a throw as one operand, which
3678 then has void type. Just leave void operands
3679 as they are. */
3685 }
3697 CASE_CONVERT:
3701 /* fall through */
3723 }
3724 }
3726 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3727 assume that ARG is an operation that returns a truth value (0 or 1
3728 for scalars, 0 or -1 for vectors). Return the folded expression if
3729 folding is successful. Otherwise, return NULL_TREE. */
3731 static tree
3733 {
3736 ? BIT_NOT_EXPR
3739 }
3741 /* Return a simplified tree node for the truth-negation of ARG. This
3742 never alters ARG itself. We assume that ARG is an operation that
3743 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3745 tree
3747 {
3753 ? BIT_NOT_EXPR
3756 }
3758 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3759 with code CODE. This optimization is unsafe. */
3760 static tree
3763 {
3767 /* (A / C) +- (B / C) -> (A +- B) / C. */
3777 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3782 {
3794 }
3797 }
3798 \f
3799 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3800 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
3801 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
3802 is the original memory reference used to preserve the alias set of
3803 the access. */
3805 static tree
3809 {
3819 {
3826 }
3841 }
3843 /* Optimize a bit-field compare.
3845 There are two cases: First is a compare against a constant and the
3846 second is a comparison of two items where the fields are at the same
3847 bit position relative to the start of a chunk (byte, halfword, word)
3848 large enough to contain it. In these cases we can avoid the shift
3849 implicit in bitfield extractions.
3851 For constants, we emit a compare of the shifted constant with the
3852 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3853 compared. For two fields at the same position, we do the ANDs with the
3854 similar mask and compare the result of the ANDs.
3856 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3857 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3858 are the left and right operands of the comparison, respectively.
3860 If the optimization described above can be done, we return the resulting
3861 tree. Otherwise we return zero. */
3863 static tree
3866 {
3869 tree unsigned_type;
3876 tree mask;
3877 tree offset;
3879 /* Get all the information about the extractions being done. If the bit size
3880 if the same as the size of the underlying object, we aren't doing an
3881 extraction at all and so can do nothing. We also don't want to
3882 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3883 then will no longer be able to replace it. */
3892 else
3893 {
3894 /* If this is not a constant, we can only do something if bit positions,
3895 sizes, signedness and storage order are the same. */
3896 rinner
3904 }
3906 /* Honor the C++ memory model and mimic what RTL expansion does. */
3910 {
3914 }
3916 /* See if we can find a mode to refer to this field. We should be able to,
3917 but fail if we can't. */
3926 /* Set signed and unsigned types of the precision of this mode for the
3927 shifts below. */
3930 /* Compute the bit position and size for the new reference and our offset
3931 within it. If the new reference is the same size as the original, we
3932 won't optimize anything, so return zero. */
3942 /* Make the mask to be used against the extracted field. */
3949 /* If not comparing with constant, just rework the comparison
3950 and return. */
3954 unsigned_type,
3957 mask),
3960 unsigned_type,
3963 mask));
3965 /* Otherwise, we are handling the constant case. See if the constant is too
3966 big for the field. Warn and return a tree for 0 (false) if so. We do
3967 this not only for its own sake, but to avoid having to test for this
3968 error case below. If we didn't, we might generate wrong code.
3970 For unsigned fields, the constant shifted right by the field length should
3971 be all zero. For signed fields, the high-order bits should agree with
3972 the sign bit. */
3975 {
3977 {
3981 }
3982 }
3983 else
3984 {
3987 {
3991 }
3992 }
3994 /* Single-bit compares should always be against zero. */
3996 {
3999 }
4001 /* Make a new bitfield reference, shift the constant over the
4002 appropriate number of bits and mask it with the computed mask
4003 (in case this was a signed field). If we changed it, make a new one. */
4011 mask);
4016 }
4017 \f
4018 /* Subroutine for fold_truth_andor_1: decode a field reference.
4020 If EXP is a comparison reference, we return the innermost reference.
4022 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4023 set to the starting bit number.
4025 If the innermost field can be completely contained in a mode-sized
4026 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4028 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4029 otherwise it is not changed.
4031 *PUNSIGNEDP is set to the signedness of the field.
4033 *PREVERSEP is set to the storage order of the field.
4035 *PMASK is set to the mask used. This is either contained in a
4036 BIT_AND_EXPR or derived from the width of the field.
4038 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4040 Return 0 if this is not a component reference or is one that we can't
4041 do anything with. */
4043 static tree
4048 {
4053 tree unsigned_type;
4056 /* All the optimizations using this function assume integer fields.
4057 There are problems with FP fields since the type_for_size call
4058 below can fail for, e.g., XFmode. */
4062 /* We are interested in the bare arrangement of bits, so strip everything
4063 that doesn't affect the machine mode. However, record the type of the
4064 outermost expression if it may matter below. */
4071 {
4077 }
4088 /* If the number of bits in the reference is the same as the bitsize of
4089 the outer type, then the outer type gives the signedness. Otherwise
4090 (in case of a small bitfield) the signedness is unchanged. */
4094 /* Compute the mask to access the bitfield. */
4103 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4111 }
4113 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4114 bit positions and MASK is SIGNED. */
4116 static int
4118 {
4122 /* If this function returns true when the type of the mask is
4123 UNSIGNED, then there will be errors. In particular see
4124 gcc.c-torture/execute/990326-1.c. There does not appear to be
4125 any documentation paper trail as to why this is so. But the pre
4126 wide-int worked with that restriction and it has been preserved
4127 here. */
4132 }
4134 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4135 represents the sign bit of EXP's type. If EXP represents a sign
4136 or zero extension, also test VAL against the unextended type.
4137 The return value is the (sub)expression whose sign bit is VAL,
4138 or NULL_TREE otherwise. */
4140 tree
4142 {
4144 tree t;
4146 /* Tree EXP must have an integral type. */
4151 /* Tree VAL must be an integer constant. */
4160 /* Handle extension from a narrower type. */
4166 }
4168 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4169 to be evaluated unconditionally. */
4171 static int
4173 {
4174 /* Strip any conversions that don't change the machine mode. */
4183 /* Don't regard global variables as simple. They may be
4184 allocated in ways unknown to the compiler (shared memory,
4185 #pragma weak, etc). */
4188 /* Weakrefs are not safe to be read, since they can be NULL.
4189 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4190 have DECL_WEAK flag set. */
4192 /* Loading a static variable is unduly expensive, but global
4193 registers aren't expensive. */
4195 }
4197 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4198 to be evaluated unconditionally.
4199 I addition to simple_operand_p, we assume that comparisons, conversions,
4200 and logic-not operations are simple, if their operands are simple, too. */
4202 static bool
4204 {
4224 }
4226 \f
4227 /* The following functions are subroutines to fold_range_test and allow it to
4228 try to change a logical combination of comparisons into a range test.
4230 For example, both
4231 X == 2 || X == 3 || X == 4 || X == 5
4232 and
4233 X >= 2 && X <= 5
4234 are converted to
4235 (unsigned) (X - 2) <= 3
4237 We describe each set of comparisons as being either inside or outside
4238 a range, using a variable named like IN_P, and then describe the
4239 range with a lower and upper bound. If one of the bounds is omitted,
4240 it represents either the highest or lowest value of the type.
4242 In the comments below, we represent a range by two numbers in brackets
4243 preceded by a "+" to designate being inside that range, or a "-" to
4244 designate being outside that range, so the condition can be inverted by
4245 flipping the prefix. An omitted bound is represented by a "-". For
4246 example, "- [-, 10]" means being outside the range starting at the lowest
4247 possible value and ending at 10, in other words, being greater than 10.
4248 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4249 always false.
4251 We set up things so that the missing bounds are handled in a consistent
4252 manner so neither a missing bound nor "true" and "false" need to be
4253 handled using a special case. */
4255 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4256 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4257 and UPPER1_P are nonzero if the respective argument is an upper bound
4258 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4259 must be specified for a comparison. ARG1 will be converted to ARG0's
4260 type if both are specified. */
4262 static tree
4265 {
4266 tree tem;
4270 /* If neither arg represents infinity, do the normal operation.
4271 Else, if not a comparison, return infinity. Else handle the special
4272 comparison rules. Note that most of the cases below won't occur, but
4273 are handled for consistency. */
4276 {
4281 }
4286 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4287 for neither. In real maths, we cannot assume open ended ranges are
4288 the same. But, this is computer arithmetic, where numbers are finite.
4289 We can therefore make the transformation of any unbounded range with
4290 the value Z, Z being greater than any representable number. This permits
4291 us to treat unbounded ranges as equal. */
4295 {
4316 }
4319 }
4320 \f
4321 /* Helper routine for make_range. Perform one step for it, return
4322 new expression if the loop should continue or NULL_TREE if it should
4323 stop. */
4325 tree
4329 {
4335 {
4337 /* We can only do something if the range is testing for zero. */
4346 /* We can only do something if the range is testing for zero
4347 and if the second operand is an integer constant. Note that
4348 saying something is "in" the range we make is done by
4349 complementing IN_P since it will set in the initial case of
4350 being not equal to zero; "out" is leaving it alone. */
4357 {
4378 }
4380 /* If this is an unsigned comparison, we also know that EXP is
4381 greater than or equal to zero. We base the range tests we make
4382 on that fact, so we record it here so we can parse existing
4383 range tests. We test arg0_type since often the return type
4384 of, e.g. EQ_EXPR, is boolean. */
4386 {
4390 NULL_TREE))
4395 /* If the high bound is missing, but we have a nonzero low
4396 bound, reverse the range so it goes from zero to the low bound
4397 minus 1. */
4399 {
4404 }
4405 }
4413 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4414 low and high are non-NULL, then normalize will DTRT. */
4417 {
4422 }
4424 /* (-x) IN [a,b] -> x in [-b, -a] */
4436 /* ~ X -> -X - 1 */
4445 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4446 move a constant to the other side. */
4451 /* If EXP is signed, any overflow in the computation is undefined,
4452 so we don't worry about it so long as our computations on
4453 the bounds don't overflow. For unsigned, overflow is defined
4454 and this is exactly the right thing. */
4466 normalize:
4467 /* Check for an unsigned range which has wrapped around the maximum
4468 value thus making n_high < n_low, and normalize it. */
4470 {
4476 /* If the range is of the form +/- [ x+1, x ], we won't
4477 be able to normalize it. But then, it represents the
4478 whole range or the empty set, so make it
4479 +/- [ -, - ]. */
4483 else
4485 }
4486 else
4494 CASE_CONVERT:
4512 /* If we're converting arg0 from an unsigned type, to exp,
4513 a signed type, we will be doing the comparison as unsigned.
4514 The tests above have already verified that LOW and HIGH
4515 are both positive.
4517 So we have to ensure that we will handle large unsigned
4518 values the same way that the current signed bounds treat
4519 negative values. */
4522 {
4523 tree high_positive;
4524 tree equiv_type;
4525 /* For fixed-point modes, we need to pass the saturating flag
4526 as the 2nd parameter. */
4528 equiv_type
4531 else
4532 equiv_type
4535 /* A range without an upper bound is, naturally, unbounded.
4536 Since convert would have cropped a very large value, use
4537 the max value for the destination type. */
4538 high_positive
4545 high_positive),
4548 /* If the low bound is specified, "and" the range with the
4549 range for which the original unsigned value will be
4550 positive. */
4552 {
4555 integer_zero_node),
4556 high_positive))
4560 }
4561 else
4562 {
4563 /* Otherwise, "or" the range with the range of the input
4564 that will be interpreted as negative. */
4567 integer_zero_node),
4568 high_positive))
4572 }
4573 }
4582 }
4583 }
4585 /* Given EXP, a logical expression, set the range it is testing into
4586 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4587 actually being tested. *PLOW and *PHIGH will be made of the same
4588 type as the returned expression. If EXP is not a comparison, we
4589 will most likely not be returning a useful value and range. Set
4590 *STRICT_OVERFLOW_P to true if the return value is only valid
4591 because signed overflow is undefined; otherwise, do not change
4592 *STRICT_OVERFLOW_P. */
4594 tree
4597 {
4605 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4606 and see if we can refine the range. Some of the cases below may not
4607 happen, but it doesn't seem worth worrying about this. We "continue"
4608 the outer loop when we've changed something; otherwise we "break"
4609 the switch, which will "break" the while. */
4615 {
4621 {
4629 }
4638 }
4640 /* If EXP is a constant, we can evaluate whether this is true or false. */
4642 {
4649 }
4653 }
4654 \f
4655 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4656 type, TYPE, return an expression to test if EXP is in (or out of, depending
4657 on IN_P) the range. Return 0 if the test couldn't be created. */
4659 tree
4662 {
4665 /* Disable this optimization for function pointer expressions
4666 on targets that require function pointer canonicalization. */
4673 {
4679 }
4697 {
4699 {
4703 }
4705 }
4707 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4709 {
4713 {
4715 {
4718 etype
4720 else
4723 }
4726 }
4727 }
4729 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4730 This requires wrap-around arithmetics for the type of the expression.
4731 First make sure that arithmetics in this type is valid, then make sure
4732 that it wraps around. */
4738 {
4741 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4742 for the type in question, as we rely on this here. */
4752 else
4754 }
4764 {
4766 {
4771 }
4773 }
4781 }
4782 \f
4783 /* Return the predecessor of VAL in its type, handling the infinite case. */
4785 static tree
4787 {
4793 else
4796 }
4798 /* Return the successor of VAL in its type, handling the infinite case. */
4800 static tree
4802 {
4808 else
4811 }
4813 /* Given two ranges, see if we can merge them into one. Return 1 if we
4814 can, 0 if we can't. Set the output range into the specified parameters. */
4816 bool
4819 {
4823 tree tem;
4833 /* Make range 0 be the range that starts first, or ends last if they
4834 start at the same value. Swap them if it isn't. */
4837 || (lowequal
4840 {
4844 }
4846 /* Now flag two cases, whether the ranges are disjoint or whether the
4847 second range is totally subsumed in the first. Note that the tests
4848 below are simplified by the ones above. */
4854 /* We now have four cases, depending on whether we are including or
4855 excluding the two ranges. */
4857 {
4858 /* If they don't overlap, the result is false. If the second range
4859 is a subset it is the result. Otherwise, the range is from the start
4860 of the second to the end of the first. */
4865 else
4867 }
4870 {
4871 /* If they don't overlap, the result is the first range. If they are
4872 equal, the result is false. If the second range is a subset of the
4873 first, and the ranges begin at the same place, we go from just after
4874 the end of the second range to the end of the first. If the second
4875 range is not a subset of the first, or if it is a subset and both
4876 ranges end at the same place, the range starts at the start of the
4877 first range and ends just before the second range.
4878 Otherwise, we can't describe this as a single range. */
4884 {
4889 {
4890 /* We are in the weird situation where high0 > high1 but
4891 high1 has no successor. Punt. */
4893 }
4894 }
4896 {
4901 {
4902 /* low0 < low1 but low1 has no predecessor. Punt. */
4904 }
4905 }
4906 else
4908 }
4911 {
4912 /* If they don't overlap, the result is the second range. If the second
4913 is a subset of the first, the result is false. Otherwise,
4914 the range starts just after the first range and ends at the
4915 end of the second. */
4920 else
4921 {
4926 {
4927 /* high1 > high0 but high0 has no successor. Punt. */
4929 }
4930 }
4931 }
4933 else
4934 {
4935 /* The case where we are excluding both ranges. Here the complex case
4936 is if they don't overlap. In that case, the only time we have a
4937 range is if they are adjacent. If the second is a subset of the
4938 first, the result is the first. Otherwise, the range to exclude
4939 starts at the beginning of the first range and ends at the end of the
4940 second. */
4942 {
4947 else
4948 {
4949 /* Canonicalize - [min, x] into - [-, x]. */
4952 {
4957 /* FALLTHROUGH */
4970 }
4972 /* Canonicalize - [x, max] into - [x, -]. */
4975 {
4980 /* FALLTHROUGH */
4996 }
4998 /* The ranges might be also adjacent between the maximum and
4999 minimum values of the given type. For
5000 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5001 return + [x + 1, y - 1]. */
5003 {
5010 }
5011 else
5013 }
5014 }
5017 else
5019 }
5023 }
5024 \f
5026 /* Subroutine of fold, looking inside expressions of the form
5027 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5028 of the COND_EXPR. This function is being used also to optimize
5029 A op B ? C : A, by reversing the comparison first.
5031 Return a folded expression whose code is not a COND_EXPR
5032 anymore, or NULL_TREE if no folding opportunity is found. */
5034 static tree
5037 {
5042 tree tem;
5047 /* If we have A op 0 ? A : -A, consider applying the following
5048 transformations:
5050 A == 0? A : -A same as -A
5051 A != 0? A : -A same as A
5052 A >= 0? A : -A same as abs (A)
5053 A > 0? A : -A same as abs (A)
5054 A <= 0? A : -A same as -abs (A)
5055 A < 0? A : -A same as -abs (A)
5057 None of these transformations work for modes with signed
5058 zeros. If A is +/-0, the first two transformations will
5059 change the sign of the result (from +0 to -0, or vice
5060 versa). The last four will fix the sign of the result,
5061 even though the original expressions could be positive or
5062 negative, depending on the sign of A.
5064 Note that all these transformations are correct if A is
5065 NaN, since the two alternatives (A and -A) are also NaNs. */
5072 /* In the case that A is of the form X-Y, '-A' (arg2) may
5073 have already been folded to Y-X, check for that. */
5081 {
5095 /* Fall through. */
5106 /* FALLTHRU */
5116 }
5118 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5119 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5120 both transformations are correct when A is NaN: A != 0
5121 is then true, and A == 0 is false. */
5125 {
5130 }
5132 /* Try some transformations of A op B ? A : B.
5134 A == B? A : B same as B
5135 A != B? A : B same as A
5136 A >= B? A : B same as max (A, B)
5137 A > B? A : B same as max (B, A)
5138 A <= B? A : B same as min (A, B)
5139 A < B? A : B same as min (B, A)
5141 As above, these transformations don't work in the presence
5142 of signed zeros. For example, if A and B are zeros of
5143 opposite sign, the first two transformations will change
5144 the sign of the result. In the last four, the original
5145 expressions give different results for (A=+0, B=-0) and
5146 (A=-0, B=+0), but the transformed expressions do not.
5148 The first two transformations are correct if either A or B
5149 is a NaN. In the first transformation, the condition will
5150 be false, and B will indeed be chosen. In the case of the
5151 second transformation, the condition A != B will be true,
5152 and A will be chosen.
5154 The conversions to max() and min() are not correct if B is
5155 a number and A is not. The conditions in the original
5156 expressions will be false, so all four give B. The min()
5157 and max() versions would give a NaN instead. */
5160 /* Avoid these transformations if the COND_EXPR may be used
5161 as an lvalue in the C++ front-end. PR c++/19199. */
5162 && (in_gimple_form
5168 {
5173 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
5175 {
5179 }
5182 {
5191 /* In C++ a ?: expression can be an lvalue, so put the
5192 operand which will be used if they are equal first
5193 so that we can convert this back to the
5194 corresponding COND_EXPR. */
5196 {
5205 }
5212 {
5221 }
5236 }
5237 }
5239 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5240 we might still be able to simplify this. For example,
5241 if C1 is one less or one more than C2, this might have started
5242 out as a MIN or MAX and been transformed by this function.
5243 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5249 {
5253 /* We can replace A with C1 in this case. */
5258 /* If C1 is C2 + 1, this is min(A, C2), but use ARG00's type for
5259 MIN_EXPR, to preserve the signedness of the comparison. */
5261 OEP_ONLY_CONST)
5265 OEP_ONLY_CONST))
5266 {
5269 arg2));
5272 }
5276 /* If C1 is C2 - 1, this is min(A, C2), with the same care
5277 as above. */
5279 OEP_ONLY_CONST)
5283 OEP_ONLY_CONST))
5284 {
5287 arg2));
5290 }
5294 /* If C1 is C2 - 1, this is max(A, C2), but use ARG00's type for
5295 MAX_EXPR, to preserve the signedness of the comparison. */
5297 OEP_ONLY_CONST)
5301 OEP_ONLY_CONST))
5302 {
5305 arg2));
5307 }
5311 /* If C1 is C2 + 1, this is max(A, C2), with the same care as above. */
5313 OEP_ONLY_CONST)
5317 OEP_ONLY_CONST))
5318 {
5321 arg2));
5323 }
5329 }
5332 }
5335 \f
5336 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5337 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5338 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5339 false) >= 2)
5340 #endif
5342 /* EXP is some logical combination of boolean tests. See if we can
5343 merge it into some range test. Return the new tree if so. */
5345 static tree
5348 {
5364 /* If this is an OR operation, invert both sides; we will invert
5365 again at the end. */
5369 /* If both expressions are the same, if we can merge the ranges, and we
5370 can build the range test, return it or it inverted. If one of the
5371 ranges is always true or always false, consider it to be the same
5372 expression as the other. */
5380 {
5384 }
5386 /* On machines where the branch cost is expensive, if this is a
5387 short-circuited branch and the underlying object on both sides
5388 is the same, make a non-short-circuit operation. */
5394 {
5395 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5396 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5397 which cases we can't do this. */
5405 {
5414 {
5417 WARN_STRICT_OVERFLOW_COMPARISON);
5421 }
5422 }
5423 }
5426 }
5427 \f
5428 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5429 bit value. Arrange things so the extra bits will be set to zero if and
5430 only if C is signed-extended to its full width. If MASK is nonzero,
5431 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5433 static tree
5435 {
5438 tree temp;
5443 /* We work by getting just the sign bit into the low-order bit, then
5444 into the high-order bit, then sign-extend. We then XOR that value
5445 with C. */
5448 /* We must use a signed type in order to get an arithmetic right shift.
5449 However, we must also avoid introducing accidental overflows, so that
5450 a subsequent call to integer_zerop will work. Hence we must
5451 do the type conversion here. At this point, the constant is either
5452 zero or one, and the conversion to a signed type can never overflow.
5453 We could get an overflow if this conversion is done anywhere else. */
5462 /* If necessary, convert the type back to match the type of C. */
5467 }
5468 \f
5469 /* For an expression that has the form
5470 (A && B) || ~B
5471 or
5472 (A || B) && ~B,
5473 we can drop one of the inner expressions and simplify to
5474 A || ~B
5475 or
5476 A && ~B
5477 LOC is the location of the resulting expression. OP is the inner
5478 logical operation; the left-hand side in the examples above, while CMPOP
5479 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5480 removing a condition that guards another, as in
5481 (A != NULL && A->...) || A == NULL
5482 which we must not transform. If RHS_ONLY is true, only eliminate the
5483 right-most operand of the inner logical operation. */
5485 static tree
5488 {
5506 {
5509 {
5512 }
5513 }
5515 {
5518 {
5521 }
5522 }
5537 }
5539 /* Find ways of folding logical expressions of LHS and RHS:
5540 Try to merge two comparisons to the same innermost item.
5541 Look for range tests like "ch >= '0' && ch <= '9'".
5542 Look for combinations of simple terms on machines with expensive branches
5543 and evaluate the RHS unconditionally.
5545 For example, if we have p->a == 2 && p->b == 4 and we can make an
5546 object large enough to span both A and B, we can do this with a comparison
5547 against the object ANDed with the a mask.
5549 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5550 operations to do this with one comparison.
5552 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5553 function and the one above.
5555 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5556 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5558 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5559 two operands.
5561 We return the simplified tree or 0 if no optimization is possible. */
5563 static tree
5566 {
5567 /* If this is the "or" of two comparisons, we can do something if
5568 the comparisons are NE_EXPR. If this is the "and", we can do something
5569 if the comparisons are EQ_EXPR. I.e.,
5570 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5572 WANTED_CODE is this operation code. For single bit fields, we can
5573 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5574 comparison for one-bit fields. */
5595 /* Start by getting the comparison codes. Fail if anything is volatile.
5596 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5597 it were surrounded with a NE_EXPR. */
5606 {
5610 }
5613 {
5617 }
5628 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5631 {
5634 {
5639 }
5642 {
5648 }
5649 }
5654 /* If the RHS can be evaluated unconditionally and its operands are
5655 simple, it wins to evaluate the RHS unconditionally on machines
5656 with expensive branches. In this case, this isn't a comparison
5657 that can be merged. */
5664 {
5665 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5676 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5686 }
5688 /* See if the comparisons can be merged. Then get all the parameters for
5689 each side. */
5714 /* It must be true that the inner operation on the lhs of each
5715 comparison must be the same if we are to be able to do anything.
5716 Then see if we have constants. If not, the same must be true for
5717 the rhs's. */
5726 {
5729 }
5734 else
5737 /* If either comparison code is not correct for our logical operation,
5738 fail. However, we can convert a one-bit comparison against zero into
5739 the opposite comparison against that bit being set in the field. */
5743 {
5745 {
5746 /* Make the left operand unsigned, since we are only interested
5747 in the value of one bit. Otherwise we are doing the wrong
5748 thing below. */
5751 }
5752 else
5754 }
5756 /* This is analogous to the code for l_const above. */
5758 {
5760 {
5763 }
5764 else
5766 }
5768 /* See if we can find a mode that contains both fields being compared on
5769 the left. If we can't, fail. Otherwise, update all constants and masks
5770 to be relative to a field of that size. */
5775 volatilep);
5785 {
5788 }
5796 {
5803 {
5807 }
5808 }
5810 {
5817 {
5821 }
5822 }
5824 /* If the right sides are not constant, do the same for it. Also,
5825 disallow this optimization if a size or signedness mismatch occurs
5826 between the left and right sides. */
5828 {
5831 /* Make sure the two fields on the right
5832 correspond to the left without being swapped. */
5840 volatilep);
5850 {
5853 }
5862 /* Make a mask that corresponds to both fields being compared.
5863 Do this for both items being compared. If the operands are the
5864 same size and the bits being compared are in the same position
5865 then we can do this by masking both and comparing the masked
5866 results. */
5870 {
5884 }
5886 /* There is still another way we can do something: If both pairs of
5887 fields being compared are adjacent, we may be able to make a wider
5888 field containing them both.
5890 Note that we still must mask the lhs/rhs expressions. Furthermore,
5891 the mask must be shifted to account for the shift done by
5892 make_bit_field_ref. */
5897 {
5898 tree type;
5914 /* Convert to the smaller type before masking out unwanted bits. */
5917 {
5919 {
5923 }
5925 {
5929 }
5930 }
5939 }
5942 }
5944 /* Handle the case of comparisons with constants. If there is something in
5945 common between the masks, those bits of the constants must be the same.
5946 If not, the condition is always false. Test for this to avoid generating
5947 incorrect code below. */
5952 {
5954 {
5957 }
5958 else
5959 {
5962 }
5963 }
5965 /* Construct the expression we will return. First get the component
5966 reference we will make. Unless the mask is all ones the width of
5967 that field, perform the mask operation. Then compare with the
5968 merged constant. */
5979 }
5980 \f
5981 /* T is an integer expression that is being multiplied, divided, or taken a
5982 modulus (CODE says which and what kind of divide or modulus) by a
5983 constant C. See if we can eliminate that operation by folding it with
5984 other operations already in T. WIDE_TYPE, if non-null, is a type that
5985 should be used for the computation if wider than our type.
5987 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5988 (X * 2) + (Y * 4). We must, however, be assured that either the original
5989 expression would not overflow or that overflow is undefined for the type
5990 in the language in question.
5992 If we return a non-null expression, it is an equivalent form of the
5993 original computation, but need not be in the original type.
5995 We set *STRICT_OVERFLOW_P to true if the return values depends on
5996 signed overflow being undefined. Otherwise we do not change
5997 *STRICT_OVERFLOW_P. */
5999 static tree
6002 {
6003 /* To avoid exponential search depth, refuse to allow recursion past
6004 three levels. Beyond that (1) it's highly unlikely that we'll find
6005 something interesting and (2) we've probably processed it before
6006 when we built the inner expression. */
6009 tree ret;
6014 depth++;
6016 depth--;
6019 }
6021 static tree
6024 {
6035 /* Don't deal with constants of zero here; they confuse the code below. */
6045 /* Note that we need not handle conditional operations here since fold
6046 already handles those cases. So just do arithmetic here. */
6048 {
6050 /* For a constant, we can always simplify if we are a multiply
6051 or (for divide and modulus) if it is a multiple of our constant. */
6054 {
6057 /* If the multiplication overflowed, we lost information on it.
6058 See PR68142 and PR69845. */
6062 }
6066 /* If op0 is an expression ... */
6072 /* ... and has wrapping overflow, and its type is smaller
6073 than ctype, then we cannot pass through as widening. */
6078 /* ... or this is a truncation (t is narrower than op0),
6079 then we cannot pass through this narrowing. */
6082 /* ... or signedness changes for division or modulus,
6083 then we cannot pass through this conversion. */
6087 /* ... or has undefined overflow while the converted to
6088 type has not, we cannot do the operation in the inner type
6089 as that would introduce undefined overflow. */
6095 /* Pass the constant down and see if we can make a simplification. If
6096 we can, replace this expression with the inner simplification for
6097 possible later conversion to our or some other type. */
6102 code == MULT_EXPR
6104 strict_overflow_p))))
6109 /* If widening the type changes it from signed to unsigned, then we
6110 must avoid building ABS_EXPR itself as unsigned. */
6112 {
6116 {
6119 }
6121 }
6122 /* If the constant is negative, we cannot simplify this. */
6125 /* FALLTHROUGH */
6127 /* For division and modulus, type can't be unsigned, as e.g.
6128 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6129 For signed types, even with wrapping overflow, this is fine. */
6138 /* If widening the type changes the signedness, then we can't perform
6139 this optimization as that changes the result. */
6143 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6149 {
6156 }
6160 /* If the second operand is constant, this is a multiplication
6161 or floor division, by a power of two, so we can treat it that
6162 way unless the multiplier or divisor overflows. Signed
6163 left-shift overflow is implementation-defined rather than
6164 undefined in C90, so do not convert signed left shift into
6165 multiplication. */
6168 /* const_binop may not detect overflow correctly,
6169 so check for it explicitly here. */
6173 size_one_node,
6174 op1)))
6178 ctype,
6180 t1),
6185 /* See if we can eliminate the operation on both sides. If we can, we
6186 can return a new PLUS or MINUS. If we can't, the only remaining
6187 cases where we can do anything are if the second operand is a
6188 constant. */
6194 /* If not multiplication, we can only do this if both operands
6195 are divisible by c. */
6198 {
6203 }
6205 /* If this was a subtraction, negate OP1 and set it to be an addition.
6206 This simplifies the logic below. */
6208 {
6210 /* If OP1 was not easily negatable, the constant may be OP0. */
6212 {
6215 }
6216 }
6221 /* If either OP1 or C are negative, this optimization is not safe for
6222 some of the division and remainder types while for others we need
6223 to change the code. */
6225 {
6233 }
6235 /* If it's a multiply or a division/modulus operation of a multiple
6236 of our constant, do the operation and verify it doesn't overflow. */
6239 {
6242 /* We allow the constant to overflow with wrapping semantics. */
6246 }
6247 else
6250 /* If we have an unsigned type, we cannot widen the operation since it
6251 will change the result if the original computation overflowed. */
6255 /* If we were able to eliminate our operation from the first side,
6256 apply our operation to the second side and reform the PLUS. */
6260 /* The last case is if we are a multiply. In that case, we can
6261 apply the distributive law to commute the multiply and addition
6262 if the multiplication of the constants doesn't overflow
6263 and overflow is defined. With undefined overflow
6264 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6270 op1);
6275 /* We have a special case here if we are doing something like
6276 (C * 8) % 4 since we know that's zero. */
6279 /* If the multiplication can overflow we cannot optimize this. */
6283 {
6286 }
6288 /* ... fall through ... */
6292 /* If we can extract our operation from the LHS, do so and return a
6293 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6294 do something only if the second operand is a constant. */
6308 /* If these are the same operation types, we can associate them
6309 assuming no overflow. */
6311 {
6326 }
6328 /* If these operations "cancel" each other, we have the main
6329 optimizations of this pass, which occur when either constant is a
6330 multiple of the other, in which case we replace this with either an
6331 operation or CODE or TCODE.
6333 If we have an unsigned type, we cannot do this since it will change
6334 the result if the original computation overflowed. */
6341 {
6343 {
6350 }
6352 {
6359 }
6360 }
6365 }
6368 }
6369 \f
6370 /* Return a node which has the indicated constant VALUE (either 0 or
6371 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6372 and is of the indicated TYPE. */
6374 tree
6376 {
6385 else
6387 }
6390 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6391 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6392 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6393 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6394 COND is the first argument to CODE; otherwise (as in the example
6395 given here), it is the second argument. TYPE is the type of the
6396 original expression. Return NULL_TREE if no simplification is
6397 possible. */
6399 static tree
6404 {
6414 {
6418 /* If this operand throws an expression, then it does not make
6419 sense to try to perform a logical or arithmetic operation
6420 involving it. */
6425 }
6428 {
6433 }
6434 else
6435 /* Detect the case of mixing vector and scalar types - bail out. */
6441 /* This transformation is only worthwhile if we don't have to wrap ARG
6442 in a SAVE_EXPR and the operation can be simplified without recursing
6443 on at least one of the branches once its pushed inside the COND_EXPR. */
6452 {
6456 else
6458 }
6460 {
6464 else
6466 }
6468 /* Check that we have simplified at least one of the branches. */
6473 }
6475 \f
6476 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6478 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6479 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6480 ADDEND is the same as X.
6482 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6483 and finite. The problematic cases are when X is zero, and its mode
6484 has signed zeros. In the case of rounding towards -infinity,
6485 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6486 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6488 bool
6490 {
6494 /* Don't allow the fold with -fsignaling-nans. */
6498 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6502 /* In a vector or complex, we would need to check the sign of all zeros. */
6506 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6510 /* The mode has signed zeros, and we have to honor their sign.
6511 In this situation, there is only one case we can return true for.
6512 X - 0 is the same as X unless rounding towards -infinity is
6513 supported. */
6515 }
6517 /* Subroutine of fold() that optimizes comparisons of a division by
6518 a nonzero integer constant against an integer constant, i.e.
6519 X/C1 op C2.
6521 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6522 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6523 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6525 The function returns the constant folded tree if a simplification
6526 can be made, and NULL_TREE otherwise. */
6528 static tree
6531 {
6539 /* We have to do this the hard way to detect unsigned overflow.
6540 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6546 {
6551 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6555 }
6557 {
6561 {
6580 }
6581 }
6582 else
6583 {
6584 /* A negative divisor reverses the relational operators. */
6590 {
6609 }
6610 }
6613 {
6634 {
6637 }
6642 {
6645 }
6650 {
6653 }
6658 {
6661 }
6666 }
6669 }
6672 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6673 equality/inequality test, then return a simplified form of the test
6674 using a sign testing. Otherwise return NULL. TYPE is the desired
6675 result type. */
6677 static tree
6680 tree result_type)
6681 {
6682 /* If this is testing a single bit, we can optimize the test. */
6686 {
6687 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6688 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6692 /* This is only a win if casting to a signed type is cheap,
6693 i.e. when arg00's type is not a partial mode. */
6696 {
6699 result_type,
6702 }
6703 }
6706 }
6708 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6709 equality/inequality test, then return a simplified form of
6710 the test using shifts and logical operations. Otherwise return
6711 NULL. TYPE is the desired result type. */
6713 tree
6716 {
6717 /* If this is testing a single bit, we can optimize the test. */
6721 {
6730 /* First, see if we can fold the single bit test into a sign-bit
6731 test. */
6733 result_type);
6737 /* Otherwise we have (A & C) != 0 where C is a single bit,
6738 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6739 Similarly for (A & C) == 0. */
6741 /* If INNER is a right shift of a constant and it plus BITNUM does
6742 not overflow, adjust BITNUM and INNER. */
6748 {
6751 }
6753 /* If we are going to be able to omit the AND below, we must do our
6754 operations as unsigned. If we must use the AND, we have a choice.
6755 Normally unsigned is faster, but for some machines signed is. */
6773 /* Put the AND last so it can combine with more things. */
6776 /* Make sure to return the proper type. */
6780 }
6782 }
6784 /* Check whether we are allowed to reorder operands arg0 and arg1,
6785 such that the evaluation of arg1 occurs before arg0. */
6787 static bool
6789 {
6796 }
6798 /* Test whether it is preferable two swap two operands, ARG0 and
6799 ARG1, for example because ARG0 is an integer constant and ARG1
6800 isn't. If REORDER is true, only recommend swapping if we can
6801 evaluate the operands in reverse order. */
6803 bool
6805 {
6823 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6824 for commutative and comparison operators. Ensuring a canonical
6825 form allows the optimizers to find additional redundancies without
6826 having to explicitly check for both orderings. */
6832 /* Put SSA_NAMEs last. */
6838 /* Put variables last. */
6845 }
6848 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6849 means A >= Y && A != MAX, but in this case we know that
6850 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6852 static tree
6854 {
6861 else
6870 {
6873 }
6875 {
6878 }
6879 else
6886 {
6887 /* Convert the pointer types into integer before taking the difference. */
6891 }
6892 else
6899 }
6901 /* Fold a sum or difference of at least one multiplication.
6902 Returns the folded tree or NULL if no simplification could be made. */
6904 static tree
6907 {
6911 /* (A * C) +- (B * C) -> (A+-B) * C.
6912 (A * C) +- A -> A * (C+-1).
6913 We are most concerned about the case where C is a constant,
6914 but other combinations show up during loop reduction. Since
6915 it is not difficult, try all four possibilities. */
6918 {
6921 }
6923 {
6926 }
6927 else
6928 {
6929 /* We cannot generate constant 1 for fract. */
6934 }
6936 {
6939 }
6941 {
6943 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
6944 the purpose of this canonicalization. */
6948 {
6951 }
6952 else
6954 }
6955 else
6956 {
6957 /* We cannot generate constant 1 for fract. */
6962 }
6974 /* No identical multiplicands; see if we can find a common
6975 power-of-two factor in non-power-of-two multiplies. This
6976 can help in multi-dimensional array access. */
6979 {
6982 tree maybe_same;
6986 /* Move min of absolute values to int11. */
6988 {
6993 }
6994 else
6998 /* The remainder should not be a constant, otherwise we
6999 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7000 increased the number of multiplications necessary. */
7002 {
7010 }
7011 }
7021 }
7023 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7024 specified by EXPR into the buffer PTR of length LEN bytes.
7025 Return the number of bytes placed in the buffer, or zero
7026 upon failure. */
7028 static int
7030 {
7044 {
7046 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7047 number of bytes. */
7051 {
7058 else
7060 }
7061 else
7066 }
7068 }
7071 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7072 specified by EXPR into the buffer PTR of length LEN bytes.
7073 Return the number of bytes placed in the buffer, or zero
7074 upon failure. */
7076 static int
7078 {
7082 FIXED_VALUE_TYPE value;
7098 }
7101 /* Subroutine of native_encode_expr. Encode the REAL_CST
7102 specified by EXPR into the buffer PTR of length LEN bytes.
7103 Return the number of bytes placed in the buffer, or zero
7104 upon failure. */
7106 static int
7108 {
7114 /* There are always 32 bits in each long, no matter the size of
7115 the hosts long. We handle floating point representations with
7116 up to 192 bits. */
7130 {
7135 {
7142 else
7144 }
7145 else
7146 {
7149 {
7150 /* Reverse bytes within each long, or within the entire float
7151 if it's smaller than a long (for HFmode). */
7154 }
7155 }
7160 }
7162 }
7164 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7165 specified by EXPR into the buffer PTR of length LEN bytes.
7166 Return the number of bytes placed in the buffer, or zero
7167 upon failure. */
7169 static int
7171 {
7173 tree part;
7188 }
7191 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7192 specified by EXPR into the buffer PTR of length LEN bytes.
7193 Return the number of bytes placed in the buffer, or zero
7194 upon failure. */
7196 static int
7198 {
7208 {
7210 {
7213 }
7224 }
7226 }
7229 /* Subroutine of native_encode_expr. Encode the STRING_CST
7230 specified by EXPR into the buffer PTR of length LEN bytes.
7231 Return the number of bytes placed in the buffer, or zero
7232 upon failure. */
7234 static int
7236 {
7238 HOST_WIDE_INT total_bytes;
7252 {
7255 {
7258 }
7261 }
7262 else
7265 }
7268 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7269 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7270 buffer PTR of length LEN bytes. If OFF is not -1 then start
7271 the encoding at byte offset OFF and encode at most LEN bytes.
7272 Return the number of bytes placed in the buffer, or zero upon failure. */
7274 int
7276 {
7277 /* We don't support starting at negative offset and -1 is special. */
7282 {
7303 }
7304 }
7307 /* Subroutine of native_interpret_expr. Interpret the contents of
7308 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7309 If the buffer cannot be interpreted, return NULL_TREE. */
7311 static tree
7313 {
7323 }
7326 /* Subroutine of native_interpret_expr. Interpret the contents of
7327 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7328 If the buffer cannot be interpreted, return NULL_TREE. */
7330 static tree
7332 {
7334 double_int result;
7335 FIXED_VALUE_TYPE fixed_value;
7345 }
7348 /* Subroutine of native_interpret_expr. Interpret the contents of
7349 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7350 If the buffer cannot be interpreted, return NULL_TREE. */
7352 static tree
7354 {
7358 /* There are always 32 bits in each long, no matter the size of
7359 the hosts long. We handle floating point representations with
7360 up to 192 bits. */
7361 REAL_VALUE_TYPE r;
7372 {
7373 /* Both OFFSET and BYTE index within a long;
7374 bitpos indexes the whole float. */
7377 {
7384 else
7386 }
7387 else
7388 {
7391 {
7392 /* Reverse bytes within each long, or within the entire float
7393 if it's smaller than a long (for HFmode). */
7396 }
7397 }
7401 }
7405 }
7408 /* Subroutine of native_interpret_expr. Interpret the contents of
7409 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7410 If the buffer cannot be interpreted, return NULL_TREE. */
7412 static tree
7414 {
7429 }
7432 /* Subroutine of native_interpret_expr. Interpret the contents of
7433 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7434 If the buffer cannot be interpreted, return NULL_TREE. */
7436 static tree
7438 {
7451 {
7456 }
7458 }
7461 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7462 the buffer PTR of length LEN as a constant of type TYPE. For
7463 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7464 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7465 return NULL_TREE. */
7467 tree
7469 {
7471 {
7493 }
7494 }
7496 /* Returns true if we can interpret the contents of a native encoding
7497 as TYPE. */
7499 static bool
7501 {
7503 {
7516 }
7517 }
7519 /* Return true iff a constant of type TYPE is accepted by
7520 native_encode_expr. */
7522 bool
7524 {
7526 {
7536 }
7537 }
7539 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7540 TYPE at compile-time. If we're unable to perform the conversion
7541 return NULL_TREE. */
7543 static tree
7545 {
7546 /* We support up to 512-bit values (for V8DFmode). */
7550 /* Check that the host and target are sane. */
7559 }
7561 /* Build an expression for the address of T. Folds away INDIRECT_REF
7562 to avoid confusing the gimplify process. */
7564 tree
7566 {
7567 /* The size of the object is not relevant when talking about its address. */
7572 {
7577 }
7587 {
7592 }
7593 else
7597 }
7599 /* Build an expression for the address of T. */
7601 tree
7603 {
7607 }
7609 /* Fold a unary expression of code CODE and type TYPE with operand
7610 OP0. Return the folded expression if folding is successful.
7611 Otherwise, return NULL_TREE. */
7613 tree
7615 {
7616 tree tem;
7617 tree arg0;
7625 {
7628 {
7629 /* Don't use STRIP_NOPS, because signedness of argument type
7630 matters. */
7632 }
7633 else
7634 {
7635 /* Strip any conversions that don't change the mode. This
7636 is safe for every expression, except for a comparison
7637 expression because its signedness is derived from its
7638 operands.
7640 Note that this is done as an internal manipulation within
7641 the constant folder, in order to find the simplest
7642 representation of the arguments so that their form can be
7643 studied. In any cases, the appropriate type conversions
7644 should be put back in the tree that will get out of the
7645 constant folder. */
7647 }
7650 {
7653 {
7657 }
7658 }
7659 }
7666 {
7673 {
7687 /* If this was a conversion, and all we did was to move into
7688 inside the COND_EXPR, bring it back out. But leave it if
7689 it is a conversion from integer to integer and the
7690 result precision is no wider than a word since such a
7691 conversion is cheap and may be optimized away by combine,
7692 while it couldn't if it were outside the COND_EXPR. Then return
7693 so we don't get into an infinite recursion loop taking the
7694 conversion out and then back in. */
7706 && (INTEGRAL_TYPE_P
7719 }
7720 }
7723 {
7729 CASE_CONVERT:
7733 {
7734 /* If we have (type) (a CMP b) and type is an integral type, return
7735 new expression involving the new type. Canonicalize
7736 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7737 non-integral type.
7738 Do not fold the result as that would not simplify further, also
7739 folding again results in recursions. */
7749 }
7751 /* Handle (T *)&A.B.C for A being of type T and B and C
7752 living at offset zero. This occurs frequently in
7753 C++ upcasting and then accessing the base. */
7757 {
7759 tree offset;
7760 machine_mode mode;
7762 tree base
7766 /* If the reference was to a (constant) zero offset, we can use
7767 the address of the base if it has the same base type
7768 as the result type and the pointer type is unqualified. */
7775 }
7779 /* Detect assigning a bitfield. */
7781 && DECL_BIT_FIELD
7783 {
7784 /* Don't leave an assignment inside a conversion
7785 unless assigning a bitfield. */
7787 /* First do the assignment, then return converted constant. */
7792 }
7794 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7795 constants (if x has signed type, the sign bit cannot be set
7796 in c). This folds extension into the BIT_AND_EXPR.
7797 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7798 very likely don't have maximal range for their precision and this
7799 transformation effectively doesn't preserve non-maximal ranges. */
7803 {
7814 <= HOST_BITS_PER_WIDE_INT
7816 {
7820 cst &= HOST_WIDE_INT_M1U
7824 && !flag_syntax_only
7827 {
7831 }
7832 }
7834 {
7839 }
7840 }
7842 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
7843 cast (T1)X will fold away. We assume that this happens when X itself
7844 is a cast. */
7848 {
7852 return fold_build_pointer_plus_loc
7854 }
7856 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7857 of the same precision, and X is an integer type not narrower than
7858 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7864 {
7870 }
7872 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7873 type of X and Y (integer types only). */
7878 {
7879 /* Be careful not to introduce new overflows. */
7880 tree mult_type;
7883 else
7887 {
7894 }
7895 }
7901 {
7908 }
7919 /* Convert fabs((double)float) into (double)fabsf(float). */
7922 {
7928 targ0));
7929 }
7933 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
7952 /* Note that the operand of this must be an int
7953 and its values must be 0 or 1.
7954 ("true" is a fixed value perhaps depending on the language,
7955 but we don't handle values other than 1 correctly yet.) */
7962 /* Fold *&X to X if X is an lvalue. */
7964 {
7971 }
7977 }
7980 /* If the operation was a conversion do _not_ mark a resulting constant
7981 with TREE_OVERFLOW if the original constant was not. These conversions
7982 have implementation defined behavior and retaining the TREE_OVERFLOW
7983 flag here would confuse later passes such as VRP. */
7984 tree
7987 {
7996 }
7998 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
7999 operands OP0 and OP1. LOC is the location of the resulting expression.
8000 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8001 Return the folded expression if folding is successful. Otherwise,
8002 return NULL_TREE. */
8003 static tree
8006 {
8007 tree tem;
8009 /* We only do these simplifications if we are optimizing. */
8013 /* Check for things like (A || B) && (A || C). We can convert this
8014 to A || (B && C). Note that either operator can be any of the four
8015 truth and/or operations and the transformation will still be
8016 valid. Also note that we only care about order for the
8017 ANDIF and ORIF operators. If B contains side effects, this
8018 might change the truth-value of A. */
8025 {
8045 /* This case if tricky because we must either have commutative
8046 operators or else A10 must not have side-effects. */
8052 a01);
8053 }
8055 /* See if we can build a range comparison. */
8061 {
8065 }
8069 {
8073 }
8075 /* Check for the possibility of merging component references. If our
8076 lhs is another similar operation, try to merge its rhs with our
8077 rhs. Then try to merge our lhs and rhs. */
8091 {
8098 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8099 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8100 We don't want to pack more than two leafs to a non-IF AND/OR
8101 expression.
8102 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8103 equal to IF-CODE, then we don't want to add right-hand operand.
8104 If the inner right-hand side of left-hand operand has
8105 side-effects, or isn't simple, then we can't add to it,
8106 as otherwise we might destroy if-sequence. */
8109 /* Needed for sequence points to handle trappings, and
8110 side-effects. */
8112 {
8114 arg1);
8116 tem);
8117 }
8118 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8119 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8122 /* Needed for sequence points to handle trappings, and
8123 side-effects. */
8125 {
8130 }
8131 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8132 into (A OR B).
8133 For sequence point consistancy, we need to check for trapping,
8134 and side-effects. */
8138 }
8141 }
8143 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8144 by changing CODE to reduce the magnitude of constants involved in
8145 ARG0 of the comparison.
8146 Returns a canonicalized comparison tree if a simplification was
8147 possible, otherwise returns NULL_TREE.
8148 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8149 valid if signed overflow is undefined. */
8151 static tree
8155 {
8160 /* Match A +- CST code arg1. We can change this only if overflow
8161 is undefined. */
8164 /* In principle pointers also have undefined overflow behavior,
8165 but that causes problems elsewhere. */
8172 /* Identify the constant in arg0 and its sign. */
8176 /* Overflowed constants and zero will cause problems. */
8181 /* See if we can reduce the magnitude of the constant in
8182 arg0 by changing the comparison code. */
8183 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8187 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8191 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8195 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8199 else
8203 /* Now build the constant reduced in magnitude. But not if that
8204 would produce one outside of its types range. */
8220 }
8222 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8223 overflow further. Try to decrease the magnitude of constants involved
8224 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8225 and put sole constants at the second argument position.
8226 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8228 static tree
8231 {
8232 tree t;
8237 /* Try canonicalization by simplifying arg0. */
8242 {
8246 }
8248 /* Try canonicalization by simplifying arg1 using the swapped
8249 comparison. */
8257 }
8259 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8260 space. This is used to avoid issuing overflow warnings for
8261 expressions like &p->x which can not wrap. */
8263 static bool
8265 {
8272 wide_int wi_offset;
8278 else
8294 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8295 array. */
8297 {
8298 HOST_WIDE_INT base_size;
8303 }
8306 }
8308 /* Return a positive integer when the symbol DECL is known to have
8309 a nonzero address, zero when it's known not to (e.g., it's a weak
8310 symbol), and a negative integer when the symbol is not yet in the
8311 symbol table and so whether or not its address is zero is unknown. */
8312 static int
8314 {
8320 }
8322 /* Subroutine of fold_binary. This routine performs all of the
8323 transformations that are common to the equality/inequality
8324 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8325 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8326 fold_binary should call fold_binary. Fold a comparison with
8327 tree code CODE and type TYPE with operands OP0 and OP1. Return
8328 the folded comparison or NULL_TREE. */
8330 static tree
8333 {
8343 /* For comparisons of pointers we can decompose it to a compile time
8344 comparison of the base objects and the offsets into the object.
8345 This requires at least one operand being an ADDR_EXPR or a
8346 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8352 {
8355 machine_mode mode;
8359 /* Get base and offset for the access. Strip ADDR_EXPR for
8360 get_inner_reference, but put it back by stripping INDIRECT_REF
8361 off the base object if possible. indirect_baseN will be true
8362 if baseN is not an address but refers to the object itself. */
8365 {
8366 base0
8372 else
8374 }
8376 {
8380 {
8381 base0
8387 else
8389 }
8392 else
8396 {
8402 {
8405 }
8406 }
8407 }
8411 {
8412 base1
8418 else
8420 }
8422 {
8426 {
8427 base1
8433 else
8435 }
8438 else
8442 {
8448 {
8451 }
8452 }
8453 }
8455 /* If we have equivalent bases we might be able to simplify. */
8459 {
8460 /* We can fold this expression to a constant if the non-constant
8461 offset parts are equal. */
8465 && (equality_code
8466 || (indirect_base0
8470 {
8476 "occur when comparing P +- C1 with "
8478 WARN_STRICT_OVERFLOW_CONDITIONAL);
8481 {
8495 }
8496 }
8497 /* We can simplify the comparison to a comparison of the variable
8498 offset parts if the constant offset parts are equal.
8499 Be careful to use signed sizetype here because otherwise we
8500 mess with array offsets in the wrong way. This is possible
8501 because pointer arithmetic is restricted to retain within an
8502 object and overflow on pointer differences is undefined as of
8503 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8505 && (equality_code
8506 || (indirect_base0
8509 {
8510 /* By converting to signed sizetype we cover middle-end pointer
8511 arithmetic which operates on unsigned pointer types of size
8512 type size and ARRAY_REF offsets which are properly sign or
8513 zero extended from their type in case it is narrower than
8514 sizetype. */
8517 else
8521 else
8528 "occur when comparing P +- C1 with "
8530 WARN_STRICT_OVERFLOW_COMPARISON);
8533 }
8534 }
8535 /* For equal offsets we can simplify to a comparison of the
8536 base addresses. */
8538 && (indirect_base0
8540 && (indirect_base1
8545 {
8551 }
8552 /* Comparison between an ordinary (non-weak) symbol and a null
8553 pointer can be eliminated since such symbols must have a non
8554 null address. In C, relational expressions between pointers
8555 to objects and null pointers are undefined. The results
8556 below follow the C++ rules with the additional property that
8557 every object pointer compares greater than a null pointer.
8558 */
8561 /* Avoid folding references to struct members at offset 0 to
8562 prevent tests like '&ptr->firstmember == 0' from getting
8563 eliminated. When ptr is null, although the -> expression
8564 is strictly speaking invalid, GCC retains it as a matter
8565 of QoI. See PR c/44555. */
8567 /* The caller guarantees that when one of the arguments is
8568 constant (i.e., null in this case) it is second. */
8570 {
8572 {
8583 }
8584 }
8585 }
8587 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8588 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8589 the resulting offset is smaller in absolute value than the
8590 original one and has the same sign. */
8599 {
8604 tree cst;
8606 "occur when combining constants around "
8609 /* Put the constant on the side where it doesn't overflow and is
8610 of lower absolute value and of same sign than before. */
8617 {
8620 variable1,
8624 }
8632 {
8638 variable2);
8639 }
8640 }
8646 /* If we are comparing an expression that just has comparisons
8647 of two integer values, arithmetic expressions of those comparisons,
8648 and constants, we can simplify it. There are only three cases
8649 to check: the two values can either be equal, the first can be
8650 greater, or the second can be greater. Fold the expression for
8651 those three values. Since each value must be 0 or 1, we have
8652 eight possibilities, each of which corresponds to the constant 0
8653 or 1 or one of the six possible comparisons.
8655 This handles common cases like (a > b) == 0 but also handles
8656 expressions like ((x > y) - (y > x)) > 0, which supposedly
8657 occur in macroized code. */
8660 {
8665 /* Don't handle degenerate cases here; they should already
8666 have been handled anyway. */
8675 {
8679 /* We can't just pass T to eval_subst in case cval1 or cval2
8680 was the same as ARG1. */
8682 tree high_result
8686 arg1);
8687 tree equal_result
8691 arg1);
8692 tree low_result
8696 arg1);
8698 /* All three of these results should be 0 or 1. Confirm they are.
8699 Then use those values to select the proper code to use. */
8704 {
8705 /* Make a 3-bit mask with the high-order bit being the
8706 value for `>', the next for '=', and the low for '<'. */
8710 {
8712 /* Always false. */
8733 /* Always true. */
8735 }
8738 {
8742 }
8744 }
8745 }
8746 }
8748 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
8749 into a single range test. */
8757 {
8761 }
8764 }
8767 /* Subroutine of fold_binary. Optimize complex multiplications of the
8768 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8769 argument EXPR represents the expression "z" of type TYPE. */
8771 static tree
8773 {
8778 {
8781 }
8783 {
8786 }
8787 else
8788 {
8792 }
8801 }
8804 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8805 CONSTRUCTOR ARG into array ELTS and return true if successful. */
8807 static bool
8809 {
8813 {
8816 }
8818 {
8824 else
8826 }
8827 else
8833 }
8835 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8836 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8837 NULL_TREE otherwise. */
8839 static tree
8841 {
8858 {
8862 }
8865 {
8871 }
8872 else
8874 }
8876 /* Try to fold a pointer difference of type TYPE two address expressions of
8877 array references AREF0 and AREF1 using location LOC. Return a
8878 simplified expression for the difference or NULL_TREE. */
8880 static tree
8883 {
8888 /* If the bases are array references as well, recurse. If the bases
8889 are pointer indirections compute the difference of the pointers.
8890 If the bases are equal, we are set. */
8893 && (base_offset
8897 && (base_offset
8903 {
8909 base_offset,
8912 }
8914 }
8916 /* If the real or vector real constant CST of type TYPE has an exact
8917 inverse, return it, else return NULL. */
8919 tree
8921 {
8922 REAL_VALUE_TYPE r;
8924 machine_mode mode;
8928 {
8944 {
8949 }
8955 }
8956 }
8958 /* Mask out the tz least significant bits of X of type TYPE where
8959 tz is the number of trailing zeroes in Y. */
8960 static wide_int
8962 {
8967 }
8969 /* Return true when T is an address and is known to be nonzero.
8970 For floating point we further ensure that T is not denormal.
8971 Similar logic is present in nonzero_address in rtlanal.h.
8973 If the return value is based on the assumption that signed overflow
8974 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
8975 change *STRICT_OVERFLOW_P. */
8977 static bool
8979 {
8983 /* Doing something useful for floating point would need more work. */
8989 {
8992 strict_overflow_p);
8998 strict_overflow_p);
9006 }
9009 {
9012 strict_overflow_p);
9020 strict_overflow_p);
9035 strict_overflow_p);
9039 strict_overflow_p);
9042 {
9054 }
9058 }
9060 }
9062 /* Return true when T is an address and is known to be nonzero.
9063 Handle warnings about undefined signed overflow. */
9065 static bool
9067 {
9074 "determining that expression is always "
9076 WARN_STRICT_OVERFLOW_MISC);
9078 }
9080 /* Return true if T is known not to be equal to an integer W. */
9082 bool
9084 {
9086 value_range_type rtype;
9088 {
9097 {
9102 }
9107 /* If T has some known zero bits and W has any of those bits set,
9108 then T is known not to be equal to W. */
9116 }
9117 }
9119 /* Fold a binary expression of code CODE and type TYPE with operands
9120 OP0 and OP1. LOC is the location of the resulting expression.
9121 Return the folded expression if folding is successful. Otherwise,
9122 return NULL_TREE. */
9124 tree
9127 {
9142 /* Strip any conversions that don't change the mode. This is
9143 safe for every expression, except for a comparison expression
9144 because its signedness is derived from its operands. So, in
9145 the latter case, only strip conversions that don't change the
9146 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9147 preserved.
9149 Note that this is done as an internal manipulation within the
9150 constant folder, in order to find the simplest representation
9151 of the arguments so that their form can be studied. In any
9152 cases, the appropriate type conversions should be put back in
9153 the tree that will get out of the constant folder. */
9156 {
9159 }
9160 else
9161 {
9164 }
9166 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9167 constant but we can't do arithmetic on them. */
9169 {
9172 {
9176 }
9177 }
9179 /* If this is a commutative operation, and ARG0 is a constant, move it
9180 to ARG1 to reduce the number of tests below. */
9185 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9186 to ARG1 to reduce the number of tests below. */
9195 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9197 First check for cases where an arithmetic operation is applied to a
9198 compound, conditional, or comparison operation. Push the arithmetic
9199 operation inside the compound or conditional to see if any folding
9200 can then be done. Convert comparison to conditional for this purpose.
9201 The also optimizes non-constant cases that used to be done in
9202 expand_expr.
9204 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9205 one of the operands is a comparison and the other is a comparison, a
9206 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9207 code below would make the expression more complex. Change it to a
9208 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9209 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9222 {
9226 boolean_type_node,
9234 }
9238 {
9240 {
9245 tem);
9246 }
9249 {
9254 tem);
9255 }
9260 {
9266 }
9271 {
9277 }
9278 }
9281 {
9283 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9286 {
9292 }
9294 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9297 {
9298 tree base;
9299 HOST_WIDE_INT coffset;
9308 }
9313 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9319 arg1),
9321 arg0)));
9327 {
9328 /* X + (X / CST) * -CST is X % CST. */
9333 {
9342 cst0));
9343 }
9344 }
9346 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9347 one. Make sure the type is not saturating and has the signedness of
9348 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9349 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9356 {
9360 }
9363 {
9364 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9365 (plus (plus (mult) (mult)) (foo)) so that we can
9366 take advantage of the factoring cases below. */
9375 {
9381 else
9394 parg0),
9396 marg)),
9400 return
9406 parg1)));
9407 }
9408 }
9409 else
9410 {
9411 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9412 to __complex__ ( x, y ). This is not the same for SNaNs or
9413 if signed zeros are involved. */
9417 {
9424 {
9428 {
9434 }
9436 {
9442 }
9443 }
9444 }
9452 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9453 We associate floats only if the user has specified
9454 -fassociative-math. */
9458 {
9463 {
9464 tree tree0;
9467 }
9468 }
9469 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9470 We associate floats only if the user has specified
9471 -fassociative-math. */
9475 {
9480 {
9481 tree tree0;
9484 }
9485 }
9486 }
9488 bit_rotate:
9489 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9490 is a rotate of A by C1 bits. */
9491 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9492 is a rotate of A by B bits. */
9493 {
9495 tree rtype;
9504 /* Only create rotates in complete modes. Other cases are not
9505 expanded properly. */
9508 {
9522 {
9526 code0 == LSHIFT_EXPR
9530 }
9532 {
9540 element_precision
9544 return
9547 ? LROTATE_EXPR
9552 }
9554 {
9562 element_precision
9566 return fold_convert_loc
9569 ? LROTATE_EXPR
9573 }
9574 }
9575 }
9577 associate:
9578 /* In most languages, can't associate operations on floats through
9579 parentheses. Rather than remember where the parentheses were, we
9580 don't associate floats at all, unless the user has specified
9581 -fassociative-math.
9582 And, we need to make sure type is not saturating. */
9586 {
9592 /* Split both trees into variables, constants, and literals. Then
9593 associate each group together, the constants with literals,
9594 then the result with variables. This increases the chances of
9595 literals being recombined later and of generating relocatable
9596 expressions for the sum of a constant and literal. */
9602 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9606 /* With undefined overflow prefer doing association in a type
9607 which wraps on overflow, if that is one of the operand types. */
9610 {
9618 }
9620 /* With undefined overflow we can only associate constants with one
9621 variable, and constants whose association doesn't overflow. */
9624 {
9626 {
9632 {
9635 }
9642 {
9645 }
9651 /* The only case we can still associate with two variables
9652 is if they cancel out. */
9656 }
9657 }
9659 /* Only do something if we found more than two objects. Otherwise,
9660 nothing has changed and we risk infinite recursion. */
9666 {
9678 /* Preserve the MINUS_EXPR if the negative part of the literal is
9679 greater than the positive part. Otherwise, the multiplicative
9680 folding code (i.e extract_muldiv) may be fooled in case
9681 unsigned constants are subtracted, like in the following
9682 example: ((X*2 + 4) - 8U)/2. */
9684 {
9688 {
9692 }
9693 else
9694 {
9698 }
9699 }
9701 /* Don't introduce overflows through reassociation. */
9708 {
9710 return
9714 else
9715 {
9718 return
9722 }
9723 }
9726 return
9729 }
9730 }
9735 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9744 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9745 __complex__ ( x, -y ). This is not the same for SNaNs or if
9746 signed zeros are involved. */
9750 {
9757 {
9761 {
9763 arg1r ? arg1r
9768 }
9770 {
9774 arg1i ? arg1i
9777 }
9778 }
9779 }
9781 /* A - B -> A + (-B) if B is easily negatable. */
9785 /* Avoid this transformation if B is a positive REAL_CST. */
9793 /* Fold &a[i] - &a[j] to i-j. */
9798 {
9804 }
9807 && flag_unsafe_math_optimizations
9813 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9814 one. Make sure the type is not saturating and has the signedness of
9815 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9816 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9823 {
9827 }
9833 {
9834 /* Transform x * -C into -x * C if x is easily negatable. */
9848 {
9851 "occur when simplifying "
9853 WARN_STRICT_OVERFLOW_MISC);
9855 }
9857 /* Optimize z * conj(z) for integer complex numbers. */
9864 }
9865 else
9866 {
9867 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
9868 This is not the same for NaNs or if signed zeros are
9869 involved. */
9875 {
9878 return
9884 return
9889 }
9891 /* Optimize z * conj(z) for floating point complex numbers.
9892 Guarded by flag_unsafe_math_optimizations as non-finite
9893 imaginary components don't produce scalar results. */
9902 }
9906 /* Canonicalize (X & C1) | C2. */
9910 {
9915 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
9923 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
9928 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
9929 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
9930 mode which allows further optimizations. */
9935 {
9939 {
9942 }
9943 }
9950 c3)),
9951 arg1);
9952 }
9954 /* See if this can be simplified into a rotate first. If that
9955 is unsuccessful continue in the association code. */
9959 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
9967 /* See if this can be simplified into a rotate first. If that
9968 is unsuccessful continue in the association code. */
9972 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
9977 {
9978 tree tem2;
9985 }
9986 /* Fold ~X & 1 as (X & 1) == 0. */
9990 {
9991 tree tem2;
9998 }
9999 /* Fold !X & 1 as X == 0. */
10002 {
10006 }
10008 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10009 multiple of 1 << CST. */
10011 {
10018 }
10020 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10021 bits from CST2. */
10025 {
10033 {
10034 /* Avoid the transform if arg1 is a mask of some
10035 mode which allows further optimizations. */
10042 }
10043 }
10045 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10046 ((A & N) + B) & M -> (A + B) & M
10047 Similarly if (N & M) == 0,
10048 ((A | N) + B) & M -> (A + B) & M
10049 and for - instead of + (or unary - instead of +)
10050 and/or ^ instead of |.
10051 If B is constant and (B & M) == 0, fold into A & M. */
10053 {
10062 {
10065 wide_int cst0;
10067 /* Now we know that arg0 is (C + D) or (C - D) or
10068 -C and arg1 (M) is == (1LL << cst) - 1.
10069 Store C into PMOP[0] and D into PMOP[1]. */
10073 {
10076 }
10083 {
10093 {
10096 }
10099 /* If C or D is of the form (A & N) where
10100 (N & M) == M, or of the form (A | N) or
10101 (A ^ N) where (N & M) == 0, replace it with A. */
10105 /* If C or D is a N where (N & M) == 0, it can be
10106 omitted (assumed 0). */
10114 }
10116 /* Only build anything new if we optimized one or both arguments
10117 above. */
10121 {
10124 {
10125 /* Perform the operations in a type that has defined
10126 overflow behavior. */
10132 }
10137 {
10145 else
10147 }
10150 else
10153 /* TEM is now the new binary +, - or unary - replacement. */
10157 }
10158 }
10159 }
10161 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10164 {
10169 return
10171 }
10176 /* Don't touch a floating-point divide by zero unless the mode
10177 of the constant can represent infinity. */
10183 /* (-A) / (-B) -> A / B */
10195 /* Fall through */
10198 /* Simplify A / (B << N) where A and B are positive and B is
10199 a power of 2, to A >> (N + log2(B)). */
10204 {
10207 {
10215 WARN_STRICT_OVERFLOW_MISC);
10221 }
10222 }
10224 /* Fall through */
10232 /* Convert -A / -B to A / B when the type is signed and overflow is
10233 undefined. */
10237 {
10240 "when distributing negation across "
10242 WARN_STRICT_OVERFLOW_MISC);
10247 }
10251 {
10254 "when distributing negation across "
10256 WARN_STRICT_OVERFLOW_MISC);
10261 }
10263 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10264 operation, EXACT_DIV_EXPR.
10266 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10267 At one time others generated faster code, it's not clear if they do
10268 after the last round to changes to the DIV code in expmed.c. */
10279 {
10283 WARN_STRICT_OVERFLOW_MISC);
10285 }
10297 {
10301 WARN_STRICT_OVERFLOW_MISC);
10303 }
10311 /* Since negative shift count is not well-defined,
10312 don't try to compute it in the compiler. */
10318 /* If we have a rotate of a bit operation with the rotate count and
10319 the second operand of the bit operation both constant,
10320 permute the two operations. */
10326 {
10334 }
10336 /* Two consecutive rotates adding up to the some integer
10337 multiple of the precision of the type can be ignored. */
10352 /* Note that the operands of this must be ints
10353 and their values must be 0 or 1.
10354 ("true" is a fixed value perhaps depending on the language.) */
10355 /* If first arg is constant zero, return it. */
10358 /* FALLTHRU */
10360 /* If either arg is constant true, drop it. */
10364 /* Preserve sequence points. */
10367 /* If second arg is constant zero, result is zero, but first arg
10368 must be evaluated. */
10371 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10372 case will be handled here. */
10376 /* !X && X is always false. */
10380 /* X && !X is always false. */
10385 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10386 means A >= Y && A != MAX, but in this case we know that
10387 A < X <= MAX. */
10391 {
10399 }
10408 /* Note that the operands of this must be ints
10409 and their values must be 0 or true.
10410 ("true" is a fixed value perhaps depending on the language.) */
10411 /* If first arg is constant true, return it. */
10414 /* FALLTHRU */
10416 /* If either arg is constant zero, drop it. */
10420 /* Preserve sequence points. */
10423 /* If second arg is constant true, result is true, but we must
10424 evaluate first arg. */
10427 /* Likewise for first arg, but note this only occurs here for
10428 TRUTH_OR_EXPR. */
10432 /* !X || X is always true. */
10436 /* X || !X is always true. */
10441 /* (X && !Y) || (!X && Y) is X ^ Y */
10444 {
10461 }
10470 /* If the second arg is constant zero, drop it. */
10473 /* If the second arg is constant true, this is a logical inversion. */
10475 {
10478 }
10479 /* Identical arguments cancel to zero. */
10483 /* !X ^ X is always true. */
10488 /* X ^ !X is always true. */
10504 /* bool_var != 1 becomes !bool_var. */
10511 /* bool_var == 0 becomes !bool_var. */
10518 /* !exp != 0 becomes !exp */
10523 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
10532 {
10538 }
10540 /* Transform comparisons of the form X CMP X +- Y to Y CMP 0. */
10549 {
10555 }
10557 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
10565 code == NE_EXPR
10569 /* Transform comparisons of the form X CMP C - X if C % 2 == 1. */
10577 code == NE_EXPR
10581 /* If this is an EQ or NE comparison with zero and ARG0 is
10582 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10583 two operations, but the latter can be done in one less insn
10584 on machines that have only two-operand insns or on which a
10585 constant cannot be the first operand. */
10588 {
10593 {
10600 arg1);
10601 }
10604 {
10611 arg1);
10612 }
10613 }
10615 /* If this is an NE or EQ comparison of zero against the result of a
10616 signed MOD operation whose second operand is a power of 2, make
10617 the MOD operation unsigned since it is simpler and equivalent. */
10625 {
10635 }
10637 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10638 C1 is a valid shift constant, and C2 is a power of two, i.e.
10639 a single bit. */
10643 == INTEGER_CST
10646 {
10651 /* Check for a valid shift count. */
10653 {
10657 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10658 can be rewritten as (X & (C2 << C1)) != 0. */
10660 {
10665 }
10666 /* Otherwise, for signed (arithmetic) shifts,
10667 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10668 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10672 /* Otherwise, of unsigned (logical) shifts,
10673 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10674 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10675 else
10679 arg000);
10680 }
10681 }
10683 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
10684 Similarly for NE_EXPR. */
10688 {
10692 tree dandnotc
10695 notc);
10699 }
10701 /* If this is a comparison of a field, we may be able to simplify it. */
10704 /* Handle the constant case even without -O
10705 to make sure the warnings are given. */
10707 {
10711 }
10713 /* Optimize comparisons of strlen vs zero to a compare of the
10714 first character of the string vs zero. To wit,
10715 strlen(ptr) == 0 => *ptr == 0
10716 strlen(ptr) != 0 => *ptr != 0
10717 Other cases should reduce to one of these two (or a constant)
10718 due to the return value of strlen being unsigned. */
10721 {
10729 {
10734 }
10735 }
10737 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10738 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10742 {
10747 {
10749 {
10752 }
10755 }
10756 }
10758 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10759 (X & C) == 0 when C is a single bit. */
10764 {
10771 arg1));
10772 }
10774 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10775 constant C is a power of two, i.e. a single bit. */
10782 {
10786 }
10788 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10789 when is C is a power of two, i.e. a single bit. */
10796 {
10802 }
10806 {
10809 }
10811 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10814 {
10827 arg01),
10836 arg01),
10845 arg00),
10854 arg00),
10856 }
10860 {
10867 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
10868 operand_equal_p guarantees no side-effects so we don't need
10869 to use omit_one_operand on Z. */
10873 arg10));
10877 arg11));
10881 arg10));
10885 arg11));
10887 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
10890 {
10896 }
10897 }
10899 /* Attempt to simplify equality/inequality comparisons of complex
10900 values. Only lower the comparison if the result is known or
10901 can be simplified to a single scalar comparison. */
10906 {
10911 {
10914 }
10915 else
10916 {
10919 }
10922 {
10925 }
10926 else
10927 {
10930 }
10934 {
10936 {
10941 }
10942 else
10943 {
10948 }
10949 }
10953 {
10955 {
10960 }
10961 else
10962 {
10967 }
10968 }
10969 }
10981 /* Transform comparisons of the form X +- C CMP X. */
10988 {
10995 else
10998 /* (X - c) > X becomes false. */
11002 {
11006 "occur when assuming that (X - c) > X "
11008 WARN_STRICT_OVERFLOW_ALL);
11010 }
11012 /* Likewise (X + c) < X becomes false. */
11016 {
11020 "occur when assuming that "
11022 WARN_STRICT_OVERFLOW_ALL);
11024 }
11026 /* Convert (X - c) <= X to true. */
11031 {
11035 "occur when assuming that "
11037 WARN_STRICT_OVERFLOW_ALL);
11039 }
11041 /* Convert (X + c) >= X to true. */
11046 {
11050 "occur when assuming that "
11052 WARN_STRICT_OVERFLOW_ALL);
11054 }
11057 {
11058 /* Convert X + c > X and X - c < X to true for integers. */
11062 {
11065 "not occur when assuming that "
11067 WARN_STRICT_OVERFLOW_ALL);
11069 }
11074 {
11077 "not occur when assuming that "
11079 WARN_STRICT_OVERFLOW_ALL);
11081 }
11083 /* Convert X + c <= X and X - c >= X to false for integers. */
11087 {
11090 "not occur when assuming that "
11092 WARN_STRICT_OVERFLOW_ALL);
11094 }
11099 {
11102 "not occur when assuming that "
11104 WARN_STRICT_OVERFLOW_ALL);
11106 }
11107 }
11108 }
11110 /* If we are comparing an ABS_EXPR with a constant, we can
11111 convert all the cases into explicit comparisons, but they may
11112 well not be faster than doing the ABS and one comparison.
11113 But ABS (X) <= C is a range comparison, which becomes a subtraction
11114 and a comparison, and is probably faster. */
11128 /* Convert ABS_EXPR<x> >= 0 to true. */
11135 {
11138 "when simplifying comparison of "
11140 WARN_STRICT_OVERFLOW_CONDITIONAL);
11143 arg0);
11144 }
11146 /* Convert ABS_EXPR<x> < 0 to false. */
11151 {
11154 "when simplifying comparison of "
11156 WARN_STRICT_OVERFLOW_CONDITIONAL);
11159 arg0);
11160 }
11162 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11163 and similarly for >= into !=. */
11173 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11174 otherwise Y might be >= # of bits in X's type and thus e.g.
11175 (unsigned char) (1 << Y) for Y 15 might be 0.
11176 If the cast is widening, then 1 << Y should have unsigned type,
11177 otherwise if Y is number of bits in the signed shift type minus 1,
11178 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11179 31 might be 0xffffffff80000000. */
11190 {
11196 }
11208 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11209 {
11221 }
11226 /* When pedantic, a compound expression can be neither an lvalue
11227 nor an integer constant expression. */
11230 /* Don't let (0, 0) be null pointer constant. */
11236 /* An ASSERT_EXPR should never be passed to fold_binary. */
11242 }
11244 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11245 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
11246 of GOTO_EXPR. */
11248 static tree
11250 {
11252 {
11259 /* fall through */
11263 }
11264 }
11266 /* Return whether the sub-tree ST contains a label which is accessible from
11267 outside the sub-tree. */
11269 static bool
11271 {
11272 return
11274 }
11276 /* Fold a ternary expression of code CODE and type TYPE with operands
11277 OP0, OP1, and OP2. Return the folded expression if folding is
11278 successful. Otherwise, return NULL_TREE. */
11280 tree
11283 {
11284 tree tem;
11291 /* If this is a commutative operation, and OP0 is a constant, move it
11292 to OP1 to reduce the number of tests below. */
11301 /* Strip any conversions that don't change the mode. This is safe
11302 for every expression, except for a comparison expression because
11303 its signedness is derived from its operands. So, in the latter
11304 case, only strip conversions that don't change the signedness.
11306 Note that this is done as an internal manipulation within the
11307 constant folder, in order to find the simplest representation of
11308 the arguments so that their form can be studied. In any cases,
11309 the appropriate type conversions should be put back in the tree
11310 that will get out of the constant folder. */
11312 {
11315 }
11318 {
11321 }
11324 {
11327 }
11330 {
11334 {
11340 }
11345 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11346 so all simple results must be passed through pedantic_non_lvalue. */
11348 {
11351 /* Only optimize constant conditions when the selected branch
11352 has the same type as the COND_EXPR. This avoids optimizing
11353 away "c ? x : throw", where the throw has a void type.
11354 Avoid throwing away that operand which contains label. */
11361 }
11363 {
11368 {
11373 {
11381 }
11385 }
11386 }
11388 /* If we have A op B ? A : C, we may be able to convert this to a
11389 simpler expression, depending on the operation and the values
11390 of B and C. Signed zeros prevent all of these transformations,
11391 for reasons given above each one.
11393 Also try swapping the arguments and inverting the conditional. */
11398 {
11402 }
11406 op2,
11409 {
11413 {
11417 }
11418 }
11420 /* If the second operand is simpler than the third, swap them
11421 since that produces better jump optimization results. */
11424 {
11426 /* See if this can be inverted. If it can't, possibly because
11427 it was a floating-point inequality comparison, don't do
11428 anything. */
11432 }
11434 /* Convert A ? 1 : 0 to simply A. */
11439 /* If we try to convert OP0 to our type, the
11440 call to fold will try to move the conversion inside
11441 a COND, which will recurse. In that case, the COND_EXPR
11442 is probably the best choice, so leave it alone. */
11446 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11447 over COND_EXPR in cases such as floating point comparisons. */
11456 arg0)));
11458 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11463 {
11464 /* sign_bit_p looks through both zero and sign extensions,
11465 but for this optimization only sign extensions are
11466 usable. */
11469 {
11472 {
11475 }
11477 }
11478 /* sign_bit_p only checks ARG1 bits within A's precision.
11479 If <sign bit of A> has wider type than A, bits outside
11480 of A's precision in <sign bit of A> need to be checked.
11481 If they are all 0, this optimization needs to be done
11482 in unsigned A's type, if they are all 1 in signed A's type,
11483 otherwise this can't be done. */
11489 {
11491 tree tem_type;
11504 {
11507 }
11509 {
11512 }
11513 else
11515 }
11518 return
11524 arg1)));
11525 }
11527 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11528 already handled above. */
11533 {
11542 }
11544 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11545 is probably obsolete because the first operand should be a
11546 truth value (that's why we have the two cases above), but let's
11547 leave it in until we can confirm this for all front-ends. */
11559 /* Disable the transformations below for vectors, since
11560 fold_binary_op_with_conditional_arg may undo them immediately,
11561 yielding an infinite loop. */
11565 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11574 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11579 {
11581 /* Only perform transformation if ARG0 is easily inverted. */
11585 ? BIT_IOR_EXPR
11588 arg1);
11589 }
11591 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11596 {
11598 /* Only perform transformation if ARG0 is easily inverted. */
11604 op2);
11605 }
11607 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11619 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11620 of fold_ternary on them. */
11628 {
11638 {
11643 {
11651 }
11652 }
11653 }
11655 /* On constants we can use native encode/interpret to constant
11656 fold (nearly) all BIT_FIELD_REFs. */
11660 {
11663 /* Limit us to a reasonable amount of work. To relax the
11664 other limitations we need bit-shifting of the buffer
11665 and rounding up the size. */
11669 {
11671 unsigned HOST_WIDE_INT len
11676 {
11681 }
11682 }
11683 }
11688 /* For integers we can decompose the FMA if possible. */
11700 {
11716 {
11721 /* Make sure that the perm value is in an acceptable
11722 range. */
11731 else
11736 }
11739 {
11744 }
11749 {
11754 }
11760 {
11764 }
11769 /* Some targets are deficient and fail to expand a single
11770 argument permutation while still allowing an equivalent
11771 2-argument version. */
11775 {
11778 }
11781 {
11788 }
11792 }
11796 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
11799 {
11805 wide_int tem2
11809 }
11814 {
11816 unsigned HOST_WIDE_INT elsize
11819 {
11823 else
11824 {
11830 }
11831 }
11832 }
11838 }
11840 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
11841 of an array (or vector). */
11843 tree
11845 {
11850 {
11853 {
11854 /* Static constructors for variably sized objects makes no sense. */
11858 }
11859 }
11870 offset_int max_index;
11875 {
11876 /* Array constructor might explicitly set index, or specify a range,
11877 or leave index NULL meaning that it is next index after previous
11878 one. */
11880 {
11883 else
11884 {
11888 }
11889 }
11890 else
11891 {
11897 }
11899 /* Do we have match? */
11903 }
11905 }
11907 /* Perform constant folding and related simplification of EXPR.
11908 The related simplifications include x*1 => x, x*0 => 0, etc.,
11909 and application of the associative law.
11910 NOP_EXPR conversions may be removed freely (as long as we
11911 are careful not to change the type of the overall expression).
11912 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
11913 but we can constant-fold them if they have constant operands. */
11915 #ifdef ENABLE_FOLD_CHECKING
11916 # define fold(x) fold_1 (x)
11918 static
11919 #endif
11920 tree
11922 {
11926 tree tem;
11929 /* Return right away if a constant. */
11933 /* CALL_EXPR-like objects with variable numbers of operands are
11934 treated specially. */
11936 {
11938 {
11941 }
11943 }
11946 {
11951 {
11969 }
11970 }
11973 {
11975 {
11982 {
11987 }
11990 }
11992 /* Return a VECTOR_CST if possible. */
11994 {
12000 tree val;
12006 }
12014 }
12016 #ifdef ENABLE_FOLD_CHECKING
12017 #undef fold
12024 /* When --enable-checking=fold, compute a digest of expr before
12025 and after actual fold call to see if fold did not accidentally
12026 change original expr. */
12028 tree
12030 {
12031 tree ret;
12051 }
12053 void
12055 {
12066 }
12068 static void
12070 {
12072 }
12074 static void
12077 {
12083 recursive_label:
12093 {
12094 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12099 }
12107 {
12108 /* Allow these fields to be modified. */
12109 tree tmp;
12118 {
12121 }
12122 }
12133 {
12136 {
12151 }
12155 {
12168 }
12185 {
12191 }
12194 {
12196 {
12199 }
12201 }
12212 {
12215 }
12225 }
12226 }
12228 /* Helper function for outputting the checksum of a tree T. When
12229 debugging with gdb, you can "define mynext" to be "next" followed
12230 by "call debug_fold_checksum (op0)", then just trace down till the
12231 outputs differ. */
12233 DEBUG_FUNCTION void
12235 {
12250 }
12252 #endif
12254 /* Fold a unary tree expression with code CODE of type TYPE with an
12255 operand OP0. LOC is the location of the resulting expression.
12256 Return a folded expression if successful. Otherwise, return a tree
12257 expression with code CODE of type TYPE with an operand OP0. */
12259 tree
12262 {
12263 tree tem;
12264 #ifdef ENABLE_FOLD_CHECKING
12273 #endif
12279 #ifdef ENABLE_FOLD_CHECKING
12286 #endif
12288 }
12290 /* Fold a binary tree expression with code CODE of type TYPE with
12291 operands OP0 and OP1. LOC is the location of the resulting
12292 expression. Return a folded expression if successful. Otherwise,
12293 return a tree expression with code CODE of type TYPE with operands
12294 OP0 and OP1. */
12296 tree
12299 MEM_STAT_DECL)
12300 {
12301 tree tem;
12302 #ifdef ENABLE_FOLD_CHECKING
12319 #endif
12325 #ifdef ENABLE_FOLD_CHECKING
12340 #endif
12342 }
12344 /* Fold a ternary tree expression with code CODE of type TYPE with
12345 operands OP0, OP1, and OP2. Return a folded expression if
12346 successful. Otherwise, return a tree expression with code CODE of
12347 type TYPE with operands OP0, OP1, and OP2. */
12349 tree
12352 {
12353 tree tem;
12354 #ifdef ENABLE_FOLD_CHECKING
12378 #endif
12385 #ifdef ENABLE_FOLD_CHECKING
12408 #endif
12410 }
12412 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12413 arguments in ARGARRAY, and a null static chain.
12414 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12415 of type TYPE from the given operands as constructed by build_call_array. */
12417 tree
12420 {
12421 tree tem;
12422 #ifdef ENABLE_FOLD_CHECKING
12441 #endif
12447 #ifdef ENABLE_FOLD_CHECKING
12463 #endif
12465 }
12467 /* Perform constant folding and related simplification of initializer
12468 expression EXPR. These behave identically to "fold_buildN" but ignore
12469 potential run-time traps and exceptions that fold must preserve. */
12471 #define START_FOLD_INIT \
12472 int saved_signaling_nans = flag_signaling_nans;\
12473 int saved_trapping_math = flag_trapping_math;\
12474 int saved_rounding_math = flag_rounding_math;\
12475 int saved_trapv = flag_trapv;\
12476 int saved_folding_initializer = folding_initializer;\
12477 flag_signaling_nans = 0;\
12478 flag_trapping_math = 0;\
12479 flag_rounding_math = 0;\
12480 flag_trapv = 0;\
12481 folding_initializer = 1;
12483 #define END_FOLD_INIT \
12484 flag_signaling_nans = saved_signaling_nans;\
12485 flag_trapping_math = saved_trapping_math;\
12486 flag_rounding_math = saved_rounding_math;\
12487 flag_trapv = saved_trapv;\
12488 folding_initializer = saved_folding_initializer;
12490 tree
12493 {
12494 tree result;
12495 START_FOLD_INIT;
12499 END_FOLD_INIT;
12501 }
12503 tree
12506 {
12507 tree result;
12508 START_FOLD_INIT;
12512 END_FOLD_INIT;
12514 }
12516 tree
12519 {
12520 tree result;
12521 START_FOLD_INIT;
12525 END_FOLD_INIT;
12527 }
12529 #undef START_FOLD_INIT
12530 #undef END_FOLD_INIT
12532 /* Determine if first argument is a multiple of second argument. Return 0 if
12533 it is not, or we cannot easily determined it to be.
12535 An example of the sort of thing we care about (at this point; this routine
12536 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12537 fold cases do now) is discovering that
12539 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12541 is a multiple of
12543 SAVE_EXPR (J * 8)
12545 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12547 This code also handles discovering that
12549 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12551 is a multiple of 8 so we don't have to worry about dealing with a
12552 possible remainder.
12554 Note that we *look* inside a SAVE_EXPR only to determine how it was
12555 calculated; it is not safe for fold to do much of anything else with the
12556 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12557 at run time. For example, the latter example above *cannot* be implemented
12558 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12559 evaluation time of the original SAVE_EXPR is not necessarily the same at
12560 the time the new expression is evaluated. The only optimization of this
12561 sort that would be valid is changing
12563 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12565 divided by 8 to
12567 SAVE_EXPR (I) * SAVE_EXPR (J)
12569 (where the same SAVE_EXPR (J) is used in the original and the
12570 transformed version). */
12572 int
12574 {
12585 {
12587 /* Bitwise and provides a power of two multiple. If the mask is
12588 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12591 /* FALLTHRU */
12598 /* It is impossible to prove if op0 - op1 is multiple of bottom
12599 precisely, so be conservative here checking if both op0 and op1
12600 are multiple of bottom. Note we check the second operand first
12601 since it's usually simpler. */
12606 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
12607 as op0 - 3 if the expression has unsigned type. For example,
12608 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
12618 {
12620 /* const_binop may not detect overflow correctly,
12621 so check for it explicitly here. */
12625 size_one_node,
12626 op1)))
12629 }
12633 /* Can't handle conversions from non-integral or wider integral type. */
12639 /* fall through */
12656 SIGNED);
12662 {
12665 /* Check for special cases to see if top is defined as multiple
12666 of bottom:
12668 top = (X & ~(bottom - 1) ; bottom is power of 2
12670 or
12672 Y = X % bottom
12673 top = X - Y. */
12692 }
12694 /* fall through */
12698 }
12699 }
12701 #define tree_expr_nonnegative_warnv_p(X, Y) \
12704 #define RECURSE(X) \
12705 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
12707 /* Return true if CODE or TYPE is known to be non-negative. */
12709 static bool
12711 {
12714 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12715 have a signed:1 type (where the value is -1 and 0). */
12718 }
12720 /* Return true if (CODE OP0) is known to be non-negative. If the return
12721 value is based on the assumption that signed overflow is undefined,
12722 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12723 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12725 bool
12728 {
12733 {
12735 /* We can't return 1 if flag_wrapv is set because
12736 ABS_EXPR<INT_MIN> = INT_MIN. */
12740 {
12743 }
12751 CASE_CONVERT:
12752 {
12757 {
12761 {
12765 }
12766 }
12768 {
12774 }
12775 }
12780 }
12782 /* We don't know sign of `t', so be conservative and return false. */
12784 }
12786 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12787 value is based on the assumption that signed overflow is undefined,
12788 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12789 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12791 bool
12795 {
12800 {
12806 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12807 both unsigned and at least 2 bits shorter than the result. */
12811 {
12816 {
12820 }
12821 }
12826 {
12827 /* x * x is always non-negative for floating point x
12828 or without overflow. */
12831 {
12836 }
12837 }
12839 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12840 both unsigned and their total bits is shorter than the result. */
12844 {
12863 {
12873 }
12874 }
12901 }
12903 /* We don't know sign of `t', so be conservative and return false. */
12905 }
12907 /* Return true if T is known to be non-negative. If the return
12908 value is based on the assumption that signed overflow is undefined,
12909 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12910 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12912 bool
12914 {
12919 {
12933 /* Limit the depth of recursion to avoid quadratic behavior.
12934 This is expected to catch almost all occurrences in practice.
12935 If this code misses important cases that unbounded recursion
12936 would not, passes that need this information could be revised
12937 to provide it through dataflow propagation. */
12945 }
12946 }
12948 /* Return true if T is known to be non-negative. If the return
12949 value is based on the assumption that signed overflow is undefined,
12950 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12951 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12953 bool
12956 {
12958 {
12959 CASE_CFN_ACOS:
12960 CASE_CFN_ACOSH:
12961 CASE_CFN_CABS:
12962 CASE_CFN_COSH:
12963 CASE_CFN_ERFC:
12964 CASE_CFN_EXP:
12965 CASE_CFN_EXP10:
12966 CASE_CFN_EXP2:
12967 CASE_CFN_FABS:
12968 CASE_CFN_FDIM:
12969 CASE_CFN_HYPOT:
12970 CASE_CFN_POW10:
12971 CASE_CFN_FFS:
12972 CASE_CFN_PARITY:
12973 CASE_CFN_POPCOUNT:
12974 CASE_CFN_CLZ:
12975 CASE_CFN_CLRSB:
12978 /* Always true. */
12981 CASE_CFN_SQRT:
12982 /* sqrt(-0.0) is -0.0. */
12987 CASE_CFN_ASINH:
12988 CASE_CFN_ATAN:
12989 CASE_CFN_ATANH:
12990 CASE_CFN_CBRT:
12991 CASE_CFN_CEIL:
12992 CASE_CFN_ERF:
12993 CASE_CFN_EXPM1:
12994 CASE_CFN_FLOOR:
12995 CASE_CFN_FMOD:
12996 CASE_CFN_FREXP:
12997 CASE_CFN_ICEIL:
12998 CASE_CFN_IFLOOR:
12999 CASE_CFN_IRINT:
13000 CASE_CFN_IROUND:
13001 CASE_CFN_LCEIL:
13002 CASE_CFN_LDEXP:
13003 CASE_CFN_LFLOOR:
13004 CASE_CFN_LLCEIL:
13005 CASE_CFN_LLFLOOR:
13006 CASE_CFN_LLRINT:
13007 CASE_CFN_LLROUND:
13008 CASE_CFN_LRINT:
13009 CASE_CFN_LROUND:
13010 CASE_CFN_MODF:
13011 CASE_CFN_NEARBYINT:
13012 CASE_CFN_RINT:
13013 CASE_CFN_ROUND:
13014 CASE_CFN_SCALB:
13015 CASE_CFN_SCALBLN:
13016 CASE_CFN_SCALBN:
13017 CASE_CFN_SIGNBIT:
13018 CASE_CFN_SIGNIFICAND:
13019 CASE_CFN_SINH:
13020 CASE_CFN_TANH:
13021 CASE_CFN_TRUNC:
13022 /* True if the 1st argument is nonnegative. */
13025 CASE_CFN_FMAX:
13026 /* True if the 1st OR 2nd arguments are nonnegative. */
13029 CASE_CFN_FMIN:
13030 /* True if the 1st AND 2nd arguments are nonnegative. */
13033 CASE_CFN_COPYSIGN:
13034 /* True if the 2nd argument is nonnegative. */
13037 CASE_CFN_POWI:
13038 /* True if the 1st argument is nonnegative or the second
13039 argument is an even integer. */
13045 CASE_CFN_POW:
13046 /* True if the 1st argument is nonnegative or the second
13047 argument is an even integer valued real. */
13049 {
13050 REAL_VALUE_TYPE c;
13051 HOST_WIDE_INT n;
13056 {
13057 REAL_VALUE_TYPE cint;
13061 }
13062 }
13067 }
13069 }
13071 /* Return true if T is known to be non-negative. If the return
13072 value is based on the assumption that signed overflow is undefined,
13073 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13074 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13076 static bool
13078 {
13084 {
13086 {
13090 /* If the initializer is non-void, then it's a normal expression
13091 that will be assigned to the slot. */
13095 /* Otherwise, the initializer sets the slot in some way. One common
13096 way is an assignment statement at the end of the initializer. */
13098 {
13106 else
13108 }
13114 }
13117 {
13123 arg0,
13124 arg1,
13126 }
13139 }
13140 }
13142 #undef RECURSE
13143 #undef tree_expr_nonnegative_warnv_p
13145 /* Return true if T is known to be non-negative. If the return
13146 value is based on the assumption that signed overflow is undefined,
13147 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13148 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13150 bool
13152 {
13159 {
13181 }
13184 {
13210 }
13211 }
13213 /* Return true if `t' is known to be non-negative. Handle warnings
13214 about undefined signed overflow. */
13216 bool
13218 {
13225 "determining that expression is always "
13227 WARN_STRICT_OVERFLOW_MISC);
13229 }
13232 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13233 For floating point we further ensure that T is not denormal.
13234 Similar logic is present in nonzero_address in rtlanal.h.
13236 If the return value is based on the assumption that signed overflow
13237 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13238 change *STRICT_OVERFLOW_P. */
13240 bool
13243 {
13245 {
13248 strict_overflow_p);
13251 {
13257 strict_overflow_p));
13258 }
13263 strict_overflow_p);
13267 }
13270 }
13272 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13273 For floating point we further ensure that T is not denormal.
13274 Similar logic is present in nonzero_address in rtlanal.h.
13276 If the return value is based on the assumption that signed overflow
13277 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13278 change *STRICT_OVERFLOW_P. */
13280 bool
13282 tree type,
13283 tree op0,
13285 {
13288 {
13292 {
13293 /* With the presence of negative values it is hard
13294 to say something. */
13301 /* One of operands must be positive and the other non-negative. */
13302 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13303 overflows, on a twos-complement machine the sum of two
13304 nonnegative numbers can never be zero. */
13306 strict_overflow_p)
13308 strict_overflow_p));
13309 }
13314 {
13316 strict_overflow_p)
13318 strict_overflow_p))
13319 {
13322 }
13323 }
13332 {
13335 }
13342 {
13346 /* When both operands are nonzero, then MAX must be too. */
13348 strict_overflow_p))
13351 /* MAX where operand 0 is positive is positive. */
13353 strict_overflow_p);
13354 }
13355 /* MAX where operand 1 is positive is positive. */
13360 {
13364 }
13369 strict_overflow_p)
13371 strict_overflow_p));
13375 }
13378 }
13380 /* Return true when T is an address and is known to be nonzero.
13381 For floating point we further ensure that T is not denormal.
13382 Similar logic is present in nonzero_address in rtlanal.h.
13384 If the return value is based on the assumption that signed overflow
13385 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13386 change *STRICT_OVERFLOW_P. */
13388 bool
13390 {
13393 {
13398 {
13410 /* For objects in symbol table check if we know they are non-zero.
13411 Don't do anything for variables and functions before symtab is built;
13412 it is quite possible that they will be declared weak later. */
13417 /* Function local objects are never NULL. */
13424 /* Constants are never weak. */
13429 }
13437 {
13441 }
13446 }
13448 }
13450 #define integer_valued_real_p(X) \
13453 #define RECURSE(X) \
13454 ((integer_valued_real_p) (X, depth + 1))
13456 /* Return true if the floating point result of (CODE OP0) has an
13457 integer value. We also allow +Inf, -Inf and NaN to be considered
13458 integer values. Return false for signaling NaN.
13460 DEPTH is the current nesting depth of the query. */
13462 bool
13464 {
13466 {
13473 CASE_CONVERT:
13474 {
13481 }
13485 }
13487 }
13489 /* Return true if the floating point result of (CODE OP0 OP1) has an
13490 integer value. We also allow +Inf, -Inf and NaN to be considered
13491 integer values. Return false for signaling NaN.
13493 DEPTH is the current nesting depth of the query. */
13495 bool
13497 {
13499 {
13509 }
13511 }
13513 /* Return true if the floating point result of calling FNDECL with arguments
13514 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13515 considered integer values. Return false for signaling NaN. If FNDECL
13516 takes fewer than 2 arguments, the remaining ARGn are null.
13518 DEPTH is the current nesting depth of the query. */
13520 bool
13522 {
13524 {
13525 CASE_CFN_CEIL:
13526 CASE_CFN_FLOOR:
13527 CASE_CFN_NEARBYINT:
13528 CASE_CFN_RINT:
13529 CASE_CFN_ROUND:
13530 CASE_CFN_TRUNC:
13533 CASE_CFN_FMIN:
13534 CASE_CFN_FMAX:
13539 }
13541 }
13543 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13544 has an integer value. We also allow +Inf, -Inf and NaN to be
13545 considered integer values. Return false for signaling NaN.
13547 DEPTH is the current nesting depth of the query. */
13549 bool
13551 {
13553 {
13561 /* Limit the depth of recursion to avoid quadratic behavior.
13562 This is expected to catch almost all occurrences in practice.
13563 If this code misses important cases that unbounded recursion
13564 would not, passes that need this information could be revised
13565 to provide it through dataflow propagation. */
13569 depth));
13573 }
13575 }
13577 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
13578 has an integer value. We also allow +Inf, -Inf and NaN to be
13579 considered integer values. Return false for signaling NaN.
13581 DEPTH is the current nesting depth of the query. */
13583 static bool
13585 {
13587 {
13598 }
13600 }
13602 #undef RECURSE
13603 #undef integer_valued_real_p
13605 /* Return true if the floating point expression T has an integer value.
13606 We also allow +Inf, -Inf and NaN to be considered integer values.
13607 Return false for signaling NaN.
13609 DEPTH is the current nesting depth of the query. */
13611 bool
13613 {
13619 {
13635 }
13638 {
13644 {
13653 }
13657 }
13658 }
13660 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13661 attempt to fold the expression to a constant without modifying TYPE,
13662 OP0 or OP1.
13664 If the expression could be simplified to a constant, then return
13665 the constant. If the expression would not be simplified to a
13666 constant, then return NULL_TREE. */
13668 tree
13670 {
13673 }
13675 /* Given the components of a unary expression CODE, TYPE and OP0,
13676 attempt to fold the expression to a constant without modifying
13677 TYPE or OP0.
13679 If the expression could be simplified to a constant, then return
13680 the constant. If the expression would not be simplified to a
13681 constant, then return NULL_TREE. */
13683 tree
13685 {
13688 }
13690 /* If EXP represents referencing an element in a constant string
13691 (either via pointer arithmetic or array indexing), return the
13692 tree representing the value accessed, otherwise return NULL. */
13694 tree
13696 {
13700 {
13702 tree index;
13703 tree string;
13708 else
13709 {
13713 /* Optimize the special-case of a zero lower bound.
13715 We convert the low_bound to sizetype to avoid some problems
13716 with constant folding. (E.g. suppose the lower bound is 1,
13717 and its mode is QI. Without the conversion,l (ARRAY
13718 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13719 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13725 }
13738 }
13740 }
13742 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13743 an integer constant, real, or fixed-point constant.
13745 TYPE is the type of the result. */
13747 static tree
13749 {
13753 {
13755 {
13762 }
13769 {
13770 FIXED_VALUE_TYPE f;
13775 /* Propagate overflow flags. */
13779 }
13783 }
13786 }
13788 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13789 an integer constant or real constant.
13791 TYPE is the type of the result. */
13793 tree
13795 {
13799 {
13801 {
13802 /* If the value is unsigned or non-negative, then the absolute value
13803 is the same as the ordinary value. */
13807 /* If the value is negative, then the absolute value is
13808 its negation. */
13809 else
13810 {
13815 }
13816 }
13822 else
13828 }
13831 }
13833 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13834 constant. TYPE is the type of the result. */
13836 static tree
13838 {
13842 }
13844 /* Given CODE, a relational operator, the target type, TYPE and two
13845 constant operands OP0 and OP1, return the result of the
13846 relational operation. If the result is not a compile time
13847 constant, then return NULL_TREE. */
13849 static tree
13851 {
13854 /* From here on, the only cases we handle are when the result is
13855 known to be a constant. */
13858 {
13862 /* Handle the cases where either operand is a NaN. */
13864 {
13866 {
13894 }
13897 }
13900 }
13903 {
13907 }
13909 /* Handle equality/inequality of complex constants. */
13911 {
13922 else
13924 }
13927 {
13929 {
13930 /* Have vector comparison with scalar boolean result. */
13934 {
13942 }
13944 }
13951 {
13963 }
13966 }
13968 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
13970 To compute GT, swap the arguments and do LT.
13971 To compute GE, do LT and invert the result.
13972 To compute LE, swap the arguments, do LT and invert the result.
13973 To compute NE, do EQ and invert the result.
13975 Therefore, the code below must handle only EQ and LT. */
13978 {
13981 }
13983 /* Note that it is safe to invert for real values here because we
13984 have already handled the one case that it matters. */
13988 {
13991 }
13993 /* Compute a result for LT or EQ if args permit;
13994 Otherwise return T. */
13996 {
13999 else
14001 }
14002 else
14008 }
14010 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
14011 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
14012 itself. */
14014 tree
14016 {
14017 /* If the expression does not have side effects then we don't have to wrap
14018 it with a cleanup point expression. */
14022 /* If the expression is a return, check to see if the expression inside the
14023 return has no side effects or the right hand side of the modify expression
14024 inside the return. If either don't have side effects set we don't need to
14025 wrap the expression in a cleanup point expression. Note we don't check the
14026 left hand side of the modify because it should always be a return decl. */
14028 {
14035 }
14038 }
14040 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14041 of an indirection through OP0, or NULL_TREE if no simplification is
14042 possible. */
14044 tree
14046 {
14048 tree subtype;
14056 {
14059 /* *&CONST_DECL -> to the value of the const decl. */
14062 /* *&p => p; make sure to handle *&"str"[cst] here. */
14064 {
14068 else
14070 }
14071 /* *(foo *)&fooarray => fooarray[0] */
14074 && (!in_gimple_form
14076 {
14086 }
14087 /* *(foo *)&complexfoo => __real__ complexfoo */
14091 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14094 {
14098 }
14099 }
14103 {
14109 {
14110 tree op00type;
14114 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14117 {
14119 unsigned HOST_WIDE_INT max_offset
14124 {
14131 }
14132 }
14133 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14136 {
14140 }
14141 /* ((foo *)&fooarray)[1] => fooarray[1] */
14144 {
14154 }
14155 }
14156 }
14158 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14161 && (!in_gimple_form
14163 {
14164 tree type_domain;
14174 NULL_TREE);
14175 }
14178 }
14180 /* Builds an expression for an indirection through T, simplifying some
14181 cases. */
14183 tree
14185 {
14193 }
14195 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14197 tree
14199 {
14204 else
14206 }
14208 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14209 whose result is ignored. The type of the returned tree need not be
14210 the same as the original expression. */
14212 tree
14214 {
14220 {
14231 else
14237 {
14253 }
14258 }
14259 }
14261 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14263 tree
14265 {
14271 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14272 have to do anything. Only do this when we are not given a const,
14273 because in that case, this check is more expensive than just
14274 doing it. */
14276 {
14281 }
14283 /* If divisor is a power of two, simplify this to bit manipulation. */
14285 {
14287 {
14301 }
14302 else
14303 {
14304 tree t;
14310 }
14311 }
14312 else
14313 {
14318 }
14321 }
14323 /* Likewise, but round down. */
14325 tree
14327 {
14334 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14335 have to do anything. Only do this when we are not given a const,
14336 because in that case, this check is more expensive than just
14337 doing it. */
14339 {
14344 }
14346 /* If divisor is a power of two, simplify this to bit manipulation. */
14348 {
14349 tree t;
14353 }
14354 else
14355 {
14360 }
14363 }
14365 /* Returns the pointer to the base of the object addressed by EXP and
14366 extracts the information about the offset of the access, storing it
14367 to PBITPOS and POFFSET. */
14369 static tree
14372 {
14373 tree core;
14374 machine_mode mode;
14376 HOST_WIDE_INT bitsize;
14380 {
14385 }
14386 else
14387 {
14391 }
14394 }
14396 /* Returns true if addresses of E1 and E2 differ by a constant, false
14397 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14399 bool
14401 {
14415 {
14425 }
14427 {
14428 /* If only one of the offsets is non-constant, the difference cannot
14429 be a constant. */
14431 }
14432 else
14437 }
14439 /* Return OFF converted to a pointer offset type suitable as offset for
14440 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14441 tree
14443 {
14445 }
14447 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14448 tree
14450 {
14453 }
14455 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14456 tree
14458 {
14461 }
14463 /* Return a char pointer for a C string if it is a string constant
14464 or sum of string constant and integer constant. We only support
14465 string constants properly terminated with '\0' character.
14466 If STRLEN is a valid pointer, length (including terminating character)
14467 of returned string is stored to the argument. */
14471 {
14472 tree offset_node;
14483 {
14486 else
14488 }
14493 /* Support only properly null-terminated strings. */
14502 }
14504 #if CHECKING_P
14508 /* Helper functions for writing tests of folding trees. */
14510 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
14512 static void
14514 tree constant)
14515 {
14517 }
14519 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
14520 wrapping WRAPPED_EXPR. */
14522 static void
14524 tree wrapped_expr)
14525 {
14530 }
14532 /* Verify that various arithmetic binary operations are folded
14533 correctly. */
14535 static void
14537 {
14543 /* Addition. */
14544 /* 1 <-- (0 + 1) */
14546 one);
14548 one);
14550 /* (nonlvalue)x <-- (x + 0) */
14552 x);
14554 /* Subtraction. */
14555 /* 0 <-- (x - x) */
14557 zero);
14559 x);
14561 /* Multiplication. */
14562 /* 0 <-- (x * 0) */
14564 zero);
14566 /* (nonlvalue)x <-- (x * 1) */
14568 x);
14569 }
14571 /* Verify that various binary operations on vectors are folded
14572 correctly. */
14574 static void
14576 {
14582 /* Verify equality tests that return a scalar boolean result. */
14588 }
14590 /* Run all of the selftests within this file. */
14592 void
14594 {
14597 }