| blob | dfcdf6822f136b8ea3d085429945938f94d776bc |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2022 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. */
73 /* Tree code classes. */
75 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
76 #define END_OF_BASE_TREE_CODES tcc_exceptional,
80 };
82 #undef DEFTREECODE
83 #undef END_OF_BASE_TREE_CODES
85 /* Table indexed by tree code giving number of expression
86 operands beyond the fixed part of the node structure.
87 Not used for types or decls. */
89 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
90 #define END_OF_BASE_TREE_CODES 0,
94 };
96 #undef DEFTREECODE
97 #undef END_OF_BASE_TREE_CODES
99 /* Names of tree components.
100 Used for printing out the tree and error messages. */
101 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
106 };
108 #undef DEFTREECODE
109 #undef END_OF_BASE_TREE_CODES
111 /* Each tree code class has an associated string representation.
112 These must correspond to the tree_code_class entries. */
115 {
126 "expression"
127 };
129 /* obstack.[ch] explicitly declined to prototype this. */
132 /* Statistics-gathering stuff. */
138 /* Keep in sync with tree.h:enum tree_node_kind. */
156 };
158 /* Unique id for next decl created. */
160 /* Unique id for next type created. */
162 /* Unique id for next debug decl created. Use negative numbers,
163 to catch erroneous uses. */
166 /* Since we cannot rehash a type after it is in the table, we have to
167 keep the hash code. */
171 tree type;
172 };
174 /* Initial size of the hash table (rounded to next prime). */
175 #define TYPE_HASH_INITIAL_SIZE 1000
178 {
182 static int
184 {
186 }
187 };
189 /* Now here is the hash table. When recording a type, it is added to
190 the slot whose index is the hash code. Note that the hash table is
191 used for several kinds of types (function types, array types and
192 array index range types, for now). While all these live in the
193 same table, they are completely independent, and the hash code is
194 computed differently for each of these. */
198 /* Hash table and temporary node for larger integer const values. */
202 {
205 };
209 /* Class and variable for making sure that there is a single POLY_INT_CST
210 for a given value. */
212 {
216 };
220 /* Hash table for optimization flags and target option flags. Use the same
221 hash table for both sets of options. Nodes for building the current
222 optimization and target option nodes. The assumption is most of the time
223 the options created will already be in the hash table, so we avoid
224 allocating and freeing up a node repeatably. */
229 {
232 };
236 /* General tree->tree mapping structure for use in hash tables. */
261 /* Number of operands for each OMP clause. */
263 {
349 };
352 {
438 };
441 /* Return the tree node structure used by tree code CODE. */
445 {
447 {
450 {
462 }
476 }
479 {
480 /* tcc_constant cases. */
490 /* tcc_exceptional cases. */
507 }
508 }
511 /* Initialize tree_contains_struct to describe the hierarchy of tree
512 nodes. */
514 static void
516 {
520 {
527 /* Mark the TS structure itself. */
530 /* Mark all the structures that TS is derived from. */
532 {
612 }
613 }
615 /* Basic consistency checks for attributes used in fold. */
656 }
659 /* Init tree.cc. */
661 void
663 {
664 /* Initialize the hash table of types. */
665 type_hash_table
668 debug_expr_for_decl
671 value_expr_for_decl
685 /* Initialize the tree_contains_struct array. */
688 }
690 \f
691 /* The name of the object as the assembler will see it (but before any
692 translations made by ASM_OUTPUT_LABELREF). Often this is the same
693 as DECL_NAME. It is an IDENTIFIER_NODE. */
694 tree
696 {
700 }
702 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
703 (either of which may be NULL). Inform the FE, if this changes the
704 name. */
706 void
708 {
711 }
713 /* Return true if DECL may need an assembler name to be set. */
717 {
718 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
719 Rule merging. This makes type_odr_p to return true on those types during
720 LTO and by comparing the mangled name, we can say what types are intended
721 to be equivalent across compilation unit.
723 We do not store names of type_in_anonymous_namespace_p.
725 Record, union and enumeration type have linkage that allows use
726 to check type_in_anonymous_namespace_p. We do not mangle compound types
727 that always can be compared structurally.
729 Similarly for builtin types, we compare properties of their main variant.
730 A special case are integer types where mangling do make differences
731 between char/signed char/unsigned char etc. Storing name for these makes
732 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
733 See cp/mangle.cc:write_builtin_type for details. */
736 {
749 }
750 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
754 /* If DECL already has its assembler name set, it does not need a
755 new one. */
760 /* Abstract decls do not need an assembler name. */
764 /* For VAR_DECLs, only static, public and external symbols need an
765 assembler name. */
773 {
774 /* Do not set assembler name on builtins. Allow RTL expansion to
775 decide whether to expand inline or via a regular call. */
780 /* Functions represented in the callgraph need an assembler name. */
784 /* Unused and not public functions don't need an assembler name. */
787 }
790 }
792 /* If T needs an assembler name, have one created for it. */
794 void
796 {
798 {
799 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
800 diagnostics that use input_location to show locus
801 information. The problem here is that, at this point,
802 input_location is generally anchored to the end of the file
803 (since the parser is long gone), so we don't have a good
804 position to pin it to.
806 To alleviate this problem, this uses the location of T's
807 declaration. Examples of this are
808 testsuite/g++.dg/template/cond2.C and
809 testsuite/g++.dg/template/pr35240.C. */
816 }
817 }
819 /* When the target supports COMDAT groups, this indicates which group the
820 DECL is associated with. This can be either an IDENTIFIER_NODE or a
821 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
822 tree
824 {
829 }
831 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
832 tree
834 {
839 }
841 /* When the target supports named section, return its name as IDENTIFIER_NODE
842 or NULL if it is in no section. */
845 {
850 }
852 /* Set section name of NODE to VALUE (that is expected to be
853 identifier node) */
854 void
856 {
860 {
864 }
867 else
870 }
872 /* Set section name of NODE to match the section name of OTHER.
874 set_decl_section_name (decl, other) is equivalent to
875 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
876 efficient. */
877 void
879 {
882 {
886 else
889 }
890 else
891 {
896 }
897 }
899 /* Return TLS model of a variable NODE. */
900 enum tls_model
902 {
907 }
909 /* Set TLS model of variable NODE to MODEL. */
910 void
912 {
916 {
920 }
921 else
924 }
926 /* Compute the number of bytes occupied by a tree with code CODE.
927 This function cannot be used for nodes that have variable sizes,
928 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
929 size_t
931 {
933 {
936 {
953 }
957 {
981 }
994 {
1006 }
1010 {
1031 }
1035 }
1036 }
1038 /* Compute the number of bytes occupied by NODE. This routine only
1039 looks at TREE_CODE, except for those nodes that have variable sizes. */
1040 size_t
1042 {
1045 {
1075 else
1077 }
1078 }
1080 /* Return tree node kind based on tree CODE. */
1082 static tree_node_kind
1084 {
1088 {
1106 {
1123 }
1129 }
1130 }
1132 /* Record interesting allocation statistics for a tree node with CODE
1133 and LENGTH. */
1135 static void
1137 {
1146 }
1148 /* Allocate and return a new UID from the DECL_UID namespace. */
1150 int
1152 {
1154 }
1156 /* Return a newly allocated node of code CODE. For decl and type
1157 nodes, some other fields are initialized. The rest of the node is
1158 initialized to zero. This function cannot be used for TREE_VEC,
1159 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1160 tree_code_size.
1162 Achoo! I got a code in the node. */
1164 tree
1166 {
1167 tree t;
1177 {
1185 {
1187 {
1190 }
1191 else
1193 }
1197 else
1198 {
1201 }
1214 /* Default to no attributes for type, but let target change that. */
1218 /* We have not yet computed the alias set for this type. */
1228 {
1236 /* All of these have side-effects, no matter what their
1237 operands are. */
1243 }
1248 {
1261 }
1265 /* Other classes need no special treatment. */
1267 }
1270 }
1272 /* Free tree node. */
1274 void
1276 {
1279 {
1289 }
1301 }
1302 \f
1303 /* Return a new node with the same contents as NODE except that its
1304 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1306 tree
1308 {
1309 tree t;
1326 {
1329 else
1330 {
1334 }
1337 {
1340 }
1341 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1343 {
1346 }
1348 {
1351 }
1353 {
1356 }
1357 }
1359 {
1361 /* The following is so that the debug code for
1362 the copy is different from the original type.
1363 The two statements usually duplicate each other
1364 (because they clear fields of the same union),
1365 but the optimizer should catch that. */
1369 /* Do not copy the values cache. */
1371 {
1374 }
1375 }
1377 {
1381 }
1383 {
1387 }
1390 }
1392 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1393 For example, this can copy a list made of TREE_LIST nodes. */
1395 tree
1397 {
1398 tree head;
1407 {
1411 }
1413 }
1415 \f
1416 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1417 INTEGER_CST with value CST and type TYPE. */
1419 static unsigned int
1421 {
1423 /* We need extra HWIs if CST is an unsigned integer with its
1424 upper bit set. */
1428 }
1430 /* Return a new INTEGER_CST with value CST and type TYPE. */
1432 static tree
1434 {
1440 {
1446 }
1449 {
1450 len--;
1454 }
1460 }
1462 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1464 static tree
1466 CXX_MEM_STAT_INFO)
1467 {
1479 }
1481 /* Create a constant tree that contains CST sign-extended to TYPE. */
1483 tree
1485 {
1486 /* Support legacy code. */
1491 }
1493 /* Create a constant tree that contains CST zero-extended to TYPE. */
1495 tree
1497 {
1499 }
1501 /* Create a constant tree that contains CST sign-extended to TYPE. */
1503 tree
1505 {
1508 }
1510 /* Constructs tree in type TYPE from with value given by CST. Signedness
1511 of CST is assumed to be the same as the signedness of TYPE. */
1513 tree
1515 {
1517 }
1519 /* We force the wide_int CST to the range of the type TYPE by sign or
1520 zero extending it. OVERFLOWABLE indicates if we are interested in
1521 overflow of the value, when >0 we are only interested in signed
1522 overflow, for <0 we are interested in any overflow. OVERFLOWED
1523 indicates whether overflow has already occurred. CONST_OVERFLOWED
1524 indicates whether constant overflow has already occurred. We force
1525 T's value to be within range of T's type (by setting to 0 or 1 all
1526 the bits outside the type's range). We set TREE_OVERFLOWED if,
1527 OVERFLOWED is nonzero,
1528 or OVERFLOWABLE is >0 and signed overflow occurs
1529 or OVERFLOWABLE is <0 and any overflow occurs
1530 We return a new tree node for the extended wide_int. The node
1531 is shared if no overflow flags are set. */
1534 tree
1537 {
1540 /* If we need to set overflow flags, return a new unshared node. */
1542 {
1546 {
1548 sign);
1549 tree t;
1552 else
1553 {
1556 {
1559 }
1561 }
1564 }
1565 }
1567 /* Else build a shared node. */
1569 }
1571 /* These are the hash table functions for the hash table of INTEGER_CST
1572 nodes of a sizetype. */
1574 /* Return the hash code X, an INTEGER_CST. */
1576 hashval_t
1578 {
1587 }
1589 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1590 is the same as that given by *Y, which is the same. */
1592 bool
1594 {
1608 }
1610 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1611 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1612 number of slots that can be cached for the type. */
1617 {
1619 /* Initialize cache. */
1621 {
1624 }
1627 {
1628 /* Create a new shared int. */
1631 }
1633 }
1635 /* Create an INT_CST node of TYPE and value CST.
1636 The returned node is always shared. For small integers we use a
1637 per-type vector cache, for larger ones we use a single hash table.
1638 The value is extended from its precision according to the sign of
1639 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1640 the upper bits and ensures that hashing and value equality based
1641 upon the underlying HOST_WIDE_INTs works without masking. */
1643 static tree
1645 {
1646 tree t;
1654 /* Verify that everything is canonical. */
1657 {
1662 }
1669 {
1670 /* Cache NULL pointer and zero bounds. */
1673 /* Cache upper bounds of pointers. */
1676 /* Cache 1 which is used for a non-zero range. */
1681 {
1683 /* Make sure no one is clobbering the shared constant. */
1687 }
1688 }
1690 {
1691 /* We just need to store a single HOST_WIDE_INT. */
1692 HOST_WIDE_INT hwi;
1695 else
1699 {
1702 /* Fallthru. */
1706 /* Ignore pointers, as they were already handled above. */
1710 /* Cache false or true. */
1719 {
1720 /* Cache [0, N). */
1724 }
1725 else
1726 {
1727 /* Cache [-1, N). */
1731 }
1739 }
1742 {
1744 /* Make sure no one is clobbering the shared constant. */
1751 }
1752 else
1753 {
1754 /* Use the cache of larger shared ints, using int_cst_node as
1755 a temporary. */
1763 {
1764 /* Insert this one into the hash table. */
1767 /* Make a new node for next time round. */
1769 }
1770 }
1771 }
1772 else
1773 {
1774 /* The value either hashes properly or we drop it on the floor
1775 for the gc to take care of. There will not be enough of them
1776 to worry about. */
1782 {
1783 /* Insert this one into the hash table. */
1786 }
1787 else
1789 }
1792 }
1794 hashval_t
1796 {
1804 }
1806 bool
1808 {
1815 }
1817 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1818 The elements must also have type TYPE. */
1820 tree
1822 {
1833 INSERT);
1835 {
1840 }
1842 }
1844 /* Create a constant tree with value VALUE in type TYPE. */
1846 tree
1848 {
1852 }
1854 /* Insert INTEGER_CST T into a cache of integer constants. And return
1855 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1856 is false, and T falls into the type's 'smaller values' range, there
1857 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1858 or the value is large, should an existing entry exist, it is
1859 returned (rather than inserting T). */
1861 tree
1863 {
1871 /* The caching indices here must match those in
1872 wide_int_to_type_1. */
1874 {
1877 /* Fallthru. */
1881 {
1889 }
1893 /* Cache false or true. */
1902 {
1903 /* Cache 0..N */
1906 /* This is a little hokie, but if the prec is smaller than
1907 what is necessary to hold param_integer_share_limit, then the
1908 obvious test will not get the correct answer. */
1910 {
1914 }
1917 }
1918 else
1919 {
1920 /* Cache -1..N */
1926 {
1928 {
1931 }
1934 }
1935 }
1939 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1940 members. */
1945 }
1948 {
1949 /* Look for it in the type's vector of small shared ints. */
1951 {
1954 }
1957 {
1960 }
1961 else
1963 }
1964 else
1965 {
1966 /* Use the cache of larger shared ints. */
1969 {
1970 /* If there is already an entry for the number verify it's the
1971 same value. */
1973 /* And return the cached value. */
1975 }
1976 else
1977 /* Otherwise insert this one into the hash table. */
1979 }
1982 }
1985 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1986 and the rest are zeros. */
1988 tree
1990 {
1995 }
1997 /* Checks that X is integer constant that can be expressed in (unsigned)
1998 HOST_WIDE_INT without loss of precision. */
2000 bool
2002 {
2005 }
2007 /* Build a newly constructed VECTOR_CST with the given values of
2008 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2010 tree
2013 {
2015 tree t;
2031 }
2033 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2034 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2036 tree
2038 {
2043 tree value;
2045 /* We can't construct a VECTOR_CST for a variable number of elements. */
2049 {
2051 {
2052 /* If NELTS is constant then this must be too. */
2056 }
2057 else
2059 }
2064 }
2066 /* Build a vector of type VECTYPE where all the elements are SCs. */
2067 tree
2069 {
2075 /* Verify that the vector type is suitable for SC. Note that there
2076 is some inconsistency in the type-system with respect to restrict
2077 qualifications of pointers. Vector types always have a main-variant
2078 element type and the qualification is applied to the vector-type.
2079 So TREE_TYPE (vector-type) does not return a properly qualified
2080 vector element-type. */
2085 {
2089 }
2092 else
2093 {
2099 }
2100 }
2102 /* If TYPE is not a vector type, just return SC, otherwise return
2103 build_vector_from_val (TYPE, SC). */
2105 tree
2107 {
2112 }
2114 /* Build a vector series of type TYPE in which element I has the value
2115 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2116 and a VEC_SERIES_EXPR otherwise. */
2118 tree
2120 {
2124 {
2134 }
2136 }
2138 /* Return a vector with the same number of units and number of bits
2139 as VEC_TYPE, but in which the elements are a linear series of unsigned
2140 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2142 tree
2144 {
2149 {
2150 index_elt_type = build_nonstandard_integer_type
2153 }
2159 }
2161 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2162 elements are A and the rest are B. */
2164 tree
2166 {
2169 /* Optimize the constant case. */
2176 }
2178 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2179 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2181 void
2183 {
2185 tree val;
2191 {
2192 /* Mostly ctors will have elts that don't have side-effects, so
2193 the usual case is to scan all the elements. Hence a single
2194 loop for both const and side effects, rather than one loop
2195 each (with early outs). */
2200 }
2204 }
2206 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2207 CONSTRUCTOR C. */
2209 void
2211 {
2213 tree val;
2219 {
2224 }
2225 }
2227 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2228 are in the vec pointed to by VALS. */
2229 tree
2231 {
2240 }
2242 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2243 INDEX and VALUE. */
2244 tree
2246 {
2254 }
2257 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2258 are in a list pointed to by VALS. */
2259 tree
2261 {
2262 tree t;
2266 {
2270 }
2273 }
2275 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2276 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2277 fields in the constructor remain null. */
2279 tree
2281 {
2288 }
2290 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2291 of elements, provided as index/value pairs. */
2293 tree
2295 {
2302 {
2306 }
2309 }
2311 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2313 tree
2315 {
2320 }
2322 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2324 tree
2326 {
2327 tree v;
2337 }
2339 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2341 tree
2343 {
2344 tree v;
2348 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2349 Consider doing it via real_convert now. */
2359 }
2361 /* Like build_real, but first truncate D to the type. */
2363 tree
2365 {
2367 }
2369 /* Return a new REAL_CST node whose type is TYPE
2370 and whose value is the integer value of the INTEGER_CST node I. */
2372 REAL_VALUE_TYPE
2374 {
2375 REAL_VALUE_TYPE d;
2377 /* Clear all bits of the real value type so that we can later do
2378 bitwise comparisons to see if two values are the same. */
2384 }
2386 /* Given a tree representing an integer constant I, return a tree
2387 representing the same value as a floating-point constant of type TYPE. */
2389 tree
2391 {
2392 tree v;
2399 }
2401 /* Return a new REAL_CST node whose type is TYPE
2402 and whose value is the integer value I which has sign SGN. */
2404 tree
2406 {
2407 REAL_VALUE_TYPE d;
2409 /* Clear all bits of the real value type so that we can later do
2410 bitwise comparisons to see if two values are the same. */
2415 }
2417 /* Return a newly constructed STRING_CST node whose value is the LEN
2418 characters at STR when STR is nonnull, or all zeros otherwise.
2419 Note that for a C string literal, LEN should include the trailing NUL.
2420 The TREE_TYPE is not initialized. */
2422 tree
2424 {
2425 /* Do not waste bytes provided by padding of struct tree_string. */
2438 else
2443 }
2445 /* Return a newly constructed COMPLEX_CST node whose value is
2446 specified by the real and imaginary parts REAL and IMAG.
2447 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2448 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2450 tree
2452 {
2463 }
2465 /* Build a complex (inf +- 0i), such as for the result of cproj.
2466 TYPE is the complex tree type of the result. If NEG is true, the
2467 imaginary zero is negative. */
2469 tree
2471 {
2478 }
2480 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2481 element is set to 1. In particular, this is 1 + i for complex types. */
2483 tree
2485 {
2487 {
2490 }
2491 else
2493 }
2495 /* Return a constant of arithmetic type TYPE which is the
2496 multiplicative identity of the set TYPE. */
2498 tree
2500 {
2502 {
2512 /* We can only generate 1 for accum types. */
2517 {
2521 }
2530 }
2531 }
2533 /* Return an integer of type TYPE containing all 1's in as much precision as
2534 it contains, or a complex or vector whose subparts are such integers. */
2536 tree
2538 {
2540 {
2543 }
2544 else
2546 }
2548 /* Return a constant of arithmetic type TYPE which is the
2549 opposite of the multiplicative identity of the set TYPE. */
2551 tree
2553 {
2555 {
2565 /* We can only generate 1 for accum types. */
2572 {
2576 }
2585 }
2586 }
2588 /* Build 0 constant of type TYPE. This is used by constructor folding
2589 and thus the constant should be represented in memory by
2590 zero(es). */
2592 tree
2594 {
2596 {
2609 {
2613 }
2616 {
2620 }
2626 }
2627 }
2630 /* Build a BINFO with LEN language slots. */
2632 tree
2634 {
2635 tree t;
2650 }
2652 /* Create a CASE_LABEL_EXPR tree node and return it. */
2654 tree
2656 {
2668 }
2670 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2671 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2672 The latter determines the length of the HOST_WIDE_INT vector. */
2674 tree
2676 {
2677 tree t;
2689 /* to_offset can only be applied to trees that are offset_int-sized
2690 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2691 must be exactly the precision of offset_int and so LEN is correct. */
2694 else
2700 }
2702 /* Build a newly constructed TREE_VEC node of length LEN. */
2704 tree
2706 {
2707 tree t;
2718 }
2720 /* Grow a TREE_VEC node to new length LEN. */
2722 tree
2724 {
2740 }
2741 \f
2742 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2743 fixed, and scalar, complex or vector. */
2745 bool
2747 {
2751 }
2753 /* Return 1 if EXPR is the integer constant zero or a complex constant
2754 of zero, or a location wrapper for such a constant. */
2756 bool
2758 {
2762 {
2774 }
2775 }
2777 /* Return 1 if EXPR is the integer constant one or the corresponding
2778 complex constant, or a location wrapper for such a constant. */
2780 bool
2782 {
2786 {
2798 }
2799 }
2801 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2802 return 1 if every piece is the integer constant one.
2803 Also return 1 for location wrappers for such a constant. */
2805 bool
2807 {
2813 else
2815 }
2817 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2818 it contains, or a complex or vector whose subparts are such integers,
2819 or a location wrapper for such a constant. */
2821 bool
2823 {
2841 }
2843 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2844 for such a constant. */
2846 bool
2848 {
2854 else
2856 }
2858 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2859 one bit on), or a location wrapper for such a constant. */
2861 bool
2863 {
2875 }
2877 /* Return 1 if EXPR is an integer constant other than zero or a
2878 complex constant other than zero, or a location wrapper for such a
2879 constant. */
2881 bool
2883 {
2891 }
2893 /* Return 1 if EXPR is the integer constant one. For vector,
2894 return 1 if every piece is the integer constant minus one
2895 (representing the value TRUE).
2896 Also return 1 for location wrappers for such a constant. */
2898 bool
2900 {
2906 }
2908 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2909 for such a constant. */
2911 bool
2913 {
2918 }
2920 /* Return the power of two represented by a tree node known to be a
2921 power of two. */
2923 int
2925 {
2930 }
2932 /* Similar, but return the largest integer Y such that 2 ** Y is less
2933 than or equal to EXPR. */
2935 int
2937 {
2942 }
2944 /* Return number of known trailing zero bits in EXPR, or, if the value of
2945 EXPR is known to be zero, the precision of it's type. */
2947 unsigned int
2949 {
2956 {
2977 /* Second operand is sizetype, which could be in theory
2978 wider than pointer's precision. Make sure we never
2979 return more than prec. */
2994 {
2997 }
3002 {
3007 }
3016 {
3019 {
3024 }
3025 }
3027 CASE_CONVERT:
3045 {
3048 }
3052 }
3053 }
3055 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
3056 decimal float constants, so don't return 1 for them.
3057 Also return 1 for location wrappers around such a constant. */
3059 bool
3061 {
3065 {
3073 {
3074 /* Don't simply check for a duplicate because the predicate
3075 accepts both +0.0 and -0.0. */
3081 }
3084 }
3085 }
3087 /* Return 1 if EXPR is the real constant one in real or complex form.
3088 Trailing zeroes matter for decimal float constants, so don't return
3089 1 for them.
3090 Also return 1 for location wrappers around such a constant. */
3092 bool
3094 {
3098 {
3111 }
3112 }
3114 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3115 matter for decimal float constants, so don't return 1 for them.
3116 Also return 1 for location wrappers around such a constant. */
3118 bool
3120 {
3124 {
3137 }
3138 }
3140 /* Nonzero if EXP is a constant or a cast of a constant. */
3142 bool
3144 {
3145 /* This is not quite the same as STRIP_NOPS. It does more. */
3150 }
3152 /* Return true if T holds a polynomial pointer difference, storing it in
3153 *VALUE if so. A true return means that T's precision is no greater
3154 than 64 bits, which is the largest address space we support, so *VALUE
3155 never loses precision. However, the signedness of the result does
3156 not necessarily match the signedness of T: sometimes an unsigned type
3157 like sizetype is used to encode a value that is actually negative. */
3159 bool
3161 {
3165 {
3170 }
3172 {
3179 }
3181 }
3183 poly_int64
3185 {
3190 }
3192 poly_uint64
3194 {
3199 }
3200 \f
3201 /* Return first list element whose TREE_VALUE is ELEM.
3202 Return 0 if ELEM is not in LIST. */
3204 tree
3206 {
3208 {
3212 }
3214 }
3216 /* Return first list element whose TREE_PURPOSE is ELEM.
3217 Return 0 if ELEM is not in LIST. */
3219 tree
3221 {
3223 {
3227 }
3229 }
3231 /* Return true if ELEM is in V. */
3233 bool
3235 {
3237 tree t;
3242 }
3244 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3245 NULL_TREE. */
3247 tree
3249 {
3253 }
3255 /* Return nonzero if ELEM is part of the chain CHAIN. */
3257 bool
3259 {
3261 {
3265 }
3268 }
3270 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3271 We expect a null pointer to mark the end of the chain.
3272 This is the Lisp primitive `length'. */
3274 int
3276 {
3278 #ifdef ENABLE_TREE_CHECKING
3280 #endif
3284 {
3286 #ifdef ENABLE_TREE_CHECKING
3290 #endif
3291 len++;
3292 }
3295 }
3297 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3298 UNION_TYPE TYPE, or NULL_TREE if none. */
3300 tree
3302 {
3307 }
3309 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3310 UNION_TYPE TYPE, or NULL_TREE if none. */
3312 tree
3314 {
3318 {
3323 }
3326 }
3328 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3329 by modifying the last node in chain 1 to point to chain 2.
3330 This is the Lisp primitive `nconc'. */
3332 tree
3334 {
3335 tree t1;
3346 #ifdef ENABLE_TREE_CHECKING
3347 {
3348 tree t2;
3351 }
3352 #endif
3355 }
3357 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3359 tree
3361 {
3362 tree next;
3367 }
3369 /* Reverse the order of elements in the chain T,
3370 and return the new head of the chain (old last element). */
3372 tree
3374 {
3377 {
3378 /* We shouldn't be using this function to reverse BLOCK chains; we
3379 have blocks_nreverse for that. */
3384 }
3386 }
3387 \f
3388 /* Return a newly created TREE_LIST node whose
3389 purpose and value fields are PARM and VALUE. */
3391 tree
3393 {
3398 }
3400 /* Build a chain of TREE_LIST nodes from a vector. */
3402 tree
3404 {
3408 tree t;
3410 {
3413 }
3415 }
3417 /* Return a newly created TREE_LIST node whose
3418 purpose and value fields are PURPOSE and VALUE
3419 and whose TREE_CHAIN is CHAIN. */
3421 tree
3423 {
3424 tree node;
3436 }
3438 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3439 trees. */
3443 {
3447 tree val;
3453 }
3454 \f
3455 /* Return the size nominally occupied by an object of type TYPE
3456 when it resides in memory. The value is measured in units of bytes,
3457 and its data type is that normally used for type sizes
3458 (which is the first type created by make_signed_type or
3459 make_unsigned_type). */
3461 tree
3463 {
3464 tree t;
3473 {
3476 }
3479 }
3481 /* Return the size of TYPE (in bytes) as a wide integer
3482 or return -1 if the size can vary or is larger than an integer. */
3484 HOST_WIDE_INT
3486 {
3487 tree t;
3497 else
3499 }
3501 /* Return the maximum size of TYPE (in bytes) as a wide integer
3502 or return -1 if the size can vary or is larger than an integer. */
3504 HOST_WIDE_INT
3506 {
3508 tree size_tree;
3510 /* If this is an array type, check for a possible MAX_SIZE attached. */
3513 {
3518 }
3520 /* If we still haven't been able to get a size, see if the language
3521 can compute a maximum size. */
3524 {
3529 }
3532 }
3533 \f
3534 /* Return the bit position of FIELD, in bits from the start of the record.
3535 This is a tree of type bitsizetype. */
3537 tree
3539 {
3542 }
3543 \f
3544 /* Return the byte position of FIELD, in bytes from the start of the record.
3545 This is a tree of type sizetype. */
3547 tree
3549 {
3552 }
3554 /* Likewise, but return as an integer. It must be representable in
3555 that way (since it could be a signed value, we don't have the
3556 option of returning -1 like int_size_in_byte can. */
3558 HOST_WIDE_INT
3560 {
3562 }
3563 \f
3564 /* Return, as a tree node, the number of elements for TYPE (which is an
3565 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3567 tree
3569 {
3572 /* If they did it with unspecified bounds, then we should have already
3573 given an error about it before we got here. */
3581 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3583 {
3584 /* zero sized arrays are represented from C FE as complete types with
3585 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3586 them as min 0, max -1. */
3593 }
3596 ? max
3598 }
3599 \f
3600 /* If arg is static -- a reference to an object in static storage -- then
3601 return the object. This is not the same as the C meaning of `static'.
3602 If arg isn't static, return NULL. */
3604 tree
3606 {
3608 {
3610 /* Nested functions are static, even though taking their address will
3611 involve a trampoline as we unnest the nested function and create
3612 the trampoline on the tree level. */
3633 /* If the thing being referenced is not a field, then it is
3634 something language specific. */
3637 /* If we are referencing a bitfield, we can't evaluate an
3638 ADDR_EXPR at compile time and so it isn't a constant. */
3655 else
3663 }
3664 }
3666 \f
3669 /* Return whether OP is a DECL whose address is function-invariant. */
3671 bool
3673 {
3674 /* The conditions below are slightly less strict than the one in
3675 staticp. */
3678 {
3701 }
3704 }
3706 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3708 bool
3710 {
3711 /* The conditions below are slightly less strict than the one in
3712 staticp. */
3715 {
3735 }
3738 }
3741 /* Return true if T is function-invariant (internal function, does
3742 not handle arithmetic; that's handled in skip_simple_arithmetic and
3743 tree_invariant_p). */
3745 static bool
3747 {
3748 tree op;
3755 {
3762 {
3764 {
3779 }
3781 }
3787 }
3790 }
3792 /* Return true if T is function-invariant. */
3794 bool
3796 {
3799 }
3801 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3802 Do this to any expression which may be used in more than one place,
3803 but must be evaluated only once.
3805 Normally, expand_expr would reevaluate the expression each time.
3806 Calling save_expr produces something that is evaluated and recorded
3807 the first time expand_expr is called on it. Subsequent calls to
3808 expand_expr just reuse the recorded value.
3810 The call to expand_expr that generates code that actually computes
3811 the value is the first call *at compile time*. Subsequent calls
3812 *at compile time* generate code to use the saved value.
3813 This produces correct result provided that *at run time* control
3814 always flows through the insns made by the first expand_expr
3815 before reaching the other places where the save_expr was evaluated.
3816 You, the caller of save_expr, must make sure this is so.
3818 Constants, and certain read-only nodes, are returned with no
3819 SAVE_EXPR because that is safe. Expressions containing placeholders
3820 are not touched; see tree.def for an explanation of what these
3821 are used for. */
3823 tree
3825 {
3826 tree inner;
3828 /* If the tree evaluates to a constant, then we don't want to hide that
3829 fact (i.e. this allows further folding, and direct checks for constants).
3830 However, a read-only object that has side effects cannot be bypassed.
3831 Since it is no problem to reevaluate literals, we just return the
3832 literal node. */
3840 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3841 it means that the size or offset of some field of an object depends on
3842 the value within another field.
3844 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3845 and some variable since it would then need to be both evaluated once and
3846 evaluated more than once. Front-ends must assure this case cannot
3847 happen by surrounding any such subexpressions in their own SAVE_EXPR
3848 and forcing evaluation at the proper time. */
3854 /* This expression might be placed ahead of a jump to ensure that the
3855 value was computed on both sides of the jump. So make sure it isn't
3856 eliminated as dead. */
3859 }
3861 /* Look inside EXPR into any simple arithmetic operations. Return the
3862 outermost non-arithmetic or non-invariant node. */
3864 tree
3866 {
3867 /* We don't care about whether this can be used as an lvalue in this
3868 context. */
3872 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3873 a constant, it will be more efficient to not make another SAVE_EXPR since
3874 it will allow better simplification and GCSE will be able to merge the
3875 computations if they actually occur. */
3877 {
3881 {
3886 else
3888 }
3889 else
3891 }
3894 }
3896 /* Look inside EXPR into simple arithmetic operations involving constants.
3897 Return the outermost non-arithmetic or non-constant node. */
3899 tree
3901 {
3906 {
3910 {
3915 else
3917 }
3918 else
3920 }
3923 }
3925 /* Return which tree structure is used by T. */
3927 enum tree_node_structure_enum
3929 {
3932 }
3934 /* Set various status flags when building a CALL_EXPR object T. */
3936 static void
3938 {
3943 /* Calls have side-effects, except those to const or pure functions. */
3946 /* Propagate TREE_READONLY of arguments for const functions. */
3952 {
3958 }
3962 }
3963 \f
3964 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3965 size or offset that depends on a field within a record. */
3967 bool
3969 {
3980 {
3982 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3983 position computations since they will be converted into a
3984 WITH_RECORD_EXPR involving the reference, which will assume
3985 here will be valid. */
3999 {
4001 /* Ignoring the first operand isn't quite right, but works best. */
4010 /* The save_expr function never wraps anything containing
4011 a PLACEHOLDER_EXPR. */
4016 }
4019 {
4027 }
4031 {
4033 {
4034 const_tree arg;
4035 const_call_expr_arg_iterator iter;
4040 }
4043 }
4047 }
4049 }
4051 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4052 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4053 field positions. */
4055 static bool
4057 {
4058 /* If the size contains a placeholder or the parent type (component type in
4059 the case of arrays) type involves a placeholder, this type does. */
4067 /* Now do type-specific checks. Note that the last part of the check above
4068 greatly limits what we have to do below. */
4070 {
4088 /* Here we just check the bounds. */
4093 /* We have already checked the component type above, so just check
4094 the domain type. Flexible array members have a null domain. */
4101 {
4102 tree field;
4113 }
4117 }
4118 }
4120 /* Wrapper around above function used to cache its result. */
4122 bool
4124 {
4127 /* If the contains_placeholder_bits field has been initialized,
4128 then we know the answer. */
4132 /* Indicate that we've seen this type node, and the answer is false.
4133 This is what we want to return if we run into recursion via fields. */
4136 /* Compute the real value. */
4139 /* Store the real value. */
4143 }
4144 \f
4145 /* Push tree EXP onto vector QUEUE if it is not already present. */
4147 static void
4149 {
4151 tree iter;
4159 }
4161 /* Given a tree EXP, find all occurrences of references to fields
4162 in a PLACEHOLDER_EXPR and place them in vector REFS without
4163 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4164 we assume here that EXP contains only arithmetic expressions
4165 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4166 argument list. */
4168 void
4170 {
4172 tree inner;
4175 /* We handle TREE_LIST and COMPONENT_REF separately. */
4177 {
4180 }
4182 {
4186 ;
4190 else
4192 }
4193 else
4195 {
4200 /* Variables allocated to static storage can stay. */
4206 /* This is the pattern built in ada/make_aligning_type. */
4209 {
4212 }
4214 /* Fall through. */
4232 }
4233 }
4235 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4236 return a tree with all occurrences of references to F in a
4237 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4238 CONST_DECLs. Note that we assume here that EXP contains only
4239 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4240 occurring only in their argument list. */
4242 tree
4244 {
4247 tree new_tree;
4249 /* We handle TREE_LIST and COMPONENT_REF separately. */
4251 {
4258 }
4260 {
4261 tree inner;
4263 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4264 and it is the right field, replace it with R. */
4268 ;
4270 /* The field. */
4276 /* If this expression hasn't been completed let, leave it alone. */
4284 new_tree
4286 }
4287 else
4289 {
4296 else
4303 /* Fall through. */
4311 {
4356 new_tree
4362 }
4366 {
4371 /* If we are trying to replace F with a constant or with another
4372 instance of one of the arguments of the call, inline back
4373 functions which do nothing else than computing a value from
4374 the arguments they are passed. This makes it possible to
4375 fold partially or entirely the replacement expression. */
4377 {
4381 else
4384 {
4387 }
4389 {
4393 }
4394 }
4397 {
4401 {
4405 }
4406 }
4409 {
4413 }
4414 else
4416 }
4421 }
4429 }
4431 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4432 for it within OBJ, a tree that is an object or a chain of references. */
4434 tree
4436 {
4439 tree new_tree;
4441 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4442 in the chain of OBJ. */
4444 {
4446 tree elt;
4476 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4477 survives until RTL generation, there will be an error. */
4479 }
4481 /* TREE_LIST is special because we need to look at TREE_VALUE
4482 and TREE_CHAIN, not TREE_OPERANDS. */
4484 {
4491 }
4492 else
4494 {
4507 {
4552 new_tree
4558 }
4562 {
4568 {
4572 {
4576 }
4577 }
4580 {
4584 }
4585 else
4587 }
4592 }
4600 }
4601 \f
4603 /* Subroutine of stabilize_reference; this is called for subtrees of
4604 references. Any expression with side-effects must be put in a SAVE_EXPR
4605 to ensure that it is only evaluated once.
4607 We don't put SAVE_EXPR nodes around everything, because assigning very
4608 simple expressions to temporaries causes us to miss good opportunities
4609 for optimizations. Among other things, the opportunity to fold in the
4610 addition of a constant into an addressing mode often gets lost, e.g.
4611 "y[i+1] += x;". In general, we take the approach that we should not make
4612 an assignment unless we are forced into it - i.e., that any non-side effect
4613 operator should be allowed, and that cse should take care of coalescing
4614 multiple utterances of the same expression should that prove fruitful. */
4616 static tree
4618 {
4619 tree result;
4622 /* We cannot ignore const expressions because it might be a reference
4623 to a const array but whose index contains side-effects. But we can
4624 ignore things that are actual constant or that already have been
4625 handled by this function. */
4631 {
4633 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4634 have side-effects. */
4637 /* FALLTHRU */
4645 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4646 so that it will only be evaluated once. */
4647 /* The reference (r) and comparison (<) classes could be handled as
4648 below, but it is generally faster to only evaluate them once. */
4654 /* Constants need no processing. In fact, we should never reach
4655 here. */
4659 /* Division is slow and tends to be compiled with jumps,
4660 especially the division by powers of 2 that is often
4661 found inside of an array reference. So do it just once. */
4667 /* Recursively stabilize each operand. */
4673 /* Recursively stabilize each operand. */
4679 }
4687 }
4689 /* Stabilize a reference so that we can use it any number of times
4690 without causing its operands to be evaluated more than once.
4691 Returns the stabilized reference. This works by means of save_expr,
4692 so see the caveats in the comments about save_expr.
4694 Also allows conversion expressions whose operands are references.
4695 Any other kind of expression is returned unchanged. */
4697 tree
4699 {
4700 tree result;
4704 {
4708 /* No action is needed in this case. */
4711 CASE_CONVERT:
4750 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4751 it wouldn't be ignored. This matters when dealing with
4752 volatiles. */
4755 /* If arg isn't a kind of lvalue we recognize, make no change.
4756 Caller should recognize the error for an invalid lvalue. */
4762 }
4771 }
4772 \f
4773 /* Low-level constructors for expressions. */
4775 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4776 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4778 void
4780 {
4781 tree node;
4786 /* We started out assuming this address is both invariant and constant, but
4787 does not have side effects. Now go down any handled components and see if
4788 any of them involve offsets that are either non-constant or non-invariant.
4789 Also check for side-effects.
4791 ??? Note that this code makes no attempt to deal with the case where
4792 taking the address of something causes a copy due to misalignment. */
4794 #define UPDATE_FLAGS(NODE) \
4795 do { tree _node = (NODE); \
4796 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4797 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4801 {
4802 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4803 array reference (probably made temporarily by the G++ front end),
4804 so ignore all the operands. */
4808 {
4814 }
4815 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4816 FIELD_DECL, apparently. The G++ front end can put something else
4817 there, at least temporarily. */
4820 {
4823 }
4824 }
4828 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4829 the address, since &(*a)->b is a form of addition. If it's a constant, the
4830 address is constant too. If it's a decl, its address is constant if the
4831 decl is static. Everything else is not constant and, furthermore,
4832 taking the address of a volatile variable is not volatile. */
4837 ;
4840 else
4841 {
4844 }
4849 #undef UPDATE_FLAGS
4850 }
4852 /* Build an expression of code CODE, data type TYPE, and operands as
4853 specified. Expressions and reference nodes can be created this way.
4854 Constants, decls, types and misc nodes cannot be.
4856 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4857 enough for all extant tree codes. */
4859 tree
4861 {
4862 tree t;
4870 }
4872 tree
4874 {
4876 tree t;
4892 {
4895 }
4898 {
4901 }
4903 {
4905 /* All of these have side-effects, no matter what their
4906 operands are. */
4912 /* Whether a dereference is readonly has nothing to do with whether
4913 its operand is readonly. */
4931 }
4934 }
4936 #define PROCESS_ARG(N) \
4937 do { \
4938 TREE_OPERAND (t, N) = arg##N; \
4939 if (arg##N &&!TYPE_P (arg##N)) \
4940 { \
4941 if (TREE_SIDE_EFFECTS (arg##N)) \
4942 side_effects = 1; \
4943 if (!TREE_READONLY (arg##N) \
4944 && !CONSTANT_CLASS_P (arg##N)) \
4945 (void) (read_only = 0); \
4946 if (!TREE_CONSTANT (arg##N)) \
4947 (void) (constant = 0); \
4948 } \
4949 } while (0)
4951 tree
4953 {
4955 tree t;
4961 /* When sizetype precision doesn't match that of pointers
4962 we need to be able to build explicit extensions or truncations
4963 of the offset argument. */
4975 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4976 result based on those same flags for the arguments. But if the
4977 arguments aren't really even `tree' expressions, we shouldn't be trying
4978 to do this. */
4980 /* Expressions without side effects may be constant if their
4981 arguments are as well. */
4988 {
5002 }
5009 {
5011 {
5015 }
5016 }
5017 else
5018 {
5020 /* Don't mark X / 0 as constant. */
5025 }
5028 }
5031 tree
5033 tree arg2 MEM_STAT_DECL)
5034 {
5036 tree t;
5046 /* As a special exception, if COND_EXPR has NULL branches, we
5047 assume that it is a gimple statement and always consider
5048 it to have side effects. */
5054 else
5070 }
5072 tree
5075 {
5077 tree t;
5097 }
5099 tree
5102 {
5104 tree t;
5121 {
5123 {
5127 }
5128 }
5129 else
5135 }
5137 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5138 on the pointer PTR. */
5140 tree
5142 {
5145 tree tem;
5146 /* For convenience allow addresses that collapse to a simple base
5147 and offset. */
5151 {
5155 {
5158 }
5159 else
5162 }
5167 }
5169 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5171 poly_offset_int
5173 {
5175 SIGNED);
5176 }
5178 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5179 offsetted by OFFSET units. */
5181 tree
5183 {
5190 }
5192 /* Similar except don't specify the TREE_TYPE
5193 and leave the TREE_SIDE_EFFECTS as 0.
5194 It is permissible for arguments to be null,
5195 or even garbage if their values do not matter. */
5197 tree
5199 {
5200 tree t;
5217 }
5219 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5220 tree vec. */
5222 tree
5224 {
5234 }
5235 \f
5236 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5237 and data type TYPE.
5238 We do NOT enter this node in any sort of symbol table.
5240 LOC is the location of the decl.
5242 layout_decl is used to set up the decl's storage layout.
5243 Other slots are initialized to 0 or null pointers. */
5245 tree
5247 tree type MEM_STAT_DECL)
5248 {
5249 tree t;
5254 /* if (type == error_mark_node)
5255 type = integer_type_node; */
5256 /* That is not done, deliberately, so that having error_mark_node
5257 as the type can suppress useless errors in the use of this variable. */
5266 }
5268 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5270 tree
5272 {
5278 }
5280 /* Builds and returns function declaration with NAME and TYPE. */
5282 tree
5284 {
5294 }
5298 /* Builds a new translation-unit decl with name NAME, queues it in the
5299 global list of translation-unit decls and returns it. */
5301 tree
5303 {
5309 }
5311 \f
5312 /* BLOCK nodes are used to represent the structure of binding contours
5313 and declarations, once those contours have been exited and their contents
5314 compiled. This information is used for outputting debugging info. */
5316 tree
5318 {
5326 }
5328 \f
5329 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5331 LOC is the location to use in tree T. */
5333 void
5335 {
5339 {
5343 }
5344 }
5346 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5347 UNKNOWN_LOCATION. */
5349 void
5351 {
5355 }
5356 \f
5357 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5358 of the various TYPE_QUAL values. */
5360 static void
5362 {
5368 }
5370 /* Returns true iff CAND and BASE have equivalent language-specific
5371 qualifiers. */
5373 bool
5375 {
5378 /* type_hash_eq currently only applies to these types. */
5383 }
5385 /* This function checks to see if TYPE matches the size one of the built-in
5386 atomic types, and returns that core atomic type. */
5388 static tree
5390 {
5391 tree base_atomic_type;
5393 /* Only handle complete types. */
5398 {
5421 }
5424 }
5426 /* Returns true iff unqualified CAND and BASE are equivalent. */
5428 bool
5430 {
5432 /* Apparently this is needed for Objective-C. */
5437 /* Check alignment. */
5441 /* Atomic types increase minimal alignment. We must to do so as well
5442 or we get duplicated canonical types. See PR88686. */
5444 {
5445 /* See if this object can map to a basic atomic type. */
5449 }
5451 }
5453 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5455 bool
5457 {
5461 }
5463 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5465 static bool
5467 {
5470 /* Apparently this is needed for Objective-C. */
5472 /* Check alignment. */
5474 /* Check this is a user-aligned type as build_aligned_type
5475 would create. */
5480 }
5482 /* Return a version of the TYPE, qualified as indicated by the
5483 TYPE_QUALS, if one exists. If no qualified version exists yet,
5484 return NULL_TREE. */
5486 tree
5488 {
5496 /* Search the chain of variants to see if there is already one there just
5497 like the one we need to have. If so, use that existing one. We must
5498 preserve the TYPE_NAME, since there is code that depends on this. */
5501 {
5502 /* Put the found variant at the head of the variant list so
5503 frequently searched variants get found faster. The C++ FE
5504 benefits greatly from this. */
5510 }
5513 }
5515 /* Like get_qualified_type, but creates the type if it does not
5516 exist. This function never returns NULL_TREE. */
5518 tree
5520 {
5521 tree t;
5523 /* See if we already have the appropriate qualified variant. */
5526 /* If not, build it. */
5528 {
5533 {
5534 /* See if this object can map to a basic atomic type. */
5537 {
5538 /* Ensure the alignment of this type is compatible with
5539 the required alignment of the atomic type. */
5542 }
5543 }
5546 /* Propagate structural equality. */
5549 /* Build the underlying canonical type, since it is different
5550 from TYPE. */
5551 {
5554 }
5555 else
5556 /* T is its own canonical type. */
5559 }
5562 }
5564 /* Create a variant of type T with alignment ALIGN. */
5566 tree
5568 {
5569 tree t;
5584 }
5586 /* Create a new distinct copy of TYPE. The new type is made its own
5587 MAIN_VARIANT. If TYPE requires structural equality checks, the
5588 resulting type requires structural equality checks; otherwise, its
5589 TYPE_CANONICAL points to itself. */
5591 tree
5593 {
5599 /* Set the canonical type either to a new equivalence class, or
5600 propagate the need for structural equality checks. */
5603 else
5606 /* Make it its own variant. */
5610 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5611 whose TREE_TYPE is not t. This can also happen in the Ada
5612 frontend when using subtypes. */
5615 }
5617 /* Create a new variant of TYPE, equivalent but distinct. This is so
5618 the caller can modify it. TYPE_CANONICAL for the return type will
5619 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5620 are considered equal by the language itself (or that both types
5621 require structural equality checks). */
5623 tree
5625 {
5630 /* Since we're building a variant, assume that it is a non-semantic
5631 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5633 /* Type variants have no alias set defined. */
5636 /* Add the new type to the chain of variants of TYPE. */
5642 }
5643 \f
5644 /* Return true if the from tree in both tree maps are equal. */
5646 int
5648 {
5652 }
5654 /* Hash a from tree in a tree_base_map. */
5656 unsigned int
5658 {
5660 }
5662 /* Return true if this tree map structure is marked for garbage collection
5663 purposes. We simply return true if the from tree is marked, so that this
5664 structure goes away when the from tree goes away. */
5666 int
5668 {
5670 }
5672 /* Hash a from tree in a tree_map. */
5674 unsigned int
5676 {
5678 }
5680 /* Hash a from tree in a tree_decl_map. */
5682 unsigned int
5684 {
5686 }
5688 /* Return the initialization priority for DECL. */
5690 priority_type
5692 {
5697 return
5699 }
5701 /* Return the finalization priority for DECL. */
5703 priority_type
5705 {
5710 return
5712 }
5714 /* Set the initialization priority for DECL to PRIORITY. */
5716 void
5718 {
5722 {
5726 }
5729 else
5732 }
5734 /* Set the finalization priority for DECL to PRIORITY. */
5736 void
5738 {
5742 {
5746 }
5747 else
5750 }
5752 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5754 static void
5756 {
5761 }
5763 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5765 static void
5767 {
5772 }
5774 /* Lookup a debug expression for FROM, and return it if we find one. */
5776 tree
5778 {
5786 }
5788 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5790 void
5792 {
5799 }
5801 /* Lookup a value expression for FROM, and return it if we find one. */
5803 tree
5805 {
5813 }
5815 /* Insert a mapping FROM->TO in the value expression hashtable. */
5817 void
5819 {
5826 }
5828 /* Lookup a vector of debug arguments for FROM, and return it if we
5829 find one. */
5833 {
5844 }
5846 /* Insert a mapping FROM->empty vector of debug arguments in the value
5847 expression hashtable. */
5851 {
5866 }
5868 /* Hashing of types so that we don't make duplicates.
5869 The entry point is `type_hash_canon'. */
5871 /* Generate the default hash code for TYPE. This is designed for
5872 speed, rather than maximum entropy. */
5874 hashval_t
5876 {
5885 /* Just the identifier is adequate to distinguish. */
5889 {
5892 /* FALLTHROUGH. */
5904 {
5908 {
5911 }
5912 }
5916 {
5923 }
5927 {
5931 }
5939 }
5942 }
5944 /* These are the Hashtable callback functions. */
5946 /* Returns true iff the types are equivalent. */
5948 bool
5950 {
5951 /* First test the things that are the same for all types. */
5961 /* Be careful about comparing arrays before and after the element type
5962 has been completed; don't compare TYPE_ALIGN unless both types are
5963 complete. */
5970 {
5993 /* fall through */
6025 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6026 where the flag should be inherited from the element type
6027 and can change after ARRAY_TYPEs are created; on non-aggregates
6028 compare it and hash it, scalars will never have that flag set
6029 and we need to differentiate between arrays created by different
6030 front-ends or middle-end created arrays. */
6060 }
6066 }
6068 /* Given TYPE, and HASHCODE its hash code, return the canonical
6069 object for an identical type if one already exists.
6070 Otherwise, return TYPE, and record it as the canonical object.
6072 To use this function, first create a type of the sort you want.
6073 Then compute its hash code from the fields of the type that
6074 make it different from other similar types.
6075 Then call this function and use the value. */
6077 tree
6079 {
6080 type_hash in;
6083 /* The hash table only contains main variants, so ensure that's what we're
6084 being passed. */
6087 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6088 must call that routine before comparing TYPE_ALIGNs. */
6096 {
6102 /* Free also min/max values and the cache for integer
6103 types. This can't be done in free_node, as LTO frees
6104 those on its own. */
6106 {
6109 {
6110 /* Zero is always in TYPE_CACHED_VALUES. */
6114 }
6117 {
6120 }
6123 }
6126 }
6127 else
6128 {
6137 }
6138 }
6140 static void
6142 {
6147 }
6149 /* Given two lists of types
6150 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6151 return 1 if the lists contain the same types in the same order.
6152 Also, the TREE_PURPOSEs must match. */
6154 bool
6156 {
6168 }
6170 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6171 given by TYPE. If the argument list accepts variable arguments,
6172 then this function counts only the ordinary arguments. */
6174 int
6176 {
6180 /* If the function does not take a variable number of arguments,
6181 the last element in the list will have type `void'. */
6184 else
6188 }
6190 /* Return the type of the function TYPE's argument ARGNO if known.
6191 For vararg function's where ARGNO refers to one of the variadic
6192 arguments return null. Otherwise, return a void_type_node for
6193 out-of-bounds ARGNO. */
6195 tree
6197 {
6198 /* Treat zero the same as an out-of-bounds argument number. */
6202 function_args_iterator iter;
6204 tree argtype;
6207 {
6208 /* A vararg function's argument list ends in a null. Otherwise,
6209 an ordinary function's argument list ends with void. Return
6210 null if ARGNO refers to a vararg argument, void_type_node if
6211 it's out of bounds, and the formal argument type otherwise. */
6219 }
6222 }
6224 /* Nonzero if integer constants T1 and T2
6225 represent the same constant value. */
6227 int
6229 {
6245 }
6247 /* Return true if T is an INTEGER_CST whose numerical value (extended
6248 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6250 bool
6252 {
6256 }
6258 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6259 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6261 bool
6263 {
6267 {
6272 }
6275 }
6277 /* Return true if T is an INTEGER_CST whose numerical value (extended
6278 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6280 bool
6282 {
6286 }
6288 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6289 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6291 bool
6293 {
6297 {
6302 }
6305 }
6307 /* T is an INTEGER_CST whose numerical value (extended according to
6308 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6309 HOST_WIDE_INT. */
6311 HOST_WIDE_INT
6313 {
6316 }
6318 /* T is an INTEGER_CST whose numerical value (extended according to
6319 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6320 HOST_WIDE_INT. */
6322 unsigned HOST_WIDE_INT
6324 {
6327 }
6329 /* Return the most significant (sign) bit of T. */
6331 int
6333 {
6337 }
6339 /* Return an indication of the sign of the integer constant T.
6340 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6341 Note that -1 will never be returned if T's type is unsigned. */
6343 int
6345 {
6352 else
6354 }
6356 /* Return the minimum number of bits needed to represent VALUE in a
6357 signed or unsigned type, UNSIGNEDP says which. */
6359 unsigned int
6361 {
6362 /* If the value is negative, compute its negative minus 1. The latter
6363 adjustment is because the absolute value of the largest negative value
6364 is one larger than the largest positive value. This is equivalent to
6365 a bit-wise negation, so use that operation instead. */
6370 /* Return the number of bits needed, taking into account the fact
6371 that we need one more bit for a signed than unsigned type.
6372 If value is 0 or -1, the minimum precision is 1 no matter
6373 whether unsignedp is true or false. */
6377 else
6379 }
6381 /* Return truthvalue of whether T1 is the same tree structure as T2.
6382 Return 1 if they are the same.
6383 Return 0 if they are understandably different.
6384 Return -1 if either contains tree structure not understood by
6385 this function. */
6387 int
6389 {
6399 /* For location wrappers to be the same, they must be at the same
6400 source location (and wrap the same thing). */
6402 {
6406 }
6412 {
6416 else
6418 }
6428 {
6444 {
6453 /* ??? Should we handle also fields here? */
6457 }
6468 {
6476 {
6480 }
6482 }
6485 /* Special case: if either target is an unallocated VAR_DECL,
6486 it means that it's going to be unified with whatever the
6487 TARGET_EXPR is really supposed to initialize, so treat it
6488 as being equivalent to anything. */
6496 else
6525 /* A false return means maybe_ne rather than known_ne. */
6531 }
6533 /* This general rule works for most tree codes. All exceptions should be
6534 handled above. If this is a language-specific tree code, we can't
6535 trust what might be in the operand, so say we don't know
6536 the situation. */
6541 {
6550 {
6554 }
6560 }
6561 }
6563 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6564 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6565 than U, respectively. */
6567 int
6569 {
6578 else
6580 }
6582 /* Return true if SIZE represents a constant size that is in bounds of
6583 what the middle-end and the backend accepts (covering not more than
6584 half of the address-space).
6585 When PERR is non-null, set *PERR on failure to the description of
6586 why SIZE is not valid. */
6588 bool
6590 {
6592 {
6599 }
6601 cst_size_error error;
6606 {
6609 }
6612 {
6615 }
6618 {
6621 }
6625 {
6628 }
6631 }
6633 /* Return the precision of the type, or for a complex or vector type the
6634 precision of the type of its elements. */
6636 unsigned int
6638 {
6646 }
6648 /* Return true if CODE represents an associative tree code. Otherwise
6649 return false. */
6650 bool
6652 {
6654 {
6666 }
6668 }
6670 /* Return true if CODE represents a commutative tree code. Otherwise
6671 return false. */
6672 bool
6674 {
6676 {
6703 }
6705 }
6707 /* Return true if CODE represents a ternary tree code for which the
6708 first two operands are commutative. Otherwise return false. */
6709 bool
6711 {
6713 {
6721 }
6723 }
6725 /* Returns true if CODE can overflow. */
6727 bool
6729 {
6731 {
6736 /* Can overflow in various ways. */
6742 /* For INT_MIN / -1. */
6746 /* For -INT_MIN. */
6749 /* These operators cannot overflow. */
6751 }
6752 }
6754 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6755 ftrapv doesn't generate trapping insns for CODE. */
6757 bool
6759 {
6762 /* We don't generate instructions that trap on overflow for complex or vector
6763 types. */
6771 {
6777 /* These operators can overflow, and -ftrapv generates trapping code for
6778 these. */
6785 /* These operators can overflow, but -ftrapv does not generate trapping
6786 code for these. */
6789 /* These operators cannot overflow. */
6791 }
6792 }
6794 /* Constructors for pointer, array and function types.
6795 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6796 constructed by language-dependent code, not here.) */
6798 /* Construct, lay out and return the type of pointers to TO_TYPE with
6799 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6800 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6801 indicate this type can reference all of memory. If such a type has
6802 already been constructed, reuse it. */
6804 tree
6807 {
6808 tree t;
6815 {
6818 }
6820 /* If the pointed-to type has the may_alias attribute set, force
6821 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6825 /* In some cases, languages will have things that aren't a POINTER_TYPE
6826 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6827 In that case, return that type without regard to the rest of our
6828 operands.
6830 ??? This is a kludge, but consistent with the way this function has
6831 always operated and there doesn't seem to be a good way to avoid this
6832 at the moment. */
6837 /* First, if we already have a type for pointers to TO_TYPE and it's
6838 the proper mode, use it. */
6851 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6859 /* Lay out the type. This function has many callers that are concerned
6860 with expression-construction, and this simplifies them all. */
6864 }
6866 /* By default build pointers in ptr_mode. */
6868 tree
6870 {
6872 }
6874 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6876 tree
6879 {
6880 tree t;
6887 {
6890 }
6892 /* If the pointed-to type has the may_alias attribute set, force
6893 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6897 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6898 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6899 In that case, return that type without regard to the rest of our
6900 operands.
6902 ??? This is a kludge, but consistent with the way this function has
6903 always operated and there doesn't seem to be a good way to avoid this
6904 at the moment. */
6909 /* First, if we already have a type for pointers to TO_TYPE and it's
6910 the proper mode, use it. */
6923 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6934 }
6937 /* Build the node for the type of references-to-TO_TYPE by default
6938 in ptr_mode. */
6940 tree
6942 {
6944 }
6946 #define MAX_INT_CACHED_PREC \
6947 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6950 /* Builds a signed or unsigned integer type of precision PRECISION.
6951 Used for C bitfields whose precision does not match that of
6952 built-in target types. */
6953 tree
6956 {
6963 {
6967 }
6974 else
6984 }
6986 #define MAX_BOOL_CACHED_PREC \
6987 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6990 /* Builds a boolean type of precision PRECISION.
6991 Used for boolean vectors to choose proper vector element size. */
6992 tree
6994 {
6995 tree type;
6998 {
7002 }
7012 }
7014 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7015 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7016 is true, reuse such a type that has already been constructed. */
7018 static tree
7020 {
7043 {
7044 /* Since we cannot reliably merge this type, we need to compare it using
7045 structural equality checks. */
7048 }
7054 }
7056 /* Wrapper around build_range_type_1 with SHARED set to true. */
7058 tree
7060 {
7062 }
7064 /* Wrapper around build_range_type_1 with SHARED set to false. */
7066 tree
7068 {
7070 }
7072 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7073 MAXVAL should be the maximum value in the domain
7074 (one less than the length of the array).
7076 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7077 We don't enforce this limit, that is up to caller (e.g. language front end).
7078 The limit exists because the result is a signed type and we don't handle
7079 sizes that use more than one HOST_WIDE_INT. */
7081 tree
7083 {
7085 }
7087 /* Return true if the debug information for TYPE, a subtype, should be emitted
7088 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7089 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7090 debug info and doesn't reflect the source code. */
7092 bool
7094 {
7097 /* Subrange types have a base type which is an integral type. */
7101 /* Get the real bounds of the subtype. */
7104 else
7105 {
7108 }
7110 /* If the type and its base type have the same representation and the same
7111 name, then the type is not a subrange but a copy of the base type. */
7125 }
7127 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7128 and number of elements specified by the range of values of INDEX_TYPE.
7129 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7130 If SHARED is true, reuse such a type that has already been constructed.
7131 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7133 tree
7136 {
7137 tree t;
7140 {
7143 }
7153 {
7156 }
7159 {
7168 index_type
7171 }
7174 }
7176 /* Wrapper around build_array_type_1 with SHARED set to true. */
7178 tree
7180 {
7181 return
7183 }
7185 /* Wrapper around build_array_type_1 with SHARED set to false. */
7187 tree
7189 {
7191 }
7193 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7194 sizetype. */
7196 tree
7198 {
7200 }
7202 /* Recursively examines the array elements of TYPE, until a non-array
7203 element type is found. */
7205 tree
7207 {
7212 }
7214 /* Computes the canonical argument types from the argument type list
7215 ARGTYPES.
7217 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7218 on entry to this function, or if any of the ARGTYPES are
7219 structural.
7221 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7222 true on entry to this function, or if any of the ARGTYPES are
7223 non-canonical.
7225 Returns a canonical argument list, which may be ARGTYPES when the
7226 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7227 true) or would not differ from ARGTYPES. */
7229 static tree
7233 {
7234 tree arg;
7238 {
7240 /* Fail gracefully by stating that the type is structural. */
7246 /* If the argument has a default argument, we consider it
7247 non-canonical even though the type itself is canonical.
7248 That way, different variants of function and method types
7249 with default arguments will all point to the variant with
7250 no defaults as their canonical type. */
7252 }
7258 {
7259 /* Build the canonical list of argument types. */
7264 {
7267 else
7270 canon_argtypes);
7271 }
7277 /* There is a non-canonical type. */
7280 }
7282 /* The canonical argument types are the same as ARGTYPES. */
7284 }
7286 /* Construct, lay out and return
7287 the type of functions returning type VALUE_TYPE
7288 given arguments of types ARG_TYPES.
7289 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7290 are data type nodes for the arguments of the function.
7291 If such a type has already been constructed, reuse it. */
7293 tree
7295 {
7296 tree t;
7299 tree canon_argtypes;
7304 {
7307 }
7309 /* Make a node of the sort we want. */
7314 /* If we already have such a type, use the old one. */
7318 /* Set up the canonical type. */
7328 canon_argtypes);
7333 }
7335 /* Build a function type. The RETURN_TYPE is the type returned by the
7336 function. If VAARGS is set, no void_type_node is appended to the
7337 list. ARGP must be always be terminated be a NULL_TREE. */
7339 static tree
7341 {
7349 {
7354 }
7357 else
7358 {
7362 }
7366 }
7368 /* Build a function type. The RETURN_TYPE is the type returned by the
7369 function. If additional arguments are provided, they are
7370 additional argument types. The list of argument types must always
7371 be terminated by NULL_TREE. */
7373 tree
7375 {
7376 tree args;
7383 }
7385 /* Build a variable argument function type. The RETURN_TYPE is the
7386 type returned by the function. If additional arguments are provided,
7387 they are additional argument types. The list of argument types must
7388 always be terminated by NULL_TREE. */
7390 tree
7392 {
7393 tree args;
7401 }
7403 /* Build a function type. RETURN_TYPE is the type returned by the
7404 function; VAARGS indicates whether the function takes varargs. The
7405 function takes N named arguments, the types of which are provided in
7406 ARG_TYPES. */
7408 static tree
7411 {
7419 }
7421 /* Build a function type. RETURN_TYPE is the type returned by the
7422 function. The function takes N named arguments, the types of which
7423 are provided in ARG_TYPES. */
7425 tree
7427 {
7429 }
7431 /* Build a variable argument function type. RETURN_TYPE is the type
7432 returned by the function. The function takes N named arguments, the
7433 types of which are provided in ARG_TYPES. */
7435 tree
7437 {
7439 }
7441 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7442 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7443 for the method. An implicit additional parameter (of type
7444 pointer-to-BASETYPE) is added to the ARGTYPES. */
7446 tree
7448 tree rettype,
7449 tree argtypes)
7450 {
7451 tree t;
7452 tree ptype;
7454 tree canon_argtypes;
7456 /* Make a node of the sort we want. */
7463 /* The actual arglist for this function includes a "hidden" argument
7464 which is "this". Put it into the list of argument types. */
7468 /* If we already have such a type, use the old one. */
7472 /* Set up the canonical type. */
7473 any_structural_p
7476 any_noncanonical_p
7488 canon_argtypes);
7493 }
7495 /* Construct, lay out and return the type of methods belonging to class
7496 BASETYPE and whose arguments and values are described by TYPE.
7497 If that type exists already, reuse it.
7498 TYPE must be a FUNCTION_TYPE node. */
7500 tree
7502 {
7508 }
7510 /* Construct, lay out and return the type of offsets to a value
7511 of type TYPE, within an object of type BASETYPE.
7512 If a suitable offset type exists already, reuse it. */
7514 tree
7516 {
7517 tree t;
7519 /* Make a node of the sort we want. */
7525 /* If we already have such a type, use the old one. */
7533 {
7542 }
7545 }
7547 /* Create a complex type whose components are COMPONENT_TYPE.
7549 If NAMED is true, the type is given a TYPE_NAME. We do not always
7550 do so because this creates a DECL node and thus make the DECL_UIDs
7551 dependent on the type canonicalization hashtable, which is GC-ed,
7552 so the DECL_UIDs would not be stable wrt garbage collection. */
7554 tree
7556 {
7561 /* Make a node of the sort we want. */
7566 /* If we already have such a type, use the old one. */
7571 {
7572 /* We created a new type. The hash insertion will have laid
7573 out the type. We need to check the canonicalization and
7574 maybe set the name. */
7585 /* We need to create a name, since complex is a fundamental type. */
7587 {
7616 }
7617 }
7620 }
7622 /* If TYPE is a real or complex floating-point type and the target
7623 does not directly support arithmetic on TYPE then return the wider
7624 type to be used for arithmetic on TYPE. Otherwise, return
7625 NULL_TREE. */
7627 tree
7629 {
7630 /* The target can give two different responses to the question of
7631 which excess precision mode it would like depending on whether we
7632 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7634 enum excess_precision_type requested_type
7636 ? EXCESS_PRECISION_TYPE_FAST
7640 enum flt_eval_method target_flt_eval_method
7643 /* The target should not ask for unpredictable float evaluation (though
7644 it might advertise that implicitly the evaluation is unpredictable,
7645 but we don't care about that here, it will have been reported
7646 elsewhere). If it does ask for unpredictable evaluation, we have
7647 nothing to do here. */
7650 /* Nothing to do. The target has asked for all types we know about
7651 to be computed with their native precision and range. */
7655 /* The target will promote this type in a target-dependent way, so excess
7656 precision ought to leave it alone. */
7660 machine_mode float16_type_mode = (float16_type_node
7667 {
7669 {
7672 {
7690 }
7692 }
7694 {
7699 {
7717 }
7719 }
7722 }
7725 }
7726 \f
7727 /* Return OP, stripped of any conversions to wider types as much as is safe.
7728 Converting the value back to OP's type makes a value equivalent to OP.
7730 If FOR_TYPE is nonzero, we return a value which, if converted to
7731 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7733 OP must have integer, real or enumeral type. Pointers are not allowed!
7735 There are some cases where the obvious value we could return
7736 would regenerate to OP if converted to OP's type,
7737 but would not extend like OP to wider types.
7738 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7739 For example, if OP is (unsigned short)(signed char)-1,
7740 we avoid returning (signed char)-1 if FOR_TYPE is int,
7741 even though extending that to an unsigned short would regenerate OP,
7742 since the result of extending (signed char)-1 to (int)
7743 is different from (int) OP. */
7745 tree
7747 {
7748 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7750 unsigned final_prec
7752 int uns
7759 {
7762 /* TYPE_PRECISION on vector types has different meaning
7763 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7764 so avoid them here. */
7771 /* Truncations are many-one so cannot be removed.
7772 Unless we are later going to truncate down even farther. */
7777 /* See what's inside this conversion. If we decide to strip it,
7778 we will set WIN. */
7781 /* If we have not stripped any zero-extensions (uns is 0),
7782 we can strip any kind of extension.
7783 If we have previously stripped a zero-extension,
7784 only zero-extensions can safely be stripped.
7785 Any extension can be stripped if the bits it would produce
7786 are all going to be discarded later by truncating to FOR_TYPE. */
7789 {
7792 /* TYPE_UNSIGNED says whether this is a zero-extension.
7793 Let's avoid computing it if it does not affect WIN
7794 and if UNS will not be needed again. */
7798 {
7801 }
7802 }
7803 }
7805 /* If we finally reach a constant see if it fits in sth smaller and
7806 in that case convert it. */
7808 {
7814 {
7818 }
7819 }
7822 }
7823 \f
7824 /* Return OP or a simpler expression for a narrower value
7825 which can be sign-extended or zero-extended to give back OP.
7826 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7827 or 0 if the value should be sign-extended. */
7829 tree
7831 {
7838 {
7839 do
7853 ret);
7855 }
7857 {
7858 int bitschange
7862 /* Truncations are many-one so cannot be removed. */
7866 /* See what's inside this conversion. If we decide to strip it,
7867 we will set WIN. */
7870 {
7872 /* An extension: the outermost one can be stripped,
7873 but remember whether it is zero or sign extension. */
7876 /* Otherwise, if a sign extension has been stripped,
7877 only sign extensions can now be stripped;
7878 if a zero extension has been stripped, only zero-extensions. */
7882 }
7884 {
7885 /* A change in nominal type can always be stripped, but we must
7886 preserve the unsignedness. */
7891 /* Keep trying to narrow, but don't assign op to win if it
7892 would turn an integral type into something else. */
7895 }
7898 }
7901 /* Since type_for_size always gives an integer type. */
7904 /* Ensure field is laid out already. */
7907 {
7908 unsigned HOST_WIDE_INT innerprec
7914 /* We can get this structure field in a narrower type that fits it,
7915 but the resulting extension to its nominal type (a fullword type)
7916 must satisfy the same conditions as for other extensions.
7918 Do this only for fields that are aligned (not bit-fields),
7919 because when bit-field insns will be used there is no
7920 advantage in doing this. */
7926 {
7930 }
7931 }
7935 }
7936 \f
7937 /* Return true if integer constant C has a value that is permissible
7938 for TYPE, an integral type. */
7940 bool
7942 {
7947 /* Non-standard boolean types can have arbitrary precision but various
7948 transformations assume that they can only take values 0 and +/-1. */
7952 retry:
7956 /* If at least one bound of the type is a constant integer, we can check
7957 ourselves and maybe make a decision. If no such decision is possible, but
7958 this type is a subtype, try checking against that. Otherwise, use
7959 fits_to_tree_p, which checks against the precision.
7961 Compute the status for each possibly constant bound, and return if we see
7962 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7963 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7964 for "constant known to fit". */
7966 /* Check if c >= type_low_bound. */
7968 {
7972 }
7973 else
7976 /* Check if c <= type_high_bound. */
7978 {
7982 }
7983 else
7986 /* If the constant fits both bounds, the result is known. */
7990 /* Perform some generic filtering which may allow making a decision
7991 even if the bounds are not constant. First, negative integers
7992 never fit in unsigned types, */
7996 /* Second, narrower types always fit in wider ones. */
8000 /* Third, unsigned integers with top bit set never fit signed types. */
8002 {
8005 {
8006 /* When a tree_cst is converted to a wide-int, the precision
8007 is taken from the type. However, if the precision of the
8008 mode underneath the type is smaller than that, it is
8009 possible that the value will not fit. The test below
8010 fails if any bit is set between the sign bit of the
8011 underlying mode and the top bit of the type. */
8014 }
8017 }
8019 /* If we haven't been able to decide at this point, there nothing more we
8020 can check ourselves here. Look at the base type if we have one and it
8021 has the same precision. */
8025 {
8028 }
8030 /* Or to fits_to_tree_p, if nothing else. */
8032 }
8034 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8035 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8036 represented (assuming two's-complement arithmetic) within the bit
8037 precision of the type are returned instead. */
8039 void
8041 {
8045 else
8046 {
8049 else
8050 {
8053 }
8054 }
8059 else
8060 {
8063 }
8064 }
8066 /* Return true if VAR is an automatic variable. */
8068 bool
8070 {
8075 }
8077 /* Return true if VAR is an automatic variable defined in function FN. */
8079 bool
8081 {
8085 }
8087 /* Subprogram of following function. Called by walk_tree.
8089 Return *TP if it is an automatic variable or parameter of the
8090 function passed in as DATA. */
8092 static tree
8094 {
8105 }
8107 /* Returns true if T is, contains, or refers to a type with variable
8108 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8109 arguments, but not the return type. If FN is nonzero, only return
8110 true if a modifier of the type or position of FN is a variable or
8111 parameter inside FN.
8113 This concept is more general than that of C99 'variably modified types':
8114 in C99, a struct type is never variably modified because a VLA may not
8115 appear as a structure member. However, in GNU C code like:
8117 struct S { int i[f()]; };
8119 is valid, and other languages may define similar constructs. */
8121 bool
8123 {
8124 tree t;
8126 /* Test if T is either variable (if FN is zero) or an expression containing
8127 a variable in FN. If TYPE isn't gimplified, return true also if
8128 gimplify_one_sizepos would gimplify the expression into a local
8129 variable. */
8130 #define RETURN_TRUE_IF_VAR(T) \
8131 do { tree _t = (T); \
8132 if (_t != NULL_TREE \
8133 && _t != error_mark_node \
8134 && !CONSTANT_CLASS_P (_t) \
8135 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8136 && (!fn \
8137 || (!TYPE_SIZES_GIMPLIFIED (type) \
8138 && (TREE_CODE (_t) != VAR_DECL \
8139 && !CONTAINS_PLACEHOLDER_P (_t))) \
8140 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8141 return true; } while (0)
8146 /* If TYPE itself has variable size, it is variably modified. */
8151 {
8155 /* Ada can have pointer types refering to themselves indirectly. */
8160 {
8163 }
8169 /* If TYPE is a function type, it is variably modified if the
8170 return type is variably modified. */
8180 /* Scalar types are variably modified if their end points
8181 aren't constant. */
8189 /* We can't see if any of the fields are variably-modified by the
8190 definition we normally use, since that would produce infinite
8191 recursion via pointers. */
8192 /* This is variably modified if some field's type is. */
8195 {
8200 /* If the type is a qualified union, then the DECL_QUALIFIER
8201 of fields can also be an expression containing a variable. */
8205 /* If the field is a qualified union, then it's only a container
8206 for what's inside so we look into it. That's necessary in LTO
8207 mode because the sizes of the field tested above have been set
8208 to PLACEHOLDER_EXPRs by free_lang_data. */
8212 }
8216 /* Do not call ourselves to avoid infinite recursion. This is
8217 variably modified if the element type is. */
8224 }
8226 /* The current language may have other cases to check, but in general,
8227 all other types are not variably modified. */
8230 #undef RETURN_TRUE_IF_VAR
8231 }
8233 /* Given a DECL or TYPE, return the scope in which it was declared, or
8234 NULL_TREE if there is no containing scope. */
8236 tree
8238 {
8240 }
8242 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8244 const_tree
8246 {
8248 {
8251 else
8253 }
8255 }
8257 /* Return the innermost context enclosing DECL that is
8258 a FUNCTION_DECL, or zero if none. */
8260 tree
8262 {
8263 tree context;
8268 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8269 where we look up the function at runtime. Such functions always take
8270 a first argument of type 'pointer to real context'.
8272 C++ should really be fixed to use DECL_CONTEXT for the real context,
8273 and use something else for the "virtual context". */
8275 context
8276 = TYPE_MAIN_VARIANT
8278 else
8282 {
8285 else
8287 }
8290 }
8292 /* Return the innermost context enclosing DECL that is
8293 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8294 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8296 tree
8298 {
8303 {
8324 }
8327 }
8329 /* CALL is a CALL_EXPR. Return the declaration for the function
8330 called, or NULL_TREE if the called function cannot be
8331 determined. */
8333 tree
8335 {
8336 tree addr;
8341 /* It's invalid to call this function with anything but a
8342 CALL_EXPR. */
8345 /* The first operand to the CALL is the address of the function
8346 called. */
8349 /* If there is no function, return early. */
8355 /* If this is a readonly function pointer, extract its initial value. */
8361 /* If the address is just `&f' for some function `f', then we know
8362 that `f' is being called. */
8367 /* We couldn't figure out what was being called. */
8369 }
8371 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8372 return the associated function code, otherwise return CFN_LAST. */
8374 combined_fn
8376 {
8377 /* It's invalid to call this function with anything but a CALL_EXPR. */
8388 }
8390 /* Comparator of indices based on tree_node_counts. */
8392 static int
8394 {
8399 }
8401 /* Comparator of indices based on tree_code_counts. */
8403 static int
8405 {
8410 }
8412 #define TREE_MEM_USAGE_SPACES 40
8414 /* Print debugging information about tree nodes generated during the compile,
8415 and any language-specific information. */
8417 void
8419 {
8421 {
8427 {
8434 {
8441 }
8446 }
8448 {
8458 {
8463 }
8470 }
8471 }
8472 else
8479 }
8480 \f
8483 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8485 unsigned
8487 {
8488 /* This relies on the raw feedback's top 4 bits being zero. */
8489 #define FEEDBACK(X) ((X) * 0x04c11db7)
8490 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8491 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8493 {
8498 };
8499 #undef FEEDBACK
8500 #undef SYNDROME
8504 {
8508 }
8511 }
8513 /* Generate a crc32 of a string. */
8515 unsigned
8517 {
8518 do
8522 }
8524 /* P is a string that will be used in a symbol. Mask out any characters
8525 that are not valid in that context. */
8527 void
8529 {
8534 #endif
8537 #endif
8538 ))
8540 }
8544 /* Create a unique anonymous identifier. The identifier is still a
8545 valid assembly label. */
8547 tree
8549 {
8551 #if !defined (NO_DOT_IN_LABEL)
8552 "."
8553 #elif !defined (NO_DOLLAR_IN_LABEL)
8554 "$"
8555 #else
8556 "_"
8557 #endif
8568 }
8570 /* Generate a name for a special-purpose function.
8571 The generated name may need to be unique across the whole link.
8572 Changes to this function may also require corresponding changes to
8573 xstrdup_mask_random.
8574 TYPE is some string to identify the purpose of this function to the
8575 linker or collect2; it must start with an uppercase letter,
8576 one of:
8577 I - for constructors
8578 D - for destructors
8579 N - for C++ anonymous namespaces
8580 F - for DWARF unwind frame information. */
8582 tree
8584 {
8589 /* If we already have a name we know to be unique, just use that. */
8592 /* If the target is handling the constructors/destructors, they
8593 will be local to this file and the name is only necessary for
8594 debugging purposes.
8595 We also assign sub_I and sub_D sufixes to constructors called from
8596 the global static constructors. These are always local. */
8600 {
8604 /* Just use the file's basename, because the full pathname
8605 might be quite long. */
8607 }
8608 else
8609 {
8610 /* Otherwise, the name must be unique across the entire link.
8611 We don't have anything that we know to be unique to this translation
8612 unit, so use what we do have and throw in some randomness. */
8630 }
8636 /* Set up the name of the file-level functions we may need.
8637 Use a global object (which is already required to be unique over
8638 the program) rather than the file name (which imposes extra
8639 constraints). */
8643 }
8644 \f
8645 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8647 /* Complain that the tree code of NODE does not match the expected 0
8648 terminated list of trailing codes. The trailing code list can be
8649 empty, for a more vague error message. FILE, LINE, and FUNCTION
8650 are of the caller. */
8652 void
8655 {
8666 {
8673 {
8680 }
8682 }
8683 else
8689 }
8691 /* Complain that the tree code of NODE does match the expected 0
8692 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8693 the caller. */
8695 void
8698 {
8712 {
8714 {
8717 }
8720 }
8726 }
8728 /* Similar to tree_check_failed, except that we check for a class of tree
8729 code, given in CL. */
8731 void
8734 {
8735 internal_error
8740 }
8742 /* Similar to tree_check_failed, except that instead of specifying a
8743 dozen codes, use the knowledge that they're all sequential. */
8745 void
8749 {
8762 {
8769 }
8774 }
8777 /* Similar to tree_check_failed, except that we check that a tree does
8778 not have the specified code, given in CL. */
8780 void
8783 {
8784 internal_error
8789 }
8792 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8794 void
8797 {
8803 }
8806 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8808 void
8812 {
8825 {
8832 }
8837 }
8840 #undef DEFTREESTRUCT
8841 #define DEFTREESTRUCT(VAL, NAME) NAME,
8845 };
8846 #undef DEFTREESTRUCT
8848 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8850 /* Similar to tree_class_check_failed, except that we check for
8851 whether CODE contains the tree structure identified by EN. */
8853 void
8858 {
8859 internal_error
8863 }
8866 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8867 (dynamically sized) vector. */
8869 void
8872 {
8873 internal_error
8877 }
8879 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8880 (dynamically sized) vector. */
8882 void
8885 {
8886 internal_error
8889 }
8891 /* Similar to above, except that the check is for the bounds of the operand
8892 vector of an expression node EXP. */
8894 void
8897 {
8899 internal_error
8903 }
8905 /* Similar to above, except that the check is for the number of
8906 operands of an OMP_CLAUSE node. */
8908 void
8911 {
8912 internal_error
8917 }
8919 \f
8920 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
8921 and mapped to the machine mode MODE. Initialize its fields and build
8922 the information necessary for debugging output. */
8924 static tree
8926 {
8927 tree t;
8948 /* We have built a main variant, based on the main variant of the
8949 inner type. Use it to build the variant we return. */
8957 }
8959 static tree
8961 {
8984 else
8986 }
8988 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8990 static tree
8992 {
8994 {
9006 }
9007 else
9008 {
9020 }
9023 }
9025 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9027 static tree
9029 {
9031 {
9043 }
9044 else
9045 {
9057 }
9060 }
9063 /* Create an atomic variant node for TYPE. This routine is called
9064 during initialization of data types to create the 5 basic atomic
9065 types. The generic build_variant_type function requires these to
9066 already be set up in order to function properly, so cannot be
9067 called from there. If ALIGN is non-zero, then ensure alignment is
9068 overridden to this value. */
9070 static tree
9072 {
9073 tree t;
9075 /* Make sure its not already registered. */
9086 }
9088 /* Information about the _FloatN and _FloatNx types. This must be in
9089 the same order as the corresponding TI_* enum values. */
9091 {
9099 };
9102 /* Create nodes for all integer types (and error_mark_node) using the sizes
9103 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9105 void
9107 {
9115 /* Define both `signed char' and `unsigned char'. */
9121 /* Define `char', which is like either `signed char' or `unsigned char'
9122 but not the same as either. */
9123 char_type_node
9124 = (signed_char
9139 {
9144 {
9147 }
9148 }
9150 /* Define a boolean type. This type only represents boolean values but
9151 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9157 /* Define what type to use for size_t. */
9166 else
9167 {
9173 {
9180 {
9182 }
9183 }
9186 }
9188 /* Define what type to use for ptrdiff_t. */
9197 else
9198 {
9202 {
9210 }
9213 }
9215 /* Fill in the rest of the sized types. Reuse existing type nodes
9216 when possible. */
9229 /* Don't call build_qualified type for atomics. That routine does
9230 special processing for atomics, and until they are initialized
9231 it's better not to make that call.
9233 Check to see if there is a target override for atomic types. */
9250 /* Define these next since types below may used them. */
9268 /* We are not going to have real types in C with less than byte alignment,
9269 so we might as well not have any types that claim to have it. */
9280 const_ptr_type_node
9302 {
9305 scalar_float_mode mode;
9309 /* Work around the rs6000 KFmode having precision 113 not
9310 128. */
9322 }
9329 /* Fixed size integer types. */
9336 /* Decimal float types. */
9338 {
9353 }
9362 {
9366 }
9368 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9369 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9370 sat_ ## KIND ## _type_node = \
9371 make_sat_signed_ ## KIND ## _type (SIZE); \
9372 sat_unsigned_ ## KIND ## _type_node = \
9373 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9374 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9375 unsigned_ ## KIND ## _type_node = \
9376 make_unsigned_ ## KIND ## _type (SIZE);
9378 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9379 sat_ ## WIDTH ## KIND ## _type_node = \
9380 make_sat_signed_ ## KIND ## _type (SIZE); \
9381 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9382 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9383 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9384 unsigned_ ## WIDTH ## KIND ## _type_node = \
9385 make_unsigned_ ## KIND ## _type (SIZE);
9387 /* Make fixed-point type nodes based on four different widths. */
9388 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9389 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9390 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9391 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9392 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9394 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9395 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9396 NAME ## _type_node = \
9397 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9398 u ## NAME ## _type_node = \
9399 make_or_reuse_unsigned_ ## KIND ## _type \
9400 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9401 sat_ ## NAME ## _type_node = \
9402 make_or_reuse_sat_signed_ ## KIND ## _type \
9403 (GET_MODE_BITSIZE (MODE ## mode)); \
9404 sat_u ## NAME ## _type_node = \
9405 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9406 (GET_MODE_BITSIZE (U ## MODE ## mode));
9408 /* Fixed-point type and mode nodes. */
9421 {
9424 /* Many back-ends define record types without setting TYPE_NAME.
9425 If we copied the record type here, we'd keep the original
9426 record type without a name. This breaks name mangling. So,
9427 don't copy record types and let c_common_nodes_and_builtins()
9428 declare the type to be __builtin_va_list. */
9433 }
9435 /* SCEV analyzer global shared trees. */
9440 }
9442 /* Modify DECL for given flags.
9443 TM_PURE attribute is set only on types, so the function will modify
9444 DECL's type when ECF_TM_PURE is used. */
9446 void
9448 {
9478 /* Looping const or pure is implied by noreturn.
9479 There is currently no way to declare looping const or looping pure alone. */
9482 }
9485 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9487 static void
9490 {
9491 tree decl;
9498 }
9500 /* Call this function after instantiating all builtins that the language
9501 front end cares about. This will build the rest of the builtins
9502 and internal functions that are relied upon by the tree optimizers and
9503 the middle-end. */
9505 void
9507 {
9512 {
9514 ptr_type_node,
9515 ptr_type_node,
9516 integer_type_node,
9517 NULL_TREE);
9519 BUILT_IN_CLEAR_PADDING,
9522 }
9526 {
9530 BUILT_IN_UNREACHABLE,
9538 }
9542 {
9553 }
9556 {
9559 NULL_TREE);
9562 }
9565 {
9571 }
9573 /* If we're checking the stack, `alloca' can throw. */
9574 const int alloca_flags
9578 {
9583 }
9588 BUILT_IN_ALLOCA_WITH_ALIGN,
9590 alloca_flags);
9595 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9597 alloca_flags);
9603 BUILT_IN_INIT_TRAMPOLINE,
9606 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9610 BUILT_IN_INIT_DESCRIPTOR,
9615 BUILT_IN_ADJUST_TRAMPOLINE,
9619 BUILT_IN_ADJUST_DESCRIPTOR,
9627 BUILT_IN_CLEAR_CACHE,
9629 ECF_NOTHROW);
9632 BUILT_IN_NONLOCAL_GOTO,
9639 BUILT_IN_SETJMP_SETUP,
9644 BUILT_IN_SETJMP_RECEIVER,
9653 BUILT_IN_STACK_RESTORE,
9658 NULL_TREE);
9671 /* If there's a possibility that we might use the ARM EABI, build the
9672 alternate __cxa_end_cleanup node used to resume from C++. */
9674 {
9677 BUILT_IN_CXA_END_CLEANUP,
9679 }
9683 BUILT_IN_UNWIND_RESUME,
9687 ECF_NORETURN);
9690 {
9692 NULL_TREE);
9694 BUILT_IN_RETURN_ADDRESS,
9696 ECF_NOTHROW);
9697 }
9701 {
9706 BUILT_IN_PROFILE_FUNC_ENTER,
9710 BUILT_IN_PROFILE_FUNC_EXIT,
9712 }
9714 /* The exception object and filter values from the runtime. The argument
9715 must be zero before exception lowering, i.e. from the front end. After
9716 exception lowering, it will be the region number for the exception
9717 landing pad. These functions are PURE instead of CONST to prevent
9718 them from being hoisted past the exception edge that will initialize
9719 its value in the landing pad. */
9723 /* Only use TM_PURE if we have TM language support. */
9736 NULL_TREE);
9738 BUILT_IN_EH_COPY_VALUES,
9741 /* Complex multiplication and division. These are handled as builtins
9742 rather than optabs because emit_library_call_value doesn't support
9743 complex. Further, we can do slightly better with folding these
9744 beasties if the real and complex parts of the arguments are separate. */
9745 {
9749 {
9776 /* For -ftrapping-math these should throw from a former
9777 -fnon-call-exception stmt. */
9779 NULL);
9785 NULL);
9789 }
9790 }
9793 }
9795 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9796 better way.
9798 If we requested a pointer to a vector, build up the pointers that
9799 we stripped off while looking for the inner type. Similarly for
9800 return values from functions.
9802 The argument TYPE is the top of the chain, and BOTTOM is the
9803 new type which we will point to. */
9805 tree
9807 {
9811 {
9815 }
9817 {
9821 }
9823 {
9826 }
9828 {
9831 }
9833 {
9835 /* The build_method_type_directly() routine prepends 'this' to argument list,
9836 so we must compensate by getting rid of it. */
9837 outer
9838 = build_method_type_directly
9840 inner,
9842 }
9844 {
9847 }
9848 else
9853 }
9855 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9856 the inner type. */
9857 tree
9859 {
9860 poly_int64 nunits;
9864 {
9876 /* Check that there are no leftover bits. */
9884 }
9887 }
9889 /* Similarly, but takes the inner type and number of units, which must be
9890 a power of two. */
9892 tree
9894 {
9896 }
9898 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
9900 tree
9902 {
9907 {
9910 }
9911 else
9917 }
9919 /* Build a vector type that holds one boolean result for each element of
9920 vector type VECTYPE. The public interface for this operation is
9921 truth_type_for. */
9923 static tree
9925 {
9929 machine_mode mask_mode;
9939 }
9941 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
9942 set. */
9944 tree
9946 {
9948 tree cand;
9949 /* We always build the non-opaque variant before the opaque one,
9950 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9956 /* Othewise build a variant type and make sure to queue it after
9957 the non-opaque type. */
9965 }
9967 /* Return the value of element I of VECTOR_CST T as a wide_int. */
9969 static poly_wide_int
9971 {
9972 /* First handle elements that are directly encoded. */
9977 /* Identify the pattern that contains element I and work out the index of
9978 the last encoded element for that pattern. */
9984 /* If there are no steps, the final encoded value is the right one. */
9988 /* Otherwise work out the value from the last two encoded elements. */
9993 }
9995 /* Return the value of element I of VECTOR_CST T. */
9997 tree
9999 {
10000 /* First handle elements that are directly encoded. */
10005 /* If there are no steps, the final encoded value is the right one. */
10007 {
10008 /* Identify the pattern that contains element I and work out the index of
10009 the last encoded element for that pattern. */
10014 }
10016 /* Otherwise work out the value from the last two encoded elements. */
10019 }
10021 /* Given an initializer INIT, return TRUE if INIT is zero or some
10022 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10023 null, set *NONZERO if and only if INIT is known not to be all
10024 zeros. The combination of return value of false and *NONZERO
10025 false implies that INIT may but need not be all zeros. Other
10026 combinations indicate definitive answers. */
10028 bool
10030 {
10035 /* Conservatively clear NONZERO and set it only if INIT is definitely
10036 not all zero. */
10044 {
10053 /* ??? Note that this is not correct for C4X float formats. There,
10054 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10055 negative exponent. */
10090 {
10095 tree elt;
10102 }
10105 {
10120 }
10121 /* Fall through. */
10124 {
10132 /* We need to loop through all elements to handle cases like
10133 "\0" and "\0foobar". */
10136 {
10139 }
10142 }
10146 }
10147 }
10149 /* Return true if EXPR is an initializer expression in which every element
10150 is a constant that is numerically equal to 0 or 1. The elements do not
10151 need to be equal to each other. */
10153 bool
10155 {
10159 {
10167 {
10174 {
10178 }
10181 }
10185 }
10186 }
10188 /* Check if vector VEC consists of all the equal elements and
10189 that the number of elements corresponds to the type of VEC.
10190 The function returns first element of the vector
10191 or NULL_TREE if the vector is not uniform. */
10192 tree
10194 {
10207 {
10211 }
10215 {
10219 {
10221 {
10224 }
10227 }
10232 }
10235 }
10237 /* If the argument is INTEGER_CST, return it. If the argument is vector
10238 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10239 return NULL_TREE.
10240 Look through location wrappers. */
10242 tree
10244 {
10251 {
10255 }
10258 }
10260 /* Checks to see if T is a constant or a constant vector and if each element E
10261 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10263 tree
10265 {
10275 tree cst;
10279 tree_vector_builder builder;
10282 else
10283 {
10289 }
10293 do
10294 {
10309 }
10313 }
10315 /* If VECTOR_CST T has a single nonzero element, return the index of that
10316 element, otherwise return -1. */
10318 int
10320 {
10326 {
10329 }
10330 else
10335 {
10338 {
10342 }
10343 }
10345 }
10347 /* Build an empty statement at location LOC. */
10349 tree
10351 {
10355 }
10358 /* Build an OMP clause with code CODE. LOC is the location of the
10359 clause. */
10361 tree
10363 {
10364 tree t;
10379 }
10381 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10382 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10383 Except for the CODE and operand count field, other storage for the
10384 object is initialized to zeros. */
10386 tree
10388 {
10389 tree t;
10401 /* Can't use TREE_OPERAND to store the length because if checking is
10402 enabled, it will try to check the length before we store it. :-P */
10406 }
10408 /* Helper function for build_call_* functions; build a CALL_EXPR with
10409 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10410 the argument slots. */
10412 static tree
10414 {
10415 tree t;
10423 }
10425 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10426 FN and a null static chain slot. NARGS is the number of call arguments
10427 which are specified as "..." arguments. */
10429 tree
10431 {
10432 tree ret;
10438 }
10440 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10441 FN and a null static chain slot. NARGS is the number of call arguments
10442 which are specified as a va_list ARGS. */
10444 tree
10446 {
10447 tree t;
10455 }
10457 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10458 FN and a null static chain slot. NARGS is the number of call arguments
10459 which are specified as a tree array ARGS. */
10461 tree
10464 {
10465 tree t;
10474 }
10476 /* Like build_call_array, but takes a vec. */
10478 tree
10480 {
10489 }
10491 /* Conveniently construct a function call expression. FNDECL names the
10492 function to be called and N arguments are passed in the array
10493 ARGARRAY. */
10495 tree
10497 {
10502 }
10504 /* Conveniently construct a function call expression. FNDECL names the
10505 function to be called and the arguments are passed in the vector
10506 VEC. */
10508 tree
10510 {
10513 }
10516 /* Conveniently construct a function call expression. FNDECL names the
10517 function to be called, N is the number of arguments, and the "..."
10518 parameters are the argument expressions. */
10520 tree
10522 {
10532 }
10534 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10535 varargs macros aren't supported by all bootstrap compilers. */
10537 tree
10539 {
10549 }
10551 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10552 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10553 It will get gimplified later into an ordinary internal function. */
10555 tree
10558 {
10566 }
10568 /* Build internal call expression. This is just like CALL_EXPR, except
10569 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10570 internal function. */
10572 tree
10575 {
10585 }
10587 /* Return a function call to FN, if the target is guaranteed to support it,
10588 or null otherwise.
10590 N is the number of arguments, passed in the "...", and TYPE is the
10591 type of the return value. */
10593 tree
10596 {
10606 {
10609 {
10612 OPTIMIZE_FOR_BOTH))
10614 }
10616 }
10617 else
10618 {
10623 }
10624 }
10626 /* Return a function call to the appropriate builtin alloca variant.
10628 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10629 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10630 bound for SIZE in case it is not a fixed value. */
10632 tree
10634 {
10636 {
10638 return
10640 }
10642 {
10645 }
10646 else
10647 {
10650 }
10651 }
10653 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10654 if SIZE == -1) and return a tree node representing char* pointer to
10655 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10656 the STRING_CST value is the LEN bytes at STR (the representation
10657 of the string, which may be wide). Otherwise it's all zeros. */
10659 tree
10663 {
10665 /* Set the maximum valid index based on the string length or SIZE. */
10666 unsigned HOST_WIDE_INT maxidx
10682 }
10686 /* Return true if T (assumed to be a DECL) must be assigned a memory
10687 location. */
10689 bool
10691 {
10697 }
10699 /* Return value of a constant X and sign-extend it. */
10701 HOST_WIDE_INT
10703 {
10707 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10711 {
10715 else
10717 }
10720 }
10722 /* If TYPE is an integral or pointer type, return an integer type with
10723 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10724 if TYPE is already an integer type of signedness UNSIGNEDP.
10725 If TYPE is a floating-point type, return an integer type with the same
10726 bitsize and with the signedness given by UNSIGNEDP; this is useful
10727 when doing bit-level operations on a floating-point value. */
10729 tree
10731 {
10736 {
10744 }
10747 {
10755 }
10764 else
10768 }
10770 /* If TYPE is an integral or pointer type, return an integer type with
10771 the same precision which is unsigned, or itself if TYPE is already an
10772 unsigned integer type. If TYPE is a floating-point type, return an
10773 unsigned integer type with the same bitsize as TYPE. */
10775 tree
10777 {
10779 }
10781 /* If TYPE is an integral or pointer type, return an integer type with
10782 the same precision which is signed, or itself if TYPE is already a
10783 signed integer type. If TYPE is a floating-point type, return a
10784 signed integer type with the same bitsize as TYPE. */
10786 tree
10788 {
10790 }
10792 /* - For VECTOR_TYPEs:
10793 - The truth type must be a VECTOR_BOOLEAN_TYPE.
10794 - The number of elements must match (known_eq).
10795 - targetm.vectorize.get_mask_mode exists, and exactly
10796 the same mode as the truth type.
10797 - Otherwise, the truth type must be a BOOLEAN_TYPE
10798 or useless_type_conversion_p to BOOLEAN_TYPE. */
10799 bool
10801 {
10804 machine_mode tmask_mode;
10807 {
10816 }
10819 }
10821 /* If TYPE is a vector type, return a signed integer vector type with the
10822 same width and number of subparts. Otherwise return boolean_type_node. */
10824 tree
10826 {
10828 {
10832 }
10833 else
10835 }
10837 /* Returns the largest value obtainable by casting something in INNER type to
10838 OUTER type. */
10840 tree
10842 {
10848 /* Compute a unique number for every combination. */
10853 /* Determine the exponent to use. */
10855 {
10858 /* oprec <= iprec, outer: signed, inner: don't care. */
10863 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10867 /* oprec > iprec, outer: signed, inner: signed. */
10871 /* oprec > iprec, outer: signed, inner: unsigned. */
10875 /* oprec > iprec, outer: unsigned, inner: signed. */
10879 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10884 }
10888 }
10890 /* Returns the smallest value obtainable by casting something in INNER type to
10891 OUTER type. */
10893 tree
10895 {
10899 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10900 and obtain 0. */
10902 /* If we are widening something of an unsigned type, OUTER type
10903 contains all values of INNER type. In particular, both INNER
10904 and OUTER types have zero in common. */
10907 else
10908 {
10909 /* If we are widening a signed type to another signed type, we
10910 want to obtain -2^^(iprec-1). If we are keeping the
10911 precision or narrowing to a signed type, we want to obtain
10912 -2^(oprec-1). */
10917 }
10918 }
10920 /* Return nonzero if two operands that are suitable for PHI nodes are
10921 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10922 SSA_NAME or invariant. Note that this is strictly an optimization.
10923 That is, callers of this function can directly call operand_equal_p
10924 and get the same result, only slower. */
10926 int
10928 {
10934 }
10936 /* Returns number of zeros at the end of binary representation of X. */
10938 tree
10940 {
10942 }
10945 #define WALK_SUBTREE(NODE) \
10946 do \
10947 { \
10948 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10949 if (result) \
10950 return result; \
10951 } \
10952 while (0)
10954 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10955 be walked whenever a type is seen in the tree. Rest of operands and return
10956 value are as for walk_tree. */
10958 static tree
10961 {
10965 {
10969 /* We have to worry about mutually recursive pointers. These can't
10970 be written in C. They can in Ada. It's pathological, but
10971 there's an ACATS test (c38102a) that checks it. Deal with this
10972 by checking if we're pointing to another pointer, that one
10973 points to another pointer, that one does too, and we have no htab.
10974 If so, get a hash table. We check three levels deep to avoid
10975 the cost of the hash table if we don't need one. */
10980 {
10987 }
10989 /* fall through */
10998 /* Fall through. */
11002 {
11003 tree arg;
11005 /* We never want to walk into default arguments. */
11008 }
11012 /* Don't follow this nodes's type if a pointer for fear that
11013 we'll have infinite recursion. If we have a PSET, then we
11014 need not fear. */
11029 }
11032 }
11034 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11035 called with the DATA and the address of each sub-tree. If FUNC returns a
11036 non-NULL value, the traversal is stopped, and the value returned by FUNC
11037 is returned. If PSET is non-NULL it is used to record the nodes visited,
11038 and to avoid visiting a node more than once. */
11040 tree
11043 {
11046 tree result;
11048 #define WALK_SUBTREE_TAIL(NODE) \
11049 do \
11050 { \
11051 tp = & (NODE); \
11052 goto tail_recurse; \
11053 } \
11054 while (0)
11056 tail_recurse:
11057 /* Skip empty subtrees. */
11061 /* Don't walk the same tree twice, if the user has requested
11062 that we avoid doing so. */
11066 /* Call the function. */
11070 /* If we found something, return it. */
11076 /* Even if we didn't, FUNC may have decided that there was nothing
11077 interesting below this point in the tree. */
11079 {
11080 /* But we still need to check our siblings. */
11085 else
11087 }
11090 {
11094 }
11097 {
11109 /* None of these have subtrees other than those already walked
11110 above. */
11118 {
11124 /* Walk all elements but the first. */
11128 /* Now walk the first one as a tail call. */
11130 }
11133 {
11137 /* Walk all elements but the first. */
11140 /* Now walk the first one as a tail call. */
11142 }
11149 {
11154 idx++)
11156 }
11163 {
11164 tree decl;
11166 {
11167 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11168 into declarations that are just mentioned, rather than
11169 declared; they don't really belong to this part of the tree.
11170 And, we can see cycles: the initializer for a declaration
11171 can refer to the declaration itself. */
11175 }
11177 }
11180 {
11181 tree_stmt_iterator i;
11184 }
11188 {
11193 }
11196 {
11199 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11200 But, we only want to walk once. */
11205 }
11208 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11209 defining. We only want to walk into these fields of a type in this
11210 case and not in the general case of a mere reference to the type.
11212 The criterion is as follows: if the field can be an expression, it
11213 must be walked only here. This should be in keeping with the fields
11214 that are directly gimplified in gimplify_type_sizes in order for the
11215 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11216 variable-sized types.
11218 Note that DECLs get walked as part of processing the BIND_EXPR. */
11220 {
11221 /* Call the function for the decl so e.g. copy_tree_body_r can
11222 replace it with the remapped one. */
11231 /* Call the function for the type. See if it returns anything or
11232 doesn't want us to continue. If we are to continue, walk both
11233 the normal fields and those for the declaration case. */
11238 /* But do not walk a pointed-to type since it may itself need to
11239 be walked in the declaration case if it isn't anonymous. */
11241 {
11245 }
11247 /* If this is a record type, also walk the fields. */
11249 {
11250 tree field;
11254 {
11255 /* We'd like to look at the type of the field, but we can
11256 easily get infinite recursion. So assume it's pointed
11257 to elsewhere in the tree. Also, ignore things that
11258 aren't fields. */
11267 }
11268 }
11270 /* Same for scalar types. */
11276 {
11279 }
11283 }
11284 /* FALLTHRU */
11288 {
11291 /* Walk over all the sub-trees of this operand. */
11294 /* Go through the subtrees. We need to do this in forward order so
11295 that the scope of a FOR_EXPR is handled properly. */
11297 {
11301 }
11302 }
11303 /* If this is a type, walk the needed fields in the type. */
11307 }
11309 /* We didn't find what we were looking for. */
11312 #undef WALK_SUBTREE_TAIL
11313 }
11314 #undef WALK_SUBTREE
11316 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11318 tree
11320 walk_tree_lh lh)
11321 {
11322 tree result;
11327 }
11330 tree
11332 {
11339 }
11341 void
11343 {
11347 {
11349 }
11350 else
11352 }
11354 /* Create a nameless artificial label and put it in the current
11355 function context. The label has a location of LOC. Returns the
11356 newly created label. */
11358 tree
11360 {
11368 }
11370 /* Given a tree, try to return a useful variable name that we can use
11371 to prefix a temporary that is being assigned the value of the tree.
11372 I.E. given <temp> = &A, return A. */
11376 {
11377 tree stripped_decl;
11384 {
11389 }
11390 else
11391 {
11393 {
11398 }
11399 }
11400 }
11402 /* Return true if TYPE has a variable argument list. */
11404 bool
11406 {
11407 function_args_iterator args_iter;
11414 {
11416 }
11419 }
11421 /* Return true if TYPE has a prototype. */
11423 bool
11425 {
11426 tree t;
11432 }
11434 /* If BLOCK is inlined from an __attribute__((__artificial__))
11435 routine, return pointer to location from where it has been
11436 called. */
11437 location_t *
11439 {
11444 {
11447 {
11448 /* If AO is an artificial inline, point RET to the
11449 call site locus at which it has been inlined and continue
11450 the loop, in case AO's caller is also an artificial
11451 inline. */
11455 else
11457 }
11462 }
11464 }
11467 /* If EXP is inlined from an __attribute__((__artificial__))
11468 function, return the location of the original call expression. */
11470 location_t
11472 {
11477 else
11479 }
11481 /* Return the location into which EXP has been inlined. Analogous
11482 to tree_nonartificial_location() above but not limited to artificial
11483 functions declared inline. If SYSTEM_HEADER is true, return
11484 the macro expansion point of the location if it's in a system header */
11486 location_t
11488 {
11495 {
11503 }
11506 {
11509 /* Only consider macro expansion when the block traversal failed
11510 to find a location. Otherwise it's not relevant. */
11512 }
11515 }
11517 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11518 nodes. */
11520 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11522 hashval_t
11524 {
11531 else
11533 }
11535 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11536 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11537 same. */
11539 bool
11541 {
11554 else
11556 }
11558 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11560 tree
11563 {
11564 tree t;
11566 /* Use the cache of optimization nodes. */
11574 {
11575 /* Insert this one into the hash table. */
11579 /* Make a new node for next time round. */
11581 }
11584 }
11586 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11588 tree
11591 {
11592 tree t;
11594 /* Use the cache of optimization nodes. */
11602 {
11603 /* Insert this one into the hash table. */
11607 /* Make a new node for next time round. */
11609 }
11612 }
11614 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11615 so that they aren't saved during PCH writing. */
11617 void
11619 {
11624 }
11626 /* Determine the "ultimate origin" of a block. */
11628 tree
11630 {
11635 else
11636 {
11641 }
11642 }
11644 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11645 no instruction. */
11647 bool
11649 {
11650 /* Do not strip casts into or out of differing address spaces. */
11653 {
11658 }
11661 {
11662 /* We already know that outer_type is not a pointer with
11663 a non-generic address space. */
11665 }
11667 /* Use precision rather then machine mode when we can, which gives
11668 the correct answer even for submode (bit-field) types. */
11677 /* Otherwise fall back on comparing machine modes (e.g. for
11678 aggregate types, floats). */
11680 }
11682 /* Return true iff conversion in EXP generates no instruction. Mark
11683 it inline so that we fully inline into the stripping functions even
11684 though we have two uses of this function. */
11688 {
11703 }
11705 /* Return true iff conversion in EXP generates no instruction. Don't
11706 consider conversions changing the signedness. */
11708 static bool
11710 {
11721 }
11723 /* Strip conversions from EXP according to tree_nop_conversion and
11724 return the resulting expression. */
11726 tree
11728 {
11732 }
11734 /* Strip conversions from EXP according to tree_sign_nop_conversion
11735 and return the resulting expression. */
11737 tree
11739 {
11743 }
11745 /* Avoid any floating point extensions from EXP. */
11746 tree
11748 {
11751 /* For floating point constant look up the narrowest type that can hold
11752 it properly and handle it like (type)(narrowest_type)constant.
11753 This way we can optimize for instance a=a*2.0 where "a" is float
11754 but 2.0 is double constant. */
11756 {
11757 REAL_VALUE_TYPE orig;
11770 }
11789 }
11791 /* Strip out all handled components that produce invariant
11792 offsets. */
11794 const_tree
11796 {
11798 {
11800 {
11815 }
11817 }
11820 }
11824 /* Return the GCC personality function decl. */
11826 tree
11828 {
11832 }
11834 /* TARGET is a call target of GIMPLE call statement
11835 (obtained by gimple_call_fn). Return true if it is
11836 OBJ_TYPE_REF representing an virtual call of C++ method.
11837 (As opposed to OBJ_TYPE_REF representing objc calls
11838 through a cast where middle-end devirtualization machinery
11839 can't apply.) FOR_DUMP_P is true when being called from
11840 the dump routines. */
11842 bool
11844 {
11853 /* If we do not have BINFO associated, it means that type was built
11854 without devirtualization enabled. Do not consider this a virtual
11855 call. */
11859 }
11861 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
11863 static tree
11865 {
11876 }
11878 /* Try to find a base info of BINFO that would have its field decl at offset
11879 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11880 found, return, otherwise return NULL_TREE. */
11882 tree
11884 {
11888 {
11890 tree fld;
11899 {
11907 }
11911 /* Offset 0 indicates the primary base, whose vtable contents are
11912 represented in the binfo for the derived class. */
11914 {
11916 /* Offsets in BINFO are in bytes relative to the whole structure
11917 while POS is in bits relative to the containing field. */
11924 {
11927 }
11930 else
11932 binfo_offset);
11933 }
11937 }
11938 }
11940 /* Returns true if X is a typedef decl. */
11942 bool
11944 {
11947 }
11949 /* Returns true iff TYPE is a type variant created for a typedef. */
11951 bool
11953 {
11955 }
11957 /* PR 84195: Replace control characters in "unescaped" with their
11958 escaped equivalents. Allow newlines if -fmessage-length has
11959 been set to a non-zero value. This is done here, rather than
11960 where the attribute is recorded as the message length can
11961 change between these two locations. */
11963 void
11965 {
11983 {
11987 {
11991 }
11994 {
11996 {
11997 /* We only allocate space for a new string if we
11998 actually encounter a control character that
11999 needs replacing. */
12003 }
12008 {
12017 }
12018 }
12021 }
12024 {
12028 }
12029 }
12031 /* Warn about a use of an identifier which was marked deprecated. Returns
12032 whether a warning was given. */
12034 bool
12036 {
12037 escaped_string msg;
12043 {
12047 {
12052 }
12053 }
12063 {
12064 auto_diagnostic_group d;
12068 else
12073 }
12075 {
12080 {
12086 }
12088 auto_diagnostic_group d;
12090 {
12094 else
12097 }
12098 else
12099 {
12103 else
12106 }
12110 }
12113 }
12115 /* Error out with an identifier which was marked 'unavailable'. */
12116 void
12118 {
12119 escaped_string msg;
12125 {
12129 {
12134 }
12135 }
12144 {
12145 auto_diagnostic_group d;
12148 else
12151 }
12153 {
12158 {
12164 }
12166 auto_diagnostic_group d;
12168 {
12171 else
12173 }
12174 else
12175 {
12178 else
12180 }
12184 }
12185 }
12187 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12188 somewhere in it. */
12190 bool
12192 {
12194 {
12199 }
12202 }
12204 /* Try to determine whether a TRY_CATCH expression can fall through.
12205 This is a subroutine of block_may_fallthru. */
12207 static bool
12209 {
12210 tree_stmt_iterator i;
12212 /* If the TRY block can fall through, the whole TRY_CATCH can
12213 fall through. */
12219 {
12221 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12222 catch expression and a body. The whole TRY_CATCH may fall
12223 through iff any of the catch bodies falls through. */
12225 {
12228 }
12232 /* The exception filter expression only matters if there is an
12233 exception. If the exception does not match EH_FILTER_TYPES,
12234 we will execute EH_FILTER_FAILURE, and we will fall through
12235 if that falls through. If the exception does match
12236 EH_FILTER_TYPES, the stack unwinder will continue up the
12237 stack, so we will not fall through. We don't know whether we
12238 will throw an exception which matches EH_FILTER_TYPES or not,
12239 so we just ignore EH_FILTER_TYPES and assume that we might
12240 throw an exception which doesn't match. */
12244 /* This case represents statements to be executed when an
12245 exception occurs. Those statements are implicitly followed
12246 by a RESX statement to resume execution after the exception.
12247 So in this case the TRY_CATCH never falls through. */
12249 }
12250 }
12252 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12253 need not be 100% accurate; simply be conservative and return true if we
12254 don't know. This is used only to avoid stupidly generating extra code.
12255 If we're wrong, we'll just delete the extra code later. */
12257 bool
12259 {
12260 /* This CONST_CAST is okay because expr_last returns its argument
12261 unmodified and we assign it to a const_tree. */
12265 {
12268 /* Easy cases. If the last statement of the block implies
12269 control transfer, then we can't fall through. */
12273 /* If there is a default: label or case labels cover all possible
12274 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12275 to some case label in all cases and all we care is whether the
12276 SWITCH_BODY falls through. */
12293 /* The finally clause is always executed after the try clause,
12294 so if it does not fall through, then the try-finally will not
12295 fall through. Otherwise, if the try clause does not fall
12296 through, then when the finally clause falls through it will
12297 resume execution wherever the try clause was going. So the
12298 whole try-finally will only fall through if both the try
12299 clause and the finally clause fall through. */
12309 else
12311 /* FALLTHRU */
12314 /* Functions that do not return do not fall through. */
12328 }
12329 }
12331 /* True if we are using EH to handle cleanups. */
12334 /* This routine is called from front ends to indicate eh should be used for
12335 cleanups. */
12336 void
12338 {
12340 }
12342 /* Query whether EH is used for cleanups. */
12343 bool
12345 {
12347 }
12349 /* Wrapper for tree_code_name to ensure that tree code is valid */
12352 {
12355 /* The tree_code enum promotes to signed, but we could be getting
12356 invalid values, so force an unsigned comparison. */
12358 {
12362 }
12365 }
12367 /* Drops the TREE_OVERFLOW flag from T. */
12369 tree
12371 {
12374 /* For tree codes with a sharing machinery re-build the result. */
12378 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12379 and canonicalize the result. */
12381 {
12382 tree_vector_builder builder;
12386 {
12391 }
12393 }
12395 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12396 and drop the flag. */
12400 /* For constants that contain nested constants, drop the flag
12401 from those as well. */
12403 {
12408 }
12411 }
12413 /* Given a memory reference expression T, return its base address.
12414 The base address of a memory reference expression is the main
12415 object being referenced. For instance, the base address for
12416 'array[i].fld[j]' is 'array'. You can think of this as stripping
12417 away the offset part from a memory address.
12419 This function calls handled_component_p to strip away all the inner
12420 parts of the memory reference until it reaches the base object. */
12422 tree
12424 {
12436 }
12438 /* Return a tree of sizetype representing the size, in bytes, of the element
12439 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12441 tree
12443 {
12448 /* If a size was specified in the ARRAY_REF, it's the size measured
12449 in alignment units of the element type. So multiply by that value. */
12451 {
12452 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12453 sizetype from another type of the same width and signedness. */
12458 }
12460 /* Otherwise, take the size from that of the element type. Substitute
12461 any PLACEHOLDER_EXPR that we have. */
12462 else
12464 }
12466 /* Return a tree representing the lower bound of the array mentioned in
12467 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12469 tree
12471 {
12474 /* If a lower bound is specified in EXP, use it. */
12478 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12479 substituting for a PLACEHOLDER_EXPR as needed. */
12483 /* Otherwise, return a zero of the appropriate type. */
12487 }
12489 /* Return a tree representing the upper bound of the array mentioned in
12490 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12492 tree
12494 {
12497 /* If there is a domain type and it has an upper bound, use it, substituting
12498 for a PLACEHOLDER_EXPR as needed. */
12502 /* Otherwise fail. */
12504 }
12506 /* Returns true if REF is an array reference, component reference,
12507 or memory reference to an array at the end of a structure.
12508 If this is the case, the array may be allocated larger
12509 than its upper bound implies. */
12511 bool
12513 {
12514 tree atype;
12518 {
12521 }
12526 {
12532 {
12534 {
12540 }
12541 else
12543 }
12544 else
12546 }
12547 else
12555 {
12556 /* If the reference chain contains a component reference to a
12557 non-union type and there follows another field the reference
12558 is not at the end of a structure. */
12560 {
12562 {
12568 }
12569 }
12570 /* If we have a multi-dimensional array we do not consider
12571 a non-innermost dimension as flex array if the whole
12572 multi-dimensional array is at struct end.
12573 Same for an array of aggregates with a trailing array
12574 member. */
12578 ;
12579 /* If we view an underlying object as sth else then what we
12580 gathered up to now is what we have to rely on. */
12583 else
12587 }
12589 /* The array now is at struct end. Treat flexible arrays as
12590 always subject to extend, even into just padding constrained by
12591 an underlying decl. */
12597 /* If the reference is based on a declared entity, the size of the array
12598 is constrained by its given domain. (Do not trust commons PR/69368). */
12602 && !(flag_unconstrained_commons
12606 {
12607 /* Check whether the array domain covers all of the available
12608 padding. */
12609 poly_int64 offset;
12617 /* If at least one extra element fits it is a flexarray. */
12626 }
12629 }
12631 /* Return a tree representing the offset, in bytes, of the field referenced
12632 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12634 tree
12636 {
12641 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12642 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12643 value. */
12645 {
12646 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12647 sizetype from another type of the same width and signedness. */
12653 }
12655 /* Otherwise, take the offset from that of the field. Substitute
12656 any PLACEHOLDER_EXPR that we have. */
12657 else
12659 }
12661 /* Given the initializer INIT, return the initializer for the field
12662 DECL if it exists, otherwise null. Used to obtain the initializer
12663 for a flexible array member and determine its size. */
12665 static tree
12667 {
12673 {
12678 {
12682 }
12683 }
12686 }
12688 /* Determines the size of the member referenced by the COMPONENT_REF
12689 REF, using its initializer expression if necessary in order to
12690 determine the size of an initialized flexible array member.
12691 If non-null, set *ARK when REF refers to an interior zero-length
12692 array or a trailing one-element array.
12693 Returns the size as sizetype (which might be zero for an object
12694 with an uninitialized flexible array member) or null if the size
12695 cannot be determined. */
12697 tree
12699 {
12702 special_array_member sambuf;
12707 /* The object/argument referenced by the COMPONENT_REF and its type. */
12710 /* The referenced member. */
12715 {
12718 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
12719 to the type of a class with a virtual base which doesn't
12720 reflect the size of the virtual's members (see pr97595).
12721 If that's the case fail for now and implement something
12722 more robust in the future. */
12729 /* MEMBER is either an interior array or is an array with
12730 more than one element. */
12734 {
12737 else
12738 {
12741 }
12742 }
12750 {
12755 /* MEMBER is an array with more than one element. */
12760 }
12762 /* For a reference to a zero- or one-element array member of a union
12763 use the size of the union instead of the size of the member. */
12766 }
12768 /* MEMBER is either a bona fide flexible array member, or a zero-length
12769 array member, or an array of length one treated as such. */
12771 /* If the reference is to a declared object and the member a true
12772 flexible array, try to determine its size from its initializer. */
12776 {
12787 }
12789 /* BASE is the declared object of which MEMBER is either a member
12790 or that is cast to ARGTYPE (e.g., a char buffer used to store
12791 an ARGTYPE object). */
12794 /* Determine the base type of the referenced object. If it's
12795 the same as ARGTYPE and MEMBER has a known size, return it. */
12807 /* MEMBER is a true flexible array member. Compute its size from
12808 the initializer of the BASE object if it has one. */
12811 {
12814 {
12817 {
12818 /* Use the larger of the initializer size and the tail
12819 padding in the enclosing struct. */
12824 }
12827 }
12828 }
12831 {
12833 {
12838 /* The size of a flexible array member of an extern struct
12839 with no initializer cannot be determined (it's defined
12840 in another translation unit and can have an initializer
12841 with an arbitrary number of elements). */
12844 /* Use the size of the base struct or, for interior zero-length
12845 arrays, the size of the enclosing type. */
12847 }
12849 /* Use the size of the BASE object (possibly an array of some
12850 other type such as char used to store the struct). */
12852 else
12854 }
12856 /* If the flexible array member has a known size use the greater
12857 of it and the tail padding in the enclosing struct.
12858 Otherwise, when the size of the flexible array member is unknown
12859 and the referenced object is not a struct, use the size of its
12860 type when known. This detects sizes of array buffers when cast
12861 to struct types with flexible array members. */
12863 {
12866 {
12869 }
12871 }
12873 /* Return "don't know" for an external non-array object since its
12874 flexible array member can be initialized to have any number of
12875 elements. Otherwise, return zero because the flexible array
12876 member has no elements. */
12879 && (!typematch
12882 }
12884 /* Return the machine mode of T. For vectors, returns the mode of the
12885 inner type. The main use case is to feed the result to HONOR_NANS,
12886 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12888 machine_mode
12890 {
12896 }
12898 /* Vector types need to re-check the target flags each time we report
12899 the machine mode. We need to do this because attribute target can
12900 change the result of vector_mode_supported_p and have_regs_of_mode
12901 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
12902 change on a per-function basis. */
12903 /* ??? Possibly a better solution is to run through all the types
12904 referenced by a function and re-compute the TYPE_MODE once, rather
12905 than make the TYPE_MODE macro call a function. */
12907 machine_mode
12909 {
12910 machine_mode mode;
12918 {
12919 scalar_int_mode innermode;
12921 /* For integers, try mapping it to a same-sized scalar mode. */
12923 {
12926 scalar_int_mode mode;
12930 }
12933 }
12936 }
12938 /* Return the size in bits of each element of vector type TYPE. */
12940 unsigned int
12942 {
12947 }
12949 /* Calculate the size in bits of each element of vector type TYPE
12950 and return the result as a tree of type bitsizetype. */
12952 tree
12954 {
12959 }
12961 /* Verify that basic properties of T match TV and thus T can be a variant of
12962 TV. TV should be the more specified variant (i.e. the main variant). */
12964 static bool
12966 {
12967 /* Type variant can differ by:
12969 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
12970 ENCODE_QUAL_ADDR_SPACE.
12971 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
12972 in this case some values may not be set in the variant types
12973 (see TYPE_COMPLETE_P checks).
12974 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
12975 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
12976 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
12977 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
12978 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
12979 this is necessary to make it possible to merge types form different TUs
12980 - arrays, pointers and references may have TREE_TYPE that is a variant
12981 of TREE_TYPE of their main variants.
12982 - aggregates may have new TYPE_FIELDS list that list variants of
12983 the main variant TYPE_FIELDS.
12984 - vector types may differ by TYPE_VECTOR_OPAQUE
12985 */
12987 /* Convenience macro for matching individual fields. */
12988 #define verify_variant_match(flag) \
12989 do { \
12990 if (flag (tv) != flag (t)) \
12991 { \
12993 debug_tree (tv); \
12994 return false; \
12995 } \
12996 } while (false)
12998 /* tree_base checks. */
13001 /* FIXME: Ada builds non-artificial variants of artificial types. */
13002 #if 0
13005 #endif
13008 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13015 else
13017 /* FIXME: This check trigger during libstdc++ build. */
13018 #if 0
13021 #endif
13023 /* tree_type_common checks. */
13026 {
13034 {
13044 }
13046 }
13052 /* During LTO we merge variant lists from diferent translation units
13053 that may differ BY TYPE_CONTEXT that in turn may point
13054 to TRANSLATION_UNIT_DECL.
13055 Ada also builds variants of types with different TYPE_CONTEXT. */
13056 #if 0
13059 #endif
13065 {
13069 }
13071 /* tree_type_non_common checks. */
13073 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13074 and dangle the pointer from time to time. */
13078 {
13082 }
13088 {
13091 }
13098 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13099 or even type's main variant. This is needed to make bootstrap pass
13100 and the bug seems new in GCC 5.
13101 C++ FE should be updated to make this consistent and we should check
13102 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13103 is a match with main variant.
13105 Also disable the check for Java for now because of parser hack that builds
13106 first an dummy BINFO and then sometimes replace it by real BINFO in some
13107 of the copies. */
13110 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13111 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13112 at LTO time only. */
13114 {
13122 }
13124 /* Check various uses of TYPE_VALUES_RAW. */
13130 /* Permit incomplete variants of complete type. While FEs may complete
13131 all variants, this does not happen for C++ templates in all cases. */
13135 {
13138 /* Fortran builds qualified variants as new records with items of
13139 qualified type. Verify that they looks same. */
13146 /* FIXME: gfc_nonrestricted_type builds all types as variants
13147 with exception of pointer types. It deeply copies the type
13148 which means that we may end up with a variant type
13149 referring non-variant pointer. We may change it to
13150 produce types as variants, too, like
13151 objc_get_protocol_qualified_type does. */
13157 {
13165 }
13166 }
13169 /* For C++ the qualified variant of array type is really an array type
13170 of qualified TREE_TYPE.
13171 objc builds variants of pointer where pointer to type is a variant, too
13172 in objc_get_protocol_qualified_type. */
13178 {
13186 }
13189 {
13197 }
13199 #undef verify_variant_match
13200 }
13203 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13204 the middle-end types_compatible_p function. It needs to avoid
13205 claiming types are different for types that should be treated
13206 the same with respect to TBAA. Canonical types are also used
13207 for IL consistency checks via the useless_type_conversion_p
13208 predicate which does not handle all type kinds itself but falls
13209 back to pointer-comparison of TYPE_CANONICAL for aggregates
13210 for example. */
13212 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13213 type calculation because we need to allow inter-operability between signed
13214 and unsigned variants. */
13216 bool
13218 {
13219 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13220 signed char and unsigned char. Similarly fortran FE builds
13221 C_SIZE_T as signed type, while C defines it unsigned. */
13224 == INTEGER_TYPE
13227 }
13229 /* Return true iff T1 and T2 are structurally identical for what
13230 TBAA is concerned.
13231 This function is used both by lto.cc canonical type merging and by the
13232 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13233 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13234 only for LTO because only in these cases TYPE_CANONICAL equivalence
13235 correspond to one defined by gimple_canonical_types_compatible_p. */
13237 bool
13240 {
13241 /* Type variants should be same as the main variant. When not doing sanity
13242 checking to verify this fact, go to main variants and save some work. */
13244 {
13247 }
13249 /* Check first for the obvious case of pointer identity. */
13253 /* Check that we have two types to compare. */
13257 /* We consider complete types always compatible with incomplete type.
13258 This does not make sense for canonical type calculation and thus we
13259 need to ensure that we are never called on it.
13261 FIXME: For more correctness the function probably should have three modes
13262 1) mode assuming that types are complete mathcing their structure
13263 2) mode allowing incomplete types but producing equivalence classes
13264 and thus ignoring all info from complete types
13265 3) mode allowing incomplete types to match complete but checking
13266 compatibility between complete types.
13268 1 and 2 can be used for canonical type calculation. 3 is the real
13269 definition of type compatibility that can be used i.e. for warnings during
13270 declaration merging. */
13275 /* If the types have been previously registered and found equal
13276 they still are. */
13280 {
13281 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13282 they are always NULL, but they are set to non-NULL for types
13283 constructed by build_pointer_type and variants. In this case the
13284 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13285 all pointers are considered equal. Be sure to not return false
13286 negatives. */
13290 }
13292 /* For types where we do ODR based TBAA the canonical type is always
13293 set correctly, so we know that types are different if their
13294 canonical types does not match. */
13300 /* Can't be the same type if the types don't have the same code. */
13305 /* Qualifiers do not matter for canonical type comparison purposes. */
13307 /* Void types and nullptr types are always the same. */
13312 /* Can't be the same type if they have different mode. */
13316 /* Non-aggregate types can be handled cheaply. */
13324 {
13325 /* Can't be the same type if they have different recision. */
13329 /* In some cases the signed and unsigned types are required to be
13330 inter-operable. */
13335 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13336 interoperable with "signed char". Unless all frontends are revisited
13337 to agree on these types, we must ignore the flag completely. */
13339 /* Fortran standard define C_PTR type that is compatible with every
13340 C pointer. For this reason we need to glob all pointers into one.
13341 Still pointers in different address spaces are not compatible. */
13343 {
13347 }
13349 /* Tail-recurse to components. */
13354 trust_type_canonical);
13357 }
13359 /* Do type-specific comparisons. */
13361 {
13363 /* Array types are the same if the element types are the same and
13364 the number of elements are the same. */
13366 trust_type_canonical)
13371 else
13372 {
13376 /* For an incomplete external array, the type domain can be
13377 NULL_TREE. Check this condition also. */
13382 else
13383 {
13389 /* The minimum/maximum values have to be the same. */
13401 else
13403 }
13404 }
13408 /* Function types are the same if the return type and arguments types
13409 are the same. */
13411 trust_type_canonical))
13416 else
13417 {
13423 {
13426 trust_type_canonical))
13428 }
13434 }
13439 {
13442 /* Don't try to compare variants of an incomplete type, before
13443 TYPE_FIELDS has been copied around. */
13451 /* For aggregate types, all the fields must be the same. */
13455 {
13456 /* Skip non-fields and zero-sized fields. */
13467 /* The fields must have the same name, offset and type. */
13470 || !gimple_canonical_types_compatible_p
13472 trust_type_canonical))
13474 }
13476 /* If one aggregate has more fields than the other, they
13477 are not the same. */
13482 }
13485 /* Consider all types with language specific trees in them mutually
13486 compatible. This is executed only from verify_type and false
13487 positives can be tolerated. */
13490 }
13491 }
13493 /* Verify type T. */
13495 void
13497 {
13501 {
13504 }
13506 {
13510 }
13516 ;
13518 {
13522 }
13523 /* Method and function types cannot be used to address memory and thus
13524 TYPE_CANONICAL really matters only for determining useless conversions.
13526 FIXME: C++ FE produce declarations of builtin functions that are not
13527 compatible with main variants. */
13529 ;
13531 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
13532 with variably sized arrays because their sizes possibly
13533 gimplified to different variables. */
13537 {
13541 }
13545 {
13549 }
13551 {
13556 }
13559 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13561 {
13562 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13563 and danagle the pointer from time to time. */
13567 {
13571 }
13572 }
13574 {
13577 {
13581 }
13582 }
13584 {
13587 {
13591 }
13592 }
13595 {
13596 /* FIXME: The following check should pass:
13597 useless_type_conversion_p (const_cast <tree> (t),
13598 TREE_TYPE (TYPE_MIN_VALUE (t))
13599 but does not for C sizetypes in LTO. */
13600 }
13602 /* Check various uses of TYPE_MAXVAL_RAW. */
13604 {
13606 ;
13608 {
13612 }
13614 {
13618 }
13619 }
13621 {
13625 {
13629 }
13630 }
13632 {
13636 {
13640 }
13641 }
13644 {
13645 /* FIXME: The following check should pass:
13646 useless_type_conversion_p (const_cast <tree> (t),
13647 TREE_TYPE (TYPE_MAX_VALUE (t))
13648 but does not for C sizetypes in LTO. */
13649 }
13651 {
13654 {
13658 }
13659 }
13661 {
13665 }
13668 {
13672 }
13674 /* Check various uses of TYPE_VALUES_RAW. */
13677 {
13681 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13682 CONST_DECL of ENUMERAL TYPE. */
13684 {
13689 }
13693 {
13699 }
13701 {
13706 }
13707 }
13709 {
13711 {
13715 }
13716 }
13718 {
13720 {
13723 }
13725 {
13726 /* TODO: verify properties of decls. */
13728 ;
13730 ;
13732 ;
13734 ;
13736 ;
13738 ;
13740 ;
13741 else
13742 {
13746 }
13747 }
13748 }
13755 {
13757 {
13762 }
13764 {
13768 }
13769 /* Verify just enough of cache to ensure that no one copied it to new type.
13770 All copying should go by copy_node that should clear it. */
13772 {
13777 {
13782 }
13783 }
13784 }
13787 {
13788 /* C++ FE uses TREE_PURPOSE to store initial values. */
13790 {
13794 }
13796 {
13800 }
13801 }
13803 {
13807 }
13815 {
13818 }
13820 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13821 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13822 of a type. */
13825 {
13828 }
13831 {
13834 }
13835 }
13838 /* Return 1 if ARG interpreted as signed in its precision is known to be
13839 always positive or 2 if ARG is known to be always negative, or 3 if
13840 ARG may be positive or negative. */
13842 int
13844 {
13851 {
13855 else
13857 }
13861 {
13863 /* Narrower value zero extended into wider type
13864 will always result in positive values. */
13871 }
13875 value_range r;
13877 {
13881 {
13885 {
13894 }
13895 }
13897 }
13899 {
13900 /* For unsigned values, the "positive" range comes
13901 below the "negative" range. */
13906 }
13907 else
13908 {
13913 }
13915 }
13920 /* Return true if ARG is marked with the nonnull attribute in the
13921 current function signature. */
13923 bool
13925 {
13933 /* The static chain decl is always non null. */
13937 /* THIS argument of method is always non-NULL. */
13943 /* Values passed by reference are always non-NULL. */
13950 {
13953 /* If "nonnull" wasn't specified, we know nothing about the argument. */
13957 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
13961 /* Get the position number for ARG in the function signature. */
13963 t;
13965 {
13968 }
13972 /* Now see if ARG_NUM is mentioned in the nonnull list. */
13974 {
13977 }
13978 }
13981 }
13983 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
13984 information. */
13986 location_t
13988 {
13992 }
13994 location_t
13996 {
13997 source_range src_range;
14001 }
14003 location_t
14005 {
14011 pure_loc,
14012 src_range,
14013 NULL);
14016 }
14018 /* Return EXPR, potentially wrapped with a node expression LOC,
14019 if !CAN_HAVE_LOCATION_P (expr).
14021 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14022 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14024 Wrapper nodes can be identified using location_wrapper_p. */
14026 tree
14028 {
14035 /* We should only be adding wrappers for constants and for decls,
14036 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14041 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14042 any impact of the wrapper nodes. */
14046 /* Compiler-generated temporary variables don't need a wrapper. */
14050 /* If any auto_suppress_location_wrappers are active, don't create
14051 wrappers. */
14055 tree_code code
14060 /* Mark this node as being a wrapper. */
14063 }
14067 /* Return the name of combined function FN, for debugging purposes. */
14071 {
14073 {
14076 }
14077 else
14079 }
14081 /* Return a bitmap with a bit set corresponding to each argument in
14082 a function call type FNTYPE declared with attribute nonnull,
14083 or null if none of the function's argument are nonnull. The caller
14084 must free the bitmap. */
14086 bitmap
14088 {
14094 {
14095 /* The this pointer in C++ non-static member functions is
14096 implicitly nonnull whether or not it's declared as such. */
14099 }
14105 /* A function declaration can specify multiple attribute nonnull,
14106 each with zero or more arguments. The loop below creates a bitmap
14107 representing a union of all the arguments. An empty (but non-null)
14108 bitmap means that all arguments have been declaraed nonnull. */
14110 {
14119 {
14120 /* Clear the bitmap in case a previous attribute nonnull
14121 set it and this one overrides it for all arguments. */
14124 }
14126 /* Iterate over the indices of the format arguments declared nonnull
14127 and set a bit for each. */
14129 {
14132 }
14133 }
14136 }
14138 /* Returns true if TYPE is a type where it and all of its subobjects
14139 (recursively) are of structure, union, or array type. */
14141 bool
14143 {
14145 {
14152 }
14158 }
14160 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14161 that shouldn't be passed via stack. */
14163 bool
14165 {
14176 }
14178 /* Determine whether TYPE is a structure with a flexible array member,
14179 or a union containing such a structure (possibly recursively). */
14181 bool
14183 {
14186 {
14202 {
14206 }
14210 }
14211 }
14213 /* Like int_size_in_bytes, but handle empty records specially. */
14215 HOST_WIDE_INT
14217 {
14219 }
14221 /* Like size_in_bytes, but handle empty records specially. */
14223 tree
14225 {
14227 }
14229 /* Return true if an expression with CODE has to have the same result type as
14230 its first operand. */
14232 bool
14234 {
14236 {
14270 }
14271 }
14273 /* Return a typenode for the "standard" C type with a given name. */
14274 tree
14276 {
14308 }
14310 /* List of pointer types used to declare builtins before we have seen their
14311 real declaration.
14313 Keep the size up to date in tree.h ! */
14315 {
14322 };
14324 /* Return the maximum object size. */
14326 tree
14328 {
14329 /* To do: Make this a configurable parameter. */
14331 }
14333 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14334 parameter default to false and that weeds out error_mark_node. */
14336 bool
14339 {
14346 }
14348 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14349 delete operators. Return false if they may or may not name such
14350 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14351 do not. */
14353 bool
14356 {
14366 /* The following failures are due to invalid names so they're not
14367 considered certain mismatches. */
14383 /* The following failures are due to names of user-defined operators
14384 so they're also not considered certain mismatches. */
14386 /* *_len is now just the length after initial underscores. */
14392 /* The following failures are certain mismatches. */
14395 /* _Znw must match _Zdl, _Zna must match _Zda. */
14399 /* 'j', 'm' and 'y' correspond to size_t. */
14406 {
14407 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14408 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14415 }
14419 {
14420 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14421 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14422 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14432 }
14434 /* The negative result is conservative. */
14437 }
14439 /* Return the zero-based number corresponding to the argument being
14440 deallocated if FNDECL is a deallocation function or an out-of-bounds
14441 value if it isn't. */
14443 unsigned
14445 {
14446 /* A call to operator delete isn't recognized as one to a built-in. */
14448 {
14452 /* Avoid placement delete that's not been inlined. */
14458 }
14460 /* TODO: Handle user-defined functions with attribute malloc? Handle
14461 known non-built-ins like fopen? */
14463 {
14465 {
14471 }
14473 }
14482 {
14493 }
14496 }
14498 /* If EXPR refers to a character array or pointer declared attribute
14499 nonstring, return a decl for that array or pointer and set *REF
14500 to the referenced enclosing object or pointer. Otherwise return
14501 null. */
14503 tree
14505 {
14509 {
14513 {
14519 }
14520 else
14522 }
14527 /* To simplify calling code, store the referenced DECL regardless of
14528 the attribute determined below, but avoid storing the SSA_NAME_VAR
14529 obtained above (it's not useful for dataflow purposes). */
14533 /* Use the SSA_NAME_VAR that was determined above to see if it's
14534 declared nonstring. Otherwise drill down into the referenced
14535 DECL. */
14550 }
14552 #if CHECKING_P
14556 /* Selftests for tree. */
14558 /* Verify that integer constants are sane. */
14560 static void
14562 {
14575 }
14577 /* Verify identifiers. */
14579 static void
14581 {
14585 }
14587 /* Verify LABEL_DECL. */
14589 static void
14591 {
14597 }
14599 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14600 are given by VALS. */
14602 static tree
14604 {
14609 }
14611 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14613 static void
14615 {
14621 }
14623 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14624 and that its elements match EXPECTED. */
14626 static void
14629 {
14636 }
14638 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14639 and NPATTERNS background elements, and that its elements match
14640 EXPECTED. */
14642 static void
14645 {
14652 }
14654 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14655 and that its elements match EXPECTED. */
14657 static void
14660 {
14667 }
14669 /* Test the creation of VECTOR_CSTs. */
14671 static void
14673 {
14679 /* Test a simple linear series with a base of 0 and a step of 1:
14680 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14686 /* Try the same with the first element replaced by 100:
14687 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14692 /* Try a series that wraps around.
14693 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14699 /* Try a downward series:
14700 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14706 /* Try two interleaved series with different bases and steps:
14707 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14710 {
14713 }
14717 /* Try a duplicated value:
14718 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14724 /* Try an interleaved duplicated value:
14725 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14732 /* Try a duplicated value with 2 exceptions
14733 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14739 /* Try with and without a step
14740 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14746 /* Try a fully-general constant:
14747 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14751 }
14753 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
14754 Helper function for test_location_wrappers, to deal with STRIP_NOPS
14755 modifying its argument in-place. */
14757 static void
14759 {
14762 }
14764 /* Verify location wrappers. */
14766 static void
14768 {
14773 /* Wrapping a constant. */
14783 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
14786 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
14791 /* Wrapping a STRING_CST. */
14803 /* Wrapping a variable. */
14806 integer_type_node);
14815 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
14816 wrapper. */
14821 /* Verify that STRIP_NOPS removes wrappers. */
14825 }
14827 /* Test various tree predicates. Verify that location wrappers don't
14828 affect the results. */
14830 static void
14832 {
14833 /* Build various constants and wrappers around them. */
14861 /* TODO: vector constants. */
14863 /* Test integer_onep. */
14883 /* Test integer_zerop. */
14903 /* Test integer_all_onesp. */
14923 /* Test integer_minus_onep. */
14943 /* Test integer_each_onep. */
14963 /* Test integer_truep. */
14983 /* Test integer_nonzerop. */
15003 /* Test real_zerop. */
15023 /* Test real_onep. */
15043 /* Test real_minus_onep. */
15063 /* Test zerop. */
15083 /* Test tree_expr_nonnegative_p. */
15103 /* Test tree_expr_nonzero_p. */
15111 /* Test integer_valued_real_p. */
15118 /* Test integer_pow2p. */
15123 /* Test uniform_integer_cst_p. */
15142 }
15144 /* Check that string escaping works correctly. */
15146 static void
15148 {
15150 escaped_string msg;
15153 /* ASSERT_STREQ does not accept NULL as a valid test
15154 result, so we have to use ASSERT_EQ instead. */
15163 /* Ensure that we have -fmessage-length set to 0. */
15173 /* Now repeat the tests with -fmessage-length set to 5. */
15176 /* Note that the newline is not translated into an escape. */
15183 /* Restore the original message length setting. */
15185 }
15187 /* Run all of the selftests within this file. */
15189 void
15191 {
15199 }