| blob | 71a1d3eb735e2a35ee2ba86ed82c161a2ba56ffb |
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2020 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_ROUNDEVEN:
332 CASE_CFN_ROUNDEVEN_FN:
333 CASE_CFN_SIN:
334 CASE_CFN_SINH:
335 CASE_CFN_TAN:
336 CASE_CFN_TANH:
337 CASE_CFN_TRUNC:
340 CASE_CFN_LLRINT:
341 CASE_CFN_LRINT:
342 CASE_CFN_NEARBYINT:
343 CASE_CFN_RINT:
348 }
350 }
352 /* Check whether we may negate an integer constant T without causing
353 overflow. */
355 bool
357 {
358 tree type;
367 }
369 /* Determine whether an expression T can be cheaply negated using
370 the function negate_expr without introducing undefined overflow. */
372 static bool
374 {
375 tree type;
384 {
389 /* Check that -CST will not overflow type. */
402 /* We want to canonicalize to positive real constants. Pretend
403 that only negative ones can be easily negated. */
411 {
415 /* Steps don't prevent negation. */
422 }
437 /* -(A + B) -> (-B) - A. */
440 /* -(A + B) -> (-A) - B. */
444 /* We can't turn -(A-B) into B-A when we honor signed zeros. */
453 /* INT_MIN/n * n doesn't overflow while negating one operand it does
454 if n is a (negative) power of two. */
465 /* Fall through. */
478 /* In general we can't negate A in A / B, because if A is INT_MIN and
479 B is not 1 we change the sign of the result. */
483 /* In general we can't negate B in A / B, because if A is INT_MIN and
484 B is 1, we may turn this into INT_MIN / -1 which is undefined
485 and actually traps on some architectures. */
494 /* Negate -((double)float) as (double)(-float). */
496 {
500 }
504 /* Negate -f(x) as f(-x). */
510 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
512 {
516 }
521 }
523 }
525 /* Given T, an expression, return a folded tree for -T or NULL_TREE, if no
526 simplification is possible.
527 If negate_expr_p would return true for T, NULL_TREE will never be
528 returned. */
530 static tree
532 {
534 tree tem;
537 {
538 /* Convert - (~A) to A + 1. */
562 {
567 }
571 {
572 tree_vector_builder elts;
576 {
581 }
584 }
607 {
608 /* -(A + B) -> (-B) - A. */
610 {
614 }
616 /* -(A + B) -> (-A) - B. */
618 {
622 }
623 }
627 /* - (A - B) -> B - A */
638 /* Fall through. */
642 {
651 }
659 /* In general we can't negate A in A / B, because if A is INT_MIN and
660 B is not 1 we change the sign of the result. */
666 /* In general we can't negate B in A / B, because if A is INT_MIN and
667 B is 1, we may turn this into INT_MIN / -1 which is undefined
668 and actually traps on some architectures. */
680 /* Convert -((double)float) into (double)(-float). */
682 {
686 }
690 /* Negate -f(x) as f(-x). */
693 {
699 }
703 /* Optimize -((int)x >> 31) into (unsigned)x >> 31 for int. */
705 {
708 {
715 }
716 }
721 }
724 }
726 /* A wrapper for fold_negate_expr_1. */
728 static tree
730 {
737 }
739 /* Like fold_negate_expr, but return a NEGATE_EXPR tree, if T cannot be
740 negated in a simpler way. Also allow for T to be NULL_TREE, in which case
741 return NULL_TREE. */
743 static tree
745 {
747 location_t loc;
760 }
761 \f
762 /* Split a tree IN into a constant, literal and variable parts that could be
763 combined with CODE to make IN. "constant" means an expression with
764 TREE_CONSTANT but that isn't an actual constant. CODE must be a
765 commutative arithmetic operation. Store the constant part into *CONP,
766 the literal in *LITP and return the variable part. If a part isn't
767 present, set it to null. If the tree does not decompose in this way,
768 return the entire tree as the variable part and the other parts as null.
770 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
771 case, we negate an operand that was subtracted. Except if it is a
772 literal for which we use *MINUS_LITP instead.
774 If NEGATE_P is true, we are negating all of IN, again except a literal
775 for which we use *MINUS_LITP instead. If a variable part is of pointer
776 type, it is negated after converting to TYPE. This prevents us from
777 generating illegal MINUS pointer expression. LOC is the location of
778 the converted variable part.
780 If IN is itself a literal or constant, return it as appropriate.
782 Note that we do not guarantee that any of the three values will be the
783 same type as IN, but they will have the same signedness and mode. */
785 static tree
789 {
797 /* Strip any conversions that don't change the machine mode or signedness. */
806 /* We can associate addition and subtraction together (even
807 though the C standard doesn't say so) for integers because
808 the value is not affected. For reals, the value might be
809 affected, so we can't. */
815 {
821 /* First see if either of the operands is a literal, then a constant. */
834 /* If we haven't dealt with either operand, this is not a case we can
835 decompose. Otherwise, VAR is either of the ones remaining, if any. */
840 else
843 /* Now do any needed negations. */
850 }
855 {
856 /* -1 - X is folded to ~X, undo that here. Do _not_ do this
857 when IN is constant. */
860 }
861 else
865 {
878 }
888 }
890 /* Re-associate trees split by the above function. T1 and T2 are
891 either expressions to associate or null. Return the new
892 expression, if any. LOC is the location of the new expression. If
893 we build an operation, do it in TYPE and with CODE. */
895 static tree
897 {
899 {
902 }
906 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
907 try to fold this since we will have infinite recursion. But do
908 deal with any NEGATE_EXPRs. */
912 {
914 {
927 }
929 {
932 }
936 }
940 }
941 \f
942 /* Check whether TYPE1 and TYPE2 are equivalent integer types, suitable
943 for use in int_const_binop, size_binop and size_diffop. */
945 static bool
947 {
954 {
963 }
968 }
970 /* Combine two wide ints ARG1 and ARG2 under operation CODE to produce
971 a new constant in RES. Return FALSE if we don't know how to
972 evaluate CODE at compile-time. */
974 bool
978 {
979 wide_int tmp;
982 {
998 {
1002 else
1004 }
1005 else
1009 /* It's unclear from the C standard whether shifts can overflow.
1010 The following code ignores overflow; perhaps a C standard
1011 interpretation ruling is needed. */
1013 else
1020 {
1024 else
1026 }
1027 else
1032 else
1111 }
1113 }
1115 /* Combine two poly int's ARG1 and ARG2 under operation CODE to
1116 produce a new constant in RES. Return FALSE if we don't know how
1117 to evaluate CODE at compile-time. */
1119 static bool
1123 {
1127 {
1145 else
1152 else
1165 }
1167 }
1169 /* Combine two integer constants ARG1 and ARG2 under operation CODE to
1170 produce a new constant. Return NULL_TREE if we don't know how to
1171 evaluate CODE at compile-time. */
1173 tree
1176 {
1177 poly_wide_int poly_res;
1183 {
1189 }
1198 }
1200 /* Return true if binary operation OP distributes over addition in operand
1201 OPNO, with the other operand being held constant. OPNO counts from 1. */
1203 static bool
1205 {
1207 {
1218 }
1219 }
1221 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1222 constant. We assume ARG1 and ARG2 have the same data type, or at least
1223 are the same kind of constant and the same machine mode. Return zero if
1224 combining the constants is not allowed in the current operating mode. */
1226 static tree
1228 {
1229 /* Sanity check for the recursive cases. */
1237 {
1243 }
1246 {
1247 machine_mode mode;
1248 REAL_VALUE_TYPE d1;
1249 REAL_VALUE_TYPE d2;
1250 REAL_VALUE_TYPE value;
1251 REAL_VALUE_TYPE result;
1255 /* The following codes are handled by real_arithmetic. */
1257 {
1268 }
1276 /* Don't perform operation if we honor signaling NaNs and
1277 either operand is a signaling NaN. */
1283 /* Don't perform operation if it would raise a division
1284 by zero exception. */
1290 /* If either operand is a NaN, just return it. Otherwise, set up
1291 for floating-point trap; we return an overflow. */
1293 {
1294 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1295 is off. */
1299 }
1301 {
1302 /* Make resulting NaN value to be qNaN when flag_signaling_nans
1303 is off. */
1307 }
1312 /* Don't constant fold this floating point operation if
1313 the result has overflowed and flag_trapping_math. */
1321 /* Don't constant fold this floating point operation if the
1322 result may dependent upon the run-time rounding mode and
1323 flag_rounding_math is set, or if GCC's software emulation
1324 is unable to accurately represent the result. */
1334 }
1337 {
1338 FIXED_VALUE_TYPE f1;
1339 FIXED_VALUE_TYPE f2;
1340 FIXED_VALUE_TYPE result;
1345 /* The following codes are handled by fixed_arithmetic. */
1347 {
1359 {
1366 }
1371 }
1378 /* Propagate overflow flags. */
1382 }
1385 {
1394 {
1405 mpc_mul);
1419 mpc_div);
1420 /* Fallthru. */
1426 {
1427 /* Keep this algorithm in sync with
1428 tree-complex.c:expand_complex_div_straight().
1430 Expand complex division to scalars, straightforward algorithm.
1431 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1432 t = br*br + bi*bi
1433 */
1434 tree magsquared
1438 tree t1
1442 tree t2
1449 }
1450 else
1451 {
1452 /* Keep this algorithm in sync with
1453 tree-complex.c:expand_complex_div_wide().
1455 Expand complex division to scalars, modified algorithm to minimize
1456 overflow with wide input ranges. */
1462 {
1463 /* In the TRUE branch, we compute
1464 ratio = br/bi;
1465 div = (br * ratio) + bi;
1466 tr = (ar * ratio) + ai;
1467 ti = (ai * ratio) - ar;
1468 tr = tr / div;
1469 ti = ti / div; */
1480 }
1481 else
1482 {
1483 /* In the FALSE branch, we compute
1484 ratio = d/c;
1485 divisor = (d * ratio) + c;
1486 tr = (b * ratio) + a;
1487 ti = b - (a * ratio);
1488 tr = tr / div;
1489 ti = ti / div; */
1501 }
1502 }
1507 }
1511 }
1517 {
1522 /* We can operate directly on the encoding if:
1524 a3 - a2 == a2 - a1 && b3 - b2 == b2 - b1
1525 implies
1526 (a3 op b3) - (a2 op b2) == (a2 op b2) - (a1 op b1)
1528 Addition and subtraction are the supported operators
1529 for which this is true. */
1532 /* We can operate directly on stepped encodings if:
1534 a3 - a2 == a2 - a1
1535 implies:
1536 (a3 op c) - (a2 op c) == (a2 op c) - (a1 op c)
1538 which is true if (x -> x op c) distributes over addition. */
1540 else
1541 /* Similarly in reverse. */
1543 tree_vector_builder elts;
1548 {
1554 /* It is possible that const_binop cannot handle the given
1555 code and return NULL_TREE */
1559 }
1562 }
1564 /* Shifts allow a scalar offset for a vector. */
1567 {
1570 tree_vector_builder elts;
1575 {
1580 /* It is possible that const_binop cannot handle the given
1581 code and return NULL_TREE. */
1585 }
1588 }
1590 }
1592 /* Overload that adds a TYPE parameter to be able to dispatch
1593 to fold_relational_const. */
1595 tree
1597 {
1601 /* ??? Until we make the const_binop worker take the type of the
1602 result as argument put those cases that need it here. */
1604 {
1621 {
1626 }
1632 {
1648 {
1653 ? NOP_EXPR
1660 }
1663 }
1669 {
1692 {
1705 }
1708 }
1711 }
1716 /* Make sure type and arg0 have the same saturating flag. */
1721 }
1723 /* Compute CODE ARG1 with resulting type TYPE with ARG1 being constant.
1724 Return zero if computing the constants is not possible. */
1726 tree
1728 {
1729 /* Don't perform the operation, other than NEGATE and ABS, if
1730 flag_signaling_nans is on and the operand is a signaling NaN. */
1740 {
1741 CASE_CONVERT:
1748 /* If the source address is 0, and the source address space
1749 cannot have a valid object at 0, fold to dest type null. */
1760 {
1761 /* Can't call fold_negate_const directly here as that doesn't
1762 handle all cases and we might not be able to negate some
1763 constants. */
1768 }
1778 {
1782 }
1790 /* Perform BIT_NOT_EXPR on each element individually. */
1792 {
1793 tree elem;
1795 /* This can cope with stepped encodings because ~x == -1 - x. */
1796 tree_vector_builder elements;
1800 {
1806 }
1809 }
1833 {
1856 else
1861 {
1867 }
1870 }
1879 }
1882 }
1884 /* Create a sizetype INT_CST node with NUMBER sign extended. KIND
1885 indicates which particular sizetype to create. */
1887 tree
1889 {
1891 }
1892 \f
1893 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1894 is a tree code. The type of the result is taken from the operands.
1895 Both must be equivalent integer types, ala int_binop_types_match_p.
1896 If the operands are constant, so is the result. */
1898 tree
1900 {
1909 /* Handle the special case of two poly_int constants faster. */
1911 {
1912 /* And some specific cases even faster than that. */
1914 {
1921 }
1923 {
1927 }
1929 {
1933 }
1935 /* Handle general case of two integer constants. For sizetype
1936 constant calculations we always want to know about overflow,
1937 even in the unsigned case. */
1941 }
1944 }
1946 /* Given two values, either both of sizetype or both of bitsizetype,
1947 compute the difference between the two values. Return the value
1948 in signed type corresponding to the type of the operands. */
1950 tree
1952 {
1954 tree ctype;
1959 /* If the type is already signed, just do the simple thing. */
1967 else
1970 /* If either operand is not a constant, do the conversions to the signed
1971 type and subtract. The hardware will do the right thing with any
1972 overflow in the subtraction. */
1978 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1979 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1980 overflow) and negate (which can't either). Special-case a result
1981 of zero while we're here. */
1987 else
1991 MINUS_EXPR,
1993 }
1994 \f
1995 /* A subroutine of fold_convert_const handling conversions of an
1996 INTEGER_CST to another integer type. */
1998 static tree
2000 {
2001 /* Given an integer constant, make new constant with new type,
2002 appropriately sign-extended or truncated. Use widest_int
2003 so that any extension is done according ARG1's type. */
2007 }
2009 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2010 to an integer type. */
2012 static tree
2014 {
2016 tree t;
2018 /* The following code implements the floating point to integer
2019 conversion rules required by the Java Language Specification,
2020 that IEEE NaNs are mapped to zero and values that overflow
2021 the target precision saturate, i.e. values greater than
2022 INT_MAX are mapped to INT_MAX, and values less than INT_MIN
2023 are mapped to INT_MIN. These semantics are allowed by the
2024 C and C++ standards that simply state that the behavior of
2025 FP-to-integer conversion is unspecified upon overflow. */
2027 wide_int val;
2028 REAL_VALUE_TYPE r;
2032 {
2039 }
2041 /* If R is NaN, return zero and show we have an overflow. */
2043 {
2046 }
2048 /* See if R is less than the lower bound or greater than the
2049 upper bound. */
2052 {
2056 {
2059 }
2060 }
2063 {
2066 {
2069 {
2072 }
2073 }
2074 }
2081 }
2083 /* A subroutine of fold_convert_const handling conversions of a
2084 FIXED_CST to an integer type. */
2086 static tree
2088 {
2089 tree t;
2091 scalar_mode mode;
2093 /* Right shift FIXED_CST to temp by fbit. */
2097 {
2099 HOST_BITS_PER_DOUBLE_INT,
2102 /* Left shift temp to temp_trunc by fbit. */
2104 HOST_BITS_PER_DOUBLE_INT,
2106 }
2107 else
2108 {
2111 }
2113 /* If FIXED_CST is negative, we need to round the value toward 0.
2114 By checking if the fractional bits are not zero to add 1 to temp. */
2120 /* Given a fixed-point constant, make new constant with new type,
2121 appropriately sign-extended or truncated. */
2129 }
2131 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2132 to another floating point type. */
2134 static tree
2136 {
2137 REAL_VALUE_TYPE value;
2138 tree t;
2140 /* Don't perform the operation if flag_signaling_nans is on
2141 and the operand is a signaling NaN. */
2149 /* If converting an infinity or NAN to a representation that doesn't
2150 have one, set the overflow bit so that we can produce some kind of
2151 error message at the appropriate point if necessary. It's not the
2152 most user-friendly message, but it's better than nothing. */
2159 /* Regular overflow, conversion produced an infinity in a mode that
2160 can't represent them. */
2165 else
2168 }
2170 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2171 to a floating point type. */
2173 static tree
2175 {
2176 REAL_VALUE_TYPE value;
2177 tree t;
2185 }
2187 /* A subroutine of fold_convert_const handling conversions a FIXED_CST
2188 to another fixed-point type. */
2190 static tree
2192 {
2193 FIXED_VALUE_TYPE value;
2194 tree t;
2201 /* Propagate overflow flags. */
2205 }
2207 /* A subroutine of fold_convert_const handling conversions an INTEGER_CST
2208 to a fixed-point type. */
2210 static tree
2212 {
2213 FIXED_VALUE_TYPE value;
2214 tree t;
2216 double_int di;
2223 else
2231 /* Propagate overflow flags. */
2235 }
2237 /* A subroutine of fold_convert_const handling conversions a REAL_CST
2238 to a fixed-point type. */
2240 static tree
2242 {
2243 FIXED_VALUE_TYPE value;
2244 tree t;
2252 /* Propagate overflow flags. */
2256 }
2258 /* Attempt to fold type conversion operation CODE of expression ARG1 to
2259 type TYPE. If no simplification can be done return NULL_TREE. */
2261 static tree
2263 {
2268 /* We can't widen types, since the runtime value could overflow the
2269 original type before being extended to the new type. */
2280 {
2287 }
2289 {
2296 }
2298 {
2305 }
2307 {
2310 {
2313 /* We can't handle steps directly when extending, since the
2314 values need to wrap at the original precision first. */
2315 bool step_ok_p
2319 tree_vector_builder v;
2324 {
2330 }
2332 }
2333 }
2335 }
2337 /* Construct a vector of zero elements of vector type TYPE. */
2339 static tree
2341 {
2342 tree t;
2346 }
2348 /* Returns true, if ARG is convertible to TYPE using a NOP_EXPR. */
2350 bool
2352 {
2367 {
2389 }
2390 }
2392 /* Convert expression ARG to type TYPE. Used by the middle-end for
2393 simple conversions in preference to calling the front-end's convert. */
2395 tree
2397 {
2399 tree tem;
2410 {
2413 /* Handle conversions between pointers to different address spaces. */
2418 /* fall through */
2423 {
2427 }
2441 {
2445 }
2447 {
2451 }
2453 {
2457 }
2460 {
2478 }
2483 {
2487 }
2490 {
2504 }
2508 {
2517 integer_zero_node));
2519 {
2523 {
2529 }
2537 }
2541 }
2559 }
2560 fold_convert_exit:
2563 }
2564 \f
2565 /* Return false if expr can be assumed not to be an lvalue, true
2566 otherwise. */
2568 static bool
2570 {
2571 /* We only need to wrap lvalue tree codes. */
2573 {
2605 /* Assume the worst for front-end tree codes. */
2609 }
2612 }
2614 /* Return an expr equal to X but certainly not valid as an lvalue. */
2616 tree
2618 {
2619 /* While we are in GIMPLE, NON_LVALUE_EXPR doesn't mean anything to
2620 us. */
2627 }
2629 /* When pedantic, return an expr equal to X but certainly not valid as a
2630 pedantic lvalue. Otherwise, return X. */
2632 static tree
2634 {
2636 }
2637 \f
2638 /* Given a tree comparison code, return the code that is the logical inverse.
2639 It is generally not safe to do this for floating-point comparisons, except
2640 for EQ_EXPR, NE_EXPR, ORDERED_EXPR and UNORDERED_EXPR, so we return
2641 ERROR_MARK in this case. */
2643 enum tree_code
2645 {
2651 {
2682 }
2683 }
2685 /* Similar, but return the comparison that results if the operands are
2686 swapped. This is safe for floating-point. */
2688 enum tree_code
2690 {
2692 {
2718 }
2719 }
2722 /* Convert a comparison tree code from an enum tree_code representation
2723 into a compcode bit-based encoding. This function is the inverse of
2724 compcode_to_comparison. */
2726 static enum comparison_code
2728 {
2730 {
2761 }
2762 }
2764 /* Convert a compcode bit-based encoding of a comparison operator back
2765 to GCC's enum tree_code representation. This function is the
2766 inverse of comparison_to_compcode. */
2768 static enum tree_code
2770 {
2772 {
2803 }
2804 }
2806 /* Return true if COND1 tests the opposite condition of COND2. */
2808 bool
2810 {
2813 && (invert_tree_comparison
2820 }
2822 /* Return a tree for the comparison which is the combination of
2823 doing the AND or OR (depending on CODE) of the two operations LCODE
2824 and RCODE on the identical operands LL_ARG and LR_ARG. Take into account
2825 the possibility of trapping if the mode has NaNs, and return NULL_TREE
2826 if this makes the transformation invalid. */
2828 tree
2833 {
2840 {
2851 }
2854 {
2855 /* Eliminate unordered comparisons, as well as LTGT and ORD
2856 which are not used unless the mode has NaNs. */
2862 }
2864 {
2865 /* Check that the original operation and the optimized ones will trap
2866 under the same condition. */
2877 /* In a short-circuited boolean expression the LHS might be
2878 such that the RHS, if evaluated, will never trap. For
2879 example, in ORD (x, y) && (x < y), we evaluate the RHS only
2880 if neither x nor y is NaN. (This is a mixed blessing: for
2881 example, the expression above will never trap, hence
2882 optimizing it to x < y would be invalid). */
2887 /* If the comparison was short-circuited, and only the RHS
2888 trapped, we may now generate a spurious trap. */
2893 /* If we changed the conditions that cause a trap, we lose. */
2896 }
2902 else
2903 {
2908 }
2909 }
2910 \f
2911 /* Return nonzero if two operands (typically of the same tree node)
2912 are necessarily equal. FLAGS modifies behavior as follows:
2914 If OEP_ONLY_CONST is set, only return nonzero for constants.
2915 This function tests whether the operands are indistinguishable;
2916 it does not test whether they are equal using C's == operation.
2917 The distinction is important for IEEE floating point, because
2918 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
2919 (2) two NaNs may be indistinguishable, but NaN!=NaN.
2921 If OEP_ONLY_CONST is unset, a VAR_DECL is considered equal to itself
2922 even though it may hold multiple values during a function.
2923 This is because a GCC tree node guarantees that nothing else is
2924 executed between the evaluation of its "operands" (which may often
2925 be evaluated in arbitrary order). Hence if the operands themselves
2926 don't side-effect, the VAR_DECLs, PARM_DECLs etc... must hold the
2927 same value in each operand/subexpression. Hence leaving OEP_ONLY_CONST
2928 unset means assuming isochronic (or instantaneous) tree equivalence.
2929 Unless comparing arbitrary expression trees, such as from different
2930 statements, this flag can usually be left unset.
2932 If OEP_PURE_SAME is set, then pure functions with identical arguments
2933 are considered the same. It is used when the caller has other ways
2934 to ensure that global memory is unchanged in between.
2936 If OEP_ADDRESS_OF is set, we are actually comparing addresses of objects,
2937 not values of expressions.
2939 If OEP_LEXICOGRAPHIC is set, then also handle expressions with side-effects
2940 such as MODIFY_EXPR, RETURN_EXPR, as well as STATEMENT_LISTs.
2942 If OEP_BITWISE is set, then require the values to be bitwise identical
2943 rather than simply numerically equal. Do not take advantage of things
2944 like math-related flags or undefined behavior; only return true for
2945 values that are provably bitwise identical in all circumstances.
2947 Unless OEP_MATCH_SIDE_EFFECTS is set, the function returns false on
2948 any operand with side effect. This is unnecesarily conservative in the
2949 case we know that arg0 and arg1 are in disjoint code paths (such as in
2950 ?: operator). In addition OEP_MATCH_SIDE_EFFECTS is used when comparing
2951 addresses with TREE_CONSTANT flag set so we know that &var == &var
2952 even if var is volatile. */
2954 bool
2957 {
2965 /* If either is ERROR_MARK, they aren't equal. */
2971 /* Similar, if either does not have a type (like a template id),
2972 they aren't equal. */
2976 /* Bitwise identity makes no sense if the values have different layouts. */
2981 /* We cannot consider pointers to different address space equal. */
2988 /* Check equality of integer constants before bailing out due to
2989 precision differences. */
2991 {
2992 /* Address of INTEGER_CST is not defined; check that we did not forget
2993 to drop the OEP_ADDRESS_OF flags. */
2996 }
2999 {
3000 /* If both types don't have the same signedness, then we can't consider
3001 them equal. We must check this before the STRIP_NOPS calls
3002 because they may change the signedness of the arguments. As pointers
3003 strictly don't have a signedness, require either two pointers or
3004 two non-pointers as well. */
3010 /* If both types don't have the same precision, then it is not safe
3011 to strip NOPs. */
3018 }
3019 #if 0
3020 /* FIXME: Fortran FE currently produce ADDR_EXPR of NOP_EXPR. Enable the
3021 sanity check once the issue is solved. */
3022 else
3023 /* Addresses of conversions and SSA_NAMEs (and many other things)
3024 are not defined. Check that we did not forget to drop the
3025 OEP_ADDRESS_OF/OEP_CONSTANT_ADDRESS_OF flags. */
3028 #endif
3030 /* In case both args are comparisons but with different comparison
3031 code, try to swap the comparison operands of one arg to produce
3032 a match and compare that variant. */
3036 {
3044 }
3047 {
3048 /* NOP_EXPR and CONVERT_EXPR are considered equal. */
3050 ;
3052 {
3053 /* If we are interested in comparing addresses ignore
3054 MEM_REF wrappings of the base that can appear just for
3055 TBAA reasons. */
3069 }
3070 else
3072 }
3074 /* When not checking adddresses, this is needed for conversions and for
3075 COMPONENT_REF. Might as well play it safe and always test this. */
3082 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
3083 We don't care about side effects in that case because the SAVE_EXPR
3084 takes care of that for us. In all other cases, two expressions are
3085 equal if they have no side effects. If we have two identical
3086 expressions with side effects that should be treated the same due
3087 to the only side effects being identical SAVE_EXPR's, that will
3088 be detected in the recursive calls below.
3089 If we are taking an invariant address of two identical objects
3090 they are necessarily equal as well. */
3097 /* Next handle constant cases, those for which we can return 1 even
3098 if ONLY_CONST is set. */
3101 {
3114 {
3115 /* If we do not distinguish between signed and unsigned zero,
3116 consider them equal. */
3119 }
3123 {
3138 }
3142 flags)
3144 flags));
3155 flags | OEP_ADDRESS_OF
3158 /* In GIMPLE empty constructors are allowed in initializers of
3159 aggregates. */
3163 }
3165 /* Don't handle more cases for OEP_BITWISE, since we can't guarantee that
3166 two instances of undefined behavior will give identical results. */
3170 /* Define macros to test an operand from arg0 and arg1 for equality and a
3171 variant that allows null and views null as being different from any
3172 non-null value. In the latter case, if either is null, the both
3173 must be; otherwise, do the normal comparison. */
3174 #define OP_SAME(N) operand_equal_p (TREE_OPERAND (arg0, N), \
3175 TREE_OPERAND (arg1, N), flags)
3177 #define OP_SAME_WITH_NULL(N) \
3178 ((!TREE_OPERAND (arg0, N) || !TREE_OPERAND (arg1, N)) \
3179 ? TREE_OPERAND (arg0, N) == TREE_OPERAND (arg1, N) : OP_SAME (N))
3182 {
3184 /* Two conversions are equal only if signedness and modes match. */
3186 {
3187 CASE_CONVERT:
3195 }
3205 /* For commutative ops, allow the other order. */
3213 /* If either of the pointer (or reference) expressions we are
3214 dereferencing contain a side effect, these cannot be equal,
3215 but their addresses can be. */
3222 {
3225 {
3229 /* Verify that the access types are compatible. */
3233 }
3238 /* Require the same offset. */
3244 /* Fallthru. */
3252 {
3253 /* Require equal access sizes */
3259 flags)))
3261 /* Verify that access happens in similar types. */
3264 /* Verify that accesses are TBAA compatible. */
3273 /* Verify that alignment is compatible. */
3277 }
3280 /* TARGET_MEM_REF require equal extra operands. */
3291 /* Compare the array index by value if it is constant first as we
3292 may have different types but same value here. */
3298 /* Compare low bound and element size as with OEP_ADDRESS_OF
3299 we have to account for the offset of the ref. */
3304 array_ref_low_bound
3308 array_ref_element_size
3310 flags))));
3313 /* Handle operand 2 the same as for ARRAY_REF. Operand 0
3314 may be NULL when we're called to compare MEM_EXPRs. */
3327 /* Virtual table call. */
3329 {
3343 }
3347 }
3351 {
3353 /* Be sure we pass right ADDRESS_OF flag. */
3370 /* The multiplcation operands are commutative. */
3371 /* FALLTHRU */
3379 /* Otherwise take into account this is a commutative operation. */
3392 /* BIT_INSERT_EXPR has an implict operand as the type precision
3393 of op1. Need to check to make sure they are the same. */
3399 /* FALLTHRU */
3425 }
3429 {
3433 /* If not both CALL_EXPRs are either internal or normal function
3434 functions, then they are not equal. */
3437 {
3438 /* If the CALL_EXPRs call different internal functions, then they
3439 are not equal. */
3442 }
3443 else
3444 {
3445 /* If the CALL_EXPRs call different functions, then they are not
3446 equal. */
3448 flags))
3450 }
3452 /* FIXME: We could skip this test for OEP_MATCH_SIDE_EFFECTS. */
3453 {
3457 else
3461 }
3463 /* Now see if all the arguments are the same. */
3464 {
3475 /* If we get here and both argument lists are exhausted
3476 then the CALL_EXPRs are equal. */
3478 }
3481 }
3484 /* Consider __builtin_sqrt equal to sqrt. */
3493 {
3497 /* In GIMPLE constructors are used only to build vectors from
3498 elements. Individual elements in the constructor must be
3499 indexed in increasing order and form an initial sequence.
3501 We make no effort to compare constructors in generic.
3502 (see sem_variable::equals in ipa-icf which can do so for
3503 constants). */
3508 /* Be sure that vectors constructed have the same representation.
3509 We only tested element precision and modes to match.
3510 Vectors may be BLKmode and thus also check that the number of
3511 parts match. */
3524 {
3529 /* In GIMPLE the indexes can be either NULL or matching i.
3530 Double check this so we won't get false
3531 positives for GENERIC. */
3539 }
3541 }
3544 {
3545 /* Compare the STATEMENT_LISTs. */
3551 {
3552 /* The lists don't have the same number of statements. */
3558 flags & (OEP_LEXICOGRAPHIC
3561 }
3562 }
3567 {
3578 }
3582 }
3584 #undef OP_SAME
3585 #undef OP_SAME_WITH_NULL
3586 }
3588 /* Generate a hash value for an expression. This can be used iteratively
3589 by passing a previous result as the HSTATE argument. */
3591 void
3594 {
3600 {
3603 }
3613 {
3614 /* Alas, constants aren't shared, so we can't rely on pointer
3615 identity. */
3625 {
3629 else
3633 }
3635 {
3639 }
3649 {
3656 }
3658 /* We can just compare by pointer. */
3662 /* The node itself doesn't matter. */
3666 /* Ignore. */
3669 /* A list of expressions, for a CALL_EXPR or as the elements of a
3670 VECTOR_CST. */
3675 {
3681 {
3682 /* In GIMPLE the indexes can be either NULL or matching i. */
3687 }
3689 }
3691 {
3692 tree_stmt_iterator i;
3697 }
3706 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
3707 Otherwise nodes that compare equal according to operand_equal_p might
3708 get different hash codes. However, don't do this for machine specific
3709 or front end builtins, since the function code is overloaded in those
3710 cases. */
3713 {
3716 }
3717 /* FALL THROUGH */
3720 {
3724 }
3728 {
3729 /* DECL's have a unique ID */
3731 }
3733 {
3734 /* For comparisons that can be swapped, use the lower
3735 tree code. */
3742 }
3744 {
3745 /* NOP_EXPR and CONVERT_EXPR are considered equal by
3746 operand_equal_p. */
3750 /* Don't hash the type, that can lead to having nodes which
3751 compare equal according to operand_equal_p, but which
3752 have different hash codes. Make sure to include signedness
3753 in the hash computation. */
3756 }
3757 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
3765 /* Don't ICE on FE specific trees, or their arguments etc.
3766 during operand_equal_p hash verification. */
3769 else
3770 {
3776 {
3803 {
3804 /* The multiplication operands are commutative. */
3811 }
3819 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
3820 Usually different TARGET_EXPRs just should use
3821 different temporaries in their slots. */
3825 /* Virtual table call. */
3833 }
3835 /* Don't hash the type, that can lead to having nodes which
3836 compare equal according to operand_equal_p, but which
3837 have different hash codes. */
3839 {
3840 /* Make sure to include signness in the hash computation. */
3843 }
3846 {
3847 /* It's a commutative expression. We want to hash it the same
3848 however it appears. We do this by first hashing both operands
3849 and then rehashing based on the order of their independent
3850 hashes. */
3855 }
3856 else
3860 }
3862 }
3863 }
3865 bool
3868 {
3869 /* When checking, verify at the outermost operand_equal_p call that
3870 if operand_equal_p returns non-zero then ARG0 and ARG1 has the same
3871 hash value. */
3873 {
3875 {
3877 {
3884 }
3886 }
3887 else
3891 }
3894 }
3899 /* Conveinece wrapper around operand_compare class because usually we do
3900 not need to play with the valueizer. */
3902 bool
3904 {
3906 }
3908 namespace inchash
3909 {
3911 /* Generate a hash value for an expression. This can be used iteratively
3912 by passing a previous result as the HSTATE argument.
3914 This function is intended to produce the same hash for expressions which
3915 would compare equal using operand_equal_p. */
3916 void
3918 {
3920 }
3922 }
3923 \f
3924 /* Similar to operand_equal_p, but see if ARG0 might be a variant of ARG1
3925 with a different signedness or a narrower precision. */
3927 static bool
3929 {
3937 /* Discard any conversions that don't change the modes of ARG0 and ARG1
3938 and see if the inner values are the same. This removes any
3939 signedness comparison, which doesn't matter here. */
3947 /* Discard a single widening conversion from ARG1 and see if the inner
3948 value is the same as ARG0. */
3957 }
3958 \f
3959 /* See if ARG is an expression that is either a comparison or is performing
3960 arithmetic on comparisons. The comparisons must only be comparing
3961 two different values, which will be stored in *CVAL1 and *CVAL2; if
3962 they are nonzero it means that some operands have already been found.
3963 No variables may be used anywhere else in the expression except in the
3964 comparisons.
3966 If this is true, return 1. Otherwise, return zero. */
3968 static bool
3970 {
3974 /* We can handle some of the tcc_expression cases here. */
3983 {
4002 /* First see if we can handle the first operand, then the second. For
4003 the second operand, we know *CVAL1 can't be zero. It must be that
4004 one side of the comparison is each of the values; test for the
4005 case where this isn't true by failing if the two operands
4006 are the same. */
4015 ;
4019 ;
4020 else
4024 ;
4028 ;
4029 else
4036 }
4037 }
4038 \f
4039 /* ARG is a tree that is known to contain just arithmetic operations and
4040 comparisons. Evaluate the operations in the tree substituting NEW0 for
4041 any occurrence of OLD0 as an operand of a comparison and likewise for
4042 NEW1 and OLD1. */
4044 static tree
4047 {
4052 /* We can handle some of the tcc_expression cases here. */
4060 {
4075 {
4094 }
4095 /* Fall through - ??? */
4098 {
4102 /* We need to check both for exact equality and tree equality. The
4103 former will be true if the operand has a side-effect. In that
4104 case, we know the operand occurred exactly once. */
4117 }
4121 }
4122 }
4123 \f
4124 /* Return a tree for the case when the result of an expression is RESULT
4125 converted to TYPE and OMITTED was previously an operand of the expression
4126 but is now not needed (e.g., we folded OMITTED * 0).
4128 If OMITTED has side effects, we must evaluate it. Otherwise, just do
4129 the conversion of RESULT to TYPE. */
4131 tree
4133 {
4136 /* If the resulting operand is an empty statement, just return the omitted
4137 statement casted to void. */
4147 }
4149 /* Return a tree for the case when the result of an expression is RESULT
4150 converted to TYPE and OMITTED1 and OMITTED2 were previously operands
4151 of the expression but are now not needed.
4153 If OMITTED1 or OMITTED2 has side effects, they must be evaluated.
4154 If both OMITTED1 and OMITTED2 have side effects, OMITTED1 is
4155 evaluated before OMITTED2. Otherwise, if neither has side effects,
4156 just do the conversion of RESULT to TYPE. */
4158 tree
4161 {
4170 }
4172 \f
4173 /* Return a simplified tree node for the truth-negation of ARG. This
4174 never alters ARG itself. We assume that ARG is an operation that
4175 returns a truth value (0 or 1).
4177 FIXME: one would think we would fold the result, but it causes
4178 problems with the dominator optimizer. */
4180 static tree
4182 {
4187 /* If this is a comparison, we can simply invert it, except for
4188 floating-point non-equality comparisons, in which case we just
4189 enclose a TRUTH_NOT_EXPR around what we have. */
4192 {
4195 && flag_trapping_math
4209 }
4212 {
4231 /* Here we can invert either operand. We invert the first operand
4232 unless the second operand is a TRUTH_NOT_EXPR in which case our
4233 result is the XOR of the first operand with the inside of the
4234 negation of the second operand. */
4239 else
4262 {
4269 /* A COND_EXPR may have a throw as one operand, which
4270 then has void type. Just leave void operands
4271 as they are. */
4277 }
4289 CASE_CONVERT:
4293 /* fall through */
4315 }
4316 }
4318 /* Fold the truth-negation of ARG. This never alters ARG itself. We
4319 assume that ARG is an operation that returns a truth value (0 or 1
4320 for scalars, 0 or -1 for vectors). Return the folded expression if
4321 folding is successful. Otherwise, return NULL_TREE. */
4323 static tree
4325 {
4328 ? BIT_NOT_EXPR
4331 }
4333 /* Return a simplified tree node for the truth-negation of ARG. This
4334 never alters ARG itself. We assume that ARG is an operation that
4335 returns a truth value (0 or 1 for scalars, 0 or -1 for vectors). */
4337 tree
4339 {
4345 ? BIT_NOT_EXPR
4348 }
4349 \f
4350 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
4351 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero
4352 and uses reverse storage order if REVERSEP is nonzero. ORIG_INNER
4353 is the original memory reference used to preserve the alias set of
4354 the access. */
4356 static tree
4360 {
4363 /* Attempt not to lose the access path if possible. */
4365 {
4367 machine_mode nmode;
4369 tree noffset;
4377 && !reversep
4378 && !nreversep
4380 {
4383 }
4384 }
4393 {
4400 }
4415 }
4417 /* Optimize a bit-field compare.
4419 There are two cases: First is a compare against a constant and the
4420 second is a comparison of two items where the fields are at the same
4421 bit position relative to the start of a chunk (byte, halfword, word)
4422 large enough to contain it. In these cases we can avoid the shift
4423 implicit in bitfield extractions.
4425 For constants, we emit a compare of the shifted constant with the
4426 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
4427 compared. For two fields at the same position, we do the ANDs with the
4428 similar mask and compare the result of the ANDs.
4430 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
4431 COMPARE_TYPE is the type of the comparison, and LHS and RHS
4432 are the left and right operands of the comparison, respectively.
4434 If the optimization described above can be done, we return the resulting
4435 tree. Otherwise we return zero. */
4437 static tree
4440 {
4444 tree unsigned_type;
4447 scalar_int_mode nmode;
4452 tree mask;
4453 tree offset;
4455 /* Get all the information about the extractions being done. If the bit size
4456 is the same as the size of the underlying object, we aren't doing an
4457 extraction at all and so can do nothing. We also don't want to
4458 do anything if the inner expression is a PLACEHOLDER_EXPR since we
4459 then will no longer be able to replace it. */
4474 else
4475 {
4476 /* If this is not a constant, we can only do something if bit positions,
4477 sizes, signedness and storage order are the same. */
4478 rinner
4491 }
4493 /* Honor the C++ memory model and mimic what RTL expansion does. */
4497 {
4501 }
4503 /* See if we can find a mode to refer to this field. We should be able to,
4504 but fail if we can't. */
4512 /* Set signed and unsigned types of the precision of this mode for the
4513 shifts below. */
4516 /* Compute the bit position and size for the new reference and our offset
4517 within it. If the new reference is the same size as the original, we
4518 won't optimize anything, so return zero. */
4528 /* Make the mask to be used against the extracted field. */
4535 {
4539 /* If not comparing with constant, just rework the comparison
4540 and return. */
4548 }
4550 /* Otherwise, we are handling the constant case. See if the constant is too
4551 big for the field. Warn and return a tree for 0 (false) if so. We do
4552 this not only for its own sake, but to avoid having to test for this
4553 error case below. If we didn't, we might generate wrong code.
4555 For unsigned fields, the constant shifted right by the field length should
4556 be all zero. For signed fields, the high-order bits should agree with
4557 the sign bit. */
4560 {
4562 {
4566 }
4567 }
4568 else
4569 {
4572 {
4576 }
4577 }
4582 /* Single-bit compares should always be against zero. */
4584 {
4587 }
4589 /* Make a new bitfield reference, shift the constant over the
4590 appropriate number of bits and mask it with the computed mask
4591 (in case this was a signed field). If we changed it, make a new one. */
4599 mask);
4604 }
4605 \f
4606 /* Subroutine for fold_truth_andor_1: decode a field reference.
4608 If EXP is a comparison reference, we return the innermost reference.
4610 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
4611 set to the starting bit number.
4613 If the innermost field can be completely contained in a mode-sized
4614 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
4616 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
4617 otherwise it is not changed.
4619 *PUNSIGNEDP is set to the signedness of the field.
4621 *PREVERSEP is set to the storage order of the field.
4623 *PMASK is set to the mask used. This is either contained in a
4624 BIT_AND_EXPR or derived from the width of the field.
4626 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
4628 Return 0 if this is not a component reference or is one that we can't
4629 do anything with. */
4631 static tree
4636 {
4641 tree unsigned_type;
4644 /* All the optimizations using this function assume integer fields.
4645 There are problems with FP fields since the type_for_size call
4646 below can fail for, e.g., XFmode. */
4650 /* We are interested in the bare arrangement of bits, so strip everything
4651 that doesn't affect the machine mode. However, record the type of the
4652 outermost expression if it may matter below. */
4659 {
4665 }
4676 /* Reject out-of-bound accesses (PR79731). */
4688 /* If the number of bits in the reference is the same as the bitsize of
4689 the outer type, then the outer type gives the signedness. Otherwise
4690 (in case of a small bitfield) the signedness is unchanged. */
4694 /* Compute the mask to access the bitfield. */
4702 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
4710 }
4712 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
4713 bit positions and MASK is SIGNED. */
4715 static bool
4717 {
4721 /* If this function returns true when the type of the mask is
4722 UNSIGNED, then there will be errors. In particular see
4723 gcc.c-torture/execute/990326-1.c. There does not appear to be
4724 any documentation paper trail as to why this is so. But the pre
4725 wide-int worked with that restriction and it has been preserved
4726 here. */
4731 }
4733 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
4734 represents the sign bit of EXP's type. If EXP represents a sign
4735 or zero extension, also test VAL against the unextended type.
4736 The return value is the (sub)expression whose sign bit is VAL,
4737 or NULL_TREE otherwise. */
4739 tree
4741 {
4743 tree t;
4745 /* Tree EXP must have an integral type. */
4750 /* Tree VAL must be an integer constant. */
4759 /* Handle extension from a narrower type. */
4765 }
4767 /* Subroutine for fold_truth_andor_1: determine if an operand is simple enough
4768 to be evaluated unconditionally. */
4770 static bool
4772 {
4773 /* Strip any conversions that don't change the machine mode. */
4782 /* Don't regard global variables as simple. They may be
4783 allocated in ways unknown to the compiler (shared memory,
4784 #pragma weak, etc). */
4787 /* Weakrefs are not safe to be read, since they can be NULL.
4788 They are !TREE_PUBLIC && !DECL_EXTERNAL but still
4789 have DECL_WEAK flag set. */
4791 /* Loading a static variable is unduly expensive, but global
4792 registers aren't expensive. */
4794 }
4796 /* Subroutine for fold_truth_andor: determine if an operand is simple enough
4797 to be evaluated unconditionally.
4798 I addition to simple_operand_p, we assume that comparisons, conversions,
4799 and logic-not operations are simple, if their operands are simple, too. */
4801 static bool
4803 {
4822 }
4824 \f
4825 /* The following functions are subroutines to fold_range_test and allow it to
4826 try to change a logical combination of comparisons into a range test.
4828 For example, both
4829 X == 2 || X == 3 || X == 4 || X == 5
4830 and
4831 X >= 2 && X <= 5
4832 are converted to
4833 (unsigned) (X - 2) <= 3
4835 We describe each set of comparisons as being either inside or outside
4836 a range, using a variable named like IN_P, and then describe the
4837 range with a lower and upper bound. If one of the bounds is omitted,
4838 it represents either the highest or lowest value of the type.
4840 In the comments below, we represent a range by two numbers in brackets
4841 preceded by a "+" to designate being inside that range, or a "-" to
4842 designate being outside that range, so the condition can be inverted by
4843 flipping the prefix. An omitted bound is represented by a "-". For
4844 example, "- [-, 10]" means being outside the range starting at the lowest
4845 possible value and ending at 10, in other words, being greater than 10.
4846 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
4847 always false.
4849 We set up things so that the missing bounds are handled in a consistent
4850 manner so neither a missing bound nor "true" and "false" need to be
4851 handled using a special case. */
4853 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
4854 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
4855 and UPPER1_P are nonzero if the respective argument is an upper bound
4856 and zero for a lower. TYPE, if nonzero, is the type of the result; it
4857 must be specified for a comparison. ARG1 will be converted to ARG0's
4858 type if both are specified. */
4860 static tree
4863 {
4864 tree tem;
4868 /* If neither arg represents infinity, do the normal operation.
4869 Else, if not a comparison, return infinity. Else handle the special
4870 comparison rules. Note that most of the cases below won't occur, but
4871 are handled for consistency. */
4874 {
4879 }
4884 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
4885 for neither. In real maths, we cannot assume open ended ranges are
4886 the same. But, this is computer arithmetic, where numbers are finite.
4887 We can therefore make the transformation of any unbounded range with
4888 the value Z, Z being greater than any representable number. This permits
4889 us to treat unbounded ranges as equal. */
4893 {
4914 }
4917 }
4918 \f
4919 /* Helper routine for make_range. Perform one step for it, return
4920 new expression if the loop should continue or NULL_TREE if it should
4921 stop. */
4923 tree
4927 {
4933 {
4935 /* We can only do something if the range is testing for zero. */
4944 /* We can only do something if the range is testing for zero
4945 and if the second operand is an integer constant. Note that
4946 saying something is "in" the range we make is done by
4947 complementing IN_P since it will set in the initial case of
4948 being not equal to zero; "out" is leaving it alone. */
4955 {
4976 }
4978 /* If this is an unsigned comparison, we also know that EXP is
4979 greater than or equal to zero. We base the range tests we make
4980 on that fact, so we record it here so we can parse existing
4981 range tests. We test arg0_type since often the return type
4982 of, e.g. EQ_EXPR, is boolean. */
4984 {
4988 NULL_TREE))
4993 /* If the high bound is missing, but we have a nonzero low
4994 bound, reverse the range so it goes from zero to the low bound
4995 minus 1. */
4997 {
5002 }
5003 }
5011 /* If flag_wrapv and ARG0_TYPE is signed, make sure
5012 low and high are non-NULL, then normalize will DTRT. */
5015 {
5020 }
5022 /* (-x) IN [a,b] -> x in [-b, -a] */
5034 /* ~ X -> -X - 1 */
5043 /* If flag_wrapv and ARG0_TYPE is signed, then we cannot
5044 move a constant to the other side. */
5049 /* If EXP is signed, any overflow in the computation is undefined,
5050 so we don't worry about it so long as our computations on
5051 the bounds don't overflow. For unsigned, overflow is defined
5052 and this is exactly the right thing. */
5064 normalize:
5065 /* Check for an unsigned range which has wrapped around the maximum
5066 value thus making n_high < n_low, and normalize it. */
5068 {
5074 /* If the range is of the form +/- [ x+1, x ], we won't
5075 be able to normalize it. But then, it represents the
5076 whole range or the empty set, so make it
5077 +/- [ -, - ]. */
5081 else
5083 }
5084 else
5092 CASE_CONVERT:
5110 /* If we're converting arg0 from an unsigned type, to exp,
5111 a signed type, we will be doing the comparison as unsigned.
5112 The tests above have already verified that LOW and HIGH
5113 are both positive.
5115 So we have to ensure that we will handle large unsigned
5116 values the same way that the current signed bounds treat
5117 negative values. */
5120 {
5121 tree high_positive;
5122 tree equiv_type;
5123 /* For fixed-point modes, we need to pass the saturating flag
5124 as the 2nd parameter. */
5126 equiv_type
5129 else
5130 equiv_type
5133 /* A range without an upper bound is, naturally, unbounded.
5134 Since convert would have cropped a very large value, use
5135 the max value for the destination type. */
5136 high_positive
5143 high_positive),
5146 /* If the low bound is specified, "and" the range with the
5147 range for which the original unsigned value will be
5148 positive. */
5150 {
5153 integer_zero_node),
5154 high_positive))
5158 }
5159 else
5160 {
5161 /* Otherwise, "or" the range with the range of the input
5162 that will be interpreted as negative. */
5165 integer_zero_node),
5166 high_positive))
5170 }
5171 }
5180 }
5181 }
5183 /* Given EXP, a logical expression, set the range it is testing into
5184 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
5185 actually being tested. *PLOW and *PHIGH will be made of the same
5186 type as the returned expression. If EXP is not a comparison, we
5187 will most likely not be returning a useful value and range. Set
5188 *STRICT_OVERFLOW_P to true if the return value is only valid
5189 because signed overflow is undefined; otherwise, do not change
5190 *STRICT_OVERFLOW_P. */
5192 tree
5195 {
5203 /* Start with simply saying "EXP != 0" and then look at the code of EXP
5204 and see if we can refine the range. Some of the cases below may not
5205 happen, but it doesn't seem worth worrying about this. We "continue"
5206 the outer loop when we've changed something; otherwise we "break"
5207 the switch, which will "break" the while. */
5213 {
5219 {
5227 }
5236 }
5238 /* If EXP is a constant, we can evaluate whether this is true or false. */
5240 {
5247 }
5251 }
5253 /* Returns TRUE if [LOW, HIGH] range check can be optimized to
5254 a bitwise check i.e. when
5255 LOW == 0xXX...X00...0
5256 HIGH == 0xXX...X11...1
5257 Return corresponding mask in MASK and stem in VALUE. */
5259 static bool
5262 {
5285 }
5286 \f
5287 /* Helper routine for build_range_check and match.pd. Return the type to
5288 perform the check or NULL if it shouldn't be optimized. */
5290 tree
5292 {
5293 /* First make sure that arithmetics in this type is valid, then make sure
5294 that it wraps around. */
5299 {
5302 /* Check if (unsigned) INT_MAX + 1 == (unsigned) INT_MIN
5303 for the type in question, as we rely on this here. */
5313 else
5315 }
5319 }
5321 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
5322 type, TYPE, return an expression to test if EXP is in (or out of, depending
5323 on IN_P) the range. Return 0 if the test couldn't be created. */
5325 tree
5328 {
5331 /* Disable this optimization for function pointer expressions
5332 on targets that require function pointer canonicalization. */
5339 {
5345 }
5367 value);
5370 {
5372 {
5376 }
5378 }
5380 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
5382 {
5386 {
5388 {
5391 etype
5393 else
5396 }
5399 }
5400 }
5402 /* Optimize (c>=low) && (c<=high) into (c-low>=0) && (c-low<=high-low).
5403 This requires wrap-around arithmetics for the type of the expression. */
5420 }
5421 \f
5422 /* Return the predecessor of VAL in its type, handling the infinite case. */
5424 static tree
5426 {
5432 else
5435 }
5437 /* Return the successor of VAL in its type, handling the infinite case. */
5439 static tree
5441 {
5447 else
5450 }
5452 /* Given two ranges, see if we can merge them into one. Return 1 if we
5453 can, 0 if we can't. Set the output range into the specified parameters. */
5455 bool
5458 {
5462 tree tem;
5472 /* Make range 0 be the range that starts first, or ends last if they
5473 start at the same value. Swap them if it isn't. */
5476 || (lowequal
5479 {
5483 }
5485 /* If the second range is != high1 where high1 is the type maximum of
5486 the type, try first merging with < high1 range. */
5488 && high1
5495 {
5500 /* Similarly for the second range != low1 where low1 is the type minimum
5501 of the type, try first merging with > low1 range. */
5506 }
5508 /* Now flag two cases, whether the ranges are disjoint or whether the
5509 second range is totally subsumed in the first. Note that the tests
5510 below are simplified by the ones above. */
5516 /* We now have four cases, depending on whether we are including or
5517 excluding the two ranges. */
5519 {
5520 /* If they don't overlap, the result is false. If the second range
5521 is a subset it is the result. Otherwise, the range is from the start
5522 of the second to the end of the first. */
5527 else
5529 }
5532 {
5533 /* If they don't overlap, the result is the first range. If they are
5534 equal, the result is false. If the second range is a subset of the
5535 first, and the ranges begin at the same place, we go from just after
5536 the end of the second range to the end of the first. If the second
5537 range is not a subset of the first, or if it is a subset and both
5538 ranges end at the same place, the range starts at the start of the
5539 first range and ends just before the second range.
5540 Otherwise, we can't describe this as a single range. */
5546 {
5551 {
5552 /* We are in the weird situation where high0 > high1 but
5553 high1 has no successor. Punt. */
5555 }
5556 }
5558 {
5563 {
5564 /* low0 < low1 but low1 has no predecessor. Punt. */
5566 }
5567 }
5568 else
5570 }
5573 {
5574 /* If they don't overlap, the result is the second range. If the second
5575 is a subset of the first, the result is false. Otherwise,
5576 the range starts just after the first range and ends at the
5577 end of the second. */
5582 else
5583 {
5588 {
5589 /* high1 > high0 but high0 has no successor. Punt. */
5591 }
5592 }
5593 }
5595 else
5596 {
5597 /* The case where we are excluding both ranges. Here the complex case
5598 is if they don't overlap. In that case, the only time we have a
5599 range is if they are adjacent. If the second is a subset of the
5600 first, the result is the first. Otherwise, the range to exclude
5601 starts at the beginning of the first range and ends at the end of the
5602 second. */
5604 {
5609 else
5610 {
5611 /* Canonicalize - [min, x] into - [-, x]. */
5614 {
5617 GET_MODE_BITSIZE
5620 /* FALLTHROUGH */
5633 }
5635 /* Canonicalize - [x, max] into - [x, -]. */
5638 {
5641 GET_MODE_BITSIZE
5644 /* FALLTHROUGH */
5660 }
5662 /* The ranges might be also adjacent between the maximum and
5663 minimum values of the given type. For
5664 - [{min,-}, x] and - [y, {max,-}] ranges where x + 1 < y
5665 return + [x + 1, y - 1]. */
5667 {
5674 }
5675 else
5677 }
5678 }
5681 else
5683 }
5687 }
5688 \f
5690 /* Subroutine of fold, looking inside expressions of the form
5691 A op B ? A : C, where ARG0, ARG1 and ARG2 are the three operands
5692 of the COND_EXPR. This function is being used also to optimize
5693 A op B ? C : A, by reversing the comparison first.
5695 Return a folded expression whose code is not a COND_EXPR
5696 anymore, or NULL_TREE if no folding opportunity is found. */
5698 static tree
5701 {
5706 tree tem;
5711 /* If we have A op 0 ? A : -A, consider applying the following
5712 transformations:
5714 A == 0? A : -A same as -A
5715 A != 0? A : -A same as A
5716 A >= 0? A : -A same as abs (A)
5717 A > 0? A : -A same as abs (A)
5718 A <= 0? A : -A same as -abs (A)
5719 A < 0? A : -A same as -abs (A)
5721 None of these transformations work for modes with signed
5722 zeros. If A is +/-0, the first two transformations will
5723 change the sign of the result (from +0 to -0, or vice
5724 versa). The last four will fix the sign of the result,
5725 even though the original expressions could be positive or
5726 negative, depending on the sign of A.
5728 Note that all these transformations are correct if A is
5729 NaN, since the two alternatives (A and -A) are also NaNs. */
5736 /* In the case that A is of the form X-Y, '-A' (arg2) may
5737 have already been folded to Y-X, check for that. */
5745 {
5757 /* Fall through. */
5768 /* FALLTHRU */
5778 }
5780 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
5781 A == 0 ? A : 0 is always 0 unless A is -0. Note that
5782 both transformations are correct when A is NaN: A != 0
5783 is then true, and A == 0 is false. */
5787 {
5792 }
5794 /* Try some transformations of A op B ? A : B.
5796 A == B? A : B same as B
5797 A != B? A : B same as A
5798 A >= B? A : B same as max (A, B)
5799 A > B? A : B same as max (B, A)
5800 A <= B? A : B same as min (A, B)
5801 A < B? A : B same as min (B, A)
5803 As above, these transformations don't work in the presence
5804 of signed zeros. For example, if A and B are zeros of
5805 opposite sign, the first two transformations will change
5806 the sign of the result. In the last four, the original
5807 expressions give different results for (A=+0, B=-0) and
5808 (A=-0, B=+0), but the transformed expressions do not.
5810 The first two transformations are correct if either A or B
5811 is a NaN. In the first transformation, the condition will
5812 be false, and B will indeed be chosen. In the case of the
5813 second transformation, the condition A != B will be true,
5814 and A will be chosen.
5816 The conversions to max() and min() are not correct if B is
5817 a number and A is not. The conditions in the original
5818 expressions will be false, so all four give B. The min()
5819 and max() versions would give a NaN instead. */
5822 /* Avoid these transformations if the COND_EXPR may be used
5823 as an lvalue in the C++ front-end. PR c++/19199. */
5824 && (in_gimple_form
5830 {
5836 {
5845 /* In C++ a ?: expression can be an lvalue, so put the
5846 operand which will be used if they are equal first
5847 so that we can convert this back to the
5848 corresponding COND_EXPR. */
5850 {
5858 }
5865 {
5873 }
5886 }
5887 }
5890 }
5893 \f
5894 #ifndef LOGICAL_OP_NON_SHORT_CIRCUIT
5895 #define LOGICAL_OP_NON_SHORT_CIRCUIT \
5896 (BRANCH_COST (optimize_function_for_speed_p (cfun), \
5897 false) >= 2)
5898 #endif
5900 /* EXP is some logical combination of boolean tests. See if we can
5901 merge it into some range test. Return the new tree if so. */
5903 static tree
5906 {
5922 /* If this is an OR operation, invert both sides; we will invert
5923 again at the end. */
5927 /* If both expressions are the same, if we can merge the ranges, and we
5928 can build the range test, return it or it inverted. If one of the
5929 ranges is always true or always false, consider it to be the same
5930 expression as the other. */
5938 {
5942 }
5944 /* On machines where the branch cost is expensive, if this is a
5945 short-circuited branch and the underlying object on both sides
5946 is the same, make a non-short-circuit operation. */
5949 logical_op_non_short_circuit
5952 && !flag_sanitize_coverage
5956 {
5957 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
5958 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
5959 which cases we can't do this. */
5967 {
5976 {
5979 WARN_STRICT_OVERFLOW_COMPARISON);
5983 }
5984 }
5985 }
5988 }
5989 \f
5990 /* Subroutine for fold_truth_andor_1: C is an INTEGER_CST interpreted as a P
5991 bit value. Arrange things so the extra bits will be set to zero if and
5992 only if C is signed-extended to its full width. If MASK is nonzero,
5993 it is an INTEGER_CST that should be AND'ed with the extra bits. */
5995 static tree
5997 {
6000 tree temp;
6005 /* We work by getting just the sign bit into the low-order bit, then
6006 into the high-order bit, then sign-extend. We then XOR that value
6007 with C. */
6011 /* We must use a signed type in order to get an arithmetic right shift.
6012 However, we must also avoid introducing accidental overflows, so that
6013 a subsequent call to integer_zerop will work. Hence we must
6014 do the type conversion here. At this point, the constant is either
6015 zero or one, and the conversion to a signed type can never overflow.
6016 We could get an overflow if this conversion is done anywhere else. */
6025 /* If necessary, convert the type back to match the type of C. */
6030 }
6031 \f
6032 /* For an expression that has the form
6033 (A && B) || ~B
6034 or
6035 (A || B) && ~B,
6036 we can drop one of the inner expressions and simplify to
6037 A || ~B
6038 or
6039 A && ~B
6040 LOC is the location of the resulting expression. OP is the inner
6041 logical operation; the left-hand side in the examples above, while CMPOP
6042 is the right-hand side. RHS_ONLY is used to prevent us from accidentally
6043 removing a condition that guards another, as in
6044 (A != NULL && A->...) || A == NULL
6045 which we must not transform. If RHS_ONLY is true, only eliminate the
6046 right-most operand of the inner logical operation. */
6048 static tree
6051 {
6069 {
6072 {
6075 }
6076 }
6078 {
6081 {
6084 }
6085 }
6100 }
6102 /* Find ways of folding logical expressions of LHS and RHS:
6103 Try to merge two comparisons to the same innermost item.
6104 Look for range tests like "ch >= '0' && ch <= '9'".
6105 Look for combinations of simple terms on machines with expensive branches
6106 and evaluate the RHS unconditionally.
6108 For example, if we have p->a == 2 && p->b == 4 and we can make an
6109 object large enough to span both A and B, we can do this with a comparison
6110 against the object ANDed with the a mask.
6112 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
6113 operations to do this with one comparison.
6115 We check for both normal comparisons and the BIT_AND_EXPRs made this by
6116 function and the one above.
6118 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
6119 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
6121 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
6122 two operands.
6124 We return the simplified tree or 0 if no optimization is possible. */
6126 static tree
6129 {
6130 /* If this is the "or" of two comparisons, we can do something if
6131 the comparisons are NE_EXPR. If this is the "and", we can do something
6132 if the comparisons are EQ_EXPR. I.e.,
6133 (a->b == 2 && a->c == 4) can become (a->new == NEW).
6135 WANTED_CODE is this operation code. For single bit fields, we can
6136 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
6137 comparison for one-bit fields. */
6158 /* Start by getting the comparison codes. Fail if anything is volatile.
6159 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
6160 it were surrounded with a NE_EXPR. */
6169 {
6173 }
6176 {
6180 }
6191 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
6194 {
6197 {
6202 }
6205 {
6211 }
6212 }
6217 /* If the RHS can be evaluated unconditionally and its operands are
6218 simple, it wins to evaluate the RHS unconditionally on machines
6219 with expensive branches. In this case, this isn't a comparison
6220 that can be merged. */
6227 {
6228 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
6239 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
6249 }
6251 /* See if the comparisons can be merged. Then get all the parameters for
6252 each side. */
6277 /* It must be true that the inner operation on the lhs of each
6278 comparison must be the same if we are to be able to do anything.
6279 Then see if we have constants. If not, the same must be true for
6280 the rhs's. */
6289 {
6292 }
6297 else
6300 /* If either comparison code is not correct for our logical operation,
6301 fail. However, we can convert a one-bit comparison against zero into
6302 the opposite comparison against that bit being set in the field. */
6306 {
6308 {
6309 /* Make the left operand unsigned, since we are only interested
6310 in the value of one bit. Otherwise we are doing the wrong
6311 thing below. */
6314 }
6315 else
6317 }
6319 /* This is analogous to the code for l_const above. */
6321 {
6323 {
6326 }
6327 else
6329 }
6331 /* See if we can find a mode that contains both fields being compared on
6332 the left. If we can't, fail. Otherwise, update all constants and masks
6333 to be relative to a field of that size. */
6347 {
6350 }
6358 {
6365 {
6369 }
6370 }
6372 {
6379 {
6383 }
6384 }
6386 /* If the right sides are not constant, do the same for it. Also,
6387 disallow this optimization if a size, signedness or storage order
6388 mismatch occurs between the left and right sides. */
6390 {
6394 /* Make sure the two fields on the right
6395 correspond to the left without being swapped. */
6412 {
6415 }
6424 /* Make a mask that corresponds to both fields being compared.
6425 Do this for both items being compared. If the operands are the
6426 same size and the bits being compared are in the same position
6427 then we can do this by masking both and comparing the masked
6428 results. */
6435 {
6449 }
6451 /* There is still another way we can do something: If both pairs of
6452 fields being compared are adjacent, we may be able to make a wider
6453 field containing them both.
6455 Note that we still must mask the lhs/rhs expressions. Furthermore,
6456 the mask must be shifted to account for the shift done by
6457 make_bit_field_ref. */
6466 {
6467 tree type;
6483 /* Convert to the smaller type before masking out unwanted bits. */
6486 {
6488 {
6492 }
6494 {
6498 }
6499 }
6508 }
6511 }
6513 /* Handle the case of comparisons with constants. If there is something in
6514 common between the masks, those bits of the constants must be the same.
6515 If not, the condition is always false. Test for this to avoid generating
6516 incorrect code below. */
6521 {
6523 {
6526 }
6527 else
6528 {
6531 }
6532 }
6537 /* Construct the expression we will return. First get the component
6538 reference we will make. Unless the mask is all ones the width of
6539 that field, perform the mask operation. Then compare with the
6540 merged constant. */
6551 }
6552 \f
6553 /* T is an integer expression that is being multiplied, divided, or taken a
6554 modulus (CODE says which and what kind of divide or modulus) by a
6555 constant C. See if we can eliminate that operation by folding it with
6556 other operations already in T. WIDE_TYPE, if non-null, is a type that
6557 should be used for the computation if wider than our type.
6559 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
6560 (X * 2) + (Y * 4). We must, however, be assured that either the original
6561 expression would not overflow or that overflow is undefined for the type
6562 in the language in question.
6564 If we return a non-null expression, it is an equivalent form of the
6565 original computation, but need not be in the original type.
6567 We set *STRICT_OVERFLOW_P to true if the return values depends on
6568 signed overflow being undefined. Otherwise we do not change
6569 *STRICT_OVERFLOW_P. */
6571 static tree
6574 {
6575 /* To avoid exponential search depth, refuse to allow recursion past
6576 three levels. Beyond that (1) it's highly unlikely that we'll find
6577 something interesting and (2) we've probably processed it before
6578 when we built the inner expression. */
6581 tree ret;
6586 depth++;
6588 depth--;
6591 }
6593 static tree
6596 {
6608 /* Don't deal with constants of zero here; they confuse the code below. */
6618 /* Note that we need not handle conditional operations here since fold
6619 already handles those cases. So just do arithmetic here. */
6621 {
6623 /* For a constant, we can always simplify if we are a multiply
6624 or (for divide and modulus) if it is a multiple of our constant. */
6628 {
6631 /* If the multiplication overflowed, we lost information on it.
6632 See PR68142 and PR69845. */
6636 }
6640 /* If op0 is an expression ... */
6646 /* ... and has wrapping overflow, and its type is smaller
6647 than ctype, then we cannot pass through as widening. */
6652 /* ... or this is a truncation (t is narrower than op0),
6653 then we cannot pass through this narrowing. */
6656 /* ... or signedness changes for division or modulus,
6657 then we cannot pass through this conversion. */
6661 /* ... or has undefined overflow while the converted to
6662 type has not, we cannot do the operation in the inner type
6663 as that would introduce undefined overflow. */
6669 /* Pass the constant down and see if we can make a simplification. If
6670 we can, replace this expression with the inner simplification for
6671 possible later conversion to our or some other type. */
6682 /* If widening the type changes it from signed to unsigned, then we
6683 must avoid building ABS_EXPR itself as unsigned. */
6685 {
6689 {
6692 }
6694 }
6695 /* If the constant is negative, we cannot simplify this. */
6698 /* FALLTHROUGH */
6700 /* For division and modulus, type can't be unsigned, as e.g.
6701 (-(x / 2U)) / 2U isn't equal to -((x / 2U) / 2U) for x >= 2.
6702 For signed types, even with wrapping overflow, this is fine. */
6711 /* If widening the type changes the signedness, then we can't perform
6712 this optimization as that changes the result. */
6716 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
6722 {
6729 }
6733 /* If the second operand is constant, this is a multiplication
6734 or floor division, by a power of two, so we can treat it that
6735 way unless the multiplier or divisor overflows. Signed
6736 left-shift overflow is implementation-defined rather than
6737 undefined in C90, so do not convert signed left shift into
6738 multiplication. */
6741 /* const_binop may not detect overflow correctly,
6742 so check for it explicitly here. */
6751 ctype,
6753 t1),
6758 /* See if we can eliminate the operation on both sides. If we can, we
6759 can return a new PLUS or MINUS. If we can't, the only remaining
6760 cases where we can do anything are if the second operand is a
6761 constant. */
6768 /* If not multiplication, we can only do this if both operands
6769 are divisible by c. */
6772 {
6777 }
6779 /* If this was a subtraction, negate OP1 and set it to be an addition.
6780 This simplifies the logic below. */
6782 {
6784 /* If OP1 was not easily negatable, the constant may be OP0. */
6786 {
6789 }
6790 }
6795 /* If either OP1 or C are negative, this optimization is not safe for
6796 some of the division and remainder types while for others we need
6797 to change the code. */
6799 {
6807 }
6809 /* If it's a multiply or a division/modulus operation of a multiple
6810 of our constant, do the operation and verify it doesn't overflow. */
6814 {
6817 /* We allow the constant to overflow with wrapping semantics. */
6821 }
6822 else
6825 /* If we have an unsigned type, we cannot widen the operation since it
6826 will change the result if the original computation overflowed. */
6830 /* The last case is if we are a multiply. In that case, we can
6831 apply the distributive law to commute the multiply and addition
6832 if the multiplication of the constants doesn't overflow
6833 and overflow is defined. With undefined overflow
6834 op0 * c might overflow, while (op0 + orig_op1) * c doesn't.
6835 But fold_plusminus_mult_expr would factor back any power-of-two
6836 value so do not distribute in the first place in this case. */
6844 op1);
6849 /* We have a special case here if we are doing something like
6850 (C * 8) % 4 since we know that's zero. */
6853 /* If the multiplication can overflow we cannot optimize this. */
6858 {
6861 }
6863 /* ... fall through ... */
6867 /* If we can extract our operation from the LHS, do so and return a
6868 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
6869 do something only if the second operand is a constant. */
6885 /* If these are the same operation types, we can associate them
6886 assuming no overflow. */
6888 {
6903 }
6905 /* If these operations "cancel" each other, we have the main
6906 optimizations of this pass, which occur when either constant is a
6907 multiple of the other, in which case we replace this with either an
6908 operation or CODE or TCODE.
6910 If we have an unsigned type, we cannot do this since it will change
6911 the result if the original computation overflowed. */
6918 {
6921 {
6928 }
6931 {
6938 }
6939 }
6944 }
6947 }
6948 \f
6949 /* Return a node which has the indicated constant VALUE (either 0 or
6950 1 for scalars or {-1,-1,..} or {0,0,...} for vectors),
6951 and is of the indicated TYPE. */
6953 tree
6955 {
6964 else
6966 }
6969 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
6970 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
6971 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
6972 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
6973 COND is the first argument to CODE; otherwise (as in the example
6974 given here), it is the second argument. TYPE is the type of the
6975 original expression. Return NULL_TREE if no simplification is
6976 possible. */
6978 static tree
6983 {
6991 /* Do not move possibly trapping operations into the conditional as this
6992 pessimizes code and causes gimplification issues when applied late. */
7000 {
7004 /* If this operand throws an expression, then it does not make
7005 sense to try to perform a logical or arithmetic operation
7006 involving it. */
7011 }
7014 {
7019 }
7020 else
7021 /* Detect the case of mixing vector and scalar types - bail out. */
7027 /* This transformation is only worthwhile if we don't have to wrap ARG
7028 in a SAVE_EXPR and the operation can be simplified without recursing
7029 on at least one of the branches once its pushed inside the COND_EXPR. */
7038 {
7042 else
7044 }
7046 {
7050 else
7052 }
7054 /* Check that we have simplified at least one of the branches. */
7059 }
7061 \f
7062 /* Subroutine of fold() that checks for the addition of +/- 0.0.
7064 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
7065 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
7066 ADDEND is the same as X.
7068 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
7069 and finite. The problematic cases are when X is zero, and its mode
7070 has signed zeros. In the case of rounding towards -infinity,
7071 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
7072 modes, X + 0 is not the same as X because -0 + 0 is 0. */
7074 bool
7076 {
7080 /* Don't allow the fold with -fsignaling-nans. */
7084 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
7088 /* There is no case that is safe for all rounding modes. */
7092 /* In a vector or complex, we would need to check the sign of all zeros. */
7098 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
7102 /* The mode has signed zeros, and we have to honor their sign.
7103 In this situation, there is only one case we can return true for.
7104 X - 0 is the same as X with default rounding. */
7106 }
7108 /* Subroutine of match.pd that optimizes comparisons of a division by
7109 a nonzero integer constant against an integer constant, i.e.
7110 X/C1 op C2.
7112 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
7113 GE_EXPR or LE_EXPR. ARG01 and ARG1 must be a INTEGER_CST. */
7115 enum tree_code
7118 {
7123 /* We have to do this the hard way to detect unsigned overflow.
7124 prod = int_const_binop (MULT_EXPR, c1, c2); */
7130 {
7134 /* Likewise *hi = int_const_binop (PLUS_EXPR, prod, tmp). */
7137 }
7139 {
7142 {
7161 }
7162 }
7163 else
7164 {
7165 /* A negative divisor reverses the relational operators. */
7170 {
7189 }
7190 }
7203 }
7206 /* If CODE with arguments ARG0 and ARG1 represents a single bit
7207 equality/inequality test, then return a simplified form of the test
7208 using a sign testing. Otherwise return NULL. TYPE is the desired
7209 result type. */
7211 static tree
7214 tree result_type)
7215 {
7216 /* If this is testing a single bit, we can optimize the test. */
7220 {
7221 /* If we have (A & C) != 0 where C is the sign bit of A, convert
7222 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
7226 /* This is only a win if casting to a signed type is cheap,
7227 i.e. when arg00's type is not a partial mode. */
7229 {
7232 result_type,
7235 }
7236 }
7239 }
7241 /* If CODE with arguments ARG0 and ARG1 represents a single bit
7242 equality/inequality test, then return a simplified form of
7243 the test using shifts and logical operations. Otherwise return
7244 NULL. TYPE is the desired result type. */
7246 tree
7249 {
7250 /* If this is testing a single bit, we can optimize the test. */
7254 {
7263 /* First, see if we can fold the single bit test into a sign-bit
7264 test. */
7266 result_type);
7270 /* Otherwise we have (A & C) != 0 where C is a single bit,
7271 convert that into ((A >> C2) & 1). Where C2 = log2(C).
7272 Similarly for (A & C) == 0. */
7274 /* If INNER is a right shift of a constant and it plus BITNUM does
7275 not overflow, adjust BITNUM and INNER. */
7281 {
7284 }
7286 /* If we are going to be able to omit the AND below, we must do our
7287 operations as unsigned. If we must use the AND, we have a choice.
7288 Normally unsigned is faster, but for some machines signed is. */
7306 /* Put the AND last so it can combine with more things. */
7309 /* Make sure to return the proper type. */
7313 }
7315 }
7317 /* Test whether it is preferable two swap two operands, ARG0 and
7318 ARG1, for example because ARG0 is an integer constant and ARG1
7319 isn't. */
7321 bool
7323 {
7337 /* It is preferable to swap two SSA_NAME to ensure a canonical form
7338 for commutative and comparison operators. Ensuring a canonical
7339 form allows the optimizers to find additional redundancies without
7340 having to explicitly check for both orderings. */
7346 /* Put SSA_NAMEs last. */
7352 /* Put variables last. */
7359 }
7362 /* Fold A < X && A + 1 > Y to A < X && A >= Y. Normally A + 1 > Y
7363 means A >= Y && A != MAX, but in this case we know that
7364 A < X <= MAX. INEQ is A + 1 > Y, BOUND is A < X. */
7366 static tree
7368 {
7375 else
7384 {
7387 }
7389 {
7392 }
7393 else
7400 {
7401 /* Convert the pointer types into integer before taking the difference. */
7405 }
7406 else
7413 }
7415 /* Fold a sum or difference of at least one multiplication.
7416 Returns the folded tree or NULL if no simplification could be made. */
7418 static tree
7421 {
7425 /* (A * C) +- (B * C) -> (A+-B) * C.
7426 (A * C) +- A -> A * (C+-1).
7427 We are most concerned about the case where C is a constant,
7428 but other combinations show up during loop reduction. Since
7429 it is not difficult, try all four possibilities. */
7432 {
7435 }
7437 {
7440 }
7441 else
7442 {
7443 /* We cannot generate constant 1 for fract. */
7448 }
7450 {
7453 }
7455 {
7457 /* As we canonicalize A - 2 to A + -2 get rid of that sign for
7458 the purpose of this canonicalization. */
7462 {
7465 }
7466 else
7468 }
7469 else
7470 {
7471 /* We cannot generate constant 1 for fract. */
7476 }
7479 /* Prefer factoring a common non-constant. */
7489 /* No identical multiplicands; see if we can find a common
7490 power-of-two factor in non-power-of-two multiplies. This
7491 can help in multi-dimensional array access. */
7493 {
7496 HOST_WIDE_INT tmp;
7498 tree maybe_same;
7500 /* Move min of absolute values to int11. */
7502 {
7507 }
7508 else
7515 /* The remainder should not be a constant, otherwise we
7516 end up folding i * 4 + 2 to (i * 2 + 1) * 2 which has
7517 increased the number of multiplications necessary. */
7519 {
7527 }
7528 }
7535 /* We are neither factoring zero nor minus one. */
7543 /* Same may be zero and thus the operation 'code' may overflow. Likewise
7544 same may be minus one and thus the multiplication may overflow. Perform
7545 the sum operation in an unsigned type. */
7550 /* If the sum evaluated to a constant that is not -INF the multiplication
7551 cannot overflow. */
7558 /* Do not resort to unsigned multiplication because
7559 we lose the no-overflow property of the expression. */
7561 }
7563 /* Subroutine of native_encode_expr. Encode the INTEGER_CST
7564 specified by EXPR into the buffer PTR of length LEN bytes.
7565 Return the number of bytes placed in the buffer, or zero
7566 upon failure. */
7568 static int
7570 {
7582 /* Dry run. */
7588 {
7590 /* Extend EXPR according to TYPE_SIGN if the precision isn't a whole
7591 number of bytes. */
7595 {
7602 else
7604 }
7605 else
7609 }
7611 }
7614 /* Subroutine of native_encode_expr. Encode the FIXED_CST
7615 specified by EXPR into the buffer PTR of length LEN bytes.
7616 Return the number of bytes placed in the buffer, or zero
7617 upon failure. */
7619 static int
7621 {
7625 FIXED_VALUE_TYPE value;
7640 }
7643 /* Subroutine of native_encode_expr. Encode the REAL_CST
7644 specified by EXPR into the buffer PTR of length LEN bytes.
7645 Return the number of bytes placed in the buffer, or zero
7646 upon failure. */
7648 static int
7650 {
7656 /* There are always 32 bits in each long, no matter the size of
7657 the hosts long. We handle floating point representations with
7658 up to 192 bits. */
7667 /* Dry run. */
7676 {
7681 {
7688 else
7690 }
7691 else
7692 {
7695 {
7696 /* Reverse bytes within each long, or within the entire float
7697 if it's smaller than a long (for HFmode). */
7700 }
7701 }
7706 }
7708 }
7710 /* Subroutine of native_encode_expr. Encode the COMPLEX_CST
7711 specified by EXPR into the buffer PTR of length LEN bytes.
7712 Return the number of bytes placed in the buffer, or zero
7713 upon failure. */
7715 static int
7717 {
7719 tree part;
7733 }
7735 /* Like native_encode_vector, but only encode the first COUNT elements.
7736 The other arguments are as for native_encode_vector. */
7738 static int
7741 {
7745 {
7746 /* This is the only case in which elements can be smaller than a byte.
7747 Element 0 is always in the lsb of the containing byte. */
7756 /* Zero the buffer and then set bits later where necessary. */
7765 {
7771 {
7774 }
7775 }
7777 }
7782 {
7784 {
7787 }
7798 }
7800 }
7802 /* Subroutine of native_encode_expr. Encode the VECTOR_CST
7803 specified by EXPR into the buffer PTR of length LEN bytes.
7804 Return the number of bytes placed in the buffer, or zero
7805 upon failure. */
7807 static int
7809 {
7814 }
7817 /* Subroutine of native_encode_expr. Encode the STRING_CST
7818 specified by EXPR into the buffer PTR of length LEN bytes.
7819 Return the number of bytes placed in the buffer, or zero
7820 upon failure. */
7822 static int
7824 {
7827 /* Wide-char strings are encoded in target byte-order so native
7828 encoding them is trivial. */
7843 else
7844 {
7847 {
7850 }
7852 }
7854 }
7857 /* Subroutine of fold_view_convert_expr. Encode the INTEGER_CST,
7858 REAL_CST, COMPLEX_CST or VECTOR_CST specified by EXPR into the
7859 buffer PTR of length LEN bytes. If PTR is NULL, don't actually store
7860 anything, just do a dry run. If OFF is not -1 then start
7861 the encoding at byte offset OFF and encode at most LEN bytes.
7862 Return the number of bytes placed in the buffer, or zero upon failure. */
7864 int
7866 {
7867 /* We don't support starting at negative offset and -1 is special. */
7872 {
7893 }
7894 }
7896 /* Similar to native_encode_expr, but also handle CONSTRUCTORs, VCEs,
7897 NON_LVALUE_EXPRs and nops. */
7899 int
7902 {
7903 /* We don't support starting at negative offset and -1 is special. */
7909 {
7924 {
7925 HOST_WIDE_INT min_index;
7943 {
7949 {
7957 }
7959 {
7963 }
7967 do
7968 {
7973 {
7975 {
7978 fieldsize);
7979 }
7981 ptr
7984 fieldsize,
7988 else
7989 {
7992 }
7993 }
7996 {
7997 /* Partial overlap. */
8002 {
8006 fieldsize);
8007 }
8008 else
8009 {
8013 }
8016 }
8018 }
8020 }
8022 }
8025 {
8032 {
8067 {
8070 fieldsize,
8073 }
8074 else
8075 {
8076 /* Partial overlap. */
8081 {
8085 fieldsize);
8086 }
8087 else
8088 {
8092 }
8095 }
8096 }
8098 }
8100 }
8101 }
8104 /* Subroutine of native_interpret_expr. Interpret the contents of
8105 the buffer PTR of length LEN as an INTEGER_CST of type TYPE.
8106 If the buffer cannot be interpreted, return NULL_TREE. */
8108 static tree
8110 {
8120 }
8123 /* Subroutine of native_interpret_expr. Interpret the contents of
8124 the buffer PTR of length LEN as a FIXED_CST of type TYPE.
8125 If the buffer cannot be interpreted, return NULL_TREE. */
8127 static tree
8129 {
8132 double_int result;
8133 FIXED_VALUE_TYPE fixed_value;
8143 }
8146 /* Subroutine of native_interpret_expr. Interpret the contents of
8147 the buffer PTR of length LEN as a REAL_CST of type TYPE.
8148 If the buffer cannot be interpreted, return NULL_TREE. */
8150 static tree
8152 {
8156 /* There are always 32 bits in each long, no matter the size of
8157 the hosts long. We handle floating point representations with
8158 up to 192 bits. */
8159 REAL_VALUE_TYPE r;
8169 {
8170 /* Both OFFSET and BYTE index within a long;
8171 bitpos indexes the whole float. */
8174 {
8181 else
8183 }
8184 else
8185 {
8188 {
8189 /* Reverse bytes within each long, or within the entire float
8190 if it's smaller than a long (for HFmode). */
8193 }
8194 }
8198 }
8202 }
8205 /* Subroutine of native_interpret_expr. Interpret the contents of
8206 the buffer PTR of length LEN as a COMPLEX_CST of type TYPE.
8207 If the buffer cannot be interpreted, return NULL_TREE. */
8209 static tree
8211 {
8226 }
8228 /* Read a vector of type TYPE from the target memory image given by BYTES,
8229 which contains LEN bytes. The vector is known to be encodable using
8230 NPATTERNS interleaved patterns with NELTS_PER_PATTERN elements each.
8232 Return the vector on success, otherwise return null. */
8234 static tree
8238 {
8242 {
8243 /* This is the only case in which elements can be smaller than a byte.
8244 Element 0 is always in the lsb of the containing byte. */
8251 {
8258 }
8260 }
8268 {
8274 }
8276 }
8278 /* Subroutine of native_interpret_expr. Interpret the contents of
8279 the buffer PTR of length LEN as a VECTOR_CST of type TYPE.
8280 If the buffer cannot be interpreted, return NULL_TREE. */
8282 static tree
8284 {
8285 tree etype;
8296 }
8299 /* Subroutine of fold_view_convert_expr. Interpret the contents of
8300 the buffer PTR of length LEN as a constant of type TYPE. For
8301 INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
8302 we return a REAL_CST, etc... If the buffer cannot be interpreted,
8303 return NULL_TREE. */
8305 tree
8307 {
8309 {
8331 }
8332 }
8334 /* Returns true if we can interpret the contents of a native encoding
8335 as TYPE. */
8337 bool
8339 {
8341 {
8354 }
8355 }
8357 /* Routines for manipulation of native_encode_expr encoded data if the encoded
8358 or extracted constant positions and/or sizes aren't byte aligned. */
8360 /* Shift left the bytes in PTR of SZ elements by AMNT bits, carrying over the
8361 bits between adjacent elements. AMNT should be within
8362 [0, BITS_PER_UNIT).
8363 Example, AMNT = 2:
8364 00011111|11100000 << 2 = 01111111|10000000
8365 PTR[1] | PTR[0] PTR[1] | PTR[0]. */
8367 void
8370 {
8379 {
8385 {
8388 }
8389 }
8390 }
8392 /* Like shift_bytes_in_array_left but for big-endian.
8393 Shift right the bytes in PTR of SZ elements by AMNT bits, carrying over the
8394 bits between adjacent elements. AMNT should be within
8395 [0, BITS_PER_UNIT).
8396 Example, AMNT = 2:
8397 00011111|11100000 >> 2 = 00000111|11111000
8398 PTR[0] | PTR[1] PTR[0] | PTR[1]. */
8400 void
8403 {
8411 {
8418 }
8419 }
8421 /* Try to view-convert VECTOR_CST EXPR to VECTOR_TYPE TYPE by operating
8422 directly on the VECTOR_CST encoding, in a way that works for variable-
8423 length vectors. Return the resulting VECTOR_CST on success or null
8424 on failure. */
8426 static tree
8428 {
8440 /* We can only preserve the semantics of a stepped pattern if the new
8441 vector element is an integer of the same size. */
8446 /* The number of bits needed to encode one element from every pattern
8447 of the original vector. */
8448 unsigned int expr_sequence_bits
8451 /* The number of bits needed to encode one element from every pattern
8452 of the result. */
8453 unsigned int type_sequence_bits
8456 /* Don't try to read more bytes than are available, which can happen
8457 for constant-sized vectors if TYPE has larger elements than EXPR_TYPE.
8458 The general VIEW_CONVERT handling can cope with that case, so there's
8459 no point complicating things here. */
8462 BITS_PER_UNIT);
8467 /* Get enough bytes of EXPR to form the new encoding. */
8475 /* Reencode the bytes as TYPE. */
8479 }
8481 /* Fold a VIEW_CONVERT_EXPR of a constant expression EXPR to type
8482 TYPE at compile-time. If we're unable to perform the conversion
8483 return NULL_TREE. */
8485 static tree
8487 {
8488 /* We support up to 512-bit values (for V8DFmode). */
8492 /* Check that the host and target are sane. */
8505 }
8507 /* Build an expression for the address of T. Folds away INDIRECT_REF
8508 to avoid confusing the gimplify process. */
8510 tree
8512 {
8513 /* The size of the object is not relevant when talking about its address. */
8518 {
8523 }
8533 {
8538 }
8539 else
8543 }
8545 /* Build an expression for the address of T. */
8547 tree
8549 {
8553 }
8555 /* Fold a unary expression of code CODE and type TYPE with operand
8556 OP0. Return the folded expression if folding is successful.
8557 Otherwise, return NULL_TREE. */
8559 tree
8561 {
8562 tree tem;
8563 tree arg0;
8571 {
8574 {
8575 /* Don't use STRIP_NOPS, because signedness of argument type
8576 matters. */
8578 }
8579 else
8580 {
8581 /* Strip any conversions that don't change the mode. This
8582 is safe for every expression, except for a comparison
8583 expression because its signedness is derived from its
8584 operands.
8586 Note that this is done as an internal manipulation within
8587 the constant folder, in order to find the simplest
8588 representation of the arguments so that their form can be
8589 studied. In any cases, the appropriate type conversions
8590 should be put back in the tree that will get out of the
8591 constant folder. */
8593 }
8596 {
8599 {
8603 }
8604 }
8605 }
8612 {
8619 {
8633 /* If this was a conversion, and all we did was to move into
8634 inside the COND_EXPR, bring it back out. But leave it if
8635 it is a conversion from integer to integer and the
8636 result precision is no wider than a word since such a
8637 conversion is cheap and may be optimized away by combine,
8638 while it couldn't if it were outside the COND_EXPR. Then return
8639 so we don't get into an infinite recursion loop taking the
8640 conversion out and then back in. */
8652 && (INTEGRAL_TYPE_P
8665 }
8666 }
8669 {
8675 CASE_CONVERT:
8679 {
8680 /* If we have (type) (a CMP b) and type is an integral type, return
8681 new expression involving the new type. Canonicalize
8682 (type) (a CMP b) to (a CMP b) ? (type) true : (type) false for
8683 non-integral type.
8684 Do not fold the result as that would not simplify further, also
8685 folding again results in recursions. */
8695 }
8697 /* Handle (T *)&A.B.C for A being of type T and B and C
8698 living at offset zero. This occurs frequently in
8699 C++ upcasting and then accessing the base. */
8703 {
8705 tree offset;
8706 machine_mode mode;
8708 tree base
8712 /* If the reference was to a (constant) zero offset, we can use
8713 the address of the base if it has the same base type
8714 as the result type and the pointer type is unqualified. */
8722 }
8726 /* Detect assigning a bitfield. */
8728 && DECL_BIT_FIELD
8730 {
8731 /* Don't leave an assignment inside a conversion
8732 unless assigning a bitfield. */
8734 /* First do the assignment, then return converted constant. */
8739 }
8741 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
8742 constants (if x has signed type, the sign bit cannot be set
8743 in c). This folds extension into the BIT_AND_EXPR.
8744 ??? We don't do it for BOOLEAN_TYPE or ENUMERAL_TYPE because they
8745 very likely don't have maximal range for their precision and this
8746 transformation effectively doesn't preserve non-maximal ranges. */
8750 {
8761 <= HOST_BITS_PER_WIDE_INT
8763 {
8767 cst &= HOST_WIDE_INT_M1U
8771 && !flag_syntax_only
8774 {
8778 }
8779 }
8781 {
8786 }
8787 }
8789 /* Convert (T1)(X p+ Y) into ((T1)X p+ Y), for pointer type, when the new
8790 cast (T1)X will fold away. We assume that this happens when X itself
8791 is a cast. */
8795 {
8799 return fold_build_pointer_plus_loc
8801 }
8803 /* Convert (T1)(~(T2)X) into ~(T1)X if T1 and T2 are integral types
8804 of the same precision, and X is an integer type not narrower than
8805 types T1 or T2, i.e. the cast (T2)X isn't an extension. */
8811 {
8817 }
8819 /* Convert (T1)(X * Y) into (T1)X * (T1)Y if T1 is narrower than the
8820 type of X and Y (integer types only). */
8825 {
8826 /* Be careful not to introduce new overflows. */
8827 tree mult_type;
8830 else
8834 {
8841 }
8842 }
8848 {
8855 }
8866 /* Convert fabs((double)float) into (double)fabsf(float). */
8869 {
8875 targ0));
8876 }
8880 /* Convert ~(X ^ Y) to ~X ^ Y or X ^ ~Y if ~X or ~Y simplify. */
8899 /* Note that the operand of this must be an int
8900 and its values must be 0 or 1.
8901 ("true" is a fixed value perhaps depending on the language,
8902 but we don't handle values other than 1 correctly yet.) */
8909 /* Fold *&X to X if X is an lvalue. */
8911 {
8918 }
8924 }
8927 /* If the operation was a conversion do _not_ mark a resulting constant
8928 with TREE_OVERFLOW if the original constant was not. These conversions
8929 have implementation defined behavior and retaining the TREE_OVERFLOW
8930 flag here would confuse later passes such as VRP. */
8931 tree
8934 {
8943 }
8945 /* Fold a binary bitwise/truth expression of code CODE and type TYPE with
8946 operands OP0 and OP1. LOC is the location of the resulting expression.
8947 ARG0 and ARG1 are the NOP_STRIPed results of OP0 and OP1.
8948 Return the folded expression if folding is successful. Otherwise,
8949 return NULL_TREE. */
8950 static tree
8953 {
8954 tree tem;
8956 /* We only do these simplifications if we are optimizing. */
8960 /* Check for things like (A || B) && (A || C). We can convert this
8961 to A || (B && C). Note that either operator can be any of the four
8962 truth and/or operations and the transformation will still be
8963 valid. Also note that we only care about order for the
8964 ANDIF and ORIF operators. If B contains side effects, this
8965 might change the truth-value of A. */
8972 {
8992 /* This case if tricky because we must either have commutative
8993 operators or else A10 must not have side-effects. */
8999 a01);
9000 }
9002 /* See if we can build a range comparison. */
9008 {
9012 }
9016 {
9020 }
9022 /* Check for the possibility of merging component references. If our
9023 lhs is another similar operation, try to merge its rhs with our
9024 rhs. Then try to merge our lhs and rhs. */
9035 logical_op_non_short_circuit
9038 && !flag_sanitize_coverage
9043 {
9050 /* Transform ((A AND-IF B) AND[-IF] C) into (A AND-IF (B AND C)),
9051 or ((A OR-IF B) OR[-IF] C) into (A OR-IF (B OR C))
9052 We don't want to pack more than two leafs to a non-IF AND/OR
9053 expression.
9054 If tree-code of left-hand operand isn't an AND/OR-IF code and not
9055 equal to IF-CODE, then we don't want to add right-hand operand.
9056 If the inner right-hand side of left-hand operand has
9057 side-effects, or isn't simple, then we can't add to it,
9058 as otherwise we might destroy if-sequence. */
9061 /* Needed for sequence points to handle trappings, and
9062 side-effects. */
9064 {
9066 arg1);
9068 tem);
9069 }
9070 /* Same as above but for (A AND[-IF] (B AND-IF C)) -> ((A AND B) AND-IF C),
9071 or (A OR[-IF] (B OR-IF C) -> ((A OR B) OR-IF C). */
9074 /* Needed for sequence points to handle trappings, and
9075 side-effects. */
9077 {
9082 }
9083 /* Transform (A AND-IF B) into (A AND B), or (A OR-IF B)
9084 into (A OR B).
9085 For sequence point consistancy, we need to check for trapping,
9086 and side-effects. */
9090 }
9093 }
9095 /* Helper that tries to canonicalize the comparison ARG0 CODE ARG1
9096 by changing CODE to reduce the magnitude of constants involved in
9097 ARG0 of the comparison.
9098 Returns a canonicalized comparison tree if a simplification was
9099 possible, otherwise returns NULL_TREE.
9100 Set *STRICT_OVERFLOW_P to true if the canonicalization is only
9101 valid if signed overflow is undefined. */
9103 static tree
9107 {
9112 /* Match A +- CST code arg1. We can change this only if overflow
9113 is undefined. */
9116 /* In principle pointers also have undefined overflow behavior,
9117 but that causes problems elsewhere. */
9124 /* Identify the constant in arg0 and its sign. */
9128 /* Overflowed constants and zero will cause problems. */
9133 /* See if we can reduce the magnitude of the constant in
9134 arg0 by changing the comparison code. */
9135 /* A - CST < arg1 -> A - CST-1 <= arg1. */
9139 /* A + CST > arg1 -> A + CST-1 >= arg1. */
9143 /* A + CST <= arg1 -> A + CST-1 < arg1. */
9147 /* A - CST >= arg1 -> A - CST-1 > arg1. */
9151 else
9155 /* Now build the constant reduced in magnitude. But not if that
9156 would produce one outside of its types range. */
9172 }
9174 /* Canonicalize the comparison ARG0 CODE ARG1 with type TYPE with undefined
9175 overflow further. Try to decrease the magnitude of constants involved
9176 by changing LE_EXPR and GE_EXPR to LT_EXPR and GT_EXPR or vice versa
9177 and put sole constants at the second argument position.
9178 Returns the canonicalized tree if changed, otherwise NULL_TREE. */
9180 static tree
9183 {
9184 tree t;
9189 /* Try canonicalization by simplifying arg0. */
9194 {
9198 }
9200 /* Try canonicalization by simplifying arg1 using the swapped
9201 comparison. */
9209 }
9211 /* Return whether BASE + OFFSET + BITPOS may wrap around the address
9212 space. This is used to avoid issuing overflow warnings for
9213 expressions like &p->x which cannot wrap. */
9215 static bool
9217 {
9224 poly_wide_int wi_offset;
9230 else
9235 precision);
9250 /* We can do slightly better for SIZE if we have an ADDR_EXPR of an
9251 array. */
9260 }
9262 /* Return a positive integer when the symbol DECL is known to have
9263 a nonzero address, zero when it's known not to (e.g., it's a weak
9264 symbol), and a negative integer when the symbol is not yet in the
9265 symbol table and so whether or not its address is zero is unknown.
9266 For function local objects always return positive integer. */
9267 static int
9269 {
9274 /* Function local objects are never NULL. */
9282 }
9284 /* Subroutine of fold_binary. This routine performs all of the
9285 transformations that are common to the equality/inequality
9286 operators (EQ_EXPR and NE_EXPR) and the ordering operators
9287 (LT_EXPR, LE_EXPR, GE_EXPR and GT_EXPR). Callers other than
9288 fold_binary should call fold_binary. Fold a comparison with
9289 tree code CODE and type TYPE with operands OP0 and OP1. Return
9290 the folded comparison or NULL_TREE. */
9292 static tree
9295 {
9305 /* For comparisons of pointers we can decompose it to a compile time
9306 comparison of the base objects and the offsets into the object.
9307 This requires at least one operand being an ADDR_EXPR or a
9308 POINTER_PLUS_EXPR to do more than the operand_equal_p test below. */
9314 {
9317 machine_mode mode;
9321 /* Get base and offset for the access. Strip ADDR_EXPR for
9322 get_inner_reference, but put it back by stripping INDIRECT_REF
9323 off the base object if possible. indirect_baseN will be true
9324 if baseN is not an address but refers to the object itself. */
9327 {
9328 base0
9334 else
9336 }
9338 {
9342 {
9343 base0
9349 else
9351 }
9354 else
9358 {
9365 }
9366 }
9370 {
9371 base1
9377 else
9379 }
9381 {
9385 {
9386 base1
9392 else
9394 }
9397 else
9401 {
9408 }
9409 }
9411 /* If we have equivalent bases we might be able to simplify. */
9415 {
9416 /* We can fold this expression to a constant if the non-constant
9417 offset parts are equal. */
9421 && (equality_code
9422 || (indirect_base0
9425 {
9431 "occur when comparing P +- C1 with "
9433 WARN_STRICT_OVERFLOW_CONDITIONAL);
9436 {
9474 }
9475 }
9476 /* We can simplify the comparison to a comparison of the variable
9477 offset parts if the constant offset parts are equal.
9478 Be careful to use signed sizetype here because otherwise we
9479 mess with array offsets in the wrong way. This is possible
9480 because pointer arithmetic is restricted to retain within an
9481 object and overflow on pointer differences is undefined as of
9482 6.5.6/8 and /9 with respect to the signed ptrdiff_t. */
9484 && (equality_code
9485 || (indirect_base0
9488 {
9489 /* By converting to signed sizetype we cover middle-end pointer
9490 arithmetic which operates on unsigned pointer types of size
9491 type size and ARRAY_REF offsets which are properly sign or
9492 zero extended from their type in case it is narrower than
9493 sizetype. */
9496 else
9500 else
9507 "occur when comparing P +- C1 with "
9509 WARN_STRICT_OVERFLOW_COMPARISON);
9512 }
9513 }
9514 /* For equal offsets we can simplify to a comparison of the
9515 base addresses. */
9517 && (indirect_base0
9519 && (indirect_base1
9524 {
9530 }
9531 /* Comparison between an ordinary (non-weak) symbol and a null
9532 pointer can be eliminated since such symbols must have a non
9533 null address. In C, relational expressions between pointers
9534 to objects and null pointers are undefined. The results
9535 below follow the C++ rules with the additional property that
9536 every object pointer compares greater than a null pointer.
9537 */
9540 /* Avoid folding references to struct members at offset 0 to
9541 prevent tests like '&ptr->firstmember == 0' from getting
9542 eliminated. When ptr is null, although the -> expression
9543 is strictly speaking invalid, GCC retains it as a matter
9544 of QoI. See PR c/44555. */
9547 && indirect_base0
9548 /* The caller guarantees that when one of the arguments is
9549 constant (i.e., null in this case) it is second. */
9551 {
9553 {
9564 }
9565 }
9566 }
9568 /* Transform comparisons of the form X +- C1 CMP Y +- C2 to
9569 X CMP Y +- C2 +- C1 for signed X, Y. This is valid if
9570 the resulting offset is smaller in absolute value than the
9571 original one and has the same sign. */
9580 {
9585 tree cst;
9587 "occur when combining constants around "
9590 /* Put the constant on the side where it doesn't overflow and is
9591 of lower absolute value and of same sign than before. */
9598 {
9601 variable1,
9605 }
9613 {
9619 variable2);
9620 }
9621 }
9627 /* If we are comparing an expression that just has comparisons
9628 of two integer values, arithmetic expressions of those comparisons,
9629 and constants, we can simplify it. There are only three cases
9630 to check: the two values can either be equal, the first can be
9631 greater, or the second can be greater. Fold the expression for
9632 those three values. Since each value must be 0 or 1, we have
9633 eight possibilities, each of which corresponds to the constant 0
9634 or 1 or one of the six possible comparisons.
9636 This handles common cases like (a > b) == 0 but also handles
9637 expressions like ((x > y) - (y > x)) > 0, which supposedly
9638 occur in macroized code. */
9641 {
9645 /* Don't handle degenerate cases here; they should already
9646 have been handled anyway. */
9655 {
9659 /* We can't just pass T to eval_subst in case cval1 or cval2
9660 was the same as ARG1. */
9662 tree high_result
9666 arg1);
9667 tree equal_result
9671 arg1);
9672 tree low_result
9676 arg1);
9678 /* All three of these results should be 0 or 1. Confirm they are.
9679 Then use those values to select the proper code to use. */
9684 {
9685 /* Make a 3-bit mask with the high-order bit being the
9686 value for `>', the next for '=', and the low for '<'. */
9690 {
9692 /* Always false. */
9713 /* Always true. */
9715 }
9718 }
9719 }
9720 }
9723 }
9726 /* Subroutine of fold_binary. Optimize complex multiplications of the
9727 form z * conj(z), as pow(realpart(z),2) + pow(imagpart(z),2). The
9728 argument EXPR represents the expression "z" of type TYPE. */
9730 static tree
9732 {
9737 {
9740 }
9742 {
9745 }
9746 else
9747 {
9751 }
9760 }
9763 /* Helper function for fold_vec_perm. Store elements of VECTOR_CST or
9764 CONSTRUCTOR ARG into array ELTS, which has NELTS elements, and return
9765 true if successful. */
9767 static bool
9769 {
9774 {
9777 }
9779 {
9785 else
9787 }
9788 else
9794 }
9796 /* Attempt to fold vector permutation of ARG0 and ARG1 vectors using SEL
9797 selector. Return the folded VECTOR_CST or CONSTRUCTOR if successful,
9798 NULL_TREE otherwise. */
9800 tree
9802 {
9823 {
9824 HOST_WIDE_INT index;
9830 }
9833 {
9839 }
9840 else
9842 }
9844 /* Try to fold a pointer difference of type TYPE two address expressions of
9845 array references AREF0 and AREF1 using location LOC. Return a
9846 simplified expression for the difference or NULL_TREE. */
9848 static tree
9852 {
9857 /* If the bases are array references as well, recurse. If the bases
9858 are pointer indirections compute the difference of the pointers.
9859 If the bases are equal, we are set. */
9862 && (base_offset
9864 use_pointer_diff)))
9867 && (base_offset
9868 = use_pointer_diff
9878 {
9884 base_offset,
9887 }
9889 }
9891 /* If the real or vector real constant CST of type TYPE has an exact
9892 inverse, return it, else return NULL. */
9894 tree
9896 {
9897 REAL_VALUE_TYPE r;
9898 tree unit_type;
9899 machine_mode mode;
9902 {
9912 {
9916 tree_vector_builder elts;
9921 {
9926 }
9929 }
9933 }
9934 }
9936 /* Mask out the tz least significant bits of X of type TYPE where
9937 tz is the number of trailing zeroes in Y. */
9938 static wide_int
9940 {
9945 }
9947 /* Return true when T is an address and is known to be nonzero.
9948 For floating point we further ensure that T is not denormal.
9949 Similar logic is present in nonzero_address in rtlanal.h.
9951 If the return value is based on the assumption that signed overflow
9952 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
9953 change *STRICT_OVERFLOW_P. */
9955 static bool
9957 {
9961 /* Doing something useful for floating point would need more work. */
9967 {
9970 strict_overflow_p);
9976 strict_overflow_p);
9984 }
9987 {
9990 strict_overflow_p);
9998 strict_overflow_p);
10013 strict_overflow_p);
10017 strict_overflow_p);
10020 {
10032 }
10036 }
10038 }
10040 /* Return true when T is an address and is known to be nonzero.
10041 Handle warnings about undefined signed overflow. */
10043 bool
10045 {
10052 "determining that expression is always "
10054 WARN_STRICT_OVERFLOW_MISC);
10056 }
10058 /* Return true if T is known not to be equal to an integer W. */
10060 bool
10062 {
10064 value_range_kind rtype;
10066 {
10075 {
10080 }
10085 /* If T has some known zero bits and W has any of those bits set,
10086 then T is known not to be equal to W. */
10094 }
10095 }
10097 /* Fold a binary expression of code CODE and type TYPE with operands
10098 OP0 and OP1. LOC is the location of the resulting expression.
10099 Return the folded expression if folding is successful. Otherwise,
10100 return NULL_TREE. */
10102 tree
10105 {
10120 /* Strip any conversions that don't change the mode. This is
10121 safe for every expression, except for a comparison expression
10122 because its signedness is derived from its operands. So, in
10123 the latter case, only strip conversions that don't change the
10124 signedness. MIN_EXPR/MAX_EXPR also need signedness of arguments
10125 preserved.
10127 Note that this is done as an internal manipulation within the
10128 constant folder, in order to find the simplest representation
10129 of the arguments so that their form can be studied. In any
10130 cases, the appropriate type conversions should be put back in
10131 the tree that will get out of the constant folder. */
10134 {
10137 }
10138 else
10139 {
10142 }
10144 /* Note that TREE_CONSTANT isn't enough: static var addresses are
10145 constant but we can't do arithmetic on them. */
10147 {
10150 {
10154 }
10155 }
10157 /* If this is a commutative operation, and ARG0 is a constant, move it
10158 to ARG1 to reduce the number of tests below. */
10163 /* Likewise if this is a comparison, and ARG0 is a constant, move it
10164 to ARG1 to reduce the number of tests below. */
10173 /* ARG0 is the first operand of EXPR, and ARG1 is the second operand.
10175 First check for cases where an arithmetic operation is applied to a
10176 compound, conditional, or comparison operation. Push the arithmetic
10177 operation inside the compound or conditional to see if any folding
10178 can then be done. Convert comparison to conditional for this purpose.
10179 The also optimizes non-constant cases that used to be done in
10180 expand_expr.
10182 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
10183 one of the operands is a comparison and the other is a comparison, a
10184 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
10185 code below would make the expression more complex. Change it to a
10186 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
10187 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
10200 {
10204 boolean_type_node,
10212 }
10216 {
10218 {
10223 tem);
10224 }
10226 {
10231 tem);
10232 }
10237 {
10243 }
10248 {
10254 }
10255 }
10258 {
10260 /* MEM[&MEM[p, CST1], CST2] -> MEM[p, CST1 + CST2]. */
10263 {
10269 }
10271 /* MEM[&a.b, CST2] -> MEM[&a, offsetof (a, b) + CST2]. */
10274 {
10275 tree base;
10276 poly_int64 coffset;
10285 }
10290 /* INT +p INT -> (PTR)(INT + INT). Stripping types allows for this. */
10296 arg1),
10298 arg0)));
10304 {
10305 /* X + (X / CST) * -CST is X % CST. */
10310 {
10319 cst0));
10320 }
10321 }
10323 /* Handle (A1 * C1) + (A2 * C2) with A1, A2 or C1, C2 being the same or
10324 one. Make sure the type is not saturating and has the signedness of
10325 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10326 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10333 {
10337 }
10340 {
10341 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
10342 (plus (plus (mult) (mult)) (foo)) so that we can
10343 take advantage of the factoring cases below. */
10352 {
10358 else
10371 parg0),
10373 marg)),
10377 return
10383 parg1)));
10384 }
10385 }
10386 else
10387 {
10388 /* Fold __complex__ ( x, 0 ) + __complex__ ( 0, y )
10389 to __complex__ ( x, y ). This is not the same for SNaNs or
10390 if signed zeros are involved. */
10394 {
10401 {
10405 {
10411 }
10413 {
10419 }
10420 }
10421 }
10423 /* Convert a + (b*c + d*e) into (a + b*c) + d*e.
10424 We associate floats only if the user has specified
10425 -fassociative-math. */
10429 {
10434 {
10435 tree tree0;
10438 }
10439 }
10440 /* Convert (b*c + d*e) + a into b*c + (d*e +a).
10441 We associate floats only if the user has specified
10442 -fassociative-math. */
10446 {
10451 {
10452 tree tree0;
10455 }
10456 }
10457 }
10459 bit_rotate:
10460 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
10461 is a rotate of A by C1 bits. */
10462 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
10463 is a rotate of A by B bits.
10464 Similarly for (A << B) | (A >> (-B & C3)) where C3 is Z-1,
10465 though in this case CODE must be | and not + or ^, otherwise
10466 it doesn't return A when B is 0. */
10467 {
10469 tree rtype;
10478 /* Only create rotates in complete modes. Other cases are not
10479 expanded properly. */
10482 {
10495 {
10500 }
10505 {
10508 code0 == LSHIFT_EXPR
10511 }
10513 {
10523 {
10527 orig_tree01);
10529 }
10530 }
10534 {
10545 {
10549 orig_tree01);
10551 }
10552 }
10553 }
10554 }
10556 associate:
10557 /* In most languages, can't associate operations on floats through
10558 parentheses. Rather than remember where the parentheses were, we
10559 don't associate floats at all, unless the user has specified
10560 -fassociative-math.
10561 And, we need to make sure type is not saturating. */
10565 {
10571 /* Split both trees into variables, constants, and literals. Then
10572 associate each group together, the constants with literals,
10573 then the result with variables. This increases the chances of
10574 literals being recombined later and of generating relocatable
10575 expressions for the sum of a constant and literal. */
10583 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
10587 /* With undefined overflow prefer doing association in a type
10588 which wraps on overflow, if that is one of the operand types. */
10591 {
10599 }
10601 /* With undefined overflow we can only associate constants with one
10602 variable, and constants whose association doesn't overflow. */
10605 {
10607 {
10608 /* ??? If split_tree would handle NEGATE_EXPR we could
10609 simply reject these cases and the allowed cases would
10610 be the var0/minus_var1 ones. */
10616 {
10619 }
10626 {
10629 }
10635 /* The only case we can still associate with two variables
10636 is if they cancel out. */
10640 }
10646 }
10648 /* Only do something if we found more than two objects. Otherwise,
10649 nothing has changed and we risk infinite recursion. */
10657 {
10669 {
10673 }
10675 {
10679 }
10681 /* Preserve the MINUS_EXPR if the negative part of the literal is
10682 greater than the positive part. Otherwise, the multiplicative
10683 folding code (i.e extract_muldiv) may be fooled in case
10684 unsigned constants are subtracted, like in the following
10685 example: ((X*2 + 4) - 8U)/2. */
10687 {
10691 /* But avoid ending up with only negated parts. */
10693 {
10697 }
10698 else
10699 {
10703 }
10704 }
10706 /* Don't introduce overflows through reassociation. */
10711 /* Eliminate lit0 and minus_lit0 to con0 and minus_con0. */
10718 /* Eliminate minus_con0. */
10720 {
10727 else
10730 }
10732 /* Eliminate minus_var0. */
10734 {
10738 else
10741 }
10743 return
10746 }
10747 }
10753 /* Fold &a[i] - &a[j] to i-j. */
10758 {
10762 code
10766 }
10768 /* Further transformations are not for pointers. */
10772 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
10775 /* If arg0 is e.g. unsigned int and type is int, then this could
10776 introduce UB, because if A is INT_MIN at runtime, the original
10777 expression can be well defined while the latter is not.
10778 See PR83269. */
10787 /* Fold __complex__ ( x, 0 ) - __complex__ ( 0, y ) to
10788 __complex__ ( x, -y ). This is not the same for SNaNs or if
10789 signed zeros are involved. */
10793 {
10800 {
10804 {
10806 arg1r ? arg1r
10811 }
10813 {
10817 arg1i ? arg1i
10820 }
10821 }
10822 }
10824 /* A - B -> A + (-B) if B is easily negatable. */
10828 /* Avoid this transformation if B is a positive REAL_CST. */
10836 /* Handle (A1 * C1) - (A2 * C2) with A1, A2 or C1, C2 being the same or
10837 one. Make sure the type is not saturating and has the signedness of
10838 the stripped operands, as fold_plusminus_mult_expr will re-associate.
10839 ??? The latter condition should use TYPE_OVERFLOW_* flags instead. */
10846 {
10850 }
10856 {
10857 /* Transform x * -C into -x * C if x is easily negatable. */
10872 {
10875 "occur when simplifying "
10877 WARN_STRICT_OVERFLOW_MISC);
10879 }
10881 /* Optimize z * conj(z) for integer complex numbers. */
10888 }
10889 else
10890 {
10891 /* Fold z * +-I to __complex__ (-+__imag z, +-__real z).
10892 This is not the same for NaNs or if signed zeros are
10893 involved. */
10899 {
10902 return
10908 return
10913 }
10915 /* Optimize z * conj(z) for floating point complex numbers.
10916 Guarded by flag_unsafe_math_optimizations as non-finite
10917 imaginary components don't produce scalar results. */
10926 }
10930 /* Canonicalize (X & C1) | C2. */
10934 {
10939 /* If (C1&C2) == C1, then (X&C1)|C2 becomes (X,C2). */
10947 /* If (C1|C2) == ~0 then (X&C1)|C2 becomes X|C2. */
10949 {
10952 }
10954 /* Minimize the number of bits set in C1, i.e. C1 := C1 & ~C2,
10955 unless (C1 & ~C2) | (C2 & C3) for some C3 is a mask of some
10956 mode which allows further optimizations. */
10961 {
10966 {
10969 }
10970 }
10973 {
10978 }
10979 }
10981 /* See if this can be simplified into a rotate first. If that
10982 is unsuccessful continue in the association code. */
10986 /* Fold (X & 1) ^ 1 as (X & 1) == 0. */
10994 /* See if this can be simplified into a rotate first. If that
10995 is unsuccessful continue in the association code. */
10999 /* Fold (X ^ 1) & 1 as (X & 1) == 0. */
11004 {
11005 tree tem2;
11012 }
11013 /* Fold ~X & 1 as (X & 1) == 0. */
11017 {
11018 tree tem2;
11025 }
11026 /* Fold !X & 1 as X == 0. */
11029 {
11033 }
11035 /* Fold (X * Y) & -(1 << CST) to X * Y if Y is a constant
11036 multiple of 1 << CST. */
11038 {
11045 }
11047 /* Fold (X * CST1) & CST2 to zero if we can, or drop known zero
11048 bits from CST2. */
11052 {
11054 wide_int masked
11061 {
11062 /* Avoid the transform if arg1 is a mask of some
11063 mode which allows further optimizations. */
11070 }
11071 }
11073 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
11076 {
11081 return
11083 }
11088 /* Don't touch a floating-point divide by zero unless the mode
11089 of the constant can represent infinity. */
11095 /* (-A) / (-B) -> A / B */
11107 /* Fall through */
11110 /* Simplify A / (B << N) where A and B are positive and B is
11111 a power of 2, to A >> (N + log2(B)). */
11116 {
11119 {
11127 WARN_STRICT_OVERFLOW_MISC);
11133 }
11134 }
11136 /* Fall through */
11144 /* Convert -A / -B to A / B when the type is signed and overflow is
11145 undefined. */
11149 {
11152 "when distributing negation across "
11154 WARN_STRICT_OVERFLOW_MISC);
11159 }
11163 {
11166 "when distributing negation across "
11168 WARN_STRICT_OVERFLOW_MISC);
11173 }
11175 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
11176 operation, EXACT_DIV_EXPR.
11178 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
11179 At one time others generated faster code, it's not clear if they do
11180 after the last round to changes to the DIV code in expmed.c. */
11191 {
11195 WARN_STRICT_OVERFLOW_MISC);
11197 }
11209 {
11213 WARN_STRICT_OVERFLOW_MISC);
11215 }
11223 /* Since negative shift count is not well-defined,
11224 don't try to compute it in the compiler. */
11230 /* If we have a rotate of a bit operation with the rotate count and
11231 the second operand of the bit operation both constant,
11232 permute the two operations. */
11238 {
11246 }
11248 /* Two consecutive rotates adding up to the some integer
11249 multiple of the precision of the type can be ignored. */
11265 /* Note that the operands of this must be ints
11266 and their values must be 0 or 1.
11267 ("true" is a fixed value perhaps depending on the language.) */
11268 /* If first arg is constant zero, return it. */
11271 /* FALLTHRU */
11273 /* If either arg is constant true, drop it. */
11277 /* Preserve sequence points. */
11280 /* If second arg is constant zero, result is zero, but first arg
11281 must be evaluated. */
11284 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
11285 case will be handled here. */
11289 /* !X && X is always false. */
11293 /* X && !X is always false. */
11298 /* A < X && A + 1 > Y ==> A < X && A >= Y. Normally A + 1 > Y
11299 means A >= Y && A != MAX, but in this case we know that
11300 A < X <= MAX. */
11304 {
11312 }
11321 /* Note that the operands of this must be ints
11322 and their values must be 0 or true.
11323 ("true" is a fixed value perhaps depending on the language.) */
11324 /* If first arg is constant true, return it. */
11327 /* FALLTHRU */
11329 /* If either arg is constant zero, drop it. */
11333 /* Preserve sequence points. */
11336 /* If second arg is constant true, result is true, but we must
11337 evaluate first arg. */
11340 /* Likewise for first arg, but note this only occurs here for
11341 TRUTH_OR_EXPR. */
11345 /* !X || X is always true. */
11349 /* X || !X is always true. */
11354 /* (X && !Y) || (!X && Y) is X ^ Y */
11357 {
11374 }
11383 /* If the second arg is constant zero, drop it. */
11386 /* If the second arg is constant true, this is a logical inversion. */
11388 {
11391 }
11392 /* Identical arguments cancel to zero. */
11396 /* !X ^ X is always true. */
11401 /* X ^ !X is always true. */
11417 /* bool_var != 1 becomes !bool_var. */
11424 /* bool_var == 0 becomes !bool_var. */
11431 /* !exp != 0 becomes !exp */
11436 /* If this is an EQ or NE comparison with zero and ARG0 is
11437 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
11438 two operations, but the latter can be done in one less insn
11439 on machines that have only two-operand insns or on which a
11440 constant cannot be the first operand. */
11443 {
11448 {
11455 arg1);
11456 }
11459 {
11466 arg1);
11467 }
11468 }
11470 /* Fold ((X >> C1) & C2) == 0 and ((X >> C1) & C2) != 0 where
11471 C1 is a valid shift constant, and C2 is a power of two, i.e.
11472 a single bit. */
11476 == INTEGER_CST
11479 {
11484 /* Check for a valid shift count. */
11486 {
11490 /* If (C2 << C1) doesn't overflow, then ((X >> C1) & C2) != 0
11491 can be rewritten as (X & (C2 << C1)) != 0. */
11493 {
11498 }
11499 /* Otherwise, for signed (arithmetic) shifts,
11500 ((X >> C1) & C2) != 0 is rewritten as X < 0, and
11501 ((X >> C1) & C2) == 0 is rewritten as X >= 0. */
11505 /* Otherwise, of unsigned (logical) shifts,
11506 ((X >> C1) & C2) != 0 is rewritten as (X,false), and
11507 ((X >> C1) & C2) == 0 is rewritten as (X,true). */
11508 else
11512 arg000);
11513 }
11514 }
11516 /* If this is a comparison of a field, we may be able to simplify it. */
11519 /* Handle the constant case even without -O
11520 to make sure the warnings are given. */
11522 {
11526 }
11528 /* Optimize comparisons of strlen vs zero to a compare of the
11529 first character of the string vs zero. To wit,
11530 strlen(ptr) == 0 => *ptr == 0
11531 strlen(ptr) != 0 => *ptr != 0
11532 Other cases should reduce to one of these two (or a constant)
11533 due to the return value of strlen being unsigned. */
11535 {
11543 {
11544 tree ptrtype
11546 TYPE_QUAL_CONST));
11552 }
11553 }
11555 /* Fold (X >> C) != 0 into X < 0 if C is one less than the width
11556 of X. Similarly fold (X >> C) == 0 into X >= 0. */
11560 {
11565 {
11567 {
11570 }
11573 }
11574 }
11576 /* Fold (~X & C) == 0 into (X & C) != 0 and (~X & C) != 0 into
11577 (X & C) == 0 when C is a single bit. */
11582 {
11589 arg1));
11590 }
11592 /* Fold ((X & C) ^ C) eq/ne 0 into (X & C) ne/eq 0, when the
11593 constant C is a power of two, i.e. a single bit. */
11600 {
11604 }
11606 /* Likewise, fold ((X ^ C) & C) eq/ne 0 into (X & C) ne/eq 0,
11607 when is C is a power of two, i.e. a single bit. */
11614 {
11620 }
11624 {
11627 }
11629 /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */
11632 {
11640 {
11646 }
11648 {
11654 }
11656 {
11662 }
11664 {
11670 }
11671 }
11675 {
11682 /* Optimize (X ^ Z) op (Y ^ Z) as X op Y, and symmetries.
11683 operand_equal_p guarantees no side-effects so we don't need
11684 to use omit_one_operand on Z. */
11688 arg10));
11692 arg11));
11696 arg10));
11700 arg11));
11702 /* Optimize (X ^ C1) op (Y ^ C2) as (X ^ (C1 ^ C2)) op Y. */
11705 {
11711 }
11712 }
11714 /* Attempt to simplify equality/inequality comparisons of complex
11715 values. Only lower the comparison if the result is known or
11716 can be simplified to a single scalar comparison. */
11721 {
11726 {
11729 }
11730 else
11731 {
11734 }
11737 {
11740 }
11741 else
11742 {
11745 }
11749 {
11751 {
11756 }
11757 else
11758 {
11763 }
11764 }
11768 {
11770 {
11775 }
11776 else
11777 {
11782 }
11783 }
11784 }
11796 /* Transform comparisons of the form X +- C CMP X. */
11801 {
11806 /* (X - c) > X becomes false. */
11812 /* Likewise (X + c) < X becomes false. */
11818 /* Convert (X - c) <= X to true. */
11825 /* Convert (X + c) >= X to true. */
11831 }
11833 /* If we are comparing an ABS_EXPR with a constant, we can
11834 convert all the cases into explicit comparisons, but they may
11835 well not be faster than doing the ABS and one comparison.
11836 But ABS (X) <= C is a range comparison, which becomes a subtraction
11837 and a comparison, and is probably faster. */
11851 /* Convert ABS_EXPR<x> >= 0 to true. */
11858 {
11861 "when simplifying comparison of "
11863 WARN_STRICT_OVERFLOW_CONDITIONAL);
11866 arg0);
11867 }
11869 /* Convert ABS_EXPR<x> < 0 to false. */
11874 {
11877 "when simplifying comparison of "
11879 WARN_STRICT_OVERFLOW_CONDITIONAL);
11882 arg0);
11883 }
11885 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
11886 and similarly for >= into !=. */
11896 /* Similarly for X < (cast) (1 << Y). But cast can't be narrowing,
11897 otherwise Y might be >= # of bits in X's type and thus e.g.
11898 (unsigned char) (1 << Y) for Y 15 might be 0.
11899 If the cast is widening, then 1 << Y should have unsigned type,
11900 otherwise if Y is number of bits in the signed shift type minus 1,
11901 we can't optimize this. E.g. (unsigned long long) (1 << Y) for Y
11902 31 might be 0xffffffff80000000. */
11913 {
11919 }
11931 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
11932 {
11944 }
11949 /* When pedantic, a compound expression can be neither an lvalue
11950 nor an integer constant expression. */
11953 /* Don't let (0, 0) be null pointer constant. */
11959 /* An ASSERT_EXPR should never be passed to fold_binary. */
11965 }
11967 /* For constants M and N, if M == (1LL << cst) - 1 && (N & M) == M,
11968 ((A & N) + B) & M -> (A + B) & M
11969 Similarly if (N & M) == 0,
11970 ((A | N) + B) & M -> (A + B) & M
11971 and for - instead of + (or unary - instead of +)
11972 and/or ^ instead of |.
11973 If B is constant and (B & M) == 0, fold into A & M.
11975 This function is a helper for match.pd patterns. Return non-NULL
11976 type in which the simplified operation should be performed only
11977 if any optimization is possible.
11979 ARG1 is M above, ARG00 is left operand of +/-, if CODE00 is BIT_*_EXPR,
11980 then ARG00{0,1} are operands of that bitop, otherwise CODE00 is ERROR_MARK.
11981 Similarly for ARG01, CODE01 and ARG01{0,1}, just for the right operand of
11982 +/-. */
11983 tree
11988 {
12003 wide_int cst0;
12005 /* Now we know that arg0 is (C + D) or (C - D) or -C and
12006 arg1 (M) is == (1LL << cst) - 1.
12007 Store C into PMOP[0] and D into PMOP[1]. */
12014 {
12021 {
12024 }
12027 /* If C or D is of the form (A & N) where
12028 (N & M) == M, or of the form (A | N) or
12029 (A ^ N) where (N & M) == 0, replace it with A. */
12035 /* If C or D is a N where (N & M) == 0, it can be
12036 omitted (replaced with 0). */
12041 /* Similarly, with C - N where (-N & M) == 0. */
12049 }
12051 /* Only build anything new if we optimized one or both arguments above. */
12057 else
12059 }
12061 /* Used by contains_label_[p1]. */
12063 struct contains_label_data
12064 {
12067 };
12069 /* Callback for walk_tree, looking for LABEL_EXPR. Return *TP if it is
12070 a LABEL_EXPR or CASE_LABEL_EXPR not inside of another SWITCH_EXPR; otherwise
12071 return NULL_TREE. Do not check the subtrees of GOTO_EXPR. */
12073 static tree
12075 {
12078 {
12089 {
12097 }
12106 }
12107 }
12109 /* Return whether the sub-tree ST contains a label which is accessible from
12110 outside the sub-tree. */
12112 static bool
12114 {
12118 }
12120 /* Fold a ternary expression of code CODE and type TYPE with operands
12121 OP0, OP1, and OP2. Return the folded expression if folding is
12122 successful. Otherwise, return NULL_TREE. */
12124 tree
12127 {
12128 tree tem;
12135 /* If this is a commutative operation, and OP0 is a constant, move it
12136 to OP1 to reduce the number of tests below. */
12145 /* Strip any conversions that don't change the mode. This is safe
12146 for every expression, except for a comparison expression because
12147 its signedness is derived from its operands. So, in the latter
12148 case, only strip conversions that don't change the signedness.
12150 Note that this is done as an internal manipulation within the
12151 constant folder, in order to find the simplest representation of
12152 the arguments so that their form can be studied. In any cases,
12153 the appropriate type conversions should be put back in the tree
12154 that will get out of the constant folder. */
12156 {
12159 }
12162 {
12165 }
12168 {
12171 }
12174 {
12178 {
12184 }
12189 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
12190 so all simple results must be passed through pedantic_non_lvalue. */
12192 {
12195 /* Only optimize constant conditions when the selected branch
12196 has the same type as the COND_EXPR. This avoids optimizing
12197 away "c ? x : throw", where the throw has a void type.
12198 Avoid throwing away that operand which contains label. */
12205 }
12207 {
12214 {
12217 {
12225 }
12230 }
12231 }
12233 /* If we have A op B ? A : C, we may be able to convert this to a
12234 simpler expression, depending on the operation and the values
12235 of B and C. Signed zeros prevent all of these transformations,
12236 for reasons given above each one.
12238 Also try swapping the arguments and inverting the conditional. */
12242 {
12246 }
12251 {
12255 {
12259 }
12260 }
12262 /* If the second operand is simpler than the third, swap them
12263 since that produces better jump optimization results. */
12266 {
12268 /* See if this can be inverted. If it can't, possibly because
12269 it was a floating-point inequality comparison, don't do
12270 anything. */
12274 }
12276 /* Convert A ? 1 : 0 to simply A. */
12281 /* If we try to convert OP0 to our type, the
12282 call to fold will try to move the conversion inside
12283 a COND, which will recurse. In that case, the COND_EXPR
12284 is probably the best choice, so leave it alone. */
12288 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
12289 over COND_EXPR in cases such as floating point comparisons. */
12298 arg0)));
12300 /* A < 0 ? <sign bit of A> : 0 is simply (A & <sign bit of A>). */
12305 {
12306 /* sign_bit_p looks through both zero and sign extensions,
12307 but for this optimization only sign extensions are
12308 usable. */
12311 {
12314 {
12317 }
12319 }
12320 /* sign_bit_p only checks ARG1 bits within A's precision.
12321 If <sign bit of A> has wider type than A, bits outside
12322 of A's precision in <sign bit of A> need to be checked.
12323 If they are all 0, this optimization needs to be done
12324 in unsigned A's type, if they are all 1 in signed A's type,
12325 otherwise this can't be done. */
12331 {
12333 tree tem_type;
12346 {
12349 }
12351 {
12354 }
12355 else
12357 }
12360 return
12366 arg1)));
12367 }
12369 /* (A >> N) & 1 ? (1 << N) : 0 is simply A & (1 << N). A & 1 was
12370 already handled above. */
12375 {
12385 op1);
12386 }
12388 /* A & N ? N : 0 is simply A & N if N is a power of two. This
12389 is probably obsolete because the first operand should be a
12390 truth value (that's why we have the two cases above), but let's
12391 leave it in until we can confirm this for all front-ends. */
12399 /* operand_equal_p compares just value, not precision, so e.g.
12400 arg1 could be 8-bit -128 and be power of two, but BIT_AND_EXPR
12401 second operand 32-bit -128, which is not a power of two (or vice
12402 versa. */
12409 /* Disable the transformations below for vectors, since
12410 fold_binary_op_with_conditional_arg may undo them immediately,
12411 yielding an infinite loop. */
12415 /* Convert A ? B : 0 into A && B if A and B are truth values. */
12424 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
12429 {
12431 /* Only perform transformation if ARG0 is easily inverted. */
12435 ? BIT_IOR_EXPR
12438 op1);
12439 }
12441 /* Convert A ? 0 : B into !A && B if A and B are truth values. */
12446 {
12448 /* Only perform transformation if ARG0 is easily inverted. */
12454 op2);
12455 }
12457 /* Convert A ? 1 : B into A || B if A and B are truth values. */
12469 /* CALL_EXPRs used to be ternary exprs. Catch any mistaken uses
12470 of fold_ternary on them. */
12480 {
12491 {
12496 {
12498 {
12503 }
12509 }
12510 }
12511 }
12513 /* On constants we can use native encode/interpret to constant
12514 fold (nearly) all BIT_FIELD_REFs. */
12520 {
12523 /* Limit us to a reasonable amount of work. To relax the
12524 other limitations we need bit-shifting of the buffer
12525 and rounding up the size. */
12529 {
12531 unsigned HOST_WIDE_INT len
12536 {
12541 }
12542 }
12543 }
12548 /* Perform constant folding of BIT_INSERT_EXPR. */
12552 {
12553 /* Build a vector of integers from the tree mask. */
12554 vec_perm_builder builder;
12558 /* Create a vec_perm_indices for the integer vector. */
12563 }
12567 /* Perform (partial) constant folding of BIT_INSERT_EXPR. */
12570 {
12576 wide_int tem2
12580 }
12585 {
12587 unsigned HOST_WIDE_INT elsize
12590 {
12596 {
12602 }
12603 }
12604 }
12610 }
12612 /* Gets the element ACCESS_INDEX from CTOR, which must be a CONSTRUCTOR
12613 of an array (or vector). *CTOR_IDX if non-NULL is updated with the
12614 constructor element index of the value returned. If the element is
12615 not found NULL_TREE is returned and *CTOR_IDX is updated to
12616 the index of the element after the ACCESS_INDEX position (which
12617 may be outside of the CTOR array). */
12619 tree
12622 {
12628 {
12631 {
12632 /* Static constructors for variably sized objects makes no sense. */
12635 /* ??? When it is obvious that the range is signed, treat it so. */
12640 {
12642 low_bound
12644 SIGNED);
12645 }
12646 else
12647 {
12650 }
12651 }
12652 }
12656 index_sgn);
12668 {
12669 /* Array constructor might explicitly set index, or specify a range,
12670 or leave index NULL meaning that it is next index after previous
12671 one. */
12673 {
12675 max_index = index
12677 else
12678 {
12681 index_sgn);
12682 max_index
12684 index_sgn);
12686 }
12687 }
12689 {
12695 }
12696 else
12699 /* Do we have match? */
12701 {
12703 {
12707 }
12708 }
12710 /* We're past the element we search for. Note during parsing
12711 the elements might not be sorted.
12712 ??? We should use a binary search and a flag on the
12713 CONSTRUCTOR as to whether elements are sorted in declaration
12714 order. */
12716 }
12720 }
12722 /* Perform constant folding and related simplification of EXPR.
12723 The related simplifications include x*1 => x, x*0 => 0, etc.,
12724 and application of the associative law.
12725 NOP_EXPR conversions may be removed freely (as long as we
12726 are careful not to change the type of the overall expression).
12727 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
12728 but we can constant-fold them if they have constant operands. */
12730 #ifdef ENABLE_FOLD_CHECKING
12731 # define fold(x) fold_1 (x)
12733 static
12734 #endif
12735 tree
12737 {
12741 tree tem;
12744 /* Return right away if a constant. */
12748 /* CALL_EXPR-like objects with variable numbers of operands are
12749 treated specially. */
12751 {
12753 {
12756 }
12758 }
12761 {
12766 {
12784 }
12785 }
12788 {
12790 {
12797 {
12802 }
12805 }
12807 /* Return a VECTOR_CST if possible. */
12809 {
12815 tree val;
12821 }
12829 }
12831 #ifdef ENABLE_FOLD_CHECKING
12832 #undef fold
12839 /* When --enable-checking=fold, compute a digest of expr before
12840 and after actual fold call to see if fold did not accidentally
12841 change original expr. */
12843 tree
12845 {
12846 tree ret;
12866 }
12868 void
12870 {
12881 }
12883 static void
12885 {
12887 }
12889 static void
12892 {
12898 recursive_label:
12908 {
12909 /* Allow DECL_ASSEMBLER_NAME and symtab_node to be modified. */
12917 }
12925 {
12926 /* Allow these fields to be modified. */
12927 tree tmp;
12938 {
12941 }
12942 }
12944 {
12945 /* Allow TREE_NO_WARNING to be set. Perhaps we shouldn't allow that
12946 and change builtins.c etc. instead - see PR89543. */
12952 }
12963 {
12966 {
12982 }
12986 {
12999 }
13016 {
13022 }
13025 {
13027 {
13030 }
13032 }
13043 {
13046 }
13056 }
13057 }
13059 /* Helper function for outputting the checksum of a tree T. When
13060 debugging with gdb, you can "define mynext" to be "next" followed
13061 by "call debug_fold_checksum (op0)", then just trace down till the
13062 outputs differ. */
13064 DEBUG_FUNCTION void
13066 {
13081 }
13083 #endif
13085 /* Fold a unary tree expression with code CODE of type TYPE with an
13086 operand OP0. LOC is the location of the resulting expression.
13087 Return a folded expression if successful. Otherwise, return a tree
13088 expression with code CODE of type TYPE with an operand OP0. */
13090 tree
13093 {
13094 tree tem;
13095 #ifdef ENABLE_FOLD_CHECKING
13104 #endif
13110 #ifdef ENABLE_FOLD_CHECKING
13117 #endif
13119 }
13121 /* Fold a binary tree expression with code CODE of type TYPE with
13122 operands OP0 and OP1. LOC is the location of the resulting
13123 expression. Return a folded expression if successful. Otherwise,
13124 return a tree expression with code CODE of type TYPE with operands
13125 OP0 and OP1. */
13127 tree
13130 MEM_STAT_DECL)
13131 {
13132 tree tem;
13133 #ifdef ENABLE_FOLD_CHECKING
13150 #endif
13156 #ifdef ENABLE_FOLD_CHECKING
13171 #endif
13173 }
13175 /* Fold a ternary tree expression with code CODE of type TYPE with
13176 operands OP0, OP1, and OP2. Return a folded expression if
13177 successful. Otherwise, return a tree expression with code CODE of
13178 type TYPE with operands OP0, OP1, and OP2. */
13180 tree
13183 {
13184 tree tem;
13185 #ifdef ENABLE_FOLD_CHECKING
13209 #endif
13216 #ifdef ENABLE_FOLD_CHECKING
13239 #endif
13241 }
13243 /* Fold a CALL_EXPR expression of type TYPE with operands FN and NARGS
13244 arguments in ARGARRAY, and a null static chain.
13245 Return a folded expression if successful. Otherwise, return a CALL_EXPR
13246 of type TYPE from the given operands as constructed by build_call_array. */
13248 tree
13251 {
13252 tree tem;
13253 #ifdef ENABLE_FOLD_CHECKING
13272 #endif
13278 #ifdef ENABLE_FOLD_CHECKING
13294 #endif
13296 }
13298 /* Perform constant folding and related simplification of initializer
13299 expression EXPR. These behave identically to "fold_buildN" but ignore
13300 potential run-time traps and exceptions that fold must preserve. */
13302 #define START_FOLD_INIT \
13303 int saved_signaling_nans = flag_signaling_nans;\
13304 int saved_trapping_math = flag_trapping_math;\
13305 int saved_rounding_math = flag_rounding_math;\
13306 int saved_trapv = flag_trapv;\
13307 int saved_folding_initializer = folding_initializer;\
13308 flag_signaling_nans = 0;\
13309 flag_trapping_math = 0;\
13310 flag_rounding_math = 0;\
13311 flag_trapv = 0;\
13312 folding_initializer = 1;
13314 #define END_FOLD_INIT \
13315 flag_signaling_nans = saved_signaling_nans;\
13316 flag_trapping_math = saved_trapping_math;\
13317 flag_rounding_math = saved_rounding_math;\
13318 flag_trapv = saved_trapv;\
13319 folding_initializer = saved_folding_initializer;
13321 tree
13324 {
13325 tree result;
13326 START_FOLD_INIT;
13330 END_FOLD_INIT;
13332 }
13334 tree
13337 {
13338 tree result;
13339 START_FOLD_INIT;
13343 END_FOLD_INIT;
13345 }
13347 tree
13350 {
13351 tree result;
13352 START_FOLD_INIT;
13356 END_FOLD_INIT;
13358 }
13360 #undef START_FOLD_INIT
13361 #undef END_FOLD_INIT
13363 /* Determine if first argument is a multiple of second argument. Return 0 if
13364 it is not, or we cannot easily determined it to be.
13366 An example of the sort of thing we care about (at this point; this routine
13367 could surely be made more general, and expanded to do what the *_DIV_EXPR's
13368 fold cases do now) is discovering that
13370 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
13372 is a multiple of
13374 SAVE_EXPR (J * 8)
13376 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
13378 This code also handles discovering that
13380 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
13382 is a multiple of 8 so we don't have to worry about dealing with a
13383 possible remainder.
13385 Note that we *look* inside a SAVE_EXPR only to determine how it was
13386 calculated; it is not safe for fold to do much of anything else with the
13387 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
13388 at run time. For example, the latter example above *cannot* be implemented
13389 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
13390 evaluation time of the original SAVE_EXPR is not necessarily the same at
13391 the time the new expression is evaluated. The only optimization of this
13392 sort that would be valid is changing
13394 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
13396 divided by 8 to
13398 SAVE_EXPR (I) * SAVE_EXPR (J)
13400 (where the same SAVE_EXPR (J) is used in the original and the
13401 transformed version). */
13403 int
13405 {
13416 {
13418 /* Bitwise and provides a power of two multiple. If the mask is
13419 a multiple of BOTTOM then TOP is a multiple of BOTTOM. */
13427 {
13433 {
13436 /* Handle multiple_of_p ((x * 2 + 2) * 4, 8). */
13438 {
13442 {
13445 }
13446 }
13448 }
13449 }
13454 /* It is impossible to prove if op0 - op1 is multiple of bottom
13455 precisely, so be conservative here checking if both op0 and op1
13456 are multiple of bottom. Note we check the second operand first
13457 since it's usually simpler. */
13462 /* The same as MINUS_EXPR, but handle cases like op0 + 0xfffffffd
13463 as op0 - 3 if the expression has unsigned type. For example,
13464 (X / 3) + 0xfffffffd is multiple of 3, but 0xfffffffd is not. */
13474 {
13476 /* const_binop may not detect overflow correctly,
13477 so check for it explicitly here. */
13485 }
13489 /* Can't handle conversions from non-integral or wider integral type. */
13495 /* fall through */
13512 SIGNED);
13518 {
13521 /* Check for special cases to see if top is defined as multiple
13522 of bottom:
13524 top = (X & ~(bottom - 1) ; bottom is power of 2
13526 or
13528 Y = X % bottom
13529 top = X - Y. */
13548 }
13550 /* fall through */
13558 }
13559 }
13561 #define tree_expr_nonnegative_warnv_p(X, Y) \
13564 #define RECURSE(X) \
13565 ((tree_expr_nonnegative_warnv_p) (X, strict_overflow_p, depth + 1))
13567 /* Return true if CODE or TYPE is known to be non-negative. */
13569 static bool
13571 {
13574 /* Truth values evaluate to 0 or 1, which is nonnegative unless we
13575 have a signed:1 type (where the value is -1 and 0). */
13578 }
13580 /* Return true if (CODE OP0) is known to be non-negative. If the return
13581 value is based on the assumption that signed overflow is undefined,
13582 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13583 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13585 bool
13588 {
13593 {
13595 /* We can't return 1 if flag_wrapv is set because
13596 ABS_EXPR<INT_MIN> = INT_MIN. */
13600 {
13603 }
13611 CASE_CONVERT:
13612 {
13617 {
13621 {
13625 }
13626 }
13628 {
13634 }
13635 }
13640 }
13642 /* We don't know sign of `t', so be conservative and return false. */
13644 }
13646 /* Return true if (CODE OP0 OP1) is known to be non-negative. If the return
13647 value is based on the assumption that signed overflow is undefined,
13648 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13649 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13651 bool
13655 {
13660 {
13666 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
13667 both unsigned and at least 2 bits shorter than the result. */
13671 {
13676 {
13680 }
13681 }
13686 {
13687 /* x * x is always non-negative for floating point x
13688 or without overflow. */
13691 {
13696 }
13697 }
13699 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
13700 both unsigned and their total bits is shorter than the result. */
13704 {
13723 {
13733 }
13734 }
13761 }
13763 /* We don't know sign of `t', so be conservative and return false. */
13765 }
13767 /* Return true if T is known to be non-negative. If the return
13768 value is based on the assumption that signed overflow is undefined,
13769 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13770 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13772 bool
13774 {
13779 {
13793 /* Limit the depth of recursion to avoid quadratic behavior.
13794 This is expected to catch almost all occurrences in practice.
13795 If this code misses important cases that unbounded recursion
13796 would not, passes that need this information could be revised
13797 to provide it through dataflow propagation. */
13805 }
13806 }
13808 /* Return true if T is known to be non-negative. If the return
13809 value is based on the assumption that signed overflow is undefined,
13810 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13811 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13813 bool
13816 {
13818 {
13819 CASE_CFN_ACOS:
13820 CASE_CFN_ACOSH:
13821 CASE_CFN_CABS:
13822 CASE_CFN_COSH:
13823 CASE_CFN_ERFC:
13824 CASE_CFN_EXP:
13825 CASE_CFN_EXP10:
13826 CASE_CFN_EXP2:
13827 CASE_CFN_FABS:
13828 CASE_CFN_FDIM:
13829 CASE_CFN_HYPOT:
13830 CASE_CFN_POW10:
13831 CASE_CFN_FFS:
13832 CASE_CFN_PARITY:
13833 CASE_CFN_POPCOUNT:
13834 CASE_CFN_CLZ:
13835 CASE_CFN_CLRSB:
13838 /* Always true. */
13841 CASE_CFN_SQRT:
13842 CASE_CFN_SQRT_FN:
13843 /* sqrt(-0.0) is -0.0. */
13848 CASE_CFN_ASINH:
13849 CASE_CFN_ATAN:
13850 CASE_CFN_ATANH:
13851 CASE_CFN_CBRT:
13852 CASE_CFN_CEIL:
13853 CASE_CFN_CEIL_FN:
13854 CASE_CFN_ERF:
13855 CASE_CFN_EXPM1:
13856 CASE_CFN_FLOOR:
13857 CASE_CFN_FLOOR_FN:
13858 CASE_CFN_FMOD:
13859 CASE_CFN_FREXP:
13860 CASE_CFN_ICEIL:
13861 CASE_CFN_IFLOOR:
13862 CASE_CFN_IRINT:
13863 CASE_CFN_IROUND:
13864 CASE_CFN_LCEIL:
13865 CASE_CFN_LDEXP:
13866 CASE_CFN_LFLOOR:
13867 CASE_CFN_LLCEIL:
13868 CASE_CFN_LLFLOOR:
13869 CASE_CFN_LLRINT:
13870 CASE_CFN_LLROUND:
13871 CASE_CFN_LRINT:
13872 CASE_CFN_LROUND:
13873 CASE_CFN_MODF:
13874 CASE_CFN_NEARBYINT:
13875 CASE_CFN_NEARBYINT_FN:
13876 CASE_CFN_RINT:
13877 CASE_CFN_RINT_FN:
13878 CASE_CFN_ROUND:
13879 CASE_CFN_ROUND_FN:
13880 CASE_CFN_ROUNDEVEN:
13881 CASE_CFN_ROUNDEVEN_FN:
13882 CASE_CFN_SCALB:
13883 CASE_CFN_SCALBLN:
13884 CASE_CFN_SCALBN:
13885 CASE_CFN_SIGNBIT:
13886 CASE_CFN_SIGNIFICAND:
13887 CASE_CFN_SINH:
13888 CASE_CFN_TANH:
13889 CASE_CFN_TRUNC:
13890 CASE_CFN_TRUNC_FN:
13891 /* True if the 1st argument is nonnegative. */
13894 CASE_CFN_FMAX:
13895 CASE_CFN_FMAX_FN:
13896 /* True if the 1st OR 2nd arguments are nonnegative. */
13899 CASE_CFN_FMIN:
13900 CASE_CFN_FMIN_FN:
13901 /* True if the 1st AND 2nd arguments are nonnegative. */
13904 CASE_CFN_COPYSIGN:
13905 CASE_CFN_COPYSIGN_FN:
13906 /* True if the 2nd argument is nonnegative. */
13909 CASE_CFN_POWI:
13910 /* True if the 1st argument is nonnegative or the second
13911 argument is an even integer. */
13917 CASE_CFN_POW:
13918 /* True if the 1st argument is nonnegative or the second
13919 argument is an even integer valued real. */
13921 {
13922 REAL_VALUE_TYPE c;
13923 HOST_WIDE_INT n;
13928 {
13929 REAL_VALUE_TYPE cint;
13933 }
13934 }
13939 }
13941 }
13943 /* Return true if T is known to be non-negative. If the return
13944 value is based on the assumption that signed overflow is undefined,
13945 set *STRICT_OVERFLOW_P to true; otherwise, don't change
13946 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
13948 static bool
13950 {
13956 {
13958 {
13962 /* If the initializer is non-void, then it's a normal expression
13963 that will be assigned to the slot. */
13967 /* Otherwise, the initializer sets the slot in some way. One common
13968 way is an assignment statement at the end of the initializer. */
13970 {
13978 else
13980 }
13986 }
13989 {
13995 arg0,
13996 arg1,
13998 }
14011 }
14012 }
14014 #undef RECURSE
14015 #undef tree_expr_nonnegative_warnv_p
14017 /* Return true if T is known to be non-negative. If the return
14018 value is based on the assumption that signed overflow is undefined,
14019 set *STRICT_OVERFLOW_P to true; otherwise, don't change
14020 *STRICT_OVERFLOW_P. DEPTH is the current nesting depth of the query. */
14022 bool
14024 {
14031 {
14053 }
14056 {
14082 }
14083 }
14085 /* Return true if `t' is known to be non-negative. Handle warnings
14086 about undefined signed overflow. */
14088 bool
14090 {
14097 "determining that expression is always "
14099 WARN_STRICT_OVERFLOW_MISC);
14101 }
14104 /* Return true when (CODE OP0) is an address and is known to be nonzero.
14105 For floating point we further ensure that T is not denormal.
14106 Similar logic is present in nonzero_address in rtlanal.h.
14108 If the return value is based on the assumption that signed overflow
14109 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
14110 change *STRICT_OVERFLOW_P. */
14112 bool
14115 {
14117 {
14120 strict_overflow_p);
14123 {
14129 strict_overflow_p));
14130 }
14135 strict_overflow_p);
14139 }
14142 }
14144 /* Return true when (CODE OP0 OP1) is an address and is known to be nonzero.
14145 For floating point we further ensure that T is not denormal.
14146 Similar logic is present in nonzero_address in rtlanal.h.
14148 If the return value is based on the assumption that signed overflow
14149 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
14150 change *STRICT_OVERFLOW_P. */
14152 bool
14154 tree type,
14155 tree op0,
14157 {
14160 {
14164 {
14165 /* With the presence of negative values it is hard
14166 to say something. */
14173 /* One of operands must be positive and the other non-negative. */
14174 /* We don't set *STRICT_OVERFLOW_P here: even if this value
14175 overflows, on a twos-complement machine the sum of two
14176 nonnegative numbers can never be zero. */
14178 strict_overflow_p)
14180 strict_overflow_p));
14181 }
14186 {
14188 strict_overflow_p)
14190 strict_overflow_p))
14191 {
14194 }
14195 }
14204 {
14207 }
14214 {
14218 /* When both operands are nonzero, then MAX must be too. */
14220 strict_overflow_p))
14223 /* MAX where operand 0 is positive is positive. */
14225 strict_overflow_p);
14226 }
14227 /* MAX where operand 1 is positive is positive. */
14232 {
14236 }
14241 strict_overflow_p)
14243 strict_overflow_p));
14247 }
14250 }
14252 /* Return true when T is an address and is known to be nonzero.
14253 For floating point we further ensure that T is not denormal.
14254 Similar logic is present in nonzero_address in rtlanal.h.
14256 If the return value is based on the assumption that signed overflow
14257 is undefined, set *STRICT_OVERFLOW_P to true; otherwise, don't
14258 change *STRICT_OVERFLOW_P. */
14260 bool
14262 {
14265 {
14270 {
14282 /* For objects in symbol table check if we know they are non-zero.
14283 Don't do anything for variables and functions before symtab is built;
14284 it is quite possible that they will be declared weak later. */
14289 /* Constants are never weak. */
14294 }
14302 {
14306 }
14316 }
14318 }
14320 #define integer_valued_real_p(X) \
14323 #define RECURSE(X) \
14324 ((integer_valued_real_p) (X, depth + 1))
14326 /* Return true if the floating point result of (CODE OP0) has an
14327 integer value. We also allow +Inf, -Inf and NaN to be considered
14328 integer values. Return false for signaling NaN.
14330 DEPTH is the current nesting depth of the query. */
14332 bool
14334 {
14336 {
14343 CASE_CONVERT:
14344 {
14351 }
14355 }
14357 }
14359 /* Return true if the floating point result of (CODE OP0 OP1) has an
14360 integer value. We also allow +Inf, -Inf and NaN to be considered
14361 integer values. Return false for signaling NaN.
14363 DEPTH is the current nesting depth of the query. */
14365 bool
14367 {
14369 {
14379 }
14381 }
14383 /* Return true if the floating point result of calling FNDECL with arguments
14384 ARG0 and ARG1 has an integer value. We also allow +Inf, -Inf and NaN to be
14385 considered integer values. Return false for signaling NaN. If FNDECL
14386 takes fewer than 2 arguments, the remaining ARGn are null.
14388 DEPTH is the current nesting depth of the query. */
14390 bool
14392 {
14394 {
14395 CASE_CFN_CEIL:
14396 CASE_CFN_CEIL_FN:
14397 CASE_CFN_FLOOR:
14398 CASE_CFN_FLOOR_FN:
14399 CASE_CFN_NEARBYINT:
14400 CASE_CFN_NEARBYINT_FN:
14401 CASE_CFN_RINT:
14402 CASE_CFN_RINT_FN:
14403 CASE_CFN_ROUND:
14404 CASE_CFN_ROUND_FN:
14405 CASE_CFN_ROUNDEVEN:
14406 CASE_CFN_ROUNDEVEN_FN:
14407 CASE_CFN_TRUNC:
14408 CASE_CFN_TRUNC_FN:
14411 CASE_CFN_FMIN:
14412 CASE_CFN_FMIN_FN:
14413 CASE_CFN_FMAX:
14414 CASE_CFN_FMAX_FN:
14419 }
14421 }
14423 /* Return true if the floating point expression T (a GIMPLE_SINGLE_RHS)
14424 has an integer value. We also allow +Inf, -Inf and NaN to be
14425 considered integer values. Return false for signaling NaN.
14427 DEPTH is the current nesting depth of the query. */
14429 bool
14431 {
14433 {
14441 /* Limit the depth of recursion to avoid quadratic behavior.
14442 This is expected to catch almost all occurrences in practice.
14443 If this code misses important cases that unbounded recursion
14444 would not, passes that need this information could be revised
14445 to provide it through dataflow propagation. */
14449 depth));
14453 }
14455 }
14457 /* Return true if the floating point expression T (a GIMPLE_INVALID_RHS)
14458 has an integer value. We also allow +Inf, -Inf and NaN to be
14459 considered integer values. Return false for signaling NaN.
14461 DEPTH is the current nesting depth of the query. */
14463 static bool
14465 {
14467 {
14478 }
14480 }
14482 #undef RECURSE
14483 #undef integer_valued_real_p
14485 /* Return true if the floating point expression T has an integer value.
14486 We also allow +Inf, -Inf and NaN to be considered integer values.
14487 Return false for signaling NaN.
14489 DEPTH is the current nesting depth of the query. */
14491 bool
14493 {
14501 {
14517 }
14520 {
14526 {
14535 }
14539 }
14540 }
14542 /* Given the components of a binary expression CODE, TYPE, OP0 and OP1,
14543 attempt to fold the expression to a constant without modifying TYPE,
14544 OP0 or OP1.
14546 If the expression could be simplified to a constant, then return
14547 the constant. If the expression would not be simplified to a
14548 constant, then return NULL_TREE. */
14550 tree
14552 {
14555 }
14557 /* Given the components of a unary expression CODE, TYPE and OP0,
14558 attempt to fold the expression to a constant without modifying
14559 TYPE or OP0.
14561 If the expression could be simplified to a constant, then return
14562 the constant. If the expression would not be simplified to a
14563 constant, then return NULL_TREE. */
14565 tree
14567 {
14570 }
14572 /* If EXP represents referencing an element in a constant string
14573 (either via pointer arithmetic or array indexing), return the
14574 tree representing the value accessed, otherwise return NULL. */
14576 tree
14578 {
14582 {
14584 tree index;
14585 tree string;
14590 else
14591 {
14595 /* Optimize the special-case of a zero lower bound.
14597 We convert the low_bound to sizetype to avoid some problems
14598 with constant folding. (E.g. suppose the lower bound is 1,
14599 and its mode is QI. Without the conversion,l (ARRAY
14600 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
14601 +INDEX), which becomes (ARRAY+255+INDEX). Oops!) */
14607 }
14609 scalar_int_mode char_mode;
14621 }
14623 }
14625 /* Folds a read from vector element at IDX of vector ARG. */
14627 tree
14629 {
14634 {
14638 {
14642 }
14643 }
14645 }
14647 /* Return the tree for neg (ARG0) when ARG0 is known to be either
14648 an integer constant, real, or fixed-point constant.
14650 TYPE is the type of the result. */
14652 static tree
14654 {
14658 {
14664 {
14665 FIXED_VALUE_TYPE f;
14670 /* Propagate overflow flags. */
14674 }
14678 {
14685 }
14688 }
14691 }
14693 /* Return the tree for abs (ARG0) when ARG0 is known to be either
14694 an integer constant or real constant.
14696 TYPE is the type of the result. */
14698 tree
14700 {
14704 {
14706 {
14707 /* If the value is unsigned or non-negative, then the absolute value
14708 is the same as the ordinary value. */
14712 ;
14714 /* If the value is negative, then the absolute value is
14715 its negation. */
14716 else
14719 /* Force to the destination type, set TREE_OVERFLOW for signed
14720 TYPE only. */
14722 }
14728 else
14734 }
14737 }
14739 /* Return the tree for not (ARG0) when ARG0 is known to be an integer
14740 constant. TYPE is the type of the result. */
14742 static tree
14744 {
14748 }
14750 /* Given CODE, a relational operator, the target type, TYPE and two
14751 constant operands OP0 and OP1, return the result of the
14752 relational operation. If the result is not a compile time
14753 constant, then return NULL_TREE. */
14755 static tree
14757 {
14760 /* From here on, the only cases we handle are when the result is
14761 known to be a constant. */
14764 {
14768 /* Handle the cases where either operand is a NaN. */
14770 {
14772 {
14800 }
14803 }
14806 }
14809 {
14813 }
14815 /* Handle equality/inequality of complex constants. */
14817 {
14828 else
14830 }
14833 {
14835 {
14836 /* Have vector comparison with scalar boolean result. */
14844 {
14852 }
14854 }
14855 tree_vector_builder elts;
14860 {
14873 }
14876 }
14878 /* From here on we only handle LT, LE, GT, GE, EQ and NE.
14880 To compute GT, swap the arguments and do LT.
14881 To compute GE, do LT and invert the result.
14882 To compute LE, swap the arguments, do LT and invert the result.
14883 To compute NE, do EQ and invert the result.
14885 Therefore, the code below must handle only EQ and LT. */
14888 {
14891 }
14893 /* Note that it is safe to invert for real values here because we
14894 have already handled the one case that it matters. */
14898 {
14901 }
14903 /* Compute a result for LT or EQ if args permit;
14904 Otherwise return T. */
14906 {
14909 else
14911 }
14912 else
14918 }
14920 /* If necessary, return a CLEANUP_POINT_EXPR for EXPR with the
14921 indicated TYPE. If no CLEANUP_POINT_EXPR is necessary, return EXPR
14922 itself. */
14924 tree
14926 {
14927 /* If the expression does not have side effects then we don't have to wrap
14928 it with a cleanup point expression. */
14932 /* If the expression is a return, check to see if the expression inside the
14933 return has no side effects or the right hand side of the modify expression
14934 inside the return. If either don't have side effects set we don't need to
14935 wrap the expression in a cleanup point expression. Note we don't check the
14936 left hand side of the modify because it should always be a return decl. */
14938 {
14945 }
14948 }
14950 /* Given a pointer value OP0 and a type TYPE, return a simplified version
14951 of an indirection through OP0, or NULL_TREE if no simplification is
14952 possible. */
14954 tree
14956 {
14958 tree subtype;
14959 poly_uint64 const_op01;
14968 {
14972 /* *&CONST_DECL -> to the value of the const decl. */
14975 /* *&p => p; make sure to handle *&"str"[cst] here. */
14977 {
14981 else
14983 }
14984 /* *(foo *)&fooarray => fooarray[0] */
14987 && (!in_gimple_form
14989 {
14999 }
15000 /* *(foo *)&complexfoo => __real__ complexfoo */
15004 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
15007 {
15011 index);
15012 }
15013 }
15017 {
15023 {
15024 tree op00type;
15028 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
15031 /* POINTER_PLUS_EXPR second operand is sizetype, unsigned,
15032 but we want to treat offsets with MSB set as negative.
15033 For the code below negative offsets are invalid and
15034 TYPE_SIZE of the element is something unsigned, so
15035 check whether op01 fits into poly_int64, which implies
15036 it is from 0 to INTTYPE_MAXIMUM (HOST_WIDE_INT), and
15037 then just use poly_uint64 because we want to treat the
15038 value as unsigned. */
15040 {
15042 poly_uint64 max_offset
15046 {
15051 }
15052 }
15053 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
15056 {
15058 const_op01))
15060 }
15061 /* ((foo *)&fooarray)[1] => fooarray[1] */
15064 {
15073 {
15078 }
15079 }
15080 }
15081 }
15083 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
15086 && (!in_gimple_form
15088 {
15089 tree type_domain;
15099 NULL_TREE);
15100 }
15103 }
15105 /* Builds an expression for an indirection through T, simplifying some
15106 cases. */
15108 tree
15110 {
15118 }
15120 /* Given an INDIRECT_REF T, return either T or a simplified version. */
15122 tree
15124 {
15129 else
15131 }
15133 /* Strip non-trapping, non-side-effecting tree nodes from an expression
15134 whose result is ignored. The type of the returned tree need not be
15135 the same as the original expression. */
15137 tree
15139 {
15145 {
15156 else
15162 {
15178 }
15183 }
15184 }
15186 /* Return the value of VALUE, rounded up to a multiple of DIVISOR. */
15188 tree
15190 {
15196 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
15197 have to do anything. Only do this when we are not given a const,
15198 because in that case, this check is more expensive than just
15199 doing it. */
15201 {
15206 }
15208 /* If divisor is a power of two, simplify this to bit manipulation. */
15210 {
15212 {
15226 }
15227 else
15228 {
15229 tree t;
15235 }
15236 }
15237 else
15238 {
15243 }
15246 }
15248 /* Likewise, but round down. */
15250 tree
15252 {
15259 /* See if VALUE is already a multiple of DIVISOR. If so, we don't
15260 have to do anything. Only do this when we are not given a const,
15261 because in that case, this check is more expensive than just
15262 doing it. */
15264 {
15269 }
15271 /* If divisor is a power of two, simplify this to bit manipulation. */
15273 {
15274 tree t;
15278 }
15279 else
15280 {
15285 }
15288 }
15290 /* Returns the pointer to the base of the object addressed by EXP and
15291 extracts the information about the offset of the access, storing it
15292 to PBITPOS and POFFSET. */
15294 static tree
15297 {
15298 tree core;
15299 machine_mode mode;
15301 poly_int64 bitsize;
15305 {
15310 }
15312 {
15318 {
15319 poly_offset_int tem
15325 }
15326 }
15327 else
15328 {
15332 }
15335 }
15337 /* Returns true if addresses of E1 and E2 differ by a constant, false
15338 otherwise. If they do, E1 - E2 is stored in *DIFF. */
15340 bool
15342 {
15357 {
15367 }
15369 {
15370 /* If only one of the offsets is non-constant, the difference cannot
15371 be a constant. */
15373 }
15374 else
15379 }
15381 /* Return OFF converted to a pointer offset type suitable as offset for
15382 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
15383 tree
15385 {
15387 }
15389 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
15390 tree
15392 {
15395 }
15397 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
15398 tree
15400 {
15403 }
15405 /* Return a pointer P to a NUL-terminated string representing the sequence
15406 of constant characters referred to by SRC (or a subsequence of such
15407 characters within it if SRC is a reference to a string plus some
15408 constant offset). If STRLEN is non-null, store the number of bytes
15409 in the string constant including the terminating NUL char. *STRLEN is
15410 typically strlen(P) + 1 in the absence of embedded NUL characters. */
15414 {
15415 tree offset_node;
15416 tree mem_size;
15427 {
15430 else
15432 }
15437 /* STRING_LENGTH is the size of the string literal, including any
15438 embedded NULs. STRING_SIZE is the size of the array the string
15439 literal is stored in. */
15443 /* Ideally this would turn into a gcc_checking_assert over time. */
15449 /* Ideally this would turn into a gcc_checking_assert over time. */
15458 {
15459 /* Compute and store the length of the substring at OFFSET.
15460 All offsets past the initial length refer to null strings. */
15463 else
15465 }
15466 else
15467 {
15469 /* Support only properly NUL-terminated single byte strings. */
15474 }
15477 }
15479 /* Given a tree T, compute which bits in T may be nonzero. */
15481 wide_int
15483 {
15485 {
15503 CASE_CONVERT:
15509 {
15514 }
15518 {
15526 }
15530 {
15538 }
15542 }
15545 }
15547 #if CHECKING_P
15551 /* Helper functions for writing tests of folding trees. */
15553 /* Verify that the binary op (LHS CODE RHS) folds to CONSTANT. */
15555 static void
15557 tree constant)
15558 {
15560 }
15562 /* Verify that the binary op (LHS CODE RHS) folds to an NON_LVALUE_EXPR
15563 wrapping WRAPPED_EXPR. */
15565 static void
15567 tree wrapped_expr)
15568 {
15573 }
15575 /* Verify that various arithmetic binary operations are folded
15576 correctly. */
15578 static void
15580 {
15586 /* Addition. */
15587 /* 1 <-- (0 + 1) */
15589 one);
15591 one);
15593 /* (nonlvalue)x <-- (x + 0) */
15595 x);
15597 /* Subtraction. */
15598 /* 0 <-- (x - x) */
15600 zero);
15602 x);
15604 /* Multiplication. */
15605 /* 0 <-- (x * 0) */
15607 zero);
15609 /* (nonlvalue)x <-- (x * 1) */
15611 x);
15612 }
15614 /* Verify that various binary operations on vectors are folded
15615 correctly. */
15617 static void
15619 {
15626 /* Verify equality tests that return a scalar boolean result. */
15639 }
15641 /* Verify folding of VEC_DUPLICATE_EXPRs. */
15643 static void
15645 {
15648 /* This will be 1 if VEC_MODE isn't a vector mode. */
15655 }
15657 /* Run all of the selftests within this file. */
15659 void
15661 {
15665 }