| blob | 75bc7627a0719b7f25cd435f3a6f055c51dd62cf |
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /*@@ This file should be rewritten to use an arbitrary precision
21 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
22 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
23 @@ The routines that translate from the ap rep should
24 @@ warn if precision et. al. is lost.
25 @@ This would also make life easier when this technology is used
26 @@ for cross-compilers. */
28 /* The entry points in this file are fold, size_int_wide and size_binop.
30 fold takes a tree as argument and returns a simplified tree.
32 size_binop takes a tree code for an arithmetic operation
33 and two operands that are trees, and produces a tree for the
34 result, assuming the type comes from `sizetype'.
36 size_int takes an integer value, and creates a tree constant
37 with type from `sizetype'.
39 Note: Since the folders get called on non-gimple code as well as
40 gimple code, we need to handle GIMPLE tuples as well as their
41 corresponding tree equivalents. */
86 /* Nonzero if we are folding constants inside an initializer; zero
87 otherwise. */
90 /* The following constants represent a bit based encoding of GCC's
91 comparison operators. This encoding simplifies transformations
92 on relational comparison operators, such as AND and OR. */
110 };
143 /* Return EXPR_LOCATION of T if it is not UNKNOWN_LOCATION.
144 Otherwise, return LOC. */
146 static location_t
148 {
151 }
153 /* Similar to protected_set_expr_location, but never modify x in place,
154 if location can and needs to be set, unshare it. */
158 {
164 {
167 }
169 }
170 \f
171 /* If ARG2 divides ARG1 with zero remainder, carries out the exact
172 division and returns the quotient. Otherwise returns
173 NULL_TREE. */
175 tree
177 {
178 widest_int quo;
185 }
186 \f
187 /* This is nonzero if we should defer warnings about undefined
188 overflow. This facility exists because these warnings are a
189 special case. The code to estimate loop iterations does not want
190 to issue any warnings, since it works with expressions which do not
191 occur in user code. Various bits of cleanup code call fold(), but
192 only use the result if it has certain characteristics (e.g., is a
193 constant); that code only wants to issue a warning if the result is
194 used. */
198 /* If a warning about undefined overflow is deferred, this is the
199 warning. Note that this may cause us to turn two warnings into
200 one, but that is fine since it is sufficient to only give one
201 warning per expression. */
205 /* If a warning about undefined overflow is deferred, this is the
206 level at which the warning should be emitted. */
210 /* Start deferring overflow warnings. We could use a stack here to
211 permit nested calls, but at present it is not necessary. */
213 void
215 {
217 }
219 /* Stop deferring overflow warnings. If there is a pending warning,
220 and ISSUE is true, then issue the warning if appropriate. STMT is
221 the statement with which the warning should be associated (used for
222 location information); STMT may be NULL. CODE is the level of the
223 warning--a warn_strict_overflow_code value. This function will use
224 the smaller of CODE and the deferred code when deciding whether to
225 issue the warning. CODE may be zero to mean to always use the
226 deferred code. */
228 void
230 {
232 location_t locus;
237 {
243 }
254 /* Use the smallest code level when deciding to issue the
255 warning. */
264 else
267 }
269 /* Stop deferring overflow warnings, ignoring any deferred
270 warnings. */
272 void
274 {
276 }
278 /* Whether we are deferring overflow warnings. */
280 bool
282 {
284 }
286 /* This is called when we fold something based on the fact that signed
287 overflow is undefined. */
289 void
291 {
293 {
296 {
299 }
300 }
303 }
304 \f
305 /* Return true if the built-in mathematical function specified by CODE
306 is odd, i.e. -f(x) == f(-x). */
308 bool
310 {
312 {
313 CASE_CFN_ASIN:
314 CASE_CFN_ASINH:
315 CASE_CFN_ATAN:
316 CASE_CFN_ATANH:
317 CASE_CFN_CASIN:
318 CASE_CFN_CASINH:
319 CASE_CFN_CATAN:
320 CASE_CFN_CATANH:
321 CASE_CFN_CBRT:
322 CASE_CFN_CPROJ:
323 CASE_CFN_CSIN:
324 CASE_CFN_CSINH:
325 CASE_CFN_CTAN:
326 CASE_CFN_CTANH:
327 CASE_CFN_ERF:
328 CASE_CFN_LLROUND:
329 CASE_CFN_LROUND:
330 CASE_CFN_ROUND:
331 CASE_CFN_SIN:
332 CASE_CFN_SINH:
333 CASE_CFN_TAN:
334 CASE_CFN_TANH:
335 CASE_CFN_TRUNC:
338 CASE_CFN_LLRINT:
339 CASE_CFN_LRINT:
340 CASE_CFN_NEARBYINT:
341 CASE_CFN_RINT:
346 }
348 }
350 /* Check whether we may negate an integer constant T without causing
351 overflow. */
353 bool
355 {
356 tree type;
365 }
367 /* Determine whether an expression T can be cheaply negated using
368 the function negate_expr without introducing undefined overflow. */
370 static bool
372 {
373 tree type;
382 {
387 /* Check that -CST will not overflow type. */
400 /* We want to canonicalize to positive real constants. Pretend
401 that only negative ones can be easily negated. */
409 {
413 /* Steps don't prevent negation. */
420 }
435 /* -(A + B) -> (-B) - A. */
438 /* -(A + B) -> (-A) - B. */
442 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
451 /* INT_MIN/n * n doesn't overflow while negating one operand it does
452 if n is a (negative) power of two. */
463 /* Fall through. */
478 /* In general we can't negate B in A / B, because if A is INT_MIN and
479 B is 1, we may turn this into INT_MIN / -1 which is undefined
480 and actually traps on some architectures. */
489 /* Negate -((double)float) as (double)(-float). */
491 {
495 }
499 /* Negate -f(x) as f(-x). */
505 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
507 {
511 }
516 }
518 }
520 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
521 simplification is possible.
522 If negate_expr_p would return true for T, NULL_TREE will never be
523 returned. */
525 static tree
527 {
529 tree tem;
532 {
533 /* Convert - (~A) to A + 1. */
557 {
562 }
566 {
567 tree_vector_builder elts;
571 {
576 }
579 }
602 {
603 /* -(A + B) -> (-B) - A. */
605 {
609 }
611 /* -(A + B) -> (-A) - B. */
613 {
617 }
618 }
622 /* - (A - B) -> B - A */
633 /* Fall through. */
637 {
646 }
658 /* In general we can't negate B in A / B, because if A is INT_MIN and
659 B is 1, we may turn this into INT_MIN / -1 which is undefined
660 and actually traps on some architectures. */
672 /* Convert -((double)float) into (double)(-float). */
674 {
678 }
682 /* Negate -f(x) as f(-x). */
685 {
691 }
695 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
697 {
700 {
707 }
708 }
713 }
716 }
718 /* A wrapper for fold_negate_expr_1. */
720 static tree
722 {
729 }
731 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T can not be
732 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
733 return NULL_TREE. */
735 static tree
737 {
739 location_t loc;
752 }
753 \f
754 /* Split a tree IN into a constant, literal and variable parts that could be
755 combined with CODE to make IN. "constant" means an expression with
756 TREE_CONSTANT but that isn't an actual constant. CODE must be a
757 commutative arithmetic operation. Store the constant part into *CONP,
758 the literal in *LITP and return the variable part. If a part isn't
759 present, set it to null. If the tree does not decompose in this way,
760 return the entire tree as the variable part and the other parts as null.
762 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
763 case, we negate an operand that was subtracted. Except if it is a
764 literal for which we use *MINUS_LITP instead.
766 If NEGATE_P is true, we are negating all of IN, again except a literal
767 for which we use *MINUS_LITP instead. If a variable part is of pointer
768 type, it is negated after converting to TYPE. This prevents us from
769 generating illegal MINUS pointer expression. LOC is the location of
770 the converted variable part.
772 If IN is itself a literal or constant, return it as appropriate.
774 Note that we do not guarantee that any of the three values will be the
775 same type as IN, but they will have the same signedness and mode. */
777 static tree
781 {
789 /* Strip any conversions that don't change the machine mode or signedness. */
798 /* We can associate addition and subtraction together (even
799 though the C standard doesn't say so) for integers because
800 the value is not affected. For reals, the value might be
801 affected, so we can't. */
807 {
813 /* First see if either of the operands is a literal, then a constant. */
826 /* If we haven't dealt with either operand, this is not a case we can
827 decompose. Otherwise, VAR is either of the ones remaining, if any. */
832 else
835 /* Now do any needed negations. */
842 }
847 {
848 /* -1 - X is folded to ~X, undo that here. Do _not_ do this
849 when IN is constant. */
852 }
853 else
857 {
870 }
880 }
882 /* Re-associate trees split by the above function. T1 and T2 are
883 either expressions to associate or null. Return the new
884 expression, if any. LOC is the location of the new expression. If
885 we build an operation, do it in TYPE and with CODE. */
887 static tree
889 {
891 {
894 }
898 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
899 try to fold this since we will have infinite recursion. But do
900 deal with any NEGATE_EXPRs. */
904 {
906 {
919 }
921 {
924 }
928 }
932 }
933 \f
934 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
935 for use in int_const_binop, size_binop and size_diffop. */
937 static bool
939 {
946 {
955 }
960 }
962 /* Subroutine of int_const_binop_1 that handles two INTEGER_CSTs. */
964 static tree
967 {
968 wide_int res;
969 tree t;
978 {
994 {
998 else
1000 }
1003 /* It's unclear from the C standard whether shifts can overflow.
1004 The following code ignores overflow; perhaps a C standard
1005 interpretation ruling is needed. */
1007 else
1014 {
1018 else
1020 }
1024 else
1103 }
1111 }
1113 /* Combine two integer constants PARG1 and PARG2 under operation CODE
1114 to produce a new constant. Return NULL_TREE if we don't know how
1115 to evaluate CODE at compile-time. */
1117 static tree
1120 {
1127 {
1128 poly_wide_int res;
1133 {
1151 else
1158 else
1171 }
1176 }
1179 }
1181 tree
1183 {
1185 }
1187 /* Return true if binary operation OP distributes over addition in operand
1188 OPNO, with the other operand being held constant. OPNO counts from 1. */
1190 static bool
1192 {
1194 {
1205 }
1206 }
1208 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1209 constant. We assume ARG1 and ARG2 have the same data type, or at least
1210 are the same kind of constant and the same machine mode. Return zero if
1211 combining the constants is not allowed in the current operating mode. */
1213 static tree
1215 {
1216 /* Sanity check for the recursive cases. */
1224 {
1230 }
1233 {
1234 machine_mode mode;
1235 REAL_VALUE_TYPE d1;
1236 REAL_VALUE_TYPE d2;
1237 REAL_VALUE_TYPE value;
1238 REAL_VALUE_TYPE result;
1242 /* The following codes are handled by real_arithmetic. */
1244 {
1255 }
1263 /* Don't perform operation if we honor signaling NaNs and
1264 either operand is a signaling NaN. */
1270 /* Don't perform operation if it would raise a division
1271 by zero exception. */
1277 /* If either operand is a NaN, just return it. Otherwise, set up
1278 for floating-point trap; we return an overflow. */
1280 {
1281 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1282 is off. */
1286 }
1288 {
1289 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1290 is off. */
1294 }
1299 /* Don't constant fold this floating point operation if
1300 the result has overflowed and flag_trapping_math. */
1308 /* Don't constant fold this floating point operation if the
1309 result may dependent upon the run-time rounding mode and
1310 flag_rounding_math is set, or if GCC's software emulation
1311 is unable to accurately represent the result. */
1321 }
1324 {
1325 FIXED_VALUE_TYPE f1;
1326 FIXED_VALUE_TYPE f2;
1327 FIXED_VALUE_TYPE result;
1332 /* The following codes are handled by fixed_arithmetic. */
1334 {
1346 {
1353 }
1358 }
1365 /* Propagate overflow flags. */
1369 }
1372 {
1381 {
1392 mpc_mul);
1406 mpc_div);
1407 /* Fallthru. */
1413 {
1414 /* Keep this algorithm in sync with
1415 tree-complex.c:expand_complex_div_straight().
1417 Expand complex division to scalars, straightforward algorithm.
1418 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1419 t = br*br + bi*bi
1420 */
1421 tree magsquared
1425 tree t1
1429 tree t2
1436 }
1437 else
1438 {
1439 /* Keep this algorithm in sync with
1440 tree-complex.c:expand_complex_div_wide().
1442 Expand complex division to scalars, modified algorithm to minimize
1443 overflow with wide input ranges. */
1449 {
1450 /* In the TRUE branch, we compute
1451 ratio = br/bi;
1452 div = (br * ratio) + bi;
1453 tr = (ar * ratio) + ai;
1454 ti = (ai * ratio) - ar;
1455 tr = tr / div;
1456 ti = ti / div; */
1467 }
1468 else
1469 {
1470 /* In the FALSE branch, we compute
1471 ratio = d/c;
1472 divisor = (d * ratio) + c;
1473 tr = (b * ratio) + a;
1474 ti = b - (a * ratio);
1475 tr = tr / div;
1476 ti = ti / div; */
1488 }
1489 }
1494 }
1498 }
1504 {
1509 /* We can operate directly on the encoding if:
1511 a3 - a2 == a2 - a1 && b3 - b2 == b2 - b1
1512 implies
1513 (a3 op b3) - (a2 op b2) == (a2 op b2) - (a1 op b1)
1515 Addition and subtraction are the supported operators
1516 for which this is true. */
1519 /* We can operate directly on stepped encodings if:
1521 a3 - a2 == a2 - a1
1522 implies:
1523 (a3 op c) - (a2 op c) == (a2 op c) - (a1 op c)
1525 which is true if (x -> x op c) distributes over addition. */
1527 else
1528 /* Similarly in reverse. */
1530 tree_vector_builder elts;
1535 {
1541 /* It is possible that const_binop cannot handle the given
1542 code and return NULL_TREE */
1546 }
1549 }
1551 /* Shifts allow a scalar offset for a vector. */
1554 {
1557 tree_vector_builder elts;
1562 {
1567 /* It is possible that const_binop cannot handle the given
1568 code and return NULL_TREE. */
1572 }
1575 }
1577 }
1579 /* Overload that adds a TYPE parameter to be able to dispatch
1580 to fold_relational_const. */
1582 tree
1584 {
1588 /* ??? Until we make the const_binop worker take the type of the
1589 result as argument put those cases that need it here. */
1591 {
1608 {
1613 }
1618 {
1632 {
1642 }
1645 }
1651 {
1673 {
1686 }
1689 }
1692 }
1697 /* Make sure type and arg0 have the same saturating flag. */
1702 }
1704 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1705 Return zero if computing the constants is not possible. */
1707 tree
1709 {
1710 /* Don't perform the operation, other than NEGATE and ABS, if
1711 flag_signaling_nans is on and the operand is a signaling NaN. */
1720 {
1721 CASE_CONVERT:
1728 /* If the source address is 0, and the source address space
1729 cannot have a valid object at 0, fold to dest type null. */
1740 {
1741 /* Can't call fold_negate_const directly here as that doesn't
1742 handle all cases and we might not be able to negate some
1743 constants. */
1748 }
1757 {
1761 }
1769 /* Perform BIT_NOT_EXPR on each element individually. */
1771 {
1772 tree elem;
1774 /* This can cope with stepped encodings because ~x == -1 - x. */
1775 tree_vector_builder elements;
1779 {
1785 }
1788 }
1810 {
1828 else
1833 {
1839 }
1842 }
1851 }
1854 }
1856 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1857 indicates which particular sizetype to create. */
1859 tree
1861 {
1863 }
1864 \f
1865 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1866 is a tree code. The type of the result is taken from the operands.
1867 Both must be equivalent integer types, ala int_binop_types_match_p.
1868 If the operands are constant, so is the result. */
1870 tree
1872 {
1881 /* Handle the special case of two poly_int constants faster. */
1883 {
1884 /* And some specific cases even faster than that. */
1886 {
1891 }
1893 {
1896 }
1898 {
1901 }
1903 /* Handle general case of two integer constants. For sizetype
1904 constant calculations we always want to know about overflow,
1905 even in the unsigned case. */
1909 }
1912 }
1914 /* Given two values, either both of sizetype or both of bitsizetype,
1915 compute the difference between the two values. Return the value
1916 in signed type corresponding to the type of the operands. */
1918 tree
1920 {
1922 tree ctype;
1927 /* If the type is already signed, just do the simple thing. */
1935 else
1938 /* If either operand is not a constant, do the conversions to the signed
1939 type and subtract. The hardware will do the right thing with any
1940 overflow in the subtraction. */
1946 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1947 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1948 overflow) and negate (which can't either). Special-case a result
1949 of zero while we're here. */
1955 else
1959 MINUS_EXPR,
1961 }
1962 \f
1963 /* A subroutine of fold_convert_const handling conversions of an
1964 INTEGER_CST to another integer type. */
1966 static tree
1968 {
1969 /* Given an integer constant, make new constant with new type,
1970 appropriately sign-extended or truncated. Use widest_int
1971 so that any extension is done according ARG1's type. */
1975 }
1977 /* A subroutine of fold_convert_const handling conversions a REAL_CST
1978 to an integer type. */
1980 static tree
1982 {
1984 tree t;
1986 /* The following code implements the floating point to integer
1987 conversion rules required by the Java Language Specification,
1988 that IEEE NaNs are mapped to zero and values that overflow
1989 the target precision saturate, i.e. values greater than
1990 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
1991 are mapped to INT_MIN. These semantics are allowed by the
1992 C and C++ standards that simply state that the behavior of
1993 FP-to-integer conversion is unspecified upon overflow. */
1995 wide_int val;
1996 REAL_VALUE_TYPE r;
2000 {
2007 }
2009 /* If R is NaN, return zero and show we have an overflow. */
2011 {
2014 }
2016 /* See if R is less than the lower bound or greater than the
2017 upper bound. */
2020 {
2024 {
2027 }
2028 }
2031 {
2034 {
2037 {
2040 }
2041 }
2042 }
2049 }
2051 /* A subroutine of fold_convert_const handling conversions of a
2052 FIXED_CST to an integer type. */
2054 static tree
2056 {
2057 tree t;
2059 scalar_mode mode;
2061 /* Right shift FIXED_CST to temp by fbit. */
2065 {
2067 HOST_BITS_PER_DOUBLE_INT,
2070 /* Left shift temp to temp_trunc by fbit. */
2072 HOST_BITS_PER_DOUBLE_INT,
2074 }
2075 else
2076 {
2079 }
2081 /* If FIXED_CST is negative, we need to round the value toward 0.
2082 By checking if the fractional bits are not zero to add 1 to temp. */
2088 /* Given a fixed-point constant, make new constant with new type,
2089 appropriately sign-extended or truncated. */
2097 }
2099 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2100 to another floating point type. */
2102 static tree
2104 {
2105 REAL_VALUE_TYPE value;
2106 tree t;
2108 /* Don't perform the operation if flag_signaling_nans is on
2109 and the operand is a signaling NaN. */
2117 /* If converting an infinity or NAN to a representation that doesn't
2118 have one, set the overflow bit so that we can produce some kind of
2119 error message at the appropriate point if necessary. It's not the
2120 most user-friendly message, but it's better than nothing. */
2127 /* Regular overflow, conversion produced an infinity in a mode that
2128 can't represent them. */
2133 else
2136 }
2138 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2139 to a floating point type. */
2141 static tree
2143 {
2144 REAL_VALUE_TYPE value;
2145 tree t;
2153 }
2155 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2156 to another fixed-point type. */
2158 static tree
2160 {
2161 FIXED_VALUE_TYPE value;
2162 tree t;
2169 /* Propagate overflow flags. */
2173 }
2175 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2176 to a fixed-point type. */
2178 static tree
2180 {
2181 FIXED_VALUE_TYPE value;
2182 tree t;
2184 double_int di;
2191 else
2199 /* Propagate overflow flags. */
2203 }
2205 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2206 to a fixed-point type. */
2208 static tree
2210 {
2211 FIXED_VALUE_TYPE value;
2212 tree t;
2220 /* Propagate overflow flags. */
2224 }
2226 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2227 type TYPE. If no simplification can be done return NULL_TREE. */
2229 static tree
2231 {
2236 /* We can't widen types, since the runtime value could overflow the
2237 original type before being extended to the new type. */
2248 {
2255 }
2257 {
2264 }
2266 {
2273 }
2275 {
2278 {
2281 /* We can't handle steps directly when extending, since the
2282 values need to wrap at the original precision first. */
2283 bool step_ok_p
2287 tree_vector_builder v;
2292 {
2298 }
2300 }
2301 }
2303 }
2305 /* Construct a vector of zero elements of vector type TYPE. */
2307 static tree
2309 {
2310 tree t;
2314 }
2316 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2318 bool
2320 {
2335 {
2350 }
2351 }
2353 /* Convert expression ARG to type TYPE. Used by the middle-end for
2354 simple conversions in preference to calling the front-end's convert. */
2356 tree
2358 {
2360 tree tem;
2371 {
2374 /* Handle conversions between pointers to different address spaces. */
2379 /* fall through */
2384 {
2388 }
2402 {
2406 }
2408 {
2412 }
2414 {
2418 }
2421 {
2439 }
2444 {
2448 }
2451 {
2465 }
2469 {
2478 integer_zero_node));
2480 {
2484 {
2490 }
2498 }
2502 }
2520 }
2521 fold_convert_exit:
2524 }
2525 \f
2526 /* Return false if expr can be assumed not to be an lvalue, true
2527 otherwise. */
2529 static bool
2531 {
2532 /* We only need to wrap lvalue tree codes. */
2534 {
2565 /* Assume the worst for front-end tree codes. */
2569 }
2572 }
2574 /* Return an expr equal to X but certainly not valid as an lvalue. */
2576 tree
2578 {
2579 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2580 us. */
2587 }
2589 /* When pedantic, return an expr equal to X but certainly not valid as a
2590 pedantic lvalue. Otherwise, return X. */
2592 static tree
2594 {
2596 }
2597 \f
2598 /* Given a tree comparison code, return the code that is the logical inverse.
2599 It is generally not safe to do this for floating-point comparisons, except
2600 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2601 ERROR_MARK in this case. */
2603 enum tree_code
2605 {
2611 {
2642 }
2643 }
2645 /* Similar, but return the comparison that results if the operands are
2646 swapped. This is safe for floating-point. */
2648 enum tree_code
2650 {
2652 {
2678 }
2679 }
2682 /* Convert a comparison tree code from an enum tree_code representation
2683 into a compcode bit-based encoding. This function is the inverse of
2684 compcode_to_comparison. */
2686 static enum comparison_code
2688 {
2690 {
2721 }
2722 }
2724 /* Convert a compcode bit-based encoding of a comparison operator back
2725 to GCC's enum tree_code representation. This function is the
2726 inverse of comparison_to_compcode. */
2728 static enum tree_code
2730 {
2732 {
2763 }
2764 }
2766 /* Return a tree for the comparison which is the combination of
2767 doing the AND or OR (depending on CODE) of the two operations LCODE
2768 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2769 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2770 if this makes the transformation invalid. */
2772 tree
2777 {
2784 {
2795 }
2798 {
2799 /* Eliminate unordered comparisons, as well as LTGT and ORD
2800 which are not used unless the mode has NaNs. */
2806 }
2808 {
2809 /* Check that the original operation and the optimized ones will trap
2810 under the same condition. */
2821 /* In a short-circuited boolean expression the LHS might be
2822 such that the RHS, if evaluated, will never trap. For
2823 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2824 if neither x nor y is NaN. (This is a mixed blessing: for
2825 example, the expression above will never trap, hence
2826 optimizing it to x < y would be invalid). */
2831 /* If the comparison was short-circuited, and only the RHS
2832 trapped, we may now generate a spurious trap. */
2837 /* If we changed the conditions that cause a trap, we lose. */
2840 }
2846 else
2847 {
2852 }
2853 }
2854 \f
2855 /* Return nonzero if two operands (typically of the same tree node)
2856 are necessarily equal. FLAGS modifies behavior as follows:
2858 If OEP_ONLY_CONST is set, only return nonzero for constants.
2859 This function tests whether the operands are indistinguishable;
2860 it does not test whether they are equal using C's == operation.
2861 The distinction is important for IEEE floating point, because
2862 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2863 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2865 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2866 even though it may hold multiple values during a function.
2867 This is because a GCC tree node guarantees that nothing else is
2868 executed between the evaluation of its "operands" (which may often
2869 be evaluated in arbitrary order). Hence if the operands themselves
2870 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2871 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2872 unset means assuming isochronic (or instantaneous) tree equivalence.
2873 Unless comparing arbitrary expression trees, such as from different
2874 statements, this flag can usually be left unset.
2876 If OEP_PURE_SAME is set, then pure functions with identical arguments
2877 are considered the same. It is used when the caller has other ways
2878 to ensure that global memory is unchanged in between.
2880 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2881 not values of expressions.
2883 If OEP_LEXICOGRAPHIC is set, then also handle expressions with side-effects
2884 such as MODIFY_EXPR, RETURN_EXPR, as well as STATEMENT_LISTs.
2886 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2887 any operand with side effect. This is unnecesarily conservative in the
2888 case we know that arg0 and arg1 are in disjoint code paths (such as in
2889 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2890 addresses with TREE_CONSTANT flag set so we know that &var == &var
2891 even if var is volatile. */
2893 int
2895 {
2896 /* When checking, verify at the outermost operand_equal_p call that
2897 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
2898 hash value. */
2900 {
2902 {
2904 {
2911 }
2913 }
2914 else
2916 }
2918 /* If either is ERROR_MARK, they aren't equal. */
2924 /* Similar, if either does not have a type (like a released SSA name),
2925 they aren't equal. */
2929 /* We cannot consider pointers to different address space equal. */
2936 /* Check equality of integer constants before bailing out due to
2937 precision differences. */
2939 {
2940 /* Address of INTEGER_CST is not defined; check that we did not forget
2941 to drop the OEP_ADDRESS_OF flags. */
2944 }
2947 {
2948 /* If both types don't have the same signedness, then we can't consider
2949 them equal. We must check this before the STRIP_NOPS calls
2950 because they may change the signedness of the arguments. As pointers
2951 strictly don't have a signedness, require either two pointers or
2952 two non-pointers as well. */
2958 /* If both types don't have the same precision, then it is not safe
2959 to strip NOPs. */
2966 }
2967 #if 0
2968 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
2969 sanity check once the issue is solved. */
2970 else
2971 /* Addresses of conversions and SSA_NAMEs (and many other things)
2972 are not defined. Check that we did not forget to drop the
2973 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
2976 #endif
2978 /* In case both args are comparisons but with different comparison
2979 code, try to swap the comparison operands of one arg to produce
2980 a match and compare that variant. */
2984 {
2992 }
2995 {
2996 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
2998 ;
3000 {
3001 /* If we are interested in comparing addresses ignore
3002 MEM_REF wrappings of the base that can appear just for
3003 TBAA reasons. */
3017 }
3018 else
3020 }
3022 /* When not checking adddresses, this is needed for conversions and for
3023 COMPONENT_REF. Might as well play it safe and always test this. */
3030 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
3031 We don't care about side effects in that case because the SAVE_EXPR
3032 takes care of that for us. In all other cases, two expressions are
3033 equal if they have no side effects. If we have two identical
3034 expressions with side effects that should be treated the same due
3035 to the only side effects being identical SAVE_EXPR's, that will
3036 be detected in the recursive calls below.
3037 If we are taking an invariant address of two identical objects
3038 they are necessarily equal as well. */
3045 /* Next handle constant cases, those for which we can return 1 even
3046 if ONLY_CONST is set. */
3049 {
3063 {
3064 /* If we do not distinguish between signed and unsigned zero,
3065 consider them equal. */
3068 }
3072 {
3087 }
3091 flags)
3093 flags));
3104 flags | OEP_ADDRESS_OF
3107 /* In GIMPLE empty constructors are allowed in initializers of
3108 aggregates. */
3112 }
3117 /* Define macros to test an operand from arg0 and arg1 for equality and a
3118 variant that allows null and views null as being different from any
3119 non-null value. In the latter case, if either is null, the both
3120 must be; otherwise, do the normal comparison. */
3121 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
3122 TREE_OPERAND (arg1, N), flags)
3124 #define OP_SAME_WITH_NULL(N) \
3125 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
3126 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
3129 {
3131 /* Two conversions are equal only if signedness and modes match. */
3133 {
3134 CASE_CONVERT:
3142 }
3152 /* For commutative ops, allow the other order. */
3160 /* If either of the pointer (or reference) expressions we are
3161 dereferencing contain a side effect, these cannot be equal,
3162 but their addresses can be. */
3169 {
3179 /* Require the same offset. */
3185 /* Fallthru. */
3193 {
3194 /* Require equal access sizes */
3200 flags)))
3202 /* Verify that access happens in similar types. */
3205 /* Verify that accesses are TBAA compatible. */
3214 /* Verify that alignment is compatible. */
3218 }
3221 /* TARGET_MEM_REF require equal extra operands. */
3232 /* Compare the array index by value if it is constant first as we
3233 may have different types but same value here. */
3239 /* Compare low bound and element size as with OEP_ADDRESS_OF
3240 we have to account for the offset of the ref. */
3245 array_ref_low_bound
3249 array_ref_element_size
3251 flags))));
3254 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3255 may be NULL when we're called to compare MEM_EXPRs. */
3270 }
3274 {
3276 /* Be sure we pass right ADDRESS_OF flag. */
3294 /* The multiplcation operands are commutative. */
3295 /* FALLTHRU */
3303 /* Otherwise take into account this is a commutative operation. */
3316 /* BIT_INSERT_EXPR has an implict operand as the type precision
3317 of op1. Need to check to make sure they are the same. */
3323 /* FALLTHRU */
3348 }
3352 {
3356 /* If not both CALL_EXPRs are either internal or normal function
3357 functions, then they are not equal. */
3360 {
3361 /* If the CALL_EXPRs call different internal functions, then they
3362 are not equal. */
3365 }
3366 else
3367 {
3368 /* If the CALL_EXPRs call different functions, then they are not
3369 equal. */
3371 flags))
3373 }
3375 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3376 {
3380 else
3384 }
3386 /* Now see if all the arguments are the same. */
3387 {
3398 /* If we get here and both argument lists are exhausted
3399 then the CALL_EXPRs are equal. */
3401 }
3404 }
3407 /* Consider __builtin_sqrt equal to sqrt. */
3415 {
3416 /* In GIMPLE constructors are used only to build vectors from
3417 elements. Individual elements in the constructor must be
3418 indexed in increasing order and form an initial sequence.
3420 We make no effort to compare constructors in generic.
3421 (see sem_variable::equals in ipa-icf which can do so for
3422 constants). */
3427 /* Be sure that vectors constructed have the same representation.
3428 We only tested element precision and modes to match.
3429 Vectors may be BLKmode and thus also check that the number of
3430 parts match. */
3443 {
3448 /* In GIMPLE the indexes can be either NULL or matching i.
3449 Double check this so we won't get false
3450 positives for GENERIC. */
3458 }
3460 }
3463 {
3464 /* Compare the STATEMENT_LISTs. */
3470 {
3471 /* The lists don't have the same number of statements. */
3477 OEP_LEXICOGRAPHIC))
3479 }
3480 }
3485 {
3492 }
3496 }
3498 #undef OP_SAME
3499 #undef OP_SAME_WITH_NULL
3500 }
3501 \f
3502 /* Similar to operand_equal_p, but see if ARG0 might be a variant of ARG1
3503 with a different signedness or a narrower precision. */
3505 static bool
3507 {
3515 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3516 and see if the inner values are the same. This removes any
3517 signedness comparison, which doesn't matter here. */
3525 /* Discard a single widening conversion from ARG1 and see if the inner
3526 value is the same as ARG0. */
3535 }
3536 \f
3537 /* See if ARG is an expression that is either a comparison or is performing
3538 arithmetic on comparisons. The comparisons must only be comparing
3539 two different values, which will be stored in *CVAL1 and *CVAL2; if
3540 they are nonzero it means that some operands have already been found.
3541 No variables may be used anywhere else in the expression except in the
3542 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
3543 the expression and save_expr needs to be called with CVAL1 and CVAL2.
3545 If this is true, return 1. Otherwise, return zero. */
3547 static int
3549 {
3553 /* We can handle some of the tcc_expression cases here. */
3563 {
3564 /* If we've already found a CVAL1 or CVAL2, this expression is
3565 two complex to handle. */
3571 }
3574 {
3597 /* First see if we can handle the first operand, then the second. For
3598 the second operand, we know *CVAL1 can't be zero. It must be that
3599 one side of the comparison is each of the values; test for the
3600 case where this isn't true by failing if the two operands
3601 are the same. */
3610 ;
3614 ;
3615 else
3619 ;
3623 ;
3624 else
3631 }
3632 }
3633 \f
3634 /* ARG is a tree that is known to contain just arithmetic operations and
3635 comparisons. Evaluate the operations in the tree substituting NEW0 for
3636 any occurrence of OLD0 as an operand of a comparison and likewise for
3637 NEW1 and OLD1. */
3639 static tree
3642 {
3647 /* We can handle some of the tcc_expression cases here. */
3655 {
3670 {
3689 }
3690 /* Fall through - ??? */
3693 {
3697 /* We need to check both for exact equality and tree equality. The
3698 former will be true if the operand has a side-effect. In that
3699 case, we know the operand occurred exactly once. */
3712 }
3716 }
3717 }
3718 \f
3719 /* Return a tree for the case when the result of an expression is RESULT
3720 converted to TYPE and OMITTED was previously an operand of the expression
3721 but is now not needed (e.g., we folded OMITTED * 0).
3723 If OMITTED has side effects, we must evaluate it. Otherwise, just do
3724 the conversion of RESULT to TYPE. */
3726 tree
3728 {
3731 /* If the resulting operand is an empty statement, just return the omitted
3732 statement casted to void. */
3742 }
3744 /* Return a tree for the case when the result of an expression is RESULT
3745 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
3746 of the expression but are now not needed.
3748 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
3749 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
3750 evaluated before OMITTED2. Otherwise, if neither has side effects,
3751 just do the conversion of RESULT to TYPE. */
3753 tree
3756 {
3765 }
3767 \f
3768 /* Return a simplified tree node for the truth-negation of ARG. This
3769 never alters ARG itself. We assume that ARG is an operation that
3770 returns a truth value (0 or 1).
3772 FIXME: one would think we would fold the result, but it causes
3773 problems with the dominator optimizer. */
3775 static tree
3777 {
3782 /* If this is a comparison, we can simply invert it, except for
3783 floating-point non-equality comparisons, in which case we just
3784 enclose a TRUTH_NOT_EXPR around what we have. */
3787 {
3790 && flag_trapping_math
3804 }
3807 {
3826 /* Here we can invert either operand. We invert the first operand
3827 unless the second operand is a TRUTH_NOT_EXPR in which case our
3828 result is the XOR of the first operand with the inside of the
3829 negation of the second operand. */
3834 else
3857 {
3864 /* A COND_EXPR may have a throw as one operand, which
3865 then has void type. Just leave void operands
3866 as they are. */
3872 }
3884 CASE_CONVERT:
3888 /* fall through */
3910 }
3911 }
3913 /* Fold the truth-negation of ARG. This never alters ARG itself. We
3914 assume that ARG is an operation that returns a truth value (0 or 1
3915 for scalars, 0 or -1 for vectors). Return the folded expression if
3916 folding is successful. Otherwise, return NULL_TREE. */
3918 static tree
3920 {
3923 ? BIT_NOT_EXPR
3926 }
3928 /* Return a simplified tree node for the truth-negation of ARG. This
3929 never alters ARG itself. We assume that ARG is an operation that
3930 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
3932 tree
3934 {
3940 ? BIT_NOT_EXPR
3943 }
3944 \f
3945 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
3946 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
3947 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
3948 is the original memory reference used to preserve the alias set of
3949 the access. */
3951 static tree
3955 {
3958 /* Attempt not to lose the access path if possible. */
3960 {
3962 machine_mode nmode;
3964 tree noffset;
3974 && !reversep
3975 && !nreversep
3977 {
3980 }
3981 }
3990 {
3997 }
4012 }
4014 /* Optimize a bit-field compare.
4016 There are two cases: First is a compare against a constant and the
4017 second is a comparison of two items where the fields are at the same
4018 bit position relative to the start of a chunk (byte, halfword, word)
4019 large enough to contain it. In these cases we can avoid the shift
4020 implicit in bitfield extractions.
4022 For constants, we emit a compare of the shifted constant with the
4023 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
4024 compared. For two fields at the same position, we do the ANDs with the
4025 similar mask and compare the result of the ANDs.
4027 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
4028 COMPARE_TYPE is the type of the comparison, and LHS and RHS
4029 are the left and right operands of the comparison, respectively.
4031 If the optimization described above can be done, we return the resulting
4032 tree. Otherwise we return zero. */
4034 static tree
4037 {
4040 tree unsigned_type;
4043 scalar_int_mode nmode;
4048 tree mask;
4049 tree offset;
4051 /* Get all the information about the extractions being done. If the bit size
4052 if the same as the size of the underlying object, we aren't doing an
4053 extraction at all and so can do nothing. We also don't want to
4054 do anything if the inner expression is a PLACEHOLDER_EXPR since we
4055 then will no longer be able to replace it. */
4064 else
4065 {
4066 /* If this is not a constant, we can only do something if bit positions,
4067 sizes, signedness and storage order are the same. */
4068 rinner
4076 }
4078 /* Honor the C++ memory model and mimic what RTL expansion does. */
4082 {
4086 }
4088 /* See if we can find a mode to refer to this field. We should be able to,
4089 but fail if we can't. */
4097 /* Set signed and unsigned types of the precision of this mode for the
4098 shifts below. */
4101 /* Compute the bit position and size for the new reference and our offset
4102 within it. If the new reference is the same size as the original, we
4103 won't optimize anything, so return zero. */
4113 /* Make the mask to be used against the extracted field. */
4120 {
4124 /* If not comparing with constant, just rework the comparison
4125 and return. */
4133 }
4135 /* Otherwise, we are handling the constant case. See if the constant is too
4136 big for the field. Warn and return a tree for 0 (false) if so. We do
4137 this not only for its own sake, but to avoid having to test for this
4138 error case below. If we didn't, we might generate wrong code.
4140 For unsigned fields, the constant shifted right by the field length should
4141 be all zero. For signed fields, the high-order bits should agree with
4142 the sign bit. */
4145 {
4147 {
4151 }
4152 }
4153 else
4154 {
4157 {
4161 }
4162 }
4167 /* Single-bit compares should always be against zero. */
4169 {
4172 }
4174 /* Make a new bitfield reference, shift the constant over the
4175 appropriate number of bits and mask it with the computed mask
4176 (in case this was a signed field). If we changed it, make a new one. */
4184 mask);
4189 }
4190 \f
4191 /* Subroutine for fold_truth_andor_1: decode a field reference.
4193 If EXP is a comparison reference, we return the innermost reference.
4195 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4196 set to the starting bit number.
4198 If the innermost field can be completely contained in a mode-sized
4199 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4201 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4202 otherwise it is not changed.
4204 *PUNSIGNEDP is set to the signedness of the field.
4206 *PREVERSEP is set to the storage order of the field.
4208 *PMASK is set to the mask used. This is either contained in a
4209 BIT_AND_EXPR or derived from the width of the field.
4211 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4213 Return 0 if this is not a component reference or is one that we can't
4214 do anything with. */
4216 static tree
4221 {
4226 tree unsigned_type;
4229 /* All the optimizations using this function assume integer fields.
4230 There are problems with FP fields since the type_for_size call
4231 below can fail for, e.g., XFmode. */
4235 /* We are interested in the bare arrangement of bits, so strip everything
4236 that doesn't affect the machine mode. However, record the type of the
4237 outermost expression if it may matter below. */
4244 {
4250 }
4257 /* Reject out-of-bound accesses (PR79731). */
4265 /* If the number of bits in the reference is the same as the bitsize of
4266 the outer type, then the outer type gives the signedness. Otherwise
4267 (in case of a small bitfield) the signedness is unchanged. */
4271 /* Compute the mask to access the bitfield. */
4280 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4288 }
4290 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4291 bit positions and MASK is SIGNED. */
4293 static int
4295 {
4299 /* If this function returns true when the type of the mask is
4300 UNSIGNED, then there will be errors. In particular see
4301 gcc.c-torture/execute/990326-1.c. There does not appear to be
4302 any documentation paper trail as to why this is so. But the pre
4303 wide-int worked with that restriction and it has been preserved
4304 here. */
4309 }
4311 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4312 represents the sign bit of EXP's type. If EXP represents a sign
4313 or zero extension, also test VAL against the unextended type.
4314 The return value is the (sub)expression whose sign bit is VAL,
4315 or NULL_TREE otherwise. */
4317 tree
4319 {
4321 tree t;
4323 /* Tree EXP must have an integral type. */
4328 /* Tree VAL must be an integer constant. */
4337 /* Handle extension from a narrower type. */
4343 }
4345 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4346 to be evaluated unconditionally. */
4348 static int
4350 {
4351 /* Strip any conversions that don't change the machine mode. */
4360 /* Don't regard global variables as simple. They may be
4361 allocated in ways unknown to the compiler (shared memory,
4362 #pragma weak, etc). */
4365 /* Weakrefs are not safe to be read, since they can be NULL.
4366 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4367 have DECL_WEAK flag set. */
4369 /* Loading a static variable is unduly expensive, but global
4370 registers aren't expensive. */
4372 }
4374 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4375 to be evaluated unconditionally.
4376 I addition to simple_operand_p, we assume that comparisons, conversions,
4377 and logic-not operations are simple, if their operands are simple, too. */
4379 static bool
4381 {
4401 }
4403 \f
4404 /* The following functions are subroutines to fold_range_test and allow it to
4405 try to change a logical combination of comparisons into a range test.
4407 For example, both
4408 X == 2 || X == 3 || X == 4 || X == 5
4409 and
4410 X >= 2 && X <= 5
4411 are converted to
4412 (unsigned) (X - 2) <= 3
4414 We describe each set of comparisons as being either inside or outside
4415 a range, using a variable named like IN_P, and then describe the
4416 range with a lower and upper bound. If one of the bounds is omitted,
4417 it represents either the highest or lowest value of the type.
4419 In the comments below, we represent a range by two numbers in brackets
4420 preceded by a "+" to designate being inside that range, or a "-" to
4421 designate being outside that range, so the condition can be inverted by
4422 flipping the prefix. An omitted bound is represented by a "-". For
4423 example, "- [-, 10]" means being outside the range starting at the lowest
4424 possible value and ending at 10, in other words, being greater than 10.
4425 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4426 always false.
4428 We set up things so that the missing bounds are handled in a consistent
4429 manner so neither a missing bound nor "true" and "false" need to be
4430 handled using a special case. */
4432 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4433 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4434 and UPPER1_P are nonzero if the respective argument is an upper bound
4435 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4436 must be specified for a comparison. ARG1 will be converted to ARG0's
4437 type if both are specified. */
4439 static tree
4442 {
4443 tree tem;
4447 /* If neither arg represents infinity, do the normal operation.
4448 Else, if not a comparison, return infinity. Else handle the special
4449 comparison rules. Note that most of the cases below won't occur, but
4450 are handled for consistency. */
4453 {
4458 }
4463 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4464 for neither. In real maths, we cannot assume open ended ranges are
4465 the same. But, this is computer arithmetic, where numbers are finite.
4466 We can therefore make the transformation of any unbounded range with
4467 the value Z, Z being greater than any representable number. This permits
4468 us to treat unbounded ranges as equal. */
4472 {
4493 }
4496 }
4497 \f
4498 /* Helper routine for make_range. Perform one step for it, return
4499 new expression if the loop should continue or NULL_TREE if it should
4500 stop. */
4502 tree
4506 {
4512 {
4514 /* We can only do something if the range is testing for zero. */
4523 /* We can only do something if the range is testing for zero
4524 and if the second operand is an integer constant. Note that
4525 saying something is "in" the range we make is done by
4526 complementing IN_P since it will set in the initial case of
4527 being not equal to zero; "out" is leaving it alone. */
4534 {
4555 }
4557 /* If this is an unsigned comparison, we also know that EXP is
4558 greater than or equal to zero. We base the range tests we make
4559 on that fact, so we record it here so we can parse existing
4560 range tests. We test arg0_type since often the return type
4561 of, e.g. EQ_EXPR, is boolean. */
4563 {
4567 NULL_TREE))
4572 /* If the high bound is missing, but we have a nonzero low
4573 bound, reverse the range so it goes from zero to the low bound
4574 minus 1. */
4576 {
4581 }
4582 }
4590 /* If flag_wrapv and ARG0_TYPE is signed, make sure
4591 low and high are non-NULL, then normalize will DTRT. */
4594 {
4599 }
4601 /* (-x) IN [a,b] -> x in [-b, -a] */
4613 /* ~ X -> -X - 1 */
4622 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
4623 move a constant to the other side. */
4628 /* If EXP is signed, any overflow in the computation is undefined,
4629 so we don't worry about it so long as our computations on
4630 the bounds don't overflow. For unsigned, overflow is defined
4631 and this is exactly the right thing. */
4643 normalize:
4644 /* Check for an unsigned range which has wrapped around the maximum
4645 value thus making n_high < n_low, and normalize it. */
4647 {
4653 /* If the range is of the form +/- [ x+1, x ], we won't
4654 be able to normalize it. But then, it represents the
4655 whole range or the empty set, so make it
4656 +/- [ -, - ]. */
4660 else
4662 }
4663 else
4671 CASE_CONVERT:
4689 /* If we're converting arg0 from an unsigned type, to exp,
4690 a signed type, we will be doing the comparison as unsigned.
4691 The tests above have already verified that LOW and HIGH
4692 are both positive.
4694 So we have to ensure that we will handle large unsigned
4695 values the same way that the current signed bounds treat
4696 negative values. */
4699 {
4700 tree high_positive;
4701 tree equiv_type;
4702 /* For fixed-point modes, we need to pass the saturating flag
4703 as the 2nd parameter. */
4705 equiv_type
4708 else
4709 equiv_type
4712 /* A range without an upper bound is, naturally, unbounded.
4713 Since convert would have cropped a very large value, use
4714 the max value for the destination type. */
4715 high_positive
4722 high_positive),
4725 /* If the low bound is specified, "and" the range with the
4726 range for which the original unsigned value will be
4727 positive. */
4729 {
4732 integer_zero_node),
4733 high_positive))
4737 }
4738 else
4739 {
4740 /* Otherwise, "or" the range with the range of the input
4741 that will be interpreted as negative. */
4744 integer_zero_node),
4745 high_positive))
4749 }
4750 }
4759 }
4760 }
4762 /* Given EXP, a logical expression, set the range it is testing into
4763 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
4764 actually being tested. *PLOW and *PHIGH will be made of the same
4765 type as the returned expression. If EXP is not a comparison, we
4766 will most likely not be returning a useful value and range. Set
4767 *STRICT_OVERFLOW_P to true if the return value is only valid
4768 because signed overflow is undefined; otherwise, do not change
4769 *STRICT_OVERFLOW_P. */
4771 tree
4774 {
4782 /* Start with simply saying "EXP != 0" and then look at the code of EXP
4783 and see if we can refine the range. Some of the cases below may not
4784 happen, but it doesn't seem worth worrying about this. We "continue"
4785 the outer loop when we've changed something; otherwise we "break"
4786 the switch, which will "break" the while. */
4792 {
4798 {
4806 }
4815 }
4817 /* If EXP is a constant, we can evaluate whether this is true or false. */
4819 {
4826 }
4830 }
4832 /* Returns TRUE if [LOW, HIGH] range check can be optimized to
4833 a bitwise check i.e. when
4834 LOW == 0xXX...X00...0
4835 HIGH == 0xXX...X11...1
4836 Return corresponding mask in MASK and stem in VALUE. */
4838 static bool
4841 {
4864 }
4865 \f
4866 /* Helper routine for build_range_check and match.pd. Return the type to
4867 perform the check or NULL if it shouldn't be optimized. */
4869 tree
4871 {
4872 /* First make sure that arithmetics in this type is valid, then make sure
4873 that it wraps around. */
4879 {
4882 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
4883 for the type in question, as we rely on this here. */
4893 else
4895 }
4897 }
4899 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
4900 type, TYPE, return an expression to test if EXP is in (or out of, depending
4901 on IN_P) the range. Return 0 if the test couldn't be created. */
4903 tree
4906 {
4909 /* Disable this optimization for function pointer expressions
4910 on targets that require function pointer canonicalization. */
4917 {
4923 }
4945 value);
4948 {
4950 {
4954 }
4956 }
4958 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
4960 {
4964 {
4966 {
4969 etype
4971 else
4974 }
4977 }
4978 }
4980 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
4981 This requires wrap-around arithmetics for the type of the expression. */
5001 }
5002 \f
5003 /* Return the predecessor of VAL in its type, handling the infinite case. */
5005 static tree
5007 {
5013 else
5016 }
5018 /* Return the successor of VAL in its type, handling the infinite case. */
5020 static tree
5022 {
5028 else
5031 }
5033 /* Given two ranges, see if we can merge them into one. Return 1 if we
5034 can, 0 if we can't. Set the output range into the specified parameters. */
5036 bool
5039 {
5043 tree tem;
5053 /* Make range 0 be the range that starts first, or ends last if they
5054 start at the same value. Swap them if it isn't. */
5057 || (lowequal
5060 {
5064 }
5066 /* Now flag two cases, whether the ranges are disjoint or whether the
5067 second range is totally subsumed in the first. Note that the tests
5068 below are simplified by the ones above. */
5074 /* We now have four cases, depending on whether we are including or
5075 excluding the two ranges. */
5077 {
5078 /* If they don't overlap, the result is false. If the second range
5079 is a subset it is the result. Otherwise, the range is from the start
5080 of the second to the end of the first. */
5085 else
5087 }
5090 {
5091 /* If they don't overlap, the result is the first range. If they are
5092 equal, the result is false. If the second range is a subset of the
5093 first, and the ranges begin at the same place, we go from just after
5094 the end of the second range to the end of the first. If the second
5095 range is not a subset of the first, or if it is a subset and both
5096 ranges end at the same place, the range starts at the start of the
5097 first range and ends just before the second range.
5098 Otherwise, we can't describe this as a single range. */
5104 {
5109 {
5110 /* We are in the weird situation where high0 > high1 but
5111 high1 has no successor. Punt. */
5113 }
5114 }
5116 {
5121 {
5122 /* low0 < low1 but low1 has no predecessor. Punt. */
5124 }
5125 }
5126 else
5128 }
5131 {
5132 /* If they don't overlap, the result is the second range. If the second
5133 is a subset of the first, the result is false. Otherwise,
5134 the range starts just after the first range and ends at the
5135 end of the second. */
5140 else
5141 {
5146 {
5147 /* high1 > high0 but high0 has no successor. Punt. */
5149 }
5150 }
5151 }
5153 else
5154 {
5155 /* The case where we are excluding both ranges. Here the complex case
5156 is if they don't overlap. In that case, the only time we have a
5157 range is if they are adjacent. If the second is a subset of the
5158 first, the result is the first. Otherwise, the range to exclude
5159 starts at the beginning of the first range and ends at the end of the
5160 second. */
5162 {
5167 else
5168 {
5169 /* Canonicalize - [min, x] into - [-, x]. */
5172 {
5177 /* FALLTHROUGH */
5190 }
5192 /* Canonicalize - [x, max] into - [x, -]. */
5195 {
5200 /* FALLTHROUGH */
5216 }
5218 /* The ranges might be also adjacent between the maximum and
5219 minimum values of the given type. For
5220 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5221 return + [x + 1, y - 1]. */
5223 {
5230 }
5231 else
5233 }
5234 }
5237 else
5239 }
5243 }
5244 \f
5246 /* Subroutine of fold, looking inside expressions of the form
5247 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5248 of the COND_EXPR. This function is being used also to optimize
5249 A op B ? C : A, by reversing the comparison first.
5251 Return a folded expression whose code is not a COND_EXPR
5252 anymore, or NULL_TREE if no folding opportunity is found. */
5254 static tree
5257 {
5262 tree tem;
5267 /* If we have A op 0 ? A : -A, consider applying the following
5268 transformations:
5270 A == 0? A : -A same as -A
5271 A != 0? A : -A same as A
5272 A >= 0? A : -A same as abs (A)
5273 A > 0? A : -A same as abs (A)
5274 A <= 0? A : -A same as -abs (A)
5275 A < 0? A : -A same as -abs (A)
5277 None of these transformations work for modes with signed
5278 zeros. If A is +/-0, the first two transformations will
5279 change the sign of the result (from +0 to -0, or vice
5280 versa). The last four will fix the sign of the result,
5281 even though the original expressions could be positive or
5282 negative, depending on the sign of A.
5284 Note that all these transformations are correct if A is
5285 NaN, since the two alternatives (A and -A) are also NaNs. */
5292 /* In the case that A is of the form X-Y, '-A' (arg2) may
5293 have already been folded to Y-X, check for that. */
5301 {
5313 /* Fall through. */
5324 /* FALLTHRU */
5334 }
5336 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5337 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5338 both transformations are correct when A is NaN: A != 0
5339 is then true, and A == 0 is false. */
5343 {
5348 }
5350 /* Try some transformations of A op B ? A : B.
5352 A == B? A : B same as B
5353 A != B? A : B same as A
5354 A >= B? A : B same as max (A, B)
5355 A > B? A : B same as max (B, A)
5356 A <= B? A : B same as min (A, B)
5357 A < B? A : B same as min (B, A)
5359 As above, these transformations don't work in the presence
5360 of signed zeros. For example, if A and B are zeros of
5361 opposite sign, the first two transformations will change
5362 the sign of the result. In the last four, the original
5363 expressions give different results for (A=+0, B=-0) and
5364 (A=-0, B=+0), but the transformed expressions do not.
5366 The first two transformations are correct if either A or B
5367 is a NaN. In the first transformation, the condition will
5368 be false, and B will indeed be chosen. In the case of the
5369 second transformation, the condition A != B will be true,
5370 and A will be chosen.
5372 The conversions to max() and min() are not correct if B is
5373 a number and A is not. The conditions in the original
5374 expressions will be false, so all four give B. The min()
5375 and max() versions would give a NaN instead. */
5378 /* Avoid these transformations if the COND_EXPR may be used
5379 as an lvalue in the C++ front-end. PR c++/19199. */
5380 && (in_gimple_form
5386 {
5392 {
5401 /* In C++ a ?: expression can be an lvalue, so put the
5402 operand which will be used if they are equal first
5403 so that we can convert this back to the
5404 corresponding COND_EXPR. */
5406 {
5414 }
5421 {
5429 }
5442 }
5443 }
5446 }
5449 \f
5450 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5451 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5452 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5453 false) >= 2)
5454 #endif
5456 /* EXP is some logical combination of boolean tests. See if we can
5457 merge it into some range test. Return the new tree if so. */
5459 static tree
5462 {
5478 /* If this is an OR operation, invert both sides; we will invert
5479 again at the end. */
5483 /* If both expressions are the same, if we can merge the ranges, and we
5484 can build the range test, return it or it inverted. If one of the
5485 ranges is always true or always false, consider it to be the same
5486 expression as the other. */
5494 {
5498 }
5500 /* On machines where the branch cost is expensive, if this is a
5501 short-circuited branch and the underlying object on both sides
5502 is the same, make a non-short-circuit operation. */
5504 && !flag_sanitize_coverage
5509 {
5510 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5511 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5512 which cases we can't do this. */
5520 {
5529 {
5532 WARN_STRICT_OVERFLOW_COMPARISON);
5536 }
5537 }
5538 }
5541 }
5542 \f
5543 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5544 bit value. Arrange things so the extra bits will be set to zero if and
5545 only if C is signed-extended to its full width. If MASK is nonzero,
5546 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5548 static tree
5550 {
5553 tree temp;
5558 /* We work by getting just the sign bit into the low-order bit, then
5559 into the high-order bit, then sign-extend. We then XOR that value
5560 with C. */
5564 /* We must use a signed type in order to get an arithmetic right shift.
5565 However, we must also avoid introducing accidental overflows, so that
5566 a subsequent call to integer_zerop will work. Hence we must
5567 do the type conversion here. At this point, the constant is either
5568 zero or one, and the conversion to a signed type can never overflow.
5569 We could get an overflow if this conversion is done anywhere else. */
5578 /* If necessary, convert the type back to match the type of C. */
5583 }
5584 \f
5585 /* For an expression that has the form
5586 (A && B) || ~B
5587 or
5588 (A || B) && ~B,
5589 we can drop one of the inner expressions and simplify to
5590 A || ~B
5591 or
5592 A && ~B
5593 LOC is the location of the resulting expression. OP is the inner
5594 logical operation; the left-hand side in the examples above, while CMPOP
5595 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
5596 removing a condition that guards another, as in
5597 (A != NULL && A->...) || A == NULL
5598 which we must not transform. If RHS_ONLY is true, only eliminate the
5599 right-most operand of the inner logical operation. */
5601 static tree
5604 {
5622 {
5625 {
5628 }
5629 }
5631 {
5634 {
5637 }
5638 }
5653 }
5655 /* Find ways of folding logical expressions of LHS and RHS:
5656 Try to merge two comparisons to the same innermost item.
5657 Look for range tests like "ch >= '0' && ch <= '9'".
5658 Look for combinations of simple terms on machines with expensive branches
5659 and evaluate the RHS unconditionally.
5661 For example, if we have p->a == 2 && p->b == 4 and we can make an
5662 object large enough to span both A and B, we can do this with a comparison
5663 against the object ANDed with the a mask.
5665 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
5666 operations to do this with one comparison.
5668 We check for both normal comparisons and the BIT_AND_EXPRs made this by
5669 function and the one above.
5671 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
5672 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
5674 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
5675 two operands.
5677 We return the simplified tree or 0 if no optimization is possible. */
5679 static tree
5682 {
5683 /* If this is the "or" of two comparisons, we can do something if
5684 the comparisons are NE_EXPR. If this is the "and", we can do something
5685 if the comparisons are EQ_EXPR. I.e.,
5686 (a->b == 2 && a->c == 4) can become (a->new == NEW).
5688 WANTED_CODE is this operation code. For single bit fields, we can
5689 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
5690 comparison for one-bit fields. */
5711 /* Start by getting the comparison codes. Fail if anything is volatile.
5712 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
5713 it were surrounded with a NE_EXPR. */
5722 {
5726 }
5729 {
5733 }
5744 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
5747 {
5750 {
5755 }
5758 {
5764 }
5765 }
5770 /* If the RHS can be evaluated unconditionally and its operands are
5771 simple, it wins to evaluate the RHS unconditionally on machines
5772 with expensive branches. In this case, this isn't a comparison
5773 that can be merged. */
5780 {
5781 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
5792 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
5802 }
5804 /* See if the comparisons can be merged. Then get all the parameters for
5805 each side. */
5830 /* It must be true that the inner operation on the lhs of each
5831 comparison must be the same if we are to be able to do anything.
5832 Then see if we have constants. If not, the same must be true for
5833 the rhs's. */
5842 {
5845 }
5850 else
5853 /* If either comparison code is not correct for our logical operation,
5854 fail. However, we can convert a one-bit comparison against zero into
5855 the opposite comparison against that bit being set in the field. */
5859 {
5861 {
5862 /* Make the left operand unsigned, since we are only interested
5863 in the value of one bit. Otherwise we are doing the wrong
5864 thing below. */
5867 }
5868 else
5870 }
5872 /* This is analogous to the code for l_const above. */
5874 {
5876 {
5879 }
5880 else
5882 }
5884 /* See if we can find a mode that contains both fields being compared on
5885 the left. If we can't, fail. Otherwise, update all constants and masks
5886 to be relative to a field of that size. */
5900 {
5903 }
5911 {
5918 {
5922 }
5923 }
5925 {
5932 {
5936 }
5937 }
5939 /* If the right sides are not constant, do the same for it. Also,
5940 disallow this optimization if a size or signedness mismatch occurs
5941 between the left and right sides. */
5943 {
5946 /* Make sure the two fields on the right
5947 correspond to the left without being swapped. */
5964 {
5967 }
5976 /* Make a mask that corresponds to both fields being compared.
5977 Do this for both items being compared. If the operands are the
5978 same size and the bits being compared are in the same position
5979 then we can do this by masking both and comparing the masked
5980 results. */
5987 {
6001 }
6003 /* There is still another way we can do something: If both pairs of
6004 fields being compared are adjacent, we may be able to make a wider
6005 field containing them both.
6007 Note that we still must mask the lhs/rhs expressions. Furthermore,
6008 the mask must be shifted to account for the shift done by
6009 make_bit_field_ref. */
6018 {
6019 tree type;
6035 /* Convert to the smaller type before masking out unwanted bits. */
6038 {
6040 {
6044 }
6046 {
6050 }
6051 }
6060 }
6063 }
6065 /* Handle the case of comparisons with constants. If there is something in
6066 common between the masks, those bits of the constants must be the same.
6067 If not, the condition is always false. Test for this to avoid generating
6068 incorrect code below. */
6073 {
6075 {
6078 }
6079 else
6080 {
6083 }
6084 }
6089 /* Construct the expression we will return. First get the component
6090 reference we will make. Unless the mask is all ones the width of
6091 that field, perform the mask operation. Then compare with the
6092 merged constant. */
6103 }
6104 \f
6105 /* T is an integer expression that is being multiplied, divided, or taken a
6106 modulus (CODE says which and what kind of divide or modulus) by a
6107 constant C. See if we can eliminate that operation by folding it with
6108 other operations already in T. WIDE_TYPE, if non-null, is a type that
6109 should be used for the computation if wider than our type.
6111 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
6112 (X * 2) + (Y * 4). We must, however, be assured that either the original
6113 expression would not overflow or that overflow is undefined for the type
6114 in the language in question.
6116 If we return a non-null expression, it is an equivalent form of the
6117 original computation, but need not be in the original type.
6119 We set *STRICT_OVERFLOW_P to true if the return values depends on
6120 signed overflow being undefined. Otherwise we do not change
6121 *STRICT_OVERFLOW_P. */
6123 static tree
6126 {
6127 /* To avoid exponential search depth, refuse to allow recursion past
6128 three levels. Beyond that (1) it's highly unlikely that we'll find
6129 something interesting and (2) we've probably processed it before
6130 when we built the inner expression. */
6133 tree ret;
6138 depth++;
6140 depth--;
6143 }
6145 static tree
6148 {
6160 /* Don't deal with constants of zero here; they confuse the code below. */
6170 /* Note that we need not handle conditional operations here since fold
6171 already handles those cases. So just do arithmetic here. */
6173 {
6175 /* For a constant, we can always simplify if we are a multiply
6176 or (for divide and modulus) if it is a multiple of our constant. */
6180 {
6183 /* If the multiplication overflowed, we lost information on it.
6184 See PR68142 and PR69845. */
6188 }
6192 /* If op0 is an expression ... */
6198 /* ... and has wrapping overflow, and its type is smaller
6199 than ctype, then we cannot pass through as widening. */
6204 /* ... or this is a truncation (t is narrower than op0),
6205 then we cannot pass through this narrowing. */
6208 /* ... or signedness changes for division or modulus,
6209 then we cannot pass through this conversion. */
6213 /* ... or has undefined overflow while the converted to
6214 type has not, we cannot do the operation in the inner type
6215 as that would introduce undefined overflow. */
6221 /* Pass the constant down and see if we can make a simplification. If
6222 we can, replace this expression with the inner simplification for
6223 possible later conversion to our or some other type. */
6234 /* If widening the type changes it from signed to unsigned, then we
6235 must avoid building ABS_EXPR itself as unsigned. */
6237 {
6241 {
6244 }
6246 }
6247 /* If the constant is negative, we cannot simplify this. */
6250 /* FALLTHROUGH */
6252 /* For division and modulus, type can't be unsigned, as e.g.
6253 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6254 For signed types, even with wrapping overflow, this is fine. */
6263 /* If widening the type changes the signedness, then we can't perform
6264 this optimization as that changes the result. */
6268 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6274 {
6281 }
6285 /* If the second operand is constant, this is a multiplication
6286 or floor division, by a power of two, so we can treat it that
6287 way unless the multiplier or divisor overflows. Signed
6288 left-shift overflow is implementation-defined rather than
6289 undefined in C90, so do not convert signed left shift into
6290 multiplication. */
6293 /* const_binop may not detect overflow correctly,
6294 so check for it explicitly here. */
6303 ctype,
6305 t1),
6310 /* See if we can eliminate the operation on both sides. If we can, we
6311 can return a new PLUS or MINUS. If we can't, the only remaining
6312 cases where we can do anything are if the second operand is a
6313 constant. */
6320 /* If not multiplication, we can only do this if both operands
6321 are divisible by c. */
6324 {
6329 }
6331 /* If this was a subtraction, negate OP1 and set it to be an addition.
6332 This simplifies the logic below. */
6334 {
6336 /* If OP1 was not easily negatable, the constant may be OP0. */
6338 {
6341 }
6342 }
6347 /* If either OP1 or C are negative, this optimization is not safe for
6348 some of the division and remainder types while for others we need
6349 to change the code. */
6351 {
6359 }
6361 /* If it's a multiply or a division/modulus operation of a multiple
6362 of our constant, do the operation and verify it doesn't overflow. */
6366 {
6369 /* We allow the constant to overflow with wrapping semantics. */
6373 }
6374 else
6377 /* If we have an unsigned type, we cannot widen the operation since it
6378 will change the result if the original computation overflowed. */
6382 /* The last case is if we are a multiply. In that case, we can
6383 apply the distributive law to commute the multiply and addition
6384 if the multiplication of the constants doesn't overflow
6385 and overflow is defined. With undefined overflow
6386 op0 * c might overflow, while (op0 + orig_op1) * c doesn't. */
6392 op1);
6397 /* We have a special case here if we are doing something like
6398 (C * 8) % 4 since we know that's zero. */
6401 /* If the multiplication can overflow we cannot optimize this. */
6406 {
6409 }
6411 /* ... fall through ... */
6415 /* If we can extract our operation from the LHS, do so and return a
6416 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6417 do something only if the second operand is a constant. */
6433 /* If these are the same operation types, we can associate them
6434 assuming no overflow. */
6436 {
6451 }
6453 /* If these operations "cancel" each other, we have the main
6454 optimizations of this pass, which occur when either constant is a
6455 multiple of the other, in which case we replace this with either an
6456 operation or CODE or TCODE.
6458 If we have an unsigned type, we cannot do this since it will change
6459 the result if the original computation overflowed. */
6466 {
6469 {
6476 }
6479 {
6486 }
6487 }
6492 }
6495 }
6496 \f
6497 /* Return a node which has the indicated constant VALUE (either 0 or
6498 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6499 and is of the indicated TYPE. */
6501 tree
6503 {
6512 else
6514 }
6517 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6518 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6519 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6520 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6521 COND is the first argument to CODE; otherwise (as in the example
6522 given here), it is the second argument. TYPE is the type of the
6523 original expression. Return NULL_TREE if no simplification is
6524 possible. */
6526 static tree
6531 {
6541 {
6545 /* If this operand throws an expression, then it does not make
6546 sense to try to perform a logical or arithmetic operation
6547 involving it. */
6552 }
6555 {
6560 }
6561 else
6562 /* Detect the case of mixing vector and scalar types - bail out. */
6568 /* This transformation is only worthwhile if we don't have to wrap ARG
6569 in a SAVE_EXPR and the operation can be simplified without recursing
6570 on at least one of the branches once its pushed inside the COND_EXPR. */
6579 {
6583 else
6585 }
6587 {
6591 else
6593 }
6595 /* Check that we have simplified at least one of the branches. */
6600 }
6602 \f
6603 /* Subroutine of fold() that checks for the addition of +/- 0.0.
6605 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
6606 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
6607 ADDEND is the same as X.
6609 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
6610 and finite. The problematic cases are when X is zero, and its mode
6611 has signed zeros. In the case of rounding towards -infinity,
6612 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
6613 modes, X + 0 is not the same as X because -0 + 0 is 0. */
6615 bool
6617 {
6621 /* Don't allow the fold with -fsignaling-nans. */
6625 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
6629 /* In a vector or complex, we would need to check the sign of all zeros. */
6633 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
6637 /* The mode has signed zeros, and we have to honor their sign.
6638 In this situation, there is only one case we can return true for.
6639 X - 0 is the same as X unless rounding towards -infinity is
6640 supported. */
6642 }
6644 /* Subroutine of match.pd that optimizes comparisons of a division by
6645 a nonzero integer constant against an integer constant, i.e.
6646 X/C1 op C2.
6648 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
6649 GE_EXPR or LE_EXPR. ARG01 and ARG1 must be a INTEGER_CST. */
6651 enum tree_code
6654 {
6659 /* We have to do this the hard way to detect unsigned overflow.
6660 prod = int_const_binop (MULT_EXPR, c1, c2); */
6666 {
6670 /* Likewise *hi = int_const_binop (PLUS_EXPR, prod, tmp). */
6673 }
6675 {
6678 {
6697 }
6698 }
6699 else
6700 {
6701 /* A negative divisor reverses the relational operators. */
6706 {
6725 }
6726 }
6739 }
6742 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6743 equality/inequality test, then return a simplified form of the test
6744 using a sign testing. Otherwise return NULL. TYPE is the desired
6745 result type. */
6747 static tree
6750 tree result_type)
6751 {
6752 /* If this is testing a single bit, we can optimize the test. */
6756 {
6757 /* If we have (A & C) != 0 where C is the sign bit of A, convert
6758 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
6762 /* This is only a win if casting to a signed type is cheap,
6763 i.e. when arg00's type is not a partial mode. */
6765 {
6768 result_type,
6771 }
6772 }
6775 }
6777 /* If CODE with arguments ARG0 and ARG1 represents a single bit
6778 equality/inequality test, then return a simplified form of
6779 the test using shifts and logical operations. Otherwise return
6780 NULL. TYPE is the desired result type. */
6782 tree
6785 {
6786 /* If this is testing a single bit, we can optimize the test. */
6790 {
6799 /* First, see if we can fold the single bit test into a sign-bit
6800 test. */
6802 result_type);
6806 /* Otherwise we have (A & C) != 0 where C is a single bit,
6807 convert that into ((A >> C2) & 1). Where C2 = log2(C).
6808 Similarly for (A & C) == 0. */
6810 /* If INNER is a right shift of a constant and it plus BITNUM does
6811 not overflow, adjust BITNUM and INNER. */
6817 {
6820 }
6822 /* If we are going to be able to omit the AND below, we must do our
6823 operations as unsigned. If we must use the AND, we have a choice.
6824 Normally unsigned is faster, but for some machines signed is. */
6842 /* Put the AND last so it can combine with more things. */
6845 /* Make sure to return the proper type. */
6849 }
6851 }
6853 /* Test whether it is preferable two swap two operands, ARG0 and
6854 ARG1, for example because ARG0 is an integer constant and ARG1
6855 isn't. */
6857 bool
6859 {
6873 /* It is preferable to swap two SSA_NAME to ensure a canonical form
6874 for commutative and comparison operators. Ensuring a canonical
6875 form allows the optimizers to find additional redundancies without
6876 having to explicitly check for both orderings. */
6882 /* Put SSA_NAMEs last. */
6888 /* Put variables last. */
6895 }
6898 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
6899 means A >= Y && A != MAX, but in this case we know that
6900 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
6902 static tree
6904 {
6911 else
6920 {
6923 }
6925 {
6928 }
6929 else
6936 {
6937 /* Convert the pointer types into integer before taking the difference. */
6941 }
6942 else
6949 }
6951 /* Fold a sum or difference of at least one multiplication.
6952 Returns the folded tree or NULL if no simplification could be made. */
6954 static tree
6957 {
6961 /* (A * C) +- (B * C) -> (A+-B) * C.
6962 (A * C) +- A -> A * (C+-1).
6963 We are most concerned about the case where C is a constant,
6964 but other combinations show up during loop reduction. Since
6965 it is not difficult, try all four possibilities. */
6968 {
6971 }
6973 {
6976 }
6977 else
6978 {
6979 /* We cannot generate constant 1 for fract. */
6984 }
6986 {
6989 }
6991 {
6993 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
6994 the purpose of this canonicalization. */
6998 {
7001 }
7002 else
7004 }
7005 else
7006 {
7007 /* We cannot generate constant 1 for fract. */
7012 }
7015 /* Prefer factoring a common non-constant. */
7025 /* No identical multiplicands; see if we can find a common
7026 power-of-two factor in non-power-of-two multiplies. This
7027 can help in multi-dimensional array access. */
7030 {
7033 tree maybe_same;
7037 /* Move min of absolute values to int11. */
7039 {
7044 }
7045 else
7049 /* The remainder should not be a constant, otherwise we
7050 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7051 increased the number of multiplications necessary. */
7053 {
7061 }
7062 }
7069 /* We are neither factoring zero nor minus one. */
7077 /* Same may be zero and thus the operation 'code' may overflow. Likewise
7078 same may be minus one and thus the multiplication may overflow. Perform
7079 the operations in an unsigned type. */
7084 /* If the sum evaluated to a constant that is not -INF the multiplication
7085 cannot overflow. */
7095 }
7097 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7098 specified by EXPR into the buffer PTR of length LEN bytes.
7099 Return the number of bytes placed in the buffer, or zero
7100 upon failure. */
7102 static int
7104 {
7116 /* Dry run. */
7122 {
7124 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7125 number of bytes. */
7129 {
7136 else
7138 }
7139 else
7143 }
7145 }
7148 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7149 specified by EXPR into the buffer PTR of length LEN bytes.
7150 Return the number of bytes placed in the buffer, or zero
7151 upon failure. */
7153 static int
7155 {
7159 FIXED_VALUE_TYPE value;
7174 }
7177 /* Subroutine of native_encode_expr. Encode the REAL_CST
7178 specified by EXPR into the buffer PTR of length LEN bytes.
7179 Return the number of bytes placed in the buffer, or zero
7180 upon failure. */
7182 static int
7184 {
7190 /* There are always 32 bits in each long, no matter the size of
7191 the hosts long. We handle floating point representations with
7192 up to 192 bits. */
7201 /* Dry run. */
7210 {
7215 {
7222 else
7224 }
7225 else
7226 {
7229 {
7230 /* Reverse bytes within each long, or within the entire float
7231 if it's smaller than a long (for HFmode). */
7234 }
7235 }
7240 }
7242 }
7244 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7245 specified by EXPR into the buffer PTR of length LEN bytes.
7246 Return the number of bytes placed in the buffer, or zero
7247 upon failure. */
7249 static int
7251 {
7253 tree part;
7267 }
7270 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7271 specified by EXPR into the buffer PTR of length LEN bytes.
7272 Return the number of bytes placed in the buffer, or zero
7273 upon failure. */
7275 static int
7277 {
7287 {
7289 {
7292 }
7303 }
7305 }
7308 /* Subroutine of native_encode_expr. Encode the STRING_CST
7309 specified by EXPR into the buffer PTR of length LEN bytes.
7310 Return the number of bytes placed in the buffer, or zero
7311 upon failure. */
7313 static int
7315 {
7318 /* Wide-char strings are encoded in target byte-order so native
7319 encoding them is trivial. */
7334 {
7337 {
7340 }
7343 }
7344 else
7347 }
7350 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7351 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7352 buffer PTR of length LEN bytes. If PTR is NULL, don't actually store
7353 anything, just do a dry run. If OFF is not -1 then start
7354 the encoding at byte offset OFF and encode at most LEN bytes.
7355 Return the number of bytes placed in the buffer, or zero upon failure. */
7357 int
7359 {
7360 /* We don't support starting at negative offset and -1 is special. */
7365 {
7386 }
7387 }
7390 /* Subroutine of native_interpret_expr. Interpret the contents of
7391 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
7392 If the buffer cannot be interpreted, return NULL_TREE. */
7394 static tree
7396 {
7406 }
7409 /* Subroutine of native_interpret_expr. Interpret the contents of
7410 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
7411 If the buffer cannot be interpreted, return NULL_TREE. */
7413 static tree
7415 {
7418 double_int result;
7419 FIXED_VALUE_TYPE fixed_value;
7429 }
7432 /* Subroutine of native_interpret_expr. Interpret the contents of
7433 the buffer PTR of length LEN as a REAL_CST of type TYPE.
7434 If the buffer cannot be interpreted, return NULL_TREE. */
7436 static tree
7438 {
7442 /* There are always 32 bits in each long, no matter the size of
7443 the hosts long. We handle floating point representations with
7444 up to 192 bits. */
7445 REAL_VALUE_TYPE r;
7455 {
7456 /* Both OFFSET and BYTE index within a long;
7457 bitpos indexes the whole float. */
7460 {
7467 else
7469 }
7470 else
7471 {
7474 {
7475 /* Reverse bytes within each long, or within the entire float
7476 if it's smaller than a long (for HFmode). */
7479 }
7480 }
7484 }
7488 }
7491 /* Subroutine of native_interpret_expr. Interpret the contents of
7492 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
7493 If the buffer cannot be interpreted, return NULL_TREE. */
7495 static tree
7497 {
7512 }
7515 /* Subroutine of native_interpret_expr. Interpret the contents of
7516 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
7517 If the buffer cannot be interpreted, return NULL_TREE. */
7519 static tree
7521 {
7533 {
7538 }
7540 }
7543 /* Subroutine of fold_view_convert_expr. Interpret the contents of
7544 the buffer PTR of length LEN as a constant of type TYPE. For
7545 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
7546 we return a REAL_CST, etc... If the buffer cannot be interpreted,
7547 return NULL_TREE. */
7549 tree
7551 {
7553 {
7575 }
7576 }
7578 /* Returns true if we can interpret the contents of a native encoding
7579 as TYPE. */
7581 static bool
7583 {
7585 {
7598 }
7599 }
7602 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
7603 TYPE at compile-time. If we're unable to perform the conversion
7604 return NULL_TREE. */
7606 static tree
7608 {
7609 /* We support up to 512-bit values (for V8DFmode). */
7613 /* Check that the host and target are sane. */
7622 }
7624 /* Build an expression for the address of T. Folds away INDIRECT_REF
7625 to avoid confusing the gimplify process. */
7627 tree
7629 {
7630 /* The size of the object is not relevant when talking about its address. */
7635 {
7640 }
7650 {
7655 }
7656 else
7660 }
7662 /* Build an expression for the address of T. */
7664 tree
7666 {
7670 }
7672 /* Fold a unary expression of code CODE and type TYPE with operand
7673 OP0. Return the folded expression if folding is successful.
7674 Otherwise, return NULL_TREE. */
7676 tree
7678 {
7679 tree tem;
7680 tree arg0;
7688 {
7691 {
7692 /* Don't use STRIP_NOPS, because signedness of argument type
7693 matters. */
7695 }
7696 else
7697 {
7698 /* Strip any conversions that don't change the mode. This
7699 is safe for every expression, except for a comparison
7700 expression because its signedness is derived from its
7701 operands.
7703 Note that this is done as an internal manipulation within
7704 the constant folder, in order to find the simplest
7705 representation of the arguments so that their form can be
7706 studied. In any cases, the appropriate type conversions
7707 should be put back in the tree that will get out of the
7708 constant folder. */
7710 }
7713 {
7716 {
7720 }
7721 }
7722 }
7729 {
7736 {
7750 /* If this was a conversion, and all we did was to move into
7751 inside the COND_EXPR, bring it back out. But leave it if
7752 it is a conversion from integer to integer and the
7753 result precision is no wider than a word since such a
7754 conversion is cheap and may be optimized away by combine,
7755 while it couldn't if it were outside the COND_EXPR. Then return
7756 so we don't get into an infinite recursion loop taking the
7757 conversion out and then back in. */
7769 && (INTEGRAL_TYPE_P
7782 }
7783 }
7786 {
7792 CASE_CONVERT:
7796 {
7797 /* If we have (type) (a CMP b) and type is an integral type, return
7798 new expression involving the new type. Canonicalize
7799 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
7800 non-integral type.
7801 Do not fold the result as that would not simplify further, also
7802 folding again results in recursions. */
7812 }
7814 /* Handle (T *)&A.B.C for A being of type T and B and C
7815 living at offset zero. This occurs frequently in
7816 C++ upcasting and then accessing the base. */
7820 {
7822 tree offset;
7823 machine_mode mode;
7825 tree base
7829 /* If the reference was to a (constant) zero offset, we can use
7830 the address of the base if it has the same base type
7831 as the result type and the pointer type is unqualified. */
7838 }
7842 /* Detect assigning a bitfield. */
7844 && DECL_BIT_FIELD
7846 {
7847 /* Don't leave an assignment inside a conversion
7848 unless assigning a bitfield. */
7850 /* First do the assignment, then return converted constant. */
7855 }
7857 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
7858 constants (if x has signed type, the sign bit cannot be set
7859 in c). This folds extension into the BIT_AND_EXPR.
7860 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
7861 very likely don't have maximal range for their precision and this
7862 transformation effectively doesn't preserve non-maximal ranges. */
7866 {
7877 <= HOST_BITS_PER_WIDE_INT
7879 {
7883 cst &= HOST_WIDE_INT_M1U
7887 && !flag_syntax_only
7890 {
7894 }
7895 }
7897 {
7902 }
7903 }
7905 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
7906 cast (T1)X will fold away. We assume that this happens when X itself
7907 is a cast. */
7911 {
7915 return fold_build_pointer_plus_loc
7917 }
7919 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
7920 of the same precision, and X is an integer type not narrower than
7921 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
7927 {
7933 }
7935 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
7936 type of X and Y (integer types only). */
7941 {
7942 /* Be careful not to introduce new overflows. */
7943 tree mult_type;
7946 else
7950 {
7957 }
7958 }
7964 {
7971 }
7982 /* Convert fabs((double)float) into (double)fabsf(float). */
7985 {
7991 targ0));
7992 }
7996 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8015 /* Note that the operand of this must be an int
8016 and its values must be 0 or 1.
8017 ("true" is a fixed value perhaps depending on the language,
8018 but we don't handle values other than 1 correctly yet.) */
8025 /* Fold *&X to X if X is an lvalue. */
8027 {
8034 }
8040 }
8043 /* If the operation was a conversion do _not_ mark a resulting constant
8044 with TREE_OVERFLOW if the original constant was not. These conversions
8045 have implementation defined behavior and retaining the TREE_OVERFLOW
8046 flag here would confuse later passes such as VRP. */
8047 tree
8050 {
8059 }
8061 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8062 operands OP0 and OP1. LOC is the location of the resulting expression.
8063 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8064 Return the folded expression if folding is successful. Otherwise,
8065 return NULL_TREE. */
8066 static tree
8069 {
8070 tree tem;
8072 /* We only do these simplifications if we are optimizing. */
8076 /* Check for things like (A || B) && (A || C). We can convert this
8077 to A || (B && C). Note that either operator can be any of the four
8078 truth and/or operations and the transformation will still be
8079 valid. Also note that we only care about order for the
8080 ANDIF and ORIF operators. If B contains side effects, this
8081 might change the truth-value of A. */
8088 {
8108 /* This case if tricky because we must either have commutative
8109 operators or else A10 must not have side-effects. */
8115 a01);
8116 }
8118 /* See if we can build a range comparison. */
8124 {
8128 }
8132 {
8136 }
8138 /* Check for the possibility of merging component references. If our
8139 lhs is another similar operation, try to merge its rhs with our
8140 rhs. Then try to merge our lhs and rhs. */
8150 && !flag_sanitize_coverage
8155 {
8162 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
8163 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
8164 We don't want to pack more than two leafs to a non-IF AND/OR
8165 expression.
8166 If tree-code of left-hand operand isn't an AND/OR-IF code and not
8167 equal to IF-CODE, then we don't want to add right-hand operand.
8168 If the inner right-hand side of left-hand operand has
8169 side-effects, or isn't simple, then we can't add to it,
8170 as otherwise we might destroy if-sequence. */
8173 /* Needed for sequence points to handle trappings, and
8174 side-effects. */
8176 {
8178 arg1);
8180 tem);
8181 }
8182 /* Same as above but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
8183 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
8186 /* Needed for sequence points to handle trappings, and
8187 side-effects. */
8189 {
8194 }
8195 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
8196 into (A OR B).
8197 For sequence point consistancy, we need to check for trapping,
8198 and side-effects. */
8202 }
8205 }
8207 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
8208 by changing CODE to reduce the magnitude of constants involved in
8209 ARG0 of the comparison.
8210 Returns a canonicalized comparison tree if a simplification was
8211 possible, otherwise returns NULL_TREE.
8212 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
8213 valid if signed overflow is undefined. */
8215 static tree
8219 {
8224 /* Match A +- CST code arg1. We can change this only if overflow
8225 is undefined. */
8228 /* In principle pointers also have undefined overflow behavior,
8229 but that causes problems elsewhere. */
8236 /* Identify the constant in arg0 and its sign. */
8240 /* Overflowed constants and zero will cause problems. */
8245 /* See if we can reduce the magnitude of the constant in
8246 arg0 by changing the comparison code. */
8247 /* A - CST < arg1 -> A - CST-1 <= arg1. */
8251 /* A + CST > arg1 -> A + CST-1 >= arg1. */
8255 /* A + CST <= arg1 -> A + CST-1 < arg1. */
8259 /* A - CST >= arg1 -> A - CST-1 > arg1. */
8263 else
8267 /* Now build the constant reduced in magnitude. But not if that
8268 would produce one outside of its types range. */
8284 }
8286 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
8287 overflow further. Try to decrease the magnitude of constants involved
8288 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
8289 and put sole constants at the second argument position.
8290 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
8292 static tree
8295 {
8296 tree t;
8301 /* Try canonicalization by simplifying arg0. */
8306 {
8310 }
8312 /* Try canonicalization by simplifying arg1 using the swapped
8313 comparison. */
8321 }
8323 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
8324 space. This is used to avoid issuing overflow warnings for
8325 expressions like &p->x which can not wrap. */
8327 static bool
8329 {
8336 poly_wide_int wi_offset;
8342 else
8347 precision);
8362 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
8363 array. */
8372 }
8374 /* Return a positive integer when the symbol DECL is known to have
8375 a nonzero address, zero when it's known not to (e.g., it's a weak
8376 symbol), and a negative integer when the symbol is not yet in the
8377 symbol table and so whether or not its address is zero is unknown.
8378 For function local objects always return positive integer. */
8379 static int
8381 {
8386 /* Function local objects are never NULL. */
8394 }
8396 /* Subroutine of fold_binary. This routine performs all of the
8397 transformations that are common to the equality/inequality
8398 operators (EQ_EXPR and NE_EXPR) and the ordering operators
8399 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
8400 fold_binary should call fold_binary. Fold a comparison with
8401 tree code CODE and type TYPE with operands OP0 and OP1. Return
8402 the folded comparison or NULL_TREE. */
8404 static tree
8407 {
8417 /* For comparisons of pointers we can decompose it to a compile time
8418 comparison of the base objects and the offsets into the object.
8419 This requires at least one operand being an ADDR_EXPR or a
8420 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
8426 {
8429 machine_mode mode;
8433 /* Get base and offset for the access. Strip ADDR_EXPR for
8434 get_inner_reference, but put it back by stripping INDIRECT_REF
8435 off the base object if possible. indirect_baseN will be true
8436 if baseN is not an address but refers to the object itself. */
8439 {
8440 base0
8446 else
8448 }
8450 {
8454 {
8455 base0
8461 else
8463 }
8466 else
8470 {
8476 {
8479 }
8480 }
8481 }
8485 {
8486 base1
8492 else
8494 }
8496 {
8500 {
8501 base1
8507 else
8509 }
8512 else
8516 {
8522 {
8525 }
8526 }
8527 }
8529 /* If we have equivalent bases we might be able to simplify. */
8533 {
8534 /* We can fold this expression to a constant if the non-constant
8535 offset parts are equal. */
8539 {
8545 "occur when comparing P +- C1 with "
8547 WARN_STRICT_OVERFLOW_CONDITIONAL);
8550 {
8564 }
8565 }
8566 /* We can simplify the comparison to a comparison of the variable
8567 offset parts if the constant offset parts are equal.
8568 Be careful to use signed sizetype here because otherwise we
8569 mess with array offsets in the wrong way. This is possible
8570 because pointer arithmetic is restricted to retain within an
8571 object and overflow on pointer differences is undefined as of
8572 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
8574 {
8575 /* By converting to signed sizetype we cover middle-end pointer
8576 arithmetic which operates on unsigned pointer types of size
8577 type size and ARRAY_REF offsets which are properly sign or
8578 zero extended from their type in case it is narrower than
8579 sizetype. */
8582 else
8586 else
8593 "occur when comparing P +- C1 with "
8595 WARN_STRICT_OVERFLOW_COMPARISON);
8598 }
8599 }
8600 /* For equal offsets we can simplify to a comparison of the
8601 base addresses. */
8603 && (indirect_base0
8605 && (indirect_base1
8610 {
8616 }
8617 /* Comparison between an ordinary (non-weak) symbol and a null
8618 pointer can be eliminated since such symbols must have a non
8619 null address. In C, relational expressions between pointers
8620 to objects and null pointers are undefined. The results
8621 below follow the C++ rules with the additional property that
8622 every object pointer compares greater than a null pointer.
8623 */
8626 /* Avoid folding references to struct members at offset 0 to
8627 prevent tests like '&ptr->firstmember == 0' from getting
8628 eliminated. When ptr is null, although the -> expression
8629 is strictly speaking invalid, GCC retains it as a matter
8630 of QoI. See PR c/44555. */
8633 && indirect_base0
8634 /* The caller guarantees that when one of the arguments is
8635 constant (i.e., null in this case) it is second. */
8637 {
8639 {
8650 }
8651 }
8652 }
8654 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
8655 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
8656 the resulting offset is smaller in absolute value than the
8657 original one and has the same sign. */
8666 {
8671 tree cst;
8673 "occur when combining constants around "
8676 /* Put the constant on the side where it doesn't overflow and is
8677 of lower absolute value and of same sign than before. */
8684 {
8687 variable1,
8691 }
8699 {
8705 variable2);
8706 }
8707 }
8713 /* If we are comparing an expression that just has comparisons
8714 of two integer values, arithmetic expressions of those comparisons,
8715 and constants, we can simplify it. There are only three cases
8716 to check: the two values can either be equal, the first can be
8717 greater, or the second can be greater. Fold the expression for
8718 those three values. Since each value must be 0 or 1, we have
8719 eight possibilities, each of which corresponds to the constant 0
8720 or 1 or one of the six possible comparisons.
8722 This handles common cases like (a > b) == 0 but also handles
8723 expressions like ((x > y) - (y > x)) > 0, which supposedly
8724 occur in macroized code. */
8727 {
8732 /* Don't handle degenerate cases here; they should already
8733 have been handled anyway. */
8742 {
8746 /* We can't just pass T to eval_subst in case cval1 or cval2
8747 was the same as ARG1. */
8749 tree high_result
8753 arg1);
8754 tree equal_result
8758 arg1);
8759 tree low_result
8763 arg1);
8765 /* All three of these results should be 0 or 1. Confirm they are.
8766 Then use those values to select the proper code to use. */
8771 {
8772 /* Make a 3-bit mask with the high-order bit being the
8773 value for `>', the next for '=', and the low for '<'. */
8777 {
8779 /* Always false. */
8800 /* Always true. */
8802 }
8805 {
8809 }
8811 }
8812 }
8813 }
8816 }
8819 /* Subroutine of fold_binary. Optimize complex multiplications of the
8820 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
8821 argument EXPR represents the expression "z" of type TYPE. */
8823 static tree
8825 {
8830 {
8833 }
8835 {
8838 }
8839 else
8840 {
8844 }
8853 }
8856 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
8857 CONSTRUCTOR ARG into array ELTS, which has NELTS elements, and return
8858 true if successful. */
8860 static bool
8862 {
8866 {
8869 }
8871 {
8877 else
8879 }
8880 else
8886 }
8888 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
8889 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
8890 NULL_TREE otherwise. */
8892 static tree
8894 {
8913 {
8917 }
8920 {
8926 }
8927 else
8929 }
8931 /* Try to fold a pointer difference of type TYPE two address expressions of
8932 array references AREF0 and AREF1 using location LOC. Return a
8933 simplified expression for the difference or NULL_TREE. */
8935 static tree
8939 {
8944 /* If the bases are array references as well, recurse. If the bases
8945 are pointer indirections compute the difference of the pointers.
8946 If the bases are equal, we are set. */
8949 && (base_offset
8951 use_pointer_diff)))
8954 && (base_offset
8955 = use_pointer_diff
8965 {
8971 base_offset,
8974 }
8976 }
8978 /* If the real or vector real constant CST of type TYPE has an exact
8979 inverse, return it, else return NULL. */
8981 tree
8983 {
8984 REAL_VALUE_TYPE r;
8985 tree unit_type;
8986 machine_mode mode;
8989 {
8999 {
9003 tree_vector_builder elts;
9008 {
9013 }
9016 }
9020 }
9021 }
9023 /* Mask out the tz least significant bits of X of type TYPE where
9024 tz is the number of trailing zeroes in Y. */
9025 static wide_int
9027 {
9032 }
9034 /* Return true when T is an address and is known to be nonzero.
9035 For floating point we further ensure that T is not denormal.
9036 Similar logic is present in nonzero_address in rtlanal.h.
9038 If the return value is based on the assumption that signed overflow
9039 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9040 change *STRICT_OVERFLOW_P. */
9042 static bool
9044 {
9048 /* Doing something useful for floating point would need more work. */
9054 {
9057 strict_overflow_p);
9063 strict_overflow_p);
9071 }
9074 {
9077 strict_overflow_p);
9085 strict_overflow_p);
9100 strict_overflow_p);
9104 strict_overflow_p);
9107 {
9119 }
9123 }
9125 }
9127 /* Return true when T is an address and is known to be nonzero.
9128 Handle warnings about undefined signed overflow. */
9130 bool
9132 {
9139 "determining that expression is always "
9141 WARN_STRICT_OVERFLOW_MISC);
9143 }
9145 /* Return true if T is known not to be equal to an integer W. */
9147 bool
9149 {
9151 value_range_type rtype;
9153 {
9162 {
9167 }
9172 /* If T has some known zero bits and W has any of those bits set,
9173 then T is known not to be equal to W. */
9181 }
9182 }
9184 /* Fold a binary expression of code CODE and type TYPE with operands
9185 OP0 and OP1. LOC is the location of the resulting expression.
9186 Return the folded expression if folding is successful. Otherwise,
9187 return NULL_TREE. */
9189 tree
9192 {
9207 /* Strip any conversions that don't change the mode. This is
9208 safe for every expression, except for a comparison expression
9209 because its signedness is derived from its operands. So, in
9210 the latter case, only strip conversions that don't change the
9211 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
9212 preserved.
9214 Note that this is done as an internal manipulation within the
9215 constant folder, in order to find the simplest representation
9216 of the arguments so that their form can be studied. In any
9217 cases, the appropriate type conversions should be put back in
9218 the tree that will get out of the constant folder. */
9221 {
9224 }
9225 else
9226 {
9229 }
9231 /* Note that TREE_CONSTANT isn't enough: static var addresses are
9232 constant but we can't do arithmetic on them. */
9234 {
9237 {
9241 }
9242 }
9244 /* If this is a commutative operation, and ARG0 is a constant, move it
9245 to ARG1 to reduce the number of tests below. */
9250 /* Likewise if this is a comparison, and ARG0 is a constant, move it
9251 to ARG1 to reduce the number of tests below. */
9260 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
9262 First check for cases where an arithmetic operation is applied to a
9263 compound, conditional, or comparison operation. Push the arithmetic
9264 operation inside the compound or conditional to see if any folding
9265 can then be done. Convert comparison to conditional for this purpose.
9266 The also optimizes non-constant cases that used to be done in
9267 expand_expr.
9269 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
9270 one of the operands is a comparison and the other is a comparison, a
9271 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
9272 code below would make the expression more complex. Change it to a
9273 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
9274 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
9287 {
9291 boolean_type_node,
9299 }
9303 {
9305 {
9310 tem);
9311 }
9313 {
9318 tem);
9319 }
9324 {
9330 }
9335 {
9341 }
9342 }
9345 {
9347 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
9350 {
9356 }
9358 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
9361 {
9362 tree base;
9363 poly_int64 coffset;
9372 }
9377 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
9383 arg1),
9385 arg0)));
9391 {
9392 /* X + (X / CST) * -CST is X % CST. */
9397 {
9406 cst0));
9407 }
9408 }
9410 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
9411 one. Make sure the type is not saturating and has the signedness of
9412 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9413 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9420 {
9424 }
9427 {
9428 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
9429 (plus (plus (mult) (mult)) (foo)) so that we can
9430 take advantage of the factoring cases below. */
9439 {
9445 else
9458 parg0),
9460 marg)),
9464 return
9470 parg1)));
9471 }
9472 }
9473 else
9474 {
9475 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
9476 to __complex__ ( x, y ). This is not the same for SNaNs or
9477 if signed zeros are involved. */
9481 {
9488 {
9492 {
9498 }
9500 {
9506 }
9507 }
9508 }
9510 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
9511 We associate floats only if the user has specified
9512 -fassociative-math. */
9516 {
9521 {
9522 tree tree0;
9525 }
9526 }
9527 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
9528 We associate floats only if the user has specified
9529 -fassociative-math. */
9533 {
9538 {
9539 tree tree0;
9542 }
9543 }
9544 }
9546 bit_rotate:
9547 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
9548 is a rotate of A by C1 bits. */
9549 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
9550 is a rotate of A by B bits.
9551 Similarly for (A << B) | (A >> (-B & C3)) where C3 is Z-1,
9552 though in this case CODE must be | and not + or ^, otherwise
9553 it doesn't return A when B is 0. */
9554 {
9556 tree rtype;
9565 /* Only create rotates in complete modes. Other cases are not
9566 expanded properly. */
9569 {
9582 {
9587 }
9592 {
9595 code0 == LSHIFT_EXPR
9598 }
9600 {
9610 {
9614 orig_tree01);
9616 }
9617 }
9621 {
9632 {
9636 orig_tree01);
9638 }
9639 }
9640 }
9641 }
9643 associate:
9644 /* In most languages, can't associate operations on floats through
9645 parentheses. Rather than remember where the parentheses were, we
9646 don't associate floats at all, unless the user has specified
9647 -fassociative-math.
9648 And, we need to make sure type is not saturating. */
9652 {
9658 /* Split both trees into variables, constants, and literals. Then
9659 associate each group together, the constants with literals,
9660 then the result with variables. This increases the chances of
9661 literals being recombined later and of generating relocatable
9662 expressions for the sum of a constant and literal. */
9670 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
9674 /* With undefined overflow prefer doing association in a type
9675 which wraps on overflow, if that is one of the operand types. */
9678 {
9686 }
9688 /* With undefined overflow we can only associate constants with one
9689 variable, and constants whose association doesn't overflow. */
9692 {
9694 {
9695 /* ??? If split_tree would handle NEGATE_EXPR we could
9696 simply reject these cases and the allowed cases would
9697 be the var0/minus_var1 ones. */
9703 {
9706 }
9713 {
9716 }
9722 /* The only case we can still associate with two variables
9723 is if they cancel out. */
9727 }
9733 }
9735 /* Only do something if we found more than two objects. Otherwise,
9736 nothing has changed and we risk infinite recursion. */
9744 {
9756 {
9760 }
9762 {
9766 }
9768 /* Preserve the MINUS_EXPR if the negative part of the literal is
9769 greater than the positive part. Otherwise, the multiplicative
9770 folding code (i.e extract_muldiv) may be fooled in case
9771 unsigned constants are subtracted, like in the following
9772 example: ((X*2 + 4) - 8U)/2. */
9774 {
9778 /* But avoid ending up with only negated parts. */
9780 {
9784 }
9785 else
9786 {
9790 }
9791 }
9793 /* Don't introduce overflows through reassociation. */
9798 /* Eliminate lit0 and minus_lit0 to con0 and minus_con0. */
9805 /* Eliminate minus_con0. */
9807 {
9814 else
9817 }
9819 /* Eliminate minus_var0. */
9821 {
9825 else
9828 }
9830 return
9833 }
9834 }
9840 /* Fold &a[i] - &a[j] to i-j. */
9845 {
9849 code
9853 }
9855 /* Further transformations are not for pointers. */
9859 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
9862 /* If arg0 is e.g. unsigned int and type is int, then this could
9863 introduce UB, because if A is INT_MIN at runtime, the original
9864 expression can be well defined while the latter is not.
9865 See PR83269. */
9874 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
9875 __complex__ ( x, -y ). This is not the same for SNaNs or if
9876 signed zeros are involved. */
9880 {
9887 {
9891 {
9893 arg1r ? arg1r
9898 }
9900 {
9904 arg1i ? arg1i
9907 }
9908 }
9909 }
9911 /* A - B -> A + (-B) if B is easily negatable. */
9915 /* Avoid this transformation if B is a positive REAL_CST. */
9923 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
9924 one. Make sure the type is not saturating and has the signedness of
9925 the stripped operands, as fold_plusminus_mult_expr will re-associate.
9926 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
9933 {
9937 }
9943 {
9944 /* Transform x * -C into -x * C if x is easily negatable. */
9959 {
9962 "occur when simplifying "
9964 WARN_STRICT_OVERFLOW_MISC);
9966 }
9968 /* Optimize z * conj(z) for integer complex numbers. */
9975 }
9976 else
9977 {
9978 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
9979 This is not the same for NaNs or if signed zeros are
9980 involved. */
9986 {
9989 return
9995 return
10000 }
10002 /* Optimize z * conj(z) for floating point complex numbers.
10003 Guarded by flag_unsafe_math_optimizations as non-finite
10004 imaginary components don't produce scalar results. */
10013 }
10017 /* Canonicalize (X & C1) | C2. */
10021 {
10026 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10034 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10036 {
10039 }
10041 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10042 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10043 mode which allows further optimizations. */
10048 {
10053 {
10056 }
10057 }
10060 {
10065 }
10066 }
10068 /* See if this can be simplified into a rotate first. If that
10069 is unsuccessful continue in the association code. */
10073 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10081 /* See if this can be simplified into a rotate first. If that
10082 is unsuccessful continue in the association code. */
10086 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
10091 {
10092 tree tem2;
10099 }
10100 /* Fold ~X & 1 as (X & 1) == 0. */
10104 {
10105 tree tem2;
10112 }
10113 /* Fold !X & 1 as X == 0. */
10116 {
10120 }
10122 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
10123 multiple of 1 << CST. */
10125 {
10132 }
10134 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
10135 bits from CST2. */
10139 {
10141 wide_int masked
10148 {
10149 /* Avoid the transform if arg1 is a mask of some
10150 mode which allows further optimizations. */
10157 }
10158 }
10160 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
10161 ((A & N) + B) & M -> (A + B) & M
10162 Similarly if (N & M) == 0,
10163 ((A | N) + B) & M -> (A + B) & M
10164 and for - instead of + (or unary - instead of +)
10165 and/or ^ instead of |.
10166 If B is constant and (B & M) == 0, fold into A & M. */
10168 {
10177 {
10180 wide_int cst0;
10182 /* Now we know that arg0 is (C + D) or (C - D) or
10183 -C and arg1 (M) is == (1LL << cst) - 1.
10184 Store C into PMOP[0] and D into PMOP[1]. */
10188 {
10191 }
10198 {
10207 {
10210 }
10213 /* If C or D is of the form (A & N) where
10214 (N & M) == M, or of the form (A | N) or
10215 (A ^ N) where (N & M) == 0, replace it with A. */
10219 /* If C or D is a N where (N & M) == 0, it can be
10220 omitted (assumed 0). */
10228 }
10230 /* Only build anything new if we optimized one or both arguments
10231 above. */
10235 {
10238 {
10239 /* Perform the operations in a type that has defined
10240 overflow behavior. */
10246 }
10251 {
10259 else
10261 }
10264 else
10267 /* TEM is now the new binary +, - or unary - replacement. */
10271 }
10272 }
10273 }
10275 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
10278 {
10283 return
10285 }
10290 /* Don't touch a floating-point divide by zero unless the mode
10291 of the constant can represent infinity. */
10297 /* (-A) / (-B) -> A / B */
10309 /* Fall through */
10312 /* Simplify A / (B << N) where A and B are positive and B is
10313 a power of 2, to A >> (N + log2(B)). */
10318 {
10321 {
10329 WARN_STRICT_OVERFLOW_MISC);
10335 }
10336 }
10338 /* Fall through */
10346 /* Convert -A / -B to A / B when the type is signed and overflow is
10347 undefined. */
10351 {
10354 "when distributing negation across "
10356 WARN_STRICT_OVERFLOW_MISC);
10361 }
10365 {
10368 "when distributing negation across "
10370 WARN_STRICT_OVERFLOW_MISC);
10375 }
10377 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
10378 operation, EXACT_DIV_EXPR.
10380 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
10381 At one time others generated faster code, it's not clear if they do
10382 after the last round to changes to the DIV code in expmed.c. */
10393 {
10397 WARN_STRICT_OVERFLOW_MISC);
10399 }
10411 {
10415 WARN_STRICT_OVERFLOW_MISC);
10417 }
10425 /* Since negative shift count is not well-defined,
10426 don't try to compute it in the compiler. */
10432 /* If we have a rotate of a bit operation with the rotate count and
10433 the second operand of the bit operation both constant,
10434 permute the two operations. */
10440 {
10448 }
10450 /* Two consecutive rotates adding up to the some integer
10451 multiple of the precision of the type can be ignored. */
10467 /* Note that the operands of this must be ints
10468 and their values must be 0 or 1.
10469 ("true" is a fixed value perhaps depending on the language.) */
10470 /* If first arg is constant zero, return it. */
10473 /* FALLTHRU */
10475 /* If either arg is constant true, drop it. */
10479 /* Preserve sequence points. */
10482 /* If second arg is constant zero, result is zero, but first arg
10483 must be evaluated. */
10486 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
10487 case will be handled here. */
10491 /* !X && X is always false. */
10495 /* X && !X is always false. */
10500 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
10501 means A >= Y && A != MAX, but in this case we know that
10502 A < X <= MAX. */
10506 {
10514 }
10523 /* Note that the operands of this must be ints
10524 and their values must be 0 or true.
10525 ("true" is a fixed value perhaps depending on the language.) */
10526 /* If first arg is constant true, return it. */
10529 /* FALLTHRU */
10531 /* If either arg is constant zero, drop it. */
10535 /* Preserve sequence points. */
10538 /* If second arg is constant true, result is true, but we must
10539 evaluate first arg. */
10542 /* Likewise for first arg, but note this only occurs here for
10543 TRUTH_OR_EXPR. */
10547 /* !X || X is always true. */
10551 /* X || !X is always true. */
10556 /* (X && !Y) || (!X && Y) is X ^ Y */
10559 {
10576 }
10585 /* If the second arg is constant zero, drop it. */
10588 /* If the second arg is constant true, this is a logical inversion. */
10590 {
10593 }
10594 /* Identical arguments cancel to zero. */
10598 /* !X ^ X is always true. */
10603 /* X ^ !X is always true. */
10619 /* bool_var != 1 becomes !bool_var. */
10626 /* bool_var == 0 becomes !bool_var. */
10633 /* !exp != 0 becomes !exp */
10638 /* If this is an EQ or NE comparison with zero and ARG0 is
10639 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
10640 two operations, but the latter can be done in one less insn
10641 on machines that have only two-operand insns or on which a
10642 constant cannot be the first operand. */
10645 {
10650 {
10657 arg1);
10658 }
10661 {
10668 arg1);
10669 }
10670 }
10672 /* If this is an NE or EQ comparison of zero against the result of a
10673 signed MOD operation whose second operand is a power of 2, make
10674 the MOD operation unsigned since it is simpler and equivalent. */
10682 {
10692 }
10694 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
10695 C1 is a valid shift constant, and C2 is a power of two, i.e.
10696 a single bit. */
10700 == INTEGER_CST
10703 {
10708 /* Check for a valid shift count. */
10710 {
10714 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
10715 can be rewritten as (X & (C2 << C1)) != 0. */
10717 {
10722 }
10723 /* Otherwise, for signed (arithmetic) shifts,
10724 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
10725 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
10729 /* Otherwise, of unsigned (logical) shifts,
10730 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
10731 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
10732 else
10736 arg000);
10737 }
10738 }
10740 /* If this is a comparison of a field, we may be able to simplify it. */
10743 /* Handle the constant case even without -O
10744 to make sure the warnings are given. */
10746 {
10750 }
10752 /* Optimize comparisons of strlen vs zero to a compare of the
10753 first character of the string vs zero. To wit,
10754 strlen(ptr) == 0 => *ptr == 0
10755 strlen(ptr) != 0 => *ptr != 0
10756 Other cases should reduce to one of these two (or a constant)
10757 due to the return value of strlen being unsigned. */
10760 {
10768 {
10773 }
10774 }
10776 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
10777 of X. Similarly fold (X >> C) == 0 into X >= 0. */
10781 {
10786 {
10788 {
10791 }
10794 }
10795 }
10797 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
10798 (X & C) == 0 when C is a single bit. */
10803 {
10810 arg1));
10811 }
10813 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
10814 constant C is a power of two, i.e. a single bit. */
10821 {
10825 }
10827 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
10828 when is C is a power of two, i.e. a single bit. */
10835 {
10841 }
10845 {
10848 }
10850 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
10853 {
10861 {
10867 }
10869 {
10875 }
10877 {
10883 }
10885 {
10891 }
10892 }
10896 {
10903 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
10904 operand_equal_p guarantees no side-effects so we don't need
10905 to use omit_one_operand on Z. */
10909 arg10));
10913 arg11));
10917 arg10));
10921 arg11));
10923 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
10926 {
10932 }
10933 }
10935 /* Attempt to simplify equality/inequality comparisons of complex
10936 values. Only lower the comparison if the result is known or
10937 can be simplified to a single scalar comparison. */
10942 {
10947 {
10950 }
10951 else
10952 {
10955 }
10958 {
10961 }
10962 else
10963 {
10966 }
10970 {
10972 {
10977 }
10978 else
10979 {
10984 }
10985 }
10989 {
10991 {
10996 }
10997 else
10998 {
11003 }
11004 }
11005 }
11017 /* Transform comparisons of the form X +- C CMP X. */
11022 {
11027 /* (X - c) > X becomes false. */
11033 /* Likewise (X + c) < X becomes false. */
11039 /* Convert (X - c) <= X to true. */
11046 /* Convert (X + c) >= X to true. */
11052 }
11054 /* If we are comparing an ABS_EXPR with a constant, we can
11055 convert all the cases into explicit comparisons, but they may
11056 well not be faster than doing the ABS and one comparison.
11057 But ABS (X) <= C is a range comparison, which becomes a subtraction
11058 and a comparison, and is probably faster. */
11072 /* Convert ABS_EXPR<x> >= 0 to true. */
11079 {
11082 "when simplifying comparison of "
11084 WARN_STRICT_OVERFLOW_CONDITIONAL);
11087 arg0);
11088 }
11090 /* Convert ABS_EXPR<x> < 0 to false. */
11095 {
11098 "when simplifying comparison of "
11100 WARN_STRICT_OVERFLOW_CONDITIONAL);
11103 arg0);
11104 }
11106 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11107 and similarly for >= into !=. */
11117 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11118 otherwise Y might be >= # of bits in X's type and thus e.g.
11119 (unsigned char) (1 << Y) for Y 15 might be 0.
11120 If the cast is widening, then 1 << Y should have unsigned type,
11121 otherwise if Y is number of bits in the signed shift type minus 1,
11122 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11123 31 might be 0xffffffff80000000. */
11134 {
11140 }
11152 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11153 {
11165 }
11170 /* When pedantic, a compound expression can be neither an lvalue
11171 nor an integer constant expression. */
11174 /* Don't let (0, 0) be null pointer constant. */
11180 /* An ASSERT_EXPR should never be passed to fold_binary. */
11186 }
11188 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
11189 a LABEL_EXPR; otherwise return NULL_TREE. Do not check the subtrees
11190 of GOTO_EXPR. */
11192 static tree
11194 {
11196 {
11203 /* fall through */
11207 }
11208 }
11210 /* Return whether the sub-tree ST contains a label which is accessible from
11211 outside the sub-tree. */
11213 static bool
11215 {
11216 return
11218 }
11220 /* Fold a ternary expression of code CODE and type TYPE with operands
11221 OP0, OP1, and OP2. Return the folded expression if folding is
11222 successful. Otherwise, return NULL_TREE. */
11224 tree
11227 {
11228 tree tem;
11235 /* If this is a commutative operation, and OP0 is a constant, move it
11236 to OP1 to reduce the number of tests below. */
11245 /* Strip any conversions that don't change the mode. This is safe
11246 for every expression, except for a comparison expression because
11247 its signedness is derived from its operands. So, in the latter
11248 case, only strip conversions that don't change the signedness.
11250 Note that this is done as an internal manipulation within the
11251 constant folder, in order to find the simplest representation of
11252 the arguments so that their form can be studied. In any cases,
11253 the appropriate type conversions should be put back in the tree
11254 that will get out of the constant folder. */
11256 {
11259 }
11262 {
11265 }
11268 {
11271 }
11274 {
11278 {
11284 }
11289 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
11290 so all simple results must be passed through pedantic_non_lvalue. */
11292 {
11295 /* Only optimize constant conditions when the selected branch
11296 has the same type as the COND_EXPR. This avoids optimizing
11297 away "c ? x : throw", where the throw has a void type.
11298 Avoid throwing away that operand which contains label. */
11305 }
11307 {
11312 {
11317 {
11325 }
11329 }
11330 }
11332 /* If we have A op B ? A : C, we may be able to convert this to a
11333 simpler expression, depending on the operation and the values
11334 of B and C. Signed zeros prevent all of these transformations,
11335 for reasons given above each one.
11337 Also try swapping the arguments and inverting the conditional. */
11341 {
11345 }
11350 {
11354 {
11358 }
11359 }
11361 /* If the second operand is simpler than the third, swap them
11362 since that produces better jump optimization results. */
11365 {
11367 /* See if this can be inverted. If it can't, possibly because
11368 it was a floating-point inequality comparison, don't do
11369 anything. */
11373 }
11375 /* Convert A ? 1 : 0 to simply A. */
11380 /* If we try to convert OP0 to our type, the
11381 call to fold will try to move the conversion inside
11382 a COND, which will recurse. In that case, the COND_EXPR
11383 is probably the best choice, so leave it alone. */
11387 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
11388 over COND_EXPR in cases such as floating point comparisons. */
11397 arg0)));
11399 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
11404 {
11405 /* sign_bit_p looks through both zero and sign extensions,
11406 but for this optimization only sign extensions are
11407 usable. */
11410 {
11413 {
11416 }
11418 }
11419 /* sign_bit_p only checks ARG1 bits within A's precision.
11420 If <sign bit of A> has wider type than A, bits outside
11421 of A's precision in <sign bit of A> need to be checked.
11422 If they are all 0, this optimization needs to be done
11423 in unsigned A's type, if they are all 1 in signed A's type,
11424 otherwise this can't be done. */
11430 {
11432 tree tem_type;
11445 {
11448 }
11450 {
11453 }
11454 else
11456 }
11459 return
11465 arg1)));
11466 }
11468 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
11469 already handled above. */
11474 {
11484 op1);
11485 }
11487 /* A & N ? N : 0 is simply A & N if N is a power of two. This
11488 is probably obsolete because the first operand should be a
11489 truth value (that's why we have the two cases above), but let's
11490 leave it in until we can confirm this for all front-ends. */
11502 /* Disable the transformations below for vectors, since
11503 fold_binary_op_with_conditional_arg may undo them immediately,
11504 yielding an infinite loop. */
11508 /* Convert A ? B : 0 into A && B if A and B are truth values. */
11517 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
11522 {
11524 /* Only perform transformation if ARG0 is easily inverted. */
11528 ? BIT_IOR_EXPR
11531 op1);
11532 }
11534 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
11539 {
11541 /* Only perform transformation if ARG0 is easily inverted. */
11547 op2);
11548 }
11550 /* Convert A ? 1 : B into A || B if A and B are truth values. */
11562 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
11563 of fold_ternary on them. */
11571 {
11581 {
11586 {
11594 }
11595 }
11596 }
11598 /* On constants we can use native encode/interpret to constant
11599 fold (nearly) all BIT_FIELD_REFs. */
11603 {
11606 /* Limit us to a reasonable amount of work. To relax the
11607 other limitations we need bit-shifting of the buffer
11608 and rounding up the size. */
11612 {
11614 unsigned HOST_WIDE_INT len
11619 {
11624 }
11625 }
11626 }
11631 /* For integers we can decompose the FMA if possible. */
11643 {
11659 {
11664 /* Make sure that the perm value is in an acceptable
11665 range. */
11674 else
11682 }
11685 {
11690 }
11695 {
11700 }
11706 {
11710 }
11715 /* Some targets are deficient and fail to expand a single
11716 argument permutation while still allowing an equivalent
11717 2-argument version. */
11721 {
11724 }
11727 {
11734 }
11738 }
11742 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
11745 {
11751 wide_int tem2
11755 }
11760 {
11762 unsigned HOST_WIDE_INT elsize
11765 {
11769 else
11770 {
11777 }
11778 }
11779 }
11785 }
11787 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
11788 of an array (or vector). */
11790 tree
11792 {
11797 {
11800 {
11801 /* Static constructors for variably sized objects makes no sense. */
11805 }
11806 }
11817 offset_int max_index;
11822 {
11823 /* Array constructor might explicitly set index, or specify a range,
11824 or leave index NULL meaning that it is next index after previous
11825 one. */
11827 {
11830 else
11831 {
11835 }
11836 }
11837 else
11838 {
11844 }
11846 /* Do we have match? */
11850 }
11852 }
11854 /* Perform constant folding and related simplification of EXPR.
11855 The related simplifications include x*1 => x, x*0 => 0, etc.,
11856 and application of the associative law.
11857 NOP_EXPR conversions may be removed freely (as long as we
11858 are careful not to change the type of the overall expression).
11859 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
11860 but we can constant-fold them if they have constant operands. */
11862 #ifdef ENABLE_FOLD_CHECKING
11863 # define fold(x) fold_1 (x)
11865 static
11866 #endif
11867 tree
11869 {
11873 tree tem;
11876 /* Return right away if a constant. */
11880 /* CALL_EXPR-like objects with variable numbers of operands are
11881 treated specially. */
11883 {
11885 {
11888 }
11890 }
11893 {
11898 {
11916 }
11917 }
11920 {
11922 {
11929 {
11934 }
11937 }
11939 /* Return a VECTOR_CST if possible. */
11941 {
11947 tree val;
11953 }
11961 }
11963 #ifdef ENABLE_FOLD_CHECKING
11964 #undef fold
11971 /* When --enable-checking=fold, compute a digest of expr before
11972 and after actual fold call to see if fold did not accidentally
11973 change original expr. */
11975 tree
11977 {
11978 tree ret;
11998 }
12000 void
12002 {
12013 }
12015 static void
12017 {
12019 }
12021 static void
12024 {
12030 recursive_label:
12040 {
12041 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12046 }
12054 {
12055 /* Allow these fields to be modified. */
12056 tree tmp;
12065 {
12068 }
12069 }
12080 {
12083 {
12099 }
12103 {
12116 }
12133 {
12139 }
12142 {
12144 {
12147 }
12149 }
12160 {
12163 }
12173 }
12174 }
12176 /* Helper function for outputting the checksum of a tree T. When
12177 debugging with gdb, you can "define mynext" to be "next" followed
12178 by "call debug_fold_checksum (op0)", then just trace down till the
12179 outputs differ. */
12181 DEBUG_FUNCTION void
12183 {
12198 }
12200 #endif
12202 /* Fold a unary tree expression with code CODE of type TYPE with an
12203 operand OP0. LOC is the location of the resulting expression.
12204 Return a folded expression if successful. Otherwise, return a tree
12205 expression with code CODE of type TYPE with an operand OP0. */
12207 tree
12210 {
12211 tree tem;
12212 #ifdef ENABLE_FOLD_CHECKING
12221 #endif
12227 #ifdef ENABLE_FOLD_CHECKING
12234 #endif
12236 }
12238 /* Fold a binary tree expression with code CODE of type TYPE with
12239 operands OP0 and OP1. LOC is the location of the resulting
12240 expression. Return a folded expression if successful. Otherwise,
12241 return a tree expression with code CODE of type TYPE with operands
12242 OP0 and OP1. */
12244 tree
12247 MEM_STAT_DECL)
12248 {
12249 tree tem;
12250 #ifdef ENABLE_FOLD_CHECKING
12267 #endif
12273 #ifdef ENABLE_FOLD_CHECKING
12288 #endif
12290 }
12292 /* Fold a ternary tree expression with code CODE of type TYPE with
12293 operands OP0, OP1, and OP2. Return a folded expression if
12294 successful. Otherwise, return a tree expression with code CODE of
12295 type TYPE with operands OP0, OP1, and OP2. */
12297 tree
12300 {
12301 tree tem;
12302 #ifdef ENABLE_FOLD_CHECKING
12326 #endif
12333 #ifdef ENABLE_FOLD_CHECKING
12356 #endif
12358 }
12360 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
12361 arguments in ARGARRAY, and a null static chain.
12362 Return a folded expression if successful. Otherwise, return a CALL_EXPR
12363 of type TYPE from the given operands as constructed by build_call_array. */
12365 tree
12368 {
12369 tree tem;
12370 #ifdef ENABLE_FOLD_CHECKING
12389 #endif
12395 #ifdef ENABLE_FOLD_CHECKING
12411 #endif
12413 }
12415 /* Perform constant folding and related simplification of initializer
12416 expression EXPR. These behave identically to "fold_buildN" but ignore
12417 potential run-time traps and exceptions that fold must preserve. */
12419 #define START_FOLD_INIT \
12420 int saved_signaling_nans = flag_signaling_nans;\
12421 int saved_trapping_math = flag_trapping_math;\
12422 int saved_rounding_math = flag_rounding_math;\
12423 int saved_trapv = flag_trapv;\
12424 int saved_folding_initializer = folding_initializer;\
12425 flag_signaling_nans = 0;\
12426 flag_trapping_math = 0;\
12427 flag_rounding_math = 0;\
12428 flag_trapv = 0;\
12429 folding_initializer = 1;
12431 #define END_FOLD_INIT \
12432 flag_signaling_nans = saved_signaling_nans;\
12433 flag_trapping_math = saved_trapping_math;\
12434 flag_rounding_math = saved_rounding_math;\
12435 flag_trapv = saved_trapv;\
12436 folding_initializer = saved_folding_initializer;
12438 tree
12441 {
12442 tree result;
12443 START_FOLD_INIT;
12447 END_FOLD_INIT;
12449 }
12451 tree
12454 {
12455 tree result;
12456 START_FOLD_INIT;
12460 END_FOLD_INIT;
12462 }
12464 tree
12467 {
12468 tree result;
12469 START_FOLD_INIT;
12473 END_FOLD_INIT;
12475 }
12477 #undef START_FOLD_INIT
12478 #undef END_FOLD_INIT
12480 /* Determine if first argument is a multiple of second argument. Return 0 if
12481 it is not, or we cannot easily determined it to be.
12483 An example of the sort of thing we care about (at this point; this routine
12484 could surely be made more general, and expanded to do what the *_DIV_EXPR's
12485 fold cases do now) is discovering that
12487 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12489 is a multiple of
12491 SAVE_EXPR (J * 8)
12493 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
12495 This code also handles discovering that
12497 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
12499 is a multiple of 8 so we don't have to worry about dealing with a
12500 possible remainder.
12502 Note that we *look* inside a SAVE_EXPR only to determine how it was
12503 calculated; it is not safe for fold to do much of anything else with the
12504 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
12505 at run time. For example, the latter example above *cannot* be implemented
12506 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
12507 evaluation time of the original SAVE_EXPR is not necessarily the same at
12508 the time the new expression is evaluated. The only optimization of this
12509 sort that would be valid is changing
12511 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
12513 divided by 8 to
12515 SAVE_EXPR (I) * SAVE_EXPR (J)
12517 (where the same SAVE_EXPR (J) is used in the original and the
12518 transformed version). */
12520 int
12522 {
12533 {
12535 /* Bitwise and provides a power of two multiple. If the mask is
12536 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
12539 /* FALLTHRU */
12546 /* It is impossible to prove if op0 - op1 is multiple of bottom
12547 precisely, so be conservative here checking if both op0 and op1
12548 are multiple of bottom. Note we check the second operand first
12549 since it's usually simpler. */
12554 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
12555 as op0 - 3 if the expression has unsigned type. For example,
12556 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
12566 {
12568 /* const_binop may not detect overflow correctly,
12569 so check for it explicitly here. */
12577 }
12581 /* Can't handle conversions from non-integral or wider integral type. */
12587 /* fall through */
12604 SIGNED);
12610 {
12613 /* Check for special cases to see if top is defined as multiple
12614 of bottom:
12616 top = (X & ~(bottom - 1) ; bottom is power of 2
12618 or
12620 Y = X % bottom
12621 top = X - Y. */
12640 }
12642 /* fall through */
12650 }
12651 }
12653 #define tree_expr_nonnegative_warnv_p(X, Y) \
12656 #define RECURSE(X) \
12657 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
12659 /* Return true if CODE or TYPE is known to be non-negative. */
12661 static bool
12663 {
12666 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
12667 have a signed:1 type (where the value is -1 and 0). */
12670 }
12672 /* Return true if (CODE OP0) is known to be non-negative. If the return
12673 value is based on the assumption that signed overflow is undefined,
12674 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12675 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12677 bool
12680 {
12685 {
12687 /* We can't return 1 if flag_wrapv is set because
12688 ABS_EXPR<INT_MIN> = INT_MIN. */
12692 {
12695 }
12703 CASE_CONVERT:
12704 {
12709 {
12713 {
12717 }
12718 }
12720 {
12726 }
12727 }
12732 }
12734 /* We don't know sign of `t', so be conservative and return false. */
12736 }
12738 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
12739 value is based on the assumption that signed overflow is undefined,
12740 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12741 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12743 bool
12747 {
12752 {
12758 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
12759 both unsigned and at least 2 bits shorter than the result. */
12763 {
12768 {
12772 }
12773 }
12778 {
12779 /* x * x is always non-negative for floating point x
12780 or without overflow. */
12783 {
12788 }
12789 }
12791 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
12792 both unsigned and their total bits is shorter than the result. */
12796 {
12815 {
12825 }
12826 }
12853 }
12855 /* We don't know sign of `t', so be conservative and return false. */
12857 }
12859 /* Return true if T is known to be non-negative. If the return
12860 value is based on the assumption that signed overflow is undefined,
12861 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12862 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12864 bool
12866 {
12871 {
12885 /* Limit the depth of recursion to avoid quadratic behavior.
12886 This is expected to catch almost all occurrences in practice.
12887 If this code misses important cases that unbounded recursion
12888 would not, passes that need this information could be revised
12889 to provide it through dataflow propagation. */
12897 }
12898 }
12900 /* Return true if T is known to be non-negative. If the return
12901 value is based on the assumption that signed overflow is undefined,
12902 set *STRICT_OVERFLOW_P to true; otherwise, don't change
12903 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
12905 bool
12908 {
12910 {
12911 CASE_CFN_ACOS:
12912 CASE_CFN_ACOSH:
12913 CASE_CFN_CABS:
12914 CASE_CFN_COSH:
12915 CASE_CFN_ERFC:
12916 CASE_CFN_EXP:
12917 CASE_CFN_EXP10:
12918 CASE_CFN_EXP2:
12919 CASE_CFN_FABS:
12920 CASE_CFN_FDIM:
12921 CASE_CFN_HYPOT:
12922 CASE_CFN_POW10:
12923 CASE_CFN_FFS:
12924 CASE_CFN_PARITY:
12925 CASE_CFN_POPCOUNT:
12926 CASE_CFN_CLZ:
12927 CASE_CFN_CLRSB:
12930 /* Always true. */
12933 CASE_CFN_SQRT:
12934 CASE_CFN_SQRT_FN:
12935 /* sqrt(-0.0) is -0.0. */
12940 CASE_CFN_ASINH:
12941 CASE_CFN_ATAN:
12942 CASE_CFN_ATANH:
12943 CASE_CFN_CBRT:
12944 CASE_CFN_CEIL:
12945 CASE_CFN_ERF:
12946 CASE_CFN_EXPM1:
12947 CASE_CFN_FLOOR:
12948 CASE_CFN_FMOD:
12949 CASE_CFN_FREXP:
12950 CASE_CFN_ICEIL:
12951 CASE_CFN_IFLOOR:
12952 CASE_CFN_IRINT:
12953 CASE_CFN_IROUND:
12954 CASE_CFN_LCEIL:
12955 CASE_CFN_LDEXP:
12956 CASE_CFN_LFLOOR:
12957 CASE_CFN_LLCEIL:
12958 CASE_CFN_LLFLOOR:
12959 CASE_CFN_LLRINT:
12960 CASE_CFN_LLROUND:
12961 CASE_CFN_LRINT:
12962 CASE_CFN_LROUND:
12963 CASE_CFN_MODF:
12964 CASE_CFN_NEARBYINT:
12965 CASE_CFN_RINT:
12966 CASE_CFN_ROUND:
12967 CASE_CFN_SCALB:
12968 CASE_CFN_SCALBLN:
12969 CASE_CFN_SCALBN:
12970 CASE_CFN_SIGNBIT:
12971 CASE_CFN_SIGNIFICAND:
12972 CASE_CFN_SINH:
12973 CASE_CFN_TANH:
12974 CASE_CFN_TRUNC:
12975 /* True if the 1st argument is nonnegative. */
12978 CASE_CFN_FMAX:
12979 CASE_CFN_FMAX_FN:
12980 /* True if the 1st OR 2nd arguments are nonnegative. */
12983 CASE_CFN_FMIN:
12984 CASE_CFN_FMIN_FN:
12985 /* True if the 1st AND 2nd arguments are nonnegative. */
12988 CASE_CFN_COPYSIGN:
12989 CASE_CFN_COPYSIGN_FN:
12990 /* True if the 2nd argument is nonnegative. */
12993 CASE_CFN_POWI:
12994 /* True if the 1st argument is nonnegative or the second
12995 argument is an even integer. */
13001 CASE_CFN_POW:
13002 /* True if the 1st argument is nonnegative or the second
13003 argument is an even integer valued real. */
13005 {
13006 REAL_VALUE_TYPE c;
13007 HOST_WIDE_INT n;
13012 {
13013 REAL_VALUE_TYPE cint;
13017 }
13018 }
13023 }
13025 }
13027 /* Return true if T is known to be non-negative. If the return
13028 value is based on the assumption that signed overflow is undefined,
13029 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13030 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13032 static bool
13034 {
13040 {
13042 {
13046 /* If the initializer is non-void, then it's a normal expression
13047 that will be assigned to the slot. */
13051 /* Otherwise, the initializer sets the slot in some way. One common
13052 way is an assignment statement at the end of the initializer. */
13054 {
13062 else
13064 }
13070 }
13073 {
13079 arg0,
13080 arg1,
13082 }
13095 }
13096 }
13098 #undef RECURSE
13099 #undef tree_expr_nonnegative_warnv_p
13101 /* Return true if T is known to be non-negative. If the return
13102 value is based on the assumption that signed overflow is undefined,
13103 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13104 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13106 bool
13108 {
13115 {
13137 }
13140 {
13166 }
13167 }
13169 /* Return true if `t' is known to be non-negative. Handle warnings
13170 about undefined signed overflow. */
13172 bool
13174 {
13181 "determining that expression is always "
13183 WARN_STRICT_OVERFLOW_MISC);
13185 }
13188 /* Return true when (CODE OP0) is an address and is known to be nonzero.
13189 For floating point we further ensure that T is not denormal.
13190 Similar logic is present in nonzero_address in rtlanal.h.
13192 If the return value is based on the assumption that signed overflow
13193 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13194 change *STRICT_OVERFLOW_P. */
13196 bool
13199 {
13201 {
13204 strict_overflow_p);
13207 {
13213 strict_overflow_p));
13214 }
13219 strict_overflow_p);
13223 }
13226 }
13228 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
13229 For floating point we further ensure that T is not denormal.
13230 Similar logic is present in nonzero_address in rtlanal.h.
13232 If the return value is based on the assumption that signed overflow
13233 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13234 change *STRICT_OVERFLOW_P. */
13236 bool
13238 tree type,
13239 tree op0,
13241 {
13244 {
13248 {
13249 /* With the presence of negative values it is hard
13250 to say something. */
13257 /* One of operands must be positive and the other non-negative. */
13258 /* We don't set *STRICT_OVERFLOW_P here: even if this value
13259 overflows, on a twos-complement machine the sum of two
13260 nonnegative numbers can never be zero. */
13262 strict_overflow_p)
13264 strict_overflow_p));
13265 }
13270 {
13272 strict_overflow_p)
13274 strict_overflow_p))
13275 {
13278 }
13279 }
13288 {
13291 }
13298 {
13302 /* When both operands are nonzero, then MAX must be too. */
13304 strict_overflow_p))
13307 /* MAX where operand 0 is positive is positive. */
13309 strict_overflow_p);
13310 }
13311 /* MAX where operand 1 is positive is positive. */
13316 {
13320 }
13325 strict_overflow_p)
13327 strict_overflow_p));
13331 }
13334 }
13336 /* Return true when T is an address and is known to be nonzero.
13337 For floating point we further ensure that T is not denormal.
13338 Similar logic is present in nonzero_address in rtlanal.h.
13340 If the return value is based on the assumption that signed overflow
13341 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
13342 change *STRICT_OVERFLOW_P. */
13344 bool
13346 {
13349 {
13354 {
13366 /* For objects in symbol table check if we know they are non-zero.
13367 Don't do anything for variables and functions before symtab is built;
13368 it is quite possible that they will be declared weak later. */
13373 /* Constants are never weak. */
13378 }
13386 {
13390 }
13400 }
13402 }
13404 #define integer_valued_real_p(X) \
13407 #define RECURSE(X) \
13408 ((integer_valued_real_p) (X, depth + 1))
13410 /* Return true if the floating point result of (CODE OP0) has an
13411 integer value. We also allow +Inf, -Inf and NaN to be considered
13412 integer values. Return false for signaling NaN.
13414 DEPTH is the current nesting depth of the query. */
13416 bool
13418 {
13420 {
13427 CASE_CONVERT:
13428 {
13435 }
13439 }
13441 }
13443 /* Return true if the floating point result of (CODE OP0 OP1) has an
13444 integer value. We also allow +Inf, -Inf and NaN to be considered
13445 integer values. Return false for signaling NaN.
13447 DEPTH is the current nesting depth of the query. */
13449 bool
13451 {
13453 {
13463 }
13465 }
13467 /* Return true if the floating point result of calling FNDECL with arguments
13468 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
13469 considered integer values. Return false for signaling NaN. If FNDECL
13470 takes fewer than 2 arguments, the remaining ARGn are null.
13472 DEPTH is the current nesting depth of the query. */
13474 bool
13476 {
13478 {
13479 CASE_CFN_CEIL:
13480 CASE_CFN_FLOOR:
13481 CASE_CFN_NEARBYINT:
13482 CASE_CFN_RINT:
13483 CASE_CFN_ROUND:
13484 CASE_CFN_TRUNC:
13487 CASE_CFN_FMIN:
13488 CASE_CFN_FMIN_FN:
13489 CASE_CFN_FMAX:
13490 CASE_CFN_FMAX_FN:
13495 }
13497 }
13499 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
13500 has an integer value. We also allow +Inf, -Inf and NaN to be
13501 considered integer values. Return false for signaling NaN.
13503 DEPTH is the current nesting depth of the query. */
13505 bool
13507 {
13509 {
13517 /* Limit the depth of recursion to avoid quadratic behavior.
13518 This is expected to catch almost all occurrences in practice.
13519 If this code misses important cases that unbounded recursion
13520 would not, passes that need this information could be revised
13521 to provide it through dataflow propagation. */
13525 depth));
13529 }
13531 }
13533 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
13534 has an integer value. We also allow +Inf, -Inf and NaN to be
13535 considered integer values. Return false for signaling NaN.
13537 DEPTH is the current nesting depth of the query. */
13539 static bool
13541 {
13543 {
13554 }
13556 }
13558 #undef RECURSE
13559 #undef integer_valued_real_p
13561 /* Return true if the floating point expression T has an integer value.
13562 We also allow +Inf, -Inf and NaN to be considered integer values.
13563 Return false for signaling NaN.
13565 DEPTH is the current nesting depth of the query. */
13567 bool
13569 {
13575 {
13591 }
13594 {
13600 {
13609 }
13613 }
13614 }
13616 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
13617 attempt to fold the expression to a constant without modifying TYPE,
13618 OP0 or OP1.
13620 If the expression could be simplified to a constant, then return
13621 the constant. If the expression would not be simplified to a
13622 constant, then return NULL_TREE. */
13624 tree
13626 {
13629 }
13631 /* Given the components of a unary expression CODE, TYPE and OP0,
13632 attempt to fold the expression to a constant without modifying
13633 TYPE or OP0.
13635 If the expression could be simplified to a constant, then return
13636 the constant. If the expression would not be simplified to a
13637 constant, then return NULL_TREE. */
13639 tree
13641 {
13644 }
13646 /* If EXP represents referencing an element in a constant string
13647 (either via pointer arithmetic or array indexing), return the
13648 tree representing the value accessed, otherwise return NULL. */
13650 tree
13652 {
13656 {
13658 tree index;
13659 tree string;
13664 else
13665 {
13669 /* Optimize the special-case of a zero lower bound.
13671 We convert the low_bound to sizetype to avoid some problems
13672 with constant folding. (E.g. suppose the lower bound is 1,
13673 and its mode is QI. Without the conversion,l (ARRAY
13674 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
13675 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
13681 }
13683 scalar_int_mode char_mode;
13695 }
13697 }
13699 /* Return the tree for neg (ARG0) when ARG0 is known to be either
13700 an integer constant, real, or fixed-point constant.
13702 TYPE is the type of the result. */
13704 static tree
13706 {
13710 {
13716 {
13717 FIXED_VALUE_TYPE f;
13722 /* Propagate overflow flags. */
13726 }
13730 {
13737 }
13740 }
13743 }
13745 /* Return the tree for abs (ARG0) when ARG0 is known to be either
13746 an integer constant or real constant.
13748 TYPE is the type of the result. */
13750 tree
13752 {
13756 {
13758 {
13759 /* If the value is unsigned or non-negative, then the absolute value
13760 is the same as the ordinary value. */
13764 /* If the value is negative, then the absolute value is
13765 its negation. */
13766 else
13767 {
13772 }
13773 }
13779 else
13785 }
13788 }
13790 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
13791 constant. TYPE is the type of the result. */
13793 static tree
13795 {
13799 }
13801 /* Given CODE, a relational operator, the target type, TYPE and two
13802 constant operands OP0 and OP1, return the result of the
13803 relational operation. If the result is not a compile time
13804 constant, then return NULL_TREE. */
13806 static tree
13808 {
13811 /* From here on, the only cases we handle are when the result is
13812 known to be a constant. */
13815 {
13819 /* Handle the cases where either operand is a NaN. */
13821 {
13823 {
13851 }
13854 }
13857 }
13860 {
13864 }
13866 /* Handle equality/inequality of complex constants. */
13868 {
13879 else
13881 }
13884 {
13886 {
13887 /* Have vector comparison with scalar boolean result. */
13891 {
13899 }
13901 }
13902 tree_vector_builder elts;
13907 {
13920 }
13923 }
13925 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
13927 To compute GT, swap the arguments and do LT.
13928 To compute GE, do LT and invert the result.
13929 To compute LE, swap the arguments, do LT and invert the result.
13930 To compute NE, do EQ and invert the result.
13932 Therefore, the code below must handle only EQ and LT. */
13935 {
13938 }
13940 /* Note that it is safe to invert for real values here because we
13941 have already handled the one case that it matters. */
13945 {
13948 }
13950 /* Compute a result for LT or EQ if args permit;
13951 Otherwise return T. */
13953 {
13956 else
13958 }
13959 else
13965 }
13967 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
13968 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
13969 itself. */
13971 tree
13973 {
13974 /* If the expression does not have side effects then we don't have to wrap
13975 it with a cleanup point expression. */
13979 /* If the expression is a return, check to see if the expression inside the
13980 return has no side effects or the right hand side of the modify expression
13981 inside the return. If either don't have side effects set we don't need to
13982 wrap the expression in a cleanup point expression. Note we don't check the
13983 left hand side of the modify because it should always be a return decl. */
13985 {
13992 }
13995 }
13997 /* Given a pointer value OP0 and a type TYPE, return a simplified version
13998 of an indirection through OP0, or NULL_TREE if no simplification is
13999 possible. */
14001 tree
14003 {
14005 tree subtype;
14014 {
14017 /* *&CONST_DECL -> to the value of the const decl. */
14020 /* *&p => p; make sure to handle *&"str"[cst] here. */
14022 {
14026 else
14028 }
14029 /* *(foo *)&fooarray => fooarray[0] */
14032 && (!in_gimple_form
14034 {
14044 }
14045 /* *(foo *)&complexfoo => __real__ complexfoo */
14049 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
14052 {
14056 }
14057 }
14061 {
14067 {
14068 tree op00type;
14072 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
14075 {
14077 unsigned HOST_WIDE_INT max_offset
14082 {
14089 }
14090 }
14091 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
14094 {
14098 }
14099 /* ((foo *)&fooarray)[1] => fooarray[1] */
14102 {
14109 offset_int remainder;
14112 {
14117 }
14118 }
14119 }
14120 }
14122 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
14125 && (!in_gimple_form
14127 {
14128 tree type_domain;
14138 NULL_TREE);
14139 }
14142 }
14144 /* Builds an expression for an indirection through T, simplifying some
14145 cases. */
14147 tree
14149 {
14157 }
14159 /* Given an INDIRECT_REF T, return either T or a simplified version. */
14161 tree
14163 {
14168 else
14170 }
14172 /* Strip non-trapping, non-side-effecting tree nodes from an expression
14173 whose result is ignored. The type of the returned tree need not be
14174 the same as the original expression. */
14176 tree
14178 {
14184 {
14195 else
14201 {
14217 }
14222 }
14223 }
14225 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
14227 tree
14229 {
14235 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14236 have to do anything. Only do this when we are not given a const,
14237 because in that case, this check is more expensive than just
14238 doing it. */
14240 {
14245 }
14247 /* If divisor is a power of two, simplify this to bit manipulation. */
14249 {
14251 {
14265 }
14266 else
14267 {
14268 tree t;
14274 }
14275 }
14276 else
14277 {
14282 }
14285 }
14287 /* Likewise, but round down. */
14289 tree
14291 {
14298 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
14299 have to do anything. Only do this when we are not given a const,
14300 because in that case, this check is more expensive than just
14301 doing it. */
14303 {
14308 }
14310 /* If divisor is a power of two, simplify this to bit manipulation. */
14312 {
14313 tree t;
14317 }
14318 else
14319 {
14324 }
14327 }
14329 /* Returns the pointer to the base of the object addressed by EXP and
14330 extracts the information about the offset of the access, storing it
14331 to PBITPOS and POFFSET. */
14333 static tree
14336 {
14337 tree core;
14338 machine_mode mode;
14340 HOST_WIDE_INT bitsize;
14344 {
14349 }
14351 {
14357 {
14362 {
14365 }
14366 }
14367 }
14368 else
14369 {
14373 }
14376 }
14378 /* Returns true if addresses of E1 and E2 differ by a constant, false
14379 otherwise. If they do, E1 - E2 is stored in *DIFF. */
14381 bool
14383 {
14397 {
14407 }
14409 {
14410 /* If only one of the offsets is non-constant, the difference cannot
14411 be a constant. */
14413 }
14414 else
14419 }
14421 /* Return OFF converted to a pointer offset type suitable as offset for
14422 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
14423 tree
14425 {
14427 }
14429 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14430 tree
14432 {
14435 }
14437 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
14438 tree
14440 {
14443 }
14445 /* Return a char pointer for a C string if it is a string constant
14446 or sum of string constant and integer constant. We only support
14447 string constants properly terminated with '\0' character.
14448 If STRLEN is a valid pointer, length (including terminating character)
14449 of returned string is stored to the argument. */
14453 {
14454 tree offset_node;
14465 {
14468 else
14470 }
14475 /* Support only properly null-terminated strings. */
14484 }
14486 #if CHECKING_P
14490 /* Helper functions for writing tests of folding trees. */
14492 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
14494 static void
14496 tree constant)
14497 {
14499 }
14501 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
14502 wrapping WRAPPED_EXPR. */
14504 static void
14506 tree wrapped_expr)
14507 {
14512 }
14514 /* Verify that various arithmetic binary operations are folded
14515 correctly. */
14517 static void
14519 {
14525 /* Addition. */
14526 /* 1 <-- (0 + 1) */
14528 one);
14530 one);
14532 /* (nonlvalue)x <-- (x + 0) */
14534 x);
14536 /* Subtraction. */
14537 /* 0 <-- (x - x) */
14539 zero);
14541 x);
14543 /* Multiplication. */
14544 /* 0 <-- (x * 0) */
14546 zero);
14548 /* (nonlvalue)x <-- (x * 1) */
14550 x);
14551 }
14553 /* Verify that various binary operations on vectors are folded
14554 correctly. */
14556 static void
14558 {
14564 /* Verify equality tests that return a scalar boolean result. */
14570 }
14572 /* Verify folding of VEC_DUPLICATE_EXPRs. */
14574 static void
14576 {
14579 /* This will be 1 if VEC_MODE isn't a vector mode. */
14586 }
14588 /* Run all of the selftests within this file. */
14590 void
14592 {
14596 }