| blob | cc8b4b8e709e3f00772c580a9b14796042b30046 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
71 /* Tree code classes. */
73 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
74 #define END_OF_BASE_TREE_CODES tcc_exceptional,
78 };
80 #undef DEFTREECODE
81 #undef END_OF_BASE_TREE_CODES
83 /* Table indexed by tree code giving number of expression
84 operands beyond the fixed part of the node structure.
85 Not used for types or decls. */
87 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
88 #define END_OF_BASE_TREE_CODES 0,
92 };
94 #undef DEFTREECODE
95 #undef END_OF_BASE_TREE_CODES
97 /* Names of tree components.
98 Used for printing out the tree and error messages. */
99 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
104 };
106 #undef DEFTREECODE
107 #undef END_OF_BASE_TREE_CODES
109 /* Each tree code class has an associated string representation.
110 These must correspond to the tree_code_class entries. */
113 {
124 "expression"
125 };
127 /* obstack.[ch] explicitly declined to prototype this. */
130 /* Statistics-gathering stuff. */
136 /* Keep in sync with tree.h:enum tree_node_kind. */
154 };
156 /* Unique id for next decl created. */
158 /* Unique id for next type created. */
160 /* Unique id for next debug decl created. Use negative numbers,
161 to catch erroneous uses. */
164 /* Since we cannot rehash a type after it is in the table, we have to
165 keep the hash code. */
169 tree type;
170 };
172 /* Initial size of the hash table (rounded to next prime). */
173 #define TYPE_HASH_INITIAL_SIZE 1000
176 {
180 static int
182 {
184 }
185 };
187 /* Now here is the hash table. When recording a type, it is added to
188 the slot whose index is the hash code. Note that the hash table is
189 used for several kinds of types (function types, array types and
190 array index range types, for now). While all these live in the
191 same table, they are completely independent, and the hash code is
192 computed differently for each of these. */
196 /* Hash table and temporary node for larger integer const values. */
200 {
203 };
207 /* Class and variable for making sure that there is a single POLY_INT_CST
208 for a given value. */
210 {
214 };
218 /* Hash table for optimization flags and target option flags. Use the same
219 hash table for both sets of options. Nodes for building the current
220 optimization and target option nodes. The assumption is most of the time
221 the options created will already be in the hash table, so we avoid
222 allocating and freeing up a node repeatably. */
227 {
230 };
234 /* General tree->tree mapping structure for use in hash tables. */
244 {
247 static bool
249 {
251 }
253 static int
255 {
257 }
258 };
278 /* Number of operands for each OpenMP clause. */
280 {
354 };
357 {
431 };
434 /* Return the tree node structure used by tree code CODE. */
438 {
440 {
442 {
444 {
467 }
468 }
481 }
483 {
484 /* tcc_constant cases. */
493 /* tcc_exceptional cases. */
510 }
511 }
514 /* Initialize tree_contains_struct to describe the hierarchy of tree
515 nodes. */
517 static void
519 {
523 {
530 /* Mark the TS structure itself. */
533 /* Mark all the structures that TS is derived from. */
535 {
615 }
616 }
618 /* Basic consistency checks for attributes used in fold. */
659 }
662 /* Init tree.c. */
664 void
666 {
667 /* Initialize the hash table of types. */
668 type_hash_table
671 debug_expr_for_decl
674 value_expr_for_decl
688 /* Initialize the tree_contains_struct array. */
691 }
693 \f
694 /* The name of the object as the assembler will see it (but before any
695 translations made by ASM_OUTPUT_LABELREF). Often this is the same
696 as DECL_NAME. It is an IDENTIFIER_NODE. */
697 tree
699 {
703 }
705 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
706 (either of which may be NULL). Inform the FE, if this changes the
707 name. */
709 void
711 {
714 }
716 /* When the target supports COMDAT groups, this indicates which group the
717 DECL is associated with. This can be either an IDENTIFIER_NODE or a
718 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
719 tree
721 {
726 }
728 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
729 tree
731 {
736 }
738 /* When the target supports named section, return its name as IDENTIFIER_NODE
739 or NULL if it is in no section. */
742 {
747 }
749 /* Set section name of NODE to VALUE (that is expected to be
750 identifier node) */
751 void
753 {
757 {
761 }
764 else
767 }
769 /* Return TLS model of a variable NODE. */
770 enum tls_model
772 {
777 }
779 /* Set TLS model of variable NODE to MODEL. */
780 void
782 {
786 {
790 }
791 else
794 }
796 /* Compute the number of bytes occupied by a tree with code CODE.
797 This function cannot be used for nodes that have variable sizes,
798 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
799 size_t
801 {
803 {
806 {
823 }
827 {
850 }
863 {
875 }
879 {
900 }
904 }
905 }
907 /* Compute the number of bytes occupied by NODE. This routine only
908 looks at TREE_CODE, except for those nodes that have variable sizes. */
909 size_t
911 {
914 {
944 else
946 }
947 }
949 /* Return tree node kind based on tree CODE. */
951 static tree_node_kind
953 {
957 {
975 {
992 }
998 }
999 }
1001 /* Record interesting allocation statistics for a tree node with CODE
1002 and LENGTH. */
1004 static void
1006 {
1015 }
1017 /* Allocate and return a new UID from the DECL_UID namespace. */
1019 int
1021 {
1023 }
1025 /* Return a newly allocated node of code CODE. For decl and type
1026 nodes, some other fields are initialized. The rest of the node is
1027 initialized to zero. This function cannot be used for TREE_VEC,
1028 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1029 tree_code_size.
1031 Achoo! I got a code in the node. */
1033 tree
1035 {
1036 tree t;
1046 {
1054 {
1056 {
1059 }
1060 else
1062 }
1066 else
1067 {
1070 }
1083 /* Default to no attributes for type, but let target change that. */
1087 /* We have not yet computed the alias set for this type. */
1097 {
1105 /* All of these have side-effects, no matter what their
1106 operands are. */
1112 }
1117 {
1130 }
1134 /* Other classes need no special treatment. */
1136 }
1139 }
1141 /* Free tree node. */
1143 void
1145 {
1148 {
1158 }
1166 }
1167 \f
1168 /* Return a new node with the same contents as NODE except that its
1169 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1171 tree
1173 {
1174 tree t;
1191 {
1194 else
1195 {
1199 }
1202 {
1205 }
1206 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1208 {
1211 }
1213 {
1216 }
1218 {
1221 }
1222 }
1224 {
1226 /* The following is so that the debug code for
1227 the copy is different from the original type.
1228 The two statements usually duplicate each other
1229 (because they clear fields of the same union),
1230 but the optimizer should catch that. */
1234 /* Do not copy the values cache. */
1236 {
1239 }
1240 }
1242 {
1246 }
1248 {
1252 }
1255 }
1257 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1258 For example, this can copy a list made of TREE_LIST nodes. */
1260 tree
1262 {
1263 tree head;
1272 {
1276 }
1278 }
1280 \f
1281 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1282 INTEGER_CST with value CST and type TYPE. */
1284 static unsigned int
1286 {
1288 /* We need extra HWIs if CST is an unsigned integer with its
1289 upper bit set. */
1293 }
1295 /* Return a new INTEGER_CST with value CST and type TYPE. */
1297 static tree
1299 {
1305 {
1311 }
1314 {
1315 len--;
1319 }
1325 }
1327 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1329 static tree
1331 CXX_MEM_STAT_INFO)
1332 {
1344 }
1346 /* Create a constant tree that contains CST sign-extended to TYPE. */
1348 tree
1350 {
1351 /* Support legacy code. */
1356 }
1358 /* Create a constant tree that contains CST zero-extended to TYPE. */
1360 tree
1362 {
1364 }
1366 /* Create a constant tree that contains CST sign-extended to TYPE. */
1368 tree
1370 {
1373 }
1375 /* Constructs tree in type TYPE from with value given by CST. Signedness
1376 of CST is assumed to be the same as the signedness of TYPE. */
1378 tree
1380 {
1382 }
1384 /* We force the wide_int CST to the range of the type TYPE by sign or
1385 zero extending it. OVERFLOWABLE indicates if we are interested in
1386 overflow of the value, when >0 we are only interested in signed
1387 overflow, for <0 we are interested in any overflow. OVERFLOWED
1388 indicates whether overflow has already occurred. CONST_OVERFLOWED
1389 indicates whether constant overflow has already occurred. We force
1390 T's value to be within range of T's type (by setting to 0 or 1 all
1391 the bits outside the type's range). We set TREE_OVERFLOWED if,
1392 OVERFLOWED is nonzero,
1393 or OVERFLOWABLE is >0 and signed overflow occurs
1394 or OVERFLOWABLE is <0 and any overflow occurs
1395 We return a new tree node for the extended wide_int. The node
1396 is shared if no overflow flags are set. */
1399 tree
1402 {
1405 /* If we need to set overflow flags, return a new unshared node. */
1407 {
1411 {
1413 sign);
1414 tree t;
1417 else
1418 {
1421 {
1424 }
1426 }
1429 }
1430 }
1432 /* Else build a shared node. */
1434 }
1436 /* These are the hash table functions for the hash table of INTEGER_CST
1437 nodes of a sizetype. */
1439 /* Return the hash code X, an INTEGER_CST. */
1441 hashval_t
1443 {
1452 }
1454 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1455 is the same as that given by *Y, which is the same. */
1457 bool
1459 {
1473 }
1475 /* Create an INT_CST node of TYPE and value CST.
1476 The returned node is always shared. For small integers we use a
1477 per-type vector cache, for larger ones we use a single hash table.
1478 The value is extended from its precision according to the sign of
1479 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1480 the upper bits and ensures that hashing and value equality based
1481 upon the underlying HOST_WIDE_INTs works without masking. */
1483 static tree
1485 {
1486 tree t;
1494 /* Verify that everything is canonical. */
1497 {
1502 }
1508 {
1509 /* We just need to store a single HOST_WIDE_INT. */
1510 HOST_WIDE_INT hwi;
1513 else
1517 {
1520 /* Fallthru. */
1524 /* Cache NULL pointer and zero bounds. */
1526 {
1529 }
1533 /* Cache false or true. */
1542 {
1543 /* Cache [0, N). */
1547 }
1548 else
1549 {
1550 /* Cache [-1, N). */
1554 }
1562 }
1565 {
1566 /* Look for it in the type's vector of small shared ints. */
1568 {
1571 }
1575 /* Make sure no one is clobbering the shared constant. */
1581 else
1582 {
1583 /* Create a new shared int. */
1586 }
1587 }
1588 else
1589 {
1590 /* Use the cache of larger shared ints, using int_cst_node as
1591 a temporary. */
1599 {
1600 /* Insert this one into the hash table. */
1603 /* Make a new node for next time round. */
1605 }
1606 }
1607 }
1608 else
1609 {
1610 /* The value either hashes properly or we drop it on the floor
1611 for the gc to take care of. There will not be enough of them
1612 to worry about. */
1618 {
1619 /* Insert this one into the hash table. */
1622 }
1623 else
1625 }
1628 }
1630 hashval_t
1632 {
1640 }
1642 bool
1644 {
1651 }
1653 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1654 The elements must also have type TYPE. */
1656 tree
1658 {
1669 INSERT);
1671 {
1676 }
1678 }
1680 /* Create a constant tree with value VALUE in type TYPE. */
1682 tree
1684 {
1688 }
1690 void
1692 {
1701 {
1704 /* Fallthru. */
1708 /* Cache NULL pointer. */
1710 {
1713 }
1717 /* Cache false or true. */
1726 {
1727 /* Cache 0..N */
1730 /* This is a little hokie, but if the prec is smaller than
1731 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1732 obvious test will not get the correct answer. */
1734 {
1737 }
1740 }
1741 else
1742 {
1743 /* Cache -1..N */
1749 {
1751 {
1754 }
1757 }
1758 }
1766 }
1769 {
1770 /* Look for it in the type's vector of small shared ints. */
1772 {
1775 }
1779 }
1780 else
1781 {
1782 /* Use the cache of larger shared ints. */
1784 /* If there is already an entry for the number verify it's the
1785 same. */
1788 else
1789 /* Otherwise insert this one into the hash table. */
1791 }
1792 }
1795 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1796 and the rest are zeros. */
1798 tree
1800 {
1805 }
1807 /* Checks that X is integer constant that can be expressed in (unsigned)
1808 HOST_WIDE_INT without loss of precision. */
1810 bool
1812 {
1815 }
1817 /* Build a newly constructed VECTOR_CST with the given values of
1818 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1820 tree
1823 {
1825 tree t;
1841 }
1843 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1844 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1846 tree
1848 {
1850 tree value;
1852 /* We can't construct a VECTOR_CST for a variable number of elements. */
1856 {
1858 {
1859 /* If NELTS is constant then this must be too. */
1863 }
1864 else
1866 }
1871 }
1873 /* Build a vector of type VECTYPE where all the elements are SCs. */
1874 tree
1876 {
1882 /* Verify that the vector type is suitable for SC. Note that there
1883 is some inconsistency in the type-system with respect to restrict
1884 qualifications of pointers. Vector types always have a main-variant
1885 element type and the qualification is applied to the vector-type.
1886 So TREE_TYPE (vector-type) does not return a properly qualified
1887 vector element-type. */
1892 {
1896 }
1899 else
1900 {
1906 }
1907 }
1909 /* If TYPE is not a vector type, just return SC, otherwise return
1910 build_vector_from_val (TYPE, SC). */
1912 tree
1914 {
1919 }
1921 /* Build a vector series of type TYPE in which element I has the value
1922 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1923 and a VEC_SERIES_EXPR otherwise. */
1925 tree
1927 {
1931 {
1941 }
1943 }
1945 /* Return a vector with the same number of units and number of bits
1946 as VEC_TYPE, but in which the elements are a linear series of unsigned
1947 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1949 tree
1951 {
1956 {
1957 index_elt_type = build_nonstandard_integer_type
1960 }
1966 }
1968 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1969 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1971 void
1973 {
1975 tree val;
1981 {
1982 /* Mostly ctors will have elts that don't have side-effects, so
1983 the usual case is to scan all the elements. Hence a single
1984 loop for both const and side effects, rather than one loop
1985 each (with early outs). */
1990 }
1994 }
1996 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1997 CONSTRUCTOR C. */
1999 void
2001 {
2003 tree val;
2009 {
2014 }
2015 }
2017 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2018 are in the vec pointed to by VALS. */
2019 tree
2021 {
2030 }
2032 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2033 INDEX and VALUE. */
2034 tree
2036 {
2044 }
2047 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2048 are in a list pointed to by VALS. */
2049 tree
2051 {
2052 tree t;
2056 {
2060 }
2063 }
2065 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2066 of elements, provided as index/value pairs. */
2068 tree
2070 {
2077 {
2081 }
2084 }
2086 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2088 tree
2090 {
2094 }
2096 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2098 tree
2100 {
2101 tree v;
2111 }
2113 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2115 tree
2117 {
2118 tree v;
2122 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2123 Consider doing it via real_convert now. */
2133 }
2135 /* Like build_real, but first truncate D to the type. */
2137 tree
2139 {
2141 }
2143 /* Return a new REAL_CST node whose type is TYPE
2144 and whose value is the integer value of the INTEGER_CST node I. */
2146 REAL_VALUE_TYPE
2148 {
2149 REAL_VALUE_TYPE d;
2151 /* Clear all bits of the real value type so that we can later do
2152 bitwise comparisons to see if two values are the same. */
2158 }
2160 /* Given a tree representing an integer constant I, return a tree
2161 representing the same value as a floating-point constant of type TYPE. */
2163 tree
2165 {
2166 tree v;
2173 }
2175 /* Return a newly constructed STRING_CST node whose value is
2176 the LEN characters at STR.
2177 Note that for a C string literal, LEN should include the trailing NUL.
2178 The TREE_TYPE is not initialized. */
2180 tree
2182 {
2183 tree s;
2186 /* Do not waste bytes provided by padding of struct tree_string. */
2201 }
2203 /* Return a newly constructed COMPLEX_CST node whose value is
2204 specified by the real and imaginary parts REAL and IMAG.
2205 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2206 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2208 tree
2210 {
2221 }
2223 /* Build a complex (inf +- 0i), such as for the result of cproj.
2224 TYPE is the complex tree type of the result. If NEG is true, the
2225 imaginary zero is negative. */
2227 tree
2229 {
2236 }
2238 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2239 element is set to 1. In particular, this is 1 + i for complex types. */
2241 tree
2243 {
2245 {
2248 }
2249 else
2251 }
2253 /* Return a constant of arithmetic type TYPE which is the
2254 multiplicative identity of the set TYPE. */
2256 tree
2258 {
2260 {
2270 /* We can only generate 1 for accum types. */
2275 {
2279 }
2288 }
2289 }
2291 /* Return an integer of type TYPE containing all 1's in as much precision as
2292 it contains, or a complex or vector whose subparts are such integers. */
2294 tree
2296 {
2298 {
2301 }
2302 else
2304 }
2306 /* Return a constant of arithmetic type TYPE which is the
2307 opposite of the multiplicative identity of the set TYPE. */
2309 tree
2311 {
2313 {
2323 /* We can only generate 1 for accum types. */
2330 {
2334 }
2343 }
2344 }
2346 /* Build 0 constant of type TYPE. This is used by constructor folding
2347 and thus the constant should be represented in memory by
2348 zero(es). */
2350 tree
2352 {
2354 {
2367 {
2371 }
2374 {
2378 }
2384 }
2385 }
2388 /* Build a BINFO with LEN language slots. */
2390 tree
2392 {
2393 tree t;
2408 }
2410 /* Create a CASE_LABEL_EXPR tree node and return it. */
2412 tree
2414 {
2426 }
2428 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2429 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2430 The latter determines the length of the HOST_WIDE_INT vector. */
2432 tree
2434 {
2435 tree t;
2447 /* to_offset can only be applied to trees that are offset_int-sized
2448 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2449 must be exactly the precision of offset_int and so LEN is correct. */
2452 else
2458 }
2460 /* Build a newly constructed TREE_VEC node of length LEN. */
2462 tree
2464 {
2465 tree t;
2476 }
2478 /* Grow a TREE_VEC node to new length LEN. */
2480 tree
2482 {
2498 }
2499 \f
2500 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2501 fixed, and scalar, complex or vector. */
2503 bool
2505 {
2509 }
2511 /* Return 1 if EXPR is the integer constant zero or a complex constant
2512 of zero, or a location wrapper for such a constant. */
2514 bool
2516 {
2520 {
2532 }
2533 }
2535 /* Return 1 if EXPR is the integer constant one or the corresponding
2536 complex constant, or a location wrapper for such a constant. */
2538 bool
2540 {
2544 {
2556 }
2557 }
2559 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2560 return 1 if every piece is the integer constant one.
2561 Also return 1 for location wrappers for such a constant. */
2563 bool
2565 {
2571 else
2573 }
2575 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2576 it contains, or a complex or vector whose subparts are such integers,
2577 or a location wrapper for such a constant. */
2579 bool
2581 {
2599 }
2601 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2602 for such a constant. */
2604 bool
2606 {
2612 else
2614 }
2616 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2617 one bit on), or a location wrapper for such a constant. */
2619 bool
2621 {
2633 }
2635 /* Return 1 if EXPR is an integer constant other than zero or a
2636 complex constant other than zero, or a location wrapper for such a
2637 constant. */
2639 bool
2641 {
2649 }
2651 /* Return 1 if EXPR is the integer constant one. For vector,
2652 return 1 if every piece is the integer constant minus one
2653 (representing the value TRUE).
2654 Also return 1 for location wrappers for such a constant. */
2656 bool
2658 {
2664 }
2666 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2667 for such a constant. */
2669 bool
2671 {
2676 }
2678 /* Return the power of two represented by a tree node known to be a
2679 power of two. */
2681 int
2683 {
2688 }
2690 /* Similar, but return the largest integer Y such that 2 ** Y is less
2691 than or equal to EXPR. */
2693 int
2695 {
2700 }
2702 /* Return number of known trailing zero bits in EXPR, or, if the value of
2703 EXPR is known to be zero, the precision of it's type. */
2705 unsigned int
2707 {
2714 {
2735 /* Second operand is sizetype, which could be in theory
2736 wider than pointer's precision. Make sure we never
2737 return more than prec. */
2752 {
2755 }
2760 {
2765 }
2774 {
2777 {
2782 }
2783 }
2785 CASE_CONVERT:
2803 {
2806 }
2810 }
2811 }
2813 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2814 decimal float constants, so don't return 1 for them.
2815 Also return 1 for location wrappers around such a constant. */
2817 bool
2819 {
2823 {
2831 {
2832 /* Don't simply check for a duplicate because the predicate
2833 accepts both +0.0 and -0.0. */
2839 }
2842 }
2843 }
2845 /* Return 1 if EXPR is the real constant one in real or complex form.
2846 Trailing zeroes matter for decimal float constants, so don't return
2847 1 for them.
2848 Also return 1 for location wrappers around such a constant. */
2850 bool
2852 {
2856 {
2869 }
2870 }
2872 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2873 matter for decimal float constants, so don't return 1 for them.
2874 Also return 1 for location wrappers around such a constant. */
2876 bool
2878 {
2882 {
2895 }
2896 }
2898 /* Nonzero if EXP is a constant or a cast of a constant. */
2900 bool
2902 {
2903 /* This is not quite the same as STRIP_NOPS. It does more. */
2908 }
2910 /* Return true if T holds a polynomial pointer difference, storing it in
2911 *VALUE if so. A true return means that T's precision is no greater
2912 than 64 bits, which is the largest address space we support, so *VALUE
2913 never loses precision. However, the signedness of the result does
2914 not necessarily match the signedness of T: sometimes an unsigned type
2915 like sizetype is used to encode a value that is actually negative. */
2917 bool
2919 {
2923 {
2928 }
2930 {
2937 }
2939 }
2941 poly_int64
2943 {
2948 }
2950 poly_uint64
2952 {
2957 }
2958 \f
2959 /* Return first list element whose TREE_VALUE is ELEM.
2960 Return 0 if ELEM is not in LIST. */
2962 tree
2964 {
2966 {
2970 }
2972 }
2974 /* Return first list element whose TREE_PURPOSE is ELEM.
2975 Return 0 if ELEM is not in LIST. */
2977 tree
2979 {
2981 {
2985 }
2987 }
2989 /* Return true if ELEM is in V. */
2991 bool
2993 {
2995 tree t;
3000 }
3002 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3003 NULL_TREE. */
3005 tree
3007 {
3011 }
3013 /* Return nonzero if ELEM is part of the chain CHAIN. */
3015 bool
3017 {
3019 {
3023 }
3026 }
3028 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3029 We expect a null pointer to mark the end of the chain.
3030 This is the Lisp primitive `length'. */
3032 int
3034 {
3036 #ifdef ENABLE_TREE_CHECKING
3038 #endif
3042 {
3044 #ifdef ENABLE_TREE_CHECKING
3048 #endif
3049 len++;
3050 }
3053 }
3055 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3056 UNION_TYPE TYPE, or NULL_TREE if none. */
3058 tree
3060 {
3065 }
3067 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3068 by modifying the last node in chain 1 to point to chain 2.
3069 This is the Lisp primitive `nconc'. */
3071 tree
3073 {
3074 tree t1;
3085 #ifdef ENABLE_TREE_CHECKING
3086 {
3087 tree t2;
3090 }
3091 #endif
3094 }
3096 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3098 tree
3100 {
3101 tree next;
3106 }
3108 /* Reverse the order of elements in the chain T,
3109 and return the new head of the chain (old last element). */
3111 tree
3113 {
3116 {
3117 /* We shouldn't be using this function to reverse BLOCK chains; we
3118 have blocks_nreverse for that. */
3123 }
3125 }
3126 \f
3127 /* Return a newly created TREE_LIST node whose
3128 purpose and value fields are PARM and VALUE. */
3130 tree
3132 {
3137 }
3139 /* Build a chain of TREE_LIST nodes from a vector. */
3141 tree
3143 {
3147 tree t;
3149 {
3152 }
3154 }
3156 /* Return a newly created TREE_LIST node whose
3157 purpose and value fields are PURPOSE and VALUE
3158 and whose TREE_CHAIN is CHAIN. */
3160 tree
3162 {
3163 tree node;
3175 }
3177 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3178 trees. */
3182 {
3186 tree val;
3192 }
3193 \f
3194 /* Return the size nominally occupied by an object of type TYPE
3195 when it resides in memory. The value is measured in units of bytes,
3196 and its data type is that normally used for type sizes
3197 (which is the first type created by make_signed_type or
3198 make_unsigned_type). */
3200 tree
3202 {
3203 tree t;
3212 {
3215 }
3218 }
3220 /* Return the size of TYPE (in bytes) as a wide integer
3221 or return -1 if the size can vary or is larger than an integer. */
3223 HOST_WIDE_INT
3225 {
3226 tree t;
3236 else
3238 }
3240 /* Return the maximum size of TYPE (in bytes) as a wide integer
3241 or return -1 if the size can vary or is larger than an integer. */
3243 HOST_WIDE_INT
3245 {
3247 tree size_tree;
3249 /* If this is an array type, check for a possible MAX_SIZE attached. */
3252 {
3257 }
3259 /* If we still haven't been able to get a size, see if the language
3260 can compute a maximum size. */
3263 {
3268 }
3271 }
3272 \f
3273 /* Return the bit position of FIELD, in bits from the start of the record.
3274 This is a tree of type bitsizetype. */
3276 tree
3278 {
3281 }
3282 \f
3283 /* Return the byte position of FIELD, in bytes from the start of the record.
3284 This is a tree of type sizetype. */
3286 tree
3288 {
3291 }
3293 /* Likewise, but return as an integer. It must be representable in
3294 that way (since it could be a signed value, we don't have the
3295 option of returning -1 like int_size_in_byte can. */
3297 HOST_WIDE_INT
3299 {
3301 }
3302 \f
3303 /* Return the strictest alignment, in bits, that T is known to have. */
3305 unsigned int
3307 {
3311 {
3313 /* If we have conversions, we know that the alignment of the
3314 object must meet each of the alignments of the types. */
3322 /* These don't change the alignment of an object. */
3326 /* The best we can do is say that the alignment is the least aligned
3327 of the two arms. */
3332 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3333 meaningfully, it's always 1. */
3342 }
3344 /* Otherwise take the alignment from that of the type. */
3346 }
3347 \f
3348 /* Return, as a tree node, the number of elements for TYPE (which is an
3349 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3351 tree
3353 {
3356 /* If they did it with unspecified bounds, then we should have already
3357 given an error about it before we got here. */
3365 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3370 ? max
3372 }
3373 \f
3374 /* If arg is static -- a reference to an object in static storage -- then
3375 return the object. This is not the same as the C meaning of `static'.
3376 If arg isn't static, return NULL. */
3378 tree
3380 {
3382 {
3384 /* Nested functions are static, even though taking their address will
3385 involve a trampoline as we unnest the nested function and create
3386 the trampoline on the tree level. */
3407 /* If the thing being referenced is not a field, then it is
3408 something language specific. */
3411 /* If we are referencing a bitfield, we can't evaluate an
3412 ADDR_EXPR at compile time and so it isn't a constant. */
3429 else
3437 }
3438 }
3440 \f
3443 /* Return whether OP is a DECL whose address is function-invariant. */
3445 bool
3447 {
3448 /* The conditions below are slightly less strict than the one in
3449 staticp. */
3452 {
3475 }
3478 }
3480 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3482 bool
3484 {
3485 /* The conditions below are slightly less strict than the one in
3486 staticp. */
3489 {
3509 }
3512 }
3515 /* Return true if T is function-invariant (internal function, does
3516 not handle arithmetic; that's handled in skip_simple_arithmetic and
3517 tree_invariant_p). */
3519 static bool
3521 {
3522 tree op;
3529 {
3536 {
3538 {
3553 }
3555 }
3561 }
3564 }
3566 /* Return true if T is function-invariant. */
3568 bool
3570 {
3573 }
3575 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3576 Do this to any expression which may be used in more than one place,
3577 but must be evaluated only once.
3579 Normally, expand_expr would reevaluate the expression each time.
3580 Calling save_expr produces something that is evaluated and recorded
3581 the first time expand_expr is called on it. Subsequent calls to
3582 expand_expr just reuse the recorded value.
3584 The call to expand_expr that generates code that actually computes
3585 the value is the first call *at compile time*. Subsequent calls
3586 *at compile time* generate code to use the saved value.
3587 This produces correct result provided that *at run time* control
3588 always flows through the insns made by the first expand_expr
3589 before reaching the other places where the save_expr was evaluated.
3590 You, the caller of save_expr, must make sure this is so.
3592 Constants, and certain read-only nodes, are returned with no
3593 SAVE_EXPR because that is safe. Expressions containing placeholders
3594 are not touched; see tree.def for an explanation of what these
3595 are used for. */
3597 tree
3599 {
3600 tree inner;
3602 /* If the tree evaluates to a constant, then we don't want to hide that
3603 fact (i.e. this allows further folding, and direct checks for constants).
3604 However, a read-only object that has side effects cannot be bypassed.
3605 Since it is no problem to reevaluate literals, we just return the
3606 literal node. */
3614 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3615 it means that the size or offset of some field of an object depends on
3616 the value within another field.
3618 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3619 and some variable since it would then need to be both evaluated once and
3620 evaluated more than once. Front-ends must assure this case cannot
3621 happen by surrounding any such subexpressions in their own SAVE_EXPR
3622 and forcing evaluation at the proper time. */
3628 /* This expression might be placed ahead of a jump to ensure that the
3629 value was computed on both sides of the jump. So make sure it isn't
3630 eliminated as dead. */
3633 }
3635 /* Look inside EXPR into any simple arithmetic operations. Return the
3636 outermost non-arithmetic or non-invariant node. */
3638 tree
3640 {
3641 /* We don't care about whether this can be used as an lvalue in this
3642 context. */
3646 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3647 a constant, it will be more efficient to not make another SAVE_EXPR since
3648 it will allow better simplification and GCSE will be able to merge the
3649 computations if they actually occur. */
3651 {
3655 {
3660 else
3662 }
3663 else
3665 }
3668 }
3670 /* Look inside EXPR into simple arithmetic operations involving constants.
3671 Return the outermost non-arithmetic or non-constant node. */
3673 tree
3675 {
3680 {
3684 {
3689 else
3691 }
3692 else
3694 }
3697 }
3699 /* Return which tree structure is used by T. */
3701 enum tree_node_structure_enum
3703 {
3706 }
3708 /* Set various status flags when building a CALL_EXPR object T. */
3710 static void
3712 {
3717 /* Calls have side-effects, except those to const or pure functions. */
3720 /* Propagate TREE_READONLY of arguments for const functions. */
3726 {
3732 }
3736 }
3737 \f
3738 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3739 size or offset that depends on a field within a record. */
3741 bool
3743 {
3754 {
3756 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3757 position computations since they will be converted into a
3758 WITH_RECORD_EXPR involving the reference, which will assume
3759 here will be valid. */
3773 {
3775 /* Ignoring the first operand isn't quite right, but works best. */
3784 /* The save_expr function never wraps anything containing
3785 a PLACEHOLDER_EXPR. */
3790 }
3793 {
3801 }
3805 {
3807 {
3808 const_tree arg;
3809 const_call_expr_arg_iterator iter;
3814 }
3817 }
3821 }
3823 }
3825 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3826 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3827 field positions. */
3829 static bool
3831 {
3832 /* If the size contains a placeholder or the parent type (component type in
3833 the case of arrays) type involves a placeholder, this type does. */
3841 /* Now do type-specific checks. Note that the last part of the check above
3842 greatly limits what we have to do below. */
3844 {
3861 /* Here we just check the bounds. */
3866 /* We have already checked the component type above, so just check
3867 the domain type. Flexible array members have a null domain. */
3874 {
3875 tree field;
3886 }
3890 }
3891 }
3893 /* Wrapper around above function used to cache its result. */
3895 bool
3897 {
3900 /* If the contains_placeholder_bits field has been initialized,
3901 then we know the answer. */
3905 /* Indicate that we've seen this type node, and the answer is false.
3906 This is what we want to return if we run into recursion via fields. */
3909 /* Compute the real value. */
3912 /* Store the real value. */
3916 }
3917 \f
3918 /* Push tree EXP onto vector QUEUE if it is not already present. */
3920 static void
3922 {
3924 tree iter;
3932 }
3934 /* Given a tree EXP, find all occurrences of references to fields
3935 in a PLACEHOLDER_EXPR and place them in vector REFS without
3936 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3937 we assume here that EXP contains only arithmetic expressions
3938 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3939 argument list. */
3941 void
3943 {
3945 tree inner;
3948 /* We handle TREE_LIST and COMPONENT_REF separately. */
3950 {
3953 }
3955 {
3959 ;
3963 else
3965 }
3966 else
3968 {
3973 /* Variables allocated to static storage can stay. */
3979 /* This is the pattern built in ada/make_aligning_type. */
3982 {
3985 }
3987 /* Fall through. */
4005 }
4006 }
4008 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4009 return a tree with all occurrences of references to F in a
4010 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4011 CONST_DECLs. Note that we assume here that EXP contains only
4012 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4013 occurring only in their argument list. */
4015 tree
4017 {
4020 tree new_tree;
4022 /* We handle TREE_LIST and COMPONENT_REF separately. */
4024 {
4031 }
4033 {
4034 tree inner;
4036 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4037 and it is the right field, replace it with R. */
4041 ;
4043 /* The field. */
4049 /* If this expression hasn't been completed let, leave it alone. */
4057 new_tree
4059 }
4060 else
4062 {
4069 else
4076 /* Fall through. */
4084 {
4129 new_tree
4135 }
4139 {
4144 /* If we are trying to replace F with a constant or with another
4145 instance of one of the arguments of the call, inline back
4146 functions which do nothing else than computing a value from
4147 the arguments they are passed. This makes it possible to
4148 fold partially or entirely the replacement expression. */
4150 {
4154 else
4157 {
4160 }
4162 {
4166 }
4167 }
4170 {
4174 {
4178 }
4179 }
4182 {
4186 }
4187 else
4189 }
4194 }
4202 }
4204 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4205 for it within OBJ, a tree that is an object or a chain of references. */
4207 tree
4209 {
4212 tree new_tree;
4214 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4215 in the chain of OBJ. */
4217 {
4219 tree elt;
4249 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4250 survives until RTL generation, there will be an error. */
4252 }
4254 /* TREE_LIST is special because we need to look at TREE_VALUE
4255 and TREE_CHAIN, not TREE_OPERANDS. */
4257 {
4264 }
4265 else
4267 {
4280 {
4325 new_tree
4331 }
4335 {
4341 {
4345 {
4349 }
4350 }
4353 {
4357 }
4358 else
4360 }
4365 }
4373 }
4374 \f
4376 /* Subroutine of stabilize_reference; this is called for subtrees of
4377 references. Any expression with side-effects must be put in a SAVE_EXPR
4378 to ensure that it is only evaluated once.
4380 We don't put SAVE_EXPR nodes around everything, because assigning very
4381 simple expressions to temporaries causes us to miss good opportunities
4382 for optimizations. Among other things, the opportunity to fold in the
4383 addition of a constant into an addressing mode often gets lost, e.g.
4384 "y[i+1] += x;". In general, we take the approach that we should not make
4385 an assignment unless we are forced into it - i.e., that any non-side effect
4386 operator should be allowed, and that cse should take care of coalescing
4387 multiple utterances of the same expression should that prove fruitful. */
4389 static tree
4391 {
4392 tree result;
4395 /* We cannot ignore const expressions because it might be a reference
4396 to a const array but whose index contains side-effects. But we can
4397 ignore things that are actual constant or that already have been
4398 handled by this function. */
4404 {
4406 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4407 have side-effects. */
4410 /* FALLTHRU */
4418 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4419 so that it will only be evaluated once. */
4420 /* The reference (r) and comparison (<) classes could be handled as
4421 below, but it is generally faster to only evaluate them once. */
4427 /* Constants need no processing. In fact, we should never reach
4428 here. */
4432 /* Division is slow and tends to be compiled with jumps,
4433 especially the division by powers of 2 that is often
4434 found inside of an array reference. So do it just once. */
4440 /* Recursively stabilize each operand. */
4446 /* Recursively stabilize each operand. */
4452 }
4460 }
4462 /* Stabilize a reference so that we can use it any number of times
4463 without causing its operands to be evaluated more than once.
4464 Returns the stabilized reference. This works by means of save_expr,
4465 so see the caveats in the comments about save_expr.
4467 Also allows conversion expressions whose operands are references.
4468 Any other kind of expression is returned unchanged. */
4470 tree
4472 {
4473 tree result;
4477 {
4481 /* No action is needed in this case. */
4484 CASE_CONVERT:
4523 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4524 it wouldn't be ignored. This matters when dealing with
4525 volatiles. */
4528 /* If arg isn't a kind of lvalue we recognize, make no change.
4529 Caller should recognize the error for an invalid lvalue. */
4535 }
4543 }
4544 \f
4545 /* Low-level constructors for expressions. */
4547 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4548 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4550 void
4552 {
4553 tree node;
4558 /* We started out assuming this address is both invariant and constant, but
4559 does not have side effects. Now go down any handled components and see if
4560 any of them involve offsets that are either non-constant or non-invariant.
4561 Also check for side-effects.
4563 ??? Note that this code makes no attempt to deal with the case where
4564 taking the address of something causes a copy due to misalignment. */
4566 #define UPDATE_FLAGS(NODE) \
4567 do { tree _node = (NODE); \
4568 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4569 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4573 {
4574 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4575 array reference (probably made temporarily by the G++ front end),
4576 so ignore all the operands. */
4580 {
4586 }
4587 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4588 FIELD_DECL, apparently. The G++ front end can put something else
4589 there, at least temporarily. */
4592 {
4595 }
4596 }
4600 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4601 the address, since &(*a)->b is a form of addition. If it's a constant, the
4602 address is constant too. If it's a decl, its address is constant if the
4603 decl is static. Everything else is not constant and, furthermore,
4604 taking the address of a volatile variable is not volatile. */
4609 ;
4612 else
4613 {
4616 }
4621 #undef UPDATE_FLAGS
4622 }
4624 /* Build an expression of code CODE, data type TYPE, and operands as
4625 specified. Expressions and reference nodes can be created this way.
4626 Constants, decls, types and misc nodes cannot be.
4628 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4629 enough for all extant tree codes. */
4631 tree
4633 {
4634 tree t;
4642 }
4644 tree
4646 {
4648 tree t;
4664 {
4667 }
4670 {
4673 }
4675 {
4677 /* All of these have side-effects, no matter what their
4678 operands are. */
4684 /* Whether a dereference is readonly has nothing to do with whether
4685 its operand is readonly. */
4703 }
4706 }
4708 #define PROCESS_ARG(N) \
4709 do { \
4710 TREE_OPERAND (t, N) = arg##N; \
4711 if (arg##N &&!TYPE_P (arg##N)) \
4712 { \
4713 if (TREE_SIDE_EFFECTS (arg##N)) \
4714 side_effects = 1; \
4715 if (!TREE_READONLY (arg##N) \
4716 && !CONSTANT_CLASS_P (arg##N)) \
4717 (void) (read_only = 0); \
4718 if (!TREE_CONSTANT (arg##N)) \
4719 (void) (constant = 0); \
4720 } \
4721 } while (0)
4723 tree
4725 {
4727 tree t;
4733 /* When sizetype precision doesn't match that of pointers
4734 we need to be able to build explicit extensions or truncations
4735 of the offset argument. */
4747 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4748 result based on those same flags for the arguments. But if the
4749 arguments aren't really even `tree' expressions, we shouldn't be trying
4750 to do this. */
4752 /* Expressions without side effects may be constant if their
4753 arguments are as well. */
4760 {
4774 }
4781 {
4783 {
4787 }
4788 }
4789 else
4790 {
4792 /* Don't mark X / 0 as constant. */
4797 }
4800 }
4803 tree
4805 tree arg2 MEM_STAT_DECL)
4806 {
4808 tree t;
4818 /* As a special exception, if COND_EXPR has NULL branches, we
4819 assume that it is a gimple statement and always consider
4820 it to have side effects. */
4826 else
4842 }
4844 tree
4847 {
4849 tree t;
4869 }
4871 tree
4874 {
4876 tree t;
4893 {
4895 {
4899 }
4900 }
4901 else
4907 }
4909 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4910 on the pointer PTR. */
4912 tree
4914 {
4917 tree tem;
4918 /* For convenience allow addresses that collapse to a simple base
4919 and offset. */
4923 {
4927 {
4930 }
4931 else
4934 }
4939 }
4941 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4943 poly_offset_int
4945 {
4947 SIGNED);
4948 }
4950 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4951 offsetted by OFFSET units. */
4953 tree
4955 {
4962 }
4964 /* Similar except don't specify the TREE_TYPE
4965 and leave the TREE_SIDE_EFFECTS as 0.
4966 It is permissible for arguments to be null,
4967 or even garbage if their values do not matter. */
4969 tree
4971 {
4972 tree t;
4989 }
4991 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4992 tree vec. */
4994 tree
4996 {
5006 }
5007 \f
5008 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5009 and data type TYPE.
5010 We do NOT enter this node in any sort of symbol table.
5012 LOC is the location of the decl.
5014 layout_decl is used to set up the decl's storage layout.
5015 Other slots are initialized to 0 or null pointers. */
5017 tree
5019 tree type MEM_STAT_DECL)
5020 {
5021 tree t;
5026 /* if (type == error_mark_node)
5027 type = integer_type_node; */
5028 /* That is not done, deliberately, so that having error_mark_node
5029 as the type can suppress useless errors in the use of this variable. */
5038 }
5040 /* Builds and returns function declaration with NAME and TYPE. */
5042 tree
5044 {
5054 }
5058 /* Builds a new translation-unit decl with name NAME, queues it in the
5059 global list of translation-unit decls and returns it. */
5061 tree
5063 {
5069 }
5071 \f
5072 /* BLOCK nodes are used to represent the structure of binding contours
5073 and declarations, once those contours have been exited and their contents
5074 compiled. This information is used for outputting debugging info. */
5076 tree
5078 {
5086 }
5088 \f
5089 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5091 LOC is the location to use in tree T. */
5093 void
5095 {
5098 }
5100 /* Data used when collecting DECLs and TYPEs for language data removal. */
5102 struct free_lang_data_d
5103 {
5106 /* Worklist to avoid excessive recursion. */
5109 /* Set of traversed objects. Used to avoid duplicate visits. */
5112 /* Array of symbols to process with free_lang_data_in_decl. */
5115 /* Array of types to process with free_lang_data_in_type. */
5117 };
5120 /* Add type or decl T to one of the list of tree nodes that need their
5121 language data removed. The lists are held inside FLD. */
5123 static void
5125 {
5130 else
5132 }
5134 /* Push tree node T into FLD->WORKLIST. */
5138 {
5141 }
5144 \f
5145 /* Return simplified TYPE_NAME of TYPE. */
5147 static tree
5149 {
5152 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5153 TYPE_DECL if the type doesn't have linkage.
5154 this must match fld_ */
5162 }
5164 /* Do same comparsion as check_qualified_type skipping lang part of type
5165 and be more permissive about type names: we only care that names are
5166 same (for diagnostics) and that ODR names are the same.
5167 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5169 static bool
5171 {
5173 /* We want to match incomplete variants with complete types.
5174 In this case we need to ignore alignment. */
5185 }
5187 /* Find variant of FIRST that match T and create new one if necessary.
5188 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5190 static tree
5193 {
5208 /* Variants of incomplete types should have alignment
5209 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5211 {
5214 }
5221 }
5223 /* Map complete types to incomplete types. */
5227 /* Map types to simplified types. */
5231 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5232 use MAP to prevent duplicates. */
5234 static tree
5237 {
5242 {
5243 return fld_type_variant
5247 }
5250 tree &array
5253 {
5259 }
5261 }
5263 /* Return CTX after removal of contexts that are not relevant */
5265 static tree
5267 {
5268 /* Variably modified types are needed for tree_is_indexable to decide
5269 whether the type needs to go to local or global section.
5270 This code is semi-broken but for now it is easiest to keep contexts
5271 as expected. */
5274 {
5277 }
5279 }
5281 /* For T being aggregate type try to turn it into a incomplete variant.
5282 Return T if no simplification is possible. */
5284 static tree
5286 {
5290 {
5293 {
5294 tree first;
5298 else
5306 }
5308 }
5317 {
5319 tree ©
5323 {
5326 /* It is possible that type was not seen by free_lang_data yet. */
5335 {
5341 }
5342 else
5345 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5346 This is needed for ODR violation warnings to come out right (we
5347 want duplicate TYPE_DECLs whenever the type is duplicated because
5348 of ODR violation. Because lang data in the TYPE_DECL may not
5349 have been freed yet, rebuild it from scratch and copy relevant
5350 fields. */
5355 {
5365 }
5366 }
5368 }
5371 }
5373 /* Simplify type T for scenarios where we do not need complete pointer
5374 types. */
5376 static tree
5378 {
5383 /* FIXME: This triggers verification error, see PR88140. */
5388 }
5390 /* Reset the expression *EXPR_P, a size or position.
5392 ??? We could reset all non-constant sizes or positions. But it's cheap
5393 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5395 We need to reset self-referential sizes or positions because they cannot
5396 be gimplified and thus can contain a CALL_EXPR after the gimplification
5397 is finished, which will run afoul of LTO streaming. And they need to be
5398 reset to something essentially dummy but not constant, so as to preserve
5399 the properties of the object they are attached to. */
5403 {
5407 }
5410 /* Reset all the fields in a binfo node BINFO. We only keep
5411 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5413 static void
5415 {
5417 tree t;
5429 }
5432 /* Reset all language specific information still present in TYPE. */
5434 static void
5436 {
5439 /* Give the FE a chance to remove its own data first. */
5452 /* Purge non-marked variants from the variants chain, so that they
5453 don't reappear in the IL after free_lang_data. */
5456 {
5459 /* Turn the removed types into distinct types. */
5462 }
5465 {
5467 /* Remove the const and volatile qualifiers from arguments. The
5468 C++ front end removes them, but the C front end does not,
5469 leading to false ODR violation errors when merging two
5470 instances of the same function signature compiled by
5471 different front ends. */
5473 {
5478 {
5480 & ~TYPE_QUAL_CONST
5485 }
5486 /* C++ FE uses TREE_PURPOSE to store initial values. */
5488 }
5489 }
5491 {
5494 {
5495 /* C++ FE uses TREE_PURPOSE to store initial values. */
5498 }
5499 }
5501 {
5502 /* Remove members that are not FIELD_DECLs from the field list
5503 of an aggregate. These occur in C++. */
5507 else
5513 {
5515 /* We need to preserve link to bases and virtual table for all
5516 polymorphic types to make devirtualization machinery working. */
5520 }
5521 }
5525 {
5527 {
5528 /* Type values are used only for C++ ODR checking. Drop them
5529 for all type variants and non-ODR types.
5530 For ODR types the data is freed in free_odr_warning_data. */
5534 else
5535 /* Simplify representation by recording only values rather
5536 than const decls. */
5540 }
5543 }
5552 {
5554 do
5555 {
5557 }
5560 }
5564 }
5567 /* Return true if DECL may need an assembler name to be set. */
5571 {
5572 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5573 Rule merging. This makes type_odr_p to return true on those types during
5574 LTO and by comparing the mangled name, we can say what types are intended
5575 to be equivalent across compilation unit.
5577 We do not store names of type_in_anonymous_namespace_p.
5579 Record, union and enumeration type have linkage that allows use
5580 to check type_in_anonymous_namespace_p. We do not mangle compound types
5581 that always can be compared structurally.
5583 Similarly for builtin types, we compare properties of their main variant.
5584 A special case are integer types where mangling do make differences
5585 between char/signed char/unsigned char etc. Storing name for these makes
5586 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5587 See cp/mangle.c:write_builtin_type for details. */
5590 {
5601 }
5602 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5606 /* If DECL already has its assembler name set, it does not need a
5607 new one. */
5612 /* Abstract decls do not need an assembler name. */
5616 /* For VAR_DECLs, only static, public and external symbols need an
5617 assembler name. */
5625 {
5626 /* Do not set assembler name on builtins. Allow RTL expansion to
5627 decide whether to expand inline or via a regular call. */
5632 /* Functions represented in the callgraph need an assembler name. */
5636 /* Unused and not public functions don't need an assembler name. */
5639 }
5642 }
5645 /* Reset all language specific information still present in symbol
5646 DECL. */
5648 static void
5650 {
5653 /* Give the FE a chance to remove its own data first. */
5667 {
5672 }
5675 {
5677 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5678 the address may be taken in other unit, so this flag has no practical
5679 use for middle-end.
5681 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5682 for public objects that indeed cannot be adressed, but it is not
5683 the case. Set the flag to true so we do not get merge failures for
5684 i.e. virtual tables between units that take address of it and
5685 units that don't. */
5691 {
5694 else
5695 {
5700 }
5701 }
5703 {
5704 tree t;
5706 /* If DECL has a gimple body, then the context for its
5707 arguments must be DECL. Otherwise, it doesn't really
5708 matter, as we will not be emitting any code for DECL. In
5709 general, there may be other instances of DECL created by
5710 the front end and since PARM_DECLs are generally shared,
5711 their DECL_CONTEXT changes as the replicas of DECL are
5712 created. The only time where DECL_CONTEXT is important
5713 is for the FUNCTION_DECLs that have a gimple body (since
5714 the PARM_DECL will be used in the function's body). */
5723 }
5725 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5726 At this point, it is not needed anymore. */
5729 /* Clear the abstract origin if it refers to a method.
5730 Otherwise dwarf2out.c will ICE as we splice functions out of
5731 TYPE_FIELDS and thus the origin will not be output
5732 correctly. */
5735 && RECORD_OR_UNION_TYPE_P
5740 }
5742 {
5743 /* See comment above why we set the flag for functoins. */
5750 }
5752 {
5763 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5764 }
5766 {
5769 }
5773 {
5774 /* Strip builtins from the translation-unit BLOCK. We still have targets
5775 without builtin_decl_explicit support and also builtins are shared
5776 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5779 {
5783 else
5785 }
5786 }
5787 /* We need to keep field decls associated with their trees. Otherwise tree
5788 merging may merge some fileds and keep others disjoint wich in turn will
5789 not do well with TREE_CHAIN pointers linking them.
5791 Also do not drop containing types for virtual methods and tables because
5792 these are needed by devirtualization.
5793 C++ destructors are special because C++ frontends sometimes produces
5794 virtual destructor as an alias of non-virtual destructor. In
5795 devirutalization code we always walk through aliases and we need
5796 context to be preserved too. See PR89335 */
5803 }
5806 /* Operand callback helper for free_lang_data_in_node. *TP is the
5807 subtree operand being considered. */
5809 static tree
5811 {
5818 /* Language specific nodes will be removed, so there is no need
5819 to gather anything under them. */
5821 {
5824 }
5827 {
5828 /* Note that walk_tree does not traverse every possible field in
5829 decls, so we have to do our own traversals here. */
5837 /* We are going to remove everything under DECL_INITIAL for
5838 TYPE_DECLs. No point walking them. */
5846 {
5849 }
5851 {
5856 }
5866 }
5868 {
5869 /* Note that walk_tree does not traverse every possible field in
5870 types, so we have to do our own traversals here. */
5881 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5882 lists, we may look types up in these lists and use them while
5883 optimizing the function body. Thus we need to free lang data
5884 in them. */
5891 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5895 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5896 do not and want not to reach unused variants this way. */
5898 {
5900 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5901 So push that instead. */
5905 }
5909 {
5911 tree tem;
5916 }
5918 {
5919 tree tem;
5920 /* Push all TYPE_FIELDS - there can be interleaving interesting
5921 and non-interesting things. */
5924 {
5928 }
5929 }
5935 }
5937 {
5939 {
5942 {
5946 }
5947 else
5948 {
5951 }
5952 }
5956 }
5963 }
5966 /* Find decls and types in T. */
5968 static void
5970 {
5972 {
5978 }
5979 }
5981 /* Translate all the types in LIST with the corresponding runtime
5982 types. */
5984 static tree
5986 {
5996 {
6001 }
6004 }
6007 /* Find decls and types referenced in EH region R and store them in
6008 FLD->DECLS and FLD->TYPES. */
6010 static void
6012 {
6014 {
6019 {
6020 eh_catch c;
6022 /* The types referenced in each catch must first be changed to the
6023 EH types used at runtime. This removes references to FE types
6024 in the region. */
6026 {
6029 }
6030 }
6043 }
6044 }
6047 /* Find decls and types referenced in cgraph node N and store them in
6048 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6049 look for *every* kind of DECL and TYPE node reachable from N,
6050 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6051 NAMESPACE_DECLs, etc). */
6053 static void
6055 {
6056 basic_block bb;
6059 tree t;
6070 /* Traverse locals. */
6074 /* Traverse EH regions in FN. */
6075 {
6076 eh_region r;
6079 }
6081 /* Traverse every statement in FN. */
6083 {
6084 gphi_iterator psi;
6085 gimple_stmt_iterator si;
6089 {
6093 {
6096 }
6097 }
6100 {
6107 {
6110 }
6111 }
6112 }
6113 }
6116 /* Find decls and types referenced in varpool node N and store them in
6117 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6118 look for *every* kind of DECL and TYPE node reachable from N,
6119 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6120 NAMESPACE_DECLs, etc). */
6122 static void
6124 {
6126 }
6128 /* If T needs an assembler name, have one created for it. */
6130 void
6132 {
6134 {
6135 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6136 diagnostics that use input_location to show locus
6137 information. The problem here is that, at this point,
6138 input_location is generally anchored to the end of the file
6139 (since the parser is long gone), so we don't have a good
6140 position to pin it to.
6142 To alleviate this problem, this uses the location of T's
6143 declaration. Examples of this are
6144 testsuite/g++.dg/template/cond2.C and
6145 testsuite/g++.dg/template/pr35240.C. */
6152 }
6153 }
6156 /* Free language specific information for every operand and expression
6157 in every node of the call graph. This process operates in three stages:
6159 1- Every callgraph node and varpool node is traversed looking for
6160 decls and types embedded in them. This is a more exhaustive
6161 search than that done by find_referenced_vars, because it will
6162 also collect individual fields, decls embedded in types, etc.
6164 2- All the decls found are sent to free_lang_data_in_decl.
6166 3- All the types found are sent to free_lang_data_in_type.
6168 The ordering between decls and types is important because
6169 free_lang_data_in_decl sets assembler names, which includes
6170 mangling. So types cannot be freed up until assembler names have
6171 been set up. */
6173 static void
6175 {
6178 tree t;
6182 /* Find decls and types in the body of every function in the callgraph. */
6189 /* Find decls and types in every varpool symbol. */
6193 /* Set the assembler name on every decl found. We need to do this
6194 now because free_lang_data_in_decl will invalidate data needed
6195 for mangling. This breaks mangling on interdependent decls. */
6199 /* Traverse every decl found freeing its language data. */
6203 /* Traverse every type found freeing its language data. */
6206 }
6209 /* Free resources that are used by FE but are not needed once they are done. */
6211 static unsigned
6213 {
6217 /* If we are the LTO frontend we have freed lang-specific data already. */
6220 {
6221 /* Rebuild type inheritance graph even when not doing LTO to get
6222 consistent profile data. */
6225 }
6230 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6234 /* Allocate and assign alias sets to the standard integer types
6235 while the slots are still in the way the frontends generated them. */
6240 /* Traverse the IL resetting language specific information for
6241 operands, expressions, etc. */
6244 /* Create gimple variants for common types. */
6250 /* Reset some langhooks. Do not reset types_compatible_p, it may
6251 still be used indirectly via the get_alias_set langhook. */
6264 {
6266 tree t;
6270 }
6272 /* We do not want the default decl_assembler_name implementation,
6273 rather if we have fixed everything we want a wrapper around it
6274 asserting that all non-local symbols already got their assembler
6275 name and only produce assembler names for local symbols. Or rather
6276 make sure we never call decl_assembler_name on local symbols and
6277 devise a separate, middle-end private scheme for it. */
6279 /* Reset diagnostic machinery. */
6288 }
6294 {
6304 };
6307 {
6311 {}
6313 /* opt_pass methods: */
6320 simple_ipa_opt_pass *
6322 {
6324 }
6325 \f
6326 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6327 of the various TYPE_QUAL values. */
6329 static void
6331 {
6337 }
6339 /* Returns true iff CAND and BASE have equivalent language-specific
6340 qualifiers. */
6342 bool
6344 {
6347 /* type_hash_eq currently only applies to these types. */
6352 }
6354 /* This function checks to see if TYPE matches the size one of the built-in
6355 atomic types, and returns that core atomic type. */
6357 static tree
6359 {
6360 tree base_atomic_type;
6362 /* Only handle complete types. */
6367 {
6390 }
6393 }
6395 /* Returns true iff unqualified CAND and BASE are equivalent. */
6397 bool
6399 {
6401 /* Apparently this is needed for Objective-C. */
6406 /* Check alignment. */
6409 /* Atomic types increase minimal alignment. We must to do so as well
6410 or we get duplicated canonical types. See PR88686. */
6412 {
6413 /* See if this object can map to a basic atomic type. */
6417 }
6419 }
6421 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6423 bool
6425 {
6429 }
6431 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6433 static bool
6435 {
6438 /* Apparently this is needed for Objective-C. */
6440 /* Check alignment. */
6445 }
6447 /* Return a version of the TYPE, qualified as indicated by the
6448 TYPE_QUALS, if one exists. If no qualified version exists yet,
6449 return NULL_TREE. */
6451 tree
6453 {
6461 /* Search the chain of variants to see if there is already one there just
6462 like the one we need to have. If so, use that existing one. We must
6463 preserve the TYPE_NAME, since there is code that depends on this. */
6466 {
6467 /* Put the found variant at the head of the variant list so
6468 frequently searched variants get found faster. The C++ FE
6469 benefits greatly from this. */
6475 }
6478 }
6480 /* Like get_qualified_type, but creates the type if it does not
6481 exist. This function never returns NULL_TREE. */
6483 tree
6485 {
6486 tree t;
6488 /* See if we already have the appropriate qualified variant. */
6491 /* If not, build it. */
6493 {
6498 {
6499 /* See if this object can map to a basic atomic type. */
6502 {
6503 /* Ensure the alignment of this type is compatible with
6504 the required alignment of the atomic type. */
6507 }
6508 }
6511 /* Propagate structural equality. */
6514 /* Build the underlying canonical type, since it is different
6515 from TYPE. */
6516 {
6519 }
6520 else
6521 /* T is its own canonical type. */
6524 }
6527 }
6529 /* Create a variant of type T with alignment ALIGN. */
6531 tree
6533 {
6534 tree t;
6549 }
6551 /* Create a new distinct copy of TYPE. The new type is made its own
6552 MAIN_VARIANT. If TYPE requires structural equality checks, the
6553 resulting type requires structural equality checks; otherwise, its
6554 TYPE_CANONICAL points to itself. */
6556 tree
6558 {
6564 /* Set the canonical type either to a new equivalence class, or
6565 propagate the need for structural equality checks. */
6568 else
6571 /* Make it its own variant. */
6575 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6576 whose TREE_TYPE is not t. This can also happen in the Ada
6577 frontend when using subtypes. */
6580 }
6582 /* Create a new variant of TYPE, equivalent but distinct. This is so
6583 the caller can modify it. TYPE_CANONICAL for the return type will
6584 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6585 are considered equal by the language itself (or that both types
6586 require structural equality checks). */
6588 tree
6590 {
6595 /* Since we're building a variant, assume that it is a non-semantic
6596 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6598 /* Type variants have no alias set defined. */
6601 /* Add the new type to the chain of variants of TYPE. */
6607 }
6608 \f
6609 /* Return true if the from tree in both tree maps are equal. */
6611 int
6613 {
6617 }
6619 /* Hash a from tree in a tree_base_map. */
6621 unsigned int
6623 {
6625 }
6627 /* Return true if this tree map structure is marked for garbage collection
6628 purposes. We simply return true if the from tree is marked, so that this
6629 structure goes away when the from tree goes away. */
6631 int
6633 {
6635 }
6637 /* Hash a from tree in a tree_map. */
6639 unsigned int
6641 {
6643 }
6645 /* Hash a from tree in a tree_decl_map. */
6647 unsigned int
6649 {
6651 }
6653 /* Return the initialization priority for DECL. */
6655 priority_type
6657 {
6662 return
6664 }
6666 /* Return the finalization priority for DECL. */
6668 priority_type
6670 {
6675 return
6677 }
6679 /* Set the initialization priority for DECL to PRIORITY. */
6681 void
6683 {
6687 {
6691 }
6694 else
6697 }
6699 /* Set the finalization priority for DECL to PRIORITY. */
6701 void
6703 {
6707 {
6711 }
6712 else
6715 }
6717 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6719 static void
6721 {
6726 }
6728 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6730 static void
6732 {
6737 }
6739 /* Lookup a debug expression for FROM, and return it if we find one. */
6741 tree
6743 {
6751 }
6753 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6755 void
6757 {
6764 }
6766 /* Lookup a value expression for FROM, and return it if we find one. */
6768 tree
6770 {
6778 }
6780 /* Insert a mapping FROM->TO in the value expression hashtable. */
6782 void
6784 {
6791 }
6793 /* Lookup a vector of debug arguments for FROM, and return it if we
6794 find one. */
6798 {
6809 }
6811 /* Insert a mapping FROM->empty vector of debug arguments in the value
6812 expression hashtable. */
6816 {
6831 }
6833 /* Hashing of types so that we don't make duplicates.
6834 The entry point is `type_hash_canon'. */
6836 /* Generate the default hash code for TYPE. This is designed for
6837 speed, rather than maximum entropy. */
6839 hashval_t
6841 {
6850 /* Just the identifier is adequate to distinguish. */
6854 {
6857 /* FALLTHROUGH. */
6869 {
6873 {
6876 }
6877 }
6881 {
6888 }
6892 {
6896 }
6904 }
6907 }
6909 /* These are the Hashtable callback functions. */
6911 /* Returns true iff the types are equivalent. */
6913 bool
6915 {
6916 /* First test the things that are the same for all types. */
6926 /* Be careful about comparing arrays before and after the element type
6927 has been completed; don't compare TYPE_ALIGN unless both types are
6928 complete. */
6935 {
6957 /* fall through */
6989 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6990 where the flag should be inherited from the element type
6991 and can change after ARRAY_TYPEs are created; on non-aggregates
6992 compare it and hash it, scalars will never have that flag set
6993 and we need to differentiate between arrays created by different
6994 front-ends or middle-end created arrays. */
7024 }
7030 }
7032 /* Given TYPE, and HASHCODE its hash code, return the canonical
7033 object for an identical type if one already exists.
7034 Otherwise, return TYPE, and record it as the canonical object.
7036 To use this function, first create a type of the sort you want.
7037 Then compute its hash code from the fields of the type that
7038 make it different from other similar types.
7039 Then call this function and use the value. */
7041 tree
7043 {
7044 type_hash in;
7047 /* The hash table only contains main variants, so ensure that's what we're
7048 being passed. */
7051 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7052 must call that routine before comparing TYPE_ALIGNs. */
7060 {
7066 /* Free also min/max values and the cache for integer
7067 types. This can't be done in free_node, as LTO frees
7068 those on its own. */
7070 {
7073 {
7074 /* Zero is always in TYPE_CACHED_VALUES. */
7078 }
7081 {
7084 }
7087 }
7090 }
7091 else
7092 {
7101 }
7102 }
7104 static void
7106 {
7111 }
7113 /* Given two lists of types
7114 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7115 return 1 if the lists contain the same types in the same order.
7116 Also, the TREE_PURPOSEs must match. */
7118 bool
7120 {
7132 }
7134 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7135 given by TYPE. If the argument list accepts variable arguments,
7136 then this function counts only the ordinary arguments. */
7138 int
7140 {
7144 /* If the function does not take a variable number of arguments,
7145 the last element in the list will have type `void'. */
7148 else
7152 }
7154 /* Return the type of the function TYPE's argument ARGNO if known.
7155 For vararg function's where ARGNO refers to one of the variadic
7156 arguments return null. Otherwise, return a void_type_node for
7157 out-of-bounds ARGNO. */
7159 tree
7161 {
7162 /* Treat zero the same as an out-of-bounds argument number. */
7166 function_args_iterator iter;
7168 tree argtype;
7171 {
7172 /* A vararg function's argument list ends in a null. Otherwise,
7173 an ordinary function's argument list ends with void. Return
7174 null if ARGNO refers to a vararg argument, void_type_node if
7175 it's out of bounds, and the formal argument type otherwise. */
7183 }
7186 }
7188 /* Nonzero if integer constants T1 and T2
7189 represent the same constant value. */
7191 int
7193 {
7209 }
7211 /* Return true if T is an INTEGER_CST whose numerical value (extended
7212 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7214 bool
7216 {
7220 }
7222 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7223 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7225 bool
7227 {
7231 {
7236 }
7239 }
7241 /* Return true if T is an INTEGER_CST whose numerical value (extended
7242 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7244 bool
7246 {
7250 }
7252 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7253 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7255 bool
7257 {
7261 {
7266 }
7269 }
7271 /* T is an INTEGER_CST whose numerical value (extended according to
7272 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7273 HOST_WIDE_INT. */
7275 HOST_WIDE_INT
7277 {
7280 }
7282 /* T is an INTEGER_CST whose numerical value (extended according to
7283 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7284 HOST_WIDE_INT. */
7286 unsigned HOST_WIDE_INT
7288 {
7291 }
7293 /* Return the most significant (sign) bit of T. */
7295 int
7297 {
7301 }
7303 /* Return an indication of the sign of the integer constant T.
7304 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7305 Note that -1 will never be returned if T's type is unsigned. */
7307 int
7309 {
7316 else
7318 }
7320 /* Return the minimum number of bits needed to represent VALUE in a
7321 signed or unsigned type, UNSIGNEDP says which. */
7323 unsigned int
7325 {
7326 /* If the value is negative, compute its negative minus 1. The latter
7327 adjustment is because the absolute value of the largest negative value
7328 is one larger than the largest positive value. This is equivalent to
7329 a bit-wise negation, so use that operation instead. */
7334 /* Return the number of bits needed, taking into account the fact
7335 that we need one more bit for a signed than unsigned type.
7336 If value is 0 or -1, the minimum precision is 1 no matter
7337 whether unsignedp is true or false. */
7341 else
7343 }
7345 /* Return truthvalue of whether T1 is the same tree structure as T2.
7346 Return 1 if they are the same.
7347 Return 0 if they are understandably different.
7348 Return -1 if either contains tree structure not understood by
7349 this function. */
7351 int
7353 {
7363 /* For location wrappers to be the same, they must be at the same
7364 source location (and wrap the same thing). */
7366 {
7370 }
7376 {
7380 else
7382 }
7392 {
7408 {
7417 /* ??? Should we handle also fields here? */
7421 }
7432 {
7440 {
7444 }
7446 }
7449 /* Special case: if either target is an unallocated VAR_DECL,
7450 it means that it's going to be unified with whatever the
7451 TARGET_EXPR is really supposed to initialize, so treat it
7452 as being equivalent to anything. */
7460 else
7489 /* A false return means maybe_ne rather than known_ne. */
7495 }
7497 /* This general rule works for most tree codes. All exceptions should be
7498 handled above. If this is a language-specific tree code, we can't
7499 trust what might be in the operand, so say we don't know
7500 the situation. */
7505 {
7514 {
7518 }
7524 }
7525 }
7527 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7528 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7529 than U, respectively. */
7531 int
7533 {
7542 else
7544 }
7546 /* Return true if SIZE represents a constant size that is in bounds of
7547 what the middle-end and the backend accepts (covering not more than
7548 half of the address-space).
7549 When PERR is non-null, set *PERR on failure to the description of
7550 why SIZE is not valid. */
7552 bool
7554 {
7556 {
7563 }
7565 cst_size_error error;
7570 {
7573 }
7576 {
7579 }
7582 {
7585 }
7589 {
7592 }
7595 }
7597 /* Return the precision of the type, or for a complex or vector type the
7598 precision of the type of its elements. */
7600 unsigned int
7602 {
7610 }
7612 /* Return true if CODE represents an associative tree code. Otherwise
7613 return false. */
7614 bool
7616 {
7618 {
7630 }
7632 }
7634 /* Return true if CODE represents a commutative tree code. Otherwise
7635 return false. */
7636 bool
7638 {
7640 {
7667 }
7669 }
7671 /* Return true if CODE represents a ternary tree code for which the
7672 first two operands are commutative. Otherwise return false. */
7673 bool
7675 {
7677 {
7685 }
7687 }
7689 /* Returns true if CODE can overflow. */
7691 bool
7693 {
7695 {
7700 /* Can overflow in various ways. */
7706 /* For INT_MIN / -1. */
7710 /* For -INT_MIN. */
7713 /* These operators cannot overflow. */
7715 }
7716 }
7718 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7719 ftrapv doesn't generate trapping insns for CODE. */
7721 bool
7723 {
7726 /* We don't generate instructions that trap on overflow for complex or vector
7727 types. */
7735 {
7741 /* These operators can overflow, and -ftrapv generates trapping code for
7742 these. */
7749 /* These operators can overflow, but -ftrapv does not generate trapping
7750 code for these. */
7753 /* These operators cannot overflow. */
7755 }
7756 }
7758 namespace inchash
7759 {
7761 /* Generate a hash value for an expression. This can be used iteratively
7762 by passing a previous result as the HSTATE argument.
7764 This function is intended to produce the same hash for expressions which
7765 would compare equal using operand_equal_p. */
7766 void
7768 {
7774 {
7777 }
7787 {
7788 /* Alas, constants aren't shared, so we can't rely on pointer
7789 identity. */
7799 {
7803 else
7807 }
7809 {
7813 }
7823 {
7830 }
7832 /* We can just compare by pointer. */
7836 /* The node itself doesn't matter. */
7840 /* Ignore. */
7843 /* A list of expressions, for a CALL_EXPR or as the elements of a
7844 VECTOR_CST. */
7849 {
7854 {
7857 }
7859 }
7861 {
7862 tree_stmt_iterator i;
7867 }
7876 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7877 Otherwise nodes that compare equal according to operand_equal_p might
7878 get different hash codes. However, don't do this for machine specific
7879 or front end builtins, since the function code is overloaded in those
7880 cases. */
7883 {
7886 }
7887 /* FALL THROUGH */
7890 {
7894 }
7898 {
7899 /* DECL's have a unique ID */
7901 }
7903 {
7904 /* For comparisons that can be swapped, use the lower
7905 tree code. */
7912 }
7914 {
7915 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7916 operand_equal_p. */
7920 /* Don't hash the type, that can lead to having nodes which
7921 compare equal according to operand_equal_p, but which
7922 have different hash codes. Make sure to include signedness
7923 in the hash computation. */
7926 }
7927 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7935 /* Don't ICE on FE specific trees, or their arguments etc.
7936 during operand_equal_p hash verification. */
7939 else
7940 {
7946 {
7973 {
7974 /* The multiplication operands are commutative. */
7981 }
7989 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7990 Usually different TARGET_EXPRs just should use
7991 different temporaries in their slots. */
7997 }
7999 /* Don't hash the type, that can lead to having nodes which
8000 compare equal according to operand_equal_p, but which
8001 have different hash codes. */
8003 {
8004 /* Make sure to include signness in the hash computation. */
8007 }
8010 {
8011 /* It's a commutative expression. We want to hash it the same
8012 however it appears. We do this by first hashing both operands
8013 and then rehashing based on the order of their independent
8014 hashes. */
8019 }
8020 else
8024 }
8026 }
8027 }
8029 }
8031 /* Constructors for pointer, array and function types.
8032 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8033 constructed by language-dependent code, not here.) */
8035 /* Construct, lay out and return the type of pointers to TO_TYPE with
8036 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8037 reference all of memory. If such a type has already been
8038 constructed, reuse it. */
8040 tree
8043 {
8044 tree t;
8050 /* If the pointed-to type has the may_alias attribute set, force
8051 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8055 /* In some cases, languages will have things that aren't a POINTER_TYPE
8056 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8057 In that case, return that type without regard to the rest of our
8058 operands.
8060 ??? This is a kludge, but consistent with the way this function has
8061 always operated and there doesn't seem to be a good way to avoid this
8062 at the moment. */
8067 /* First, if we already have a type for pointers to TO_TYPE and it's
8068 the proper mode, use it. */
8081 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8089 /* Lay out the type. This function has many callers that are concerned
8090 with expression-construction, and this simplifies them all. */
8094 }
8096 /* By default build pointers in ptr_mode. */
8098 tree
8100 {
8105 }
8107 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8109 tree
8112 {
8113 tree t;
8119 /* If the pointed-to type has the may_alias attribute set, force
8120 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8124 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8125 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8126 In that case, return that type without regard to the rest of our
8127 operands.
8129 ??? This is a kludge, but consistent with the way this function has
8130 always operated and there doesn't seem to be a good way to avoid this
8131 at the moment. */
8136 /* First, if we already have a type for pointers to TO_TYPE and it's
8137 the proper mode, use it. */
8150 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8161 }
8164 /* Build the node for the type of references-to-TO_TYPE by default
8165 in ptr_mode. */
8167 tree
8169 {
8174 }
8176 #define MAX_INT_CACHED_PREC \
8177 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8180 /* Builds a signed or unsigned integer type of precision PRECISION.
8181 Used for C bitfields whose precision does not match that of
8182 built-in target types. */
8183 tree
8186 {
8193 {
8197 }
8204 else
8216 }
8218 #define MAX_BOOL_CACHED_PREC \
8219 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8222 /* Builds a boolean type of precision PRECISION.
8223 Used for boolean vectors to choose proper vector element size. */
8224 tree
8226 {
8227 tree type;
8230 {
8234 }
8244 }
8246 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8247 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8248 is true, reuse such a type that has already been constructed. */
8250 static tree
8252 {
8275 {
8276 /* Since we cannot reliably merge this type, we need to compare it using
8277 structural equality checks. */
8280 }
8286 }
8288 /* Wrapper around build_range_type_1 with SHARED set to true. */
8290 tree
8292 {
8294 }
8296 /* Wrapper around build_range_type_1 with SHARED set to false. */
8298 tree
8300 {
8302 }
8304 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8305 MAXVAL should be the maximum value in the domain
8306 (one less than the length of the array).
8308 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8309 We don't enforce this limit, that is up to caller (e.g. language front end).
8310 The limit exists because the result is a signed type and we don't handle
8311 sizes that use more than one HOST_WIDE_INT. */
8313 tree
8315 {
8317 }
8319 /* Return true if the debug information for TYPE, a subtype, should be emitted
8320 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8321 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8322 debug info and doesn't reflect the source code. */
8324 bool
8326 {
8329 /* Subrange types have a base type which is an integral type. */
8333 /* Get the real bounds of the subtype. */
8336 else
8337 {
8340 }
8342 /* If the type and its base type have the same representation and the same
8343 name, then the type is not a subrange but a copy of the base type. */
8357 }
8359 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8360 and number of elements specified by the range of values of INDEX_TYPE.
8361 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8362 If SHARED is true, reuse such a type that has already been constructed. */
8364 static tree
8367 {
8368 tree t;
8371 {
8374 }
8383 /* If the element type is incomplete at this point we get marked for
8384 structural equality. Do not record these types in the canonical
8385 type hashtable. */
8390 {
8393 }
8396 {
8405 index_type
8408 }
8411 }
8413 /* Wrapper around build_array_type_1 with SHARED set to true. */
8415 tree
8417 {
8419 }
8421 /* Wrapper around build_array_type_1 with SHARED set to false. */
8423 tree
8425 {
8427 }
8429 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8430 sizetype. */
8432 tree
8434 {
8436 }
8438 /* Recursively examines the array elements of TYPE, until a non-array
8439 element type is found. */
8441 tree
8443 {
8448 }
8450 /* Computes the canonical argument types from the argument type list
8451 ARGTYPES.
8453 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8454 on entry to this function, or if any of the ARGTYPES are
8455 structural.
8457 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8458 true on entry to this function, or if any of the ARGTYPES are
8459 non-canonical.
8461 Returns a canonical argument list, which may be ARGTYPES when the
8462 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8463 true) or would not differ from ARGTYPES. */
8465 static tree
8469 {
8470 tree arg;
8474 {
8476 /* Fail gracefully by stating that the type is structural. */
8482 /* If the argument has a default argument, we consider it
8483 non-canonical even though the type itself is canonical.
8484 That way, different variants of function and method types
8485 with default arguments will all point to the variant with
8486 no defaults as their canonical type. */
8488 }
8494 {
8495 /* Build the canonical list of argument types. */
8500 {
8503 else
8506 canon_argtypes);
8507 }
8513 /* There is a non-canonical type. */
8516 }
8518 /* The canonical argument types are the same as ARGTYPES. */
8520 }
8522 /* Construct, lay out and return
8523 the type of functions returning type VALUE_TYPE
8524 given arguments of types ARG_TYPES.
8525 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8526 are data type nodes for the arguments of the function.
8527 If such a type has already been constructed, reuse it. */
8529 tree
8531 {
8532 tree t;
8535 tree canon_argtypes;
8540 {
8543 }
8545 /* Make a node of the sort we want. */
8550 /* If we already have such a type, use the old one. */
8554 /* Set up the canonical type. */
8564 canon_argtypes);
8569 }
8571 /* Build a function type. The RETURN_TYPE is the type returned by the
8572 function. If VAARGS is set, no void_type_node is appended to the
8573 list. ARGP must be always be terminated be a NULL_TREE. */
8575 static tree
8577 {
8585 {
8590 }
8593 else
8594 {
8598 }
8602 }
8604 /* Build a function type. The RETURN_TYPE is the type returned by the
8605 function. If additional arguments are provided, they are
8606 additional argument types. The list of argument types must always
8607 be terminated by NULL_TREE. */
8609 tree
8611 {
8612 tree args;
8619 }
8621 /* Build a variable argument function type. The RETURN_TYPE is the
8622 type returned by the function. If additional arguments are provided,
8623 they are additional argument types. The list of argument types must
8624 always be terminated by NULL_TREE. */
8626 tree
8628 {
8629 tree args;
8637 }
8639 /* Build a function type. RETURN_TYPE is the type returned by the
8640 function; VAARGS indicates whether the function takes varargs. The
8641 function takes N named arguments, the types of which are provided in
8642 ARG_TYPES. */
8644 static tree
8647 {
8655 }
8657 /* Build a function type. RETURN_TYPE is the type returned by the
8658 function. The function takes N named arguments, the types of which
8659 are provided in ARG_TYPES. */
8661 tree
8663 {
8665 }
8667 /* Build a variable argument function type. RETURN_TYPE is the type
8668 returned by the function. The function takes N named arguments, the
8669 types of which are provided in ARG_TYPES. */
8671 tree
8673 {
8675 }
8677 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8678 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8679 for the method. An implicit additional parameter (of type
8680 pointer-to-BASETYPE) is added to the ARGTYPES. */
8682 tree
8684 tree rettype,
8685 tree argtypes)
8686 {
8687 tree t;
8688 tree ptype;
8690 tree canon_argtypes;
8692 /* Make a node of the sort we want. */
8699 /* The actual arglist for this function includes a "hidden" argument
8700 which is "this". Put it into the list of argument types. */
8704 /* If we already have such a type, use the old one. */
8708 /* Set up the canonical type. */
8709 any_structural_p
8712 any_noncanonical_p
8724 canon_argtypes);
8729 }
8731 /* Construct, lay out and return the type of methods belonging to class
8732 BASETYPE and whose arguments and values are described by TYPE.
8733 If that type exists already, reuse it.
8734 TYPE must be a FUNCTION_TYPE node. */
8736 tree
8738 {
8744 }
8746 /* Construct, lay out and return the type of offsets to a value
8747 of type TYPE, within an object of type BASETYPE.
8748 If a suitable offset type exists already, reuse it. */
8750 tree
8752 {
8753 tree t;
8755 /* Make a node of the sort we want. */
8761 /* If we already have such a type, use the old one. */
8769 {
8778 }
8781 }
8783 /* Create a complex type whose components are COMPONENT_TYPE.
8785 If NAMED is true, the type is given a TYPE_NAME. We do not always
8786 do so because this creates a DECL node and thus make the DECL_UIDs
8787 dependent on the type canonicalization hashtable, which is GC-ed,
8788 so the DECL_UIDs would not be stable wrt garbage collection. */
8790 tree
8792 {
8797 /* Make a node of the sort we want. */
8802 /* If we already have such a type, use the old one. */
8807 {
8808 /* We created a new type. The hash insertion will have laid
8809 out the type. We need to check the canonicalization and
8810 maybe set the name. */
8821 /* We need to create a name, since complex is a fundamental type. */
8823 {
8852 }
8853 }
8856 }
8858 /* If TYPE is a real or complex floating-point type and the target
8859 does not directly support arithmetic on TYPE then return the wider
8860 type to be used for arithmetic on TYPE. Otherwise, return
8861 NULL_TREE. */
8863 tree
8865 {
8866 /* The target can give two different responses to the question of
8867 which excess precision mode it would like depending on whether we
8868 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8870 enum excess_precision_type requested_type
8872 ? EXCESS_PRECISION_TYPE_FAST
8875 enum flt_eval_method target_flt_eval_method
8878 /* The target should not ask for unpredictable float evaluation (though
8879 it might advertise that implicitly the evaluation is unpredictable,
8880 but we don't care about that here, it will have been reported
8881 elsewhere). If it does ask for unpredictable evaluation, we have
8882 nothing to do here. */
8885 /* Nothing to do. The target has asked for all types we know about
8886 to be computed with their native precision and range. */
8890 /* The target will promote this type in a target-dependent way, so excess
8891 precision ought to leave it alone. */
8895 machine_mode float16_type_mode = (float16_type_node
8902 {
8904 {
8907 {
8925 }
8927 }
8929 {
8934 {
8952 }
8954 }
8957 }
8960 }
8961 \f
8962 /* Return OP, stripped of any conversions to wider types as much as is safe.
8963 Converting the value back to OP's type makes a value equivalent to OP.
8965 If FOR_TYPE is nonzero, we return a value which, if converted to
8966 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8968 OP must have integer, real or enumeral type. Pointers are not allowed!
8970 There are some cases where the obvious value we could return
8971 would regenerate to OP if converted to OP's type,
8972 but would not extend like OP to wider types.
8973 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8974 For example, if OP is (unsigned short)(signed char)-1,
8975 we avoid returning (signed char)-1 if FOR_TYPE is int,
8976 even though extending that to an unsigned short would regenerate OP,
8977 since the result of extending (signed char)-1 to (int)
8978 is different from (int) OP. */
8980 tree
8982 {
8983 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8985 unsigned final_prec
8987 int uns
8994 {
8997 /* TYPE_PRECISION on vector types has different meaning
8998 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8999 so avoid them here. */
9006 /* Truncations are many-one so cannot be removed.
9007 Unless we are later going to truncate down even farther. */
9012 /* See what's inside this conversion. If we decide to strip it,
9013 we will set WIN. */
9016 /* If we have not stripped any zero-extensions (uns is 0),
9017 we can strip any kind of extension.
9018 If we have previously stripped a zero-extension,
9019 only zero-extensions can safely be stripped.
9020 Any extension can be stripped if the bits it would produce
9021 are all going to be discarded later by truncating to FOR_TYPE. */
9024 {
9027 /* TYPE_UNSIGNED says whether this is a zero-extension.
9028 Let's avoid computing it if it does not affect WIN
9029 and if UNS will not be needed again. */
9033 {
9036 }
9037 }
9038 }
9040 /* If we finally reach a constant see if it fits in sth smaller and
9041 in that case convert it. */
9043 {
9049 {
9053 }
9054 }
9057 }
9058 \f
9059 /* Return OP or a simpler expression for a narrower value
9060 which can be sign-extended or zero-extended to give back OP.
9061 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
9062 or 0 if the value should be sign-extended. */
9064 tree
9066 {
9073 {
9074 int bitschange
9078 /* Truncations are many-one so cannot be removed. */
9082 /* See what's inside this conversion. If we decide to strip it,
9083 we will set WIN. */
9086 {
9088 /* An extension: the outermost one can be stripped,
9089 but remember whether it is zero or sign extension. */
9092 /* Otherwise, if a sign extension has been stripped,
9093 only sign extensions can now be stripped;
9094 if a zero extension has been stripped, only zero-extensions. */
9098 }
9100 {
9101 /* A change in nominal type can always be stripped, but we must
9102 preserve the unsignedness. */
9107 /* Keep trying to narrow, but don't assign op to win if it
9108 would turn an integral type into something else. */
9111 }
9114 }
9117 /* Since type_for_size always gives an integer type. */
9120 /* Ensure field is laid out already. */
9123 {
9124 unsigned HOST_WIDE_INT innerprec
9130 /* We can get this structure field in a narrower type that fits it,
9131 but the resulting extension to its nominal type (a fullword type)
9132 must satisfy the same conditions as for other extensions.
9134 Do this only for fields that are aligned (not bit-fields),
9135 because when bit-field insns will be used there is no
9136 advantage in doing this. */
9142 {
9146 }
9147 }
9151 }
9152 \f
9153 /* Return true if integer constant C has a value that is permissible
9154 for TYPE, an integral type. */
9156 bool
9158 {
9163 /* Non-standard boolean types can have arbitrary precision but various
9164 transformations assume that they can only take values 0 and +/-1. */
9168 retry:
9172 /* If at least one bound of the type is a constant integer, we can check
9173 ourselves and maybe make a decision. If no such decision is possible, but
9174 this type is a subtype, try checking against that. Otherwise, use
9175 fits_to_tree_p, which checks against the precision.
9177 Compute the status for each possibly constant bound, and return if we see
9178 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9179 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9180 for "constant known to fit". */
9182 /* Check if c >= type_low_bound. */
9184 {
9188 }
9189 else
9192 /* Check if c <= type_high_bound. */
9194 {
9198 }
9199 else
9202 /* If the constant fits both bounds, the result is known. */
9206 /* Perform some generic filtering which may allow making a decision
9207 even if the bounds are not constant. First, negative integers
9208 never fit in unsigned types, */
9212 /* Second, narrower types always fit in wider ones. */
9216 /* Third, unsigned integers with top bit set never fit signed types. */
9218 {
9221 {
9222 /* When a tree_cst is converted to a wide-int, the precision
9223 is taken from the type. However, if the precision of the
9224 mode underneath the type is smaller than that, it is
9225 possible that the value will not fit. The test below
9226 fails if any bit is set between the sign bit of the
9227 underlying mode and the top bit of the type. */
9230 }
9233 }
9235 /* If we haven't been able to decide at this point, there nothing more we
9236 can check ourselves here. Look at the base type if we have one and it
9237 has the same precision. */
9241 {
9244 }
9246 /* Or to fits_to_tree_p, if nothing else. */
9248 }
9250 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9251 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9252 represented (assuming two's-complement arithmetic) within the bit
9253 precision of the type are returned instead. */
9255 void
9257 {
9261 else
9262 {
9265 else
9266 {
9269 }
9270 }
9275 else
9276 {
9279 }
9280 }
9282 /* Return true if VAR is an automatic variable. */
9284 bool
9286 {
9291 }
9293 /* Return true if VAR is an automatic variable defined in function FN. */
9295 bool
9297 {
9301 }
9303 /* Subprogram of following function. Called by walk_tree.
9305 Return *TP if it is an automatic variable or parameter of the
9306 function passed in as DATA. */
9308 static tree
9310 {
9321 }
9323 /* Returns true if T is, contains, or refers to a type with variable
9324 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9325 arguments, but not the return type. If FN is nonzero, only return
9326 true if a modifier of the type or position of FN is a variable or
9327 parameter inside FN.
9329 This concept is more general than that of C99 'variably modified types':
9330 in C99, a struct type is never variably modified because a VLA may not
9331 appear as a structure member. However, in GNU C code like:
9333 struct S { int i[f()]; };
9335 is valid, and other languages may define similar constructs. */
9337 bool
9339 {
9340 tree t;
9342 /* Test if T is either variable (if FN is zero) or an expression containing
9343 a variable in FN. If TYPE isn't gimplified, return true also if
9344 gimplify_one_sizepos would gimplify the expression into a local
9345 variable. */
9346 #define RETURN_TRUE_IF_VAR(T) \
9347 do { tree _t = (T); \
9348 if (_t != NULL_TREE \
9349 && _t != error_mark_node \
9350 && !CONSTANT_CLASS_P (_t) \
9351 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9352 && (!fn \
9353 || (!TYPE_SIZES_GIMPLIFIED (type) \
9354 && (TREE_CODE (_t) != VAR_DECL \
9355 && !CONTAINS_PLACEHOLDER_P (_t))) \
9356 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9357 return true; } while (0)
9362 /* If TYPE itself has variable size, it is variably modified. */
9367 {
9371 /* Ada can have pointer types refering to themselves indirectly. */
9376 {
9379 }
9385 /* If TYPE is a function type, it is variably modified if the
9386 return type is variably modified. */
9396 /* Scalar types are variably modified if their end points
9397 aren't constant. */
9405 /* We can't see if any of the fields are variably-modified by the
9406 definition we normally use, since that would produce infinite
9407 recursion via pointers. */
9408 /* This is variably modified if some field's type is. */
9411 {
9418 }
9422 /* Do not call ourselves to avoid infinite recursion. This is
9423 variably modified if the element type is. */
9430 }
9432 /* The current language may have other cases to check, but in general,
9433 all other types are not variably modified. */
9436 #undef RETURN_TRUE_IF_VAR
9437 }
9439 /* Given a DECL or TYPE, return the scope in which it was declared, or
9440 NULL_TREE if there is no containing scope. */
9442 tree
9444 {
9446 }
9448 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9450 const_tree
9452 {
9454 {
9457 else
9459 }
9461 }
9463 /* Return the innermost context enclosing DECL that is
9464 a FUNCTION_DECL, or zero if none. */
9466 tree
9468 {
9469 tree context;
9474 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9475 where we look up the function at runtime. Such functions always take
9476 a first argument of type 'pointer to real context'.
9478 C++ should really be fixed to use DECL_CONTEXT for the real context,
9479 and use something else for the "virtual context". */
9481 context
9482 = TYPE_MAIN_VARIANT
9484 else
9488 {
9491 else
9493 }
9496 }
9498 /* Return the innermost context enclosing DECL that is
9499 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9500 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9502 tree
9504 {
9509 {
9530 }
9533 }
9535 /* CALL is a CALL_EXPR. Return the declaration for the function
9536 called, or NULL_TREE if the called function cannot be
9537 determined. */
9539 tree
9541 {
9542 tree addr;
9547 /* It's invalid to call this function with anything but a
9548 CALL_EXPR. */
9551 /* The first operand to the CALL is the address of the function
9552 called. */
9555 /* If there is no function, return early. */
9561 /* If this is a readonly function pointer, extract its initial value. */
9567 /* If the address is just `&f' for some function `f', then we know
9568 that `f' is being called. */
9573 /* We couldn't figure out what was being called. */
9575 }
9577 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9578 return the associated function code, otherwise return CFN_LAST. */
9580 combined_fn
9582 {
9583 /* It's invalid to call this function with anything but a CALL_EXPR. */
9594 }
9596 /* Comparator of indices based on tree_node_counts. */
9598 static int
9600 {
9605 }
9607 /* Comparator of indices based on tree_code_counts. */
9609 static int
9611 {
9616 }
9618 #define TREE_MEM_USAGE_SPACES 40
9620 /* Print debugging information about tree nodes generated during the compile,
9621 and any language-specific information. */
9623 void
9625 {
9627 {
9633 {
9640 {
9647 }
9652 }
9654 {
9664 {
9669 }
9676 }
9677 }
9678 else
9685 }
9686 \f
9689 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9691 unsigned
9693 {
9694 /* This relies on the raw feedback's top 4 bits being zero. */
9695 #define FEEDBACK(X) ((X) * 0x04c11db7)
9696 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9697 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9699 {
9704 };
9705 #undef FEEDBACK
9706 #undef SYNDROME
9710 {
9714 }
9717 }
9719 /* Generate a crc32 of a string. */
9721 unsigned
9723 {
9724 do
9728 }
9730 /* P is a string that will be used in a symbol. Mask out any characters
9731 that are not valid in that context. */
9733 void
9735 {
9740 #endif
9743 #endif
9744 ))
9746 }
9748 /* For anonymous aggregate types, we need some sort of name to
9749 hold on to. In practice, this should not appear, but it should
9750 not be harmful if it does. */
9751 bool
9753 {
9754 #ifndef NO_DOT_IN_LABEL
9758 #ifndef NO_DOLLAR_IN_LABEL
9767 }
9769 /* Return a format for an anonymous aggregate name. */
9772 {
9773 #ifndef NO_DOT_IN_LABEL
9776 #ifndef NO_DOLLAR_IN_LABEL
9782 }
9784 /* Generate a name for a special-purpose function.
9785 The generated name may need to be unique across the whole link.
9786 Changes to this function may also require corresponding changes to
9787 xstrdup_mask_random.
9788 TYPE is some string to identify the purpose of this function to the
9789 linker or collect2; it must start with an uppercase letter,
9790 one of:
9791 I - for constructors
9792 D - for destructors
9793 N - for C++ anonymous namespaces
9794 F - for DWARF unwind frame information. */
9796 tree
9798 {
9803 /* If we already have a name we know to be unique, just use that. */
9806 /* If the target is handling the constructors/destructors, they
9807 will be local to this file and the name is only necessary for
9808 debugging purposes.
9809 We also assign sub_I and sub_D sufixes to constructors called from
9810 the global static constructors. These are always local. */
9814 {
9818 /* Just use the file's basename, because the full pathname
9819 might be quite long. */
9821 }
9822 else
9823 {
9824 /* Otherwise, the name must be unique across the entire link.
9825 We don't have anything that we know to be unique to this translation
9826 unit, so use what we do have and throw in some randomness. */
9844 }
9850 /* Set up the name of the file-level functions we may need.
9851 Use a global object (which is already required to be unique over
9852 the program) rather than the file name (which imposes extra
9853 constraints). */
9857 }
9858 \f
9859 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9861 /* Complain that the tree code of NODE does not match the expected 0
9862 terminated list of trailing codes. The trailing code list can be
9863 empty, for a more vague error message. FILE, LINE, and FUNCTION
9864 are of the caller. */
9866 void
9869 {
9880 {
9887 {
9894 }
9896 }
9897 else
9903 }
9905 /* Complain that the tree code of NODE does match the expected 0
9906 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9907 the caller. */
9909 void
9912 {
9926 {
9928 {
9931 }
9934 }
9940 }
9942 /* Similar to tree_check_failed, except that we check for a class of tree
9943 code, given in CL. */
9945 void
9948 {
9949 internal_error
9954 }
9956 /* Similar to tree_check_failed, except that instead of specifying a
9957 dozen codes, use the knowledge that they're all sequential. */
9959 void
9963 {
9976 {
9983 }
9988 }
9991 /* Similar to tree_check_failed, except that we check that a tree does
9992 not have the specified code, given in CL. */
9994 void
9997 {
9998 internal_error
10003 }
10006 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
10008 void
10011 {
10017 }
10020 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
10022 void
10026 {
10039 {
10046 }
10051 }
10054 #undef DEFTREESTRUCT
10055 #define DEFTREESTRUCT(VAL, NAME) NAME,
10059 };
10060 #undef DEFTREESTRUCT
10062 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
10064 /* Similar to tree_class_check_failed, except that we check for
10065 whether CODE contains the tree structure identified by EN. */
10067 void
10072 {
10073 internal_error
10077 }
10080 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10081 (dynamically sized) vector. */
10083 void
10086 {
10087 internal_error
10091 }
10093 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10094 (dynamically sized) vector. */
10096 void
10099 {
10100 internal_error
10103 }
10105 /* Similar to above, except that the check is for the bounds of the operand
10106 vector of an expression node EXP. */
10108 void
10111 {
10113 internal_error
10117 }
10119 /* Similar to above, except that the check is for the number of
10120 operands of an OMP_CLAUSE node. */
10122 void
10125 {
10126 internal_error
10131 }
10133 \f
10134 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10135 and mapped to the machine mode MODE. Initialize its fields and build
10136 the information necessary for debugging output. */
10138 static tree
10140 {
10141 tree t;
10162 /* We have built a main variant, based on the main variant of the
10163 inner type. Use it to build the variant we return. */
10171 }
10173 static tree
10175 {
10198 else
10200 }
10202 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10204 static tree
10206 {
10208 {
10220 }
10221 else
10222 {
10234 }
10237 }
10239 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10241 static tree
10243 {
10245 {
10257 }
10258 else
10259 {
10271 }
10274 }
10277 /* Create an atomic variant node for TYPE. This routine is called
10278 during initialization of data types to create the 5 basic atomic
10279 types. The generic build_variant_type function requires these to
10280 already be set up in order to function properly, so cannot be
10281 called from there. If ALIGN is non-zero, then ensure alignment is
10282 overridden to this value. */
10284 static tree
10286 {
10287 tree t;
10289 /* Make sure its not already registered. */
10300 }
10302 /* Information about the _FloatN and _FloatNx types. This must be in
10303 the same order as the corresponding TI_* enum values. */
10305 {
10313 };
10316 /* Create nodes for all integer types (and error_mark_node) using the sizes
10317 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10319 void
10321 {
10329 /* Define both `signed char' and `unsigned char'. */
10335 /* Define `char', which is like either `signed char' or `unsigned char'
10336 but not the same as either. */
10337 char_type_node
10338 = (signed_char
10353 {
10358 {
10361 }
10362 }
10364 /* Define a boolean type. This type only represents boolean values but
10365 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10371 /* Define what type to use for size_t. */
10380 else
10381 {
10387 {
10392 {
10394 }
10395 }
10398 }
10400 /* Define what type to use for ptrdiff_t. */
10409 else
10410 {
10414 {
10419 }
10422 }
10424 /* Fill in the rest of the sized types. Reuse existing type nodes
10425 when possible. */
10438 /* Don't call build_qualified type for atomics. That routine does
10439 special processing for atomics, and until they are initialized
10440 it's better not to make that call.
10442 Check to see if there is a target override for atomic types. */
10459 /* Define these next since types below may used them. */
10477 /* We are not going to have real types in C with less than byte alignment,
10478 so we might as well not have any types that claim to have it. */
10489 const_ptr_type_node
10511 {
10514 scalar_float_mode mode;
10518 /* Work around the rs6000 KFmode having precision 113 not
10519 128. */
10531 }
10538 /* Fixed size integer types. */
10543 /* Decimal float types. */
10569 {
10573 }
10575 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10576 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10577 sat_ ## KIND ## _type_node = \
10578 make_sat_signed_ ## KIND ## _type (SIZE); \
10579 sat_unsigned_ ## KIND ## _type_node = \
10580 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10581 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10582 unsigned_ ## KIND ## _type_node = \
10583 make_unsigned_ ## KIND ## _type (SIZE);
10585 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10586 sat_ ## WIDTH ## KIND ## _type_node = \
10587 make_sat_signed_ ## KIND ## _type (SIZE); \
10588 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10589 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10590 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10591 unsigned_ ## WIDTH ## KIND ## _type_node = \
10592 make_unsigned_ ## KIND ## _type (SIZE);
10594 /* Make fixed-point type nodes based on four different widths. */
10595 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10596 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10597 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10598 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10599 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10601 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10602 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10603 NAME ## _type_node = \
10604 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10605 u ## NAME ## _type_node = \
10606 make_or_reuse_unsigned_ ## KIND ## _type \
10607 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10608 sat_ ## NAME ## _type_node = \
10609 make_or_reuse_sat_signed_ ## KIND ## _type \
10610 (GET_MODE_BITSIZE (MODE ## mode)); \
10611 sat_u ## NAME ## _type_node = \
10612 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10613 (GET_MODE_BITSIZE (U ## MODE ## mode));
10615 /* Fixed-point type and mode nodes. */
10628 {
10631 /* Many back-ends define record types without setting TYPE_NAME.
10632 If we copied the record type here, we'd keep the original
10633 record type without a name. This breaks name mangling. So,
10634 don't copy record types and let c_common_nodes_and_builtins()
10635 declare the type to be __builtin_va_list. */
10640 }
10641 }
10643 /* Modify DECL for given flags.
10644 TM_PURE attribute is set only on types, so the function will modify
10645 DECL's type when ECF_TM_PURE is used. */
10647 void
10649 {
10679 /* Looping const or pure is implied by noreturn.
10680 There is currently no way to declare looping const or looping pure alone. */
10683 }
10686 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10688 static void
10691 {
10692 tree decl;
10699 }
10701 /* Call this function after instantiating all builtins that the language
10702 front end cares about. This will build the rest of the builtins
10703 and internal functions that are relied upon by the tree optimizers and
10704 the middle-end. */
10706 void
10708 {
10714 {
10718 BUILT_IN_UNREACHABLE,
10726 }
10730 {
10741 }
10744 {
10747 NULL_TREE);
10750 }
10753 {
10759 }
10761 /* If we're checking the stack, `alloca' can throw. */
10762 const int alloca_flags
10766 {
10771 }
10776 BUILT_IN_ALLOCA_WITH_ALIGN,
10778 alloca_flags);
10783 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10785 alloca_flags);
10791 BUILT_IN_INIT_TRAMPOLINE,
10794 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10798 BUILT_IN_INIT_DESCRIPTOR,
10803 BUILT_IN_ADJUST_TRAMPOLINE,
10807 BUILT_IN_ADJUST_DESCRIPTOR,
10814 BUILT_IN_NONLOCAL_GOTO,
10821 BUILT_IN_SETJMP_SETUP,
10826 BUILT_IN_SETJMP_RECEIVER,
10835 BUILT_IN_STACK_RESTORE,
10840 NULL_TREE);
10853 /* If there's a possibility that we might use the ARM EABI, build the
10854 alternate __cxa_end_cleanup node used to resume from C++. */
10856 {
10859 BUILT_IN_CXA_END_CLEANUP,
10861 }
10865 BUILT_IN_UNWIND_RESUME,
10869 ECF_NORETURN);
10872 {
10874 NULL_TREE);
10876 BUILT_IN_RETURN_ADDRESS,
10878 ECF_NOTHROW);
10879 }
10883 {
10888 BUILT_IN_PROFILE_FUNC_ENTER,
10892 BUILT_IN_PROFILE_FUNC_EXIT,
10894 }
10896 /* The exception object and filter values from the runtime. The argument
10897 must be zero before exception lowering, i.e. from the front end. After
10898 exception lowering, it will be the region number for the exception
10899 landing pad. These functions are PURE instead of CONST to prevent
10900 them from being hoisted past the exception edge that will initialize
10901 its value in the landing pad. */
10905 /* Only use TM_PURE if we have TM language support. */
10918 NULL_TREE);
10920 BUILT_IN_EH_COPY_VALUES,
10923 /* Complex multiplication and division. These are handled as builtins
10924 rather than optabs because emit_library_call_value doesn't support
10925 complex. Further, we can do slightly better with folding these
10926 beasties if the real and complex parts of the arguments are separate. */
10927 {
10931 {
10958 /* For -ftrapping-math these should throw from a former
10959 -fnon-call-exception stmt. */
10961 NULL);
10967 NULL);
10971 }
10972 }
10975 }
10977 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10978 better way.
10980 If we requested a pointer to a vector, build up the pointers that
10981 we stripped off while looking for the inner type. Similarly for
10982 return values from functions.
10984 The argument TYPE is the top of the chain, and BOTTOM is the
10985 new type which we will point to. */
10987 tree
10989 {
10993 {
10997 }
10999 {
11003 }
11005 {
11008 }
11010 {
11013 }
11015 {
11017 /* The build_method_type_directly() routine prepends 'this' to argument list,
11018 so we must compensate by getting rid of it. */
11019 outer
11020 = build_method_type_directly
11022 inner,
11024 }
11026 {
11029 }
11030 else
11035 }
11037 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
11038 the inner type. */
11039 tree
11041 {
11042 poly_int64 nunits;
11046 {
11058 /* Check that there are no leftover bits. */
11066 }
11069 }
11071 /* Similarly, but takes the inner type and number of units, which must be
11072 a power of two. */
11074 tree
11076 {
11078 }
11080 /* Build truth vector with specified length and number of units. */
11082 tree
11084 {
11085 machine_mode mask_mode
11088 poly_uint64 vsize;
11091 else
11099 }
11101 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11103 tree
11105 {
11115 }
11117 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11119 tree
11121 {
11123 tree cand;
11124 /* We always build the non-opaque variant before the opaque one,
11125 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11131 /* Othewise build a variant type and make sure to queue it after
11132 the non-opaque type. */
11140 }
11142 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11144 wide_int
11146 {
11147 /* First handle elements that are directly encoded. */
11152 /* Identify the pattern that contains element I and work out the index of
11153 the last encoded element for that pattern. */
11159 /* If there are no steps, the final encoded value is the right one. */
11163 /* Otherwise work out the value from the last two encoded elements. */
11168 }
11170 /* Return the value of element I of VECTOR_CST T. */
11172 tree
11174 {
11175 /* First handle elements that are directly encoded. */
11180 /* If there are no steps, the final encoded value is the right one. */
11182 {
11183 /* Identify the pattern that contains element I and work out the index of
11184 the last encoded element for that pattern. */
11189 }
11191 /* Otherwise work out the value from the last two encoded elements. */
11194 }
11196 /* Given an initializer INIT, return TRUE if INIT is zero or some
11197 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11198 null, set *NONZERO if and only if INIT is known not to be all
11199 zeros. The combination of return value of false and *NONZERO
11200 false implies that INIT may but need not be all zeros. Other
11201 combinations indicate definitive answers. */
11203 bool
11205 {
11210 /* Conservatively clear NONZERO and set it only if INIT is definitely
11211 not all zero. */
11219 {
11228 /* ??? Note that this is not correct for C4X float formats. There,
11229 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11230 negative exponent. */
11265 {
11270 tree elt;
11277 }
11280 {
11295 }
11296 /* Fall through. */
11299 {
11307 /* We need to loop through all elements to handle cases like
11308 "\0" and "\0foobar". */
11311 {
11314 }
11317 }
11321 }
11322 }
11324 /* Return true if EXPR is an initializer expression in which every element
11325 is a constant that is numerically equal to 0 or 1. The elements do not
11326 need to be equal to each other. */
11328 bool
11330 {
11334 {
11342 {
11349 {
11353 }
11356 }
11360 }
11361 }
11363 /* Check if vector VEC consists of all the equal elements and
11364 that the number of elements corresponds to the type of VEC.
11365 The function returns first element of the vector
11366 or NULL_TREE if the vector is not uniform. */
11367 tree
11369 {
11382 {
11386 }
11390 {
11394 {
11396 {
11399 }
11402 }
11407 }
11410 }
11412 /* If the argument is INTEGER_CST, return it. If the argument is vector
11413 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11414 return NULL_TREE.
11415 Look through location wrappers. */
11417 tree
11419 {
11426 {
11430 }
11433 }
11435 /* If VECTOR_CST T has a single nonzero element, return the index of that
11436 element, otherwise return -1. */
11438 int
11440 {
11446 {
11449 }
11450 else
11455 {
11458 {
11462 }
11463 }
11465 }
11467 /* Build an empty statement at location LOC. */
11469 tree
11471 {
11475 }
11478 /* Build an OpenMP clause with code CODE. LOC is the location of the
11479 clause. */
11481 tree
11483 {
11484 tree t;
11499 }
11501 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11502 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11503 Except for the CODE and operand count field, other storage for the
11504 object is initialized to zeros. */
11506 tree
11508 {
11509 tree t;
11521 /* Can't use TREE_OPERAND to store the length because if checking is
11522 enabled, it will try to check the length before we store it. :-P */
11526 }
11528 /* Helper function for build_call_* functions; build a CALL_EXPR with
11529 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11530 the argument slots. */
11532 static tree
11534 {
11535 tree t;
11543 }
11545 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11546 FN and a null static chain slot. NARGS is the number of call arguments
11547 which are specified as "..." arguments. */
11549 tree
11551 {
11552 tree ret;
11558 }
11560 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11561 FN and a null static chain slot. NARGS is the number of call arguments
11562 which are specified as a va_list ARGS. */
11564 tree
11566 {
11567 tree t;
11575 }
11577 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11578 FN and a null static chain slot. NARGS is the number of call arguments
11579 which are specified as a tree array ARGS. */
11581 tree
11584 {
11585 tree t;
11594 }
11596 /* Like build_call_array, but takes a vec. */
11598 tree
11600 {
11609 }
11611 /* Conveniently construct a function call expression. FNDECL names the
11612 function to be called and N arguments are passed in the array
11613 ARGARRAY. */
11615 tree
11617 {
11622 }
11624 /* Conveniently construct a function call expression. FNDECL names the
11625 function to be called and the arguments are passed in the vector
11626 VEC. */
11628 tree
11630 {
11633 }
11636 /* Conveniently construct a function call expression. FNDECL names the
11637 function to be called, N is the number of arguments, and the "..."
11638 parameters are the argument expressions. */
11640 tree
11642 {
11652 }
11654 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11655 varargs macros aren't supported by all bootstrap compilers. */
11657 tree
11659 {
11669 }
11671 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11672 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11673 It will get gimplified later into an ordinary internal function. */
11675 tree
11678 {
11685 }
11687 /* Build internal call expression. This is just like CALL_EXPR, except
11688 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11689 internal function. */
11691 tree
11694 {
11704 }
11706 /* Return a function call to FN, if the target is guaranteed to support it,
11707 or null otherwise.
11709 N is the number of arguments, passed in the "...", and TYPE is the
11710 type of the return value. */
11712 tree
11715 {
11725 {
11728 {
11731 OPTIMIZE_FOR_BOTH))
11733 }
11735 }
11736 else
11737 {
11742 }
11743 }
11745 /* Return a function call to the appropriate builtin alloca variant.
11747 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11748 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11749 bound for SIZE in case it is not a fixed value. */
11751 tree
11753 {
11755 {
11757 return
11759 }
11761 {
11764 }
11765 else
11766 {
11769 }
11770 }
11772 /* Create a new constant string literal consisting of elements of type
11773 ELTYPE and return a tree node representing char* pointer to it as
11774 an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value is
11775 the LEN bytes at STR (the representation of the string, which may
11776 be wide). */
11778 tree
11781 {
11796 }
11800 /* Return true if T (assumed to be a DECL) must be assigned a memory
11801 location. */
11803 bool
11805 {
11811 }
11813 /* Return value of a constant X and sign-extend it. */
11815 HOST_WIDE_INT
11817 {
11821 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11825 {
11829 else
11831 }
11834 }
11836 /* If TYPE is an integral or pointer type, return an integer type with
11837 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11838 if TYPE is already an integer type of signedness UNSIGNEDP.
11839 If TYPE is a floating-point type, return an integer type with the same
11840 bitsize and with the signedness given by UNSIGNEDP; this is useful
11841 when doing bit-level operations on a floating-point value. */
11843 tree
11845 {
11850 {
11858 }
11861 {
11869 }
11878 else
11882 }
11884 /* If TYPE is an integral or pointer type, return an integer type with
11885 the same precision which is unsigned, or itself if TYPE is already an
11886 unsigned integer type. If TYPE is a floating-point type, return an
11887 unsigned integer type with the same bitsize as TYPE. */
11889 tree
11891 {
11893 }
11895 /* If TYPE is an integral or pointer type, return an integer type with
11896 the same precision which is signed, or itself if TYPE is already a
11897 signed integer type. If TYPE is a floating-point type, return a
11898 signed integer type with the same bitsize as TYPE. */
11900 tree
11902 {
11904 }
11906 /* If TYPE is a vector type, return a signed integer vector type with the
11907 same width and number of subparts. Otherwise return boolean_type_node. */
11909 tree
11911 {
11913 {
11918 }
11919 else
11921 }
11923 /* Returns the largest value obtainable by casting something in INNER type to
11924 OUTER type. */
11926 tree
11928 {
11934 /* Compute a unique number for every combination. */
11939 /* Determine the exponent to use. */
11941 {
11944 /* oprec <= iprec, outer: signed, inner: don't care. */
11949 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11953 /* oprec > iprec, outer: signed, inner: signed. */
11957 /* oprec > iprec, outer: signed, inner: unsigned. */
11961 /* oprec > iprec, outer: unsigned, inner: signed. */
11965 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11970 }
11974 }
11976 /* Returns the smallest value obtainable by casting something in INNER type to
11977 OUTER type. */
11979 tree
11981 {
11985 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11986 and obtain 0. */
11988 /* If we are widening something of an unsigned type, OUTER type
11989 contains all values of INNER type. In particular, both INNER
11990 and OUTER types have zero in common. */
11993 else
11994 {
11995 /* If we are widening a signed type to another signed type, we
11996 want to obtain -2^^(iprec-1). If we are keeping the
11997 precision or narrowing to a signed type, we want to obtain
11998 -2^(oprec-1). */
12003 }
12004 }
12006 /* Return nonzero if two operands that are suitable for PHI nodes are
12007 necessarily equal. Specifically, both ARG0 and ARG1 must be either
12008 SSA_NAME or invariant. Note that this is strictly an optimization.
12009 That is, callers of this function can directly call operand_equal_p
12010 and get the same result, only slower. */
12012 int
12014 {
12020 }
12022 /* Returns number of zeros at the end of binary representation of X. */
12024 tree
12026 {
12028 }
12031 #define WALK_SUBTREE(NODE) \
12032 do \
12033 { \
12034 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
12035 if (result) \
12036 return result; \
12037 } \
12038 while (0)
12040 /* This is a subroutine of walk_tree that walks field of TYPE that are to
12041 be walked whenever a type is seen in the tree. Rest of operands and return
12042 value are as for walk_tree. */
12044 static tree
12047 {
12051 {
12055 /* We have to worry about mutually recursive pointers. These can't
12056 be written in C. They can in Ada. It's pathological, but
12057 there's an ACATS test (c38102a) that checks it. Deal with this
12058 by checking if we're pointing to another pointer, that one
12059 points to another pointer, that one does too, and we have no htab.
12060 If so, get a hash table. We check three levels deep to avoid
12061 the cost of the hash table if we don't need one. */
12066 {
12073 }
12075 /* fall through */
12084 /* Fall through. */
12088 {
12089 tree arg;
12091 /* We never want to walk into default arguments. */
12094 }
12098 /* Don't follow this nodes's type if a pointer for fear that
12099 we'll have infinite recursion. If we have a PSET, then we
12100 need not fear. */
12115 }
12118 }
12120 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12121 called with the DATA and the address of each sub-tree. If FUNC returns a
12122 non-NULL value, the traversal is stopped, and the value returned by FUNC
12123 is returned. If PSET is non-NULL it is used to record the nodes visited,
12124 and to avoid visiting a node more than once. */
12126 tree
12129 {
12132 tree result;
12134 #define WALK_SUBTREE_TAIL(NODE) \
12135 do \
12136 { \
12137 tp = & (NODE); \
12138 goto tail_recurse; \
12139 } \
12140 while (0)
12142 tail_recurse:
12143 /* Skip empty subtrees. */
12147 /* Don't walk the same tree twice, if the user has requested
12148 that we avoid doing so. */
12152 /* Call the function. */
12156 /* If we found something, return it. */
12162 /* Even if we didn't, FUNC may have decided that there was nothing
12163 interesting below this point in the tree. */
12165 {
12166 /* But we still need to check our siblings. */
12171 else
12173 }
12176 {
12180 }
12183 {
12196 /* None of these have subtrees other than those already walked
12197 above. */
12206 {
12212 /* Walk all elements but the first. */
12216 /* Now walk the first one as a tail call. */
12218 }
12225 {
12230 idx++)
12232 }
12239 {
12240 tree decl;
12242 {
12243 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12244 into declarations that are just mentioned, rather than
12245 declared; they don't really belong to this part of the tree.
12246 And, we can see cycles: the initializer for a declaration
12247 can refer to the declaration itself. */
12251 }
12253 }
12256 {
12257 tree_stmt_iterator i;
12260 }
12265 {
12269 /* FALLTHRU */
12309 /* FALLTHRU */
12341 {
12346 }
12366 {
12371 }
12375 }
12379 {
12382 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12383 But, we only want to walk once. */
12388 }
12391 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12392 defining. We only want to walk into these fields of a type in this
12393 case and not in the general case of a mere reference to the type.
12395 The criterion is as follows: if the field can be an expression, it
12396 must be walked only here. This should be in keeping with the fields
12397 that are directly gimplified in gimplify_type_sizes in order for the
12398 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12399 variable-sized types.
12401 Note that DECLs get walked as part of processing the BIND_EXPR. */
12403 {
12408 /* Call the function for the type. See if it returns anything or
12409 doesn't want us to continue. If we are to continue, walk both
12410 the normal fields and those for the declaration case. */
12415 /* But do not walk a pointed-to type since it may itself need to
12416 be walked in the declaration case if it isn't anonymous. */
12418 {
12422 }
12424 /* If this is a record type, also walk the fields. */
12426 {
12427 tree field;
12431 {
12432 /* We'd like to look at the type of the field, but we can
12433 easily get infinite recursion. So assume it's pointed
12434 to elsewhere in the tree. Also, ignore things that
12435 aren't fields. */
12444 }
12445 }
12447 /* Same for scalar types. */
12453 {
12456 }
12460 }
12461 /* FALLTHRU */
12465 {
12468 /* Walk over all the sub-trees of this operand. */
12471 /* Go through the subtrees. We need to do this in forward order so
12472 that the scope of a FOR_EXPR is handled properly. */
12474 {
12478 }
12479 }
12480 /* If this is a type, walk the needed fields in the type. */
12484 }
12486 /* We didn't find what we were looking for. */
12489 #undef WALK_SUBTREE_TAIL
12490 }
12491 #undef WALK_SUBTREE
12493 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12495 tree
12497 walk_tree_lh lh)
12498 {
12499 tree result;
12504 }
12507 tree
12509 {
12516 }
12518 void
12520 {
12524 {
12526 }
12527 else
12529 }
12531 /* Create a nameless artificial label and put it in the current
12532 function context. The label has a location of LOC. Returns the
12533 newly created label. */
12535 tree
12537 {
12545 }
12547 /* Given a tree, try to return a useful variable name that we can use
12548 to prefix a temporary that is being assigned the value of the tree.
12549 I.E. given <temp> = &A, return A. */
12553 {
12554 tree stripped_decl;
12561 {
12566 }
12567 else
12568 {
12570 {
12575 }
12576 }
12577 }
12579 /* Return true if TYPE has a variable argument list. */
12581 bool
12583 {
12584 function_args_iterator args_iter;
12591 {
12593 }
12596 }
12598 /* Return true if TYPE has a prototype. */
12600 bool
12602 {
12603 tree t;
12609 }
12611 /* If BLOCK is inlined from an __attribute__((__artificial__))
12612 routine, return pointer to location from where it has been
12613 called. */
12614 location_t *
12616 {
12621 {
12624 {
12625 /* If AO is an artificial inline, point RET to the
12626 call site locus at which it has been inlined and continue
12627 the loop, in case AO's caller is also an artificial
12628 inline. */
12632 else
12634 }
12639 }
12641 }
12644 /* If EXP is inlined from an __attribute__((__artificial__))
12645 function, return the location of the original call expression. */
12647 location_t
12649 {
12654 else
12656 }
12659 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12660 nodes. */
12662 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12664 hashval_t
12666 {
12674 {
12677 }
12682 else
12685 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12686 something else. */
12692 }
12694 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12695 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12696 same. */
12698 bool
12700 {
12713 else
12715 }
12717 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12719 tree
12721 {
12722 tree t;
12724 /* Use the cache of optimization nodes. */
12727 opts);
12732 {
12733 /* Insert this one into the hash table. */
12737 /* Make a new node for next time round. */
12739 }
12742 }
12744 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12746 tree
12748 {
12749 tree t;
12751 /* Use the cache of optimization nodes. */
12754 opts);
12759 {
12760 /* Insert this one into the hash table. */
12764 /* Make a new node for next time round. */
12766 }
12769 }
12771 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12772 so that they aren't saved during PCH writing. */
12774 void
12776 {
12781 }
12783 /* Determine the "ultimate origin" of a block. */
12785 tree
12787 {
12792 else
12793 {
12798 }
12799 }
12801 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12802 no instruction. */
12804 bool
12806 {
12807 /* Do not strip casts into or out of differing address spaces. */
12810 {
12815 }
12818 {
12819 /* We already know that outer_type is not a pointer with
12820 a non-generic address space. */
12822 }
12824 /* Use precision rather then machine mode when we can, which gives
12825 the correct answer even for submode (bit-field) types. */
12834 /* Otherwise fall back on comparing machine modes (e.g. for
12835 aggregate types, floats). */
12837 }
12839 /* Return true iff conversion in EXP generates no instruction. Mark
12840 it inline so that we fully inline into the stripping functions even
12841 though we have two uses of this function. */
12845 {
12860 }
12862 /* Return true iff conversion in EXP generates no instruction. Don't
12863 consider conversions changing the signedness. */
12865 static bool
12867 {
12878 }
12880 /* Strip conversions from EXP according to tree_nop_conversion and
12881 return the resulting expression. */
12883 tree
12885 {
12889 }
12891 /* Strip conversions from EXP according to tree_sign_nop_conversion
12892 and return the resulting expression. */
12894 tree
12896 {
12900 }
12902 /* Avoid any floating point extensions from EXP. */
12903 tree
12905 {
12908 /* For floating point constant look up the narrowest type that can hold
12909 it properly and handle it like (type)(narrowest_type)constant.
12910 This way we can optimize for instance a=a*2.0 where "a" is float
12911 but 2.0 is double constant. */
12913 {
12914 REAL_VALUE_TYPE orig;
12927 }
12946 }
12948 /* Strip out all handled components that produce invariant
12949 offsets. */
12951 const_tree
12953 {
12955 {
12957 {
12972 }
12974 }
12977 }
12981 /* Return the GCC personality function decl. */
12983 tree
12985 {
12989 }
12991 /* TARGET is a call target of GIMPLE call statement
12992 (obtained by gimple_call_fn). Return true if it is
12993 OBJ_TYPE_REF representing an virtual call of C++ method.
12994 (As opposed to OBJ_TYPE_REF representing objc calls
12995 through a cast where middle-end devirtualization machinery
12996 can't apply.) */
12998 bool
13000 {
13009 /* If we do not have BINFO associated, it means that type was built
13010 without devirtualization enabled. Do not consider this a virtual
13011 call. */
13015 }
13017 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
13019 static tree
13021 {
13032 }
13034 /* Try to find a base info of BINFO that would have its field decl at offset
13035 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
13036 found, return, otherwise return NULL_TREE. */
13038 tree
13040 {
13044 {
13046 tree fld;
13055 {
13063 }
13067 /* Offset 0 indicates the primary base, whose vtable contents are
13068 represented in the binfo for the derived class. */
13070 {
13072 /* Offsets in BINFO are in bytes relative to the whole structure
13073 while POS is in bits relative to the containing field. */
13080 {
13083 }
13086 else
13088 binfo_offset);
13089 }
13093 }
13094 }
13096 /* Returns true if X is a typedef decl. */
13098 bool
13100 {
13103 }
13105 /* Returns true iff TYPE is a type variant created for a typedef. */
13107 bool
13109 {
13111 }
13113 /* A class to handle converting a string that might contain
13114 control characters, (eg newline, form-feed, etc), into one
13115 in which contains escape sequences instead. */
13117 class escaped_string
13118 {
13127 };
13129 /* PR 84195: Replace control characters in "unescaped" with their
13130 escaped equivalents. Allow newlines if -fmessage-length has
13131 been set to a non-zero value. This is done here, rather than
13132 where the attribute is recorded as the message length can
13133 change between these two locations. */
13135 void
13137 {
13155 {
13159 {
13163 }
13166 {
13168 {
13169 /* We only allocate space for a new string if we
13170 actually encounter a control character that
13171 needs replacing. */
13175 }
13180 {
13189 }
13190 }
13193 }
13196 {
13200 }
13201 }
13203 /* Warn about a use of an identifier which was marked deprecated. Returns
13204 whether a warning was given. */
13206 bool
13208 {
13209 escaped_string msg;
13215 {
13219 {
13224 }
13225 }
13235 {
13236 auto_diagnostic_group d;
13240 else
13245 }
13247 {
13252 {
13258 }
13260 auto_diagnostic_group d;
13262 {
13266 else
13269 }
13270 else
13271 {
13275 else
13278 }
13282 }
13285 }
13287 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13288 somewhere in it. */
13290 bool
13292 {
13294 {
13299 }
13302 }
13304 /* Try to determine whether a TRY_CATCH expression can fall through.
13305 This is a subroutine of block_may_fallthru. */
13307 static bool
13309 {
13310 tree_stmt_iterator i;
13312 /* If the TRY block can fall through, the whole TRY_CATCH can
13313 fall through. */
13319 {
13321 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13322 catch expression and a body. The whole TRY_CATCH may fall
13323 through iff any of the catch bodies falls through. */
13325 {
13328 }
13332 /* The exception filter expression only matters if there is an
13333 exception. If the exception does not match EH_FILTER_TYPES,
13334 we will execute EH_FILTER_FAILURE, and we will fall through
13335 if that falls through. If the exception does match
13336 EH_FILTER_TYPES, the stack unwinder will continue up the
13337 stack, so we will not fall through. We don't know whether we
13338 will throw an exception which matches EH_FILTER_TYPES or not,
13339 so we just ignore EH_FILTER_TYPES and assume that we might
13340 throw an exception which doesn't match. */
13344 /* This case represents statements to be executed when an
13345 exception occurs. Those statements are implicitly followed
13346 by a RESX statement to resume execution after the exception.
13347 So in this case the TRY_CATCH never falls through. */
13349 }
13350 }
13352 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13353 need not be 100% accurate; simply be conservative and return true if we
13354 don't know. This is used only to avoid stupidly generating extra code.
13355 If we're wrong, we'll just delete the extra code later. */
13357 bool
13359 {
13360 /* This CONST_CAST is okay because expr_last returns its argument
13361 unmodified and we assign it to a const_tree. */
13365 {
13368 /* Easy cases. If the last statement of the block implies
13369 control transfer, then we can't fall through. */
13373 /* If there is a default: label or case labels cover all possible
13374 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13375 to some case label in all cases and all we care is whether the
13376 SWITCH_BODY falls through. */
13393 /* The finally clause is always executed after the try clause,
13394 so if it does not fall through, then the try-finally will not
13395 fall through. Otherwise, if the try clause does not fall
13396 through, then when the finally clause falls through it will
13397 resume execution wherever the try clause was going. So the
13398 whole try-finally will only fall through if both the try
13399 clause and the finally clause fall through. */
13406 else
13408 /* FALLTHRU */
13411 /* Functions that do not return do not fall through. */
13425 }
13426 }
13428 /* True if we are using EH to handle cleanups. */
13431 /* This routine is called from front ends to indicate eh should be used for
13432 cleanups. */
13433 void
13435 {
13437 }
13439 /* Query whether EH is used for cleanups. */
13440 bool
13442 {
13444 }
13446 /* Wrapper for tree_code_name to ensure that tree code is valid */
13449 {
13456 }
13458 /* Drops the TREE_OVERFLOW flag from T. */
13460 tree
13462 {
13465 /* For tree codes with a sharing machinery re-build the result. */
13469 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13470 and canonicalize the result. */
13472 {
13473 tree_vector_builder builder;
13477 {
13482 }
13484 }
13486 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13487 and drop the flag. */
13491 /* For constants that contain nested constants, drop the flag
13492 from those as well. */
13494 {
13499 }
13502 }
13504 /* Given a memory reference expression T, return its base address.
13505 The base address of a memory reference expression is the main
13506 object being referenced. For instance, the base address for
13507 'array[i].fld[j]' is 'array'. You can think of this as stripping
13508 away the offset part from a memory address.
13510 This function calls handled_component_p to strip away all the inner
13511 parts of the memory reference until it reaches the base object. */
13513 tree
13515 {
13524 /* ??? Either the alias oracle or all callers need to properly deal
13525 with WITH_SIZE_EXPRs before we can look through those. */
13530 }
13532 /* Return a tree of sizetype representing the size, in bytes, of the element
13533 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13535 tree
13537 {
13542 /* If a size was specified in the ARRAY_REF, it's the size measured
13543 in alignment units of the element type. So multiply by that value. */
13545 {
13546 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13547 sizetype from another type of the same width and signedness. */
13552 }
13554 /* Otherwise, take the size from that of the element type. Substitute
13555 any PLACEHOLDER_EXPR that we have. */
13556 else
13558 }
13560 /* Return a tree representing the lower bound of the array mentioned in
13561 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13563 tree
13565 {
13568 /* If a lower bound is specified in EXP, use it. */
13572 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13573 substituting for a PLACEHOLDER_EXPR as needed. */
13577 /* Otherwise, return a zero of the appropriate type. */
13579 }
13581 /* Return a tree representing the upper bound of the array mentioned in
13582 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13584 tree
13586 {
13589 /* If there is a domain type and it has an upper bound, use it, substituting
13590 for a PLACEHOLDER_EXPR as needed. */
13594 /* Otherwise fail. */
13596 }
13598 /* Returns true if REF is an array reference or a component reference
13599 to an array at the end of a structure.
13600 If this is the case, the array may be allocated larger
13601 than its upper bound implies. */
13603 bool
13605 {
13606 tree atype;
13610 {
13613 }
13617 else
13625 {
13626 /* If the reference chain contains a component reference to a
13627 non-union type and there follows another field the reference
13628 is not at the end of a structure. */
13630 {
13632 {
13638 }
13639 }
13640 /* If we have a multi-dimensional array we do not consider
13641 a non-innermost dimension as flex array if the whole
13642 multi-dimensional array is at struct end.
13643 Same for an array of aggregates with a trailing array
13644 member. */
13648 ;
13649 /* If we view an underlying object as sth else then what we
13650 gathered up to now is what we have to rely on. */
13653 else
13657 }
13659 /* The array now is at struct end. Treat flexible arrays as
13660 always subject to extend, even into just padding constrained by
13661 an underlying decl. */
13671 /* If the reference is based on a declared entity, the size of the array
13672 is constrained by its given domain. (Do not trust commons PR/69368). */
13674 && !(flag_unconstrained_commons
13678 {
13679 /* Check whether the array domain covers all of the available
13680 padding. */
13681 poly_int64 offset;
13689 /* If at least one extra element fits it is a flexarray. */
13698 }
13701 }
13703 /* Return a tree representing the offset, in bytes, of the field referenced
13704 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13706 tree
13708 {
13713 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13714 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13715 value. */
13717 {
13718 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13719 sizetype from another type of the same width and signedness. */
13725 }
13727 /* Otherwise, take the offset from that of the field. Substitute
13728 any PLACEHOLDER_EXPR that we have. */
13729 else
13731 }
13733 /* Return the machine mode of T. For vectors, returns the mode of the
13734 inner type. The main use case is to feed the result to HONOR_NANS,
13735 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13737 machine_mode
13739 {
13745 }
13747 /* Vector types need to re-check the target flags each time we report
13748 the machine mode. We need to do this because attribute target can
13749 change the result of vector_mode_supported_p and have_regs_of_mode
13750 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13751 change on a per-function basis. */
13752 /* ??? Possibly a better solution is to run through all the types
13753 referenced by a function and re-compute the TYPE_MODE once, rather
13754 than make the TYPE_MODE macro call a function. */
13756 machine_mode
13758 {
13759 machine_mode mode;
13767 {
13768 scalar_int_mode innermode;
13770 /* For integers, try mapping it to a same-sized scalar mode. */
13772 {
13775 scalar_int_mode mode;
13779 }
13782 }
13785 }
13787 /* Verify that basic properties of T match TV and thus T can be a variant of
13788 TV. TV should be the more specified variant (i.e. the main variant). */
13790 static bool
13792 {
13793 /* Type variant can differ by:
13795 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13796 ENCODE_QUAL_ADDR_SPACE.
13797 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13798 in this case some values may not be set in the variant types
13799 (see TYPE_COMPLETE_P checks).
13800 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13801 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13802 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13803 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13804 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13805 this is necessary to make it possible to merge types form different TUs
13806 - arrays, pointers and references may have TREE_TYPE that is a variant
13807 of TREE_TYPE of their main variants.
13808 - aggregates may have new TYPE_FIELDS list that list variants of
13809 the main variant TYPE_FIELDS.
13810 - vector types may differ by TYPE_VECTOR_OPAQUE
13811 */
13813 /* Convenience macro for matching individual fields. */
13814 #define verify_variant_match(flag) \
13815 do { \
13816 if (flag (tv) != flag (t)) \
13817 { \
13819 debug_tree (tv); \
13820 return false; \
13821 } \
13822 } while (false)
13824 /* tree_base checks. */
13827 /* FIXME: Ada builds non-artificial variants of artificial types. */
13832 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13839 else
13841 /* FIXME: This check trigger during libstdc++ build. */
13845 /* tree_type_common checks. */
13848 {
13856 {
13866 }
13867 }
13874 /* During LTO we merge variant lists from diferent translation units
13875 that may differ BY TYPE_CONTEXT that in turn may point
13876 to TRANSLATION_UNIT_DECL.
13877 Ada also builds variants of types with different TYPE_CONTEXT. */
13882 {
13886 }
13888 /* tree_type_non_common checks. */
13890 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13891 and dangle the pointer from time to time. */
13895 {
13899 }
13905 {
13908 }
13915 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13916 or even type's main variant. This is needed to make bootstrap pass
13917 and the bug seems new in GCC 5.
13918 C++ FE should be updated to make this consistent and we should check
13919 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13920 is a match with main variant.
13922 Also disable the check for Java for now because of parser hack that builds
13923 first an dummy BINFO and then sometimes replace it by real BINFO in some
13924 of the copies. */
13927 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13928 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13929 at LTO time only. */
13931 {
13939 }
13941 /* Check various uses of TYPE_VALUES_RAW. */
13947 /* Permit incomplete variants of complete type. While FEs may complete
13948 all variants, this does not happen for C++ templates in all cases. */
13952 {
13955 /* Fortran builds qualified variants as new records with items of
13956 qualified type. Verify that they looks same. */
13963 /* FIXME: gfc_nonrestricted_type builds all types as variants
13964 with exception of pointer types. It deeply copies the type
13965 which means that we may end up with a variant type
13966 referring non-variant pointer. We may change it to
13967 produce types as variants, too, like
13968 objc_get_protocol_qualified_type does. */
13974 {
13982 }
13983 }
13986 /* For C++ the qualified variant of array type is really an array type
13987 of qualified TREE_TYPE.
13988 objc builds variants of pointer where pointer to type is a variant, too
13989 in objc_get_protocol_qualified_type. */
13995 {
14003 }
14006 {
14014 }
14016 #undef verify_variant_match
14017 }
14020 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14021 the middle-end types_compatible_p function. It needs to avoid
14022 claiming types are different for types that should be treated
14023 the same with respect to TBAA. Canonical types are also used
14024 for IL consistency checks via the useless_type_conversion_p
14025 predicate which does not handle all type kinds itself but falls
14026 back to pointer-comparison of TYPE_CANONICAL for aggregates
14027 for example. */
14029 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14030 type calculation because we need to allow inter-operability between signed
14031 and unsigned variants. */
14033 bool
14035 {
14036 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14037 signed char and unsigned char. Similarly fortran FE builds
14038 C_SIZE_T as signed type, while C defines it unsigned. */
14041 == INTEGER_TYPE
14044 }
14046 /* Return true iff T1 and T2 are structurally identical for what
14047 TBAA is concerned.
14048 This function is used both by lto.c canonical type merging and by the
14049 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14050 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14051 only for LTO because only in these cases TYPE_CANONICAL equivalence
14052 correspond to one defined by gimple_canonical_types_compatible_p. */
14054 bool
14057 {
14058 /* Type variants should be same as the main variant. When not doing sanity
14059 checking to verify this fact, go to main variants and save some work. */
14061 {
14064 }
14066 /* Check first for the obvious case of pointer identity. */
14070 /* Check that we have two types to compare. */
14074 /* We consider complete types always compatible with incomplete type.
14075 This does not make sense for canonical type calculation and thus we
14076 need to ensure that we are never called on it.
14078 FIXME: For more correctness the function probably should have three modes
14079 1) mode assuming that types are complete mathcing their structure
14080 2) mode allowing incomplete types but producing equivalence classes
14081 and thus ignoring all info from complete types
14082 3) mode allowing incomplete types to match complete but checking
14083 compatibility between complete types.
14085 1 and 2 can be used for canonical type calculation. 3 is the real
14086 definition of type compatibility that can be used i.e. for warnings during
14087 declaration merging. */
14091 /* If the types have been previously registered and found equal
14092 they still are. */
14096 {
14097 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14098 they are always NULL, but they are set to non-NULL for types
14099 constructed by build_pointer_type and variants. In this case the
14100 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14101 all pointers are considered equal. Be sure to not return false
14102 negatives. */
14106 }
14108 /* Can't be the same type if the types don't have the same code. */
14113 /* Qualifiers do not matter for canonical type comparison purposes. */
14115 /* Void types and nullptr types are always the same. */
14120 /* Can't be the same type if they have different mode. */
14124 /* Non-aggregate types can be handled cheaply. */
14132 {
14133 /* Can't be the same type if they have different recision. */
14137 /* In some cases the signed and unsigned types are required to be
14138 inter-operable. */
14143 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14144 interoperable with "signed char". Unless all frontends are revisited
14145 to agree on these types, we must ignore the flag completely. */
14147 /* Fortran standard define C_PTR type that is compatible with every
14148 C pointer. For this reason we need to glob all pointers into one.
14149 Still pointers in different address spaces are not compatible. */
14151 {
14155 }
14157 /* Tail-recurse to components. */
14162 trust_type_canonical);
14165 }
14167 /* Do type-specific comparisons. */
14169 {
14171 /* Array types are the same if the element types are the same and
14172 the number of elements are the same. */
14174 trust_type_canonical)
14179 else
14180 {
14184 /* For an incomplete external array, the type domain can be
14185 NULL_TREE. Check this condition also. */
14190 else
14191 {
14197 /* The minimum/maximum values have to be the same. */
14209 else
14211 }
14212 }
14216 /* Function types are the same if the return type and arguments types
14217 are the same. */
14219 trust_type_canonical))
14224 else
14225 {
14231 {
14234 trust_type_canonical))
14236 }
14242 }
14247 {
14250 /* Don't try to compare variants of an incomplete type, before
14251 TYPE_FIELDS has been copied around. */
14259 /* For aggregate types, all the fields must be the same. */
14263 {
14264 /* Skip non-fields and zero-sized fields. */
14275 /* The fields must have the same name, offset and type. */
14278 || !gimple_canonical_types_compatible_p
14280 trust_type_canonical))
14282 }
14284 /* If one aggregate has more fields than the other, they
14285 are not the same. */
14290 }
14293 /* Consider all types with language specific trees in them mutually
14294 compatible. This is executed only from verify_type and false
14295 positives can be tolerated. */
14298 }
14299 }
14301 /* Verify type T. */
14303 void
14305 {
14309 {
14312 }
14314 {
14318 }
14324 ;
14326 {
14330 }
14331 /* Method and function types cannot be used to address memory and thus
14332 TYPE_CANONICAL really matters only for determining useless conversions.
14334 FIXME: C++ FE produce declarations of builtin functions that are not
14335 compatible with main variants. */
14337 ;
14339 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14340 with variably sized arrays because their sizes possibly
14341 gimplified to different variables. */
14345 {
14349 }
14353 {
14357 }
14359 {
14364 }
14367 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14369 {
14370 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14371 and danagle the pointer from time to time. */
14375 {
14379 }
14380 }
14382 {
14385 {
14389 }
14390 }
14392 {
14395 {
14399 }
14400 }
14403 {
14404 /* FIXME: The following check should pass:
14405 useless_type_conversion_p (const_cast <tree> (t),
14406 TREE_TYPE (TYPE_MIN_VALUE (t))
14407 but does not for C sizetypes in LTO. */
14408 }
14410 /* Check various uses of TYPE_MAXVAL_RAW. */
14412 {
14414 ;
14416 {
14420 }
14422 {
14426 }
14427 }
14429 {
14433 {
14437 }
14438 }
14440 {
14444 {
14448 }
14449 }
14452 {
14453 /* FIXME: The following check should pass:
14454 useless_type_conversion_p (const_cast <tree> (t),
14455 TREE_TYPE (TYPE_MAX_VALUE (t))
14456 but does not for C sizetypes in LTO. */
14457 }
14459 {
14462 {
14466 }
14467 }
14469 {
14473 }
14476 {
14480 }
14482 /* Check various uses of TYPE_VALUES_RAW. */
14485 {
14489 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14490 CONST_DECL of ENUMERAL TYPE. */
14492 {
14497 }
14500 {
14506 }
14508 {
14513 }
14514 }
14516 {
14518 {
14522 }
14523 }
14525 {
14527 {
14530 }
14532 {
14533 /* TODO: verify properties of decls. */
14535 ;
14537 ;
14539 ;
14541 ;
14543 ;
14545 ;
14547 ;
14548 else
14549 {
14553 }
14554 }
14555 }
14562 {
14564 {
14569 }
14571 {
14575 }
14576 /* Verify just enough of cache to ensure that no one copied it to new type.
14577 All copying should go by copy_node that should clear it. */
14579 {
14584 {
14589 }
14590 }
14591 }
14594 {
14595 /* C++ FE uses TREE_PURPOSE to store initial values. */
14597 {
14601 }
14603 {
14607 }
14608 }
14610 {
14614 }
14622 {
14625 }
14628 {
14631 }
14633 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14634 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14635 of a type. */
14638 {
14641 }
14644 {
14647 }
14648 }
14651 /* Return 1 if ARG interpreted as signed in its precision is known to be
14652 always positive or 2 if ARG is known to be always negative, or 3 if
14653 ARG may be positive or negative. */
14655 int
14657 {
14664 {
14668 else
14670 }
14674 {
14676 /* Narrower value zero extended into wider type
14677 will always result in positive values. */
14684 }
14690 {
14694 {
14698 {
14707 }
14708 }
14710 }
14712 {
14713 /* For unsigned values, the "positive" range comes
14714 below the "negative" range. */
14719 }
14720 else
14721 {
14726 }
14728 }
14733 /* Return true if ARG is marked with the nonnull attribute in the
14734 current function signature. */
14736 bool
14738 {
14746 /* The static chain decl is always non null. */
14750 /* THIS argument of method is always non-NULL. */
14756 /* Values passed by reference are always non-NULL. */
14763 {
14766 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14770 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14774 /* Get the position number for ARG in the function signature. */
14776 t;
14778 {
14781 }
14785 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14787 {
14790 }
14791 }
14794 }
14796 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14797 information. */
14799 location_t
14801 {
14805 }
14807 location_t
14809 {
14810 source_range src_range;
14814 }
14816 location_t
14818 {
14824 pure_loc,
14825 src_range,
14826 NULL);
14829 }
14831 /* Return EXPR, potentially wrapped with a node expression LOC,
14832 if !CAN_HAVE_LOCATION_P (expr).
14834 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14835 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14837 Wrapper nodes can be identified using location_wrapper_p. */
14839 tree
14841 {
14848 /* We should only be adding wrappers for constants and for decls,
14849 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14854 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14855 any impact of the wrapper nodes. */
14859 /* If any auto_suppress_location_wrappers are active, don't create
14860 wrappers. */
14864 tree_code code
14869 /* Mark this node as being a wrapper. */
14872 }
14876 /* Return the name of combined function FN, for debugging purposes. */
14880 {
14882 {
14885 }
14886 else
14888 }
14890 /* Return a bitmap with a bit set corresponding to each argument in
14891 a function call type FNTYPE declared with attribute nonnull,
14892 or null if none of the function's argument are nonnull. The caller
14893 must free the bitmap. */
14895 bitmap
14897 {
14907 /* A function declaration can specify multiple attribute nonnull,
14908 each with zero or more arguments. The loop below creates a bitmap
14909 representing a union of all the arguments. An empty (but non-null)
14910 bitmap means that all arguments have been declaraed nonnull. */
14912 {
14921 {
14922 /* Clear the bitmap in case a previous attribute nonnull
14923 set it and this one overrides it for all arguments. */
14926 }
14928 /* Iterate over the indices of the format arguments declared nonnull
14929 and set a bit for each. */
14931 {
14934 }
14935 }
14938 }
14940 /* Returns true if TYPE is a type where it and all of its subobjects
14941 (recursively) are of structure, union, or array type. */
14943 static bool
14945 {
14947 {
14954 }
14960 }
14962 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14963 that shouldn't be passed via stack. */
14965 bool
14967 {
14978 }
14980 /* Like int_size_in_bytes, but handle empty records specially. */
14982 HOST_WIDE_INT
14984 {
14986 }
14988 /* Like size_in_bytes, but handle empty records specially. */
14990 tree
14992 {
14994 }
14996 /* Return true if an expression with CODE has to have the same result type as
14997 its first operand. */
14999 bool
15001 {
15003 {
15037 }
15038 }
15040 /* Return a typenode for the "standard" C type with a given name. */
15041 tree
15043 {
15075 }
15077 /* List of pointer types used to declare builtins before we have seen their
15078 real declaration.
15080 Keep the size up to date in tree.h ! */
15082 {
15089 };
15091 /* Return the maximum object size. */
15093 tree
15095 {
15096 /* To do: Make this a configurable parameter. */
15098 }
15100 #if CHECKING_P
15104 /* Selftests for tree. */
15106 /* Verify that integer constants are sane. */
15108 static void
15110 {
15123 }
15125 /* Verify identifiers. */
15127 static void
15129 {
15133 }
15135 /* Verify LABEL_DECL. */
15137 static void
15139 {
15145 }
15147 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15148 are given by VALS. */
15150 static tree
15152 {
15157 }
15159 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15161 static void
15163 {
15169 }
15171 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15172 and that its elements match EXPECTED. */
15174 static void
15177 {
15184 }
15186 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15187 and NPATTERNS background elements, and that its elements match
15188 EXPECTED. */
15190 static void
15193 {
15200 }
15202 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15203 and that its elements match EXPECTED. */
15205 static void
15208 {
15215 }
15217 /* Test the creation of VECTOR_CSTs. */
15219 static void
15221 {
15227 /* Test a simple linear series with a base of 0 and a step of 1:
15228 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15234 /* Try the same with the first element replaced by 100:
15235 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15240 /* Try a series that wraps around.
15241 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15247 /* Try a downward series:
15248 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15254 /* Try two interleaved series with different bases and steps:
15255 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15258 {
15261 }
15265 /* Try a duplicated value:
15266 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15272 /* Try an interleaved duplicated value:
15273 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15280 /* Try a duplicated value with 2 exceptions
15281 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15287 /* Try with and without a step
15288 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15294 /* Try a fully-general constant:
15295 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15299 }
15301 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15302 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15303 modifying its argument in-place. */
15305 static void
15307 {
15310 }
15312 /* Verify location wrappers. */
15314 static void
15316 {
15321 /* Wrapping a constant. */
15331 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15334 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15339 /* Wrapping a STRING_CST. */
15351 /* Wrapping a variable. */
15354 integer_type_node);
15363 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15364 wrapper. */
15369 /* Verify that STRIP_NOPS removes wrappers. */
15373 }
15375 /* Test various tree predicates. Verify that location wrappers don't
15376 affect the results. */
15378 static void
15380 {
15381 /* Build various constants and wrappers around them. */
15409 /* TODO: vector constants. */
15411 /* Test integer_onep. */
15431 /* Test integer_zerop. */
15451 /* Test integer_all_onesp. */
15471 /* Test integer_minus_onep. */
15491 /* Test integer_each_onep. */
15511 /* Test integer_truep. */
15531 /* Test integer_nonzerop. */
15551 /* Test real_zerop. */
15571 /* Test real_onep. */
15591 /* Test real_minus_onep. */
15611 /* Test zerop. */
15631 /* Test tree_expr_nonnegative_p. */
15651 /* Test tree_expr_nonzero_p. */
15659 /* Test integer_valued_real_p. */
15666 /* Test integer_pow2p. */
15671 /* Test uniform_integer_cst_p. */
15690 }
15692 /* Check that string escaping works correctly. */
15694 static void
15696 {
15698 escaped_string msg;
15701 /* ASSERT_STREQ does not accept NULL as a valid test
15702 result, so we have to use ASSERT_EQ instead. */
15711 /* Ensure that we have -fmessage-length set to 0. */
15721 /* Now repeat the tests with -fmessage-length set to 5. */
15724 /* Note that the newline is not translated into an escape. */
15731 /* Restore the original message length setting. */
15733 }
15735 /* Run all of the selftests within this file. */
15737 void
15739 {
15747 }