| blob | 5ead9fe86f42df52f67918a981806ee10b317402 |
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
10 version.
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
22 /*@@ This file should be rewritten to use an arbitrary precision
23 @@ representation for "struct tree_int_cst" and "struct tree_real_cst".
24 @@ Perhaps the routines could also be used for bc/dc, and made a lib.
25 @@ The routines that translate from the ap rep should
26 @@ warn if precision et. al. is lost.
27 @@ This would also make life easier when this technology is used
28 @@ for cross-compilers. */
30 /* The entry points in this file are fold, size_int_wide, size_binop
31 and force_fit_type.
33 fold takes a tree as argument and returns a simplified tree.
35 size_binop takes a tree code for an arithmetic operation
36 and two operands that are trees, and produces a tree for the
37 result, assuming the type comes from `sizetype'.
39 size_int takes an integer value, and creates a tree constant
40 with type from `sizetype'.
42 force_fit_type takes a constant and prior overflow indicator, and
43 forces the value to fit the type. It returns an overflow indicator. */
62 HOST_WIDE_INT));
65 HOST_WIDE_INT *));
90 HOST_WIDE_INT *,
112 static tree fold_binary_op_with_conditional_arg
119 /* The following constants represent a bit based encoding of GCC's
120 comparison operators. This encoding simplifies transformations
121 on relational comparison operators, such as AND and OR. */
122 #define COMPCODE_FALSE 0
123 #define COMPCODE_LT 1
124 #define COMPCODE_EQ 2
125 #define COMPCODE_LE 3
126 #define COMPCODE_GT 4
127 #define COMPCODE_NE 5
128 #define COMPCODE_GE 6
129 #define COMPCODE_TRUE 7
131 /* We know that A1 + B1 = SUM1, using 2's complement arithmetic and ignoring
132 overflow. Suppose A, B and SUM have the same respective signs as A1, B1,
133 and SUM1. Then this yields nonzero if overflow occurred during the
134 addition.
136 Overflow occurs if A and B have the same sign, but A and SUM differ in
137 sign. Use `^' to test whether signs differ, and `< 0' to isolate the
138 sign. */
139 #define OVERFLOW_SUM_SIGN(a, b, sum) ((~((a) ^ (b)) & ((a) ^ (sum))) < 0)
140 \f
141 /* To do constant folding on INTEGER_CST nodes requires two-word arithmetic.
142 We do that by representing the two-word integer in 4 words, with only
143 HOST_BITS_PER_WIDE_INT / 2 bits stored in each word, as a positive
144 number. The value of the word is LOWPART + HIGHPART * BASE. */
146 #define LOWPART(x) \
147 ((x) & (((unsigned HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) - 1))
148 #define HIGHPART(x) \
149 ((unsigned HOST_WIDE_INT) (x) >> HOST_BITS_PER_WIDE_INT / 2)
150 #define BASE ((unsigned HOST_WIDE_INT) 1 << HOST_BITS_PER_WIDE_INT / 2)
152 /* Unpack a two-word integer into 4 words.
153 LOW and HI are the integer, as two `HOST_WIDE_INT' pieces.
154 WORDS points to the array of HOST_WIDE_INTs. */
156 static void
160 HOST_WIDE_INT hi;
161 {
166 }
168 /* Pack an array of 4 words into a two-word integer.
169 WORDS points to the array of words.
170 The integer is stored into *LOW and *HI as two `HOST_WIDE_INT' pieces. */
172 static void
177 {
180 }
181 \f
182 /* Make the integer constant T valid for its type by setting to 0 or 1 all
183 the bits in the constant that don't belong in the type.
185 Return 1 if a signed overflow occurs, 0 otherwise. If OVERFLOW is
186 nonzero, a signed overflow has already occurred in calculating T, so
187 propagate it. */
189 int
191 tree t;
193 {
195 HOST_WIDE_INT high;
199 {
200 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
201 Consider doing it via real_convert now. */
203 }
213 else
216 /* First clear all bits that are beyond the type's precision. */
219 ;
223 else
224 {
228 }
230 /* Unsigned types do not suffer sign extension or overflow unless they
231 are a sizetype. */
237 /* If the value's sign bit is set, extend the sign. */
245 {
246 /* Value is negative:
247 set to 1 all the bits that are outside this type's precision. */
251 else
252 {
256 }
257 }
259 /* Return nonzero if signed overflow occurred. */
260 return
263 }
264 \f
265 /* Add two doubleword integers with doubleword result.
266 Each argument is given as two `HOST_WIDE_INT' pieces.
267 One argument is L1 and H1; the other, L2 and H2.
268 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
270 int
276 {
278 HOST_WIDE_INT h;
286 }
288 /* Negate a doubleword integer with doubleword result.
289 Return nonzero if the operation overflows, assuming it's signed.
290 The argument is given as two `HOST_WIDE_INT' pieces in L1 and H1.
291 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
293 int
296 HOST_WIDE_INT h1;
299 {
301 {
305 }
306 else
307 {
311 }
312 }
313 \f
314 /* Multiply two doubleword integers with doubleword result.
315 Return nonzero if the operation overflows, assuming it's signed.
316 Each argument is given as two `HOST_WIDE_INT' pieces.
317 One argument is L1 and H1; the other, L2 and H2.
318 The value is stored as two `HOST_WIDE_INT' pieces in *LV and *HV. */
320 int
326 {
341 {
344 {
346 /* This product is <= 0xFFFE0001, the sum <= 0xFFFF0000. */
348 /* Since prod[p] < 0xFFFF, this sum <= 0xFFFFFFFF. */
352 }
354 }
358 /* Check for overflow by calculating the top half of the answer in full;
359 it should agree with the low half's sign bit. */
362 {
365 }
367 {
370 }
372 }
373 \f
374 /* Shift the doubleword integer in L1, H1 left by COUNT places
375 keeping only PREC bits of result.
376 Shift right if COUNT is negative.
377 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
378 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
380 void
388 {
392 {
395 }
397 #ifdef SHIFT_COUNT_TRUNCATED
400 #endif
403 {
404 /* Shifting by the host word size is undefined according to the
405 ANSI standard, so we must handle this as a special case. */
408 }
410 {
413 }
414 else
415 {
419 }
421 /* Sign extend all bits that are beyond the precision. */
429 ;
431 {
434 }
435 else
436 {
440 }
441 }
443 /* Shift the doubleword integer in L1, H1 right by COUNT places
444 keeping only PREC bits of result. COUNT must be positive.
445 ARITH nonzero specifies arithmetic shifting; otherwise use logical shift.
446 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
448 void
456 {
459 signmask = (arith
463 #ifdef SHIFT_COUNT_TRUNCATED
466 #endif
469 {
470 /* Shifting by the host word size is undefined according to the
471 ANSI standard, so we must handle this as a special case. */
474 }
476 {
479 }
480 else
481 {
485 }
487 /* Zero / sign extend all bits that are beyond the precision. */
490 {
493 }
495 ;
497 {
500 }
501 else
502 {
506 }
507 }
508 \f
509 /* Rotate the doubleword integer in L1, H1 left by COUNT places
510 keeping only PREC bits of result.
511 Rotate right if COUNT is negative.
512 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
514 void
521 {
533 }
535 /* Rotate the doubleword integer in L1, H1 left by COUNT places
536 keeping only PREC bits of result. COUNT must be positive.
537 Store the value as two `HOST_WIDE_INT' pieces in *LV and *HV. */
539 void
546 {
558 }
559 \f
560 /* Divide doubleword integer LNUM, HNUM by doubleword integer LDEN, HDEN
561 for a quotient (stored in *LQUO, *HQUO) and remainder (in *LREM, *HREM).
562 CODE is a tree code for a kind of division, one of
563 TRUNC_DIV_EXPR, FLOOR_DIV_EXPR, CEIL_DIV_EXPR, ROUND_DIV_EXPR
564 or EXACT_DIV_EXPR
565 It controls how the quotient is rounded to an integer.
566 Return nonzero if the operation overflows.
567 UNS nonzero says do unsigned division. */
569 int
576 HOST_WIDE_INT hnum_orig;
578 HOST_WIDE_INT hden_orig;
581 {
597 /* calculate quotient sign and convert operands to unsigned. */
599 {
601 {
603 /* (minimum integer) / (-1) is the only overflow case. */
607 }
609 {
612 }
613 }
618 /* This unsigned division rounds toward zero. */
621 }
625 /* hden != 0 already checked. */
630 }
640 /* Special code for when the divisor < BASE. */
642 {
643 /* hnum != 0 already checked. */
645 {
649 }
650 }
651 else
652 {
653 /* Full double precision division,
654 with thanks to Don Knuth's "Seminumerical Algorithms". */
658 /* Find the highest nonzero divisor digit. */
661 {
664 }
666 /* Insure that the first digit of the divisor is at least BASE/2.
667 This is required by the quotient digit estimation algorithm. */
674 {
678 }
683 {
688 }
689 }
693 /* Main loop */
695 {
696 /* Guess the next quotient digit, quo_est, by dividing the first
697 two remaining dividend digits by the high order quotient digit.
698 quo_est is never low and is at most 2 high. */
705 else
708 /* Refine quo_est so it's usually correct, and at most one high. */
713 quo_est--;
715 /* Try QUO_EST as the quotient digit, by multiplying the
716 divisor by QUO_EST and subtracting from the remaining dividend.
717 Keep in mind that QUO_EST is the I - 1st digit. */
721 {
727 }
729 /* If quo_est was high by one, then num[i] went negative and
730 we need to correct things. */
732 {
733 quo_est--;
736 {
740 }
743 }
745 /* Store the quotient digit. */
747 }
748 }
752 finish_up:
753 /* if result is negative, make it so. */
757 /* compute trial remainder: rem = num - (quo * den) */
763 {
772 {
773 /* quo = quo - 1; */
776 }
777 else
784 {
787 }
788 else
794 {
800 /* Get absolute values */
806 /* If (2 * abs (lrem) >= abs (lden)) */
815 {
817 /* quo = quo - 1; */
820 else
821 /* quo = quo + 1; */
824 }
825 else
827 }
832 }
834 /* compute true remainder: rem = num - (quo * den) */
839 }
840 \f
841 /* Determine whether an expression T can be cheaply negated using
842 the function negate_expr. */
844 static bool
846 tree t;
847 {
850 tree type;
859 {
864 /* Check that -CST will not overflow type. */
867 {
872 }
873 else
886 }
888 }
890 /* Given T, an expression, return the negation of T. Allow for T to be
891 null, in which case return null. */
893 static tree
895 tree t;
896 {
897 tree type;
898 tree tem;
907 {
920 /* - (A - B) -> B - A */
930 }
933 }
934 \f
935 /* Split a tree IN into a constant, literal and variable parts that could be
936 combined with CODE to make IN. "constant" means an expression with
937 TREE_CONSTANT but that isn't an actual constant. CODE must be a
938 commutative arithmetic operation. Store the constant part into *CONP,
939 the literal in *LITP and return the variable part. If a part isn't
940 present, set it to null. If the tree does not decompose in this way,
941 return the entire tree as the variable part and the other parts as null.
943 If CODE is PLUS_EXPR we also split trees that use MINUS_EXPR. In that
944 case, we negate an operand that was subtracted. Except if it is a
945 literal for which we use *MINUS_LITP instead.
947 If NEGATE_P is true, we are negating all of IN, again except a literal
948 for which we use *MINUS_LITP instead.
950 If IN is itself a literal or constant, return it as appropriate.
952 Note that we do not guarantee that any of the three values will be the
953 same type as IN, but they will have the same signedness and mode. */
955 static tree
957 tree in;
961 {
968 /* Strip any conversions that don't change the machine mode or signedness. */
975 /* We can associate addition and subtraction together (even
976 though the C standard doesn't say so) for integers because
977 the value is not affected. For reals, the value might be
978 affected, so we can't. */
981 {
987 /* First see if either of the operands is a literal, then a constant. */
998 /* If we haven't dealt with either operand, this is not a case we can
999 decompose. Otherwise, VAR is either of the ones remaining, if any. */
1004 else
1007 /* Now do any needed negations. */
1014 }
1017 else
1021 {
1028 }
1031 }
1033 /* Re-associate trees split by the above function. T1 and T2 are either
1034 expressions to associate or null. Return the new expression, if any. If
1035 we build an operation, do it in TYPE and with CODE. */
1037 static tree
1041 tree type;
1042 {
1048 /* If either input is CODE, a PLUS_EXPR, or a MINUS_EXPR, don't
1049 try to fold this since we will have infinite recursion. But do
1050 deal with any NEGATE_EXPRs. */
1053 {
1055 {
1062 }
1064 }
1067 }
1068 \f
1069 /* Combine two integer constants ARG1 and ARG2 under operation CODE
1070 to produce a new constant.
1072 If NOTRUNC is nonzero, do not truncate the result to fit the data type. */
1074 static tree
1079 {
1083 HOST_WIDE_INT hi;
1085 HOST_WIDE_INT garbageh;
1086 tree t;
1089 int is_sizetype
1100 {
1120 /* It's unclear from the C standard whether shifts can overflow.
1121 The following code ignores overflow; perhaps a C standard
1122 interpretation ruling is needed. */
1152 /* This is a shortcut for a common special case. */
1157 {
1163 }
1165 /* ... fall through ... */
1169 {
1172 }
1175 {
1178 }
1185 /* This is a shortcut for a common special case. */
1190 {
1195 }
1197 /* ... fall through ... */
1213 else
1219 else
1225 }
1227 /* If this is for a sizetype, can be represented as one (signed)
1228 HOST_WIDE_INT word, and doesn't overflow, use size_int since it caches
1229 constants. */
1235 else
1236 {
1239 }
1242 = ((notrunc
1249 /* If we're doing a size calculation, unsigned arithmetic does overflow.
1250 So check if force_fit_type truncated the value. */
1261 }
1263 /* Combine two constants ARG1 and ARG2 under operation CODE to produce a new
1264 constant. We assume ARG1 and ARG2 have the same data type, or at least
1265 are the same kind of constant and the same machine mode.
1267 If NOTRUNC is nonzero, do not truncate the result to fit the data type. */
1269 static tree
1274 {
1282 {
1283 REAL_VALUE_TYPE d1;
1284 REAL_VALUE_TYPE d2;
1285 REAL_VALUE_TYPE value;
1286 tree t;
1291 /* If either operand is a NaN, just return it. Otherwise, set up
1292 for floating-point trap; we return an overflow. */
1302 value));
1312 }
1314 {
1320 tree t;
1323 {
1343 notrunc),
1349 notrunc));
1353 {
1354 tree magsquared
1358 notrunc);
1361 const_binop
1366 notrunc),
1368 notrunc),
1369 notrunc),
1371 const_binop
1376 notrunc),
1378 notrunc),
1379 notrunc),
1381 }
1386 }
1388 }
1390 }
1392 /* These are the hash table functions for the hash table of INTEGER_CST
1393 nodes of a sizetype. */
1395 /* Return the hash code code X, an INTEGER_CST. */
1397 static hashval_t
1400 {
1406 }
1408 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1409 is the same as that given by *Y, which is the same. */
1411 static int
1415 {
1423 }
1424 \f
1425 /* Return an INTEGER_CST with value whose low-order HOST_BITS_PER_WIDE_INT
1426 bits are given by NUMBER and of the sizetype represented by KIND. */
1428 tree
1430 HOST_WIDE_INT number;
1432 {
1434 }
1436 /* Likewise, but the desired type is specified explicitly. */
1440 htab_t size_htab;
1442 tree
1444 HOST_WIDE_INT number;
1445 tree type;
1446 {
1450 {
1453 }
1455 /* Adjust NEW_CONST to be the constant we want. If it's already in the
1456 hash table, we return the value from the hash table. Otherwise, we
1457 place that in the hash table and make a new node for the next time. */
1466 {
1472 }
1473 else
1475 }
1477 /* Combine operands OP1 and OP2 with arithmetic operation CODE. CODE
1478 is a tree code. The type of the result is taken from the operands.
1479 Both must be the same type integer type and it must be a size type.
1480 If the operands are constant, so is the result. */
1482 tree
1486 {
1493 /* Handle the special case of two integer constants faster. */
1495 {
1496 /* And some specific cases even faster than that. */
1505 /* Handle general case of two integer constants. */
1507 }
1513 }
1515 /* Given two values, either both of sizetype or both of bitsizetype,
1516 compute the difference between the two values. Return the value
1517 in signed type corresponding to the type of the operands. */
1519 tree
1522 {
1524 tree ctype;
1530 /* If the type is already signed, just do the simple thing. */
1537 /* If either operand is not a constant, do the conversions to the signed
1538 type and subtract. The hardware will do the right thing with any
1539 overflow in the subtraction. */
1544 /* If ARG0 is larger than ARG1, subtract and return the result in CTYPE.
1545 Otherwise, subtract the other way, convert to CTYPE (we know that can't
1546 overflow) and negate (which can't either). Special-case a result
1547 of zero while we're here. */
1552 else
1555 }
1556 \f
1558 /* Given T, a tree representing type conversion of ARG1, a constant,
1559 return a constant tree representing the result of conversion. */
1561 static tree
1563 tree t;
1564 tree arg1;
1565 {
1570 {
1572 {
1573 /* If we would build a constant wider than GCC supports,
1574 leave the conversion unfolded. */
1578 /* If we are trying to make a sizetype for a small integer, use
1579 size_int to pick up cached types to reduce duplicate nodes. */
1585 /* Given an integer constant, make new constant with new type,
1586 appropriately sign-extended or truncated. */
1590 /* Indicate an overflow if (1) ARG1 already overflowed,
1591 or (2) force_fit_type indicates an overflow.
1592 Tell force_fit_type that an overflow has already occurred
1593 if ARG1 is a too-large unsigned value and T is signed.
1594 But don't indicate an overflow if converting a pointer. */
1604 }
1606 {
1607 /* Don't initialize these, use assignments.
1608 Initialized local aggregates don't work on old compilers. */
1609 REAL_VALUE_TYPE x;
1610 REAL_VALUE_TYPE l;
1611 REAL_VALUE_TYPE u;
1622 /* See if X will be in range after truncation towards 0.
1623 To compensate for truncation, move the bounds away from 0,
1624 but reject if X exactly equals the adjusted bounds. */
1628 /* If X is a NaN, use zero instead and show we have an overflow.
1629 Otherwise, range check. */
1633 && !no_upper_bound
1637 {
1641 }
1647 }
1649 }
1651 {
1655 {
1657 {
1658 /* We make a copy of ARG1 so that we don't modify an
1659 existing constant tree. */
1663 }
1674 }
1675 }
1678 }
1679 \f
1680 /* Return an expr equal to X but certainly not valid as an lvalue. */
1682 tree
1684 tree x;
1685 {
1686 tree result;
1688 /* These things are certainly not lvalues. */
1699 }
1701 /* Nonzero means lvalues are limited to those valid in pedantic ANSI C.
1702 Zero means allow extended lvalues. */
1706 /* When pedantic, return an expr equal to X but certainly not valid as a
1707 pedantic lvalue. Otherwise, return X. */
1709 tree
1711 tree x;
1712 {
1715 else
1717 }
1718 \f
1719 /* Given a tree comparison code, return the code that is the logical inverse
1720 of the given code. It is not safe to do this for floating-point
1721 comparisons, except for NE_EXPR and EQ_EXPR. */
1723 static enum tree_code
1726 {
1728 {
1743 }
1744 }
1746 /* Similar, but return the comparison that results if the operands are
1747 swapped. This is safe for floating-point. */
1749 static enum tree_code
1752 {
1754 {
1768 }
1769 }
1772 /* Convert a comparison tree code from an enum tree_code representation
1773 into a compcode bit-based encoding. This function is the inverse of
1774 compcode_to_comparison. */
1776 static int
1779 {
1781 {
1796 }
1797 }
1799 /* Convert a compcode bit-based encoding of a comparison operator back
1800 to GCC's enum tree_code representation. This function is the
1801 inverse of comparison_to_compcode. */
1803 static enum tree_code
1806 {
1808 {
1823 }
1824 }
1826 /* Return nonzero if CODE is a tree code that represents a truth value. */
1828 static int
1831 {
1836 }
1837 \f
1838 /* Return nonzero if two operands are necessarily equal.
1839 If ONLY_CONST is nonzero, only return nonzero for constants.
1840 This function tests whether the operands are indistinguishable;
1841 it does not test whether they are equal using C's == operation.
1842 The distinction is important for IEEE floating point, because
1843 (1) -0.0 and 0.0 are distinguishable, but -0.0==0.0, and
1844 (2) two NaNs may be indistinguishable, but NaN!=NaN. */
1846 int
1850 {
1851 /* If both types don't have the same signedness, then we can't consider
1852 them equal. We must check this before the STRIP_NOPS calls
1853 because they may change the signedness of the arguments. */
1861 /* This is needed for conversions and for COMPONENT_REF.
1862 Might as well play it safe and always test this. */
1868 /* If ARG0 and ARG1 are the same SAVE_EXPR, they are necessarily equal.
1869 We don't care about side effects in that case because the SAVE_EXPR
1870 takes care of that for us. In all other cases, two expressions are
1871 equal if they have no side effects. If we have two identical
1872 expressions with side effects that should be treated the same due
1873 to the only side effects being identical SAVE_EXPR's, that will
1874 be detected in the recursive calls below. */
1880 /* Next handle constant cases, those for which we can return 1 even
1881 if ONLY_CONST is set. */
1884 {
1897 {
1907 {
1912 }
1915 }
1919 only_const)
1921 only_const));
1934 }
1940 {
1942 /* Two conversions are equal only if signedness and modes match. */
1958 /* For commutative ops, allow the other order. */
1971 /* If either of the pointer (or reference) expressions we are
1972 dereferencing contain a side effect, these cannot be equal. */
1978 {
2000 }
2004 {
2014 /* If the CALL_EXPRs call different functions, then they
2015 clearly can not be equal. */
2020 /* Only consider const functions equivalent. */
2022 {
2026 }
2027 else
2030 /* Now see if all the arguments are the same. operand_equal_p
2031 does not handle TREE_LIST, so we walk the operands here
2032 feeding them to operand_equal_p. */
2036 {
2042 }
2044 /* If we get here and both argument lists are exhausted
2045 then the CALL_EXPRs are equal. */
2050 }
2053 /* Consider __builtin_sqrt equal to sqrt. */
2061 }
2062 }
2063 \f
2064 /* Similar to operand_equal_p, but see if ARG0 might have been made by
2065 shorten_compare from ARG1 when ARG1 was being compared with OTHER.
2067 When in doubt, return 0. */
2069 static int
2072 tree other;
2073 {
2085 /* Discard any conversions that don't change the modes of ARG0 and ARG1
2086 and see if the inner values are the same. This removes any
2087 signedness comparison, which doesn't matter here. */
2094 /* Duplicate what shorten_compare does to ARG1 and see if that gives the
2095 actual comparison operand, ARG0.
2097 First throw away any conversions to wider types
2098 already present in the operands. */
2107 {
2110 /* Make sure shorter operand is extended the right way
2111 to match the longer operand. */
2117 }
2120 }
2121 \f
2122 /* See if ARG is an expression that is either a comparison or is performing
2123 arithmetic on comparisons. The comparisons must only be comparing
2124 two different values, which will be stored in *CVAL1 and *CVAL2; if
2125 they are nonzero it means that some operands have already been found.
2126 No variables may be used anywhere else in the expression except in the
2127 comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around
2128 the expression and save_expr needs to be called with CVAL1 and CVAL2.
2130 If this is true, return 1. Otherwise, return zero. */
2132 static int
2134 tree arg;
2137 {
2141 /* We can handle some of the 'e' cases here. */
2151 {
2152 /* If we've already found a CVAL1 or CVAL2, this expression is
2153 two complex to handle. */
2159 }
2162 {
2185 /* First see if we can handle the first operand, then the second. For
2186 the second operand, we know *CVAL1 can't be zero. It must be that
2187 one side of the comparison is each of the values; test for the
2188 case where this isn't true by failing if the two operands
2189 are the same. */
2198 ;
2202 ;
2203 else
2207 ;
2211 ;
2212 else
2219 }
2220 }
2221 \f
2222 /* ARG is a tree that is known to contain just arithmetic operations and
2223 comparisons. Evaluate the operations in the tree substituting NEW0 for
2224 any occurrence of OLD0 as an operand of a comparison and likewise for
2225 NEW1 and OLD1. */
2227 static tree
2229 tree arg;
2231 {
2236 /* We can handle some of the 'e' cases here. */
2244 {
2259 {
2276 }
2277 /* fall through - ??? */
2280 {
2284 /* We need to check both for exact equality and tree equality. The
2285 former will be true if the operand has a side-effect. In that
2286 case, we know the operand occurred exactly once. */
2299 }
2303 }
2304 }
2305 \f
2306 /* Return a tree for the case when the result of an expression is RESULT
2307 converted to TYPE and OMITTED was previously an operand of the expression
2308 but is now not needed (e.g., we folded OMITTED * 0).
2310 If OMITTED has side effects, we must evaluate it. Otherwise, just do
2311 the conversion of RESULT to TYPE. */
2313 tree
2316 {
2323 }
2325 /* Similar, but call pedantic_non_lvalue instead of non_lvalue. */
2327 static tree
2330 {
2337 }
2338 \f
2339 /* Return a simplified tree node for the truth-negation of ARG. This
2340 never alters ARG itself. We assume that ARG is an operation that
2341 returns a truth value (0 or 1). */
2343 tree
2345 tree arg;
2346 {
2353 /* If this is a comparison, we can simply invert it, except for
2354 floating-point non-equality comparisons, in which case we just
2355 enclose a TRUTH_NOT_EXPR around what we have. */
2358 {
2360 && !flag_unsafe_math_optimizations
2364 else
2367 }
2370 {
2385 /* Here we can invert either operand. We invert the first operand
2386 unless the second operand is a TRUTH_NOT_EXPR in which case our
2387 result is the XOR of the first operand with the inside of the
2388 negation of the second operand. */
2393 else
2448 }
2452 }
2454 /* Given a bit-wise operation CODE applied to ARG0 and ARG1, see if both
2455 operands are another bit-wise operation with a common input. If so,
2456 distribute the bit operations to save an operation and possibly two if
2457 constants are involved. For example, convert
2458 (A | B) & (A | C) into A | (B & C)
2459 Further simplification will occur if B and C are constants.
2461 If this optimization cannot be done, 0 will be returned. */
2463 static tree
2466 tree type;
2468 {
2469 tree common;
2479 {
2483 }
2485 {
2489 }
2491 {
2495 }
2497 {
2501 }
2502 else
2507 }
2508 \f
2509 /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER
2510 starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero. */
2512 static tree
2514 tree inner;
2515 tree type;
2518 {
2525 }
2527 /* Optimize a bit-field compare.
2529 There are two cases: First is a compare against a constant and the
2530 second is a comparison of two items where the fields are at the same
2531 bit position relative to the start of a chunk (byte, halfword, word)
2532 large enough to contain it. In these cases we can avoid the shift
2533 implicit in bitfield extractions.
2535 For constants, we emit a compare of the shifted constant with the
2536 BIT_AND_EXPR of a mask and a byte, halfword, or word of the operand being
2537 compared. For two fields at the same position, we do the ANDs with the
2538 similar mask and compare the result of the ANDs.
2540 CODE is the comparison code, known to be either NE_EXPR or EQ_EXPR.
2541 COMPARE_TYPE is the type of the comparison, and LHS and RHS
2542 are the left and right operands of the comparison, respectively.
2544 If the optimization described above can be done, we return the resulting
2545 tree. Otherwise we return zero. */
2547 static tree
2550 tree compare_type;
2552 {
2561 tree mask;
2562 tree offset;
2564 /* Get all the information about the extractions being done. If the bit size
2565 if the same as the size of the underlying object, we aren't doing an
2566 extraction at all and so can do nothing. We also don't want to
2567 do anything if the inner expression is a PLACEHOLDER_EXPR since we
2568 then will no longer be able to replace it. */
2576 {
2577 /* If this is not a constant, we can only do something if bit positions,
2578 sizes, and signedness are the same. */
2586 }
2588 /* See if we can find a mode to refer to this field. We should be able to,
2589 but fail if we can't. */
2598 /* Set signed and unsigned types of the precision of this mode for the
2599 shifts below. */
2603 /* Compute the bit position and size for the new reference and our offset
2604 within it. If the new reference is the same size as the original, we
2605 won't optimize anything, so return zero. */
2615 /* Make the mask to be used against the extracted field. */
2625 /* If not comparing with constant, just rework the comparison
2626 and return. */
2631 mask),
2635 mask));
2637 /* Otherwise, we are handling the constant case. See if the constant is too
2638 big for the field. Warn and return a tree of for 0 (false) if so. We do
2639 this not only for its own sake, but to avoid having to test for this
2640 error case below. If we didn't, we might generate wrong code.
2642 For unsigned fields, the constant shifted right by the field length should
2643 be all zero. For signed fields, the high-order bits should agree with
2644 the sign bit. */
2647 {
2651 {
2657 }
2658 }
2659 else
2660 {
2664 {
2670 }
2671 }
2673 /* Single-bit compares should always be against zero. */
2675 {
2678 }
2680 /* Make a new bitfield reference, shift the constant over the
2681 appropriate number of bits and mask it with the computed mask
2682 (in case this was a signed field). If we changed it, make a new one. */
2685 {
2688 }
2698 rhs);
2699 }
2700 \f
2701 /* Subroutine for fold_truthop: decode a field reference.
2703 If EXP is a comparison reference, we return the innermost reference.
2705 *PBITSIZE is set to the number of bits in the reference, *PBITPOS is
2706 set to the starting bit number.
2708 If the innermost field can be completely contained in a mode-sized
2709 unit, *PMODE is set to that mode. Otherwise, it is set to VOIDmode.
2711 *PVOLATILEP is set to 1 if the any expression encountered is volatile;
2712 otherwise it is not changed.
2714 *PUNSIGNEDP is set to the signedness of the field.
2716 *PMASK is set to the mask used. This is either contained in a
2717 BIT_AND_EXPR or derived from the width of the field.
2719 *PAND_MASK is set to the mask found in a BIT_AND_EXPR, if any.
2721 Return 0 if this is not a component reference or is one that we can't
2722 do anything with. */
2724 static tree
2727 tree exp;
2733 {
2736 tree unsigned_type;
2739 /* All the optimizations using this function assume integer fields.
2740 There are problems with FP fields since the type_for_size call
2741 below can fail for, e.g., XFmode. */
2748 {
2754 }
2763 /* Compute the mask to access the bitfield. */
2773 /* Merge it with the mask we found in the BIT_AND_EXPR, if any. */
2781 }
2783 /* Return nonzero if MASK represents a mask of SIZE ones in the low-order
2784 bit positions. */
2786 static int
2788 tree mask;
2790 {
2793 tree tmask;
2798 return
2805 }
2807 /* Subroutine for fold: determine if VAL is the INTEGER_CONST that
2808 represents the sign bit of EXP's type. If EXP represents a sign
2809 or zero extension, also test VAL against the unextended type.
2810 The return value is the (sub)expression whose sign bit is VAL,
2811 or NULL_TREE otherwise. */
2813 static tree
2815 tree exp;
2816 tree val;
2817 {
2819 HOST_WIDE_INT hi;
2821 tree t;
2823 /* Tree EXP must have an integral type. */
2828 /* Tree VAL must be an integer constant. */
2835 {
2838 }
2839 else
2840 {
2843 }
2848 /* Handle extension from a narrower type. */
2854 }
2856 /* Subroutine for fold_truthop: determine if an operand is simple enough
2857 to be evaluated unconditionally. */
2859 static int
2861 tree exp;
2862 {
2863 /* Strip any conversions that don't change the machine mode. */
2875 /* Don't regard global variables as simple. They may be
2876 allocated in ways unknown to the compiler (shared memory,
2877 #pragma weak, etc). */
2880 /* Loading a static variable is unduly expensive, but global
2881 registers aren't expensive. */
2883 }
2884 \f
2885 /* The following functions are subroutines to fold_range_test and allow it to
2886 try to change a logical combination of comparisons into a range test.
2888 For example, both
2889 X == 2 || X == 3 || X == 4 || X == 5
2890 and
2891 X >= 2 && X <= 5
2892 are converted to
2893 (unsigned) (X - 2) <= 3
2895 We describe each set of comparisons as being either inside or outside
2896 a range, using a variable named like IN_P, and then describe the
2897 range with a lower and upper bound. If one of the bounds is omitted,
2898 it represents either the highest or lowest value of the type.
2900 In the comments below, we represent a range by two numbers in brackets
2901 preceded by a "+" to designate being inside that range, or a "-" to
2902 designate being outside that range, so the condition can be inverted by
2903 flipping the prefix. An omitted bound is represented by a "-". For
2904 example, "- [-, 10]" means being outside the range starting at the lowest
2905 possible value and ending at 10, in other words, being greater than 10.
2906 The range "+ [-, -]" is always true and hence the range "- [-, -]" is
2907 always false.
2909 We set up things so that the missing bounds are handled in a consistent
2910 manner so neither a missing bound nor "true" and "false" need to be
2911 handled using a special case. */
2913 /* Return the result of applying CODE to ARG0 and ARG1, but handle the case
2914 of ARG0 and/or ARG1 being omitted, meaning an unlimited range. UPPER0_P
2915 and UPPER1_P are nonzero if the respective argument is an upper bound
2916 and zero for a lower. TYPE, if nonzero, is the type of the result; it
2917 must be specified for a comparison. ARG1 will be converted to ARG0's
2918 type if both are specified. */
2920 static tree
2923 tree type;
2926 {
2927 tree tem;
2931 /* If neither arg represents infinity, do the normal operation.
2932 Else, if not a comparison, return infinity. Else handle the special
2933 comparison rules. Note that most of the cases below won't occur, but
2934 are handled for consistency. */
2937 {
2942 }
2947 /* Set SGN[01] to -1 if ARG[01] is a lower bound, 1 for upper, and 0
2948 for neither. In real maths, we cannot assume open ended ranges are
2949 the same. But, this is computer arithmetic, where numbers are finite.
2950 We can therefore make the transformation of any unbounded range with
2951 the value Z, Z being greater than any representable number. This permits
2952 us to treat unbounded ranges as equal. */
2956 {
2977 }
2980 }
2981 \f
2982 /* Given EXP, a logical expression, set the range it is testing into
2983 variables denoted by PIN_P, PLOW, and PHIGH. Return the expression
2984 actually being tested. *PLOW and *PHIGH will be made of the same type
2985 as the returned expression. If EXP is not a comparison, we will most
2986 likely not be returning a useful value and range. */
2988 static tree
2990 tree exp;
2993 {
3000 /* Start with simply saying "EXP != 0" and then look at the code of EXP
3001 and see if we can refine the range. Some of the cases below may not
3002 happen, but it doesn't seem worth worrying about this. We "continue"
3003 the outer loop when we've changed something; otherwise we "break"
3004 the switch, which will "break" the while. */
3009 {
3013 {
3024 }
3026 /* Set ORIG_TYPE as soon as TYPE is non-null so that we do not
3027 lose a cast by accident. */
3032 {
3039 /* We can only do something if the range is testing for zero
3040 and if the second operand is an integer constant. Note that
3041 saying something is "in" the range we make is done by
3042 complementing IN_P since it will set in the initial case of
3043 being not equal to zero; "out" is leaving it alone. */
3050 {
3071 }
3075 /* If this is an unsigned comparison, we also know that EXP is
3076 greater than or equal to zero. We base the range tests we make
3077 on that fact, so we record it here so we can parse existing
3078 range tests. */
3080 {
3083 NULL_TREE))
3088 /* If the high bound is missing, but we
3089 have a low bound, reverse the range so
3090 it goes from zero to the low bound minus 1. */
3092 {
3097 }
3098 }
3102 /* (-x) IN [a,b] -> x in [-b, -a] */
3112 /* ~ X -> -X - 1 */
3121 /* If EXP is signed, any overflow in the computation is undefined,
3122 so we don't worry about it so long as our computations on
3123 the bounds don't overflow. For unsigned, overflow is defined
3124 and this is exactly the right thing. */
3133 /* Check for an unsigned range which has wrapped around the maximum
3134 value thus making n_high < n_low, and normalize it. */
3136 {
3142 /* If the range is of the form +/- [ x+1, x ], we won't
3143 be able to normalize it. But then, it represents the
3144 whole range or the empty set, so make it
3145 +/- [ -, - ]. */
3149 else
3151 }
3152 else
3175 /* If we're converting from an unsigned to a signed type,
3176 we will be doing the comparison as unsigned. The tests above
3177 have already verified that LOW and HIGH are both positive.
3179 So we have to make sure that the original unsigned value will
3180 be interpreted as positive. */
3182 {
3185 tree high_positive;
3187 /* A range without an upper bound is, naturally, unbounded.
3188 Since convert would have cropped a very large value, use
3189 the max value for the destination type. */
3190 high_positive
3199 /* If the low bound is specified, "and" the range with the
3200 range for which the original unsigned value will be
3201 positive. */
3203 {
3207 high_positive))
3211 }
3212 else
3213 {
3214 /* Otherwise, "or" the range with the range of the input
3215 that will be interpreted as negative. */
3219 high_positive))
3223 }
3224 }
3232 }
3235 }
3237 /* If EXP is a constant, we can evaluate whether this is true or false. */
3239 {
3246 }
3250 }
3251 \f
3252 /* Given a range, LOW, HIGH, and IN_P, an expression, EXP, and a result
3253 type, TYPE, return an expression to test if EXP is in (or out of, depending
3254 on IN_P) the range. */
3256 static tree
3258 tree type;
3259 tree exp;
3262 {
3264 tree value;
3283 {
3285 {
3289 }
3291 }
3293 /* Optimize (c>=1) && (c<=127) into (signed char)c > 0. */
3295 {
3297 HOST_WIDE_INT hi;
3302 {
3305 }
3306 else
3307 {
3310 }
3313 {
3315 {
3318 }
3321 }
3322 }
3331 }
3332 \f
3333 /* Given two ranges, see if we can merge them into one. Return 1 if we
3334 can, 0 if we can't. Set the output range into the specified parameters. */
3336 static int
3342 {
3346 tree tem;
3356 /* Make range 0 be the range that starts first, or ends last if they
3357 start at the same value. Swap them if it isn't. */
3360 || (lowequal
3363 {
3367 }
3369 /* Now flag two cases, whether the ranges are disjoint or whether the
3370 second range is totally subsumed in the first. Note that the tests
3371 below are simplified by the ones above. */
3377 /* We now have four cases, depending on whether we are including or
3378 excluding the two ranges. */
3380 {
3381 /* If they don't overlap, the result is false. If the second range
3382 is a subset it is the result. Otherwise, the range is from the start
3383 of the second to the end of the first. */
3388 else
3390 }
3393 {
3394 /* If they don't overlap, the result is the first range. If they are
3395 equal, the result is false. If the second range is a subset of the
3396 first, and the ranges begin at the same place, we go from just after
3397 the end of the first range to the end of the second. If the second
3398 range is not a subset of the first, or if it is a subset and both
3399 ranges end at the same place, the range starts at the start of the
3400 first range and ends just before the second range.
3401 Otherwise, we can't describe this as a single range. */
3407 {
3411 }
3413 {
3417 }
3418 else
3420 }
3423 {
3424 /* If they don't overlap, the result is the second range. If the second
3425 is a subset of the first, the result is false. Otherwise,
3426 the range starts just after the first range and ends at the
3427 end of the second. */
3432 else
3433 {
3437 }
3438 }
3440 else
3441 {
3442 /* The case where we are excluding both ranges. Here the complex case
3443 is if they don't overlap. In that case, the only time we have a
3444 range is if they are adjacent. If the second is a subset of the
3445 first, the result is the first. Otherwise, the range to exclude
3446 starts at the beginning of the first range and ends at the end of the
3447 second. */
3449 {
3456 else
3458 }
3461 else
3463 }
3467 }
3468 \f
3469 #ifndef RANGE_TEST_NON_SHORT_CIRCUIT
3470 #define RANGE_TEST_NON_SHORT_CIRCUIT (BRANCH_COST >= 2)
3471 #endif
3473 /* EXP is some logical combination of boolean tests. See if we can
3474 merge it into some range test. Return the new tree if so. */
3476 static tree
3478 tree exp;
3479 {
3486 tree tem;
3488 /* If this is an OR operation, invert both sides; we will invert
3489 again at the end. */
3493 /* If both expressions are the same, if we can merge the ranges, and we
3494 can build the range test, return it or it inverted. If one of the
3495 ranges is always true or always false, consider it to be the same
3496 expression as the other. */
3506 /* On machines where the branch cost is expensive, if this is a
3507 short-circuited branch and the underlying object on both sides
3508 is the same, make a non-short-circuit operation. */
3514 {
3515 /* If simple enough, just rewrite. Otherwise, make a SAVE_EXPR
3516 unless we are at top level or LHS contains a PLACEHOLDER_EXPR, in
3517 which cases we can't do this. */
3526 {
3538 }
3539 }
3542 }
3543 \f
3544 /* Subroutine for fold_truthop: C is an INTEGER_CST interpreted as a P
3545 bit value. Arrange things so the extra bits will be set to zero if and
3546 only if C is signed-extended to its full width. If MASK is nonzero,
3547 it is an INTEGER_CST that should be AND'ed with the extra bits. */
3549 static tree
3551 tree c;
3554 tree mask;
3555 {
3558 tree temp;
3563 /* We work by getting just the sign bit into the low-order bit, then
3564 into the high-order bit, then sign-extend. We then XOR that value
3565 with C. */
3569 /* We must use a signed type in order to get an arithmetic right shift.
3570 However, we must also avoid introducing accidental overflows, so that
3571 a subsequent call to integer_zerop will work. Hence we must
3572 do the type conversion here. At this point, the constant is either
3573 zero or one, and the conversion to a signed type can never overflow.
3574 We could get an overflow if this conversion is done anywhere else. */
3582 /* If necessary, convert the type back to match the type of C. */
3587 }
3588 \f
3589 /* Find ways of folding logical expressions of LHS and RHS:
3590 Try to merge two comparisons to the same innermost item.
3591 Look for range tests like "ch >= '0' && ch <= '9'".
3592 Look for combinations of simple terms on machines with expensive branches
3593 and evaluate the RHS unconditionally.
3595 For example, if we have p->a == 2 && p->b == 4 and we can make an
3596 object large enough to span both A and B, we can do this with a comparison
3597 against the object ANDed with the a mask.
3599 If we have p->a == q->a && p->b == q->b, we may be able to use bit masking
3600 operations to do this with one comparison.
3602 We check for both normal comparisons and the BIT_AND_EXPRs made this by
3603 function and the one above.
3605 CODE is the logical operation being done. It can be TRUTH_ANDIF_EXPR,
3606 TRUTH_AND_EXPR, TRUTH_ORIF_EXPR, or TRUTH_OR_EXPR.
3608 TRUTH_TYPE is the type of the logical operand and LHS and RHS are its
3609 two operands.
3611 We return the simplified tree or 0 if no optimization is possible. */
3613 static tree
3617 {
3618 /* If this is the "or" of two comparisons, we can do something if
3619 the comparisons are NE_EXPR. If this is the "and", we can do something
3620 if the comparisons are EQ_EXPR. I.e.,
3621 (a->b == 2 && a->c == 4) can become (a->new == NEW).
3623 WANTED_CODE is this operation code. For single bit fields, we can
3624 convert EQ_EXPR to NE_EXPR so we need not reject the "wrong"
3625 comparison for one-bit fields. */
3645 /* Start by getting the comparison codes. Fail if anything is volatile.
3646 If one operand is a BIT_AND_EXPR with the constant one, treat it as if
3647 it were surrounded with a NE_EXPR. */
3672 /* Simplify (x<y) && (x==y) into (x<=y) and related optimizations. */
3676 {
3681 {
3689 }
3692 {
3701 }
3702 else
3712 }
3714 /* If the RHS can be evaluated unconditionally and its operands are
3715 simple, it wins to evaluate the RHS unconditionally on machines
3716 with expensive branches. In this case, this isn't a comparison
3717 that can be merged. Avoid doing this if the RHS is a floating-point
3718 comparison since those can trap. */
3724 {
3725 /* Convert (a != 0) || (b != 0) into (a | b) != 0. */
3733 integer_zero_node);
3735 /* Convert (a == 0) && (b == 0) into (a | b) == 0. */
3743 integer_zero_node);
3746 }
3748 /* See if the comparisons can be merged. Then get all the parameters for
3749 each side. */
3773 /* It must be true that the inner operation on the lhs of each
3774 comparison must be the same if we are to be able to do anything.
3775 Then see if we have constants. If not, the same must be true for
3776 the rhs's. */
3787 else
3790 /* If either comparison code is not correct for our logical operation,
3791 fail. However, we can convert a one-bit comparison against zero into
3792 the opposite comparison against that bit being set in the field. */
3796 {
3798 {
3799 /* Make the left operand unsigned, since we are only interested
3800 in the value of one bit. Otherwise we are doing the wrong
3801 thing below. */
3804 }
3805 else
3807 }
3809 /* This is analogous to the code for l_const above. */
3811 {
3813 {
3816 }
3817 else
3819 }
3821 /* After this point all optimizations will generate bit-field
3822 references, which we might not want. */
3826 /* See if we can find a mode that contains both fields being compared on
3827 the left. If we can't, fail. Otherwise, update all constants and masks
3828 to be relative to a field of that size. */
3833 volatilep);
3843 {
3846 }
3854 {
3862 {
3866 wanted_code == NE_EXPR
3868 }
3869 }
3871 {
3879 {
3883 wanted_code == NE_EXPR
3885 }
3886 }
3888 /* If the right sides are not constant, do the same for it. Also,
3889 disallow this optimization if a size or signedness mismatch occurs
3890 between the left and right sides. */
3892 {
3895 /* Make sure the two fields on the right
3896 correspond to the left without being swapped. */
3904 volatilep);
3914 {
3917 }
3924 /* Make a mask that corresponds to both fields being compared.
3925 Do this for both items being compared. If the operands are the
3926 same size and the bits being compared are in the same position
3927 then we can do this by masking both and comparing the masked
3928 results. */
3932 {
3944 }
3946 /* There is still another way we can do something: If both pairs of
3947 fields being compared are adjacent, we may be able to make a wider
3948 field containing them both.
3950 Note that we still must mask the lhs/rhs expressions. Furthermore,
3951 the mask must be shifted to account for the shift done by
3952 make_bit_field_ref. */
3957 {
3958 tree type;
3970 /* Convert to the smaller type before masking out unwanted bits. */
3973 {
3975 {
3979 }
3981 {
3985 }
3986 }
3995 }
3998 }
4000 /* Handle the case of comparisons with constants. If there is something in
4001 common between the masks, those bits of the constants must be the same.
4002 If not, the condition is always false. Test for this to avoid generating
4003 incorrect code below. */
4008 {
4010 {
4013 }
4014 else
4015 {
4018 }
4019 }
4021 /* Construct the expression we will return. First get the component
4022 reference we will make. Unless the mask is all ones the width of
4023 that field, perform the mask operation. Then compare with the
4024 merged constant. */
4034 }
4035 \f
4036 /* Optimize T, which is a comparison of a MIN_EXPR or MAX_EXPR with a
4037 constant. */
4039 static tree
4041 tree t;
4042 {
4047 tree minmax_const;
4049 tree inner;
4059 /* If something does not permit us to optimize, return the original tree. */
4067 /* Now handle all the various comparison codes. We only handle EQ_EXPR
4068 and GT_EXPR, doing the rest with recursive calls using logical
4069 simplifications. */
4071 {
4073 return
4077 return
4079 optimize_minmax_comparison
4081 optimize_minmax_comparison
4086 /* MAX (X, 0) == 0 -> X <= 0 */
4090 /* MAX (X, 0) == 5 -> X == 5 */
4094 /* MAX (X, 0) == -1 -> false */
4098 /* MIN (X, 0) == 0 -> X >= 0 */
4102 /* MIN (X, 0) == 5 -> false */
4105 else
4106 /* MIN (X, 0) == -1 -> X == -1 */
4111 /* MAX (X, 0) > 0 -> X > 0
4112 MAX (X, 0) > 5 -> X > 5 */
4116 /* MAX (X, 0) > -1 -> true */
4120 /* MIN (X, 0) > 0 -> false
4121 MIN (X, 0) > 5 -> false */
4124 else
4125 /* MIN (X, 0) > -1 -> X > -1 */
4130 }
4131 }
4132 \f
4133 /* T is an integer expression that is being multiplied, divided, or taken a
4134 modulus (CODE says which and what kind of divide or modulus) by a
4135 constant C. See if we can eliminate that operation by folding it with
4136 other operations already in T. WIDE_TYPE, if non-null, is a type that
4137 should be used for the computation if wider than our type.
4139 For example, if we are dividing (X * 8) + (Y * 16) by 4, we can return
4140 (X * 2) + (Y * 4). We must, however, be assured that either the original
4141 expression would not overflow or that overflow is undefined for the type
4142 in the language in question.
4144 We also canonicalize (X + 7) * 4 into X * 4 + 28 in the hope that either
4145 the machine has a multiply-accumulate insn or that this is part of an
4146 addressing calculation.
4148 If we return a non-null expression, it is an equivalent form of the
4149 original computation, but need not be in the original type. */
4151 static tree
4153 tree t;
4154 tree c;
4156 tree wide_type;
4157 {
4158 /* To avoid exponential search depth, refuse to allow recursion past
4159 three levels. Beyond that (1) it's highly unlikely that we'll find
4160 something interesting and (2) we've probably processed it before
4161 when we built the inner expression. */
4164 tree ret;
4169 depth++;
4171 depth--;
4174 }
4176 static tree
4178 tree t;
4179 tree c;
4181 tree wide_type;
4182 {
4192 /* Don't deal with constants of zero here; they confuse the code below. */
4202 /* Note that we need not handle conditional operations here since fold
4203 already handles those cases. So just do arithmetic here. */
4205 {
4207 /* For a constant, we can always simplify if we are a multiply
4208 or (for divide and modulus) if it is a multiple of our constant. */
4215 /* If op0 is an expression ... */
4220 /* ... and is unsigned, and its type is smaller than ctype,
4221 then we cannot pass through as widening. */
4227 /* ... or its type is larger than ctype,
4228 then we cannot pass through this truncation. */
4231 /* ... or signedness changes for division or modulus,
4232 then we cannot pass through this conversion. */
4238 /* Pass the constant down and see if we can make a simplification. If
4239 we can, replace this expression with the inner simplification for
4240 possible later conversion to our or some other type. */
4245 code == MULT_EXPR
4256 /* If widening the type changes the signedness, then we can't perform
4257 this optimization as that changes the result. */
4261 /* MIN (a, b) / 5 -> MIN (a / 5, b / 5) */
4264 {
4270 }
4280 /* If this has not been evaluated and the operand has no side effects,
4281 we can see if we can do something inside it and make a new one.
4282 Note that this test is overly conservative since we can do this
4283 if the only reason it had side effects is that it was another
4284 similar SAVE_EXPR, but that isn't worth bothering with. */
4287 wide_type)))
4288 {
4295 }
4299 /* If the second operand is constant, this is a multiplication
4300 or floor division, by a power of two, so we can treat it that
4301 way unless the multiplier or divisor overflows. */
4303 /* const_binop may not detect overflow correctly,
4304 so check for it explicitly here. */
4318 /* See if we can eliminate the operation on both sides. If we can, we
4319 can return a new PLUS or MINUS. If we can't, the only remaining
4320 cases where we can do anything are if the second operand is a
4321 constant. */
4326 /* If not multiplication, we can only do this if both operands
4327 are divisible by c. */
4333 /* If this was a subtraction, negate OP1 and set it to be an addition.
4334 This simplifies the logic below. */
4341 /* If either OP1 or C are negative, this optimization is not safe for
4342 some of the division and remainder types while for others we need
4343 to change the code. */
4345 {
4353 }
4355 /* If it's a multiply or a division/modulus operation of a multiple
4356 of our constant, do the operation and verify it doesn't overflow. */
4359 {
4363 }
4364 else
4367 /* If we have an unsigned type is not a sizetype, we cannot widen
4368 the operation since it will change the result if the original
4369 computation overflowed. */
4375 /* If we were able to eliminate our operation from the first side,
4376 apply our operation to the second side and reform the PLUS. */
4380 /* The last case is if we are a multiply. In that case, we can
4381 apply the distributive law to commute the multiply and addition
4382 if the multiplication of the constants doesn't overflow. */
4387 op1));
4392 /* We have a special case here if we are doing something like
4393 (C * 8) % 4 since we know that's zero. */
4400 /* ... fall through ... */
4404 /* If we can extract our operation from the LHS, do so and return a
4405 new operation. Likewise for the RHS from a MULT_EXPR. Otherwise,
4406 do something only if the second operand is a constant. */
4418 /* If these are the same operation types, we can associate them
4419 assuming no overflow. */
4426 /* If these operations "cancel" each other, we have the main
4427 optimizations of this pass, which occur when either constant is a
4428 multiple of the other, in which case we replace this with either an
4429 operation or CODE or TCODE.
4431 If we have an unsigned type that is not a sizetype, we cannot do
4432 this since it will change the result if the original computation
4433 overflowed. */
4436 && ! flag_wrapv
4441 {
4452 }
4457 }
4460 }
4461 \f
4462 /* If T contains a COMPOUND_EXPR which was inserted merely to evaluate
4463 S, a SAVE_EXPR, return the expression actually being evaluated. Note
4464 that we may sometimes modify the tree. */
4466 static tree
4468 tree t;
4469 tree s;
4470 {
4473 /* See if this is the COMPOUND_EXPR we want to eliminate. */
4478 /* See if this is a COND_EXPR or a simple arithmetic operator. We
4479 don't bother handling any other types. */
4481 {
4485 }
4490 {
4493 }
4496 }
4497 \f
4498 /* Return a node which has the indicated constant VALUE (either 0 or
4499 1), and is of the indicated TYPE. */
4501 static tree
4504 tree type;
4505 {
4510 integer_zero_node);
4511 else
4512 {
4517 }
4518 }
4520 /* Utility function for the following routine, to see how complex a nesting of
4521 COND_EXPRs can be. EXPR is the expression and LIMIT is a count beyond which
4522 we don't care (to avoid spending too much time on complex expressions.). */
4524 static int
4526 tree expr;
4528 {
4539 }
4541 /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'.
4542 Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here
4543 CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)'
4544 expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the
4545 COND is the first argument to CODE; otherwise (as in the example
4546 given here), it is the second argument. TYPE is the type of the
4547 original expression. */
4549 static tree
4552 tree type;
4553 tree cond;
4554 tree arg;
4556 {
4560 /* In the end, we'll produce a COND_EXPR. Both arms of the
4561 conditional expression will be binary operations. The left-hand
4562 side of the expression to be executed if the condition is true
4563 will be pointed to by TRUE_LHS. Similarly, the right-hand side
4564 of the expression to be executed if the condition is true will be
4565 pointed to by TRUE_RHS. FALSE_LHS and FALSE_RHS are analogous --
4566 but apply to the expression to be executed if the conditional is
4567 false. */
4572 /* These are the codes to use for the left-hand side and right-hand
4573 side of the COND_EXPR. Normally, they are the same as CODE. */
4576 /* And these are the types of the expressions. */
4582 {
4586 }
4587 else
4588 {
4592 }
4595 {
4599 /* If this operand throws an expression, then it does not make
4600 sense to try to perform a logical or arithmetic operation
4601 involving it. Instead of building `a + throw 3' for example,
4602 we simply build `a, throw 3'. */
4604 {
4606 {
4609 }
4610 else
4612 }
4614 {
4616 {
4619 }
4620 else
4622 }
4623 }
4624 else
4625 {
4630 }
4632 /* If ARG is complex we want to make sure we only evaluate it once. Though
4633 this is only required if it is volatile, it might be more efficient even
4634 if it is not. However, if we succeed in folding one part to a constant,
4635 we do not need to make this SAVE_EXPR. Since we do this optimization
4636 primarily to see if we do end up with constant and this SAVE_EXPR
4637 interferes with later optimizations, suppressing it when we can is
4638 important.
4640 If we are not in a function, we can't make a SAVE_EXPR, so don't try to
4641 do so. Don't try to see if the result is a constant if an arm is a
4642 COND_EXPR since we get exponential behavior in that case. */
4651 {
4660 {
4664 }
4665 }
4678 else
4680 }
4682 \f
4683 /* Subroutine of fold() that checks for the addition of +/- 0.0.
4685 If !NEGATE, return true if ADDEND is +/-0.0 and, for all X of type
4686 TYPE, X + ADDEND is the same as X. If NEGATE, return true if X -
4687 ADDEND is the same as X.
4689 X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero
4690 and finite. The problematic cases are when X is zero, and its mode
4691 has signed zeros. In the case of rounding towards -infinity,
4692 X - 0 is not the same as X because 0 - 0 is -0. In other rounding
4693 modes, X + 0 is not the same as X because -0 + 0 is 0. */
4695 static bool
4699 {
4703 /* Don't allow the fold with -fsignaling-nans. */
4707 /* Allow the fold if zeros aren't signed, or their sign isn't important. */
4711 /* Treat x + -0 as x - 0 and x - -0 as x + 0. */
4716 /* The mode has signed zeros, and we have to honor their sign.
4717 In this situation, there is only one case we can return true for.
4718 X - 0 is the same as X unless rounding towards -infinity is
4719 supported. */
4721 }
4723 /* Subroutine of fold() that checks comparisons of built-in math
4724 functions against real constants.
4726 FCODE is the DECL_FUNCTION_CODE of the built-in, CODE is the comparison
4727 operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR, GE_EXPR or LE_EXPR. TYPE
4728 is the type of the result and ARG0 and ARG1 are the operands of the
4729 comparison. ARG1 must be a TREE_REAL_CST.
4731 The function returns the constant folded tree if a simplification
4732 can be made, and NULL_TREE otherwise. */
4734 static tree
4739 {
4740 REAL_VALUE_TYPE c;
4745 {
4751 {
4752 /* sqrt(x) < y is always false, if y is negative. */
4756 arg);
4758 /* sqrt(x) > y is always true, if y is negative and we
4759 don't care about NaNs, i.e. negative values of x. */
4763 arg);
4765 /* sqrt(x) > y is the same as x >= 0, if y is negative. */
4768 }
4770 {
4771 REAL_VALUE_TYPE c2;
4777 {
4778 /* sqrt(x) > y is x == +Inf, when y is very large. */
4783 /* sqrt(x) > y is always false, when y is very large
4784 and we don't care about infinities. */
4787 arg);
4788 }
4790 /* sqrt(x) > c is the same as x > c*c. */
4793 }
4795 {
4796 REAL_VALUE_TYPE c2;
4802 {
4803 /* sqrt(x) < y is always true, when y is a very large
4804 value and we don't care about NaNs or Infinities. */
4808 arg);
4810 /* sqrt(x) < y is x != +Inf when y is very large and we
4811 don't care about NaNs. */
4816 /* sqrt(x) < y is x >= 0 when y is very large and we
4817 don't care about Infinities. */
4822 /* sqrt(x) < y is x >= 0 && x != +Inf, when y is large. */
4831 dconst0))),
4834 c2)))));
4835 }
4837 /* sqrt(x) < c is the same as x < c*c, if we ignore NaNs. */
4842 /* sqrt(x) < c is the same as x >= 0 && x < c*c. */
4845 {
4850 dconst0))),
4853 c2)))));
4854 }
4855 }
4856 }
4859 }
4861 /* Subroutine of fold() that optimizes comparisons against Infinities,
4862 either +Inf or -Inf.
4864 CODE is the comparison operator: EQ_EXPR, NE_EXPR, GT_EXPR, LT_EXPR,
4865 GE_EXPR or LE_EXPR. TYPE is the type of the result and ARG0 and ARG1
4866 are the operands of the comparison. ARG1 must be a TREE_REAL_CST.
4868 The function returns the constant folded tree if a simplification
4869 can be made, and NULL_TREE otherwise. */
4871 static tree
4875 {
4877 REAL_VALUE_TYPE max;
4878 tree temp;
4883 /* For negative infinity swap the sense of the comparison. */
4889 {
4891 /* x > +Inf is always false, if with ignore sNANs. */
4896 arg0);
4899 /* x <= +Inf is always true, if we don't case about NaNs. */
4903 arg0);
4905 /* x <= +Inf is the same as x == x, i.e. isfinite(x). */
4908 {
4911 }
4916 /* x == +Inf and x >= +Inf are always equal to x > DBL_MAX. */
4922 /* x < +Inf is always equal to x <= DBL_MAX. */
4928 /* x != +Inf is always equal to !(x > DBL_MAX). */
4939 }
4942 }
4944 /* Perform constant folding and related simplification of EXPR.
4945 The related simplifications include x*1 => x, x*0 => 0, etc.,
4946 and application of the associative law.
4947 NOP_EXPR conversions may be removed freely (as long as we
4948 are careful not to change the C type of the overall expression)
4949 We cannot simplify through a CONVERT_EXPR, FIX_EXPR or FLOAT_EXPR,
4950 but we can constant-fold them if they have constant operands. */
4952 tree
4954 tree expr;
4955 {
4958 tree tem;
4964 /* WINS will be nonzero when the switch is done
4965 if all operands are constant. */
4968 /* Don't try to process an RTL_EXPR since its operands aren't trees.
4969 Likewise for a SAVE_EXPR that's already been evaluated. */
4973 /* Return right away if a constant. */
4977 #ifdef MAX_INTEGER_COMPUTATION_MODE
4979 #endif
4982 {
4983 tree subop;
4985 /* Special case for conversion ops that can have fixed point args. */
4988 /* Don't use STRIP_NOPS, because signedness of argument type matters. */
4994 else
4999 )
5000 /* Note that TREE_CONSTANT isn't enough:
5001 static var addresses are constant but we can't
5002 do arithmetic on them. */
5004 }
5006 {
5010 {
5012 tree subop;
5018 {
5019 /* Signedness matters here. Perhaps we can refine this
5020 later. */
5022 }
5023 else
5024 /* Strip any conversions that don't change the mode. */
5029 else
5034 /* Note that TREE_CONSTANT isn't enough:
5035 static var addresses are constant but we can't
5036 do arithmetic on them. */
5043 }
5044 }
5046 /* If this is a commutative operation, and ARG0 is a constant, move it
5047 to ARG1 to reduce the number of tests below. */
5052 {
5057 }
5059 /* Now WINS is set as described above,
5060 ARG0 is the first operand of EXPR,
5061 and ARG1 is the second operand (if it has more than one operand).
5063 First check for cases where an arithmetic operation is applied to a
5064 compound, conditional, or comparison operation. Push the arithmetic
5065 operation inside the compound or conditional to see if any folding
5066 can then be done. Convert comparison to conditional for this purpose.
5067 The also optimizes non-constant cases that used to be done in
5068 expand_expr.
5070 Before we do that, see if this is a BIT_AND_EXPR or a BIT_IOR_EXPR,
5071 one of the operands is a comparison and the other is a comparison, a
5072 BIT_AND_EXPR with the constant 1, or a truth value. In that case, the
5073 code below would make the expression more complex. Change it to a
5074 TRUTH_{AND,OR}_EXPR. Likewise, convert a similar NE_EXPR to
5075 TRUTH_XOR_EXPR and an EQ_EXPR to the inversion of a TRUTH_XOR_EXPR. */
5087 {
5097 }
5100 {
5105 {
5115 /* If this was a conversion, and all we did was to move into
5116 inside the COND_EXPR, bring it back out. But leave it if
5117 it is a conversion from integer to integer and the
5118 result precision is no wider than a word since such a
5119 conversion is cheap and may be optimized away by combine,
5120 while it couldn't if it were outside the COND_EXPR. Then return
5121 so we don't get into an infinite recursion loop taking the
5122 conversion out and then back in. */
5134 && (INTEGRAL_TYPE_P
5145 }
5150 }
5161 {
5176 return
5190 return
5193 }
5196 {
5212 /* Other kinds of FIX are not handled properly by fold_convert. */
5217 /* Handle cases of two conversions in a row. */
5220 {
5240 /* In addition to the cases of two conversions in a row
5241 handled below, if we are converting something to its own
5242 type via an object of identical or wider precision, neither
5243 conversion is needed. */
5249 /* Likewise, if the intermediate and final types are either both
5250 float or both integer, we don't need the middle conversion if
5251 it is wider than the final type and doesn't change the signedness
5252 (for integers). Avoid this if the final type is a pointer
5253 since then we sometimes need the inner conversion. Likewise if
5254 the outer has a precision not equal to the size of its mode. */
5264 /* If we have a sign-extension of a zero-extended value, we can
5265 replace that by a single zero-extension. */
5271 /* Two conversions in a row are not needed unless:
5272 - some conversion is floating-point (overstrict for now), or
5273 - the intermediate type is narrower than both initial and
5274 final, or
5275 - the intermediate type and innermost type differ in signedness,
5276 and the outermost type is wider than the intermediate, or
5277 - the initial type is a pointer type and the precisions of the
5278 intermediate and final types differ, or
5279 - the final type is a pointer type and the precisions of the
5280 initial and intermediate types differ. */
5294 }
5298 /* Detect assigning a bitfield. */
5301 {
5302 /* Don't leave an assignment inside a conversion
5303 unless assigning a bitfield. */
5306 /* First do the assignment, then return converted constant. */
5310 }
5312 /* Convert (T)(x & c) into (T)x & (T)c, if c is an integer
5313 constants (if x has signed type, the sign bit cannot be set
5314 in c). This folds extension into the BIT_AND_EXPR. */
5319 {
5329 <= HOST_BITS_PER_WIDE_INT
5331 {
5338 #ifdef LOAD_EXTEND_OP
5342 {
5346 }
5347 #endif
5348 }
5353 }
5356 {
5359 }
5371 {
5375 }
5384 {
5386 {
5388 HOST_WIDE_INT high;
5399 }
5402 }
5405 /* Convert -((double)float) into (double)(-float). */
5408 {
5413 }
5415 /* Convert - (a - b) to (b - a) for non-floating-point. */
5421 /* Convert -f(x) into f(-x) where f is sin, tan or atan. */
5423 {
5434 {
5442 }
5447 }
5452 {
5454 {
5455 /* If the value is unsigned, then the absolute value is
5456 the same as the ordinary value. */
5459 /* Similarly, if the value is non-negative. */
5462 /* If the value is negative, then the absolute value is
5463 its negation. */
5464 else
5465 {
5467 HOST_WIDE_INT high;
5478 }
5479 }
5481 {
5485 }
5486 }
5489 /* Convert fabs((double)float) into (double)fabsf(float). */
5492 {
5496 targ0)));
5497 }
5524 {
5531 }
5537 /* A + (-B) -> A - B */
5540 /* (-A) + B -> B - A */
5544 {
5548 /* If we are adding two BIT_AND_EXPR's, both of which are and'ing
5549 with a constant, and the two constants have no bits in common,
5550 we should treat this as a BIT_IOR_EXPR since this may produce more
5551 simplifications. */
5559 {
5562 }
5564 /* Reassociate (plus (plus (mult) (foo)) (mult)) as
5565 (plus (plus (mult) (mult)) (foo)) so that we can
5566 take advantage of the factoring cases below. */
5571 {
5576 else
5597 }
5600 {
5604 /* (A * C) + (B * C) -> (A+B) * C.
5605 We are most concerned about the case where C is a constant,
5606 but other combinations show up during loop reduction. Since
5607 it is not difficult, try all four possibilities. */
5624 /* No identical multiplicands; see if we can find a common
5625 power-of-two factor in non-power-of-two multiplies. This
5626 can help in multi-dimensional array access. */
5631 {
5636 /* Move min of absolute values to int11. */
5639 {
5643 }
5646 {
5651 }
5652 }
5657 same));
5658 }
5659 }
5661 /* See if ARG1 is zero and X + ARG1 reduces to X. */
5665 /* Likewise if the operands are reversed. */
5669 bit_rotate:
5670 /* (A << C1) + (A >> C2) if A is unsigned and C1+C2 is the size of A
5671 is a rotate of A by C1 bits. */
5672 /* (A << B) + (A >> (Z - B)) if A is unsigned and Z is the size of A
5673 is a rotate of A by B bits. */
5674 {
5683 {
5702 {
5710 TYPE_PRECISION
5715 ? LROTATE_EXPR
5718 }
5720 {
5728 TYPE_PRECISION
5733 ? LROTATE_EXPR
5736 }
5737 }
5738 }
5740 associate:
5741 /* In most languages, can't associate operations on floats through
5742 parentheses. Rather than remember where the parentheses were, we
5743 don't associate floats at all. It shouldn't matter much. However,
5744 associating multiplications is only very slightly inaccurate, so do
5745 that if -funsafe-math-optimizations is specified. */
5750 {
5754 /* Split both trees into variables, constants, and literals. Then
5755 associate each group together, the constants with literals,
5756 then the result with variables. This increases the chances of
5757 literals being recombined later and of generating relocatable
5758 expressions for the sum of a constant and literal. */
5763 /* Only do something if we found more than two objects. Otherwise,
5764 nothing has changed and we risk infinite recursion. */
5769 {
5770 /* Recombine MINUS_EXPR operands by using PLUS_EXPR. */
5779 /* Preserve the MINUS_EXPR if the negative part of the literal is
5780 greater than the positive part. Otherwise, the multiplicative
5781 folding code (i.e extract_muldiv) may be fooled in case
5782 unsigned constants are substracted, like in the following
5783 example: ((X*2 + 4) - 8U)/2. */
5785 {
5787 {
5791 }
5792 else
5793 {
5797 }
5798 }
5800 {
5804 else
5805 {
5810 }
5811 }
5815 }
5816 }
5818 binary:
5822 {
5823 /* The return value should always have
5824 the same type as the original expression. */
5829 }
5833 /* A - (-B) -> A + B */
5836 /* (-A) - B -> (-B) - A where B is easily negated and we can swap. */
5847 {
5853 /* (A * C) - (B * C) -> (A-B) * C. Since we are most concerned
5854 about the case where C is a constant, just try one of the
5855 four possibilities. */
5866 /* Fold A - (A & B) into ~B & A. */
5869 {
5874 arg0));
5879 arg0));
5880 }
5881 }
5883 /* See if ARG1 is zero and X - ARG1 reduces to X. */
5887 /* (ARG0 - ARG1) is the same as (-ARG1 + ARG0). So check whether
5888 ARG0 is zero and X + ARG0 reduces to X, since that would mean
5889 (-ARG1 + ARG0) reduces to -ARG1. */
5893 /* Fold &x - &x. This can happen from &x.foo - &x.
5894 This is unsafe for certain floats even in non-IEEE formats.
5895 In IEEE, it is unsafe because it does wrong for NaNs.
5896 Also note that operand_equal_p is always false if an operand
5897 is volatile. */
5906 /* (-A) * (-B) -> A * B */
5912 {
5918 /* (a * (1 << b)) is (a << b) */
5934 }
5935 else
5936 {
5937 /* Maybe fold x * 0 to 0. The expressions aren't the same
5938 when x is NaN, since x * 0 is also NaN. Nor are they the
5939 same in modes with signed zeros, since multiplying a
5940 negative value by 0 gives -0, not +0. */
5945 /* In IEEE floating point, x*1 is not equivalent to x for snans. */
5950 /* Transform x * -1.0 into -x. */
5955 /* x*2 is x+x */
5959 {
5962 }
5965 {
5969 /* Optimizations of sqrt(...)*sqrt(...). */
5973 {
5978 /* Optimize sqrt(x)*sqrt(x) as x. */
5983 /* Optimize sqrt(x)*sqrt(y) as sqrt(x*y). */
5988 }
5990 /* Optimize exp(x)*exp(y) as exp(x+y). */
5994 {
6001 }
6003 /* Optimizations of pow(...)*pow(...). */
6007 {
6015 /* Optimize pow(x,y)*pow(z,y) as pow(x*z,y). */
6017 {
6022 arg01));
6024 }
6026 /* Optimize pow(x,y)*pow(x,z) as pow(x,y+z). */
6028 {
6033 arg));
6035 }
6036 }
6038 /* Optimize tan(x)*cos(x) as sin(x). */
6047 {
6048 tree sinfn;
6051 {
6066 }
6071 }
6072 }
6073 }
6077 bit_ior:
6086 /* Convert (or (not arg0) (not arg1)) to (not (and (arg0) (arg1))).
6088 This results in more efficient code for machines without a NAND
6089 instruction. Combine will canonicalize to the first form
6090 which will allow use of NAND instructions provided by the
6091 backend if they exist. */
6094 {
6099 }
6101 /* See if this can be simplified into a rotate first. If that
6102 is unsuccessful continue in the association code. */
6111 /* If we are XORing two BIT_AND_EXPR's, both of which are and'ing
6112 with a constant, and the two constants have no bits in common,
6113 we should treat this as a BIT_IOR_EXPR since this may produce more
6114 simplifications. */
6122 {
6125 }
6127 /* See if this can be simplified into a rotate first. If that
6128 is unsuccessful continue in the association code. */
6132 bit_and:
6140 /* Simplify ((int)c & 0377) into (int)c, if c is unsigned char. */
6143 {
6144 unsigned int prec
6151 }
6153 /* Convert (and (not arg0) (not arg1)) to (not (or (arg0) (arg1))).
6155 This results in more efficient code for machines without a NOR
6156 instruction. Combine will canonicalize to the first form
6157 which will allow use of NOR instructions provided by the
6158 backend if they exist. */
6161 {
6166 }
6176 {
6180 }
6184 /* Don't touch a floating-point divide by zero unless the mode
6185 of the constant can represent infinity. */
6191 /* (-A) / (-B) -> A / B */
6196 /* In IEEE floating point, x/1 is not equivalent to x for snans. */
6201 /* If ARG1 is a constant, we can convert this to a multiply by the
6202 reciprocal. This does not have the same rounding properties,
6203 so only do this if -funsafe-math-optimizations. We can actually
6204 always safely do it if ARG1 is a power of two, but it's hard to
6205 tell if it is or not in a portable manner. */
6207 {
6212 /* Find the reciprocal if optimizing and the result is exact. */
6214 {
6215 REAL_VALUE_TYPE r;
6218 {
6221 }
6222 }
6223 }
6224 /* Convert A/B/C to A/(B*C). */
6227 {
6230 arg1)));
6231 }
6232 /* Convert A/(B/C) to (A/B)*C. */
6235 {
6240 }
6243 {
6245 /* Optimize x/exp(y) into x*exp(-y). */
6249 {
6256 }
6258 /* Optimize x/pow(y,z) into x*pow(y,-z). */
6262 {
6271 }
6272 }
6275 {
6279 /* Optimize sin(x)/cos(x) as tan(x). */
6285 {
6286 tree tanfn;
6294 else
6300 }
6302 /* Optimize cos(x)/sin(x) as 1.0/tan(x). */
6308 {
6309 tree tanfn;
6317 else
6321 {
6326 tmp));
6327 }
6328 }
6329 }
6342 /* If arg0 is a multiple of arg1, then rewrite to the fastest div
6343 operation, EXACT_DIV_EXPR.
6345 Note that only CEIL_DIV_EXPR and FLOOR_DIV_EXPR are rewritten now.
6346 At one time others generated faster code, it's not clear if they do
6347 after the last round to changes to the DIV code in expmed.c. */
6382 /* Optimize -1 >> x for arithmetic right shifts. */
6385 /* ... fall through ... */
6388 shift:
6394 /* Since negative shift count is not well-defined,
6395 don't try to compute it in the compiler. */
6398 /* Rewrite an LROTATE_EXPR by a constant into an
6399 RROTATE_EXPR by a new constant. */
6401 {
6405 = const_binop
6412 }
6414 /* If we have a rotate of a bit operation with the rotate count and
6415 the second operand of the bit operation both constant,
6416 permute the two operations. */
6429 /* Two consecutive rotates adding up to the width of the mode can
6430 be ignored. */
6461 /* Note that the operand of this must be an int
6462 and its values must be 0 or 1.
6463 ("true" is a fixed value perhaps depending on the language,
6464 but we don't handle values other than 1 correctly yet.) */
6466 /* Avoid infinite recursion. */
6472 /* Note that the operands of this must be ints
6473 and their values must be 0 or 1.
6474 ("true" is a fixed value perhaps depending on the language.) */
6475 /* If first arg is constant zero, return it. */
6479 /* If either arg is constant true, drop it. */
6483 /* Preserve sequence points. */
6486 /* If second arg is constant zero, result is zero, but first arg
6487 must be evaluated. */
6490 /* Likewise for first arg, but note that only the TRUTH_AND_EXPR
6491 case will be handled here. */
6495 truth_andor:
6496 /* We only do these simplifications if we are optimizing. */
6500 /* Check for things like (A || B) && (A || C). We can convert this
6501 to A || (B && C). Note that either operator can be any of the four
6502 truth and/or operations and the transformation will still be
6503 valid. Also note that we only care about order for the
6504 ANDIF and ORIF operators. If B contains side effects, this
6505 might change the truth-value of A. */
6512 {
6532 /* This case if tricky because we must either have commutative
6533 operators or else A10 must not have side-effects. */
6539 a01));
6540 }
6542 /* See if we can build a range comparison. */
6546 /* Check for the possibility of merging component references. If our
6547 lhs is another similar operation, try to merge its rhs with our
6548 rhs. Then try to merge our lhs and rhs. */
6560 /* Note that the operands of this must be ints
6561 and their values must be 0 or true.
6562 ("true" is a fixed value perhaps depending on the language.) */
6563 /* If first arg is constant true, return it. */
6567 /* If either arg is constant zero, drop it. */
6571 /* Preserve sequence points. */
6574 /* If second arg is constant true, result is true, but we must
6575 evaluate first arg. */
6578 /* Likewise for first arg, but note this only occurs here for
6579 TRUTH_OR_EXPR. */
6585 /* If either arg is constant zero, drop it. */
6590 /* If either arg is constant true, this is a logical inversion. */
6603 /* If one arg is a real or integer constant, put it last. */
6608 {
6615 }
6618 {
6626 /* Fold (double)float1 CMP (double)float2 into float1 CMP float2. */
6631 /* (-a) CMP (-b) -> b CMP a */
6638 {
6639 REAL_VALUE_TYPE cst;
6642 /* (-a) CMP CST -> a swap(CMP) (-CST) */
6644 return
6650 /* IEEE doesn't distinguish +0 and -0 in comparisons. */
6651 /* a CMP (-0) -> a CMP 0 */
6656 /* x != NaN is always true, other ops are always false. */
6659 {
6662 }
6664 /* Fold comparisons against infinity. */
6666 {
6670 }
6671 }
6673 /* If this is a comparison of a real constant with a PLUS_EXPR
6674 or a MINUS_EXPR of a real constant, we can convert it into a
6675 comparison with a revised real constant as long as no overflow
6676 occurs when unsafe_math_optimizations are enabled. */
6688 /* Likewise, we can simplify a comparison of a real constant with
6689 a MINUS_EXPR whose first operand is also a real constant, i.e.
6690 (c1 - x) < c2 becomes x > c1-c2. */
6701 /* Fold comparisons against built-in math functions. */
6703 && flag_unsafe_math_optimizations
6705 {
6709 {
6713 }
6714 }
6715 }
6717 /* Convert foo++ == CONST into ++foo == CONST + INCR.
6718 First, see if one arg is constant; find the constant arg
6719 and the other one. */
6720 {
6730 {
6731 /* This optimization is invalid for ordered comparisons
6732 if CONST+INCR overflows or if foo+incr might overflow.
6733 This optimization is invalid for floating point due to rounding.
6734 For pointer types we assume overflow doesn't happen. */
6738 {
6739 tree newconst
6743 /* Do not overwrite the current varop to be a preincrement,
6744 create a new node so that we won't confuse our caller who
6745 might create trees and throw them away, reusing the
6746 arguments that they passed to build. This shows up in
6747 the THEN or ELSE parts of ?: being postincrements. */
6752 /* If VAROP is a reference to a bitfield, we must mask
6753 the constant by the width of the field. */
6757 {
6758 int size
6760 (TREE_OPERAND
6764 tree folded_compare;
6766 /* First check whether the comparison would come out
6767 always the same. If we don't do that we would
6768 change the meaning with the masking. */
6772 else
6775 constop));
6790 mask)));
6791 }
6797 }
6798 }
6800 {
6804 {
6805 tree newconst
6809 /* Do not overwrite the current varop to be a predecrement,
6810 create a new node so that we won't confuse our caller who
6811 might create trees and throw them away, reusing the
6812 arguments that they passed to build. This shows up in
6813 the THEN or ELSE parts of ?: being postdecrements. */
6821 {
6822 int size
6824 (TREE_OPERAND
6828 tree folded_compare;
6833 else
6836 constop));
6851 mask)));
6852 }
6858 }
6859 }
6860 }
6862 /* Change X >= C to X > (C - 1) and X < C to X <= (C - 1) if C > 0.
6863 This transformation affects the cases which are handled in later
6864 optimizations involving comparisons with non-negative constants. */
6868 {
6870 {
6885 }
6886 }
6888 /* Comparisons with the highest or lowest possible integer of
6889 the specified size will have known values. */
6890 {
6898 {
6905 {
6908 }
6909 else
6910 {
6913 }
6918 {
6922 arg0);
6930 arg0);
6936 /* The GE_EXPR and LT_EXPR cases above are not normally
6937 reached because of previous transformations. */
6941 }
6945 {
6958 }
6962 {
6966 arg0);
6975 arg0);
6983 }
6987 {
7000 }
7005 /* signed_type does not work on pointer types. */
7007 {
7008 /* The following case also applies to X < signed_max+1
7009 and X >= signed_max+1 because previous transformations. */
7011 {
7015 return fold
7019 }
7020 }
7021 }
7022 }
7024 /* If this is an EQ or NE comparison of a constant with a PLUS_EXPR or
7025 a MINUS_EXPR of a constant, we can convert it into a comparison with
7026 a revised constant as long as no overflow occurs. */
7038 /* Similarly for a NEGATE_EXPR. */
7047 /* If we have X - Y == 0, we can convert that to X == Y and similarly
7048 for !=. Don't do this for ordered comparisons due to overflow. */
7054 /* If we are widening one operand of an integer comparison,
7055 see if the other operand is similarly being widened. Perhaps we
7056 can do the comparison in the narrower type. */
7066 /* If this is comparing a constant with a MIN_EXPR or a MAX_EXPR of a
7067 constant, we can simplify it. */
7074 /* If we are comparing an ABS_EXPR with a constant, we can
7075 convert all the cases into explicit comparisons, but they may
7076 well not be faster than doing the ABS and one comparison.
7077 But ABS (X) <= C is a range comparison, which becomes a subtraction
7078 and a comparison, and is probably faster. */
7090 /* If this is an EQ or NE comparison with zero and ARG0 is
7091 (1 << foo) & bar, convert it to (bar >> foo) & 1. Both require
7092 two operations, but the latter can be done in one less insn
7093 on machines that have only two-operand insns or on which a
7094 constant cannot be the first operand. */
7097 {
7100 return
7108 integer_one_node)),
7109 arg1));
7112 return
7120 integer_one_node)),
7121 arg1));
7122 }
7124 /* If this is an NE or EQ comparison of zero against the result of a
7125 signed MOD operation whose second operand is a power of 2, make
7126 the MOD operation unsigned since it is simpler and equivalent. */
7135 {
7142 }
7144 /* If this is an NE comparison of zero with an AND of one, remove the
7145 comparison since the AND will give the correct value. */
7151 /* If we have (A & C) == C where C is a power of 2, convert this into
7152 (A & C) != 0. Similarly for NE_EXPR. */
7160 /* If we have (A & C) != 0 where C is the sign bit of A, convert
7161 this into A < 0. Similarly for (A & C) == 0 into A >= 0. */
7165 {
7169 {
7174 }
7175 }
7177 /* If X is unsigned, convert X < (1 << Y) into X >> Y == 0
7178 and similarly for >= into !=. */
7194 return
7201 /* Simplify comparison of something with itself. (For IEEE
7202 floating-point, we can only do some of these simplifications.) */
7204 {
7206 {
7218 /* For NE, we can only do this simplification if integer
7219 or we don't honor IEEE floating point NaNs. */
7223 /* ... fall through ... */
7229 }
7230 }
7232 /* If we are comparing an expression that just has comparisons
7233 of two integer values, arithmetic expressions of those comparisons,
7234 and constants, we can simplify it. There are only three cases
7235 to check: the two values can either be equal, the first can be
7236 greater, or the second can be greater. Fold the expression for
7237 those three values. Since each value must be 0 or 1, we have
7238 eight possibilities, each of which corresponds to the constant 0
7239 or 1 or one of the six possible comparisons.
7241 This handles common cases like (a > b) == 0 but also handles
7242 expressions like ((x > y) - (y > x)) > 0, which supposedly
7243 occur in macroized code. */
7246 {
7251 /* Don't handle degenerate cases here; they should already
7252 have been handled anyway. */
7261 {
7265 /* We can't just pass T to eval_subst in case cval1 or cval2
7266 was the same as ARG1. */
7268 tree high_result
7271 arg1));
7272 tree equal_result
7275 arg1));
7276 tree low_result
7279 arg1));
7281 /* All three of these results should be 0 or 1. Confirm they
7282 are. Then use those values to select the proper code
7283 to use. */
7291 {
7292 /* Make a 3-bit mask with the high-order bit being the
7293 value for `>', the next for '=', and the low for '<'. */
7297 {
7299 /* Always false. */
7320 /* Always true. */
7322 }
7327 else
7329 }
7330 }
7331 }
7333 /* If this is a comparison of a field, we may be able to simplify it. */
7338 /* Handle the constant case even without -O
7339 to make sure the warnings are given. */
7341 {
7344 }
7346 /* If this is a comparison of complex values and either or both sides
7347 are a COMPLEX_EXPR or COMPLEX_CST, it is best to split up the
7348 comparisons and join them with a TRUTH_ANDIF_EXPR or TRUTH_ORIF_EXPR.
7349 This may prevent needless evaluations. */
7356 {
7369 type,
7372 }
7374 /* Optimize comparisons of strlen vs zero to a compare of the
7375 first character of the string vs zero. To wit,
7376 strlen(ptr) == 0 => *ptr == 0
7377 strlen(ptr) != 0 => *ptr != 0
7378 Other cases should reduce to one of these two (or a constant)
7379 due to the return value of strlen being unsigned. */
7384 {
7386 tree arglist;
7398 integer_zero_node));
7399 }
7401 /* From here on, the only cases we handle are when the result is
7402 known to be a constant.
7404 To compute GT, swap the arguments and do LT.
7405 To compute GE, do LT and invert the result.
7406 To compute LE, swap the arguments, do LT and invert the result.
7407 To compute NE, do EQ and invert the result.
7409 Therefore, the code below must handle only EQ and LT. */
7412 {
7415 }
7417 /* Note that it is safe to invert for real values here because we
7418 will check below in the one case that it matters. */
7423 {
7426 }
7428 /* Compute a result for LT or EQ if args permit;
7429 otherwise return T. */
7431 {
7434 else
7439 }
7442 /* Assume a nonexplicit constant cannot equal an explicit one,
7443 since such code would be undefined anyway.
7444 Exception: on sysvr4, using #pragma weak,
7445 a label can come out as 0. */
7452 #endif
7453 /* Two real constants can be compared explicitly. */
7455 {
7456 /* If either operand is a NaN, the result is false with two
7457 exceptions: First, an NE_EXPR is true on NaNs, but that case
7458 is already handled correctly since we will be inverting the
7459 result for NE_EXPR. Second, if we had inverted a LE_EXPR
7460 or a GE_EXPR into a LT_EXPR, we must return true so that it
7461 will be inverted into false. */
7471 else
7475 }
7489 /* Pedantic ANSI C says that a conditional expression is never an lvalue,
7490 so all simple results must be passed through pedantic_non_lvalue. */
7492 return pedantic_non_lvalue
7497 /* If the second operand is zero, invert the comparison and swap
7498 the second and third operands. Likewise if the second operand
7499 is constant and the third is not or if the third operand is
7500 equivalent to the first operand of the comparison. */
7508 {
7509 /* See if this can be inverted. If it can't, possibly because
7510 it was a floating-point inequality comparison, don't do
7511 anything. */
7515 {
7519 /* arg1 should be the first argument of the new T. */
7522 }
7523 }
7525 /* If we have A op B ? A : C, we may be able to convert this to a
7526 simpler expression, depending on the operation and the values
7527 of B and C. Signed zeros prevent all of these transformations,
7528 for reasons given above each one. */
7534 {
7540 /* If we have A op 0 ? A : -A, consider applying the following
7541 transformations:
7543 A == 0? A : -A same as -A
7544 A != 0? A : -A same as A
7545 A >= 0? A : -A same as abs (A)
7546 A > 0? A : -A same as abs (A)
7547 A <= 0? A : -A same as -abs (A)
7548 A < 0? A : -A same as -abs (A)
7550 None of these transformations work for modes with signed
7551 zeros. If A is +/-0, the first two transformations will
7552 change the sign of the result (from +0 to -0, or vice
7553 versa). The last four will fix the sign of the result,
7554 even though the original expressions could be positive or
7555 negative, depending on the sign of A.
7557 Note that all these transformations are correct if A is
7558 NaN, since the two alternatives (A and -A) are also NaNs. */
7565 {
7567 return
7568 pedantic_non_lvalue
7570 negate_expr
7572 arg1))));
7580 return pedantic_non_lvalue
7588 return pedantic_non_lvalue
7592 arg1)))));
7595 }
7597 /* A != 0 ? A : 0 is simply A, unless A is -0. Likewise
7598 A == 0 ? A : 0 is always 0 unless A is -0. Note that
7599 both transformations are correct when A is NaN: A != 0
7600 is then true, and A == 0 is false. */
7603 {
7608 }
7610 /* Try some transformations of A op B ? A : B.
7612 A == B? A : B same as B
7613 A != B? A : B same as A
7614 A >= B? A : B same as max (A, B)
7615 A > B? A : B same as max (B, A)
7616 A <= B? A : B same as min (A, B)
7617 A < B? A : B same as min (B, A)
7619 As above, these transformations don't work in the presence
7620 of signed zeros. For example, if A and B are zeros of
7621 opposite sign, the first two transformations will change
7622 the sign of the result. In the last four, the original
7623 expressions give different results for (A=+0, B=-0) and
7624 (A=-0, B=+0), but the transformed expressions do not.
7626 The first two transformations are correct if either A or B
7627 is a NaN. In the first transformation, the condition will
7628 be false, and B will indeed be chosen. In the case of the
7629 second transformation, the condition A != B will be true,
7630 and A will be chosen.
7632 The conversions to max() and min() are not correct if B is
7633 a number and A is not. The conditions in the original
7634 expressions will be false, so all four give B. The min()
7635 and max() versions would give a NaN instead. */
7638 {
7643 /* Avoid adding NOP_EXPRs in case this is an lvalue. */
7645 {
7649 }
7652 {
7659 /* In C++ a ?: expression can be an lvalue, so put the
7660 operand which will be used if they are equal first
7661 so that we can convert this back to the
7662 corresponding COND_EXPR. */
7664 return pedantic_non_lvalue
7674 return pedantic_non_lvalue
7683 }
7684 }
7686 /* If this is A op C1 ? A : C2 with C1 and C2 constant integers,
7687 we might still be able to simplify this. For example,
7688 if C1 is one less or one more than C2, this might have started
7689 out as a MIN or MAX and been transformed by this function.
7690 Only good for INTEGER_TYPEs, because we need TYPE_MAX_VALUE. */
7696 {
7698 /* We can replace A with C1 in this case. */
7705 /* If C1 is C2 + 1, this is min(A, C2). */
7710 return pedantic_non_lvalue
7715 /* If C1 is C2 - 1, this is min(A, C2). */
7720 return pedantic_non_lvalue
7725 /* If C1 is C2 - 1, this is max(A, C2). */
7730 return pedantic_non_lvalue
7735 /* If C1 is C2 + 1, this is max(A, C2). */
7740 return pedantic_non_lvalue
7747 }
7748 }
7750 /* If the second operand is simpler than the third, swap them
7751 since that produces better jump optimization results. */
7757 {
7758 /* See if this can be inverted. If it can't, possibly because
7759 it was a floating-point inequality comparison, don't do
7760 anything. */
7764 {
7768 /* arg1 should be the first argument of the new T. */
7771 }
7772 }
7774 /* Convert A ? 1 : 0 to simply A. */
7777 /* If we try to convert TREE_OPERAND (t, 0) to our type, the
7778 call to fold will try to move the conversion inside
7779 a COND, which will recurse. In that case, the COND_EXPR
7780 is probably the best choice, so leave it alone. */
7784 /* Convert A ? 0 : 1 to !A. This prefers the use of NOT_EXPR
7785 over COND_EXPR in cases such as floating point comparisons. */
7792 /* Look for expressions of the form A & 2 ? 2 : 0. The result of this
7793 operation is simply A & 2. */
7804 /* Convert A ? B : 0 into A && B if A and B are truth values. */
7811 /* Convert A ? B : 1 into !A || B if A and B are truth values. */
7815 {
7816 /* Only perform transformation if ARG0 is easily inverted. */
7821 }
7826 /* When pedantic, a compound expression can be neither an lvalue
7827 nor an integer constant expression. */
7830 /* Don't let (0, 0) be null pointer constant. */
7872 /* Pull arithmetic ops out of the CLEANUP_POINT_EXPR where
7873 appropriate. */
7878 {
7882 tree arg01;
7893 {
7907 arg01));
7908 }
7911 }
7914 /* Check for a built-in function. */
7919 {
7923 }
7929 }
7931 /* Determine if first argument is a multiple of second argument. Return 0 if
7932 it is not, or we cannot easily determined it to be.
7934 An example of the sort of thing we care about (at this point; this routine
7935 could surely be made more general, and expanded to do what the *_DIV_EXPR's
7936 fold cases do now) is discovering that
7938 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
7940 is a multiple of
7942 SAVE_EXPR (J * 8)
7944 when we know that the two SAVE_EXPR (J * 8) nodes are the same node.
7946 This code also handles discovering that
7948 SAVE_EXPR (I) * SAVE_EXPR (J * 8)
7950 is a multiple of 8 so we don't have to worry about dealing with a
7951 possible remainder.
7953 Note that we *look* inside a SAVE_EXPR only to determine how it was
7954 calculated; it is not safe for fold to do much of anything else with the
7955 internals of a SAVE_EXPR, since it cannot know when it will be evaluated
7956 at run time. For example, the latter example above *cannot* be implemented
7957 as SAVE_EXPR (I) * J or any variant thereof, since the value of J at
7958 evaluation time of the original SAVE_EXPR is not necessarily the same at
7959 the time the new expression is evaluated. The only optimization of this
7960 sort that would be valid is changing
7962 SAVE_EXPR (I) * SAVE_EXPR (SAVE_EXPR (J) * 8)
7964 divided by 8 to
7966 SAVE_EXPR (I) * SAVE_EXPR (J)
7968 (where the same SAVE_EXPR (J) is used in the original and the
7969 transformed version). */
7971 static int
7973 tree type;
7974 tree top;
7975 tree bottom;
7976 {
7984 {
7996 {
8000 /* const_binop may not detect overflow correctly,
8001 so check for it explicitly here. */
8010 }
8014 /* Can't handle conversions from non-integral or wider integral type. */
8020 /* .. fall through ... */
8036 }
8037 }
8039 /* Return true if `t' is known to be non-negative. */
8041 int
8043 tree t;
8044 {
8046 {
8055 /* These are undefined at zero. This is true even if
8056 C[LT]Z_DEFINED_VALUE_AT_ZERO is set, since what we're
8057 computing here is a user-visible property. */
8071 /* zero_extend(x) + zero_extend(y) is non-negative if x and y are
8072 both unsigned and at least 2 bits shorter than the result. */
8076 {
8081 {
8085 }
8086 }
8091 {
8092 /* x * x for floating point x is always non-negative. */
8097 }
8099 /* zero_extend(x) * zero_extend(y) is non-negative if x and y are
8100 both unsigned and their total bits is shorter than the result. */
8104 {
8111 }
8132 {
8137 {
8141 {
8145 }
8146 }
8148 {
8154 }
8155 }
8182 {
8189 {
8222 }
8223 }
8225 /* ... fall through ... */
8229 /* Truth values evaluate to 0 or 1, which is nonnegative. */
8231 }
8233 /* We don't know sign of `t', so be conservative and return false. */
8235 }
8237 /* Return true if `r' is known to be non-negative.
8238 Only handles constants at the moment. */
8240 int
8242 rtx r;
8243 {
8245 {
8255 {
8257 rtx elt;
8262 {
8266 }
8269 }
8273 /* These are always nonnegative. */
8278 }
8279 }