| blob | 788ecc3a6b7d53fe732720a07a9b6a30fe364c36 |
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. */
80 #ifndef LOAD_EXTEND_OP
81 #define LOAD_EXTEND_OP(M) UNKNOWN
82 #endif
84 /* Nonzero if we are folding constants inside an initializer; zero
85 otherwise. */
88 /* The following constants represent a bit based encoding of GCC's
89 comparison operators. This encoding simplifies transformations
90 on relational comparison operators, such as AND and OR. */
108 };
125 HOST_WIDE_INT *,
154 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
155 Otherwise, return LOC. */
157 static location_t
159 {
162 }
164 /* Similar to protected_set_expr_location, but never modify x in place,
165 if location can and needs to be set, unshare it. */
169 {
175 {
178 }
180 }
181 \f
182 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
183 division and returns the quotient. Otherwise returns
184 NULL_TREE. */
186 tree
188 {
189 widest_int quo;
196 }
197 \f
198 /* This is nonzero if we should defer warnings about undefined
199 overflow. This facility exists because these warnings are a
200 special case. The code to estimate loop iterations does not want
201 to issue any warnings, since it works with expressions which do not
202 occur in user code. Various bits of cleanup code call fold(), but
203 only use the result if it has certain characteristics (e.g., is a
204 constant); that code only wants to issue a warning if the result is
205 used. */
209 /* If a warning about undefined overflow is deferred, this is the
210 warning. Note that this may cause us to turn two warnings into
211 one, but that is fine since it is sufficient to only give one
212 warning per expression. */
216 /* If a warning about undefined overflow is deferred, this is the
217 level at which the warning should be emitted. */
221 /* Start deferring overflow warnings. We could use a stack here to
222 permit nested calls, but at present it is not necessary. */
224 void
226 {
228 }
230 /* Stop deferring overflow warnings. If there is a pending warning,
231 and ISSUE is true, then issue the warning if appropriate. STMT is
232 the statement with which the warning should be associated (used for
233 location information); STMT may be NULL. CODE is the level of the
234 warning--a warn_strict_overflow_code value. This function will use
235 the smaller of CODE and the deferred code when deciding whether to
236 issue the warning. CODE may be zero to mean to always use the
237 deferred code. */
239 void
241 {
243 location_t locus;
248 {
254 }
265 /* Use the smallest code level when deciding to issue the
266 warning. */
275 else
278 }
280 /* Stop deferring overflow warnings, ignoring any deferred
281 warnings. */
283 void
285 {
287 }
289 /* Whether we are deferring overflow warnings. */
291 bool
293 {
295 }
297 /* This is called when we fold something based on the fact that signed
298 overflow is undefined. */
300 static void
302 {
304 {
307 {
310 }
311 }
314 }
315 \f
316 /* Return true if the built-in mathematical function specified by CODE
317 is odd, i.e. -f(x) == f(-x). */
319 bool
321 {
323 {
324 CASE_CFN_ASIN:
325 CASE_CFN_ASINH:
326 CASE_CFN_ATAN:
327 CASE_CFN_ATANH:
328 CASE_CFN_CASIN:
329 CASE_CFN_CASINH:
330 CASE_CFN_CATAN:
331 CASE_CFN_CATANH:
332 CASE_CFN_CBRT:
333 CASE_CFN_CPROJ:
334 CASE_CFN_CSIN:
335 CASE_CFN_CSINH:
336 CASE_CFN_CTAN:
337 CASE_CFN_CTANH:
338 CASE_CFN_ERF:
339 CASE_CFN_LLROUND:
340 CASE_CFN_LROUND:
341 CASE_CFN_ROUND:
342 CASE_CFN_SIN:
343 CASE_CFN_SINH:
344 CASE_CFN_TAN:
345 CASE_CFN_TANH:
346 CASE_CFN_TRUNC:
349 CASE_CFN_LLRINT:
350 CASE_CFN_LRINT:
351 CASE_CFN_NEARBYINT:
352 CASE_CFN_RINT:
357 }
359 }
361 /* Check whether we may negate an integer constant T without causing
362 overflow. */
364 bool
366 {
367 tree type;
376 }
378 /* Determine whether an expression T can be cheaply negated using
379 the function negate_expr without introducing undefined overflow. */
381 static bool
383 {
384 tree type;
393 {
398 /* Check that -CST will not overflow type. */
411 /* We want to canonicalize to positive real constants. Pretend
412 that only negative ones can be easily negated. */
420 {
431 }
446 /* -(A + B) -> (-B) - A. */
451 /* -(A + B) -> (-A) - B. */
455 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
466 /* INT_MIN/n * n doesn't overflow while negating one operand it does
467 if n is a power of two. */
476 /* Fall through. */
491 /* In general we can't negate B in A / B, because if A is INT_MIN and
492 B is 1, we may turn this into INT_MIN / -1 which is undefined
493 and actually traps on some architectures. */
502 /* Negate -((double)float) as (double)(-float). */
504 {
508 }
512 /* Negate -f(x) as f(-x). */
518 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
520 {
524 }
529 }
531 }
533 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
534 simplification is possible.
535 If negate_expr_p would return true for T, NULL_TREE will never be
536 returned. */
538 static tree
540 {
542 tree tem;
545 {
546 /* Convert - (~A) to A + 1. */
572 {
577 }
581 {
586 {
590 }
593 }
616 {
617 /* -(A + B) -> (-B) - A. */
621 {
625 }
627 /* -(A + B) -> (-A) - B. */
629 {
633 }
634 }
638 /* - (A - B) -> B - A */
650 /* Fall through. */
654 {
663 }
675 /* In general we can't negate B in A / B, because if A is INT_MIN and
676 B is 1, we may turn this into INT_MIN / -1 which is undefined
677 and actually traps on some architectures. */
689 /* Convert -((double)float) into (double)(-float). */
691 {
695 }
699 /* Negate -f(x) as f(-x). */
702 {
708 }
712 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
714 {
717 {
724 }
725 }
730 }
733 }
735 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
736 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
737 return NULL_TREE. */
739 static tree
741 {
743 location_t loc;
756 }
757 \f
758 /* Split a tree IN into a constant, literal and variable parts that could be
759 combined with CODE to make IN. "constant" means an expression with
760 TREE_CONSTANT but that isn't an actual constant. CODE must be a
761 commutative arithmetic operation. Store the constant part into *CONP,
762 the literal in *LITP and return the variable part. If a part isn't
763 present, set it to null. If the tree does not decompose in this way,
764 return the entire tree as the variable part and the other parts as null.
766 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
767 case, we negate an operand that was subtracted. Except if it is a
768 literal for which we use *MINUS_LITP instead.
770 If NEGATE_P is true, we are negating all of IN, again except a literal
771 for which we use *MINUS_LITP instead. If a variable part is of pointer
772 type, it is negated after converting to TYPE. This prevents us from
773 generating illegal MINUS pointer expression. LOC is the location of
774 the converted variable part.
776 If IN is itself a literal or constant, return it as appropriate.
778 Note that we do not guarantee that any of the three values will be the
779 same type as IN, but they will have the same signedness and mode. */
781 static tree
784 {
791 /* Strip any conversions that don't change the machine mode or signedness. */
800 /* We can associate addition and subtraction together (even
801 though the C standard doesn't say so) for integers because
802 the value is not affected. For reals, the value might be
803 affected, so we can't. */
806 {
812 /* First see if either of the operands is a literal, then a constant. */
825 /* If we haven't dealt with either operand, this is not a case we can
826 decompose. Otherwise, VAR is either of the ones remaining, if any. */
831 else
834 /* Now do any needed negations. */
840 {
841 /* Convert to TYPE before negating a pointer type expr. */
845 }
846 }
849 {
850 /* -X - 1 is folded to ~X, undo that here. */
853 }
856 else
860 {
866 /* Convert to TYPE before negating a pointer type expr. */
870 }
873 }
875 /* Re-associate trees split by the above function. T1 and T2 are
876 either expressions to associate or null. Return the new
877 expression, if any. LOC is the location of the new expression. If
878 we build an operation, do it in TYPE and with CODE. */
880 static tree
882 {
888 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
889 try to fold this since we will have infinite recursion. But do
890 deal with any NEGATE_EXPRs. */
893 {
895 {
908 }
910 {
913 }
917 }
921 }
922 \f
923 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
924 for use in int_const_binop, size_binop and size_diffop. */
926 static bool
928 {
935 {
944 }
949 }
952 /* Combine two integer constants ARG1 and ARG2 under operation CODE
953 to produce a new constant. Return NULL_TREE if we don't know how
954 to evaluate CODE at compile-time. */
956 static tree
959 {
960 wide_int res;
961 tree t;
970 {
986 {
990 else
992 }
995 /* It's unclear from the C standard whether shifts can overflow.
996 The following code ignores overflow; perhaps a C standard
997 interpretation ruling is needed. */
999 else
1006 {
1010 else
1012 }
1016 else
1095 }
1103 }
1105 tree
1107 {
1109 }
1111 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1112 constant. We assume ARG1 and ARG2 have the same data type, or at least
1113 are the same kind of constant and the same machine mode. Return zero if
1114 combining the constants is not allowed in the current operating mode. */
1116 static tree
1118 {
1119 /* Sanity check for the recursive cases. */
1127 {
1133 }
1136 {
1137 machine_mode mode;
1138 REAL_VALUE_TYPE d1;
1139 REAL_VALUE_TYPE d2;
1140 REAL_VALUE_TYPE value;
1141 REAL_VALUE_TYPE result;
1145 /* The following codes are handled by real_arithmetic. */
1147 {
1158 }
1166 /* Don't perform operation if we honor signaling NaNs and
1167 either operand is a signaling NaN. */
1173 /* Don't perform operation if it would raise a division
1174 by zero exception. */
1180 /* If either operand is a NaN, just return it. Otherwise, set up
1181 for floating-point trap; we return an overflow. */
1183 {
1184 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1185 is off. */
1189 }
1191 {
1192 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1193 is off. */
1197 }
1202 /* Don't constant fold this floating point operation if
1203 the result has overflowed and flag_trapping_math. */
1211 /* Don't constant fold this floating point operation if the
1212 result may dependent upon the run-time rounding mode and
1213 flag_rounding_math is set, or if GCC's software emulation
1214 is unable to accurately represent the result. */
1224 }
1227 {
1228 FIXED_VALUE_TYPE f1;
1229 FIXED_VALUE_TYPE f2;
1230 FIXED_VALUE_TYPE result;
1235 /* The following codes are handled by fixed_arithmetic. */
1237 {
1249 {
1256 }
1261 }
1268 /* Propagate overflow flags. */
1272 }
1275 {
1284 {
1295 mpc_mul);
1309 mpc_div);
1310 /* Fallthru ... */
1316 {
1317 /* Keep this algorithm in sync with
1318 tree-complex.c:expand_complex_div_straight().
1320 Expand complex division to scalars, straightforward algorithm.
1321 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1322 t = br*br + bi*bi
1323 */
1324 tree magsquared
1328 tree t1
1332 tree t2
1339 }
1340 else
1341 {
1342 /* Keep this algorithm in sync with
1343 tree-complex.c:expand_complex_div_wide().
1345 Expand complex division to scalars, modified algorithm to minimize
1346 overflow with wide input ranges. */
1352 {
1353 /* In the TRUE branch, we compute
1354 ratio = br/bi;
1355 div = (br * ratio) + bi;
1356 tr = (ar * ratio) + ai;
1357 ti = (ai * ratio) - ar;
1358 tr = tr / div;
1359 ti = ti / div; */
1370 }
1371 else
1372 {
1373 /* In the FALSE branch, we compute
1374 ratio = d/c;
1375 divisor = (d * ratio) + c;
1376 tr = (b * ratio) + a;
1377 ti = b - (a * ratio);
1378 tr = tr / div;
1379 ti = ti / div; */
1391 }
1392 }
1397 }
1401 }
1405 {
1411 {
1417 /* It is possible that const_binop cannot handle the given
1418 code and return NULL_TREE */
1421 }
1424 }
1426 /* Shifts allow a scalar offset for a vector. */
1429 {
1435 {
1440 /* It is possible that const_binop cannot handle the given
1441 code and return NULL_TREE. */
1444 }
1447 }
1449 }
1451 /* Overload that adds a TYPE parameter to be able to dispatch
1452 to fold_relational_const. */
1454 tree
1456 {
1460 /* ??? Until we make the const_binop worker take the type of the
1461 result as argument put those cases that need it here. */
1463 {
1474 {
1490 {
1496 }
1499 }
1505 {
1530 {
1543 }
1546 }
1549 }
1554 /* Make sure type and arg0 have the same saturating flag. */
1559 }
1561 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1562 Return zero if computing the constants is not possible. */
1564 tree
1566 {
1567 /* Don't perform the operation, other than NEGATE and ABS, if
1568 flag_signaling_nans is on and the operand is a signaling NaN. */
1577 {
1578 CASE_CONVERT:
1585 /* If the source address is 0, and the source address space
1586 cannot have a valid object at 0, fold to dest type null. */
1597 {
1598 /* Can't call fold_negate_const directly here as that doesn't
1599 handle all cases and we might not be able to negate some
1600 constants. */
1605 }
1614 {
1618 }
1624 /* Perform BIT_NOT_EXPR on each element individually. */
1626 {
1628 tree elem;
1633 {
1639 }
1642 }
1664 {
1683 else
1687 {
1691 }
1694 }
1699 {
1713 {
1718 }
1721 {
1725 }
1728 }
1732 }
1735 }
1737 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1738 indicates which particular sizetype to create. */
1740 tree
1742 {
1744 }
1745 \f
1746 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1747 is a tree code. The type of the result is taken from the operands.
1748 Both must be equivalent integer types, ala int_binop_types_match_p.
1749 If the operands are constant, so is the result. */
1751 tree
1753 {
1762 /* Handle the special case of two integer constants faster. */
1764 {
1765 /* And some specific cases even faster than that. */
1767 {
1772 }
1774 {
1777 }
1779 {
1782 }
1784 /* Handle general case of two integer constants. For sizetype
1785 constant calculations we always want to know about overflow,
1786 even in the unsigned case. */
1788 }
1791 }
1793 /* Given two values, either both of sizetype or both of bitsizetype,
1794 compute the difference between the two values. Return the value
1795 in signed type corresponding to the type of the operands. */
1797 tree
1799 {
1801 tree ctype;
1806 /* If the type is already signed, just do the simple thing. */
1814 else
1817 /* If either operand is not a constant, do the conversions to the signed
1818 type and subtract. The hardware will do the right thing with any
1819 overflow in the subtraction. */
1825 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1826 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1827 overflow) and negate (which can't either). Special-case a result
1828 of zero while we're here. */
1834 else
1838 MINUS_EXPR,
1840 }
1841 \f
1842 /* A subroutine of fold_convert_const handling conversions of an
1843 INTEGER_CST to another integer type. */
1845 static tree
1847 {
1848 /* Given an integer constant, make new constant with new type,
1849 appropriately sign-extended or truncated. Use widest_int
1850 so that any extension is done according ARG1's type. */
1854 }
1856 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1857 to an integer type. */
1859 static tree
1861 {
1863 tree t;
1865 /* The following code implements the floating point to integer
1866 conversion rules required by the Java Language Specification,
1867 that IEEE NaNs are mapped to zero and values that overflow
1868 the target precision saturate, i.e. values greater than
1869 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1870 are mapped to INT_MIN. These semantics are allowed by the
1871 C and C++ standards that simply state that the behavior of
1872 FP-to-integer conversion is unspecified upon overflow. */
1874 wide_int val;
1875 REAL_VALUE_TYPE r;
1879 {
1886 }
1888 /* If R is NaN, return zero and show we have an overflow. */
1890 {
1893 }
1895 /* See if R is less than the lower bound or greater than the
1896 upper bound. */
1899 {
1903 {
1906 }
1907 }
1910 {
1913 {
1916 {
1919 }
1920 }
1921 }
1928 }
1930 /* A subroutine of fold_convert_const handling conversions of a
1931 FIXED_CST to an integer type. */
1933 static tree
1935 {
1936 tree t;
1940 /* Right shift FIXED_CST to temp by fbit. */
1944 {
1946 HOST_BITS_PER_DOUBLE_INT,
1949 /* Left shift temp to temp_trunc by fbit. */
1951 HOST_BITS_PER_DOUBLE_INT,
1953 }
1954 else
1955 {
1958 }
1960 /* If FIXED_CST is negative, we need to round the value toward 0.
1961 By checking if the fractional bits are not zero to add 1 to temp. */
1967 /* Given a fixed-point constant, make new constant with new type,
1968 appropriately sign-extended or truncated. */
1976 }
1978 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1979 to another floating point type. */
1981 static tree
1983 {
1984 REAL_VALUE_TYPE value;
1985 tree t;
1987 /* Don't perform the operation if flag_signaling_nans is on
1988 and the operand is a signaling NaN. */
1996 /* If converting an infinity or NAN to a representation that doesn't
1997 have one, set the overflow bit so that we can produce some kind of
1998 error message at the appropriate point if necessary. It's not the
1999 most user-friendly message, but it's better than nothing. */
2006 /* Regular overflow, conversion produced an infinity in a mode that
2007 can't represent them. */
2012 else
2015 }
2017 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2018 to a floating point type. */
2020 static tree
2022 {
2023 REAL_VALUE_TYPE value;
2024 tree t;
2031 }
2033 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2034 to another fixed-point type. */
2036 static tree
2038 {
2039 FIXED_VALUE_TYPE value;
2040 tree t;
2047 /* Propagate overflow flags. */
2051 }
2053 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2054 to a fixed-point type. */
2056 static tree
2058 {
2059 FIXED_VALUE_TYPE value;
2060 tree t;
2062 double_int di;
2069 else
2077 /* Propagate overflow flags. */
2081 }
2083 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2084 to a fixed-point type. */
2086 static tree
2088 {
2089 FIXED_VALUE_TYPE value;
2090 tree t;
2098 /* Propagate overflow flags. */
2102 }
2104 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2105 type TYPE. If no simplification can be done return NULL_TREE. */
2107 static tree
2109 {
2115 {
2122 }
2124 {
2131 }
2133 {
2140 }
2142 {
2145 {
2150 {
2156 }
2158 }
2159 }
2161 }
2163 /* Construct a vector of zero elements of vector type TYPE. */
2165 static tree
2167 {
2168 tree t;
2172 }
2174 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2176 bool
2178 {
2193 {
2209 }
2210 }
2212 /* Convert expression ARG to type TYPE. Used by the middle-end for
2213 simple conversions in preference to calling the front-end's convert. */
2215 tree
2217 {
2219 tree tem;
2230 {
2233 /* Handle conversions between pointers to different address spaces. */
2238 /* fall through */
2243 {
2247 }
2261 {
2265 }
2267 {
2271 }
2273 {
2277 }
2280 {
2298 }
2303 {
2307 }
2310 {
2324 }
2328 {
2337 integer_zero_node));
2339 {
2343 {
2349 }
2357 }
2361 }
2379 }
2380 fold_convert_exit:
2383 }
2384 \f
2385 /* Return false if expr can be assumed not to be an lvalue, true
2386 otherwise. */
2388 static bool
2390 {
2391 /* We only need to wrap lvalue tree codes. */
2393 {
2424 /* Assume the worst for front-end tree codes. */
2428 }
2431 }
2433 /* Return an expr equal to X but certainly not valid as an lvalue. */
2435 tree
2437 {
2438 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2439 us. */
2446 }
2448 /* When pedantic, return an expr equal to X but certainly not valid as a
2449 pedantic lvalue. Otherwise, return X. */
2451 static tree
2453 {
2455 }
2456 \f
2457 /* Given a tree comparison code, return the code that is the logical inverse.
2458 It is generally not safe to do this for floating-point comparisons, except
2459 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2460 ERROR_MARK in this case. */
2462 enum tree_code
2464 {
2470 {
2501 }
2502 }
2504 /* Similar, but return the comparison that results if the operands are
2505 swapped. This is safe for floating-point. */
2507 enum tree_code
2509 {
2511 {
2537 }
2538 }
2541 /* Convert a comparison tree code from an enum tree_code representation
2542 into a compcode bit-based encoding. This function is the inverse of
2543 compcode_to_comparison. */
2545 static enum comparison_code
2547 {
2549 {
2580 }
2581 }
2583 /* Convert a compcode bit-based encoding of a comparison operator back
2584 to GCC's enum tree_code representation. This function is the
2585 inverse of comparison_to_compcode. */
2587 static enum tree_code
2589 {
2591 {
2622 }
2623 }
2625 /* Return a tree for the comparison which is the combination of
2626 doing the AND or OR (depending on CODE) of the two operations LCODE
2627 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2628 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2629 if this makes the transformation invalid. */
2631 tree
2636 {
2643 {
2654 }
2657 {
2658 /* Eliminate unordered comparisons, as well as LTGT and ORD
2659 which are not used unless the mode has NaNs. */
2665 }
2667 {
2668 /* Check that the original operation and the optimized ones will trap
2669 under the same condition. */
2680 /* In a short-circuited boolean expression the LHS might be
2681 such that the RHS, if evaluated, will never trap. For
2682 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2683 if neither x nor y is NaN. (This is a mixed blessing: for
2684 example, the expression above will never trap, hence
2685 optimizing it to x < y would be invalid). */
2690 /* If the comparison was short-circuited, and only the RHS
2691 trapped, we may now generate a spurious trap. */
2696 /* If we changed the conditions that cause a trap, we lose. */
2699 }
2705 else
2706 {
2711 }
2712 }
2713 \f
2714 /* Return nonzero if two operands (typically of the same tree node)
2715 are necessarily equal. FLAGS modifies behavior as follows:
2717 If OEP_ONLY_CONST is set, only return nonzero for constants.
2718 This function tests whether the operands are indistinguishable;
2719 it does not test whether they are equal using C's == operation.
2720 The distinction is important for IEEE floating point, because
2721 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2722 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2724 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2725 even though it may hold multiple values during a function.
2726 This is because a GCC tree node guarantees that nothing else is
2727 executed between the evaluation of its "operands" (which may often
2728 be evaluated in arbitrary order). Hence if the operands themselves
2729 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2730 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2731 unset means assuming isochronic (or instantaneous) tree equivalence.
2732 Unless comparing arbitrary expression trees, such as from different
2733 statements, this flag can usually be left unset.
2735 If OEP_PURE_SAME is set, then pure functions with identical arguments
2736 are considered the same. It is used when the caller has other ways
2737 to ensure that global memory is unchanged in between.
2739 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2740 not values of expressions.
2742 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2743 any operand with side effect. This is unnecesarily conservative in the
2744 case we know that arg0 and arg1 are in disjoint code paths (such as in
2745 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2746 addresses with TREE_CONSTANT flag set so we know that &var == &var
2747 even if var is volatile. */
2749 int
2751 {
2752 /* If either is ERROR_MARK, they aren't equal. */
2758 /* Similar, if either does not have a type (like a released SSA name),
2759 they aren't equal. */
2763 /* We cannot consider pointers to different address space equal. */
2770 /* Check equality of integer constants before bailing out due to
2771 precision differences. */
2773 {
2774 /* Address of INTEGER_CST is not defined; check that we did not forget
2775 to drop the OEP_ADDRESS_OF flags. */
2778 }
2781 {
2782 /* If both types don't have the same signedness, then we can't consider
2783 them equal. We must check this before the STRIP_NOPS calls
2784 because they may change the signedness of the arguments. As pointers
2785 strictly don't have a signedness, require either two pointers or
2786 two non-pointers as well. */
2792 /* If both types don't have the same precision, then it is not safe
2793 to strip NOPs. */
2800 }
2801 #if 0
2802 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
2803 sanity check once the issue is solved. */
2804 else
2805 /* Addresses of conversions and SSA_NAMEs (and many other things)
2806 are not defined. Check that we did not forget to drop the
2807 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
2810 #endif
2812 /* In case both args are comparisons but with different comparison
2813 code, try to swap the comparison operands of one arg to produce
2814 a match and compare that variant. */
2818 {
2826 }
2829 {
2830 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2832 ;
2834 {
2835 /* If we are interested in comparing addresses ignore
2836 MEM_REF wrappings of the base that can appear just for
2837 TBAA reasons. */
2851 }
2852 else
2854 }
2856 /* When not checking adddresses, this is needed for conversions and for
2857 COMPONENT_REF. Might as well play it safe and always test this. */
2864 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2865 We don't care about side effects in that case because the SAVE_EXPR
2866 takes care of that for us. In all other cases, two expressions are
2867 equal if they have no side effects. If we have two identical
2868 expressions with side effects that should be treated the same due
2869 to the only side effects being identical SAVE_EXPR's, that will
2870 be detected in the recursive calls below.
2871 If we are taking an invariant address of two identical objects
2872 they are necessarily equal as well. */
2879 /* Next handle constant cases, those for which we can return 1 even
2880 if ONLY_CONST is set. */
2883 {
2897 {
2898 /* If we do not distinguish between signed and unsigned zero,
2899 consider them equal. */
2902 }
2906 {
2913 {
2917 }
2919 }
2923 flags)
2925 flags));
2936 flags | OEP_ADDRESS_OF
2939 /* In GIMPLE empty constructors are allowed in initializers of
2940 aggregates. */
2945 }
2950 /* Define macros to test an operand from arg0 and arg1 for equality and a
2951 variant that allows null and views null as being different from any
2952 non-null value. In the latter case, if either is null, the both
2953 must be; otherwise, do the normal comparison. */
2954 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2955 TREE_OPERAND (arg1, N), flags)
2957 #define OP_SAME_WITH_NULL(N) \
2958 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2959 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2962 {
2964 /* Two conversions are equal only if signedness and modes match. */
2966 {
2967 CASE_CONVERT:
2975 }
2985 /* For commutative ops, allow the other order. */
2993 /* If either of the pointer (or reference) expressions we are
2994 dereferencing contain a side effect, these cannot be equal,
2995 but their addresses can be. */
3002 {
3012 /* Require the same offset. */
3018 /* Fallthru. */
3026 {
3027 /* Require equal access sizes */
3033 flags)))
3035 /* Verify that access happens in similar types. */
3038 /* Verify that accesses are TBAA compatible. */
3047 /* Verify that alignment is compatible. */
3051 }
3054 /* TARGET_MEM_REF require equal extra operands. */
3065 /* Compare the array index by value if it is constant first as we
3066 may have different types but same value here. */
3072 /* Compare low bound and element size as with OEP_ADDRESS_OF
3073 we have to account for the offset of the ref. */
3078 array_ref_low_bound
3082 array_ref_element_size
3084 flags))));
3087 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3088 may be NULL when we're called to compare MEM_EXPRs. */
3103 }
3107 {
3109 /* Be sure we pass right ADDRESS_OF flag. */
3127 /* The multiplcation operands are commutative. */
3128 /* FALLTHRU */
3136 /* Otherwise take into account this is a commutative operation. */
3154 }
3158 {
3162 /* If not both CALL_EXPRs are either internal or normal function
3163 functions, then they are not equal. */
3166 {
3167 /* If the CALL_EXPRs call different internal functions, then they
3168 are not equal. */
3171 }
3172 else
3173 {
3174 /* If the CALL_EXPRs call different functions, then they are not
3175 equal. */
3177 flags))
3179 }
3181 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3182 {
3186 else
3190 }
3192 /* Now see if all the arguments are the same. */
3193 {
3204 /* If we get here and both argument lists are exhausted
3205 then the CALL_EXPRs are equal. */
3207 }
3210 }
3213 /* Consider __builtin_sqrt equal to sqrt. */
3221 {
3222 /* In GIMPLE constructors are used only to build vectors from
3223 elements. Individual elements in the constructor must be
3224 indexed in increasing order and form an initial sequence.
3226 We make no effort to compare constructors in generic.
3227 (see sem_variable::equals in ipa-icf which can do so for
3228 constants). */
3233 /* Be sure that vectors constructed have the same representation.
3234 We only tested element precision and modes to match.
3235 Vectors may be BLKmode and thus also check that the number of
3236 parts match. */
3249 {
3254 /* In GIMPLE the indexes can be either NULL or matching i.
3255 Double check this so we won't get false
3256 positives for GENERIC. */
3264 }
3266 }
3271 }
3273 #undef OP_SAME
3274 #undef OP_SAME_WITH_NULL
3275 }
3276 \f
3277 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3278 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3280 When in doubt, return 0. */
3282 static int
3284 {
3296 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3297 and see if the inner values are the same. This removes any
3298 signedness comparison, which doesn't matter here. */
3305 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3306 actual comparison operand, ARG0.
3308 First throw away any conversions to wider types
3309 already present in the operands. */
3318 {
3321 /* Make sure shorter operand is extended the right way
3322 to match the longer operand. */
3328 }
3331 }
3332 \f
3333 /* See if ARG is an expression that is either a comparison or is performing
3334 arithmetic on comparisons. The comparisons must only be comparing
3335 two different values, which will be stored in *CVAL1 and *CVAL2; if
3336 they are nonzero it means that some operands have already been found.
3337 No variables may be used anywhere else in the expression except in the
3338 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3339 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3341 If this is true, return 1. Otherwise, return zero. */
3343 static int
3345 {
3349 /* We can handle some of the tcc_expression cases here. */
3359 {
3360 /* If we've already found a CVAL1 or CVAL2, this expression is
3361 two complex to handle. */
3367 }
3370 {
3393 /* First see if we can handle the first operand, then the second. For
3394 the second operand, we know *CVAL1 can't be zero. It must be that
3395 one side of the comparison is each of the values; test for the
3396 case where this isn't true by failing if the two operands
3397 are the same. */
3406 ;
3410 ;
3411 else
3415 ;
3419 ;
3420 else
3427 }
3428 }
3429 \f
3430 /* ARG is a tree that is known to contain just arithmetic operations and
3431 comparisons. Evaluate the operations in the tree substituting NEW0 for
3432 any occurrence of OLD0 as an operand of a comparison and likewise for
3433 NEW1 and OLD1. */
3435 static tree
3438 {
3443 /* We can handle some of the tcc_expression cases here. */
3451 {
3466 {
3485 }
3486 /* Fall through - ??? */
3489 {
3493 /* We need to check both for exact equality and tree equality. The
3494 former will be true if the operand has a side-effect. In that
3495 case, we know the operand occurred exactly once. */
3508 }
3512 }
3513 }
3514 \f
3515 /* Return a tree for the case when the result of an expression is RESULT
3516 converted to TYPE and OMITTED was previously an operand of the expression
3517 but is now not needed (e.g., we folded OMITTED * 0).
3519 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3520 the conversion of RESULT to TYPE. */
3522 tree
3524 {
3527 /* If the resulting operand is an empty statement, just return the omitted
3528 statement casted to void. */
3538 }
3540 /* Return a tree for the case when the result of an expression is RESULT
3541 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3542 of the expression but are now not needed.
3544 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3545 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3546 evaluated before OMITTED2. Otherwise, if neither has side effects,
3547 just do the conversion of RESULT to TYPE. */
3549 tree
3552 {
3561 }
3563 \f
3564 /* Return a simplified tree node for the truth-negation of ARG. This
3565 never alters ARG itself. We assume that ARG is an operation that
3566 returns a truth value (0 or 1).
3568 FIXME: one would think we would fold the result, but it causes
3569 problems with the dominator optimizer. */
3571 static tree
3573 {
3578 /* If this is a comparison, we can simply invert it, except for
3579 floating-point non-equality comparisons, in which case we just
3580 enclose a TRUTH_NOT_EXPR around what we have. */
3583 {
3586 && flag_trapping_math
3600 }
3603 {
3622 /* Here we can invert either operand. We invert the first operand
3623 unless the second operand is a TRUTH_NOT_EXPR in which case our
3624 result is the XOR of the first operand with the inside of the
3625 negation of the second operand. */
3630 else
3653 {
3660 /* A COND_EXPR may have a throw as one operand, which
3661 then has void type. Just leave void operands
3662 as they are. */
3668 }
3680 CASE_CONVERT:
3684 /* ... fall through ... */
3706 }
3707 }
3709 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3710 assume that ARG is an operation that returns a truth value (0 or 1
3711 for scalars, 0 or -1 for vectors). Return the folded expression if
3712 folding is successful. Otherwise, return NULL_TREE. */
3714 static tree
3716 {
3719 ? BIT_NOT_EXPR
3722 }
3724 /* Return a simplified tree node for the truth-negation of ARG. This
3725 never alters ARG itself. We assume that ARG is an operation that
3726 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3728 tree
3730 {
3736 ? BIT_NOT_EXPR
3739 }
3741 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3742 with code CODE. This optimization is unsafe. */
3743 static tree
3746 {
3750 /* (A / C) +- (B / C) -> (A +- B) / C. */
3760 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3765 {
3777 }
3780 }
3781 \f
3782 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3783 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
3784 and uses reverse storage order if REVERSEP is nonzero. */
3786 static tree
3790 {
3794 {
3801 }
3816 }
3818 /* Optimize a bit-field compare.
3820 There are two cases: First is a compare against a constant and the
3821 second is a comparison of two items where the fields are at the same
3822 bit position relative to the start of a chunk (byte, halfword, word)
3823 large enough to contain it. In these cases we can avoid the shift
3824 implicit in bitfield extractions.
3826 For constants, we emit a compare of the shifted constant with the
3827 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3828 compared. For two fields at the same position, we do the ANDs with the
3829 similar mask and compare the result of the ANDs.
3831 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3832 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3833 are the left and right operands of the comparison, respectively.
3835 If the optimization described above can be done, we return the resulting
3836 tree. Otherwise we return zero. */
3838 static tree
3841 {
3844 tree unsigned_type;
3851 tree mask;
3852 tree offset;
3854 /* Get all the information about the extractions being done. If the bit size
3855 if the same as the size of the underlying object, we aren't doing an
3856 extraction at all and so can do nothing. We also don't want to
3857 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3858 then will no longer be able to replace it. */
3867 else
3868 {
3869 /* If this is not a constant, we can only do something if bit positions,
3870 sizes, signedness and storage order are the same. */
3871 rinner
3879 }
3881 /* See if we can find a mode to refer to this field. We should be able to,
3882 but fail if we can't. */
3891 /* Set signed and unsigned types of the precision of this mode for the
3892 shifts below. */
3895 /* Compute the bit position and size for the new reference and our offset
3896 within it. If the new reference is the same size as the original, we
3897 won't optimize anything, so return zero. */
3907 /* Make the mask to be used against the extracted field. */
3914 /* If not comparing with constant, just rework the comparison
3915 and return. */
3919 unsigned_type,
3922 mask),
3925 unsigned_type,
3928 mask));
3930 /* Otherwise, we are handling the constant case. See if the constant is too
3931 big for the field. Warn and return a tree for 0 (false) if so. We do
3932 this not only for its own sake, but to avoid having to test for this
3933 error case below. If we didn't, we might generate wrong code.
3935 For unsigned fields, the constant shifted right by the field length should
3936 be all zero. For signed fields, the high-order bits should agree with
3937 the sign bit. */
3940 {
3942 {
3946 }
3947 }
3948 else
3949 {
3952 {
3956 }
3957 }
3959 /* Single-bit compares should always be against zero. */
3961 {
3964 }
3966 /* Make a new bitfield reference, shift the constant over the
3967 appropriate number of bits and mask it with the computed mask
3968 (in case this was a signed field). If we changed it, make a new one. */
3970 lreversep);
3976 mask);
3981 }
3982 \f
3983 /* Subroutine for fold_truth_andor_1: decode a field reference.
3985 If EXP is a comparison reference, we return the innermost reference.
3987 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
3988 set to the starting bit number.
3990 If the innermost field can be completely contained in a mode-sized
3991 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
3993 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
3994 otherwise it is not changed.
3996 *PUNSIGNEDP is set to the signedness of the field.
3998 *PREVERSEP is set to the storage order of the field.
4000 *PMASK is set to the mask used. This is either contained in a
4001 BIT_AND_EXPR or derived from the width of the field.
4003 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4005 Return 0 if this is not a component reference or is one that we can't
4006 do anything with. */
4008 static tree
4013 {
4017 tree unsigned_type;
4020 /* All the optimizations using this function assume integer fields.
4021 There are problems with FP fields since the type_for_size call
4022 below can fail for, e.g., XFmode. */
4026 /* We are interested in the bare arrangement of bits, so strip everything
4027 that doesn't affect the machine mode. However, record the type of the
4028 outermost expression if it may matter below. */
4035 {
4041 }
4050 /* If the number of bits in the reference is the same as the bitsize of
4051 the outer type, then the outer type gives the signedness. Otherwise
4052 (in case of a small bitfield) the signedness is unchanged. */
4056 /* Compute the mask to access the bitfield. */
4065 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4073 }
4075 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4076 bit positions and MASK is SIGNED. */
4078 static int
4080 {
4084 /* If this function returns true when the type of the mask is
4085 UNSIGNED, then there will be errors. In particular see
4086 gcc.c-torture/execute/990326-1.c. There does not appear to be
4087 any documentation paper trail as to why this is so. But the pre
4088 wide-int worked with that restriction and it has been preserved
4089 here. */
4094 }
4096 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4097 represents the sign bit of EXP's type. If EXP represents a sign
4098 or zero extension, also test VAL against the unextended type.
4099 The return value is the (sub)expression whose sign bit is VAL,
4100 or NULL_TREE otherwise. */
4102 tree
4104 {
4106 tree t;
4108 /* Tree EXP must have an integral type. */
4113 /* Tree VAL must be an integer constant. */
4122 /* Handle extension from a narrower type. */
4128 }
4130 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4131 to be evaluated unconditionally. */
4133 static int
4135 {
4136 /* Strip any conversions that don't change the machine mode. */
4145 /* Don't regard global variables as simple. They may be
4146 allocated in ways unknown to the compiler (shared memory,
4147 #pragma weak, etc). */
4150 /* Weakrefs are not safe to be read, since they can be NULL.
4151 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4152 have DECL_WEAK flag set. */
4154 /* Loading a static variable is unduly expensive, but global
4155 registers aren't expensive. */
4157 }
4159 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4160 to be evaluated unconditionally.
4161 I addition to simple_operand_p, we assume that comparisons, conversions,
4162 and logic-not operations are simple, if their operands are simple, too. */
4164 static bool
4166 {
4186 }
4188 \f
4189 /* The following functions are subroutines to fold_range_test and allow it to
4190 try to change a logical combination of comparisons into a range test.
4192 For example, both
4193 X == 2 || X == 3 || X == 4 || X == 5
4194 and
4195 X >= 2 && X <= 5
4196 are converted to
4197 (unsigned) (X - 2) <= 3
4199 We describe each set of comparisons as being either inside or outside
4200 a range, using a variable named like IN_P, and then describe the
4201 range with a lower and upper bound. If one of the bounds is omitted,
4202 it represents either the highest or lowest value of the type.
4204 In the comments below, we represent a range by two numbers in brackets
4205 preceded by a "+" to designate being inside that range, or a "-" to
4206 designate being outside that range, so the condition can be inverted by
4207 flipping the prefix. An omitted bound is represented by a "-". For
4208 example, "- [-, 10]" means being outside the range starting at the lowest
4209 possible value and ending at 10, in other words, being greater than 10.
4210 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4211 always false.
4213 We set up things so that the missing bounds are handled in a consistent
4214 manner so neither a missing bound nor "true" and "false" need to be
4215 handled using a special case. */
4217 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4218 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4219 and UPPER1_P are nonzero if the respective argument is an upper bound
4220 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4221 must be specified for a comparison. ARG1 will be converted to ARG0's
4222 type if both are specified. */
4224 static tree
4227 {
4228 tree tem;
4232 /* If neither arg represents infinity, do the normal operation.
4233 Else, if not a comparison, return infinity. Else handle the special
4234 comparison rules. Note that most of the cases below won't occur, but
4235 are handled for consistency. */
4238 {
4243 }
4248 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4249 for neither. In real maths, we cannot assume open ended ranges are
4250 the same. But, this is computer arithmetic, where numbers are finite.
4251 We can therefore make the transformation of any unbounded range with
4252 the value Z, Z being greater than any representable number. This permits
4253 us to treat unbounded ranges as equal. */
4257 {
4278 }
4281 }
4282 \f
4283 /* Helper routine for make_range. Perform one step for it, return
4284 new expression if the loop should continue or NULL_TREE if it should
4285 stop. */
4287 tree
4291 {
4297 {
4299 /* We can only do something if the range is testing for zero. */
4308 /* We can only do something if the range is testing for zero
4309 and if the second operand is an integer constant. Note that
4310 saying something is "in" the range we make is done by
4311 complementing IN_P since it will set in the initial case of
4312 being not equal to zero; "out" is leaving it alone. */
4319 {
4340 }
4342 /* If this is an unsigned comparison, we also know that EXP is
4343 greater than or equal to zero. We base the range tests we make
4344 on that fact, so we record it here so we can parse existing
4345 range tests. We test arg0_type since often the return type
4346 of, e.g. EQ_EXPR, is boolean. */
4348 {
4352 NULL_TREE))
4357 /* If the high bound is missing, but we have a nonzero low
4358 bound, reverse the range so it goes from zero to the low bound
4359 minus 1. */
4361 {
4366 }
4367 }
4375 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4376 low and high are non-NULL, then normalize will DTRT. */
4379 {
4384 }
4386 /* (-x) IN [a,b] -> x in [-b, -a] */
4398 /* ~ X -> -X - 1 */
4407 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4408 move a constant to the other side. */
4413 /* If EXP is signed, any overflow in the computation is undefined,
4414 so we don't worry about it so long as our computations on
4415 the bounds don't overflow. For unsigned, overflow is defined
4416 and this is exactly the right thing. */
4428 normalize:
4429 /* Check for an unsigned range which has wrapped around the maximum
4430 value thus making n_high < n_low, and normalize it. */
4432 {
4438 /* If the range is of the form +/- [ x+1, x ], we won't
4439 be able to normalize it. But then, it represents the
4440 whole range or the empty set, so make it
4441 +/- [ -, - ]. */
4445 else
4447 }
4448 else
4456 CASE_CONVERT:
4474 /* If we're converting arg0 from an unsigned type, to exp,
4475 a signed type, we will be doing the comparison as unsigned.
4476 The tests above have already verified that LOW and HIGH
4477 are both positive.
4479 So we have to ensure that we will handle large unsigned
4480 values the same way that the current signed bounds treat
4481 negative values. */
4484 {
4485 tree high_positive;
4486 tree equiv_type;
4487 /* For fixed-point modes, we need to pass the saturating flag
4488 as the 2nd parameter. */
4490 equiv_type
4493 else
4494 equiv_type
4497 /* A range without an upper bound is, naturally, unbounded.
4498 Since convert would have cropped a very large value, use
4499 the max value for the destination type. */
4500 high_positive
4507 high_positive),
4510 /* If the low bound is specified, "and" the range with the
4511 range for which the original unsigned value will be
4512 positive. */
4514 {
4517 integer_zero_node),
4518 high_positive))
4522 }
4523 else
4524 {
4525 /* Otherwise, "or" the range with the range of the input
4526 that will be interpreted as negative. */
4529 integer_zero_node),
4530 high_positive))
4534 }
4535 }
4544 }
4545 }
4547 /* Given EXP, a logical expression, set the range it is testing into
4548 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4549 actually being tested. *PLOW and *PHIGH will be made of the same
4550 type as the returned expression. If EXP is not a comparison, we
4551 will most likely not be returning a useful value and range. Set
4552 *STRICT_OVERFLOW_P to true if the return value is only valid
4553 because signed overflow is undefined; otherwise, do not change
4554 *STRICT_OVERFLOW_P. */
4556 tree
4559 {
4567 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4568 and see if we can refine the range. Some of the cases below may not
4569 happen, but it doesn't seem worth worrying about this. We "continue"
4570 the outer loop when we've changed something; otherwise we "break"
4571 the switch, which will "break" the while. */
4577 {
4583 {
4591 }
4600 }
4602 /* If EXP is a constant, we can evaluate whether this is true or false. */
4604 {
4611 }
4615 }
4616 \f
4617 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4618 type, TYPE, return an expression to test if EXP is in (or out of, depending
4619 on IN_P) the range. Return 0 if the test couldn't be created. */
4621 tree
4624 {
4627 /* Disable this optimization for function pointer expressions
4628 on targets that require function pointer canonicalization. */
4635 {
4641 }
4659 {
4661 {
4665 }
4667 }
4669 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4671 {
4675 {
4677 {
4680 etype
4682 else
4685 }
4688 }
4689 }
4691 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4692 This requires wrap-around arithmetics for the type of the expression.
4693 First make sure that arithmetics in this type is valid, then make sure
4694 that it wraps around. */
4700 {
4703 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4704 for the type in question, as we rely on this here. */
4714 else
4716 }
4726 {
4728 {
4733 }
4735 }
4743 }
4744 \f
4745 /* Return the predecessor of VAL in its type, handling the infinite case. */
4747 static tree
4749 {
4755 else
4758 }
4760 /* Return the successor of VAL in its type, handling the infinite case. */
4762 static tree
4764 {
4770 else
4773 }
4775 /* Given two ranges, see if we can merge them into one. Return 1 if we
4776 can, 0 if we can't. Set the output range into the specified parameters. */
4778 bool
4781 {
4785 tree tem;
4795 /* Make range 0 be the range that starts first, or ends last if they
4796 start at the same value. Swap them if it isn't. */
4799 || (lowequal
4802 {
4806 }
4808 /* Now flag two cases, whether the ranges are disjoint or whether the
4809 second range is totally subsumed in the first. Note that the tests
4810 below are simplified by the ones above. */
4816 /* We now have four cases, depending on whether we are including or
4817 excluding the two ranges. */
4819 {
4820 /* If they don't overlap, the result is false. If the second range
4821 is a subset it is the result. Otherwise, the range is from the start
4822 of the second to the end of the first. */
4827 else
4829 }
4832 {
4833 /* If they don't overlap, the result is the first range. If they are
4834 equal, the result is false. If the second range is a subset of the
4835 first, and the ranges begin at the same place, we go from just after
4836 the end of the second range to the end of the first. If the second
4837 range is not a subset of the first, or if it is a subset and both
4838 ranges end at the same place, the range starts at the start of the
4839 first range and ends just before the second range.
4840 Otherwise, we can't describe this as a single range. */
4846 {
4851 {
4852 /* We are in the weird situation where high0 > high1 but
4853 high1 has no successor. Punt. */
4855 }
4856 }
4858 {
4863 {
4864 /* low0 < low1 but low1 has no predecessor. Punt. */
4866 }
4867 }
4868 else
4870 }
4873 {
4874 /* If they don't overlap, the result is the second range. If the second
4875 is a subset of the first, the result is false. Otherwise,
4876 the range starts just after the first range and ends at the
4877 end of the second. */
4882 else
4883 {
4888 {
4889 /* high1 > high0 but high0 has no successor. Punt. */
4891 }
4892 }
4893 }
4895 else
4896 {
4897 /* The case where we are excluding both ranges. Here the complex case
4898 is if they don't overlap. In that case, the only time we have a
4899 range is if they are adjacent. If the second is a subset of the
4900 first, the result is the first. Otherwise, the range to exclude
4901 starts at the beginning of the first range and ends at the end of the
4902 second. */
4904 {
4909 else
4910 {
4911 /* Canonicalize - [min, x] into - [-, x]. */
4914 {
4919 /* FALLTHROUGH */
4932 }
4934 /* Canonicalize - [x, max] into - [x, -]. */
4937 {
4942 /* FALLTHROUGH */
4958 }
4960 /* The ranges might be also adjacent between the maximum and
4961 minimum values of the given type. For
4962 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
4963 return + [x + 1, y - 1]. */
4965 {
4972 }
4973 else
4975 }
4976 }
4979 else
4981 }
4985 }
4986 \f
4988 /* Subroutine of fold, looking inside expressions of the form
4989 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
4990 of the COND_EXPR. This function is being used also to optimize
4991 A op B ? C : A, by reversing the comparison first.
4993 Return a folded expression whose code is not a COND_EXPR
4994 anymore, or NULL_TREE if no folding opportunity is found. */
4996 static tree
4999 {
5004 tree tem;
5009 /* If we have A op 0 ? A : -A, consider applying the following
5010 transformations:
5012 A == 0? A : -A same as -A
5013 A != 0? A : -A same as A
5014 A >= 0? A : -A same as abs (A)
5015 A > 0? A : -A same as abs (A)
5016 A <= 0? A : -A same as -abs (A)
5017 A < 0? A : -A same as -abs (A)
5019 None of these transformations work for modes with signed
5020 zeros. If A is +/-0, the first two transformations will
5021 change the sign of the result (from +0 to -0, or vice
5022 versa). The last four will fix the sign of the result,
5023 even though the original expressions could be positive or
5024 negative, depending on the sign of A.
5026 Note that all these transformations are correct if A is
5027 NaN, since the two alternatives (A and -A) are also NaNs. */
5034 /* In the case that A is of the form X-Y, '-A' (arg2) may
5035 have already been folded to Y-X, check for that. */
5043 {
5057 /* Fall through. */
5077 }
5079 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5080 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5081 both transformations are correct when A is NaN: A != 0
5082 is then true, and A == 0 is false. */
5086 {
5091 }
5093 /* Try some transformations of A op B ? A : B.
5095 A == B? A : B same as B
5096 A != B? A : B same as A
5097 A >= B? A : B same as max (A, B)
5098 A > B? A : B same as max (B, A)
5099 A <= B? A : B same as min (A, B)
5100 A < B? A : B same as min (B, A)
5102 As above, these transformations don't work in the presence
5103 of signed zeros. For example, if A and B are zeros of
5104 opposite sign, the first two transformations will change
5105 the sign of the result. In the last four, the original
5106 expressions give different results for (A=+0, B=-0) and
5107 (A=-0, B=+0), but the transformed expressions do not.
5109 The first two transformations are correct if either A or B
5110 is a NaN. In the first transformation, the condition will
5111 be false, and B will indeed be chosen. In the case of the
5112 second transformation, the condition A != B will be true,
5113 and A will be chosen.
5115 The conversions to max() and min() are not correct if B is
5116 a number and A is not. The conditions in the original
5117 expressions will be false, so all four give B. The min()
5118 and max() versions would give a NaN instead. */
5121 /* Avoid these transformations if the COND_EXPR may be used
5122 as an lvalue in the C++ front-end. PR c++/19199. */
5123 && (in_gimple_form
5129 {
5134 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
5136 {
5140 }
5143 {
5152 /* In C++ a ?: expression can be an lvalue, so put the
5153 operand which will be used if they are equal first
5154 so that we can convert this back to the
5155 corresponding COND_EXPR. */
5157 {
5166 }
5173 {
5182 }
5197 }
5198 }
5200 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5201 we might still be able to simplify this. For example,
5202 if C1 is one less or one more than C2, this might have started
5203 out as a MIN or MAX and been transformed by this function.
5204 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5210 {
5214 /* We can replace A with C1 in this case. */
5219 /* If C1 is C2 + 1, this is min(A, C2), but use ARG00's type for
5220 MIN_EXPR, to preserve the signedness of the comparison. */
5222 OEP_ONLY_CONST)
5226 OEP_ONLY_CONST))
5227 {
5230 arg2));
5233 }
5237 /* If C1 is C2 - 1, this is min(A, C2), with the same care
5238 as above. */
5240 OEP_ONLY_CONST)
5244 OEP_ONLY_CONST))
5245 {
5248 arg2));
5251 }
5255 /* If C1 is C2 - 1, this is max(A, C2), but use ARG00's type for
5256 MAX_EXPR, to preserve the signedness of the comparison. */
5258 OEP_ONLY_CONST)
5262 OEP_ONLY_CONST))
5263 {
5266 arg2));
5268 }
5272 /* If C1 is C2 + 1, this is max(A, C2), with the same care as above. */
5274 OEP_ONLY_CONST)
5278 OEP_ONLY_CONST))
5279 {
5282 arg2));
5284 }
5290 }
5293 }
5296 \f
5297 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5298 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5299 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5300 false) >= 2)
5301 #endif
5303 /* EXP is some logical combination of boolean tests. See if we can
5304 merge it into some range test. Return the new tree if so. */
5306 static tree
5309 {
5325 /* If this is an OR operation, invert both sides; we will invert
5326 again at the end. */
5330 /* If both expressions are the same, if we can merge the ranges, and we
5331 can build the range test, return it or it inverted. If one of the
5332 ranges is always true or always false, consider it to be the same
5333 expression as the other. */
5341 {
5345 }
5347 /* On machines where the branch cost is expensive, if this is a
5348 short-circuited branch and the underlying object on both sides
5349 is the same, make a non-short-circuit operation. */
5355 {
5356 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5357 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5358 which cases we can't do this. */
5366 {
5375 {
5378 WARN_STRICT_OVERFLOW_COMPARISON);
5382 }
5383 }
5384 }
5387 }
5388 \f
5389 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5390 bit value. Arrange things so the extra bits will be set to zero if and
5391 only if C is signed-extended to its full width. If MASK is nonzero,
5392 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5394 static tree
5396 {
5399 tree temp;
5404 /* We work by getting just the sign bit into the low-order bit, then
5405 into the high-order bit, then sign-extend. We then XOR that value
5406 with C. */
5409 /* We must use a signed type in order to get an arithmetic right shift.
5410 However, we must also avoid introducing accidental overflows, so that
5411 a subsequent call to integer_zerop will work. Hence we must
5412 do the type conversion here. At this point, the constant is either
5413 zero or one, and the conversion to a signed type can never overflow.
5414 We could get an overflow if this conversion is done anywhere else. */
5423 /* If necessary, convert the type back to match the type of C. */
5428 }
5429 \f
5430 /* For an expression that has the form
5431 (A && B) || ~B
5432 or
5433 (A || B) && ~B,
5434 we can drop one of the inner expressions and simplify to
5435 A || ~B
5436 or
5437 A && ~B
5438 LOC is the location of the resulting expression. OP is the inner
5439 logical operation; the left-hand side in the examples above, while CMPOP
5440 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5441 removing a condition that guards another, as in
5442 (A != NULL && A->...) || A == NULL
5443 which we must not transform. If RHS_ONLY is true, only eliminate the
5444 right-most operand of the inner logical operation. */
5446 static tree
5449 {
5467 {
5470 {
5473 }
5474 }
5476 {
5479 {
5482 }
5483 }
5498 }
5500 /* Find ways of folding logical expressions of LHS and RHS:
5501 Try to merge two comparisons to the same innermost item.
5502 Look for range tests like "ch >= '0' && ch <= '9'".
5503 Look for combinations of simple terms on machines with expensive branches
5504 and evaluate the RHS unconditionally.
5506 For example, if we have p->a == 2 && p->b == 4 and we can make an
5507 object large enough to span both A and B, we can do this with a comparison
5508 against the object ANDed with the a mask.
5510 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5511 operations to do this with one comparison.
5513 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5514 function and the one above.
5516 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5517 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5519 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5520 two operands.
5522 We return the simplified tree or 0 if no optimization is possible. */
5524 static tree
5527 {
5528 /* If this is the "or" of two comparisons, we can do something if
5529 the comparisons are NE_EXPR. If this is the "and", we can do something
5530 if the comparisons are EQ_EXPR. I.e.,
5531 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5533 WANTED_CODE is this operation code. For single bit fields, we can
5534 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5535 comparison for one-bit fields. */
5556 /* Start by getting the comparison codes. Fail if anything is volatile.
5557 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5558 it were surrounded with a NE_EXPR. */
5567 {
5571 }
5574 {
5578 }
5589 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5592 {
5595 {
5600 }
5603 {
5609 }
5610 }
5615 /* If the RHS can be evaluated unconditionally and its operands are
5616 simple, it wins to evaluate the RHS unconditionally on machines
5617 with expensive branches. In this case, this isn't a comparison
5618 that can be merged. */
5625 {
5626 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5637 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5647 }
5649 /* See if the comparisons can be merged. Then get all the parameters for
5650 each side. */
5675 /* It must be true that the inner operation on the lhs of each
5676 comparison must be the same if we are to be able to do anything.
5677 Then see if we have constants. If not, the same must be true for
5678 the rhs's. */
5687 {
5690 }
5695 else
5698 /* If either comparison code is not correct for our logical operation,
5699 fail. However, we can convert a one-bit comparison against zero into
5700 the opposite comparison against that bit being set in the field. */
5704 {
5706 {
5707 /* Make the left operand unsigned, since we are only interested
5708 in the value of one bit. Otherwise we are doing the wrong
5709 thing below. */
5712 }
5713 else
5715 }
5717 /* This is analogous to the code for l_const above. */
5719 {
5721 {
5724 }
5725 else
5727 }
5729 /* See if we can find a mode that contains both fields being compared on
5730 the left. If we can't, fail. Otherwise, update all constants and masks
5731 to be relative to a field of that size. */
5736 volatilep);
5746 {
5749 }
5757 {
5764 {
5768 }
5769 }
5771 {
5778 {
5782 }
5783 }
5785 /* If the right sides are not constant, do the same for it. Also,
5786 disallow this optimization if a size or signedness mismatch occurs
5787 between the left and right sides. */
5789 {
5792 /* Make sure the two fields on the right
5793 correspond to the left without being swapped. */
5801 volatilep);
5811 {
5814 }
5823 /* Make a mask that corresponds to both fields being compared.
5824 Do this for both items being compared. If the operands are the
5825 same size and the bits being compared are in the same position
5826 then we can do this by masking both and comparing the masked
5827 results. */
5831 {
5843 }
5845 /* There is still another way we can do something: If both pairs of
5846 fields being compared are adjacent, we may be able to make a wider
5847 field containing them both.
5849 Note that we still must mask the lhs/rhs expressions. Furthermore,
5850 the mask must be shifted to account for the shift done by
5851 make_bit_field_ref. */
5856 {
5857 tree type;
5873 /* Convert to the smaller type before masking out unwanted bits. */
5876 {
5878 {
5882 }
5884 {
5888 }
5889 }
5898 }
5901 }
5903 /* Handle the case of comparisons with constants. If there is something in
5904 common between the masks, those bits of the constants must be the same.
5905 If not, the condition is always false. Test for this to avoid generating
5906 incorrect code below. */
5911 {
5913 {
5916 }
5917 else
5918 {
5921 }
5922 }
5924 /* Construct the expression we will return. First get the component
5925 reference we will make. Unless the mask is all ones the width of
5926 that field, perform the mask operation. Then compare with the
5927 merged constant. */
5937 }
5938 \f
5939 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
5940 constant. */
5942 static tree
5945 {
5948 tree comp_const;
5949 tree minmax_const;
5951 tree inner;
5962 /* If something does not permit us to optimize, return the original tree. */
5970 /* Now handle all the various comparison codes. We only handle EQ_EXPR
5971 and GT_EXPR, doing the rest with recursive calls using logical
5972 simplifications. */
5974 {
5976 {
5977 tree tem
5984 }
5987 return
5989 optimize_minmax_comparison
5991 optimize_minmax_comparison
5996 /* MAX (X, 0) == 0 -> X <= 0 */
6000 /* MAX (X, 0) == 5 -> X == 5 */
6004 /* MAX (X, 0) == -1 -> false */
6008 /* MIN (X, 0) == 0 -> X >= 0 */
6012 /* MIN (X, 0) == 5 -> false */
6015 else
6016 /* MIN (X, 0) == -1 -> X == -1 */
6021 /* MAX (X, 0) > 0 -> X > 0
6022 MAX (X, 0) > 5 -> X > 5 */
6026 /* MAX (X, 0) > -1 -> true */
6030 /* MIN (X, 0) > 0 -> false
6031 MIN (X, 0) > 5 -> false */
6034 else
6035 /* MIN (X, 0) > -1 -> X > -1 */
6040 }
6041 }
6042 \f
6043 /* T is an integer expression that is being multiplied, divided, or taken a
6044 modulus (CODE says which and what kind of divide or modulus) by a
6045 constant C. See if we can eliminate that operation by folding it with
6046 other operations already in T. WIDE_TYPE, if non-null, is a type that
6047 should be used for the computation if wider than our type.
6049 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
6050 (X * 2) + (Y * 4). We must, however, be assured that either the original
6051 expression would not overflow or that overflow is undefined for the type
6052 in the language in question.
6054 If we return a non-null expression, it is an equivalent form of the
6055 original computation, but need not be in the original type.
6057 We set *STRICT_OVERFLOW_P to true if the return values depends on
6058 signed overflow being undefined. Otherwise we do not change
6059 *STRICT_OVERFLOW_P. */
6061 static tree
6064 {
6065 /* To avoid exponential search depth, refuse to allow recursion past
6066 three levels. Beyond that (1) it's highly unlikely that we'll find
6067 something interesting and (2) we've probably processed it before
6068 when we built the inner expression. */
6071 tree ret;
6076 depth++;
6078 depth--;
6081 }
6083 static tree
6086 {
6097 /* Don't deal with constants of zero here; they confuse the code below. */
6107 /* Note that we need not handle conditional operations here since fold
6108 already handles those cases. So just do arithmetic here. */
6110 {
6112 /* For a constant, we can always simplify if we are a multiply
6113 or (for divide and modulus) if it is a multiple of our constant. */
6116 {
6119 /* If the multiplication overflowed, we lost information on it.
6120 See PR68142 and PR69845. */
6124 }
6128 /* If op0 is an expression ... */
6134 /* ... and has wrapping overflow, and its type is smaller
6135 than ctype, then we cannot pass through as widening. */
6140 /* ... or this is a truncation (t is narrower than op0),
6141 then we cannot pass through this narrowing. */
6144 /* ... or signedness changes for division or modulus,
6145 then we cannot pass through this conversion. */
6149 /* ... or has undefined overflow while the converted to
6150 type has not, we cannot do the operation in the inner type
6151 as that would introduce undefined overflow. */
6157 /* Pass the constant down and see if we can make a simplification. If
6158 we can, replace this expression with the inner simplification for
6159 possible later conversion to our or some other type. */
6164 code == MULT_EXPR
6166 strict_overflow_p))))
6171 /* If widening the type changes it from signed to unsigned, then we
6172 must avoid building ABS_EXPR itself as unsigned. */
6174 {
6178 {
6181 }
6183 }
6184 /* If the constant is negative, we cannot simplify this. */
6187 /* FALLTHROUGH */
6189 /* For division and modulus, type can't be unsigned, as e.g.
6190 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6191 For signed types, even with wrapping overflow, this is fine. */
6200 /* If widening the type changes the signedness, then we can't perform
6201 this optimization as that changes the result. */
6205 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6211 {
6218 }
6222 /* If the second operand is constant, this is a multiplication
6223 or floor division, by a power of two, so we can treat it that
6224 way unless the multiplier or divisor overflows. Signed
6225 left-shift overflow is implementation-defined rather than
6226 undefined in C90, so do not convert signed left shift into
6227 multiplication. */
6230 /* const_binop may not detect overflow correctly,
6231 so check for it explicitly here. */
6235 size_one_node,
6236 op1)))
6240 ctype,
6242 t1),
6247 /* See if we can eliminate the operation on both sides. If we can, we
6248 can return a new PLUS or MINUS. If we can't, the only remaining
6249 cases where we can do anything are if the second operand is a
6250 constant. */
6256 /* If not multiplication, we can only do this if both operands
6257 are divisible by c. */
6260 {
6265 }
6267 /* If this was a subtraction, negate OP1 and set it to be an addition.
6268 This simplifies the logic below. */
6270 {
6272 /* If OP1 was not easily negatable, the constant may be OP0. */
6274 {
6277 }
6278 }
6283 /* If either OP1 or C are negative, this optimization is not safe for
6284 some of the division and remainder types while for others we need
6285 to change the code. */
6287 {
6295 }
6297 /* If it's a multiply or a division/modulus operation of a multiple
6298 of our constant, do the operation and verify it doesn't overflow. */
6301 {
6304 /* We allow the constant to overflow with wrapping semantics. */
6308 }
6309 else
6312 /* If we have an unsigned type, we cannot widen the operation since it
6313 will change the result if the original computation overflowed. */
6317 /* If we were able to eliminate our operation from the first side,
6318 apply our operation to the second side and reform the PLUS. */
6322 /* The last case is if we are a multiply. In that case, we can
6323 apply the distributive law to commute the multiply and addition
6324 if the multiplication of the constants doesn't overflow
6325 and overflow is defined. With undefined overflow
6326 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6332 op1);
6337 /* We have a special case here if we are doing something like
6338 (C * 8) % 4 since we know that's zero. */
6341 /* If the multiplication can overflow we cannot optimize this. */
6345 {
6348 }
6350 /* ... fall through ... */
6354 /* If we can extract our operation from the LHS, do so and return a
6355 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6356 do something only if the second operand is a constant. */
6370 /* If these are the same operation types, we can associate them
6371 assuming no overflow. */
6373 {
6390 }
6392 /* If these operations "cancel" each other, we have the main
6393 optimizations of this pass, which occur when either constant is a
6394 multiple of the other, in which case we replace this with either an
6395 operation or CODE or TCODE.
6397 If we have an unsigned type, we cannot do this since it will change
6398 the result if the original computation overflowed. */
6405 {
6407 {
6414 }
6416 {
6423 }
6424 }
6429 }
6432 }
6433 \f
6434 /* Return a node which has the indicated constant VALUE (either 0 or
6435 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6436 and is of the indicated TYPE. */
6438 tree
6440 {
6449 else
6451 }
6454 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6455 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6456 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6457 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6458 COND is the first argument to CODE; otherwise (as in the example
6459 given here), it is the second argument. TYPE is the type of the
6460 original expression. Return NULL_TREE if no simplification is
6461 possible. */
6463 static tree
6468 {
6478 {
6482 /* If this operand throws an expression, then it does not make
6483 sense to try to perform a logical or arithmetic operation
6484 involving it. */
6489 }
6492 {
6497 }
6498 else
6499 /* Detect the case of mixing vector and scalar types - bail out. */
6505 /* This transformation is only worthwhile if we don't have to wrap ARG
6506 in a SAVE_EXPR and the operation can be simplified without recursing
6507 on at least one of the branches once its pushed inside the COND_EXPR. */
6516 {
6520 else
6522 }
6524 {
6528 else
6530 }
6532 /* Check that we have simplified at least one of the branches. */
6537 }
6539 \f
6540 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6542 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6543 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6544 ADDEND is the same as X.
6546 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6547 and finite. The problematic cases are when X is zero, and its mode
6548 has signed zeros. In the case of rounding towards -infinity,
6549 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6550 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6552 bool
6554 {
6558 /* Don't allow the fold with -fsignaling-nans. */
6562 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6566 /* In a vector or complex, we would need to check the sign of all zeros. */
6570 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6574 /* The mode has signed zeros, and we have to honor their sign.
6575 In this situation, there is only one case we can return true for.
6576 X - 0 is the same as X unless rounding towards -infinity is
6577 supported. */
6579 }
6581 /* Subroutine of fold() that optimizes comparisons of a division by
6582 a nonzero integer constant against an integer constant, i.e.
6583 X/C1 op C2.
6585 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6586 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6587 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6589 The function returns the constant folded tree if a simplification
6590 can be made, and NULL_TREE otherwise. */
6592 static tree
6595 {
6603 /* We have to do this the hard way to detect unsigned overflow.
6604 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6610 {
6615 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6619 }
6621 {
6625 {
6644 }
6645 }
6646 else
6647 {
6648 /* A negative divisor reverses the relational operators. */
6654 {
6673 }
6674 }
6677 {
6698 {
6701 }
6706 {
6709 }
6714 {
6717 }
6722 {
6725 }
6730 }
6733 }
6736 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6737 equality/inequality test, then return a simplified form of the test
6738 using a sign testing. Otherwise return NULL. TYPE is the desired
6739 result type. */
6741 static tree
6744 tree result_type)
6745 {
6746 /* If this is testing a single bit, we can optimize the test. */
6750 {
6751 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6752 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6756 /* This is only a win if casting to a signed type is cheap,
6757 i.e. when arg00's type is not a partial mode. */
6760 {
6763 result_type,
6766 }
6767 }
6770 }
6772 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6773 equality/inequality test, then return a simplified form of
6774 the test using shifts and logical operations. Otherwise return
6775 NULL. TYPE is the desired result type. */
6777 tree
6780 {
6781 /* If this is testing a single bit, we can optimize the test. */
6785 {
6794 /* First, see if we can fold the single bit test into a sign-bit
6795 test. */
6797 result_type);
6801 /* Otherwise we have (A & C) != 0 where C is a single bit,
6802 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6803 Similarly for (A & C) == 0. */
6805 /* If INNER is a right shift of a constant and it plus BITNUM does
6806 not overflow, adjust BITNUM and INNER. */
6812 {
6815 }
6817 /* If we are going to be able to omit the AND below, we must do our
6818 operations as unsigned. If we must use the AND, we have a choice.
6819 Normally unsigned is faster, but for some machines signed is. */
6837 /* Put the AND last so it can combine with more things. */
6840 /* Make sure to return the proper type. */
6844 }
6846 }
6848 /* Check whether we are allowed to reorder operands arg0 and arg1,
6849 such that the evaluation of arg1 occurs before arg0. */
6851 static bool
6853 {
6860 }
6862 /* Test whether it is preferable two swap two operands, ARG0 and
6863 ARG1, for example because ARG0 is an integer constant and ARG1
6864 isn't. If REORDER is true, only recommend swapping if we can
6865 evaluate the operands in reverse order. */
6867 bool
6869 {
6887 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6888 for commutative and comparison operators. Ensuring a canonical
6889 form allows the optimizers to find additional redundancies without
6890 having to explicitly check for both orderings. */
6896 /* Put SSA_NAMEs last. */
6902 /* Put variables last. */
6909 }
6912 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6913 means A >= Y && A != MAX, but in this case we know that
6914 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6916 static tree
6918 {
6925 else
6934 {
6937 }
6939 {
6942 }
6943 else
6950 {
6951 /* Convert the pointer types into integer before taking the difference. */
6955 }
6956 else
6963 }
6965 /* Fold a sum or difference of at least one multiplication.
6966 Returns the folded tree or NULL if no simplification could be made. */
6968 static tree
6971 {
6975 /* (A * C) +- (B * C) -> (A+-B) * C.
6976 (A * C) +- A -> A * (C+-1).
6977 We are most concerned about the case where C is a constant,
6978 but other combinations show up during loop reduction. Since
6979 it is not difficult, try all four possibilities. */
6982 {
6985 }
6987 {
6990 }
6991 else
6992 {
6993 /* We cannot generate constant 1 for fract. */
6998 }
7000 {
7003 }
7005 {
7007 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7008 the purpose of this canonicalization. */
7012 {
7015 }
7016 else
7018 }
7019 else
7020 {
7021 /* We cannot generate constant 1 for fract. */
7026 }
7038 /* No identical multiplicands; see if we can find a common
7039 power-of-two factor in non-power-of-two multiplies. This
7040 can help in multi-dimensional array access. */
7043 {
7046 tree maybe_same;
7050 /* Move min of absolute values to int11. */
7052 {
7057 }
7058 else
7062 /* The remainder should not be a constant, otherwise we
7063 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7064 increased the number of multiplications necessary. */
7066 {
7074 }
7075 }
7085 }
7087 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7088 specified by EXPR into the buffer PTR of length LEN bytes.
7089 Return the number of bytes placed in the buffer, or zero
7090 upon failure. */
7092 static int
7094 {
7108 {
7110 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7111 number of bytes. */
7115 {
7122 else
7124 }
7125 else
7130 }
7132 }
7135 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7136 specified by EXPR into the buffer PTR of length LEN bytes.
7137 Return the number of bytes placed in the buffer, or zero
7138 upon failure. */
7140 static int
7142 {
7146 FIXED_VALUE_TYPE value;
7162 }
7165 /* Subroutine of native_encode_expr. Encode the REAL_CST
7166 specified by EXPR into the buffer PTR of length LEN bytes.
7167 Return the number of bytes placed in the buffer, or zero
7168 upon failure. */
7170 static int
7172 {
7178 /* There are always 32 bits in each long, no matter the size of
7179 the hosts long. We handle floating point representations with
7180 up to 192 bits. */
7194 {
7199 {
7206 else
7208 }
7209 else
7215 }
7217 }
7219 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7220 specified by EXPR into the buffer PTR of length LEN bytes.
7221 Return the number of bytes placed in the buffer, or zero
7222 upon failure. */
7224 static int
7226 {
7228 tree part;
7243 }
7246 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7247 specified by EXPR into the buffer PTR of length LEN bytes.
7248 Return the number of bytes placed in the buffer, or zero
7249 upon failure. */
7251 static int
7253 {
7263 {
7265 {
7268 }
7279 }
7281 }
7284 /* Subroutine of native_encode_expr. Encode the STRING_CST
7285 specified by EXPR into the buffer PTR of length LEN bytes.
7286 Return the number of bytes placed in the buffer, or zero
7287 upon failure. */
7289 static int
7291 {
7293 HOST_WIDE_INT total_bytes;
7307 {
7310 {
7313 }
7316 }
7317 else
7320 }
7323 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7324 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7325 buffer PTR of length LEN bytes. If OFF is not -1 then start
7326 the encoding at byte offset OFF and encode at most LEN bytes.
7327 Return the number of bytes placed in the buffer, or zero upon failure. */
7329 int
7331 {
7332 /* We don't support starting at negative offset and -1 is special. */
7337 {
7358 }
7359 }
7362 /* Subroutine of native_interpret_expr. Interpret the contents of
7363 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7364 If the buffer cannot be interpreted, return NULL_TREE. */
7366 static tree
7368 {
7378 }
7381 /* Subroutine of native_interpret_expr. Interpret the contents of
7382 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7383 If the buffer cannot be interpreted, return NULL_TREE. */
7385 static tree
7387 {
7389 double_int result;
7390 FIXED_VALUE_TYPE fixed_value;
7400 }
7403 /* Subroutine of native_interpret_expr. Interpret the contents of
7404 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7405 If the buffer cannot be interpreted, return NULL_TREE. */
7407 static tree
7409 {
7413 /* There are always 32 bits in each long, no matter the size of
7414 the hosts long. We handle floating point representations with
7415 up to 192 bits. */
7416 REAL_VALUE_TYPE r;
7427 {
7428 /* Both OFFSET and BYTE index within a long;
7429 bitpos indexes the whole float. */
7432 {
7439 else
7441 }
7442 else
7443 {
7446 {
7447 /* Reverse bytes within each long, or within the entire float
7448 if it's smaller than a long (for HFmode). */
7451 }
7452 }
7456 }
7460 }
7463 /* Subroutine of native_interpret_expr. Interpret the contents of
7464 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7465 If the buffer cannot be interpreted, return NULL_TREE. */
7467 static tree
7469 {
7484 }
7487 /* Subroutine of native_interpret_expr. Interpret the contents of
7488 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7489 If the buffer cannot be interpreted, return NULL_TREE. */
7491 static tree
7493 {
7506 {
7511 }
7513 }
7516 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7517 the buffer PTR of length LEN as a constant of type TYPE. For
7518 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7519 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7520 return NULL_TREE. */
7522 tree
7524 {
7526 {
7548 }
7549 }
7551 /* Returns true if we can interpret the contents of a native encoding
7552 as TYPE. */
7554 static bool
7556 {
7558 {
7571 }
7572 }
7574 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7575 TYPE at compile-time. If we're unable to perform the conversion
7576 return NULL_TREE. */
7578 static tree
7580 {
7581 /* We support up to 512-bit values (for V8DFmode). */
7585 /* Check that the host and target are sane. */
7594 }
7596 /* Build an expression for the address of T. Folds away INDIRECT_REF
7597 to avoid confusing the gimplify process. */
7599 tree
7601 {
7602 /* The size of the object is not relevant when talking about its address. */
7607 {
7612 }
7622 {
7627 }
7628 else
7632 }
7634 /* Build an expression for the address of T. */
7636 tree
7638 {
7642 }
7644 /* Fold a unary expression of code CODE and type TYPE with operand
7645 OP0. Return the folded expression if folding is successful.
7646 Otherwise, return NULL_TREE. */
7648 tree
7650 {
7651 tree tem;
7652 tree arg0;
7660 {
7663 {
7664 /* Don't use STRIP_NOPS, because signedness of argument type
7665 matters. */
7667 }
7668 else
7669 {
7670 /* Strip any conversions that don't change the mode. This
7671 is safe for every expression, except for a comparison
7672 expression because its signedness is derived from its
7673 operands.
7675 Note that this is done as an internal manipulation within
7676 the constant folder, in order to find the simplest
7677 representation of the arguments so that their form can be
7678 studied. In any cases, the appropriate type conversions
7679 should be put back in the tree that will get out of the
7680 constant folder. */
7682 }
7685 {
7688 {
7692 }
7693 }
7694 }
7701 {
7708 {
7722 /* If this was a conversion, and all we did was to move into
7723 inside the COND_EXPR, bring it back out. But leave it if
7724 it is a conversion from integer to integer and the
7725 result precision is no wider than a word since such a
7726 conversion is cheap and may be optimized away by combine,
7727 while it couldn't if it were outside the COND_EXPR. Then return
7728 so we don't get into an infinite recursion loop taking the
7729 conversion out and then back in. */
7741 && (INTEGRAL_TYPE_P
7754 }
7755 }
7758 {
7764 CASE_CONVERT:
7768 {
7769 /* If we have (type) (a CMP b) and type is an integral type, return
7770 new expression involving the new type. Canonicalize
7771 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7772 non-integral type.
7773 Do not fold the result as that would not simplify further, also
7774 folding again results in recursions. */
7784 }
7786 /* Handle (T *)&A.B.C for A being of type T and B and C
7787 living at offset zero. This occurs frequently in
7788 C++ upcasting and then accessing the base. */
7792 {
7794 tree offset;
7795 machine_mode mode;
7797 tree base
7801 /* If the reference was to a (constant) zero offset, we can use
7802 the address of the base if it has the same base type
7803 as the result type and the pointer type is unqualified. */
7810 }
7814 /* Detect assigning a bitfield. */
7816 && DECL_BIT_FIELD
7818 {
7819 /* Don't leave an assignment inside a conversion
7820 unless assigning a bitfield. */
7822 /* First do the assignment, then return converted constant. */
7827 }
7829 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7830 constants (if x has signed type, the sign bit cannot be set
7831 in c). This folds extension into the BIT_AND_EXPR.
7832 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7833 very likely don't have maximal range for their precision and this
7834 transformation effectively doesn't preserve non-maximal ranges. */
7838 {
7849 <= HOST_BITS_PER_WIDE_INT
7851 {
7855 cst &= HOST_WIDE_INT_M1U
7859 && !flag_syntax_only
7862 {
7866 }
7867 }
7869 {
7874 }
7875 }
7877 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
7878 cast (T1)X will fold away. We assume that this happens when X itself
7879 is a cast. */
7883 {
7887 return fold_build_pointer_plus_loc
7889 }
7891 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7892 of the same precision, and X is an integer type not narrower than
7893 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7899 {
7905 }
7907 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7908 type of X and Y (integer types only). */
7913 {
7914 /* Be careful not to introduce new overflows. */
7915 tree mult_type;
7918 else
7922 {
7929 }
7930 }
7936 {
7941 }
7952 /* Convert fabs((double)float) into (double)fabsf(float). */
7955 {
7961 targ0));
7962 }
7966 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
7985 /* Note that the operand of this must be an int
7986 and its values must be 0 or 1.
7987 ("true" is a fixed value perhaps depending on the language,
7988 but we don't handle values other than 1 correctly yet.) */
7995 /* Fold *&X to X if X is an lvalue. */
7997 {
8004 }
8010 }
8013 /* If the operation was a conversion do _not_ mark a resulting constant
8014 with TREE_OVERFLOW if the original constant was not. These conversions
8015 have implementation defined behavior and retaining the TREE_OVERFLOW
8016 flag here would confuse later passes such as VRP. */
8017 tree
8020 {
8029 }
8031 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8032 operands OP0 and OP1. LOC is the location of the resulting expression.
8033 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8034 Return the folded expression if folding is successful. Otherwise,
8035 return NULL_TREE. */
8036 static tree
8039 {
8040 tree tem;
8042 /* We only do these simplifications if we are optimizing. */
8046 /* Check for things like (A || B) && (A || C). We can convert this
8047 to A || (B && C). Note that either operator can be any of the four
8048 truth and/or operations and the transformation will still be
8049 valid. Also note that we only care about order for the
8050 ANDIF and ORIF operators. If B contains side effects, this
8051 might change the truth-value of A. */
8058 {
8078 /* This case if tricky because we must either have commutative
8079 operators or else A10 must not have side-effects. */
8085 a01);
8086 }
8088 /* See if we can build a range comparison. */
8094 {
8098 }
8102 {
8106 }
8108 /* Check for the possibility of merging component references. If our
8109 lhs is another similar operation, try to merge its rhs with our
8110 rhs. Then try to merge our lhs and rhs. */
8124 {
8131 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8132 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8133 We don't want to pack more than two leafs to a non-IF AND/OR
8134 expression.
8135 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8136 equal to IF-CODE, then we don't want to add right-hand operand.
8137 If the inner right-hand side of left-hand operand has
8138 side-effects, or isn't simple, then we can't add to it,
8139 as otherwise we might destroy if-sequence. */
8142 /* Needed for sequence points to handle trappings, and
8143 side-effects. */
8145 {
8147 arg1);
8149 tem);
8150 }
8151 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8152 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8155 /* Needed for sequence points to handle trappings, and
8156 side-effects. */
8158 {
8163 }
8164 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8165 into (A OR B).
8166 For sequence point consistancy, we need to check for trapping,
8167 and side-effects. */
8171 }
8174 }
8176 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8177 by changing CODE to reduce the magnitude of constants involved in
8178 ARG0 of the comparison.
8179 Returns a canonicalized comparison tree if a simplification was
8180 possible, otherwise returns NULL_TREE.
8181 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8182 valid if signed overflow is undefined. */
8184 static tree
8188 {
8193 /* Match A +- CST code arg1. We can change this only if overflow
8194 is undefined. */
8197 /* In principle pointers also have undefined overflow behavior,
8198 but that causes problems elsewhere. */
8205 /* Identify the constant in arg0 and its sign. */
8209 /* Overflowed constants and zero will cause problems. */
8214 /* See if we can reduce the magnitude of the constant in
8215 arg0 by changing the comparison code. */
8216 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8220 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8224 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8228 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8232 else
8236 /* Now build the constant reduced in magnitude. But not if that
8237 would produce one outside of its types range. */
8253 }
8255 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8256 overflow further. Try to decrease the magnitude of constants involved
8257 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8258 and put sole constants at the second argument position.
8259 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8261 static tree
8264 {
8265 tree t;
8270 /* Try canonicalization by simplifying arg0. */
8275 {
8279 }
8281 /* Try canonicalization by simplifying arg1 using the swapped
8282 comparison. */
8290 }
8292 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8293 space. This is used to avoid issuing overflow warnings for
8294 expressions like &p->x which can not wrap. */
8296 static bool
8298 {
8305 wide_int wi_offset;
8311 else
8327 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8328 array. */
8330 {
8331 HOST_WIDE_INT base_size;
8336 }
8339 }
8341 /* Subroutine of fold_binary. This routine performs all of the
8342 transformations that are common to the equality/inequality
8343 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8344 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8345 fold_binary should call fold_binary. Fold a comparison with
8346 tree code CODE and type TYPE with operands OP0 and OP1. Return
8347 the folded comparison or NULL_TREE. */
8349 static tree
8352 {
8362 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
8364 && (equality_code
8371 {
8372 const enum tree_code
8379 /* If the constant operation overflowed this can be
8380 simplified as a comparison against INT_MAX/INT_MIN. */
8383 {
8387 /* Get the sign of the constant on the lhs if the
8388 operation were VARIABLE + CONST1. */
8392 /* The sign of the constant determines if we overflowed
8393 INT_MAX (const1_sgn == -1) or INT_MIN (const1_sgn == 1).
8394 Canonicalize to the INT_MIN overflow by swapping the comparison
8395 if necessary. */
8399 /* We now can look at the canonicalized case
8400 VARIABLE + 1 CODE2 INT_MIN
8401 and decide on the result. */
8403 {
8407 return
8413 return
8418 }
8419 }
8420 else
8421 {
8424 "when changing X +- C1 cmp C2 to "
8426 WARN_STRICT_OVERFLOW_COMPARISON);
8428 }
8429 }
8431 /* For comparisons of pointers we can decompose it to a compile time
8432 comparison of the base objects and the offsets into the object.
8433 This requires at least one operand being an ADDR_EXPR or a
8434 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8440 {
8443 machine_mode mode;
8447 /* Get base and offset for the access. Strip ADDR_EXPR for
8448 get_inner_reference, but put it back by stripping INDIRECT_REF
8449 off the base object if possible. indirect_baseN will be true
8450 if baseN is not an address but refers to the object itself. */
8453 {
8454 base0
8460 else
8462 }
8464 {
8468 {
8469 base0
8476 else
8478 }
8481 else
8485 {
8491 {
8494 }
8495 }
8496 }
8500 {
8501 base1
8507 else
8509 }
8511 {
8515 {
8516 base1
8523 else
8525 }
8528 else
8532 {
8538 {
8541 }
8542 }
8543 }
8545 /* If we have equivalent bases we might be able to simplify. */
8549 {
8550 /* We can fold this expression to a constant if the non-constant
8551 offset parts are equal. */
8560 {
8566 "occur when comparing P +- C1 with "
8568 WARN_STRICT_OVERFLOW_CONDITIONAL);
8571 {
8585 }
8586 }
8587 /* We can simplify the comparison to a comparison of the variable
8588 offset parts if the constant offset parts are equal.
8589 Be careful to use signed sizetype here because otherwise we
8590 mess with array offsets in the wrong way. This is possible
8591 because pointer arithmetic is restricted to retain within an
8592 object and overflow on pointer differences is undefined as of
8593 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8595 && (equality_code
8598 {
8599 /* By converting to signed sizetype we cover middle-end pointer
8600 arithmetic which operates on unsigned pointer types of size
8601 type size and ARRAY_REF offsets which are properly sign or
8602 zero extended from their type in case it is narrower than
8603 sizetype. */
8606 else
8610 else
8617 "occur when comparing P +- C1 with "
8619 WARN_STRICT_OVERFLOW_COMPARISON);
8622 }
8623 }
8624 /* For equal offsets we can simplify to a comparison of the
8625 base addresses. */
8627 && (indirect_base0
8629 && (indirect_base1
8634 {
8640 }
8641 }
8643 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8644 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8645 the resulting offset is smaller in absolute value than the
8646 original one and has the same sign. */
8655 {
8660 tree cst;
8662 "occur when combining constants around "
8665 /* Put the constant on the side where it doesn't overflow and is
8666 of lower absolute value and of same sign than before. */
8673 {
8676 variable1,
8680 }
8688 {
8694 variable2);
8695 }
8696 }
8702 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
8703 constant, we can simplify it. */
8708 {
8712 }
8714 /* If we are comparing an expression that just has comparisons
8715 of two integer values, arithmetic expressions of those comparisons,
8716 and constants, we can simplify it. There are only three cases
8717 to check: the two values can either be equal, the first can be
8718 greater, or the second can be greater. Fold the expression for
8719 those three values. Since each value must be 0 or 1, we have
8720 eight possibilities, each of which corresponds to the constant 0
8721 or 1 or one of the six possible comparisons.
8723 This handles common cases like (a > b) == 0 but also handles
8724 expressions like ((x > y) - (y > x)) > 0, which supposedly
8725 occur in macroized code. */
8728 {
8733 /* Don't handle degenerate cases here; they should already
8734 have been handled anyway. */
8743 {
8747 /* We can't just pass T to eval_subst in case cval1 or cval2
8748 was the same as ARG1. */
8750 tree high_result
8754 arg1);
8755 tree equal_result
8759 arg1);
8760 tree low_result
8764 arg1);
8766 /* All three of these results should be 0 or 1. Confirm they are.
8767 Then use those values to select the proper code to use. */
8772 {
8773 /* Make a 3-bit mask with the high-order bit being the
8774 value for `>', the next for '=', and the low for '<'. */
8778 {
8780 /* Always false. */
8801 /* Always true. */
8803 }
8806 {
8810 }
8812 }
8813 }
8814 }
8816 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
8817 into a single range test. */
8825 {
8829 }
8832 }
8835 /* Subroutine of fold_binary. Optimize complex multiplications of the
8836 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8837 argument EXPR represents the expression "z" of type TYPE. */
8839 static tree
8841 {
8846 {
8849 }
8851 {
8854 }
8855 else
8856 {
8860 }
8869 }
8872 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8873 CONSTRUCTOR ARG into array ELTS and return true if successful. */
8875 static bool
8877 {
8881 {
8884 }
8886 {
8892 else
8894 }
8895 else
8901 }
8903 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8904 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8905 NULL_TREE otherwise. */
8907 static tree
8909 {
8926 {
8930 }
8933 {
8939 }
8940 else
8942 }
8944 /* Try to fold a pointer difference of type TYPE two address expressions of
8945 array references AREF0 and AREF1 using location LOC. Return a
8946 simplified expression for the difference or NULL_TREE. */
8948 static tree
8951 {
8956 /* If the bases are array references as well, recurse. If the bases
8957 are pointer indirections compute the difference of the pointers.
8958 If the bases are equal, we are set. */
8961 && (base_offset
8965 && (base_offset
8971 {
8977 base_offset,
8980 }
8982 }
8984 /* If the real or vector real constant CST of type TYPE has an exact
8985 inverse, return it, else return NULL. */
8987 tree
8989 {
8990 REAL_VALUE_TYPE r;
8992 machine_mode mode;
8996 {
9012 {
9017 }
9023 }
9024 }
9026 /* Mask out the tz least significant bits of X of type TYPE where
9027 tz is the number of trailing zeroes in Y. */
9028 static wide_int
9030 {
9035 }
9037 /* Return true when T is an address and is known to be nonzero.
9038 For floating point we further ensure that T is not denormal.
9039 Similar logic is present in nonzero_address in rtlanal.h.
9041 If the return value is based on the assumption that signed overflow
9042 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9043 change *STRICT_OVERFLOW_P. */
9045 static bool
9047 {
9051 /* Doing something useful for floating point would need more work. */
9057 {
9060 strict_overflow_p);
9066 strict_overflow_p);
9074 }
9077 {
9080 strict_overflow_p);
9088 strict_overflow_p);
9103 strict_overflow_p);
9107 strict_overflow_p);
9110 {
9122 }
9126 }
9128 }
9130 /* Return true when T is an address and is known to be nonzero.
9131 Handle warnings about undefined signed overflow. */
9133 static bool
9135 {
9142 "determining that expression is always "
9144 WARN_STRICT_OVERFLOW_MISC);
9146 }
9148 /* Return true if T is known not to be equal to an integer W. */
9150 bool
9152 {
9154 value_range_type rtype;
9156 {
9165 {
9170 }
9175 /* If T has some known zero bits and W has any of those bits set,
9176 then T is known not to be equal to W. */
9184 }
9185 }
9187 /* Fold a binary expression of code CODE and type TYPE with operands
9188 OP0 and OP1. LOC is the location of the resulting expression.
9189 Return the folded expression if folding is successful. Otherwise,
9190 return NULL_TREE. */
9192 tree
9195 {
9210 /* Strip any conversions that don't change the mode. This is
9211 safe for every expression, except for a comparison expression
9212 because its signedness is derived from its operands. So, in
9213 the latter case, only strip conversions that don't change the
9214 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9215 preserved.
9217 Note that this is done as an internal manipulation within the
9218 constant folder, in order to find the simplest representation
9219 of the arguments so that their form can be studied. In any
9220 cases, the appropriate type conversions should be put back in
9221 the tree that will get out of the constant folder. */
9224 {
9227 }
9228 else
9229 {
9232 }
9234 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9235 constant but we can't do arithmetic on them. */
9237 {
9240 {
9244 }
9245 }
9247 /* If this is a commutative operation, and ARG0 is a constant, move it
9248 to ARG1 to reduce the number of tests below. */
9253 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9254 to ARG1 to reduce the number of tests below. */
9263 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9265 First check for cases where an arithmetic operation is applied to a
9266 compound, conditional, or comparison operation. Push the arithmetic
9267 operation inside the compound or conditional to see if any folding
9268 can then be done. Convert comparison to conditional for this purpose.
9269 The also optimizes non-constant cases that used to be done in
9270 expand_expr.
9272 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9273 one of the operands is a comparison and the other is a comparison, a
9274 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9275 code below would make the expression more complex. Change it to a
9276 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9277 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9290 {
9294 boolean_type_node,
9302 }
9306 {
9308 {
9313 tem);
9314 }
9317 {
9322 tem);
9323 }
9328 {
9334 }
9339 {
9345 }
9346 }
9349 {
9351 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9354 {
9360 }
9362 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9365 {
9366 tree base;
9367 HOST_WIDE_INT coffset;
9376 }
9381 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9387 arg1),
9389 arg0)));
9395 {
9396 /* X + (X / CST) * -CST is X % CST. */
9401 {
9410 cst0));
9411 }
9412 }
9414 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9415 one. Make sure the type is not saturating and has the signedness of
9416 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9417 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9424 {
9428 }
9431 {
9432 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9433 (plus (plus (mult) (mult)) (foo)) so that we can
9434 take advantage of the factoring cases below. */
9443 {
9449 else
9462 parg0),
9464 marg)),
9468 return
9474 parg1)));
9475 }
9476 }
9477 else
9478 {
9479 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9480 to __complex__ ( x, y ). This is not the same for SNaNs or
9481 if signed zeros are involved. */
9485 {
9492 {
9496 {
9502 }
9504 {
9510 }
9511 }
9512 }
9520 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9521 We associate floats only if the user has specified
9522 -fassociative-math. */
9526 {
9531 {
9532 tree tree0;
9535 }
9536 }
9537 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9538 We associate floats only if the user has specified
9539 -fassociative-math. */
9543 {
9548 {
9549 tree tree0;
9552 }
9553 }
9554 }
9556 bit_rotate:
9557 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9558 is a rotate of A by C1 bits. */
9559 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9560 is a rotate of A by B bits. */
9561 {
9563 tree rtype;
9572 /* Only create rotates in complete modes. Other cases are not
9573 expanded properly. */
9576 {
9590 {
9594 code0 == LSHIFT_EXPR
9598 }
9600 {
9608 element_precision
9612 return
9615 ? LROTATE_EXPR
9620 }
9622 {
9630 element_precision
9634 return fold_convert_loc
9637 ? LROTATE_EXPR
9641 }
9642 }
9643 }
9645 associate:
9646 /* In most languages, can't associate operations on floats through
9647 parentheses. Rather than remember where the parentheses were, we
9648 don't associate floats at all, unless the user has specified
9649 -fassociative-math.
9650 And, we need to make sure type is not saturating. */
9654 {
9660 /* Split both trees into variables, constants, and literals. Then
9661 associate each group together, the constants with literals,
9662 then the result with variables. This increases the chances of
9663 literals being recombined later and of generating relocatable
9664 expressions for the sum of a constant and literal. */
9670 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9674 /* With undefined overflow prefer doing association in a type
9675 which wraps on overflow, if that is one of the operand types. */
9678 {
9686 }
9688 /* With undefined overflow we can only associate constants with one
9689 variable, and constants whose association doesn't overflow. */
9692 {
9694 {
9700 {
9703 }
9710 {
9713 }
9719 /* The only case we can still associate with two variables
9720 is if they cancel out. */
9724 }
9725 }
9727 /* Only do something if we found more than two objects. Otherwise,
9728 nothing has changed and we risk infinite recursion. */
9734 {
9746 /* Preserve the MINUS_EXPR if the negative part of the literal is
9747 greater than the positive part. Otherwise, the multiplicative
9748 folding code (i.e extract_muldiv) may be fooled in case
9749 unsigned constants are subtracted, like in the following
9750 example: ((X*2 + 4) - 8U)/2. */
9752 {
9756 {
9760 }
9761 else
9762 {
9766 }
9767 }
9769 /* Don't introduce overflows through reassociation. */
9776 {
9778 return
9782 else
9783 {
9786 return
9790 }
9791 }
9794 return
9797 }
9798 }
9803 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9812 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9813 __complex__ ( x, -y ). This is not the same for SNaNs or if
9814 signed zeros are involved. */
9818 {
9825 {
9829 {
9831 arg1r ? arg1r
9836 }
9838 {
9842 arg1i ? arg1i
9845 }
9846 }
9847 }
9849 /* A - B -> A + (-B) if B is easily negatable. */
9853 /* Avoid this transformation if B is a positive REAL_CST. */
9861 /* Fold &a[i] - &a[j] to i-j. */
9866 {
9872 }
9875 && flag_unsafe_math_optimizations
9881 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9882 one. Make sure the type is not saturating and has the signedness of
9883 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9884 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9891 {
9895 }
9901 {
9902 /* Transform x * -C into -x * C if x is easily negatable. */
9912 /* (A + A) * C -> A * 2 * C */
9924 /* ((T) (X /[ex] C)) * C cancels out if the conversion is
9925 sign-changing only. */
9935 {
9938 "occur when simplifying "
9940 WARN_STRICT_OVERFLOW_MISC);
9942 }
9944 /* Optimize z * conj(z) for integer complex numbers. */
9951 }
9952 else
9953 {
9954 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
9955 This is not the same for NaNs or if signed zeros are
9956 involved. */
9962 {
9965 return
9971 return
9976 }
9978 /* Optimize z * conj(z) for floating point complex numbers.
9979 Guarded by flag_unsafe_math_optimizations as non-finite
9980 imaginary components don't produce scalar results. */
9991 {
9993 /* Canonicalize x*x as pow(x,2.0), which is expanded as x*x. */
9995 && optimize
9997 {
10001 {
10004 }
10005 }
10006 }
10007 }
10011 /* Canonicalize (X & C1) | C2. */
10015 {
10020 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10028 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10033 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10034 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10035 mode which allows further optimizations. */
10040 {
10044 {
10047 }
10048 }
10055 c3)),
10056 arg1);
10057 }
10059 /* See if this can be simplified into a rotate first. If that
10060 is unsuccessful continue in the association code. */
10064 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10072 /* See if this can be simplified into a rotate first. If that
10073 is unsuccessful continue in the association code. */
10077 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10082 {
10083 tree tem2;
10090 }
10091 /* Fold ~X & 1 as (X & 1) == 0. */
10095 {
10096 tree tem2;
10103 }
10104 /* Fold !X & 1 as X == 0. */
10107 {
10111 }
10113 /* Fold (X ^ Y) & Y as ~X & Y. */
10116 {
10121 }
10122 /* Fold (X ^ Y) & X as ~Y & X. */
10126 {
10131 }
10132 /* Fold X & (X ^ Y) as X & ~Y. */
10135 {
10140 }
10141 /* Fold X & (Y ^ X) as ~Y & X. */
10145 {
10150 }
10152 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10153 multiple of 1 << CST. */
10155 {
10162 }
10164 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10165 bits from CST2. */
10169 {
10177 {
10178 /* Avoid the transform if arg1 is a mask of some
10179 mode which allows further optimizations. */
10186 }
10187 }
10189 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10190 ((A & N) + B) & M -> (A + B) & M
10191 Similarly if (N & M) == 0,
10192 ((A | N) + B) & M -> (A + B) & M
10193 and for - instead of + (or unary - instead of +)
10194 and/or ^ instead of |.
10195 If B is constant and (B & M) == 0, fold into A & M. */
10197 {
10206 {
10209 wide_int cst0;
10211 /* Now we know that arg0 is (C + D) or (C - D) or
10212 -C and arg1 (M) is == (1LL << cst) - 1.
10213 Store C into PMOP[0] and D into PMOP[1]. */
10217 {
10220 }
10227 {
10237 {
10240 }
10243 /* If C or D is of the form (A & N) where
10244 (N & M) == M, or of the form (A | N) or
10245 (A ^ N) where (N & M) == 0, replace it with A. */
10249 /* If C or D is a N where (N & M) == 0, it can be
10250 omitted (assumed 0). */
10258 }
10260 /* Only build anything new if we optimized one or both arguments
10261 above. */
10265 {
10268 {
10269 /* Perform the operations in a type that has defined
10270 overflow behavior. */
10276 }
10281 {
10289 else
10291 }
10294 else
10297 /* TEM is now the new binary +, - or unary - replacement. */
10301 }
10302 }
10303 }
10305 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10308 {
10313 return
10315 }
10320 /* Don't touch a floating-point divide by zero unless the mode
10321 of the constant can represent infinity. */
10327 /* (-A) / (-B) -> A / B */
10339 /* Fall through */
10342 /* Simplify A / (B << N) where A and B are positive and B is
10343 a power of 2, to A >> (N + log2(B)). */
10348 {
10351 {
10359 WARN_STRICT_OVERFLOW_MISC);
10365 }
10366 }
10368 /* Fall through */
10376 /* Convert -A / -B to A / B when the type is signed and overflow is
10377 undefined. */
10381 {
10384 "when distributing negation across "
10386 WARN_STRICT_OVERFLOW_MISC);
10391 }
10395 {
10398 "when distributing negation across "
10400 WARN_STRICT_OVERFLOW_MISC);
10405 }
10407 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10408 operation, EXACT_DIV_EXPR.
10410 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10411 At one time others generated faster code, it's not clear if they do
10412 after the last round to changes to the DIV code in expmed.c. */
10423 {
10427 WARN_STRICT_OVERFLOW_MISC);
10429 }
10441 {
10445 WARN_STRICT_OVERFLOW_MISC);
10447 }
10455 /* Since negative shift count is not well-defined,
10456 don't try to compute it in the compiler. */
10462 /* If we have a rotate of a bit operation with the rotate count and
10463 the second operand of the bit operation both constant,
10464 permute the two operations. */
10476 /* Two consecutive rotates adding up to the some integer
10477 multiple of the precision of the type can be ignored. */
10492 /* Note that the operands of this must be ints
10493 and their values must be 0 or 1.
10494 ("true" is a fixed value perhaps depending on the language.) */
10495 /* If first arg is constant zero, return it. */
10499 /* If either arg is constant true, drop it. */
10503 /* Preserve sequence points. */
10506 /* If second arg is constant zero, result is zero, but first arg
10507 must be evaluated. */
10510 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10511 case will be handled here. */
10515 /* !X && X is always false. */
10519 /* X && !X is always false. */
10524 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10525 means A >= Y && A != MAX, but in this case we know that
10526 A < X <= MAX. */
10530 {
10538 }
10547 /* Note that the operands of this must be ints
10548 and their values must be 0 or true.
10549 ("true" is a fixed value perhaps depending on the language.) */
10550 /* If first arg is constant true, return it. */
10554 /* If either arg is constant zero, drop it. */
10558 /* Preserve sequence points. */
10561 /* If second arg is constant true, result is true, but we must
10562 evaluate first arg. */
10565 /* Likewise for first arg, but note this only occurs here for
10566 TRUTH_OR_EXPR. */
10570 /* !X || X is always true. */
10574 /* X || !X is always true. */
10579 /* (X && !Y) || (!X && Y) is X ^ Y */
10582 {
10599 }
10608 /* If the second arg is constant zero, drop it. */
10611 /* If the second arg is constant true, this is a logical inversion. */
10613 {
10616 }
10617 /* Identical arguments cancel to zero. */
10621 /* !X ^ X is always true. */
10626 /* X ^ !X is always true. */
10642 /* bool_var != 1 becomes !bool_var. */
10649 /* bool_var == 0 becomes !bool_var. */
10656 /* !exp != 0 becomes !exp */
10661 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
10670 {
10676 }
10678 /* Transform comparisons of the form X CMP X +- Y to Y CMP 0. */
10687 {
10693 }
10695 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
10703 code == NE_EXPR
10707 /* Transform comparisons of the form X CMP C - X if C % 2 == 1. */
10715 code == NE_EXPR
10719 /* If this is an EQ or NE comparison with zero and ARG0 is
10720 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10721 two operations, but the latter can be done in one less insn
10722 on machines that have only two-operand insns or on which a
10723 constant cannot be the first operand. */
10726 {
10731 {
10738 arg1);
10739 }
10742 {
10749 arg1);
10750 }
10751 }
10753 /* If this is an NE or EQ comparison of zero against the result of a
10754 signed MOD operation whose second operand is a power of 2, make
10755 the MOD operation unsigned since it is simpler and equivalent. */
10763 {
10773 }
10775 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10776 C1 is a valid shift constant, and C2 is a power of two, i.e.
10777 a single bit. */
10781 == INTEGER_CST
10784 {
10789 /* Check for a valid shift count. */
10791 {
10795 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10796 can be rewritten as (X & (C2 << C1)) != 0. */
10798 {
10803 }
10804 /* Otherwise, for signed (arithmetic) shifts,
10805 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10806 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10810 /* Otherwise, of unsigned (logical) shifts,
10811 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10812 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10813 else
10817 arg000);
10818 }
10819 }
10821 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
10822 Similarly for NE_EXPR. */
10826 {
10830 tree dandnotc
10833 notc);
10837 }
10839 /* If this is a comparison of a field, we may be able to simplify it. */
10842 /* Handle the constant case even without -O
10843 to make sure the warnings are given. */
10845 {
10849 }
10851 /* Optimize comparisons of strlen vs zero to a compare of the
10852 first character of the string vs zero. To wit,
10853 strlen(ptr) == 0 => *ptr == 0
10854 strlen(ptr) != 0 => *ptr != 0
10855 Other cases should reduce to one of these two (or a constant)
10856 due to the return value of strlen being unsigned. */
10859 {
10867 {
10872 }
10873 }
10875 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10876 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10880 {
10885 {
10887 {
10890 }
10893 }
10894 }
10896 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10897 (X & C) == 0 when C is a single bit. */
10902 {
10909 arg1));
10910 }
10912 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10913 constant C is a power of two, i.e. a single bit. */
10920 {
10924 }
10926 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10927 when is C is a power of two, i.e. a single bit. */
10934 {
10940 }
10944 {
10947 }
10949 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10952 {
10965 arg01),
10974 arg01),
10983 arg00),
10992 arg00),
10994 }
10998 {
11005 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
11006 operand_equal_p guarantees no side-effects so we don't need
11007 to use omit_one_operand on Z. */
11011 arg10));
11015 arg11));
11019 arg10));
11023 arg11));
11025 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
11028 {
11034 }
11035 }
11037 /* Attempt to simplify equality/inequality comparisons of complex
11038 values. Only lower the comparison if the result is known or
11039 can be simplified to a single scalar comparison. */
11044 {
11049 {
11052 }
11053 else
11054 {
11057 }
11060 {
11063 }
11064 else
11065 {
11068 }
11072 {
11074 {
11079 }
11080 else
11081 {
11086 }
11087 }
11091 {
11093 {
11098 }
11099 else
11100 {
11105 }
11106 }
11107 }
11119 /* Transform comparisons of the form X +- C CMP X. */
11126 {
11133 else
11136 /* (X - c) > X becomes false. */
11140 {
11144 "occur when assuming that (X - c) > X "
11146 WARN_STRICT_OVERFLOW_ALL);
11148 }
11150 /* Likewise (X + c) < X becomes false. */
11154 {
11158 "occur when assuming that "
11160 WARN_STRICT_OVERFLOW_ALL);
11162 }
11164 /* Convert (X - c) <= X to true. */
11169 {
11173 "occur when assuming that "
11175 WARN_STRICT_OVERFLOW_ALL);
11177 }
11179 /* Convert (X + c) >= X to true. */
11184 {
11188 "occur when assuming that "
11190 WARN_STRICT_OVERFLOW_ALL);
11192 }
11195 {
11196 /* Convert X + c > X and X - c < X to true for integers. */
11200 {
11203 "not occur when assuming that "
11205 WARN_STRICT_OVERFLOW_ALL);
11207 }
11212 {
11215 "not occur when assuming that "
11217 WARN_STRICT_OVERFLOW_ALL);
11219 }
11221 /* Convert X + c <= X and X - c >= X to false for integers. */
11225 {
11228 "not occur when assuming that "
11230 WARN_STRICT_OVERFLOW_ALL);
11232 }
11237 {
11240 "not occur when assuming that "
11242 WARN_STRICT_OVERFLOW_ALL);
11244 }
11245 }
11246 }
11248 /* If we are comparing an ABS_EXPR with a constant, we can
11249 convert all the cases into explicit comparisons, but they may
11250 well not be faster than doing the ABS and one comparison.
11251 But ABS (X) <= C is a range comparison, which becomes a subtraction
11252 and a comparison, and is probably faster. */
11266 /* Convert ABS_EXPR<x> >= 0 to true. */
11273 {
11276 "when simplifying comparison of "
11278 WARN_STRICT_OVERFLOW_CONDITIONAL);
11281 arg0);
11282 }
11284 /* Convert ABS_EXPR<x> < 0 to false. */
11289 {
11292 "when simplifying comparison of "
11294 WARN_STRICT_OVERFLOW_CONDITIONAL);
11297 arg0);
11298 }
11300 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11301 and similarly for >= into !=. */
11311 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11312 otherwise Y might be >= # of bits in X's type and thus e.g.
11313 (unsigned char) (1 << Y) for Y 15 might be 0.
11314 If the cast is widening, then 1 << Y should have unsigned type,
11315 otherwise if Y is number of bits in the signed shift type minus 1,
11316 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11317 31 might be 0xffffffff80000000. */
11328 {
11334 }
11346 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11347 {
11359 }
11364 /* When pedantic, a compound expression can be neither an lvalue
11365 nor an integer constant expression. */
11368 /* Don't let (0, 0) be null pointer constant. */
11374 /* An ASSERT_EXPR should never be passed to fold_binary. */
11380 }
11382 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11383 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
11384 of GOTO_EXPR. */
11386 static tree
11388 {
11390 {
11397 /* ... fall through ... */
11401 }
11402 }
11404 /* Return whether the sub-tree ST contains a label which is accessible from
11405 outside the sub-tree. */
11407 static bool
11409 {
11410 return
11412 }
11414 /* Fold a ternary expression of code CODE and type TYPE with operands
11415 OP0, OP1, and OP2. Return the folded expression if folding is
11416 successful. Otherwise, return NULL_TREE. */
11418 tree
11421 {
11422 tree tem;
11429 /* If this is a commutative operation, and OP0 is a constant, move it
11430 to OP1 to reduce the number of tests below. */
11439 /* Strip any conversions that don't change the mode. This is safe
11440 for every expression, except for a comparison expression because
11441 its signedness is derived from its operands. So, in the latter
11442 case, only strip conversions that don't change the signedness.
11444 Note that this is done as an internal manipulation within the
11445 constant folder, in order to find the simplest representation of
11446 the arguments so that their form can be studied. In any cases,
11447 the appropriate type conversions should be put back in the tree
11448 that will get out of the constant folder. */
11450 {
11453 }
11456 {
11459 }
11462 {
11465 }
11468 {
11472 {
11478 }
11483 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11484 so all simple results must be passed through pedantic_non_lvalue. */
11486 {
11489 /* Only optimize constant conditions when the selected branch
11490 has the same type as the COND_EXPR. This avoids optimizing
11491 away "c ? x : throw", where the throw has a void type.
11492 Avoid throwing away that operand which contains label. */
11499 }
11501 {
11506 {
11511 {
11519 }
11523 }
11524 }
11526 /* If we have A op B ? A : C, we may be able to convert this to a
11527 simpler expression, depending on the operation and the values
11528 of B and C. Signed zeros prevent all of these transformations,
11529 for reasons given above each one.
11531 Also try swapping the arguments and inverting the conditional. */
11536 {
11540 }
11544 op2,
11547 {
11551 {
11555 }
11556 }
11558 /* If the second operand is simpler than the third, swap them
11559 since that produces better jump optimization results. */
11562 {
11564 /* See if this can be inverted. If it can't, possibly because
11565 it was a floating-point inequality comparison, don't do
11566 anything. */
11570 }
11572 /* Convert A ? 1 : 0 to simply A. */
11577 /* If we try to convert OP0 to our type, the
11578 call to fold will try to move the conversion inside
11579 a COND, which will recurse. In that case, the COND_EXPR
11580 is probably the best choice, so leave it alone. */
11584 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11585 over COND_EXPR in cases such as floating point comparisons. */
11594 arg0)));
11596 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11601 {
11602 /* sign_bit_p looks through both zero and sign extensions,
11603 but for this optimization only sign extensions are
11604 usable. */
11607 {
11610 {
11613 }
11615 }
11616 /* sign_bit_p only checks ARG1 bits within A's precision.
11617 If <sign bit of A> has wider type than A, bits outside
11618 of A's precision in <sign bit of A> need to be checked.
11619 If they are all 0, this optimization needs to be done
11620 in unsigned A's type, if they are all 1 in signed A's type,
11621 otherwise this can't be done. */
11627 {
11629 tree tem_type;
11642 {
11645 }
11647 {
11650 }
11651 else
11653 }
11656 return
11662 arg1)));
11663 }
11665 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11666 already handled above. */
11671 {
11680 }
11682 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11683 is probably obsolete because the first operand should be a
11684 truth value (that's why we have the two cases above), but let's
11685 leave it in until we can confirm this for all front-ends. */
11697 /* Disable the transformations below for vectors, since
11698 fold_binary_op_with_conditional_arg may undo them immediately,
11699 yielding an infinite loop. */
11703 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11712 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11717 {
11719 /* Only perform transformation if ARG0 is easily inverted. */
11723 ? BIT_IOR_EXPR
11726 arg1);
11727 }
11729 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11734 {
11736 /* Only perform transformation if ARG0 is easily inverted. */
11742 op2);
11743 }
11745 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11757 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11758 of fold_ternary on them. */
11768 {
11778 {
11783 {
11791 }
11793 /* Constructor elements can be subvectors. */
11796 {
11800 }
11802 /* We keep an exact subset of the constructor elements. */
11804 {
11810 {
11814 }
11822 CONSTRUCTOR_ELT
11825 }
11826 /* The bitfield references a single constructor element. */
11828 {
11833 else
11837 }
11838 }
11839 }
11841 /* A bit-field-ref that referenced the full argument can be stripped. */
11847 /* On constants we can use native encode/interpret to constant
11848 fold (nearly) all BIT_FIELD_REFs. */
11852 /* This limitation should not be necessary, we just need to
11853 round this up to mode size. */
11855 /* Need bit-shifting of the buffer to relax the following. */
11857 {
11862 /* ??? We cannot tell native_encode_expr to start at
11863 some random byte only. So limit us to a reasonable amount
11864 of work. */
11866 {
11871 {
11877 }
11878 }
11879 }
11884 /* For integers we can decompose the FMA if possible. */
11896 {
11912 {
11917 /* Make sure that the perm value is in an acceptable
11918 range. */
11927 else
11932 }
11935 {
11940 }
11945 {
11950 }
11956 {
11960 }
11965 /* Some targets are deficient and fail to expand a single
11966 argument permutation while still allowing an equivalent
11967 2-argument version. */
11971 {
11974 }
11977 {
11984 }
11988 }
11994 }
11996 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
11997 of an array (or vector). */
11999 tree
12001 {
12006 {
12009 {
12010 /* Static constructors for variably sized objects makes no sense. */
12014 }
12015 }
12026 offset_int max_index;
12031 {
12032 /* Array constructor might explicitly set index, or specify a range,
12033 or leave index NULL meaning that it is next index after previous
12034 one. */
12036 {
12039 else
12040 {
12044 }
12045 }
12046 else
12047 {
12053 }
12055 /* Do we have match? */
12059 }
12061 }
12063 /* Perform constant folding and related simplification of EXPR.
12064 The related simplifications include x*1 => x, x*0 => 0, etc.,
12065 and application of the associative law.
12066 NOP_EXPR conversions may be removed freely (as long as we
12067 are careful not to change the type of the overall expression).
12068 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
12069 but we can constant-fold them if they have constant operands. */
12071 #ifdef ENABLE_FOLD_CHECKING
12072 # define fold(x) fold_1 (x)
12074 static
12075 #endif
12076 tree
12078 {
12082 tree tem;
12085 /* Return right away if a constant. */
12089 /* CALL_EXPR-like objects with variable numbers of operands are
12090 treated specially. */
12092 {
12094 {
12097 }
12099 }
12102 {
12107 {
12125 }
12126 }
12129 {
12131 {
12138 {
12143 }
12146 }
12148 /* Return a VECTOR_CST if possible. */
12150 {
12156 tree val;
12162 }
12170 }
12172 #ifdef ENABLE_FOLD_CHECKING
12173 #undef fold
12180 /* When --enable-checking=fold, compute a digest of expr before
12181 and after actual fold call to see if fold did not accidentally
12182 change original expr. */
12184 tree
12186 {
12187 tree ret;
12207 }
12209 void
12211 {
12222 }
12224 static void
12226 {
12228 }
12230 static void
12233 {
12239 recursive_label:
12249 {
12250 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12255 }
12262 {
12263 /* Allow these fields to be modified. */
12264 tree tmp;
12272 {
12275 }
12276 }
12287 {
12290 {
12305 }
12309 {
12322 }
12339 {
12345 }
12348 {
12350 {
12353 }
12355 }
12366 {
12369 }
12379 }
12380 }
12382 /* Helper function for outputting the checksum of a tree T. When
12383 debugging with gdb, you can "define mynext" to be "next" followed
12384 by "call debug_fold_checksum (op0)", then just trace down till the
12385 outputs differ. */
12387 DEBUG_FUNCTION void
12389 {
12404 }
12406 #endif
12408 /* Fold a unary tree expression with code CODE of type TYPE with an
12409 operand OP0. LOC is the location of the resulting expression.
12410 Return a folded expression if successful. Otherwise, return a tree
12411 expression with code CODE of type TYPE with an operand OP0. */
12413 tree
12416 {
12417 tree tem;
12418 #ifdef ENABLE_FOLD_CHECKING
12427 #endif
12433 #ifdef ENABLE_FOLD_CHECKING
12440 #endif
12442 }
12444 /* Fold a binary tree expression with code CODE of type TYPE with
12445 operands OP0 and OP1. LOC is the location of the resulting
12446 expression. Return a folded expression if successful. Otherwise,
12447 return a tree expression with code CODE of type TYPE with operands
12448 OP0 and OP1. */
12450 tree
12453 MEM_STAT_DECL)
12454 {
12455 tree tem;
12456 #ifdef ENABLE_FOLD_CHECKING
12473 #endif
12479 #ifdef ENABLE_FOLD_CHECKING
12494 #endif
12496 }
12498 /* Fold a ternary tree expression with code CODE of type TYPE with
12499 operands OP0, OP1, and OP2. Return a folded expression if
12500 successful. Otherwise, return a tree expression with code CODE of
12501 type TYPE with operands OP0, OP1, and OP2. */
12503 tree
12506 {
12507 tree tem;
12508 #ifdef ENABLE_FOLD_CHECKING
12532 #endif
12539 #ifdef ENABLE_FOLD_CHECKING
12562 #endif
12564 }
12566 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12567 arguments in ARGARRAY, and a null static chain.
12568 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12569 of type TYPE from the given operands as constructed by build_call_array. */
12571 tree
12574 {
12575 tree tem;
12576 #ifdef ENABLE_FOLD_CHECKING
12595 #endif
12601 #ifdef ENABLE_FOLD_CHECKING
12617 #endif
12619 }
12621 /* Perform constant folding and related simplification of initializer
12622 expression EXPR. These behave identically to "fold_buildN" but ignore
12623 potential run-time traps and exceptions that fold must preserve. */
12625 #define START_FOLD_INIT \
12626 int saved_signaling_nans = flag_signaling_nans;\
12627 int saved_trapping_math = flag_trapping_math;\
12628 int saved_rounding_math = flag_rounding_math;\
12629 int saved_trapv = flag_trapv;\
12630 int saved_folding_initializer = folding_initializer;\
12631 flag_signaling_nans = 0;\
12632 flag_trapping_math = 0;\
12633 flag_rounding_math = 0;\
12634 flag_trapv = 0;\
12635 folding_initializer = 1;
12637 #define END_FOLD_INIT \
12638 flag_signaling_nans = saved_signaling_nans;\
12639 flag_trapping_math = saved_trapping_math;\
12640 flag_rounding_math = saved_rounding_math;\
12641 flag_trapv = saved_trapv;\
12642 folding_initializer = saved_folding_initializer;
12644 tree
12647 {
12648 tree result;
12649 START_FOLD_INIT;
12653 END_FOLD_INIT;
12655 }
12657 tree
12660 {
12661 tree result;
12662 START_FOLD_INIT;
12666 END_FOLD_INIT;
12668 }
12670 tree
12673 {
12674 tree result;
12675 START_FOLD_INIT;
12679 END_FOLD_INIT;
12681 }
12683 #undef START_FOLD_INIT
12684 #undef END_FOLD_INIT
12686 /* Determine if first argument is a multiple of second argument. Return 0 if
12687 it is not, or we cannot easily determined it to be.
12689 An example of the sort of thing we care about (at this point; this routine
12690 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12691 fold cases do now) is discovering that
12693 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12695 is a multiple of
12697 SAVE_EXPR (J * 8)
12699 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12701 This code also handles discovering that
12703 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12705 is a multiple of 8 so we don't have to worry about dealing with a
12706 possible remainder.
12708 Note that we *look* inside a SAVE_EXPR only to determine how it was
12709 calculated; it is not safe for fold to do much of anything else with the
12710 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12711 at run time. For example, the latter example above *cannot* be implemented
12712 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12713 evaluation time of the original SAVE_EXPR is not necessarily the same at
12714 the time the new expression is evaluated. The only optimization of this
12715 sort that would be valid is changing
12717 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12719 divided by 8 to
12721 SAVE_EXPR (I) * SAVE_EXPR (J)
12723 (where the same SAVE_EXPR (J) is used in the original and the
12724 transformed version). */
12726 int
12728 {
12736 {
12738 /* Bitwise and provides a power of two multiple. If the mask is
12739 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12742 /* FALLTHRU */
12755 {
12759 /* const_binop may not detect overflow correctly,
12760 so check for it explicitly here. */
12764 size_one_node,
12765 op1)))
12768 }
12772 /* Can't handle conversions from non-integral or wider integral type. */
12778 /* .. fall through ... */
12795 SIGNED);
12799 }
12800 }
12802 #define tree_expr_nonnegative_warnv_p(X, Y) \
12805 #define RECURSE(X) \
12806 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
12808 /* Return true if CODE or TYPE is known to be non-negative. */
12810 static bool
12812 {
12815 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12816 have a signed:1 type (where the value is -1 and 0). */
12819 }
12821 /* Return true if (CODE OP0) is known to be non-negative. If the return
12822 value is based on the assumption that signed overflow is undefined,
12823 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12824 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12826 bool
12829 {
12834 {
12836 /* We can't return 1 if flag_wrapv is set because
12837 ABS_EXPR<INT_MIN> = INT_MIN. */
12841 {
12844 }
12852 CASE_CONVERT:
12853 {
12858 {
12862 {
12866 }
12867 }
12869 {
12875 }
12876 }
12881 }
12883 /* We don't know sign of `t', so be conservative and return false. */
12885 }
12887 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12888 value is based on the assumption that signed overflow is undefined,
12889 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12890 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12892 bool
12896 {
12901 {
12907 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12908 both unsigned and at least 2 bits shorter than the result. */
12912 {
12917 {
12921 }
12922 }
12927 {
12928 /* x * x is always non-negative for floating point x
12929 or without overflow. */
12932 {
12937 }
12938 }
12940 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12941 both unsigned and their total bits is shorter than the result. */
12945 {
12964 {
12974 }
12975 }
13002 }
13004 /* We don't know sign of `t', so be conservative and return false. */
13006 }
13008 /* Return true if T is known to be non-negative. If the return
13009 value is based on the assumption that signed overflow is undefined,
13010 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13011 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13013 bool
13015 {
13020 {
13034 /* Limit the depth of recursion to avoid quadratic behavior.
13035 This is expected to catch almost all occurrences in practice.
13036 If this code misses important cases that unbounded recursion
13037 would not, passes that need this information could be revised
13038 to provide it through dataflow propagation. */
13046 }
13047 }
13049 /* Return true if T is known to be non-negative. If the return
13050 value is based on the assumption that signed overflow is undefined,
13051 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13052 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13054 bool
13057 {
13059 {
13060 CASE_CFN_ACOS:
13061 CASE_CFN_ACOSH:
13062 CASE_CFN_CABS:
13063 CASE_CFN_COSH:
13064 CASE_CFN_ERFC:
13065 CASE_CFN_EXP:
13066 CASE_CFN_EXP10:
13067 CASE_CFN_EXP2:
13068 CASE_CFN_FABS:
13069 CASE_CFN_FDIM:
13070 CASE_CFN_HYPOT:
13071 CASE_CFN_POW10:
13072 CASE_CFN_FFS:
13073 CASE_CFN_PARITY:
13074 CASE_CFN_POPCOUNT:
13075 CASE_CFN_CLZ:
13076 CASE_CFN_CLRSB:
13079 /* Always true. */
13082 CASE_CFN_SQRT:
13083 /* sqrt(-0.0) is -0.0. */
13088 CASE_CFN_ASINH:
13089 CASE_CFN_ATAN:
13090 CASE_CFN_ATANH:
13091 CASE_CFN_CBRT:
13092 CASE_CFN_CEIL:
13093 CASE_CFN_ERF:
13094 CASE_CFN_EXPM1:
13095 CASE_CFN_FLOOR:
13096 CASE_CFN_FMOD:
13097 CASE_CFN_FREXP:
13098 CASE_CFN_ICEIL:
13099 CASE_CFN_IFLOOR:
13100 CASE_CFN_IRINT:
13101 CASE_CFN_IROUND:
13102 CASE_CFN_LCEIL:
13103 CASE_CFN_LDEXP:
13104 CASE_CFN_LFLOOR:
13105 CASE_CFN_LLCEIL:
13106 CASE_CFN_LLFLOOR:
13107 CASE_CFN_LLRINT:
13108 CASE_CFN_LLROUND:
13109 CASE_CFN_LRINT:
13110 CASE_CFN_LROUND:
13111 CASE_CFN_MODF:
13112 CASE_CFN_NEARBYINT:
13113 CASE_CFN_RINT:
13114 CASE_CFN_ROUND:
13115 CASE_CFN_SCALB:
13116 CASE_CFN_SCALBLN:
13117 CASE_CFN_SCALBN:
13118 CASE_CFN_SIGNBIT:
13119 CASE_CFN_SIGNIFICAND:
13120 CASE_CFN_SINH:
13121 CASE_CFN_TANH:
13122 CASE_CFN_TRUNC:
13123 /* True if the 1st argument is nonnegative. */
13126 CASE_CFN_FMAX:
13127 /* True if the 1st OR 2nd arguments are nonnegative. */
13130 CASE_CFN_FMIN:
13131 /* True if the 1st AND 2nd arguments are nonnegative. */
13134 CASE_CFN_COPYSIGN:
13135 /* True if the 2nd argument is nonnegative. */
13138 CASE_CFN_POWI:
13139 /* True if the 1st argument is nonnegative or the second
13140 argument is an even integer. */
13146 CASE_CFN_POW:
13147 /* True if the 1st argument is nonnegative or the second
13148 argument is an even integer valued real. */
13150 {
13151 REAL_VALUE_TYPE c;
13152 HOST_WIDE_INT n;
13157 {
13158 REAL_VALUE_TYPE cint;
13162 }
13163 }
13168 }
13170 }
13172 /* Return true if T is known to be non-negative. If the return
13173 value is based on the assumption that signed overflow is undefined,
13174 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13175 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13177 static bool
13179 {
13185 {
13187 {
13191 /* If the initializer is non-void, then it's a normal expression
13192 that will be assigned to the slot. */
13196 /* Otherwise, the initializer sets the slot in some way. One common
13197 way is an assignment statement at the end of the initializer. */
13199 {
13207 else
13209 }
13215 }
13218 {
13224 arg0,
13225 arg1,
13227 }
13240 }
13241 }
13243 #undef RECURSE
13244 #undef tree_expr_nonnegative_warnv_p
13246 /* Return true if T is known to be non-negative. If the return
13247 value is based on the assumption that signed overflow is undefined,
13248 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13249 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13251 bool
13253 {
13260 {
13282 }
13285 {
13311 }
13312 }
13314 /* Return true if `t' is known to be non-negative. Handle warnings
13315 about undefined signed overflow. */
13317 bool
13319 {
13326 "determining that expression is always "
13328 WARN_STRICT_OVERFLOW_MISC);
13330 }
13333 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13334 For floating point we further ensure that T is not denormal.
13335 Similar logic is present in nonzero_address in rtlanal.h.
13337 If the return value is based on the assumption that signed overflow
13338 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13339 change *STRICT_OVERFLOW_P. */
13341 bool
13344 {
13346 {
13349 strict_overflow_p);
13352 {
13358 strict_overflow_p));
13359 }
13364 strict_overflow_p);
13368 }
13371 }
13373 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13374 For floating point we further ensure that T is not denormal.
13375 Similar logic is present in nonzero_address in rtlanal.h.
13377 If the return value is based on the assumption that signed overflow
13378 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13379 change *STRICT_OVERFLOW_P. */
13381 bool
13383 tree type,
13384 tree op0,
13386 {
13389 {
13393 {
13394 /* With the presence of negative values it is hard
13395 to say something. */
13402 /* One of operands must be positive and the other non-negative. */
13403 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13404 overflows, on a twos-complement machine the sum of two
13405 nonnegative numbers can never be zero. */
13407 strict_overflow_p)
13409 strict_overflow_p));
13410 }
13415 {
13417 strict_overflow_p)
13419 strict_overflow_p))
13420 {
13423 }
13424 }
13433 {
13436 }
13443 {
13447 /* When both operands are nonzero, then MAX must be too. */
13449 strict_overflow_p))
13452 /* MAX where operand 0 is positive is positive. */
13454 strict_overflow_p);
13455 }
13456 /* MAX where operand 1 is positive is positive. */
13461 {
13465 }
13470 strict_overflow_p)
13472 strict_overflow_p));
13476 }
13479 }
13481 /* Return true when T is an address and is known to be nonzero.
13482 For floating point we further ensure that T is not denormal.
13483 Similar logic is present in nonzero_address in rtlanal.h.
13485 If the return value is based on the assumption that signed overflow
13486 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13487 change *STRICT_OVERFLOW_P. */
13489 bool
13491 {
13494 {
13499 {
13508 /* For objects in symbol table check if we know they are non-zero.
13509 Don't do anything for variables and functions before symtab is built;
13510 it is quite possible that they will be declared weak later. */
13512 {
13518 else
13520 }
13522 /* Function local objects are never NULL. */
13529 /* Constants are never weak. */
13534 }
13542 {
13546 }
13551 }
13553 }
13555 #define integer_valued_real_p(X) \
13558 #define RECURSE(X) \
13559 ((integer_valued_real_p) (X, depth + 1))
13561 /* Return true if the floating point result of (CODE OP0) has an
13562 integer value. We also allow +Inf, -Inf and NaN to be considered
13563 integer values. Return false for signaling NaN.
13565 DEPTH is the current nesting depth of the query. */
13567 bool
13569 {
13571 {
13578 CASE_CONVERT:
13579 {
13586 }
13590 }
13592 }
13594 /* Return true if the floating point result of (CODE OP0 OP1) has an
13595 integer value. We also allow +Inf, -Inf and NaN to be considered
13596 integer values. Return false for signaling NaN.
13598 DEPTH is the current nesting depth of the query. */
13600 bool
13602 {
13604 {
13614 }
13616 }
13618 /* Return true if the floating point result of calling FNDECL with arguments
13619 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13620 considered integer values. Return false for signaling NaN. If FNDECL
13621 takes fewer than 2 arguments, the remaining ARGn are null.
13623 DEPTH is the current nesting depth of the query. */
13625 bool
13627 {
13629 {
13630 CASE_CFN_CEIL:
13631 CASE_CFN_FLOOR:
13632 CASE_CFN_NEARBYINT:
13633 CASE_CFN_RINT:
13634 CASE_CFN_ROUND:
13635 CASE_CFN_TRUNC:
13638 CASE_CFN_FMIN:
13639 CASE_CFN_FMAX:
13644 }
13646 }
13648 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13649 has an integer value. We also allow +Inf, -Inf and NaN to be
13650 considered integer values. Return false for signaling NaN.
13652 DEPTH is the current nesting depth of the query. */
13654 bool
13656 {
13658 {
13666 /* Limit the depth of recursion to avoid quadratic behavior.
13667 This is expected to catch almost all occurrences in practice.
13668 If this code misses important cases that unbounded recursion
13669 would not, passes that need this information could be revised
13670 to provide it through dataflow propagation. */
13674 depth));
13678 }
13680 }
13682 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
13683 has an integer value. We also allow +Inf, -Inf and NaN to be
13684 considered integer values. Return false for signaling NaN.
13686 DEPTH is the current nesting depth of the query. */
13688 static bool
13690 {
13692 {
13703 }
13705 }
13707 #undef RECURSE
13708 #undef integer_valued_real_p
13710 /* Return true if the floating point expression T has an integer value.
13711 We also allow +Inf, -Inf and NaN to be considered integer values.
13712 Return false for signaling NaN.
13714 DEPTH is the current nesting depth of the query. */
13716 bool
13718 {
13724 {
13740 }
13743 {
13749 {
13758 }
13762 }
13763 }
13765 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13766 attempt to fold the expression to a constant without modifying TYPE,
13767 OP0 or OP1.
13769 If the expression could be simplified to a constant, then return
13770 the constant. If the expression would not be simplified to a
13771 constant, then return NULL_TREE. */
13773 tree
13775 {
13778 }
13780 /* Given the components of a unary expression CODE, TYPE and OP0,
13781 attempt to fold the expression to a constant without modifying
13782 TYPE or OP0.
13784 If the expression could be simplified to a constant, then return
13785 the constant. If the expression would not be simplified to a
13786 constant, then return NULL_TREE. */
13788 tree
13790 {
13793 }
13795 /* If EXP represents referencing an element in a constant string
13796 (either via pointer arithmetic or array indexing), return the
13797 tree representing the value accessed, otherwise return NULL. */
13799 tree
13801 {
13805 {
13807 tree index;
13808 tree string;
13813 else
13814 {
13818 /* Optimize the special-case of a zero lower bound.
13820 We convert the low_bound to sizetype to avoid some problems
13821 with constant folding. (E.g. suppose the lower bound is 1,
13822 and its mode is QI. Without the conversion,l (ARRAY
13823 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13824 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13830 }
13843 }
13845 }
13847 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13848 an integer constant, real, or fixed-point constant.
13850 TYPE is the type of the result. */
13852 static tree
13854 {
13858 {
13860 {
13867 }
13874 {
13875 FIXED_VALUE_TYPE f;
13880 /* Propagate overflow flags. */
13884 }
13888 }
13891 }
13893 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13894 an integer constant or real constant.
13896 TYPE is the type of the result. */
13898 tree
13900 {
13904 {
13906 {
13907 /* If the value is unsigned or non-negative, then the absolute value
13908 is the same as the ordinary value. */
13912 /* If the value is negative, then the absolute value is
13913 its negation. */
13914 else
13915 {
13920 }
13921 }
13927 else
13933 }
13936 }
13938 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13939 constant. TYPE is the type of the result. */
13941 static tree
13943 {
13947 }
13949 /* Given CODE, a relational operator, the target type, TYPE and two
13950 constant operands OP0 and OP1, return the result of the
13951 relational operation. If the result is not a compile time
13952 constant, then return NULL_TREE. */
13954 static tree
13956 {
13959 /* From here on, the only cases we handle are when the result is
13960 known to be a constant. */
13963 {
13967 /* Handle the cases where either operand is a NaN. */
13969 {
13971 {
13999 }
14002 }
14005 }
14008 {
14012 }
14014 /* Handle equality/inequality of complex constants. */
14016 {
14027 else
14029 }
14032 {
14034 {
14035 /* Have vector comparison with scalar boolean result. */
14040 {
14045 }
14049 }
14056 {
14068 }
14071 }
14073 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
14075 To compute GT, swap the arguments and do LT.
14076 To compute GE, do LT and invert the result.
14077 To compute LE, swap the arguments, do LT and invert the result.
14078 To compute NE, do EQ and invert the result.
14080 Therefore, the code below must handle only EQ and LT. */
14083 {
14086 }
14088 /* Note that it is safe to invert for real values here because we
14089 have already handled the one case that it matters. */
14093 {
14096 }
14098 /* Compute a result for LT or EQ if args permit;
14099 Otherwise return T. */
14101 {
14104 else
14106 }
14107 else
14113 }
14115 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
14116 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
14117 itself. */
14119 tree
14121 {
14122 /* If the expression does not have side effects then we don't have to wrap
14123 it with a cleanup point expression. */
14127 /* If the expression is a return, check to see if the expression inside the
14128 return has no side effects or the right hand side of the modify expression
14129 inside the return. If either don't have side effects set we don't need to
14130 wrap the expression in a cleanup point expression. Note we don't check the
14131 left hand side of the modify because it should always be a return decl. */
14133 {
14140 }
14143 }
14145 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14146 of an indirection through OP0, or NULL_TREE if no simplification is
14147 possible. */
14149 tree
14151 {
14153 tree subtype;
14161 {
14164 /* *&CONST_DECL -> to the value of the const decl. */
14167 /* *&p => p; make sure to handle *&"str"[cst] here. */
14169 {
14173 else
14175 }
14176 /* *(foo *)&fooarray => fooarray[0] */
14179 && (!in_gimple_form
14181 {
14191 }
14192 /* *(foo *)&complexfoo => __real__ complexfoo */
14196 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14199 {
14203 }
14204 }
14208 {
14214 {
14215 tree op00type;
14219 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14222 {
14224 unsigned HOST_WIDE_INT max_offset
14229 {
14236 }
14237 }
14238 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14241 {
14245 }
14246 /* ((foo *)&fooarray)[1] => fooarray[1] */
14249 {
14259 }
14260 }
14261 }
14263 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14266 && (!in_gimple_form
14268 {
14269 tree type_domain;
14279 NULL_TREE);
14280 }
14283 }
14285 /* Builds an expression for an indirection through T, simplifying some
14286 cases. */
14288 tree
14290 {
14298 }
14300 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14302 tree
14304 {
14309 else
14311 }
14313 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14314 whose result is ignored. The type of the returned tree need not be
14315 the same as the original expression. */
14317 tree
14319 {
14325 {
14336 else
14342 {
14358 }
14363 }
14364 }
14366 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14368 tree
14370 {
14376 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14377 have to do anything. Only do this when we are not given a const,
14378 because in that case, this check is more expensive than just
14379 doing it. */
14381 {
14386 }
14388 /* If divisor is a power of two, simplify this to bit manipulation. */
14390 {
14392 {
14406 }
14407 else
14408 {
14409 tree t;
14415 }
14416 }
14417 else
14418 {
14423 }
14426 }
14428 /* Likewise, but round down. */
14430 tree
14432 {
14439 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14440 have to do anything. Only do this when we are not given a const,
14441 because in that case, this check is more expensive than just
14442 doing it. */
14444 {
14449 }
14451 /* If divisor is a power of two, simplify this to bit manipulation. */
14453 {
14454 tree t;
14458 }
14459 else
14460 {
14465 }
14468 }
14470 /* Returns the pointer to the base of the object addressed by EXP and
14471 extracts the information about the offset of the access, storing it
14472 to PBITPOS and POFFSET. */
14474 static tree
14477 {
14478 tree core;
14479 machine_mode mode;
14481 HOST_WIDE_INT bitsize;
14485 {
14490 }
14491 else
14492 {
14496 }
14499 }
14501 /* Returns true if addresses of E1 and E2 differ by a constant, false
14502 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14504 bool
14506 {
14520 {
14530 }
14532 {
14533 /* If only one of the offsets is non-constant, the difference cannot
14534 be a constant. */
14536 }
14537 else
14542 }
14544 /* Return OFF converted to a pointer offset type suitable as offset for
14545 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14546 tree
14548 {
14550 }
14552 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14553 tree
14555 {
14558 }
14560 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14561 tree
14563 {
14566 }
14568 /* Return a char pointer for a C string if it is a string constant
14569 or sum of string constant and integer constant. */
14573 {
14574 tree offset_node;
14587 }