| blob | 342da55bba7efd2bbf0c129ff224062a7a780bb3 |
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, as a tree node, the number of elements for TYPE (which is an
3355 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3357 tree
3359 {
3362 /* If they did it with unspecified bounds, then we should have already
3363 given an error about it before we got here. */
3371 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3376 ? max
3378 }
3379 \f
3380 /* If arg is static -- a reference to an object in static storage -- then
3381 return the object. This is not the same as the C meaning of `static'.
3382 If arg isn't static, return NULL. */
3384 tree
3386 {
3388 {
3390 /* Nested functions are static, even though taking their address will
3391 involve a trampoline as we unnest the nested function and create
3392 the trampoline on the tree level. */
3413 /* If the thing being referenced is not a field, then it is
3414 something language specific. */
3417 /* If we are referencing a bitfield, we can't evaluate an
3418 ADDR_EXPR at compile time and so it isn't a constant. */
3435 else
3443 }
3444 }
3446 \f
3449 /* Return whether OP is a DECL whose address is function-invariant. */
3451 bool
3453 {
3454 /* The conditions below are slightly less strict than the one in
3455 staticp. */
3458 {
3481 }
3484 }
3486 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3488 bool
3490 {
3491 /* The conditions below are slightly less strict than the one in
3492 staticp. */
3495 {
3515 }
3518 }
3521 /* Return true if T is function-invariant (internal function, does
3522 not handle arithmetic; that's handled in skip_simple_arithmetic and
3523 tree_invariant_p). */
3525 static bool
3527 {
3528 tree op;
3535 {
3542 {
3544 {
3559 }
3561 }
3567 }
3570 }
3572 /* Return true if T is function-invariant. */
3574 bool
3576 {
3579 }
3581 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3582 Do this to any expression which may be used in more than one place,
3583 but must be evaluated only once.
3585 Normally, expand_expr would reevaluate the expression each time.
3586 Calling save_expr produces something that is evaluated and recorded
3587 the first time expand_expr is called on it. Subsequent calls to
3588 expand_expr just reuse the recorded value.
3590 The call to expand_expr that generates code that actually computes
3591 the value is the first call *at compile time*. Subsequent calls
3592 *at compile time* generate code to use the saved value.
3593 This produces correct result provided that *at run time* control
3594 always flows through the insns made by the first expand_expr
3595 before reaching the other places where the save_expr was evaluated.
3596 You, the caller of save_expr, must make sure this is so.
3598 Constants, and certain read-only nodes, are returned with no
3599 SAVE_EXPR because that is safe. Expressions containing placeholders
3600 are not touched; see tree.def for an explanation of what these
3601 are used for. */
3603 tree
3605 {
3606 tree inner;
3608 /* If the tree evaluates to a constant, then we don't want to hide that
3609 fact (i.e. this allows further folding, and direct checks for constants).
3610 However, a read-only object that has side effects cannot be bypassed.
3611 Since it is no problem to reevaluate literals, we just return the
3612 literal node. */
3620 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3621 it means that the size or offset of some field of an object depends on
3622 the value within another field.
3624 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3625 and some variable since it would then need to be both evaluated once and
3626 evaluated more than once. Front-ends must assure this case cannot
3627 happen by surrounding any such subexpressions in their own SAVE_EXPR
3628 and forcing evaluation at the proper time. */
3634 /* This expression might be placed ahead of a jump to ensure that the
3635 value was computed on both sides of the jump. So make sure it isn't
3636 eliminated as dead. */
3639 }
3641 /* Look inside EXPR into any simple arithmetic operations. Return the
3642 outermost non-arithmetic or non-invariant node. */
3644 tree
3646 {
3647 /* We don't care about whether this can be used as an lvalue in this
3648 context. */
3652 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3653 a constant, it will be more efficient to not make another SAVE_EXPR since
3654 it will allow better simplification and GCSE will be able to merge the
3655 computations if they actually occur. */
3657 {
3661 {
3666 else
3668 }
3669 else
3671 }
3674 }
3676 /* Look inside EXPR into simple arithmetic operations involving constants.
3677 Return the outermost non-arithmetic or non-constant node. */
3679 tree
3681 {
3686 {
3690 {
3695 else
3697 }
3698 else
3700 }
3703 }
3705 /* Return which tree structure is used by T. */
3707 enum tree_node_structure_enum
3709 {
3712 }
3714 /* Set various status flags when building a CALL_EXPR object T. */
3716 static void
3718 {
3723 /* Calls have side-effects, except those to const or pure functions. */
3726 /* Propagate TREE_READONLY of arguments for const functions. */
3732 {
3738 }
3742 }
3743 \f
3744 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3745 size or offset that depends on a field within a record. */
3747 bool
3749 {
3760 {
3762 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3763 position computations since they will be converted into a
3764 WITH_RECORD_EXPR involving the reference, which will assume
3765 here will be valid. */
3779 {
3781 /* Ignoring the first operand isn't quite right, but works best. */
3790 /* The save_expr function never wraps anything containing
3791 a PLACEHOLDER_EXPR. */
3796 }
3799 {
3807 }
3811 {
3813 {
3814 const_tree arg;
3815 const_call_expr_arg_iterator iter;
3820 }
3823 }
3827 }
3829 }
3831 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3832 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3833 field positions. */
3835 static bool
3837 {
3838 /* If the size contains a placeholder or the parent type (component type in
3839 the case of arrays) type involves a placeholder, this type does. */
3847 /* Now do type-specific checks. Note that the last part of the check above
3848 greatly limits what we have to do below. */
3850 {
3867 /* Here we just check the bounds. */
3872 /* We have already checked the component type above, so just check
3873 the domain type. Flexible array members have a null domain. */
3880 {
3881 tree field;
3892 }
3896 }
3897 }
3899 /* Wrapper around above function used to cache its result. */
3901 bool
3903 {
3906 /* If the contains_placeholder_bits field has been initialized,
3907 then we know the answer. */
3911 /* Indicate that we've seen this type node, and the answer is false.
3912 This is what we want to return if we run into recursion via fields. */
3915 /* Compute the real value. */
3918 /* Store the real value. */
3922 }
3923 \f
3924 /* Push tree EXP onto vector QUEUE if it is not already present. */
3926 static void
3928 {
3930 tree iter;
3938 }
3940 /* Given a tree EXP, find all occurrences of references to fields
3941 in a PLACEHOLDER_EXPR and place them in vector REFS without
3942 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3943 we assume here that EXP contains only arithmetic expressions
3944 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3945 argument list. */
3947 void
3949 {
3951 tree inner;
3954 /* We handle TREE_LIST and COMPONENT_REF separately. */
3956 {
3959 }
3961 {
3965 ;
3969 else
3971 }
3972 else
3974 {
3979 /* Variables allocated to static storage can stay. */
3985 /* This is the pattern built in ada/make_aligning_type. */
3988 {
3991 }
3993 /* Fall through. */
4011 }
4012 }
4014 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4015 return a tree with all occurrences of references to F in a
4016 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4017 CONST_DECLs. Note that we assume here that EXP contains only
4018 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4019 occurring only in their argument list. */
4021 tree
4023 {
4026 tree new_tree;
4028 /* We handle TREE_LIST and COMPONENT_REF separately. */
4030 {
4037 }
4039 {
4040 tree inner;
4042 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4043 and it is the right field, replace it with R. */
4047 ;
4049 /* The field. */
4055 /* If this expression hasn't been completed let, leave it alone. */
4063 new_tree
4065 }
4066 else
4068 {
4075 else
4082 /* Fall through. */
4090 {
4135 new_tree
4141 }
4145 {
4150 /* If we are trying to replace F with a constant or with another
4151 instance of one of the arguments of the call, inline back
4152 functions which do nothing else than computing a value from
4153 the arguments they are passed. This makes it possible to
4154 fold partially or entirely the replacement expression. */
4156 {
4160 else
4163 {
4166 }
4168 {
4172 }
4173 }
4176 {
4180 {
4184 }
4185 }
4188 {
4192 }
4193 else
4195 }
4200 }
4208 }
4210 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4211 for it within OBJ, a tree that is an object or a chain of references. */
4213 tree
4215 {
4218 tree new_tree;
4220 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4221 in the chain of OBJ. */
4223 {
4225 tree elt;
4255 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4256 survives until RTL generation, there will be an error. */
4258 }
4260 /* TREE_LIST is special because we need to look at TREE_VALUE
4261 and TREE_CHAIN, not TREE_OPERANDS. */
4263 {
4270 }
4271 else
4273 {
4286 {
4331 new_tree
4337 }
4341 {
4347 {
4351 {
4355 }
4356 }
4359 {
4363 }
4364 else
4366 }
4371 }
4379 }
4380 \f
4382 /* Subroutine of stabilize_reference; this is called for subtrees of
4383 references. Any expression with side-effects must be put in a SAVE_EXPR
4384 to ensure that it is only evaluated once.
4386 We don't put SAVE_EXPR nodes around everything, because assigning very
4387 simple expressions to temporaries causes us to miss good opportunities
4388 for optimizations. Among other things, the opportunity to fold in the
4389 addition of a constant into an addressing mode often gets lost, e.g.
4390 "y[i+1] += x;". In general, we take the approach that we should not make
4391 an assignment unless we are forced into it - i.e., that any non-side effect
4392 operator should be allowed, and that cse should take care of coalescing
4393 multiple utterances of the same expression should that prove fruitful. */
4395 static tree
4397 {
4398 tree result;
4401 /* We cannot ignore const expressions because it might be a reference
4402 to a const array but whose index contains side-effects. But we can
4403 ignore things that are actual constant or that already have been
4404 handled by this function. */
4410 {
4412 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4413 have side-effects. */
4416 /* FALLTHRU */
4424 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4425 so that it will only be evaluated once. */
4426 /* The reference (r) and comparison (<) classes could be handled as
4427 below, but it is generally faster to only evaluate them once. */
4433 /* Constants need no processing. In fact, we should never reach
4434 here. */
4438 /* Division is slow and tends to be compiled with jumps,
4439 especially the division by powers of 2 that is often
4440 found inside of an array reference. So do it just once. */
4446 /* Recursively stabilize each operand. */
4452 /* Recursively stabilize each operand. */
4458 }
4466 }
4468 /* Stabilize a reference so that we can use it any number of times
4469 without causing its operands to be evaluated more than once.
4470 Returns the stabilized reference. This works by means of save_expr,
4471 so see the caveats in the comments about save_expr.
4473 Also allows conversion expressions whose operands are references.
4474 Any other kind of expression is returned unchanged. */
4476 tree
4478 {
4479 tree result;
4483 {
4487 /* No action is needed in this case. */
4490 CASE_CONVERT:
4529 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4530 it wouldn't be ignored. This matters when dealing with
4531 volatiles. */
4534 /* If arg isn't a kind of lvalue we recognize, make no change.
4535 Caller should recognize the error for an invalid lvalue. */
4541 }
4549 }
4550 \f
4551 /* Low-level constructors for expressions. */
4553 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4554 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4556 void
4558 {
4559 tree node;
4564 /* We started out assuming this address is both invariant and constant, but
4565 does not have side effects. Now go down any handled components and see if
4566 any of them involve offsets that are either non-constant or non-invariant.
4567 Also check for side-effects.
4569 ??? Note that this code makes no attempt to deal with the case where
4570 taking the address of something causes a copy due to misalignment. */
4572 #define UPDATE_FLAGS(NODE) \
4573 do { tree _node = (NODE); \
4574 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4575 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4579 {
4580 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4581 array reference (probably made temporarily by the G++ front end),
4582 so ignore all the operands. */
4586 {
4592 }
4593 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4594 FIELD_DECL, apparently. The G++ front end can put something else
4595 there, at least temporarily. */
4598 {
4601 }
4602 }
4606 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4607 the address, since &(*a)->b is a form of addition. If it's a constant, the
4608 address is constant too. If it's a decl, its address is constant if the
4609 decl is static. Everything else is not constant and, furthermore,
4610 taking the address of a volatile variable is not volatile. */
4615 ;
4618 else
4619 {
4622 }
4627 #undef UPDATE_FLAGS
4628 }
4630 /* Build an expression of code CODE, data type TYPE, and operands as
4631 specified. Expressions and reference nodes can be created this way.
4632 Constants, decls, types and misc nodes cannot be.
4634 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4635 enough for all extant tree codes. */
4637 tree
4639 {
4640 tree t;
4648 }
4650 tree
4652 {
4654 tree t;
4670 {
4673 }
4676 {
4679 }
4681 {
4683 /* All of these have side-effects, no matter what their
4684 operands are. */
4690 /* Whether a dereference is readonly has nothing to do with whether
4691 its operand is readonly. */
4709 }
4712 }
4714 #define PROCESS_ARG(N) \
4715 do { \
4716 TREE_OPERAND (t, N) = arg##N; \
4717 if (arg##N &&!TYPE_P (arg##N)) \
4718 { \
4719 if (TREE_SIDE_EFFECTS (arg##N)) \
4720 side_effects = 1; \
4721 if (!TREE_READONLY (arg##N) \
4722 && !CONSTANT_CLASS_P (arg##N)) \
4723 (void) (read_only = 0); \
4724 if (!TREE_CONSTANT (arg##N)) \
4725 (void) (constant = 0); \
4726 } \
4727 } while (0)
4729 tree
4731 {
4733 tree t;
4739 /* When sizetype precision doesn't match that of pointers
4740 we need to be able to build explicit extensions or truncations
4741 of the offset argument. */
4753 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4754 result based on those same flags for the arguments. But if the
4755 arguments aren't really even `tree' expressions, we shouldn't be trying
4756 to do this. */
4758 /* Expressions without side effects may be constant if their
4759 arguments are as well. */
4766 {
4780 }
4787 {
4789 {
4793 }
4794 }
4795 else
4796 {
4798 /* Don't mark X / 0 as constant. */
4803 }
4806 }
4809 tree
4811 tree arg2 MEM_STAT_DECL)
4812 {
4814 tree t;
4824 /* As a special exception, if COND_EXPR has NULL branches, we
4825 assume that it is a gimple statement and always consider
4826 it to have side effects. */
4832 else
4848 }
4850 tree
4853 {
4855 tree t;
4875 }
4877 tree
4880 {
4882 tree t;
4899 {
4901 {
4905 }
4906 }
4907 else
4913 }
4915 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4916 on the pointer PTR. */
4918 tree
4920 {
4923 tree tem;
4924 /* For convenience allow addresses that collapse to a simple base
4925 and offset. */
4929 {
4933 {
4936 }
4937 else
4940 }
4945 }
4947 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4949 poly_offset_int
4951 {
4953 SIGNED);
4954 }
4956 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4957 offsetted by OFFSET units. */
4959 tree
4961 {
4968 }
4970 /* Similar except don't specify the TREE_TYPE
4971 and leave the TREE_SIDE_EFFECTS as 0.
4972 It is permissible for arguments to be null,
4973 or even garbage if their values do not matter. */
4975 tree
4977 {
4978 tree t;
4995 }
4997 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4998 tree vec. */
5000 tree
5002 {
5012 }
5013 \f
5014 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5015 and data type TYPE.
5016 We do NOT enter this node in any sort of symbol table.
5018 LOC is the location of the decl.
5020 layout_decl is used to set up the decl's storage layout.
5021 Other slots are initialized to 0 or null pointers. */
5023 tree
5025 tree type MEM_STAT_DECL)
5026 {
5027 tree t;
5032 /* if (type == error_mark_node)
5033 type = integer_type_node; */
5034 /* That is not done, deliberately, so that having error_mark_node
5035 as the type can suppress useless errors in the use of this variable. */
5044 }
5046 /* Builds and returns function declaration with NAME and TYPE. */
5048 tree
5050 {
5060 }
5064 /* Builds a new translation-unit decl with name NAME, queues it in the
5065 global list of translation-unit decls and returns it. */
5067 tree
5069 {
5075 }
5077 \f
5078 /* BLOCK nodes are used to represent the structure of binding contours
5079 and declarations, once those contours have been exited and their contents
5080 compiled. This information is used for outputting debugging info. */
5082 tree
5084 {
5092 }
5094 \f
5095 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5097 LOC is the location to use in tree T. */
5099 void
5101 {
5105 {
5109 }
5110 }
5112 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5113 UNKNOWN_LOCATION. */
5115 void
5117 {
5121 }
5123 /* Data used when collecting DECLs and TYPEs for language data removal. */
5125 class free_lang_data_d
5126 {
5130 /* Worklist to avoid excessive recursion. */
5133 /* Set of traversed objects. Used to avoid duplicate visits. */
5136 /* Array of symbols to process with free_lang_data_in_decl. */
5139 /* Array of types to process with free_lang_data_in_type. */
5141 };
5144 /* Add type or decl T to one of the list of tree nodes that need their
5145 language data removed. The lists are held inside FLD. */
5147 static void
5149 {
5154 else
5156 }
5158 /* Push tree node T into FLD->WORKLIST. */
5162 {
5165 }
5168 \f
5169 /* Return simplified TYPE_NAME of TYPE. */
5171 static tree
5173 {
5176 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5177 TYPE_DECL if the type doesn't have linkage.
5178 this must match fld_ */
5186 }
5188 /* Do same comparsion as check_qualified_type skipping lang part of type
5189 and be more permissive about type names: we only care that names are
5190 same (for diagnostics) and that ODR names are the same.
5191 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5193 static bool
5195 {
5197 /* We want to match incomplete variants with complete types.
5198 In this case we need to ignore alignment. */
5209 }
5211 /* Find variant of FIRST that match T and create new one if necessary.
5212 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5214 static tree
5217 {
5232 /* Variants of incomplete types should have alignment
5233 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5235 {
5238 }
5245 }
5247 /* Map complete types to incomplete types. */
5251 /* Map types to simplified types. */
5255 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5256 use MAP to prevent duplicates. */
5258 static tree
5261 {
5266 {
5267 return fld_type_variant
5271 }
5274 tree &array
5277 {
5278 array
5284 }
5286 }
5288 /* Return CTX after removal of contexts that are not relevant */
5290 static tree
5292 {
5293 /* Variably modified types are needed for tree_is_indexable to decide
5294 whether the type needs to go to local or global section.
5295 This code is semi-broken but for now it is easiest to keep contexts
5296 as expected. */
5299 {
5302 }
5304 }
5306 /* For T being aggregate type try to turn it into a incomplete variant.
5307 Return T if no simplification is possible. */
5309 static tree
5311 {
5315 {
5318 {
5319 tree first;
5323 else
5331 }
5333 }
5342 {
5344 tree ©
5348 {
5351 /* It is possible that type was not seen by free_lang_data yet. */
5360 {
5368 }
5369 else
5370 {
5374 }
5376 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5377 This is needed for ODR violation warnings to come out right (we
5378 want duplicate TYPE_DECLs whenever the type is duplicated because
5379 of ODR violation. Because lang data in the TYPE_DECL may not
5380 have been freed yet, rebuild it from scratch and copy relevant
5381 fields. */
5386 {
5396 }
5397 }
5399 }
5402 }
5404 /* Simplify type T for scenarios where we do not need complete pointer
5405 types. */
5407 static tree
5409 {
5414 /* FIXME: This triggers verification error, see PR88140. */
5419 }
5421 /* Reset the expression *EXPR_P, a size or position.
5423 ??? We could reset all non-constant sizes or positions. But it's cheap
5424 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5426 We need to reset self-referential sizes or positions because they cannot
5427 be gimplified and thus can contain a CALL_EXPR after the gimplification
5428 is finished, which will run afoul of LTO streaming. And they need to be
5429 reset to something essentially dummy but not constant, so as to preserve
5430 the properties of the object they are attached to. */
5434 {
5438 }
5441 /* Reset all the fields in a binfo node BINFO. We only keep
5442 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5444 static void
5446 {
5448 tree t;
5461 }
5464 /* Reset all language specific information still present in TYPE. */
5466 static void
5468 {
5471 /* Give the FE a chance to remove its own data first. */
5484 /* Purge non-marked variants from the variants chain, so that they
5485 don't reappear in the IL after free_lang_data. */
5488 {
5491 /* Turn the removed types into distinct types. */
5494 }
5497 {
5499 /* Remove the const and volatile qualifiers from arguments. The
5500 C++ front end removes them, but the C front end does not,
5501 leading to false ODR violation errors when merging two
5502 instances of the same function signature compiled by
5503 different front ends. */
5505 {
5510 {
5512 & ~TYPE_QUAL_CONST
5517 }
5518 /* C++ FE uses TREE_PURPOSE to store initial values. */
5520 }
5521 }
5523 {
5526 {
5527 /* C++ FE uses TREE_PURPOSE to store initial values. */
5530 }
5531 }
5533 {
5534 /* Remove members that are not FIELD_DECLs from the field list
5535 of an aggregate. These occur in C++. */
5539 else
5545 {
5547 /* We need to preserve link to bases and virtual table for all
5548 polymorphic types to make devirtualization machinery working. */
5551 }
5552 }
5556 {
5558 {
5561 /* Type values are used only for C++ ODR checking. Drop them
5562 for all type variants and non-ODR types.
5563 For ODR types the data is freed in free_odr_warning_data. */
5565 ;
5570 else
5572 }
5575 }
5584 {
5586 do
5587 {
5589 }
5592 }
5596 }
5599 /* Return true if DECL may need an assembler name to be set. */
5603 {
5604 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5605 Rule merging. This makes type_odr_p to return true on those types during
5606 LTO and by comparing the mangled name, we can say what types are intended
5607 to be equivalent across compilation unit.
5609 We do not store names of type_in_anonymous_namespace_p.
5611 Record, union and enumeration type have linkage that allows use
5612 to check type_in_anonymous_namespace_p. We do not mangle compound types
5613 that always can be compared structurally.
5615 Similarly for builtin types, we compare properties of their main variant.
5616 A special case are integer types where mangling do make differences
5617 between char/signed char/unsigned char etc. Storing name for these makes
5618 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5619 See cp/mangle.c:write_builtin_type for details. */
5622 {
5635 }
5636 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5640 /* If DECL already has its assembler name set, it does not need a
5641 new one. */
5646 /* Abstract decls do not need an assembler name. */
5650 /* For VAR_DECLs, only static, public and external symbols need an
5651 assembler name. */
5659 {
5660 /* Do not set assembler name on builtins. Allow RTL expansion to
5661 decide whether to expand inline or via a regular call. */
5666 /* Functions represented in the callgraph need an assembler name. */
5670 /* Unused and not public functions don't need an assembler name. */
5673 }
5676 }
5679 /* Reset all language specific information still present in symbol
5680 DECL. */
5682 static void
5684 {
5687 /* Give the FE a chance to remove its own data first. */
5701 {
5706 }
5709 {
5711 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5712 the address may be taken in other unit, so this flag has no practical
5713 use for middle-end.
5715 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5716 for public objects that indeed cannot be adressed, but it is not
5717 the case. Set the flag to true so we do not get merge failures for
5718 i.e. virtual tables between units that take address of it and
5719 units that don't. */
5725 {
5728 else
5729 {
5734 }
5735 }
5737 {
5738 tree t;
5740 /* If DECL has a gimple body, then the context for its
5741 arguments must be DECL. Otherwise, it doesn't really
5742 matter, as we will not be emitting any code for DECL. In
5743 general, there may be other instances of DECL created by
5744 the front end and since PARM_DECLs are generally shared,
5745 their DECL_CONTEXT changes as the replicas of DECL are
5746 created. The only time where DECL_CONTEXT is important
5747 is for the FUNCTION_DECLs that have a gimple body (since
5748 the PARM_DECL will be used in the function's body). */
5757 }
5759 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5760 At this point, it is not needed anymore. */
5763 /* Clear the abstract origin if it refers to a method.
5764 Otherwise dwarf2out.c will ICE as we splice functions out of
5765 TYPE_FIELDS and thus the origin will not be output
5766 correctly. */
5769 && RECORD_OR_UNION_TYPE_P
5774 }
5776 {
5777 /* See comment above why we set the flag for functions. */
5784 }
5786 {
5797 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5798 }
5800 {
5803 }
5807 {
5808 /* Strip builtins from the translation-unit BLOCK. We still have targets
5809 without builtin_decl_explicit support and also builtins are shared
5810 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5813 {
5818 else
5820 }
5821 }
5822 /* We need to keep field decls associated with their trees. Otherwise tree
5823 merging may merge some fileds and keep others disjoint wich in turn will
5824 not do well with TREE_CHAIN pointers linking them.
5826 Also do not drop containing types for virtual methods and tables because
5827 these are needed by devirtualization.
5828 C++ destructors are special because C++ frontends sometimes produces
5829 virtual destructor as an alias of non-virtual destructor. In
5830 devirutalization code we always walk through aliases and we need
5831 context to be preserved too. See PR89335 */
5838 }
5841 /* Operand callback helper for free_lang_data_in_node. *TP is the
5842 subtree operand being considered. */
5844 static tree
5846 {
5853 /* Language specific nodes will be removed, so there is no need
5854 to gather anything under them. */
5856 {
5859 }
5862 {
5863 /* Note that walk_tree does not traverse every possible field in
5864 decls, so we have to do our own traversals here. */
5872 /* We are going to remove everything under DECL_INITIAL for
5873 TYPE_DECLs. No point walking them. */
5881 {
5884 }
5886 {
5891 }
5901 }
5903 {
5904 /* Note that walk_tree does not traverse every possible field in
5905 types, so we have to do our own traversals here. */
5916 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5917 lists, we may look types up in these lists and use them while
5918 optimizing the function body. Thus we need to free lang data
5919 in them. */
5926 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5930 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5931 do not and want not to reach unused variants this way. */
5933 {
5935 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5936 So push that instead. */
5940 }
5944 {
5946 tree tem;
5951 }
5953 {
5954 tree tem;
5955 /* Push all TYPE_FIELDS - there can be interleaving interesting
5956 and non-interesting things. */
5959 {
5963 }
5964 }
5970 }
5972 {
5974 {
5978 {
5982 }
5983 else
5984 {
5987 }
5988 }
5992 }
5999 }
6002 /* Find decls and types in T. */
6004 static void
6006 {
6008 {
6014 }
6015 }
6017 /* Translate all the types in LIST with the corresponding runtime
6018 types. */
6020 static tree
6022 {
6032 {
6037 }
6040 }
6043 /* Find decls and types referenced in EH region R and store them in
6044 FLD->DECLS and FLD->TYPES. */
6046 static void
6048 {
6050 {
6055 {
6056 eh_catch c;
6058 /* The types referenced in each catch must first be changed to the
6059 EH types used at runtime. This removes references to FE types
6060 in the region. */
6062 {
6065 }
6066 }
6079 }
6080 }
6083 /* Find decls and types referenced in cgraph node N and store them in
6084 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6085 look for *every* kind of DECL and TYPE node reachable from N,
6086 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6087 NAMESPACE_DECLs, etc). */
6089 static void
6091 {
6092 basic_block bb;
6095 tree t;
6106 /* Traverse locals. */
6110 /* Traverse EH regions in FN. */
6111 {
6112 eh_region r;
6115 }
6117 /* Traverse every statement in FN. */
6119 {
6120 gphi_iterator psi;
6121 gimple_stmt_iterator si;
6125 {
6129 {
6132 }
6133 }
6136 {
6143 {
6146 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6147 which we need for asm stmts. */
6153 }
6154 }
6155 }
6156 }
6159 /* Find decls and types referenced in varpool node N and store them in
6160 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6161 look for *every* kind of DECL and TYPE node reachable from N,
6162 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6163 NAMESPACE_DECLs, etc). */
6165 static void
6167 {
6169 }
6171 /* If T needs an assembler name, have one created for it. */
6173 void
6175 {
6177 {
6178 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6179 diagnostics that use input_location to show locus
6180 information. The problem here is that, at this point,
6181 input_location is generally anchored to the end of the file
6182 (since the parser is long gone), so we don't have a good
6183 position to pin it to.
6185 To alleviate this problem, this uses the location of T's
6186 declaration. Examples of this are
6187 testsuite/g++.dg/template/cond2.C and
6188 testsuite/g++.dg/template/pr35240.C. */
6195 }
6196 }
6199 /* Free language specific information for every operand and expression
6200 in every node of the call graph. This process operates in three stages:
6202 1- Every callgraph node and varpool node is traversed looking for
6203 decls and types embedded in them. This is a more exhaustive
6204 search than that done by find_referenced_vars, because it will
6205 also collect individual fields, decls embedded in types, etc.
6207 2- All the decls found are sent to free_lang_data_in_decl.
6209 3- All the types found are sent to free_lang_data_in_type.
6211 The ordering between decls and types is important because
6212 free_lang_data_in_decl sets assembler names, which includes
6213 mangling. So types cannot be freed up until assembler names have
6214 been set up. */
6216 static void
6218 {
6221 tree t;
6225 /* Find decls and types in the body of every function in the callgraph. */
6232 /* Find decls and types in every varpool symbol. */
6236 /* Set the assembler name on every decl found. We need to do this
6237 now because free_lang_data_in_decl will invalidate data needed
6238 for mangling. This breaks mangling on interdependent decls. */
6242 /* Traverse every decl found freeing its language data. */
6246 /* Traverse every type found freeing its language data. */
6249 }
6252 /* Free resources that are used by FE but are not needed once they are done. */
6254 static unsigned
6256 {
6260 /* If we are the LTO frontend we have freed lang-specific data already. */
6263 {
6264 /* Rebuild type inheritance graph even when not doing LTO to get
6265 consistent profile data. */
6268 }
6273 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6277 /* Allocate and assign alias sets to the standard integer types
6278 while the slots are still in the way the frontends generated them. */
6283 /* Traverse the IL resetting language specific information for
6284 operands, expressions, etc. */
6287 /* Create gimple variants for common types. */
6293 /* Reset some langhooks. Do not reset types_compatible_p, it may
6294 still be used indirectly via the get_alias_set langhook. */
6307 {
6309 tree t;
6313 }
6315 /* We do not want the default decl_assembler_name implementation,
6316 rather if we have fixed everything we want a wrapper around it
6317 asserting that all non-local symbols already got their assembler
6318 name and only produce assembler names for local symbols. Or rather
6319 make sure we never call decl_assembler_name on local symbols and
6320 devise a separate, middle-end private scheme for it. */
6322 /* Reset diagnostic machinery. */
6331 }
6337 {
6347 };
6350 {
6354 {}
6356 /* opt_pass methods: */
6363 simple_ipa_opt_pass *
6365 {
6367 }
6368 \f
6369 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6370 of the various TYPE_QUAL values. */
6372 static void
6374 {
6380 }
6382 /* Returns true iff CAND and BASE have equivalent language-specific
6383 qualifiers. */
6385 bool
6387 {
6390 /* type_hash_eq currently only applies to these types. */
6395 }
6397 /* This function checks to see if TYPE matches the size one of the built-in
6398 atomic types, and returns that core atomic type. */
6400 static tree
6402 {
6403 tree base_atomic_type;
6405 /* Only handle complete types. */
6410 {
6433 }
6436 }
6438 /* Returns true iff unqualified CAND and BASE are equivalent. */
6440 bool
6442 {
6444 /* Apparently this is needed for Objective-C. */
6449 /* Check alignment. */
6452 /* Atomic types increase minimal alignment. We must to do so as well
6453 or we get duplicated canonical types. See PR88686. */
6455 {
6456 /* See if this object can map to a basic atomic type. */
6460 }
6462 }
6464 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6466 bool
6468 {
6472 }
6474 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6476 static bool
6478 {
6481 /* Apparently this is needed for Objective-C. */
6483 /* Check alignment. */
6488 }
6490 /* Return a version of the TYPE, qualified as indicated by the
6491 TYPE_QUALS, if one exists. If no qualified version exists yet,
6492 return NULL_TREE. */
6494 tree
6496 {
6504 /* Search the chain of variants to see if there is already one there just
6505 like the one we need to have. If so, use that existing one. We must
6506 preserve the TYPE_NAME, since there is code that depends on this. */
6509 {
6510 /* Put the found variant at the head of the variant list so
6511 frequently searched variants get found faster. The C++ FE
6512 benefits greatly from this. */
6518 }
6521 }
6523 /* Like get_qualified_type, but creates the type if it does not
6524 exist. This function never returns NULL_TREE. */
6526 tree
6528 {
6529 tree t;
6531 /* See if we already have the appropriate qualified variant. */
6534 /* If not, build it. */
6536 {
6541 {
6542 /* See if this object can map to a basic atomic type. */
6545 {
6546 /* Ensure the alignment of this type is compatible with
6547 the required alignment of the atomic type. */
6550 }
6551 }
6554 /* Propagate structural equality. */
6557 /* Build the underlying canonical type, since it is different
6558 from TYPE. */
6559 {
6562 }
6563 else
6564 /* T is its own canonical type. */
6567 }
6570 }
6572 /* Create a variant of type T with alignment ALIGN. */
6574 tree
6576 {
6577 tree t;
6592 }
6594 /* Create a new distinct copy of TYPE. The new type is made its own
6595 MAIN_VARIANT. If TYPE requires structural equality checks, the
6596 resulting type requires structural equality checks; otherwise, its
6597 TYPE_CANONICAL points to itself. */
6599 tree
6601 {
6607 /* Set the canonical type either to a new equivalence class, or
6608 propagate the need for structural equality checks. */
6611 else
6614 /* Make it its own variant. */
6618 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6619 whose TREE_TYPE is not t. This can also happen in the Ada
6620 frontend when using subtypes. */
6623 }
6625 /* Create a new variant of TYPE, equivalent but distinct. This is so
6626 the caller can modify it. TYPE_CANONICAL for the return type will
6627 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6628 are considered equal by the language itself (or that both types
6629 require structural equality checks). */
6631 tree
6633 {
6638 /* Since we're building a variant, assume that it is a non-semantic
6639 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6641 /* Type variants have no alias set defined. */
6644 /* Add the new type to the chain of variants of TYPE. */
6650 }
6651 \f
6652 /* Return true if the from tree in both tree maps are equal. */
6654 int
6656 {
6660 }
6662 /* Hash a from tree in a tree_base_map. */
6664 unsigned int
6666 {
6668 }
6670 /* Return true if this tree map structure is marked for garbage collection
6671 purposes. We simply return true if the from tree is marked, so that this
6672 structure goes away when the from tree goes away. */
6674 int
6676 {
6678 }
6680 /* Hash a from tree in a tree_map. */
6682 unsigned int
6684 {
6686 }
6688 /* Hash a from tree in a tree_decl_map. */
6690 unsigned int
6692 {
6694 }
6696 /* Return the initialization priority for DECL. */
6698 priority_type
6700 {
6705 return
6707 }
6709 /* Return the finalization priority for DECL. */
6711 priority_type
6713 {
6718 return
6720 }
6722 /* Set the initialization priority for DECL to PRIORITY. */
6724 void
6726 {
6730 {
6734 }
6737 else
6740 }
6742 /* Set the finalization priority for DECL to PRIORITY. */
6744 void
6746 {
6750 {
6754 }
6755 else
6758 }
6760 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6762 static void
6764 {
6769 }
6771 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6773 static void
6775 {
6780 }
6782 /* Lookup a debug expression for FROM, and return it if we find one. */
6784 tree
6786 {
6794 }
6796 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6798 void
6800 {
6807 }
6809 /* Lookup a value expression for FROM, and return it if we find one. */
6811 tree
6813 {
6821 }
6823 /* Insert a mapping FROM->TO in the value expression hashtable. */
6825 void
6827 {
6834 }
6836 /* Lookup a vector of debug arguments for FROM, and return it if we
6837 find one. */
6841 {
6852 }
6854 /* Insert a mapping FROM->empty vector of debug arguments in the value
6855 expression hashtable. */
6859 {
6874 }
6876 /* Hashing of types so that we don't make duplicates.
6877 The entry point is `type_hash_canon'. */
6879 /* Generate the default hash code for TYPE. This is designed for
6880 speed, rather than maximum entropy. */
6882 hashval_t
6884 {
6893 /* Just the identifier is adequate to distinguish. */
6897 {
6900 /* FALLTHROUGH. */
6912 {
6916 {
6919 }
6920 }
6924 {
6931 }
6935 {
6939 }
6947 }
6950 }
6952 /* These are the Hashtable callback functions. */
6954 /* Returns true iff the types are equivalent. */
6956 bool
6958 {
6959 /* First test the things that are the same for all types. */
6969 /* Be careful about comparing arrays before and after the element type
6970 has been completed; don't compare TYPE_ALIGN unless both types are
6971 complete. */
6978 {
7000 /* fall through */
7032 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7033 where the flag should be inherited from the element type
7034 and can change after ARRAY_TYPEs are created; on non-aggregates
7035 compare it and hash it, scalars will never have that flag set
7036 and we need to differentiate between arrays created by different
7037 front-ends or middle-end created arrays. */
7067 }
7073 }
7075 /* Given TYPE, and HASHCODE its hash code, return the canonical
7076 object for an identical type if one already exists.
7077 Otherwise, return TYPE, and record it as the canonical object.
7079 To use this function, first create a type of the sort you want.
7080 Then compute its hash code from the fields of the type that
7081 make it different from other similar types.
7082 Then call this function and use the value. */
7084 tree
7086 {
7087 type_hash in;
7090 /* The hash table only contains main variants, so ensure that's what we're
7091 being passed. */
7094 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7095 must call that routine before comparing TYPE_ALIGNs. */
7103 {
7109 /* Free also min/max values and the cache for integer
7110 types. This can't be done in free_node, as LTO frees
7111 those on its own. */
7113 {
7116 {
7117 /* Zero is always in TYPE_CACHED_VALUES. */
7121 }
7124 {
7127 }
7130 }
7133 }
7134 else
7135 {
7144 }
7145 }
7147 static void
7149 {
7154 }
7156 /* Given two lists of types
7157 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7158 return 1 if the lists contain the same types in the same order.
7159 Also, the TREE_PURPOSEs must match. */
7161 bool
7163 {
7175 }
7177 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7178 given by TYPE. If the argument list accepts variable arguments,
7179 then this function counts only the ordinary arguments. */
7181 int
7183 {
7187 /* If the function does not take a variable number of arguments,
7188 the last element in the list will have type `void'. */
7191 else
7195 }
7197 /* Return the type of the function TYPE's argument ARGNO if known.
7198 For vararg function's where ARGNO refers to one of the variadic
7199 arguments return null. Otherwise, return a void_type_node for
7200 out-of-bounds ARGNO. */
7202 tree
7204 {
7205 /* Treat zero the same as an out-of-bounds argument number. */
7209 function_args_iterator iter;
7211 tree argtype;
7214 {
7215 /* A vararg function's argument list ends in a null. Otherwise,
7216 an ordinary function's argument list ends with void. Return
7217 null if ARGNO refers to a vararg argument, void_type_node if
7218 it's out of bounds, and the formal argument type otherwise. */
7226 }
7229 }
7231 /* Nonzero if integer constants T1 and T2
7232 represent the same constant value. */
7234 int
7236 {
7252 }
7254 /* Return true if T is an INTEGER_CST whose numerical value (extended
7255 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7257 bool
7259 {
7263 }
7265 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7266 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7268 bool
7270 {
7274 {
7279 }
7282 }
7284 /* Return true if T is an INTEGER_CST whose numerical value (extended
7285 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7287 bool
7289 {
7293 }
7295 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7296 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7298 bool
7300 {
7304 {
7309 }
7312 }
7314 /* T is an INTEGER_CST whose numerical value (extended according to
7315 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7316 HOST_WIDE_INT. */
7318 HOST_WIDE_INT
7320 {
7323 }
7325 /* T is an INTEGER_CST whose numerical value (extended according to
7326 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7327 HOST_WIDE_INT. */
7329 unsigned HOST_WIDE_INT
7331 {
7334 }
7336 /* Return the most significant (sign) bit of T. */
7338 int
7340 {
7344 }
7346 /* Return an indication of the sign of the integer constant T.
7347 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7348 Note that -1 will never be returned if T's type is unsigned. */
7350 int
7352 {
7359 else
7361 }
7363 /* Return the minimum number of bits needed to represent VALUE in a
7364 signed or unsigned type, UNSIGNEDP says which. */
7366 unsigned int
7368 {
7369 /* If the value is negative, compute its negative minus 1. The latter
7370 adjustment is because the absolute value of the largest negative value
7371 is one larger than the largest positive value. This is equivalent to
7372 a bit-wise negation, so use that operation instead. */
7377 /* Return the number of bits needed, taking into account the fact
7378 that we need one more bit for a signed than unsigned type.
7379 If value is 0 or -1, the minimum precision is 1 no matter
7380 whether unsignedp is true or false. */
7384 else
7386 }
7388 /* Return truthvalue of whether T1 is the same tree structure as T2.
7389 Return 1 if they are the same.
7390 Return 0 if they are understandably different.
7391 Return -1 if either contains tree structure not understood by
7392 this function. */
7394 int
7396 {
7406 /* For location wrappers to be the same, they must be at the same
7407 source location (and wrap the same thing). */
7409 {
7413 }
7419 {
7423 else
7425 }
7435 {
7451 {
7460 /* ??? Should we handle also fields here? */
7464 }
7475 {
7483 {
7487 }
7489 }
7492 /* Special case: if either target is an unallocated VAR_DECL,
7493 it means that it's going to be unified with whatever the
7494 TARGET_EXPR is really supposed to initialize, so treat it
7495 as being equivalent to anything. */
7503 else
7532 /* A false return means maybe_ne rather than known_ne. */
7538 }
7540 /* This general rule works for most tree codes. All exceptions should be
7541 handled above. If this is a language-specific tree code, we can't
7542 trust what might be in the operand, so say we don't know
7543 the situation. */
7548 {
7557 {
7561 }
7567 }
7568 }
7570 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7571 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7572 than U, respectively. */
7574 int
7576 {
7585 else
7587 }
7589 /* Return true if SIZE represents a constant size that is in bounds of
7590 what the middle-end and the backend accepts (covering not more than
7591 half of the address-space).
7592 When PERR is non-null, set *PERR on failure to the description of
7593 why SIZE is not valid. */
7595 bool
7597 {
7599 {
7606 }
7608 cst_size_error error;
7613 {
7616 }
7619 {
7622 }
7625 {
7628 }
7632 {
7635 }
7638 }
7640 /* Return the precision of the type, or for a complex or vector type the
7641 precision of the type of its elements. */
7643 unsigned int
7645 {
7653 }
7655 /* Return true if CODE represents an associative tree code. Otherwise
7656 return false. */
7657 bool
7659 {
7661 {
7673 }
7675 }
7677 /* Return true if CODE represents a commutative tree code. Otherwise
7678 return false. */
7679 bool
7681 {
7683 {
7710 }
7712 }
7714 /* Return true if CODE represents a ternary tree code for which the
7715 first two operands are commutative. Otherwise return false. */
7716 bool
7718 {
7720 {
7728 }
7730 }
7732 /* Returns true if CODE can overflow. */
7734 bool
7736 {
7738 {
7743 /* Can overflow in various ways. */
7749 /* For INT_MIN / -1. */
7753 /* For -INT_MIN. */
7756 /* These operators cannot overflow. */
7758 }
7759 }
7761 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7762 ftrapv doesn't generate trapping insns for CODE. */
7764 bool
7766 {
7769 /* We don't generate instructions that trap on overflow for complex or vector
7770 types. */
7778 {
7784 /* These operators can overflow, and -ftrapv generates trapping code for
7785 these. */
7792 /* These operators can overflow, but -ftrapv does not generate trapping
7793 code for these. */
7796 /* These operators cannot overflow. */
7798 }
7799 }
7801 /* Constructors for pointer, array and function types.
7802 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7803 constructed by language-dependent code, not here.) */
7805 /* Construct, lay out and return the type of pointers to TO_TYPE with
7806 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7807 reference all of memory. If such a type has already been
7808 constructed, reuse it. */
7810 tree
7813 {
7814 tree t;
7820 /* If the pointed-to type has the may_alias attribute set, force
7821 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7825 /* In some cases, languages will have things that aren't a POINTER_TYPE
7826 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7827 In that case, return that type without regard to the rest of our
7828 operands.
7830 ??? This is a kludge, but consistent with the way this function has
7831 always operated and there doesn't seem to be a good way to avoid this
7832 at the moment. */
7837 /* First, if we already have a type for pointers to TO_TYPE and it's
7838 the proper mode, use it. */
7851 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7859 /* Lay out the type. This function has many callers that are concerned
7860 with expression-construction, and this simplifies them all. */
7864 }
7866 /* By default build pointers in ptr_mode. */
7868 tree
7870 {
7875 }
7877 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7879 tree
7882 {
7883 tree t;
7889 /* If the pointed-to type has the may_alias attribute set, force
7890 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7894 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7895 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7896 In that case, return that type without regard to the rest of our
7897 operands.
7899 ??? This is a kludge, but consistent with the way this function has
7900 always operated and there doesn't seem to be a good way to avoid this
7901 at the moment. */
7906 /* First, if we already have a type for pointers to TO_TYPE and it's
7907 the proper mode, use it. */
7920 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7931 }
7934 /* Build the node for the type of references-to-TO_TYPE by default
7935 in ptr_mode. */
7937 tree
7939 {
7944 }
7946 #define MAX_INT_CACHED_PREC \
7947 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7950 /* Builds a signed or unsigned integer type of precision PRECISION.
7951 Used for C bitfields whose precision does not match that of
7952 built-in target types. */
7953 tree
7956 {
7963 {
7967 }
7974 else
7984 }
7986 #define MAX_BOOL_CACHED_PREC \
7987 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7990 /* Builds a boolean type of precision PRECISION.
7991 Used for boolean vectors to choose proper vector element size. */
7992 tree
7994 {
7995 tree type;
7998 {
8002 }
8012 }
8014 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8015 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8016 is true, reuse such a type that has already been constructed. */
8018 static tree
8020 {
8043 {
8044 /* Since we cannot reliably merge this type, we need to compare it using
8045 structural equality checks. */
8048 }
8054 }
8056 /* Wrapper around build_range_type_1 with SHARED set to true. */
8058 tree
8060 {
8062 }
8064 /* Wrapper around build_range_type_1 with SHARED set to false. */
8066 tree
8068 {
8070 }
8072 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8073 MAXVAL should be the maximum value in the domain
8074 (one less than the length of the array).
8076 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8077 We don't enforce this limit, that is up to caller (e.g. language front end).
8078 The limit exists because the result is a signed type and we don't handle
8079 sizes that use more than one HOST_WIDE_INT. */
8081 tree
8083 {
8085 }
8087 /* Return true if the debug information for TYPE, a subtype, should be emitted
8088 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8089 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8090 debug info and doesn't reflect the source code. */
8092 bool
8094 {
8097 /* Subrange types have a base type which is an integral type. */
8101 /* Get the real bounds of the subtype. */
8104 else
8105 {
8108 }
8110 /* If the type and its base type have the same representation and the same
8111 name, then the type is not a subrange but a copy of the base type. */
8125 }
8127 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8128 and number of elements specified by the range of values of INDEX_TYPE.
8129 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8130 If SHARED is true, reuse such a type that has already been constructed.
8131 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8133 static tree
8136 {
8137 tree t;
8140 {
8143 }
8153 {
8156 }
8159 {
8168 index_type
8171 }
8174 }
8176 /* Wrapper around build_array_type_1 with SHARED set to true. */
8178 tree
8180 {
8181 return
8183 }
8185 /* Wrapper around build_array_type_1 with SHARED set to false. */
8187 tree
8189 {
8191 }
8193 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8194 sizetype. */
8196 tree
8198 {
8200 }
8202 /* Recursively examines the array elements of TYPE, until a non-array
8203 element type is found. */
8205 tree
8207 {
8212 }
8214 /* Computes the canonical argument types from the argument type list
8215 ARGTYPES.
8217 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8218 on entry to this function, or if any of the ARGTYPES are
8219 structural.
8221 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8222 true on entry to this function, or if any of the ARGTYPES are
8223 non-canonical.
8225 Returns a canonical argument list, which may be ARGTYPES when the
8226 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8227 true) or would not differ from ARGTYPES. */
8229 static tree
8233 {
8234 tree arg;
8238 {
8240 /* Fail gracefully by stating that the type is structural. */
8246 /* If the argument has a default argument, we consider it
8247 non-canonical even though the type itself is canonical.
8248 That way, different variants of function and method types
8249 with default arguments will all point to the variant with
8250 no defaults as their canonical type. */
8252 }
8258 {
8259 /* Build the canonical list of argument types. */
8264 {
8267 else
8270 canon_argtypes);
8271 }
8277 /* There is a non-canonical type. */
8280 }
8282 /* The canonical argument types are the same as ARGTYPES. */
8284 }
8286 /* Construct, lay out and return
8287 the type of functions returning type VALUE_TYPE
8288 given arguments of types ARG_TYPES.
8289 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8290 are data type nodes for the arguments of the function.
8291 If such a type has already been constructed, reuse it. */
8293 tree
8295 {
8296 tree t;
8299 tree canon_argtypes;
8304 {
8307 }
8309 /* Make a node of the sort we want. */
8314 /* If we already have such a type, use the old one. */
8318 /* Set up the canonical type. */
8328 canon_argtypes);
8333 }
8335 /* Build a function type. The RETURN_TYPE is the type returned by the
8336 function. If VAARGS is set, no void_type_node is appended to the
8337 list. ARGP must be always be terminated be a NULL_TREE. */
8339 static tree
8341 {
8349 {
8354 }
8357 else
8358 {
8362 }
8366 }
8368 /* Build a function type. The RETURN_TYPE is the type returned by the
8369 function. If additional arguments are provided, they are
8370 additional argument types. The list of argument types must always
8371 be terminated by NULL_TREE. */
8373 tree
8375 {
8376 tree args;
8383 }
8385 /* Build a variable argument function type. The RETURN_TYPE is the
8386 type returned by the function. If additional arguments are provided,
8387 they are additional argument types. The list of argument types must
8388 always be terminated by NULL_TREE. */
8390 tree
8392 {
8393 tree args;
8401 }
8403 /* Build a function type. RETURN_TYPE is the type returned by the
8404 function; VAARGS indicates whether the function takes varargs. The
8405 function takes N named arguments, the types of which are provided in
8406 ARG_TYPES. */
8408 static tree
8411 {
8419 }
8421 /* Build a function type. RETURN_TYPE is the type returned by the
8422 function. The function takes N named arguments, the types of which
8423 are provided in ARG_TYPES. */
8425 tree
8427 {
8429 }
8431 /* Build a variable argument function type. RETURN_TYPE is the type
8432 returned by the function. The function takes N named arguments, the
8433 types of which are provided in ARG_TYPES. */
8435 tree
8437 {
8439 }
8441 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8442 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8443 for the method. An implicit additional parameter (of type
8444 pointer-to-BASETYPE) is added to the ARGTYPES. */
8446 tree
8448 tree rettype,
8449 tree argtypes)
8450 {
8451 tree t;
8452 tree ptype;
8454 tree canon_argtypes;
8456 /* Make a node of the sort we want. */
8463 /* The actual arglist for this function includes a "hidden" argument
8464 which is "this". Put it into the list of argument types. */
8468 /* If we already have such a type, use the old one. */
8472 /* Set up the canonical type. */
8473 any_structural_p
8476 any_noncanonical_p
8488 canon_argtypes);
8493 }
8495 /* Construct, lay out and return the type of methods belonging to class
8496 BASETYPE and whose arguments and values are described by TYPE.
8497 If that type exists already, reuse it.
8498 TYPE must be a FUNCTION_TYPE node. */
8500 tree
8502 {
8508 }
8510 /* Construct, lay out and return the type of offsets to a value
8511 of type TYPE, within an object of type BASETYPE.
8512 If a suitable offset type exists already, reuse it. */
8514 tree
8516 {
8517 tree t;
8519 /* Make a node of the sort we want. */
8525 /* If we already have such a type, use the old one. */
8533 {
8542 }
8545 }
8547 /* Create a complex type whose components are COMPONENT_TYPE.
8549 If NAMED is true, the type is given a TYPE_NAME. We do not always
8550 do so because this creates a DECL node and thus make the DECL_UIDs
8551 dependent on the type canonicalization hashtable, which is GC-ed,
8552 so the DECL_UIDs would not be stable wrt garbage collection. */
8554 tree
8556 {
8561 /* Make a node of the sort we want. */
8566 /* If we already have such a type, use the old one. */
8571 {
8572 /* We created a new type. The hash insertion will have laid
8573 out the type. We need to check the canonicalization and
8574 maybe set the name. */
8585 /* We need to create a name, since complex is a fundamental type. */
8587 {
8616 }
8617 }
8620 }
8622 /* If TYPE is a real or complex floating-point type and the target
8623 does not directly support arithmetic on TYPE then return the wider
8624 type to be used for arithmetic on TYPE. Otherwise, return
8625 NULL_TREE. */
8627 tree
8629 {
8630 /* The target can give two different responses to the question of
8631 which excess precision mode it would like depending on whether we
8632 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8634 enum excess_precision_type requested_type
8636 ? EXCESS_PRECISION_TYPE_FAST
8639 enum flt_eval_method target_flt_eval_method
8642 /* The target should not ask for unpredictable float evaluation (though
8643 it might advertise that implicitly the evaluation is unpredictable,
8644 but we don't care about that here, it will have been reported
8645 elsewhere). If it does ask for unpredictable evaluation, we have
8646 nothing to do here. */
8649 /* Nothing to do. The target has asked for all types we know about
8650 to be computed with their native precision and range. */
8654 /* The target will promote this type in a target-dependent way, so excess
8655 precision ought to leave it alone. */
8659 machine_mode float16_type_mode = (float16_type_node
8666 {
8668 {
8671 {
8689 }
8691 }
8693 {
8698 {
8716 }
8718 }
8721 }
8724 }
8725 \f
8726 /* Return OP, stripped of any conversions to wider types as much as is safe.
8727 Converting the value back to OP's type makes a value equivalent to OP.
8729 If FOR_TYPE is nonzero, we return a value which, if converted to
8730 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8732 OP must have integer, real or enumeral type. Pointers are not allowed!
8734 There are some cases where the obvious value we could return
8735 would regenerate to OP if converted to OP's type,
8736 but would not extend like OP to wider types.
8737 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8738 For example, if OP is (unsigned short)(signed char)-1,
8739 we avoid returning (signed char)-1 if FOR_TYPE is int,
8740 even though extending that to an unsigned short would regenerate OP,
8741 since the result of extending (signed char)-1 to (int)
8742 is different from (int) OP. */
8744 tree
8746 {
8747 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8749 unsigned final_prec
8751 int uns
8758 {
8761 /* TYPE_PRECISION on vector types has different meaning
8762 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8763 so avoid them here. */
8770 /* Truncations are many-one so cannot be removed.
8771 Unless we are later going to truncate down even farther. */
8776 /* See what's inside this conversion. If we decide to strip it,
8777 we will set WIN. */
8780 /* If we have not stripped any zero-extensions (uns is 0),
8781 we can strip any kind of extension.
8782 If we have previously stripped a zero-extension,
8783 only zero-extensions can safely be stripped.
8784 Any extension can be stripped if the bits it would produce
8785 are all going to be discarded later by truncating to FOR_TYPE. */
8788 {
8791 /* TYPE_UNSIGNED says whether this is a zero-extension.
8792 Let's avoid computing it if it does not affect WIN
8793 and if UNS will not be needed again. */
8797 {
8800 }
8801 }
8802 }
8804 /* If we finally reach a constant see if it fits in sth smaller and
8805 in that case convert it. */
8807 {
8813 {
8817 }
8818 }
8821 }
8822 \f
8823 /* Return OP or a simpler expression for a narrower value
8824 which can be sign-extended or zero-extended to give back OP.
8825 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8826 or 0 if the value should be sign-extended. */
8828 tree
8830 {
8837 {
8838 do
8852 ret);
8854 }
8856 {
8857 int bitschange
8861 /* Truncations are many-one so cannot be removed. */
8865 /* See what's inside this conversion. If we decide to strip it,
8866 we will set WIN. */
8869 {
8871 /* An extension: the outermost one can be stripped,
8872 but remember whether it is zero or sign extension. */
8875 /* Otherwise, if a sign extension has been stripped,
8876 only sign extensions can now be stripped;
8877 if a zero extension has been stripped, only zero-extensions. */
8881 }
8883 {
8884 /* A change in nominal type can always be stripped, but we must
8885 preserve the unsignedness. */
8890 /* Keep trying to narrow, but don't assign op to win if it
8891 would turn an integral type into something else. */
8894 }
8897 }
8900 /* Since type_for_size always gives an integer type. */
8903 /* Ensure field is laid out already. */
8906 {
8907 unsigned HOST_WIDE_INT innerprec
8913 /* We can get this structure field in a narrower type that fits it,
8914 but the resulting extension to its nominal type (a fullword type)
8915 must satisfy the same conditions as for other extensions.
8917 Do this only for fields that are aligned (not bit-fields),
8918 because when bit-field insns will be used there is no
8919 advantage in doing this. */
8925 {
8929 }
8930 }
8934 }
8935 \f
8936 /* Return true if integer constant C has a value that is permissible
8937 for TYPE, an integral type. */
8939 bool
8941 {
8946 /* Non-standard boolean types can have arbitrary precision but various
8947 transformations assume that they can only take values 0 and +/-1. */
8951 retry:
8955 /* If at least one bound of the type is a constant integer, we can check
8956 ourselves and maybe make a decision. If no such decision is possible, but
8957 this type is a subtype, try checking against that. Otherwise, use
8958 fits_to_tree_p, which checks against the precision.
8960 Compute the status for each possibly constant bound, and return if we see
8961 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8962 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8963 for "constant known to fit". */
8965 /* Check if c >= type_low_bound. */
8967 {
8971 }
8972 else
8975 /* Check if c <= type_high_bound. */
8977 {
8981 }
8982 else
8985 /* If the constant fits both bounds, the result is known. */
8989 /* Perform some generic filtering which may allow making a decision
8990 even if the bounds are not constant. First, negative integers
8991 never fit in unsigned types, */
8995 /* Second, narrower types always fit in wider ones. */
8999 /* Third, unsigned integers with top bit set never fit signed types. */
9001 {
9004 {
9005 /* When a tree_cst is converted to a wide-int, the precision
9006 is taken from the type. However, if the precision of the
9007 mode underneath the type is smaller than that, it is
9008 possible that the value will not fit. The test below
9009 fails if any bit is set between the sign bit of the
9010 underlying mode and the top bit of the type. */
9013 }
9016 }
9018 /* If we haven't been able to decide at this point, there nothing more we
9019 can check ourselves here. Look at the base type if we have one and it
9020 has the same precision. */
9024 {
9027 }
9029 /* Or to fits_to_tree_p, if nothing else. */
9031 }
9033 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9034 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9035 represented (assuming two's-complement arithmetic) within the bit
9036 precision of the type are returned instead. */
9038 void
9040 {
9044 else
9045 {
9048 else
9049 {
9052 }
9053 }
9058 else
9059 {
9062 }
9063 }
9065 /* Return true if VAR is an automatic variable. */
9067 bool
9069 {
9074 }
9076 /* Return true if VAR is an automatic variable defined in function FN. */
9078 bool
9080 {
9084 }
9086 /* Subprogram of following function. Called by walk_tree.
9088 Return *TP if it is an automatic variable or parameter of the
9089 function passed in as DATA. */
9091 static tree
9093 {
9104 }
9106 /* Returns true if T is, contains, or refers to a type with variable
9107 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9108 arguments, but not the return type. If FN is nonzero, only return
9109 true if a modifier of the type or position of FN is a variable or
9110 parameter inside FN.
9112 This concept is more general than that of C99 'variably modified types':
9113 in C99, a struct type is never variably modified because a VLA may not
9114 appear as a structure member. However, in GNU C code like:
9116 struct S { int i[f()]; };
9118 is valid, and other languages may define similar constructs. */
9120 bool
9122 {
9123 tree t;
9125 /* Test if T is either variable (if FN is zero) or an expression containing
9126 a variable in FN. If TYPE isn't gimplified, return true also if
9127 gimplify_one_sizepos would gimplify the expression into a local
9128 variable. */
9129 #define RETURN_TRUE_IF_VAR(T) \
9130 do { tree _t = (T); \
9131 if (_t != NULL_TREE \
9132 && _t != error_mark_node \
9133 && !CONSTANT_CLASS_P (_t) \
9134 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9135 && (!fn \
9136 || (!TYPE_SIZES_GIMPLIFIED (type) \
9137 && (TREE_CODE (_t) != VAR_DECL \
9138 && !CONTAINS_PLACEHOLDER_P (_t))) \
9139 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9140 return true; } while (0)
9145 /* If TYPE itself has variable size, it is variably modified. */
9150 {
9154 /* Ada can have pointer types refering to themselves indirectly. */
9159 {
9162 }
9168 /* If TYPE is a function type, it is variably modified if the
9169 return type is variably modified. */
9179 /* Scalar types are variably modified if their end points
9180 aren't constant. */
9188 /* We can't see if any of the fields are variably-modified by the
9189 definition we normally use, since that would produce infinite
9190 recursion via pointers. */
9191 /* This is variably modified if some field's type is. */
9194 {
9199 /* If the type is a qualified union, then the DECL_QUALIFIER
9200 of fields can also be an expression containing a variable. */
9204 /* If the field is a qualified union, then it's only a container
9205 for what's inside so we look into it. That's necessary in LTO
9206 mode because the sizes of the field tested above have been set
9207 to PLACEHOLDER_EXPRs by free_lang_data. */
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. */
10335 /* Decimal float types. */
10337 {
10352 }
10361 {
10365 }
10367 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10368 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10369 sat_ ## KIND ## _type_node = \
10370 make_sat_signed_ ## KIND ## _type (SIZE); \
10371 sat_unsigned_ ## KIND ## _type_node = \
10372 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10373 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10374 unsigned_ ## KIND ## _type_node = \
10375 make_unsigned_ ## KIND ## _type (SIZE);
10377 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10378 sat_ ## WIDTH ## KIND ## _type_node = \
10379 make_sat_signed_ ## KIND ## _type (SIZE); \
10380 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10381 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10382 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10383 unsigned_ ## WIDTH ## KIND ## _type_node = \
10384 make_unsigned_ ## KIND ## _type (SIZE);
10386 /* Make fixed-point type nodes based on four different widths. */
10387 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10388 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10389 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10390 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10391 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10393 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10394 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10395 NAME ## _type_node = \
10396 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10397 u ## NAME ## _type_node = \
10398 make_or_reuse_unsigned_ ## KIND ## _type \
10399 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10400 sat_ ## NAME ## _type_node = \
10401 make_or_reuse_sat_signed_ ## KIND ## _type \
10402 (GET_MODE_BITSIZE (MODE ## mode)); \
10403 sat_u ## NAME ## _type_node = \
10404 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10405 (GET_MODE_BITSIZE (U ## MODE ## mode));
10407 /* Fixed-point type and mode nodes. */
10420 {
10423 /* Many back-ends define record types without setting TYPE_NAME.
10424 If we copied the record type here, we'd keep the original
10425 record type without a name. This breaks name mangling. So,
10426 don't copy record types and let c_common_nodes_and_builtins()
10427 declare the type to be __builtin_va_list. */
10432 }
10434 /* SCEV analyzer global shared trees. */
10439 }
10441 /* Modify DECL for given flags.
10442 TM_PURE attribute is set only on types, so the function will modify
10443 DECL's type when ECF_TM_PURE is used. */
10445 void
10447 {
10477 /* Looping const or pure is implied by noreturn.
10478 There is currently no way to declare looping const or looping pure alone. */
10481 }
10484 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10486 static void
10489 {
10490 tree decl;
10497 }
10499 /* Call this function after instantiating all builtins that the language
10500 front end cares about. This will build the rest of the builtins
10501 and internal functions that are relied upon by the tree optimizers and
10502 the middle-end. */
10504 void
10506 {
10512 {
10516 BUILT_IN_UNREACHABLE,
10524 }
10528 {
10539 }
10542 {
10545 NULL_TREE);
10548 }
10551 {
10557 }
10559 /* If we're checking the stack, `alloca' can throw. */
10560 const int alloca_flags
10564 {
10569 }
10574 BUILT_IN_ALLOCA_WITH_ALIGN,
10576 alloca_flags);
10581 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10583 alloca_flags);
10589 BUILT_IN_INIT_TRAMPOLINE,
10592 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10596 BUILT_IN_INIT_DESCRIPTOR,
10601 BUILT_IN_ADJUST_TRAMPOLINE,
10605 BUILT_IN_ADJUST_DESCRIPTOR,
10612 BUILT_IN_NONLOCAL_GOTO,
10619 BUILT_IN_SETJMP_SETUP,
10624 BUILT_IN_SETJMP_RECEIVER,
10633 BUILT_IN_STACK_RESTORE,
10638 NULL_TREE);
10651 /* If there's a possibility that we might use the ARM EABI, build the
10652 alternate __cxa_end_cleanup node used to resume from C++. */
10654 {
10657 BUILT_IN_CXA_END_CLEANUP,
10659 }
10663 BUILT_IN_UNWIND_RESUME,
10667 ECF_NORETURN);
10670 {
10672 NULL_TREE);
10674 BUILT_IN_RETURN_ADDRESS,
10676 ECF_NOTHROW);
10677 }
10681 {
10686 BUILT_IN_PROFILE_FUNC_ENTER,
10690 BUILT_IN_PROFILE_FUNC_EXIT,
10692 }
10694 /* The exception object and filter values from the runtime. The argument
10695 must be zero before exception lowering, i.e. from the front end. After
10696 exception lowering, it will be the region number for the exception
10697 landing pad. These functions are PURE instead of CONST to prevent
10698 them from being hoisted past the exception edge that will initialize
10699 its value in the landing pad. */
10703 /* Only use TM_PURE if we have TM language support. */
10716 NULL_TREE);
10718 BUILT_IN_EH_COPY_VALUES,
10721 /* Complex multiplication and division. These are handled as builtins
10722 rather than optabs because emit_library_call_value doesn't support
10723 complex. Further, we can do slightly better with folding these
10724 beasties if the real and complex parts of the arguments are separate. */
10725 {
10729 {
10756 /* For -ftrapping-math these should throw from a former
10757 -fnon-call-exception stmt. */
10759 NULL);
10765 NULL);
10769 }
10770 }
10773 }
10775 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10776 better way.
10778 If we requested a pointer to a vector, build up the pointers that
10779 we stripped off while looking for the inner type. Similarly for
10780 return values from functions.
10782 The argument TYPE is the top of the chain, and BOTTOM is the
10783 new type which we will point to. */
10785 tree
10787 {
10791 {
10795 }
10797 {
10801 }
10803 {
10806 }
10808 {
10811 }
10813 {
10815 /* The build_method_type_directly() routine prepends 'this' to argument list,
10816 so we must compensate by getting rid of it. */
10817 outer
10818 = build_method_type_directly
10820 inner,
10822 }
10824 {
10827 }
10828 else
10833 }
10835 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10836 the inner type. */
10837 tree
10839 {
10840 poly_int64 nunits;
10844 {
10856 /* Check that there are no leftover bits. */
10864 }
10867 }
10869 /* Similarly, but takes the inner type and number of units, which must be
10870 a power of two. */
10872 tree
10874 {
10876 }
10878 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10880 tree
10882 {
10890 }
10892 /* Build a vector type that holds one boolean result for each element of
10893 vector type VECTYPE. The public interface for this operation is
10894 truth_type_for. */
10896 static tree
10898 {
10902 machine_mode mask_mode;
10912 }
10914 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10915 set. */
10917 tree
10919 {
10921 tree cand;
10922 /* We always build the non-opaque variant before the opaque one,
10923 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10929 /* Othewise build a variant type and make sure to queue it after
10930 the non-opaque type. */
10938 }
10940 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10942 wide_int
10944 {
10945 /* First handle elements that are directly encoded. */
10950 /* Identify the pattern that contains element I and work out the index of
10951 the last encoded element for that pattern. */
10957 /* If there are no steps, the final encoded value is the right one. */
10961 /* Otherwise work out the value from the last two encoded elements. */
10966 }
10968 /* Return the value of element I of VECTOR_CST T. */
10970 tree
10972 {
10973 /* First handle elements that are directly encoded. */
10978 /* If there are no steps, the final encoded value is the right one. */
10980 {
10981 /* Identify the pattern that contains element I and work out the index of
10982 the last encoded element for that pattern. */
10987 }
10989 /* Otherwise work out the value from the last two encoded elements. */
10992 }
10994 /* Given an initializer INIT, return TRUE if INIT is zero or some
10995 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10996 null, set *NONZERO if and only if INIT is known not to be all
10997 zeros. The combination of return value of false and *NONZERO
10998 false implies that INIT may but need not be all zeros. Other
10999 combinations indicate definitive answers. */
11001 bool
11003 {
11008 /* Conservatively clear NONZERO and set it only if INIT is definitely
11009 not all zero. */
11017 {
11026 /* ??? Note that this is not correct for C4X float formats. There,
11027 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11028 negative exponent. */
11063 {
11068 tree elt;
11075 }
11078 {
11093 }
11094 /* Fall through. */
11097 {
11105 /* We need to loop through all elements to handle cases like
11106 "\0" and "\0foobar". */
11109 {
11112 }
11115 }
11119 }
11120 }
11122 /* Return true if EXPR is an initializer expression in which every element
11123 is a constant that is numerically equal to 0 or 1. The elements do not
11124 need to be equal to each other. */
11126 bool
11128 {
11132 {
11140 {
11147 {
11151 }
11154 }
11158 }
11159 }
11161 /* Check if vector VEC consists of all the equal elements and
11162 that the number of elements corresponds to the type of VEC.
11163 The function returns first element of the vector
11164 or NULL_TREE if the vector is not uniform. */
11165 tree
11167 {
11180 {
11184 }
11188 {
11192 {
11194 {
11197 }
11200 }
11205 }
11208 }
11210 /* If the argument is INTEGER_CST, return it. If the argument is vector
11211 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11212 return NULL_TREE.
11213 Look through location wrappers. */
11215 tree
11217 {
11224 {
11228 }
11231 }
11233 /* If VECTOR_CST T has a single nonzero element, return the index of that
11234 element, otherwise return -1. */
11236 int
11238 {
11244 {
11247 }
11248 else
11253 {
11256 {
11260 }
11261 }
11263 }
11265 /* Build an empty statement at location LOC. */
11267 tree
11269 {
11273 }
11276 /* Build an OpenMP clause with code CODE. LOC is the location of the
11277 clause. */
11279 tree
11281 {
11282 tree t;
11297 }
11299 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11300 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11301 Except for the CODE and operand count field, other storage for the
11302 object is initialized to zeros. */
11304 tree
11306 {
11307 tree t;
11319 /* Can't use TREE_OPERAND to store the length because if checking is
11320 enabled, it will try to check the length before we store it. :-P */
11324 }
11326 /* Helper function for build_call_* functions; build a CALL_EXPR with
11327 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11328 the argument slots. */
11330 static tree
11332 {
11333 tree t;
11341 }
11343 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11344 FN and a null static chain slot. NARGS is the number of call arguments
11345 which are specified as "..." arguments. */
11347 tree
11349 {
11350 tree ret;
11356 }
11358 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11359 FN and a null static chain slot. NARGS is the number of call arguments
11360 which are specified as a va_list ARGS. */
11362 tree
11364 {
11365 tree t;
11373 }
11375 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11376 FN and a null static chain slot. NARGS is the number of call arguments
11377 which are specified as a tree array ARGS. */
11379 tree
11382 {
11383 tree t;
11392 }
11394 /* Like build_call_array, but takes a vec. */
11396 tree
11398 {
11407 }
11409 /* Conveniently construct a function call expression. FNDECL names the
11410 function to be called and N arguments are passed in the array
11411 ARGARRAY. */
11413 tree
11415 {
11420 }
11422 /* Conveniently construct a function call expression. FNDECL names the
11423 function to be called and the arguments are passed in the vector
11424 VEC. */
11426 tree
11428 {
11431 }
11434 /* Conveniently construct a function call expression. FNDECL names the
11435 function to be called, N is the number of arguments, and the "..."
11436 parameters are the argument expressions. */
11438 tree
11440 {
11450 }
11452 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11453 varargs macros aren't supported by all bootstrap compilers. */
11455 tree
11457 {
11467 }
11469 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11470 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11471 It will get gimplified later into an ordinary internal function. */
11473 tree
11476 {
11484 }
11486 /* Build internal call expression. This is just like CALL_EXPR, except
11487 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11488 internal function. */
11490 tree
11493 {
11503 }
11505 /* Return a function call to FN, if the target is guaranteed to support it,
11506 or null otherwise.
11508 N is the number of arguments, passed in the "...", and TYPE is the
11509 type of the return value. */
11511 tree
11514 {
11524 {
11527 {
11530 OPTIMIZE_FOR_BOTH))
11532 }
11534 }
11535 else
11536 {
11541 }
11542 }
11544 /* Return a function call to the appropriate builtin alloca variant.
11546 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11547 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11548 bound for SIZE in case it is not a fixed value. */
11550 tree
11552 {
11554 {
11556 return
11558 }
11560 {
11563 }
11564 else
11565 {
11568 }
11569 }
11571 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11572 if SIZE == -1) and return a tree node representing char* pointer to
11573 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value
11574 is the LEN bytes at STR (the representation of the string, which may
11575 be wide). */
11577 tree
11581 {
11583 /* Set the maximum valid index based on the string length or SIZE. */
11584 unsigned HOST_WIDE_INT maxidx
11600 }
11604 /* Return true if T (assumed to be a DECL) must be assigned a memory
11605 location. */
11607 bool
11609 {
11615 }
11617 /* Return value of a constant X and sign-extend it. */
11619 HOST_WIDE_INT
11621 {
11625 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11629 {
11633 else
11635 }
11638 }
11640 /* If TYPE is an integral or pointer type, return an integer type with
11641 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11642 if TYPE is already an integer type of signedness UNSIGNEDP.
11643 If TYPE is a floating-point type, return an integer type with the same
11644 bitsize and with the signedness given by UNSIGNEDP; this is useful
11645 when doing bit-level operations on a floating-point value. */
11647 tree
11649 {
11654 {
11662 }
11665 {
11673 }
11682 else
11686 }
11688 /* If TYPE is an integral or pointer type, return an integer type with
11689 the same precision which is unsigned, or itself if TYPE is already an
11690 unsigned integer type. If TYPE is a floating-point type, return an
11691 unsigned integer type with the same bitsize as TYPE. */
11693 tree
11695 {
11697 }
11699 /* If TYPE is an integral or pointer type, return an integer type with
11700 the same precision which is signed, or itself if TYPE is already a
11701 signed integer type. If TYPE is a floating-point type, return a
11702 signed integer type with the same bitsize as TYPE. */
11704 tree
11706 {
11708 }
11710 /* If TYPE is a vector type, return a signed integer vector type with the
11711 same width and number of subparts. Otherwise return boolean_type_node. */
11713 tree
11715 {
11717 {
11721 }
11722 else
11724 }
11726 /* Returns the largest value obtainable by casting something in INNER type to
11727 OUTER type. */
11729 tree
11731 {
11737 /* Compute a unique number for every combination. */
11742 /* Determine the exponent to use. */
11744 {
11747 /* oprec <= iprec, outer: signed, inner: don't care. */
11752 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11756 /* oprec > iprec, outer: signed, inner: signed. */
11760 /* oprec > iprec, outer: signed, inner: unsigned. */
11764 /* oprec > iprec, outer: unsigned, inner: signed. */
11768 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11773 }
11777 }
11779 /* Returns the smallest value obtainable by casting something in INNER type to
11780 OUTER type. */
11782 tree
11784 {
11788 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11789 and obtain 0. */
11791 /* If we are widening something of an unsigned type, OUTER type
11792 contains all values of INNER type. In particular, both INNER
11793 and OUTER types have zero in common. */
11796 else
11797 {
11798 /* If we are widening a signed type to another signed type, we
11799 want to obtain -2^^(iprec-1). If we are keeping the
11800 precision or narrowing to a signed type, we want to obtain
11801 -2^(oprec-1). */
11806 }
11807 }
11809 /* Return nonzero if two operands that are suitable for PHI nodes are
11810 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11811 SSA_NAME or invariant. Note that this is strictly an optimization.
11812 That is, callers of this function can directly call operand_equal_p
11813 and get the same result, only slower. */
11815 int
11817 {
11823 }
11825 /* Returns number of zeros at the end of binary representation of X. */
11827 tree
11829 {
11831 }
11834 #define WALK_SUBTREE(NODE) \
11835 do \
11836 { \
11837 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11838 if (result) \
11839 return result; \
11840 } \
11841 while (0)
11843 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11844 be walked whenever a type is seen in the tree. Rest of operands and return
11845 value are as for walk_tree. */
11847 static tree
11850 {
11854 {
11858 /* We have to worry about mutually recursive pointers. These can't
11859 be written in C. They can in Ada. It's pathological, but
11860 there's an ACATS test (c38102a) that checks it. Deal with this
11861 by checking if we're pointing to another pointer, that one
11862 points to another pointer, that one does too, and we have no htab.
11863 If so, get a hash table. We check three levels deep to avoid
11864 the cost of the hash table if we don't need one. */
11869 {
11876 }
11878 /* fall through */
11887 /* Fall through. */
11891 {
11892 tree arg;
11894 /* We never want to walk into default arguments. */
11897 }
11901 /* Don't follow this nodes's type if a pointer for fear that
11902 we'll have infinite recursion. If we have a PSET, then we
11903 need not fear. */
11918 }
11921 }
11923 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11924 called with the DATA and the address of each sub-tree. If FUNC returns a
11925 non-NULL value, the traversal is stopped, and the value returned by FUNC
11926 is returned. If PSET is non-NULL it is used to record the nodes visited,
11927 and to avoid visiting a node more than once. */
11929 tree
11932 {
11935 tree result;
11937 #define WALK_SUBTREE_TAIL(NODE) \
11938 do \
11939 { \
11940 tp = & (NODE); \
11941 goto tail_recurse; \
11942 } \
11943 while (0)
11945 tail_recurse:
11946 /* Skip empty subtrees. */
11950 /* Don't walk the same tree twice, if the user has requested
11951 that we avoid doing so. */
11955 /* Call the function. */
11959 /* If we found something, return it. */
11965 /* Even if we didn't, FUNC may have decided that there was nothing
11966 interesting below this point in the tree. */
11968 {
11969 /* But we still need to check our siblings. */
11974 else
11976 }
11979 {
11983 }
11986 {
11999 /* None of these have subtrees other than those already walked
12000 above. */
12009 {
12015 /* Walk all elements but the first. */
12019 /* Now walk the first one as a tail call. */
12021 }
12028 {
12033 idx++)
12035 }
12042 {
12043 tree decl;
12045 {
12046 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12047 into declarations that are just mentioned, rather than
12048 declared; they don't really belong to this part of the tree.
12049 And, we can see cycles: the initializer for a declaration
12050 can refer to the declaration itself. */
12054 }
12056 }
12059 {
12060 tree_stmt_iterator i;
12063 }
12068 {
12072 /* FALLTHRU */
12117 /* FALLTHRU */
12152 {
12157 }
12177 {
12182 }
12186 }
12190 {
12193 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12194 But, we only want to walk once. */
12199 }
12202 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12203 defining. We only want to walk into these fields of a type in this
12204 case and not in the general case of a mere reference to the type.
12206 The criterion is as follows: if the field can be an expression, it
12207 must be walked only here. This should be in keeping with the fields
12208 that are directly gimplified in gimplify_type_sizes in order for the
12209 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12210 variable-sized types.
12212 Note that DECLs get walked as part of processing the BIND_EXPR. */
12214 {
12215 /* Call the function for the decl so e.g. copy_tree_body_r can
12216 replace it with the remapped one. */
12225 /* Call the function for the type. See if it returns anything or
12226 doesn't want us to continue. If we are to continue, walk both
12227 the normal fields and those for the declaration case. */
12232 /* But do not walk a pointed-to type since it may itself need to
12233 be walked in the declaration case if it isn't anonymous. */
12235 {
12239 }
12241 /* If this is a record type, also walk the fields. */
12243 {
12244 tree field;
12248 {
12249 /* We'd like to look at the type of the field, but we can
12250 easily get infinite recursion. So assume it's pointed
12251 to elsewhere in the tree. Also, ignore things that
12252 aren't fields. */
12261 }
12262 }
12264 /* Same for scalar types. */
12270 {
12273 }
12277 }
12278 /* FALLTHRU */
12282 {
12285 /* Walk over all the sub-trees of this operand. */
12288 /* Go through the subtrees. We need to do this in forward order so
12289 that the scope of a FOR_EXPR is handled properly. */
12291 {
12295 }
12296 }
12297 /* If this is a type, walk the needed fields in the type. */
12301 }
12303 /* We didn't find what we were looking for. */
12306 #undef WALK_SUBTREE_TAIL
12307 }
12308 #undef WALK_SUBTREE
12310 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12312 tree
12314 walk_tree_lh lh)
12315 {
12316 tree result;
12321 }
12324 tree
12326 {
12333 }
12335 void
12337 {
12341 {
12343 }
12344 else
12346 }
12348 /* Create a nameless artificial label and put it in the current
12349 function context. The label has a location of LOC. Returns the
12350 newly created label. */
12352 tree
12354 {
12362 }
12364 /* Given a tree, try to return a useful variable name that we can use
12365 to prefix a temporary that is being assigned the value of the tree.
12366 I.E. given <temp> = &A, return A. */
12370 {
12371 tree stripped_decl;
12378 {
12383 }
12384 else
12385 {
12387 {
12392 }
12393 }
12394 }
12396 /* Return true if TYPE has a variable argument list. */
12398 bool
12400 {
12401 function_args_iterator args_iter;
12408 {
12410 }
12413 }
12415 /* Return true if TYPE has a prototype. */
12417 bool
12419 {
12420 tree t;
12426 }
12428 /* If BLOCK is inlined from an __attribute__((__artificial__))
12429 routine, return pointer to location from where it has been
12430 called. */
12431 location_t *
12433 {
12438 {
12441 {
12442 /* If AO is an artificial inline, point RET to the
12443 call site locus at which it has been inlined and continue
12444 the loop, in case AO's caller is also an artificial
12445 inline. */
12449 else
12451 }
12456 }
12458 }
12461 /* If EXP is inlined from an __attribute__((__artificial__))
12462 function, return the location of the original call expression. */
12464 location_t
12466 {
12471 else
12473 }
12476 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12477 nodes. */
12479 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12481 hashval_t
12483 {
12491 {
12494 }
12499 else
12502 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12503 something else. */
12509 }
12511 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12512 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12513 same. */
12515 bool
12517 {
12530 else
12532 }
12534 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12536 tree
12538 {
12539 tree t;
12541 /* Use the cache of optimization nodes. */
12544 opts);
12549 {
12550 /* Insert this one into the hash table. */
12554 /* Make a new node for next time round. */
12556 }
12559 }
12561 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12563 tree
12565 {
12566 tree t;
12568 /* Use the cache of optimization nodes. */
12571 opts);
12576 {
12577 /* Insert this one into the hash table. */
12581 /* Make a new node for next time round. */
12583 }
12586 }
12588 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12589 so that they aren't saved during PCH writing. */
12591 void
12593 {
12598 }
12600 /* Determine the "ultimate origin" of a block. */
12602 tree
12604 {
12609 else
12610 {
12615 }
12616 }
12618 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12619 no instruction. */
12621 bool
12623 {
12624 /* Do not strip casts into or out of differing address spaces. */
12627 {
12632 }
12635 {
12636 /* We already know that outer_type is not a pointer with
12637 a non-generic address space. */
12639 }
12641 /* Use precision rather then machine mode when we can, which gives
12642 the correct answer even for submode (bit-field) types. */
12651 /* Otherwise fall back on comparing machine modes (e.g. for
12652 aggregate types, floats). */
12654 }
12656 /* Return true iff conversion in EXP generates no instruction. Mark
12657 it inline so that we fully inline into the stripping functions even
12658 though we have two uses of this function. */
12662 {
12677 }
12679 /* Return true iff conversion in EXP generates no instruction. Don't
12680 consider conversions changing the signedness. */
12682 static bool
12684 {
12695 }
12697 /* Strip conversions from EXP according to tree_nop_conversion and
12698 return the resulting expression. */
12700 tree
12702 {
12706 }
12708 /* Strip conversions from EXP according to tree_sign_nop_conversion
12709 and return the resulting expression. */
12711 tree
12713 {
12717 }
12719 /* Avoid any floating point extensions from EXP. */
12720 tree
12722 {
12725 /* For floating point constant look up the narrowest type that can hold
12726 it properly and handle it like (type)(narrowest_type)constant.
12727 This way we can optimize for instance a=a*2.0 where "a" is float
12728 but 2.0 is double constant. */
12730 {
12731 REAL_VALUE_TYPE orig;
12744 }
12763 }
12765 /* Strip out all handled components that produce invariant
12766 offsets. */
12768 const_tree
12770 {
12772 {
12774 {
12789 }
12791 }
12794 }
12798 /* Return the GCC personality function decl. */
12800 tree
12802 {
12806 }
12808 /* TARGET is a call target of GIMPLE call statement
12809 (obtained by gimple_call_fn). Return true if it is
12810 OBJ_TYPE_REF representing an virtual call of C++ method.
12811 (As opposed to OBJ_TYPE_REF representing objc calls
12812 through a cast where middle-end devirtualization machinery
12813 can't apply.) */
12815 bool
12817 {
12826 /* If we do not have BINFO associated, it means that type was built
12827 without devirtualization enabled. Do not consider this a virtual
12828 call. */
12832 }
12834 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12836 static tree
12838 {
12849 }
12851 /* Try to find a base info of BINFO that would have its field decl at offset
12852 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12853 found, return, otherwise return NULL_TREE. */
12855 tree
12857 {
12861 {
12863 tree fld;
12872 {
12880 }
12884 /* Offset 0 indicates the primary base, whose vtable contents are
12885 represented in the binfo for the derived class. */
12887 {
12889 /* Offsets in BINFO are in bytes relative to the whole structure
12890 while POS is in bits relative to the containing field. */
12897 {
12900 }
12903 else
12905 binfo_offset);
12906 }
12910 }
12911 }
12913 /* Returns true if X is a typedef decl. */
12915 bool
12917 {
12920 }
12922 /* Returns true iff TYPE is a type variant created for a typedef. */
12924 bool
12926 {
12928 }
12930 /* PR 84195: Replace control characters in "unescaped" with their
12931 escaped equivalents. Allow newlines if -fmessage-length has
12932 been set to a non-zero value. This is done here, rather than
12933 where the attribute is recorded as the message length can
12934 change between these two locations. */
12936 void
12938 {
12956 {
12960 {
12964 }
12967 {
12969 {
12970 /* We only allocate space for a new string if we
12971 actually encounter a control character that
12972 needs replacing. */
12976 }
12981 {
12990 }
12991 }
12994 }
12997 {
13001 }
13002 }
13004 /* Warn about a use of an identifier which was marked deprecated. Returns
13005 whether a warning was given. */
13007 bool
13009 {
13010 escaped_string msg;
13016 {
13020 {
13025 }
13026 }
13036 {
13037 auto_diagnostic_group d;
13041 else
13046 }
13048 {
13053 {
13059 }
13061 auto_diagnostic_group d;
13063 {
13067 else
13070 }
13071 else
13072 {
13076 else
13079 }
13083 }
13086 }
13088 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13089 somewhere in it. */
13091 bool
13093 {
13095 {
13100 }
13103 }
13105 /* Try to determine whether a TRY_CATCH expression can fall through.
13106 This is a subroutine of block_may_fallthru. */
13108 static bool
13110 {
13111 tree_stmt_iterator i;
13113 /* If the TRY block can fall through, the whole TRY_CATCH can
13114 fall through. */
13120 {
13122 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13123 catch expression and a body. The whole TRY_CATCH may fall
13124 through iff any of the catch bodies falls through. */
13126 {
13129 }
13133 /* The exception filter expression only matters if there is an
13134 exception. If the exception does not match EH_FILTER_TYPES,
13135 we will execute EH_FILTER_FAILURE, and we will fall through
13136 if that falls through. If the exception does match
13137 EH_FILTER_TYPES, the stack unwinder will continue up the
13138 stack, so we will not fall through. We don't know whether we
13139 will throw an exception which matches EH_FILTER_TYPES or not,
13140 so we just ignore EH_FILTER_TYPES and assume that we might
13141 throw an exception which doesn't match. */
13145 /* This case represents statements to be executed when an
13146 exception occurs. Those statements are implicitly followed
13147 by a RESX statement to resume execution after the exception.
13148 So in this case the TRY_CATCH never falls through. */
13150 }
13151 }
13153 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13154 need not be 100% accurate; simply be conservative and return true if we
13155 don't know. This is used only to avoid stupidly generating extra code.
13156 If we're wrong, we'll just delete the extra code later. */
13158 bool
13160 {
13161 /* This CONST_CAST is okay because expr_last returns its argument
13162 unmodified and we assign it to a const_tree. */
13166 {
13169 /* Easy cases. If the last statement of the block implies
13170 control transfer, then we can't fall through. */
13174 /* If there is a default: label or case labels cover all possible
13175 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13176 to some case label in all cases and all we care is whether the
13177 SWITCH_BODY falls through. */
13194 /* The finally clause is always executed after the try clause,
13195 so if it does not fall through, then the try-finally will not
13196 fall through. Otherwise, if the try clause does not fall
13197 through, then when the finally clause falls through it will
13198 resume execution wherever the try clause was going. So the
13199 whole try-finally will only fall through if both the try
13200 clause and the finally clause fall through. */
13210 else
13212 /* FALLTHRU */
13215 /* Functions that do not return do not fall through. */
13229 }
13230 }
13232 /* True if we are using EH to handle cleanups. */
13235 /* This routine is called from front ends to indicate eh should be used for
13236 cleanups. */
13237 void
13239 {
13241 }
13243 /* Query whether EH is used for cleanups. */
13244 bool
13246 {
13248 }
13250 /* Wrapper for tree_code_name to ensure that tree code is valid */
13253 {
13257 {
13261 }
13264 }
13266 /* Drops the TREE_OVERFLOW flag from T. */
13268 tree
13270 {
13273 /* For tree codes with a sharing machinery re-build the result. */
13277 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13278 and canonicalize the result. */
13280 {
13281 tree_vector_builder builder;
13285 {
13290 }
13292 }
13294 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13295 and drop the flag. */
13299 /* For constants that contain nested constants, drop the flag
13300 from those as well. */
13302 {
13307 }
13310 }
13312 /* Given a memory reference expression T, return its base address.
13313 The base address of a memory reference expression is the main
13314 object being referenced. For instance, the base address for
13315 'array[i].fld[j]' is 'array'. You can think of this as stripping
13316 away the offset part from a memory address.
13318 This function calls handled_component_p to strip away all the inner
13319 parts of the memory reference until it reaches the base object. */
13321 tree
13323 {
13332 /* ??? Either the alias oracle or all callers need to properly deal
13333 with WITH_SIZE_EXPRs before we can look through those. */
13338 }
13340 /* Return a tree of sizetype representing the size, in bytes, of the element
13341 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13343 tree
13345 {
13350 /* If a size was specified in the ARRAY_REF, it's the size measured
13351 in alignment units of the element type. So multiply by that value. */
13353 {
13354 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13355 sizetype from another type of the same width and signedness. */
13360 }
13362 /* Otherwise, take the size from that of the element type. Substitute
13363 any PLACEHOLDER_EXPR that we have. */
13364 else
13366 }
13368 /* Return a tree representing the lower bound of the array mentioned in
13369 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13371 tree
13373 {
13376 /* If a lower bound is specified in EXP, use it. */
13380 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13381 substituting for a PLACEHOLDER_EXPR as needed. */
13385 /* Otherwise, return a zero of the appropriate type. */
13389 }
13391 /* Return a tree representing the upper bound of the array mentioned in
13392 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13394 tree
13396 {
13399 /* If there is a domain type and it has an upper bound, use it, substituting
13400 for a PLACEHOLDER_EXPR as needed. */
13404 /* Otherwise fail. */
13406 }
13408 /* Returns true if REF is an array reference, component reference,
13409 or memory reference to an array at the end of a structure.
13410 If this is the case, the array may be allocated larger
13411 than its upper bound implies. */
13413 bool
13415 {
13416 tree atype;
13420 {
13423 }
13428 {
13434 {
13436 {
13442 }
13443 else
13445 }
13446 else
13448 }
13449 else
13457 {
13458 /* If the reference chain contains a component reference to a
13459 non-union type and there follows another field the reference
13460 is not at the end of a structure. */
13462 {
13464 {
13470 }
13471 }
13472 /* If we have a multi-dimensional array we do not consider
13473 a non-innermost dimension as flex array if the whole
13474 multi-dimensional array is at struct end.
13475 Same for an array of aggregates with a trailing array
13476 member. */
13480 ;
13481 /* If we view an underlying object as sth else then what we
13482 gathered up to now is what we have to rely on. */
13485 else
13489 }
13491 /* The array now is at struct end. Treat flexible arrays as
13492 always subject to extend, even into just padding constrained by
13493 an underlying decl. */
13503 /* If the reference is based on a declared entity, the size of the array
13504 is constrained by its given domain. (Do not trust commons PR/69368). */
13506 && !(flag_unconstrained_commons
13510 {
13511 /* Check whether the array domain covers all of the available
13512 padding. */
13513 poly_int64 offset;
13521 /* If at least one extra element fits it is a flexarray. */
13530 }
13533 }
13535 /* Return a tree representing the offset, in bytes, of the field referenced
13536 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13538 tree
13540 {
13545 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13546 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13547 value. */
13549 {
13550 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13551 sizetype from another type of the same width and signedness. */
13557 }
13559 /* Otherwise, take the offset from that of the field. Substitute
13560 any PLACEHOLDER_EXPR that we have. */
13561 else
13563 }
13565 /* Given the initializer INIT, return the initializer for the field
13566 DECL if it exists, otherwise null. Used to obtain the initializer
13567 for a flexible array member and determine its size. */
13569 static tree
13571 {
13577 {
13582 {
13586 }
13587 }
13590 }
13592 /* Determines the size of the member referenced by the COMPONENT_REF
13593 REF, using its initializer expression if necessary in order to
13594 determine the size of an initialized flexible array member.
13595 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13596 an interior zero-length array.
13597 Returns the size as sizetype (which might be zero for an object
13598 with an uninitialized flexible array member) or null if the size
13599 cannot be determined. */
13601 tree
13603 {
13610 /* The object/argument referenced by the COMPONENT_REF and its type. */
13613 /* The referenced member. */
13618 {
13626 /* MEMBER is either an interior array or is an array with
13627 more than one element. */
13640 {
13644 /* MEMBER is an array with more than one element. */
13646 }
13648 /* For a refernce to a zero- or one-element array member of a union
13649 use the size of the union instead of the size of the member. */
13652 }
13654 /* MEMBER is either a bona fide flexible array member, or a zero-length
13655 array member, or an array of length one treated as such. */
13657 /* If the reference is to a declared object and the member a true
13658 flexible array, try to determine its size from its initializer. */
13662 {
13673 }
13675 /* BASE is the declared object of which MEMBER is either a member
13676 or that is cast to ARGTYPE (e.g., a char buffer used to store
13677 an ARGTYPE object). */
13680 /* Determine the base type of the referenced object. If it's
13681 the same as ARGTYPE and MEMBER has a known size, return it. */
13693 /* MEMBER is a true flexible array member. Compute its size from
13694 the initializer of the BASE object if it has one. */
13697 {
13700 {
13703 {
13704 /* Use the larger of the initializer size and the tail
13705 padding in the enclosing struct. */
13710 }
13713 }
13714 }
13717 {
13719 {
13724 /* The size of a flexible array member of an extern struct
13725 with no initializer cannot be determined (it's defined
13726 in another translation unit and can have an initializer
13727 with an arbitrary number of elements). */
13730 /* Use the size of the base struct or, for interior zero-length
13731 arrays, the size of the enclosing type. */
13733 }
13735 /* Use the size of the BASE object (possibly an array of some
13736 other type such as char used to store the struct). */
13738 else
13740 }
13742 /* If the flexible array member has a known size use the greater
13743 of it and the tail padding in the enclosing struct.
13744 Otherwise, when the size of the flexible array member is unknown
13745 and the referenced object is not a struct, use the size of its
13746 type when known. This detects sizes of array buffers when cast
13747 to struct types with flexible array members. */
13749 {
13752 {
13755 }
13757 }
13759 /* Return "don't know" for an external non-array object since its
13760 flexible array member can be initialized to have any number of
13761 elements. Otherwise, return zero because the flexible array
13762 member has no elements. */
13765 && (!typematch
13768 }
13770 /* Return the machine mode of T. For vectors, returns the mode of the
13771 inner type. The main use case is to feed the result to HONOR_NANS,
13772 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13774 machine_mode
13776 {
13782 }
13784 /* Vector types need to re-check the target flags each time we report
13785 the machine mode. We need to do this because attribute target can
13786 change the result of vector_mode_supported_p and have_regs_of_mode
13787 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13788 change on a per-function basis. */
13789 /* ??? Possibly a better solution is to run through all the types
13790 referenced by a function and re-compute the TYPE_MODE once, rather
13791 than make the TYPE_MODE macro call a function. */
13793 machine_mode
13795 {
13796 machine_mode mode;
13804 {
13805 scalar_int_mode innermode;
13807 /* For integers, try mapping it to a same-sized scalar mode. */
13809 {
13812 scalar_int_mode mode;
13816 }
13819 }
13822 }
13824 /* Return the size in bits of each element of vector type TYPE. */
13826 unsigned int
13828 {
13834 }
13836 /* Calculate the size in bits of each element of vector type TYPE
13837 and return the result as a tree of type bitsizetype. */
13839 tree
13841 {
13846 }
13848 /* Verify that basic properties of T match TV and thus T can be a variant of
13849 TV. TV should be the more specified variant (i.e. the main variant). */
13851 static bool
13853 {
13854 /* Type variant can differ by:
13856 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13857 ENCODE_QUAL_ADDR_SPACE.
13858 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13859 in this case some values may not be set in the variant types
13860 (see TYPE_COMPLETE_P checks).
13861 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13862 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13863 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13864 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13865 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13866 this is necessary to make it possible to merge types form different TUs
13867 - arrays, pointers and references may have TREE_TYPE that is a variant
13868 of TREE_TYPE of their main variants.
13869 - aggregates may have new TYPE_FIELDS list that list variants of
13870 the main variant TYPE_FIELDS.
13871 - vector types may differ by TYPE_VECTOR_OPAQUE
13872 */
13874 /* Convenience macro for matching individual fields. */
13875 #define verify_variant_match(flag) \
13876 do { \
13877 if (flag (tv) != flag (t)) \
13878 { \
13880 debug_tree (tv); \
13881 return false; \
13882 } \
13883 } while (false)
13885 /* tree_base checks. */
13888 /* FIXME: Ada builds non-artificial variants of artificial types. */
13893 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13900 else
13902 /* FIXME: This check trigger during libstdc++ build. */
13906 /* tree_type_common checks. */
13909 {
13917 {
13927 }
13929 }
13935 /* During LTO we merge variant lists from diferent translation units
13936 that may differ BY TYPE_CONTEXT that in turn may point
13937 to TRANSLATION_UNIT_DECL.
13938 Ada also builds variants of types with different TYPE_CONTEXT. */
13946 {
13950 }
13952 /* tree_type_non_common checks. */
13954 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13955 and dangle the pointer from time to time. */
13959 {
13963 }
13969 {
13972 }
13979 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13980 or even type's main variant. This is needed to make bootstrap pass
13981 and the bug seems new in GCC 5.
13982 C++ FE should be updated to make this consistent and we should check
13983 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13984 is a match with main variant.
13986 Also disable the check for Java for now because of parser hack that builds
13987 first an dummy BINFO and then sometimes replace it by real BINFO in some
13988 of the copies. */
13991 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13992 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13993 at LTO time only. */
13995 {
14003 }
14005 /* Check various uses of TYPE_VALUES_RAW. */
14011 /* Permit incomplete variants of complete type. While FEs may complete
14012 all variants, this does not happen for C++ templates in all cases. */
14016 {
14019 /* Fortran builds qualified variants as new records with items of
14020 qualified type. Verify that they looks same. */
14027 /* FIXME: gfc_nonrestricted_type builds all types as variants
14028 with exception of pointer types. It deeply copies the type
14029 which means that we may end up with a variant type
14030 referring non-variant pointer. We may change it to
14031 produce types as variants, too, like
14032 objc_get_protocol_qualified_type does. */
14038 {
14046 }
14047 }
14050 /* For C++ the qualified variant of array type is really an array type
14051 of qualified TREE_TYPE.
14052 objc builds variants of pointer where pointer to type is a variant, too
14053 in objc_get_protocol_qualified_type. */
14059 {
14067 }
14070 {
14078 }
14080 #undef verify_variant_match
14081 }
14084 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14085 the middle-end types_compatible_p function. It needs to avoid
14086 claiming types are different for types that should be treated
14087 the same with respect to TBAA. Canonical types are also used
14088 for IL consistency checks via the useless_type_conversion_p
14089 predicate which does not handle all type kinds itself but falls
14090 back to pointer-comparison of TYPE_CANONICAL for aggregates
14091 for example. */
14093 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14094 type calculation because we need to allow inter-operability between signed
14095 and unsigned variants. */
14097 bool
14099 {
14100 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14101 signed char and unsigned char. Similarly fortran FE builds
14102 C_SIZE_T as signed type, while C defines it unsigned. */
14105 == INTEGER_TYPE
14108 }
14110 /* Return true iff T1 and T2 are structurally identical for what
14111 TBAA is concerned.
14112 This function is used both by lto.c canonical type merging and by the
14113 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14114 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14115 only for LTO because only in these cases TYPE_CANONICAL equivalence
14116 correspond to one defined by gimple_canonical_types_compatible_p. */
14118 bool
14121 {
14122 /* Type variants should be same as the main variant. When not doing sanity
14123 checking to verify this fact, go to main variants and save some work. */
14125 {
14128 }
14130 /* Check first for the obvious case of pointer identity. */
14134 /* Check that we have two types to compare. */
14138 /* We consider complete types always compatible with incomplete type.
14139 This does not make sense for canonical type calculation and thus we
14140 need to ensure that we are never called on it.
14142 FIXME: For more correctness the function probably should have three modes
14143 1) mode assuming that types are complete mathcing their structure
14144 2) mode allowing incomplete types but producing equivalence classes
14145 and thus ignoring all info from complete types
14146 3) mode allowing incomplete types to match complete but checking
14147 compatibility between complete types.
14149 1 and 2 can be used for canonical type calculation. 3 is the real
14150 definition of type compatibility that can be used i.e. for warnings during
14151 declaration merging. */
14156 /* If the types have been previously registered and found equal
14157 they still are. */
14161 {
14162 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14163 they are always NULL, but they are set to non-NULL for types
14164 constructed by build_pointer_type and variants. In this case the
14165 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14166 all pointers are considered equal. Be sure to not return false
14167 negatives. */
14171 }
14173 /* For types where we do ODR based TBAA the canonical type is always
14174 set correctly, so we know that types are different if their
14175 canonical types does not match. */
14181 /* Can't be the same type if the types don't have the same code. */
14186 /* Qualifiers do not matter for canonical type comparison purposes. */
14188 /* Void types and nullptr types are always the same. */
14193 /* Can't be the same type if they have different mode. */
14197 /* Non-aggregate types can be handled cheaply. */
14205 {
14206 /* Can't be the same type if they have different recision. */
14210 /* In some cases the signed and unsigned types are required to be
14211 inter-operable. */
14216 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14217 interoperable with "signed char". Unless all frontends are revisited
14218 to agree on these types, we must ignore the flag completely. */
14220 /* Fortran standard define C_PTR type that is compatible with every
14221 C pointer. For this reason we need to glob all pointers into one.
14222 Still pointers in different address spaces are not compatible. */
14224 {
14228 }
14230 /* Tail-recurse to components. */
14235 trust_type_canonical);
14238 }
14240 /* Do type-specific comparisons. */
14242 {
14244 /* Array types are the same if the element types are the same and
14245 the number of elements are the same. */
14247 trust_type_canonical)
14252 else
14253 {
14257 /* For an incomplete external array, the type domain can be
14258 NULL_TREE. Check this condition also. */
14263 else
14264 {
14270 /* The minimum/maximum values have to be the same. */
14282 else
14284 }
14285 }
14289 /* Function types are the same if the return type and arguments types
14290 are the same. */
14292 trust_type_canonical))
14297 else
14298 {
14304 {
14307 trust_type_canonical))
14309 }
14315 }
14320 {
14323 /* Don't try to compare variants of an incomplete type, before
14324 TYPE_FIELDS has been copied around. */
14332 /* For aggregate types, all the fields must be the same. */
14336 {
14337 /* Skip non-fields and zero-sized fields. */
14348 /* The fields must have the same name, offset and type. */
14351 || !gimple_canonical_types_compatible_p
14353 trust_type_canonical))
14355 }
14357 /* If one aggregate has more fields than the other, they
14358 are not the same. */
14363 }
14366 /* Consider all types with language specific trees in them mutually
14367 compatible. This is executed only from verify_type and false
14368 positives can be tolerated. */
14371 }
14372 }
14374 /* Verify type T. */
14376 void
14378 {
14382 {
14385 }
14387 {
14391 }
14397 ;
14399 {
14403 }
14404 /* Method and function types cannot be used to address memory and thus
14405 TYPE_CANONICAL really matters only for determining useless conversions.
14407 FIXME: C++ FE produce declarations of builtin functions that are not
14408 compatible with main variants. */
14410 ;
14412 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14413 with variably sized arrays because their sizes possibly
14414 gimplified to different variables. */
14418 {
14422 }
14426 {
14430 }
14432 {
14437 }
14440 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14442 {
14443 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14444 and danagle the pointer from time to time. */
14448 {
14452 }
14453 }
14455 {
14458 {
14462 }
14463 }
14465 {
14468 {
14472 }
14473 }
14476 {
14477 /* FIXME: The following check should pass:
14478 useless_type_conversion_p (const_cast <tree> (t),
14479 TREE_TYPE (TYPE_MIN_VALUE (t))
14480 but does not for C sizetypes in LTO. */
14481 }
14483 /* Check various uses of TYPE_MAXVAL_RAW. */
14485 {
14487 ;
14489 {
14493 }
14495 {
14499 }
14500 }
14502 {
14506 {
14510 }
14511 }
14513 {
14517 {
14521 }
14522 }
14525 {
14526 /* FIXME: The following check should pass:
14527 useless_type_conversion_p (const_cast <tree> (t),
14528 TREE_TYPE (TYPE_MAX_VALUE (t))
14529 but does not for C sizetypes in LTO. */
14530 }
14532 {
14535 {
14539 }
14540 }
14542 {
14546 }
14549 {
14553 }
14555 /* Check various uses of TYPE_VALUES_RAW. */
14558 {
14562 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14563 CONST_DECL of ENUMERAL TYPE. */
14565 {
14570 }
14573 {
14579 }
14581 {
14586 }
14587 }
14589 {
14591 {
14595 }
14596 }
14598 {
14600 {
14603 }
14605 {
14606 /* TODO: verify properties of decls. */
14608 ;
14610 ;
14612 ;
14614 ;
14616 ;
14618 ;
14620 ;
14621 else
14622 {
14626 }
14627 }
14628 }
14635 {
14637 {
14642 }
14644 {
14648 }
14649 /* Verify just enough of cache to ensure that no one copied it to new type.
14650 All copying should go by copy_node that should clear it. */
14652 {
14657 {
14662 }
14663 }
14664 }
14667 {
14668 /* C++ FE uses TREE_PURPOSE to store initial values. */
14670 {
14674 }
14676 {
14680 }
14681 }
14683 {
14687 }
14695 {
14698 }
14700 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14701 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14702 of a type. */
14705 {
14708 }
14711 {
14714 }
14715 }
14718 /* Return 1 if ARG interpreted as signed in its precision is known to be
14719 always positive or 2 if ARG is known to be always negative, or 3 if
14720 ARG may be positive or negative. */
14722 int
14724 {
14731 {
14735 else
14737 }
14741 {
14743 /* Narrower value zero extended into wider type
14744 will always result in positive values. */
14751 }
14757 {
14761 {
14765 {
14774 }
14775 }
14777 }
14779 {
14780 /* For unsigned values, the "positive" range comes
14781 below the "negative" range. */
14786 }
14787 else
14788 {
14793 }
14795 }
14800 /* Return true if ARG is marked with the nonnull attribute in the
14801 current function signature. */
14803 bool
14805 {
14813 /* The static chain decl is always non null. */
14817 /* THIS argument of method is always non-NULL. */
14823 /* Values passed by reference are always non-NULL. */
14830 {
14833 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14837 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14841 /* Get the position number for ARG in the function signature. */
14843 t;
14845 {
14848 }
14852 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14854 {
14857 }
14858 }
14861 }
14863 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14864 information. */
14866 location_t
14868 {
14872 }
14874 location_t
14876 {
14877 source_range src_range;
14881 }
14883 location_t
14885 {
14891 pure_loc,
14892 src_range,
14893 NULL);
14896 }
14898 /* Return EXPR, potentially wrapped with a node expression LOC,
14899 if !CAN_HAVE_LOCATION_P (expr).
14901 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14902 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14904 Wrapper nodes can be identified using location_wrapper_p. */
14906 tree
14908 {
14915 /* We should only be adding wrappers for constants and for decls,
14916 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14921 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14922 any impact of the wrapper nodes. */
14926 /* If any auto_suppress_location_wrappers are active, don't create
14927 wrappers. */
14931 tree_code code
14936 /* Mark this node as being a wrapper. */
14939 }
14943 /* Return the name of combined function FN, for debugging purposes. */
14947 {
14949 {
14952 }
14953 else
14955 }
14957 /* Return a bitmap with a bit set corresponding to each argument in
14958 a function call type FNTYPE declared with attribute nonnull,
14959 or null if none of the function's argument are nonnull. The caller
14960 must free the bitmap. */
14962 bitmap
14964 {
14970 {
14971 /* The this pointer in C++ non-static member functions is
14972 implicitly nonnull whether or not it's declared as such. */
14975 }
14981 /* A function declaration can specify multiple attribute nonnull,
14982 each with zero or more arguments. The loop below creates a bitmap
14983 representing a union of all the arguments. An empty (but non-null)
14984 bitmap means that all arguments have been declaraed nonnull. */
14986 {
14995 {
14996 /* Clear the bitmap in case a previous attribute nonnull
14997 set it and this one overrides it for all arguments. */
15000 }
15002 /* Iterate over the indices of the format arguments declared nonnull
15003 and set a bit for each. */
15005 {
15008 }
15009 }
15012 }
15014 /* Returns true if TYPE is a type where it and all of its subobjects
15015 (recursively) are of structure, union, or array type. */
15017 static bool
15019 {
15021 {
15028 }
15034 }
15036 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15037 that shouldn't be passed via stack. */
15039 bool
15041 {
15052 }
15054 /* Determine whether TYPE is a structure with a flexible array member,
15055 or a union containing such a structure (possibly recursively). */
15057 bool
15059 {
15062 {
15078 {
15082 }
15086 }
15087 }
15089 /* Like int_size_in_bytes, but handle empty records specially. */
15091 HOST_WIDE_INT
15093 {
15095 }
15097 /* Like size_in_bytes, but handle empty records specially. */
15099 tree
15101 {
15103 }
15105 /* Return true if an expression with CODE has to have the same result type as
15106 its first operand. */
15108 bool
15110 {
15112 {
15146 }
15147 }
15149 /* Return a typenode for the "standard" C type with a given name. */
15150 tree
15152 {
15184 }
15186 /* List of pointer types used to declare builtins before we have seen their
15187 real declaration.
15189 Keep the size up to date in tree.h ! */
15191 {
15198 };
15200 /* Return the maximum object size. */
15202 tree
15204 {
15205 /* To do: Make this a configurable parameter. */
15207 }
15209 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15210 parameter default to false and that weeds out error_mark_node. */
15212 bool
15215 {
15222 }
15224 #if CHECKING_P
15228 /* Selftests for tree. */
15230 /* Verify that integer constants are sane. */
15232 static void
15234 {
15247 }
15249 /* Verify identifiers. */
15251 static void
15253 {
15257 }
15259 /* Verify LABEL_DECL. */
15261 static void
15263 {
15269 }
15271 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15272 are given by VALS. */
15274 static tree
15276 {
15281 }
15283 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15285 static void
15287 {
15293 }
15295 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15296 and that its elements match EXPECTED. */
15298 static void
15301 {
15308 }
15310 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15311 and NPATTERNS background elements, and that its elements match
15312 EXPECTED. */
15314 static void
15317 {
15324 }
15326 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15327 and that its elements match EXPECTED. */
15329 static void
15332 {
15339 }
15341 /* Test the creation of VECTOR_CSTs. */
15343 static void
15345 {
15351 /* Test a simple linear series with a base of 0 and a step of 1:
15352 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15358 /* Try the same with the first element replaced by 100:
15359 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15364 /* Try a series that wraps around.
15365 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15371 /* Try a downward series:
15372 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15378 /* Try two interleaved series with different bases and steps:
15379 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15382 {
15385 }
15389 /* Try a duplicated value:
15390 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15396 /* Try an interleaved duplicated value:
15397 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15404 /* Try a duplicated value with 2 exceptions
15405 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15411 /* Try with and without a step
15412 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15418 /* Try a fully-general constant:
15419 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15423 }
15425 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15426 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15427 modifying its argument in-place. */
15429 static void
15431 {
15434 }
15436 /* Verify location wrappers. */
15438 static void
15440 {
15445 /* Wrapping a constant. */
15455 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15458 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15463 /* Wrapping a STRING_CST. */
15475 /* Wrapping a variable. */
15478 integer_type_node);
15487 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15488 wrapper. */
15493 /* Verify that STRIP_NOPS removes wrappers. */
15497 }
15499 /* Test various tree predicates. Verify that location wrappers don't
15500 affect the results. */
15502 static void
15504 {
15505 /* Build various constants and wrappers around them. */
15533 /* TODO: vector constants. */
15535 /* Test integer_onep. */
15555 /* Test integer_zerop. */
15575 /* Test integer_all_onesp. */
15595 /* Test integer_minus_onep. */
15615 /* Test integer_each_onep. */
15635 /* Test integer_truep. */
15655 /* Test integer_nonzerop. */
15675 /* Test real_zerop. */
15695 /* Test real_onep. */
15715 /* Test real_minus_onep. */
15735 /* Test zerop. */
15755 /* Test tree_expr_nonnegative_p. */
15775 /* Test tree_expr_nonzero_p. */
15783 /* Test integer_valued_real_p. */
15790 /* Test integer_pow2p. */
15795 /* Test uniform_integer_cst_p. */
15814 }
15816 /* Check that string escaping works correctly. */
15818 static void
15820 {
15822 escaped_string msg;
15825 /* ASSERT_STREQ does not accept NULL as a valid test
15826 result, so we have to use ASSERT_EQ instead. */
15835 /* Ensure that we have -fmessage-length set to 0. */
15845 /* Now repeat the tests with -fmessage-length set to 5. */
15848 /* Note that the newline is not translated into an escape. */
15855 /* Restore the original message length setting. */
15857 }
15859 /* Run all of the selftests within this file. */
15861 void
15863 {
15871 }