| blob | e451401822c8eed91976b62a47386459534e4eae |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2020 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file 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. */
72 /* Tree code classes. */
74 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
75 #define END_OF_BASE_TREE_CODES tcc_exceptional,
79 };
81 #undef DEFTREECODE
82 #undef END_OF_BASE_TREE_CODES
84 /* Table indexed by tree code giving number of expression
85 operands beyond the fixed part of the node structure.
86 Not used for types or decls. */
88 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
89 #define END_OF_BASE_TREE_CODES 0,
93 };
95 #undef DEFTREECODE
96 #undef END_OF_BASE_TREE_CODES
98 /* Names of tree components.
99 Used for printing out the tree and error messages. */
100 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
105 };
107 #undef DEFTREECODE
108 #undef END_OF_BASE_TREE_CODES
110 /* Each tree code class has an associated string representation.
111 These must correspond to the tree_code_class entries. */
114 {
125 "expression"
126 };
128 /* obstack.[ch] explicitly declined to prototype this. */
131 /* Statistics-gathering stuff. */
137 /* Keep in sync with tree.h:enum tree_node_kind. */
155 };
157 /* Unique id for next decl created. */
159 /* Unique id for next type created. */
161 /* Unique id for next debug decl created. Use negative numbers,
162 to catch erroneous uses. */
165 /* Since we cannot rehash a type after it is in the table, we have to
166 keep the hash code. */
170 tree type;
171 };
173 /* Initial size of the hash table (rounded to next prime). */
174 #define TYPE_HASH_INITIAL_SIZE 1000
177 {
181 static int
183 {
185 }
186 };
188 /* Now here is the hash table. When recording a type, it is added to
189 the slot whose index is the hash code. Note that the hash table is
190 used for several kinds of types (function types, array types and
191 array index range types, for now). While all these live in the
192 same table, they are completely independent, and the hash code is
193 computed differently for each of these. */
197 /* Hash table and temporary node for larger integer const values. */
201 {
204 };
208 /* Class and variable for making sure that there is a single POLY_INT_CST
209 for a given value. */
211 {
215 };
219 /* Hash table for optimization flags and target option flags. Use the same
220 hash table for both sets of options. Nodes for building the current
221 optimization and target option nodes. The assumption is most of the time
222 the options created will already be in the hash table, so we avoid
223 allocating and freeing up a node repeatably. */
228 {
231 };
235 /* General tree->tree mapping structure for use in hash tables. */
245 {
248 static bool
250 {
252 }
254 static int
256 {
258 }
259 };
279 /* Number of operands for each OpenMP clause. */
281 {
363 };
366 {
448 };
451 /* Return the tree node structure used by tree code CODE. */
455 {
457 {
460 {
472 }
486 }
489 {
490 /* tcc_constant cases. */
500 /* tcc_exceptional cases. */
517 }
518 }
521 /* Initialize tree_contains_struct to describe the hierarchy of tree
522 nodes. */
524 static void
526 {
530 {
537 /* Mark the TS structure itself. */
540 /* Mark all the structures that TS is derived from. */
542 {
622 }
623 }
625 /* Basic consistency checks for attributes used in fold. */
666 }
669 /* Init tree.c. */
671 void
673 {
674 /* Initialize the hash table of types. */
675 type_hash_table
678 debug_expr_for_decl
681 value_expr_for_decl
695 /* Initialize the tree_contains_struct array. */
698 }
700 \f
701 /* The name of the object as the assembler will see it (but before any
702 translations made by ASM_OUTPUT_LABELREF). Often this is the same
703 as DECL_NAME. It is an IDENTIFIER_NODE. */
704 tree
706 {
710 }
712 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
713 (either of which may be NULL). Inform the FE, if this changes the
714 name. */
716 void
718 {
721 }
723 /* When the target supports COMDAT groups, this indicates which group the
724 DECL is associated with. This can be either an IDENTIFIER_NODE or a
725 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
726 tree
728 {
733 }
735 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
736 tree
738 {
743 }
745 /* When the target supports named section, return its name as IDENTIFIER_NODE
746 or NULL if it is in no section. */
749 {
754 }
756 /* Set section name of NODE to VALUE (that is expected to be
757 identifier node) */
758 void
760 {
764 {
768 }
771 else
774 }
776 /* Return TLS model of a variable NODE. */
777 enum tls_model
779 {
784 }
786 /* Set TLS model of variable NODE to MODEL. */
787 void
789 {
793 {
797 }
798 else
801 }
803 /* Compute the number of bytes occupied by a tree with code CODE.
804 This function cannot be used for nodes that have variable sizes,
805 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
806 size_t
808 {
810 {
813 {
830 }
834 {
857 }
870 {
882 }
886 {
907 }
911 }
912 }
914 /* Compute the number of bytes occupied by NODE. This routine only
915 looks at TREE_CODE, except for those nodes that have variable sizes. */
916 size_t
918 {
921 {
951 else
953 }
954 }
956 /* Return tree node kind based on tree CODE. */
958 static tree_node_kind
960 {
964 {
982 {
999 }
1005 }
1006 }
1008 /* Record interesting allocation statistics for a tree node with CODE
1009 and LENGTH. */
1011 static void
1013 {
1022 }
1024 /* Allocate and return a new UID from the DECL_UID namespace. */
1026 int
1028 {
1030 }
1032 /* Return a newly allocated node of code CODE. For decl and type
1033 nodes, some other fields are initialized. The rest of the node is
1034 initialized to zero. This function cannot be used for TREE_VEC,
1035 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1036 tree_code_size.
1038 Achoo! I got a code in the node. */
1040 tree
1042 {
1043 tree t;
1053 {
1061 {
1063 {
1066 }
1067 else
1069 }
1073 else
1074 {
1077 }
1090 /* Default to no attributes for type, but let target change that. */
1094 /* We have not yet computed the alias set for this type. */
1104 {
1112 /* All of these have side-effects, no matter what their
1113 operands are. */
1119 }
1124 {
1137 }
1141 /* Other classes need no special treatment. */
1143 }
1146 }
1148 /* Free tree node. */
1150 void
1152 {
1155 {
1165 }
1177 }
1178 \f
1179 /* Return a new node with the same contents as NODE except that its
1180 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1182 tree
1184 {
1185 tree t;
1202 {
1205 else
1206 {
1210 }
1213 {
1216 }
1217 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1219 {
1222 }
1224 {
1227 }
1229 {
1232 }
1233 }
1235 {
1237 /* The following is so that the debug code for
1238 the copy is different from the original type.
1239 The two statements usually duplicate each other
1240 (because they clear fields of the same union),
1241 but the optimizer should catch that. */
1245 /* Do not copy the values cache. */
1247 {
1250 }
1251 }
1253 {
1257 }
1259 {
1263 }
1266 }
1268 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1269 For example, this can copy a list made of TREE_LIST nodes. */
1271 tree
1273 {
1274 tree head;
1283 {
1287 }
1289 }
1291 \f
1292 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1293 INTEGER_CST with value CST and type TYPE. */
1295 static unsigned int
1297 {
1299 /* We need extra HWIs if CST is an unsigned integer with its
1300 upper bit set. */
1304 }
1306 /* Return a new INTEGER_CST with value CST and type TYPE. */
1308 static tree
1310 {
1316 {
1322 }
1325 {
1326 len--;
1330 }
1336 }
1338 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1340 static tree
1342 CXX_MEM_STAT_INFO)
1343 {
1355 }
1357 /* Create a constant tree that contains CST sign-extended to TYPE. */
1359 tree
1361 {
1362 /* Support legacy code. */
1367 }
1369 /* Create a constant tree that contains CST zero-extended to TYPE. */
1371 tree
1373 {
1375 }
1377 /* Create a constant tree that contains CST sign-extended to TYPE. */
1379 tree
1381 {
1384 }
1386 /* Constructs tree in type TYPE from with value given by CST. Signedness
1387 of CST is assumed to be the same as the signedness of TYPE. */
1389 tree
1391 {
1393 }
1395 /* We force the wide_int CST to the range of the type TYPE by sign or
1396 zero extending it. OVERFLOWABLE indicates if we are interested in
1397 overflow of the value, when >0 we are only interested in signed
1398 overflow, for <0 we are interested in any overflow. OVERFLOWED
1399 indicates whether overflow has already occurred. CONST_OVERFLOWED
1400 indicates whether constant overflow has already occurred. We force
1401 T's value to be within range of T's type (by setting to 0 or 1 all
1402 the bits outside the type's range). We set TREE_OVERFLOWED if,
1403 OVERFLOWED is nonzero,
1404 or OVERFLOWABLE is >0 and signed overflow occurs
1405 or OVERFLOWABLE is <0 and any overflow occurs
1406 We return a new tree node for the extended wide_int. The node
1407 is shared if no overflow flags are set. */
1410 tree
1413 {
1416 /* If we need to set overflow flags, return a new unshared node. */
1418 {
1422 {
1424 sign);
1425 tree t;
1428 else
1429 {
1432 {
1435 }
1437 }
1440 }
1441 }
1443 /* Else build a shared node. */
1445 }
1447 /* These are the hash table functions for the hash table of INTEGER_CST
1448 nodes of a sizetype. */
1450 /* Return the hash code X, an INTEGER_CST. */
1452 hashval_t
1454 {
1463 }
1465 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1466 is the same as that given by *Y, which is the same. */
1468 bool
1470 {
1484 }
1486 /* Create an INT_CST node of TYPE and value CST.
1487 The returned node is always shared. For small integers we use a
1488 per-type vector cache, for larger ones we use a single hash table.
1489 The value is extended from its precision according to the sign of
1490 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1491 the upper bits and ensures that hashing and value equality based
1492 upon the underlying HOST_WIDE_INTs works without masking. */
1494 static tree
1496 {
1497 tree t;
1505 /* Verify that everything is canonical. */
1508 {
1513 }
1519 {
1520 /* We just need to store a single HOST_WIDE_INT. */
1521 HOST_WIDE_INT hwi;
1524 else
1528 {
1531 /* Fallthru. */
1535 /* Cache NULL pointer and zero bounds. */
1537 {
1540 }
1544 /* Cache false or true. */
1553 {
1554 /* Cache [0, N). */
1558 }
1559 else
1560 {
1561 /* Cache [-1, N). */
1565 }
1573 }
1576 {
1577 /* Look for it in the type's vector of small shared ints. */
1579 {
1582 }
1586 /* Make sure no one is clobbering the shared constant. */
1592 else
1593 {
1594 /* Create a new shared int. */
1597 }
1598 }
1599 else
1600 {
1601 /* Use the cache of larger shared ints, using int_cst_node as
1602 a temporary. */
1610 {
1611 /* Insert this one into the hash table. */
1614 /* Make a new node for next time round. */
1616 }
1617 }
1618 }
1619 else
1620 {
1621 /* The value either hashes properly or we drop it on the floor
1622 for the gc to take care of. There will not be enough of them
1623 to worry about. */
1629 {
1630 /* Insert this one into the hash table. */
1633 }
1634 else
1636 }
1639 }
1641 hashval_t
1643 {
1651 }
1653 bool
1655 {
1662 }
1664 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1665 The elements must also have type TYPE. */
1667 tree
1669 {
1680 INSERT);
1682 {
1687 }
1689 }
1691 /* Create a constant tree with value VALUE in type TYPE. */
1693 tree
1695 {
1699 }
1701 void
1703 {
1712 {
1715 /* Fallthru. */
1719 /* Cache NULL pointer. */
1721 {
1724 }
1728 /* Cache false or true. */
1737 {
1738 /* Cache 0..N */
1741 /* This is a little hokie, but if the prec is smaller than
1742 what is necessary to hold param_integer_share_limit, then the
1743 obvious test will not get the correct answer. */
1745 {
1749 }
1752 }
1753 else
1754 {
1755 /* Cache -1..N */
1761 {
1763 {
1766 }
1769 }
1770 }
1778 }
1781 {
1782 /* Look for it in the type's vector of small shared ints. */
1784 {
1787 }
1791 }
1792 else
1793 {
1794 /* Use the cache of larger shared ints. */
1796 /* If there is already an entry for the number verify it's the
1797 same. */
1800 else
1801 /* Otherwise insert this one into the hash table. */
1803 }
1804 }
1807 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1808 and the rest are zeros. */
1810 tree
1812 {
1817 }
1819 /* Checks that X is integer constant that can be expressed in (unsigned)
1820 HOST_WIDE_INT without loss of precision. */
1822 bool
1824 {
1827 }
1829 /* Build a newly constructed VECTOR_CST with the given values of
1830 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1832 tree
1835 {
1837 tree t;
1853 }
1855 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1856 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1858 tree
1860 {
1865 tree value;
1867 /* We can't construct a VECTOR_CST for a variable number of elements. */
1871 {
1873 {
1874 /* If NELTS is constant then this must be too. */
1878 }
1879 else
1881 }
1886 }
1888 /* Build a vector of type VECTYPE where all the elements are SCs. */
1889 tree
1891 {
1897 /* Verify that the vector type is suitable for SC. Note that there
1898 is some inconsistency in the type-system with respect to restrict
1899 qualifications of pointers. Vector types always have a main-variant
1900 element type and the qualification is applied to the vector-type.
1901 So TREE_TYPE (vector-type) does not return a properly qualified
1902 vector element-type. */
1907 {
1911 }
1914 else
1915 {
1921 }
1922 }
1924 /* If TYPE is not a vector type, just return SC, otherwise return
1925 build_vector_from_val (TYPE, SC). */
1927 tree
1929 {
1934 }
1936 /* Build a vector series of type TYPE in which element I has the value
1937 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1938 and a VEC_SERIES_EXPR otherwise. */
1940 tree
1942 {
1946 {
1956 }
1958 }
1960 /* Return a vector with the same number of units and number of bits
1961 as VEC_TYPE, but in which the elements are a linear series of unsigned
1962 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1964 tree
1966 {
1971 {
1972 index_elt_type = build_nonstandard_integer_type
1975 }
1981 }
1983 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
1984 elements are A and the rest are B. */
1986 tree
1988 {
1991 /* Optimize the constant case. */
1998 }
2000 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2001 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2003 void
2005 {
2007 tree val;
2013 {
2014 /* Mostly ctors will have elts that don't have side-effects, so
2015 the usual case is to scan all the elements. Hence a single
2016 loop for both const and side effects, rather than one loop
2017 each (with early outs). */
2022 }
2026 }
2028 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2029 CONSTRUCTOR C. */
2031 void
2033 {
2035 tree val;
2041 {
2046 }
2047 }
2049 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2050 are in the vec pointed to by VALS. */
2051 tree
2053 {
2062 }
2064 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2065 INDEX and VALUE. */
2066 tree
2068 {
2076 }
2079 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2080 are in a list pointed to by VALS. */
2081 tree
2083 {
2084 tree t;
2088 {
2092 }
2095 }
2097 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2098 of elements, provided as index/value pairs. */
2100 tree
2102 {
2109 {
2113 }
2116 }
2118 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2120 tree
2122 {
2126 }
2128 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2130 tree
2132 {
2133 tree v;
2143 }
2145 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2147 tree
2149 {
2150 tree v;
2154 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2155 Consider doing it via real_convert now. */
2165 }
2167 /* Like build_real, but first truncate D to the type. */
2169 tree
2171 {
2173 }
2175 /* Return a new REAL_CST node whose type is TYPE
2176 and whose value is the integer value of the INTEGER_CST node I. */
2178 REAL_VALUE_TYPE
2180 {
2181 REAL_VALUE_TYPE d;
2183 /* Clear all bits of the real value type so that we can later do
2184 bitwise comparisons to see if two values are the same. */
2190 }
2192 /* Given a tree representing an integer constant I, return a tree
2193 representing the same value as a floating-point constant of type TYPE. */
2195 tree
2197 {
2198 tree v;
2205 }
2207 /* Return a newly constructed STRING_CST node whose value is
2208 the LEN characters at STR.
2209 Note that for a C string literal, LEN should include the trailing NUL.
2210 The TREE_TYPE is not initialized. */
2212 tree
2214 {
2215 tree s;
2218 /* Do not waste bytes provided by padding of struct tree_string. */
2233 }
2235 /* Return a newly constructed COMPLEX_CST node whose value is
2236 specified by the real and imaginary parts REAL and IMAG.
2237 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2238 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2240 tree
2242 {
2253 }
2255 /* Build a complex (inf +- 0i), such as for the result of cproj.
2256 TYPE is the complex tree type of the result. If NEG is true, the
2257 imaginary zero is negative. */
2259 tree
2261 {
2268 }
2270 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2271 element is set to 1. In particular, this is 1 + i for complex types. */
2273 tree
2275 {
2277 {
2280 }
2281 else
2283 }
2285 /* Return a constant of arithmetic type TYPE which is the
2286 multiplicative identity of the set TYPE. */
2288 tree
2290 {
2292 {
2302 /* We can only generate 1 for accum types. */
2307 {
2311 }
2320 }
2321 }
2323 /* Return an integer of type TYPE containing all 1's in as much precision as
2324 it contains, or a complex or vector whose subparts are such integers. */
2326 tree
2328 {
2330 {
2333 }
2334 else
2336 }
2338 /* Return a constant of arithmetic type TYPE which is the
2339 opposite of the multiplicative identity of the set TYPE. */
2341 tree
2343 {
2345 {
2355 /* We can only generate 1 for accum types. */
2362 {
2366 }
2375 }
2376 }
2378 /* Build 0 constant of type TYPE. This is used by constructor folding
2379 and thus the constant should be represented in memory by
2380 zero(es). */
2382 tree
2384 {
2386 {
2399 {
2403 }
2406 {
2410 }
2416 }
2417 }
2420 /* Build a BINFO with LEN language slots. */
2422 tree
2424 {
2425 tree t;
2440 }
2442 /* Create a CASE_LABEL_EXPR tree node and return it. */
2444 tree
2446 {
2458 }
2460 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2461 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2462 The latter determines the length of the HOST_WIDE_INT vector. */
2464 tree
2466 {
2467 tree t;
2479 /* to_offset can only be applied to trees that are offset_int-sized
2480 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2481 must be exactly the precision of offset_int and so LEN is correct. */
2484 else
2490 }
2492 /* Build a newly constructed TREE_VEC node of length LEN. */
2494 tree
2496 {
2497 tree t;
2508 }
2510 /* Grow a TREE_VEC node to new length LEN. */
2512 tree
2514 {
2530 }
2531 \f
2532 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2533 fixed, and scalar, complex or vector. */
2535 bool
2537 {
2541 }
2543 /* Return 1 if EXPR is the integer constant zero or a complex constant
2544 of zero, or a location wrapper for such a constant. */
2546 bool
2548 {
2552 {
2564 }
2565 }
2567 /* Return 1 if EXPR is the integer constant one or the corresponding
2568 complex constant, or a location wrapper for such a constant. */
2570 bool
2572 {
2576 {
2588 }
2589 }
2591 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2592 return 1 if every piece is the integer constant one.
2593 Also return 1 for location wrappers for such a constant. */
2595 bool
2597 {
2603 else
2605 }
2607 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2608 it contains, or a complex or vector whose subparts are such integers,
2609 or a location wrapper for such a constant. */
2611 bool
2613 {
2631 }
2633 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2634 for such a constant. */
2636 bool
2638 {
2644 else
2646 }
2648 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2649 one bit on), or a location wrapper for such a constant. */
2651 bool
2653 {
2665 }
2667 /* Return 1 if EXPR is an integer constant other than zero or a
2668 complex constant other than zero, or a location wrapper for such a
2669 constant. */
2671 bool
2673 {
2681 }
2683 /* Return 1 if EXPR is the integer constant one. For vector,
2684 return 1 if every piece is the integer constant minus one
2685 (representing the value TRUE).
2686 Also return 1 for location wrappers for such a constant. */
2688 bool
2690 {
2696 }
2698 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2699 for such a constant. */
2701 bool
2703 {
2708 }
2710 /* Return the power of two represented by a tree node known to be a
2711 power of two. */
2713 int
2715 {
2720 }
2722 /* Similar, but return the largest integer Y such that 2 ** Y is less
2723 than or equal to EXPR. */
2725 int
2727 {
2732 }
2734 /* Return number of known trailing zero bits in EXPR, or, if the value of
2735 EXPR is known to be zero, the precision of it's type. */
2737 unsigned int
2739 {
2746 {
2767 /* Second operand is sizetype, which could be in theory
2768 wider than pointer's precision. Make sure we never
2769 return more than prec. */
2784 {
2787 }
2792 {
2797 }
2806 {
2809 {
2814 }
2815 }
2817 CASE_CONVERT:
2835 {
2838 }
2842 }
2843 }
2845 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2846 decimal float constants, so don't return 1 for them.
2847 Also return 1 for location wrappers around such a constant. */
2849 bool
2851 {
2855 {
2863 {
2864 /* Don't simply check for a duplicate because the predicate
2865 accepts both +0.0 and -0.0. */
2871 }
2874 }
2875 }
2877 /* Return 1 if EXPR is the real constant one in real or complex form.
2878 Trailing zeroes matter for decimal float constants, so don't return
2879 1 for them.
2880 Also return 1 for location wrappers around such a constant. */
2882 bool
2884 {
2888 {
2901 }
2902 }
2904 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2905 matter for decimal float constants, so don't return 1 for them.
2906 Also return 1 for location wrappers around such a constant. */
2908 bool
2910 {
2914 {
2927 }
2928 }
2930 /* Nonzero if EXP is a constant or a cast of a constant. */
2932 bool
2934 {
2935 /* This is not quite the same as STRIP_NOPS. It does more. */
2940 }
2942 /* Return true if T holds a polynomial pointer difference, storing it in
2943 *VALUE if so. A true return means that T's precision is no greater
2944 than 64 bits, which is the largest address space we support, so *VALUE
2945 never loses precision. However, the signedness of the result does
2946 not necessarily match the signedness of T: sometimes an unsigned type
2947 like sizetype is used to encode a value that is actually negative. */
2949 bool
2951 {
2955 {
2960 }
2962 {
2969 }
2971 }
2973 poly_int64
2975 {
2980 }
2982 poly_uint64
2984 {
2989 }
2990 \f
2991 /* Return first list element whose TREE_VALUE is ELEM.
2992 Return 0 if ELEM is not in LIST. */
2994 tree
2996 {
2998 {
3002 }
3004 }
3006 /* Return first list element whose TREE_PURPOSE is ELEM.
3007 Return 0 if ELEM is not in LIST. */
3009 tree
3011 {
3013 {
3017 }
3019 }
3021 /* Return true if ELEM is in V. */
3023 bool
3025 {
3027 tree t;
3032 }
3034 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3035 NULL_TREE. */
3037 tree
3039 {
3043 }
3045 /* Return nonzero if ELEM is part of the chain CHAIN. */
3047 bool
3049 {
3051 {
3055 }
3058 }
3060 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3061 We expect a null pointer to mark the end of the chain.
3062 This is the Lisp primitive `length'. */
3064 int
3066 {
3068 #ifdef ENABLE_TREE_CHECKING
3070 #endif
3074 {
3076 #ifdef ENABLE_TREE_CHECKING
3080 #endif
3081 len++;
3082 }
3085 }
3087 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3088 UNION_TYPE TYPE, or NULL_TREE if none. */
3090 tree
3092 {
3097 }
3099 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3100 UNION_TYPE TYPE, or NULL_TREE if none. */
3102 tree
3104 {
3108 {
3113 }
3116 }
3118 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3119 by modifying the last node in chain 1 to point to chain 2.
3120 This is the Lisp primitive `nconc'. */
3122 tree
3124 {
3125 tree t1;
3136 #ifdef ENABLE_TREE_CHECKING
3137 {
3138 tree t2;
3141 }
3142 #endif
3145 }
3147 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3149 tree
3151 {
3152 tree next;
3157 }
3159 /* Reverse the order of elements in the chain T,
3160 and return the new head of the chain (old last element). */
3162 tree
3164 {
3167 {
3168 /* We shouldn't be using this function to reverse BLOCK chains; we
3169 have blocks_nreverse for that. */
3174 }
3176 }
3177 \f
3178 /* Return a newly created TREE_LIST node whose
3179 purpose and value fields are PARM and VALUE. */
3181 tree
3183 {
3188 }
3190 /* Build a chain of TREE_LIST nodes from a vector. */
3192 tree
3194 {
3198 tree t;
3200 {
3203 }
3205 }
3207 /* Return a newly created TREE_LIST node whose
3208 purpose and value fields are PURPOSE and VALUE
3209 and whose TREE_CHAIN is CHAIN. */
3211 tree
3213 {
3214 tree node;
3226 }
3228 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3229 trees. */
3233 {
3237 tree val;
3243 }
3244 \f
3245 /* Return the size nominally occupied by an object of type TYPE
3246 when it resides in memory. The value is measured in units of bytes,
3247 and its data type is that normally used for type sizes
3248 (which is the first type created by make_signed_type or
3249 make_unsigned_type). */
3251 tree
3253 {
3254 tree t;
3263 {
3266 }
3269 }
3271 /* Return the size of TYPE (in bytes) as a wide integer
3272 or return -1 if the size can vary or is larger than an integer. */
3274 HOST_WIDE_INT
3276 {
3277 tree t;
3287 else
3289 }
3291 /* Return the maximum size of TYPE (in bytes) as a wide integer
3292 or return -1 if the size can vary or is larger than an integer. */
3294 HOST_WIDE_INT
3296 {
3298 tree size_tree;
3300 /* If this is an array type, check for a possible MAX_SIZE attached. */
3303 {
3308 }
3310 /* If we still haven't been able to get a size, see if the language
3311 can compute a maximum size. */
3314 {
3319 }
3322 }
3323 \f
3324 /* Return the bit position of FIELD, in bits from the start of the record.
3325 This is a tree of type bitsizetype. */
3327 tree
3329 {
3332 }
3333 \f
3334 /* Return the byte position of FIELD, in bytes from the start of the record.
3335 This is a tree of type sizetype. */
3337 tree
3339 {
3342 }
3344 /* Likewise, but return as an integer. It must be representable in
3345 that way (since it could be a signed value, we don't have the
3346 option of returning -1 like int_size_in_byte can. */
3348 HOST_WIDE_INT
3350 {
3352 }
3353 \f
3354 /* Return the strictest alignment, in bits, that T is known to have. */
3356 unsigned int
3358 {
3362 {
3364 /* If we have conversions, we know that the alignment of the
3365 object must meet each of the alignments of the types. */
3373 /* These don't change the alignment of an object. */
3377 /* The best we can do is say that the alignment is the least aligned
3378 of the two arms. */
3383 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3384 meaningfully, it's always 1. */
3393 }
3395 /* Otherwise take the alignment from that of the type. */
3397 }
3398 \f
3399 /* Return, as a tree node, the number of elements for TYPE (which is an
3400 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3402 tree
3404 {
3407 /* If they did it with unspecified bounds, then we should have already
3408 given an error about it before we got here. */
3416 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3421 ? max
3423 }
3424 \f
3425 /* If arg is static -- a reference to an object in static storage -- then
3426 return the object. This is not the same as the C meaning of `static'.
3427 If arg isn't static, return NULL. */
3429 tree
3431 {
3433 {
3435 /* Nested functions are static, even though taking their address will
3436 involve a trampoline as we unnest the nested function and create
3437 the trampoline on the tree level. */
3458 /* If the thing being referenced is not a field, then it is
3459 something language specific. */
3462 /* If we are referencing a bitfield, we can't evaluate an
3463 ADDR_EXPR at compile time and so it isn't a constant. */
3480 else
3488 }
3489 }
3491 \f
3494 /* Return whether OP is a DECL whose address is function-invariant. */
3496 bool
3498 {
3499 /* The conditions below are slightly less strict than the one in
3500 staticp. */
3503 {
3526 }
3529 }
3531 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3533 bool
3535 {
3536 /* The conditions below are slightly less strict than the one in
3537 staticp. */
3540 {
3560 }
3563 }
3566 /* Return true if T is function-invariant (internal function, does
3567 not handle arithmetic; that's handled in skip_simple_arithmetic and
3568 tree_invariant_p). */
3570 static bool
3572 {
3573 tree op;
3580 {
3587 {
3589 {
3604 }
3606 }
3612 }
3615 }
3617 /* Return true if T is function-invariant. */
3619 bool
3621 {
3624 }
3626 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3627 Do this to any expression which may be used in more than one place,
3628 but must be evaluated only once.
3630 Normally, expand_expr would reevaluate the expression each time.
3631 Calling save_expr produces something that is evaluated and recorded
3632 the first time expand_expr is called on it. Subsequent calls to
3633 expand_expr just reuse the recorded value.
3635 The call to expand_expr that generates code that actually computes
3636 the value is the first call *at compile time*. Subsequent calls
3637 *at compile time* generate code to use the saved value.
3638 This produces correct result provided that *at run time* control
3639 always flows through the insns made by the first expand_expr
3640 before reaching the other places where the save_expr was evaluated.
3641 You, the caller of save_expr, must make sure this is so.
3643 Constants, and certain read-only nodes, are returned with no
3644 SAVE_EXPR because that is safe. Expressions containing placeholders
3645 are not touched; see tree.def for an explanation of what these
3646 are used for. */
3648 tree
3650 {
3651 tree inner;
3653 /* If the tree evaluates to a constant, then we don't want to hide that
3654 fact (i.e. this allows further folding, and direct checks for constants).
3655 However, a read-only object that has side effects cannot be bypassed.
3656 Since it is no problem to reevaluate literals, we just return the
3657 literal node. */
3665 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3666 it means that the size or offset of some field of an object depends on
3667 the value within another field.
3669 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3670 and some variable since it would then need to be both evaluated once and
3671 evaluated more than once. Front-ends must assure this case cannot
3672 happen by surrounding any such subexpressions in their own SAVE_EXPR
3673 and forcing evaluation at the proper time. */
3679 /* This expression might be placed ahead of a jump to ensure that the
3680 value was computed on both sides of the jump. So make sure it isn't
3681 eliminated as dead. */
3684 }
3686 /* Look inside EXPR into any simple arithmetic operations. Return the
3687 outermost non-arithmetic or non-invariant node. */
3689 tree
3691 {
3692 /* We don't care about whether this can be used as an lvalue in this
3693 context. */
3697 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3698 a constant, it will be more efficient to not make another SAVE_EXPR since
3699 it will allow better simplification and GCSE will be able to merge the
3700 computations if they actually occur. */
3702 {
3706 {
3711 else
3713 }
3714 else
3716 }
3719 }
3721 /* Look inside EXPR into simple arithmetic operations involving constants.
3722 Return the outermost non-arithmetic or non-constant node. */
3724 tree
3726 {
3731 {
3735 {
3740 else
3742 }
3743 else
3745 }
3748 }
3750 /* Return which tree structure is used by T. */
3752 enum tree_node_structure_enum
3754 {
3757 }
3759 /* Set various status flags when building a CALL_EXPR object T. */
3761 static void
3763 {
3768 /* Calls have side-effects, except those to const or pure functions. */
3771 /* Propagate TREE_READONLY of arguments for const functions. */
3777 {
3783 }
3787 }
3788 \f
3789 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3790 size or offset that depends on a field within a record. */
3792 bool
3794 {
3805 {
3807 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3808 position computations since they will be converted into a
3809 WITH_RECORD_EXPR involving the reference, which will assume
3810 here will be valid. */
3824 {
3826 /* Ignoring the first operand isn't quite right, but works best. */
3835 /* The save_expr function never wraps anything containing
3836 a PLACEHOLDER_EXPR. */
3841 }
3844 {
3852 }
3856 {
3858 {
3859 const_tree arg;
3860 const_call_expr_arg_iterator iter;
3865 }
3868 }
3872 }
3874 }
3876 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3877 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3878 field positions. */
3880 static bool
3882 {
3883 /* If the size contains a placeholder or the parent type (component type in
3884 the case of arrays) type involves a placeholder, this type does. */
3892 /* Now do type-specific checks. Note that the last part of the check above
3893 greatly limits what we have to do below. */
3895 {
3912 /* Here we just check the bounds. */
3917 /* We have already checked the component type above, so just check
3918 the domain type. Flexible array members have a null domain. */
3925 {
3926 tree field;
3937 }
3941 }
3942 }
3944 /* Wrapper around above function used to cache its result. */
3946 bool
3948 {
3951 /* If the contains_placeholder_bits field has been initialized,
3952 then we know the answer. */
3956 /* Indicate that we've seen this type node, and the answer is false.
3957 This is what we want to return if we run into recursion via fields. */
3960 /* Compute the real value. */
3963 /* Store the real value. */
3967 }
3968 \f
3969 /* Push tree EXP onto vector QUEUE if it is not already present. */
3971 static void
3973 {
3975 tree iter;
3983 }
3985 /* Given a tree EXP, find all occurrences of references to fields
3986 in a PLACEHOLDER_EXPR and place them in vector REFS without
3987 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3988 we assume here that EXP contains only arithmetic expressions
3989 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3990 argument list. */
3992 void
3994 {
3996 tree inner;
3999 /* We handle TREE_LIST and COMPONENT_REF separately. */
4001 {
4004 }
4006 {
4010 ;
4014 else
4016 }
4017 else
4019 {
4024 /* Variables allocated to static storage can stay. */
4030 /* This is the pattern built in ada/make_aligning_type. */
4033 {
4036 }
4038 /* Fall through. */
4056 }
4057 }
4059 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4060 return a tree with all occurrences of references to F in a
4061 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4062 CONST_DECLs. Note that we assume here that EXP contains only
4063 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4064 occurring only in their argument list. */
4066 tree
4068 {
4071 tree new_tree;
4073 /* We handle TREE_LIST and COMPONENT_REF separately. */
4075 {
4082 }
4084 {
4085 tree inner;
4087 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4088 and it is the right field, replace it with R. */
4092 ;
4094 /* The field. */
4100 /* If this expression hasn't been completed let, leave it alone. */
4108 new_tree
4110 }
4111 else
4113 {
4120 else
4127 /* Fall through. */
4135 {
4180 new_tree
4186 }
4190 {
4195 /* If we are trying to replace F with a constant or with another
4196 instance of one of the arguments of the call, inline back
4197 functions which do nothing else than computing a value from
4198 the arguments they are passed. This makes it possible to
4199 fold partially or entirely the replacement expression. */
4201 {
4205 else
4208 {
4211 }
4213 {
4217 }
4218 }
4221 {
4225 {
4229 }
4230 }
4233 {
4237 }
4238 else
4240 }
4245 }
4253 }
4255 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4256 for it within OBJ, a tree that is an object or a chain of references. */
4258 tree
4260 {
4263 tree new_tree;
4265 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4266 in the chain of OBJ. */
4268 {
4270 tree elt;
4300 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4301 survives until RTL generation, there will be an error. */
4303 }
4305 /* TREE_LIST is special because we need to look at TREE_VALUE
4306 and TREE_CHAIN, not TREE_OPERANDS. */
4308 {
4315 }
4316 else
4318 {
4331 {
4376 new_tree
4382 }
4386 {
4392 {
4396 {
4400 }
4401 }
4404 {
4408 }
4409 else
4411 }
4416 }
4424 }
4425 \f
4427 /* Subroutine of stabilize_reference; this is called for subtrees of
4428 references. Any expression with side-effects must be put in a SAVE_EXPR
4429 to ensure that it is only evaluated once.
4431 We don't put SAVE_EXPR nodes around everything, because assigning very
4432 simple expressions to temporaries causes us to miss good opportunities
4433 for optimizations. Among other things, the opportunity to fold in the
4434 addition of a constant into an addressing mode often gets lost, e.g.
4435 "y[i+1] += x;". In general, we take the approach that we should not make
4436 an assignment unless we are forced into it - i.e., that any non-side effect
4437 operator should be allowed, and that cse should take care of coalescing
4438 multiple utterances of the same expression should that prove fruitful. */
4440 static tree
4442 {
4443 tree result;
4446 /* We cannot ignore const expressions because it might be a reference
4447 to a const array but whose index contains side-effects. But we can
4448 ignore things that are actual constant or that already have been
4449 handled by this function. */
4455 {
4457 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4458 have side-effects. */
4461 /* FALLTHRU */
4469 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4470 so that it will only be evaluated once. */
4471 /* The reference (r) and comparison (<) classes could be handled as
4472 below, but it is generally faster to only evaluate them once. */
4478 /* Constants need no processing. In fact, we should never reach
4479 here. */
4483 /* Division is slow and tends to be compiled with jumps,
4484 especially the division by powers of 2 that is often
4485 found inside of an array reference. So do it just once. */
4491 /* Recursively stabilize each operand. */
4497 /* Recursively stabilize each operand. */
4503 }
4511 }
4513 /* Stabilize a reference so that we can use it any number of times
4514 without causing its operands to be evaluated more than once.
4515 Returns the stabilized reference. This works by means of save_expr,
4516 so see the caveats in the comments about save_expr.
4518 Also allows conversion expressions whose operands are references.
4519 Any other kind of expression is returned unchanged. */
4521 tree
4523 {
4524 tree result;
4528 {
4532 /* No action is needed in this case. */
4535 CASE_CONVERT:
4574 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4575 it wouldn't be ignored. This matters when dealing with
4576 volatiles. */
4579 /* If arg isn't a kind of lvalue we recognize, make no change.
4580 Caller should recognize the error for an invalid lvalue. */
4586 }
4594 }
4595 \f
4596 /* Low-level constructors for expressions. */
4598 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4599 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4601 void
4603 {
4604 tree node;
4609 /* We started out assuming this address is both invariant and constant, but
4610 does not have side effects. Now go down any handled components and see if
4611 any of them involve offsets that are either non-constant or non-invariant.
4612 Also check for side-effects.
4614 ??? Note that this code makes no attempt to deal with the case where
4615 taking the address of something causes a copy due to misalignment. */
4617 #define UPDATE_FLAGS(NODE) \
4618 do { tree _node = (NODE); \
4619 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4620 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4624 {
4625 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4626 array reference (probably made temporarily by the G++ front end),
4627 so ignore all the operands. */
4631 {
4637 }
4638 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4639 FIELD_DECL, apparently. The G++ front end can put something else
4640 there, at least temporarily. */
4643 {
4646 }
4647 }
4651 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4652 the address, since &(*a)->b is a form of addition. If it's a constant, the
4653 address is constant too. If it's a decl, its address is constant if the
4654 decl is static. Everything else is not constant and, furthermore,
4655 taking the address of a volatile variable is not volatile. */
4660 ;
4663 else
4664 {
4667 }
4672 #undef UPDATE_FLAGS
4673 }
4675 /* Build an expression of code CODE, data type TYPE, and operands as
4676 specified. Expressions and reference nodes can be created this way.
4677 Constants, decls, types and misc nodes cannot be.
4679 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4680 enough for all extant tree codes. */
4682 tree
4684 {
4685 tree t;
4693 }
4695 tree
4697 {
4699 tree t;
4715 {
4718 }
4721 {
4724 }
4726 {
4728 /* All of these have side-effects, no matter what their
4729 operands are. */
4735 /* Whether a dereference is readonly has nothing to do with whether
4736 its operand is readonly. */
4754 }
4757 }
4759 #define PROCESS_ARG(N) \
4760 do { \
4761 TREE_OPERAND (t, N) = arg##N; \
4762 if (arg##N &&!TYPE_P (arg##N)) \
4763 { \
4764 if (TREE_SIDE_EFFECTS (arg##N)) \
4765 side_effects = 1; \
4766 if (!TREE_READONLY (arg##N) \
4767 && !CONSTANT_CLASS_P (arg##N)) \
4768 (void) (read_only = 0); \
4769 if (!TREE_CONSTANT (arg##N)) \
4770 (void) (constant = 0); \
4771 } \
4772 } while (0)
4774 tree
4776 {
4778 tree t;
4784 /* When sizetype precision doesn't match that of pointers
4785 we need to be able to build explicit extensions or truncations
4786 of the offset argument. */
4798 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4799 result based on those same flags for the arguments. But if the
4800 arguments aren't really even `tree' expressions, we shouldn't be trying
4801 to do this. */
4803 /* Expressions without side effects may be constant if their
4804 arguments are as well. */
4811 {
4825 }
4832 {
4834 {
4838 }
4839 }
4840 else
4841 {
4843 /* Don't mark X / 0 as constant. */
4848 }
4851 }
4854 tree
4856 tree arg2 MEM_STAT_DECL)
4857 {
4859 tree t;
4869 /* As a special exception, if COND_EXPR has NULL branches, we
4870 assume that it is a gimple statement and always consider
4871 it to have side effects. */
4877 else
4893 }
4895 tree
4898 {
4900 tree t;
4920 }
4922 tree
4925 {
4927 tree t;
4944 {
4946 {
4950 }
4951 }
4952 else
4958 }
4960 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4961 on the pointer PTR. */
4963 tree
4965 {
4968 tree tem;
4969 /* For convenience allow addresses that collapse to a simple base
4970 and offset. */
4974 {
4978 {
4981 }
4982 else
4985 }
4990 }
4992 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4994 poly_offset_int
4996 {
4998 SIGNED);
4999 }
5001 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5002 offsetted by OFFSET units. */
5004 tree
5006 {
5013 }
5015 /* Similar except don't specify the TREE_TYPE
5016 and leave the TREE_SIDE_EFFECTS as 0.
5017 It is permissible for arguments to be null,
5018 or even garbage if their values do not matter. */
5020 tree
5022 {
5023 tree t;
5040 }
5042 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5043 tree vec. */
5045 tree
5047 {
5057 }
5058 \f
5059 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5060 and data type TYPE.
5061 We do NOT enter this node in any sort of symbol table.
5063 LOC is the location of the decl.
5065 layout_decl is used to set up the decl's storage layout.
5066 Other slots are initialized to 0 or null pointers. */
5068 tree
5070 tree type MEM_STAT_DECL)
5071 {
5072 tree t;
5077 /* if (type == error_mark_node)
5078 type = integer_type_node; */
5079 /* That is not done, deliberately, so that having error_mark_node
5080 as the type can suppress useless errors in the use of this variable. */
5089 }
5091 /* Builds and returns function declaration with NAME and TYPE. */
5093 tree
5095 {
5105 }
5109 /* Builds a new translation-unit decl with name NAME, queues it in the
5110 global list of translation-unit decls and returns it. */
5112 tree
5114 {
5120 }
5122 \f
5123 /* BLOCK nodes are used to represent the structure of binding contours
5124 and declarations, once those contours have been exited and their contents
5125 compiled. This information is used for outputting debugging info. */
5127 tree
5129 {
5137 }
5139 \f
5140 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5142 LOC is the location to use in tree T. */
5144 void
5146 {
5150 {
5154 }
5155 }
5157 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5158 UNKNOWN_LOCATION. */
5160 void
5162 {
5166 }
5168 /* Data used when collecting DECLs and TYPEs for language data removal. */
5170 class free_lang_data_d
5171 {
5175 /* Worklist to avoid excessive recursion. */
5178 /* Set of traversed objects. Used to avoid duplicate visits. */
5181 /* Array of symbols to process with free_lang_data_in_decl. */
5184 /* Array of types to process with free_lang_data_in_type. */
5186 };
5189 /* Add type or decl T to one of the list of tree nodes that need their
5190 language data removed. The lists are held inside FLD. */
5192 static void
5194 {
5199 else
5201 }
5203 /* Push tree node T into FLD->WORKLIST. */
5207 {
5210 }
5213 \f
5214 /* Return simplified TYPE_NAME of TYPE. */
5216 static tree
5218 {
5221 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5222 TYPE_DECL if the type doesn't have linkage.
5223 this must match fld_ */
5231 }
5233 /* Do same comparsion as check_qualified_type skipping lang part of type
5234 and be more permissive about type names: we only care that names are
5235 same (for diagnostics) and that ODR names are the same.
5236 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5238 static bool
5240 {
5242 /* We want to match incomplete variants with complete types.
5243 In this case we need to ignore alignment. */
5254 }
5256 /* Find variant of FIRST that match T and create new one if necessary.
5257 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5259 static tree
5262 {
5277 /* Variants of incomplete types should have alignment
5278 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5280 {
5283 }
5290 }
5292 /* Map complete types to incomplete types. */
5296 /* Map types to simplified types. */
5300 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5301 use MAP to prevent duplicates. */
5303 static tree
5306 {
5311 {
5312 return fld_type_variant
5316 }
5319 tree &array
5322 {
5323 array
5329 }
5331 }
5333 /* Return CTX after removal of contexts that are not relevant */
5335 static tree
5337 {
5338 /* Variably modified types are needed for tree_is_indexable to decide
5339 whether the type needs to go to local or global section.
5340 This code is semi-broken but for now it is easiest to keep contexts
5341 as expected. */
5344 {
5347 }
5349 }
5351 /* For T being aggregate type try to turn it into a incomplete variant.
5352 Return T if no simplification is possible. */
5354 static tree
5356 {
5360 {
5363 {
5364 tree first;
5368 else
5376 }
5378 }
5387 {
5389 tree ©
5393 {
5396 /* It is possible that type was not seen by free_lang_data yet. */
5405 {
5413 }
5414 else
5415 {
5419 }
5421 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5422 This is needed for ODR violation warnings to come out right (we
5423 want duplicate TYPE_DECLs whenever the type is duplicated because
5424 of ODR violation. Because lang data in the TYPE_DECL may not
5425 have been freed yet, rebuild it from scratch and copy relevant
5426 fields. */
5431 {
5441 }
5442 }
5444 }
5447 }
5449 /* Simplify type T for scenarios where we do not need complete pointer
5450 types. */
5452 static tree
5454 {
5459 /* FIXME: This triggers verification error, see PR88140. */
5464 }
5466 /* Reset the expression *EXPR_P, a size or position.
5468 ??? We could reset all non-constant sizes or positions. But it's cheap
5469 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5471 We need to reset self-referential sizes or positions because they cannot
5472 be gimplified and thus can contain a CALL_EXPR after the gimplification
5473 is finished, which will run afoul of LTO streaming. And they need to be
5474 reset to something essentially dummy but not constant, so as to preserve
5475 the properties of the object they are attached to. */
5479 {
5483 }
5486 /* Reset all the fields in a binfo node BINFO. We only keep
5487 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5489 static void
5491 {
5493 tree t;
5506 }
5509 /* Reset all language specific information still present in TYPE. */
5511 static void
5513 {
5516 /* Give the FE a chance to remove its own data first. */
5529 /* Purge non-marked variants from the variants chain, so that they
5530 don't reappear in the IL after free_lang_data. */
5533 {
5536 /* Turn the removed types into distinct types. */
5539 }
5542 {
5544 /* Remove the const and volatile qualifiers from arguments. The
5545 C++ front end removes them, but the C front end does not,
5546 leading to false ODR violation errors when merging two
5547 instances of the same function signature compiled by
5548 different front ends. */
5550 {
5555 {
5557 & ~TYPE_QUAL_CONST
5562 }
5563 /* C++ FE uses TREE_PURPOSE to store initial values. */
5565 }
5566 }
5568 {
5571 {
5572 /* C++ FE uses TREE_PURPOSE to store initial values. */
5575 }
5576 }
5578 {
5579 /* Remove members that are not FIELD_DECLs from the field list
5580 of an aggregate. These occur in C++. */
5584 else
5590 {
5592 /* We need to preserve link to bases and virtual table for all
5593 polymorphic types to make devirtualization machinery working. */
5596 }
5597 }
5601 {
5603 {
5606 /* Type values are used only for C++ ODR checking. Drop them
5607 for all type variants and non-ODR types.
5608 For ODR types the data is freed in free_odr_warning_data. */
5612 else
5613 /* Simplify representation by recording only values rather
5614 than const decls. */
5618 }
5621 }
5630 {
5632 do
5633 {
5635 }
5638 }
5642 }
5645 /* Return true if DECL may need an assembler name to be set. */
5649 {
5650 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5651 Rule merging. This makes type_odr_p to return true on those types during
5652 LTO and by comparing the mangled name, we can say what types are intended
5653 to be equivalent across compilation unit.
5655 We do not store names of type_in_anonymous_namespace_p.
5657 Record, union and enumeration type have linkage that allows use
5658 to check type_in_anonymous_namespace_p. We do not mangle compound types
5659 that always can be compared structurally.
5661 Similarly for builtin types, we compare properties of their main variant.
5662 A special case are integer types where mangling do make differences
5663 between char/signed char/unsigned char etc. Storing name for these makes
5664 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5665 See cp/mangle.c:write_builtin_type for details. */
5668 {
5681 }
5682 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5686 /* If DECL already has its assembler name set, it does not need a
5687 new one. */
5692 /* Abstract decls do not need an assembler name. */
5696 /* For VAR_DECLs, only static, public and external symbols need an
5697 assembler name. */
5705 {
5706 /* Do not set assembler name on builtins. Allow RTL expansion to
5707 decide whether to expand inline or via a regular call. */
5712 /* Functions represented in the callgraph need an assembler name. */
5716 /* Unused and not public functions don't need an assembler name. */
5719 }
5722 }
5725 /* Reset all language specific information still present in symbol
5726 DECL. */
5728 static void
5730 {
5733 /* Give the FE a chance to remove its own data first. */
5747 {
5752 }
5755 {
5757 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5758 the address may be taken in other unit, so this flag has no practical
5759 use for middle-end.
5761 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5762 for public objects that indeed cannot be adressed, but it is not
5763 the case. Set the flag to true so we do not get merge failures for
5764 i.e. virtual tables between units that take address of it and
5765 units that don't. */
5771 {
5774 else
5775 {
5780 }
5781 }
5783 {
5784 tree t;
5786 /* If DECL has a gimple body, then the context for its
5787 arguments must be DECL. Otherwise, it doesn't really
5788 matter, as we will not be emitting any code for DECL. In
5789 general, there may be other instances of DECL created by
5790 the front end and since PARM_DECLs are generally shared,
5791 their DECL_CONTEXT changes as the replicas of DECL are
5792 created. The only time where DECL_CONTEXT is important
5793 is for the FUNCTION_DECLs that have a gimple body (since
5794 the PARM_DECL will be used in the function's body). */
5803 }
5805 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5806 At this point, it is not needed anymore. */
5809 /* Clear the abstract origin if it refers to a method.
5810 Otherwise dwarf2out.c will ICE as we splice functions out of
5811 TYPE_FIELDS and thus the origin will not be output
5812 correctly. */
5815 && RECORD_OR_UNION_TYPE_P
5820 }
5822 {
5823 /* See comment above why we set the flag for functions. */
5830 }
5832 {
5843 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5844 }
5846 {
5849 }
5853 {
5854 /* Strip builtins from the translation-unit BLOCK. We still have targets
5855 without builtin_decl_explicit support and also builtins are shared
5856 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5859 {
5864 else
5866 }
5867 }
5868 /* We need to keep field decls associated with their trees. Otherwise tree
5869 merging may merge some fileds and keep others disjoint wich in turn will
5870 not do well with TREE_CHAIN pointers linking them.
5872 Also do not drop containing types for virtual methods and tables because
5873 these are needed by devirtualization.
5874 C++ destructors are special because C++ frontends sometimes produces
5875 virtual destructor as an alias of non-virtual destructor. In
5876 devirutalization code we always walk through aliases and we need
5877 context to be preserved too. See PR89335 */
5884 }
5887 /* Operand callback helper for free_lang_data_in_node. *TP is the
5888 subtree operand being considered. */
5890 static tree
5892 {
5899 /* Language specific nodes will be removed, so there is no need
5900 to gather anything under them. */
5902 {
5905 }
5908 {
5909 /* Note that walk_tree does not traverse every possible field in
5910 decls, so we have to do our own traversals here. */
5918 /* We are going to remove everything under DECL_INITIAL for
5919 TYPE_DECLs. No point walking them. */
5927 {
5930 }
5932 {
5937 }
5947 }
5949 {
5950 /* Note that walk_tree does not traverse every possible field in
5951 types, so we have to do our own traversals here. */
5962 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5963 lists, we may look types up in these lists and use them while
5964 optimizing the function body. Thus we need to free lang data
5965 in them. */
5972 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5976 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5977 do not and want not to reach unused variants this way. */
5979 {
5981 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5982 So push that instead. */
5986 }
5990 {
5992 tree tem;
5997 }
5999 {
6000 tree tem;
6001 /* Push all TYPE_FIELDS - there can be interleaving interesting
6002 and non-interesting things. */
6005 {
6009 }
6010 }
6016 }
6018 {
6020 {
6024 {
6028 }
6029 else
6030 {
6033 }
6034 }
6038 }
6045 }
6048 /* Find decls and types in T. */
6050 static void
6052 {
6054 {
6060 }
6061 }
6063 /* Translate all the types in LIST with the corresponding runtime
6064 types. */
6066 static tree
6068 {
6078 {
6083 }
6086 }
6089 /* Find decls and types referenced in EH region R and store them in
6090 FLD->DECLS and FLD->TYPES. */
6092 static void
6094 {
6096 {
6101 {
6102 eh_catch c;
6104 /* The types referenced in each catch must first be changed to the
6105 EH types used at runtime. This removes references to FE types
6106 in the region. */
6108 {
6111 }
6112 }
6125 }
6126 }
6129 /* Find decls and types referenced in cgraph node N and store them in
6130 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6131 look for *every* kind of DECL and TYPE node reachable from N,
6132 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6133 NAMESPACE_DECLs, etc). */
6135 static void
6137 {
6138 basic_block bb;
6141 tree t;
6152 /* Traverse locals. */
6156 /* Traverse EH regions in FN. */
6157 {
6158 eh_region r;
6161 }
6163 /* Traverse every statement in FN. */
6165 {
6166 gphi_iterator psi;
6167 gimple_stmt_iterator si;
6171 {
6175 {
6178 }
6179 }
6182 {
6189 {
6192 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6193 which we need for asm stmts. */
6199 }
6200 }
6201 }
6202 }
6205 /* Find decls and types referenced in varpool node N and store them in
6206 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6207 look for *every* kind of DECL and TYPE node reachable from N,
6208 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6209 NAMESPACE_DECLs, etc). */
6211 static void
6213 {
6215 }
6217 /* If T needs an assembler name, have one created for it. */
6219 void
6221 {
6223 {
6224 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6225 diagnostics that use input_location to show locus
6226 information. The problem here is that, at this point,
6227 input_location is generally anchored to the end of the file
6228 (since the parser is long gone), so we don't have a good
6229 position to pin it to.
6231 To alleviate this problem, this uses the location of T's
6232 declaration. Examples of this are
6233 testsuite/g++.dg/template/cond2.C and
6234 testsuite/g++.dg/template/pr35240.C. */
6241 }
6242 }
6245 /* Free language specific information for every operand and expression
6246 in every node of the call graph. This process operates in three stages:
6248 1- Every callgraph node and varpool node is traversed looking for
6249 decls and types embedded in them. This is a more exhaustive
6250 search than that done by find_referenced_vars, because it will
6251 also collect individual fields, decls embedded in types, etc.
6253 2- All the decls found are sent to free_lang_data_in_decl.
6255 3- All the types found are sent to free_lang_data_in_type.
6257 The ordering between decls and types is important because
6258 free_lang_data_in_decl sets assembler names, which includes
6259 mangling. So types cannot be freed up until assembler names have
6260 been set up. */
6262 static void
6264 {
6267 tree t;
6271 /* Find decls and types in the body of every function in the callgraph. */
6278 /* Find decls and types in every varpool symbol. */
6282 /* Set the assembler name on every decl found. We need to do this
6283 now because free_lang_data_in_decl will invalidate data needed
6284 for mangling. This breaks mangling on interdependent decls. */
6288 /* Traverse every decl found freeing its language data. */
6292 /* Traverse every type found freeing its language data. */
6295 }
6298 /* Free resources that are used by FE but are not needed once they are done. */
6300 static unsigned
6302 {
6306 /* If we are the LTO frontend we have freed lang-specific data already. */
6309 {
6310 /* Rebuild type inheritance graph even when not doing LTO to get
6311 consistent profile data. */
6314 }
6319 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6323 /* Allocate and assign alias sets to the standard integer types
6324 while the slots are still in the way the frontends generated them. */
6329 /* Traverse the IL resetting language specific information for
6330 operands, expressions, etc. */
6333 /* Create gimple variants for common types. */
6339 /* Reset some langhooks. Do not reset types_compatible_p, it may
6340 still be used indirectly via the get_alias_set langhook. */
6353 {
6355 tree t;
6359 }
6361 /* We do not want the default decl_assembler_name implementation,
6362 rather if we have fixed everything we want a wrapper around it
6363 asserting that all non-local symbols already got their assembler
6364 name and only produce assembler names for local symbols. Or rather
6365 make sure we never call decl_assembler_name on local symbols and
6366 devise a separate, middle-end private scheme for it. */
6368 /* Reset diagnostic machinery. */
6377 }
6383 {
6393 };
6396 {
6400 {}
6402 /* opt_pass methods: */
6409 simple_ipa_opt_pass *
6411 {
6413 }
6414 \f
6415 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6416 of the various TYPE_QUAL values. */
6418 static void
6420 {
6426 }
6428 /* Returns true iff CAND and BASE have equivalent language-specific
6429 qualifiers. */
6431 bool
6433 {
6436 /* type_hash_eq currently only applies to these types. */
6441 }
6443 /* This function checks to see if TYPE matches the size one of the built-in
6444 atomic types, and returns that core atomic type. */
6446 static tree
6448 {
6449 tree base_atomic_type;
6451 /* Only handle complete types. */
6456 {
6479 }
6482 }
6484 /* Returns true iff unqualified CAND and BASE are equivalent. */
6486 bool
6488 {
6490 /* Apparently this is needed for Objective-C. */
6495 /* Check alignment. */
6498 /* Atomic types increase minimal alignment. We must to do so as well
6499 or we get duplicated canonical types. See PR88686. */
6501 {
6502 /* See if this object can map to a basic atomic type. */
6506 }
6508 }
6510 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6512 bool
6514 {
6518 }
6520 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6522 static bool
6524 {
6527 /* Apparently this is needed for Objective-C. */
6529 /* Check alignment. */
6534 }
6536 /* Return a version of the TYPE, qualified as indicated by the
6537 TYPE_QUALS, if one exists. If no qualified version exists yet,
6538 return NULL_TREE. */
6540 tree
6542 {
6550 /* Search the chain of variants to see if there is already one there just
6551 like the one we need to have. If so, use that existing one. We must
6552 preserve the TYPE_NAME, since there is code that depends on this. */
6555 {
6556 /* Put the found variant at the head of the variant list so
6557 frequently searched variants get found faster. The C++ FE
6558 benefits greatly from this. */
6564 }
6567 }
6569 /* Like get_qualified_type, but creates the type if it does not
6570 exist. This function never returns NULL_TREE. */
6572 tree
6574 {
6575 tree t;
6577 /* See if we already have the appropriate qualified variant. */
6580 /* If not, build it. */
6582 {
6587 {
6588 /* See if this object can map to a basic atomic type. */
6591 {
6592 /* Ensure the alignment of this type is compatible with
6593 the required alignment of the atomic type. */
6596 }
6597 }
6600 /* Propagate structural equality. */
6603 /* Build the underlying canonical type, since it is different
6604 from TYPE. */
6605 {
6608 }
6609 else
6610 /* T is its own canonical type. */
6613 }
6616 }
6618 /* Create a variant of type T with alignment ALIGN. */
6620 tree
6622 {
6623 tree t;
6638 }
6640 /* Create a new distinct copy of TYPE. The new type is made its own
6641 MAIN_VARIANT. If TYPE requires structural equality checks, the
6642 resulting type requires structural equality checks; otherwise, its
6643 TYPE_CANONICAL points to itself. */
6645 tree
6647 {
6653 /* Set the canonical type either to a new equivalence class, or
6654 propagate the need for structural equality checks. */
6657 else
6660 /* Make it its own variant. */
6664 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6665 whose TREE_TYPE is not t. This can also happen in the Ada
6666 frontend when using subtypes. */
6669 }
6671 /* Create a new variant of TYPE, equivalent but distinct. This is so
6672 the caller can modify it. TYPE_CANONICAL for the return type will
6673 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6674 are considered equal by the language itself (or that both types
6675 require structural equality checks). */
6677 tree
6679 {
6684 /* Since we're building a variant, assume that it is a non-semantic
6685 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6687 /* Type variants have no alias set defined. */
6690 /* Add the new type to the chain of variants of TYPE. */
6696 }
6697 \f
6698 /* Return true if the from tree in both tree maps are equal. */
6700 int
6702 {
6706 }
6708 /* Hash a from tree in a tree_base_map. */
6710 unsigned int
6712 {
6714 }
6716 /* Return true if this tree map structure is marked for garbage collection
6717 purposes. We simply return true if the from tree is marked, so that this
6718 structure goes away when the from tree goes away. */
6720 int
6722 {
6724 }
6726 /* Hash a from tree in a tree_map. */
6728 unsigned int
6730 {
6732 }
6734 /* Hash a from tree in a tree_decl_map. */
6736 unsigned int
6738 {
6740 }
6742 /* Return the initialization priority for DECL. */
6744 priority_type
6746 {
6751 return
6753 }
6755 /* Return the finalization priority for DECL. */
6757 priority_type
6759 {
6764 return
6766 }
6768 /* Set the initialization priority for DECL to PRIORITY. */
6770 void
6772 {
6776 {
6780 }
6783 else
6786 }
6788 /* Set the finalization priority for DECL to PRIORITY. */
6790 void
6792 {
6796 {
6800 }
6801 else
6804 }
6806 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6808 static void
6810 {
6815 }
6817 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6819 static void
6821 {
6826 }
6828 /* Lookup a debug expression for FROM, and return it if we find one. */
6830 tree
6832 {
6840 }
6842 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6844 void
6846 {
6853 }
6855 /* Lookup a value expression for FROM, and return it if we find one. */
6857 tree
6859 {
6867 }
6869 /* Insert a mapping FROM->TO in the value expression hashtable. */
6871 void
6873 {
6880 }
6882 /* Lookup a vector of debug arguments for FROM, and return it if we
6883 find one. */
6887 {
6898 }
6900 /* Insert a mapping FROM->empty vector of debug arguments in the value
6901 expression hashtable. */
6905 {
6920 }
6922 /* Hashing of types so that we don't make duplicates.
6923 The entry point is `type_hash_canon'. */
6925 /* Generate the default hash code for TYPE. This is designed for
6926 speed, rather than maximum entropy. */
6928 hashval_t
6930 {
6939 /* Just the identifier is adequate to distinguish. */
6943 {
6946 /* FALLTHROUGH. */
6958 {
6962 {
6965 }
6966 }
6970 {
6977 }
6981 {
6985 }
6993 }
6996 }
6998 /* These are the Hashtable callback functions. */
7000 /* Returns true iff the types are equivalent. */
7002 bool
7004 {
7005 /* First test the things that are the same for all types. */
7015 /* Be careful about comparing arrays before and after the element type
7016 has been completed; don't compare TYPE_ALIGN unless both types are
7017 complete. */
7024 {
7046 /* fall through */
7078 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7079 where the flag should be inherited from the element type
7080 and can change after ARRAY_TYPEs are created; on non-aggregates
7081 compare it and hash it, scalars will never have that flag set
7082 and we need to differentiate between arrays created by different
7083 front-ends or middle-end created arrays. */
7113 }
7119 }
7121 /* Given TYPE, and HASHCODE its hash code, return the canonical
7122 object for an identical type if one already exists.
7123 Otherwise, return TYPE, and record it as the canonical object.
7125 To use this function, first create a type of the sort you want.
7126 Then compute its hash code from the fields of the type that
7127 make it different from other similar types.
7128 Then call this function and use the value. */
7130 tree
7132 {
7133 type_hash in;
7136 /* The hash table only contains main variants, so ensure that's what we're
7137 being passed. */
7140 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7141 must call that routine before comparing TYPE_ALIGNs. */
7149 {
7155 /* Free also min/max values and the cache for integer
7156 types. This can't be done in free_node, as LTO frees
7157 those on its own. */
7159 {
7162 {
7163 /* Zero is always in TYPE_CACHED_VALUES. */
7167 }
7170 {
7173 }
7176 }
7179 }
7180 else
7181 {
7190 }
7191 }
7193 static void
7195 {
7200 }
7202 /* Given two lists of types
7203 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7204 return 1 if the lists contain the same types in the same order.
7205 Also, the TREE_PURPOSEs must match. */
7207 bool
7209 {
7221 }
7223 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7224 given by TYPE. If the argument list accepts variable arguments,
7225 then this function counts only the ordinary arguments. */
7227 int
7229 {
7233 /* If the function does not take a variable number of arguments,
7234 the last element in the list will have type `void'. */
7237 else
7241 }
7243 /* Return the type of the function TYPE's argument ARGNO if known.
7244 For vararg function's where ARGNO refers to one of the variadic
7245 arguments return null. Otherwise, return a void_type_node for
7246 out-of-bounds ARGNO. */
7248 tree
7250 {
7251 /* Treat zero the same as an out-of-bounds argument number. */
7255 function_args_iterator iter;
7257 tree argtype;
7260 {
7261 /* A vararg function's argument list ends in a null. Otherwise,
7262 an ordinary function's argument list ends with void. Return
7263 null if ARGNO refers to a vararg argument, void_type_node if
7264 it's out of bounds, and the formal argument type otherwise. */
7272 }
7275 }
7277 /* Nonzero if integer constants T1 and T2
7278 represent the same constant value. */
7280 int
7282 {
7298 }
7300 /* Return true if T is an INTEGER_CST whose numerical value (extended
7301 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7303 bool
7305 {
7309 }
7311 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7312 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7314 bool
7316 {
7320 {
7325 }
7328 }
7330 /* Return true if T is an INTEGER_CST whose numerical value (extended
7331 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7333 bool
7335 {
7339 }
7341 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7342 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7344 bool
7346 {
7350 {
7355 }
7358 }
7360 /* T is an INTEGER_CST whose numerical value (extended according to
7361 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7362 HOST_WIDE_INT. */
7364 HOST_WIDE_INT
7366 {
7369 }
7371 /* T is an INTEGER_CST whose numerical value (extended according to
7372 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7373 HOST_WIDE_INT. */
7375 unsigned HOST_WIDE_INT
7377 {
7380 }
7382 /* Return the most significant (sign) bit of T. */
7384 int
7386 {
7390 }
7392 /* Return an indication of the sign of the integer constant T.
7393 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7394 Note that -1 will never be returned if T's type is unsigned. */
7396 int
7398 {
7405 else
7407 }
7409 /* Return the minimum number of bits needed to represent VALUE in a
7410 signed or unsigned type, UNSIGNEDP says which. */
7412 unsigned int
7414 {
7415 /* If the value is negative, compute its negative minus 1. The latter
7416 adjustment is because the absolute value of the largest negative value
7417 is one larger than the largest positive value. This is equivalent to
7418 a bit-wise negation, so use that operation instead. */
7423 /* Return the number of bits needed, taking into account the fact
7424 that we need one more bit for a signed than unsigned type.
7425 If value is 0 or -1, the minimum precision is 1 no matter
7426 whether unsignedp is true or false. */
7430 else
7432 }
7434 /* Return truthvalue of whether T1 is the same tree structure as T2.
7435 Return 1 if they are the same.
7436 Return 0 if they are understandably different.
7437 Return -1 if either contains tree structure not understood by
7438 this function. */
7440 int
7442 {
7452 /* For location wrappers to be the same, they must be at the same
7453 source location (and wrap the same thing). */
7455 {
7459 }
7465 {
7469 else
7471 }
7481 {
7497 {
7506 /* ??? Should we handle also fields here? */
7510 }
7521 {
7529 {
7533 }
7535 }
7538 /* Special case: if either target is an unallocated VAR_DECL,
7539 it means that it's going to be unified with whatever the
7540 TARGET_EXPR is really supposed to initialize, so treat it
7541 as being equivalent to anything. */
7549 else
7578 /* A false return means maybe_ne rather than known_ne. */
7584 }
7586 /* This general rule works for most tree codes. All exceptions should be
7587 handled above. If this is a language-specific tree code, we can't
7588 trust what might be in the operand, so say we don't know
7589 the situation. */
7594 {
7603 {
7607 }
7613 }
7614 }
7616 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7617 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7618 than U, respectively. */
7620 int
7622 {
7631 else
7633 }
7635 /* Return true if SIZE represents a constant size that is in bounds of
7636 what the middle-end and the backend accepts (covering not more than
7637 half of the address-space).
7638 When PERR is non-null, set *PERR on failure to the description of
7639 why SIZE is not valid. */
7641 bool
7643 {
7645 {
7652 }
7654 cst_size_error error;
7659 {
7662 }
7665 {
7668 }
7671 {
7674 }
7678 {
7681 }
7684 }
7686 /* Return the precision of the type, or for a complex or vector type the
7687 precision of the type of its elements. */
7689 unsigned int
7691 {
7699 }
7701 /* Return true if CODE represents an associative tree code. Otherwise
7702 return false. */
7703 bool
7705 {
7707 {
7719 }
7721 }
7723 /* Return true if CODE represents a commutative tree code. Otherwise
7724 return false. */
7725 bool
7727 {
7729 {
7756 }
7758 }
7760 /* Return true if CODE represents a ternary tree code for which the
7761 first two operands are commutative. Otherwise return false. */
7762 bool
7764 {
7766 {
7774 }
7776 }
7778 /* Returns true if CODE can overflow. */
7780 bool
7782 {
7784 {
7789 /* Can overflow in various ways. */
7795 /* For INT_MIN / -1. */
7799 /* For -INT_MIN. */
7802 /* These operators cannot overflow. */
7804 }
7805 }
7807 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7808 ftrapv doesn't generate trapping insns for CODE. */
7810 bool
7812 {
7815 /* We don't generate instructions that trap on overflow for complex or vector
7816 types. */
7824 {
7830 /* These operators can overflow, and -ftrapv generates trapping code for
7831 these. */
7838 /* These operators can overflow, but -ftrapv does not generate trapping
7839 code for these. */
7842 /* These operators cannot overflow. */
7844 }
7845 }
7847 /* Constructors for pointer, array and function types.
7848 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7849 constructed by language-dependent code, not here.) */
7851 /* Construct, lay out and return the type of pointers to TO_TYPE with
7852 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7853 reference all of memory. If such a type has already been
7854 constructed, reuse it. */
7856 tree
7859 {
7860 tree t;
7866 /* If the pointed-to type has the may_alias attribute set, force
7867 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7871 /* In some cases, languages will have things that aren't a POINTER_TYPE
7872 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7873 In that case, return that type without regard to the rest of our
7874 operands.
7876 ??? This is a kludge, but consistent with the way this function has
7877 always operated and there doesn't seem to be a good way to avoid this
7878 at the moment. */
7883 /* First, if we already have a type for pointers to TO_TYPE and it's
7884 the proper mode, use it. */
7897 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7905 /* Lay out the type. This function has many callers that are concerned
7906 with expression-construction, and this simplifies them all. */
7910 }
7912 /* By default build pointers in ptr_mode. */
7914 tree
7916 {
7921 }
7923 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7925 tree
7928 {
7929 tree t;
7935 /* If the pointed-to type has the may_alias attribute set, force
7936 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7940 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7941 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7942 In that case, return that type without regard to the rest of our
7943 operands.
7945 ??? This is a kludge, but consistent with the way this function has
7946 always operated and there doesn't seem to be a good way to avoid this
7947 at the moment. */
7952 /* First, if we already have a type for pointers to TO_TYPE and it's
7953 the proper mode, use it. */
7966 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7977 }
7980 /* Build the node for the type of references-to-TO_TYPE by default
7981 in ptr_mode. */
7983 tree
7985 {
7990 }
7992 #define MAX_INT_CACHED_PREC \
7993 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7996 /* Builds a signed or unsigned integer type of precision PRECISION.
7997 Used for C bitfields whose precision does not match that of
7998 built-in target types. */
7999 tree
8002 {
8009 {
8013 }
8020 else
8030 }
8032 #define MAX_BOOL_CACHED_PREC \
8033 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8036 /* Builds a boolean type of precision PRECISION.
8037 Used for boolean vectors to choose proper vector element size. */
8038 tree
8040 {
8041 tree type;
8044 {
8048 }
8058 }
8060 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8061 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8062 is true, reuse such a type that has already been constructed. */
8064 static tree
8066 {
8089 {
8090 /* Since we cannot reliably merge this type, we need to compare it using
8091 structural equality checks. */
8094 }
8100 }
8102 /* Wrapper around build_range_type_1 with SHARED set to true. */
8104 tree
8106 {
8108 }
8110 /* Wrapper around build_range_type_1 with SHARED set to false. */
8112 tree
8114 {
8116 }
8118 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8119 MAXVAL should be the maximum value in the domain
8120 (one less than the length of the array).
8122 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8123 We don't enforce this limit, that is up to caller (e.g. language front end).
8124 The limit exists because the result is a signed type and we don't handle
8125 sizes that use more than one HOST_WIDE_INT. */
8127 tree
8129 {
8131 }
8133 /* Return true if the debug information for TYPE, a subtype, should be emitted
8134 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8135 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8136 debug info and doesn't reflect the source code. */
8138 bool
8140 {
8143 /* Subrange types have a base type which is an integral type. */
8147 /* Get the real bounds of the subtype. */
8150 else
8151 {
8154 }
8156 /* If the type and its base type have the same representation and the same
8157 name, then the type is not a subrange but a copy of the base type. */
8171 }
8173 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8174 and number of elements specified by the range of values of INDEX_TYPE.
8175 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8176 If SHARED is true, reuse such a type that has already been constructed.
8177 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8179 static tree
8182 {
8183 tree t;
8186 {
8189 }
8199 {
8202 }
8205 {
8214 index_type
8217 }
8220 }
8222 /* Wrapper around build_array_type_1 with SHARED set to true. */
8224 tree
8226 {
8227 return
8229 }
8231 /* Wrapper around build_array_type_1 with SHARED set to false. */
8233 tree
8235 {
8237 }
8239 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8240 sizetype. */
8242 tree
8244 {
8246 }
8248 /* Recursively examines the array elements of TYPE, until a non-array
8249 element type is found. */
8251 tree
8253 {
8258 }
8260 /* Computes the canonical argument types from the argument type list
8261 ARGTYPES.
8263 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8264 on entry to this function, or if any of the ARGTYPES are
8265 structural.
8267 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8268 true on entry to this function, or if any of the ARGTYPES are
8269 non-canonical.
8271 Returns a canonical argument list, which may be ARGTYPES when the
8272 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8273 true) or would not differ from ARGTYPES. */
8275 static tree
8279 {
8280 tree arg;
8284 {
8286 /* Fail gracefully by stating that the type is structural. */
8292 /* If the argument has a default argument, we consider it
8293 non-canonical even though the type itself is canonical.
8294 That way, different variants of function and method types
8295 with default arguments will all point to the variant with
8296 no defaults as their canonical type. */
8298 }
8304 {
8305 /* Build the canonical list of argument types. */
8310 {
8313 else
8316 canon_argtypes);
8317 }
8323 /* There is a non-canonical type. */
8326 }
8328 /* The canonical argument types are the same as ARGTYPES. */
8330 }
8332 /* Construct, lay out and return
8333 the type of functions returning type VALUE_TYPE
8334 given arguments of types ARG_TYPES.
8335 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8336 are data type nodes for the arguments of the function.
8337 If such a type has already been constructed, reuse it. */
8339 tree
8341 {
8342 tree t;
8345 tree canon_argtypes;
8350 {
8353 }
8355 /* Make a node of the sort we want. */
8360 /* If we already have such a type, use the old one. */
8364 /* Set up the canonical type. */
8374 canon_argtypes);
8379 }
8381 /* Build a function type. The RETURN_TYPE is the type returned by the
8382 function. If VAARGS is set, no void_type_node is appended to the
8383 list. ARGP must be always be terminated be a NULL_TREE. */
8385 static tree
8387 {
8395 {
8400 }
8403 else
8404 {
8408 }
8412 }
8414 /* Build a function type. The RETURN_TYPE is the type returned by the
8415 function. If additional arguments are provided, they are
8416 additional argument types. The list of argument types must always
8417 be terminated by NULL_TREE. */
8419 tree
8421 {
8422 tree args;
8429 }
8431 /* Build a variable argument function type. The RETURN_TYPE is the
8432 type returned by the function. If additional arguments are provided,
8433 they are additional argument types. The list of argument types must
8434 always be terminated by NULL_TREE. */
8436 tree
8438 {
8439 tree args;
8447 }
8449 /* Build a function type. RETURN_TYPE is the type returned by the
8450 function; VAARGS indicates whether the function takes varargs. The
8451 function takes N named arguments, the types of which are provided in
8452 ARG_TYPES. */
8454 static tree
8457 {
8465 }
8467 /* Build a function type. RETURN_TYPE is the type returned by the
8468 function. The function takes N named arguments, the types of which
8469 are provided in ARG_TYPES. */
8471 tree
8473 {
8475 }
8477 /* Build a variable argument function type. RETURN_TYPE is the type
8478 returned by the function. The function takes N named arguments, the
8479 types of which are provided in ARG_TYPES. */
8481 tree
8483 {
8485 }
8487 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8488 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8489 for the method. An implicit additional parameter (of type
8490 pointer-to-BASETYPE) is added to the ARGTYPES. */
8492 tree
8494 tree rettype,
8495 tree argtypes)
8496 {
8497 tree t;
8498 tree ptype;
8500 tree canon_argtypes;
8502 /* Make a node of the sort we want. */
8509 /* The actual arglist for this function includes a "hidden" argument
8510 which is "this". Put it into the list of argument types. */
8514 /* If we already have such a type, use the old one. */
8518 /* Set up the canonical type. */
8519 any_structural_p
8522 any_noncanonical_p
8534 canon_argtypes);
8539 }
8541 /* Construct, lay out and return the type of methods belonging to class
8542 BASETYPE and whose arguments and values are described by TYPE.
8543 If that type exists already, reuse it.
8544 TYPE must be a FUNCTION_TYPE node. */
8546 tree
8548 {
8554 }
8556 /* Construct, lay out and return the type of offsets to a value
8557 of type TYPE, within an object of type BASETYPE.
8558 If a suitable offset type exists already, reuse it. */
8560 tree
8562 {
8563 tree t;
8565 /* Make a node of the sort we want. */
8571 /* If we already have such a type, use the old one. */
8579 {
8588 }
8591 }
8593 /* Create a complex type whose components are COMPONENT_TYPE.
8595 If NAMED is true, the type is given a TYPE_NAME. We do not always
8596 do so because this creates a DECL node and thus make the DECL_UIDs
8597 dependent on the type canonicalization hashtable, which is GC-ed,
8598 so the DECL_UIDs would not be stable wrt garbage collection. */
8600 tree
8602 {
8607 /* Make a node of the sort we want. */
8612 /* If we already have such a type, use the old one. */
8617 {
8618 /* We created a new type. The hash insertion will have laid
8619 out the type. We need to check the canonicalization and
8620 maybe set the name. */
8631 /* We need to create a name, since complex is a fundamental type. */
8633 {
8662 }
8663 }
8666 }
8668 /* If TYPE is a real or complex floating-point type and the target
8669 does not directly support arithmetic on TYPE then return the wider
8670 type to be used for arithmetic on TYPE. Otherwise, return
8671 NULL_TREE. */
8673 tree
8675 {
8676 /* The target can give two different responses to the question of
8677 which excess precision mode it would like depending on whether we
8678 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8680 enum excess_precision_type requested_type
8682 ? EXCESS_PRECISION_TYPE_FAST
8685 enum flt_eval_method target_flt_eval_method
8688 /* The target should not ask for unpredictable float evaluation (though
8689 it might advertise that implicitly the evaluation is unpredictable,
8690 but we don't care about that here, it will have been reported
8691 elsewhere). If it does ask for unpredictable evaluation, we have
8692 nothing to do here. */
8695 /* Nothing to do. The target has asked for all types we know about
8696 to be computed with their native precision and range. */
8700 /* The target will promote this type in a target-dependent way, so excess
8701 precision ought to leave it alone. */
8705 machine_mode float16_type_mode = (float16_type_node
8712 {
8714 {
8717 {
8735 }
8737 }
8739 {
8744 {
8762 }
8764 }
8767 }
8770 }
8771 \f
8772 /* Return OP, stripped of any conversions to wider types as much as is safe.
8773 Converting the value back to OP's type makes a value equivalent to OP.
8775 If FOR_TYPE is nonzero, we return a value which, if converted to
8776 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8778 OP must have integer, real or enumeral type. Pointers are not allowed!
8780 There are some cases where the obvious value we could return
8781 would regenerate to OP if converted to OP's type,
8782 but would not extend like OP to wider types.
8783 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8784 For example, if OP is (unsigned short)(signed char)-1,
8785 we avoid returning (signed char)-1 if FOR_TYPE is int,
8786 even though extending that to an unsigned short would regenerate OP,
8787 since the result of extending (signed char)-1 to (int)
8788 is different from (int) OP. */
8790 tree
8792 {
8793 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8795 unsigned final_prec
8797 int uns
8804 {
8807 /* TYPE_PRECISION on vector types has different meaning
8808 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8809 so avoid them here. */
8816 /* Truncations are many-one so cannot be removed.
8817 Unless we are later going to truncate down even farther. */
8822 /* See what's inside this conversion. If we decide to strip it,
8823 we will set WIN. */
8826 /* If we have not stripped any zero-extensions (uns is 0),
8827 we can strip any kind of extension.
8828 If we have previously stripped a zero-extension,
8829 only zero-extensions can safely be stripped.
8830 Any extension can be stripped if the bits it would produce
8831 are all going to be discarded later by truncating to FOR_TYPE. */
8834 {
8837 /* TYPE_UNSIGNED says whether this is a zero-extension.
8838 Let's avoid computing it if it does not affect WIN
8839 and if UNS will not be needed again. */
8843 {
8846 }
8847 }
8848 }
8850 /* If we finally reach a constant see if it fits in sth smaller and
8851 in that case convert it. */
8853 {
8859 {
8863 }
8864 }
8867 }
8868 \f
8869 /* Return OP or a simpler expression for a narrower value
8870 which can be sign-extended or zero-extended to give back OP.
8871 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8872 or 0 if the value should be sign-extended. */
8874 tree
8876 {
8883 {
8884 do
8898 ret);
8900 }
8902 {
8903 int bitschange
8907 /* Truncations are many-one so cannot be removed. */
8911 /* See what's inside this conversion. If we decide to strip it,
8912 we will set WIN. */
8915 {
8917 /* An extension: the outermost one can be stripped,
8918 but remember whether it is zero or sign extension. */
8921 /* Otherwise, if a sign extension has been stripped,
8922 only sign extensions can now be stripped;
8923 if a zero extension has been stripped, only zero-extensions. */
8927 }
8929 {
8930 /* A change in nominal type can always be stripped, but we must
8931 preserve the unsignedness. */
8936 /* Keep trying to narrow, but don't assign op to win if it
8937 would turn an integral type into something else. */
8940 }
8943 }
8946 /* Since type_for_size always gives an integer type. */
8949 /* Ensure field is laid out already. */
8952 {
8953 unsigned HOST_WIDE_INT innerprec
8959 /* We can get this structure field in a narrower type that fits it,
8960 but the resulting extension to its nominal type (a fullword type)
8961 must satisfy the same conditions as for other extensions.
8963 Do this only for fields that are aligned (not bit-fields),
8964 because when bit-field insns will be used there is no
8965 advantage in doing this. */
8971 {
8975 }
8976 }
8980 }
8981 \f
8982 /* Return true if integer constant C has a value that is permissible
8983 for TYPE, an integral type. */
8985 bool
8987 {
8992 /* Non-standard boolean types can have arbitrary precision but various
8993 transformations assume that they can only take values 0 and +/-1. */
8997 retry:
9001 /* If at least one bound of the type is a constant integer, we can check
9002 ourselves and maybe make a decision. If no such decision is possible, but
9003 this type is a subtype, try checking against that. Otherwise, use
9004 fits_to_tree_p, which checks against the precision.
9006 Compute the status for each possibly constant bound, and return if we see
9007 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9008 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9009 for "constant known to fit". */
9011 /* Check if c >= type_low_bound. */
9013 {
9017 }
9018 else
9021 /* Check if c <= type_high_bound. */
9023 {
9027 }
9028 else
9031 /* If the constant fits both bounds, the result is known. */
9035 /* Perform some generic filtering which may allow making a decision
9036 even if the bounds are not constant. First, negative integers
9037 never fit in unsigned types, */
9041 /* Second, narrower types always fit in wider ones. */
9045 /* Third, unsigned integers with top bit set never fit signed types. */
9047 {
9050 {
9051 /* When a tree_cst is converted to a wide-int, the precision
9052 is taken from the type. However, if the precision of the
9053 mode underneath the type is smaller than that, it is
9054 possible that the value will not fit. The test below
9055 fails if any bit is set between the sign bit of the
9056 underlying mode and the top bit of the type. */
9059 }
9062 }
9064 /* If we haven't been able to decide at this point, there nothing more we
9065 can check ourselves here. Look at the base type if we have one and it
9066 has the same precision. */
9070 {
9073 }
9075 /* Or to fits_to_tree_p, if nothing else. */
9077 }
9079 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9080 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9081 represented (assuming two's-complement arithmetic) within the bit
9082 precision of the type are returned instead. */
9084 void
9086 {
9090 else
9091 {
9094 else
9095 {
9098 }
9099 }
9104 else
9105 {
9108 }
9109 }
9111 /* Return true if VAR is an automatic variable. */
9113 bool
9115 {
9120 }
9122 /* Return true if VAR is an automatic variable defined in function FN. */
9124 bool
9126 {
9130 }
9132 /* Subprogram of following function. Called by walk_tree.
9134 Return *TP if it is an automatic variable or parameter of the
9135 function passed in as DATA. */
9137 static tree
9139 {
9150 }
9152 /* Returns true if T is, contains, or refers to a type with variable
9153 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9154 arguments, but not the return type. If FN is nonzero, only return
9155 true if a modifier of the type or position of FN is a variable or
9156 parameter inside FN.
9158 This concept is more general than that of C99 'variably modified types':
9159 in C99, a struct type is never variably modified because a VLA may not
9160 appear as a structure member. However, in GNU C code like:
9162 struct S { int i[f()]; };
9164 is valid, and other languages may define similar constructs. */
9166 bool
9168 {
9169 tree t;
9171 /* Test if T is either variable (if FN is zero) or an expression containing
9172 a variable in FN. If TYPE isn't gimplified, return true also if
9173 gimplify_one_sizepos would gimplify the expression into a local
9174 variable. */
9175 #define RETURN_TRUE_IF_VAR(T) \
9176 do { tree _t = (T); \
9177 if (_t != NULL_TREE \
9178 && _t != error_mark_node \
9179 && !CONSTANT_CLASS_P (_t) \
9180 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9181 && (!fn \
9182 || (!TYPE_SIZES_GIMPLIFIED (type) \
9183 && (TREE_CODE (_t) != VAR_DECL \
9184 && !CONTAINS_PLACEHOLDER_P (_t))) \
9185 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9186 return true; } while (0)
9191 /* If TYPE itself has variable size, it is variably modified. */
9196 {
9200 /* Ada can have pointer types refering to themselves indirectly. */
9205 {
9208 }
9214 /* If TYPE is a function type, it is variably modified if the
9215 return type is variably modified. */
9225 /* Scalar types are variably modified if their end points
9226 aren't constant. */
9234 /* We can't see if any of the fields are variably-modified by the
9235 definition we normally use, since that would produce infinite
9236 recursion via pointers. */
9237 /* This is variably modified if some field's type is. */
9240 {
9245 /* If the type is a qualified union, then the DECL_QUALIFIER
9246 of fields can also be an expression containing a variable. */
9250 /* If the field is a qualified union, then it's only a container
9251 for what's inside so we look into it. That's necessary in LTO
9252 mode because the sizes of the field tested above have been set
9253 to PLACEHOLDER_EXPRs by free_lang_data. */
9257 }
9261 /* Do not call ourselves to avoid infinite recursion. This is
9262 variably modified if the element type is. */
9269 }
9271 /* The current language may have other cases to check, but in general,
9272 all other types are not variably modified. */
9275 #undef RETURN_TRUE_IF_VAR
9276 }
9278 /* Given a DECL or TYPE, return the scope in which it was declared, or
9279 NULL_TREE if there is no containing scope. */
9281 tree
9283 {
9285 }
9287 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9289 const_tree
9291 {
9293 {
9296 else
9298 }
9300 }
9302 /* Return the innermost context enclosing DECL that is
9303 a FUNCTION_DECL, or zero if none. */
9305 tree
9307 {
9308 tree context;
9313 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9314 where we look up the function at runtime. Such functions always take
9315 a first argument of type 'pointer to real context'.
9317 C++ should really be fixed to use DECL_CONTEXT for the real context,
9318 and use something else for the "virtual context". */
9320 context
9321 = TYPE_MAIN_VARIANT
9323 else
9327 {
9330 else
9332 }
9335 }
9337 /* Return the innermost context enclosing DECL that is
9338 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9339 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9341 tree
9343 {
9348 {
9369 }
9372 }
9374 /* CALL is a CALL_EXPR. Return the declaration for the function
9375 called, or NULL_TREE if the called function cannot be
9376 determined. */
9378 tree
9380 {
9381 tree addr;
9386 /* It's invalid to call this function with anything but a
9387 CALL_EXPR. */
9390 /* The first operand to the CALL is the address of the function
9391 called. */
9394 /* If there is no function, return early. */
9400 /* If this is a readonly function pointer, extract its initial value. */
9406 /* If the address is just `&f' for some function `f', then we know
9407 that `f' is being called. */
9412 /* We couldn't figure out what was being called. */
9414 }
9416 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9417 return the associated function code, otherwise return CFN_LAST. */
9419 combined_fn
9421 {
9422 /* It's invalid to call this function with anything but a CALL_EXPR. */
9433 }
9435 /* Comparator of indices based on tree_node_counts. */
9437 static int
9439 {
9444 }
9446 /* Comparator of indices based on tree_code_counts. */
9448 static int
9450 {
9455 }
9457 #define TREE_MEM_USAGE_SPACES 40
9459 /* Print debugging information about tree nodes generated during the compile,
9460 and any language-specific information. */
9462 void
9464 {
9466 {
9472 {
9479 {
9486 }
9491 }
9493 {
9503 {
9508 }
9515 }
9516 }
9517 else
9524 }
9525 \f
9528 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9530 unsigned
9532 {
9533 /* This relies on the raw feedback's top 4 bits being zero. */
9534 #define FEEDBACK(X) ((X) * 0x04c11db7)
9535 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9536 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9538 {
9543 };
9544 #undef FEEDBACK
9545 #undef SYNDROME
9549 {
9553 }
9556 }
9558 /* Generate a crc32 of a string. */
9560 unsigned
9562 {
9563 do
9567 }
9569 /* P is a string that will be used in a symbol. Mask out any characters
9570 that are not valid in that context. */
9572 void
9574 {
9579 #endif
9582 #endif
9583 ))
9585 }
9589 /* Create a unique anonymous identifier. The identifier is still a
9590 valid assembly label. */
9592 tree
9594 {
9596 #if !defined (NO_DOT_IN_LABEL)
9597 "."
9598 #elif !defined (NO_DOLLAR_IN_LABEL)
9599 "$"
9600 #else
9601 "_"
9602 #endif
9613 }
9615 /* Generate a name for a special-purpose function.
9616 The generated name may need to be unique across the whole link.
9617 Changes to this function may also require corresponding changes to
9618 xstrdup_mask_random.
9619 TYPE is some string to identify the purpose of this function to the
9620 linker or collect2; it must start with an uppercase letter,
9621 one of:
9622 I - for constructors
9623 D - for destructors
9624 N - for C++ anonymous namespaces
9625 F - for DWARF unwind frame information. */
9627 tree
9629 {
9634 /* If we already have a name we know to be unique, just use that. */
9637 /* If the target is handling the constructors/destructors, they
9638 will be local to this file and the name is only necessary for
9639 debugging purposes.
9640 We also assign sub_I and sub_D sufixes to constructors called from
9641 the global static constructors. These are always local. */
9645 {
9649 /* Just use the file's basename, because the full pathname
9650 might be quite long. */
9652 }
9653 else
9654 {
9655 /* Otherwise, the name must be unique across the entire link.
9656 We don't have anything that we know to be unique to this translation
9657 unit, so use what we do have and throw in some randomness. */
9675 }
9681 /* Set up the name of the file-level functions we may need.
9682 Use a global object (which is already required to be unique over
9683 the program) rather than the file name (which imposes extra
9684 constraints). */
9688 }
9689 \f
9690 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9692 /* Complain that the tree code of NODE does not match the expected 0
9693 terminated list of trailing codes. The trailing code list can be
9694 empty, for a more vague error message. FILE, LINE, and FUNCTION
9695 are of the caller. */
9697 void
9700 {
9711 {
9718 {
9725 }
9727 }
9728 else
9734 }
9736 /* Complain that the tree code of NODE does match the expected 0
9737 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9738 the caller. */
9740 void
9743 {
9757 {
9759 {
9762 }
9765 }
9771 }
9773 /* Similar to tree_check_failed, except that we check for a class of tree
9774 code, given in CL. */
9776 void
9779 {
9780 internal_error
9785 }
9787 /* Similar to tree_check_failed, except that instead of specifying a
9788 dozen codes, use the knowledge that they're all sequential. */
9790 void
9794 {
9807 {
9814 }
9819 }
9822 /* Similar to tree_check_failed, except that we check that a tree does
9823 not have the specified code, given in CL. */
9825 void
9828 {
9829 internal_error
9834 }
9837 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9839 void
9842 {
9848 }
9851 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9853 void
9857 {
9870 {
9877 }
9882 }
9885 #undef DEFTREESTRUCT
9886 #define DEFTREESTRUCT(VAL, NAME) NAME,
9890 };
9891 #undef DEFTREESTRUCT
9893 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9895 /* Similar to tree_class_check_failed, except that we check for
9896 whether CODE contains the tree structure identified by EN. */
9898 void
9903 {
9904 internal_error
9908 }
9911 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9912 (dynamically sized) vector. */
9914 void
9917 {
9918 internal_error
9922 }
9924 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9925 (dynamically sized) vector. */
9927 void
9930 {
9931 internal_error
9934 }
9936 /* Similar to above, except that the check is for the bounds of the operand
9937 vector of an expression node EXP. */
9939 void
9942 {
9944 internal_error
9948 }
9950 /* Similar to above, except that the check is for the number of
9951 operands of an OMP_CLAUSE node. */
9953 void
9956 {
9957 internal_error
9962 }
9964 \f
9965 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9966 and mapped to the machine mode MODE. Initialize its fields and build
9967 the information necessary for debugging output. */
9969 static tree
9971 {
9972 tree t;
9993 /* We have built a main variant, based on the main variant of the
9994 inner type. Use it to build the variant we return. */
10002 }
10004 static tree
10006 {
10029 else
10031 }
10033 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10035 static tree
10037 {
10039 {
10051 }
10052 else
10053 {
10065 }
10068 }
10070 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10072 static tree
10074 {
10076 {
10088 }
10089 else
10090 {
10102 }
10105 }
10108 /* Create an atomic variant node for TYPE. This routine is called
10109 during initialization of data types to create the 5 basic atomic
10110 types. The generic build_variant_type function requires these to
10111 already be set up in order to function properly, so cannot be
10112 called from there. If ALIGN is non-zero, then ensure alignment is
10113 overridden to this value. */
10115 static tree
10117 {
10118 tree t;
10120 /* Make sure its not already registered. */
10131 }
10133 /* Information about the _FloatN and _FloatNx types. This must be in
10134 the same order as the corresponding TI_* enum values. */
10136 {
10144 };
10147 /* Create nodes for all integer types (and error_mark_node) using the sizes
10148 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10150 void
10152 {
10160 /* Define both `signed char' and `unsigned char'. */
10166 /* Define `char', which is like either `signed char' or `unsigned char'
10167 but not the same as either. */
10168 char_type_node
10169 = (signed_char
10184 {
10189 {
10192 }
10193 }
10195 /* Define a boolean type. This type only represents boolean values but
10196 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10202 /* Define what type to use for size_t. */
10211 else
10212 {
10218 {
10225 {
10227 }
10228 }
10231 }
10233 /* Define what type to use for ptrdiff_t. */
10242 else
10243 {
10247 {
10255 }
10258 }
10260 /* Fill in the rest of the sized types. Reuse existing type nodes
10261 when possible. */
10274 /* Don't call build_qualified type for atomics. That routine does
10275 special processing for atomics, and until they are initialized
10276 it's better not to make that call.
10278 Check to see if there is a target override for atomic types. */
10295 /* Define these next since types below may used them. */
10313 /* We are not going to have real types in C with less than byte alignment,
10314 so we might as well not have any types that claim to have it. */
10325 const_ptr_type_node
10347 {
10350 scalar_float_mode mode;
10354 /* Work around the rs6000 KFmode having precision 113 not
10355 128. */
10367 }
10374 /* Fixed size integer types. */
10379 /* Decimal float types. */
10381 {
10396 }
10405 {
10409 }
10411 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10412 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10413 sat_ ## KIND ## _type_node = \
10414 make_sat_signed_ ## KIND ## _type (SIZE); \
10415 sat_unsigned_ ## KIND ## _type_node = \
10416 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10417 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10418 unsigned_ ## KIND ## _type_node = \
10419 make_unsigned_ ## KIND ## _type (SIZE);
10421 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10422 sat_ ## WIDTH ## KIND ## _type_node = \
10423 make_sat_signed_ ## KIND ## _type (SIZE); \
10424 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10425 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10426 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10427 unsigned_ ## WIDTH ## KIND ## _type_node = \
10428 make_unsigned_ ## KIND ## _type (SIZE);
10430 /* Make fixed-point type nodes based on four different widths. */
10431 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10432 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10433 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10434 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10435 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10437 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10438 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10439 NAME ## _type_node = \
10440 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10441 u ## NAME ## _type_node = \
10442 make_or_reuse_unsigned_ ## KIND ## _type \
10443 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10444 sat_ ## NAME ## _type_node = \
10445 make_or_reuse_sat_signed_ ## KIND ## _type \
10446 (GET_MODE_BITSIZE (MODE ## mode)); \
10447 sat_u ## NAME ## _type_node = \
10448 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10449 (GET_MODE_BITSIZE (U ## MODE ## mode));
10451 /* Fixed-point type and mode nodes. */
10464 {
10467 /* Many back-ends define record types without setting TYPE_NAME.
10468 If we copied the record type here, we'd keep the original
10469 record type without a name. This breaks name mangling. So,
10470 don't copy record types and let c_common_nodes_and_builtins()
10471 declare the type to be __builtin_va_list. */
10476 }
10478 /* SCEV analyzer global shared trees. */
10483 }
10485 /* Modify DECL for given flags.
10486 TM_PURE attribute is set only on types, so the function will modify
10487 DECL's type when ECF_TM_PURE is used. */
10489 void
10491 {
10521 /* Looping const or pure is implied by noreturn.
10522 There is currently no way to declare looping const or looping pure alone. */
10525 }
10528 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10530 static void
10533 {
10534 tree decl;
10541 }
10543 /* Call this function after instantiating all builtins that the language
10544 front end cares about. This will build the rest of the builtins
10545 and internal functions that are relied upon by the tree optimizers and
10546 the middle-end. */
10548 void
10550 {
10556 {
10560 BUILT_IN_UNREACHABLE,
10568 }
10572 {
10583 }
10586 {
10589 NULL_TREE);
10592 }
10595 {
10601 }
10603 /* If we're checking the stack, `alloca' can throw. */
10604 const int alloca_flags
10608 {
10613 }
10618 BUILT_IN_ALLOCA_WITH_ALIGN,
10620 alloca_flags);
10625 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10627 alloca_flags);
10633 BUILT_IN_INIT_TRAMPOLINE,
10636 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10640 BUILT_IN_INIT_DESCRIPTOR,
10645 BUILT_IN_ADJUST_TRAMPOLINE,
10649 BUILT_IN_ADJUST_DESCRIPTOR,
10656 BUILT_IN_NONLOCAL_GOTO,
10663 BUILT_IN_SETJMP_SETUP,
10668 BUILT_IN_SETJMP_RECEIVER,
10677 BUILT_IN_STACK_RESTORE,
10682 NULL_TREE);
10695 /* If there's a possibility that we might use the ARM EABI, build the
10696 alternate __cxa_end_cleanup node used to resume from C++. */
10698 {
10701 BUILT_IN_CXA_END_CLEANUP,
10703 }
10707 BUILT_IN_UNWIND_RESUME,
10711 ECF_NORETURN);
10714 {
10716 NULL_TREE);
10718 BUILT_IN_RETURN_ADDRESS,
10720 ECF_NOTHROW);
10721 }
10725 {
10730 BUILT_IN_PROFILE_FUNC_ENTER,
10734 BUILT_IN_PROFILE_FUNC_EXIT,
10736 }
10738 /* The exception object and filter values from the runtime. The argument
10739 must be zero before exception lowering, i.e. from the front end. After
10740 exception lowering, it will be the region number for the exception
10741 landing pad. These functions are PURE instead of CONST to prevent
10742 them from being hoisted past the exception edge that will initialize
10743 its value in the landing pad. */
10747 /* Only use TM_PURE if we have TM language support. */
10760 NULL_TREE);
10762 BUILT_IN_EH_COPY_VALUES,
10765 /* Complex multiplication and division. These are handled as builtins
10766 rather than optabs because emit_library_call_value doesn't support
10767 complex. Further, we can do slightly better with folding these
10768 beasties if the real and complex parts of the arguments are separate. */
10769 {
10773 {
10800 /* For -ftrapping-math these should throw from a former
10801 -fnon-call-exception stmt. */
10803 NULL);
10809 NULL);
10813 }
10814 }
10817 }
10819 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10820 better way.
10822 If we requested a pointer to a vector, build up the pointers that
10823 we stripped off while looking for the inner type. Similarly for
10824 return values from functions.
10826 The argument TYPE is the top of the chain, and BOTTOM is the
10827 new type which we will point to. */
10829 tree
10831 {
10835 {
10839 }
10841 {
10845 }
10847 {
10850 }
10852 {
10855 }
10857 {
10859 /* The build_method_type_directly() routine prepends 'this' to argument list,
10860 so we must compensate by getting rid of it. */
10861 outer
10862 = build_method_type_directly
10864 inner,
10866 }
10868 {
10871 }
10872 else
10877 }
10879 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10880 the inner type. */
10881 tree
10883 {
10884 poly_int64 nunits;
10888 {
10900 /* Check that there are no leftover bits. */
10908 }
10911 }
10913 /* Similarly, but takes the inner type and number of units, which must be
10914 a power of two. */
10916 tree
10918 {
10920 }
10922 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10924 tree
10926 {
10934 }
10936 /* Build a vector type that holds one boolean result for each element of
10937 vector type VECTYPE. The public interface for this operation is
10938 truth_type_for. */
10940 static tree
10942 {
10946 machine_mode mask_mode;
10956 }
10958 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10959 set. */
10961 tree
10963 {
10965 tree cand;
10966 /* We always build the non-opaque variant before the opaque one,
10967 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10973 /* Othewise build a variant type and make sure to queue it after
10974 the non-opaque type. */
10982 }
10984 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10986 wide_int
10988 {
10989 /* First handle elements that are directly encoded. */
10994 /* Identify the pattern that contains element I and work out the index of
10995 the last encoded element for that pattern. */
11001 /* If there are no steps, the final encoded value is the right one. */
11005 /* Otherwise work out the value from the last two encoded elements. */
11010 }
11012 /* Return the value of element I of VECTOR_CST T. */
11014 tree
11016 {
11017 /* First handle elements that are directly encoded. */
11022 /* If there are no steps, the final encoded value is the right one. */
11024 {
11025 /* Identify the pattern that contains element I and work out the index of
11026 the last encoded element for that pattern. */
11031 }
11033 /* Otherwise work out the value from the last two encoded elements. */
11036 }
11038 /* Given an initializer INIT, return TRUE if INIT is zero or some
11039 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11040 null, set *NONZERO if and only if INIT is known not to be all
11041 zeros. The combination of return value of false and *NONZERO
11042 false implies that INIT may but need not be all zeros. Other
11043 combinations indicate definitive answers. */
11045 bool
11047 {
11052 /* Conservatively clear NONZERO and set it only if INIT is definitely
11053 not all zero. */
11061 {
11070 /* ??? Note that this is not correct for C4X float formats. There,
11071 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11072 negative exponent. */
11107 {
11112 tree elt;
11119 }
11122 {
11137 }
11138 /* Fall through. */
11141 {
11149 /* We need to loop through all elements to handle cases like
11150 "\0" and "\0foobar". */
11153 {
11156 }
11159 }
11163 }
11164 }
11166 /* Return true if EXPR is an initializer expression in which every element
11167 is a constant that is numerically equal to 0 or 1. The elements do not
11168 need to be equal to each other. */
11170 bool
11172 {
11176 {
11184 {
11191 {
11195 }
11198 }
11202 }
11203 }
11205 /* Check if vector VEC consists of all the equal elements and
11206 that the number of elements corresponds to the type of VEC.
11207 The function returns first element of the vector
11208 or NULL_TREE if the vector is not uniform. */
11209 tree
11211 {
11224 {
11228 }
11232 {
11236 {
11238 {
11241 }
11244 }
11249 }
11252 }
11254 /* If the argument is INTEGER_CST, return it. If the argument is vector
11255 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11256 return NULL_TREE.
11257 Look through location wrappers. */
11259 tree
11261 {
11268 {
11272 }
11275 }
11277 /* If VECTOR_CST T has a single nonzero element, return the index of that
11278 element, otherwise return -1. */
11280 int
11282 {
11288 {
11291 }
11292 else
11297 {
11300 {
11304 }
11305 }
11307 }
11309 /* Build an empty statement at location LOC. */
11311 tree
11313 {
11317 }
11320 /* Build an OpenMP clause with code CODE. LOC is the location of the
11321 clause. */
11323 tree
11325 {
11326 tree t;
11341 }
11343 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11344 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11345 Except for the CODE and operand count field, other storage for the
11346 object is initialized to zeros. */
11348 tree
11350 {
11351 tree t;
11363 /* Can't use TREE_OPERAND to store the length because if checking is
11364 enabled, it will try to check the length before we store it. :-P */
11368 }
11370 /* Helper function for build_call_* functions; build a CALL_EXPR with
11371 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11372 the argument slots. */
11374 static tree
11376 {
11377 tree t;
11385 }
11387 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11388 FN and a null static chain slot. NARGS is the number of call arguments
11389 which are specified as "..." arguments. */
11391 tree
11393 {
11394 tree ret;
11400 }
11402 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11403 FN and a null static chain slot. NARGS is the number of call arguments
11404 which are specified as a va_list ARGS. */
11406 tree
11408 {
11409 tree t;
11417 }
11419 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11420 FN and a null static chain slot. NARGS is the number of call arguments
11421 which are specified as a tree array ARGS. */
11423 tree
11426 {
11427 tree t;
11436 }
11438 /* Like build_call_array, but takes a vec. */
11440 tree
11442 {
11451 }
11453 /* Conveniently construct a function call expression. FNDECL names the
11454 function to be called and N arguments are passed in the array
11455 ARGARRAY. */
11457 tree
11459 {
11464 }
11466 /* Conveniently construct a function call expression. FNDECL names the
11467 function to be called and the arguments are passed in the vector
11468 VEC. */
11470 tree
11472 {
11475 }
11478 /* Conveniently construct a function call expression. FNDECL names the
11479 function to be called, N is the number of arguments, and the "..."
11480 parameters are the argument expressions. */
11482 tree
11484 {
11494 }
11496 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11497 varargs macros aren't supported by all bootstrap compilers. */
11499 tree
11501 {
11511 }
11513 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11514 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11515 It will get gimplified later into an ordinary internal function. */
11517 tree
11520 {
11528 }
11530 /* Build internal call expression. This is just like CALL_EXPR, except
11531 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11532 internal function. */
11534 tree
11537 {
11547 }
11549 /* Return a function call to FN, if the target is guaranteed to support it,
11550 or null otherwise.
11552 N is the number of arguments, passed in the "...", and TYPE is the
11553 type of the return value. */
11555 tree
11558 {
11568 {
11571 {
11574 OPTIMIZE_FOR_BOTH))
11576 }
11578 }
11579 else
11580 {
11585 }
11586 }
11588 /* Return a function call to the appropriate builtin alloca variant.
11590 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11591 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11592 bound for SIZE in case it is not a fixed value. */
11594 tree
11596 {
11598 {
11600 return
11602 }
11604 {
11607 }
11608 else
11609 {
11612 }
11613 }
11615 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11616 if SIZE == -1) and return a tree node representing char* pointer to
11617 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value
11618 is the LEN bytes at STR (the representation of the string, which may
11619 be wide). */
11621 tree
11625 {
11627 /* Set the maximum valid index based on the string length or SIZE. */
11628 unsigned HOST_WIDE_INT maxidx
11644 }
11648 /* Return true if T (assumed to be a DECL) must be assigned a memory
11649 location. */
11651 bool
11653 {
11659 }
11661 /* Return value of a constant X and sign-extend it. */
11663 HOST_WIDE_INT
11665 {
11669 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11673 {
11677 else
11679 }
11682 }
11684 /* If TYPE is an integral or pointer type, return an integer type with
11685 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11686 if TYPE is already an integer type of signedness UNSIGNEDP.
11687 If TYPE is a floating-point type, return an integer type with the same
11688 bitsize and with the signedness given by UNSIGNEDP; this is useful
11689 when doing bit-level operations on a floating-point value. */
11691 tree
11693 {
11698 {
11706 }
11709 {
11717 }
11726 else
11730 }
11732 /* If TYPE is an integral or pointer type, return an integer type with
11733 the same precision which is unsigned, or itself if TYPE is already an
11734 unsigned integer type. If TYPE is a floating-point type, return an
11735 unsigned integer type with the same bitsize as TYPE. */
11737 tree
11739 {
11741 }
11743 /* If TYPE is an integral or pointer type, return an integer type with
11744 the same precision which is signed, or itself if TYPE is already a
11745 signed integer type. If TYPE is a floating-point type, return a
11746 signed integer type with the same bitsize as TYPE. */
11748 tree
11750 {
11752 }
11754 /* If TYPE is a vector type, return a signed integer vector type with the
11755 same width and number of subparts. Otherwise return boolean_type_node. */
11757 tree
11759 {
11761 {
11765 }
11766 else
11768 }
11770 /* Returns the largest value obtainable by casting something in INNER type to
11771 OUTER type. */
11773 tree
11775 {
11781 /* Compute a unique number for every combination. */
11786 /* Determine the exponent to use. */
11788 {
11791 /* oprec <= iprec, outer: signed, inner: don't care. */
11796 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11800 /* oprec > iprec, outer: signed, inner: signed. */
11804 /* oprec > iprec, outer: signed, inner: unsigned. */
11808 /* oprec > iprec, outer: unsigned, inner: signed. */
11812 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11817 }
11821 }
11823 /* Returns the smallest value obtainable by casting something in INNER type to
11824 OUTER type. */
11826 tree
11828 {
11832 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11833 and obtain 0. */
11835 /* If we are widening something of an unsigned type, OUTER type
11836 contains all values of INNER type. In particular, both INNER
11837 and OUTER types have zero in common. */
11840 else
11841 {
11842 /* If we are widening a signed type to another signed type, we
11843 want to obtain -2^^(iprec-1). If we are keeping the
11844 precision or narrowing to a signed type, we want to obtain
11845 -2^(oprec-1). */
11850 }
11851 }
11853 /* Return nonzero if two operands that are suitable for PHI nodes are
11854 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11855 SSA_NAME or invariant. Note that this is strictly an optimization.
11856 That is, callers of this function can directly call operand_equal_p
11857 and get the same result, only slower. */
11859 int
11861 {
11867 }
11869 /* Returns number of zeros at the end of binary representation of X. */
11871 tree
11873 {
11875 }
11878 #define WALK_SUBTREE(NODE) \
11879 do \
11880 { \
11881 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11882 if (result) \
11883 return result; \
11884 } \
11885 while (0)
11887 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11888 be walked whenever a type is seen in the tree. Rest of operands and return
11889 value are as for walk_tree. */
11891 static tree
11894 {
11898 {
11902 /* We have to worry about mutually recursive pointers. These can't
11903 be written in C. They can in Ada. It's pathological, but
11904 there's an ACATS test (c38102a) that checks it. Deal with this
11905 by checking if we're pointing to another pointer, that one
11906 points to another pointer, that one does too, and we have no htab.
11907 If so, get a hash table. We check three levels deep to avoid
11908 the cost of the hash table if we don't need one. */
11913 {
11920 }
11922 /* fall through */
11931 /* Fall through. */
11935 {
11936 tree arg;
11938 /* We never want to walk into default arguments. */
11941 }
11945 /* Don't follow this nodes's type if a pointer for fear that
11946 we'll have infinite recursion. If we have a PSET, then we
11947 need not fear. */
11962 }
11965 }
11967 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11968 called with the DATA and the address of each sub-tree. If FUNC returns a
11969 non-NULL value, the traversal is stopped, and the value returned by FUNC
11970 is returned. If PSET is non-NULL it is used to record the nodes visited,
11971 and to avoid visiting a node more than once. */
11973 tree
11976 {
11979 tree result;
11981 #define WALK_SUBTREE_TAIL(NODE) \
11982 do \
11983 { \
11984 tp = & (NODE); \
11985 goto tail_recurse; \
11986 } \
11987 while (0)
11989 tail_recurse:
11990 /* Skip empty subtrees. */
11994 /* Don't walk the same tree twice, if the user has requested
11995 that we avoid doing so. */
11999 /* Call the function. */
12003 /* If we found something, return it. */
12009 /* Even if we didn't, FUNC may have decided that there was nothing
12010 interesting below this point in the tree. */
12012 {
12013 /* But we still need to check our siblings. */
12018 else
12020 }
12023 {
12027 }
12030 {
12043 /* None of these have subtrees other than those already walked
12044 above. */
12053 {
12059 /* Walk all elements but the first. */
12063 /* Now walk the first one as a tail call. */
12065 }
12072 {
12077 idx++)
12079 }
12086 {
12087 tree decl;
12089 {
12090 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12091 into declarations that are just mentioned, rather than
12092 declared; they don't really belong to this part of the tree.
12093 And, we can see cycles: the initializer for a declaration
12094 can refer to the declaration itself. */
12098 }
12100 }
12103 {
12104 tree_stmt_iterator i;
12107 }
12112 {
12116 /* FALLTHRU */
12161 /* FALLTHRU */
12196 {
12201 }
12221 {
12226 }
12230 }
12234 {
12237 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12238 But, we only want to walk once. */
12243 }
12246 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12247 defining. We only want to walk into these fields of a type in this
12248 case and not in the general case of a mere reference to the type.
12250 The criterion is as follows: if the field can be an expression, it
12251 must be walked only here. This should be in keeping with the fields
12252 that are directly gimplified in gimplify_type_sizes in order for the
12253 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12254 variable-sized types.
12256 Note that DECLs get walked as part of processing the BIND_EXPR. */
12258 {
12263 /* Call the function for the type. See if it returns anything or
12264 doesn't want us to continue. If we are to continue, walk both
12265 the normal fields and those for the declaration case. */
12270 /* But do not walk a pointed-to type since it may itself need to
12271 be walked in the declaration case if it isn't anonymous. */
12273 {
12277 }
12279 /* If this is a record type, also walk the fields. */
12281 {
12282 tree field;
12286 {
12287 /* We'd like to look at the type of the field, but we can
12288 easily get infinite recursion. So assume it's pointed
12289 to elsewhere in the tree. Also, ignore things that
12290 aren't fields. */
12299 }
12300 }
12302 /* Same for scalar types. */
12308 {
12311 }
12315 }
12316 /* FALLTHRU */
12320 {
12323 /* Walk over all the sub-trees of this operand. */
12326 /* Go through the subtrees. We need to do this in forward order so
12327 that the scope of a FOR_EXPR is handled properly. */
12329 {
12333 }
12334 }
12335 /* If this is a type, walk the needed fields in the type. */
12339 }
12341 /* We didn't find what we were looking for. */
12344 #undef WALK_SUBTREE_TAIL
12345 }
12346 #undef WALK_SUBTREE
12348 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12350 tree
12352 walk_tree_lh lh)
12353 {
12354 tree result;
12359 }
12362 tree
12364 {
12371 }
12373 void
12375 {
12379 {
12381 }
12382 else
12384 }
12386 /* Create a nameless artificial label and put it in the current
12387 function context. The label has a location of LOC. Returns the
12388 newly created label. */
12390 tree
12392 {
12400 }
12402 /* Given a tree, try to return a useful variable name that we can use
12403 to prefix a temporary that is being assigned the value of the tree.
12404 I.E. given <temp> = &A, return A. */
12408 {
12409 tree stripped_decl;
12416 {
12421 }
12422 else
12423 {
12425 {
12430 }
12431 }
12432 }
12434 /* Return true if TYPE has a variable argument list. */
12436 bool
12438 {
12439 function_args_iterator args_iter;
12446 {
12448 }
12451 }
12453 /* Return true if TYPE has a prototype. */
12455 bool
12457 {
12458 tree t;
12464 }
12466 /* If BLOCK is inlined from an __attribute__((__artificial__))
12467 routine, return pointer to location from where it has been
12468 called. */
12469 location_t *
12471 {
12476 {
12479 {
12480 /* If AO is an artificial inline, point RET to the
12481 call site locus at which it has been inlined and continue
12482 the loop, in case AO's caller is also an artificial
12483 inline. */
12487 else
12489 }
12494 }
12496 }
12499 /* If EXP is inlined from an __attribute__((__artificial__))
12500 function, return the location of the original call expression. */
12502 location_t
12504 {
12509 else
12511 }
12514 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12515 nodes. */
12517 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12519 hashval_t
12521 {
12529 {
12532 }
12537 else
12540 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12541 something else. */
12547 }
12549 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12550 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12551 same. */
12553 bool
12555 {
12568 else
12570 }
12572 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12574 tree
12576 {
12577 tree t;
12579 /* Use the cache of optimization nodes. */
12582 opts);
12587 {
12588 /* Insert this one into the hash table. */
12592 /* Make a new node for next time round. */
12594 }
12597 }
12599 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12601 tree
12603 {
12604 tree t;
12606 /* Use the cache of optimization nodes. */
12609 opts);
12614 {
12615 /* Insert this one into the hash table. */
12619 /* Make a new node for next time round. */
12621 }
12624 }
12626 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12627 so that they aren't saved during PCH writing. */
12629 void
12631 {
12636 }
12638 /* Determine the "ultimate origin" of a block. */
12640 tree
12642 {
12647 else
12648 {
12653 }
12654 }
12656 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12657 no instruction. */
12659 bool
12661 {
12662 /* Do not strip casts into or out of differing address spaces. */
12665 {
12670 }
12673 {
12674 /* We already know that outer_type is not a pointer with
12675 a non-generic address space. */
12677 }
12679 /* Use precision rather then machine mode when we can, which gives
12680 the correct answer even for submode (bit-field) types. */
12689 /* Otherwise fall back on comparing machine modes (e.g. for
12690 aggregate types, floats). */
12692 }
12694 /* Return true iff conversion in EXP generates no instruction. Mark
12695 it inline so that we fully inline into the stripping functions even
12696 though we have two uses of this function. */
12700 {
12715 }
12717 /* Return true iff conversion in EXP generates no instruction. Don't
12718 consider conversions changing the signedness. */
12720 static bool
12722 {
12733 }
12735 /* Strip conversions from EXP according to tree_nop_conversion and
12736 return the resulting expression. */
12738 tree
12740 {
12744 }
12746 /* Strip conversions from EXP according to tree_sign_nop_conversion
12747 and return the resulting expression. */
12749 tree
12751 {
12755 }
12757 /* Avoid any floating point extensions from EXP. */
12758 tree
12760 {
12763 /* For floating point constant look up the narrowest type that can hold
12764 it properly and handle it like (type)(narrowest_type)constant.
12765 This way we can optimize for instance a=a*2.0 where "a" is float
12766 but 2.0 is double constant. */
12768 {
12769 REAL_VALUE_TYPE orig;
12782 }
12801 }
12803 /* Strip out all handled components that produce invariant
12804 offsets. */
12806 const_tree
12808 {
12810 {
12812 {
12827 }
12829 }
12832 }
12836 /* Return the GCC personality function decl. */
12838 tree
12840 {
12844 }
12846 /* TARGET is a call target of GIMPLE call statement
12847 (obtained by gimple_call_fn). Return true if it is
12848 OBJ_TYPE_REF representing an virtual call of C++ method.
12849 (As opposed to OBJ_TYPE_REF representing objc calls
12850 through a cast where middle-end devirtualization machinery
12851 can't apply.) */
12853 bool
12855 {
12864 /* If we do not have BINFO associated, it means that type was built
12865 without devirtualization enabled. Do not consider this a virtual
12866 call. */
12870 }
12872 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12874 static tree
12876 {
12887 }
12889 /* Try to find a base info of BINFO that would have its field decl at offset
12890 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12891 found, return, otherwise return NULL_TREE. */
12893 tree
12895 {
12899 {
12901 tree fld;
12910 {
12918 }
12922 /* Offset 0 indicates the primary base, whose vtable contents are
12923 represented in the binfo for the derived class. */
12925 {
12927 /* Offsets in BINFO are in bytes relative to the whole structure
12928 while POS is in bits relative to the containing field. */
12935 {
12938 }
12941 else
12943 binfo_offset);
12944 }
12948 }
12949 }
12951 /* Returns true if X is a typedef decl. */
12953 bool
12955 {
12958 }
12960 /* Returns true iff TYPE is a type variant created for a typedef. */
12962 bool
12964 {
12966 }
12968 /* PR 84195: Replace control characters in "unescaped" with their
12969 escaped equivalents. Allow newlines if -fmessage-length has
12970 been set to a non-zero value. This is done here, rather than
12971 where the attribute is recorded as the message length can
12972 change between these two locations. */
12974 void
12976 {
12994 {
12998 {
13002 }
13005 {
13007 {
13008 /* We only allocate space for a new string if we
13009 actually encounter a control character that
13010 needs replacing. */
13014 }
13019 {
13028 }
13029 }
13032 }
13035 {
13039 }
13040 }
13042 /* Warn about a use of an identifier which was marked deprecated. Returns
13043 whether a warning was given. */
13045 bool
13047 {
13048 escaped_string msg;
13054 {
13058 {
13063 }
13064 }
13074 {
13075 auto_diagnostic_group d;
13079 else
13084 }
13086 {
13091 {
13097 }
13099 auto_diagnostic_group d;
13101 {
13105 else
13108 }
13109 else
13110 {
13114 else
13117 }
13121 }
13124 }
13126 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13127 somewhere in it. */
13129 bool
13131 {
13133 {
13138 }
13141 }
13143 /* Try to determine whether a TRY_CATCH expression can fall through.
13144 This is a subroutine of block_may_fallthru. */
13146 static bool
13148 {
13149 tree_stmt_iterator i;
13151 /* If the TRY block can fall through, the whole TRY_CATCH can
13152 fall through. */
13158 {
13160 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13161 catch expression and a body. The whole TRY_CATCH may fall
13162 through iff any of the catch bodies falls through. */
13164 {
13167 }
13171 /* The exception filter expression only matters if there is an
13172 exception. If the exception does not match EH_FILTER_TYPES,
13173 we will execute EH_FILTER_FAILURE, and we will fall through
13174 if that falls through. If the exception does match
13175 EH_FILTER_TYPES, the stack unwinder will continue up the
13176 stack, so we will not fall through. We don't know whether we
13177 will throw an exception which matches EH_FILTER_TYPES or not,
13178 so we just ignore EH_FILTER_TYPES and assume that we might
13179 throw an exception which doesn't match. */
13183 /* This case represents statements to be executed when an
13184 exception occurs. Those statements are implicitly followed
13185 by a RESX statement to resume execution after the exception.
13186 So in this case the TRY_CATCH never falls through. */
13188 }
13189 }
13191 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13192 need not be 100% accurate; simply be conservative and return true if we
13193 don't know. This is used only to avoid stupidly generating extra code.
13194 If we're wrong, we'll just delete the extra code later. */
13196 bool
13198 {
13199 /* This CONST_CAST is okay because expr_last returns its argument
13200 unmodified and we assign it to a const_tree. */
13204 {
13207 /* Easy cases. If the last statement of the block implies
13208 control transfer, then we can't fall through. */
13212 /* If there is a default: label or case labels cover all possible
13213 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13214 to some case label in all cases and all we care is whether the
13215 SWITCH_BODY falls through. */
13232 /* The finally clause is always executed after the try clause,
13233 so if it does not fall through, then the try-finally will not
13234 fall through. Otherwise, if the try clause does not fall
13235 through, then when the finally clause falls through it will
13236 resume execution wherever the try clause was going. So the
13237 whole try-finally will only fall through if both the try
13238 clause and the finally clause fall through. */
13248 else
13250 /* FALLTHRU */
13253 /* Functions that do not return do not fall through. */
13267 }
13268 }
13270 /* True if we are using EH to handle cleanups. */
13273 /* This routine is called from front ends to indicate eh should be used for
13274 cleanups. */
13275 void
13277 {
13279 }
13281 /* Query whether EH is used for cleanups. */
13282 bool
13284 {
13286 }
13288 /* Wrapper for tree_code_name to ensure that tree code is valid */
13291 {
13295 {
13299 }
13302 }
13304 /* Drops the TREE_OVERFLOW flag from T. */
13306 tree
13308 {
13311 /* For tree codes with a sharing machinery re-build the result. */
13315 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13316 and canonicalize the result. */
13318 {
13319 tree_vector_builder builder;
13323 {
13328 }
13330 }
13332 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13333 and drop the flag. */
13337 /* For constants that contain nested constants, drop the flag
13338 from those as well. */
13340 {
13345 }
13348 }
13350 /* Given a memory reference expression T, return its base address.
13351 The base address of a memory reference expression is the main
13352 object being referenced. For instance, the base address for
13353 'array[i].fld[j]' is 'array'. You can think of this as stripping
13354 away the offset part from a memory address.
13356 This function calls handled_component_p to strip away all the inner
13357 parts of the memory reference until it reaches the base object. */
13359 tree
13361 {
13370 /* ??? Either the alias oracle or all callers need to properly deal
13371 with WITH_SIZE_EXPRs before we can look through those. */
13376 }
13378 /* Return a tree of sizetype representing the size, in bytes, of the element
13379 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13381 tree
13383 {
13388 /* If a size was specified in the ARRAY_REF, it's the size measured
13389 in alignment units of the element type. So multiply by that value. */
13391 {
13392 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13393 sizetype from another type of the same width and signedness. */
13398 }
13400 /* Otherwise, take the size from that of the element type. Substitute
13401 any PLACEHOLDER_EXPR that we have. */
13402 else
13404 }
13406 /* Return a tree representing the lower bound of the array mentioned in
13407 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13409 tree
13411 {
13414 /* If a lower bound is specified in EXP, use it. */
13418 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13419 substituting for a PLACEHOLDER_EXPR as needed. */
13423 /* Otherwise, return a zero of the appropriate type. */
13427 }
13429 /* Return a tree representing the upper bound of the array mentioned in
13430 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13432 tree
13434 {
13437 /* If there is a domain type and it has an upper bound, use it, substituting
13438 for a PLACEHOLDER_EXPR as needed. */
13442 /* Otherwise fail. */
13444 }
13446 /* Returns true if REF is an array reference, component reference,
13447 or memory reference to an array at the end of a structure.
13448 If this is the case, the array may be allocated larger
13449 than its upper bound implies. */
13451 bool
13453 {
13454 tree atype;
13458 {
13461 }
13466 {
13472 {
13474 {
13480 }
13481 else
13483 }
13484 else
13486 }
13487 else
13495 {
13496 /* If the reference chain contains a component reference to a
13497 non-union type and there follows another field the reference
13498 is not at the end of a structure. */
13500 {
13502 {
13508 }
13509 }
13510 /* If we have a multi-dimensional array we do not consider
13511 a non-innermost dimension as flex array if the whole
13512 multi-dimensional array is at struct end.
13513 Same for an array of aggregates with a trailing array
13514 member. */
13518 ;
13519 /* If we view an underlying object as sth else then what we
13520 gathered up to now is what we have to rely on. */
13523 else
13527 }
13529 /* The array now is at struct end. Treat flexible arrays as
13530 always subject to extend, even into just padding constrained by
13531 an underlying decl. */
13541 /* If the reference is based on a declared entity, the size of the array
13542 is constrained by its given domain. (Do not trust commons PR/69368). */
13544 && !(flag_unconstrained_commons
13548 {
13549 /* Check whether the array domain covers all of the available
13550 padding. */
13551 poly_int64 offset;
13559 /* If at least one extra element fits it is a flexarray. */
13568 }
13571 }
13573 /* Return a tree representing the offset, in bytes, of the field referenced
13574 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13576 tree
13578 {
13583 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13584 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13585 value. */
13587 {
13588 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13589 sizetype from another type of the same width and signedness. */
13595 }
13597 /* Otherwise, take the offset from that of the field. Substitute
13598 any PLACEHOLDER_EXPR that we have. */
13599 else
13601 }
13603 /* Given the initializer INIT, return the initializer for the field
13604 DECL if it exists, otherwise null. Used to obtain the initializer
13605 for a flexible array member and determine its size. */
13607 static tree
13609 {
13615 {
13620 {
13624 }
13625 }
13628 }
13630 /* Determines the size of the member referenced by the COMPONENT_REF
13631 REF, using its initializer expression if necessary in order to
13632 determine the size of an initialized flexible array member.
13633 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13634 an interior zero-length array.
13635 Returns the size as sizetype (which might be zero for an object
13636 with an uninitialized flexible array member) or null if the size
13637 cannot be determined. */
13639 tree
13641 {
13652 {
13660 /* MEMBER is either an interior array or is an array with
13661 more than one element. */
13674 {
13678 /* MEMBER is an array with more than 1 element. */
13680 }
13681 }
13683 /* MEMBER is either a bona fide flexible array member, or a zero-length
13684 array member, or an array of length one treated as such. */
13686 /* If the reference is to a declared object and the member a true
13687 flexible array, try to determine its size from its initializer. */
13691 {
13702 }
13704 /* BASE is the declared object of which MEMBER is either a member
13705 or that is cast to REFTYPE (e.g., a char buffer used to store
13706 a REFTYPE object). */
13710 /* Determine the base type of the referenced object. If it's
13711 the same as REFTYPE and MEMBER has a known size, return it. */
13723 /* MEMBER is a true flexible array member. Compute its size from
13724 the initializer of the BASE object if it has one. */
13727 {
13730 {
13733 {
13734 /* Use the larger of the initializer size and the tail
13735 padding in the enclosing struct. */
13740 }
13743 }
13744 }
13747 {
13749 {
13754 /* The size of a flexible array member of an extern struct
13755 with no initializer cannot be determined (it's defined
13756 in another translation unit and can have an initializer
13757 with an arbitrary number of elements). */
13760 /* Use the size of the base struct or, for interior zero-length
13761 arrays, the size of the enclosing type. */
13763 }
13765 /* Use the size of the BASE object (possibly an array of some
13766 other type such as char used to store the struct). */
13768 else
13770 }
13772 /* If the flexible array member has a known size use the greater
13773 of it and the tail padding in the enclosing struct.
13774 Otherwise, when the size of the flexible array member is unknown
13775 and the referenced object is not a struct, use the size of its
13776 type when known. This detects sizes of array buffers when cast
13777 to struct types with flexible array members. */
13779 {
13782 {
13785 }
13787 }
13789 /* Return "don't know" for an external non-array object since its
13790 flexible array member can be initialized to have any number of
13791 elements. Otherwise, return zero because the flexible array
13792 member has no elements. */
13795 && (!typematch
13798 }
13800 /* Return the machine mode of T. For vectors, returns the mode of the
13801 inner type. The main use case is to feed the result to HONOR_NANS,
13802 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13804 machine_mode
13806 {
13812 }
13814 /* Vector types need to re-check the target flags each time we report
13815 the machine mode. We need to do this because attribute target can
13816 change the result of vector_mode_supported_p and have_regs_of_mode
13817 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13818 change on a per-function basis. */
13819 /* ??? Possibly a better solution is to run through all the types
13820 referenced by a function and re-compute the TYPE_MODE once, rather
13821 than make the TYPE_MODE macro call a function. */
13823 machine_mode
13825 {
13826 machine_mode mode;
13834 {
13835 scalar_int_mode innermode;
13837 /* For integers, try mapping it to a same-sized scalar mode. */
13839 {
13842 scalar_int_mode mode;
13846 }
13849 }
13852 }
13854 /* Verify that basic properties of T match TV and thus T can be a variant of
13855 TV. TV should be the more specified variant (i.e. the main variant). */
13857 static bool
13859 {
13860 /* Type variant can differ by:
13862 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13863 ENCODE_QUAL_ADDR_SPACE.
13864 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13865 in this case some values may not be set in the variant types
13866 (see TYPE_COMPLETE_P checks).
13867 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13868 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13869 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13870 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13871 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13872 this is necessary to make it possible to merge types form different TUs
13873 - arrays, pointers and references may have TREE_TYPE that is a variant
13874 of TREE_TYPE of their main variants.
13875 - aggregates may have new TYPE_FIELDS list that list variants of
13876 the main variant TYPE_FIELDS.
13877 - vector types may differ by TYPE_VECTOR_OPAQUE
13878 */
13880 /* Convenience macro for matching individual fields. */
13881 #define verify_variant_match(flag) \
13882 do { \
13883 if (flag (tv) != flag (t)) \
13884 { \
13886 debug_tree (tv); \
13887 return false; \
13888 } \
13889 } while (false)
13891 /* tree_base checks. */
13894 /* FIXME: Ada builds non-artificial variants of artificial types. */
13899 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13906 else
13908 /* FIXME: This check trigger during libstdc++ build. */
13912 /* tree_type_common checks. */
13915 {
13923 {
13933 }
13935 }
13941 /* During LTO we merge variant lists from diferent translation units
13942 that may differ BY TYPE_CONTEXT that in turn may point
13943 to TRANSLATION_UNIT_DECL.
13944 Ada also builds variants of types with different TYPE_CONTEXT. */
13952 {
13956 }
13958 /* tree_type_non_common checks. */
13960 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13961 and dangle the pointer from time to time. */
13965 {
13969 }
13975 {
13978 }
13985 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13986 or even type's main variant. This is needed to make bootstrap pass
13987 and the bug seems new in GCC 5.
13988 C++ FE should be updated to make this consistent and we should check
13989 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13990 is a match with main variant.
13992 Also disable the check for Java for now because of parser hack that builds
13993 first an dummy BINFO and then sometimes replace it by real BINFO in some
13994 of the copies. */
13997 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13998 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13999 at LTO time only. */
14001 {
14009 }
14011 /* Check various uses of TYPE_VALUES_RAW. */
14017 /* Permit incomplete variants of complete type. While FEs may complete
14018 all variants, this does not happen for C++ templates in all cases. */
14022 {
14025 /* Fortran builds qualified variants as new records with items of
14026 qualified type. Verify that they looks same. */
14033 /* FIXME: gfc_nonrestricted_type builds all types as variants
14034 with exception of pointer types. It deeply copies the type
14035 which means that we may end up with a variant type
14036 referring non-variant pointer. We may change it to
14037 produce types as variants, too, like
14038 objc_get_protocol_qualified_type does. */
14044 {
14052 }
14053 }
14056 /* For C++ the qualified variant of array type is really an array type
14057 of qualified TREE_TYPE.
14058 objc builds variants of pointer where pointer to type is a variant, too
14059 in objc_get_protocol_qualified_type. */
14065 {
14073 }
14076 {
14084 }
14086 #undef verify_variant_match
14087 }
14090 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14091 the middle-end types_compatible_p function. It needs to avoid
14092 claiming types are different for types that should be treated
14093 the same with respect to TBAA. Canonical types are also used
14094 for IL consistency checks via the useless_type_conversion_p
14095 predicate which does not handle all type kinds itself but falls
14096 back to pointer-comparison of TYPE_CANONICAL for aggregates
14097 for example. */
14099 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14100 type calculation because we need to allow inter-operability between signed
14101 and unsigned variants. */
14103 bool
14105 {
14106 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14107 signed char and unsigned char. Similarly fortran FE builds
14108 C_SIZE_T as signed type, while C defines it unsigned. */
14111 == INTEGER_TYPE
14114 }
14116 /* Return true iff T1 and T2 are structurally identical for what
14117 TBAA is concerned.
14118 This function is used both by lto.c canonical type merging and by the
14119 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14120 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14121 only for LTO because only in these cases TYPE_CANONICAL equivalence
14122 correspond to one defined by gimple_canonical_types_compatible_p. */
14124 bool
14127 {
14128 /* Type variants should be same as the main variant. When not doing sanity
14129 checking to verify this fact, go to main variants and save some work. */
14131 {
14134 }
14136 /* Check first for the obvious case of pointer identity. */
14140 /* Check that we have two types to compare. */
14144 /* We consider complete types always compatible with incomplete type.
14145 This does not make sense for canonical type calculation and thus we
14146 need to ensure that we are never called on it.
14148 FIXME: For more correctness the function probably should have three modes
14149 1) mode assuming that types are complete mathcing their structure
14150 2) mode allowing incomplete types but producing equivalence classes
14151 and thus ignoring all info from complete types
14152 3) mode allowing incomplete types to match complete but checking
14153 compatibility between complete types.
14155 1 and 2 can be used for canonical type calculation. 3 is the real
14156 definition of type compatibility that can be used i.e. for warnings during
14157 declaration merging. */
14162 /* If the types have been previously registered and found equal
14163 they still are. */
14167 {
14168 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14169 they are always NULL, but they are set to non-NULL for types
14170 constructed by build_pointer_type and variants. In this case the
14171 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14172 all pointers are considered equal. Be sure to not return false
14173 negatives. */
14177 }
14179 /* For types where we do ODR based TBAA the canonical type is always
14180 set correctly, so we know that types are different if their
14181 canonical types does not match. */
14187 /* Can't be the same type if the types don't have the same code. */
14192 /* Qualifiers do not matter for canonical type comparison purposes. */
14194 /* Void types and nullptr types are always the same. */
14199 /* Can't be the same type if they have different mode. */
14203 /* Non-aggregate types can be handled cheaply. */
14211 {
14212 /* Can't be the same type if they have different recision. */
14216 /* In some cases the signed and unsigned types are required to be
14217 inter-operable. */
14222 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14223 interoperable with "signed char". Unless all frontends are revisited
14224 to agree on these types, we must ignore the flag completely. */
14226 /* Fortran standard define C_PTR type that is compatible with every
14227 C pointer. For this reason we need to glob all pointers into one.
14228 Still pointers in different address spaces are not compatible. */
14230 {
14234 }
14236 /* Tail-recurse to components. */
14241 trust_type_canonical);
14244 }
14246 /* Do type-specific comparisons. */
14248 {
14250 /* Array types are the same if the element types are the same and
14251 the number of elements are the same. */
14253 trust_type_canonical)
14258 else
14259 {
14263 /* For an incomplete external array, the type domain can be
14264 NULL_TREE. Check this condition also. */
14269 else
14270 {
14276 /* The minimum/maximum values have to be the same. */
14288 else
14290 }
14291 }
14295 /* Function types are the same if the return type and arguments types
14296 are the same. */
14298 trust_type_canonical))
14303 else
14304 {
14310 {
14313 trust_type_canonical))
14315 }
14321 }
14326 {
14329 /* Don't try to compare variants of an incomplete type, before
14330 TYPE_FIELDS has been copied around. */
14338 /* For aggregate types, all the fields must be the same. */
14342 {
14343 /* Skip non-fields and zero-sized fields. */
14354 /* The fields must have the same name, offset and type. */
14357 || !gimple_canonical_types_compatible_p
14359 trust_type_canonical))
14361 }
14363 /* If one aggregate has more fields than the other, they
14364 are not the same. */
14369 }
14372 /* Consider all types with language specific trees in them mutually
14373 compatible. This is executed only from verify_type and false
14374 positives can be tolerated. */
14377 }
14378 }
14380 /* Verify type T. */
14382 void
14384 {
14388 {
14391 }
14393 {
14397 }
14403 ;
14405 {
14409 }
14410 /* Method and function types cannot be used to address memory and thus
14411 TYPE_CANONICAL really matters only for determining useless conversions.
14413 FIXME: C++ FE produce declarations of builtin functions that are not
14414 compatible with main variants. */
14416 ;
14418 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14419 with variably sized arrays because their sizes possibly
14420 gimplified to different variables. */
14424 {
14428 }
14432 {
14436 }
14438 {
14443 }
14446 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14448 {
14449 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14450 and danagle the pointer from time to time. */
14454 {
14458 }
14459 }
14461 {
14464 {
14468 }
14469 }
14471 {
14474 {
14478 }
14479 }
14482 {
14483 /* FIXME: The following check should pass:
14484 useless_type_conversion_p (const_cast <tree> (t),
14485 TREE_TYPE (TYPE_MIN_VALUE (t))
14486 but does not for C sizetypes in LTO. */
14487 }
14489 /* Check various uses of TYPE_MAXVAL_RAW. */
14491 {
14493 ;
14495 {
14499 }
14501 {
14505 }
14506 }
14508 {
14512 {
14516 }
14517 }
14519 {
14523 {
14527 }
14528 }
14531 {
14532 /* FIXME: The following check should pass:
14533 useless_type_conversion_p (const_cast <tree> (t),
14534 TREE_TYPE (TYPE_MAX_VALUE (t))
14535 but does not for C sizetypes in LTO. */
14536 }
14538 {
14541 {
14545 }
14546 }
14548 {
14552 }
14555 {
14559 }
14561 /* Check various uses of TYPE_VALUES_RAW. */
14564 {
14568 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14569 CONST_DECL of ENUMERAL TYPE. */
14571 {
14576 }
14579 {
14585 }
14587 {
14592 }
14593 }
14595 {
14597 {
14601 }
14602 }
14604 {
14606 {
14609 }
14611 {
14612 /* TODO: verify properties of decls. */
14614 ;
14616 ;
14618 ;
14620 ;
14622 ;
14624 ;
14626 ;
14627 else
14628 {
14632 }
14633 }
14634 }
14641 {
14643 {
14648 }
14650 {
14654 }
14655 /* Verify just enough of cache to ensure that no one copied it to new type.
14656 All copying should go by copy_node that should clear it. */
14658 {
14663 {
14668 }
14669 }
14670 }
14673 {
14674 /* C++ FE uses TREE_PURPOSE to store initial values. */
14676 {
14680 }
14682 {
14686 }
14687 }
14689 {
14693 }
14701 {
14704 }
14706 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14707 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14708 of a type. */
14711 {
14714 }
14717 {
14720 }
14721 }
14724 /* Return 1 if ARG interpreted as signed in its precision is known to be
14725 always positive or 2 if ARG is known to be always negative, or 3 if
14726 ARG may be positive or negative. */
14728 int
14730 {
14737 {
14741 else
14743 }
14747 {
14749 /* Narrower value zero extended into wider type
14750 will always result in positive values. */
14757 }
14763 {
14767 {
14771 {
14780 }
14781 }
14783 }
14785 {
14786 /* For unsigned values, the "positive" range comes
14787 below the "negative" range. */
14792 }
14793 else
14794 {
14799 }
14801 }
14806 /* Return true if ARG is marked with the nonnull attribute in the
14807 current function signature. */
14809 bool
14811 {
14819 /* The static chain decl is always non null. */
14823 /* THIS argument of method is always non-NULL. */
14829 /* Values passed by reference are always non-NULL. */
14836 {
14839 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14843 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14847 /* Get the position number for ARG in the function signature. */
14849 t;
14851 {
14854 }
14858 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14860 {
14863 }
14864 }
14867 }
14869 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14870 information. */
14872 location_t
14874 {
14878 }
14880 location_t
14882 {
14883 source_range src_range;
14887 }
14889 location_t
14891 {
14897 pure_loc,
14898 src_range,
14899 NULL);
14902 }
14904 /* Return EXPR, potentially wrapped with a node expression LOC,
14905 if !CAN_HAVE_LOCATION_P (expr).
14907 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14908 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14910 Wrapper nodes can be identified using location_wrapper_p. */
14912 tree
14914 {
14921 /* We should only be adding wrappers for constants and for decls,
14922 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14927 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14928 any impact of the wrapper nodes. */
14932 /* If any auto_suppress_location_wrappers are active, don't create
14933 wrappers. */
14937 tree_code code
14942 /* Mark this node as being a wrapper. */
14945 }
14949 /* Return the name of combined function FN, for debugging purposes. */
14953 {
14955 {
14958 }
14959 else
14961 }
14963 /* Return a bitmap with a bit set corresponding to each argument in
14964 a function call type FNTYPE declared with attribute nonnull,
14965 or null if none of the function's argument are nonnull. The caller
14966 must free the bitmap. */
14968 bitmap
14970 {
14980 /* A function declaration can specify multiple attribute nonnull,
14981 each with zero or more arguments. The loop below creates a bitmap
14982 representing a union of all the arguments. An empty (but non-null)
14983 bitmap means that all arguments have been declaraed nonnull. */
14985 {
14994 {
14995 /* Clear the bitmap in case a previous attribute nonnull
14996 set it and this one overrides it for all arguments. */
14999 }
15001 /* Iterate over the indices of the format arguments declared nonnull
15002 and set a bit for each. */
15004 {
15007 }
15008 }
15011 }
15013 /* Returns true if TYPE is a type where it and all of its subobjects
15014 (recursively) are of structure, union, or array type. */
15016 static bool
15018 {
15020 {
15027 }
15033 }
15035 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15036 that shouldn't be passed via stack. */
15038 bool
15040 {
15051 }
15053 /* Determine whether TYPE is a structure with a flexible array member,
15054 or a union containing such a structure (possibly recursively). */
15056 bool
15058 {
15061 {
15077 {
15081 }
15085 }
15086 }
15088 /* Like int_size_in_bytes, but handle empty records specially. */
15090 HOST_WIDE_INT
15092 {
15094 }
15096 /* Like size_in_bytes, but handle empty records specially. */
15098 tree
15100 {
15102 }
15104 /* Return true if an expression with CODE has to have the same result type as
15105 its first operand. */
15107 bool
15109 {
15111 {
15145 }
15146 }
15148 /* Return a typenode for the "standard" C type with a given name. */
15149 tree
15151 {
15183 }
15185 /* List of pointer types used to declare builtins before we have seen their
15186 real declaration.
15188 Keep the size up to date in tree.h ! */
15190 {
15197 };
15199 /* Return the maximum object size. */
15201 tree
15203 {
15204 /* To do: Make this a configurable parameter. */
15206 }
15208 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15209 parameter default to false and that weeds out error_mark_node. */
15211 bool
15214 {
15221 }
15223 #if CHECKING_P
15227 /* Selftests for tree. */
15229 /* Verify that integer constants are sane. */
15231 static void
15233 {
15246 }
15248 /* Verify identifiers. */
15250 static void
15252 {
15256 }
15258 /* Verify LABEL_DECL. */
15260 static void
15262 {
15268 }
15270 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15271 are given by VALS. */
15273 static tree
15275 {
15280 }
15282 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15284 static void
15286 {
15292 }
15294 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15295 and that its elements match EXPECTED. */
15297 static void
15300 {
15307 }
15309 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15310 and NPATTERNS background elements, and that its elements match
15311 EXPECTED. */
15313 static void
15316 {
15323 }
15325 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15326 and that its elements match EXPECTED. */
15328 static void
15331 {
15338 }
15340 /* Test the creation of VECTOR_CSTs. */
15342 static void
15344 {
15350 /* Test a simple linear series with a base of 0 and a step of 1:
15351 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15357 /* Try the same with the first element replaced by 100:
15358 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15363 /* Try a series that wraps around.
15364 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15370 /* Try a downward series:
15371 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15377 /* Try two interleaved series with different bases and steps:
15378 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15381 {
15384 }
15388 /* Try a duplicated value:
15389 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15395 /* Try an interleaved duplicated value:
15396 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15403 /* Try a duplicated value with 2 exceptions
15404 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15410 /* Try with and without a step
15411 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15417 /* Try a fully-general constant:
15418 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15422 }
15424 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15425 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15426 modifying its argument in-place. */
15428 static void
15430 {
15433 }
15435 /* Verify location wrappers. */
15437 static void
15439 {
15444 /* Wrapping a constant. */
15454 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15457 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15462 /* Wrapping a STRING_CST. */
15474 /* Wrapping a variable. */
15477 integer_type_node);
15486 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15487 wrapper. */
15492 /* Verify that STRIP_NOPS removes wrappers. */
15496 }
15498 /* Test various tree predicates. Verify that location wrappers don't
15499 affect the results. */
15501 static void
15503 {
15504 /* Build various constants and wrappers around them. */
15532 /* TODO: vector constants. */
15534 /* Test integer_onep. */
15554 /* Test integer_zerop. */
15574 /* Test integer_all_onesp. */
15594 /* Test integer_minus_onep. */
15614 /* Test integer_each_onep. */
15634 /* Test integer_truep. */
15654 /* Test integer_nonzerop. */
15674 /* Test real_zerop. */
15694 /* Test real_onep. */
15714 /* Test real_minus_onep. */
15734 /* Test zerop. */
15754 /* Test tree_expr_nonnegative_p. */
15774 /* Test tree_expr_nonzero_p. */
15782 /* Test integer_valued_real_p. */
15789 /* Test integer_pow2p. */
15794 /* Test uniform_integer_cst_p. */
15813 }
15815 /* Check that string escaping works correctly. */
15817 static void
15819 {
15821 escaped_string msg;
15824 /* ASSERT_STREQ does not accept NULL as a valid test
15825 result, so we have to use ASSERT_EQ instead. */
15834 /* Ensure that we have -fmessage-length set to 0. */
15844 /* Now repeat the tests with -fmessage-length set to 5. */
15847 /* Note that the newline is not translated into an escape. */
15854 /* Restore the original message length setting. */
15856 }
15858 /* Run all of the selftests within this file. */
15860 void
15862 {
15870 }