| blob | 0ddf002e9eb1dabd8e65eab9531a685a469a2750 |
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 {
5149 }
5151 /* Data used when collecting DECLs and TYPEs for language data removal. */
5153 class free_lang_data_d
5154 {
5158 /* Worklist to avoid excessive recursion. */
5161 /* Set of traversed objects. Used to avoid duplicate visits. */
5164 /* Array of symbols to process with free_lang_data_in_decl. */
5167 /* Array of types to process with free_lang_data_in_type. */
5169 };
5172 /* Add type or decl T to one of the list of tree nodes that need their
5173 language data removed. The lists are held inside FLD. */
5175 static void
5177 {
5182 else
5184 }
5186 /* Push tree node T into FLD->WORKLIST. */
5190 {
5193 }
5196 \f
5197 /* Return simplified TYPE_NAME of TYPE. */
5199 static tree
5201 {
5204 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5205 TYPE_DECL if the type doesn't have linkage.
5206 this must match fld_ */
5214 }
5216 /* Do same comparsion as check_qualified_type skipping lang part of type
5217 and be more permissive about type names: we only care that names are
5218 same (for diagnostics) and that ODR names are the same.
5219 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5221 static bool
5223 {
5225 /* We want to match incomplete variants with complete types.
5226 In this case we need to ignore alignment. */
5237 }
5239 /* Find variant of FIRST that match T and create new one if necessary.
5240 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5242 static tree
5245 {
5260 /* Variants of incomplete types should have alignment
5261 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5263 {
5266 }
5273 }
5275 /* Map complete types to incomplete types. */
5279 /* Map types to simplified types. */
5283 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5284 use MAP to prevent duplicates. */
5286 static tree
5289 {
5294 {
5295 return fld_type_variant
5299 }
5302 tree &array
5305 {
5306 array
5312 }
5314 }
5316 /* Return CTX after removal of contexts that are not relevant */
5318 static tree
5320 {
5321 /* Variably modified types are needed for tree_is_indexable to decide
5322 whether the type needs to go to local or global section.
5323 This code is semi-broken but for now it is easiest to keep contexts
5324 as expected. */
5327 {
5330 }
5332 }
5334 /* For T being aggregate type try to turn it into a incomplete variant.
5335 Return T if no simplification is possible. */
5337 static tree
5339 {
5343 {
5346 {
5347 tree first;
5351 else
5359 }
5361 }
5370 {
5372 tree ©
5376 {
5379 /* It is possible that type was not seen by free_lang_data yet. */
5388 {
5396 }
5397 else
5398 {
5402 }
5404 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5405 This is needed for ODR violation warnings to come out right (we
5406 want duplicate TYPE_DECLs whenever the type is duplicated because
5407 of ODR violation. Because lang data in the TYPE_DECL may not
5408 have been freed yet, rebuild it from scratch and copy relevant
5409 fields. */
5414 {
5424 }
5425 }
5427 }
5430 }
5432 /* Simplify type T for scenarios where we do not need complete pointer
5433 types. */
5435 static tree
5437 {
5442 /* FIXME: This triggers verification error, see PR88140. */
5447 }
5449 /* Reset the expression *EXPR_P, a size or position.
5451 ??? We could reset all non-constant sizes or positions. But it's cheap
5452 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5454 We need to reset self-referential sizes or positions because they cannot
5455 be gimplified and thus can contain a CALL_EXPR after the gimplification
5456 is finished, which will run afoul of LTO streaming. And they need to be
5457 reset to something essentially dummy but not constant, so as to preserve
5458 the properties of the object they are attached to. */
5462 {
5466 }
5469 /* Reset all the fields in a binfo node BINFO. We only keep
5470 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5472 static void
5474 {
5476 tree t;
5489 }
5492 /* Reset all language specific information still present in TYPE. */
5494 static void
5496 {
5499 /* Give the FE a chance to remove its own data first. */
5512 /* Purge non-marked variants from the variants chain, so that they
5513 don't reappear in the IL after free_lang_data. */
5516 {
5519 /* Turn the removed types into distinct types. */
5522 }
5525 {
5527 /* Remove the const and volatile qualifiers from arguments. The
5528 C++ front end removes them, but the C front end does not,
5529 leading to false ODR violation errors when merging two
5530 instances of the same function signature compiled by
5531 different front ends. */
5533 {
5538 {
5540 & ~TYPE_QUAL_CONST
5545 }
5546 /* C++ FE uses TREE_PURPOSE to store initial values. */
5548 }
5549 }
5551 {
5554 {
5555 /* C++ FE uses TREE_PURPOSE to store initial values. */
5558 }
5559 }
5561 {
5562 /* Remove members that are not FIELD_DECLs from the field list
5563 of an aggregate. These occur in C++. */
5567 else
5573 {
5575 /* We need to preserve link to bases and virtual table for all
5576 polymorphic types to make devirtualization machinery working. */
5579 }
5580 }
5584 {
5586 {
5589 /* Type values are used only for C++ ODR checking. Drop them
5590 for all type variants and non-ODR types.
5591 For ODR types the data is freed in free_odr_warning_data. */
5595 else
5596 /* Simplify representation by recording only values rather
5597 than const decls. */
5601 }
5604 }
5613 {
5615 do
5616 {
5618 }
5621 }
5625 }
5628 /* Return true if DECL may need an assembler name to be set. */
5632 {
5633 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5634 Rule merging. This makes type_odr_p to return true on those types during
5635 LTO and by comparing the mangled name, we can say what types are intended
5636 to be equivalent across compilation unit.
5638 We do not store names of type_in_anonymous_namespace_p.
5640 Record, union and enumeration type have linkage that allows use
5641 to check type_in_anonymous_namespace_p. We do not mangle compound types
5642 that always can be compared structurally.
5644 Similarly for builtin types, we compare properties of their main variant.
5645 A special case are integer types where mangling do make differences
5646 between char/signed char/unsigned char etc. Storing name for these makes
5647 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5648 See cp/mangle.c:write_builtin_type for details. */
5651 {
5664 }
5665 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5669 /* If DECL already has its assembler name set, it does not need a
5670 new one. */
5675 /* Abstract decls do not need an assembler name. */
5679 /* For VAR_DECLs, only static, public and external symbols need an
5680 assembler name. */
5688 {
5689 /* Do not set assembler name on builtins. Allow RTL expansion to
5690 decide whether to expand inline or via a regular call. */
5695 /* Functions represented in the callgraph need an assembler name. */
5699 /* Unused and not public functions don't need an assembler name. */
5702 }
5705 }
5708 /* Reset all language specific information still present in symbol
5709 DECL. */
5711 static void
5713 {
5716 /* Give the FE a chance to remove its own data first. */
5730 {
5735 }
5738 {
5740 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5741 the address may be taken in other unit, so this flag has no practical
5742 use for middle-end.
5744 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5745 for public objects that indeed cannot be adressed, but it is not
5746 the case. Set the flag to true so we do not get merge failures for
5747 i.e. virtual tables between units that take address of it and
5748 units that don't. */
5754 {
5757 else
5758 {
5763 }
5764 }
5766 {
5767 tree t;
5769 /* If DECL has a gimple body, then the context for its
5770 arguments must be DECL. Otherwise, it doesn't really
5771 matter, as we will not be emitting any code for DECL. In
5772 general, there may be other instances of DECL created by
5773 the front end and since PARM_DECLs are generally shared,
5774 their DECL_CONTEXT changes as the replicas of DECL are
5775 created. The only time where DECL_CONTEXT is important
5776 is for the FUNCTION_DECLs that have a gimple body (since
5777 the PARM_DECL will be used in the function's body). */
5786 }
5788 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5789 At this point, it is not needed anymore. */
5792 /* Clear the abstract origin if it refers to a method.
5793 Otherwise dwarf2out.c will ICE as we splice functions out of
5794 TYPE_FIELDS and thus the origin will not be output
5795 correctly. */
5798 && RECORD_OR_UNION_TYPE_P
5803 }
5805 {
5806 /* See comment above why we set the flag for functoins. */
5813 }
5815 {
5826 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5827 }
5829 {
5832 }
5836 {
5837 /* Strip builtins from the translation-unit BLOCK. We still have targets
5838 without builtin_decl_explicit support and also builtins are shared
5839 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5842 {
5847 else
5849 }
5850 }
5851 /* We need to keep field decls associated with their trees. Otherwise tree
5852 merging may merge some fileds and keep others disjoint wich in turn will
5853 not do well with TREE_CHAIN pointers linking them.
5855 Also do not drop containing types for virtual methods and tables because
5856 these are needed by devirtualization.
5857 C++ destructors are special because C++ frontends sometimes produces
5858 virtual destructor as an alias of non-virtual destructor. In
5859 devirutalization code we always walk through aliases and we need
5860 context to be preserved too. See PR89335 */
5867 }
5870 /* Operand callback helper for free_lang_data_in_node. *TP is the
5871 subtree operand being considered. */
5873 static tree
5875 {
5882 /* Language specific nodes will be removed, so there is no need
5883 to gather anything under them. */
5885 {
5888 }
5891 {
5892 /* Note that walk_tree does not traverse every possible field in
5893 decls, so we have to do our own traversals here. */
5901 /* We are going to remove everything under DECL_INITIAL for
5902 TYPE_DECLs. No point walking them. */
5910 {
5913 }
5915 {
5920 }
5930 }
5932 {
5933 /* Note that walk_tree does not traverse every possible field in
5934 types, so we have to do our own traversals here. */
5945 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5946 lists, we may look types up in these lists and use them while
5947 optimizing the function body. Thus we need to free lang data
5948 in them. */
5955 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5959 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5960 do not and want not to reach unused variants this way. */
5962 {
5964 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5965 So push that instead. */
5969 }
5973 {
5975 tree tem;
5980 }
5982 {
5983 tree tem;
5984 /* Push all TYPE_FIELDS - there can be interleaving interesting
5985 and non-interesting things. */
5988 {
5992 }
5993 }
5999 }
6001 {
6003 {
6007 {
6011 }
6012 else
6013 {
6016 }
6017 }
6021 }
6028 }
6031 /* Find decls and types in T. */
6033 static void
6035 {
6037 {
6043 }
6044 }
6046 /* Translate all the types in LIST with the corresponding runtime
6047 types. */
6049 static tree
6051 {
6061 {
6066 }
6069 }
6072 /* Find decls and types referenced in EH region R and store them in
6073 FLD->DECLS and FLD->TYPES. */
6075 static void
6077 {
6079 {
6084 {
6085 eh_catch c;
6087 /* The types referenced in each catch must first be changed to the
6088 EH types used at runtime. This removes references to FE types
6089 in the region. */
6091 {
6094 }
6095 }
6108 }
6109 }
6112 /* Find decls and types referenced in cgraph node N and store them in
6113 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6114 look for *every* kind of DECL and TYPE node reachable from N,
6115 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6116 NAMESPACE_DECLs, etc). */
6118 static void
6120 {
6121 basic_block bb;
6124 tree t;
6135 /* Traverse locals. */
6139 /* Traverse EH regions in FN. */
6140 {
6141 eh_region r;
6144 }
6146 /* Traverse every statement in FN. */
6148 {
6149 gphi_iterator psi;
6150 gimple_stmt_iterator si;
6154 {
6158 {
6161 }
6162 }
6165 {
6172 {
6175 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6176 which we need for asm stmts. */
6182 }
6183 }
6184 }
6185 }
6188 /* Find decls and types referenced in varpool node N and store them in
6189 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6190 look for *every* kind of DECL and TYPE node reachable from N,
6191 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6192 NAMESPACE_DECLs, etc). */
6194 static void
6196 {
6198 }
6200 /* If T needs an assembler name, have one created for it. */
6202 void
6204 {
6206 {
6207 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6208 diagnostics that use input_location to show locus
6209 information. The problem here is that, at this point,
6210 input_location is generally anchored to the end of the file
6211 (since the parser is long gone), so we don't have a good
6212 position to pin it to.
6214 To alleviate this problem, this uses the location of T's
6215 declaration. Examples of this are
6216 testsuite/g++.dg/template/cond2.C and
6217 testsuite/g++.dg/template/pr35240.C. */
6224 }
6225 }
6228 /* Free language specific information for every operand and expression
6229 in every node of the call graph. This process operates in three stages:
6231 1- Every callgraph node and varpool node is traversed looking for
6232 decls and types embedded in them. This is a more exhaustive
6233 search than that done by find_referenced_vars, because it will
6234 also collect individual fields, decls embedded in types, etc.
6236 2- All the decls found are sent to free_lang_data_in_decl.
6238 3- All the types found are sent to free_lang_data_in_type.
6240 The ordering between decls and types is important because
6241 free_lang_data_in_decl sets assembler names, which includes
6242 mangling. So types cannot be freed up until assembler names have
6243 been set up. */
6245 static void
6247 {
6250 tree t;
6254 /* Find decls and types in the body of every function in the callgraph. */
6261 /* Find decls and types in every varpool symbol. */
6265 /* Set the assembler name on every decl found. We need to do this
6266 now because free_lang_data_in_decl will invalidate data needed
6267 for mangling. This breaks mangling on interdependent decls. */
6271 /* Traverse every decl found freeing its language data. */
6275 /* Traverse every type found freeing its language data. */
6278 }
6281 /* Free resources that are used by FE but are not needed once they are done. */
6283 static unsigned
6285 {
6289 /* If we are the LTO frontend we have freed lang-specific data already. */
6292 {
6293 /* Rebuild type inheritance graph even when not doing LTO to get
6294 consistent profile data. */
6297 }
6302 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6306 /* Allocate and assign alias sets to the standard integer types
6307 while the slots are still in the way the frontends generated them. */
6312 /* Traverse the IL resetting language specific information for
6313 operands, expressions, etc. */
6316 /* Create gimple variants for common types. */
6322 /* Reset some langhooks. Do not reset types_compatible_p, it may
6323 still be used indirectly via the get_alias_set langhook. */
6336 {
6338 tree t;
6342 }
6344 /* We do not want the default decl_assembler_name implementation,
6345 rather if we have fixed everything we want a wrapper around it
6346 asserting that all non-local symbols already got their assembler
6347 name and only produce assembler names for local symbols. Or rather
6348 make sure we never call decl_assembler_name on local symbols and
6349 devise a separate, middle-end private scheme for it. */
6351 /* Reset diagnostic machinery. */
6360 }
6366 {
6376 };
6379 {
6383 {}
6385 /* opt_pass methods: */
6392 simple_ipa_opt_pass *
6394 {
6396 }
6397 \f
6398 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6399 of the various TYPE_QUAL values. */
6401 static void
6403 {
6409 }
6411 /* Returns true iff CAND and BASE have equivalent language-specific
6412 qualifiers. */
6414 bool
6416 {
6419 /* type_hash_eq currently only applies to these types. */
6424 }
6426 /* This function checks to see if TYPE matches the size one of the built-in
6427 atomic types, and returns that core atomic type. */
6429 static tree
6431 {
6432 tree base_atomic_type;
6434 /* Only handle complete types. */
6439 {
6462 }
6465 }
6467 /* Returns true iff unqualified CAND and BASE are equivalent. */
6469 bool
6471 {
6473 /* Apparently this is needed for Objective-C. */
6478 /* Check alignment. */
6481 /* Atomic types increase minimal alignment. We must to do so as well
6482 or we get duplicated canonical types. See PR88686. */
6484 {
6485 /* See if this object can map to a basic atomic type. */
6489 }
6491 }
6493 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6495 bool
6497 {
6501 }
6503 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6505 static bool
6507 {
6510 /* Apparently this is needed for Objective-C. */
6512 /* Check alignment. */
6517 }
6519 /* Return a version of the TYPE, qualified as indicated by the
6520 TYPE_QUALS, if one exists. If no qualified version exists yet,
6521 return NULL_TREE. */
6523 tree
6525 {
6533 /* Search the chain of variants to see if there is already one there just
6534 like the one we need to have. If so, use that existing one. We must
6535 preserve the TYPE_NAME, since there is code that depends on this. */
6538 {
6539 /* Put the found variant at the head of the variant list so
6540 frequently searched variants get found faster. The C++ FE
6541 benefits greatly from this. */
6547 }
6550 }
6552 /* Like get_qualified_type, but creates the type if it does not
6553 exist. This function never returns NULL_TREE. */
6555 tree
6557 {
6558 tree t;
6560 /* See if we already have the appropriate qualified variant. */
6563 /* If not, build it. */
6565 {
6570 {
6571 /* See if this object can map to a basic atomic type. */
6574 {
6575 /* Ensure the alignment of this type is compatible with
6576 the required alignment of the atomic type. */
6579 }
6580 }
6583 /* Propagate structural equality. */
6586 /* Build the underlying canonical type, since it is different
6587 from TYPE. */
6588 {
6591 }
6592 else
6593 /* T is its own canonical type. */
6596 }
6599 }
6601 /* Create a variant of type T with alignment ALIGN. */
6603 tree
6605 {
6606 tree t;
6621 }
6623 /* Create a new distinct copy of TYPE. The new type is made its own
6624 MAIN_VARIANT. If TYPE requires structural equality checks, the
6625 resulting type requires structural equality checks; otherwise, its
6626 TYPE_CANONICAL points to itself. */
6628 tree
6630 {
6636 /* Set the canonical type either to a new equivalence class, or
6637 propagate the need for structural equality checks. */
6640 else
6643 /* Make it its own variant. */
6647 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6648 whose TREE_TYPE is not t. This can also happen in the Ada
6649 frontend when using subtypes. */
6652 }
6654 /* Create a new variant of TYPE, equivalent but distinct. This is so
6655 the caller can modify it. TYPE_CANONICAL for the return type will
6656 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6657 are considered equal by the language itself (or that both types
6658 require structural equality checks). */
6660 tree
6662 {
6667 /* Since we're building a variant, assume that it is a non-semantic
6668 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6670 /* Type variants have no alias set defined. */
6673 /* Add the new type to the chain of variants of TYPE. */
6679 }
6680 \f
6681 /* Return true if the from tree in both tree maps are equal. */
6683 int
6685 {
6689 }
6691 /* Hash a from tree in a tree_base_map. */
6693 unsigned int
6695 {
6697 }
6699 /* Return true if this tree map structure is marked for garbage collection
6700 purposes. We simply return true if the from tree is marked, so that this
6701 structure goes away when the from tree goes away. */
6703 int
6705 {
6707 }
6709 /* Hash a from tree in a tree_map. */
6711 unsigned int
6713 {
6715 }
6717 /* Hash a from tree in a tree_decl_map. */
6719 unsigned int
6721 {
6723 }
6725 /* Return the initialization priority for DECL. */
6727 priority_type
6729 {
6734 return
6736 }
6738 /* Return the finalization priority for DECL. */
6740 priority_type
6742 {
6747 return
6749 }
6751 /* Set the initialization priority for DECL to PRIORITY. */
6753 void
6755 {
6759 {
6763 }
6766 else
6769 }
6771 /* Set the finalization priority for DECL to PRIORITY. */
6773 void
6775 {
6779 {
6783 }
6784 else
6787 }
6789 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6791 static void
6793 {
6798 }
6800 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6802 static void
6804 {
6809 }
6811 /* Lookup a debug expression for FROM, and return it if we find one. */
6813 tree
6815 {
6823 }
6825 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6827 void
6829 {
6836 }
6838 /* Lookup a value expression for FROM, and return it if we find one. */
6840 tree
6842 {
6850 }
6852 /* Insert a mapping FROM->TO in the value expression hashtable. */
6854 void
6856 {
6863 }
6865 /* Lookup a vector of debug arguments for FROM, and return it if we
6866 find one. */
6870 {
6881 }
6883 /* Insert a mapping FROM->empty vector of debug arguments in the value
6884 expression hashtable. */
6888 {
6903 }
6905 /* Hashing of types so that we don't make duplicates.
6906 The entry point is `type_hash_canon'. */
6908 /* Generate the default hash code for TYPE. This is designed for
6909 speed, rather than maximum entropy. */
6911 hashval_t
6913 {
6922 /* Just the identifier is adequate to distinguish. */
6926 {
6929 /* FALLTHROUGH. */
6941 {
6945 {
6948 }
6949 }
6953 {
6960 }
6964 {
6968 }
6976 }
6979 }
6981 /* These are the Hashtable callback functions. */
6983 /* Returns true iff the types are equivalent. */
6985 bool
6987 {
6988 /* First test the things that are the same for all types. */
6998 /* Be careful about comparing arrays before and after the element type
6999 has been completed; don't compare TYPE_ALIGN unless both types are
7000 complete. */
7007 {
7029 /* fall through */
7061 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7062 where the flag should be inherited from the element type
7063 and can change after ARRAY_TYPEs are created; on non-aggregates
7064 compare it and hash it, scalars will never have that flag set
7065 and we need to differentiate between arrays created by different
7066 front-ends or middle-end created arrays. */
7096 }
7102 }
7104 /* Given TYPE, and HASHCODE its hash code, return the canonical
7105 object for an identical type if one already exists.
7106 Otherwise, return TYPE, and record it as the canonical object.
7108 To use this function, first create a type of the sort you want.
7109 Then compute its hash code from the fields of the type that
7110 make it different from other similar types.
7111 Then call this function and use the value. */
7113 tree
7115 {
7116 type_hash in;
7119 /* The hash table only contains main variants, so ensure that's what we're
7120 being passed. */
7123 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7124 must call that routine before comparing TYPE_ALIGNs. */
7132 {
7138 /* Free also min/max values and the cache for integer
7139 types. This can't be done in free_node, as LTO frees
7140 those on its own. */
7142 {
7145 {
7146 /* Zero is always in TYPE_CACHED_VALUES. */
7150 }
7153 {
7156 }
7159 }
7162 }
7163 else
7164 {
7173 }
7174 }
7176 static void
7178 {
7183 }
7185 /* Given two lists of types
7186 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7187 return 1 if the lists contain the same types in the same order.
7188 Also, the TREE_PURPOSEs must match. */
7190 bool
7192 {
7204 }
7206 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7207 given by TYPE. If the argument list accepts variable arguments,
7208 then this function counts only the ordinary arguments. */
7210 int
7212 {
7216 /* If the function does not take a variable number of arguments,
7217 the last element in the list will have type `void'. */
7220 else
7224 }
7226 /* Return the type of the function TYPE's argument ARGNO if known.
7227 For vararg function's where ARGNO refers to one of the variadic
7228 arguments return null. Otherwise, return a void_type_node for
7229 out-of-bounds ARGNO. */
7231 tree
7233 {
7234 /* Treat zero the same as an out-of-bounds argument number. */
7238 function_args_iterator iter;
7240 tree argtype;
7243 {
7244 /* A vararg function's argument list ends in a null. Otherwise,
7245 an ordinary function's argument list ends with void. Return
7246 null if ARGNO refers to a vararg argument, void_type_node if
7247 it's out of bounds, and the formal argument type otherwise. */
7255 }
7258 }
7260 /* Nonzero if integer constants T1 and T2
7261 represent the same constant value. */
7263 int
7265 {
7281 }
7283 /* Return true if T is an INTEGER_CST whose numerical value (extended
7284 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7286 bool
7288 {
7292 }
7294 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7295 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7297 bool
7299 {
7303 {
7308 }
7311 }
7313 /* Return true if T is an INTEGER_CST whose numerical value (extended
7314 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7316 bool
7318 {
7322 }
7324 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7325 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7327 bool
7329 {
7333 {
7338 }
7341 }
7343 /* T is an INTEGER_CST whose numerical value (extended according to
7344 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7345 HOST_WIDE_INT. */
7347 HOST_WIDE_INT
7349 {
7352 }
7354 /* T is an INTEGER_CST whose numerical value (extended according to
7355 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7356 HOST_WIDE_INT. */
7358 unsigned HOST_WIDE_INT
7360 {
7363 }
7365 /* Return the most significant (sign) bit of T. */
7367 int
7369 {
7373 }
7375 /* Return an indication of the sign of the integer constant T.
7376 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7377 Note that -1 will never be returned if T's type is unsigned. */
7379 int
7381 {
7388 else
7390 }
7392 /* Return the minimum number of bits needed to represent VALUE in a
7393 signed or unsigned type, UNSIGNEDP says which. */
7395 unsigned int
7397 {
7398 /* If the value is negative, compute its negative minus 1. The latter
7399 adjustment is because the absolute value of the largest negative value
7400 is one larger than the largest positive value. This is equivalent to
7401 a bit-wise negation, so use that operation instead. */
7406 /* Return the number of bits needed, taking into account the fact
7407 that we need one more bit for a signed than unsigned type.
7408 If value is 0 or -1, the minimum precision is 1 no matter
7409 whether unsignedp is true or false. */
7413 else
7415 }
7417 /* Return truthvalue of whether T1 is the same tree structure as T2.
7418 Return 1 if they are the same.
7419 Return 0 if they are understandably different.
7420 Return -1 if either contains tree structure not understood by
7421 this function. */
7423 int
7425 {
7435 /* For location wrappers to be the same, they must be at the same
7436 source location (and wrap the same thing). */
7438 {
7442 }
7448 {
7452 else
7454 }
7464 {
7480 {
7489 /* ??? Should we handle also fields here? */
7493 }
7504 {
7512 {
7516 }
7518 }
7521 /* Special case: if either target is an unallocated VAR_DECL,
7522 it means that it's going to be unified with whatever the
7523 TARGET_EXPR is really supposed to initialize, so treat it
7524 as being equivalent to anything. */
7532 else
7561 /* A false return means maybe_ne rather than known_ne. */
7567 }
7569 /* This general rule works for most tree codes. All exceptions should be
7570 handled above. If this is a language-specific tree code, we can't
7571 trust what might be in the operand, so say we don't know
7572 the situation. */
7577 {
7586 {
7590 }
7596 }
7597 }
7599 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7600 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7601 than U, respectively. */
7603 int
7605 {
7614 else
7616 }
7618 /* Return true if SIZE represents a constant size that is in bounds of
7619 what the middle-end and the backend accepts (covering not more than
7620 half of the address-space).
7621 When PERR is non-null, set *PERR on failure to the description of
7622 why SIZE is not valid. */
7624 bool
7626 {
7628 {
7635 }
7637 cst_size_error error;
7642 {
7645 }
7648 {
7651 }
7654 {
7657 }
7661 {
7664 }
7667 }
7669 /* Return the precision of the type, or for a complex or vector type the
7670 precision of the type of its elements. */
7672 unsigned int
7674 {
7682 }
7684 /* Return true if CODE represents an associative tree code. Otherwise
7685 return false. */
7686 bool
7688 {
7690 {
7702 }
7704 }
7706 /* Return true if CODE represents a commutative tree code. Otherwise
7707 return false. */
7708 bool
7710 {
7712 {
7739 }
7741 }
7743 /* Return true if CODE represents a ternary tree code for which the
7744 first two operands are commutative. Otherwise return false. */
7745 bool
7747 {
7749 {
7757 }
7759 }
7761 /* Returns true if CODE can overflow. */
7763 bool
7765 {
7767 {
7772 /* Can overflow in various ways. */
7778 /* For INT_MIN / -1. */
7782 /* For -INT_MIN. */
7785 /* These operators cannot overflow. */
7787 }
7788 }
7790 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7791 ftrapv doesn't generate trapping insns for CODE. */
7793 bool
7795 {
7798 /* We don't generate instructions that trap on overflow for complex or vector
7799 types. */
7807 {
7813 /* These operators can overflow, and -ftrapv generates trapping code for
7814 these. */
7821 /* These operators can overflow, but -ftrapv does not generate trapping
7822 code for these. */
7825 /* These operators cannot overflow. */
7827 }
7828 }
7830 /* Constructors for pointer, array and function types.
7831 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7832 constructed by language-dependent code, not here.) */
7834 /* Construct, lay out and return the type of pointers to TO_TYPE with
7835 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7836 reference all of memory. If such a type has already been
7837 constructed, reuse it. */
7839 tree
7842 {
7843 tree t;
7849 /* If the pointed-to type has the may_alias attribute set, force
7850 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7854 /* In some cases, languages will have things that aren't a POINTER_TYPE
7855 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7856 In that case, return that type without regard to the rest of our
7857 operands.
7859 ??? This is a kludge, but consistent with the way this function has
7860 always operated and there doesn't seem to be a good way to avoid this
7861 at the moment. */
7866 /* First, if we already have a type for pointers to TO_TYPE and it's
7867 the proper mode, use it. */
7880 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7888 /* Lay out the type. This function has many callers that are concerned
7889 with expression-construction, and this simplifies them all. */
7893 }
7895 /* By default build pointers in ptr_mode. */
7897 tree
7899 {
7904 }
7906 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7908 tree
7911 {
7912 tree t;
7918 /* If the pointed-to type has the may_alias attribute set, force
7919 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7923 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7924 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7925 In that case, return that type without regard to the rest of our
7926 operands.
7928 ??? This is a kludge, but consistent with the way this function has
7929 always operated and there doesn't seem to be a good way to avoid this
7930 at the moment. */
7935 /* First, if we already have a type for pointers to TO_TYPE and it's
7936 the proper mode, use it. */
7949 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7960 }
7963 /* Build the node for the type of references-to-TO_TYPE by default
7964 in ptr_mode. */
7966 tree
7968 {
7973 }
7975 #define MAX_INT_CACHED_PREC \
7976 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7979 /* Builds a signed or unsigned integer type of precision PRECISION.
7980 Used for C bitfields whose precision does not match that of
7981 built-in target types. */
7982 tree
7985 {
7992 {
7996 }
8003 else
8013 }
8015 #define MAX_BOOL_CACHED_PREC \
8016 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8019 /* Builds a boolean type of precision PRECISION.
8020 Used for boolean vectors to choose proper vector element size. */
8021 tree
8023 {
8024 tree type;
8027 {
8031 }
8041 }
8043 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8044 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8045 is true, reuse such a type that has already been constructed. */
8047 static tree
8049 {
8072 {
8073 /* Since we cannot reliably merge this type, we need to compare it using
8074 structural equality checks. */
8077 }
8083 }
8085 /* Wrapper around build_range_type_1 with SHARED set to true. */
8087 tree
8089 {
8091 }
8093 /* Wrapper around build_range_type_1 with SHARED set to false. */
8095 tree
8097 {
8099 }
8101 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8102 MAXVAL should be the maximum value in the domain
8103 (one less than the length of the array).
8105 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8106 We don't enforce this limit, that is up to caller (e.g. language front end).
8107 The limit exists because the result is a signed type and we don't handle
8108 sizes that use more than one HOST_WIDE_INT. */
8110 tree
8112 {
8114 }
8116 /* Return true if the debug information for TYPE, a subtype, should be emitted
8117 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8118 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8119 debug info and doesn't reflect the source code. */
8121 bool
8123 {
8126 /* Subrange types have a base type which is an integral type. */
8130 /* Get the real bounds of the subtype. */
8133 else
8134 {
8137 }
8139 /* If the type and its base type have the same representation and the same
8140 name, then the type is not a subrange but a copy of the base type. */
8154 }
8156 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8157 and number of elements specified by the range of values of INDEX_TYPE.
8158 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8159 If SHARED is true, reuse such a type that has already been constructed.
8160 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8162 static tree
8165 {
8166 tree t;
8169 {
8172 }
8182 {
8185 }
8188 {
8197 index_type
8200 }
8203 }
8205 /* Wrapper around build_array_type_1 with SHARED set to true. */
8207 tree
8209 {
8210 return
8212 }
8214 /* Wrapper around build_array_type_1 with SHARED set to false. */
8216 tree
8218 {
8220 }
8222 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8223 sizetype. */
8225 tree
8227 {
8229 }
8231 /* Recursively examines the array elements of TYPE, until a non-array
8232 element type is found. */
8234 tree
8236 {
8241 }
8243 /* Computes the canonical argument types from the argument type list
8244 ARGTYPES.
8246 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8247 on entry to this function, or if any of the ARGTYPES are
8248 structural.
8250 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8251 true on entry to this function, or if any of the ARGTYPES are
8252 non-canonical.
8254 Returns a canonical argument list, which may be ARGTYPES when the
8255 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8256 true) or would not differ from ARGTYPES. */
8258 static tree
8262 {
8263 tree arg;
8267 {
8269 /* Fail gracefully by stating that the type is structural. */
8275 /* If the argument has a default argument, we consider it
8276 non-canonical even though the type itself is canonical.
8277 That way, different variants of function and method types
8278 with default arguments will all point to the variant with
8279 no defaults as their canonical type. */
8281 }
8287 {
8288 /* Build the canonical list of argument types. */
8293 {
8296 else
8299 canon_argtypes);
8300 }
8306 /* There is a non-canonical type. */
8309 }
8311 /* The canonical argument types are the same as ARGTYPES. */
8313 }
8315 /* Construct, lay out and return
8316 the type of functions returning type VALUE_TYPE
8317 given arguments of types ARG_TYPES.
8318 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8319 are data type nodes for the arguments of the function.
8320 If such a type has already been constructed, reuse it. */
8322 tree
8324 {
8325 tree t;
8328 tree canon_argtypes;
8333 {
8336 }
8338 /* Make a node of the sort we want. */
8343 /* If we already have such a type, use the old one. */
8347 /* Set up the canonical type. */
8357 canon_argtypes);
8362 }
8364 /* Build a function type. The RETURN_TYPE is the type returned by the
8365 function. If VAARGS is set, no void_type_node is appended to the
8366 list. ARGP must be always be terminated be a NULL_TREE. */
8368 static tree
8370 {
8378 {
8383 }
8386 else
8387 {
8391 }
8395 }
8397 /* Build a function type. The RETURN_TYPE is the type returned by the
8398 function. If additional arguments are provided, they are
8399 additional argument types. The list of argument types must always
8400 be terminated by NULL_TREE. */
8402 tree
8404 {
8405 tree args;
8412 }
8414 /* Build a variable argument function type. The RETURN_TYPE is the
8415 type returned by the function. If additional arguments are provided,
8416 they are additional argument types. The list of argument types must
8417 always be terminated by NULL_TREE. */
8419 tree
8421 {
8422 tree args;
8430 }
8432 /* Build a function type. RETURN_TYPE is the type returned by the
8433 function; VAARGS indicates whether the function takes varargs. The
8434 function takes N named arguments, the types of which are provided in
8435 ARG_TYPES. */
8437 static tree
8440 {
8448 }
8450 /* Build a function type. RETURN_TYPE is the type returned by the
8451 function. The function takes N named arguments, the types of which
8452 are provided in ARG_TYPES. */
8454 tree
8456 {
8458 }
8460 /* Build a variable argument function type. RETURN_TYPE is the type
8461 returned by the function. The function takes N named arguments, the
8462 types of which are provided in ARG_TYPES. */
8464 tree
8466 {
8468 }
8470 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8471 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8472 for the method. An implicit additional parameter (of type
8473 pointer-to-BASETYPE) is added to the ARGTYPES. */
8475 tree
8477 tree rettype,
8478 tree argtypes)
8479 {
8480 tree t;
8481 tree ptype;
8483 tree canon_argtypes;
8485 /* Make a node of the sort we want. */
8492 /* The actual arglist for this function includes a "hidden" argument
8493 which is "this". Put it into the list of argument types. */
8497 /* If we already have such a type, use the old one. */
8501 /* Set up the canonical type. */
8502 any_structural_p
8505 any_noncanonical_p
8517 canon_argtypes);
8522 }
8524 /* Construct, lay out and return the type of methods belonging to class
8525 BASETYPE and whose arguments and values are described by TYPE.
8526 If that type exists already, reuse it.
8527 TYPE must be a FUNCTION_TYPE node. */
8529 tree
8531 {
8537 }
8539 /* Construct, lay out and return the type of offsets to a value
8540 of type TYPE, within an object of type BASETYPE.
8541 If a suitable offset type exists already, reuse it. */
8543 tree
8545 {
8546 tree t;
8548 /* Make a node of the sort we want. */
8554 /* If we already have such a type, use the old one. */
8562 {
8571 }
8574 }
8576 /* Create a complex type whose components are COMPONENT_TYPE.
8578 If NAMED is true, the type is given a TYPE_NAME. We do not always
8579 do so because this creates a DECL node and thus make the DECL_UIDs
8580 dependent on the type canonicalization hashtable, which is GC-ed,
8581 so the DECL_UIDs would not be stable wrt garbage collection. */
8583 tree
8585 {
8590 /* Make a node of the sort we want. */
8595 /* If we already have such a type, use the old one. */
8600 {
8601 /* We created a new type. The hash insertion will have laid
8602 out the type. We need to check the canonicalization and
8603 maybe set the name. */
8614 /* We need to create a name, since complex is a fundamental type. */
8616 {
8645 }
8646 }
8649 }
8651 /* If TYPE is a real or complex floating-point type and the target
8652 does not directly support arithmetic on TYPE then return the wider
8653 type to be used for arithmetic on TYPE. Otherwise, return
8654 NULL_TREE. */
8656 tree
8658 {
8659 /* The target can give two different responses to the question of
8660 which excess precision mode it would like depending on whether we
8661 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8663 enum excess_precision_type requested_type
8665 ? EXCESS_PRECISION_TYPE_FAST
8668 enum flt_eval_method target_flt_eval_method
8671 /* The target should not ask for unpredictable float evaluation (though
8672 it might advertise that implicitly the evaluation is unpredictable,
8673 but we don't care about that here, it will have been reported
8674 elsewhere). If it does ask for unpredictable evaluation, we have
8675 nothing to do here. */
8678 /* Nothing to do. The target has asked for all types we know about
8679 to be computed with their native precision and range. */
8683 /* The target will promote this type in a target-dependent way, so excess
8684 precision ought to leave it alone. */
8688 machine_mode float16_type_mode = (float16_type_node
8695 {
8697 {
8700 {
8718 }
8720 }
8722 {
8727 {
8745 }
8747 }
8750 }
8753 }
8754 \f
8755 /* Return OP, stripped of any conversions to wider types as much as is safe.
8756 Converting the value back to OP's type makes a value equivalent to OP.
8758 If FOR_TYPE is nonzero, we return a value which, if converted to
8759 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8761 OP must have integer, real or enumeral type. Pointers are not allowed!
8763 There are some cases where the obvious value we could return
8764 would regenerate to OP if converted to OP's type,
8765 but would not extend like OP to wider types.
8766 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8767 For example, if OP is (unsigned short)(signed char)-1,
8768 we avoid returning (signed char)-1 if FOR_TYPE is int,
8769 even though extending that to an unsigned short would regenerate OP,
8770 since the result of extending (signed char)-1 to (int)
8771 is different from (int) OP. */
8773 tree
8775 {
8776 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8778 unsigned final_prec
8780 int uns
8787 {
8790 /* TYPE_PRECISION on vector types has different meaning
8791 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8792 so avoid them here. */
8799 /* Truncations are many-one so cannot be removed.
8800 Unless we are later going to truncate down even farther. */
8805 /* See what's inside this conversion. If we decide to strip it,
8806 we will set WIN. */
8809 /* If we have not stripped any zero-extensions (uns is 0),
8810 we can strip any kind of extension.
8811 If we have previously stripped a zero-extension,
8812 only zero-extensions can safely be stripped.
8813 Any extension can be stripped if the bits it would produce
8814 are all going to be discarded later by truncating to FOR_TYPE. */
8817 {
8820 /* TYPE_UNSIGNED says whether this is a zero-extension.
8821 Let's avoid computing it if it does not affect WIN
8822 and if UNS will not be needed again. */
8826 {
8829 }
8830 }
8831 }
8833 /* If we finally reach a constant see if it fits in sth smaller and
8834 in that case convert it. */
8836 {
8842 {
8846 }
8847 }
8850 }
8851 \f
8852 /* Return OP or a simpler expression for a narrower value
8853 which can be sign-extended or zero-extended to give back OP.
8854 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8855 or 0 if the value should be sign-extended. */
8857 tree
8859 {
8866 {
8867 int bitschange
8871 /* Truncations are many-one so cannot be removed. */
8875 /* See what's inside this conversion. If we decide to strip it,
8876 we will set WIN. */
8879 {
8881 /* An extension: the outermost one can be stripped,
8882 but remember whether it is zero or sign extension. */
8885 /* Otherwise, if a sign extension has been stripped,
8886 only sign extensions can now be stripped;
8887 if a zero extension has been stripped, only zero-extensions. */
8891 }
8893 {
8894 /* A change in nominal type can always be stripped, but we must
8895 preserve the unsignedness. */
8900 /* Keep trying to narrow, but don't assign op to win if it
8901 would turn an integral type into something else. */
8904 }
8907 }
8910 /* Since type_for_size always gives an integer type. */
8913 /* Ensure field is laid out already. */
8916 {
8917 unsigned HOST_WIDE_INT innerprec
8923 /* We can get this structure field in a narrower type that fits it,
8924 but the resulting extension to its nominal type (a fullword type)
8925 must satisfy the same conditions as for other extensions.
8927 Do this only for fields that are aligned (not bit-fields),
8928 because when bit-field insns will be used there is no
8929 advantage in doing this. */
8935 {
8939 }
8940 }
8944 }
8945 \f
8946 /* Return true if integer constant C has a value that is permissible
8947 for TYPE, an integral type. */
8949 bool
8951 {
8956 /* Non-standard boolean types can have arbitrary precision but various
8957 transformations assume that they can only take values 0 and +/-1. */
8961 retry:
8965 /* If at least one bound of the type is a constant integer, we can check
8966 ourselves and maybe make a decision. If no such decision is possible, but
8967 this type is a subtype, try checking against that. Otherwise, use
8968 fits_to_tree_p, which checks against the precision.
8970 Compute the status for each possibly constant bound, and return if we see
8971 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8972 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8973 for "constant known to fit". */
8975 /* Check if c >= type_low_bound. */
8977 {
8981 }
8982 else
8985 /* Check if c <= type_high_bound. */
8987 {
8991 }
8992 else
8995 /* If the constant fits both bounds, the result is known. */
8999 /* Perform some generic filtering which may allow making a decision
9000 even if the bounds are not constant. First, negative integers
9001 never fit in unsigned types, */
9005 /* Second, narrower types always fit in wider ones. */
9009 /* Third, unsigned integers with top bit set never fit signed types. */
9011 {
9014 {
9015 /* When a tree_cst is converted to a wide-int, the precision
9016 is taken from the type. However, if the precision of the
9017 mode underneath the type is smaller than that, it is
9018 possible that the value will not fit. The test below
9019 fails if any bit is set between the sign bit of the
9020 underlying mode and the top bit of the type. */
9023 }
9026 }
9028 /* If we haven't been able to decide at this point, there nothing more we
9029 can check ourselves here. Look at the base type if we have one and it
9030 has the same precision. */
9034 {
9037 }
9039 /* Or to fits_to_tree_p, if nothing else. */
9041 }
9043 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9044 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9045 represented (assuming two's-complement arithmetic) within the bit
9046 precision of the type are returned instead. */
9048 void
9050 {
9054 else
9055 {
9058 else
9059 {
9062 }
9063 }
9068 else
9069 {
9072 }
9073 }
9075 /* Return true if VAR is an automatic variable. */
9077 bool
9079 {
9084 }
9086 /* Return true if VAR is an automatic variable defined in function FN. */
9088 bool
9090 {
9094 }
9096 /* Subprogram of following function. Called by walk_tree.
9098 Return *TP if it is an automatic variable or parameter of the
9099 function passed in as DATA. */
9101 static tree
9103 {
9114 }
9116 /* Returns true if T is, contains, or refers to a type with variable
9117 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9118 arguments, but not the return type. If FN is nonzero, only return
9119 true if a modifier of the type or position of FN is a variable or
9120 parameter inside FN.
9122 This concept is more general than that of C99 'variably modified types':
9123 in C99, a struct type is never variably modified because a VLA may not
9124 appear as a structure member. However, in GNU C code like:
9126 struct S { int i[f()]; };
9128 is valid, and other languages may define similar constructs. */
9130 bool
9132 {
9133 tree t;
9135 /* Test if T is either variable (if FN is zero) or an expression containing
9136 a variable in FN. If TYPE isn't gimplified, return true also if
9137 gimplify_one_sizepos would gimplify the expression into a local
9138 variable. */
9139 #define RETURN_TRUE_IF_VAR(T) \
9140 do { tree _t = (T); \
9141 if (_t != NULL_TREE \
9142 && _t != error_mark_node \
9143 && !CONSTANT_CLASS_P (_t) \
9144 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9145 && (!fn \
9146 || (!TYPE_SIZES_GIMPLIFIED (type) \
9147 && (TREE_CODE (_t) != VAR_DECL \
9148 && !CONTAINS_PLACEHOLDER_P (_t))) \
9149 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9150 return true; } while (0)
9155 /* If TYPE itself has variable size, it is variably modified. */
9160 {
9164 /* Ada can have pointer types refering to themselves indirectly. */
9169 {
9172 }
9178 /* If TYPE is a function type, it is variably modified if the
9179 return type is variably modified. */
9189 /* Scalar types are variably modified if their end points
9190 aren't constant. */
9198 /* We can't see if any of the fields are variably-modified by the
9199 definition we normally use, since that would produce infinite
9200 recursion via pointers. */
9201 /* This is variably modified if some field's type is. */
9204 {
9211 }
9215 /* Do not call ourselves to avoid infinite recursion. This is
9216 variably modified if the element type is. */
9223 }
9225 /* The current language may have other cases to check, but in general,
9226 all other types are not variably modified. */
9229 #undef RETURN_TRUE_IF_VAR
9230 }
9232 /* Given a DECL or TYPE, return the scope in which it was declared, or
9233 NULL_TREE if there is no containing scope. */
9235 tree
9237 {
9239 }
9241 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9243 const_tree
9245 {
9247 {
9250 else
9252 }
9254 }
9256 /* Return the innermost context enclosing DECL that is
9257 a FUNCTION_DECL, or zero if none. */
9259 tree
9261 {
9262 tree context;
9267 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9268 where we look up the function at runtime. Such functions always take
9269 a first argument of type 'pointer to real context'.
9271 C++ should really be fixed to use DECL_CONTEXT for the real context,
9272 and use something else for the "virtual context". */
9274 context
9275 = TYPE_MAIN_VARIANT
9277 else
9281 {
9284 else
9286 }
9289 }
9291 /* Return the innermost context enclosing DECL that is
9292 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9293 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9295 tree
9297 {
9302 {
9323 }
9326 }
9328 /* CALL is a CALL_EXPR. Return the declaration for the function
9329 called, or NULL_TREE if the called function cannot be
9330 determined. */
9332 tree
9334 {
9335 tree addr;
9340 /* It's invalid to call this function with anything but a
9341 CALL_EXPR. */
9344 /* The first operand to the CALL is the address of the function
9345 called. */
9348 /* If there is no function, return early. */
9354 /* If this is a readonly function pointer, extract its initial value. */
9360 /* If the address is just `&f' for some function `f', then we know
9361 that `f' is being called. */
9366 /* We couldn't figure out what was being called. */
9368 }
9370 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9371 return the associated function code, otherwise return CFN_LAST. */
9373 combined_fn
9375 {
9376 /* It's invalid to call this function with anything but a CALL_EXPR. */
9387 }
9389 /* Comparator of indices based on tree_node_counts. */
9391 static int
9393 {
9398 }
9400 /* Comparator of indices based on tree_code_counts. */
9402 static int
9404 {
9409 }
9411 #define TREE_MEM_USAGE_SPACES 40
9413 /* Print debugging information about tree nodes generated during the compile,
9414 and any language-specific information. */
9416 void
9418 {
9420 {
9426 {
9433 {
9440 }
9445 }
9447 {
9457 {
9462 }
9469 }
9470 }
9471 else
9478 }
9479 \f
9482 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9484 unsigned
9486 {
9487 /* This relies on the raw feedback's top 4 bits being zero. */
9488 #define FEEDBACK(X) ((X) * 0x04c11db7)
9489 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9490 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9492 {
9497 };
9498 #undef FEEDBACK
9499 #undef SYNDROME
9503 {
9507 }
9510 }
9512 /* Generate a crc32 of a string. */
9514 unsigned
9516 {
9517 do
9521 }
9523 /* P is a string that will be used in a symbol. Mask out any characters
9524 that are not valid in that context. */
9526 void
9528 {
9533 #endif
9536 #endif
9537 ))
9539 }
9543 /* Create a unique anonymous identifier. The identifier is still a
9544 valid assembly label. */
9546 tree
9548 {
9550 #if !defined (NO_DOT_IN_LABEL)
9551 "."
9552 #elif !defined (NO_DOLLAR_IN_LABEL)
9553 "$"
9554 #else
9555 "_"
9556 #endif
9567 }
9569 /* Generate a name for a special-purpose function.
9570 The generated name may need to be unique across the whole link.
9571 Changes to this function may also require corresponding changes to
9572 xstrdup_mask_random.
9573 TYPE is some string to identify the purpose of this function to the
9574 linker or collect2; it must start with an uppercase letter,
9575 one of:
9576 I - for constructors
9577 D - for destructors
9578 N - for C++ anonymous namespaces
9579 F - for DWARF unwind frame information. */
9581 tree
9583 {
9588 /* If we already have a name we know to be unique, just use that. */
9591 /* If the target is handling the constructors/destructors, they
9592 will be local to this file and the name is only necessary for
9593 debugging purposes.
9594 We also assign sub_I and sub_D sufixes to constructors called from
9595 the global static constructors. These are always local. */
9599 {
9603 /* Just use the file's basename, because the full pathname
9604 might be quite long. */
9606 }
9607 else
9608 {
9609 /* Otherwise, the name must be unique across the entire link.
9610 We don't have anything that we know to be unique to this translation
9611 unit, so use what we do have and throw in some randomness. */
9629 }
9635 /* Set up the name of the file-level functions we may need.
9636 Use a global object (which is already required to be unique over
9637 the program) rather than the file name (which imposes extra
9638 constraints). */
9642 }
9643 \f
9644 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9646 /* Complain that the tree code of NODE does not match the expected 0
9647 terminated list of trailing codes. The trailing code list can be
9648 empty, for a more vague error message. FILE, LINE, and FUNCTION
9649 are of the caller. */
9651 void
9654 {
9665 {
9672 {
9679 }
9681 }
9682 else
9688 }
9690 /* Complain that the tree code of NODE does match the expected 0
9691 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9692 the caller. */
9694 void
9697 {
9711 {
9713 {
9716 }
9719 }
9725 }
9727 /* Similar to tree_check_failed, except that we check for a class of tree
9728 code, given in CL. */
9730 void
9733 {
9734 internal_error
9739 }
9741 /* Similar to tree_check_failed, except that instead of specifying a
9742 dozen codes, use the knowledge that they're all sequential. */
9744 void
9748 {
9761 {
9768 }
9773 }
9776 /* Similar to tree_check_failed, except that we check that a tree does
9777 not have the specified code, given in CL. */
9779 void
9782 {
9783 internal_error
9788 }
9791 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9793 void
9796 {
9802 }
9805 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9807 void
9811 {
9824 {
9831 }
9836 }
9839 #undef DEFTREESTRUCT
9840 #define DEFTREESTRUCT(VAL, NAME) NAME,
9844 };
9845 #undef DEFTREESTRUCT
9847 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9849 /* Similar to tree_class_check_failed, except that we check for
9850 whether CODE contains the tree structure identified by EN. */
9852 void
9857 {
9858 internal_error
9862 }
9865 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9866 (dynamically sized) vector. */
9868 void
9871 {
9872 internal_error
9876 }
9878 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9879 (dynamically sized) vector. */
9881 void
9884 {
9885 internal_error
9888 }
9890 /* Similar to above, except that the check is for the bounds of the operand
9891 vector of an expression node EXP. */
9893 void
9896 {
9898 internal_error
9902 }
9904 /* Similar to above, except that the check is for the number of
9905 operands of an OMP_CLAUSE node. */
9907 void
9910 {
9911 internal_error
9916 }
9918 \f
9919 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9920 and mapped to the machine mode MODE. Initialize its fields and build
9921 the information necessary for debugging output. */
9923 static tree
9925 {
9926 tree t;
9947 /* We have built a main variant, based on the main variant of the
9948 inner type. Use it to build the variant we return. */
9956 }
9958 static tree
9960 {
9983 else
9985 }
9987 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9989 static tree
9991 {
9993 {
10005 }
10006 else
10007 {
10019 }
10022 }
10024 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10026 static tree
10028 {
10030 {
10042 }
10043 else
10044 {
10056 }
10059 }
10062 /* Create an atomic variant node for TYPE. This routine is called
10063 during initialization of data types to create the 5 basic atomic
10064 types. The generic build_variant_type function requires these to
10065 already be set up in order to function properly, so cannot be
10066 called from there. If ALIGN is non-zero, then ensure alignment is
10067 overridden to this value. */
10069 static tree
10071 {
10072 tree t;
10074 /* Make sure its not already registered. */
10085 }
10087 /* Information about the _FloatN and _FloatNx types. This must be in
10088 the same order as the corresponding TI_* enum values. */
10090 {
10098 };
10101 /* Create nodes for all integer types (and error_mark_node) using the sizes
10102 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10104 void
10106 {
10114 /* Define both `signed char' and `unsigned char'. */
10120 /* Define `char', which is like either `signed char' or `unsigned char'
10121 but not the same as either. */
10122 char_type_node
10123 = (signed_char
10138 {
10143 {
10146 }
10147 }
10149 /* Define a boolean type. This type only represents boolean values but
10150 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10156 /* Define what type to use for size_t. */
10165 else
10166 {
10172 {
10179 {
10181 }
10182 }
10185 }
10187 /* Define what type to use for ptrdiff_t. */
10196 else
10197 {
10201 {
10209 }
10212 }
10214 /* Fill in the rest of the sized types. Reuse existing type nodes
10215 when possible. */
10228 /* Don't call build_qualified type for atomics. That routine does
10229 special processing for atomics, and until they are initialized
10230 it's better not to make that call.
10232 Check to see if there is a target override for atomic types. */
10249 /* Define these next since types below may used them. */
10267 /* We are not going to have real types in C with less than byte alignment,
10268 so we might as well not have any types that claim to have it. */
10279 const_ptr_type_node
10301 {
10304 scalar_float_mode mode;
10308 /* Work around the rs6000 KFmode having precision 113 not
10309 128. */
10321 }
10328 /* Fixed size integer types. */
10333 /* Decimal float types. */
10335 {
10350 }
10359 {
10363 }
10365 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10366 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10367 sat_ ## KIND ## _type_node = \
10368 make_sat_signed_ ## KIND ## _type (SIZE); \
10369 sat_unsigned_ ## KIND ## _type_node = \
10370 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10371 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10372 unsigned_ ## KIND ## _type_node = \
10373 make_unsigned_ ## KIND ## _type (SIZE);
10375 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10376 sat_ ## WIDTH ## KIND ## _type_node = \
10377 make_sat_signed_ ## KIND ## _type (SIZE); \
10378 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10379 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10380 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10381 unsigned_ ## WIDTH ## KIND ## _type_node = \
10382 make_unsigned_ ## KIND ## _type (SIZE);
10384 /* Make fixed-point type nodes based on four different widths. */
10385 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10386 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10387 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10388 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10389 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10391 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10392 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10393 NAME ## _type_node = \
10394 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10395 u ## NAME ## _type_node = \
10396 make_or_reuse_unsigned_ ## KIND ## _type \
10397 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10398 sat_ ## NAME ## _type_node = \
10399 make_or_reuse_sat_signed_ ## KIND ## _type \
10400 (GET_MODE_BITSIZE (MODE ## mode)); \
10401 sat_u ## NAME ## _type_node = \
10402 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10403 (GET_MODE_BITSIZE (U ## MODE ## mode));
10405 /* Fixed-point type and mode nodes. */
10418 {
10421 /* Many back-ends define record types without setting TYPE_NAME.
10422 If we copied the record type here, we'd keep the original
10423 record type without a name. This breaks name mangling. So,
10424 don't copy record types and let c_common_nodes_and_builtins()
10425 declare the type to be __builtin_va_list. */
10430 }
10432 /* SCEV analyzer global shared trees. */
10437 }
10439 /* Modify DECL for given flags.
10440 TM_PURE attribute is set only on types, so the function will modify
10441 DECL's type when ECF_TM_PURE is used. */
10443 void
10445 {
10475 /* Looping const or pure is implied by noreturn.
10476 There is currently no way to declare looping const or looping pure alone. */
10479 }
10482 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10484 static void
10487 {
10488 tree decl;
10495 }
10497 /* Call this function after instantiating all builtins that the language
10498 front end cares about. This will build the rest of the builtins
10499 and internal functions that are relied upon by the tree optimizers and
10500 the middle-end. */
10502 void
10504 {
10510 {
10514 BUILT_IN_UNREACHABLE,
10522 }
10526 {
10537 }
10540 {
10543 NULL_TREE);
10546 }
10549 {
10555 }
10557 /* If we're checking the stack, `alloca' can throw. */
10558 const int alloca_flags
10562 {
10567 }
10572 BUILT_IN_ALLOCA_WITH_ALIGN,
10574 alloca_flags);
10579 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10581 alloca_flags);
10587 BUILT_IN_INIT_TRAMPOLINE,
10590 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10594 BUILT_IN_INIT_DESCRIPTOR,
10599 BUILT_IN_ADJUST_TRAMPOLINE,
10603 BUILT_IN_ADJUST_DESCRIPTOR,
10610 BUILT_IN_NONLOCAL_GOTO,
10617 BUILT_IN_SETJMP_SETUP,
10622 BUILT_IN_SETJMP_RECEIVER,
10631 BUILT_IN_STACK_RESTORE,
10636 NULL_TREE);
10649 /* If there's a possibility that we might use the ARM EABI, build the
10650 alternate __cxa_end_cleanup node used to resume from C++. */
10652 {
10655 BUILT_IN_CXA_END_CLEANUP,
10657 }
10661 BUILT_IN_UNWIND_RESUME,
10665 ECF_NORETURN);
10668 {
10670 NULL_TREE);
10672 BUILT_IN_RETURN_ADDRESS,
10674 ECF_NOTHROW);
10675 }
10679 {
10684 BUILT_IN_PROFILE_FUNC_ENTER,
10688 BUILT_IN_PROFILE_FUNC_EXIT,
10690 }
10692 /* The exception object and filter values from the runtime. The argument
10693 must be zero before exception lowering, i.e. from the front end. After
10694 exception lowering, it will be the region number for the exception
10695 landing pad. These functions are PURE instead of CONST to prevent
10696 them from being hoisted past the exception edge that will initialize
10697 its value in the landing pad. */
10701 /* Only use TM_PURE if we have TM language support. */
10714 NULL_TREE);
10716 BUILT_IN_EH_COPY_VALUES,
10719 /* Complex multiplication and division. These are handled as builtins
10720 rather than optabs because emit_library_call_value doesn't support
10721 complex. Further, we can do slightly better with folding these
10722 beasties if the real and complex parts of the arguments are separate. */
10723 {
10727 {
10754 /* For -ftrapping-math these should throw from a former
10755 -fnon-call-exception stmt. */
10757 NULL);
10763 NULL);
10767 }
10768 }
10771 }
10773 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10774 better way.
10776 If we requested a pointer to a vector, build up the pointers that
10777 we stripped off while looking for the inner type. Similarly for
10778 return values from functions.
10780 The argument TYPE is the top of the chain, and BOTTOM is the
10781 new type which we will point to. */
10783 tree
10785 {
10789 {
10793 }
10795 {
10799 }
10801 {
10804 }
10806 {
10809 }
10811 {
10813 /* The build_method_type_directly() routine prepends 'this' to argument list,
10814 so we must compensate by getting rid of it. */
10815 outer
10816 = build_method_type_directly
10818 inner,
10820 }
10822 {
10825 }
10826 else
10831 }
10833 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10834 the inner type. */
10835 tree
10837 {
10838 poly_int64 nunits;
10842 {
10854 /* Check that there are no leftover bits. */
10862 }
10865 }
10867 /* Similarly, but takes the inner type and number of units, which must be
10868 a power of two. */
10870 tree
10872 {
10874 }
10876 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10878 tree
10880 {
10888 }
10890 /* Build a vector type that holds one boolean result for each element of
10891 vector type VECTYPE. The public interface for this operation is
10892 truth_type_for. */
10894 static tree
10896 {
10900 machine_mode mask_mode;
10910 }
10912 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10913 set. */
10915 tree
10917 {
10919 tree cand;
10920 /* We always build the non-opaque variant before the opaque one,
10921 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10927 /* Othewise build a variant type and make sure to queue it after
10928 the non-opaque type. */
10936 }
10938 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10940 wide_int
10942 {
10943 /* First handle elements that are directly encoded. */
10948 /* Identify the pattern that contains element I and work out the index of
10949 the last encoded element for that pattern. */
10955 /* If there are no steps, the final encoded value is the right one. */
10959 /* Otherwise work out the value from the last two encoded elements. */
10964 }
10966 /* Return the value of element I of VECTOR_CST T. */
10968 tree
10970 {
10971 /* First handle elements that are directly encoded. */
10976 /* If there are no steps, the final encoded value is the right one. */
10978 {
10979 /* Identify the pattern that contains element I and work out the index of
10980 the last encoded element for that pattern. */
10985 }
10987 /* Otherwise work out the value from the last two encoded elements. */
10990 }
10992 /* Given an initializer INIT, return TRUE if INIT is zero or some
10993 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10994 null, set *NONZERO if and only if INIT is known not to be all
10995 zeros. The combination of return value of false and *NONZERO
10996 false implies that INIT may but need not be all zeros. Other
10997 combinations indicate definitive answers. */
10999 bool
11001 {
11006 /* Conservatively clear NONZERO and set it only if INIT is definitely
11007 not all zero. */
11015 {
11024 /* ??? Note that this is not correct for C4X float formats. There,
11025 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11026 negative exponent. */
11061 {
11066 tree elt;
11073 }
11076 {
11091 }
11092 /* Fall through. */
11095 {
11103 /* We need to loop through all elements to handle cases like
11104 "\0" and "\0foobar". */
11107 {
11110 }
11113 }
11117 }
11118 }
11120 /* Return true if EXPR is an initializer expression in which every element
11121 is a constant that is numerically equal to 0 or 1. The elements do not
11122 need to be equal to each other. */
11124 bool
11126 {
11130 {
11138 {
11145 {
11149 }
11152 }
11156 }
11157 }
11159 /* Check if vector VEC consists of all the equal elements and
11160 that the number of elements corresponds to the type of VEC.
11161 The function returns first element of the vector
11162 or NULL_TREE if the vector is not uniform. */
11163 tree
11165 {
11178 {
11182 }
11186 {
11190 {
11192 {
11195 }
11198 }
11203 }
11206 }
11208 /* If the argument is INTEGER_CST, return it. If the argument is vector
11209 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11210 return NULL_TREE.
11211 Look through location wrappers. */
11213 tree
11215 {
11222 {
11226 }
11229 }
11231 /* If VECTOR_CST T has a single nonzero element, return the index of that
11232 element, otherwise return -1. */
11234 int
11236 {
11242 {
11245 }
11246 else
11251 {
11254 {
11258 }
11259 }
11261 }
11263 /* Build an empty statement at location LOC. */
11265 tree
11267 {
11271 }
11274 /* Build an OpenMP clause with code CODE. LOC is the location of the
11275 clause. */
11277 tree
11279 {
11280 tree t;
11295 }
11297 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11298 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11299 Except for the CODE and operand count field, other storage for the
11300 object is initialized to zeros. */
11302 tree
11304 {
11305 tree t;
11317 /* Can't use TREE_OPERAND to store the length because if checking is
11318 enabled, it will try to check the length before we store it. :-P */
11322 }
11324 /* Helper function for build_call_* functions; build a CALL_EXPR with
11325 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11326 the argument slots. */
11328 static tree
11330 {
11331 tree t;
11339 }
11341 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11342 FN and a null static chain slot. NARGS is the number of call arguments
11343 which are specified as "..." arguments. */
11345 tree
11347 {
11348 tree ret;
11354 }
11356 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11357 FN and a null static chain slot. NARGS is the number of call arguments
11358 which are specified as a va_list ARGS. */
11360 tree
11362 {
11363 tree t;
11371 }
11373 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11374 FN and a null static chain slot. NARGS is the number of call arguments
11375 which are specified as a tree array ARGS. */
11377 tree
11380 {
11381 tree t;
11390 }
11392 /* Like build_call_array, but takes a vec. */
11394 tree
11396 {
11405 }
11407 /* Conveniently construct a function call expression. FNDECL names the
11408 function to be called and N arguments are passed in the array
11409 ARGARRAY. */
11411 tree
11413 {
11418 }
11420 /* Conveniently construct a function call expression. FNDECL names the
11421 function to be called and the arguments are passed in the vector
11422 VEC. */
11424 tree
11426 {
11429 }
11432 /* Conveniently construct a function call expression. FNDECL names the
11433 function to be called, N is the number of arguments, and the "..."
11434 parameters are the argument expressions. */
11436 tree
11438 {
11448 }
11450 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11451 varargs macros aren't supported by all bootstrap compilers. */
11453 tree
11455 {
11465 }
11467 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11468 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11469 It will get gimplified later into an ordinary internal function. */
11471 tree
11474 {
11481 }
11483 /* Build internal call expression. This is just like CALL_EXPR, except
11484 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11485 internal function. */
11487 tree
11490 {
11500 }
11502 /* Return a function call to FN, if the target is guaranteed to support it,
11503 or null otherwise.
11505 N is the number of arguments, passed in the "...", and TYPE is the
11506 type of the return value. */
11508 tree
11511 {
11521 {
11524 {
11527 OPTIMIZE_FOR_BOTH))
11529 }
11531 }
11532 else
11533 {
11538 }
11539 }
11541 /* Return a function call to the appropriate builtin alloca variant.
11543 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11544 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11545 bound for SIZE in case it is not a fixed value. */
11547 tree
11549 {
11551 {
11553 return
11555 }
11557 {
11560 }
11561 else
11562 {
11565 }
11566 }
11568 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11569 if SIZE == -1) and return a tree node representing char* pointer to
11570 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value
11571 is the LEN bytes at STR (the representation of the string, which may
11572 be wide). */
11574 tree
11578 {
11580 /* Set the maximum valid index based on the string length or SIZE. */
11581 unsigned HOST_WIDE_INT maxidx
11597 }
11601 /* Return true if T (assumed to be a DECL) must be assigned a memory
11602 location. */
11604 bool
11606 {
11612 }
11614 /* Return value of a constant X and sign-extend it. */
11616 HOST_WIDE_INT
11618 {
11622 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11626 {
11630 else
11632 }
11635 }
11637 /* If TYPE is an integral or pointer type, return an integer type with
11638 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11639 if TYPE is already an integer type of signedness UNSIGNEDP.
11640 If TYPE is a floating-point type, return an integer type with the same
11641 bitsize and with the signedness given by UNSIGNEDP; this is useful
11642 when doing bit-level operations on a floating-point value. */
11644 tree
11646 {
11651 {
11659 }
11662 {
11670 }
11679 else
11683 }
11685 /* If TYPE is an integral or pointer type, return an integer type with
11686 the same precision which is unsigned, or itself if TYPE is already an
11687 unsigned integer type. If TYPE is a floating-point type, return an
11688 unsigned integer type with the same bitsize as TYPE. */
11690 tree
11692 {
11694 }
11696 /* If TYPE is an integral or pointer type, return an integer type with
11697 the same precision which is signed, or itself if TYPE is already a
11698 signed integer type. If TYPE is a floating-point type, return a
11699 signed integer type with the same bitsize as TYPE. */
11701 tree
11703 {
11705 }
11707 /* If TYPE is a vector type, return a signed integer vector type with the
11708 same width and number of subparts. Otherwise return boolean_type_node. */
11710 tree
11712 {
11714 {
11718 }
11719 else
11721 }
11723 /* Returns the largest value obtainable by casting something in INNER type to
11724 OUTER type. */
11726 tree
11728 {
11734 /* Compute a unique number for every combination. */
11739 /* Determine the exponent to use. */
11741 {
11744 /* oprec <= iprec, outer: signed, inner: don't care. */
11749 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11753 /* oprec > iprec, outer: signed, inner: signed. */
11757 /* oprec > iprec, outer: signed, inner: unsigned. */
11761 /* oprec > iprec, outer: unsigned, inner: signed. */
11765 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11770 }
11774 }
11776 /* Returns the smallest value obtainable by casting something in INNER type to
11777 OUTER type. */
11779 tree
11781 {
11785 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11786 and obtain 0. */
11788 /* If we are widening something of an unsigned type, OUTER type
11789 contains all values of INNER type. In particular, both INNER
11790 and OUTER types have zero in common. */
11793 else
11794 {
11795 /* If we are widening a signed type to another signed type, we
11796 want to obtain -2^^(iprec-1). If we are keeping the
11797 precision or narrowing to a signed type, we want to obtain
11798 -2^(oprec-1). */
11803 }
11804 }
11806 /* Return nonzero if two operands that are suitable for PHI nodes are
11807 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11808 SSA_NAME or invariant. Note that this is strictly an optimization.
11809 That is, callers of this function can directly call operand_equal_p
11810 and get the same result, only slower. */
11812 int
11814 {
11820 }
11822 /* Returns number of zeros at the end of binary representation of X. */
11824 tree
11826 {
11828 }
11831 #define WALK_SUBTREE(NODE) \
11832 do \
11833 { \
11834 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11835 if (result) \
11836 return result; \
11837 } \
11838 while (0)
11840 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11841 be walked whenever a type is seen in the tree. Rest of operands and return
11842 value are as for walk_tree. */
11844 static tree
11847 {
11851 {
11855 /* We have to worry about mutually recursive pointers. These can't
11856 be written in C. They can in Ada. It's pathological, but
11857 there's an ACATS test (c38102a) that checks it. Deal with this
11858 by checking if we're pointing to another pointer, that one
11859 points to another pointer, that one does too, and we have no htab.
11860 If so, get a hash table. We check three levels deep to avoid
11861 the cost of the hash table if we don't need one. */
11866 {
11873 }
11875 /* fall through */
11884 /* Fall through. */
11888 {
11889 tree arg;
11891 /* We never want to walk into default arguments. */
11894 }
11898 /* Don't follow this nodes's type if a pointer for fear that
11899 we'll have infinite recursion. If we have a PSET, then we
11900 need not fear. */
11915 }
11918 }
11920 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11921 called with the DATA and the address of each sub-tree. If FUNC returns a
11922 non-NULL value, the traversal is stopped, and the value returned by FUNC
11923 is returned. If PSET is non-NULL it is used to record the nodes visited,
11924 and to avoid visiting a node more than once. */
11926 tree
11929 {
11932 tree result;
11934 #define WALK_SUBTREE_TAIL(NODE) \
11935 do \
11936 { \
11937 tp = & (NODE); \
11938 goto tail_recurse; \
11939 } \
11940 while (0)
11942 tail_recurse:
11943 /* Skip empty subtrees. */
11947 /* Don't walk the same tree twice, if the user has requested
11948 that we avoid doing so. */
11952 /* Call the function. */
11956 /* If we found something, return it. */
11962 /* Even if we didn't, FUNC may have decided that there was nothing
11963 interesting below this point in the tree. */
11965 {
11966 /* But we still need to check our siblings. */
11971 else
11973 }
11976 {
11980 }
11983 {
11996 /* None of these have subtrees other than those already walked
11997 above. */
12006 {
12012 /* Walk all elements but the first. */
12016 /* Now walk the first one as a tail call. */
12018 }
12025 {
12030 idx++)
12032 }
12039 {
12040 tree decl;
12042 {
12043 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12044 into declarations that are just mentioned, rather than
12045 declared; they don't really belong to this part of the tree.
12046 And, we can see cycles: the initializer for a declaration
12047 can refer to the declaration itself. */
12051 }
12053 }
12056 {
12057 tree_stmt_iterator i;
12060 }
12065 {
12069 /* FALLTHRU */
12114 /* FALLTHRU */
12149 {
12154 }
12174 {
12179 }
12183 }
12187 {
12190 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12191 But, we only want to walk once. */
12196 }
12199 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12200 defining. We only want to walk into these fields of a type in this
12201 case and not in the general case of a mere reference to the type.
12203 The criterion is as follows: if the field can be an expression, it
12204 must be walked only here. This should be in keeping with the fields
12205 that are directly gimplified in gimplify_type_sizes in order for the
12206 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12207 variable-sized types.
12209 Note that DECLs get walked as part of processing the BIND_EXPR. */
12211 {
12216 /* Call the function for the type. See if it returns anything or
12217 doesn't want us to continue. If we are to continue, walk both
12218 the normal fields and those for the declaration case. */
12223 /* But do not walk a pointed-to type since it may itself need to
12224 be walked in the declaration case if it isn't anonymous. */
12226 {
12230 }
12232 /* If this is a record type, also walk the fields. */
12234 {
12235 tree field;
12239 {
12240 /* We'd like to look at the type of the field, but we can
12241 easily get infinite recursion. So assume it's pointed
12242 to elsewhere in the tree. Also, ignore things that
12243 aren't fields. */
12252 }
12253 }
12255 /* Same for scalar types. */
12261 {
12264 }
12268 }
12269 /* FALLTHRU */
12273 {
12276 /* Walk over all the sub-trees of this operand. */
12279 /* Go through the subtrees. We need to do this in forward order so
12280 that the scope of a FOR_EXPR is handled properly. */
12282 {
12286 }
12287 }
12288 /* If this is a type, walk the needed fields in the type. */
12292 }
12294 /* We didn't find what we were looking for. */
12297 #undef WALK_SUBTREE_TAIL
12298 }
12299 #undef WALK_SUBTREE
12301 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12303 tree
12305 walk_tree_lh lh)
12306 {
12307 tree result;
12312 }
12315 tree
12317 {
12324 }
12326 void
12328 {
12332 {
12334 }
12335 else
12337 }
12339 /* Create a nameless artificial label and put it in the current
12340 function context. The label has a location of LOC. Returns the
12341 newly created label. */
12343 tree
12345 {
12353 }
12355 /* Given a tree, try to return a useful variable name that we can use
12356 to prefix a temporary that is being assigned the value of the tree.
12357 I.E. given <temp> = &A, return A. */
12361 {
12362 tree stripped_decl;
12369 {
12374 }
12375 else
12376 {
12378 {
12383 }
12384 }
12385 }
12387 /* Return true if TYPE has a variable argument list. */
12389 bool
12391 {
12392 function_args_iterator args_iter;
12399 {
12401 }
12404 }
12406 /* Return true if TYPE has a prototype. */
12408 bool
12410 {
12411 tree t;
12417 }
12419 /* If BLOCK is inlined from an __attribute__((__artificial__))
12420 routine, return pointer to location from where it has been
12421 called. */
12422 location_t *
12424 {
12429 {
12432 {
12433 /* If AO is an artificial inline, point RET to the
12434 call site locus at which it has been inlined and continue
12435 the loop, in case AO's caller is also an artificial
12436 inline. */
12440 else
12442 }
12447 }
12449 }
12452 /* If EXP is inlined from an __attribute__((__artificial__))
12453 function, return the location of the original call expression. */
12455 location_t
12457 {
12462 else
12464 }
12467 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12468 nodes. */
12470 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12472 hashval_t
12474 {
12482 {
12485 }
12490 else
12493 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12494 something else. */
12500 }
12502 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12503 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12504 same. */
12506 bool
12508 {
12521 else
12523 }
12525 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12527 tree
12529 {
12530 tree t;
12532 /* Use the cache of optimization nodes. */
12535 opts);
12540 {
12541 /* Insert this one into the hash table. */
12545 /* Make a new node for next time round. */
12547 }
12550 }
12552 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12554 tree
12556 {
12557 tree t;
12559 /* Use the cache of optimization nodes. */
12562 opts);
12567 {
12568 /* Insert this one into the hash table. */
12572 /* Make a new node for next time round. */
12574 }
12577 }
12579 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12580 so that they aren't saved during PCH writing. */
12582 void
12584 {
12589 }
12591 /* Determine the "ultimate origin" of a block. */
12593 tree
12595 {
12600 else
12601 {
12606 }
12607 }
12609 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12610 no instruction. */
12612 bool
12614 {
12615 /* Do not strip casts into or out of differing address spaces. */
12618 {
12623 }
12626 {
12627 /* We already know that outer_type is not a pointer with
12628 a non-generic address space. */
12630 }
12632 /* Use precision rather then machine mode when we can, which gives
12633 the correct answer even for submode (bit-field) types. */
12642 /* Otherwise fall back on comparing machine modes (e.g. for
12643 aggregate types, floats). */
12645 }
12647 /* Return true iff conversion in EXP generates no instruction. Mark
12648 it inline so that we fully inline into the stripping functions even
12649 though we have two uses of this function. */
12653 {
12668 }
12670 /* Return true iff conversion in EXP generates no instruction. Don't
12671 consider conversions changing the signedness. */
12673 static bool
12675 {
12686 }
12688 /* Strip conversions from EXP according to tree_nop_conversion and
12689 return the resulting expression. */
12691 tree
12693 {
12697 }
12699 /* Strip conversions from EXP according to tree_sign_nop_conversion
12700 and return the resulting expression. */
12702 tree
12704 {
12708 }
12710 /* Avoid any floating point extensions from EXP. */
12711 tree
12713 {
12716 /* For floating point constant look up the narrowest type that can hold
12717 it properly and handle it like (type)(narrowest_type)constant.
12718 This way we can optimize for instance a=a*2.0 where "a" is float
12719 but 2.0 is double constant. */
12721 {
12722 REAL_VALUE_TYPE orig;
12735 }
12754 }
12756 /* Strip out all handled components that produce invariant
12757 offsets. */
12759 const_tree
12761 {
12763 {
12765 {
12780 }
12782 }
12785 }
12789 /* Return the GCC personality function decl. */
12791 tree
12793 {
12797 }
12799 /* TARGET is a call target of GIMPLE call statement
12800 (obtained by gimple_call_fn). Return true if it is
12801 OBJ_TYPE_REF representing an virtual call of C++ method.
12802 (As opposed to OBJ_TYPE_REF representing objc calls
12803 through a cast where middle-end devirtualization machinery
12804 can't apply.) */
12806 bool
12808 {
12817 /* If we do not have BINFO associated, it means that type was built
12818 without devirtualization enabled. Do not consider this a virtual
12819 call. */
12823 }
12825 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12827 static tree
12829 {
12840 }
12842 /* Try to find a base info of BINFO that would have its field decl at offset
12843 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12844 found, return, otherwise return NULL_TREE. */
12846 tree
12848 {
12852 {
12854 tree fld;
12863 {
12871 }
12875 /* Offset 0 indicates the primary base, whose vtable contents are
12876 represented in the binfo for the derived class. */
12878 {
12880 /* Offsets in BINFO are in bytes relative to the whole structure
12881 while POS is in bits relative to the containing field. */
12888 {
12891 }
12894 else
12896 binfo_offset);
12897 }
12901 }
12902 }
12904 /* Returns true if X is a typedef decl. */
12906 bool
12908 {
12911 }
12913 /* Returns true iff TYPE is a type variant created for a typedef. */
12915 bool
12917 {
12919 }
12921 /* PR 84195: Replace control characters in "unescaped" with their
12922 escaped equivalents. Allow newlines if -fmessage-length has
12923 been set to a non-zero value. This is done here, rather than
12924 where the attribute is recorded as the message length can
12925 change between these two locations. */
12927 void
12929 {
12947 {
12951 {
12955 }
12958 {
12960 {
12961 /* We only allocate space for a new string if we
12962 actually encounter a control character that
12963 needs replacing. */
12967 }
12972 {
12981 }
12982 }
12985 }
12988 {
12992 }
12993 }
12995 /* Warn about a use of an identifier which was marked deprecated. Returns
12996 whether a warning was given. */
12998 bool
13000 {
13001 escaped_string msg;
13007 {
13011 {
13016 }
13017 }
13027 {
13028 auto_diagnostic_group d;
13032 else
13037 }
13039 {
13044 {
13050 }
13052 auto_diagnostic_group d;
13054 {
13058 else
13061 }
13062 else
13063 {
13067 else
13070 }
13074 }
13077 }
13079 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13080 somewhere in it. */
13082 bool
13084 {
13086 {
13091 }
13094 }
13096 /* Try to determine whether a TRY_CATCH expression can fall through.
13097 This is a subroutine of block_may_fallthru. */
13099 static bool
13101 {
13102 tree_stmt_iterator i;
13104 /* If the TRY block can fall through, the whole TRY_CATCH can
13105 fall through. */
13111 {
13113 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13114 catch expression and a body. The whole TRY_CATCH may fall
13115 through iff any of the catch bodies falls through. */
13117 {
13120 }
13124 /* The exception filter expression only matters if there is an
13125 exception. If the exception does not match EH_FILTER_TYPES,
13126 we will execute EH_FILTER_FAILURE, and we will fall through
13127 if that falls through. If the exception does match
13128 EH_FILTER_TYPES, the stack unwinder will continue up the
13129 stack, so we will not fall through. We don't know whether we
13130 will throw an exception which matches EH_FILTER_TYPES or not,
13131 so we just ignore EH_FILTER_TYPES and assume that we might
13132 throw an exception which doesn't match. */
13136 /* This case represents statements to be executed when an
13137 exception occurs. Those statements are implicitly followed
13138 by a RESX statement to resume execution after the exception.
13139 So in this case the TRY_CATCH never falls through. */
13141 }
13142 }
13144 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13145 need not be 100% accurate; simply be conservative and return true if we
13146 don't know. This is used only to avoid stupidly generating extra code.
13147 If we're wrong, we'll just delete the extra code later. */
13149 bool
13151 {
13152 /* This CONST_CAST is okay because expr_last returns its argument
13153 unmodified and we assign it to a const_tree. */
13157 {
13160 /* Easy cases. If the last statement of the block implies
13161 control transfer, then we can't fall through. */
13165 /* If there is a default: label or case labels cover all possible
13166 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13167 to some case label in all cases and all we care is whether the
13168 SWITCH_BODY falls through. */
13185 /* The finally clause is always executed after the try clause,
13186 so if it does not fall through, then the try-finally will not
13187 fall through. Otherwise, if the try clause does not fall
13188 through, then when the finally clause falls through it will
13189 resume execution wherever the try clause was going. So the
13190 whole try-finally will only fall through if both the try
13191 clause and the finally clause fall through. */
13201 else
13203 /* FALLTHRU */
13206 /* Functions that do not return do not fall through. */
13220 }
13221 }
13223 /* True if we are using EH to handle cleanups. */
13226 /* This routine is called from front ends to indicate eh should be used for
13227 cleanups. */
13228 void
13230 {
13232 }
13234 /* Query whether EH is used for cleanups. */
13235 bool
13237 {
13239 }
13241 /* Wrapper for tree_code_name to ensure that tree code is valid */
13244 {
13248 {
13252 }
13255 }
13257 /* Drops the TREE_OVERFLOW flag from T. */
13259 tree
13261 {
13264 /* For tree codes with a sharing machinery re-build the result. */
13268 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13269 and canonicalize the result. */
13271 {
13272 tree_vector_builder builder;
13276 {
13281 }
13283 }
13285 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13286 and drop the flag. */
13290 /* For constants that contain nested constants, drop the flag
13291 from those as well. */
13293 {
13298 }
13301 }
13303 /* Given a memory reference expression T, return its base address.
13304 The base address of a memory reference expression is the main
13305 object being referenced. For instance, the base address for
13306 'array[i].fld[j]' is 'array'. You can think of this as stripping
13307 away the offset part from a memory address.
13309 This function calls handled_component_p to strip away all the inner
13310 parts of the memory reference until it reaches the base object. */
13312 tree
13314 {
13323 /* ??? Either the alias oracle or all callers need to properly deal
13324 with WITH_SIZE_EXPRs before we can look through those. */
13329 }
13331 /* Return a tree of sizetype representing the size, in bytes, of the element
13332 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13334 tree
13336 {
13341 /* If a size was specified in the ARRAY_REF, it's the size measured
13342 in alignment units of the element type. So multiply by that value. */
13344 {
13345 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13346 sizetype from another type of the same width and signedness. */
13351 }
13353 /* Otherwise, take the size from that of the element type. Substitute
13354 any PLACEHOLDER_EXPR that we have. */
13355 else
13357 }
13359 /* Return a tree representing the lower bound of the array mentioned in
13360 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13362 tree
13364 {
13367 /* If a lower bound is specified in EXP, use it. */
13371 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13372 substituting for a PLACEHOLDER_EXPR as needed. */
13376 /* Otherwise, return a zero of the appropriate type. */
13378 }
13380 /* Return a tree representing the upper bound of the array mentioned in
13381 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13383 tree
13385 {
13388 /* If there is a domain type and it has an upper bound, use it, substituting
13389 for a PLACEHOLDER_EXPR as needed. */
13393 /* Otherwise fail. */
13395 }
13397 /* Returns true if REF is an array reference, component reference,
13398 or memory reference to an array at the end of a structure.
13399 If this is the case, the array may be allocated larger
13400 than its upper bound implies. */
13402 bool
13404 {
13405 tree atype;
13409 {
13412 }
13417 {
13423 {
13425 {
13431 }
13432 else
13434 }
13435 else
13437 }
13438 else
13446 {
13447 /* If the reference chain contains a component reference to a
13448 non-union type and there follows another field the reference
13449 is not at the end of a structure. */
13451 {
13453 {
13459 }
13460 }
13461 /* If we have a multi-dimensional array we do not consider
13462 a non-innermost dimension as flex array if the whole
13463 multi-dimensional array is at struct end.
13464 Same for an array of aggregates with a trailing array
13465 member. */
13469 ;
13470 /* If we view an underlying object as sth else then what we
13471 gathered up to now is what we have to rely on. */
13474 else
13478 }
13480 /* The array now is at struct end. Treat flexible arrays as
13481 always subject to extend, even into just padding constrained by
13482 an underlying decl. */
13492 /* If the reference is based on a declared entity, the size of the array
13493 is constrained by its given domain. (Do not trust commons PR/69368). */
13495 && !(flag_unconstrained_commons
13499 {
13500 /* Check whether the array domain covers all of the available
13501 padding. */
13502 poly_int64 offset;
13510 /* If at least one extra element fits it is a flexarray. */
13519 }
13522 }
13524 /* Return a tree representing the offset, in bytes, of the field referenced
13525 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13527 tree
13529 {
13534 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13535 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13536 value. */
13538 {
13539 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13540 sizetype from another type of the same width and signedness. */
13546 }
13548 /* Otherwise, take the offset from that of the field. Substitute
13549 any PLACEHOLDER_EXPR that we have. */
13550 else
13552 }
13554 /* Given the initializer INIT, return the initializer for the field
13555 DECL if it exists, otherwise null. Used to obtain the initializer
13556 for a flexible array member and determine its size. */
13558 static tree
13560 {
13566 {
13571 {
13575 }
13576 }
13579 }
13581 /* Determines the size of the member referenced by the COMPONENT_REF
13582 REF, using its initializer expression if necessary in order to
13583 determine the size of an initialized flexible array member.
13584 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13585 an interior zero-length array.
13586 Returns the size as sizetype (which might be zero for an object
13587 with an uninitialized flexible array member) or null if the size
13588 cannot be determined. */
13590 tree
13592 {
13603 {
13611 /* MEMBER is either an interior array or is an array with
13612 more than one element. */
13625 {
13629 /* MEMBER is an array with more than 1 element. */
13631 }
13632 }
13634 /* MEMBER is either a bona fide flexible array member, or a zero-length
13635 array member, or an array of length one treated as such. */
13637 /* If the reference is to a declared object and the member a true
13638 flexible array, try to determine its size from its initializer. */
13642 {
13653 }
13655 /* BASE is the declared object of which MEMBER is either a member
13656 or that is is cast to REFTYPE (e.g., a char buffer used to store
13657 a REFTYPE object). */
13661 /* Determine the base type of the referenced object. If it's
13662 the same as REFTYPE and MEMBER has a known size, return it. */
13674 /* MEMBER is a true flexible array member. Compute its size from
13675 the initializer of the BASE object if it has one. */
13677 {
13680 {
13683 {
13684 /* Use the larger of the initializer size and the tail
13685 padding in the enclosing struct. */
13690 }
13693 }
13694 }
13697 {
13699 {
13704 /* The size of a flexible array member of an extern struct
13705 with no initializer cannot be determined (it's defined
13706 in another translation unit and can have an initializer
13707 with an arbitrary number of elements). */
13710 /* Use the size of the base struct or, for interior zero-length
13711 arrays, the size of the enclosing type. */
13713 }
13715 /* Use the size of the BASE object (possibly an array of some
13716 other type such as char used to store the struct). */
13718 else
13720 }
13722 /* If the flexible array member has a known size use the greater
13723 of it and the tail padding in the enclosing struct.
13724 Otherwise, when the size of the flexible array member is unknown
13725 and the referenced object is not a struct, use the size of its
13726 type when known. This detects sizes of array buffers when cast
13727 to struct types with flexible array members. */
13729 {
13732 {
13735 }
13737 }
13739 /* Return "don't know" for an external non-array object since its
13740 flexible array member can be initialized to have any number of
13741 elements. Otherwise, return zero because the flexible array
13742 member has no elements. */
13745 && (!typematch
13748 }
13750 /* Return the machine mode of T. For vectors, returns the mode of the
13751 inner type. The main use case is to feed the result to HONOR_NANS,
13752 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13754 machine_mode
13756 {
13762 }
13764 /* Vector types need to re-check the target flags each time we report
13765 the machine mode. We need to do this because attribute target can
13766 change the result of vector_mode_supported_p and have_regs_of_mode
13767 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13768 change on a per-function basis. */
13769 /* ??? Possibly a better solution is to run through all the types
13770 referenced by a function and re-compute the TYPE_MODE once, rather
13771 than make the TYPE_MODE macro call a function. */
13773 machine_mode
13775 {
13776 machine_mode mode;
13784 {
13785 scalar_int_mode innermode;
13787 /* For integers, try mapping it to a same-sized scalar mode. */
13789 {
13792 scalar_int_mode mode;
13796 }
13799 }
13802 }
13804 /* Verify that basic properties of T match TV and thus T can be a variant of
13805 TV. TV should be the more specified variant (i.e. the main variant). */
13807 static bool
13809 {
13810 /* Type variant can differ by:
13812 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13813 ENCODE_QUAL_ADDR_SPACE.
13814 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13815 in this case some values may not be set in the variant types
13816 (see TYPE_COMPLETE_P checks).
13817 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13818 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13819 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13820 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13821 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13822 this is necessary to make it possible to merge types form different TUs
13823 - arrays, pointers and references may have TREE_TYPE that is a variant
13824 of TREE_TYPE of their main variants.
13825 - aggregates may have new TYPE_FIELDS list that list variants of
13826 the main variant TYPE_FIELDS.
13827 - vector types may differ by TYPE_VECTOR_OPAQUE
13828 */
13830 /* Convenience macro for matching individual fields. */
13831 #define verify_variant_match(flag) \
13832 do { \
13833 if (flag (tv) != flag (t)) \
13834 { \
13836 debug_tree (tv); \
13837 return false; \
13838 } \
13839 } while (false)
13841 /* tree_base checks. */
13844 /* FIXME: Ada builds non-artificial variants of artificial types. */
13849 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13856 else
13858 /* FIXME: This check trigger during libstdc++ build. */
13862 /* tree_type_common checks. */
13865 {
13873 {
13883 }
13884 }
13891 /* During LTO we merge variant lists from diferent translation units
13892 that may differ BY TYPE_CONTEXT that in turn may point
13893 to TRANSLATION_UNIT_DECL.
13894 Ada also builds variants of types with different TYPE_CONTEXT. */
13902 {
13906 }
13908 /* tree_type_non_common checks. */
13910 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13911 and dangle the pointer from time to time. */
13915 {
13919 }
13925 {
13928 }
13935 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13936 or even type's main variant. This is needed to make bootstrap pass
13937 and the bug seems new in GCC 5.
13938 C++ FE should be updated to make this consistent and we should check
13939 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13940 is a match with main variant.
13942 Also disable the check for Java for now because of parser hack that builds
13943 first an dummy BINFO and then sometimes replace it by real BINFO in some
13944 of the copies. */
13947 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13948 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13949 at LTO time only. */
13951 {
13959 }
13961 /* Check various uses of TYPE_VALUES_RAW. */
13967 /* Permit incomplete variants of complete type. While FEs may complete
13968 all variants, this does not happen for C++ templates in all cases. */
13972 {
13975 /* Fortran builds qualified variants as new records with items of
13976 qualified type. Verify that they looks same. */
13983 /* FIXME: gfc_nonrestricted_type builds all types as variants
13984 with exception of pointer types. It deeply copies the type
13985 which means that we may end up with a variant type
13986 referring non-variant pointer. We may change it to
13987 produce types as variants, too, like
13988 objc_get_protocol_qualified_type does. */
13994 {
14002 }
14003 }
14006 /* For C++ the qualified variant of array type is really an array type
14007 of qualified TREE_TYPE.
14008 objc builds variants of pointer where pointer to type is a variant, too
14009 in objc_get_protocol_qualified_type. */
14015 {
14023 }
14026 {
14034 }
14036 #undef verify_variant_match
14037 }
14040 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14041 the middle-end types_compatible_p function. It needs to avoid
14042 claiming types are different for types that should be treated
14043 the same with respect to TBAA. Canonical types are also used
14044 for IL consistency checks via the useless_type_conversion_p
14045 predicate which does not handle all type kinds itself but falls
14046 back to pointer-comparison of TYPE_CANONICAL for aggregates
14047 for example. */
14049 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14050 type calculation because we need to allow inter-operability between signed
14051 and unsigned variants. */
14053 bool
14055 {
14056 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14057 signed char and unsigned char. Similarly fortran FE builds
14058 C_SIZE_T as signed type, while C defines it unsigned. */
14061 == INTEGER_TYPE
14064 }
14066 /* Return true iff T1 and T2 are structurally identical for what
14067 TBAA is concerned.
14068 This function is used both by lto.c canonical type merging and by the
14069 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14070 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14071 only for LTO because only in these cases TYPE_CANONICAL equivalence
14072 correspond to one defined by gimple_canonical_types_compatible_p. */
14074 bool
14077 {
14078 /* Type variants should be same as the main variant. When not doing sanity
14079 checking to verify this fact, go to main variants and save some work. */
14081 {
14084 }
14086 /* Check first for the obvious case of pointer identity. */
14090 /* Check that we have two types to compare. */
14094 /* We consider complete types always compatible with incomplete type.
14095 This does not make sense for canonical type calculation and thus we
14096 need to ensure that we are never called on it.
14098 FIXME: For more correctness the function probably should have three modes
14099 1) mode assuming that types are complete mathcing their structure
14100 2) mode allowing incomplete types but producing equivalence classes
14101 and thus ignoring all info from complete types
14102 3) mode allowing incomplete types to match complete but checking
14103 compatibility between complete types.
14105 1 and 2 can be used for canonical type calculation. 3 is the real
14106 definition of type compatibility that can be used i.e. for warnings during
14107 declaration merging. */
14112 /* If the types have been previously registered and found equal
14113 they still are. */
14117 {
14118 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14119 they are always NULL, but they are set to non-NULL for types
14120 constructed by build_pointer_type and variants. In this case the
14121 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14122 all pointers are considered equal. Be sure to not return false
14123 negatives. */
14127 }
14129 /* For types where we do ODR based TBAA the canonical type is always
14130 set correctly, so we know that types are different if their
14131 canonical types does not match. */
14137 /* Can't be the same type if the types don't have the same code. */
14142 /* Qualifiers do not matter for canonical type comparison purposes. */
14144 /* Void types and nullptr types are always the same. */
14149 /* Can't be the same type if they have different mode. */
14153 /* Non-aggregate types can be handled cheaply. */
14161 {
14162 /* Can't be the same type if they have different recision. */
14166 /* In some cases the signed and unsigned types are required to be
14167 inter-operable. */
14172 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14173 interoperable with "signed char". Unless all frontends are revisited
14174 to agree on these types, we must ignore the flag completely. */
14176 /* Fortran standard define C_PTR type that is compatible with every
14177 C pointer. For this reason we need to glob all pointers into one.
14178 Still pointers in different address spaces are not compatible. */
14180 {
14184 }
14186 /* Tail-recurse to components. */
14191 trust_type_canonical);
14194 }
14196 /* Do type-specific comparisons. */
14198 {
14200 /* Array types are the same if the element types are the same and
14201 the number of elements are the same. */
14203 trust_type_canonical)
14208 else
14209 {
14213 /* For an incomplete external array, the type domain can be
14214 NULL_TREE. Check this condition also. */
14219 else
14220 {
14226 /* The minimum/maximum values have to be the same. */
14238 else
14240 }
14241 }
14245 /* Function types are the same if the return type and arguments types
14246 are the same. */
14248 trust_type_canonical))
14253 else
14254 {
14260 {
14263 trust_type_canonical))
14265 }
14271 }
14276 {
14279 /* Don't try to compare variants of an incomplete type, before
14280 TYPE_FIELDS has been copied around. */
14288 /* For aggregate types, all the fields must be the same. */
14292 {
14293 /* Skip non-fields and zero-sized fields. */
14304 /* The fields must have the same name, offset and type. */
14307 || !gimple_canonical_types_compatible_p
14309 trust_type_canonical))
14311 }
14313 /* If one aggregate has more fields than the other, they
14314 are not the same. */
14319 }
14322 /* Consider all types with language specific trees in them mutually
14323 compatible. This is executed only from verify_type and false
14324 positives can be tolerated. */
14327 }
14328 }
14330 /* Verify type T. */
14332 void
14334 {
14338 {
14341 }
14343 {
14347 }
14353 ;
14355 {
14359 }
14360 /* Method and function types cannot be used to address memory and thus
14361 TYPE_CANONICAL really matters only for determining useless conversions.
14363 FIXME: C++ FE produce declarations of builtin functions that are not
14364 compatible with main variants. */
14366 ;
14368 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14369 with variably sized arrays because their sizes possibly
14370 gimplified to different variables. */
14374 {
14378 }
14382 {
14386 }
14388 {
14393 }
14396 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14398 {
14399 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14400 and danagle the pointer from time to time. */
14404 {
14408 }
14409 }
14411 {
14414 {
14418 }
14419 }
14421 {
14424 {
14428 }
14429 }
14432 {
14433 /* FIXME: The following check should pass:
14434 useless_type_conversion_p (const_cast <tree> (t),
14435 TREE_TYPE (TYPE_MIN_VALUE (t))
14436 but does not for C sizetypes in LTO. */
14437 }
14439 /* Check various uses of TYPE_MAXVAL_RAW. */
14441 {
14443 ;
14445 {
14449 }
14451 {
14455 }
14456 }
14458 {
14462 {
14466 }
14467 }
14469 {
14473 {
14477 }
14478 }
14481 {
14482 /* FIXME: The following check should pass:
14483 useless_type_conversion_p (const_cast <tree> (t),
14484 TREE_TYPE (TYPE_MAX_VALUE (t))
14485 but does not for C sizetypes in LTO. */
14486 }
14488 {
14491 {
14495 }
14496 }
14498 {
14502 }
14505 {
14509 }
14511 /* Check various uses of TYPE_VALUES_RAW. */
14514 {
14518 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14519 CONST_DECL of ENUMERAL TYPE. */
14521 {
14526 }
14529 {
14535 }
14537 {
14542 }
14543 }
14545 {
14547 {
14551 }
14552 }
14554 {
14556 {
14559 }
14561 {
14562 /* TODO: verify properties of decls. */
14564 ;
14566 ;
14568 ;
14570 ;
14572 ;
14574 ;
14576 ;
14577 else
14578 {
14582 }
14583 }
14584 }
14591 {
14593 {
14598 }
14600 {
14604 }
14605 /* Verify just enough of cache to ensure that no one copied it to new type.
14606 All copying should go by copy_node that should clear it. */
14608 {
14613 {
14618 }
14619 }
14620 }
14623 {
14624 /* C++ FE uses TREE_PURPOSE to store initial values. */
14626 {
14630 }
14632 {
14636 }
14637 }
14639 {
14643 }
14651 {
14654 }
14656 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14657 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14658 of a type. */
14661 {
14664 }
14667 {
14670 }
14671 }
14674 /* Return 1 if ARG interpreted as signed in its precision is known to be
14675 always positive or 2 if ARG is known to be always negative, or 3 if
14676 ARG may be positive or negative. */
14678 int
14680 {
14687 {
14691 else
14693 }
14697 {
14699 /* Narrower value zero extended into wider type
14700 will always result in positive values. */
14707 }
14713 {
14717 {
14721 {
14730 }
14731 }
14733 }
14735 {
14736 /* For unsigned values, the "positive" range comes
14737 below the "negative" range. */
14742 }
14743 else
14744 {
14749 }
14751 }
14756 /* Return true if ARG is marked with the nonnull attribute in the
14757 current function signature. */
14759 bool
14761 {
14769 /* The static chain decl is always non null. */
14773 /* THIS argument of method is always non-NULL. */
14779 /* Values passed by reference are always non-NULL. */
14786 {
14789 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14793 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14797 /* Get the position number for ARG in the function signature. */
14799 t;
14801 {
14804 }
14808 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14810 {
14813 }
14814 }
14817 }
14819 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14820 information. */
14822 location_t
14824 {
14828 }
14830 location_t
14832 {
14833 source_range src_range;
14837 }
14839 location_t
14841 {
14847 pure_loc,
14848 src_range,
14849 NULL);
14852 }
14854 /* Return EXPR, potentially wrapped with a node expression LOC,
14855 if !CAN_HAVE_LOCATION_P (expr).
14857 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14858 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14860 Wrapper nodes can be identified using location_wrapper_p. */
14862 tree
14864 {
14871 /* We should only be adding wrappers for constants and for decls,
14872 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14877 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14878 any impact of the wrapper nodes. */
14882 /* If any auto_suppress_location_wrappers are active, don't create
14883 wrappers. */
14887 tree_code code
14892 /* Mark this node as being a wrapper. */
14895 }
14899 /* Return the name of combined function FN, for debugging purposes. */
14903 {
14905 {
14908 }
14909 else
14911 }
14913 /* Return a bitmap with a bit set corresponding to each argument in
14914 a function call type FNTYPE declared with attribute nonnull,
14915 or null if none of the function's argument are nonnull. The caller
14916 must free the bitmap. */
14918 bitmap
14920 {
14930 /* A function declaration can specify multiple attribute nonnull,
14931 each with zero or more arguments. The loop below creates a bitmap
14932 representing a union of all the arguments. An empty (but non-null)
14933 bitmap means that all arguments have been declaraed nonnull. */
14935 {
14944 {
14945 /* Clear the bitmap in case a previous attribute nonnull
14946 set it and this one overrides it for all arguments. */
14949 }
14951 /* Iterate over the indices of the format arguments declared nonnull
14952 and set a bit for each. */
14954 {
14957 }
14958 }
14961 }
14963 /* Returns true if TYPE is a type where it and all of its subobjects
14964 (recursively) are of structure, union, or array type. */
14966 static bool
14968 {
14970 {
14977 }
14983 }
14985 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14986 that shouldn't be passed via stack. */
14988 bool
14990 {
15001 }
15003 /* Determine whether TYPE is a structure with a flexible array member,
15004 or a union containing such a structure (possibly recursively). */
15006 bool
15008 {
15011 {
15027 {
15031 }
15035 }
15036 }
15038 /* Like int_size_in_bytes, but handle empty records specially. */
15040 HOST_WIDE_INT
15042 {
15044 }
15046 /* Like size_in_bytes, but handle empty records specially. */
15048 tree
15050 {
15052 }
15054 /* Return true if an expression with CODE has to have the same result type as
15055 its first operand. */
15057 bool
15059 {
15061 {
15095 }
15096 }
15098 /* Return a typenode for the "standard" C type with a given name. */
15099 tree
15101 {
15133 }
15135 /* List of pointer types used to declare builtins before we have seen their
15136 real declaration.
15138 Keep the size up to date in tree.h ! */
15140 {
15147 };
15149 /* Return the maximum object size. */
15151 tree
15153 {
15154 /* To do: Make this a configurable parameter. */
15156 }
15158 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15159 parameter default to false and that weeds out error_mark_node. */
15161 bool
15164 {
15171 }
15173 #if CHECKING_P
15177 /* Selftests for tree. */
15179 /* Verify that integer constants are sane. */
15181 static void
15183 {
15196 }
15198 /* Verify identifiers. */
15200 static void
15202 {
15206 }
15208 /* Verify LABEL_DECL. */
15210 static void
15212 {
15218 }
15220 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15221 are given by VALS. */
15223 static tree
15225 {
15230 }
15232 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15234 static void
15236 {
15242 }
15244 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15245 and that its elements match EXPECTED. */
15247 static void
15250 {
15257 }
15259 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15260 and NPATTERNS background elements, and that its elements match
15261 EXPECTED. */
15263 static void
15266 {
15273 }
15275 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15276 and that its elements match EXPECTED. */
15278 static void
15281 {
15288 }
15290 /* Test the creation of VECTOR_CSTs. */
15292 static void
15294 {
15300 /* Test a simple linear series with a base of 0 and a step of 1:
15301 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15307 /* Try the same with the first element replaced by 100:
15308 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15313 /* Try a series that wraps around.
15314 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15320 /* Try a downward series:
15321 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15327 /* Try two interleaved series with different bases and steps:
15328 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15331 {
15334 }
15338 /* Try a duplicated value:
15339 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15345 /* Try an interleaved duplicated value:
15346 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15353 /* Try a duplicated value with 2 exceptions
15354 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15360 /* Try with and without a step
15361 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15367 /* Try a fully-general constant:
15368 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15372 }
15374 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15375 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15376 modifying its argument in-place. */
15378 static void
15380 {
15383 }
15385 /* Verify location wrappers. */
15387 static void
15389 {
15394 /* Wrapping a constant. */
15404 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15407 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15412 /* Wrapping a STRING_CST. */
15424 /* Wrapping a variable. */
15427 integer_type_node);
15436 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15437 wrapper. */
15442 /* Verify that STRIP_NOPS removes wrappers. */
15446 }
15448 /* Test various tree predicates. Verify that location wrappers don't
15449 affect the results. */
15451 static void
15453 {
15454 /* Build various constants and wrappers around them. */
15482 /* TODO: vector constants. */
15484 /* Test integer_onep. */
15504 /* Test integer_zerop. */
15524 /* Test integer_all_onesp. */
15544 /* Test integer_minus_onep. */
15564 /* Test integer_each_onep. */
15584 /* Test integer_truep. */
15604 /* Test integer_nonzerop. */
15624 /* Test real_zerop. */
15644 /* Test real_onep. */
15664 /* Test real_minus_onep. */
15684 /* Test zerop. */
15704 /* Test tree_expr_nonnegative_p. */
15724 /* Test tree_expr_nonzero_p. */
15732 /* Test integer_valued_real_p. */
15739 /* Test integer_pow2p. */
15744 /* Test uniform_integer_cst_p. */
15763 }
15765 /* Check that string escaping works correctly. */
15767 static void
15769 {
15771 escaped_string msg;
15774 /* ASSERT_STREQ does not accept NULL as a valid test
15775 result, so we have to use ASSERT_EQ instead. */
15784 /* Ensure that we have -fmessage-length set to 0. */
15794 /* Now repeat the tests with -fmessage-length set to 5. */
15797 /* Note that the newline is not translated into an escape. */
15804 /* Restore the original message length setting. */
15806 }
15808 /* Run all of the selftests within this file. */
15810 void
15812 {
15820 }