| blob | a0ab9ebdcf7bb3b45be51d5f0f01431ca1072f82 |
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2015 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. */
103 /* Nonzero if we are folding constants inside an initializer; zero
104 otherwise. */
107 /* The following constants represent a bit based encoding of GCC's
108 comparison operators. This encoding simplifies transformations
109 on relational comparison operators, such as AND and OR. */
127 };
145 HOST_WIDE_INT *,
178 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
179 Otherwise, return LOC. */
181 static location_t
183 {
186 }
188 /* Similar to protected_set_expr_location, but never modify x in place,
189 if location can and needs to be set, unshare it. */
193 {
199 {
202 }
204 }
205 \f
206 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
207 division and returns the quotient. Otherwise returns
208 NULL_TREE. */
210 tree
212 {
213 widest_int quo;
220 }
221 \f
222 /* This is nonzero if we should defer warnings about undefined
223 overflow. This facility exists because these warnings are a
224 special case. The code to estimate loop iterations does not want
225 to issue any warnings, since it works with expressions which do not
226 occur in user code. Various bits of cleanup code call fold(), but
227 only use the result if it has certain characteristics (e.g., is a
228 constant); that code only wants to issue a warning if the result is
229 used. */
233 /* If a warning about undefined overflow is deferred, this is the
234 warning. Note that this may cause us to turn two warnings into
235 one, but that is fine since it is sufficient to only give one
236 warning per expression. */
240 /* If a warning about undefined overflow is deferred, this is the
241 level at which the warning should be emitted. */
245 /* Start deferring overflow warnings. We could use a stack here to
246 permit nested calls, but at present it is not necessary. */
248 void
250 {
252 }
254 /* Stop deferring overflow warnings. If there is a pending warning,
255 and ISSUE is true, then issue the warning if appropriate. STMT is
256 the statement with which the warning should be associated (used for
257 location information); STMT may be NULL. CODE is the level of the
258 warning--a warn_strict_overflow_code value. This function will use
259 the smaller of CODE and the deferred code when deciding whether to
260 issue the warning. CODE may be zero to mean to always use the
261 deferred code. */
263 void
265 {
267 location_t locus;
272 {
278 }
289 /* Use the smallest code level when deciding to issue the
290 warning. */
299 else
302 }
304 /* Stop deferring overflow warnings, ignoring any deferred
305 warnings. */
307 void
309 {
311 }
313 /* Whether we are deferring overflow warnings. */
315 bool
317 {
319 }
321 /* This is called when we fold something based on the fact that signed
322 overflow is undefined. */
324 static void
326 {
328 {
331 {
334 }
335 }
338 }
339 \f
340 /* Return true if the built-in mathematical function specified by CODE
341 is odd, i.e. -f(x) == f(-x). */
343 static bool
345 {
347 {
381 }
383 }
385 /* Check whether we may negate an integer constant T without causing
386 overflow. */
388 bool
390 {
391 tree type;
400 }
402 /* Determine whether an expression T can be cheaply negated using
403 the function negate_expr without introducing undefined overflow. */
405 static bool
407 {
408 tree type;
417 {
422 /* Check that -CST will not overflow type. */
435 /* We want to canonicalize to positive real constants. Pretend
436 that only negative ones can be easily negated. */
444 {
455 }
468 /* -(A + B) -> (-B) - A. */
473 /* -(A + B) -> (-A) - B. */
477 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
487 /* Fall through. */
498 /* In general we can't negate A / B, because if A is INT_MIN and
499 B is 1, we may turn this into INT_MIN / -1 which is undefined
500 and actually traps on some architectures. But if overflow is
501 undefined, we can negate, because - (INT_MIN / 1) is an
502 overflow. */
504 {
507 /* If overflow is undefined then we have to be careful because
508 we ask whether it's ok to associate the negate with the
509 division which is not ok for example for
510 -((a - b) / c) where (-(a - b)) / c may invoke undefined
511 overflow because of negating INT_MIN. So do not use
512 negate_expr_p here but open-code the two important cases. */
517 }
523 /* Negate -((double)float) as (double)(-float). */
525 {
529 }
533 /* Negate -f(x) as f(-x). */
539 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
541 {
545 }
550 }
552 }
554 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
555 simplification is possible.
556 If negate_expr_p would return true for T, NULL_TREE will never be
557 returned. */
559 static tree
561 {
563 tree tem;
566 {
567 /* Convert - (~A) to A + 1. */
593 {
598 }
602 {
607 {
611 }
614 }
637 {
638 /* -(A + B) -> (-B) - A. */
642 {
646 }
648 /* -(A + B) -> (-A) - B. */
650 {
654 }
655 }
659 /* - (A - B) -> B - A */
671 /* Fall through. */
675 {
684 }
690 /* In general we can't negate A / B, because if A is INT_MIN and
691 B is 1, we may turn this into INT_MIN / -1 which is undefined
692 and actually traps on some architectures. But if overflow is
693 undefined, we can negate, because - (INT_MIN / 1) is an
694 overflow. */
696 {
701 {
708 }
709 /* If overflow is undefined then we have to be careful because
710 we ask whether it's ok to associate the negate with the
711 division which is not ok for example for
712 -((a - b) / c) where (-(a - b)) / c may invoke undefined
713 overflow because of negating INT_MIN. So do not use
714 negate_expr_p here but open-code the two important cases. */
723 }
727 /* Convert -((double)float) into (double)(-float). */
729 {
733 }
737 /* Negate -f(x) as f(-x). */
740 {
746 }
750 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
752 {
755 {
762 }
763 }
768 }
771 }
773 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
774 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
775 return NULL_TREE. */
777 static tree
779 {
781 location_t loc;
794 }
795 \f
796 /* Split a tree IN into a constant, literal and variable parts that could be
797 combined with CODE to make IN. "constant" means an expression with
798 TREE_CONSTANT but that isn't an actual constant. CODE must be a
799 commutative arithmetic operation. Store the constant part into *CONP,
800 the literal in *LITP and return the variable part. If a part isn't
801 present, set it to null. If the tree does not decompose in this way,
802 return the entire tree as the variable part and the other parts as null.
804 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
805 case, we negate an operand that was subtracted. Except if it is a
806 literal for which we use *MINUS_LITP instead.
808 If NEGATE_P is true, we are negating all of IN, again except a literal
809 for which we use *MINUS_LITP instead.
811 If IN is itself a literal or constant, return it as appropriate.
813 Note that we do not guarantee that any of the three values will be the
814 same type as IN, but they will have the same signedness and mode. */
816 static tree
819 {
826 /* Strip any conversions that don't change the machine mode or signedness. */
835 /* We can associate addition and subtraction together (even
836 though the C standard doesn't say so) for integers because
837 the value is not affected. For reals, the value might be
838 affected, so we can't. */
841 {
847 /* First see if either of the operands is a literal, then a constant. */
860 /* If we haven't dealt with either operand, this is not a case we can
861 decompose. Otherwise, VAR is either of the ones remaining, if any. */
866 else
869 /* Now do any needed negations. */
876 }
879 {
880 /* -X - 1 is folded to ~X, undo that here. */
883 }
886 else
890 {
897 }
900 }
902 /* Re-associate trees split by the above function. T1 and T2 are
903 either expressions to associate or null. Return the new
904 expression, if any. LOC is the location of the new expression. If
905 we build an operation, do it in TYPE and with CODE. */
907 static tree
909 {
915 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
916 try to fold this since we will have infinite recursion. But do
917 deal with any NEGATE_EXPRs. */
920 {
922 {
935 }
937 {
940 }
944 }
948 }
949 \f
950 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
951 for use in int_const_binop, size_binop and size_diffop. */
953 static bool
955 {
962 {
971 }
976 }
979 /* Combine two integer constants ARG1 and ARG2 under operation CODE
980 to produce a new constant. Return NULL_TREE if we don't know how
981 to evaluate CODE at compile-time. */
983 static tree
986 {
987 wide_int res;
988 tree t;
997 {
1013 {
1017 else
1019 }
1022 /* It's unclear from the C standard whether shifts can overflow.
1023 The following code ignores overflow; perhaps a C standard
1024 interpretation ruling is needed. */
1026 else
1033 {
1037 else
1039 }
1043 else
1122 }
1130 }
1132 tree
1134 {
1136 }
1138 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1139 constant. We assume ARG1 and ARG2 have the same data type, or at least
1140 are the same kind of constant and the same machine mode. Return zero if
1141 combining the constants is not allowed in the current operating mode. */
1143 static tree
1145 {
1146 /* Sanity check for the recursive cases. */
1154 {
1160 }
1163 {
1164 machine_mode mode;
1165 REAL_VALUE_TYPE d1;
1166 REAL_VALUE_TYPE d2;
1167 REAL_VALUE_TYPE value;
1168 REAL_VALUE_TYPE result;
1172 /* The following codes are handled by real_arithmetic. */
1174 {
1185 }
1193 /* Don't perform operation if we honor signaling NaNs and
1194 either operand is a NaN. */
1199 /* Don't perform operation if it would raise a division
1200 by zero exception. */
1206 /* If either operand is a NaN, just return it. Otherwise, set up
1207 for floating-point trap; we return an overflow. */
1216 /* Don't constant fold this floating point operation if
1217 the result has overflowed and flag_trapping_math. */
1225 /* Don't constant fold this floating point operation if the
1226 result may dependent upon the run-time rounding mode and
1227 flag_rounding_math is set, or if GCC's software emulation
1228 is unable to accurately represent the result. */
1238 }
1241 {
1242 FIXED_VALUE_TYPE f1;
1243 FIXED_VALUE_TYPE f2;
1244 FIXED_VALUE_TYPE result;
1249 /* The following codes are handled by fixed_arithmetic. */
1251 {
1263 {
1270 }
1275 }
1282 /* Propagate overflow flags. */
1286 }
1289 {
1298 {
1309 mpc_mul);
1323 mpc_div);
1324 /* Fallthru ... */
1330 {
1331 /* Keep this algorithm in sync with
1332 tree-complex.c:expand_complex_div_straight().
1334 Expand complex division to scalars, straightforward algorithm.
1335 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1336 t = br*br + bi*bi
1337 */
1338 tree magsquared
1342 tree t1
1346 tree t2
1353 }
1354 else
1355 {
1356 /* Keep this algorithm in sync with
1357 tree-complex.c:expand_complex_div_wide().
1359 Expand complex division to scalars, modified algorithm to minimize
1360 overflow with wide input ranges. */
1366 {
1367 /* In the TRUE branch, we compute
1368 ratio = br/bi;
1369 div = (br * ratio) + bi;
1370 tr = (ar * ratio) + ai;
1371 ti = (ai * ratio) - ar;
1372 tr = tr / div;
1373 ti = ti / div; */
1384 }
1385 else
1386 {
1387 /* In the FALSE branch, we compute
1388 ratio = d/c;
1389 divisor = (d * ratio) + c;
1390 tr = (b * ratio) + a;
1391 ti = b - (a * ratio);
1392 tr = tr / div;
1393 ti = ti / div; */
1405 }
1406 }
1411 }
1415 }
1419 {
1425 {
1431 /* It is possible that const_binop cannot handle the given
1432 code and return NULL_TREE */
1435 }
1438 }
1440 /* Shifts allow a scalar offset for a vector. */
1443 {
1449 {
1454 /* It is possible that const_binop cannot handle the given
1455 code and return NULL_TREE. */
1458 }
1461 }
1463 }
1465 /* Overload that adds a TYPE parameter to be able to dispatch
1466 to fold_relational_const. */
1468 tree
1470 {
1474 /* ??? Until we make the const_binop worker take the type of the
1475 result as argument put those cases that need it here. */
1477 {
1488 {
1504 {
1510 }
1513 }
1519 {
1544 {
1557 }
1560 }
1563 }
1568 /* Make sure type and arg0 have the same saturating flag. */
1573 }
1575 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1576 Return zero if computing the constants is not possible. */
1578 tree
1580 {
1582 {
1583 CASE_CONVERT:
1598 {
1599 /* Can't call fold_negate_const directly here as that doesn't
1600 handle all cases and we might not be able to negate some
1601 constants. */
1606 }
1615 {
1619 }
1625 /* Perform BIT_NOT_EXPR on each element individually. */
1627 {
1629 tree elem;
1634 {
1640 }
1643 }
1665 {
1684 else
1688 {
1692 }
1695 }
1700 {
1714 {
1719 }
1722 {
1726 }
1729 }
1733 }
1736 }
1738 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1739 indicates which particular sizetype to create. */
1741 tree
1743 {
1745 }
1746 \f
1747 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1748 is a tree code. The type of the result is taken from the operands.
1749 Both must be equivalent integer types, ala int_binop_types_match_p.
1750 If the operands are constant, so is the result. */
1752 tree
1754 {
1763 /* Handle the special case of two integer constants faster. */
1765 {
1766 /* And some specific cases even faster than that. */
1768 {
1773 }
1775 {
1778 }
1780 {
1783 }
1785 /* Handle general case of two integer constants. For sizetype
1786 constant calculations we always want to know about overflow,
1787 even in the unsigned case. */
1789 }
1792 }
1794 /* Given two values, either both of sizetype or both of bitsizetype,
1795 compute the difference between the two values. Return the value
1796 in signed type corresponding to the type of the operands. */
1798 tree
1800 {
1802 tree ctype;
1807 /* If the type is already signed, just do the simple thing. */
1815 else
1818 /* If either operand is not a constant, do the conversions to the signed
1819 type and subtract. The hardware will do the right thing with any
1820 overflow in the subtraction. */
1826 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1827 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1828 overflow) and negate (which can't either). Special-case a result
1829 of zero while we're here. */
1835 else
1839 MINUS_EXPR,
1841 }
1842 \f
1843 /* A subroutine of fold_convert_const handling conversions of an
1844 INTEGER_CST to another integer type. */
1846 static tree
1848 {
1849 /* Given an integer constant, make new constant with new type,
1850 appropriately sign-extended or truncated. Use widest_int
1851 so that any extension is done according ARG1's type. */
1855 }
1857 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1858 to an integer type. */
1860 static tree
1862 {
1864 tree t;
1866 /* The following code implements the floating point to integer
1867 conversion rules required by the Java Language Specification,
1868 that IEEE NaNs are mapped to zero and values that overflow
1869 the target precision saturate, i.e. values greater than
1870 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1871 are mapped to INT_MIN. These semantics are allowed by the
1872 C and C++ standards that simply state that the behavior of
1873 FP-to-integer conversion is unspecified upon overflow. */
1875 wide_int val;
1876 REAL_VALUE_TYPE r;
1880 {
1887 }
1889 /* If R is NaN, return zero and show we have an overflow. */
1891 {
1894 }
1896 /* See if R is less than the lower bound or greater than the
1897 upper bound. */
1900 {
1904 {
1907 }
1908 }
1911 {
1914 {
1917 {
1920 }
1921 }
1922 }
1929 }
1931 /* A subroutine of fold_convert_const handling conversions of a
1932 FIXED_CST to an integer type. */
1934 static tree
1936 {
1937 tree t;
1941 /* Right shift FIXED_CST to temp by fbit. */
1945 {
1947 HOST_BITS_PER_DOUBLE_INT,
1950 /* Left shift temp to temp_trunc by fbit. */
1952 HOST_BITS_PER_DOUBLE_INT,
1954 }
1955 else
1956 {
1959 }
1961 /* If FIXED_CST is negative, we need to round the value toward 0.
1962 By checking if the fractional bits are not zero to add 1 to temp. */
1968 /* Given a fixed-point constant, make new constant with new type,
1969 appropriately sign-extended or truncated. */
1977 }
1979 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1980 to another floating point type. */
1982 static tree
1984 {
1985 REAL_VALUE_TYPE value;
1986 tree t;
1991 /* If converting an infinity or NAN to a representation that doesn't
1992 have one, set the overflow bit so that we can produce some kind of
1993 error message at the appropriate point if necessary. It's not the
1994 most user-friendly message, but it's better than nothing. */
2001 /* Regular overflow, conversion produced an infinity in a mode that
2002 can't represent them. */
2007 else
2010 }
2012 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2013 to a floating point type. */
2015 static tree
2017 {
2018 REAL_VALUE_TYPE value;
2019 tree t;
2026 }
2028 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2029 to another fixed-point type. */
2031 static tree
2033 {
2034 FIXED_VALUE_TYPE value;
2035 tree t;
2042 /* Propagate overflow flags. */
2046 }
2048 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2049 to a fixed-point type. */
2051 static tree
2053 {
2054 FIXED_VALUE_TYPE value;
2055 tree t;
2057 double_int di;
2064 else
2072 /* Propagate overflow flags. */
2076 }
2078 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2079 to a fixed-point type. */
2081 static tree
2083 {
2084 FIXED_VALUE_TYPE value;
2085 tree t;
2093 /* Propagate overflow flags. */
2097 }
2099 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2100 type TYPE. If no simplification can be done return NULL_TREE. */
2102 static tree
2104 {
2110 {
2117 }
2119 {
2126 }
2128 {
2135 }
2137 }
2139 /* Construct a vector of zero elements of vector type TYPE. */
2141 static tree
2143 {
2144 tree t;
2148 }
2150 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2152 bool
2154 {
2169 {
2188 }
2189 }
2191 /* Convert expression ARG to type TYPE. Used by the middle-end for
2192 simple conversions in preference to calling the front-end's convert. */
2194 tree
2196 {
2198 tree tem;
2209 {
2212 /* Handle conversions between pointers to different address spaces. */
2217 /* fall through */
2222 {
2226 }
2240 {
2244 }
2246 {
2250 }
2252 {
2256 }
2259 {
2277 }
2282 {
2286 }
2289 {
2303 }
2307 {
2316 integer_zero_node));
2318 {
2322 {
2328 }
2336 }
2340 }
2358 }
2359 fold_convert_exit:
2362 }
2363 \f
2364 /* Return false if expr can be assumed not to be an lvalue, true
2365 otherwise. */
2367 static bool
2369 {
2370 /* We only need to wrap lvalue tree codes. */
2372 {
2403 /* Assume the worst for front-end tree codes. */
2407 }
2410 }
2412 /* Return an expr equal to X but certainly not valid as an lvalue. */
2414 tree
2416 {
2417 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2418 us. */
2425 }
2427 /* When pedantic, return an expr equal to X but certainly not valid as a
2428 pedantic lvalue. Otherwise, return X. */
2430 static tree
2432 {
2434 }
2435 \f
2436 /* Given a tree comparison code, return the code that is the logical inverse.
2437 It is generally not safe to do this for floating-point comparisons, except
2438 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2439 ERROR_MARK in this case. */
2441 enum tree_code
2443 {
2449 {
2480 }
2481 }
2483 /* Similar, but return the comparison that results if the operands are
2484 swapped. This is safe for floating-point. */
2486 enum tree_code
2488 {
2490 {
2516 }
2517 }
2520 /* Convert a comparison tree code from an enum tree_code representation
2521 into a compcode bit-based encoding. This function is the inverse of
2522 compcode_to_comparison. */
2524 static enum comparison_code
2526 {
2528 {
2559 }
2560 }
2562 /* Convert a compcode bit-based encoding of a comparison operator back
2563 to GCC's enum tree_code representation. This function is the
2564 inverse of comparison_to_compcode. */
2566 static enum tree_code
2568 {
2570 {
2601 }
2602 }
2604 /* Return a tree for the comparison which is the combination of
2605 doing the AND or OR (depending on CODE) of the two operations LCODE
2606 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2607 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2608 if this makes the transformation invalid. */
2610 tree
2615 {
2622 {
2633 }
2636 {
2637 /* Eliminate unordered comparisons, as well as LTGT and ORD
2638 which are not used unless the mode has NaNs. */
2644 }
2646 {
2647 /* Check that the original operation and the optimized ones will trap
2648 under the same condition. */
2659 /* In a short-circuited boolean expression the LHS might be
2660 such that the RHS, if evaluated, will never trap. For
2661 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2662 if neither x nor y is NaN. (This is a mixed blessing: for
2663 example, the expression above will never trap, hence
2664 optimizing it to x < y would be invalid). */
2669 /* If the comparison was short-circuited, and only the RHS
2670 trapped, we may now generate a spurious trap. */
2675 /* If we changed the conditions that cause a trap, we lose. */
2678 }
2684 else
2685 {
2690 }
2691 }
2692 \f
2693 /* Return nonzero if two operands (typically of the same tree node)
2694 are necessarily equal. If either argument has side-effects this
2695 function returns zero. FLAGS modifies behavior as follows:
2697 If OEP_ONLY_CONST is set, only return nonzero for constants.
2698 This function tests whether the operands are indistinguishable;
2699 it does not test whether they are equal using C's == operation.
2700 The distinction is important for IEEE floating point, because
2701 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2702 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2704 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2705 even though it may hold multiple values during a function.
2706 This is because a GCC tree node guarantees that nothing else is
2707 executed between the evaluation of its "operands" (which may often
2708 be evaluated in arbitrary order). Hence if the operands themselves
2709 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2710 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2711 unset means assuming isochronic (or instantaneous) tree equivalence.
2712 Unless comparing arbitrary expression trees, such as from different
2713 statements, this flag can usually be left unset.
2715 If OEP_PURE_SAME is set, then pure functions with identical arguments
2716 are considered the same. It is used when the caller has other ways
2717 to ensure that global memory is unchanged in between. */
2719 int
2721 {
2722 /* If either is ERROR_MARK, they aren't equal. */
2728 /* Similar, if either does not have a type (like a released SSA name),
2729 they aren't equal. */
2733 /* Check equality of integer constants before bailing out due to
2734 precision differences. */
2738 /* If both types don't have the same signedness, then we can't consider
2739 them equal. We must check this before the STRIP_NOPS calls
2740 because they may change the signedness of the arguments. As pointers
2741 strictly don't have a signedness, require either two pointers or
2742 two non-pointers as well. */
2747 /* We cannot consider pointers to different address space equal. */
2753 /* If both types don't have the same precision, then it is not safe
2754 to strip NOPs. */
2762 /* In case both args are comparisons but with different comparison
2763 code, try to swap the comparison operands of one arg to produce
2764 a match and compare that variant. */
2768 {
2776 }
2779 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2783 /* This is needed for conversions and for COMPONENT_REF.
2784 Might as well play it safe and always test this. */
2790 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
2791 We don't care about side effects in that case because the SAVE_EXPR
2792 takes care of that for us. In all other cases, two expressions are
2793 equal if they have no side effects. If we have two identical
2794 expressions with side effects that should be treated the same due
2795 to the only side effects being identical SAVE_EXPR's, that will
2796 be detected in the recursive calls below.
2797 If we are taking an invariant address of two identical objects
2798 they are necessarily equal as well. */
2805 /* Next handle constant cases, those for which we can return 1 even
2806 if ONLY_CONST is set. */
2809 {
2824 {
2825 /* If we do not distinguish between signed and unsigned zero,
2826 consider them equal. */
2829 }
2833 {
2840 {
2844 }
2846 }
2850 flags)
2852 flags));
2866 }
2871 /* Define macros to test an operand from arg0 and arg1 for equality and a
2872 variant that allows null and views null as being different from any
2873 non-null value. In the latter case, if either is null, the both
2874 must be; otherwise, do the normal comparison. */
2875 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
2876 TREE_OPERAND (arg1, N), flags)
2878 #define OP_SAME_WITH_NULL(N) \
2879 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
2880 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
2883 {
2885 /* Two conversions are equal only if signedness and modes match. */
2887 {
2888 CASE_CONVERT:
2896 }
2906 /* For commutative ops, allow the other order. */
2914 /* If either of the pointer (or reference) expressions we are
2915 dereferencing contain a side effect, these cannot be equal,
2916 but their addresses can be. */
2923 {
2934 /* Require equal extra operands and then fall through to MEM_REF
2935 handling of the two common operands. */
2940 /* Fallthru. */
2943 /* Require equal access sizes, and similar pointer types.
2944 We can have incomplete types for array references of
2945 variable-sized arrays from the Fortran frontend
2946 though. Also verify the types are compatible. */
2953 && alias_ptr_types_compatible_p
2960 /* Operands 2 and 3 may be null.
2961 Compare the array index by value if it is constant first as we
2962 may have different types but same value here. */
2973 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
2974 may be NULL when we're called to compare MEM_EXPRs. */
2989 }
2993 {
3007 /* The multiplcation operands are commutative. */
3008 /* FALLTHRU */
3016 /* Otherwise take into account this is a commutative operation. */
3029 }
3033 {
3035 /* If the CALL_EXPRs call different functions, then they
3036 clearly can not be equal. */
3038 flags))
3041 {
3045 else
3049 }
3051 /* Now see if all the arguments are the same. */
3052 {
3063 /* If we get here and both argument lists are exhausted
3064 then the CALL_EXPRs are equal. */
3066 }
3069 }
3072 /* Consider __builtin_sqrt equal to sqrt. */
3080 }
3082 #undef OP_SAME
3083 #undef OP_SAME_WITH_NULL
3084 }
3085 \f
3086 /* Similar to operand_equal_p, but see if ARG0 might have been made by
3087 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
3089 When in doubt, return 0. */
3091 static int
3093 {
3105 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3106 and see if the inner values are the same. This removes any
3107 signedness comparison, which doesn't matter here. */
3114 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
3115 actual comparison operand, ARG0.
3117 First throw away any conversions to wider types
3118 already present in the operands. */
3127 {
3130 /* Make sure shorter operand is extended the right way
3131 to match the longer operand. */
3137 }
3140 }
3141 \f
3142 /* See if ARG is an expression that is either a comparison or is performing
3143 arithmetic on comparisons. The comparisons must only be comparing
3144 two different values, which will be stored in *CVAL1 and *CVAL2; if
3145 they are nonzero it means that some operands have already been found.
3146 No variables may be used anywhere else in the expression except in the
3147 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3148 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3150 If this is true, return 1. Otherwise, return zero. */
3152 static int
3154 {
3158 /* We can handle some of the tcc_expression cases here. */
3168 {
3169 /* If we've already found a CVAL1 or CVAL2, this expression is
3170 two complex to handle. */
3176 }
3179 {
3202 /* First see if we can handle the first operand, then the second. For
3203 the second operand, we know *CVAL1 can't be zero. It must be that
3204 one side of the comparison is each of the values; test for the
3205 case where this isn't true by failing if the two operands
3206 are the same. */
3215 ;
3219 ;
3220 else
3224 ;
3228 ;
3229 else
3236 }
3237 }
3238 \f
3239 /* ARG is a tree that is known to contain just arithmetic operations and
3240 comparisons. Evaluate the operations in the tree substituting NEW0 for
3241 any occurrence of OLD0 as an operand of a comparison and likewise for
3242 NEW1 and OLD1. */
3244 static tree
3247 {
3252 /* We can handle some of the tcc_expression cases here. */
3260 {
3275 {
3294 }
3295 /* Fall through - ??? */
3298 {
3302 /* We need to check both for exact equality and tree equality. The
3303 former will be true if the operand has a side-effect. In that
3304 case, we know the operand occurred exactly once. */
3317 }
3321 }
3322 }
3323 \f
3324 /* Return a tree for the case when the result of an expression is RESULT
3325 converted to TYPE and OMITTED was previously an operand of the expression
3326 but is now not needed (e.g., we folded OMITTED * 0).
3328 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3329 the conversion of RESULT to TYPE. */
3331 tree
3333 {
3336 /* If the resulting operand is an empty statement, just return the omitted
3337 statement casted to void. */
3347 }
3349 /* Return a tree for the case when the result of an expression is RESULT
3350 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3351 of the expression but are now not needed.
3353 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3354 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3355 evaluated before OMITTED2. Otherwise, if neither has side effects,
3356 just do the conversion of RESULT to TYPE. */
3358 tree
3361 {
3370 }
3372 \f
3373 /* Return a simplified tree node for the truth-negation of ARG. This
3374 never alters ARG itself. We assume that ARG is an operation that
3375 returns a truth value (0 or 1).
3377 FIXME: one would think we would fold the result, but it causes
3378 problems with the dominator optimizer. */
3380 static tree
3382 {
3387 /* If this is a comparison, we can simply invert it, except for
3388 floating-point non-equality comparisons, in which case we just
3389 enclose a TRUTH_NOT_EXPR around what we have. */
3392 {
3395 && flag_trapping_math
3406 }
3409 {
3428 /* Here we can invert either operand. We invert the first operand
3429 unless the second operand is a TRUTH_NOT_EXPR in which case our
3430 result is the XOR of the first operand with the inside of the
3431 negation of the second operand. */
3436 else
3459 {
3466 /* A COND_EXPR may have a throw as one operand, which
3467 then has void type. Just leave void operands
3468 as they are. */
3474 }
3486 CASE_CONVERT:
3490 /* ... fall through ... */
3512 }
3513 }
3515 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3516 assume that ARG is an operation that returns a truth value (0 or 1
3517 for scalars, 0 or -1 for vectors). Return the folded expression if
3518 folding is successful. Otherwise, return NULL_TREE. */
3520 static tree
3522 {
3525 ? BIT_NOT_EXPR
3528 }
3530 /* Return a simplified tree node for the truth-negation of ARG. This
3531 never alters ARG itself. We assume that ARG is an operation that
3532 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3534 tree
3536 {
3542 ? BIT_NOT_EXPR
3545 }
3547 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
3548 operands are another bit-wise operation with a common input. If so,
3549 distribute the bit operations to save an operation and possibly two if
3550 constants are involved. For example, convert
3551 (A | B) & (A | C) into A | (B & C)
3552 Further simplification will occur if B and C are constants.
3554 If this optimization cannot be done, 0 will be returned. */
3556 static tree
3559 {
3560 tree common;
3570 {
3574 }
3576 {
3580 }
3582 {
3586 }
3588 {
3592 }
3593 else
3601 }
3603 /* Knowing that ARG0 and ARG1 are both RDIV_EXPRs, simplify a binary operation
3604 with code CODE. This optimization is unsafe. */
3605 static tree
3608 {
3612 /* (A / C) +- (B / C) -> (A +- B) / C. */
3622 /* (A / C1) +- (A / C2) -> A * (1 / C1 +- 1 / C2). */
3627 {
3639 }
3642 }
3643 \f
3644 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3645 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero. */
3647 static tree
3650 {
3654 {
3661 }
3675 }
3677 /* Optimize a bit-field compare.
3679 There are two cases: First is a compare against a constant and the
3680 second is a comparison of two items where the fields are at the same
3681 bit position relative to the start of a chunk (byte, halfword, word)
3682 large enough to contain it. In these cases we can avoid the shift
3683 implicit in bitfield extractions.
3685 For constants, we emit a compare of the shifted constant with the
3686 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
3687 compared. For two fields at the same position, we do the ANDs with the
3688 similar mask and compare the result of the ANDs.
3690 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
3691 COMPARE_TYPE is the type of the comparison, and LHS and RHS
3692 are the left and right operands of the comparison, respectively.
3694 If the optimization described above can be done, we return the resulting
3695 tree. Otherwise we return zero. */
3697 static tree
3700 {
3703 tree unsigned_type;
3709 tree mask;
3710 tree offset;
3712 /* Get all the information about the extractions being done. If the bit size
3713 if the same as the size of the underlying object, we aren't doing an
3714 extraction at all and so can do nothing. We also don't want to
3715 do anything if the inner expression is a PLACEHOLDER_EXPR since we
3716 then will no longer be able to replace it. */
3724 {
3725 /* If this is not a constant, we can only do something if bit positions,
3726 sizes, and signedness are the same. */
3734 }
3736 /* See if we can find a mode to refer to this field. We should be able to,
3737 but fail if we can't. */
3746 /* Set signed and unsigned types of the precision of this mode for the
3747 shifts below. */
3750 /* Compute the bit position and size for the new reference and our offset
3751 within it. If the new reference is the same size as the original, we
3752 won't optimize anything, so return zero. */
3762 /* Make the mask to be used against the extracted field. */
3769 /* If not comparing with constant, just rework the comparison
3770 and return. */
3774 unsigned_type,
3777 mask),
3780 unsigned_type,
3783 mask));
3785 /* Otherwise, we are handling the constant case. See if the constant is too
3786 big for the field. Warn and return a tree of for 0 (false) if so. We do
3787 this not only for its own sake, but to avoid having to test for this
3788 error case below. If we didn't, we might generate wrong code.
3790 For unsigned fields, the constant shifted right by the field length should
3791 be all zero. For signed fields, the high-order bits should agree with
3792 the sign bit. */
3795 {
3797 {
3801 }
3802 }
3803 else
3804 {
3807 {
3811 }
3812 }
3814 /* Single-bit compares should always be against zero. */
3816 {
3819 }
3821 /* Make a new bitfield reference, shift the constant over the
3822 appropriate number of bits and mask it with the computed mask
3823 (in case this was a signed field). If we changed it, make a new one. */
3830 mask);
3835 }
3836 \f
3837 /* Subroutine for fold_truth_andor_1: decode a field reference.
3839 If EXP is a comparison reference, we return the innermost reference.
3841 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
3842 set to the starting bit number.
3844 If the innermost field can be completely contained in a mode-sized
3845 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
3847 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
3848 otherwise it is not changed.
3850 *PUNSIGNEDP is set to the signedness of the field.
3852 *PMASK is set to the mask used. This is either contained in a
3853 BIT_AND_EXPR or derived from the width of the field.
3855 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
3857 Return 0 if this is not a component reference or is one that we can't
3858 do anything with. */
3860 static tree
3865 {
3869 tree unsigned_type;
3872 /* All the optimizations using this function assume integer fields.
3873 There are problems with FP fields since the type_for_size call
3874 below can fail for, e.g., XFmode. */
3878 /* We are interested in the bare arrangement of bits, so strip everything
3879 that doesn't affect the machine mode. However, record the type of the
3880 outermost expression if it may matter below. */
3887 {
3893 }
3902 /* If the number of bits in the reference is the same as the bitsize of
3903 the outer type, then the outer type gives the signedness. Otherwise
3904 (in case of a small bitfield) the signedness is unchanged. */
3908 /* Compute the mask to access the bitfield. */
3917 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
3925 }
3927 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
3928 bit positions and MASK is SIGNED. */
3930 static int
3932 {
3936 /* If this function returns true when the type of the mask is
3937 UNSIGNED, then there will be errors. In particular see
3938 gcc.c-torture/execute/990326-1.c. There does not appear to be
3939 any documentation paper trail as to why this is so. But the pre
3940 wide-int worked with that restriction and it has been preserved
3941 here. */
3946 }
3948 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
3949 represents the sign bit of EXP's type. If EXP represents a sign
3950 or zero extension, also test VAL against the unextended type.
3951 The return value is the (sub)expression whose sign bit is VAL,
3952 or NULL_TREE otherwise. */
3954 tree
3956 {
3958 tree t;
3960 /* Tree EXP must have an integral type. */
3965 /* Tree VAL must be an integer constant. */
3974 /* Handle extension from a narrower type. */
3980 }
3982 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
3983 to be evaluated unconditionally. */
3985 static int
3987 {
3988 /* Strip any conversions that don't change the machine mode. */
3997 /* Don't regard global variables as simple. They may be
3998 allocated in ways unknown to the compiler (shared memory,
3999 #pragma weak, etc). */
4002 /* Weakrefs are not safe to be read, since they can be NULL.
4003 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4004 have DECL_WEAK flag set. */
4006 /* Loading a static variable is unduly expensive, but global
4007 registers aren't expensive. */
4009 }
4011 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4012 to be evaluated unconditionally.
4013 I addition to simple_operand_p, we assume that comparisons, conversions,
4014 and logic-not operations are simple, if their operands are simple, too. */
4016 static bool
4018 {
4038 }
4040 \f
4041 /* The following functions are subroutines to fold_range_test and allow it to
4042 try to change a logical combination of comparisons into a range test.
4044 For example, both
4045 X == 2 || X == 3 || X == 4 || X == 5
4046 and
4047 X >= 2 && X <= 5
4048 are converted to
4049 (unsigned) (X - 2) <= 3
4051 We describe each set of comparisons as being either inside or outside
4052 a range, using a variable named like IN_P, and then describe the
4053 range with a lower and upper bound. If one of the bounds is omitted,
4054 it represents either the highest or lowest value of the type.
4056 In the comments below, we represent a range by two numbers in brackets
4057 preceded by a "+" to designate being inside that range, or a "-" to
4058 designate being outside that range, so the condition can be inverted by
4059 flipping the prefix. An omitted bound is represented by a "-". For
4060 example, "- [-, 10]" means being outside the range starting at the lowest
4061 possible value and ending at 10, in other words, being greater than 10.
4062 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4063 always false.
4065 We set up things so that the missing bounds are handled in a consistent
4066 manner so neither a missing bound nor "true" and "false" need to be
4067 handled using a special case. */
4069 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4070 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4071 and UPPER1_P are nonzero if the respective argument is an upper bound
4072 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4073 must be specified for a comparison. ARG1 will be converted to ARG0's
4074 type if both are specified. */
4076 static tree
4079 {
4080 tree tem;
4084 /* If neither arg represents infinity, do the normal operation.
4085 Else, if not a comparison, return infinity. Else handle the special
4086 comparison rules. Note that most of the cases below won't occur, but
4087 are handled for consistency. */
4090 {
4095 }
4100 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4101 for neither. In real maths, we cannot assume open ended ranges are
4102 the same. But, this is computer arithmetic, where numbers are finite.
4103 We can therefore make the transformation of any unbounded range with
4104 the value Z, Z being greater than any representable number. This permits
4105 us to treat unbounded ranges as equal. */
4109 {
4130 }
4133 }
4134 \f
4135 /* Helper routine for make_range. Perform one step for it, return
4136 new expression if the loop should continue or NULL_TREE if it should
4137 stop. */
4139 tree
4143 {
4149 {
4151 /* We can only do something if the range is testing for zero. */
4160 /* We can only do something if the range is testing for zero
4161 and if the second operand is an integer constant. Note that
4162 saying something is "in" the range we make is done by
4163 complementing IN_P since it will set in the initial case of
4164 being not equal to zero; "out" is leaving it alone. */
4171 {
4192 }
4194 /* If this is an unsigned comparison, we also know that EXP is
4195 greater than or equal to zero. We base the range tests we make
4196 on that fact, so we record it here so we can parse existing
4197 range tests. We test arg0_type since often the return type
4198 of, e.g. EQ_EXPR, is boolean. */
4200 {
4204 NULL_TREE))
4209 /* If the high bound is missing, but we have a nonzero low
4210 bound, reverse the range so it goes from zero to the low bound
4211 minus 1. */
4213 {
4218 }
4219 }
4227 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4228 low and high are non-NULL, then normalize will DTRT. */
4231 {
4236 }
4238 /* (-x) IN [a,b] -> x in [-b, -a] */
4250 /* ~ X -> -X - 1 */
4259 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4260 move a constant to the other side. */
4265 /* If EXP is signed, any overflow in the computation is undefined,
4266 so we don't worry about it so long as our computations on
4267 the bounds don't overflow. For unsigned, overflow is defined
4268 and this is exactly the right thing. */
4280 normalize:
4281 /* Check for an unsigned range which has wrapped around the maximum
4282 value thus making n_high < n_low, and normalize it. */
4284 {
4290 /* If the range is of the form +/- [ x+1, x ], we won't
4291 be able to normalize it. But then, it represents the
4292 whole range or the empty set, so make it
4293 +/- [ -, - ]. */
4297 else
4299 }
4300 else
4308 CASE_CONVERT:
4326 /* If we're converting arg0 from an unsigned type, to exp,
4327 a signed type, we will be doing the comparison as unsigned.
4328 The tests above have already verified that LOW and HIGH
4329 are both positive.
4331 So we have to ensure that we will handle large unsigned
4332 values the same way that the current signed bounds treat
4333 negative values. */
4336 {
4337 tree high_positive;
4338 tree equiv_type;
4339 /* For fixed-point modes, we need to pass the saturating flag
4340 as the 2nd parameter. */
4342 equiv_type
4345 else
4346 equiv_type
4349 /* A range without an upper bound is, naturally, unbounded.
4350 Since convert would have cropped a very large value, use
4351 the max value for the destination type. */
4352 high_positive
4359 high_positive),
4362 /* If the low bound is specified, "and" the range with the
4363 range for which the original unsigned value will be
4364 positive. */
4366 {
4369 integer_zero_node),
4370 high_positive))
4374 }
4375 else
4376 {
4377 /* Otherwise, "or" the range with the range of the input
4378 that will be interpreted as negative. */
4381 integer_zero_node),
4382 high_positive))
4386 }
4387 }
4396 }
4397 }
4399 /* Given EXP, a logical expression, set the range it is testing into
4400 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4401 actually being tested. *PLOW and *PHIGH will be made of the same
4402 type as the returned expression. If EXP is not a comparison, we
4403 will most likely not be returning a useful value and range. Set
4404 *STRICT_OVERFLOW_P to true if the return value is only valid
4405 because signed overflow is undefined; otherwise, do not change
4406 *STRICT_OVERFLOW_P. */
4408 tree
4411 {
4419 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4420 and see if we can refine the range. Some of the cases below may not
4421 happen, but it doesn't seem worth worrying about this. We "continue"
4422 the outer loop when we've changed something; otherwise we "break"
4423 the switch, which will "break" the while. */
4429 {
4435 {
4443 }
4452 }
4454 /* If EXP is a constant, we can evaluate whether this is true or false. */
4456 {
4463 }
4467 }
4468 \f
4469 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4470 type, TYPE, return an expression to test if EXP is in (or out of, depending
4471 on IN_P) the range. Return 0 if the test couldn't be created. */
4473 tree
4476 {
4479 #ifdef HAVE_canonicalize_funcptr_for_compare
4480 /* Disable this optimization for function pointer expressions
4481 on targets that require function pointer canonicalization. */
4486 #endif
4489 {
4495 }
4513 {
4515 {
4519 }
4521 }
4523 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4525 {
4529 {
4531 {
4534 etype
4536 else
4539 }
4542 }
4543 }
4545 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4546 This requires wrap-around arithmetics for the type of the expression.
4547 First make sure that arithmetics in this type is valid, then make sure
4548 that it wraps around. */
4554 {
4557 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4558 for the type in question, as we rely on this here. */
4568 else
4570 }
4580 {
4582 {
4587 }
4589 }
4597 }
4598 \f
4599 /* Return the predecessor of VAL in its type, handling the infinite case. */
4601 static tree
4603 {
4609 else
4612 }
4614 /* Return the successor of VAL in its type, handling the infinite case. */
4616 static tree
4618 {
4624 else
4627 }
4629 /* Given two ranges, see if we can merge them into one. Return 1 if we
4630 can, 0 if we can't. Set the output range into the specified parameters. */
4632 bool
4635 {
4639 tree tem;
4649 /* Make range 0 be the range that starts first, or ends last if they
4650 start at the same value. Swap them if it isn't. */
4653 || (lowequal
4656 {
4660 }
4662 /* Now flag two cases, whether the ranges are disjoint or whether the
4663 second range is totally subsumed in the first. Note that the tests
4664 below are simplified by the ones above. */
4670 /* We now have four cases, depending on whether we are including or
4671 excluding the two ranges. */
4673 {
4674 /* If they don't overlap, the result is false. If the second range
4675 is a subset it is the result. Otherwise, the range is from the start
4676 of the second to the end of the first. */
4681 else
4683 }
4686 {
4687 /* If they don't overlap, the result is the first range. If they are
4688 equal, the result is false. If the second range is a subset of the
4689 first, and the ranges begin at the same place, we go from just after
4690 the end of the second range to the end of the first. If the second
4691 range is not a subset of the first, or if it is a subset and both
4692 ranges end at the same place, the range starts at the start of the
4693 first range and ends just before the second range.
4694 Otherwise, we can't describe this as a single range. */
4700 {
4705 {
4706 /* We are in the weird situation where high0 > high1 but
4707 high1 has no successor. Punt. */
4709 }
4710 }
4712 {
4717 {
4718 /* low0 < low1 but low1 has no predecessor. Punt. */
4720 }
4721 }
4722 else
4724 }
4727 {
4728 /* If they don't overlap, the result is the second range. If the second
4729 is a subset of the first, the result is false. Otherwise,
4730 the range starts just after the first range and ends at the
4731 end of the second. */
4736 else
4737 {
4742 {
4743 /* high1 > high0 but high0 has no successor. Punt. */
4745 }
4746 }
4747 }
4749 else
4750 {
4751 /* The case where we are excluding both ranges. Here the complex case
4752 is if they don't overlap. In that case, the only time we have a
4753 range is if they are adjacent. If the second is a subset of the
4754 first, the result is the first. Otherwise, the range to exclude
4755 starts at the beginning of the first range and ends at the end of the
4756 second. */
4758 {
4763 else
4764 {
4765 /* Canonicalize - [min, x] into - [-, x]. */
4768 {
4773 /* FALLTHROUGH */
4786 }
4788 /* Canonicalize - [x, max] into - [x, -]. */
4791 {
4796 /* FALLTHROUGH */
4812 }
4814 /* The ranges might be also adjacent between the maximum and
4815 minimum values of the given type. For
4816 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
4817 return + [x + 1, y - 1]. */
4819 {
4826 }
4827 else
4829 }
4830 }
4833 else
4835 }
4839 }
4840 \f
4842 /* Subroutine of fold, looking inside expressions of the form
4843 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
4844 of the COND_EXPR. This function is being used also to optimize
4845 A op B ? C : A, by reversing the comparison first.
4847 Return a folded expression whose code is not a COND_EXPR
4848 anymore, or NULL_TREE if no folding opportunity is found. */
4850 static tree
4853 {
4858 tree tem;
4863 /* If we have A op 0 ? A : -A, consider applying the following
4864 transformations:
4866 A == 0? A : -A same as -A
4867 A != 0? A : -A same as A
4868 A >= 0? A : -A same as abs (A)
4869 A > 0? A : -A same as abs (A)
4870 A <= 0? A : -A same as -abs (A)
4871 A < 0? A : -A same as -abs (A)
4873 None of these transformations work for modes with signed
4874 zeros. If A is +/-0, the first two transformations will
4875 change the sign of the result (from +0 to -0, or vice
4876 versa). The last four will fix the sign of the result,
4877 even though the original expressions could be positive or
4878 negative, depending on the sign of A.
4880 Note that all these transformations are correct if A is
4881 NaN, since the two alternatives (A and -A) are also NaNs. */
4888 /* In the case that A is of the form X-Y, '-A' (arg2) may
4889 have already been folded to Y-X, check for that. */
4897 {
4911 /* Fall through. */
4933 }
4935 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
4936 A == 0 ? A : 0 is always 0 unless A is -0. Note that
4937 both transformations are correct when A is NaN: A != 0
4938 is then true, and A == 0 is false. */
4942 {
4947 }
4949 /* Try some transformations of A op B ? A : B.
4951 A == B? A : B same as B
4952 A != B? A : B same as A
4953 A >= B? A : B same as max (A, B)
4954 A > B? A : B same as max (B, A)
4955 A <= B? A : B same as min (A, B)
4956 A < B? A : B same as min (B, A)
4958 As above, these transformations don't work in the presence
4959 of signed zeros. For example, if A and B are zeros of
4960 opposite sign, the first two transformations will change
4961 the sign of the result. In the last four, the original
4962 expressions give different results for (A=+0, B=-0) and
4963 (A=-0, B=+0), but the transformed expressions do not.
4965 The first two transformations are correct if either A or B
4966 is a NaN. In the first transformation, the condition will
4967 be false, and B will indeed be chosen. In the case of the
4968 second transformation, the condition A != B will be true,
4969 and A will be chosen.
4971 The conversions to max() and min() are not correct if B is
4972 a number and A is not. The conditions in the original
4973 expressions will be false, so all four give B. The min()
4974 and max() versions would give a NaN instead. */
4977 /* Avoid these transformations if the COND_EXPR may be used
4978 as an lvalue in the C++ front-end. PR c++/19199. */
4979 && (in_gimple_form
4985 {
4990 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
4992 {
4996 }
4999 {
5008 /* In C++ a ?: expression can be an lvalue, so put the
5009 operand which will be used if they are equal first
5010 so that we can convert this back to the
5011 corresponding COND_EXPR. */
5013 {
5022 }
5029 {
5038 }
5053 }
5054 }
5056 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
5057 we might still be able to simplify this. For example,
5058 if C1 is one less or one more than C2, this might have started
5059 out as a MIN or MAX and been transformed by this function.
5060 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
5066 {
5070 /* We can replace A with C1 in this case. */
5075 /* If C1 is C2 + 1, this is min(A, C2), but use ARG00's type for
5076 MIN_EXPR, to preserve the signedness of the comparison. */
5078 OEP_ONLY_CONST)
5082 OEP_ONLY_CONST))
5083 {
5086 arg2));
5089 }
5093 /* If C1 is C2 - 1, this is min(A, C2), with the same care
5094 as above. */
5096 OEP_ONLY_CONST)
5100 OEP_ONLY_CONST))
5101 {
5104 arg2));
5107 }
5111 /* If C1 is C2 - 1, this is max(A, C2), but use ARG00's type for
5112 MAX_EXPR, to preserve the signedness of the comparison. */
5114 OEP_ONLY_CONST)
5118 OEP_ONLY_CONST))
5119 {
5122 arg2));
5124 }
5128 /* If C1 is C2 + 1, this is max(A, C2), with the same care as above. */
5130 OEP_ONLY_CONST)
5134 OEP_ONLY_CONST))
5135 {
5138 arg2));
5140 }
5146 }
5149 }
5152 \f
5153 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5154 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5155 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5156 false) >= 2)
5157 #endif
5159 /* EXP is some logical combination of boolean tests. See if we can
5160 merge it into some range test. Return the new tree if so. */
5162 static tree
5165 {
5181 /* If this is an OR operation, invert both sides; we will invert
5182 again at the end. */
5186 /* If both expressions are the same, if we can merge the ranges, and we
5187 can build the range test, return it or it inverted. If one of the
5188 ranges is always true or always false, consider it to be the same
5189 expression as the other. */
5197 {
5201 }
5203 /* On machines where the branch cost is expensive, if this is a
5204 short-circuited branch and the underlying object on both sides
5205 is the same, make a non-short-circuit operation. */
5211 {
5212 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5213 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5214 which cases we can't do this. */
5222 {
5231 {
5234 WARN_STRICT_OVERFLOW_COMPARISON);
5238 }
5239 }
5240 }
5243 }
5244 \f
5245 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5246 bit value. Arrange things so the extra bits will be set to zero if and
5247 only if C is signed-extended to its full width. If MASK is nonzero,
5248 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5250 static tree
5252 {
5255 tree temp;
5260 /* We work by getting just the sign bit into the low-order bit, then
5261 into the high-order bit, then sign-extend. We then XOR that value
5262 with C. */
5265 /* We must use a signed type in order to get an arithmetic right shift.
5266 However, we must also avoid introducing accidental overflows, so that
5267 a subsequent call to integer_zerop will work. Hence we must
5268 do the type conversion here. At this point, the constant is either
5269 zero or one, and the conversion to a signed type can never overflow.
5270 We could get an overflow if this conversion is done anywhere else. */
5279 /* If necessary, convert the type back to match the type of C. */
5284 }
5285 \f
5286 /* For an expression that has the form
5287 (A && B) || ~B
5288 or
5289 (A || B) && ~B,
5290 we can drop one of the inner expressions and simplify to
5291 A || ~B
5292 or
5293 A && ~B
5294 LOC is the location of the resulting expression. OP is the inner
5295 logical operation; the left-hand side in the examples above, while CMPOP
5296 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5297 removing a condition that guards another, as in
5298 (A != NULL && A->...) || A == NULL
5299 which we must not transform. If RHS_ONLY is true, only eliminate the
5300 right-most operand of the inner logical operation. */
5302 static tree
5305 {
5323 {
5326 {
5329 }
5330 }
5332 {
5335 {
5338 }
5339 }
5354 }
5356 /* Find ways of folding logical expressions of LHS and RHS:
5357 Try to merge two comparisons to the same innermost item.
5358 Look for range tests like "ch >= '0' && ch <= '9'".
5359 Look for combinations of simple terms on machines with expensive branches
5360 and evaluate the RHS unconditionally.
5362 For example, if we have p->a == 2 && p->b == 4 and we can make an
5363 object large enough to span both A and B, we can do this with a comparison
5364 against the object ANDed with the a mask.
5366 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5367 operations to do this with one comparison.
5369 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5370 function and the one above.
5372 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5373 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5375 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5376 two operands.
5378 We return the simplified tree or 0 if no optimization is possible. */
5380 static tree
5383 {
5384 /* If this is the "or" of two comparisons, we can do something if
5385 the comparisons are NE_EXPR. If this is the "and", we can do something
5386 if the comparisons are EQ_EXPR. I.e.,
5387 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5389 WANTED_CODE is this operation code. For single bit fields, we can
5390 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5391 comparison for one-bit fields. */
5411 /* Start by getting the comparison codes. Fail if anything is volatile.
5412 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5413 it were surrounded with a NE_EXPR. */
5422 {
5426 }
5429 {
5433 }
5444 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5447 {
5450 {
5455 }
5458 {
5464 }
5465 }
5470 /* If the RHS can be evaluated unconditionally and its operands are
5471 simple, it wins to evaluate the RHS unconditionally on machines
5472 with expensive branches. In this case, this isn't a comparison
5473 that can be merged. */
5480 {
5481 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5492 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5502 }
5504 /* See if the comparisons can be merged. Then get all the parameters for
5505 each side. */
5529 /* It must be true that the inner operation on the lhs of each
5530 comparison must be the same if we are to be able to do anything.
5531 Then see if we have constants. If not, the same must be true for
5532 the rhs's. */
5543 else
5546 /* If either comparison code is not correct for our logical operation,
5547 fail. However, we can convert a one-bit comparison against zero into
5548 the opposite comparison against that bit being set in the field. */
5552 {
5554 {
5555 /* Make the left operand unsigned, since we are only interested
5556 in the value of one bit. Otherwise we are doing the wrong
5557 thing below. */
5560 }
5561 else
5563 }
5565 /* This is analogous to the code for l_const above. */
5567 {
5569 {
5572 }
5573 else
5575 }
5577 /* See if we can find a mode that contains both fields being compared on
5578 the left. If we can't, fail. Otherwise, update all constants and masks
5579 to be relative to a field of that size. */
5584 volatilep);
5594 {
5597 }
5605 {
5612 {
5616 }
5617 }
5619 {
5626 {
5630 }
5631 }
5633 /* If the right sides are not constant, do the same for it. Also,
5634 disallow this optimization if a size or signedness mismatch occurs
5635 between the left and right sides. */
5637 {
5640 /* Make sure the two fields on the right
5641 correspond to the left without being swapped. */
5649 volatilep);
5659 {
5662 }
5671 /* Make a mask that corresponds to both fields being compared.
5672 Do this for both items being compared. If the operands are the
5673 same size and the bits being compared are in the same position
5674 then we can do this by masking both and comparing the masked
5675 results. */
5679 {
5691 }
5693 /* There is still another way we can do something: If both pairs of
5694 fields being compared are adjacent, we may be able to make a wider
5695 field containing them both.
5697 Note that we still must mask the lhs/rhs expressions. Furthermore,
5698 the mask must be shifted to account for the shift done by
5699 make_bit_field_ref. */
5704 {
5705 tree type;
5719 /* Convert to the smaller type before masking out unwanted bits. */
5722 {
5724 {
5728 }
5730 {
5734 }
5735 }
5744 }
5747 }
5749 /* Handle the case of comparisons with constants. If there is something in
5750 common between the masks, those bits of the constants must be the same.
5751 If not, the condition is always false. Test for this to avoid generating
5752 incorrect code below. */
5757 {
5759 {
5762 }
5763 else
5764 {
5767 }
5768 }
5770 /* Construct the expression we will return. First get the component
5771 reference we will make. Unless the mask is all ones the width of
5772 that field, perform the mask operation. Then compare with the
5773 merged constant. */
5783 }
5784 \f
5785 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
5786 constant. */
5788 static tree
5791 {
5794 tree comp_const;
5795 tree minmax_const;
5797 tree inner;
5808 /* If something does not permit us to optimize, return the original tree. */
5816 /* Now handle all the various comparison codes. We only handle EQ_EXPR
5817 and GT_EXPR, doing the rest with recursive calls using logical
5818 simplifications. */
5820 {
5822 {
5823 tree tem
5830 }
5833 return
5835 optimize_minmax_comparison
5837 optimize_minmax_comparison
5842 /* MAX (X, 0) == 0 -> X <= 0 */
5846 /* MAX (X, 0) == 5 -> X == 5 */
5850 /* MAX (X, 0) == -1 -> false */
5854 /* MIN (X, 0) == 0 -> X >= 0 */
5858 /* MIN (X, 0) == 5 -> false */
5861 else
5862 /* MIN (X, 0) == -1 -> X == -1 */
5867 /* MAX (X, 0) > 0 -> X > 0
5868 MAX (X, 0) > 5 -> X > 5 */
5872 /* MAX (X, 0) > -1 -> true */
5876 /* MIN (X, 0) > 0 -> false
5877 MIN (X, 0) > 5 -> false */
5880 else
5881 /* MIN (X, 0) > -1 -> X > -1 */
5886 }
5887 }
5888 \f
5889 /* T is an integer expression that is being multiplied, divided, or taken a
5890 modulus (CODE says which and what kind of divide or modulus) by a
5891 constant C. See if we can eliminate that operation by folding it with
5892 other operations already in T. WIDE_TYPE, if non-null, is a type that
5893 should be used for the computation if wider than our type.
5895 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
5896 (X * 2) + (Y * 4). We must, however, be assured that either the original
5897 expression would not overflow or that overflow is undefined for the type
5898 in the language in question.
5900 If we return a non-null expression, it is an equivalent form of the
5901 original computation, but need not be in the original type.
5903 We set *STRICT_OVERFLOW_P to true if the return values depends on
5904 signed overflow being undefined. Otherwise we do not change
5905 *STRICT_OVERFLOW_P. */
5907 static tree
5910 {
5911 /* To avoid exponential search depth, refuse to allow recursion past
5912 three levels. Beyond that (1) it's highly unlikely that we'll find
5913 something interesting and (2) we've probably processed it before
5914 when we built the inner expression. */
5917 tree ret;
5922 depth++;
5924 depth--;
5927 }
5929 static tree
5932 {
5943 /* Don't deal with constants of zero here; they confuse the code below. */
5953 /* Note that we need not handle conditional operations here since fold
5954 already handles those cases. So just do arithmetic here. */
5956 {
5958 /* For a constant, we can always simplify if we are a multiply
5959 or (for divide and modulus) if it is a multiple of our constant. */
5967 /* If op0 is an expression ... */
5973 /* ... and has wrapping overflow, and its type is smaller
5974 than ctype, then we cannot pass through as widening. */
5979 /* ... or this is a truncation (t is narrower than op0),
5980 then we cannot pass through this narrowing. */
5983 /* ... or signedness changes for division or modulus,
5984 then we cannot pass through this conversion. */
5988 /* ... or has undefined overflow while the converted to
5989 type has not, we cannot do the operation in the inner type
5990 as that would introduce undefined overflow. */
5996 /* Pass the constant down and see if we can make a simplification. If
5997 we can, replace this expression with the inner simplification for
5998 possible later conversion to our or some other type. */
6003 code == MULT_EXPR
6005 strict_overflow_p))))
6010 /* If widening the type changes it from signed to unsigned, then we
6011 must avoid building ABS_EXPR itself as unsigned. */
6013 {
6017 {
6020 }
6022 }
6023 /* If the constant is negative, we cannot simplify this. */
6026 /* FALLTHROUGH */
6028 /* For division and modulus, type can't be unsigned, as e.g.
6029 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6030 For signed types, even with wrapping overflow, this is fine. */
6039 /* If widening the type changes the signedness, then we can't perform
6040 this optimization as that changes the result. */
6044 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6050 {
6057 }
6061 /* If the second operand is constant, this is a multiplication
6062 or floor division, by a power of two, so we can treat it that
6063 way unless the multiplier or divisor overflows. Signed
6064 left-shift overflow is implementation-defined rather than
6065 undefined in C90, so do not convert signed left shift into
6066 multiplication. */
6069 /* const_binop may not detect overflow correctly,
6070 so check for it explicitly here. */
6074 size_one_node,
6075 op1)))
6079 ctype,
6081 t1),
6086 /* See if we can eliminate the operation on both sides. If we can, we
6087 can return a new PLUS or MINUS. If we can't, the only remaining
6088 cases where we can do anything are if the second operand is a
6089 constant. */
6095 /* If not multiplication, we can only do this if both operands
6096 are divisible by c. */
6099 {
6104 }
6106 /* If this was a subtraction, negate OP1 and set it to be an addition.
6107 This simplifies the logic below. */
6109 {
6111 /* If OP1 was not easily negatable, the constant may be OP0. */
6113 {
6120 }
6121 }
6126 /* If either OP1 or C are negative, this optimization is not safe for
6127 some of the division and remainder types while for others we need
6128 to change the code. */
6130 {
6138 }
6140 /* If it's a multiply or a division/modulus operation of a multiple
6141 of our constant, do the operation and verify it doesn't overflow. */
6144 {
6147 /* We allow the constant to overflow with wrapping semantics. */
6151 }
6152 else
6155 /* If we have an unsigned type, we cannot widen the operation since it
6156 will change the result if the original computation overflowed. */
6160 /* If we were able to eliminate our operation from the first side,
6161 apply our operation to the second side and reform the PLUS. */
6165 /* The last case is if we are a multiply. In that case, we can
6166 apply the distributive law to commute the multiply and addition
6167 if the multiplication of the constants doesn't overflow
6168 and overflow is defined. With undefined overflow
6169 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6175 op1);
6180 /* We have a special case here if we are doing something like
6181 (C * 8) % 4 since we know that's zero. */
6184 /* If the multiplication can overflow we cannot optimize this. */
6188 {
6191 }
6193 /* ... fall through ... */
6197 /* If we can extract our operation from the LHS, do so and return a
6198 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6199 do something only if the second operand is a constant. */
6213 /* If these are the same operation types, we can associate them
6214 assuming no overflow. */
6216 {
6228 }
6230 /* If these operations "cancel" each other, we have the main
6231 optimizations of this pass, which occur when either constant is a
6232 multiple of the other, in which case we replace this with either an
6233 operation or CODE or TCODE.
6235 If we have an unsigned type, we cannot do this since it will change
6236 the result if the original computation overflowed. */
6243 {
6245 {
6252 }
6254 {
6261 }
6262 }
6267 }
6270 }
6271 \f
6272 /* Return a node which has the indicated constant VALUE (either 0 or
6273 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6274 and is of the indicated TYPE. */
6276 tree
6278 {
6287 else
6289 }
6292 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6293 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6294 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6295 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6296 COND is the first argument to CODE; otherwise (as in the example
6297 given here), it is the second argument. TYPE is the type of the
6298 original expression. Return NULL_TREE if no simplification is
6299 possible. */
6301 static tree
6306 {
6316 {
6320 /* If this operand throws an expression, then it does not make
6321 sense to try to perform a logical or arithmetic operation
6322 involving it. */
6327 }
6328 else
6329 {
6334 }
6339 /* This transformation is only worthwhile if we don't have to wrap ARG
6340 in a SAVE_EXPR and the operation can be simplified without recursing
6341 on at least one of the branches once its pushed inside the COND_EXPR. */
6350 {
6354 else
6356 }
6358 {
6362 else
6364 }
6366 /* Check that we have simplified at least one of the branches. */
6371 }
6373 \f
6374 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6376 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6377 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6378 ADDEND is the same as X.
6380 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6381 and finite. The problematic cases are when X is zero, and its mode
6382 has signed zeros. In the case of rounding towards -infinity,
6383 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6384 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6386 bool
6388 {
6392 /* Don't allow the fold with -fsignaling-nans. */
6396 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6400 /* In a vector or complex, we would need to check the sign of all zeros. */
6404 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6408 /* The mode has signed zeros, and we have to honor their sign.
6409 In this situation, there is only one case we can return true for.
6410 X - 0 is the same as X unless rounding towards -infinity is
6411 supported. */
6413 }
6415 /* Subroutine of fold() that checks comparisons of built-in math
6416 functions against real constants.
6418 FCODE is the DECL_FUNCTION_CODE of the built-in, CODE is the comparison
6419 operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR, GE_EXPR or LE_EXPR. TYPE
6420 is the type of the result and ARG0 and ARG1 are the operands of the
6421 comparison. ARG1 must be a TREE_REAL_CST.
6423 The function returns the constant folded tree if a simplification
6424 can be made, and NULL_TREE otherwise. */
6426 static tree
6430 {
6431 REAL_VALUE_TYPE c;
6434 {
6440 {
6441 /* sqrt(x) < y is always false, if y is negative. */
6445 /* sqrt(x) > y is always true, if y is negative and we
6446 don't care about NaNs, i.e. negative values of x. */
6450 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
6453 }
6455 {
6456 REAL_VALUE_TYPE c2;
6462 {
6463 /* sqrt(x) > y is x == +Inf, when y is very large. */
6468 /* sqrt(x) > y is always false, when y is very large
6469 and we don't care about infinities. */
6471 }
6473 /* sqrt(x) > c is the same as x > c*c. */
6476 }
6478 {
6479 REAL_VALUE_TYPE c2;
6485 {
6486 /* sqrt(x) < y is always true, when y is a very large
6487 value and we don't care about NaNs or Infinities. */
6491 /* sqrt(x) < y is x != +Inf when y is very large and we
6492 don't care about NaNs. */
6497 /* sqrt(x) < y is x >= 0 when y is very large and we
6498 don't care about Infinities. */
6503 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
6508 dconst0)),
6511 c2)));
6512 }
6514 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
6519 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
6524 dconst0)),
6527 c2)));
6528 }
6529 }
6532 }
6534 /* Subroutine of fold() that optimizes comparisons against Infinities,
6535 either +Inf or -Inf.
6537 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6538 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6539 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6541 The function returns the constant folded tree if a simplification
6542 can be made, and NULL_TREE otherwise. */
6544 static tree
6547 {
6548 machine_mode mode;
6549 REAL_VALUE_TYPE max;
6550 tree temp;
6555 /* For negative infinity swap the sense of the comparison. */
6561 {
6563 /* x > +Inf is always false, if with ignore sNANs. */
6569 /* x <= +Inf is always true, if we don't case about NaNs. */
6573 /* x <= +Inf is the same as x == x, i.e. isfinite(x). */
6579 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */
6585 /* x < +Inf is always equal to x <= DBL_MAX. */
6591 /* x != +Inf is always equal to !(x > DBL_MAX). */
6603 }
6606 }
6608 /* Subroutine of fold() that optimizes comparisons of a division by
6609 a nonzero integer constant against an integer constant, i.e.
6610 X/C1 op C2.
6612 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6613 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
6614 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
6616 The function returns the constant folded tree if a simplification
6617 can be made, and NULL_TREE otherwise. */
6619 static tree
6622 {
6630 /* We have to do this the hard way to detect unsigned overflow.
6631 prod = int_const_binop (MULT_EXPR, arg01, arg1); */
6637 {
6642 /* Likewise hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6646 }
6648 {
6652 {
6671 }
6672 }
6673 else
6674 {
6675 /* A negative divisor reverses the relational operators. */
6681 {
6700 }
6701 }
6704 {
6725 {
6728 }
6733 {
6736 }
6741 {
6744 }
6749 {
6752 }
6757 }
6760 }
6763 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6764 equality/inequality test, then return a simplified form of the test
6765 using a sign testing. Otherwise return NULL. TYPE is the desired
6766 result type. */
6768 static tree
6771 tree result_type)
6772 {
6773 /* If this is testing a single bit, we can optimize the test. */
6777 {
6778 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6779 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6783 /* This is only a win if casting to a signed type is cheap,
6784 i.e. when arg00's type is not a partial mode. */
6787 {
6790 result_type,
6793 }
6794 }
6797 }
6799 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6800 equality/inequality test, then return a simplified form of
6801 the test using shifts and logical operations. Otherwise return
6802 NULL. TYPE is the desired result type. */
6804 tree
6807 {
6808 /* If this is testing a single bit, we can optimize the test. */
6812 {
6821 /* First, see if we can fold the single bit test into a sign-bit
6822 test. */
6824 result_type);
6828 /* Otherwise we have (A & C) != 0 where C is a single bit,
6829 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6830 Similarly for (A & C) == 0. */
6832 /* If INNER is a right shift of a constant and it plus BITNUM does
6833 not overflow, adjust BITNUM and INNER. */
6839 {
6842 }
6844 /* If we are going to be able to omit the AND below, we must do our
6845 operations as unsigned. If we must use the AND, we have a choice.
6846 Normally unsigned is faster, but for some machines signed is. */
6847 #ifdef LOAD_EXTEND_OP
6850 #else
6852 #endif
6868 /* Put the AND last so it can combine with more things. */
6871 /* Make sure to return the proper type. */
6875 }
6877 }
6879 /* Check whether we are allowed to reorder operands arg0 and arg1,
6880 such that the evaluation of arg1 occurs before arg0. */
6882 static bool
6884 {
6891 }
6893 /* Test whether it is preferable two swap two operands, ARG0 and
6894 ARG1, for example because ARG0 is an integer constant and ARG1
6895 isn't. If REORDER is true, only recommend swapping if we can
6896 evaluate the operands in reverse order. */
6898 bool
6900 {
6918 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6919 for commutative and comparison operators. Ensuring a canonical
6920 form allows the optimizers to find additional redundancies without
6921 having to explicitly check for both orderings. */
6927 /* Put SSA_NAMEs last. */
6933 /* Put variables last. */
6940 }
6942 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where
6943 ARG0 is extended to a wider type. */
6945 static tree
6948 {
6950 tree arg1_unw;
6959 #ifdef HAVE_canonicalize_funcptr_for_compare
6960 /* Disable this optimization if we're casting a function pointer
6961 type on targets that require function pointer canonicalization. */
6966 #endif
6973 /* If possible, express the comparison in the shorter mode. */
6993 /* If we are comparing with the integer that does not fit into the range
6994 of the shorter type, the result is known. */
7005 {
7032 }
7035 }
7037 /* Fold comparison ARG0 CODE ARG1 (with result in TYPE), where for
7038 ARG0 just the signedness is changed. */
7040 static tree
7043 {
7044 tree arg0_inner;
7054 #ifdef HAVE_canonicalize_funcptr_for_compare
7055 /* Disable this optimization if we're casting a function pointer
7056 type on targets that require function pointer canonicalization. */
7061 #endif
7082 else
7086 }
7089 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
7090 means A >= Y && A != MAX, but in this case we know that
7091 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
7093 static tree
7095 {
7102 else
7111 {
7114 }
7116 {
7119 }
7120 else
7127 {
7128 /* Convert the pointer types into integer before taking the difference. */
7132 }
7133 else
7140 }
7142 /* Fold a sum or difference of at least one multiplication.
7143 Returns the folded tree or NULL if no simplification could be made. */
7145 static tree
7148 {
7152 /* (A * C) +- (B * C) -> (A+-B) * C.
7153 (A * C) +- A -> A * (C+-1).
7154 We are most concerned about the case where C is a constant,
7155 but other combinations show up during loop reduction. Since
7156 it is not difficult, try all four possibilities. */
7159 {
7162 }
7164 {
7167 }
7168 else
7169 {
7170 /* We cannot generate constant 1 for fract. */
7175 }
7177 {
7180 }
7182 {
7184 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7185 the purpose of this canonicalization. */
7189 {
7192 }
7193 else
7195 }
7196 else
7197 {
7198 /* We cannot generate constant 1 for fract. */
7203 }
7215 /* No identical multiplicands; see if we can find a common
7216 power-of-two factor in non-power-of-two multiplies. This
7217 can help in multi-dimensional array access. */
7220 {
7223 tree maybe_same;
7227 /* Move min of absolute values to int11. */
7229 {
7234 }
7235 else
7239 /* The remainder should not be a constant, otherwise we
7240 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7241 increased the number of multiplications necessary. */
7243 {
7251 }
7252 }
7262 }
7264 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7265 specified by EXPR into the buffer PTR of length LEN bytes.
7266 Return the number of bytes placed in the buffer, or zero
7267 upon failure. */
7269 static int
7271 {
7285 {
7287 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7288 number of bytes. */
7292 {
7299 else
7301 }
7302 else
7307 }
7309 }
7312 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7313 specified by EXPR into the buffer PTR of length LEN bytes.
7314 Return the number of bytes placed in the buffer, or zero
7315 upon failure. */
7317 static int
7319 {
7323 FIXED_VALUE_TYPE value;
7339 }
7342 /* Subroutine of native_encode_expr. Encode the REAL_CST
7343 specified by EXPR into the buffer PTR of length LEN bytes.
7344 Return the number of bytes placed in the buffer, or zero
7345 upon failure. */
7347 static int
7349 {
7355 /* There are always 32 bits in each long, no matter the size of
7356 the hosts long. We handle floating point representations with
7357 up to 192 bits. */
7371 {
7376 {
7383 else
7385 }
7386 else
7392 }
7394 }
7396 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7397 specified by EXPR into the buffer PTR of length LEN bytes.
7398 Return the number of bytes placed in the buffer, or zero
7399 upon failure. */
7401 static int
7403 {
7405 tree part;
7420 }
7423 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7424 specified by EXPR into the buffer PTR of length LEN bytes.
7425 Return the number of bytes placed in the buffer, or zero
7426 upon failure. */
7428 static int
7430 {
7440 {
7442 {
7445 }
7456 }
7458 }
7461 /* Subroutine of native_encode_expr. Encode the STRING_CST
7462 specified by EXPR into the buffer PTR of length LEN bytes.
7463 Return the number of bytes placed in the buffer, or zero
7464 upon failure. */
7466 static int
7468 {
7470 HOST_WIDE_INT total_bytes;
7484 {
7487 {
7490 }
7493 }
7494 else
7497 }
7500 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7501 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7502 buffer PTR of length LEN bytes. If OFF is not -1 then start
7503 the encoding at byte offset OFF and encode at most LEN bytes.
7504 Return the number of bytes placed in the buffer, or zero upon failure. */
7506 int
7508 {
7510 {
7531 }
7532 }
7535 /* Subroutine of native_interpret_expr. Interpret the contents of
7536 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7537 If the buffer cannot be interpreted, return NULL_TREE. */
7539 static tree
7541 {
7551 }
7554 /* Subroutine of native_interpret_expr. Interpret the contents of
7555 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7556 If the buffer cannot be interpreted, return NULL_TREE. */
7558 static tree
7560 {
7562 double_int result;
7563 FIXED_VALUE_TYPE fixed_value;
7573 }
7576 /* Subroutine of native_interpret_expr. Interpret the contents of
7577 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7578 If the buffer cannot be interpreted, return NULL_TREE. */
7580 static tree
7582 {
7587 /* There are always 32 bits in each long, no matter the size of
7588 the hosts long. We handle floating point representations with
7589 up to 192 bits. */
7590 REAL_VALUE_TYPE r;
7601 {
7604 {
7611 else
7613 }
7614 else
7619 }
7623 }
7626 /* Subroutine of native_interpret_expr. Interpret the contents of
7627 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7628 If the buffer cannot be interpreted, return NULL_TREE. */
7630 static tree
7632 {
7647 }
7650 /* Subroutine of native_interpret_expr. Interpret the contents of
7651 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7652 If the buffer cannot be interpreted, return NULL_TREE. */
7654 static tree
7656 {
7669 {
7674 }
7676 }
7679 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7680 the buffer PTR of length LEN as a constant of type TYPE. For
7681 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7682 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7683 return NULL_TREE. */
7685 tree
7687 {
7689 {
7711 }
7712 }
7714 /* Returns true if we can interpret the contents of a native encoding
7715 as TYPE. */
7717 static bool
7719 {
7721 {
7734 }
7735 }
7737 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7738 TYPE at compile-time. If we're unable to perform the conversion
7739 return NULL_TREE. */
7741 static tree
7743 {
7744 /* We support up to 512-bit values (for V8DFmode). */
7748 /* Check that the host and target are sane. */
7757 }
7759 /* Build an expression for the address of T. Folds away INDIRECT_REF
7760 to avoid confusing the gimplify process. */
7762 tree
7764 {
7765 /* The size of the object is not relevant when talking about its address. */
7770 {
7775 }
7785 {
7790 }
7791 else
7795 }
7797 /* Build an expression for the address of T. */
7799 tree
7801 {
7805 }
7807 /* Fold a unary expression of code CODE and type TYPE with operand
7808 OP0. Return the folded expression if folding is successful.
7809 Otherwise, return NULL_TREE. */
7811 tree
7813 {
7814 tree tem;
7815 tree arg0;
7823 {
7826 {
7827 /* Don't use STRIP_NOPS, because signedness of argument type
7828 matters. */
7830 }
7831 else
7832 {
7833 /* Strip any conversions that don't change the mode. This
7834 is safe for every expression, except for a comparison
7835 expression because its signedness is derived from its
7836 operands.
7838 Note that this is done as an internal manipulation within
7839 the constant folder, in order to find the simplest
7840 representation of the arguments so that their form can be
7841 studied. In any cases, the appropriate type conversions
7842 should be put back in the tree that will get out of the
7843 constant folder. */
7845 }
7848 {
7851 {
7855 }
7856 }
7857 }
7864 {
7871 {
7885 /* If this was a conversion, and all we did was to move into
7886 inside the COND_EXPR, bring it back out. But leave it if
7887 it is a conversion from integer to integer and the
7888 result precision is no wider than a word since such a
7889 conversion is cheap and may be optimized away by combine,
7890 while it couldn't if it were outside the COND_EXPR. Then return
7891 so we don't get into an infinite recursion loop taking the
7892 conversion out and then back in. */
7904 && (INTEGRAL_TYPE_P
7917 }
7918 }
7921 {
7927 CASE_CONVERT:
7931 {
7932 /* If we have (type) (a CMP b) and type is an integral type, return
7933 new expression involving the new type. Canonicalize
7934 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7935 non-integral type.
7936 Do not fold the result as that would not simplify further, also
7937 folding again results in recursions. */
7947 }
7949 /* Handle (T *)&A.B.C for A being of type T and B and C
7950 living at offset zero. This occurs frequently in
7951 C++ upcasting and then accessing the base. */
7955 {
7957 tree offset;
7958 machine_mode mode;
7963 /* If the reference was to a (constant) zero offset, we can use
7964 the address of the base if it has the same base type
7965 as the result type and the pointer type is unqualified. */
7972 }
7976 /* Detect assigning a bitfield. */
7978 && DECL_BIT_FIELD
7980 {
7981 /* Don't leave an assignment inside a conversion
7982 unless assigning a bitfield. */
7984 /* First do the assignment, then return converted constant. */
7989 }
7991 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7992 constants (if x has signed type, the sign bit cannot be set
7993 in c). This folds extension into the BIT_AND_EXPR.
7994 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7995 very likely don't have maximal range for their precision and this
7996 transformation effectively doesn't preserve non-maximal ranges. */
8000 {
8011 <= HOST_BITS_PER_WIDE_INT
8013 {
8017 cst &= HOST_WIDE_INT_M1U
8020 #ifdef LOAD_EXTEND_OP
8022 && !flag_syntax_only
8025 {
8029 }
8030 #endif
8031 }
8033 {
8038 }
8039 }
8041 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type,
8042 when one of the new casts will fold away. Conservatively we assume
8043 that this happens when X or Y is NOP_EXPR or Y is INTEGER_CST. */
8053 {
8057 return fold_build_pointer_plus_loc
8059 }
8061 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
8062 of the same precision, and X is an integer type not narrower than
8063 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
8069 {
8075 }
8077 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
8078 type of X and Y (integer types only). */
8083 {
8084 /* Be careful not to introduce new overflows. */
8085 tree mult_type;
8088 else
8092 {
8099 }
8100 }
8118 /* Convert fabs((double)float) into (double)fabsf(float). */
8121 {
8127 targ0));
8128 }
8129 /* ABS_EXPR<ABS_EXPR<x>> = ABS_EXPR<x> even if flag_wrapv is on. */
8133 /* Strip sign ops from argument. */
8135 {
8140 }
8147 {
8153 }
8159 /* Convert ~ (-A) to A - 1. */
8164 /* Convert ~ (A - 1) or ~ (A + -1) to -A. */
8170 {
8171 /* Perform the negation in ARG0's type and only then convert
8172 to TYPE as to avoid introducing undefined behavior. */
8177 }
8178 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8197 /* Note that the operand of this must be an int
8198 and its values must be 0 or 1.
8199 ("true" is a fixed value perhaps depending on the language,
8200 but we don't handle values other than 1 correctly yet.) */
8210 {
8218 }
8220 {
8225 }
8227 {
8231 {
8240 }
8241 }
8248 {
8256 }
8258 {
8262 }
8264 {
8268 {
8277 }
8278 }
8282 /* Fold *&X to X if X is an lvalue. */
8284 {
8291 }
8297 }
8300 /* If the operation was a conversion do _not_ mark a resulting constant
8301 with TREE_OVERFLOW if the original constant was not. These conversions
8302 have implementation defined behavior and retaining the TREE_OVERFLOW
8303 flag here would confuse later passes such as VRP. */
8304 tree
8307 {
8316 }
8318 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8319 operands OP0 and OP1. LOC is the location of the resulting expression.
8320 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8321 Return the folded expression if folding is successful. Otherwise,
8322 return NULL_TREE. */
8323 static tree
8326 {
8327 tree tem;
8329 /* We only do these simplifications if we are optimizing. */
8333 /* Check for things like (A || B) && (A || C). We can convert this
8334 to A || (B && C). Note that either operator can be any of the four
8335 truth and/or operations and the transformation will still be
8336 valid. Also note that we only care about order for the
8337 ANDIF and ORIF operators. If B contains side effects, this
8338 might change the truth-value of A. */
8345 {
8365 /* This case if tricky because we must either have commutative
8366 operators or else A10 must not have side-effects. */
8372 a01);
8373 }
8375 /* See if we can build a range comparison. */
8381 {
8385 }
8389 {
8393 }
8395 /* Check for the possibility of merging component references. If our
8396 lhs is another similar operation, try to merge its rhs with our
8397 rhs. Then try to merge our lhs and rhs. */
8411 {
8418 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8419 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8420 We don't want to pack more than two leafs to a non-IF AND/OR
8421 expression.
8422 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8423 equal to IF-CODE, then we don't want to add right-hand operand.
8424 If the inner right-hand side of left-hand operand has
8425 side-effects, or isn't simple, then we can't add to it,
8426 as otherwise we might destroy if-sequence. */
8429 /* Needed for sequence points to handle trappings, and
8430 side-effects. */
8432 {
8434 arg1);
8436 tem);
8437 }
8438 /* Same as abouve but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8439 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8442 /* Needed for sequence points to handle trappings, and
8443 side-effects. */
8445 {
8450 }
8451 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8452 into (A OR B).
8453 For sequence point consistancy, we need to check for trapping,
8454 and side-effects. */
8458 }
8461 }
8463 /* Fold a binary expression of code CODE and type TYPE with operands
8464 OP0 and OP1, containing either a MIN-MAX or a MAX-MIN combination.
8465 Return the folded expression if folding is successful. Otherwise,
8466 return NULL_TREE. */
8468 static tree
8470 {
8477 else
8480 /* MIN (MAX (a, b), b) == b. */
8485 /* MIN (MAX (b, a), b) == b. */
8491 /* MIN (a, MAX (a, b)) == a. */
8497 /* MIN (a, MAX (b, a)) == a. */
8504 }
8506 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8507 by changing CODE to reduce the magnitude of constants involved in
8508 ARG0 of the comparison.
8509 Returns a canonicalized comparison tree if a simplification was
8510 possible, otherwise returns NULL_TREE.
8511 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8512 valid if signed overflow is undefined. */
8514 static tree
8518 {
8524 /* Match A +- CST code arg1 and CST code arg1. We can change the
8525 first form only if overflow is undefined. */
8528 /* In principle pointers also have undefined overflow behavior,
8529 but that causes problems elsewhere. */
8537 /* Identify the constant in arg0 and its sign. */
8540 else
8544 /* Overflowed constants and zero will cause problems. */
8549 /* See if we can reduce the magnitude of the constant in
8550 arg0 by changing the comparison code. */
8552 {
8553 /* CST <= arg1 -> CST-1 < arg1. */
8556 /* -CST < arg1 -> -CST-1 <= arg1. */
8559 /* CST > arg1 -> CST-1 >= arg1. */
8562 /* -CST >= arg1 -> -CST-1 > arg1. */
8565 else
8567 /* arg1 code' CST' might be more canonical. */
8569 }
8570 else
8571 {
8572 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8576 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8580 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8584 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8588 else
8591 }
8593 /* Now build the constant reduced in magnitude. But not if that
8594 would produce one outside of its types range. */
8602 /* We cannot swap the comparison here as that would cause us to
8603 endlessly recurse. */
8612 /* If swapping might yield to a more canonical form, do so. */
8615 else
8617 }
8619 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8620 overflow further. Try to decrease the magnitude of constants involved
8621 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8622 and put sole constants at the second argument position.
8623 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8625 static tree
8628 {
8629 tree t;
8634 /* Try canonicalization by simplifying arg0. */
8639 {
8643 }
8645 /* Try canonicalization by simplifying arg1 using the swapped
8646 comparison. */
8654 }
8656 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8657 space. This is used to avoid issuing overflow warnings for
8658 expressions like &p->x which can not wrap. */
8660 static bool
8662 {
8669 wide_int wi_offset;
8675 else
8691 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8692 array. */
8694 {
8695 HOST_WIDE_INT base_size;
8700 }
8703 }
8705 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
8706 kind INTEGER_CST. This makes sure to properly sign-extend the
8707 constant. */
8709 static HOST_WIDE_INT
8711 {
8717 }
8719 /* Subroutine of fold_binary. This routine performs all of the
8720 transformations that are common to the equality/inequality
8721 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8722 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8723 fold_binary should call fold_binary. Fold a comparison with
8724 tree code CODE and type TYPE with operands OP0 and OP1. Return
8725 the folded comparison or NULL_TREE. */
8727 static tree
8730 {
8740 /* Transform comparisons of the form X +- C1 CMP C2 to X CMP C2 -+ C1. */
8742 && (equality_code
8749 {
8750 const enum tree_code
8757 /* If the constant operation overflowed this can be
8758 simplified as a comparison against INT_MAX/INT_MIN. */
8761 {
8765 /* Get the sign of the constant on the lhs if the
8766 operation were VARIABLE + CONST1. */
8770 /* The sign of the constant determines if we overflowed
8771 INT_MAX (const1_sgn == -1) or INT_MIN (const1_sgn == 1).
8772 Canonicalize to the INT_MIN overflow by swapping the comparison
8773 if necessary. */
8777 /* We now can look at the canonicalized case
8778 VARIABLE + 1 CODE2 INT_MIN
8779 and decide on the result. */
8781 {
8785 return
8791 return
8796 }
8797 }
8798 else
8799 {
8802 "when changing X +- C1 cmp C2 to "
8804 WARN_STRICT_OVERFLOW_COMPARISON);
8806 }
8807 }
8809 /* Transform comparisons of the form X - Y CMP 0 to X CMP Y. */
8811 && equality_code
8813 {
8814 /* ??? The transformation is valid for the other operators if overflow
8815 is undefined for the type, but performing it here badly interacts
8816 with the transformation in fold_cond_expr_with_comparison which
8817 attempts to synthetize ABS_EXPR. */
8821 WARN_STRICT_OVERFLOW_COMPARISON);
8824 }
8826 /* For comparisons of pointers we can decompose it to a compile time
8827 comparison of the base objects and the offsets into the object.
8828 This requires at least one operand being an ADDR_EXPR or a
8829 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8835 {
8838 machine_mode mode;
8842 /* Get base and offset for the access. Strip ADDR_EXPR for
8843 get_inner_reference, but put it back by stripping INDIRECT_REF
8844 off the base object if possible. indirect_baseN will be true
8845 if baseN is not an address but refers to the object itself. */
8848 {
8854 else
8856 }
8858 {
8862 {
8865 }
8868 {
8873 {
8876 }
8877 }
8878 }
8882 {
8888 else
8890 }
8892 {
8896 {
8899 }
8902 {
8907 {
8910 }
8911 }
8912 }
8914 /* A local variable can never be pointed to by
8915 the default SSA name of an incoming parameter. */
8917 && indirect_base0
8920 && !indirect_base1
8925 && indirect_base1
8928 && !indirect_base0
8932 {
8937 }
8938 /* If we have equivalent bases we might be able to simplify. */
8941 {
8942 /* We can fold this expression to a constant if the non-constant
8943 offset parts are equal. */
8952 {
8958 "occur when comparing P +- C1 with "
8960 WARN_STRICT_OVERFLOW_CONDITIONAL);
8963 {
8977 }
8978 }
8979 /* We can simplify the comparison to a comparison of the variable
8980 offset parts if the constant offset parts are equal.
8981 Be careful to use signed sizetype here because otherwise we
8982 mess with array offsets in the wrong way. This is possible
8983 because pointer arithmetic is restricted to retain within an
8984 object and overflow on pointer differences is undefined as of
8985 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8987 && (equality_code
8990 {
8991 /* By converting to signed sizetype we cover middle-end pointer
8992 arithmetic which operates on unsigned pointer types of size
8993 type size and ARRAY_REF offsets which are properly sign or
8994 zero extended from their type in case it is narrower than
8995 sizetype. */
8998 else
9002 else
9009 "occur when comparing P +- C1 with "
9011 WARN_STRICT_OVERFLOW_COMPARISON);
9014 }
9015 }
9016 /* For non-equal bases we can simplify if they are addresses
9017 declarations with different addresses. */
9019 /* We know that !operand_equal_p (base0, base1, 0)
9020 because the if condition was false. But make
9021 sure two decls are not the same. */
9027 /* Watch for aliases. */
9032 {
9039 }
9040 /* For equal offsets we can simplify to a comparison of the
9041 base addresses. */
9043 && (indirect_base0
9045 && (indirect_base1
9050 {
9056 }
9057 }
9059 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
9060 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
9061 the resulting offset is smaller in absolute value than the
9062 original one and has the same sign. */
9071 {
9076 tree cst;
9078 "occur when combining constants around "
9081 /* Put the constant on the side where it doesn't overflow and is
9082 of lower absolute value and of same sign than before. */
9089 {
9092 variable1,
9096 }
9104 {
9110 variable2);
9111 }
9112 }
9114 /* Transform comparisons of the form X * C1 CMP 0 to X CMP 0 in the
9115 signed arithmetic case. That form is created by the compiler
9116 often enough for folding it to be of value. One example is in
9117 computing loop trip counts after Operator Strength Reduction. */
9124 {
9130 /* Handle unfolded multiplication by zero. */
9135 "eliminating multiplication in comparison "
9137 WARN_STRICT_OVERFLOW_COMPARISON);
9139 /* If const1 is negative we swap the sense of the comparison. */
9144 }
9151 {
9159 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
9165 /* (-a) CMP (-b) -> b CMP a */
9172 {
9173 REAL_VALUE_TYPE cst;
9176 /* (-a) CMP CST -> a swap(CMP) (-CST) */
9183 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
9184 /* a CMP (-0) -> a CMP 0 */
9189 /* x != NaN is always true, other ops are always false. */
9192 {
9195 }
9197 /* Fold comparisons against infinity. */
9200 {
9204 }
9205 }
9207 /* If this is a comparison of a real constant with a PLUS_EXPR
9208 or a MINUS_EXPR of a real constant, we can convert it into a
9209 comparison with a revised real constant as long as no overflow
9210 occurs when unsafe_math_optimizations are enabled. */
9222 /* Likewise, we can simplify a comparison of a real constant with
9223 a MINUS_EXPR whose first operand is also a real constant, i.e.
9224 (c1 - x) < c2 becomes x > c1-c2. Reordering is allowed on
9225 floating-point types only if -fassociative-math is set. */
9231 arg1))
9236 /* Fold comparisons against built-in math functions. */
9238 && flag_unsafe_math_optimizations
9240 {
9244 {
9248 }
9249 }
9250 }
9254 {
9255 /* If we are widening one operand of an integer comparison,
9256 see if the other operand is similarly being widened. Perhaps we
9257 can do the comparison in the narrower type. */
9262 /* Or if we are changing signedness. */
9266 }
9268 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
9269 constant, we can simplify it. */
9274 {
9278 }
9280 /* Simplify comparison of something with itself. (For IEEE
9281 floating-point, we can only do some of these simplifications.) */
9283 {
9285 {
9300 /* For NE, we can only do this simplification if integer
9301 or we don't honor IEEE floating point NaNs. */
9305 /* ... fall through ... */
9311 }
9312 }
9314 /* If we are comparing an expression that just has comparisons
9315 of two integer values, arithmetic expressions of those comparisons,
9316 and constants, we can simplify it. There are only three cases
9317 to check: the two values can either be equal, the first can be
9318 greater, or the second can be greater. Fold the expression for
9319 those three values. Since each value must be 0 or 1, we have
9320 eight possibilities, each of which corresponds to the constant 0
9321 or 1 or one of the six possible comparisons.
9323 This handles common cases like (a > b) == 0 but also handles
9324 expressions like ((x > y) - (y > x)) > 0, which supposedly
9325 occur in macroized code. */
9328 {
9333 /* Don't handle degenerate cases here; they should already
9334 have been handled anyway. */
9343 {
9347 /* We can't just pass T to eval_subst in case cval1 or cval2
9348 was the same as ARG1. */
9350 tree high_result
9354 arg1);
9355 tree equal_result
9359 arg1);
9360 tree low_result
9364 arg1);
9366 /* All three of these results should be 0 or 1. Confirm they are.
9367 Then use those values to select the proper code to use. */
9372 {
9373 /* Make a 3-bit mask with the high-order bit being the
9374 value for `>', the next for '=', and the low for '<'. */
9378 {
9380 /* Always false. */
9401 /* Always true. */
9403 }
9406 {
9410 }
9412 }
9413 }
9414 }
9416 /* We can fold X/C1 op C2 where C1 and C2 are integer constants
9417 into a single range test. */
9425 {
9429 }
9431 /* Fold ~X op ~Y as Y op X. */
9434 {
9440 }
9442 /* Fold ~X op C as X op' ~C, where op' is the swapped comparison. */
9445 {
9451 }
9454 }
9457 /* Subroutine of fold_binary. Optimize complex multiplications of the
9458 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
9459 argument EXPR represents the expression "z" of type TYPE. */
9461 static tree
9463 {
9468 {
9471 }
9473 {
9476 }
9477 else
9478 {
9482 }
9491 }
9494 /* Subroutine of fold_binary. If P is the value of EXPR, computes
9495 power-of-two M and (arbitrary) N such that M divides (P-N). This condition
9496 guarantees that P and N have the same least significant log2(M) bits.
9497 N is not otherwise constrained. In particular, N is not normalized to
9498 0 <= N < M as is common. In general, the precise value of P is unknown.
9499 M is chosen as large as possible such that constant N can be determined.
9501 Returns M and sets *RESIDUE to N.
9503 If ALLOW_FUNC_ALIGN is true, do take functions' DECL_ALIGN_UNIT into
9504 account. This is not always possible due to PR 35705.
9505 */
9507 static unsigned HOST_WIDE_INT
9510 {
9517 {
9522 }
9524 {
9532 allow_func_align);
9538 {
9541 }
9543 {
9546 {
9549 /* Compute the greatest power-of-2 divisor of op1. */
9553 /* If align is non-zero and less than *modulus, replace
9554 *modulus with align., If align is 0, then either op1 is 0
9555 or the greatest power-of-2 divisor of op1 doesn't fit in an
9556 unsigned HOST_WIDE_INT. In either case, no additional
9557 constraint is imposed. */
9562 }
9563 }
9564 }
9566 /* If we get here, we were unable to determine anything useful about the
9567 expression. */
9569 }
9571 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
9572 CONSTRUCTOR ARG into array ELTS and return true if successful. */
9574 static bool
9576 {
9580 {
9583 }
9585 {
9591 else
9593 }
9594 else
9600 }
9602 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
9603 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
9604 NULL_TREE otherwise. */
9606 static tree
9608 {
9625 {
9629 }
9632 {
9638 }
9639 else
9641 }
9643 /* Try to fold a pointer difference of type TYPE two address expressions of
9644 array references AREF0 and AREF1 using location LOC. Return a
9645 simplified expression for the difference or NULL_TREE. */
9647 static tree
9650 {
9655 /* If the bases are array references as well, recurse. If the bases
9656 are pointer indirections compute the difference of the pointers.
9657 If the bases are equal, we are set. */
9660 && (base_offset
9668 {
9674 base_offset,
9677 }
9679 }
9681 /* If the real or vector real constant CST of type TYPE has an exact
9682 inverse, return it, else return NULL. */
9684 tree
9686 {
9687 REAL_VALUE_TYPE r;
9689 machine_mode mode;
9693 {
9709 {
9714 }
9720 }
9721 }
9723 /* Mask out the tz least significant bits of X of type TYPE where
9724 tz is the number of trailing zeroes in Y. */
9725 static wide_int
9727 {
9732 }
9734 /* Return true when T is an address and is known to be nonzero.
9735 For floating point we further ensure that T is not denormal.
9736 Similar logic is present in nonzero_address in rtlanal.h.
9738 If the return value is based on the assumption that signed overflow
9739 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9740 change *STRICT_OVERFLOW_P. */
9742 static bool
9744 {
9748 /* Doing something useful for floating point would need more work. */
9754 {
9757 strict_overflow_p);
9763 strict_overflow_p);
9771 }
9774 {
9777 strict_overflow_p);
9785 strict_overflow_p);
9800 strict_overflow_p);
9804 strict_overflow_p);
9807 {
9819 }
9823 }
9825 }
9827 /* Return true when T is an address and is known to be nonzero.
9828 Handle warnings about undefined signed overflow. */
9830 static bool
9832 {
9839 "determining that expression is always "
9841 WARN_STRICT_OVERFLOW_MISC);
9843 }
9845 /* Fold a binary expression of code CODE and type TYPE with operands
9846 OP0 and OP1. LOC is the location of the resulting expression.
9847 Return the folded expression if folding is successful. Otherwise,
9848 return NULL_TREE. */
9850 tree
9853 {
9868 /* Strip any conversions that don't change the mode. This is
9869 safe for every expression, except for a comparison expression
9870 because its signedness is derived from its operands. So, in
9871 the latter case, only strip conversions that don't change the
9872 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9873 preserved.
9875 Note that this is done as an internal manipulation within the
9876 constant folder, in order to find the simplest representation
9877 of the arguments so that their form can be studied. In any
9878 cases, the appropriate type conversions should be put back in
9879 the tree that will get out of the constant folder. */
9882 {
9885 }
9886 else
9887 {
9890 }
9892 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9893 constant but we can't do arithmetic on them. */
9895 {
9898 {
9902 }
9903 }
9905 /* If this is a commutative operation, and ARG0 is a constant, move it
9906 to ARG1 to reduce the number of tests below. */
9911 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9912 to ARG1 to reduce the number of tests below. */
9921 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9923 First check for cases where an arithmetic operation is applied to a
9924 compound, conditional, or comparison operation. Push the arithmetic
9925 operation inside the compound or conditional to see if any folding
9926 can then be done. Convert comparison to conditional for this purpose.
9927 The also optimizes non-constant cases that used to be done in
9928 expand_expr.
9930 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9931 one of the operands is a comparison and the other is a comparison, a
9932 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9933 code below would make the expression more complex. Change it to a
9934 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9935 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9948 {
9952 boolean_type_node,
9960 }
9964 {
9966 {
9971 tem);
9972 }
9975 {
9980 tem);
9981 }
9986 {
9992 }
9997 {
10003 }
10004 }
10007 {
10009 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
10012 {
10018 }
10020 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
10023 {
10024 tree base;
10025 HOST_WIDE_INT coffset;
10034 }
10039 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
10045 arg1),
10047 arg0)));
10052 /* Disable further optimizations involving UPC shared pointers,
10053 because integers are not interoperable with shared pointers. */
10061 {
10062 /* X + (X / CST) * -CST is X % CST. */
10067 {
10076 cst0));
10077 }
10078 }
10080 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
10081 one. Make sure the type is not saturating and has the signedness of
10082 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10083 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10090 {
10094 }
10097 {
10098 /* If we are adding two BIT_AND_EXPR's, both of which are and'ing
10099 with a constant, and the two constants have no bits in common,
10100 we should treat this as a BIT_IOR_EXPR since this may produce more
10101 simplifications. */
10108 {
10111 }
10113 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
10114 (plus (plus (mult) (mult)) (foo)) so that we can
10115 take advantage of the factoring cases below. */
10124 {
10130 else
10143 parg0),
10145 marg)),
10149 return
10155 parg1)));
10156 }
10157 }
10158 else
10159 {
10160 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
10161 to __complex__ ( x, y ). This is not the same for SNaNs or
10162 if signed zeros are involved. */
10166 {
10173 {
10177 {
10183 }
10185 {
10191 }
10192 }
10193 }
10201 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
10202 We associate floats only if the user has specified
10203 -fassociative-math. */
10207 {
10212 {
10213 tree tree0;
10216 }
10217 }
10218 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
10219 We associate floats only if the user has specified
10220 -fassociative-math. */
10224 {
10229 {
10230 tree tree0;
10233 }
10234 }
10235 }
10237 bit_rotate:
10238 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
10239 is a rotate of A by C1 bits. */
10240 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
10241 is a rotate of A by B bits. */
10242 {
10244 tree rtype;
10253 /* Only create rotates in complete modes. Other cases are not
10254 expanded properly. */
10257 {
10271 {
10277 }
10279 {
10287 element_precision
10291 return
10294 ? LROTATE_EXPR
10298 }
10300 {
10308 element_precision
10312 return fold_convert_loc
10315 ? LROTATE_EXPR
10319 }
10320 }
10321 }
10323 associate:
10324 /* In most languages, can't associate operations on floats through
10325 parentheses. Rather than remember where the parentheses were, we
10326 don't associate floats at all, unless the user has specified
10327 -fassociative-math.
10328 And, we need to make sure type is not saturating. */
10332 {
10338 /* Split both trees into variables, constants, and literals. Then
10339 associate each group together, the constants with literals,
10340 then the result with variables. This increases the chances of
10341 literals being recombined later and of generating relocatable
10342 expressions for the sum of a constant and literal. */
10347 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
10351 /* With undefined overflow prefer doing association in a type
10352 which wraps on overflow, if that is one of the operand types. */
10355 {
10363 }
10365 /* With undefined overflow we can only associate constants with one
10366 variable, and constants whose association doesn't overflow. */
10369 {
10371 {
10389 /* The only case we can still associate with two variables
10390 is if they are the same, modulo negation and bit-pattern
10391 preserving conversions. */
10394 }
10395 }
10397 /* Only do something if we found more than two objects. Otherwise,
10398 nothing has changed and we risk infinite recursion. */
10404 {
10416 /* Preserve the MINUS_EXPR if the negative part of the literal is
10417 greater than the positive part. Otherwise, the multiplicative
10418 folding code (i.e extract_muldiv) may be fooled in case
10419 unsigned constants are subtracted, like in the following
10420 example: ((X*2 + 4) - 8U)/2. */
10422 {
10426 {
10430 }
10431 else
10432 {
10436 }
10437 }
10439 /* Don't introduce overflows through reassociation. */
10446 {
10448 return
10452 else
10453 {
10456 return
10460 }
10461 }
10464 return
10467 }
10468 }
10473 /* Pointer simplifications for subtraction, simple reassociations. */
10475 {
10476 /* (PTR0 p+ A) - (PTR1 p+ B) -> (PTR0 - PTR1) + (A - B) */
10479 {
10489 }
10490 /* (PTR0 p+ A) - PTR1 -> (PTR0 - PTR1) + A, assuming PTR0 - PTR1 simplifies. */
10492 {
10499 }
10500 /* PTR0 - (PTR1 p+ A) -> (PTR0 - PTR1) - A, assuming PTR0 - PTR1
10501 simplifies. */
10503 {
10510 arg10);
10513 }
10514 }
10516 /* Disable further optimizations involving UPC shared pointers,
10517 because integers are not interoperable with shared pointers.
10518 (The test below also detects pointer difference between
10519 shared pointers, which cannot be folded. */
10525 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
10535 /* X - (X / Y) * Y is X % Y. */
10543 return
10549 {
10550 /* Fold A - (A & B) into ~B & A. */
10553 {
10555 {
10562 }
10564 {
10571 }
10572 }
10574 /* Fold (A & ~B) - (A & B) into (A ^ B) - B, where B is
10575 any power of 2 minus 1. */
10580 {
10586 {
10590 }
10591 }
10592 }
10594 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
10595 __complex__ ( x, -y ). This is not the same for SNaNs or if
10596 signed zeros are involved. */
10600 {
10607 {
10611 {
10613 arg1r ? arg1r
10618 }
10620 {
10624 arg1i ? arg1i
10627 }
10628 }
10629 }
10631 /* A - B -> A + (-B) if B is easily negatable. */
10635 /* Avoid this transformation if B is a positive REAL_CST. */
10644 /* Try folding difference of addresses. */
10645 {
10646 HOST_WIDE_INT diff;
10652 }
10654 /* Fold &a[i] - &a[j] to i-j. */
10659 {
10665 }
10668 && flag_unsafe_math_optimizations
10674 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
10675 one. Make sure the type is not saturating and has the signedness of
10676 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10677 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10684 {
10688 }
10693 /* (-A) * (-B) -> A * B */
10708 {
10709 /* Transform x * -C into -x * C if x is easily negatable. */
10718 tem);
10720 /* (a * (1 << b)) is (a << b) */
10730 /* (A + A) * C -> A * 2 * C */
10742 /* ((T) (X /[ex] C)) * C cancels out if the conversion is
10743 sign-changing only. */
10753 {
10756 "occur when simplifying "
10758 WARN_STRICT_OVERFLOW_MISC);
10760 }
10762 /* Optimize z * conj(z) for integer complex numbers. */
10769 }
10770 else
10771 {
10772 /* Convert (C1/X)*C2 into (C1*C2)/X. This transformation may change
10773 the result for floating point types due to rounding so it is applied
10774 only if -fassociative-math was specify. */
10779 {
10781 arg1);
10785 }
10787 /* Strip sign operations from X in X*X, i.e. -Y*-Y -> Y*Y. */
10789 {
10792 {
10795 }
10796 }
10798 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
10799 This is not the same for NaNs or if signed zeros are
10800 involved. */
10806 {
10809 return
10815 return
10820 }
10822 /* Optimize z * conj(z) for floating point complex numbers.
10823 Guarded by flag_unsafe_math_optimizations as non-finite
10824 imaginary components don't produce scalar results. */
10835 {
10839 /* Optimizations of root(...)*root(...). */
10841 {
10846 /* Optimize sqrt(x)*sqrt(x) as x. */
10852 /* Optimize root(x)*root(y) as root(x*y). */
10856 }
10858 /* Optimize expN(x)*expN(y) as expN(x+y). */
10860 {
10866 }
10868 /* Optimizations of pow(...)*pow(...). */
10872 {
10878 /* Optimize pow(x,y)*pow(z,y) as pow(x*z,y). */
10880 {
10885 }
10887 /* Optimize pow(x,y)*pow(x,z) as pow(x,y+z). */
10889 {
10894 }
10895 }
10897 /* Optimize tan(x)*cos(x) as sin(x). */
10906 {
10912 }
10914 /* Optimize x*pow(x,c) as pow(x,c+1). */
10918 {
10924 {
10926 REAL_VALUE_TYPE c;
10927 tree arg;
10933 }
10934 }
10936 /* Optimize pow(x,c)*x as pow(x,c+1). */
10940 {
10946 {
10948 REAL_VALUE_TYPE c;
10949 tree arg;
10955 }
10956 }
10958 /* Canonicalize x*x as pow(x,2.0), which is expanded as x*x. */
10960 && optimize
10962 {
10966 {
10969 }
10970 }
10971 }
10972 }
10976 bit_ior:
10977 /* ~X | X is -1. */
10980 {
10984 }
10986 /* X | ~X is -1. */
10989 {
10993 }
10995 /* Canonicalize (X & C1) | C2. */
10999 {
11004 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
11012 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
11017 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
11018 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
11019 mode which allows further optimizations. */
11024 {
11028 {
11031 }
11032 }
11039 c3)),
11040 arg1);
11041 }
11043 /* (X & ~Y) | (~X & Y) is X ^ Y */
11046 {
11063 }
11069 /* Convert (or (not arg0) (not arg1)) to (not (and (arg0) (arg1))).
11071 This results in more efficient code for machines without a NAND
11072 instruction. Combine will canonicalize to the first form
11073 which will allow use of NAND instructions provided by the
11074 backend if they exist. */
11077 {
11078 return
11085 }
11087 /* See if this can be simplified into a rotate first. If that
11088 is unsuccessful continue in the association code. */
11092 /* ~X ^ X is -1. */
11095 {
11099 }
11101 /* X ^ ~X is -1. */
11104 {
11108 }
11110 /* If we are XORing two BIT_AND_EXPR's, both of which are and'ing
11111 with a constant, and the two constants have no bits in common,
11112 we should treat this as a BIT_IOR_EXPR since this may produce more
11113 simplifications. */
11120 {
11123 }
11125 /* (X | Y) ^ X -> Y & ~ X*/
11128 {
11131 arg1);
11136 }
11138 /* (Y | X) ^ X -> Y & ~ X*/
11141 {
11144 arg1);
11149 }
11151 /* X ^ (X | Y) -> Y & ~ X*/
11154 {
11157 arg0);
11162 }
11164 /* X ^ (Y | X) -> Y & ~ X*/
11167 {
11170 arg0);
11175 }
11177 /* Convert ~X ^ ~Y to X ^ Y. */
11186 /* Convert ~X ^ C to X ^ ~C. */
11194 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
11202 /* Fold (X & Y) ^ Y as ~X & Y. */
11205 {
11210 }
11211 /* Fold (X & Y) ^ X as ~Y & X. */
11215 {
11220 }
11221 /* Fold X ^ (X & Y) as X & ~Y. */
11224 {
11229 }
11230 /* Fold X ^ (Y & X) as ~Y & X. */
11234 {
11239 }
11241 /* See if this can be simplified into a rotate first. If that
11242 is unsuccessful continue in the association code. */
11246 /* ~X & X, (X == 0) & X, and !X & X are always zero. */
11254 /* X & ~X , X & (X == 0), and X & !X are always zero. */
11262 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
11267 {
11268 tree tem2;
11275 }
11276 /* Fold ~X & 1 as (X & 1) == 0. */
11280 {
11281 tree tem2;
11288 }
11289 /* Fold !X & 1 as X == 0. */
11292 {
11296 }
11298 /* Fold (X ^ Y) & Y as ~X & Y. */
11301 {
11306 }
11307 /* Fold (X ^ Y) & X as ~Y & X. */
11311 {
11316 }
11317 /* Fold X & (X ^ Y) as X & ~Y. */
11320 {
11325 }
11326 /* Fold X & (Y ^ X) as ~Y & X. */
11330 {
11335 }
11337 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
11338 multiple of 1 << CST. */
11340 {
11347 }
11349 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
11350 bits from CST2. */
11354 {
11362 {
11363 /* Avoid the transform if arg1 is a mask of some
11364 mode which allows further optimizations. */
11371 }
11372 }
11374 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
11375 ((A & N) + B) & M -> (A + B) & M
11376 Similarly if (N & M) == 0,
11377 ((A | N) + B) & M -> (A + B) & M
11378 and for - instead of + (or unary - instead of +)
11379 and/or ^ instead of |.
11380 If B is constant and (B & M) == 0, fold into A & M. */
11382 {
11391 {
11394 wide_int cst0;
11396 /* Now we know that arg0 is (C + D) or (C - D) or
11397 -C and arg1 (M) is == (1LL << cst) - 1.
11398 Store C into PMOP[0] and D into PMOP[1]. */
11402 {
11405 }
11412 {
11422 {
11425 }
11428 /* If C or D is of the form (A & N) where
11429 (N & M) == M, or of the form (A | N) or
11430 (A ^ N) where (N & M) == 0, replace it with A. */
11434 /* If C or D is a N where (N & M) == 0, it can be
11435 omitted (assumed 0). */
11443 }
11445 /* Only build anything new if we optimized one or both arguments
11446 above. */
11450 {
11453 {
11454 /* Perform the operations in a type that has defined
11455 overflow behavior. */
11461 }
11466 {
11474 else
11476 }
11479 else
11482 /* TEM is now the new binary +, - or unary - replacement. */
11486 }
11487 }
11488 }
11493 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
11496 {
11501 return
11503 }
11505 /* Convert (and (not arg0) (not arg1)) to (not (or (arg0) (arg1))).
11507 This results in more efficient code for machines without a NOR
11508 instruction. Combine will canonicalize to the first form
11509 which will allow use of NOR instructions provided by the
11510 backend if they exist. */
11513 {
11520 }
11522 /* If arg0 is derived from the address of an object or function, we may
11523 be able to fold this expression using the object or function's
11524 alignment. */
11526 {
11533 /* This works because modulus is a power of 2. If this weren't the
11534 case, we'd have to replace it by its greatest power-of-2
11535 divisor: modulus & -modulus. */
11538 }
11540 /* Fold (X << C1) & C2 into (X << C1) & (C2 | ((1 << C1) - 1))
11541 (X >> C1) & C2 into (X >> C1) & (C2 | ~((type) -1 >> C1))
11542 if the new mask might be further optimized. */
11551 {
11562 {
11565 /* See if more bits can be proven as zero because of
11566 zero extension. */
11569 {
11574 {
11576 /* See if we can shorten the right shift. */
11579 /* Otherwise X >> C1 is all zeros, so we'll optimize
11580 it into (X, 0) later on by making sure zerobits
11581 is all ones. */
11582 }
11583 }
11586 {
11589 }
11590 /* For arithmetic shift if sign bit could be set, zerobits
11591 can contain actually sign bits, so no transformation is
11592 possible, unless MASK masks them all away. In that
11593 case the shift needs to be converted into logical shift. */
11596 {
11599 else
11601 }
11602 }
11604 /* ((X << 16) & 0xff00) is (X, 0). */
11611 {
11612 /* Only do the transformation if NEWMASK is some integer
11613 mode's mask. */
11620 {
11621 tree newmaskt;
11624 {
11630 }
11631 else
11636 }
11637 }
11638 }
11643 /* Don't touch a floating-point divide by zero unless the mode
11644 of the constant can represent infinity. */
11650 /* (-A) / (-B) -> A / B */
11660 /* Convert A/B/C to A/(B*C). */
11667 /* Convert A/(B/C) to (A/B)*C. */
11675 /* Convert C1/(X*C2) into (C1/C2)/X. */
11680 {
11686 }
11689 {
11693 /* Optimize sin(x)/cos(x) as tan(x). */
11699 {
11704 }
11706 /* Optimize cos(x)/sin(x) as 1.0/tan(x). */
11712 {
11716 {
11721 }
11722 }
11724 /* Optimize sin(x)/tan(x) as cos(x) if we don't care about
11725 NaNs or Infinities. */
11729 {
11736 {
11741 }
11742 }
11744 /* Optimize tan(x)/sin(x) as 1.0/cos(x) if we don't care about
11745 NaNs or Infinities. */
11749 {
11756 {
11760 {
11764 tmp);
11765 }
11766 }
11767 }
11769 /* Optimize pow(x,c)/x as pow(x,c-1). */
11773 {
11779 {
11781 REAL_VALUE_TYPE c;
11782 tree arg;
11788 }
11789 }
11791 /* Optimize a/root(b/c) into a*root(c/b). */
11793 {
11797 {
11806 }
11807 }
11809 /* Optimize x/expN(y) into x*expN(-y). */
11811 {
11818 }
11820 /* Optimize x/pow(y,z) into x*pow(y,-z). */
11824 {
11832 }
11833 }
11837 /* Optimize (X & (-A)) / A where A is a power of 2,
11838 to X >> log2(A) */
11842 {
11850 }
11851 }
11853 /* Fall through */
11856 /* Simplify A / (B << N) where A and B are positive and B is
11857 a power of 2, to A >> (N + log2(B)). */
11862 {
11865 {
11873 WARN_STRICT_OVERFLOW_MISC);
11879 }
11880 }
11882 /* Fall through */
11890 /* Convert -A / -B to A / B when the type is signed and overflow is
11891 undefined. */
11895 {
11898 "when distributing negation across "
11900 WARN_STRICT_OVERFLOW_MISC);
11906 }
11910 {
11913 "when distributing negation across "
11915 WARN_STRICT_OVERFLOW_MISC);
11921 }
11923 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
11924 operation, EXACT_DIV_EXPR.
11926 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
11927 At one time others generated faster code, it's not clear if they do
11928 after the last round to changes to the DIV code in expmed.c. */
11937 {
11941 WARN_STRICT_OVERFLOW_MISC);
11943 }
11951 /* X % -Y is the same as X % Y. */
11964 {
11968 WARN_STRICT_OVERFLOW_MISC);
11970 }
11972 /* Optimize TRUNC_MOD_EXPR by a power of two into a BIT_AND_EXPR,
11973 i.e. "X % C" into "X & (C - 1)", if X and C are positive. */
11977 {
11979 /* Also optimize A % (C << N) where C is a power of 2,
11980 to A & ((C << N) - 1). */
11985 {
11986 tree mask
11991 "occur when simplifying "
11993 WARN_STRICT_OVERFLOW_MISC);
11997 }
11998 }
12006 /* Since negative shift count is not well-defined,
12007 don't try to compute it in the compiler. */
12013 /* Turn (a OP c1) OP c2 into a OP (c1+c2). */
12018 {
12022 /* Deal with a OP (c1 + c2) being undefined but (a OP c1) OP c2
12023 being well defined. */
12025 {
12031 else
12033 }
12037 }
12039 /* Transform (x >> c) << c into x & (-1<<c), or transform (x << c) >> c
12040 into x & ((unsigned)-1 >> c) for unsigned types. */
12048 {
12051 tree lshift;
12052 tree arg00;
12055 {
12062 }
12063 }
12065 /* If we have a rotate of a bit operation with the rotate count and
12066 the second operand of the bit operation both constant,
12067 permute the two operations. */
12079 /* Two consecutive rotates adding up to the some integer
12080 multiple of the precision of the type can be ignored. */
12088 /* Fold (X & C2) << C1 into (X << C1) & (C2 << C1)
12089 (X & C2) >> C1 into (X >> C1) & (C2 >> C1)
12090 if the latter can be further optimized. */
12095 {
12099 arg1);
12103 arg1);
12107 }
12124 /* Note that the operands of this must be ints
12125 and their values must be 0 or 1.
12126 ("true" is a fixed value perhaps depending on the language.) */
12127 /* If first arg is constant zero, return it. */
12131 /* If either arg is constant true, drop it. */
12135 /* Preserve sequence points. */
12138 /* If second arg is constant zero, result is zero, but first arg
12139 must be evaluated. */
12142 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
12143 case will be handled here. */
12147 /* !X && X is always false. */
12151 /* X && !X is always false. */
12156 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
12157 means A >= Y && A != MAX, but in this case we know that
12158 A < X <= MAX. */
12162 {
12170 }
12179 /* Note that the operands of this must be ints
12180 and their values must be 0 or true.
12181 ("true" is a fixed value perhaps depending on the language.) */
12182 /* If first arg is constant true, return it. */
12186 /* If either arg is constant zero, drop it. */
12190 /* Preserve sequence points. */
12193 /* If second arg is constant true, result is true, but we must
12194 evaluate first arg. */
12197 /* Likewise for first arg, but note this only occurs here for
12198 TRUTH_OR_EXPR. */
12202 /* !X || X is always true. */
12206 /* X || !X is always true. */
12211 /* (X && !Y) || (!X && Y) is X ^ Y */
12214 {
12231 }
12240 /* If the second arg is constant zero, drop it. */
12243 /* If the second arg is constant true, this is a logical inversion. */
12245 {
12248 }
12249 /* Identical arguments cancel to zero. */
12253 /* !X ^ X is always true. */
12258 /* X ^ !X is always true. */
12274 /* bool_var != 0 becomes bool_var. */
12279 /* bool_var == 1 becomes bool_var. */
12284 /* bool_var != 1 becomes !bool_var. */
12291 /* bool_var == 0 becomes !bool_var. */
12298 /* !exp != 0 becomes !exp */
12303 /* If this is an equality comparison of the address of two non-weak,
12304 unaliased symbols neither of which are extern (since we do not
12305 have access to attributes for externs), then we know the result. */
12310 {
12318 else
12323 type);
12324 }
12326 /* Similarly for a NEGATE_EXPR. */
12330 arg1)))
12335 /* Similarly for a BIT_XOR_EXPR; X ^ C1 == C2 is X == (C1 ^ C2). */
12343 arg1),
12346 /* Transform comparisons of the form X +- Y CMP X to Y CMP 0. */
12355 {
12359 val,
12363 }
12365 /* Transform comparisons of the form C - X CMP X if C % 2 == 1. */
12372 {
12374 code == NE_EXPR
12377 }
12379 /* Convert ABS_EXPR<x> == 0 or ABS_EXPR<x> != 0 to x == 0 or x != 0. */
12384 /* If this is an EQ or NE comparison with zero and ARG0 is
12385 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
12386 two operations, but the latter can be done in one less insn
12387 on machines that have only two-operand insns or on which a
12388 constant cannot be the first operand. */
12391 {
12396 {
12403 arg1);
12404 }
12407 {
12414 arg1);
12415 }
12416 }
12418 /* If this is an NE or EQ comparison of zero against the result of a
12419 signed MOD operation whose second operand is a power of 2, make
12420 the MOD operation unsigned since it is simpler and equivalent. */
12428 {
12438 }
12440 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
12441 C1 is a valid shift constant, and C2 is a power of two, i.e.
12442 a single bit. */
12446 == INTEGER_CST
12449 {
12454 /* Check for a valid shift count. */
12456 {
12460 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
12461 can be rewritten as (X & (C2 << C1)) != 0. */
12463 {
12468 }
12469 /* Otherwise, for signed (arithmetic) shifts,
12470 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
12471 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
12475 /* Otherwise, of unsigned (logical) shifts,
12476 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
12477 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
12478 else
12482 arg000);
12483 }
12484 }
12486 /* If we have (A & C) == C where C is a power of 2, convert this into
12487 (A & C) != 0. Similarly for NE_EXPR. */
12493 integer_zero_node));
12495 /* If we have (A & C) != 0 or (A & C) == 0 and C is the sign
12496 bit, then fold the expression into A < 0 or A >= 0. */
12501 /* If we have (A & C) == D where D & ~C != 0, convert this into 0.
12502 Similarly for NE_EXPR. */
12506 {
12510 tree dandnotc
12513 notc);
12517 }
12519 /* If we have (A | C) == D where C & ~D != 0, convert this into 0.
12520 Similarly for NE_EXPR. */
12524 {
12526 tree candnotd
12533 }
12535 /* If this is a comparison of a field, we may be able to simplify it. */
12538 /* Handle the constant case even without -O
12539 to make sure the warnings are given. */
12541 {
12545 }
12547 /* Optimize comparisons of strlen vs zero to a compare of the
12548 first character of the string vs zero. To wit,
12549 strlen(ptr) == 0 => *ptr == 0
12550 strlen(ptr) != 0 => *ptr != 0
12551 Other cases should reduce to one of these two (or a constant)
12552 due to the return value of strlen being unsigned. */
12555 {
12563 {
12568 }
12569 }
12571 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
12572 of X. Similarly fold (X >> C) == 0 into X >= 0. */
12576 {
12581 {
12583 {
12586 }
12589 }
12590 }
12592 /* (X ^ Y) == 0 becomes X == Y, and (X ^ Y) != 0 becomes X != Y. */
12598 /* (X ^ Y) == Y becomes X == 0. We know that Y has no side-effects. */
12603 /* Likewise (X ^ Y) == X becomes Y == 0. X has no side-effects. */
12610 /* (X ^ C1) op C2 can be rewritten as X op (C1 ^ C2). */
12618 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
12619 (X & C) == 0 when C is a single bit. */
12624 {
12631 arg1));
12632 }
12634 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
12635 constant C is a power of two, i.e. a single bit. */
12642 {
12646 }
12648 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
12649 when is C is a power of two, i.e. a single bit. */
12656 {
12662 }
12666 {
12669 }
12671 /* Fold -X op -Y as X op Y, where op is eq/ne. */
12679 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
12682 {
12695 arg01),
12704 arg01),
12713 arg00),
12722 arg00),
12724 }
12728 {
12735 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
12736 operand_equal_p guarantees no side-effects so we don't need
12737 to use omit_one_operand on Z. */
12741 arg10));
12745 arg11));
12749 arg10));
12753 arg11));
12755 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
12758 {
12764 }
12765 }
12767 /* Attempt to simplify equality/inequality comparisons of complex
12768 values. Only lower the comparison if the result is known or
12769 can be simplified to a single scalar comparison. */
12774 {
12779 {
12782 }
12783 else
12784 {
12787 }
12790 {
12793 }
12794 else
12795 {
12798 }
12802 {
12804 {
12809 }
12810 else
12811 {
12816 }
12817 }
12821 {
12823 {
12828 }
12829 else
12830 {
12835 }
12836 }
12837 }
12849 /* Transform comparisons of the form X +- C CMP X. */
12856 {
12863 else
12866 /* (X - c) > X becomes false. */
12870 {
12874 "occur when assuming that (X - c) > X "
12876 WARN_STRICT_OVERFLOW_ALL);
12878 }
12880 /* Likewise (X + c) < X becomes false. */
12884 {
12888 "occur when assuming that "
12890 WARN_STRICT_OVERFLOW_ALL);
12892 }
12894 /* Convert (X - c) <= X to true. */
12899 {
12903 "occur when assuming that "
12905 WARN_STRICT_OVERFLOW_ALL);
12907 }
12909 /* Convert (X + c) >= X to true. */
12914 {
12918 "occur when assuming that "
12920 WARN_STRICT_OVERFLOW_ALL);
12922 }
12925 {
12926 /* Convert X + c > X and X - c < X to true for integers. */
12930 {
12933 "not occur when assuming that "
12935 WARN_STRICT_OVERFLOW_ALL);
12937 }
12942 {
12945 "not occur when assuming that "
12947 WARN_STRICT_OVERFLOW_ALL);
12949 }
12951 /* Convert X + c <= X and X - c >= X to false for integers. */
12955 {
12958 "not occur when assuming that "
12960 WARN_STRICT_OVERFLOW_ALL);
12962 }
12967 {
12970 "not occur when assuming that "
12972 WARN_STRICT_OVERFLOW_ALL);
12974 }
12975 }
12976 }
12978 /* Comparisons with the highest or lowest possible integer of
12979 the specified precision will have known values. */
12980 {
12986 {
12993 {
13006 /* The GE_EXPR and LT_EXPR cases above are not normally
13007 reached because of previous transformations. */
13011 }
13014 {
13021 arg1);
13027 arg0),
13028 arg1);
13031 }
13034 {
13049 }
13052 {
13059 arg1);
13065 arg0),
13066 arg1);
13069 }
13073 /* We will flip the signedness of the comparison operator
13074 associated with the mode of arg1, so the sign bit is
13075 specified by this mode. Check that arg1 is the signed
13076 max associated with this sign bit. */
13078 /* signed_type does not work on pointer types. */
13080 {
13081 /* The following case also applies to X < signed_max+1
13082 and X >= signed_max+1 because previous transformations. */
13084 {
13090 }
13091 }
13092 }
13093 }
13095 /* If we are comparing an ABS_EXPR with a constant, we can
13096 convert all the cases into explicit comparisons, but they may
13097 well not be faster than doing the ABS and one comparison.
13098 But ABS (X) <= C is a range comparison, which becomes a subtraction
13099 and a comparison, and is probably faster. */
13113 /* Convert ABS_EXPR<x> >= 0 to true. */
13120 {
13123 "when simplifying comparison of "
13125 WARN_STRICT_OVERFLOW_CONDITIONAL);
13128 arg0);
13129 }
13131 /* Convert ABS_EXPR<x> < 0 to false. */
13136 {
13139 "when simplifying comparison of "
13141 WARN_STRICT_OVERFLOW_CONDITIONAL);
13144 arg0);
13145 }
13147 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
13148 and similarly for >= into !=. */
13158 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
13159 otherwise Y might be >= # of bits in X's type and thus e.g.
13160 (unsigned char) (1 << Y) for Y 15 might be 0.
13161 If the cast is widening, then 1 << Y should have unsigned type,
13162 otherwise if Y is number of bits in the signed shift type minus 1,
13163 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
13164 31 might be 0xffffffff80000000. */
13175 {
13181 }
13194 {
13198 }
13200 /* If the first operand is NaN, the result is constant. */
13204 {
13206 ? integer_zero_node
13209 }
13211 /* If the second operand is NaN, the result is constant. */
13215 {
13217 ? integer_zero_node
13220 }
13222 /* Simplify unordered comparison of something with itself. */
13228 && !flag_trapping_math
13232 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
13233 {
13245 }
13250 /* When pedantic, a compound expression can be neither an lvalue
13251 nor an integer constant expression. */
13254 /* Don't let (0, 0) be null pointer constant. */
13260 /* An ASSERT_EXPR should never be passed to fold_binary. */
13266 }
13268 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
13269 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
13270 of GOTO_EXPR. */
13272 static tree
13274 {
13276 {
13283 /* ... fall through ... */
13287 }
13288 }
13290 /* Return whether the sub-tree ST contains a label which is accessible from
13291 outside the sub-tree. */
13293 static bool
13295 {
13296 return
13298 }
13300 /* Fold a ternary expression of code CODE and type TYPE with operands
13301 OP0, OP1, and OP2. Return the folded expression if folding is
13302 successful. Otherwise, return NULL_TREE. */
13304 tree
13307 {
13308 tree tem;
13315 /* If this is a commutative operation, and OP0 is a constant, move it
13316 to OP1 to reduce the number of tests below. */
13325 /* Strip any conversions that don't change the mode. This is safe
13326 for every expression, except for a comparison expression because
13327 its signedness is derived from its operands. So, in the latter
13328 case, only strip conversions that don't change the signedness.
13330 Note that this is done as an internal manipulation within the
13331 constant folder, in order to find the simplest representation of
13332 the arguments so that their form can be studied. In any cases,
13333 the appropriate type conversions should be put back in the tree
13334 that will get out of the constant folder. */
13336 {
13339 }
13342 {
13345 }
13348 {
13351 }
13354 {
13358 {
13364 }
13369 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
13370 so all simple results must be passed through pedantic_non_lvalue. */
13372 {
13375 /* Only optimize constant conditions when the selected branch
13376 has the same type as the COND_EXPR. This avoids optimizing
13377 away "c ? x : throw", where the throw has a void type.
13378 Avoid throwing away that operand which contains label. */
13385 }
13387 {
13392 {
13397 {
13405 }
13409 }
13410 }
13412 /* If we have A op B ? A : C, we may be able to convert this to a
13413 simpler expression, depending on the operation and the values
13414 of B and C. Signed zeros prevent all of these transformations,
13415 for reasons given above each one.
13417 Also try swapping the arguments and inverting the conditional. */
13422 {
13426 }
13430 op2,
13433 {
13437 {
13441 }
13442 }
13444 /* If the second operand is simpler than the third, swap them
13445 since that produces better jump optimization results. */
13448 {
13450 /* See if this can be inverted. If it can't, possibly because
13451 it was a floating-point inequality comparison, don't do
13452 anything. */
13456 }
13458 /* Convert A ? 1 : 0 to simply A. */
13463 /* If we try to convert OP0 to our type, the
13464 call to fold will try to move the conversion inside
13465 a COND, which will recurse. In that case, the COND_EXPR
13466 is probably the best choice, so leave it alone. */
13470 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
13471 over COND_EXPR in cases such as floating point comparisons. */
13480 arg0)));
13482 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
13487 {
13488 /* sign_bit_p looks through both zero and sign extensions,
13489 but for this optimization only sign extensions are
13490 usable. */
13493 {
13496 {
13499 }
13501 }
13502 /* sign_bit_p only checks ARG1 bits within A's precision.
13503 If <sign bit of A> has wider type than A, bits outside
13504 of A's precision in <sign bit of A> need to be checked.
13505 If they are all 0, this optimization needs to be done
13506 in unsigned A's type, if they are all 1 in signed A's type,
13507 otherwise this can't be done. */
13513 {
13515 tree tem_type;
13528 {
13531 }
13533 {
13536 }
13537 else
13539 }
13542 return
13548 arg1)));
13549 }
13551 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
13552 already handled above. */
13557 {
13566 }
13568 /* A & N ? N : 0 is simply A & N if N is a power of two. This
13569 is probably obsolete because the first operand should be a
13570 truth value (that's why we have the two cases above), but let's
13571 leave it in until we can confirm this for all front-ends. */
13583 /* Disable the transformations below for vectors, since
13584 fold_binary_op_with_conditional_arg may undo them immediately,
13585 yielding an infinite loop. */
13589 /* Convert A ? B : 0 into A && B if A and B are truth values. */
13598 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
13603 {
13605 /* Only perform transformation if ARG0 is easily inverted. */
13609 ? BIT_IOR_EXPR
13612 arg1);
13613 }
13615 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
13620 {
13622 /* Only perform transformation if ARG0 is easily inverted. */
13628 op2);
13629 }
13631 /* Convert A ? 1 : B into A || B if A and B are truth values. */
13643 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
13644 of fold_ternary on them. */
13654 {
13664 {
13669 {
13677 }
13679 /* Constructor elements can be subvectors. */
13682 {
13686 }
13688 /* We keep an exact subset of the constructor elements. */
13690 {
13696 {
13700 }
13708 CONSTRUCTOR_ELT
13711 }
13712 /* The bitfield references a single constructor element. */
13714 {
13719 else
13723 }
13724 }
13725 }
13727 /* A bit-field-ref that referenced the full argument can be stripped. */
13733 /* On constants we can use native encode/interpret to constant
13734 fold (nearly) all BIT_FIELD_REFs. */
13738 /* This limitation should not be necessary, we just need to
13739 round this up to mode size. */
13741 /* Need bit-shifting of the buffer to relax the following. */
13743 {
13748 /* ??? We cannot tell native_encode_expr to start at
13749 some random byte only. So limit us to a reasonable amount
13750 of work. */
13752 {
13757 {
13763 }
13764 }
13765 }
13770 /* For integers we can decompose the FMA if possible. */
13782 {
13798 {
13803 /* Make sure that the perm value is in an acceptable
13804 range. */
13813 else
13818 }
13821 {
13826 }
13831 {
13836 }
13842 {
13846 }
13851 /* Some targets are deficient and fail to expand a single
13852 argument permutation while still allowing an equivalent
13853 2-argument version. */
13857 {
13860 }
13863 {
13870 }
13874 }
13880 }
13882 /* Perform constant folding and related simplification of EXPR.
13883 The related simplifications include x*1 => x, x*0 => 0, etc.,
13884 and application of the associative law.
13885 NOP_EXPR conversions may be removed freely (as long as we
13886 are careful not to change the type of the overall expression).
13887 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
13888 but we can constant-fold them if they have constant operands. */
13890 #ifdef ENABLE_FOLD_CHECKING
13891 # define fold(x) fold_1 (x)
13893 static
13894 #endif
13895 tree
13897 {
13901 tree tem;
13904 /* Return right away if a constant. */
13908 /* CALL_EXPR-like objects with variable numbers of operands are
13909 treated specially. */
13911 {
13913 {
13916 }
13918 }
13921 {
13926 {
13944 }
13945 }
13948 {
13950 {
13957 {
13962 /* Find a matching index by means of a binary search. */
13964 {
13980 else
13982 }
13983 }
13986 }
13988 /* Return a VECTOR_CST if possible. */
13990 {
13997 tree value;
14000 {
14004 {
14007 }
14008 else
14010 }
14015 }
14023 }
14025 #ifdef ENABLE_FOLD_CHECKING
14026 #undef fold
14033 /* When --enable-checking=fold, compute a digest of expr before
14034 and after actual fold call to see if fold did not accidentally
14035 change original expr. */
14037 tree
14039 {
14040 tree ret;
14060 }
14062 void
14064 {
14075 }
14077 static void
14079 {
14081 }
14083 static void
14086 {
14092 recursive_label:
14102 {
14103 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
14108 }
14115 {
14116 /* Allow these fields to be modified. */
14117 tree tmp;
14125 {
14128 }
14129 }
14140 {
14143 {
14158 }
14162 {
14175 }
14192 {
14198 }
14201 {
14203 {
14206 }
14208 }
14219 {
14222 }
14232 }
14233 }
14235 /* Helper function for outputting the checksum of a tree T. When
14236 debugging with gdb, you can "define mynext" to be "next" followed
14237 by "call debug_fold_checksum (op0)", then just trace down till the
14238 outputs differ. */
14240 DEBUG_FUNCTION void
14242 {
14257 }
14259 #endif
14261 /* Fold a unary tree expression with code CODE of type TYPE with an
14262 operand OP0. LOC is the location of the resulting expression.
14263 Return a folded expression if successful. Otherwise, return a tree
14264 expression with code CODE of type TYPE with an operand OP0. */
14266 tree
14269 {
14270 tree tem;
14271 #ifdef ENABLE_FOLD_CHECKING
14280 #endif
14286 #ifdef ENABLE_FOLD_CHECKING
14293 #endif
14295 }
14297 /* Fold a binary tree expression with code CODE of type TYPE with
14298 operands OP0 and OP1. LOC is the location of the resulting
14299 expression. Return a folded expression if successful. Otherwise,
14300 return a tree expression with code CODE of type TYPE with operands
14301 OP0 and OP1. */
14303 tree
14306 MEM_STAT_DECL)
14307 {
14308 tree tem;
14309 #ifdef ENABLE_FOLD_CHECKING
14326 #endif
14332 #ifdef ENABLE_FOLD_CHECKING
14347 #endif
14349 }
14351 /* Fold a ternary tree expression with code CODE of type TYPE with
14352 operands OP0, OP1, and OP2. Return a folded expression if
14353 successful. Otherwise, return a tree expression with code CODE of
14354 type TYPE with operands OP0, OP1, and OP2. */
14356 tree
14359 {
14360 tree tem;
14361 #ifdef ENABLE_FOLD_CHECKING
14385 #endif
14392 #ifdef ENABLE_FOLD_CHECKING
14415 #endif
14417 }
14419 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
14420 arguments in ARGARRAY, and a null static chain.
14421 Return a folded expression if successful. Otherwise, return a CALL_EXPR
14422 of type TYPE from the given operands as constructed by build_call_array. */
14424 tree
14427 {
14428 tree tem;
14429 #ifdef ENABLE_FOLD_CHECKING
14448 #endif
14454 #ifdef ENABLE_FOLD_CHECKING
14470 #endif
14472 }
14474 /* Perform constant folding and related simplification of initializer
14475 expression EXPR. These behave identically to "fold_buildN" but ignore
14476 potential run-time traps and exceptions that fold must preserve. */
14478 #define START_FOLD_INIT \
14479 int saved_signaling_nans = flag_signaling_nans;\
14480 int saved_trapping_math = flag_trapping_math;\
14481 int saved_rounding_math = flag_rounding_math;\
14482 int saved_trapv = flag_trapv;\
14483 int saved_folding_initializer = folding_initializer;\
14484 flag_signaling_nans = 0;\
14485 flag_trapping_math = 0;\
14486 flag_rounding_math = 0;\
14487 flag_trapv = 0;\
14488 folding_initializer = 1;
14490 #define END_FOLD_INIT \
14491 flag_signaling_nans = saved_signaling_nans;\
14492 flag_trapping_math = saved_trapping_math;\
14493 flag_rounding_math = saved_rounding_math;\
14494 flag_trapv = saved_trapv;\
14495 folding_initializer = saved_folding_initializer;
14497 tree
14500 {
14501 tree result;
14502 START_FOLD_INIT;
14506 END_FOLD_INIT;
14508 }
14510 tree
14513 {
14514 tree result;
14515 START_FOLD_INIT;
14519 END_FOLD_INIT;
14521 }
14523 tree
14526 {
14527 tree result;
14528 START_FOLD_INIT;
14532 END_FOLD_INIT;
14534 }
14536 #undef START_FOLD_INIT
14537 #undef END_FOLD_INIT
14539 /* Determine if first argument is a multiple of second argument. Return 0 if
14540 it is not, or we cannot easily determined it to be.
14542 An example of the sort of thing we care about (at this point; this routine
14543 could surely be made more general, and expanded to do what the *_DIV_EXPR's
14544 fold cases do now) is discovering that
14546 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
14548 is a multiple of
14550 SAVE_EXPR (J * 8)
14552 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
14554 This code also handles discovering that
14556 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
14558 is a multiple of 8 so we don't have to worry about dealing with a
14559 possible remainder.
14561 Note that we *look* inside a SAVE_EXPR only to determine how it was
14562 calculated; it is not safe for fold to do much of anything else with the
14563 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
14564 at run time. For example, the latter example above *cannot* be implemented
14565 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
14566 evaluation time of the original SAVE_EXPR is not necessarily the same at
14567 the time the new expression is evaluated. The only optimization of this
14568 sort that would be valid is changing
14570 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
14572 divided by 8 to
14574 SAVE_EXPR (I) * SAVE_EXPR (J)
14576 (where the same SAVE_EXPR (J) is used in the original and the
14577 transformed version). */
14579 int
14581 {
14589 {
14591 /* Bitwise and provides a power of two multiple. If the mask is
14592 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
14595 /* FALLTHRU */
14608 {
14612 /* const_binop may not detect overflow correctly,
14613 so check for it explicitly here. */
14617 size_one_node,
14618 op1)))
14621 }
14625 /* Can't handle conversions from non-integral or wider integral type. */
14631 /* .. fall through ... */
14648 SIGNED);
14652 }
14653 }
14655 /* Return true if CODE or TYPE is known to be non-negative. */
14657 static bool
14659 {
14662 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
14663 have a signed:1 type (where the value is -1 and 0). */
14666 }
14668 /* Return true if (CODE OP0) is known to be non-negative. If the return
14669 value is based on the assumption that signed overflow is undefined,
14670 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14671 *STRICT_OVERFLOW_P. */
14673 bool
14676 {
14681 {
14683 /* We can't return 1 if flag_wrapv is set because
14684 ABS_EXPR<INT_MIN> = INT_MIN. */
14688 {
14691 }
14698 strict_overflow_p);
14700 CASE_CONVERT:
14701 {
14706 {
14709 strict_overflow_p);
14711 {
14715 strict_overflow_p);
14716 }
14717 }
14719 {
14722 strict_overflow_p);
14726 }
14727 }
14732 }
14734 /* We don't know sign of `t', so be conservative and return false. */
14736 }
14738 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
14739 value is based on the assumption that signed overflow is undefined,
14740 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14741 *STRICT_OVERFLOW_P. */
14743 bool
14746 {
14751 {
14756 strict_overflow_p)
14758 strict_overflow_p));
14760 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
14761 both unsigned and at least 2 bits shorter than the result. */
14765 {
14770 {
14774 }
14775 }
14780 {
14781 /* x * x is always non-negative for floating point x
14782 or without overflow. */
14786 {
14791 }
14792 }
14794 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
14795 both unsigned and their total bits is shorter than the result. */
14799 {
14818 {
14828 }
14829 }
14835 strict_overflow_p)
14837 strict_overflow_p));
14848 strict_overflow_p)
14850 strict_overflow_p));
14857 strict_overflow_p);
14860 }
14862 /* We don't know sign of `t', so be conservative and return false. */
14864 }
14866 /* Return true if T is known to be non-negative. If the return
14867 value is based on the assumption that signed overflow is undefined,
14868 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14869 *STRICT_OVERFLOW_P. */
14871 bool
14873 {
14878 {
14890 strict_overflow_p)
14892 strict_overflow_p));
14896 }
14897 /* We don't know sign of `t', so be conservative and return false. */
14899 }
14901 /* Return true if T is known to be non-negative. If the return
14902 value is based on the assumption that signed overflow is undefined,
14903 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14904 *STRICT_OVERFLOW_P. */
14906 bool
14909 {
14912 {
14932 /* Always true. */
14936 /* sqrt(-0.0) is -0.0. */
14940 strict_overflow_p);
14977 /* True if the 1st argument is nonnegative. */
14979 strict_overflow_p);
14982 /* True if the 1st OR 2nd arguments are nonnegative. */
14984 strict_overflow_p)
14986 strict_overflow_p)));
14989 /* True if the 1st AND 2nd arguments are nonnegative. */
14991 strict_overflow_p)
14993 strict_overflow_p)));
14996 /* True if the 2nd argument is nonnegative. */
14998 strict_overflow_p);
15001 /* True if the 1st argument is nonnegative or the second
15002 argument is an even integer. */
15007 strict_overflow_p);
15010 /* True if the 1st argument is nonnegative or the second
15011 argument is an even integer valued real. */
15013 {
15014 REAL_VALUE_TYPE c;
15015 HOST_WIDE_INT n;
15020 {
15021 REAL_VALUE_TYPE cint;
15025 }
15026 }
15028 strict_overflow_p);
15032 }
15034 type);
15035 }
15037 /* Return true if T is known to be non-negative. If the return
15038 value is based on the assumption that signed overflow is undefined,
15039 set *STRICT_OVERFLOW_P to true; otherwise, don't change
15040 *STRICT_OVERFLOW_P. */
15042 static bool
15044 {
15050 {
15052 {
15056 /* If the initializer is non-void, then it's a normal expression
15057 that will be assigned to the slot. */
15061 /* Otherwise, the initializer sets the slot in some way. One common
15062 way is an assignment statement at the end of the initializer. */
15064 {
15072 else
15074 }
15078 strict_overflow_p);
15081 }
15084 {
15090 arg0,
15091 arg1,
15092 strict_overflow_p);
15093 }
15097 strict_overflow_p);
15100 strict_overflow_p);
15103 strict_overflow_p);
15108 }
15110 /* We don't know sign of `t', so be conservative and return false. */
15112 }
15114 /* Return true if T is known to be non-negative. If the return
15115 value is based on the assumption that signed overflow is undefined,
15116 set *STRICT_OVERFLOW_P to true; otherwise, don't change
15117 *STRICT_OVERFLOW_P. */
15119 bool
15121 {
15128 {
15135 strict_overflow_p);
15141 strict_overflow_p);
15150 }
15153 {
15161 strict_overflow_p);
15166 strict_overflow_p);
15179 }
15180 }
15182 /* Return true if `t' is known to be non-negative. Handle warnings
15183 about undefined signed overflow. */
15185 bool
15187 {
15194 "determining that expression is always "
15196 WARN_STRICT_OVERFLOW_MISC);
15198 }
15201 /* Return true when (CODE OP0) is an address and is known to be nonzero.
15202 For floating point we further ensure that T is not denormal.
15203 Similar logic is present in nonzero_address in rtlanal.h.
15205 If the return value is based on the assumption that signed overflow
15206 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
15207 change *STRICT_OVERFLOW_P. */
15209 bool
15212 {
15214 {
15217 strict_overflow_p);
15220 {
15226 strict_overflow_p));
15227 }
15232 strict_overflow_p);
15236 }
15239 }
15241 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
15242 For floating point we further ensure that T is not denormal.
15243 Similar logic is present in nonzero_address in rtlanal.h.
15245 If the return value is based on the assumption that signed overflow
15246 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
15247 change *STRICT_OVERFLOW_P. */
15249 bool
15251 tree type,
15252 tree op0,
15254 {
15257 {
15261 {
15262 /* With the presence of negative values it is hard
15263 to say something. */
15270 /* One of operands must be positive and the other non-negative. */
15271 /* We don't set *STRICT_OVERFLOW_P here: even if this value
15272 overflows, on a twos-complement machine the sum of two
15273 nonnegative numbers can never be zero. */
15275 strict_overflow_p)
15277 strict_overflow_p));
15278 }
15283 {
15285 strict_overflow_p)
15287 strict_overflow_p))
15288 {
15291 }
15292 }
15301 {
15304 }
15311 {
15315 /* When both operands are nonzero, then MAX must be too. */
15317 strict_overflow_p))
15320 /* MAX where operand 0 is positive is positive. */
15322 strict_overflow_p);
15323 }
15324 /* MAX where operand 1 is positive is positive. */
15329 {
15333 }
15338 strict_overflow_p)
15340 strict_overflow_p));
15344 }
15347 }
15349 /* Return true when T is an address and is known to be nonzero.
15350 For floating point we further ensure that T is not denormal.
15351 Similar logic is present in nonzero_address in rtlanal.h.
15353 If the return value is based on the assumption that signed overflow
15354 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
15355 change *STRICT_OVERFLOW_P. */
15357 bool
15359 {
15362 {
15367 {
15376 /* For objects in symbol table check if we know they are non-zero.
15377 Don't do anything for variables and functions before symtab is built;
15378 it is quite possible that they will be declared weak later. */
15380 {
15386 else
15388 }
15390 /* Function local objects are never NULL. */
15397 /* Constants are never weak. */
15402 }
15410 {
15414 }
15419 }
15421 }
15423 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
15424 attempt to fold the expression to a constant without modifying TYPE,
15425 OP0 or OP1.
15427 If the expression could be simplified to a constant, then return
15428 the constant. If the expression would not be simplified to a
15429 constant, then return NULL_TREE. */
15431 tree
15433 {
15436 }
15438 /* Given the components of a unary expression CODE, TYPE and OP0,
15439 attempt to fold the expression to a constant without modifying
15440 TYPE or OP0.
15442 If the expression could be simplified to a constant, then return
15443 the constant. If the expression would not be simplified to a
15444 constant, then return NULL_TREE. */
15446 tree
15448 {
15451 }
15453 /* If EXP represents referencing an element in a constant string
15454 (either via pointer arithmetic or array indexing), return the
15455 tree representing the value accessed, otherwise return NULL. */
15457 tree
15459 {
15463 {
15465 tree index;
15466 tree string;
15471 else
15472 {
15476 /* Optimize the special-case of a zero lower bound.
15478 We convert the low_bound to sizetype to avoid some problems
15479 with constant folding. (E.g. suppose the lower bound is 1,
15480 and its mode is QI. Without the conversion,l (ARRAY
15481 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
15482 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
15488 }
15501 }
15503 }
15505 /* Return the tree for neg (ARG0) when ARG0 is known to be either
15506 an integer constant, real, or fixed-point constant.
15508 TYPE is the type of the result. */
15510 static tree
15512 {
15516 {
15518 {
15525 }
15532 {
15533 FIXED_VALUE_TYPE f;
15538 /* Propagate overflow flags. */
15542 }
15546 }
15549 }
15551 /* Return the tree for abs (ARG0) when ARG0 is known to be either
15552 an integer constant or real constant.
15554 TYPE is the type of the result. */
15556 tree
15558 {
15562 {
15564 {
15565 /* If the value is unsigned or non-negative, then the absolute value
15566 is the same as the ordinary value. */
15570 /* If the value is negative, then the absolute value is
15571 its negation. */
15572 else
15573 {
15578 }
15579 }
15585 else
15591 }
15594 }
15596 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
15597 constant. TYPE is the type of the result. */
15599 static tree
15601 {
15605 }
15607 /* Given CODE, a relational operator, the target type, TYPE and two
15608 constant operands OP0 and OP1, return the result of the
15609 relational operation. If the result is not a compile time
15610 constant, then return NULL_TREE. */
15612 static tree
15614 {
15617 /* From here on, the only cases we handle are when the result is
15618 known to be a constant. */
15621 {
15625 /* Handle the cases where either operand is a NaN. */
15627 {
15629 {
15657 }
15660 }
15663 }
15666 {
15670 }
15672 /* Handle equality/inequality of complex constants. */
15674 {
15685 else
15687 }
15690 {
15697 {
15709 }
15712 }
15714 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
15716 To compute GT, swap the arguments and do LT.
15717 To compute GE, do LT and invert the result.
15718 To compute LE, swap the arguments, do LT and invert the result.
15719 To compute NE, do EQ and invert the result.
15721 Therefore, the code below must handle only EQ and LT. */
15724 {
15729 }
15731 /* Note that it is safe to invert for real values here because we
15732 have already handled the one case that it matters. */
15736 {
15739 }
15741 /* Compute a result for LT or EQ if args permit;
15742 Otherwise return T. */
15744 {
15747 else
15749 }
15750 else
15756 }
15758 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
15759 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
15760 itself. */
15762 tree
15764 {
15765 /* If the expression does not have side effects then we don't have to wrap
15766 it with a cleanup point expression. */
15770 /* If the expression is a return, check to see if the expression inside the
15771 return has no side effects or the right hand side of the modify expression
15772 inside the return. If either don't have side effects set we don't need to
15773 wrap the expression in a cleanup point expression. Note we don't check the
15774 left hand side of the modify because it should always be a return decl. */
15776 {
15783 }
15786 }
15788 /* Given a pointer value OP0 and a type TYPE, return a simplified version
15789 of an indirection through OP0, or NULL_TREE if no simplification is
15790 possible. */
15792 tree
15794 {
15796 tree subtype;
15804 {
15807 /* *&CONST_DECL -> to the value of the const decl. */
15810 /* *&p => p; make sure to handle *&"str"[cst] here. */
15812 {
15816 else
15818 }
15819 /* *(foo *)&fooarray => fooarray[0] */
15822 && (!in_gimple_form
15824 {
15834 }
15835 /* *(foo *)&complexfoo => __real__ complexfoo */
15839 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
15842 {
15846 }
15847 }
15851 {
15857 {
15858 tree op00type;
15862 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
15865 {
15877 }
15878 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
15881 {
15885 }
15886 /* ((foo *)&fooarray)[1] => fooarray[1] */
15889 {
15899 }
15900 }
15901 }
15903 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
15906 && (!in_gimple_form
15908 {
15909 tree type_domain;
15919 NULL_TREE);
15920 }
15923 }
15925 /* Builds an expression for an indirection through T, simplifying some
15926 cases. */
15928 tree
15930 {
15938 }
15940 /* Given an INDIRECT_REF T, return either T or a simplified version. */
15942 tree
15944 {
15949 else
15951 }
15953 /* Strip non-trapping, non-side-effecting tree nodes from an expression
15954 whose result is ignored. The type of the returned tree need not be
15955 the same as the original expression. */
15957 tree
15959 {
15965 {
15976 else
15982 {
15998 }
16003 }
16004 }
16006 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
16008 tree
16010 {
16016 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
16017 have to do anything. Only do this when we are not given a const,
16018 because in that case, this check is more expensive than just
16019 doing it. */
16021 {
16026 }
16028 /* If divisor is a power of two, simplify this to bit manipulation. */
16030 {
16032 {
16046 }
16047 else
16048 {
16049 tree t;
16055 }
16056 }
16057 else
16058 {
16063 }
16066 }
16068 /* Likewise, but round down. */
16070 tree
16072 {
16079 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
16080 have to do anything. Only do this when we are not given a const,
16081 because in that case, this check is more expensive than just
16082 doing it. */
16084 {
16089 }
16091 /* If divisor is a power of two, simplify this to bit manipulation. */
16093 {
16094 tree t;
16098 }
16099 else
16100 {
16105 }
16108 }
16110 /* Returns the pointer to the base of the object addressed by EXP and
16111 extracts the information about the offset of the access, storing it
16112 to PBITPOS and POFFSET. */
16114 static tree
16117 {
16118 tree core;
16119 machine_mode mode;
16121 HOST_WIDE_INT bitsize;
16125 {
16130 }
16131 else
16132 {
16136 }
16139 }
16141 /* Returns true if addresses of E1 and E2 differ by a constant, false
16142 otherwise. If they do, E1 - E2 is stored in *DIFF. */
16144 bool
16146 {
16160 {
16170 }
16172 {
16173 /* If only one of the offsets is non-constant, the difference cannot
16174 be a constant. */
16176 }
16177 else
16182 }
16184 /* Simplify the floating point expression EXP when the sign of the
16185 result is not significant. Return NULL_TREE if no simplification
16186 is possible. */
16188 tree
16190 {
16195 {
16231 {
16234 {
16236 /* Strip copysign function call, return the 1st argument. */
16242 /* Strip sign ops from the argument of "odd" math functions. */
16244 {
16248 }
16250 }
16251 }
16256 }
16258 }
16260 /* Return OFF converted to a pointer offset type suitable as offset for
16261 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
16262 tree
16264 {
16266 }
16268 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
16269 tree
16271 {
16274 }
16276 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
16277 tree
16279 {
16282 }