| blob | e845fc7a00ee038b03d7a14d2b2d111f1197ac62 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
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 }
1173 }
1174 \f
1175 /* Return a new node with the same contents as NODE except that its
1176 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1178 tree
1180 {
1181 tree t;
1198 {
1201 else
1202 {
1206 }
1209 {
1212 }
1213 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1215 {
1218 }
1220 {
1223 }
1225 {
1228 }
1229 }
1231 {
1233 /* The following is so that the debug code for
1234 the copy is different from the original type.
1235 The two statements usually duplicate each other
1236 (because they clear fields of the same union),
1237 but the optimizer should catch that. */
1241 /* Do not copy the values cache. */
1243 {
1246 }
1247 }
1249 {
1253 }
1255 {
1259 }
1262 }
1264 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1265 For example, this can copy a list made of TREE_LIST nodes. */
1267 tree
1269 {
1270 tree head;
1279 {
1283 }
1285 }
1287 \f
1288 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1289 INTEGER_CST with value CST and type TYPE. */
1291 static unsigned int
1293 {
1295 /* We need extra HWIs if CST is an unsigned integer with its
1296 upper bit set. */
1300 }
1302 /* Return a new INTEGER_CST with value CST and type TYPE. */
1304 static tree
1306 {
1312 {
1318 }
1321 {
1322 len--;
1326 }
1332 }
1334 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1336 static tree
1338 CXX_MEM_STAT_INFO)
1339 {
1351 }
1353 /* Create a constant tree that contains CST sign-extended to TYPE. */
1355 tree
1357 {
1358 /* Support legacy code. */
1363 }
1365 /* Create a constant tree that contains CST zero-extended to TYPE. */
1367 tree
1369 {
1371 }
1373 /* Create a constant tree that contains CST sign-extended to TYPE. */
1375 tree
1377 {
1380 }
1382 /* Constructs tree in type TYPE from with value given by CST. Signedness
1383 of CST is assumed to be the same as the signedness of TYPE. */
1385 tree
1387 {
1389 }
1391 /* We force the wide_int CST to the range of the type TYPE by sign or
1392 zero extending it. OVERFLOWABLE indicates if we are interested in
1393 overflow of the value, when >0 we are only interested in signed
1394 overflow, for <0 we are interested in any overflow. OVERFLOWED
1395 indicates whether overflow has already occurred. CONST_OVERFLOWED
1396 indicates whether constant overflow has already occurred. We force
1397 T's value to be within range of T's type (by setting to 0 or 1 all
1398 the bits outside the type's range). We set TREE_OVERFLOWED if,
1399 OVERFLOWED is nonzero,
1400 or OVERFLOWABLE is >0 and signed overflow occurs
1401 or OVERFLOWABLE is <0 and any overflow occurs
1402 We return a new tree node for the extended wide_int. The node
1403 is shared if no overflow flags are set. */
1406 tree
1409 {
1412 /* If we need to set overflow flags, return a new unshared node. */
1414 {
1418 {
1420 sign);
1421 tree t;
1424 else
1425 {
1428 {
1431 }
1433 }
1436 }
1437 }
1439 /* Else build a shared node. */
1441 }
1443 /* These are the hash table functions for the hash table of INTEGER_CST
1444 nodes of a sizetype. */
1446 /* Return the hash code X, an INTEGER_CST. */
1448 hashval_t
1450 {
1459 }
1461 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1462 is the same as that given by *Y, which is the same. */
1464 bool
1466 {
1480 }
1482 /* Create an INT_CST node of TYPE and value CST.
1483 The returned node is always shared. For small integers we use a
1484 per-type vector cache, for larger ones we use a single hash table.
1485 The value is extended from its precision according to the sign of
1486 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1487 the upper bits and ensures that hashing and value equality based
1488 upon the underlying HOST_WIDE_INTs works without masking. */
1490 static tree
1492 {
1493 tree t;
1501 /* Verify that everything is canonical. */
1504 {
1509 }
1515 {
1516 /* We just need to store a single HOST_WIDE_INT. */
1517 HOST_WIDE_INT hwi;
1520 else
1524 {
1527 /* Fallthru. */
1531 /* Cache NULL pointer and zero bounds. */
1533 {
1536 }
1540 /* Cache false or true. */
1549 {
1550 /* Cache [0, N). */
1554 }
1555 else
1556 {
1557 /* Cache [-1, N). */
1561 }
1569 }
1572 {
1573 /* Look for it in the type's vector of small shared ints. */
1575 {
1578 }
1582 /* Make sure no one is clobbering the shared constant. */
1588 else
1589 {
1590 /* Create a new shared int. */
1593 }
1594 }
1595 else
1596 {
1597 /* Use the cache of larger shared ints, using int_cst_node as
1598 a temporary. */
1606 {
1607 /* Insert this one into the hash table. */
1610 /* Make a new node for next time round. */
1612 }
1613 }
1614 }
1615 else
1616 {
1617 /* The value either hashes properly or we drop it on the floor
1618 for the gc to take care of. There will not be enough of them
1619 to worry about. */
1625 {
1626 /* Insert this one into the hash table. */
1629 }
1630 else
1632 }
1635 }
1637 hashval_t
1639 {
1647 }
1649 bool
1651 {
1658 }
1660 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1661 The elements must also have type TYPE. */
1663 tree
1665 {
1676 INSERT);
1678 {
1683 }
1685 }
1687 /* Create a constant tree with value VALUE in type TYPE. */
1689 tree
1691 {
1695 }
1697 void
1699 {
1708 {
1711 /* Fallthru. */
1715 /* Cache NULL pointer. */
1717 {
1720 }
1724 /* Cache false or true. */
1733 {
1734 /* Cache 0..N */
1737 /* This is a little hokie, but if the prec is smaller than
1738 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1739 obvious test will not get the correct answer. */
1741 {
1744 }
1747 }
1748 else
1749 {
1750 /* Cache -1..N */
1756 {
1758 {
1761 }
1764 }
1765 }
1773 }
1776 {
1777 /* Look for it in the type's vector of small shared ints. */
1779 {
1782 }
1786 }
1787 else
1788 {
1789 /* Use the cache of larger shared ints. */
1791 /* If there is already an entry for the number verify it's the
1792 same. */
1795 else
1796 /* Otherwise insert this one into the hash table. */
1798 }
1799 }
1802 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1803 and the rest are zeros. */
1805 tree
1807 {
1812 }
1814 /* Checks that X is integer constant that can be expressed in (unsigned)
1815 HOST_WIDE_INT without loss of precision. */
1817 bool
1819 {
1822 }
1824 /* Build a newly constructed VECTOR_CST with the given values of
1825 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1827 tree
1830 {
1832 tree t;
1848 }
1850 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1851 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1853 tree
1855 {
1857 tree value;
1859 /* We can't construct a VECTOR_CST for a variable number of elements. */
1863 {
1865 {
1866 /* If NELTS is constant then this must be too. */
1870 }
1871 else
1873 }
1878 }
1880 /* Build a vector of type VECTYPE where all the elements are SCs. */
1881 tree
1883 {
1889 /* Verify that the vector type is suitable for SC. Note that there
1890 is some inconsistency in the type-system with respect to restrict
1891 qualifications of pointers. Vector types always have a main-variant
1892 element type and the qualification is applied to the vector-type.
1893 So TREE_TYPE (vector-type) does not return a properly qualified
1894 vector element-type. */
1899 {
1903 }
1906 else
1907 {
1913 }
1914 }
1916 /* If TYPE is not a vector type, just return SC, otherwise return
1917 build_vector_from_val (TYPE, SC). */
1919 tree
1921 {
1926 }
1928 /* Build a vector series of type TYPE in which element I has the value
1929 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1930 and a VEC_SERIES_EXPR otherwise. */
1932 tree
1934 {
1938 {
1948 }
1950 }
1952 /* Return a vector with the same number of units and number of bits
1953 as VEC_TYPE, but in which the elements are a linear series of unsigned
1954 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1956 tree
1958 {
1963 {
1964 index_elt_type = build_nonstandard_integer_type
1967 }
1973 }
1975 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
1976 elements are A and the rest are B. */
1978 tree
1980 {
1983 /* Optimize the constant case. */
1990 }
1992 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1993 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1995 void
1997 {
1999 tree val;
2005 {
2006 /* Mostly ctors will have elts that don't have side-effects, so
2007 the usual case is to scan all the elements. Hence a single
2008 loop for both const and side effects, rather than one loop
2009 each (with early outs). */
2014 }
2018 }
2020 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2021 CONSTRUCTOR C. */
2023 void
2025 {
2027 tree val;
2033 {
2038 }
2039 }
2041 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2042 are in the vec pointed to by VALS. */
2043 tree
2045 {
2054 }
2056 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2057 INDEX and VALUE. */
2058 tree
2060 {
2068 }
2071 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2072 are in a list pointed to by VALS. */
2073 tree
2075 {
2076 tree t;
2080 {
2084 }
2087 }
2089 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2090 of elements, provided as index/value pairs. */
2092 tree
2094 {
2101 {
2105 }
2108 }
2110 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2112 tree
2114 {
2118 }
2120 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2122 tree
2124 {
2125 tree v;
2135 }
2137 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2139 tree
2141 {
2142 tree v;
2146 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2147 Consider doing it via real_convert now. */
2157 }
2159 /* Like build_real, but first truncate D to the type. */
2161 tree
2163 {
2165 }
2167 /* Return a new REAL_CST node whose type is TYPE
2168 and whose value is the integer value of the INTEGER_CST node I. */
2170 REAL_VALUE_TYPE
2172 {
2173 REAL_VALUE_TYPE d;
2175 /* Clear all bits of the real value type so that we can later do
2176 bitwise comparisons to see if two values are the same. */
2182 }
2184 /* Given a tree representing an integer constant I, return a tree
2185 representing the same value as a floating-point constant of type TYPE. */
2187 tree
2189 {
2190 tree v;
2197 }
2199 /* Return a newly constructed STRING_CST node whose value is
2200 the LEN characters at STR.
2201 Note that for a C string literal, LEN should include the trailing NUL.
2202 The TREE_TYPE is not initialized. */
2204 tree
2206 {
2207 tree s;
2210 /* Do not waste bytes provided by padding of struct tree_string. */
2225 }
2227 /* Return a newly constructed COMPLEX_CST node whose value is
2228 specified by the real and imaginary parts REAL and IMAG.
2229 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2230 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2232 tree
2234 {
2245 }
2247 /* Build a complex (inf +- 0i), such as for the result of cproj.
2248 TYPE is the complex tree type of the result. If NEG is true, the
2249 imaginary zero is negative. */
2251 tree
2253 {
2260 }
2262 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2263 element is set to 1. In particular, this is 1 + i for complex types. */
2265 tree
2267 {
2269 {
2272 }
2273 else
2275 }
2277 /* Return a constant of arithmetic type TYPE which is the
2278 multiplicative identity of the set TYPE. */
2280 tree
2282 {
2284 {
2294 /* We can only generate 1 for accum types. */
2299 {
2303 }
2312 }
2313 }
2315 /* Return an integer of type TYPE containing all 1's in as much precision as
2316 it contains, or a complex or vector whose subparts are such integers. */
2318 tree
2320 {
2322 {
2325 }
2326 else
2328 }
2330 /* Return a constant of arithmetic type TYPE which is the
2331 opposite of the multiplicative identity of the set TYPE. */
2333 tree
2335 {
2337 {
2347 /* We can only generate 1 for accum types. */
2354 {
2358 }
2367 }
2368 }
2370 /* Build 0 constant of type TYPE. This is used by constructor folding
2371 and thus the constant should be represented in memory by
2372 zero(es). */
2374 tree
2376 {
2378 {
2391 {
2395 }
2398 {
2402 }
2408 }
2409 }
2412 /* Build a BINFO with LEN language slots. */
2414 tree
2416 {
2417 tree t;
2432 }
2434 /* Create a CASE_LABEL_EXPR tree node and return it. */
2436 tree
2438 {
2450 }
2452 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2453 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2454 The latter determines the length of the HOST_WIDE_INT vector. */
2456 tree
2458 {
2459 tree t;
2471 /* to_offset can only be applied to trees that are offset_int-sized
2472 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2473 must be exactly the precision of offset_int and so LEN is correct. */
2476 else
2482 }
2484 /* Build a newly constructed TREE_VEC node of length LEN. */
2486 tree
2488 {
2489 tree t;
2500 }
2502 /* Grow a TREE_VEC node to new length LEN. */
2504 tree
2506 {
2522 }
2523 \f
2524 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2525 fixed, and scalar, complex or vector. */
2527 bool
2529 {
2533 }
2535 /* Return 1 if EXPR is the integer constant zero or a complex constant
2536 of zero, or a location wrapper for such a constant. */
2538 bool
2540 {
2544 {
2556 }
2557 }
2559 /* Return 1 if EXPR is the integer constant one or the corresponding
2560 complex constant, or a location wrapper for such a constant. */
2562 bool
2564 {
2568 {
2580 }
2581 }
2583 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2584 return 1 if every piece is the integer constant one.
2585 Also return 1 for location wrappers for such a constant. */
2587 bool
2589 {
2595 else
2597 }
2599 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2600 it contains, or a complex or vector whose subparts are such integers,
2601 or a location wrapper for such a constant. */
2603 bool
2605 {
2623 }
2625 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2626 for such a constant. */
2628 bool
2630 {
2636 else
2638 }
2640 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2641 one bit on), or a location wrapper for such a constant. */
2643 bool
2645 {
2657 }
2659 /* Return 1 if EXPR is an integer constant other than zero or a
2660 complex constant other than zero, or a location wrapper for such a
2661 constant. */
2663 bool
2665 {
2673 }
2675 /* Return 1 if EXPR is the integer constant one. For vector,
2676 return 1 if every piece is the integer constant minus one
2677 (representing the value TRUE).
2678 Also return 1 for location wrappers for such a constant. */
2680 bool
2682 {
2688 }
2690 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2691 for such a constant. */
2693 bool
2695 {
2700 }
2702 /* Return the power of two represented by a tree node known to be a
2703 power of two. */
2705 int
2707 {
2712 }
2714 /* Similar, but return the largest integer Y such that 2 ** Y is less
2715 than or equal to EXPR. */
2717 int
2719 {
2724 }
2726 /* Return number of known trailing zero bits in EXPR, or, if the value of
2727 EXPR is known to be zero, the precision of it's type. */
2729 unsigned int
2731 {
2738 {
2759 /* Second operand is sizetype, which could be in theory
2760 wider than pointer's precision. Make sure we never
2761 return more than prec. */
2776 {
2779 }
2784 {
2789 }
2798 {
2801 {
2806 }
2807 }
2809 CASE_CONVERT:
2827 {
2830 }
2834 }
2835 }
2837 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2838 decimal float constants, so don't return 1 for them.
2839 Also return 1 for location wrappers around such a constant. */
2841 bool
2843 {
2847 {
2855 {
2856 /* Don't simply check for a duplicate because the predicate
2857 accepts both +0.0 and -0.0. */
2863 }
2866 }
2867 }
2869 /* Return 1 if EXPR is the real constant one in real or complex form.
2870 Trailing zeroes matter for decimal float constants, so don't return
2871 1 for them.
2872 Also return 1 for location wrappers around such a constant. */
2874 bool
2876 {
2880 {
2893 }
2894 }
2896 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2897 matter for decimal float constants, so don't return 1 for them.
2898 Also return 1 for location wrappers around such a constant. */
2900 bool
2902 {
2906 {
2919 }
2920 }
2922 /* Nonzero if EXP is a constant or a cast of a constant. */
2924 bool
2926 {
2927 /* This is not quite the same as STRIP_NOPS. It does more. */
2932 }
2934 /* Return true if T holds a polynomial pointer difference, storing it in
2935 *VALUE if so. A true return means that T's precision is no greater
2936 than 64 bits, which is the largest address space we support, so *VALUE
2937 never loses precision. However, the signedness of the result does
2938 not necessarily match the signedness of T: sometimes an unsigned type
2939 like sizetype is used to encode a value that is actually negative. */
2941 bool
2943 {
2947 {
2952 }
2954 {
2961 }
2963 }
2965 poly_int64
2967 {
2972 }
2974 poly_uint64
2976 {
2981 }
2982 \f
2983 /* Return first list element whose TREE_VALUE is ELEM.
2984 Return 0 if ELEM is not in LIST. */
2986 tree
2988 {
2990 {
2994 }
2996 }
2998 /* Return first list element whose TREE_PURPOSE is ELEM.
2999 Return 0 if ELEM is not in LIST. */
3001 tree
3003 {
3005 {
3009 }
3011 }
3013 /* Return true if ELEM is in V. */
3015 bool
3017 {
3019 tree t;
3024 }
3026 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3027 NULL_TREE. */
3029 tree
3031 {
3035 }
3037 /* Return nonzero if ELEM is part of the chain CHAIN. */
3039 bool
3041 {
3043 {
3047 }
3050 }
3052 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3053 We expect a null pointer to mark the end of the chain.
3054 This is the Lisp primitive `length'. */
3056 int
3058 {
3060 #ifdef ENABLE_TREE_CHECKING
3062 #endif
3066 {
3068 #ifdef ENABLE_TREE_CHECKING
3072 #endif
3073 len++;
3074 }
3077 }
3079 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3080 UNION_TYPE TYPE, or NULL_TREE if none. */
3082 tree
3084 {
3089 }
3091 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3092 by modifying the last node in chain 1 to point to chain 2.
3093 This is the Lisp primitive `nconc'. */
3095 tree
3097 {
3098 tree t1;
3109 #ifdef ENABLE_TREE_CHECKING
3110 {
3111 tree t2;
3114 }
3115 #endif
3118 }
3120 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3122 tree
3124 {
3125 tree next;
3130 }
3132 /* Reverse the order of elements in the chain T,
3133 and return the new head of the chain (old last element). */
3135 tree
3137 {
3140 {
3141 /* We shouldn't be using this function to reverse BLOCK chains; we
3142 have blocks_nreverse for that. */
3147 }
3149 }
3150 \f
3151 /* Return a newly created TREE_LIST node whose
3152 purpose and value fields are PARM and VALUE. */
3154 tree
3156 {
3161 }
3163 /* Build a chain of TREE_LIST nodes from a vector. */
3165 tree
3167 {
3171 tree t;
3173 {
3176 }
3178 }
3180 /* Return a newly created TREE_LIST node whose
3181 purpose and value fields are PURPOSE and VALUE
3182 and whose TREE_CHAIN is CHAIN. */
3184 tree
3186 {
3187 tree node;
3199 }
3201 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3202 trees. */
3206 {
3210 tree val;
3216 }
3217 \f
3218 /* Return the size nominally occupied by an object of type TYPE
3219 when it resides in memory. The value is measured in units of bytes,
3220 and its data type is that normally used for type sizes
3221 (which is the first type created by make_signed_type or
3222 make_unsigned_type). */
3224 tree
3226 {
3227 tree t;
3236 {
3239 }
3242 }
3244 /* Return the size of TYPE (in bytes) as a wide integer
3245 or return -1 if the size can vary or is larger than an integer. */
3247 HOST_WIDE_INT
3249 {
3250 tree t;
3260 else
3262 }
3264 /* Return the maximum size of TYPE (in bytes) as a wide integer
3265 or return -1 if the size can vary or is larger than an integer. */
3267 HOST_WIDE_INT
3269 {
3271 tree size_tree;
3273 /* If this is an array type, check for a possible MAX_SIZE attached. */
3276 {
3281 }
3283 /* If we still haven't been able to get a size, see if the language
3284 can compute a maximum size. */
3287 {
3292 }
3295 }
3296 \f
3297 /* Return the bit position of FIELD, in bits from the start of the record.
3298 This is a tree of type bitsizetype. */
3300 tree
3302 {
3305 }
3306 \f
3307 /* Return the byte position of FIELD, in bytes from the start of the record.
3308 This is a tree of type sizetype. */
3310 tree
3312 {
3315 }
3317 /* Likewise, but return as an integer. It must be representable in
3318 that way (since it could be a signed value, we don't have the
3319 option of returning -1 like int_size_in_byte can. */
3321 HOST_WIDE_INT
3323 {
3325 }
3326 \f
3327 /* Return the strictest alignment, in bits, that T is known to have. */
3329 unsigned int
3331 {
3335 {
3337 /* If we have conversions, we know that the alignment of the
3338 object must meet each of the alignments of the types. */
3346 /* These don't change the alignment of an object. */
3350 /* The best we can do is say that the alignment is the least aligned
3351 of the two arms. */
3356 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3357 meaningfully, it's always 1. */
3366 }
3368 /* Otherwise take the alignment from that of the type. */
3370 }
3371 \f
3372 /* Return, as a tree node, the number of elements for TYPE (which is an
3373 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3375 tree
3377 {
3380 /* If they did it with unspecified bounds, then we should have already
3381 given an error about it before we got here. */
3389 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3394 ? max
3396 }
3397 \f
3398 /* If arg is static -- a reference to an object in static storage -- then
3399 return the object. This is not the same as the C meaning of `static'.
3400 If arg isn't static, return NULL. */
3402 tree
3404 {
3406 {
3408 /* Nested functions are static, even though taking their address will
3409 involve a trampoline as we unnest the nested function and create
3410 the trampoline on the tree level. */
3431 /* If the thing being referenced is not a field, then it is
3432 something language specific. */
3435 /* If we are referencing a bitfield, we can't evaluate an
3436 ADDR_EXPR at compile time and so it isn't a constant. */
3453 else
3461 }
3462 }
3464 \f
3467 /* Return whether OP is a DECL whose address is function-invariant. */
3469 bool
3471 {
3472 /* The conditions below are slightly less strict than the one in
3473 staticp. */
3476 {
3499 }
3502 }
3504 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3506 bool
3508 {
3509 /* The conditions below are slightly less strict than the one in
3510 staticp. */
3513 {
3533 }
3536 }
3539 /* Return true if T is function-invariant (internal function, does
3540 not handle arithmetic; that's handled in skip_simple_arithmetic and
3541 tree_invariant_p). */
3543 static bool
3545 {
3546 tree op;
3553 {
3560 {
3562 {
3577 }
3579 }
3585 }
3588 }
3590 /* Return true if T is function-invariant. */
3592 bool
3594 {
3597 }
3599 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3600 Do this to any expression which may be used in more than one place,
3601 but must be evaluated only once.
3603 Normally, expand_expr would reevaluate the expression each time.
3604 Calling save_expr produces something that is evaluated and recorded
3605 the first time expand_expr is called on it. Subsequent calls to
3606 expand_expr just reuse the recorded value.
3608 The call to expand_expr that generates code that actually computes
3609 the value is the first call *at compile time*. Subsequent calls
3610 *at compile time* generate code to use the saved value.
3611 This produces correct result provided that *at run time* control
3612 always flows through the insns made by the first expand_expr
3613 before reaching the other places where the save_expr was evaluated.
3614 You, the caller of save_expr, must make sure this is so.
3616 Constants, and certain read-only nodes, are returned with no
3617 SAVE_EXPR because that is safe. Expressions containing placeholders
3618 are not touched; see tree.def for an explanation of what these
3619 are used for. */
3621 tree
3623 {
3624 tree inner;
3626 /* If the tree evaluates to a constant, then we don't want to hide that
3627 fact (i.e. this allows further folding, and direct checks for constants).
3628 However, a read-only object that has side effects cannot be bypassed.
3629 Since it is no problem to reevaluate literals, we just return the
3630 literal node. */
3638 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3639 it means that the size or offset of some field of an object depends on
3640 the value within another field.
3642 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3643 and some variable since it would then need to be both evaluated once and
3644 evaluated more than once. Front-ends must assure this case cannot
3645 happen by surrounding any such subexpressions in their own SAVE_EXPR
3646 and forcing evaluation at the proper time. */
3652 /* This expression might be placed ahead of a jump to ensure that the
3653 value was computed on both sides of the jump. So make sure it isn't
3654 eliminated as dead. */
3657 }
3659 /* Look inside EXPR into any simple arithmetic operations. Return the
3660 outermost non-arithmetic or non-invariant node. */
3662 tree
3664 {
3665 /* We don't care about whether this can be used as an lvalue in this
3666 context. */
3670 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3671 a constant, it will be more efficient to not make another SAVE_EXPR since
3672 it will allow better simplification and GCSE will be able to merge the
3673 computations if they actually occur. */
3675 {
3679 {
3684 else
3686 }
3687 else
3689 }
3692 }
3694 /* Look inside EXPR into simple arithmetic operations involving constants.
3695 Return the outermost non-arithmetic or non-constant node. */
3697 tree
3699 {
3704 {
3708 {
3713 else
3715 }
3716 else
3718 }
3721 }
3723 /* Return which tree structure is used by T. */
3725 enum tree_node_structure_enum
3727 {
3730 }
3732 /* Set various status flags when building a CALL_EXPR object T. */
3734 static void
3736 {
3741 /* Calls have side-effects, except those to const or pure functions. */
3744 /* Propagate TREE_READONLY of arguments for const functions. */
3750 {
3756 }
3760 }
3761 \f
3762 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3763 size or offset that depends on a field within a record. */
3765 bool
3767 {
3778 {
3780 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3781 position computations since they will be converted into a
3782 WITH_RECORD_EXPR involving the reference, which will assume
3783 here will be valid. */
3797 {
3799 /* Ignoring the first operand isn't quite right, but works best. */
3808 /* The save_expr function never wraps anything containing
3809 a PLACEHOLDER_EXPR. */
3814 }
3817 {
3825 }
3829 {
3831 {
3832 const_tree arg;
3833 const_call_expr_arg_iterator iter;
3838 }
3841 }
3845 }
3847 }
3849 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3850 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3851 field positions. */
3853 static bool
3855 {
3856 /* If the size contains a placeholder or the parent type (component type in
3857 the case of arrays) type involves a placeholder, this type does. */
3865 /* Now do type-specific checks. Note that the last part of the check above
3866 greatly limits what we have to do below. */
3868 {
3885 /* Here we just check the bounds. */
3890 /* We have already checked the component type above, so just check
3891 the domain type. Flexible array members have a null domain. */
3898 {
3899 tree field;
3910 }
3914 }
3915 }
3917 /* Wrapper around above function used to cache its result. */
3919 bool
3921 {
3924 /* If the contains_placeholder_bits field has been initialized,
3925 then we know the answer. */
3929 /* Indicate that we've seen this type node, and the answer is false.
3930 This is what we want to return if we run into recursion via fields. */
3933 /* Compute the real value. */
3936 /* Store the real value. */
3940 }
3941 \f
3942 /* Push tree EXP onto vector QUEUE if it is not already present. */
3944 static void
3946 {
3948 tree iter;
3956 }
3958 /* Given a tree EXP, find all occurrences of references to fields
3959 in a PLACEHOLDER_EXPR and place them in vector REFS without
3960 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3961 we assume here that EXP contains only arithmetic expressions
3962 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3963 argument list. */
3965 void
3967 {
3969 tree inner;
3972 /* We handle TREE_LIST and COMPONENT_REF separately. */
3974 {
3977 }
3979 {
3983 ;
3987 else
3989 }
3990 else
3992 {
3997 /* Variables allocated to static storage can stay. */
4003 /* This is the pattern built in ada/make_aligning_type. */
4006 {
4009 }
4011 /* Fall through. */
4029 }
4030 }
4032 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4033 return a tree with all occurrences of references to F in a
4034 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4035 CONST_DECLs. Note that we assume here that EXP contains only
4036 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4037 occurring only in their argument list. */
4039 tree
4041 {
4044 tree new_tree;
4046 /* We handle TREE_LIST and COMPONENT_REF separately. */
4048 {
4055 }
4057 {
4058 tree inner;
4060 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4061 and it is the right field, replace it with R. */
4065 ;
4067 /* The field. */
4073 /* If this expression hasn't been completed let, leave it alone. */
4081 new_tree
4083 }
4084 else
4086 {
4093 else
4100 /* Fall through. */
4108 {
4153 new_tree
4159 }
4163 {
4168 /* If we are trying to replace F with a constant or with another
4169 instance of one of the arguments of the call, inline back
4170 functions which do nothing else than computing a value from
4171 the arguments they are passed. This makes it possible to
4172 fold partially or entirely the replacement expression. */
4174 {
4178 else
4181 {
4184 }
4186 {
4190 }
4191 }
4194 {
4198 {
4202 }
4203 }
4206 {
4210 }
4211 else
4213 }
4218 }
4226 }
4228 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4229 for it within OBJ, a tree that is an object or a chain of references. */
4231 tree
4233 {
4236 tree new_tree;
4238 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4239 in the chain of OBJ. */
4241 {
4243 tree elt;
4273 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4274 survives until RTL generation, there will be an error. */
4276 }
4278 /* TREE_LIST is special because we need to look at TREE_VALUE
4279 and TREE_CHAIN, not TREE_OPERANDS. */
4281 {
4288 }
4289 else
4291 {
4304 {
4349 new_tree
4355 }
4359 {
4365 {
4369 {
4373 }
4374 }
4377 {
4381 }
4382 else
4384 }
4389 }
4397 }
4398 \f
4400 /* Subroutine of stabilize_reference; this is called for subtrees of
4401 references. Any expression with side-effects must be put in a SAVE_EXPR
4402 to ensure that it is only evaluated once.
4404 We don't put SAVE_EXPR nodes around everything, because assigning very
4405 simple expressions to temporaries causes us to miss good opportunities
4406 for optimizations. Among other things, the opportunity to fold in the
4407 addition of a constant into an addressing mode often gets lost, e.g.
4408 "y[i+1] += x;". In general, we take the approach that we should not make
4409 an assignment unless we are forced into it - i.e., that any non-side effect
4410 operator should be allowed, and that cse should take care of coalescing
4411 multiple utterances of the same expression should that prove fruitful. */
4413 static tree
4415 {
4416 tree result;
4419 /* We cannot ignore const expressions because it might be a reference
4420 to a const array but whose index contains side-effects. But we can
4421 ignore things that are actual constant or that already have been
4422 handled by this function. */
4428 {
4430 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4431 have side-effects. */
4434 /* FALLTHRU */
4442 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4443 so that it will only be evaluated once. */
4444 /* The reference (r) and comparison (<) classes could be handled as
4445 below, but it is generally faster to only evaluate them once. */
4451 /* Constants need no processing. In fact, we should never reach
4452 here. */
4456 /* Division is slow and tends to be compiled with jumps,
4457 especially the division by powers of 2 that is often
4458 found inside of an array reference. So do it just once. */
4464 /* Recursively stabilize each operand. */
4470 /* Recursively stabilize each operand. */
4476 }
4484 }
4486 /* Stabilize a reference so that we can use it any number of times
4487 without causing its operands to be evaluated more than once.
4488 Returns the stabilized reference. This works by means of save_expr,
4489 so see the caveats in the comments about save_expr.
4491 Also allows conversion expressions whose operands are references.
4492 Any other kind of expression is returned unchanged. */
4494 tree
4496 {
4497 tree result;
4501 {
4505 /* No action is needed in this case. */
4508 CASE_CONVERT:
4547 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4548 it wouldn't be ignored. This matters when dealing with
4549 volatiles. */
4552 /* If arg isn't a kind of lvalue we recognize, make no change.
4553 Caller should recognize the error for an invalid lvalue. */
4559 }
4567 }
4568 \f
4569 /* Low-level constructors for expressions. */
4571 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4572 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4574 void
4576 {
4577 tree node;
4582 /* We started out assuming this address is both invariant and constant, but
4583 does not have side effects. Now go down any handled components and see if
4584 any of them involve offsets that are either non-constant or non-invariant.
4585 Also check for side-effects.
4587 ??? Note that this code makes no attempt to deal with the case where
4588 taking the address of something causes a copy due to misalignment. */
4590 #define UPDATE_FLAGS(NODE) \
4591 do { tree _node = (NODE); \
4592 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4593 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4597 {
4598 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4599 array reference (probably made temporarily by the G++ front end),
4600 so ignore all the operands. */
4604 {
4610 }
4611 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4612 FIELD_DECL, apparently. The G++ front end can put something else
4613 there, at least temporarily. */
4616 {
4619 }
4620 }
4624 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4625 the address, since &(*a)->b is a form of addition. If it's a constant, the
4626 address is constant too. If it's a decl, its address is constant if the
4627 decl is static. Everything else is not constant and, furthermore,
4628 taking the address of a volatile variable is not volatile. */
4633 ;
4636 else
4637 {
4640 }
4645 #undef UPDATE_FLAGS
4646 }
4648 /* Build an expression of code CODE, data type TYPE, and operands as
4649 specified. Expressions and reference nodes can be created this way.
4650 Constants, decls, types and misc nodes cannot be.
4652 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4653 enough for all extant tree codes. */
4655 tree
4657 {
4658 tree t;
4666 }
4668 tree
4670 {
4672 tree t;
4688 {
4691 }
4694 {
4697 }
4699 {
4701 /* All of these have side-effects, no matter what their
4702 operands are. */
4708 /* Whether a dereference is readonly has nothing to do with whether
4709 its operand is readonly. */
4727 }
4730 }
4732 #define PROCESS_ARG(N) \
4733 do { \
4734 TREE_OPERAND (t, N) = arg##N; \
4735 if (arg##N &&!TYPE_P (arg##N)) \
4736 { \
4737 if (TREE_SIDE_EFFECTS (arg##N)) \
4738 side_effects = 1; \
4739 if (!TREE_READONLY (arg##N) \
4740 && !CONSTANT_CLASS_P (arg##N)) \
4741 (void) (read_only = 0); \
4742 if (!TREE_CONSTANT (arg##N)) \
4743 (void) (constant = 0); \
4744 } \
4745 } while (0)
4747 tree
4749 {
4751 tree t;
4757 /* When sizetype precision doesn't match that of pointers
4758 we need to be able to build explicit extensions or truncations
4759 of the offset argument. */
4771 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4772 result based on those same flags for the arguments. But if the
4773 arguments aren't really even `tree' expressions, we shouldn't be trying
4774 to do this. */
4776 /* Expressions without side effects may be constant if their
4777 arguments are as well. */
4784 {
4798 }
4805 {
4807 {
4811 }
4812 }
4813 else
4814 {
4816 /* Don't mark X / 0 as constant. */
4821 }
4824 }
4827 tree
4829 tree arg2 MEM_STAT_DECL)
4830 {
4832 tree t;
4842 /* As a special exception, if COND_EXPR has NULL branches, we
4843 assume that it is a gimple statement and always consider
4844 it to have side effects. */
4850 else
4866 }
4868 tree
4871 {
4873 tree t;
4893 }
4895 tree
4898 {
4900 tree t;
4917 {
4919 {
4923 }
4924 }
4925 else
4931 }
4933 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4934 on the pointer PTR. */
4936 tree
4938 {
4941 tree tem;
4942 /* For convenience allow addresses that collapse to a simple base
4943 and offset. */
4947 {
4951 {
4954 }
4955 else
4958 }
4963 }
4965 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4967 poly_offset_int
4969 {
4971 SIGNED);
4972 }
4974 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4975 offsetted by OFFSET units. */
4977 tree
4979 {
4986 }
4988 /* Similar except don't specify the TREE_TYPE
4989 and leave the TREE_SIDE_EFFECTS as 0.
4990 It is permissible for arguments to be null,
4991 or even garbage if their values do not matter. */
4993 tree
4995 {
4996 tree t;
5013 }
5015 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5016 tree vec. */
5018 tree
5020 {
5030 }
5031 \f
5032 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5033 and data type TYPE.
5034 We do NOT enter this node in any sort of symbol table.
5036 LOC is the location of the decl.
5038 layout_decl is used to set up the decl's storage layout.
5039 Other slots are initialized to 0 or null pointers. */
5041 tree
5043 tree type MEM_STAT_DECL)
5044 {
5045 tree t;
5050 /* if (type == error_mark_node)
5051 type = integer_type_node; */
5052 /* That is not done, deliberately, so that having error_mark_node
5053 as the type can suppress useless errors in the use of this variable. */
5062 }
5064 /* Builds and returns function declaration with NAME and TYPE. */
5066 tree
5068 {
5078 }
5082 /* Builds a new translation-unit decl with name NAME, queues it in the
5083 global list of translation-unit decls and returns it. */
5085 tree
5087 {
5093 }
5095 \f
5096 /* BLOCK nodes are used to represent the structure of binding contours
5097 and declarations, once those contours have been exited and their contents
5098 compiled. This information is used for outputting debugging info. */
5100 tree
5102 {
5110 }
5112 \f
5113 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5115 LOC is the location to use in tree T. */
5117 void
5119 {
5122 }
5124 /* Data used when collecting DECLs and TYPEs for language data removal. */
5126 class free_lang_data_d
5127 {
5131 /* Worklist to avoid excessive recursion. */
5134 /* Set of traversed objects. Used to avoid duplicate visits. */
5137 /* Array of symbols to process with free_lang_data_in_decl. */
5140 /* Array of types to process with free_lang_data_in_type. */
5142 };
5145 /* Add type or decl T to one of the list of tree nodes that need their
5146 language data removed. The lists are held inside FLD. */
5148 static void
5150 {
5155 else
5157 }
5159 /* Push tree node T into FLD->WORKLIST. */
5163 {
5166 }
5169 \f
5170 /* Return simplified TYPE_NAME of TYPE. */
5172 static tree
5174 {
5177 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5178 TYPE_DECL if the type doesn't have linkage.
5179 this must match fld_ */
5187 }
5189 /* Do same comparsion as check_qualified_type skipping lang part of type
5190 and be more permissive about type names: we only care that names are
5191 same (for diagnostics) and that ODR names are the same.
5192 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5194 static bool
5196 {
5198 /* We want to match incomplete variants with complete types.
5199 In this case we need to ignore alignment. */
5210 }
5212 /* Find variant of FIRST that match T and create new one if necessary.
5213 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5215 static tree
5218 {
5233 /* Variants of incomplete types should have alignment
5234 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5236 {
5239 }
5246 }
5248 /* Map complete types to incomplete types. */
5252 /* Map types to simplified types. */
5256 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5257 use MAP to prevent duplicates. */
5259 static tree
5262 {
5267 {
5268 return fld_type_variant
5272 }
5275 tree &array
5278 {
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 {
5366 }
5367 else
5370 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5371 This is needed for ODR violation warnings to come out right (we
5372 want duplicate TYPE_DECLs whenever the type is duplicated because
5373 of ODR violation. Because lang data in the TYPE_DECL may not
5374 have been freed yet, rebuild it from scratch and copy relevant
5375 fields. */
5380 {
5390 }
5391 }
5393 }
5396 }
5398 /* Simplify type T for scenarios where we do not need complete pointer
5399 types. */
5401 static tree
5403 {
5408 /* FIXME: This triggers verification error, see PR88140. */
5413 }
5415 /* Reset the expression *EXPR_P, a size or position.
5417 ??? We could reset all non-constant sizes or positions. But it's cheap
5418 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5420 We need to reset self-referential sizes or positions because they cannot
5421 be gimplified and thus can contain a CALL_EXPR after the gimplification
5422 is finished, which will run afoul of LTO streaming. And they need to be
5423 reset to something essentially dummy but not constant, so as to preserve
5424 the properties of the object they are attached to. */
5428 {
5432 }
5435 /* Reset all the fields in a binfo node BINFO. We only keep
5436 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5438 static void
5440 {
5442 tree t;
5454 }
5457 /* Reset all language specific information still present in TYPE. */
5459 static void
5461 {
5464 /* Give the FE a chance to remove its own data first. */
5477 /* Purge non-marked variants from the variants chain, so that they
5478 don't reappear in the IL after free_lang_data. */
5481 {
5484 /* Turn the removed types into distinct types. */
5487 }
5490 {
5492 /* Remove the const and volatile qualifiers from arguments. The
5493 C++ front end removes them, but the C front end does not,
5494 leading to false ODR violation errors when merging two
5495 instances of the same function signature compiled by
5496 different front ends. */
5498 {
5503 {
5505 & ~TYPE_QUAL_CONST
5510 }
5511 /* C++ FE uses TREE_PURPOSE to store initial values. */
5513 }
5514 }
5516 {
5519 {
5520 /* C++ FE uses TREE_PURPOSE to store initial values. */
5523 }
5524 }
5526 {
5527 /* Remove members that are not FIELD_DECLs from the field list
5528 of an aggregate. These occur in C++. */
5532 else
5538 {
5540 /* We need to preserve link to bases and virtual table for all
5541 polymorphic types to make devirtualization machinery working. */
5544 }
5545 }
5549 {
5551 {
5552 /* Type values are used only for C++ ODR checking. Drop them
5553 for all type variants and non-ODR types.
5554 For ODR types the data is freed in free_odr_warning_data. */
5558 else
5559 /* Simplify representation by recording only values rather
5560 than const decls. */
5564 }
5567 }
5576 {
5578 do
5579 {
5581 }
5584 }
5588 }
5591 /* Return true if DECL may need an assembler name to be set. */
5595 {
5596 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5597 Rule merging. This makes type_odr_p to return true on those types during
5598 LTO and by comparing the mangled name, we can say what types are intended
5599 to be equivalent across compilation unit.
5601 We do not store names of type_in_anonymous_namespace_p.
5603 Record, union and enumeration type have linkage that allows use
5604 to check type_in_anonymous_namespace_p. We do not mangle compound types
5605 that always can be compared structurally.
5607 Similarly for builtin types, we compare properties of their main variant.
5608 A special case are integer types where mangling do make differences
5609 between char/signed char/unsigned char etc. Storing name for these makes
5610 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5611 See cp/mangle.c:write_builtin_type for details. */
5614 {
5627 }
5628 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5632 /* If DECL already has its assembler name set, it does not need a
5633 new one. */
5638 /* Abstract decls do not need an assembler name. */
5642 /* For VAR_DECLs, only static, public and external symbols need an
5643 assembler name. */
5651 {
5652 /* Do not set assembler name on builtins. Allow RTL expansion to
5653 decide whether to expand inline or via a regular call. */
5658 /* Functions represented in the callgraph need an assembler name. */
5662 /* Unused and not public functions don't need an assembler name. */
5665 }
5668 }
5671 /* Reset all language specific information still present in symbol
5672 DECL. */
5674 static void
5676 {
5679 /* Give the FE a chance to remove its own data first. */
5693 {
5698 }
5701 {
5703 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5704 the address may be taken in other unit, so this flag has no practical
5705 use for middle-end.
5707 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5708 for public objects that indeed cannot be adressed, but it is not
5709 the case. Set the flag to true so we do not get merge failures for
5710 i.e. virtual tables between units that take address of it and
5711 units that don't. */
5717 {
5720 else
5721 {
5726 }
5727 }
5729 {
5730 tree t;
5732 /* If DECL has a gimple body, then the context for its
5733 arguments must be DECL. Otherwise, it doesn't really
5734 matter, as we will not be emitting any code for DECL. In
5735 general, there may be other instances of DECL created by
5736 the front end and since PARM_DECLs are generally shared,
5737 their DECL_CONTEXT changes as the replicas of DECL are
5738 created. The only time where DECL_CONTEXT is important
5739 is for the FUNCTION_DECLs that have a gimple body (since
5740 the PARM_DECL will be used in the function's body). */
5749 }
5751 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5752 At this point, it is not needed anymore. */
5755 /* Clear the abstract origin if it refers to a method.
5756 Otherwise dwarf2out.c will ICE as we splice functions out of
5757 TYPE_FIELDS and thus the origin will not be output
5758 correctly. */
5761 && RECORD_OR_UNION_TYPE_P
5766 }
5768 {
5769 /* See comment above why we set the flag for functoins. */
5776 }
5778 {
5789 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5790 }
5792 {
5795 }
5799 {
5800 /* Strip builtins from the translation-unit BLOCK. We still have targets
5801 without builtin_decl_explicit support and also builtins are shared
5802 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5805 {
5809 else
5811 }
5812 }
5813 /* We need to keep field decls associated with their trees. Otherwise tree
5814 merging may merge some fileds and keep others disjoint wich in turn will
5815 not do well with TREE_CHAIN pointers linking them.
5817 Also do not drop containing types for virtual methods and tables because
5818 these are needed by devirtualization.
5819 C++ destructors are special because C++ frontends sometimes produces
5820 virtual destructor as an alias of non-virtual destructor. In
5821 devirutalization code we always walk through aliases and we need
5822 context to be preserved too. See PR89335 */
5829 }
5832 /* Operand callback helper for free_lang_data_in_node. *TP is the
5833 subtree operand being considered. */
5835 static tree
5837 {
5844 /* Language specific nodes will be removed, so there is no need
5845 to gather anything under them. */
5847 {
5850 }
5853 {
5854 /* Note that walk_tree does not traverse every possible field in
5855 decls, so we have to do our own traversals here. */
5863 /* We are going to remove everything under DECL_INITIAL for
5864 TYPE_DECLs. No point walking them. */
5872 {
5875 }
5877 {
5882 }
5892 }
5894 {
5895 /* Note that walk_tree does not traverse every possible field in
5896 types, so we have to do our own traversals here. */
5907 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5908 lists, we may look types up in these lists and use them while
5909 optimizing the function body. Thus we need to free lang data
5910 in them. */
5917 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5921 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5922 do not and want not to reach unused variants this way. */
5924 {
5926 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5927 So push that instead. */
5931 }
5935 {
5937 tree tem;
5942 }
5944 {
5945 tree tem;
5946 /* Push all TYPE_FIELDS - there can be interleaving interesting
5947 and non-interesting things. */
5950 {
5954 }
5955 }
5961 }
5963 {
5965 {
5969 {
5973 }
5974 else
5975 {
5978 }
5979 }
5983 }
5990 }
5993 /* Find decls and types in T. */
5995 static void
5997 {
5999 {
6005 }
6006 }
6008 /* Translate all the types in LIST with the corresponding runtime
6009 types. */
6011 static tree
6013 {
6023 {
6028 }
6031 }
6034 /* Find decls and types referenced in EH region R and store them in
6035 FLD->DECLS and FLD->TYPES. */
6037 static void
6039 {
6041 {
6046 {
6047 eh_catch c;
6049 /* The types referenced in each catch must first be changed to the
6050 EH types used at runtime. This removes references to FE types
6051 in the region. */
6053 {
6056 }
6057 }
6070 }
6071 }
6074 /* Find decls and types referenced in cgraph node N and store them in
6075 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6076 look for *every* kind of DECL and TYPE node reachable from N,
6077 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6078 NAMESPACE_DECLs, etc). */
6080 static void
6082 {
6083 basic_block bb;
6086 tree t;
6097 /* Traverse locals. */
6101 /* Traverse EH regions in FN. */
6102 {
6103 eh_region r;
6106 }
6108 /* Traverse every statement in FN. */
6110 {
6111 gphi_iterator psi;
6112 gimple_stmt_iterator si;
6116 {
6120 {
6123 }
6124 }
6127 {
6134 {
6137 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6138 which we need for asm stmts. */
6144 }
6145 }
6146 }
6147 }
6150 /* Find decls and types referenced in varpool node N and store them in
6151 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6152 look for *every* kind of DECL and TYPE node reachable from N,
6153 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6154 NAMESPACE_DECLs, etc). */
6156 static void
6158 {
6160 }
6162 /* If T needs an assembler name, have one created for it. */
6164 void
6166 {
6168 {
6169 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6170 diagnostics that use input_location to show locus
6171 information. The problem here is that, at this point,
6172 input_location is generally anchored to the end of the file
6173 (since the parser is long gone), so we don't have a good
6174 position to pin it to.
6176 To alleviate this problem, this uses the location of T's
6177 declaration. Examples of this are
6178 testsuite/g++.dg/template/cond2.C and
6179 testsuite/g++.dg/template/pr35240.C. */
6186 }
6187 }
6190 /* Free language specific information for every operand and expression
6191 in every node of the call graph. This process operates in three stages:
6193 1- Every callgraph node and varpool node is traversed looking for
6194 decls and types embedded in them. This is a more exhaustive
6195 search than that done by find_referenced_vars, because it will
6196 also collect individual fields, decls embedded in types, etc.
6198 2- All the decls found are sent to free_lang_data_in_decl.
6200 3- All the types found are sent to free_lang_data_in_type.
6202 The ordering between decls and types is important because
6203 free_lang_data_in_decl sets assembler names, which includes
6204 mangling. So types cannot be freed up until assembler names have
6205 been set up. */
6207 static void
6209 {
6212 tree t;
6216 /* Find decls and types in the body of every function in the callgraph. */
6223 /* Find decls and types in every varpool symbol. */
6227 /* Set the assembler name on every decl found. We need to do this
6228 now because free_lang_data_in_decl will invalidate data needed
6229 for mangling. This breaks mangling on interdependent decls. */
6233 /* Traverse every decl found freeing its language data. */
6237 /* Traverse every type found freeing its language data. */
6240 }
6243 /* Free resources that are used by FE but are not needed once they are done. */
6245 static unsigned
6247 {
6251 /* If we are the LTO frontend we have freed lang-specific data already. */
6254 {
6255 /* Rebuild type inheritance graph even when not doing LTO to get
6256 consistent profile data. */
6259 }
6264 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6268 /* Allocate and assign alias sets to the standard integer types
6269 while the slots are still in the way the frontends generated them. */
6274 /* Traverse the IL resetting language specific information for
6275 operands, expressions, etc. */
6278 /* Create gimple variants for common types. */
6284 /* Reset some langhooks. Do not reset types_compatible_p, it may
6285 still be used indirectly via the get_alias_set langhook. */
6298 {
6300 tree t;
6304 }
6306 /* We do not want the default decl_assembler_name implementation,
6307 rather if we have fixed everything we want a wrapper around it
6308 asserting that all non-local symbols already got their assembler
6309 name and only produce assembler names for local symbols. Or rather
6310 make sure we never call decl_assembler_name on local symbols and
6311 devise a separate, middle-end private scheme for it. */
6313 /* Reset diagnostic machinery. */
6322 }
6328 {
6338 };
6341 {
6345 {}
6347 /* opt_pass methods: */
6354 simple_ipa_opt_pass *
6356 {
6358 }
6359 \f
6360 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6361 of the various TYPE_QUAL values. */
6363 static void
6365 {
6371 }
6373 /* Returns true iff CAND and BASE have equivalent language-specific
6374 qualifiers. */
6376 bool
6378 {
6381 /* type_hash_eq currently only applies to these types. */
6386 }
6388 /* This function checks to see if TYPE matches the size one of the built-in
6389 atomic types, and returns that core atomic type. */
6391 static tree
6393 {
6394 tree base_atomic_type;
6396 /* Only handle complete types. */
6401 {
6424 }
6427 }
6429 /* Returns true iff unqualified CAND and BASE are equivalent. */
6431 bool
6433 {
6435 /* Apparently this is needed for Objective-C. */
6440 /* Check alignment. */
6443 /* Atomic types increase minimal alignment. We must to do so as well
6444 or we get duplicated canonical types. See PR88686. */
6446 {
6447 /* See if this object can map to a basic atomic type. */
6451 }
6453 }
6455 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6457 bool
6459 {
6463 }
6465 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6467 static bool
6469 {
6472 /* Apparently this is needed for Objective-C. */
6474 /* Check alignment. */
6479 }
6481 /* Return a version of the TYPE, qualified as indicated by the
6482 TYPE_QUALS, if one exists. If no qualified version exists yet,
6483 return NULL_TREE. */
6485 tree
6487 {
6495 /* Search the chain of variants to see if there is already one there just
6496 like the one we need to have. If so, use that existing one. We must
6497 preserve the TYPE_NAME, since there is code that depends on this. */
6500 {
6501 /* Put the found variant at the head of the variant list so
6502 frequently searched variants get found faster. The C++ FE
6503 benefits greatly from this. */
6509 }
6512 }
6514 /* Like get_qualified_type, but creates the type if it does not
6515 exist. This function never returns NULL_TREE. */
6517 tree
6519 {
6520 tree t;
6522 /* See if we already have the appropriate qualified variant. */
6525 /* If not, build it. */
6527 {
6532 {
6533 /* See if this object can map to a basic atomic type. */
6536 {
6537 /* Ensure the alignment of this type is compatible with
6538 the required alignment of the atomic type. */
6541 }
6542 }
6545 /* Propagate structural equality. */
6548 /* Build the underlying canonical type, since it is different
6549 from TYPE. */
6550 {
6553 }
6554 else
6555 /* T is its own canonical type. */
6558 }
6561 }
6563 /* Create a variant of type T with alignment ALIGN. */
6565 tree
6567 {
6568 tree t;
6583 }
6585 /* Create a new distinct copy of TYPE. The new type is made its own
6586 MAIN_VARIANT. If TYPE requires structural equality checks, the
6587 resulting type requires structural equality checks; otherwise, its
6588 TYPE_CANONICAL points to itself. */
6590 tree
6592 {
6598 /* Set the canonical type either to a new equivalence class, or
6599 propagate the need for structural equality checks. */
6602 else
6605 /* Make it its own variant. */
6609 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6610 whose TREE_TYPE is not t. This can also happen in the Ada
6611 frontend when using subtypes. */
6614 }
6616 /* Create a new variant of TYPE, equivalent but distinct. This is so
6617 the caller can modify it. TYPE_CANONICAL for the return type will
6618 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6619 are considered equal by the language itself (or that both types
6620 require structural equality checks). */
6622 tree
6624 {
6629 /* Since we're building a variant, assume that it is a non-semantic
6630 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6632 /* Type variants have no alias set defined. */
6635 /* Add the new type to the chain of variants of TYPE. */
6641 }
6642 \f
6643 /* Return true if the from tree in both tree maps are equal. */
6645 int
6647 {
6651 }
6653 /* Hash a from tree in a tree_base_map. */
6655 unsigned int
6657 {
6659 }
6661 /* Return true if this tree map structure is marked for garbage collection
6662 purposes. We simply return true if the from tree is marked, so that this
6663 structure goes away when the from tree goes away. */
6665 int
6667 {
6669 }
6671 /* Hash a from tree in a tree_map. */
6673 unsigned int
6675 {
6677 }
6679 /* Hash a from tree in a tree_decl_map. */
6681 unsigned int
6683 {
6685 }
6687 /* Return the initialization priority for DECL. */
6689 priority_type
6691 {
6696 return
6698 }
6700 /* Return the finalization priority for DECL. */
6702 priority_type
6704 {
6709 return
6711 }
6713 /* Set the initialization priority for DECL to PRIORITY. */
6715 void
6717 {
6721 {
6725 }
6728 else
6731 }
6733 /* Set the finalization priority for DECL to PRIORITY. */
6735 void
6737 {
6741 {
6745 }
6746 else
6749 }
6751 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6753 static void
6755 {
6760 }
6762 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6764 static void
6766 {
6771 }
6773 /* Lookup a debug expression for FROM, and return it if we find one. */
6775 tree
6777 {
6785 }
6787 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6789 void
6791 {
6798 }
6800 /* Lookup a value expression for FROM, and return it if we find one. */
6802 tree
6804 {
6812 }
6814 /* Insert a mapping FROM->TO in the value expression hashtable. */
6816 void
6818 {
6825 }
6827 /* Lookup a vector of debug arguments for FROM, and return it if we
6828 find one. */
6832 {
6843 }
6845 /* Insert a mapping FROM->empty vector of debug arguments in the value
6846 expression hashtable. */
6850 {
6865 }
6867 /* Hashing of types so that we don't make duplicates.
6868 The entry point is `type_hash_canon'. */
6870 /* Generate the default hash code for TYPE. This is designed for
6871 speed, rather than maximum entropy. */
6873 hashval_t
6875 {
6884 /* Just the identifier is adequate to distinguish. */
6888 {
6891 /* FALLTHROUGH. */
6903 {
6907 {
6910 }
6911 }
6915 {
6922 }
6926 {
6930 }
6938 }
6941 }
6943 /* These are the Hashtable callback functions. */
6945 /* Returns true iff the types are equivalent. */
6947 bool
6949 {
6950 /* First test the things that are the same for all types. */
6960 /* Be careful about comparing arrays before and after the element type
6961 has been completed; don't compare TYPE_ALIGN unless both types are
6962 complete. */
6969 {
6991 /* fall through */
7023 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7024 where the flag should be inherited from the element type
7025 and can change after ARRAY_TYPEs are created; on non-aggregates
7026 compare it and hash it, scalars will never have that flag set
7027 and we need to differentiate between arrays created by different
7028 front-ends or middle-end created arrays. */
7058 }
7064 }
7066 /* Given TYPE, and HASHCODE its hash code, return the canonical
7067 object for an identical type if one already exists.
7068 Otherwise, return TYPE, and record it as the canonical object.
7070 To use this function, first create a type of the sort you want.
7071 Then compute its hash code from the fields of the type that
7072 make it different from other similar types.
7073 Then call this function and use the value. */
7075 tree
7077 {
7078 type_hash in;
7081 /* The hash table only contains main variants, so ensure that's what we're
7082 being passed. */
7085 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7086 must call that routine before comparing TYPE_ALIGNs. */
7094 {
7100 /* Free also min/max values and the cache for integer
7101 types. This can't be done in free_node, as LTO frees
7102 those on its own. */
7104 {
7107 {
7108 /* Zero is always in TYPE_CACHED_VALUES. */
7112 }
7115 {
7118 }
7121 }
7124 }
7125 else
7126 {
7135 }
7136 }
7138 static void
7140 {
7145 }
7147 /* Given two lists of types
7148 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7149 return 1 if the lists contain the same types in the same order.
7150 Also, the TREE_PURPOSEs must match. */
7152 bool
7154 {
7166 }
7168 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7169 given by TYPE. If the argument list accepts variable arguments,
7170 then this function counts only the ordinary arguments. */
7172 int
7174 {
7178 /* If the function does not take a variable number of arguments,
7179 the last element in the list will have type `void'. */
7182 else
7186 }
7188 /* Return the type of the function TYPE's argument ARGNO if known.
7189 For vararg function's where ARGNO refers to one of the variadic
7190 arguments return null. Otherwise, return a void_type_node for
7191 out-of-bounds ARGNO. */
7193 tree
7195 {
7196 /* Treat zero the same as an out-of-bounds argument number. */
7200 function_args_iterator iter;
7202 tree argtype;
7205 {
7206 /* A vararg function's argument list ends in a null. Otherwise,
7207 an ordinary function's argument list ends with void. Return
7208 null if ARGNO refers to a vararg argument, void_type_node if
7209 it's out of bounds, and the formal argument type otherwise. */
7217 }
7220 }
7222 /* Nonzero if integer constants T1 and T2
7223 represent the same constant value. */
7225 int
7227 {
7243 }
7245 /* Return true if T is an INTEGER_CST whose numerical value (extended
7246 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7248 bool
7250 {
7254 }
7256 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7257 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7259 bool
7261 {
7265 {
7270 }
7273 }
7275 /* Return true if T is an INTEGER_CST whose numerical value (extended
7276 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7278 bool
7280 {
7284 }
7286 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7287 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7289 bool
7291 {
7295 {
7300 }
7303 }
7305 /* T is an INTEGER_CST whose numerical value (extended according to
7306 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7307 HOST_WIDE_INT. */
7309 HOST_WIDE_INT
7311 {
7314 }
7316 /* T is an INTEGER_CST whose numerical value (extended according to
7317 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7318 HOST_WIDE_INT. */
7320 unsigned HOST_WIDE_INT
7322 {
7325 }
7327 /* Return the most significant (sign) bit of T. */
7329 int
7331 {
7335 }
7337 /* Return an indication of the sign of the integer constant T.
7338 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7339 Note that -1 will never be returned if T's type is unsigned. */
7341 int
7343 {
7350 else
7352 }
7354 /* Return the minimum number of bits needed to represent VALUE in a
7355 signed or unsigned type, UNSIGNEDP says which. */
7357 unsigned int
7359 {
7360 /* If the value is negative, compute its negative minus 1. The latter
7361 adjustment is because the absolute value of the largest negative value
7362 is one larger than the largest positive value. This is equivalent to
7363 a bit-wise negation, so use that operation instead. */
7368 /* Return the number of bits needed, taking into account the fact
7369 that we need one more bit for a signed than unsigned type.
7370 If value is 0 or -1, the minimum precision is 1 no matter
7371 whether unsignedp is true or false. */
7375 else
7377 }
7379 /* Return truthvalue of whether T1 is the same tree structure as T2.
7380 Return 1 if they are the same.
7381 Return 0 if they are understandably different.
7382 Return -1 if either contains tree structure not understood by
7383 this function. */
7385 int
7387 {
7397 /* For location wrappers to be the same, they must be at the same
7398 source location (and wrap the same thing). */
7400 {
7404 }
7410 {
7414 else
7416 }
7426 {
7442 {
7451 /* ??? Should we handle also fields here? */
7455 }
7466 {
7474 {
7478 }
7480 }
7483 /* Special case: if either target is an unallocated VAR_DECL,
7484 it means that it's going to be unified with whatever the
7485 TARGET_EXPR is really supposed to initialize, so treat it
7486 as being equivalent to anything. */
7494 else
7523 /* A false return means maybe_ne rather than known_ne. */
7529 }
7531 /* This general rule works for most tree codes. All exceptions should be
7532 handled above. If this is a language-specific tree code, we can't
7533 trust what might be in the operand, so say we don't know
7534 the situation. */
7539 {
7548 {
7552 }
7558 }
7559 }
7561 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7562 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7563 than U, respectively. */
7565 int
7567 {
7576 else
7578 }
7580 /* Return true if SIZE represents a constant size that is in bounds of
7581 what the middle-end and the backend accepts (covering not more than
7582 half of the address-space).
7583 When PERR is non-null, set *PERR on failure to the description of
7584 why SIZE is not valid. */
7586 bool
7588 {
7590 {
7597 }
7599 cst_size_error error;
7604 {
7607 }
7610 {
7613 }
7616 {
7619 }
7623 {
7626 }
7629 }
7631 /* Return the precision of the type, or for a complex or vector type the
7632 precision of the type of its elements. */
7634 unsigned int
7636 {
7644 }
7646 /* Return true if CODE represents an associative tree code. Otherwise
7647 return false. */
7648 bool
7650 {
7652 {
7664 }
7666 }
7668 /* Return true if CODE represents a commutative tree code. Otherwise
7669 return false. */
7670 bool
7672 {
7674 {
7701 }
7703 }
7705 /* Return true if CODE represents a ternary tree code for which the
7706 first two operands are commutative. Otherwise return false. */
7707 bool
7709 {
7711 {
7719 }
7721 }
7723 /* Returns true if CODE can overflow. */
7725 bool
7727 {
7729 {
7734 /* Can overflow in various ways. */
7740 /* For INT_MIN / -1. */
7744 /* For -INT_MIN. */
7747 /* These operators cannot overflow. */
7749 }
7750 }
7752 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7753 ftrapv doesn't generate trapping insns for CODE. */
7755 bool
7757 {
7760 /* We don't generate instructions that trap on overflow for complex or vector
7761 types. */
7769 {
7775 /* These operators can overflow, and -ftrapv generates trapping code for
7776 these. */
7783 /* These operators can overflow, but -ftrapv does not generate trapping
7784 code for these. */
7787 /* These operators cannot overflow. */
7789 }
7790 }
7792 namespace inchash
7793 {
7795 /* Generate a hash value for an expression. This can be used iteratively
7796 by passing a previous result as the HSTATE argument.
7798 This function is intended to produce the same hash for expressions which
7799 would compare equal using operand_equal_p. */
7800 void
7802 {
7808 {
7811 }
7821 {
7822 /* Alas, constants aren't shared, so we can't rely on pointer
7823 identity. */
7833 {
7837 else
7841 }
7843 {
7847 }
7857 {
7864 }
7866 /* We can just compare by pointer. */
7870 /* The node itself doesn't matter. */
7874 /* Ignore. */
7877 /* A list of expressions, for a CALL_EXPR or as the elements of a
7878 VECTOR_CST. */
7883 {
7888 {
7891 }
7893 }
7895 {
7896 tree_stmt_iterator i;
7901 }
7910 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7911 Otherwise nodes that compare equal according to operand_equal_p might
7912 get different hash codes. However, don't do this for machine specific
7913 or front end builtins, since the function code is overloaded in those
7914 cases. */
7917 {
7920 }
7921 /* FALL THROUGH */
7924 {
7928 }
7932 {
7933 /* DECL's have a unique ID */
7935 }
7937 {
7938 /* For comparisons that can be swapped, use the lower
7939 tree code. */
7946 }
7948 {
7949 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7950 operand_equal_p. */
7954 /* Don't hash the type, that can lead to having nodes which
7955 compare equal according to operand_equal_p, but which
7956 have different hash codes. Make sure to include signedness
7957 in the hash computation. */
7960 }
7961 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7969 /* Don't ICE on FE specific trees, or their arguments etc.
7970 during operand_equal_p hash verification. */
7973 else
7974 {
7980 {
8007 {
8008 /* The multiplication operands are commutative. */
8015 }
8023 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
8024 Usually different TARGET_EXPRs just should use
8025 different temporaries in their slots. */
8031 }
8033 /* Don't hash the type, that can lead to having nodes which
8034 compare equal according to operand_equal_p, but which
8035 have different hash codes. */
8037 {
8038 /* Make sure to include signness in the hash computation. */
8041 }
8044 {
8045 /* It's a commutative expression. We want to hash it the same
8046 however it appears. We do this by first hashing both operands
8047 and then rehashing based on the order of their independent
8048 hashes. */
8053 }
8054 else
8058 }
8060 }
8061 }
8063 }
8065 /* Constructors for pointer, array and function types.
8066 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8067 constructed by language-dependent code, not here.) */
8069 /* Construct, lay out and return the type of pointers to TO_TYPE with
8070 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8071 reference all of memory. If such a type has already been
8072 constructed, reuse it. */
8074 tree
8077 {
8078 tree t;
8084 /* If the pointed-to type has the may_alias attribute set, force
8085 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8089 /* In some cases, languages will have things that aren't a POINTER_TYPE
8090 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8091 In that case, return that type without regard to the rest of our
8092 operands.
8094 ??? This is a kludge, but consistent with the way this function has
8095 always operated and there doesn't seem to be a good way to avoid this
8096 at the moment. */
8101 /* First, if we already have a type for pointers to TO_TYPE and it's
8102 the proper mode, use it. */
8115 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8123 /* Lay out the type. This function has many callers that are concerned
8124 with expression-construction, and this simplifies them all. */
8128 }
8130 /* By default build pointers in ptr_mode. */
8132 tree
8134 {
8139 }
8141 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8143 tree
8146 {
8147 tree t;
8153 /* If the pointed-to type has the may_alias attribute set, force
8154 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8158 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8159 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8160 In that case, return that type without regard to the rest of our
8161 operands.
8163 ??? This is a kludge, but consistent with the way this function has
8164 always operated and there doesn't seem to be a good way to avoid this
8165 at the moment. */
8170 /* First, if we already have a type for pointers to TO_TYPE and it's
8171 the proper mode, use it. */
8184 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8195 }
8198 /* Build the node for the type of references-to-TO_TYPE by default
8199 in ptr_mode. */
8201 tree
8203 {
8208 }
8210 #define MAX_INT_CACHED_PREC \
8211 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8214 /* Builds a signed or unsigned integer type of precision PRECISION.
8215 Used for C bitfields whose precision does not match that of
8216 built-in target types. */
8217 tree
8220 {
8227 {
8231 }
8238 else
8248 }
8250 #define MAX_BOOL_CACHED_PREC \
8251 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8254 /* Builds a boolean type of precision PRECISION.
8255 Used for boolean vectors to choose proper vector element size. */
8256 tree
8258 {
8259 tree type;
8262 {
8266 }
8276 }
8278 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8279 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8280 is true, reuse such a type that has already been constructed. */
8282 static tree
8284 {
8307 {
8308 /* Since we cannot reliably merge this type, we need to compare it using
8309 structural equality checks. */
8312 }
8318 }
8320 /* Wrapper around build_range_type_1 with SHARED set to true. */
8322 tree
8324 {
8326 }
8328 /* Wrapper around build_range_type_1 with SHARED set to false. */
8330 tree
8332 {
8334 }
8336 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8337 MAXVAL should be the maximum value in the domain
8338 (one less than the length of the array).
8340 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8341 We don't enforce this limit, that is up to caller (e.g. language front end).
8342 The limit exists because the result is a signed type and we don't handle
8343 sizes that use more than one HOST_WIDE_INT. */
8345 tree
8347 {
8349 }
8351 /* Return true if the debug information for TYPE, a subtype, should be emitted
8352 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8353 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8354 debug info and doesn't reflect the source code. */
8356 bool
8358 {
8361 /* Subrange types have a base type which is an integral type. */
8365 /* Get the real bounds of the subtype. */
8368 else
8369 {
8372 }
8374 /* If the type and its base type have the same representation and the same
8375 name, then the type is not a subrange but a copy of the base type. */
8389 }
8391 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8392 and number of elements specified by the range of values of INDEX_TYPE.
8393 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8394 If SHARED is true, reuse such a type that has already been constructed. */
8396 static tree
8399 {
8400 tree t;
8403 {
8406 }
8415 /* If the element type is incomplete at this point we get marked for
8416 structural equality. Do not record these types in the canonical
8417 type hashtable. */
8422 {
8425 }
8428 {
8437 index_type
8440 }
8443 }
8445 /* Wrapper around build_array_type_1 with SHARED set to true. */
8447 tree
8449 {
8451 }
8453 /* Wrapper around build_array_type_1 with SHARED set to false. */
8455 tree
8457 {
8459 }
8461 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8462 sizetype. */
8464 tree
8466 {
8468 }
8470 /* Recursively examines the array elements of TYPE, until a non-array
8471 element type is found. */
8473 tree
8475 {
8480 }
8482 /* Computes the canonical argument types from the argument type list
8483 ARGTYPES.
8485 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8486 on entry to this function, or if any of the ARGTYPES are
8487 structural.
8489 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8490 true on entry to this function, or if any of the ARGTYPES are
8491 non-canonical.
8493 Returns a canonical argument list, which may be ARGTYPES when the
8494 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8495 true) or would not differ from ARGTYPES. */
8497 static tree
8501 {
8502 tree arg;
8506 {
8508 /* Fail gracefully by stating that the type is structural. */
8514 /* If the argument has a default argument, we consider it
8515 non-canonical even though the type itself is canonical.
8516 That way, different variants of function and method types
8517 with default arguments will all point to the variant with
8518 no defaults as their canonical type. */
8520 }
8526 {
8527 /* Build the canonical list of argument types. */
8532 {
8535 else
8538 canon_argtypes);
8539 }
8545 /* There is a non-canonical type. */
8548 }
8550 /* The canonical argument types are the same as ARGTYPES. */
8552 }
8554 /* Construct, lay out and return
8555 the type of functions returning type VALUE_TYPE
8556 given arguments of types ARG_TYPES.
8557 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8558 are data type nodes for the arguments of the function.
8559 If such a type has already been constructed, reuse it. */
8561 tree
8563 {
8564 tree t;
8567 tree canon_argtypes;
8572 {
8575 }
8577 /* Make a node of the sort we want. */
8582 /* If we already have such a type, use the old one. */
8586 /* Set up the canonical type. */
8596 canon_argtypes);
8601 }
8603 /* Build a function type. The RETURN_TYPE is the type returned by the
8604 function. If VAARGS is set, no void_type_node is appended to the
8605 list. ARGP must be always be terminated be a NULL_TREE. */
8607 static tree
8609 {
8617 {
8622 }
8625 else
8626 {
8630 }
8634 }
8636 /* Build a function type. The RETURN_TYPE is the type returned by the
8637 function. If additional arguments are provided, they are
8638 additional argument types. The list of argument types must always
8639 be terminated by NULL_TREE. */
8641 tree
8643 {
8644 tree args;
8651 }
8653 /* Build a variable argument function type. The RETURN_TYPE is the
8654 type returned by the function. If additional arguments are provided,
8655 they are additional argument types. The list of argument types must
8656 always be terminated by NULL_TREE. */
8658 tree
8660 {
8661 tree args;
8669 }
8671 /* Build a function type. RETURN_TYPE is the type returned by the
8672 function; VAARGS indicates whether the function takes varargs. The
8673 function takes N named arguments, the types of which are provided in
8674 ARG_TYPES. */
8676 static tree
8679 {
8687 }
8689 /* Build a function type. RETURN_TYPE is the type returned by the
8690 function. The function takes N named arguments, the types of which
8691 are provided in ARG_TYPES. */
8693 tree
8695 {
8697 }
8699 /* Build a variable argument function type. RETURN_TYPE is the type
8700 returned by the function. The function takes N named arguments, the
8701 types of which are provided in ARG_TYPES. */
8703 tree
8705 {
8707 }
8709 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8710 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8711 for the method. An implicit additional parameter (of type
8712 pointer-to-BASETYPE) is added to the ARGTYPES. */
8714 tree
8716 tree rettype,
8717 tree argtypes)
8718 {
8719 tree t;
8720 tree ptype;
8722 tree canon_argtypes;
8724 /* Make a node of the sort we want. */
8731 /* The actual arglist for this function includes a "hidden" argument
8732 which is "this". Put it into the list of argument types. */
8736 /* If we already have such a type, use the old one. */
8740 /* Set up the canonical type. */
8741 any_structural_p
8744 any_noncanonical_p
8756 canon_argtypes);
8761 }
8763 /* Construct, lay out and return the type of methods belonging to class
8764 BASETYPE and whose arguments and values are described by TYPE.
8765 If that type exists already, reuse it.
8766 TYPE must be a FUNCTION_TYPE node. */
8768 tree
8770 {
8776 }
8778 /* Construct, lay out and return the type of offsets to a value
8779 of type TYPE, within an object of type BASETYPE.
8780 If a suitable offset type exists already, reuse it. */
8782 tree
8784 {
8785 tree t;
8787 /* Make a node of the sort we want. */
8793 /* If we already have such a type, use the old one. */
8801 {
8810 }
8813 }
8815 /* Create a complex type whose components are COMPONENT_TYPE.
8817 If NAMED is true, the type is given a TYPE_NAME. We do not always
8818 do so because this creates a DECL node and thus make the DECL_UIDs
8819 dependent on the type canonicalization hashtable, which is GC-ed,
8820 so the DECL_UIDs would not be stable wrt garbage collection. */
8822 tree
8824 {
8829 /* Make a node of the sort we want. */
8834 /* If we already have such a type, use the old one. */
8839 {
8840 /* We created a new type. The hash insertion will have laid
8841 out the type. We need to check the canonicalization and
8842 maybe set the name. */
8853 /* We need to create a name, since complex is a fundamental type. */
8855 {
8884 }
8885 }
8888 }
8890 /* If TYPE is a real or complex floating-point type and the target
8891 does not directly support arithmetic on TYPE then return the wider
8892 type to be used for arithmetic on TYPE. Otherwise, return
8893 NULL_TREE. */
8895 tree
8897 {
8898 /* The target can give two different responses to the question of
8899 which excess precision mode it would like depending on whether we
8900 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8902 enum excess_precision_type requested_type
8904 ? EXCESS_PRECISION_TYPE_FAST
8907 enum flt_eval_method target_flt_eval_method
8910 /* The target should not ask for unpredictable float evaluation (though
8911 it might advertise that implicitly the evaluation is unpredictable,
8912 but we don't care about that here, it will have been reported
8913 elsewhere). If it does ask for unpredictable evaluation, we have
8914 nothing to do here. */
8917 /* Nothing to do. The target has asked for all types we know about
8918 to be computed with their native precision and range. */
8922 /* The target will promote this type in a target-dependent way, so excess
8923 precision ought to leave it alone. */
8927 machine_mode float16_type_mode = (float16_type_node
8934 {
8936 {
8939 {
8957 }
8959 }
8961 {
8966 {
8984 }
8986 }
8989 }
8992 }
8993 \f
8994 /* Return OP, stripped of any conversions to wider types as much as is safe.
8995 Converting the value back to OP's type makes a value equivalent to OP.
8997 If FOR_TYPE is nonzero, we return a value which, if converted to
8998 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
9000 OP must have integer, real or enumeral type. Pointers are not allowed!
9002 There are some cases where the obvious value we could return
9003 would regenerate to OP if converted to OP's type,
9004 but would not extend like OP to wider types.
9005 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
9006 For example, if OP is (unsigned short)(signed char)-1,
9007 we avoid returning (signed char)-1 if FOR_TYPE is int,
9008 even though extending that to an unsigned short would regenerate OP,
9009 since the result of extending (signed char)-1 to (int)
9010 is different from (int) OP. */
9012 tree
9014 {
9015 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
9017 unsigned final_prec
9019 int uns
9026 {
9029 /* TYPE_PRECISION on vector types has different meaning
9030 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
9031 so avoid them here. */
9038 /* Truncations are many-one so cannot be removed.
9039 Unless we are later going to truncate down even farther. */
9044 /* See what's inside this conversion. If we decide to strip it,
9045 we will set WIN. */
9048 /* If we have not stripped any zero-extensions (uns is 0),
9049 we can strip any kind of extension.
9050 If we have previously stripped a zero-extension,
9051 only zero-extensions can safely be stripped.
9052 Any extension can be stripped if the bits it would produce
9053 are all going to be discarded later by truncating to FOR_TYPE. */
9056 {
9059 /* TYPE_UNSIGNED says whether this is a zero-extension.
9060 Let's avoid computing it if it does not affect WIN
9061 and if UNS will not be needed again. */
9065 {
9068 }
9069 }
9070 }
9072 /* If we finally reach a constant see if it fits in sth smaller and
9073 in that case convert it. */
9075 {
9081 {
9085 }
9086 }
9089 }
9090 \f
9091 /* Return OP or a simpler expression for a narrower value
9092 which can be sign-extended or zero-extended to give back OP.
9093 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
9094 or 0 if the value should be sign-extended. */
9096 tree
9098 {
9105 {
9106 int bitschange
9110 /* Truncations are many-one so cannot be removed. */
9114 /* See what's inside this conversion. If we decide to strip it,
9115 we will set WIN. */
9118 {
9120 /* An extension: the outermost one can be stripped,
9121 but remember whether it is zero or sign extension. */
9124 /* Otherwise, if a sign extension has been stripped,
9125 only sign extensions can now be stripped;
9126 if a zero extension has been stripped, only zero-extensions. */
9130 }
9132 {
9133 /* A change in nominal type can always be stripped, but we must
9134 preserve the unsignedness. */
9139 /* Keep trying to narrow, but don't assign op to win if it
9140 would turn an integral type into something else. */
9143 }
9146 }
9149 /* Since type_for_size always gives an integer type. */
9152 /* Ensure field is laid out already. */
9155 {
9156 unsigned HOST_WIDE_INT innerprec
9162 /* We can get this structure field in a narrower type that fits it,
9163 but the resulting extension to its nominal type (a fullword type)
9164 must satisfy the same conditions as for other extensions.
9166 Do this only for fields that are aligned (not bit-fields),
9167 because when bit-field insns will be used there is no
9168 advantage in doing this. */
9174 {
9178 }
9179 }
9183 }
9184 \f
9185 /* Return true if integer constant C has a value that is permissible
9186 for TYPE, an integral type. */
9188 bool
9190 {
9195 /* Non-standard boolean types can have arbitrary precision but various
9196 transformations assume that they can only take values 0 and +/-1. */
9200 retry:
9204 /* If at least one bound of the type is a constant integer, we can check
9205 ourselves and maybe make a decision. If no such decision is possible, but
9206 this type is a subtype, try checking against that. Otherwise, use
9207 fits_to_tree_p, which checks against the precision.
9209 Compute the status for each possibly constant bound, and return if we see
9210 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9211 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9212 for "constant known to fit". */
9214 /* Check if c >= type_low_bound. */
9216 {
9220 }
9221 else
9224 /* Check if c <= type_high_bound. */
9226 {
9230 }
9231 else
9234 /* If the constant fits both bounds, the result is known. */
9238 /* Perform some generic filtering which may allow making a decision
9239 even if the bounds are not constant. First, negative integers
9240 never fit in unsigned types, */
9244 /* Second, narrower types always fit in wider ones. */
9248 /* Third, unsigned integers with top bit set never fit signed types. */
9250 {
9253 {
9254 /* When a tree_cst is converted to a wide-int, the precision
9255 is taken from the type. However, if the precision of the
9256 mode underneath the type is smaller than that, it is
9257 possible that the value will not fit. The test below
9258 fails if any bit is set between the sign bit of the
9259 underlying mode and the top bit of the type. */
9262 }
9265 }
9267 /* If we haven't been able to decide at this point, there nothing more we
9268 can check ourselves here. Look at the base type if we have one and it
9269 has the same precision. */
9273 {
9276 }
9278 /* Or to fits_to_tree_p, if nothing else. */
9280 }
9282 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9283 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9284 represented (assuming two's-complement arithmetic) within the bit
9285 precision of the type are returned instead. */
9287 void
9289 {
9293 else
9294 {
9297 else
9298 {
9301 }
9302 }
9307 else
9308 {
9311 }
9312 }
9314 /* Return true if VAR is an automatic variable. */
9316 bool
9318 {
9323 }
9325 /* Return true if VAR is an automatic variable defined in function FN. */
9327 bool
9329 {
9333 }
9335 /* Subprogram of following function. Called by walk_tree.
9337 Return *TP if it is an automatic variable or parameter of the
9338 function passed in as DATA. */
9340 static tree
9342 {
9353 }
9355 /* Returns true if T is, contains, or refers to a type with variable
9356 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9357 arguments, but not the return type. If FN is nonzero, only return
9358 true if a modifier of the type or position of FN is a variable or
9359 parameter inside FN.
9361 This concept is more general than that of C99 'variably modified types':
9362 in C99, a struct type is never variably modified because a VLA may not
9363 appear as a structure member. However, in GNU C code like:
9365 struct S { int i[f()]; };
9367 is valid, and other languages may define similar constructs. */
9369 bool
9371 {
9372 tree t;
9374 /* Test if T is either variable (if FN is zero) or an expression containing
9375 a variable in FN. If TYPE isn't gimplified, return true also if
9376 gimplify_one_sizepos would gimplify the expression into a local
9377 variable. */
9378 #define RETURN_TRUE_IF_VAR(T) \
9379 do { tree _t = (T); \
9380 if (_t != NULL_TREE \
9381 && _t != error_mark_node \
9382 && !CONSTANT_CLASS_P (_t) \
9383 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9384 && (!fn \
9385 || (!TYPE_SIZES_GIMPLIFIED (type) \
9386 && (TREE_CODE (_t) != VAR_DECL \
9387 && !CONTAINS_PLACEHOLDER_P (_t))) \
9388 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9389 return true; } while (0)
9394 /* If TYPE itself has variable size, it is variably modified. */
9399 {
9403 /* Ada can have pointer types refering to themselves indirectly. */
9408 {
9411 }
9417 /* If TYPE is a function type, it is variably modified if the
9418 return type is variably modified. */
9428 /* Scalar types are variably modified if their end points
9429 aren't constant. */
9437 /* We can't see if any of the fields are variably-modified by the
9438 definition we normally use, since that would produce infinite
9439 recursion via pointers. */
9440 /* This is variably modified if some field's type is. */
9443 {
9450 }
9454 /* Do not call ourselves to avoid infinite recursion. This is
9455 variably modified if the element type is. */
9462 }
9464 /* The current language may have other cases to check, but in general,
9465 all other types are not variably modified. */
9468 #undef RETURN_TRUE_IF_VAR
9469 }
9471 /* Given a DECL or TYPE, return the scope in which it was declared, or
9472 NULL_TREE if there is no containing scope. */
9474 tree
9476 {
9478 }
9480 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9482 const_tree
9484 {
9486 {
9489 else
9491 }
9493 }
9495 /* Return the innermost context enclosing DECL that is
9496 a FUNCTION_DECL, or zero if none. */
9498 tree
9500 {
9501 tree context;
9506 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9507 where we look up the function at runtime. Such functions always take
9508 a first argument of type 'pointer to real context'.
9510 C++ should really be fixed to use DECL_CONTEXT for the real context,
9511 and use something else for the "virtual context". */
9513 context
9514 = TYPE_MAIN_VARIANT
9516 else
9520 {
9523 else
9525 }
9528 }
9530 /* Return the innermost context enclosing DECL that is
9531 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9532 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9534 tree
9536 {
9541 {
9562 }
9565 }
9567 /* CALL is a CALL_EXPR. Return the declaration for the function
9568 called, or NULL_TREE if the called function cannot be
9569 determined. */
9571 tree
9573 {
9574 tree addr;
9579 /* It's invalid to call this function with anything but a
9580 CALL_EXPR. */
9583 /* The first operand to the CALL is the address of the function
9584 called. */
9587 /* If there is no function, return early. */
9593 /* If this is a readonly function pointer, extract its initial value. */
9599 /* If the address is just `&f' for some function `f', then we know
9600 that `f' is being called. */
9605 /* We couldn't figure out what was being called. */
9607 }
9609 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9610 return the associated function code, otherwise return CFN_LAST. */
9612 combined_fn
9614 {
9615 /* It's invalid to call this function with anything but a CALL_EXPR. */
9626 }
9628 /* Comparator of indices based on tree_node_counts. */
9630 static int
9632 {
9637 }
9639 /* Comparator of indices based on tree_code_counts. */
9641 static int
9643 {
9648 }
9650 #define TREE_MEM_USAGE_SPACES 40
9652 /* Print debugging information about tree nodes generated during the compile,
9653 and any language-specific information. */
9655 void
9657 {
9659 {
9665 {
9672 {
9679 }
9684 }
9686 {
9696 {
9701 }
9708 }
9709 }
9710 else
9717 }
9718 \f
9721 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9723 unsigned
9725 {
9726 /* This relies on the raw feedback's top 4 bits being zero. */
9727 #define FEEDBACK(X) ((X) * 0x04c11db7)
9728 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9729 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9731 {
9736 };
9737 #undef FEEDBACK
9738 #undef SYNDROME
9742 {
9746 }
9749 }
9751 /* Generate a crc32 of a string. */
9753 unsigned
9755 {
9756 do
9760 }
9762 /* P is a string that will be used in a symbol. Mask out any characters
9763 that are not valid in that context. */
9765 void
9767 {
9772 #endif
9775 #endif
9776 ))
9778 }
9782 /* Create a unique anonymous identifier. The identifier is still a
9783 valid assembly label. */
9785 tree
9787 {
9789 #if !defined (NO_DOT_IN_LABEL)
9790 "."
9791 #elif !defined (NO_DOLLAR_IN_LABEL)
9792 "$"
9793 #else
9794 "_"
9795 #endif
9806 }
9808 /* Generate a name for a special-purpose function.
9809 The generated name may need to be unique across the whole link.
9810 Changes to this function may also require corresponding changes to
9811 xstrdup_mask_random.
9812 TYPE is some string to identify the purpose of this function to the
9813 linker or collect2; it must start with an uppercase letter,
9814 one of:
9815 I - for constructors
9816 D - for destructors
9817 N - for C++ anonymous namespaces
9818 F - for DWARF unwind frame information. */
9820 tree
9822 {
9827 /* If we already have a name we know to be unique, just use that. */
9830 /* If the target is handling the constructors/destructors, they
9831 will be local to this file and the name is only necessary for
9832 debugging purposes.
9833 We also assign sub_I and sub_D sufixes to constructors called from
9834 the global static constructors. These are always local. */
9838 {
9842 /* Just use the file's basename, because the full pathname
9843 might be quite long. */
9845 }
9846 else
9847 {
9848 /* Otherwise, the name must be unique across the entire link.
9849 We don't have anything that we know to be unique to this translation
9850 unit, so use what we do have and throw in some randomness. */
9868 }
9874 /* Set up the name of the file-level functions we may need.
9875 Use a global object (which is already required to be unique over
9876 the program) rather than the file name (which imposes extra
9877 constraints). */
9881 }
9882 \f
9883 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9885 /* Complain that the tree code of NODE does not match the expected 0
9886 terminated list of trailing codes. The trailing code list can be
9887 empty, for a more vague error message. FILE, LINE, and FUNCTION
9888 are of the caller. */
9890 void
9893 {
9904 {
9911 {
9918 }
9920 }
9921 else
9927 }
9929 /* Complain that the tree code of NODE does match the expected 0
9930 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9931 the caller. */
9933 void
9936 {
9950 {
9952 {
9955 }
9958 }
9964 }
9966 /* Similar to tree_check_failed, except that we check for a class of tree
9967 code, given in CL. */
9969 void
9972 {
9973 internal_error
9978 }
9980 /* Similar to tree_check_failed, except that instead of specifying a
9981 dozen codes, use the knowledge that they're all sequential. */
9983 void
9987 {
10000 {
10007 }
10012 }
10015 /* Similar to tree_check_failed, except that we check that a tree does
10016 not have the specified code, given in CL. */
10018 void
10021 {
10022 internal_error
10027 }
10030 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
10032 void
10035 {
10041 }
10044 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
10046 void
10050 {
10063 {
10070 }
10075 }
10078 #undef DEFTREESTRUCT
10079 #define DEFTREESTRUCT(VAL, NAME) NAME,
10083 };
10084 #undef DEFTREESTRUCT
10086 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
10088 /* Similar to tree_class_check_failed, except that we check for
10089 whether CODE contains the tree structure identified by EN. */
10091 void
10096 {
10097 internal_error
10101 }
10104 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10105 (dynamically sized) vector. */
10107 void
10110 {
10111 internal_error
10115 }
10117 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10118 (dynamically sized) vector. */
10120 void
10123 {
10124 internal_error
10127 }
10129 /* Similar to above, except that the check is for the bounds of the operand
10130 vector of an expression node EXP. */
10132 void
10135 {
10137 internal_error
10141 }
10143 /* Similar to above, except that the check is for the number of
10144 operands of an OMP_CLAUSE node. */
10146 void
10149 {
10150 internal_error
10155 }
10157 \f
10158 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10159 and mapped to the machine mode MODE. Initialize its fields and build
10160 the information necessary for debugging output. */
10162 static tree
10164 {
10165 tree t;
10186 /* We have built a main variant, based on the main variant of the
10187 inner type. Use it to build the variant we return. */
10195 }
10197 static tree
10199 {
10222 else
10224 }
10226 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10228 static tree
10230 {
10232 {
10244 }
10245 else
10246 {
10258 }
10261 }
10263 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10265 static tree
10267 {
10269 {
10281 }
10282 else
10283 {
10295 }
10298 }
10301 /* Create an atomic variant node for TYPE. This routine is called
10302 during initialization of data types to create the 5 basic atomic
10303 types. The generic build_variant_type function requires these to
10304 already be set up in order to function properly, so cannot be
10305 called from there. If ALIGN is non-zero, then ensure alignment is
10306 overridden to this value. */
10308 static tree
10310 {
10311 tree t;
10313 /* Make sure its not already registered. */
10324 }
10326 /* Information about the _FloatN and _FloatNx types. This must be in
10327 the same order as the corresponding TI_* enum values. */
10329 {
10337 };
10340 /* Create nodes for all integer types (and error_mark_node) using the sizes
10341 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10343 void
10345 {
10353 /* Define both `signed char' and `unsigned char'. */
10359 /* Define `char', which is like either `signed char' or `unsigned char'
10360 but not the same as either. */
10361 char_type_node
10362 = (signed_char
10377 {
10382 {
10385 }
10386 }
10388 /* Define a boolean type. This type only represents boolean values but
10389 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10395 /* Define what type to use for size_t. */
10404 else
10405 {
10411 {
10418 {
10420 }
10421 }
10424 }
10426 /* Define what type to use for ptrdiff_t. */
10435 else
10436 {
10440 {
10448 }
10451 }
10453 /* Fill in the rest of the sized types. Reuse existing type nodes
10454 when possible. */
10467 /* Don't call build_qualified type for atomics. That routine does
10468 special processing for atomics, and until they are initialized
10469 it's better not to make that call.
10471 Check to see if there is a target override for atomic types. */
10488 /* Define these next since types below may used them. */
10506 /* We are not going to have real types in C with less than byte alignment,
10507 so we might as well not have any types that claim to have it. */
10518 const_ptr_type_node
10540 {
10543 scalar_float_mode mode;
10547 /* Work around the rs6000 KFmode having precision 113 not
10548 128. */
10560 }
10567 /* Fixed size integer types. */
10572 /* Decimal float types. */
10598 {
10602 }
10604 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10605 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10606 sat_ ## KIND ## _type_node = \
10607 make_sat_signed_ ## KIND ## _type (SIZE); \
10608 sat_unsigned_ ## KIND ## _type_node = \
10609 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10610 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10611 unsigned_ ## KIND ## _type_node = \
10612 make_unsigned_ ## KIND ## _type (SIZE);
10614 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10615 sat_ ## WIDTH ## KIND ## _type_node = \
10616 make_sat_signed_ ## KIND ## _type (SIZE); \
10617 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10618 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10619 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10620 unsigned_ ## WIDTH ## KIND ## _type_node = \
10621 make_unsigned_ ## KIND ## _type (SIZE);
10623 /* Make fixed-point type nodes based on four different widths. */
10624 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10625 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10626 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10627 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10628 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10630 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10631 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10632 NAME ## _type_node = \
10633 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10634 u ## NAME ## _type_node = \
10635 make_or_reuse_unsigned_ ## KIND ## _type \
10636 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10637 sat_ ## NAME ## _type_node = \
10638 make_or_reuse_sat_signed_ ## KIND ## _type \
10639 (GET_MODE_BITSIZE (MODE ## mode)); \
10640 sat_u ## NAME ## _type_node = \
10641 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10642 (GET_MODE_BITSIZE (U ## MODE ## mode));
10644 /* Fixed-point type and mode nodes. */
10657 {
10660 /* Many back-ends define record types without setting TYPE_NAME.
10661 If we copied the record type here, we'd keep the original
10662 record type without a name. This breaks name mangling. So,
10663 don't copy record types and let c_common_nodes_and_builtins()
10664 declare the type to be __builtin_va_list. */
10669 }
10671 /* SCEV analyzer global shared trees. */
10676 }
10678 /* Modify DECL for given flags.
10679 TM_PURE attribute is set only on types, so the function will modify
10680 DECL's type when ECF_TM_PURE is used. */
10682 void
10684 {
10714 /* Looping const or pure is implied by noreturn.
10715 There is currently no way to declare looping const or looping pure alone. */
10718 }
10721 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10723 static void
10726 {
10727 tree decl;
10734 }
10736 /* Call this function after instantiating all builtins that the language
10737 front end cares about. This will build the rest of the builtins
10738 and internal functions that are relied upon by the tree optimizers and
10739 the middle-end. */
10741 void
10743 {
10749 {
10753 BUILT_IN_UNREACHABLE,
10761 }
10765 {
10776 }
10779 {
10782 NULL_TREE);
10785 }
10788 {
10794 }
10796 /* If we're checking the stack, `alloca' can throw. */
10797 const int alloca_flags
10801 {
10806 }
10811 BUILT_IN_ALLOCA_WITH_ALIGN,
10813 alloca_flags);
10818 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10820 alloca_flags);
10826 BUILT_IN_INIT_TRAMPOLINE,
10829 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10833 BUILT_IN_INIT_DESCRIPTOR,
10838 BUILT_IN_ADJUST_TRAMPOLINE,
10842 BUILT_IN_ADJUST_DESCRIPTOR,
10849 BUILT_IN_NONLOCAL_GOTO,
10856 BUILT_IN_SETJMP_SETUP,
10861 BUILT_IN_SETJMP_RECEIVER,
10870 BUILT_IN_STACK_RESTORE,
10875 NULL_TREE);
10888 /* If there's a possibility that we might use the ARM EABI, build the
10889 alternate __cxa_end_cleanup node used to resume from C++. */
10891 {
10894 BUILT_IN_CXA_END_CLEANUP,
10896 }
10900 BUILT_IN_UNWIND_RESUME,
10904 ECF_NORETURN);
10907 {
10909 NULL_TREE);
10911 BUILT_IN_RETURN_ADDRESS,
10913 ECF_NOTHROW);
10914 }
10918 {
10923 BUILT_IN_PROFILE_FUNC_ENTER,
10927 BUILT_IN_PROFILE_FUNC_EXIT,
10929 }
10931 /* The exception object and filter values from the runtime. The argument
10932 must be zero before exception lowering, i.e. from the front end. After
10933 exception lowering, it will be the region number for the exception
10934 landing pad. These functions are PURE instead of CONST to prevent
10935 them from being hoisted past the exception edge that will initialize
10936 its value in the landing pad. */
10940 /* Only use TM_PURE if we have TM language support. */
10953 NULL_TREE);
10955 BUILT_IN_EH_COPY_VALUES,
10958 /* Complex multiplication and division. These are handled as builtins
10959 rather than optabs because emit_library_call_value doesn't support
10960 complex. Further, we can do slightly better with folding these
10961 beasties if the real and complex parts of the arguments are separate. */
10962 {
10966 {
10993 /* For -ftrapping-math these should throw from a former
10994 -fnon-call-exception stmt. */
10996 NULL);
11002 NULL);
11006 }
11007 }
11010 }
11012 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
11013 better way.
11015 If we requested a pointer to a vector, build up the pointers that
11016 we stripped off while looking for the inner type. Similarly for
11017 return values from functions.
11019 The argument TYPE is the top of the chain, and BOTTOM is the
11020 new type which we will point to. */
11022 tree
11024 {
11028 {
11032 }
11034 {
11038 }
11040 {
11043 }
11045 {
11048 }
11050 {
11052 /* The build_method_type_directly() routine prepends 'this' to argument list,
11053 so we must compensate by getting rid of it. */
11054 outer
11055 = build_method_type_directly
11057 inner,
11059 }
11061 {
11064 }
11065 else
11070 }
11072 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
11073 the inner type. */
11074 tree
11076 {
11077 poly_int64 nunits;
11081 {
11093 /* Check that there are no leftover bits. */
11101 }
11104 }
11106 /* Similarly, but takes the inner type and number of units, which must be
11107 a power of two. */
11109 tree
11111 {
11113 }
11115 /* Build truth vector with specified length and number of units. */
11117 tree
11119 {
11120 machine_mode mask_mode
11123 poly_uint64 vsize;
11126 else
11134 }
11136 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11138 tree
11140 {
11150 }
11152 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11154 tree
11156 {
11158 tree cand;
11159 /* We always build the non-opaque variant before the opaque one,
11160 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11166 /* Othewise build a variant type and make sure to queue it after
11167 the non-opaque type. */
11175 }
11177 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11179 wide_int
11181 {
11182 /* First handle elements that are directly encoded. */
11187 /* Identify the pattern that contains element I and work out the index of
11188 the last encoded element for that pattern. */
11194 /* If there are no steps, the final encoded value is the right one. */
11198 /* Otherwise work out the value from the last two encoded elements. */
11203 }
11205 /* Return the value of element I of VECTOR_CST T. */
11207 tree
11209 {
11210 /* First handle elements that are directly encoded. */
11215 /* If there are no steps, the final encoded value is the right one. */
11217 {
11218 /* Identify the pattern that contains element I and work out the index of
11219 the last encoded element for that pattern. */
11224 }
11226 /* Otherwise work out the value from the last two encoded elements. */
11229 }
11231 /* Given an initializer INIT, return TRUE if INIT is zero or some
11232 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11233 null, set *NONZERO if and only if INIT is known not to be all
11234 zeros. The combination of return value of false and *NONZERO
11235 false implies that INIT may but need not be all zeros. Other
11236 combinations indicate definitive answers. */
11238 bool
11240 {
11245 /* Conservatively clear NONZERO and set it only if INIT is definitely
11246 not all zero. */
11254 {
11263 /* ??? Note that this is not correct for C4X float formats. There,
11264 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11265 negative exponent. */
11300 {
11305 tree elt;
11312 }
11315 {
11330 }
11331 /* Fall through. */
11334 {
11342 /* We need to loop through all elements to handle cases like
11343 "\0" and "\0foobar". */
11346 {
11349 }
11352 }
11356 }
11357 }
11359 /* Return true if EXPR is an initializer expression in which every element
11360 is a constant that is numerically equal to 0 or 1. The elements do not
11361 need to be equal to each other. */
11363 bool
11365 {
11369 {
11377 {
11384 {
11388 }
11391 }
11395 }
11396 }
11398 /* Given an initializer INIT for a TYPE, return true if INIT is zero
11399 so that it can be replaced by value initialization. This function
11400 distinguishes betwen empty strings as initializers for arrays and
11401 for pointers (which make it return false). */
11403 bool
11405 {
11418 {
11424 tree elt_init;
11430 }
11437 tree fld_init;
11440 {
11441 /* Advance to the next member, skipping over everything that
11442 canot be initialized (including unnamed bit-fields). */
11446 {
11451 }
11460 }
11463 }
11465 /* Check if vector VEC consists of all the equal elements and
11466 that the number of elements corresponds to the type of VEC.
11467 The function returns first element of the vector
11468 or NULL_TREE if the vector is not uniform. */
11469 tree
11471 {
11484 {
11488 }
11492 {
11496 {
11498 {
11501 }
11504 }
11509 }
11512 }
11514 /* If the argument is INTEGER_CST, return it. If the argument is vector
11515 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11516 return NULL_TREE.
11517 Look through location wrappers. */
11519 tree
11521 {
11528 {
11532 }
11535 }
11537 /* If VECTOR_CST T has a single nonzero element, return the index of that
11538 element, otherwise return -1. */
11540 int
11542 {
11548 {
11551 }
11552 else
11557 {
11560 {
11564 }
11565 }
11567 }
11569 /* Build an empty statement at location LOC. */
11571 tree
11573 {
11577 }
11580 /* Build an OpenMP clause with code CODE. LOC is the location of the
11581 clause. */
11583 tree
11585 {
11586 tree t;
11601 }
11603 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11604 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11605 Except for the CODE and operand count field, other storage for the
11606 object is initialized to zeros. */
11608 tree
11610 {
11611 tree t;
11623 /* Can't use TREE_OPERAND to store the length because if checking is
11624 enabled, it will try to check the length before we store it. :-P */
11628 }
11630 /* Helper function for build_call_* functions; build a CALL_EXPR with
11631 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11632 the argument slots. */
11634 static tree
11636 {
11637 tree t;
11645 }
11647 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11648 FN and a null static chain slot. NARGS is the number of call arguments
11649 which are specified as "..." arguments. */
11651 tree
11653 {
11654 tree ret;
11660 }
11662 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11663 FN and a null static chain slot. NARGS is the number of call arguments
11664 which are specified as a va_list ARGS. */
11666 tree
11668 {
11669 tree t;
11677 }
11679 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11680 FN and a null static chain slot. NARGS is the number of call arguments
11681 which are specified as a tree array ARGS. */
11683 tree
11686 {
11687 tree t;
11696 }
11698 /* Like build_call_array, but takes a vec. */
11700 tree
11702 {
11711 }
11713 /* Conveniently construct a function call expression. FNDECL names the
11714 function to be called and N arguments are passed in the array
11715 ARGARRAY. */
11717 tree
11719 {
11724 }
11726 /* Conveniently construct a function call expression. FNDECL names the
11727 function to be called and the arguments are passed in the vector
11728 VEC. */
11730 tree
11732 {
11735 }
11738 /* Conveniently construct a function call expression. FNDECL names the
11739 function to be called, N is the number of arguments, and the "..."
11740 parameters are the argument expressions. */
11742 tree
11744 {
11754 }
11756 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11757 varargs macros aren't supported by all bootstrap compilers. */
11759 tree
11761 {
11771 }
11773 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11774 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11775 It will get gimplified later into an ordinary internal function. */
11777 tree
11780 {
11787 }
11789 /* Build internal call expression. This is just like CALL_EXPR, except
11790 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11791 internal function. */
11793 tree
11796 {
11806 }
11808 /* Return a function call to FN, if the target is guaranteed to support it,
11809 or null otherwise.
11811 N is the number of arguments, passed in the "...", and TYPE is the
11812 type of the return value. */
11814 tree
11817 {
11827 {
11830 {
11833 OPTIMIZE_FOR_BOTH))
11835 }
11837 }
11838 else
11839 {
11844 }
11845 }
11847 /* Return a function call to the appropriate builtin alloca variant.
11849 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11850 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11851 bound for SIZE in case it is not a fixed value. */
11853 tree
11855 {
11857 {
11859 return
11861 }
11863 {
11866 }
11867 else
11868 {
11871 }
11872 }
11874 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11875 if SIZE == -1) and return a tree node representing char* pointer to
11876 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value
11877 is the LEN bytes at STR (the representation of the string, which may
11878 be wide). */
11880 tree
11884 {
11886 /* Set the maximum valid index based on the string length or SIZE. */
11887 unsigned HOST_WIDE_INT maxidx
11903 }
11907 /* Return true if T (assumed to be a DECL) must be assigned a memory
11908 location. */
11910 bool
11912 {
11918 }
11920 /* Return value of a constant X and sign-extend it. */
11922 HOST_WIDE_INT
11924 {
11928 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11932 {
11936 else
11938 }
11941 }
11943 /* If TYPE is an integral or pointer type, return an integer type with
11944 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11945 if TYPE is already an integer type of signedness UNSIGNEDP.
11946 If TYPE is a floating-point type, return an integer type with the same
11947 bitsize and with the signedness given by UNSIGNEDP; this is useful
11948 when doing bit-level operations on a floating-point value. */
11950 tree
11952 {
11957 {
11965 }
11968 {
11976 }
11985 else
11989 }
11991 /* If TYPE is an integral or pointer type, return an integer type with
11992 the same precision which is unsigned, or itself if TYPE is already an
11993 unsigned integer type. If TYPE is a floating-point type, return an
11994 unsigned integer type with the same bitsize as TYPE. */
11996 tree
11998 {
12000 }
12002 /* If TYPE is an integral or pointer type, return an integer type with
12003 the same precision which is signed, or itself if TYPE is already a
12004 signed integer type. If TYPE is a floating-point type, return a
12005 signed integer type with the same bitsize as TYPE. */
12007 tree
12009 {
12011 }
12013 /* If TYPE is a vector type, return a signed integer vector type with the
12014 same width and number of subparts. Otherwise return boolean_type_node. */
12016 tree
12018 {
12020 {
12025 }
12026 else
12028 }
12030 /* Returns the largest value obtainable by casting something in INNER type to
12031 OUTER type. */
12033 tree
12035 {
12041 /* Compute a unique number for every combination. */
12046 /* Determine the exponent to use. */
12048 {
12051 /* oprec <= iprec, outer: signed, inner: don't care. */
12056 /* oprec <= iprec, outer: unsigned, inner: don't care. */
12060 /* oprec > iprec, outer: signed, inner: signed. */
12064 /* oprec > iprec, outer: signed, inner: unsigned. */
12068 /* oprec > iprec, outer: unsigned, inner: signed. */
12072 /* oprec > iprec, outer: unsigned, inner: unsigned. */
12077 }
12081 }
12083 /* Returns the smallest value obtainable by casting something in INNER type to
12084 OUTER type. */
12086 tree
12088 {
12092 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
12093 and obtain 0. */
12095 /* If we are widening something of an unsigned type, OUTER type
12096 contains all values of INNER type. In particular, both INNER
12097 and OUTER types have zero in common. */
12100 else
12101 {
12102 /* If we are widening a signed type to another signed type, we
12103 want to obtain -2^^(iprec-1). If we are keeping the
12104 precision or narrowing to a signed type, we want to obtain
12105 -2^(oprec-1). */
12110 }
12111 }
12113 /* Return nonzero if two operands that are suitable for PHI nodes are
12114 necessarily equal. Specifically, both ARG0 and ARG1 must be either
12115 SSA_NAME or invariant. Note that this is strictly an optimization.
12116 That is, callers of this function can directly call operand_equal_p
12117 and get the same result, only slower. */
12119 int
12121 {
12127 }
12129 /* Returns number of zeros at the end of binary representation of X. */
12131 tree
12133 {
12135 }
12138 #define WALK_SUBTREE(NODE) \
12139 do \
12140 { \
12141 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
12142 if (result) \
12143 return result; \
12144 } \
12145 while (0)
12147 /* This is a subroutine of walk_tree that walks field of TYPE that are to
12148 be walked whenever a type is seen in the tree. Rest of operands and return
12149 value are as for walk_tree. */
12151 static tree
12154 {
12158 {
12162 /* We have to worry about mutually recursive pointers. These can't
12163 be written in C. They can in Ada. It's pathological, but
12164 there's an ACATS test (c38102a) that checks it. Deal with this
12165 by checking if we're pointing to another pointer, that one
12166 points to another pointer, that one does too, and we have no htab.
12167 If so, get a hash table. We check three levels deep to avoid
12168 the cost of the hash table if we don't need one. */
12173 {
12180 }
12182 /* fall through */
12191 /* Fall through. */
12195 {
12196 tree arg;
12198 /* We never want to walk into default arguments. */
12201 }
12205 /* Don't follow this nodes's type if a pointer for fear that
12206 we'll have infinite recursion. If we have a PSET, then we
12207 need not fear. */
12222 }
12225 }
12227 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12228 called with the DATA and the address of each sub-tree. If FUNC returns a
12229 non-NULL value, the traversal is stopped, and the value returned by FUNC
12230 is returned. If PSET is non-NULL it is used to record the nodes visited,
12231 and to avoid visiting a node more than once. */
12233 tree
12236 {
12239 tree result;
12241 #define WALK_SUBTREE_TAIL(NODE) \
12242 do \
12243 { \
12244 tp = & (NODE); \
12245 goto tail_recurse; \
12246 } \
12247 while (0)
12249 tail_recurse:
12250 /* Skip empty subtrees. */
12254 /* Don't walk the same tree twice, if the user has requested
12255 that we avoid doing so. */
12259 /* Call the function. */
12263 /* If we found something, return it. */
12269 /* Even if we didn't, FUNC may have decided that there was nothing
12270 interesting below this point in the tree. */
12272 {
12273 /* But we still need to check our siblings. */
12278 else
12280 }
12283 {
12287 }
12290 {
12303 /* None of these have subtrees other than those already walked
12304 above. */
12313 {
12319 /* Walk all elements but the first. */
12323 /* Now walk the first one as a tail call. */
12325 }
12332 {
12337 idx++)
12339 }
12346 {
12347 tree decl;
12349 {
12350 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12351 into declarations that are just mentioned, rather than
12352 declared; they don't really belong to this part of the tree.
12353 And, we can see cycles: the initializer for a declaration
12354 can refer to the declaration itself. */
12358 }
12360 }
12363 {
12364 tree_stmt_iterator i;
12367 }
12372 {
12376 /* FALLTHRU */
12421 /* FALLTHRU */
12456 {
12461 }
12481 {
12486 }
12490 }
12494 {
12497 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12498 But, we only want to walk once. */
12503 }
12506 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12507 defining. We only want to walk into these fields of a type in this
12508 case and not in the general case of a mere reference to the type.
12510 The criterion is as follows: if the field can be an expression, it
12511 must be walked only here. This should be in keeping with the fields
12512 that are directly gimplified in gimplify_type_sizes in order for the
12513 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12514 variable-sized types.
12516 Note that DECLs get walked as part of processing the BIND_EXPR. */
12518 {
12523 /* Call the function for the type. See if it returns anything or
12524 doesn't want us to continue. If we are to continue, walk both
12525 the normal fields and those for the declaration case. */
12530 /* But do not walk a pointed-to type since it may itself need to
12531 be walked in the declaration case if it isn't anonymous. */
12533 {
12537 }
12539 /* If this is a record type, also walk the fields. */
12541 {
12542 tree field;
12546 {
12547 /* We'd like to look at the type of the field, but we can
12548 easily get infinite recursion. So assume it's pointed
12549 to elsewhere in the tree. Also, ignore things that
12550 aren't fields. */
12559 }
12560 }
12562 /* Same for scalar types. */
12568 {
12571 }
12575 }
12576 /* FALLTHRU */
12580 {
12583 /* Walk over all the sub-trees of this operand. */
12586 /* Go through the subtrees. We need to do this in forward order so
12587 that the scope of a FOR_EXPR is handled properly. */
12589 {
12593 }
12594 }
12595 /* If this is a type, walk the needed fields in the type. */
12599 }
12601 /* We didn't find what we were looking for. */
12604 #undef WALK_SUBTREE_TAIL
12605 }
12606 #undef WALK_SUBTREE
12608 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12610 tree
12612 walk_tree_lh lh)
12613 {
12614 tree result;
12619 }
12622 tree
12624 {
12631 }
12633 void
12635 {
12639 {
12641 }
12642 else
12644 }
12646 /* Create a nameless artificial label and put it in the current
12647 function context. The label has a location of LOC. Returns the
12648 newly created label. */
12650 tree
12652 {
12660 }
12662 /* Given a tree, try to return a useful variable name that we can use
12663 to prefix a temporary that is being assigned the value of the tree.
12664 I.E. given <temp> = &A, return A. */
12668 {
12669 tree stripped_decl;
12676 {
12681 }
12682 else
12683 {
12685 {
12690 }
12691 }
12692 }
12694 /* Return true if TYPE has a variable argument list. */
12696 bool
12698 {
12699 function_args_iterator args_iter;
12706 {
12708 }
12711 }
12713 /* Return true if TYPE has a prototype. */
12715 bool
12717 {
12718 tree t;
12724 }
12726 /* If BLOCK is inlined from an __attribute__((__artificial__))
12727 routine, return pointer to location from where it has been
12728 called. */
12729 location_t *
12731 {
12736 {
12739 {
12740 /* If AO is an artificial inline, point RET to the
12741 call site locus at which it has been inlined and continue
12742 the loop, in case AO's caller is also an artificial
12743 inline. */
12747 else
12749 }
12754 }
12756 }
12759 /* If EXP is inlined from an __attribute__((__artificial__))
12760 function, return the location of the original call expression. */
12762 location_t
12764 {
12769 else
12771 }
12774 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12775 nodes. */
12777 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12779 hashval_t
12781 {
12789 {
12792 }
12797 else
12800 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12801 something else. */
12807 }
12809 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12810 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12811 same. */
12813 bool
12815 {
12828 else
12830 }
12832 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12834 tree
12836 {
12837 tree t;
12839 /* Use the cache of optimization nodes. */
12842 opts);
12847 {
12848 /* Insert this one into the hash table. */
12852 /* Make a new node for next time round. */
12854 }
12857 }
12859 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12861 tree
12863 {
12864 tree t;
12866 /* Use the cache of optimization nodes. */
12869 opts);
12874 {
12875 /* Insert this one into the hash table. */
12879 /* Make a new node for next time round. */
12881 }
12884 }
12886 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12887 so that they aren't saved during PCH writing. */
12889 void
12891 {
12896 }
12898 /* Determine the "ultimate origin" of a block. */
12900 tree
12902 {
12907 else
12908 {
12913 }
12914 }
12916 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12917 no instruction. */
12919 bool
12921 {
12922 /* Do not strip casts into or out of differing address spaces. */
12925 {
12930 }
12933 {
12934 /* We already know that outer_type is not a pointer with
12935 a non-generic address space. */
12937 }
12939 /* Use precision rather then machine mode when we can, which gives
12940 the correct answer even for submode (bit-field) types. */
12949 /* Otherwise fall back on comparing machine modes (e.g. for
12950 aggregate types, floats). */
12952 }
12954 /* Return true iff conversion in EXP generates no instruction. Mark
12955 it inline so that we fully inline into the stripping functions even
12956 though we have two uses of this function. */
12960 {
12975 }
12977 /* Return true iff conversion in EXP generates no instruction. Don't
12978 consider conversions changing the signedness. */
12980 static bool
12982 {
12993 }
12995 /* Strip conversions from EXP according to tree_nop_conversion and
12996 return the resulting expression. */
12998 tree
13000 {
13004 }
13006 /* Strip conversions from EXP according to tree_sign_nop_conversion
13007 and return the resulting expression. */
13009 tree
13011 {
13015 }
13017 /* Avoid any floating point extensions from EXP. */
13018 tree
13020 {
13023 /* For floating point constant look up the narrowest type that can hold
13024 it properly and handle it like (type)(narrowest_type)constant.
13025 This way we can optimize for instance a=a*2.0 where "a" is float
13026 but 2.0 is double constant. */
13028 {
13029 REAL_VALUE_TYPE orig;
13042 }
13061 }
13063 /* Strip out all handled components that produce invariant
13064 offsets. */
13066 const_tree
13068 {
13070 {
13072 {
13087 }
13089 }
13092 }
13096 /* Return the GCC personality function decl. */
13098 tree
13100 {
13104 }
13106 /* TARGET is a call target of GIMPLE call statement
13107 (obtained by gimple_call_fn). Return true if it is
13108 OBJ_TYPE_REF representing an virtual call of C++ method.
13109 (As opposed to OBJ_TYPE_REF representing objc calls
13110 through a cast where middle-end devirtualization machinery
13111 can't apply.) */
13113 bool
13115 {
13124 /* If we do not have BINFO associated, it means that type was built
13125 without devirtualization enabled. Do not consider this a virtual
13126 call. */
13130 }
13132 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
13134 static tree
13136 {
13147 }
13149 /* Try to find a base info of BINFO that would have its field decl at offset
13150 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
13151 found, return, otherwise return NULL_TREE. */
13153 tree
13155 {
13159 {
13161 tree fld;
13170 {
13178 }
13182 /* Offset 0 indicates the primary base, whose vtable contents are
13183 represented in the binfo for the derived class. */
13185 {
13187 /* Offsets in BINFO are in bytes relative to the whole structure
13188 while POS is in bits relative to the containing field. */
13195 {
13198 }
13201 else
13203 binfo_offset);
13204 }
13208 }
13209 }
13211 /* Returns true if X is a typedef decl. */
13213 bool
13215 {
13218 }
13220 /* Returns true iff TYPE is a type variant created for a typedef. */
13222 bool
13224 {
13226 }
13228 /* A class to handle converting a string that might contain
13229 control characters, (eg newline, form-feed, etc), into one
13230 in which contains escape sequences instead. */
13232 class escaped_string
13233 {
13242 };
13244 /* PR 84195: Replace control characters in "unescaped" with their
13245 escaped equivalents. Allow newlines if -fmessage-length has
13246 been set to a non-zero value. This is done here, rather than
13247 where the attribute is recorded as the message length can
13248 change between these two locations. */
13250 void
13252 {
13270 {
13274 {
13278 }
13281 {
13283 {
13284 /* We only allocate space for a new string if we
13285 actually encounter a control character that
13286 needs replacing. */
13290 }
13295 {
13304 }
13305 }
13308 }
13311 {
13315 }
13316 }
13318 /* Warn about a use of an identifier which was marked deprecated. Returns
13319 whether a warning was given. */
13321 bool
13323 {
13324 escaped_string msg;
13330 {
13334 {
13339 }
13340 }
13350 {
13351 auto_diagnostic_group d;
13355 else
13360 }
13362 {
13367 {
13373 }
13375 auto_diagnostic_group d;
13377 {
13381 else
13384 }
13385 else
13386 {
13390 else
13393 }
13397 }
13400 }
13402 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13403 somewhere in it. */
13405 bool
13407 {
13409 {
13414 }
13417 }
13419 /* Try to determine whether a TRY_CATCH expression can fall through.
13420 This is a subroutine of block_may_fallthru. */
13422 static bool
13424 {
13425 tree_stmt_iterator i;
13427 /* If the TRY block can fall through, the whole TRY_CATCH can
13428 fall through. */
13434 {
13436 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13437 catch expression and a body. The whole TRY_CATCH may fall
13438 through iff any of the catch bodies falls through. */
13440 {
13443 }
13447 /* The exception filter expression only matters if there is an
13448 exception. If the exception does not match EH_FILTER_TYPES,
13449 we will execute EH_FILTER_FAILURE, and we will fall through
13450 if that falls through. If the exception does match
13451 EH_FILTER_TYPES, the stack unwinder will continue up the
13452 stack, so we will not fall through. We don't know whether we
13453 will throw an exception which matches EH_FILTER_TYPES or not,
13454 so we just ignore EH_FILTER_TYPES and assume that we might
13455 throw an exception which doesn't match. */
13459 /* This case represents statements to be executed when an
13460 exception occurs. Those statements are implicitly followed
13461 by a RESX statement to resume execution after the exception.
13462 So in this case the TRY_CATCH never falls through. */
13464 }
13465 }
13467 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13468 need not be 100% accurate; simply be conservative and return true if we
13469 don't know. This is used only to avoid stupidly generating extra code.
13470 If we're wrong, we'll just delete the extra code later. */
13472 bool
13474 {
13475 /* This CONST_CAST is okay because expr_last returns its argument
13476 unmodified and we assign it to a const_tree. */
13480 {
13483 /* Easy cases. If the last statement of the block implies
13484 control transfer, then we can't fall through. */
13488 /* If there is a default: label or case labels cover all possible
13489 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13490 to some case label in all cases and all we care is whether the
13491 SWITCH_BODY falls through. */
13508 /* The finally clause is always executed after the try clause,
13509 so if it does not fall through, then the try-finally will not
13510 fall through. Otherwise, if the try clause does not fall
13511 through, then when the finally clause falls through it will
13512 resume execution wherever the try clause was going. So the
13513 whole try-finally will only fall through if both the try
13514 clause and the finally clause fall through. */
13524 else
13526 /* FALLTHRU */
13529 /* Functions that do not return do not fall through. */
13543 }
13544 }
13546 /* True if we are using EH to handle cleanups. */
13549 /* This routine is called from front ends to indicate eh should be used for
13550 cleanups. */
13551 void
13553 {
13555 }
13557 /* Query whether EH is used for cleanups. */
13558 bool
13560 {
13562 }
13564 /* Wrapper for tree_code_name to ensure that tree code is valid */
13567 {
13571 {
13575 }
13578 }
13580 /* Drops the TREE_OVERFLOW flag from T. */
13582 tree
13584 {
13587 /* For tree codes with a sharing machinery re-build the result. */
13591 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13592 and canonicalize the result. */
13594 {
13595 tree_vector_builder builder;
13599 {
13604 }
13606 }
13608 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13609 and drop the flag. */
13613 /* For constants that contain nested constants, drop the flag
13614 from those as well. */
13616 {
13621 }
13624 }
13626 /* Given a memory reference expression T, return its base address.
13627 The base address of a memory reference expression is the main
13628 object being referenced. For instance, the base address for
13629 'array[i].fld[j]' is 'array'. You can think of this as stripping
13630 away the offset part from a memory address.
13632 This function calls handled_component_p to strip away all the inner
13633 parts of the memory reference until it reaches the base object. */
13635 tree
13637 {
13646 /* ??? Either the alias oracle or all callers need to properly deal
13647 with WITH_SIZE_EXPRs before we can look through those. */
13652 }
13654 /* Return a tree of sizetype representing the size, in bytes, of the element
13655 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13657 tree
13659 {
13664 /* If a size was specified in the ARRAY_REF, it's the size measured
13665 in alignment units of the element type. So multiply by that value. */
13667 {
13668 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13669 sizetype from another type of the same width and signedness. */
13674 }
13676 /* Otherwise, take the size from that of the element type. Substitute
13677 any PLACEHOLDER_EXPR that we have. */
13678 else
13680 }
13682 /* Return a tree representing the lower bound of the array mentioned in
13683 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13685 tree
13687 {
13690 /* If a lower bound is specified in EXP, use it. */
13694 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13695 substituting for a PLACEHOLDER_EXPR as needed. */
13699 /* Otherwise, return a zero of the appropriate type. */
13701 }
13703 /* Return a tree representing the upper bound of the array mentioned in
13704 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13706 tree
13708 {
13711 /* If there is a domain type and it has an upper bound, use it, substituting
13712 for a PLACEHOLDER_EXPR as needed. */
13716 /* Otherwise fail. */
13718 }
13720 /* Returns true if REF is an array reference or a component reference
13721 to an array at the end of a structure.
13722 If this is the case, the array may be allocated larger
13723 than its upper bound implies. */
13725 bool
13727 {
13728 tree atype;
13732 {
13735 }
13739 else
13747 {
13748 /* If the reference chain contains a component reference to a
13749 non-union type and there follows another field the reference
13750 is not at the end of a structure. */
13752 {
13754 {
13760 }
13761 }
13762 /* If we have a multi-dimensional array we do not consider
13763 a non-innermost dimension as flex array if the whole
13764 multi-dimensional array is at struct end.
13765 Same for an array of aggregates with a trailing array
13766 member. */
13770 ;
13771 /* If we view an underlying object as sth else then what we
13772 gathered up to now is what we have to rely on. */
13775 else
13779 }
13781 /* The array now is at struct end. Treat flexible arrays as
13782 always subject to extend, even into just padding constrained by
13783 an underlying decl. */
13793 /* If the reference is based on a declared entity, the size of the array
13794 is constrained by its given domain. (Do not trust commons PR/69368). */
13796 && !(flag_unconstrained_commons
13800 {
13801 /* Check whether the array domain covers all of the available
13802 padding. */
13803 poly_int64 offset;
13811 /* If at least one extra element fits it is a flexarray. */
13820 }
13823 }
13825 /* Return a tree representing the offset, in bytes, of the field referenced
13826 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13828 tree
13830 {
13835 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13836 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13837 value. */
13839 {
13840 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13841 sizetype from another type of the same width and signedness. */
13847 }
13849 /* Otherwise, take the offset from that of the field. Substitute
13850 any PLACEHOLDER_EXPR that we have. */
13851 else
13853 }
13855 /* Determines the size of the member referenced by the COMPONENT_REF
13856 REF, using its initializer expression if necessary in order to
13857 determine the size of an initialized flexible array member.
13858 Returns the size (which might be zero for an object with
13859 an uninitialized flexible array member) or null if the size
13860 cannot be determined. */
13862 tree
13864 {
13869 /* If the member is not an array, or is not last, or is an array with
13870 more than one element, return its size. Otherwise it's either
13871 a bona fide flexible array member, or a zero-length array member,
13872 or an array of length one treated as such. */
13875 {
13887 {
13892 }
13893 }
13895 /* If the reference is to a declared object and the member a true
13896 flexible array, try to determine its size from its initializer. */
13902 /* The size of any member of a declared object other than a flexible
13903 array member is that obtained above. */
13909 {
13914 }
13916 /* Return "don't know" for an external non-array object since its
13917 flexible array member can be initialized to have any number of
13918 elements. Otherwise, return zero because the flexible array
13919 member has no elements. */
13922 }
13924 /* Return the machine mode of T. For vectors, returns the mode of the
13925 inner type. The main use case is to feed the result to HONOR_NANS,
13926 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13928 machine_mode
13930 {
13936 }
13938 /* Vector types need to re-check the target flags each time we report
13939 the machine mode. We need to do this because attribute target can
13940 change the result of vector_mode_supported_p and have_regs_of_mode
13941 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13942 change on a per-function basis. */
13943 /* ??? Possibly a better solution is to run through all the types
13944 referenced by a function and re-compute the TYPE_MODE once, rather
13945 than make the TYPE_MODE macro call a function. */
13947 machine_mode
13949 {
13950 machine_mode mode;
13958 {
13959 scalar_int_mode innermode;
13961 /* For integers, try mapping it to a same-sized scalar mode. */
13963 {
13966 scalar_int_mode mode;
13970 }
13973 }
13976 }
13978 /* Verify that basic properties of T match TV and thus T can be a variant of
13979 TV. TV should be the more specified variant (i.e. the main variant). */
13981 static bool
13983 {
13984 /* Type variant can differ by:
13986 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13987 ENCODE_QUAL_ADDR_SPACE.
13988 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13989 in this case some values may not be set in the variant types
13990 (see TYPE_COMPLETE_P checks).
13991 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13992 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13993 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13994 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13995 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13996 this is necessary to make it possible to merge types form different TUs
13997 - arrays, pointers and references may have TREE_TYPE that is a variant
13998 of TREE_TYPE of their main variants.
13999 - aggregates may have new TYPE_FIELDS list that list variants of
14000 the main variant TYPE_FIELDS.
14001 - vector types may differ by TYPE_VECTOR_OPAQUE
14002 */
14004 /* Convenience macro for matching individual fields. */
14005 #define verify_variant_match(flag) \
14006 do { \
14007 if (flag (tv) != flag (t)) \
14008 { \
14010 debug_tree (tv); \
14011 return false; \
14012 } \
14013 } while (false)
14015 /* tree_base checks. */
14018 /* FIXME: Ada builds non-artificial variants of artificial types. */
14023 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
14030 else
14032 /* FIXME: This check trigger during libstdc++ build. */
14036 /* tree_type_common checks. */
14039 {
14047 {
14057 }
14058 }
14065 /* During LTO we merge variant lists from diferent translation units
14066 that may differ BY TYPE_CONTEXT that in turn may point
14067 to TRANSLATION_UNIT_DECL.
14068 Ada also builds variants of types with different TYPE_CONTEXT. */
14076 {
14080 }
14082 /* tree_type_non_common checks. */
14084 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14085 and dangle the pointer from time to time. */
14089 {
14093 }
14099 {
14102 }
14109 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14110 or even type's main variant. This is needed to make bootstrap pass
14111 and the bug seems new in GCC 5.
14112 C++ FE should be updated to make this consistent and we should check
14113 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14114 is a match with main variant.
14116 Also disable the check for Java for now because of parser hack that builds
14117 first an dummy BINFO and then sometimes replace it by real BINFO in some
14118 of the copies. */
14121 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14122 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14123 at LTO time only. */
14125 {
14133 }
14135 /* Check various uses of TYPE_VALUES_RAW. */
14141 /* Permit incomplete variants of complete type. While FEs may complete
14142 all variants, this does not happen for C++ templates in all cases. */
14146 {
14149 /* Fortran builds qualified variants as new records with items of
14150 qualified type. Verify that they looks same. */
14157 /* FIXME: gfc_nonrestricted_type builds all types as variants
14158 with exception of pointer types. It deeply copies the type
14159 which means that we may end up with a variant type
14160 referring non-variant pointer. We may change it to
14161 produce types as variants, too, like
14162 objc_get_protocol_qualified_type does. */
14168 {
14176 }
14177 }
14180 /* For C++ the qualified variant of array type is really an array type
14181 of qualified TREE_TYPE.
14182 objc builds variants of pointer where pointer to type is a variant, too
14183 in objc_get_protocol_qualified_type. */
14189 {
14197 }
14200 {
14208 }
14210 #undef verify_variant_match
14211 }
14214 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14215 the middle-end types_compatible_p function. It needs to avoid
14216 claiming types are different for types that should be treated
14217 the same with respect to TBAA. Canonical types are also used
14218 for IL consistency checks via the useless_type_conversion_p
14219 predicate which does not handle all type kinds itself but falls
14220 back to pointer-comparison of TYPE_CANONICAL for aggregates
14221 for example. */
14223 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14224 type calculation because we need to allow inter-operability between signed
14225 and unsigned variants. */
14227 bool
14229 {
14230 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14231 signed char and unsigned char. Similarly fortran FE builds
14232 C_SIZE_T as signed type, while C defines it unsigned. */
14235 == INTEGER_TYPE
14238 }
14240 /* Return true iff T1 and T2 are structurally identical for what
14241 TBAA is concerned.
14242 This function is used both by lto.c canonical type merging and by the
14243 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14244 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14245 only for LTO because only in these cases TYPE_CANONICAL equivalence
14246 correspond to one defined by gimple_canonical_types_compatible_p. */
14248 bool
14251 {
14252 /* Type variants should be same as the main variant. When not doing sanity
14253 checking to verify this fact, go to main variants and save some work. */
14255 {
14258 }
14260 /* Check first for the obvious case of pointer identity. */
14264 /* Check that we have two types to compare. */
14268 /* We consider complete types always compatible with incomplete type.
14269 This does not make sense for canonical type calculation and thus we
14270 need to ensure that we are never called on it.
14272 FIXME: For more correctness the function probably should have three modes
14273 1) mode assuming that types are complete mathcing their structure
14274 2) mode allowing incomplete types but producing equivalence classes
14275 and thus ignoring all info from complete types
14276 3) mode allowing incomplete types to match complete but checking
14277 compatibility between complete types.
14279 1 and 2 can be used for canonical type calculation. 3 is the real
14280 definition of type compatibility that can be used i.e. for warnings during
14281 declaration merging. */
14286 /* If the types have been previously registered and found equal
14287 they still are. */
14291 {
14292 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14293 they are always NULL, but they are set to non-NULL for types
14294 constructed by build_pointer_type and variants. In this case the
14295 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14296 all pointers are considered equal. Be sure to not return false
14297 negatives. */
14301 }
14303 /* For types where we do ODR based TBAA the canonical type is always
14304 set correctly, so we know that types are different if their
14305 canonical types does not match. */
14311 /* Can't be the same type if the types don't have the same code. */
14316 /* Qualifiers do not matter for canonical type comparison purposes. */
14318 /* Void types and nullptr types are always the same. */
14323 /* Can't be the same type if they have different mode. */
14327 /* Non-aggregate types can be handled cheaply. */
14335 {
14336 /* Can't be the same type if they have different recision. */
14340 /* In some cases the signed and unsigned types are required to be
14341 inter-operable. */
14346 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14347 interoperable with "signed char". Unless all frontends are revisited
14348 to agree on these types, we must ignore the flag completely. */
14350 /* Fortran standard define C_PTR type that is compatible with every
14351 C pointer. For this reason we need to glob all pointers into one.
14352 Still pointers in different address spaces are not compatible. */
14354 {
14358 }
14360 /* Tail-recurse to components. */
14365 trust_type_canonical);
14368 }
14370 /* Do type-specific comparisons. */
14372 {
14374 /* Array types are the same if the element types are the same and
14375 the number of elements are the same. */
14377 trust_type_canonical)
14382 else
14383 {
14387 /* For an incomplete external array, the type domain can be
14388 NULL_TREE. Check this condition also. */
14393 else
14394 {
14400 /* The minimum/maximum values have to be the same. */
14412 else
14414 }
14415 }
14419 /* Function types are the same if the return type and arguments types
14420 are the same. */
14422 trust_type_canonical))
14427 else
14428 {
14434 {
14437 trust_type_canonical))
14439 }
14445 }
14450 {
14453 /* Don't try to compare variants of an incomplete type, before
14454 TYPE_FIELDS has been copied around. */
14462 /* For aggregate types, all the fields must be the same. */
14466 {
14467 /* Skip non-fields and zero-sized fields. */
14478 /* The fields must have the same name, offset and type. */
14481 || !gimple_canonical_types_compatible_p
14483 trust_type_canonical))
14485 }
14487 /* If one aggregate has more fields than the other, they
14488 are not the same. */
14493 }
14496 /* Consider all types with language specific trees in them mutually
14497 compatible. This is executed only from verify_type and false
14498 positives can be tolerated. */
14501 }
14502 }
14504 /* Verify type T. */
14506 void
14508 {
14512 {
14515 }
14517 {
14521 }
14527 ;
14529 {
14533 }
14534 /* Method and function types cannot be used to address memory and thus
14535 TYPE_CANONICAL really matters only for determining useless conversions.
14537 FIXME: C++ FE produce declarations of builtin functions that are not
14538 compatible with main variants. */
14540 ;
14542 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14543 with variably sized arrays because their sizes possibly
14544 gimplified to different variables. */
14548 {
14552 }
14556 {
14560 }
14562 {
14567 }
14570 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14572 {
14573 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14574 and danagle the pointer from time to time. */
14578 {
14582 }
14583 }
14585 {
14588 {
14592 }
14593 }
14595 {
14598 {
14602 }
14603 }
14606 {
14607 /* FIXME: The following check should pass:
14608 useless_type_conversion_p (const_cast <tree> (t),
14609 TREE_TYPE (TYPE_MIN_VALUE (t))
14610 but does not for C sizetypes in LTO. */
14611 }
14613 /* Check various uses of TYPE_MAXVAL_RAW. */
14615 {
14617 ;
14619 {
14623 }
14625 {
14629 }
14630 }
14632 {
14636 {
14640 }
14641 }
14643 {
14647 {
14651 }
14652 }
14655 {
14656 /* FIXME: The following check should pass:
14657 useless_type_conversion_p (const_cast <tree> (t),
14658 TREE_TYPE (TYPE_MAX_VALUE (t))
14659 but does not for C sizetypes in LTO. */
14660 }
14662 {
14665 {
14669 }
14670 }
14672 {
14676 }
14679 {
14683 }
14685 /* Check various uses of TYPE_VALUES_RAW. */
14688 {
14692 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14693 CONST_DECL of ENUMERAL TYPE. */
14695 {
14700 }
14703 {
14709 }
14711 {
14716 }
14717 }
14719 {
14721 {
14725 }
14726 }
14728 {
14730 {
14733 }
14735 {
14736 /* TODO: verify properties of decls. */
14738 ;
14740 ;
14742 ;
14744 ;
14746 ;
14748 ;
14750 ;
14751 else
14752 {
14756 }
14757 }
14758 }
14765 {
14767 {
14772 }
14774 {
14778 }
14779 /* Verify just enough of cache to ensure that no one copied it to new type.
14780 All copying should go by copy_node that should clear it. */
14782 {
14787 {
14792 }
14793 }
14794 }
14797 {
14798 /* C++ FE uses TREE_PURPOSE to store initial values. */
14800 {
14804 }
14806 {
14810 }
14811 }
14813 {
14817 }
14825 {
14828 }
14830 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14831 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14832 of a type. */
14835 {
14838 }
14841 {
14844 }
14845 }
14848 /* Return 1 if ARG interpreted as signed in its precision is known to be
14849 always positive or 2 if ARG is known to be always negative, or 3 if
14850 ARG may be positive or negative. */
14852 int
14854 {
14861 {
14865 else
14867 }
14871 {
14873 /* Narrower value zero extended into wider type
14874 will always result in positive values. */
14881 }
14887 {
14891 {
14895 {
14904 }
14905 }
14907 }
14909 {
14910 /* For unsigned values, the "positive" range comes
14911 below the "negative" range. */
14916 }
14917 else
14918 {
14923 }
14925 }
14930 /* Return true if ARG is marked with the nonnull attribute in the
14931 current function signature. */
14933 bool
14935 {
14943 /* The static chain decl is always non null. */
14947 /* THIS argument of method is always non-NULL. */
14953 /* Values passed by reference are always non-NULL. */
14960 {
14963 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14967 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14971 /* Get the position number for ARG in the function signature. */
14973 t;
14975 {
14978 }
14982 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14984 {
14987 }
14988 }
14991 }
14993 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14994 information. */
14996 location_t
14998 {
15002 }
15004 location_t
15006 {
15007 source_range src_range;
15011 }
15013 location_t
15015 {
15021 pure_loc,
15022 src_range,
15023 NULL);
15026 }
15028 /* Return EXPR, potentially wrapped with a node expression LOC,
15029 if !CAN_HAVE_LOCATION_P (expr).
15031 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
15032 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
15034 Wrapper nodes can be identified using location_wrapper_p. */
15036 tree
15038 {
15045 /* We should only be adding wrappers for constants and for decls,
15046 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
15051 /* For now, don't add wrappers to exceptional tree nodes, to minimize
15052 any impact of the wrapper nodes. */
15056 /* If any auto_suppress_location_wrappers are active, don't create
15057 wrappers. */
15061 tree_code code
15066 /* Mark this node as being a wrapper. */
15069 }
15073 /* Return the name of combined function FN, for debugging purposes. */
15077 {
15079 {
15082 }
15083 else
15085 }
15087 /* Return a bitmap with a bit set corresponding to each argument in
15088 a function call type FNTYPE declared with attribute nonnull,
15089 or null if none of the function's argument are nonnull. The caller
15090 must free the bitmap. */
15092 bitmap
15094 {
15104 /* A function declaration can specify multiple attribute nonnull,
15105 each with zero or more arguments. The loop below creates a bitmap
15106 representing a union of all the arguments. An empty (but non-null)
15107 bitmap means that all arguments have been declaraed nonnull. */
15109 {
15118 {
15119 /* Clear the bitmap in case a previous attribute nonnull
15120 set it and this one overrides it for all arguments. */
15123 }
15125 /* Iterate over the indices of the format arguments declared nonnull
15126 and set a bit for each. */
15128 {
15131 }
15132 }
15135 }
15137 /* Returns true if TYPE is a type where it and all of its subobjects
15138 (recursively) are of structure, union, or array type. */
15140 static bool
15142 {
15144 {
15151 }
15157 }
15159 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15160 that shouldn't be passed via stack. */
15162 bool
15164 {
15175 }
15177 /* Like int_size_in_bytes, but handle empty records specially. */
15179 HOST_WIDE_INT
15181 {
15183 }
15185 /* Like size_in_bytes, but handle empty records specially. */
15187 tree
15189 {
15191 }
15193 /* Return true if an expression with CODE has to have the same result type as
15194 its first operand. */
15196 bool
15198 {
15200 {
15234 }
15235 }
15237 /* Return a typenode for the "standard" C type with a given name. */
15238 tree
15240 {
15272 }
15274 /* List of pointer types used to declare builtins before we have seen their
15275 real declaration.
15277 Keep the size up to date in tree.h ! */
15279 {
15286 };
15288 /* Return the maximum object size. */
15290 tree
15292 {
15293 /* To do: Make this a configurable parameter. */
15295 }
15297 #if CHECKING_P
15301 /* Selftests for tree. */
15303 /* Verify that integer constants are sane. */
15305 static void
15307 {
15320 }
15322 /* Verify identifiers. */
15324 static void
15326 {
15330 }
15332 /* Verify LABEL_DECL. */
15334 static void
15336 {
15342 }
15344 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15345 are given by VALS. */
15347 static tree
15349 {
15354 }
15356 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15358 static void
15360 {
15366 }
15368 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15369 and that its elements match EXPECTED. */
15371 static void
15374 {
15381 }
15383 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15384 and NPATTERNS background elements, and that its elements match
15385 EXPECTED. */
15387 static void
15390 {
15397 }
15399 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15400 and that its elements match EXPECTED. */
15402 static void
15405 {
15412 }
15414 /* Test the creation of VECTOR_CSTs. */
15416 static void
15418 {
15424 /* Test a simple linear series with a base of 0 and a step of 1:
15425 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15431 /* Try the same with the first element replaced by 100:
15432 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15437 /* Try a series that wraps around.
15438 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15444 /* Try a downward series:
15445 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15451 /* Try two interleaved series with different bases and steps:
15452 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15455 {
15458 }
15462 /* Try a duplicated value:
15463 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15469 /* Try an interleaved duplicated value:
15470 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15477 /* Try a duplicated value with 2 exceptions
15478 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15484 /* Try with and without a step
15485 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15491 /* Try a fully-general constant:
15492 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15496 }
15498 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15499 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15500 modifying its argument in-place. */
15502 static void
15504 {
15507 }
15509 /* Verify location wrappers. */
15511 static void
15513 {
15518 /* Wrapping a constant. */
15528 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15531 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15536 /* Wrapping a STRING_CST. */
15548 /* Wrapping a variable. */
15551 integer_type_node);
15560 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15561 wrapper. */
15566 /* Verify that STRIP_NOPS removes wrappers. */
15570 }
15572 /* Test various tree predicates. Verify that location wrappers don't
15573 affect the results. */
15575 static void
15577 {
15578 /* Build various constants and wrappers around them. */
15606 /* TODO: vector constants. */
15608 /* Test integer_onep. */
15628 /* Test integer_zerop. */
15648 /* Test integer_all_onesp. */
15668 /* Test integer_minus_onep. */
15688 /* Test integer_each_onep. */
15708 /* Test integer_truep. */
15728 /* Test integer_nonzerop. */
15748 /* Test real_zerop. */
15768 /* Test real_onep. */
15788 /* Test real_minus_onep. */
15808 /* Test zerop. */
15828 /* Test tree_expr_nonnegative_p. */
15848 /* Test tree_expr_nonzero_p. */
15856 /* Test integer_valued_real_p. */
15863 /* Test integer_pow2p. */
15868 /* Test uniform_integer_cst_p. */
15887 }
15889 /* Check that string escaping works correctly. */
15891 static void
15893 {
15895 escaped_string msg;
15898 /* ASSERT_STREQ does not accept NULL as a valid test
15899 result, so we have to use ASSERT_EQ instead. */
15908 /* Ensure that we have -fmessage-length set to 0. */
15918 /* Now repeat the tests with -fmessage-length set to 5. */
15921 /* Note that the newline is not translated into an escape. */
15928 /* Restore the original message length setting. */
15930 }
15932 /* Run all of the selftests within this file. */
15934 void
15936 {
15944 }