| blob | 756c14ff0cc3fdaba30d9e5c70f54c6dd6e27786 |
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. */
77 /* Tree code classes. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
80 #define END_OF_BASE_TREE_CODES tcc_exceptional,
84 };
86 #undef DEFTREECODE
87 #undef END_OF_BASE_TREE_CODES
89 /* Table indexed by tree code giving number of expression
90 operands beyond the fixed part of the node structure.
91 Not used for types or decls. */
93 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
94 #define END_OF_BASE_TREE_CODES 0,
98 };
100 #undef DEFTREECODE
101 #undef END_OF_BASE_TREE_CODES
103 /* Names of tree components.
104 Used for printing out the tree and error messages. */
105 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
110 };
112 #undef DEFTREECODE
113 #undef END_OF_BASE_TREE_CODES
115 /* Each tree code class has an associated string representation.
116 These must correspond to the tree_code_class entries. */
119 {
130 "expression"
131 };
133 /* obstack.[ch] explicitly declined to prototype this. */
136 /* Statistics-gathering stuff. */
142 /* Keep in sync with tree.h:enum tree_node_kind. */
160 };
162 /* Unique id for next decl created. */
164 /* Unique id for next type created. */
166 /* Unique id for next debug decl created. Use negative numbers,
167 to catch erroneous uses. */
170 /* Since we cannot rehash a type after it is in the table, we have to
171 keep the hash code. */
175 tree type;
176 };
178 /* Initial size of the hash table (rounded to next prime). */
179 #define TYPE_HASH_INITIAL_SIZE 1000
182 {
186 static int
188 {
190 }
191 };
193 /* Now here is the hash table. When recording a type, it is added to
194 the slot whose index is the hash code. Note that the hash table is
195 used for several kinds of types (function types, array types and
196 array index range types, for now). While all these live in the
197 same table, they are completely independent, and the hash code is
198 computed differently for each of these. */
202 /* Hash table and temporary node for larger integer const values. */
206 {
209 };
213 /* Class and variable for making sure that there is a single POLY_INT_CST
214 for a given value. */
216 {
220 };
224 /* Hash table for optimization flags and target option flags. Use the same
225 hash table for both sets of options. Nodes for building the current
226 optimization and target option nodes. The assumption is most of the time
227 the options created will already be in the hash table, so we avoid
228 allocating and freeing up a node repeatably. */
233 {
236 };
240 /* General tree->tree mapping structure for use in hash tables. */
265 /* Number of operands for each OMP clause. */
267 {
355 };
358 {
446 };
448 /* Unless specific to OpenACC, we tend to internally maintain OpenMP-centric
449 clause names, but for use in diagnostics etc. would like to use the "user"
450 clause names. */
454 {
455 /* For OpenACC, the 'OMP_CLAUSE_MAP_KIND' of an 'OMP_CLAUSE_MAP' is used to
456 distinguish clauses as seen by the user. See also where front ends do
457 'build_omp_clause' with 'OMP_CLAUSE_MAP'. */
460 {
478 }
481 }
484 /* Return the tree node structure used by tree code CODE. */
488 {
490 {
493 {
505 }
519 }
522 {
523 /* tcc_constant cases. */
533 /* tcc_exceptional cases. */
550 }
551 }
554 /* Initialize tree_contains_struct to describe the hierarchy of tree
555 nodes. */
557 static void
559 {
563 {
570 /* Mark the TS structure itself. */
573 /* Mark all the structures that TS is derived from. */
575 {
655 }
656 }
658 /* Basic consistency checks for attributes used in fold. */
699 }
702 /* Init tree.cc. */
704 void
706 {
707 /* Initialize the hash table of types. */
708 type_hash_table
711 debug_expr_for_decl
714 value_expr_for_decl
728 /* Initialize the tree_contains_struct array. */
731 }
733 \f
734 /* The name of the object as the assembler will see it (but before any
735 translations made by ASM_OUTPUT_LABELREF). Often this is the same
736 as DECL_NAME. It is an IDENTIFIER_NODE. */
737 tree
739 {
743 }
745 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
746 (either of which may be NULL). Inform the FE, if this changes the
747 name. */
749 void
751 {
754 }
756 /* Return true if DECL may need an assembler name to be set. */
760 {
761 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
762 Rule merging. This makes type_odr_p to return true on those types during
763 LTO and by comparing the mangled name, we can say what types are intended
764 to be equivalent across compilation unit.
766 We do not store names of type_in_anonymous_namespace_p.
768 Record, union and enumeration type have linkage that allows use
769 to check type_in_anonymous_namespace_p. We do not mangle compound types
770 that always can be compared structurally.
772 Similarly for builtin types, we compare properties of their main variant.
773 A special case are integer types where mangling do make differences
774 between char/signed char/unsigned char etc. Storing name for these makes
775 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
776 See cp/mangle.cc:write_builtin_type for details. */
779 {
792 }
793 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
797 /* If DECL already has its assembler name set, it does not need a
798 new one. */
803 /* Abstract decls do not need an assembler name. */
807 /* For VAR_DECLs, only static, public and external symbols need an
808 assembler name. */
816 {
817 /* Do not set assembler name on builtins. Allow RTL expansion to
818 decide whether to expand inline or via a regular call. */
823 /* Functions represented in the callgraph need an assembler name. */
827 /* Unused and not public functions don't need an assembler name. */
830 }
833 }
835 /* If T needs an assembler name, have one created for it. */
837 void
839 {
841 {
842 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
843 diagnostics that use input_location to show locus
844 information. The problem here is that, at this point,
845 input_location is generally anchored to the end of the file
846 (since the parser is long gone), so we don't have a good
847 position to pin it to.
849 To alleviate this problem, this uses the location of T's
850 declaration. Examples of this are
851 testsuite/g++.dg/template/cond2.C and
852 testsuite/g++.dg/template/pr35240.C. */
859 }
860 }
862 /* When the target supports COMDAT groups, this indicates which group the
863 DECL is associated with. This can be either an IDENTIFIER_NODE or a
864 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
865 tree
867 {
872 }
874 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
875 tree
877 {
882 }
884 /* When the target supports named section, return its name as IDENTIFIER_NODE
885 or NULL if it is in no section. */
888 {
893 }
895 /* Set section name of NODE to VALUE (that is expected to be
896 identifier node) */
897 void
899 {
903 {
907 }
910 else
913 }
915 /* Set section name of NODE to match the section name of OTHER.
917 set_decl_section_name (decl, other) is equivalent to
918 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
919 efficient. */
920 void
922 {
925 {
929 else
932 }
933 else
934 {
939 }
940 }
942 /* Return TLS model of a variable NODE. */
943 enum tls_model
945 {
950 }
952 /* Set TLS model of variable NODE to MODEL. */
953 void
955 {
959 {
963 }
964 else
967 }
969 /* Compute the number of bytes occupied by a tree with code CODE.
970 This function cannot be used for nodes that have variable sizes,
971 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
972 size_t
974 {
976 {
979 {
996 }
1000 {
1024 }
1037 {
1049 }
1053 {
1074 }
1078 }
1079 }
1081 /* Compute the number of bytes occupied by NODE. This routine only
1082 looks at TREE_CODE, except for those nodes that have variable sizes. */
1083 size_t
1085 {
1088 {
1118 else
1120 }
1121 }
1123 /* Return tree node kind based on tree CODE. */
1125 static tree_node_kind
1127 {
1131 {
1149 {
1166 }
1172 }
1173 }
1175 /* Record interesting allocation statistics for a tree node with CODE
1176 and LENGTH. */
1178 static void
1180 {
1189 }
1191 /* Allocate and return a new UID from the DECL_UID namespace. */
1193 int
1195 {
1197 }
1199 /* Return a newly allocated node of code CODE. For decl and type
1200 nodes, some other fields are initialized. The rest of the node is
1201 initialized to zero. This function cannot be used for TREE_VEC,
1202 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1203 tree_code_size.
1205 Achoo! I got a code in the node. */
1207 tree
1209 {
1210 tree t;
1220 {
1228 {
1230 {
1233 }
1234 else
1236 }
1240 else
1241 {
1244 }
1257 /* Default to no attributes for type, but let target change that. */
1261 /* We have not yet computed the alias set for this type. */
1271 {
1279 /* All of these have side-effects, no matter what their
1280 operands are. */
1286 }
1291 {
1304 }
1308 /* Other classes need no special treatment. */
1310 }
1313 }
1315 /* Free tree node. */
1317 void
1319 {
1322 {
1332 }
1344 }
1345 \f
1346 /* Return a new node with the same contents as NODE except that its
1347 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1349 tree
1351 {
1352 tree t;
1369 {
1372 else
1373 {
1377 }
1380 {
1383 }
1384 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1386 {
1389 }
1391 {
1394 }
1396 {
1399 }
1400 }
1402 {
1404 /* The following is so that the debug code for
1405 the copy is different from the original type.
1406 The two statements usually duplicate each other
1407 (because they clear fields of the same union),
1408 but the optimizer should catch that. */
1412 /* Do not copy the values cache. */
1414 {
1417 }
1418 }
1420 {
1424 }
1426 {
1430 }
1433 }
1435 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1436 For example, this can copy a list made of TREE_LIST nodes. */
1438 tree
1440 {
1441 tree head;
1450 {
1454 }
1456 }
1458 \f
1459 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1460 INTEGER_CST with value CST and type TYPE. */
1462 static unsigned int
1464 {
1466 /* We need extra HWIs if CST is an unsigned integer with its
1467 upper bit set. */
1471 }
1473 /* Return a new INTEGER_CST with value CST and type TYPE. */
1475 static tree
1477 {
1483 {
1489 }
1492 {
1493 len--;
1497 }
1503 }
1505 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1507 static tree
1509 CXX_MEM_STAT_INFO)
1510 {
1522 }
1524 /* Create a constant tree that contains CST sign-extended to TYPE. */
1526 tree
1528 {
1529 /* Support legacy code. */
1534 }
1536 /* Create a constant tree that contains CST zero-extended to TYPE. */
1538 tree
1540 {
1542 }
1544 /* Create a constant tree that contains CST sign-extended to TYPE. */
1546 tree
1548 {
1551 }
1553 /* Constructs tree in type TYPE from with value given by CST. Signedness
1554 of CST is assumed to be the same as the signedness of TYPE. */
1556 tree
1558 {
1560 }
1562 /* We force the wide_int CST to the range of the type TYPE by sign or
1563 zero extending it. OVERFLOWABLE indicates if we are interested in
1564 overflow of the value, when >0 we are only interested in signed
1565 overflow, for <0 we are interested in any overflow. OVERFLOWED
1566 indicates whether overflow has already occurred. CONST_OVERFLOWED
1567 indicates whether constant overflow has already occurred. We force
1568 T's value to be within range of T's type (by setting to 0 or 1 all
1569 the bits outside the type's range). We set TREE_OVERFLOWED if,
1570 OVERFLOWED is nonzero,
1571 or OVERFLOWABLE is >0 and signed overflow occurs
1572 or OVERFLOWABLE is <0 and any overflow occurs
1573 We return a new tree node for the extended wide_int. The node
1574 is shared if no overflow flags are set. */
1577 tree
1580 {
1583 /* If we need to set overflow flags, return a new unshared node. */
1585 {
1589 {
1591 sign);
1592 tree t;
1595 else
1596 {
1599 {
1602 }
1604 }
1607 }
1608 }
1610 /* Else build a shared node. */
1612 }
1614 /* These are the hash table functions for the hash table of INTEGER_CST
1615 nodes of a sizetype. */
1617 /* Return the hash code X, an INTEGER_CST. */
1619 hashval_t
1621 {
1630 }
1632 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1633 is the same as that given by *Y, which is the same. */
1635 bool
1637 {
1651 }
1653 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1654 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1655 number of slots that can be cached for the type. */
1660 {
1662 /* Initialize cache. */
1664 {
1667 }
1670 {
1671 /* Create a new shared int. */
1674 }
1676 }
1678 /* Create an INT_CST node of TYPE and value CST.
1679 The returned node is always shared. For small integers we use a
1680 per-type vector cache, for larger ones we use a single hash table.
1681 The value is extended from its precision according to the sign of
1682 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1683 the upper bits and ensures that hashing and value equality based
1684 upon the underlying HOST_WIDE_INTs works without masking. */
1686 static tree
1688 {
1689 tree t;
1697 /* Verify that everything is canonical. */
1700 {
1705 }
1712 {
1713 /* Cache NULL pointer and zero bounds. */
1716 /* Cache upper bounds of pointers. */
1719 /* Cache 1 which is used for a non-zero range. */
1724 {
1726 /* Make sure no one is clobbering the shared constant. */
1730 }
1731 }
1733 {
1734 /* We just need to store a single HOST_WIDE_INT. */
1735 HOST_WIDE_INT hwi;
1738 else
1742 {
1745 /* Fallthru. */
1749 /* Ignore pointers, as they were already handled above. */
1753 /* Cache false or true. */
1762 {
1763 /* Cache [0, N). */
1767 }
1768 else
1769 {
1770 /* Cache [-1, N). */
1774 }
1782 }
1785 {
1787 /* Make sure no one is clobbering the shared constant. */
1794 }
1795 else
1796 {
1797 /* Use the cache of larger shared ints, using int_cst_node as
1798 a temporary. */
1806 {
1807 /* Insert this one into the hash table. */
1810 /* Make a new node for next time round. */
1812 }
1813 }
1814 }
1815 else
1816 {
1817 /* The value either hashes properly or we drop it on the floor
1818 for the gc to take care of. There will not be enough of them
1819 to worry about. */
1825 {
1826 /* Insert this one into the hash table. */
1829 }
1830 else
1832 }
1835 }
1837 hashval_t
1839 {
1847 }
1849 bool
1851 {
1858 }
1860 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1861 The elements must also have type TYPE. */
1863 tree
1865 {
1876 INSERT);
1878 {
1883 }
1885 }
1887 /* Create a constant tree with value VALUE in type TYPE. */
1889 tree
1891 {
1895 }
1897 /* Insert INTEGER_CST T into a cache of integer constants. And return
1898 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1899 is false, and T falls into the type's 'smaller values' range, there
1900 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1901 or the value is large, should an existing entry exist, it is
1902 returned (rather than inserting T). */
1904 tree
1906 {
1914 /* The caching indices here must match those in
1915 wide_int_to_type_1. */
1917 {
1920 /* Fallthru. */
1924 {
1932 }
1936 /* Cache false or true. */
1945 {
1946 /* Cache 0..N */
1949 /* This is a little hokie, but if the prec is smaller than
1950 what is necessary to hold param_integer_share_limit, then the
1951 obvious test will not get the correct answer. */
1953 {
1957 }
1960 }
1961 else
1962 {
1963 /* Cache -1..N */
1969 {
1971 {
1974 }
1977 }
1978 }
1982 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1983 members. */
1988 }
1991 {
1992 /* Look for it in the type's vector of small shared ints. */
1994 {
1997 }
2000 {
2003 }
2004 else
2006 }
2007 else
2008 {
2009 /* Use the cache of larger shared ints. */
2012 {
2013 /* If there is already an entry for the number verify it's the
2014 same value. */
2016 /* And return the cached value. */
2018 }
2019 else
2020 /* Otherwise insert this one into the hash table. */
2022 }
2025 }
2028 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2029 and the rest are zeros. */
2031 tree
2033 {
2038 }
2040 /* Checks that X is integer constant that can be expressed in (unsigned)
2041 HOST_WIDE_INT without loss of precision. */
2043 bool
2045 {
2048 }
2050 /* Build a newly constructed VECTOR_CST with the given values of
2051 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2053 tree
2056 {
2058 tree t;
2074 }
2076 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2077 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2079 tree
2081 {
2086 tree value;
2088 /* We can't construct a VECTOR_CST for a variable number of elements. */
2092 {
2094 {
2095 /* If NELTS is constant then this must be too. */
2099 }
2100 else
2102 }
2107 }
2109 /* Build a vector of type VECTYPE where all the elements are SCs. */
2110 tree
2112 {
2118 /* Verify that the vector type is suitable for SC. Note that there
2119 is some inconsistency in the type-system with respect to restrict
2120 qualifications of pointers. Vector types always have a main-variant
2121 element type and the qualification is applied to the vector-type.
2122 So TREE_TYPE (vector-type) does not return a properly qualified
2123 vector element-type. */
2128 {
2132 }
2135 else
2136 {
2142 }
2143 }
2145 /* If TYPE is not a vector type, just return SC, otherwise return
2146 build_vector_from_val (TYPE, SC). */
2148 tree
2150 {
2155 }
2157 /* Build a vector series of type TYPE in which element I has the value
2158 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2159 and a VEC_SERIES_EXPR otherwise. */
2161 tree
2163 {
2167 {
2177 }
2179 }
2181 /* Return a vector with the same number of units and number of bits
2182 as VEC_TYPE, but in which the elements are a linear series of unsigned
2183 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2185 tree
2187 {
2192 {
2193 index_elt_type = build_nonstandard_integer_type
2196 }
2202 }
2204 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2205 elements are A and the rest are B. */
2207 tree
2209 {
2212 /* Optimize the constant case. */
2219 }
2221 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2222 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2224 void
2226 {
2228 tree val;
2234 {
2235 /* Mostly ctors will have elts that don't have side-effects, so
2236 the usual case is to scan all the elements. Hence a single
2237 loop for both const and side effects, rather than one loop
2238 each (with early outs). */
2243 }
2247 }
2249 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2250 CONSTRUCTOR C. */
2252 void
2254 {
2256 tree val;
2262 {
2267 }
2268 }
2270 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2271 are in the vec pointed to by VALS. */
2272 tree
2274 {
2283 }
2285 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2286 INDEX and VALUE. */
2287 tree
2289 {
2297 }
2300 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2301 are in a list pointed to by VALS. */
2302 tree
2304 {
2305 tree t;
2309 {
2313 }
2316 }
2318 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2319 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2320 fields in the constructor remain null. */
2322 tree
2324 {
2331 }
2333 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2334 of elements, provided as index/value pairs. */
2336 tree
2338 {
2345 {
2349 }
2352 }
2354 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2356 tree
2358 {
2363 }
2365 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2367 tree
2369 {
2370 tree v;
2380 }
2382 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2384 tree
2386 {
2387 tree v;
2390 /* dconst{0,1,2,m1,half} are used in various places in
2391 the middle-end and optimizers, allow them here
2392 even for decimal floating point types as an exception
2393 by converting them to decimal. */
2397 {
2407 {
2408 /* Make sure to give zero the minimum quantum exponent for
2409 the type (which corresponds to all bits zero). */
2414 }
2415 else
2417 }
2419 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2420 Consider doing it via real_convert now. */
2427 }
2429 /* Like build_real, but first truncate D to the type. */
2431 tree
2433 {
2435 }
2437 /* Return a new REAL_CST node whose type is TYPE
2438 and whose value is the integer value of the INTEGER_CST node I. */
2440 REAL_VALUE_TYPE
2442 {
2443 REAL_VALUE_TYPE d;
2445 /* Clear all bits of the real value type so that we can later do
2446 bitwise comparisons to see if two values are the same. */
2452 }
2454 /* Given a tree representing an integer constant I, return a tree
2455 representing the same value as a floating-point constant of type TYPE. */
2457 tree
2459 {
2460 tree v;
2467 }
2469 /* Return a new REAL_CST node whose type is TYPE
2470 and whose value is the integer value I which has sign SGN. */
2472 tree
2474 {
2475 REAL_VALUE_TYPE d;
2477 /* Clear all bits of the real value type so that we can later do
2478 bitwise comparisons to see if two values are the same. */
2483 }
2485 /* Return a newly constructed STRING_CST node whose value is the LEN
2486 characters at STR when STR is nonnull, or all zeros otherwise.
2487 Note that for a C string literal, LEN should include the trailing NUL.
2488 The TREE_TYPE is not initialized. */
2490 tree
2492 {
2493 /* Do not waste bytes provided by padding of struct tree_string. */
2506 else
2511 }
2513 /* Return a newly constructed COMPLEX_CST node whose value is
2514 specified by the real and imaginary parts REAL and IMAG.
2515 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2516 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2518 tree
2520 {
2531 }
2533 /* Build a complex (inf +- 0i), such as for the result of cproj.
2534 TYPE is the complex tree type of the result. If NEG is true, the
2535 imaginary zero is negative. */
2537 tree
2539 {
2545 }
2547 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2548 element is set to 1. In particular, this is 1 + i for complex types. */
2550 tree
2552 {
2554 {
2557 }
2558 else
2560 }
2562 /* Return a constant of arithmetic type TYPE which is the
2563 multiplicative identity of the set TYPE. */
2565 tree
2567 {
2569 {
2579 /* We can only generate 1 for accum types. */
2584 {
2588 }
2597 }
2598 }
2600 /* Return an integer of type TYPE containing all 1's in as much precision as
2601 it contains, or a complex or vector whose subparts are such integers. */
2603 tree
2605 {
2607 {
2610 }
2611 else
2613 }
2615 /* Return a constant of arithmetic type TYPE which is the
2616 opposite of the multiplicative identity of the set TYPE. */
2618 tree
2620 {
2622 {
2632 /* We can only generate 1 for accum types. */
2639 {
2643 }
2652 }
2653 }
2655 /* Build 0 constant of type TYPE. This is used by constructor folding
2656 and thus the constant should be represented in memory by
2657 zero(es). */
2659 tree
2661 {
2663 {
2676 {
2680 }
2683 {
2687 }
2693 }
2694 }
2697 /* Build a BINFO with LEN language slots. */
2699 tree
2701 {
2702 tree t;
2717 }
2719 /* Create a CASE_LABEL_EXPR tree node and return it. */
2721 tree
2723 {
2735 }
2737 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2738 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2739 The latter determines the length of the HOST_WIDE_INT vector. */
2741 tree
2743 {
2744 tree t;
2756 /* to_offset can only be applied to trees that are offset_int-sized
2757 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2758 must be exactly the precision of offset_int and so LEN is correct. */
2761 else
2767 }
2769 /* Build a newly constructed TREE_VEC node of length LEN. */
2771 tree
2773 {
2774 tree t;
2785 }
2787 /* Grow a TREE_VEC node to new length LEN. */
2789 tree
2791 {
2807 }
2808 \f
2809 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2810 fixed, and scalar, complex or vector. */
2812 bool
2814 {
2818 }
2820 /* Return 1 if EXPR is the integer constant zero or a complex constant
2821 of zero, or a location wrapper for such a constant. */
2823 bool
2825 {
2829 {
2841 }
2842 }
2844 /* Return 1 if EXPR is the integer constant one or the corresponding
2845 complex constant, or a location wrapper for such a constant. */
2847 bool
2849 {
2853 {
2865 }
2866 }
2868 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2869 return 1 if every piece is the integer constant one.
2870 Also return 1 for location wrappers for such a constant. */
2872 bool
2874 {
2880 else
2882 }
2884 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2885 it contains, or a complex or vector whose subparts are such integers,
2886 or a location wrapper for such a constant. */
2888 bool
2890 {
2908 }
2910 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2911 for such a constant. */
2913 bool
2915 {
2921 else
2923 }
2925 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2926 one bit on), or a location wrapper for such a constant. */
2928 bool
2930 {
2942 }
2944 /* Return 1 if EXPR is an integer constant other than zero or a
2945 complex constant other than zero, or a location wrapper for such a
2946 constant. */
2948 bool
2950 {
2958 }
2960 /* Return 1 if EXPR is the integer constant one. For vector,
2961 return 1 if every piece is the integer constant minus one
2962 (representing the value TRUE).
2963 Also return 1 for location wrappers for such a constant. */
2965 bool
2967 {
2973 }
2975 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2976 for such a constant. */
2978 bool
2980 {
2985 }
2987 /* Return the power of two represented by a tree node known to be a
2988 power of two. */
2990 int
2992 {
2997 }
2999 /* Similar, but return the largest integer Y such that 2 ** Y is less
3000 than or equal to EXPR. */
3002 int
3004 {
3009 }
3011 /* Return number of known trailing zero bits in EXPR, or, if the value of
3012 EXPR is known to be zero, the precision of it's type. */
3014 unsigned int
3016 {
3023 {
3044 /* Second operand is sizetype, which could be in theory
3045 wider than pointer's precision. Make sure we never
3046 return more than prec. */
3061 {
3064 }
3069 {
3074 }
3083 {
3086 {
3091 }
3092 }
3094 CASE_CONVERT:
3112 {
3115 }
3119 }
3120 }
3122 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
3123 decimal float constants, so don't return 1 for them.
3124 Also return 1 for location wrappers around such a constant. */
3126 bool
3128 {
3132 {
3140 {
3141 /* Don't simply check for a duplicate because the predicate
3142 accepts both +0.0 and -0.0. */
3148 }
3151 }
3152 }
3154 /* Return 1 if EXPR is the real constant one in real or complex form.
3155 Trailing zeroes matter for decimal float constants, so don't return
3156 1 for them.
3157 Also return 1 for location wrappers around such a constant. */
3159 bool
3161 {
3165 {
3178 }
3179 }
3181 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3182 matter for decimal float constants, so don't return 1 for them.
3183 Also return 1 for location wrappers around such a constant. */
3185 bool
3187 {
3191 {
3204 }
3205 }
3207 /* Nonzero if EXP is a constant or a cast of a constant. */
3209 bool
3211 {
3212 /* This is not quite the same as STRIP_NOPS. It does more. */
3217 }
3219 /* Return true if T holds a polynomial pointer difference, storing it in
3220 *VALUE if so. A true return means that T's precision is no greater
3221 than 64 bits, which is the largest address space we support, so *VALUE
3222 never loses precision. However, the signedness of the result does
3223 not necessarily match the signedness of T: sometimes an unsigned type
3224 like sizetype is used to encode a value that is actually negative. */
3226 bool
3228 {
3232 {
3237 }
3239 {
3246 }
3248 }
3250 poly_int64
3252 {
3257 }
3259 poly_uint64
3261 {
3266 }
3267 \f
3268 /* Return first list element whose TREE_VALUE is ELEM.
3269 Return 0 if ELEM is not in LIST. */
3271 tree
3273 {
3275 {
3279 }
3281 }
3283 /* Return first list element whose TREE_PURPOSE is ELEM.
3284 Return 0 if ELEM is not in LIST. */
3286 tree
3288 {
3290 {
3294 }
3296 }
3298 /* Return true if ELEM is in V. */
3300 bool
3302 {
3304 tree t;
3309 }
3311 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3312 NULL_TREE. */
3314 tree
3316 {
3320 }
3322 /* Return nonzero if ELEM is part of the chain CHAIN. */
3324 bool
3326 {
3328 {
3332 }
3335 }
3337 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3338 We expect a null pointer to mark the end of the chain.
3339 This is the Lisp primitive `length'. */
3341 int
3343 {
3345 #ifdef ENABLE_TREE_CHECKING
3347 #endif
3351 {
3353 #ifdef ENABLE_TREE_CHECKING
3357 #endif
3358 len++;
3359 }
3362 }
3364 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3365 UNION_TYPE TYPE, or NULL_TREE if none. */
3367 tree
3369 {
3374 }
3376 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3377 UNION_TYPE TYPE, or NULL_TREE if none. */
3379 tree
3381 {
3385 {
3390 }
3393 }
3395 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3396 by modifying the last node in chain 1 to point to chain 2.
3397 This is the Lisp primitive `nconc'. */
3399 tree
3401 {
3402 tree t1;
3413 #ifdef ENABLE_TREE_CHECKING
3414 {
3415 tree t2;
3418 }
3419 #endif
3422 }
3424 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3426 tree
3428 {
3429 tree next;
3434 }
3436 /* Reverse the order of elements in the chain T,
3437 and return the new head of the chain (old last element). */
3439 tree
3441 {
3444 {
3445 /* We shouldn't be using this function to reverse BLOCK chains; we
3446 have blocks_nreverse for that. */
3451 }
3453 }
3454 \f
3455 /* Return a newly created TREE_LIST node whose
3456 purpose and value fields are PARM and VALUE. */
3458 tree
3460 {
3465 }
3467 /* Build a chain of TREE_LIST nodes from a vector. */
3469 tree
3471 {
3475 tree t;
3477 {
3480 }
3482 }
3484 /* Return a newly created TREE_LIST node whose
3485 purpose and value fields are PURPOSE and VALUE
3486 and whose TREE_CHAIN is CHAIN. */
3488 tree
3490 {
3491 tree node;
3503 }
3505 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3506 trees. */
3510 {
3514 tree val;
3520 }
3521 \f
3522 /* Return the size nominally occupied by an object of type TYPE
3523 when it resides in memory. The value is measured in units of bytes,
3524 and its data type is that normally used for type sizes
3525 (which is the first type created by make_signed_type or
3526 make_unsigned_type). */
3528 tree
3530 {
3531 tree t;
3540 {
3543 }
3546 }
3548 /* Return the size of TYPE (in bytes) as a wide integer
3549 or return -1 if the size can vary or is larger than an integer. */
3551 HOST_WIDE_INT
3553 {
3554 tree t;
3564 else
3566 }
3568 /* Return the maximum size of TYPE (in bytes) as a wide integer
3569 or return -1 if the size can vary or is larger than an integer. */
3571 HOST_WIDE_INT
3573 {
3575 tree size_tree;
3577 /* If this is an array type, check for a possible MAX_SIZE attached. */
3580 {
3585 }
3587 /* If we still haven't been able to get a size, see if the language
3588 can compute a maximum size. */
3591 {
3596 }
3599 }
3600 \f
3601 /* Return the bit position of FIELD, in bits from the start of the record.
3602 This is a tree of type bitsizetype. */
3604 tree
3606 {
3609 }
3610 \f
3611 /* Return the byte position of FIELD, in bytes from the start of the record.
3612 This is a tree of type sizetype. */
3614 tree
3616 {
3619 }
3621 /* Likewise, but return as an integer. It must be representable in
3622 that way (since it could be a signed value, we don't have the
3623 option of returning -1 like int_size_in_byte can. */
3625 HOST_WIDE_INT
3627 {
3629 }
3630 \f
3631 /* Return, as a tree node, the number of elements for TYPE (which is an
3632 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3634 tree
3636 {
3639 /* If they did it with unspecified bounds, then we should have already
3640 given an error about it before we got here. */
3648 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3650 {
3651 /* zero sized arrays are represented from C FE as complete types with
3652 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3653 them as min 0, max -1. */
3660 }
3663 ? max
3665 }
3666 \f
3667 /* If arg is static -- a reference to an object in static storage -- then
3668 return the object. This is not the same as the C meaning of `static'.
3669 If arg isn't static, return NULL. */
3671 tree
3673 {
3675 {
3677 /* Nested functions are static, even though taking their address will
3678 involve a trampoline as we unnest the nested function and create
3679 the trampoline on the tree level. */
3700 /* If the thing being referenced is not a field, then it is
3701 something language specific. */
3704 /* If we are referencing a bitfield, we can't evaluate an
3705 ADDR_EXPR at compile time and so it isn't a constant. */
3722 else
3730 }
3731 }
3733 \f
3736 /* Return whether OP is a DECL whose address is function-invariant. */
3738 bool
3740 {
3741 /* The conditions below are slightly less strict than the one in
3742 staticp. */
3745 {
3768 }
3771 }
3773 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3775 bool
3777 {
3778 /* The conditions below are slightly less strict than the one in
3779 staticp. */
3782 {
3802 }
3805 }
3808 /* Return true if T is function-invariant (internal function, does
3809 not handle arithmetic; that's handled in skip_simple_arithmetic and
3810 tree_invariant_p). */
3812 static bool
3814 {
3815 tree op;
3822 {
3829 {
3831 {
3846 }
3848 }
3854 }
3857 }
3859 /* Return true if T is function-invariant. */
3861 bool
3863 {
3866 }
3868 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3869 Do this to any expression which may be used in more than one place,
3870 but must be evaluated only once.
3872 Normally, expand_expr would reevaluate the expression each time.
3873 Calling save_expr produces something that is evaluated and recorded
3874 the first time expand_expr is called on it. Subsequent calls to
3875 expand_expr just reuse the recorded value.
3877 The call to expand_expr that generates code that actually computes
3878 the value is the first call *at compile time*. Subsequent calls
3879 *at compile time* generate code to use the saved value.
3880 This produces correct result provided that *at run time* control
3881 always flows through the insns made by the first expand_expr
3882 before reaching the other places where the save_expr was evaluated.
3883 You, the caller of save_expr, must make sure this is so.
3885 Constants, and certain read-only nodes, are returned with no
3886 SAVE_EXPR because that is safe. Expressions containing placeholders
3887 are not touched; see tree.def for an explanation of what these
3888 are used for. */
3890 tree
3892 {
3893 tree inner;
3895 /* If the tree evaluates to a constant, then we don't want to hide that
3896 fact (i.e. this allows further folding, and direct checks for constants).
3897 However, a read-only object that has side effects cannot be bypassed.
3898 Since it is no problem to reevaluate literals, we just return the
3899 literal node. */
3907 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3908 it means that the size or offset of some field of an object depends on
3909 the value within another field.
3911 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3912 and some variable since it would then need to be both evaluated once and
3913 evaluated more than once. Front-ends must assure this case cannot
3914 happen by surrounding any such subexpressions in their own SAVE_EXPR
3915 and forcing evaluation at the proper time. */
3921 /* This expression might be placed ahead of a jump to ensure that the
3922 value was computed on both sides of the jump. So make sure it isn't
3923 eliminated as dead. */
3926 }
3928 /* Look inside EXPR into any simple arithmetic operations. Return the
3929 outermost non-arithmetic or non-invariant node. */
3931 tree
3933 {
3934 /* We don't care about whether this can be used as an lvalue in this
3935 context. */
3939 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3940 a constant, it will be more efficient to not make another SAVE_EXPR since
3941 it will allow better simplification and GCSE will be able to merge the
3942 computations if they actually occur. */
3944 {
3948 {
3953 else
3955 }
3956 else
3958 }
3961 }
3963 /* Look inside EXPR into simple arithmetic operations involving constants.
3964 Return the outermost non-arithmetic or non-constant node. */
3966 tree
3968 {
3973 {
3977 {
3982 else
3984 }
3985 else
3987 }
3990 }
3992 /* Return which tree structure is used by T. */
3994 enum tree_node_structure_enum
3996 {
3999 }
4001 /* Set various status flags when building a CALL_EXPR object T. */
4003 static void
4005 {
4010 /* Calls have side-effects, except those to const or pure functions. */
4013 /* Propagate TREE_READONLY of arguments for const functions. */
4019 {
4025 }
4029 }
4030 \f
4031 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4032 size or offset that depends on a field within a record. */
4034 bool
4036 {
4047 {
4049 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4050 position computations since they will be converted into a
4051 WITH_RECORD_EXPR involving the reference, which will assume
4052 here will be valid. */
4066 {
4068 /* Ignoring the first operand isn't quite right, but works best. */
4077 /* The save_expr function never wraps anything containing
4078 a PLACEHOLDER_EXPR. */
4083 }
4086 {
4094 }
4098 {
4100 {
4101 const_tree arg;
4102 const_call_expr_arg_iterator iter;
4107 }
4110 }
4114 }
4116 }
4118 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4119 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4120 field positions. */
4122 static bool
4124 {
4125 /* If the size contains a placeholder or the parent type (component type in
4126 the case of arrays) type involves a placeholder, this type does. */
4134 /* Now do type-specific checks. Note that the last part of the check above
4135 greatly limits what we have to do below. */
4137 {
4155 /* Here we just check the bounds. */
4160 /* We have already checked the component type above, so just check
4161 the domain type. Flexible array members have a null domain. */
4168 {
4169 tree field;
4180 }
4184 }
4185 }
4187 /* Wrapper around above function used to cache its result. */
4189 bool
4191 {
4194 /* If the contains_placeholder_bits field has been initialized,
4195 then we know the answer. */
4199 /* Indicate that we've seen this type node, and the answer is false.
4200 This is what we want to return if we run into recursion via fields. */
4203 /* Compute the real value. */
4206 /* Store the real value. */
4210 }
4211 \f
4212 /* Push tree EXP onto vector QUEUE if it is not already present. */
4214 static void
4216 {
4218 tree iter;
4226 }
4228 /* Given a tree EXP, find all occurrences of references to fields
4229 in a PLACEHOLDER_EXPR and place them in vector REFS without
4230 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4231 we assume here that EXP contains only arithmetic expressions
4232 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4233 argument list. */
4235 void
4237 {
4239 tree inner;
4242 /* We handle TREE_LIST and COMPONENT_REF separately. */
4244 {
4247 }
4249 {
4253 ;
4257 else
4259 }
4260 else
4262 {
4267 /* Variables allocated to static storage can stay. */
4273 /* This is the pattern built in ada/make_aligning_type. */
4276 {
4279 }
4281 /* Fall through. */
4299 }
4300 }
4302 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4303 return a tree with all occurrences of references to F in a
4304 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4305 CONST_DECLs. Note that we assume here that EXP contains only
4306 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4307 occurring only in their argument list. */
4309 tree
4311 {
4314 tree new_tree;
4316 /* We handle TREE_LIST and COMPONENT_REF separately. */
4318 {
4325 }
4327 {
4328 tree inner;
4330 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4331 and it is the right field, replace it with R. */
4335 ;
4337 /* The field. */
4343 /* If this expression hasn't been completed let, leave it alone. */
4351 new_tree
4353 }
4354 else
4356 {
4363 else
4370 /* Fall through. */
4378 {
4423 new_tree
4429 }
4433 {
4438 /* If we are trying to replace F with a constant or with another
4439 instance of one of the arguments of the call, inline back
4440 functions which do nothing else than computing a value from
4441 the arguments they are passed. This makes it possible to
4442 fold partially or entirely the replacement expression. */
4444 {
4448 else
4451 {
4454 }
4456 {
4460 }
4461 }
4464 {
4468 {
4472 }
4473 }
4476 {
4480 }
4481 else
4483 }
4488 }
4496 }
4498 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4499 for it within OBJ, a tree that is an object or a chain of references. */
4501 tree
4503 {
4506 tree new_tree;
4508 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4509 in the chain of OBJ. */
4511 {
4513 tree elt;
4543 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4544 survives until RTL generation, there will be an error. */
4546 }
4548 /* TREE_LIST is special because we need to look at TREE_VALUE
4549 and TREE_CHAIN, not TREE_OPERANDS. */
4551 {
4558 }
4559 else
4561 {
4574 {
4619 new_tree
4625 }
4629 {
4635 {
4639 {
4643 }
4644 }
4647 {
4651 }
4652 else
4654 }
4659 }
4667 }
4668 \f
4670 /* Subroutine of stabilize_reference; this is called for subtrees of
4671 references. Any expression with side-effects must be put in a SAVE_EXPR
4672 to ensure that it is only evaluated once.
4674 We don't put SAVE_EXPR nodes around everything, because assigning very
4675 simple expressions to temporaries causes us to miss good opportunities
4676 for optimizations. Among other things, the opportunity to fold in the
4677 addition of a constant into an addressing mode often gets lost, e.g.
4678 "y[i+1] += x;". In general, we take the approach that we should not make
4679 an assignment unless we are forced into it - i.e., that any non-side effect
4680 operator should be allowed, and that cse should take care of coalescing
4681 multiple utterances of the same expression should that prove fruitful. */
4683 static tree
4685 {
4686 tree result;
4689 /* We cannot ignore const expressions because it might be a reference
4690 to a const array but whose index contains side-effects. But we can
4691 ignore things that are actual constant or that already have been
4692 handled by this function. */
4698 {
4700 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4701 have side-effects. */
4704 /* FALLTHRU */
4712 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4713 so that it will only be evaluated once. */
4714 /* The reference (r) and comparison (<) classes could be handled as
4715 below, but it is generally faster to only evaluate them once. */
4721 /* Constants need no processing. In fact, we should never reach
4722 here. */
4726 /* Division is slow and tends to be compiled with jumps,
4727 especially the division by powers of 2 that is often
4728 found inside of an array reference. So do it just once. */
4734 /* Recursively stabilize each operand. */
4740 /* Recursively stabilize each operand. */
4746 }
4754 }
4756 /* Stabilize a reference so that we can use it any number of times
4757 without causing its operands to be evaluated more than once.
4758 Returns the stabilized reference. This works by means of save_expr,
4759 so see the caveats in the comments about save_expr.
4761 Also allows conversion expressions whose operands are references.
4762 Any other kind of expression is returned unchanged. */
4764 tree
4766 {
4767 tree result;
4771 {
4775 /* No action is needed in this case. */
4778 CASE_CONVERT:
4817 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4818 it wouldn't be ignored. This matters when dealing with
4819 volatiles. */
4822 /* If arg isn't a kind of lvalue we recognize, make no change.
4823 Caller should recognize the error for an invalid lvalue. */
4829 }
4838 }
4839 \f
4840 /* Low-level constructors for expressions. */
4842 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4843 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4845 void
4847 {
4848 tree node;
4853 /* We started out assuming this address is both invariant and constant, but
4854 does not have side effects. Now go down any handled components and see if
4855 any of them involve offsets that are either non-constant or non-invariant.
4856 Also check for side-effects.
4858 ??? Note that this code makes no attempt to deal with the case where
4859 taking the address of something causes a copy due to misalignment. */
4861 #define UPDATE_FLAGS(NODE) \
4862 do { tree _node = (NODE); \
4863 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4864 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4868 {
4869 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4870 array reference (probably made temporarily by the G++ front end),
4871 so ignore all the operands. */
4875 {
4881 }
4882 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4883 FIELD_DECL, apparently. The G++ front end can put something else
4884 there, at least temporarily. */
4887 {
4890 }
4891 }
4895 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4896 the address, since &(*a)->b is a form of addition. If it's a constant, the
4897 address is constant too. If it's a decl, its address is constant if the
4898 decl is static. Everything else is not constant and, furthermore,
4899 taking the address of a volatile variable is not volatile. */
4904 ;
4907 else
4908 {
4911 }
4916 #undef UPDATE_FLAGS
4917 }
4919 /* Build an expression of code CODE, data type TYPE, and operands as
4920 specified. Expressions and reference nodes can be created this way.
4921 Constants, decls, types and misc nodes cannot be.
4923 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4924 enough for all extant tree codes. */
4926 tree
4928 {
4929 tree t;
4937 }
4939 tree
4941 {
4943 tree t;
4959 {
4962 }
4965 {
4968 }
4970 {
4972 /* All of these have side-effects, no matter what their
4973 operands are. */
4979 /* Whether a dereference is readonly has nothing to do with whether
4980 its operand is readonly. */
4998 }
5001 }
5003 #define PROCESS_ARG(N) \
5004 do { \
5005 TREE_OPERAND (t, N) = arg##N; \
5006 if (arg##N &&!TYPE_P (arg##N)) \
5007 { \
5008 if (TREE_SIDE_EFFECTS (arg##N)) \
5009 side_effects = 1; \
5010 if (!TREE_READONLY (arg##N) \
5011 && !CONSTANT_CLASS_P (arg##N)) \
5012 (void) (read_only = 0); \
5013 if (!TREE_CONSTANT (arg##N)) \
5014 (void) (constant = 0); \
5015 } \
5016 } while (0)
5018 tree
5020 {
5022 tree t;
5028 /* When sizetype precision doesn't match that of pointers
5029 we need to be able to build explicit extensions or truncations
5030 of the offset argument. */
5042 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5043 result based on those same flags for the arguments. But if the
5044 arguments aren't really even `tree' expressions, we shouldn't be trying
5045 to do this. */
5047 /* Expressions without side effects may be constant if their
5048 arguments are as well. */
5055 {
5069 }
5076 {
5078 {
5082 }
5083 }
5084 else
5085 {
5087 /* Don't mark X / 0 as constant. */
5092 }
5095 }
5098 tree
5100 tree arg2 MEM_STAT_DECL)
5101 {
5103 tree t;
5113 /* As a special exception, if COND_EXPR has NULL branches, we
5114 assume that it is a gimple statement and always consider
5115 it to have side effects. */
5121 else
5137 }
5139 tree
5142 {
5144 tree t;
5164 }
5166 tree
5169 {
5171 tree t;
5188 {
5190 {
5194 }
5195 }
5196 else
5202 }
5204 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5205 on the pointer PTR. */
5207 tree
5209 {
5212 tree tem;
5213 /* For convenience allow addresses that collapse to a simple base
5214 and offset. */
5218 {
5222 {
5225 }
5226 else
5229 }
5234 }
5236 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5238 poly_offset_int
5240 {
5242 SIGNED);
5243 }
5245 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5246 offsetted by OFFSET units. */
5248 tree
5250 {
5257 }
5259 /* Similar except don't specify the TREE_TYPE
5260 and leave the TREE_SIDE_EFFECTS as 0.
5261 It is permissible for arguments to be null,
5262 or even garbage if their values do not matter. */
5264 tree
5266 {
5267 tree t;
5284 }
5286 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5287 tree vec. */
5289 tree
5291 {
5301 }
5302 \f
5303 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5304 and data type TYPE.
5305 We do NOT enter this node in any sort of symbol table.
5307 LOC is the location of the decl.
5309 layout_decl is used to set up the decl's storage layout.
5310 Other slots are initialized to 0 or null pointers. */
5312 tree
5314 tree type MEM_STAT_DECL)
5315 {
5316 tree t;
5321 /* if (type == error_mark_node)
5322 type = integer_type_node; */
5323 /* That is not done, deliberately, so that having error_mark_node
5324 as the type can suppress useless errors in the use of this variable. */
5333 }
5335 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5337 tree
5339 {
5345 }
5347 /* Builds and returns function declaration with NAME and TYPE. */
5349 tree
5351 {
5361 }
5365 /* Builds a new translation-unit decl with name NAME, queues it in the
5366 global list of translation-unit decls and returns it. */
5368 tree
5370 {
5376 }
5378 \f
5379 /* BLOCK nodes are used to represent the structure of binding contours
5380 and declarations, once those contours have been exited and their contents
5381 compiled. This information is used for outputting debugging info. */
5383 tree
5385 {
5393 }
5395 \f
5396 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5398 LOC is the location to use in tree T. */
5400 void
5402 {
5406 {
5410 }
5411 }
5413 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5414 UNKNOWN_LOCATION. */
5416 void
5418 {
5422 }
5423 \f
5424 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5425 of the various TYPE_QUAL values. */
5427 static void
5429 {
5435 }
5437 /* Returns true iff CAND and BASE have equivalent language-specific
5438 qualifiers. */
5440 bool
5442 {
5445 /* type_hash_eq currently only applies to these types. */
5450 }
5452 /* This function checks to see if TYPE matches the size one of the built-in
5453 atomic types, and returns that core atomic type. */
5455 static tree
5457 {
5458 tree base_atomic_type;
5460 /* Only handle complete types. */
5465 {
5488 }
5491 }
5493 /* Returns true iff unqualified CAND and BASE are equivalent. */
5495 bool
5497 {
5499 /* Apparently this is needed for Objective-C. */
5504 /* Check alignment. */
5508 /* Atomic types increase minimal alignment. We must to do so as well
5509 or we get duplicated canonical types. See PR88686. */
5511 {
5512 /* See if this object can map to a basic atomic type. */
5516 }
5518 }
5520 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5522 bool
5524 {
5528 }
5530 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5532 static bool
5534 {
5537 /* Apparently this is needed for Objective-C. */
5539 /* Check alignment. */
5541 /* Check this is a user-aligned type as build_aligned_type
5542 would create. */
5547 }
5549 /* Return a version of the TYPE, qualified as indicated by the
5550 TYPE_QUALS, if one exists. If no qualified version exists yet,
5551 return NULL_TREE. */
5553 tree
5555 {
5563 /* Search the chain of variants to see if there is already one there just
5564 like the one we need to have. If so, use that existing one. We must
5565 preserve the TYPE_NAME, since there is code that depends on this. */
5568 {
5569 /* Put the found variant at the head of the variant list so
5570 frequently searched variants get found faster. The C++ FE
5571 benefits greatly from this. */
5577 }
5580 }
5582 /* Like get_qualified_type, but creates the type if it does not
5583 exist. This function never returns NULL_TREE. */
5585 tree
5587 {
5588 tree t;
5590 /* See if we already have the appropriate qualified variant. */
5593 /* If not, build it. */
5595 {
5600 {
5601 /* See if this object can map to a basic atomic type. */
5604 {
5605 /* Ensure the alignment of this type is compatible with
5606 the required alignment of the atomic type. */
5609 }
5610 }
5613 /* Propagate structural equality. */
5616 /* Build the underlying canonical type, since it is different
5617 from TYPE. */
5618 {
5621 }
5622 else
5623 /* T is its own canonical type. */
5626 }
5629 }
5631 /* Create a variant of type T with alignment ALIGN. */
5633 tree
5635 {
5636 tree t;
5651 }
5653 /* Create a new distinct copy of TYPE. The new type is made its own
5654 MAIN_VARIANT. If TYPE requires structural equality checks, the
5655 resulting type requires structural equality checks; otherwise, its
5656 TYPE_CANONICAL points to itself. */
5658 tree
5660 {
5666 /* Set the canonical type either to a new equivalence class, or
5667 propagate the need for structural equality checks. */
5670 else
5673 /* Make it its own variant. */
5677 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5678 whose TREE_TYPE is not t. This can also happen in the Ada
5679 frontend when using subtypes. */
5682 }
5684 /* Create a new variant of TYPE, equivalent but distinct. This is so
5685 the caller can modify it. TYPE_CANONICAL for the return type will
5686 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5687 are considered equal by the language itself (or that both types
5688 require structural equality checks). */
5690 tree
5692 {
5697 /* Since we're building a variant, assume that it is a non-semantic
5698 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5700 /* Type variants have no alias set defined. */
5703 /* Add the new type to the chain of variants of TYPE. */
5709 }
5710 \f
5711 /* Return true if the from tree in both tree maps are equal. */
5713 int
5715 {
5719 }
5721 /* Hash a from tree in a tree_base_map. */
5723 unsigned int
5725 {
5727 }
5729 /* Return true if this tree map structure is marked for garbage collection
5730 purposes. We simply return true if the from tree is marked, so that this
5731 structure goes away when the from tree goes away. */
5733 int
5735 {
5737 }
5739 /* Hash a from tree in a tree_map. */
5741 unsigned int
5743 {
5745 }
5747 /* Hash a from tree in a tree_decl_map. */
5749 unsigned int
5751 {
5753 }
5755 /* Return the initialization priority for DECL. */
5757 priority_type
5759 {
5764 return
5766 }
5768 /* Return the finalization priority for DECL. */
5770 priority_type
5772 {
5777 return
5779 }
5781 /* Set the initialization priority for DECL to PRIORITY. */
5783 void
5785 {
5789 {
5793 }
5796 else
5799 }
5801 /* Set the finalization priority for DECL to PRIORITY. */
5803 void
5805 {
5809 {
5813 }
5814 else
5817 }
5819 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5821 static void
5823 {
5828 }
5830 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5832 static void
5834 {
5839 }
5841 /* Lookup a debug expression for FROM, and return it if we find one. */
5843 tree
5845 {
5853 }
5855 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5857 void
5859 {
5866 }
5868 /* Lookup a value expression for FROM, and return it if we find one. */
5870 tree
5872 {
5880 }
5882 /* Insert a mapping FROM->TO in the value expression hashtable. */
5884 void
5886 {
5893 }
5895 /* Lookup a vector of debug arguments for FROM, and return it if we
5896 find one. */
5900 {
5911 }
5913 /* Insert a mapping FROM->empty vector of debug arguments in the value
5914 expression hashtable. */
5918 {
5933 }
5935 /* Hashing of types so that we don't make duplicates.
5936 The entry point is `type_hash_canon'. */
5938 /* Generate the default hash code for TYPE. This is designed for
5939 speed, rather than maximum entropy. */
5941 hashval_t
5943 {
5952 /* Just the identifier is adequate to distinguish. */
5956 {
5959 /* FALLTHROUGH. */
5971 {
5975 {
5978 }
5979 }
5983 {
5990 }
5994 {
5998 }
6006 }
6009 }
6011 /* These are the Hashtable callback functions. */
6013 /* Returns true iff the types are equivalent. */
6015 bool
6017 {
6018 /* First test the things that are the same for all types. */
6028 /* Be careful about comparing arrays before and after the element type
6029 has been completed; don't compare TYPE_ALIGN unless both types are
6030 complete. */
6037 {
6060 /* fall through */
6092 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6093 where the flag should be inherited from the element type
6094 and can change after ARRAY_TYPEs are created; on non-aggregates
6095 compare it and hash it, scalars will never have that flag set
6096 and we need to differentiate between arrays created by different
6097 front-ends or middle-end created arrays. */
6127 }
6133 }
6135 /* Given TYPE, and HASHCODE its hash code, return the canonical
6136 object for an identical type if one already exists.
6137 Otherwise, return TYPE, and record it as the canonical object.
6139 To use this function, first create a type of the sort you want.
6140 Then compute its hash code from the fields of the type that
6141 make it different from other similar types.
6142 Then call this function and use the value. */
6144 tree
6146 {
6147 type_hash in;
6150 /* The hash table only contains main variants, so ensure that's what we're
6151 being passed. */
6154 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6155 must call that routine before comparing TYPE_ALIGNs. */
6163 {
6169 /* Free also min/max values and the cache for integer
6170 types. This can't be done in free_node, as LTO frees
6171 those on its own. */
6173 {
6176 {
6177 /* Zero is always in TYPE_CACHED_VALUES. */
6181 }
6184 {
6187 }
6190 }
6193 }
6194 else
6195 {
6204 }
6205 }
6207 static void
6209 {
6214 }
6216 /* Given two lists of types
6217 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6218 return 1 if the lists contain the same types in the same order.
6219 Also, the TREE_PURPOSEs must match. */
6221 bool
6223 {
6235 }
6237 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6238 given by TYPE. If the argument list accepts variable arguments,
6239 then this function counts only the ordinary arguments. */
6241 int
6243 {
6247 /* If the function does not take a variable number of arguments,
6248 the last element in the list will have type `void'. */
6251 else
6255 }
6257 /* Return the type of the function TYPE's argument ARGNO if known.
6258 For vararg function's where ARGNO refers to one of the variadic
6259 arguments return null. Otherwise, return a void_type_node for
6260 out-of-bounds ARGNO. */
6262 tree
6264 {
6265 /* Treat zero the same as an out-of-bounds argument number. */
6269 function_args_iterator iter;
6271 tree argtype;
6274 {
6275 /* A vararg function's argument list ends in a null. Otherwise,
6276 an ordinary function's argument list ends with void. Return
6277 null if ARGNO refers to a vararg argument, void_type_node if
6278 it's out of bounds, and the formal argument type otherwise. */
6286 }
6289 }
6291 /* Nonzero if integer constants T1 and T2
6292 represent the same constant value. */
6294 int
6296 {
6312 }
6314 /* Return true if T is an INTEGER_CST whose numerical value (extended
6315 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6317 bool
6319 {
6323 }
6325 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6326 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6328 bool
6330 {
6334 {
6339 }
6342 }
6344 /* Return true if T is an INTEGER_CST whose numerical value (extended
6345 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6347 bool
6349 {
6353 }
6355 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6356 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6358 bool
6360 {
6364 {
6369 }
6372 }
6374 /* T is an INTEGER_CST whose numerical value (extended according to
6375 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6376 HOST_WIDE_INT. */
6378 HOST_WIDE_INT
6380 {
6383 }
6385 /* T is an INTEGER_CST whose numerical value (extended according to
6386 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6387 HOST_WIDE_INT. */
6389 unsigned HOST_WIDE_INT
6391 {
6394 }
6396 /* Return the most significant (sign) bit of T. */
6398 int
6400 {
6404 }
6406 /* Return an indication of the sign of the integer constant T.
6407 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6408 Note that -1 will never be returned if T's type is unsigned. */
6410 int
6412 {
6419 else
6421 }
6423 /* Return the minimum number of bits needed to represent VALUE in a
6424 signed or unsigned type, UNSIGNEDP says which. */
6426 unsigned int
6428 {
6429 /* If the value is negative, compute its negative minus 1. The latter
6430 adjustment is because the absolute value of the largest negative value
6431 is one larger than the largest positive value. This is equivalent to
6432 a bit-wise negation, so use that operation instead. */
6437 /* Return the number of bits needed, taking into account the fact
6438 that we need one more bit for a signed than unsigned type.
6439 If value is 0 or -1, the minimum precision is 1 no matter
6440 whether unsignedp is true or false. */
6444 else
6446 }
6448 /* Return truthvalue of whether T1 is the same tree structure as T2.
6449 Return 1 if they are the same.
6450 Return 0 if they are understandably different.
6451 Return -1 if either contains tree structure not understood by
6452 this function. */
6454 int
6456 {
6466 /* For location wrappers to be the same, they must be at the same
6467 source location (and wrap the same thing). */
6469 {
6473 }
6479 {
6483 else
6485 }
6495 {
6511 {
6520 /* ??? Should we handle also fields here? */
6524 }
6535 {
6543 {
6547 }
6549 }
6552 /* Special case: if either target is an unallocated VAR_DECL,
6553 it means that it's going to be unified with whatever the
6554 TARGET_EXPR is really supposed to initialize, so treat it
6555 as being equivalent to anything. */
6563 else
6592 /* A false return means maybe_ne rather than known_ne. */
6598 }
6600 /* This general rule works for most tree codes. All exceptions should be
6601 handled above. If this is a language-specific tree code, we can't
6602 trust what might be in the operand, so say we don't know
6603 the situation. */
6608 {
6617 {
6621 }
6627 }
6628 }
6630 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6631 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6632 than U, respectively. */
6634 int
6636 {
6645 else
6647 }
6649 /* Return true if SIZE represents a constant size that is in bounds of
6650 what the middle-end and the backend accepts (covering not more than
6651 half of the address-space).
6652 When PERR is non-null, set *PERR on failure to the description of
6653 why SIZE is not valid. */
6655 bool
6657 {
6659 {
6666 }
6668 cst_size_error error;
6673 {
6676 }
6679 {
6682 }
6685 {
6688 }
6692 {
6695 }
6698 }
6700 /* Return the precision of the type, or for a complex or vector type the
6701 precision of the type of its elements. */
6703 unsigned int
6705 {
6713 }
6715 /* Return true if CODE represents an associative tree code. Otherwise
6716 return false. */
6717 bool
6719 {
6721 {
6733 }
6735 }
6737 /* Return true if CODE represents a commutative tree code. Otherwise
6738 return false. */
6739 bool
6741 {
6743 {
6770 }
6772 }
6774 /* Return true if CODE represents a ternary tree code for which the
6775 first two operands are commutative. Otherwise return false. */
6776 bool
6778 {
6780 {
6788 }
6790 }
6792 /* Returns true if CODE can overflow. */
6794 bool
6796 {
6798 {
6803 /* Can overflow in various ways. */
6809 /* For INT_MIN / -1. */
6813 /* For -INT_MIN. */
6816 /* These operators cannot overflow. */
6818 }
6819 }
6821 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6822 ftrapv doesn't generate trapping insns for CODE. */
6824 bool
6826 {
6829 /* We don't generate instructions that trap on overflow for complex or vector
6830 types. */
6838 {
6844 /* These operators can overflow, and -ftrapv generates trapping code for
6845 these. */
6852 /* These operators can overflow, but -ftrapv does not generate trapping
6853 code for these. */
6856 /* These operators cannot overflow. */
6858 }
6859 }
6861 /* Constructors for pointer, array and function types.
6862 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6863 constructed by language-dependent code, not here.) */
6865 /* Construct, lay out and return the type of pointers to TO_TYPE with
6866 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6867 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6868 indicate this type can reference all of memory. If such a type has
6869 already been constructed, reuse it. */
6871 tree
6874 {
6875 tree t;
6882 {
6885 }
6887 /* If the pointed-to type has the may_alias attribute set, force
6888 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6892 /* In some cases, languages will have things that aren't a POINTER_TYPE
6893 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6894 In that case, return that type without regard to the rest of our
6895 operands.
6897 ??? This is a kludge, but consistent with the way this function has
6898 always operated and there doesn't seem to be a good way to avoid this
6899 at the moment. */
6904 /* First, if we already have a type for pointers to TO_TYPE and it's
6905 the proper mode, use it. */
6918 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6926 /* Lay out the type. This function has many callers that are concerned
6927 with expression-construction, and this simplifies them all. */
6931 }
6933 /* By default build pointers in ptr_mode. */
6935 tree
6937 {
6939 }
6941 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6943 tree
6946 {
6947 tree t;
6954 {
6957 }
6959 /* If the pointed-to type has the may_alias attribute set, force
6960 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6964 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6965 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6966 In that case, return that type without regard to the rest of our
6967 operands.
6969 ??? This is a kludge, but consistent with the way this function has
6970 always operated and there doesn't seem to be a good way to avoid this
6971 at the moment. */
6976 /* First, if we already have a type for pointers to TO_TYPE and it's
6977 the proper mode, use it. */
6990 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7001 }
7004 /* Build the node for the type of references-to-TO_TYPE by default
7005 in ptr_mode. */
7007 tree
7009 {
7011 }
7013 #define MAX_INT_CACHED_PREC \
7014 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7017 static void
7019 {
7021 {
7023 }
7024 }
7026 /* Builds a signed or unsigned integer type of precision PRECISION.
7027 Used for C bitfields whose precision does not match that of
7028 built-in target types. */
7029 tree
7032 {
7039 {
7043 }
7050 else
7060 }
7062 #define MAX_BOOL_CACHED_PREC \
7063 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7066 /* Builds a boolean type of precision PRECISION.
7067 Used for boolean vectors to choose proper vector element size. */
7068 tree
7070 {
7071 tree type;
7074 {
7078 }
7088 }
7090 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7091 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7092 is true, reuse such a type that has already been constructed. */
7094 static tree
7096 {
7119 {
7120 /* Since we cannot reliably merge this type, we need to compare it using
7121 structural equality checks. */
7124 }
7130 }
7132 /* Wrapper around build_range_type_1 with SHARED set to true. */
7134 tree
7136 {
7138 }
7140 /* Wrapper around build_range_type_1 with SHARED set to false. */
7142 tree
7144 {
7146 }
7148 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7149 MAXVAL should be the maximum value in the domain
7150 (one less than the length of the array).
7152 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7153 We don't enforce this limit, that is up to caller (e.g. language front end).
7154 The limit exists because the result is a signed type and we don't handle
7155 sizes that use more than one HOST_WIDE_INT. */
7157 tree
7159 {
7161 }
7163 /* Return true if the debug information for TYPE, a subtype, should be emitted
7164 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7165 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7166 debug info and doesn't reflect the source code. */
7168 bool
7170 {
7173 /* Subrange types have a base type which is an integral type. */
7177 /* Get the real bounds of the subtype. */
7180 else
7181 {
7184 }
7186 /* If the type and its base type have the same representation and the same
7187 name, then the type is not a subrange but a copy of the base type. */
7201 }
7203 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7204 and number of elements specified by the range of values of INDEX_TYPE.
7205 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7206 If SHARED is true, reuse such a type that has already been constructed.
7207 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7209 tree
7212 {
7213 tree t;
7216 {
7219 }
7229 {
7232 }
7235 {
7244 index_type
7247 }
7250 }
7252 /* Wrapper around build_array_type_1 with SHARED set to true. */
7254 tree
7256 {
7257 return
7259 }
7261 /* Wrapper around build_array_type_1 with SHARED set to false. */
7263 tree
7265 {
7267 }
7269 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7270 sizetype. */
7272 tree
7274 {
7276 }
7278 /* Recursively examines the array elements of TYPE, until a non-array
7279 element type is found. */
7281 tree
7283 {
7288 }
7290 /* Computes the canonical argument types from the argument type list
7291 ARGTYPES.
7293 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7294 on entry to this function, or if any of the ARGTYPES are
7295 structural.
7297 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7298 true on entry to this function, or if any of the ARGTYPES are
7299 non-canonical.
7301 Returns a canonical argument list, which may be ARGTYPES when the
7302 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7303 true) or would not differ from ARGTYPES. */
7305 static tree
7309 {
7310 tree arg;
7314 {
7316 /* Fail gracefully by stating that the type is structural. */
7322 /* If the argument has a default argument, we consider it
7323 non-canonical even though the type itself is canonical.
7324 That way, different variants of function and method types
7325 with default arguments will all point to the variant with
7326 no defaults as their canonical type. */
7328 }
7334 {
7335 /* Build the canonical list of argument types. */
7340 {
7343 else
7346 canon_argtypes);
7347 }
7353 /* There is a non-canonical type. */
7356 }
7358 /* The canonical argument types are the same as ARGTYPES. */
7360 }
7362 /* Construct, lay out and return
7363 the type of functions returning type VALUE_TYPE
7364 given arguments of types ARG_TYPES.
7365 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7366 are data type nodes for the arguments of the function.
7367 If such a type has already been constructed, reuse it. */
7369 tree
7371 {
7372 tree t;
7375 tree canon_argtypes;
7380 {
7383 }
7385 /* Make a node of the sort we want. */
7390 /* If we already have such a type, use the old one. */
7394 /* Set up the canonical type. */
7404 canon_argtypes);
7409 }
7411 /* Build a function type. The RETURN_TYPE is the type returned by the
7412 function. If VAARGS is set, no void_type_node is appended to the
7413 list. ARGP must be always be terminated be a NULL_TREE. */
7415 static tree
7417 {
7425 {
7430 }
7433 else
7434 {
7438 }
7442 }
7444 /* Build a function type. The RETURN_TYPE is the type returned by the
7445 function. If additional arguments are provided, they are
7446 additional argument types. The list of argument types must always
7447 be terminated by NULL_TREE. */
7449 tree
7451 {
7452 tree args;
7459 }
7461 /* Build a variable argument function type. The RETURN_TYPE is the
7462 type returned by the function. If additional arguments are provided,
7463 they are additional argument types. The list of argument types must
7464 always be terminated by NULL_TREE. */
7466 tree
7468 {
7469 tree args;
7477 }
7479 /* Build a function type. RETURN_TYPE is the type returned by the
7480 function; VAARGS indicates whether the function takes varargs. The
7481 function takes N named arguments, the types of which are provided in
7482 ARG_TYPES. */
7484 static tree
7487 {
7495 }
7497 /* Build a function type. RETURN_TYPE is the type returned by the
7498 function. The function takes N named arguments, the types of which
7499 are provided in ARG_TYPES. */
7501 tree
7503 {
7505 }
7507 /* Build a variable argument function type. RETURN_TYPE is the type
7508 returned by the function. The function takes N named arguments, the
7509 types of which are provided in ARG_TYPES. */
7511 tree
7513 {
7515 }
7517 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7518 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7519 for the method. An implicit additional parameter (of type
7520 pointer-to-BASETYPE) is added to the ARGTYPES. */
7522 tree
7524 tree rettype,
7525 tree argtypes)
7526 {
7527 tree t;
7528 tree ptype;
7530 tree canon_argtypes;
7532 /* Make a node of the sort we want. */
7539 /* The actual arglist for this function includes a "hidden" argument
7540 which is "this". Put it into the list of argument types. */
7544 /* If we already have such a type, use the old one. */
7548 /* Set up the canonical type. */
7549 any_structural_p
7552 any_noncanonical_p
7564 canon_argtypes);
7569 }
7571 /* Construct, lay out and return the type of methods belonging to class
7572 BASETYPE and whose arguments and values are described by TYPE.
7573 If that type exists already, reuse it.
7574 TYPE must be a FUNCTION_TYPE node. */
7576 tree
7578 {
7584 }
7586 /* Construct, lay out and return the type of offsets to a value
7587 of type TYPE, within an object of type BASETYPE.
7588 If a suitable offset type exists already, reuse it. */
7590 tree
7592 {
7593 tree t;
7595 /* Make a node of the sort we want. */
7601 /* If we already have such a type, use the old one. */
7609 {
7618 }
7621 }
7623 /* Create a complex type whose components are COMPONENT_TYPE.
7625 If NAMED is true, the type is given a TYPE_NAME. We do not always
7626 do so because this creates a DECL node and thus make the DECL_UIDs
7627 dependent on the type canonicalization hashtable, which is GC-ed,
7628 so the DECL_UIDs would not be stable wrt garbage collection. */
7630 tree
7632 {
7637 /* Make a node of the sort we want. */
7642 /* If we already have such a type, use the old one. */
7647 {
7648 /* We created a new type. The hash insertion will have laid
7649 out the type. We need to check the canonicalization and
7650 maybe set the name. */
7661 /* We need to create a name, since complex is a fundamental type. */
7663 {
7692 }
7693 }
7696 }
7698 /* If TYPE is a real or complex floating-point type and the target
7699 does not directly support arithmetic on TYPE then return the wider
7700 type to be used for arithmetic on TYPE. Otherwise, return
7701 NULL_TREE. */
7703 tree
7705 {
7706 /* The target can give two different responses to the question of
7707 which excess precision mode it would like depending on whether we
7708 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7710 enum excess_precision_type requested_type
7712 ? EXCESS_PRECISION_TYPE_FAST
7716 enum flt_eval_method target_flt_eval_method
7719 /* The target should not ask for unpredictable float evaluation (though
7720 it might advertise that implicitly the evaluation is unpredictable,
7721 but we don't care about that here, it will have been reported
7722 elsewhere). If it does ask for unpredictable evaluation, we have
7723 nothing to do here. */
7726 /* Nothing to do. The target has asked for all types we know about
7727 to be computed with their native precision and range. */
7731 /* The target will promote this type in a target-dependent way, so excess
7732 precision ought to leave it alone. */
7736 machine_mode float16_type_mode = (float16_type_node
7743 {
7745 {
7748 {
7766 }
7768 }
7770 {
7775 {
7793 }
7795 }
7798 }
7801 }
7802 \f
7803 /* Return OP, stripped of any conversions to wider types as much as is safe.
7804 Converting the value back to OP's type makes a value equivalent to OP.
7806 If FOR_TYPE is nonzero, we return a value which, if converted to
7807 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7809 OP must have integer, real or enumeral type. Pointers are not allowed!
7811 There are some cases where the obvious value we could return
7812 would regenerate to OP if converted to OP's type,
7813 but would not extend like OP to wider types.
7814 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7815 For example, if OP is (unsigned short)(signed char)-1,
7816 we avoid returning (signed char)-1 if FOR_TYPE is int,
7817 even though extending that to an unsigned short would regenerate OP,
7818 since the result of extending (signed char)-1 to (int)
7819 is different from (int) OP. */
7821 tree
7823 {
7824 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7826 unsigned final_prec
7828 int uns
7835 {
7838 /* TYPE_PRECISION on vector types has different meaning
7839 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7840 so avoid them here. */
7847 /* Truncations are many-one so cannot be removed.
7848 Unless we are later going to truncate down even farther. */
7853 /* See what's inside this conversion. If we decide to strip it,
7854 we will set WIN. */
7857 /* If we have not stripped any zero-extensions (uns is 0),
7858 we can strip any kind of extension.
7859 If we have previously stripped a zero-extension,
7860 only zero-extensions can safely be stripped.
7861 Any extension can be stripped if the bits it would produce
7862 are all going to be discarded later by truncating to FOR_TYPE. */
7865 {
7868 /* TYPE_UNSIGNED says whether this is a zero-extension.
7869 Let's avoid computing it if it does not affect WIN
7870 and if UNS will not be needed again. */
7874 {
7877 }
7878 }
7879 }
7881 /* If we finally reach a constant see if it fits in sth smaller and
7882 in that case convert it. */
7884 {
7890 {
7894 }
7895 }
7898 }
7899 \f
7900 /* Return OP or a simpler expression for a narrower value
7901 which can be sign-extended or zero-extended to give back OP.
7902 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7903 or 0 if the value should be sign-extended. */
7905 tree
7907 {
7914 {
7915 do
7929 ret);
7931 }
7933 {
7934 int bitschange
7938 /* Truncations are many-one so cannot be removed. */
7942 /* See what's inside this conversion. If we decide to strip it,
7943 we will set WIN. */
7946 {
7948 /* An extension: the outermost one can be stripped,
7949 but remember whether it is zero or sign extension. */
7952 /* Otherwise, if a sign extension has been stripped,
7953 only sign extensions can now be stripped;
7954 if a zero extension has been stripped, only zero-extensions. */
7958 }
7960 {
7961 /* A change in nominal type can always be stripped, but we must
7962 preserve the unsignedness. */
7967 /* Keep trying to narrow, but don't assign op to win if it
7968 would turn an integral type into something else. */
7971 }
7974 }
7977 /* Since type_for_size always gives an integer type. */
7980 /* Ensure field is laid out already. */
7983 {
7984 unsigned HOST_WIDE_INT innerprec
7990 /* We can get this structure field in a narrower type that fits it,
7991 but the resulting extension to its nominal type (a fullword type)
7992 must satisfy the same conditions as for other extensions.
7994 Do this only for fields that are aligned (not bit-fields),
7995 because when bit-field insns will be used there is no
7996 advantage in doing this. */
8002 {
8006 }
8007 }
8011 }
8012 \f
8013 /* Return true if integer constant C has a value that is permissible
8014 for TYPE, an integral type. */
8016 bool
8018 {
8023 /* Non-standard boolean types can have arbitrary precision but various
8024 transformations assume that they can only take values 0 and +/-1. */
8028 retry:
8032 /* If at least one bound of the type is a constant integer, we can check
8033 ourselves and maybe make a decision. If no such decision is possible, but
8034 this type is a subtype, try checking against that. Otherwise, use
8035 fits_to_tree_p, which checks against the precision.
8037 Compute the status for each possibly constant bound, and return if we see
8038 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8039 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8040 for "constant known to fit". */
8042 /* Check if c >= type_low_bound. */
8044 {
8048 }
8049 else
8052 /* Check if c <= type_high_bound. */
8054 {
8058 }
8059 else
8062 /* If the constant fits both bounds, the result is known. */
8066 /* Perform some generic filtering which may allow making a decision
8067 even if the bounds are not constant. First, negative integers
8068 never fit in unsigned types, */
8072 /* Second, narrower types always fit in wider ones. */
8076 /* Third, unsigned integers with top bit set never fit signed types. */
8078 {
8081 {
8082 /* When a tree_cst is converted to a wide-int, the precision
8083 is taken from the type. However, if the precision of the
8084 mode underneath the type is smaller than that, it is
8085 possible that the value will not fit. The test below
8086 fails if any bit is set between the sign bit of the
8087 underlying mode and the top bit of the type. */
8090 }
8093 }
8095 /* If we haven't been able to decide at this point, there nothing more we
8096 can check ourselves here. Look at the base type if we have one and it
8097 has the same precision. */
8101 {
8104 }
8106 /* Or to fits_to_tree_p, if nothing else. */
8108 }
8110 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8111 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8112 represented (assuming two's-complement arithmetic) within the bit
8113 precision of the type are returned instead. */
8115 void
8117 {
8121 else
8122 {
8125 else
8126 {
8129 }
8130 }
8135 else
8136 {
8139 }
8140 }
8142 /* Return true if VAR is an automatic variable. */
8144 bool
8146 {
8151 }
8153 /* Return true if VAR is an automatic variable defined in function FN. */
8155 bool
8157 {
8161 }
8163 /* Subprogram of following function. Called by walk_tree.
8165 Return *TP if it is an automatic variable or parameter of the
8166 function passed in as DATA. */
8168 static tree
8170 {
8181 }
8183 /* Returns true if T is, contains, or refers to a type with variable
8184 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8185 arguments, but not the return type. If FN is nonzero, only return
8186 true if a modifier of the type or position of FN is a variable or
8187 parameter inside FN.
8189 This concept is more general than that of C99 'variably modified types':
8190 in C99, a struct type is never variably modified because a VLA may not
8191 appear as a structure member. However, in GNU C code like:
8193 struct S { int i[f()]; };
8195 is valid, and other languages may define similar constructs. */
8197 bool
8199 {
8200 tree t;
8202 /* Test if T is either variable (if FN is zero) or an expression containing
8203 a variable in FN. If TYPE isn't gimplified, return true also if
8204 gimplify_one_sizepos would gimplify the expression into a local
8205 variable. */
8206 #define RETURN_TRUE_IF_VAR(T) \
8207 do { tree _t = (T); \
8208 if (_t != NULL_TREE \
8209 && _t != error_mark_node \
8210 && !CONSTANT_CLASS_P (_t) \
8211 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8212 && (!fn \
8213 || (!TYPE_SIZES_GIMPLIFIED (type) \
8214 && (TREE_CODE (_t) != VAR_DECL \
8215 && !CONTAINS_PLACEHOLDER_P (_t))) \
8216 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8217 return true; } while (0)
8222 /* If TYPE itself has variable size, it is variably modified. */
8227 {
8231 /* Ada can have pointer types refering to themselves indirectly. */
8236 {
8239 }
8245 /* If TYPE is a function type, it is variably modified if the
8246 return type is variably modified. */
8256 /* Scalar types are variably modified if their end points
8257 aren't constant. */
8265 /* We can't see if any of the fields are variably-modified by the
8266 definition we normally use, since that would produce infinite
8267 recursion via pointers. */
8268 /* This is variably modified if some field's type is. */
8271 {
8276 /* If the type is a qualified union, then the DECL_QUALIFIER
8277 of fields can also be an expression containing a variable. */
8281 /* If the field is a qualified union, then it's only a container
8282 for what's inside so we look into it. That's necessary in LTO
8283 mode because the sizes of the field tested above have been set
8284 to PLACEHOLDER_EXPRs by free_lang_data. */
8288 }
8292 /* Do not call ourselves to avoid infinite recursion. This is
8293 variably modified if the element type is. */
8300 }
8302 /* The current language may have other cases to check, but in general,
8303 all other types are not variably modified. */
8306 #undef RETURN_TRUE_IF_VAR
8307 }
8309 /* Given a DECL or TYPE, return the scope in which it was declared, or
8310 NULL_TREE if there is no containing scope. */
8312 tree
8314 {
8316 }
8318 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8320 const_tree
8322 {
8324 {
8327 else
8329 }
8331 }
8333 /* Return the innermost context enclosing DECL that is
8334 a FUNCTION_DECL, or zero if none. */
8336 tree
8338 {
8339 tree context;
8344 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8345 where we look up the function at runtime. Such functions always take
8346 a first argument of type 'pointer to real context'.
8348 C++ should really be fixed to use DECL_CONTEXT for the real context,
8349 and use something else for the "virtual context". */
8351 context
8352 = TYPE_MAIN_VARIANT
8354 else
8358 {
8361 else
8363 }
8366 }
8368 /* Return the innermost context enclosing DECL that is
8369 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8370 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8372 tree
8374 {
8379 {
8400 }
8403 }
8405 /* CALL is a CALL_EXPR. Return the declaration for the function
8406 called, or NULL_TREE if the called function cannot be
8407 determined. */
8409 tree
8411 {
8412 tree addr;
8417 /* It's invalid to call this function with anything but a
8418 CALL_EXPR. */
8421 /* The first operand to the CALL is the address of the function
8422 called. */
8425 /* If there is no function, return early. */
8431 /* If this is a readonly function pointer, extract its initial value. */
8437 /* If the address is just `&f' for some function `f', then we know
8438 that `f' is being called. */
8443 /* We couldn't figure out what was being called. */
8445 }
8447 /* Return true when STMTs arguments and return value match those of FNDECL,
8448 a decl of a builtin function. */
8450 static bool
8452 {
8470 {
8471 /* Variadic args follow. */
8479 {
8480 /* For pointer arguments be more forgiving, e.g. due to
8481 FILE * vs. fileptr_type_node, or say char * vs. const char *
8482 differences etc. */
8488 /* char/short integral arguments are promoted to int
8489 by several frontends if targetm.calls.promote_prototypes
8490 is true. Allow such promotion too. */
8496 && (gimple_form
8503 }
8504 }
8508 }
8510 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8511 return the associated function code, otherwise return CFN_LAST. */
8513 combined_fn
8515 {
8516 /* It's invalid to call this function with anything but a CALL_EXPR. */
8529 }
8531 /* Comparator of indices based on tree_node_counts. */
8533 static int
8535 {
8540 }
8542 /* Comparator of indices based on tree_code_counts. */
8544 static int
8546 {
8551 }
8553 #define TREE_MEM_USAGE_SPACES 40
8555 /* Print debugging information about tree nodes generated during the compile,
8556 and any language-specific information. */
8558 void
8560 {
8562 {
8568 {
8575 {
8582 }
8587 }
8589 {
8599 {
8604 }
8611 }
8612 }
8613 else
8620 }
8621 \f
8624 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8626 unsigned
8628 {
8629 /* This relies on the raw feedback's top 4 bits being zero. */
8630 #define FEEDBACK(X) ((X) * 0x04c11db7)
8631 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8632 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8634 {
8639 };
8640 #undef FEEDBACK
8641 #undef SYNDROME
8645 {
8649 }
8652 }
8654 /* Generate a crc32 of a string. */
8656 unsigned
8658 {
8659 do
8663 }
8665 /* P is a string that will be used in a symbol. Mask out any characters
8666 that are not valid in that context. */
8668 void
8670 {
8675 #endif
8678 #endif
8679 ))
8681 }
8685 /* Create a unique anonymous identifier. The identifier is still a
8686 valid assembly label. */
8688 tree
8690 {
8692 #if !defined (NO_DOT_IN_LABEL)
8693 "."
8694 #elif !defined (NO_DOLLAR_IN_LABEL)
8695 "$"
8696 #else
8697 "_"
8698 #endif
8709 }
8711 /* Generate a name for a special-purpose function.
8712 The generated name may need to be unique across the whole link.
8713 Changes to this function may also require corresponding changes to
8714 xstrdup_mask_random.
8715 TYPE is some string to identify the purpose of this function to the
8716 linker or collect2; it must start with an uppercase letter,
8717 one of:
8718 I - for constructors
8719 D - for destructors
8720 N - for C++ anonymous namespaces
8721 F - for DWARF unwind frame information. */
8723 tree
8725 {
8730 /* If we already have a name we know to be unique, just use that. */
8733 /* If the target is handling the constructors/destructors, they
8734 will be local to this file and the name is only necessary for
8735 debugging purposes.
8736 We also assign sub_I and sub_D sufixes to constructors called from
8737 the global static constructors. These are always local. */
8741 {
8745 /* Just use the file's basename, because the full pathname
8746 might be quite long. */
8748 }
8749 else
8750 {
8751 /* Otherwise, the name must be unique across the entire link.
8752 We don't have anything that we know to be unique to this translation
8753 unit, so use what we do have and throw in some randomness. */
8771 }
8777 /* Set up the name of the file-level functions we may need.
8778 Use a global object (which is already required to be unique over
8779 the program) rather than the file name (which imposes extra
8780 constraints). */
8784 }
8785 \f
8786 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8788 /* Complain that the tree code of NODE does not match the expected 0
8789 terminated list of trailing codes. The trailing code list can be
8790 empty, for a more vague error message. FILE, LINE, and FUNCTION
8791 are of the caller. */
8793 void
8796 {
8807 {
8814 {
8821 }
8823 }
8824 else
8830 }
8832 /* Complain that the tree code of NODE does match the expected 0
8833 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8834 the caller. */
8836 void
8839 {
8853 {
8855 {
8858 }
8861 }
8867 }
8869 /* Similar to tree_check_failed, except that we check for a class of tree
8870 code, given in CL. */
8872 void
8875 {
8876 internal_error
8881 }
8883 /* Similar to tree_check_failed, except that instead of specifying a
8884 dozen codes, use the knowledge that they're all sequential. */
8886 void
8890 {
8903 {
8910 }
8915 }
8918 /* Similar to tree_check_failed, except that we check that a tree does
8919 not have the specified code, given in CL. */
8921 void
8924 {
8925 internal_error
8930 }
8933 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8935 void
8938 {
8944 }
8947 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8949 void
8953 {
8966 {
8973 }
8978 }
8981 #undef DEFTREESTRUCT
8982 #define DEFTREESTRUCT(VAL, NAME) NAME,
8986 };
8987 #undef DEFTREESTRUCT
8989 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8991 /* Similar to tree_class_check_failed, except that we check for
8992 whether CODE contains the tree structure identified by EN. */
8994 void
8999 {
9000 internal_error
9004 }
9007 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9008 (dynamically sized) vector. */
9010 void
9013 {
9014 internal_error
9018 }
9020 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9021 (dynamically sized) vector. */
9023 void
9026 {
9027 internal_error
9030 }
9032 /* Similar to above, except that the check is for the bounds of the operand
9033 vector of an expression node EXP. */
9035 void
9038 {
9040 internal_error
9044 }
9046 /* Similar to above, except that the check is for the number of
9047 operands of an OMP_CLAUSE node. */
9049 void
9052 {
9053 internal_error
9058 }
9060 \f
9061 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9062 and mapped to the machine mode MODE. Initialize its fields and build
9063 the information necessary for debugging output. */
9065 static tree
9067 {
9068 tree t;
9089 /* We have built a main variant, based on the main variant of the
9090 inner type. Use it to build the variant we return. */
9098 }
9100 static tree
9102 {
9125 else
9127 }
9129 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9131 static tree
9133 {
9135 {
9147 }
9148 else
9149 {
9161 }
9164 }
9166 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9168 static tree
9170 {
9172 {
9184 }
9185 else
9186 {
9198 }
9201 }
9204 /* Create an atomic variant node for TYPE. This routine is called
9205 during initialization of data types to create the 5 basic atomic
9206 types. The generic build_variant_type function requires these to
9207 already be set up in order to function properly, so cannot be
9208 called from there. If ALIGN is non-zero, then ensure alignment is
9209 overridden to this value. */
9211 static tree
9213 {
9214 tree t;
9216 /* Make sure its not already registered. */
9227 }
9229 /* Information about the _FloatN and _FloatNx types. This must be in
9230 the same order as the corresponding TI_* enum values. */
9232 {
9240 };
9243 /* Create nodes for all integer types (and error_mark_node) using the sizes
9244 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9246 void
9248 {
9256 /* Define both `signed char' and `unsigned char'. */
9262 /* Define `char', which is like either `signed char' or `unsigned char'
9263 but not the same as either. */
9264 char_type_node
9265 = (signed_char
9280 {
9285 {
9288 }
9289 }
9291 /* Define a boolean type. This type only represents boolean values but
9292 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9298 /* Define what type to use for size_t. */
9307 else
9308 {
9314 {
9321 {
9323 }
9324 }
9327 }
9329 /* Define what type to use for ptrdiff_t. */
9338 else
9339 {
9343 {
9351 }
9354 }
9356 /* Fill in the rest of the sized types. Reuse existing type nodes
9357 when possible. */
9370 /* Don't call build_qualified type for atomics. That routine does
9371 special processing for atomics, and until they are initialized
9372 it's better not to make that call.
9374 Check to see if there is a target override for atomic types. */
9391 /* Define these next since types below may used them. */
9409 /* We are not going to have real types in C with less than byte alignment,
9410 so we might as well not have any types that claim to have it. */
9423 const_ptr_type_node
9443 {
9446 scalar_float_mode mode;
9450 /* Work around the rs6000 KFmode having precision 113 not
9451 128. */
9463 }
9471 /* Fixed size integer types. */
9478 /* Decimal float types. */
9480 {
9495 }
9504 {
9508 }
9510 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9511 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9512 sat_ ## KIND ## _type_node = \
9513 make_sat_signed_ ## KIND ## _type (SIZE); \
9514 sat_unsigned_ ## KIND ## _type_node = \
9515 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9516 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9517 unsigned_ ## KIND ## _type_node = \
9518 make_unsigned_ ## KIND ## _type (SIZE);
9520 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9521 sat_ ## WIDTH ## KIND ## _type_node = \
9522 make_sat_signed_ ## KIND ## _type (SIZE); \
9523 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9524 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9525 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9526 unsigned_ ## WIDTH ## KIND ## _type_node = \
9527 make_unsigned_ ## KIND ## _type (SIZE);
9529 /* Make fixed-point type nodes based on four different widths. */
9530 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9531 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9532 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9533 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9534 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9536 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9537 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9538 NAME ## _type_node = \
9539 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9540 u ## NAME ## _type_node = \
9541 make_or_reuse_unsigned_ ## KIND ## _type \
9542 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9543 sat_ ## NAME ## _type_node = \
9544 make_or_reuse_sat_signed_ ## KIND ## _type \
9545 (GET_MODE_BITSIZE (MODE ## mode)); \
9546 sat_u ## NAME ## _type_node = \
9547 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9548 (GET_MODE_BITSIZE (U ## MODE ## mode));
9550 /* Fixed-point type and mode nodes. */
9563 {
9566 /* Many back-ends define record types without setting TYPE_NAME.
9567 If we copied the record type here, we'd keep the original
9568 record type without a name. This breaks name mangling. So,
9569 don't copy record types and let c_common_nodes_and_builtins()
9570 declare the type to be __builtin_va_list. */
9575 }
9577 /* SCEV analyzer global shared trees. */
9582 }
9584 /* Modify DECL for given flags.
9585 TM_PURE attribute is set only on types, so the function will modify
9586 DECL's type when ECF_TM_PURE is used. */
9588 void
9590 {
9620 /* Looping const or pure is implied by noreturn.
9621 There is currently no way to declare looping const or looping pure alone. */
9624 }
9627 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9629 static void
9632 {
9633 tree decl;
9640 }
9642 /* Call this function after instantiating all builtins that the language
9643 front end cares about. This will build the rest of the builtins
9644 and internal functions that are relied upon by the tree optimizers and
9645 the middle-end. */
9647 void
9649 {
9654 {
9656 ptr_type_node,
9657 ptr_type_node,
9658 integer_type_node,
9659 NULL_TREE);
9661 BUILT_IN_CLEAR_PADDING,
9664 }
9669 {
9673 BUILT_IN_UNREACHABLE,
9685 }
9689 {
9700 }
9703 {
9706 NULL_TREE);
9709 }
9712 {
9718 }
9720 /* If we're checking the stack, `alloca' can throw. */
9721 const int alloca_flags
9725 {
9730 }
9735 BUILT_IN_ALLOCA_WITH_ALIGN,
9737 alloca_flags);
9742 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9744 alloca_flags);
9750 BUILT_IN_INIT_TRAMPOLINE,
9753 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9757 BUILT_IN_INIT_DESCRIPTOR,
9762 BUILT_IN_ADJUST_TRAMPOLINE,
9766 BUILT_IN_ADJUST_DESCRIPTOR,
9774 BUILT_IN_CLEAR_CACHE,
9776 ECF_NOTHROW);
9779 BUILT_IN_NONLOCAL_GOTO,
9786 BUILT_IN_SETJMP_SETUP,
9791 BUILT_IN_SETJMP_RECEIVER,
9800 BUILT_IN_STACK_RESTORE,
9805 NULL_TREE);
9818 /* If there's a possibility that we might use the ARM EABI, build the
9819 alternate __cxa_end_cleanup node used to resume from C++. */
9821 {
9824 BUILT_IN_CXA_END_CLEANUP,
9826 }
9830 BUILT_IN_UNWIND_RESUME,
9834 ECF_NORETURN);
9837 {
9839 NULL_TREE);
9841 BUILT_IN_RETURN_ADDRESS,
9843 ECF_NOTHROW);
9844 }
9848 {
9853 BUILT_IN_PROFILE_FUNC_ENTER,
9857 BUILT_IN_PROFILE_FUNC_EXIT,
9859 }
9861 /* The exception object and filter values from the runtime. The argument
9862 must be zero before exception lowering, i.e. from the front end. After
9863 exception lowering, it will be the region number for the exception
9864 landing pad. These functions are PURE instead of CONST to prevent
9865 them from being hoisted past the exception edge that will initialize
9866 its value in the landing pad. */
9870 /* Only use TM_PURE if we have TM language support. */
9883 NULL_TREE);
9885 BUILT_IN_EH_COPY_VALUES,
9888 /* Complex multiplication and division. These are handled as builtins
9889 rather than optabs because emit_library_call_value doesn't support
9890 complex. Further, we can do slightly better with folding these
9891 beasties if the real and complex parts of the arguments are separate. */
9892 {
9896 {
9923 /* For -ftrapping-math these should throw from a former
9924 -fnon-call-exception stmt. */
9926 NULL);
9932 NULL);
9936 }
9937 }
9940 }
9942 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9943 better way.
9945 If we requested a pointer to a vector, build up the pointers that
9946 we stripped off while looking for the inner type. Similarly for
9947 return values from functions.
9949 The argument TYPE is the top of the chain, and BOTTOM is the
9950 new type which we will point to. */
9952 tree
9954 {
9958 {
9962 }
9964 {
9968 }
9970 {
9973 }
9975 {
9978 }
9980 {
9982 /* The build_method_type_directly() routine prepends 'this' to argument list,
9983 so we must compensate by getting rid of it. */
9984 outer
9985 = build_method_type_directly
9987 inner,
9989 }
9991 {
9994 }
9995 else
10000 }
10002 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10003 the inner type. */
10004 tree
10006 {
10007 poly_int64 nunits;
10011 {
10023 /* Check that there are no leftover bits. */
10031 }
10034 }
10036 /* Similarly, but takes the inner type and number of units, which must be
10037 a power of two. */
10039 tree
10041 {
10043 }
10045 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10047 tree
10049 {
10054 {
10057 }
10058 else
10064 }
10066 /* Build a vector type that holds one boolean result for each element of
10067 vector type VECTYPE. The public interface for this operation is
10068 truth_type_for. */
10070 static tree
10072 {
10076 machine_mode mask_mode;
10086 }
10088 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10089 set. */
10091 tree
10093 {
10095 tree cand;
10096 /* We always build the non-opaque variant before the opaque one,
10097 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10103 /* Othewise build a variant type and make sure to queue it after
10104 the non-opaque type. */
10112 }
10114 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10116 static poly_wide_int
10118 {
10119 /* First handle elements that are directly encoded. */
10124 /* Identify the pattern that contains element I and work out the index of
10125 the last encoded element for that pattern. */
10131 /* If there are no steps, the final encoded value is the right one. */
10135 /* Otherwise work out the value from the last two encoded elements. */
10140 }
10142 /* Return the value of element I of VECTOR_CST T. */
10144 tree
10146 {
10147 /* First handle elements that are directly encoded. */
10152 /* If there are no steps, the final encoded value is the right one. */
10154 {
10155 /* Identify the pattern that contains element I and work out the index of
10156 the last encoded element for that pattern. */
10161 }
10163 /* Otherwise work out the value from the last two encoded elements. */
10166 }
10168 /* Given an initializer INIT, return TRUE if INIT is zero or some
10169 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10170 null, set *NONZERO if and only if INIT is known not to be all
10171 zeros. The combination of return value of false and *NONZERO
10172 false implies that INIT may but need not be all zeros. Other
10173 combinations indicate definitive answers. */
10175 bool
10177 {
10182 /* Conservatively clear NONZERO and set it only if INIT is definitely
10183 not all zero. */
10191 {
10200 /* ??? Note that this is not correct for C4X float formats. There,
10201 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10202 negative exponent. */
10237 {
10242 tree elt;
10249 }
10252 {
10267 }
10268 /* Fall through. */
10271 {
10279 /* We need to loop through all elements to handle cases like
10280 "\0" and "\0foobar". */
10283 {
10286 }
10289 }
10293 }
10294 }
10296 /* Return true if EXPR is an initializer expression in which every element
10297 is a constant that is numerically equal to 0 or 1. The elements do not
10298 need to be equal to each other. */
10300 bool
10302 {
10306 {
10314 {
10321 {
10325 }
10328 }
10332 }
10333 }
10335 /* Check if vector VEC consists of all the equal elements and
10336 that the number of elements corresponds to the type of VEC.
10337 The function returns first element of the vector
10338 or NULL_TREE if the vector is not uniform. */
10339 tree
10341 {
10354 {
10358 }
10362 {
10366 {
10368 {
10371 }
10374 }
10381 }
10384 }
10386 /* If the argument is INTEGER_CST, return it. If the argument is vector
10387 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10388 return NULL_TREE.
10389 Look through location wrappers. */
10391 tree
10393 {
10400 {
10404 }
10407 }
10409 /* Checks to see if T is a constant or a constant vector and if each element E
10410 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10412 tree
10414 {
10424 tree cst;
10428 tree_vector_builder builder;
10431 else
10432 {
10438 }
10442 do
10443 {
10458 }
10462 }
10464 /* If VECTOR_CST T has a single nonzero element, return the index of that
10465 element, otherwise return -1. */
10467 int
10469 {
10475 {
10478 }
10479 else
10484 {
10487 {
10491 }
10492 }
10494 }
10496 /* Build an empty statement at location LOC. */
10498 tree
10500 {
10504 }
10507 /* Build an OMP clause with code CODE. LOC is the location of the
10508 clause. */
10510 tree
10512 {
10513 tree t;
10528 }
10530 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10531 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10532 Except for the CODE and operand count field, other storage for the
10533 object is initialized to zeros. */
10535 tree
10537 {
10538 tree t;
10550 /* Can't use TREE_OPERAND to store the length because if checking is
10551 enabled, it will try to check the length before we store it. :-P */
10555 }
10557 /* Helper function for build_call_* functions; build a CALL_EXPR with
10558 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10559 the argument slots. */
10561 static tree
10563 {
10564 tree t;
10572 }
10574 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10575 FN and a null static chain slot. NARGS is the number of call arguments
10576 which are specified as "..." arguments. */
10578 tree
10580 {
10581 tree ret;
10587 }
10589 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10590 FN and a null static chain slot. NARGS is the number of call arguments
10591 which are specified as a va_list ARGS. */
10593 tree
10595 {
10596 tree t;
10604 }
10606 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10607 FN and a null static chain slot. NARGS is the number of call arguments
10608 which are specified as a tree array ARGS. */
10610 tree
10613 {
10614 tree t;
10623 }
10625 /* Like build_call_array, but takes a vec. */
10627 tree
10629 {
10638 }
10640 /* Conveniently construct a function call expression. FNDECL names the
10641 function to be called and N arguments are passed in the array
10642 ARGARRAY. */
10644 tree
10646 {
10651 }
10653 /* Conveniently construct a function call expression. FNDECL names the
10654 function to be called and the arguments are passed in the vector
10655 VEC. */
10657 tree
10659 {
10662 }
10665 /* Conveniently construct a function call expression. FNDECL names the
10666 function to be called, N is the number of arguments, and the "..."
10667 parameters are the argument expressions. */
10669 tree
10671 {
10681 }
10683 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10684 varargs macros aren't supported by all bootstrap compilers. */
10686 tree
10688 {
10698 }
10700 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10701 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10702 It will get gimplified later into an ordinary internal function. */
10704 tree
10707 {
10715 }
10717 /* Build internal call expression. This is just like CALL_EXPR, except
10718 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10719 internal function. */
10721 tree
10724 {
10734 }
10736 /* Return a function call to FN, if the target is guaranteed to support it,
10737 or null otherwise.
10739 N is the number of arguments, passed in the "...", and TYPE is the
10740 type of the return value. */
10742 tree
10745 {
10755 {
10758 {
10761 OPTIMIZE_FOR_BOTH))
10763 }
10765 }
10766 else
10767 {
10772 }
10773 }
10775 /* Return a function call to the appropriate builtin alloca variant.
10777 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10778 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10779 bound for SIZE in case it is not a fixed value. */
10781 tree
10783 {
10785 {
10787 return
10789 }
10791 {
10794 }
10795 else
10796 {
10799 }
10800 }
10802 /* The built-in decl to use to mark code points believed to be unreachable.
10803 Typically __builtin_unreachable, but __builtin_trap if
10804 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10805 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10806 appropriate ubsan function. When building a call directly, use
10807 {gimple_},build_builtin_unreachable instead. */
10809 tree
10811 {
10818 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10819 in the sanopt pass. */
10822 }
10824 /* Build a call to __builtin_unreachable, possibly rewritten by
10825 -fsanitize=unreachable. Use this rather than the above when practical. */
10827 tree
10829 {
10833 }
10835 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10836 if SIZE == -1) and return a tree node representing char* pointer to
10837 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10838 the STRING_CST value is the LEN bytes at STR (the representation
10839 of the string, which may be wide). Otherwise it's all zeros. */
10841 tree
10845 {
10847 /* Set the maximum valid index based on the string length or SIZE. */
10848 unsigned HOST_WIDE_INT maxidx
10864 }
10868 /* Return true if T (assumed to be a DECL) must be assigned a memory
10869 location. */
10871 bool
10873 {
10879 }
10881 /* Return value of a constant X and sign-extend it. */
10883 HOST_WIDE_INT
10885 {
10889 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10893 {
10897 else
10899 }
10902 }
10904 /* If TYPE is an integral or pointer type, return an integer type with
10905 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10906 if TYPE is already an integer type of signedness UNSIGNEDP.
10907 If TYPE is a floating-point type, return an integer type with the same
10908 bitsize and with the signedness given by UNSIGNEDP; this is useful
10909 when doing bit-level operations on a floating-point value. */
10911 tree
10913 {
10918 {
10926 }
10929 {
10937 }
10946 else
10950 }
10952 /* If TYPE is an integral or pointer type, return an integer type with
10953 the same precision which is unsigned, or itself if TYPE is already an
10954 unsigned integer type. If TYPE is a floating-point type, return an
10955 unsigned integer type with the same bitsize as TYPE. */
10957 tree
10959 {
10961 }
10963 /* If TYPE is an integral or pointer type, return an integer type with
10964 the same precision which is signed, or itself if TYPE is already a
10965 signed integer type. If TYPE is a floating-point type, return a
10966 signed integer type with the same bitsize as TYPE. */
10968 tree
10970 {
10972 }
10974 /* - For VECTOR_TYPEs:
10975 - The truth type must be a VECTOR_BOOLEAN_TYPE.
10976 - The number of elements must match (known_eq).
10977 - targetm.vectorize.get_mask_mode exists, and exactly
10978 the same mode as the truth type.
10979 - Otherwise, the truth type must be a BOOLEAN_TYPE
10980 or useless_type_conversion_p to BOOLEAN_TYPE. */
10981 bool
10983 {
10986 machine_mode tmask_mode;
10989 {
10998 }
11001 }
11003 /* If TYPE is a vector type, return a signed integer vector type with the
11004 same width and number of subparts. Otherwise return boolean_type_node. */
11006 tree
11008 {
11010 {
11014 }
11015 else
11017 }
11019 /* Returns the largest value obtainable by casting something in INNER type to
11020 OUTER type. */
11022 tree
11024 {
11030 /* Compute a unique number for every combination. */
11035 /* Determine the exponent to use. */
11037 {
11040 /* oprec <= iprec, outer: signed, inner: don't care. */
11045 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11049 /* oprec > iprec, outer: signed, inner: signed. */
11053 /* oprec > iprec, outer: signed, inner: unsigned. */
11057 /* oprec > iprec, outer: unsigned, inner: signed. */
11061 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11066 }
11070 }
11072 /* Returns the smallest value obtainable by casting something in INNER type to
11073 OUTER type. */
11075 tree
11077 {
11081 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11082 and obtain 0. */
11084 /* If we are widening something of an unsigned type, OUTER type
11085 contains all values of INNER type. In particular, both INNER
11086 and OUTER types have zero in common. */
11089 else
11090 {
11091 /* If we are widening a signed type to another signed type, we
11092 want to obtain -2^^(iprec-1). If we are keeping the
11093 precision or narrowing to a signed type, we want to obtain
11094 -2^(oprec-1). */
11099 }
11100 }
11102 /* Return nonzero if two operands that are suitable for PHI nodes are
11103 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11104 SSA_NAME or invariant. Note that this is strictly an optimization.
11105 That is, callers of this function can directly call operand_equal_p
11106 and get the same result, only slower. */
11108 int
11110 {
11116 }
11118 /* Returns number of zeros at the end of binary representation of X. */
11120 tree
11122 {
11124 }
11127 #define WALK_SUBTREE(NODE) \
11128 do \
11129 { \
11130 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11131 if (result) \
11132 return result; \
11133 } \
11134 while (0)
11136 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11137 be walked whenever a type is seen in the tree. Rest of operands and return
11138 value are as for walk_tree. */
11140 static tree
11143 {
11147 {
11151 /* We have to worry about mutually recursive pointers. These can't
11152 be written in C. They can in Ada. It's pathological, but
11153 there's an ACATS test (c38102a) that checks it. Deal with this
11154 by checking if we're pointing to another pointer, that one
11155 points to another pointer, that one does too, and we have no htab.
11156 If so, get a hash table. We check three levels deep to avoid
11157 the cost of the hash table if we don't need one. */
11162 {
11169 }
11171 /* fall through */
11180 /* Fall through. */
11184 {
11185 tree arg;
11187 /* We never want to walk into default arguments. */
11190 }
11194 /* Don't follow this nodes's type if a pointer for fear that
11195 we'll have infinite recursion. If we have a PSET, then we
11196 need not fear. */
11211 }
11214 }
11216 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11217 called with the DATA and the address of each sub-tree. If FUNC returns a
11218 non-NULL value, the traversal is stopped, and the value returned by FUNC
11219 is returned. If PSET is non-NULL it is used to record the nodes visited,
11220 and to avoid visiting a node more than once. */
11222 tree
11225 {
11228 tree result;
11230 #define WALK_SUBTREE_TAIL(NODE) \
11231 do \
11232 { \
11233 tp = & (NODE); \
11234 goto tail_recurse; \
11235 } \
11236 while (0)
11238 tail_recurse:
11239 /* Skip empty subtrees. */
11243 /* Don't walk the same tree twice, if the user has requested
11244 that we avoid doing so. */
11248 /* Call the function. */
11252 /* If we found something, return it. */
11258 /* Even if we didn't, FUNC may have decided that there was nothing
11259 interesting below this point in the tree. */
11261 {
11262 /* But we still need to check our siblings. */
11267 else
11269 }
11272 {
11276 }
11279 {
11291 /* None of these have subtrees other than those already walked
11292 above. */
11300 {
11306 /* Walk all elements but the first. */
11310 /* Now walk the first one as a tail call. */
11312 }
11315 {
11319 /* Walk all elements but the first. */
11322 /* Now walk the first one as a tail call. */
11324 }
11331 {
11336 idx++)
11338 }
11345 {
11346 tree decl;
11348 {
11349 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11350 into declarations that are just mentioned, rather than
11351 declared; they don't really belong to this part of the tree.
11352 And, we can see cycles: the initializer for a declaration
11353 can refer to the declaration itself. */
11357 }
11359 }
11362 {
11363 tree_stmt_iterator i;
11366 }
11370 {
11375 }
11378 {
11381 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11382 But, we only want to walk once. */
11387 }
11390 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11391 defining. We only want to walk into these fields of a type in this
11392 case and not in the general case of a mere reference to the type.
11394 The criterion is as follows: if the field can be an expression, it
11395 must be walked only here. This should be in keeping with the fields
11396 that are directly gimplified in gimplify_type_sizes in order for the
11397 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11398 variable-sized types.
11400 Note that DECLs get walked as part of processing the BIND_EXPR. */
11402 {
11403 /* Call the function for the decl so e.g. copy_tree_body_r can
11404 replace it with the remapped one. */
11413 /* Call the function for the type. See if it returns anything or
11414 doesn't want us to continue. If we are to continue, walk both
11415 the normal fields and those for the declaration case. */
11420 /* But do not walk a pointed-to type since it may itself need to
11421 be walked in the declaration case if it isn't anonymous. */
11423 {
11427 }
11429 /* If this is a record type, also walk the fields. */
11431 {
11432 tree field;
11436 {
11437 /* We'd like to look at the type of the field, but we can
11438 easily get infinite recursion. So assume it's pointed
11439 to elsewhere in the tree. Also, ignore things that
11440 aren't fields. */
11449 }
11450 }
11452 /* Same for scalar types. */
11458 {
11461 }
11465 }
11466 /* FALLTHRU */
11470 {
11473 /* Walk over all the sub-trees of this operand. */
11476 /* Go through the subtrees. We need to do this in forward order so
11477 that the scope of a FOR_EXPR is handled properly. */
11479 {
11483 }
11484 }
11485 /* If this is a type, walk the needed fields in the type. */
11489 }
11491 /* We didn't find what we were looking for. */
11494 #undef WALK_SUBTREE_TAIL
11495 }
11496 #undef WALK_SUBTREE
11498 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11500 tree
11502 walk_tree_lh lh)
11503 {
11504 tree result;
11509 }
11512 tree
11514 {
11521 }
11523 void
11525 {
11529 {
11531 }
11532 else
11534 }
11536 /* Create a nameless artificial label and put it in the current
11537 function context. The label has a location of LOC. Returns the
11538 newly created label. */
11540 tree
11542 {
11550 }
11552 /* Given a tree, try to return a useful variable name that we can use
11553 to prefix a temporary that is being assigned the value of the tree.
11554 I.E. given <temp> = &A, return A. */
11558 {
11559 tree stripped_decl;
11566 {
11571 }
11572 else
11573 {
11575 {
11580 }
11581 }
11582 }
11584 /* Return true if TYPE has a variable argument list. */
11586 bool
11588 {
11589 function_args_iterator args_iter;
11596 {
11598 }
11601 }
11603 /* Return true if TYPE has a prototype. */
11605 bool
11607 {
11608 tree t;
11614 }
11616 /* If BLOCK is inlined from an __attribute__((__artificial__))
11617 routine, return pointer to location from where it has been
11618 called. */
11619 location_t *
11621 {
11626 {
11629 {
11630 /* If AO is an artificial inline, point RET to the
11631 call site locus at which it has been inlined and continue
11632 the loop, in case AO's caller is also an artificial
11633 inline. */
11637 else
11639 }
11644 }
11646 }
11649 /* If EXP is inlined from an __attribute__((__artificial__))
11650 function, return the location of the original call expression. */
11652 location_t
11654 {
11659 else
11661 }
11663 /* Return the location into which EXP has been inlined. Analogous
11664 to tree_nonartificial_location() above but not limited to artificial
11665 functions declared inline. If SYSTEM_HEADER is true, return
11666 the macro expansion point of the location if it's in a system header */
11668 location_t
11670 {
11677 {
11685 }
11688 {
11691 /* Only consider macro expansion when the block traversal failed
11692 to find a location. Otherwise it's not relevant. */
11694 }
11697 }
11699 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11700 nodes. */
11702 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11704 hashval_t
11706 {
11713 else
11715 }
11717 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11718 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11719 same. */
11721 bool
11723 {
11736 else
11738 }
11740 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11742 tree
11745 {
11746 tree t;
11748 /* Use the cache of optimization nodes. */
11756 {
11757 /* Insert this one into the hash table. */
11761 /* Make a new node for next time round. */
11763 }
11766 }
11768 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11770 tree
11773 {
11774 tree t;
11776 /* Use the cache of optimization nodes. */
11784 {
11785 /* Insert this one into the hash table. */
11789 /* Make a new node for next time round. */
11791 }
11794 }
11796 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11797 so that they aren't saved during PCH writing. */
11799 void
11801 {
11806 }
11808 /* Determine the "ultimate origin" of a block. */
11810 tree
11812 {
11817 else
11818 {
11823 }
11824 }
11826 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11827 no instruction. */
11829 bool
11831 {
11832 /* Do not strip casts into or out of differing address spaces. */
11835 {
11840 }
11843 {
11844 /* We already know that outer_type is not a pointer with
11845 a non-generic address space. */
11847 }
11849 /* Use precision rather then machine mode when we can, which gives
11850 the correct answer even for submode (bit-field) types. */
11859 /* Otherwise fall back on comparing machine modes (e.g. for
11860 aggregate types, floats). */
11862 }
11864 /* Return true iff conversion in EXP generates no instruction. Mark
11865 it inline so that we fully inline into the stripping functions even
11866 though we have two uses of this function. */
11870 {
11885 }
11887 /* Return true iff conversion in EXP generates no instruction. Don't
11888 consider conversions changing the signedness. */
11890 static bool
11892 {
11903 }
11905 /* Strip conversions from EXP according to tree_nop_conversion and
11906 return the resulting expression. */
11908 tree
11910 {
11914 }
11916 /* Strip conversions from EXP according to tree_sign_nop_conversion
11917 and return the resulting expression. */
11919 tree
11921 {
11925 }
11927 /* Avoid any floating point extensions from EXP. */
11928 tree
11930 {
11933 /* For floating point constant look up the narrowest type that can hold
11934 it properly and handle it like (type)(narrowest_type)constant.
11935 This way we can optimize for instance a=a*2.0 where "a" is float
11936 but 2.0 is double constant. */
11938 {
11939 REAL_VALUE_TYPE orig;
11952 }
11971 }
11973 /* Strip out all handled components that produce invariant
11974 offsets. */
11976 const_tree
11978 {
11980 {
11982 {
11997 }
11999 }
12002 }
12006 /* Return the GCC personality function decl. */
12008 tree
12010 {
12014 }
12016 /* TARGET is a call target of GIMPLE call statement
12017 (obtained by gimple_call_fn). Return true if it is
12018 OBJ_TYPE_REF representing an virtual call of C++ method.
12019 (As opposed to OBJ_TYPE_REF representing objc calls
12020 through a cast where middle-end devirtualization machinery
12021 can't apply.) FOR_DUMP_P is true when being called from
12022 the dump routines. */
12024 bool
12026 {
12035 /* If we do not have BINFO associated, it means that type was built
12036 without devirtualization enabled. Do not consider this a virtual
12037 call. */
12041 }
12043 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12045 static tree
12047 {
12058 }
12060 /* Try to find a base info of BINFO that would have its field decl at offset
12061 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12062 found, return, otherwise return NULL_TREE. */
12064 tree
12066 {
12070 {
12072 tree fld;
12081 {
12089 }
12093 /* Offset 0 indicates the primary base, whose vtable contents are
12094 represented in the binfo for the derived class. */
12096 {
12098 /* Offsets in BINFO are in bytes relative to the whole structure
12099 while POS is in bits relative to the containing field. */
12106 {
12109 }
12112 else
12114 binfo_offset);
12115 }
12119 }
12120 }
12122 /* Returns true if X is a typedef decl. */
12124 bool
12126 {
12129 }
12131 /* Returns true iff TYPE is a type variant created for a typedef. */
12133 bool
12135 {
12137 }
12139 /* PR 84195: Replace control characters in "unescaped" with their
12140 escaped equivalents. Allow newlines if -fmessage-length has
12141 been set to a non-zero value. This is done here, rather than
12142 where the attribute is recorded as the message length can
12143 change between these two locations. */
12145 void
12147 {
12165 {
12169 {
12173 }
12176 {
12178 {
12179 /* We only allocate space for a new string if we
12180 actually encounter a control character that
12181 needs replacing. */
12185 }
12190 {
12199 }
12200 }
12203 }
12206 {
12210 }
12211 }
12213 /* Warn about a use of an identifier which was marked deprecated. Returns
12214 whether a warning was given. */
12216 bool
12218 {
12219 escaped_string msg;
12225 {
12229 {
12235 {
12238 }
12239 }
12240 }
12250 {
12251 auto_diagnostic_group d;
12255 else
12260 }
12262 {
12267 {
12273 }
12275 auto_diagnostic_group d;
12277 {
12281 else
12284 }
12285 else
12286 {
12290 else
12293 }
12297 }
12300 }
12302 /* Error out with an identifier which was marked 'unavailable'. */
12303 void
12305 {
12306 escaped_string msg;
12312 {
12316 {
12321 }
12322 }
12331 {
12332 auto_diagnostic_group d;
12335 else
12338 }
12340 {
12345 {
12351 }
12353 auto_diagnostic_group d;
12355 {
12358 else
12360 }
12361 else
12362 {
12365 else
12367 }
12371 }
12372 }
12374 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12375 somewhere in it. */
12377 bool
12379 {
12381 {
12386 }
12389 }
12391 /* Try to determine whether a TRY_CATCH expression can fall through.
12392 This is a subroutine of block_may_fallthru. */
12394 static bool
12396 {
12397 tree_stmt_iterator i;
12399 /* If the TRY block can fall through, the whole TRY_CATCH can
12400 fall through. */
12406 {
12408 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12409 catch expression and a body. The whole TRY_CATCH may fall
12410 through iff any of the catch bodies falls through. */
12412 {
12415 }
12419 /* The exception filter expression only matters if there is an
12420 exception. If the exception does not match EH_FILTER_TYPES,
12421 we will execute EH_FILTER_FAILURE, and we will fall through
12422 if that falls through. If the exception does match
12423 EH_FILTER_TYPES, the stack unwinder will continue up the
12424 stack, so we will not fall through. We don't know whether we
12425 will throw an exception which matches EH_FILTER_TYPES or not,
12426 so we just ignore EH_FILTER_TYPES and assume that we might
12427 throw an exception which doesn't match. */
12431 /* This case represents statements to be executed when an
12432 exception occurs. Those statements are implicitly followed
12433 by a RESX statement to resume execution after the exception.
12434 So in this case the TRY_CATCH never falls through. */
12436 }
12437 }
12439 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12440 need not be 100% accurate; simply be conservative and return true if we
12441 don't know. This is used only to avoid stupidly generating extra code.
12442 If we're wrong, we'll just delete the extra code later. */
12444 bool
12446 {
12447 /* This CONST_CAST is okay because expr_last returns its argument
12448 unmodified and we assign it to a const_tree. */
12452 {
12455 /* Easy cases. If the last statement of the block implies
12456 control transfer, then we can't fall through. */
12460 /* If there is a default: label or case labels cover all possible
12461 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12462 to some case label in all cases and all we care is whether the
12463 SWITCH_BODY falls through. */
12480 /* The finally clause is always executed after the try clause,
12481 so if it does not fall through, then the try-finally will not
12482 fall through. Otherwise, if the try clause does not fall
12483 through, then when the finally clause falls through it will
12484 resume execution wherever the try clause was going. So the
12485 whole try-finally will only fall through if both the try
12486 clause and the finally clause fall through. */
12496 else
12498 /* FALLTHRU */
12501 /* Functions that do not return do not fall through. */
12515 }
12516 }
12518 /* True if we are using EH to handle cleanups. */
12521 /* This routine is called from front ends to indicate eh should be used for
12522 cleanups. */
12523 void
12525 {
12527 }
12529 /* Query whether EH is used for cleanups. */
12530 bool
12532 {
12534 }
12536 /* Wrapper for tree_code_name to ensure that tree code is valid */
12539 {
12542 /* The tree_code enum promotes to signed, but we could be getting
12543 invalid values, so force an unsigned comparison. */
12545 {
12549 }
12552 }
12554 /* Drops the TREE_OVERFLOW flag from T. */
12556 tree
12558 {
12561 /* For tree codes with a sharing machinery re-build the result. */
12565 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12566 and canonicalize the result. */
12568 {
12569 tree_vector_builder builder;
12573 {
12578 }
12580 }
12582 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12583 and drop the flag. */
12587 /* For constants that contain nested constants, drop the flag
12588 from those as well. */
12590 {
12595 }
12598 }
12600 /* Given a memory reference expression T, return its base address.
12601 The base address of a memory reference expression is the main
12602 object being referenced. For instance, the base address for
12603 'array[i].fld[j]' is 'array'. You can think of this as stripping
12604 away the offset part from a memory address.
12606 This function calls handled_component_p to strip away all the inner
12607 parts of the memory reference until it reaches the base object. */
12609 tree
12611 {
12623 }
12625 /* Return a tree of sizetype representing the size, in bytes, of the element
12626 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12628 tree
12630 {
12635 /* If a size was specified in the ARRAY_REF, it's the size measured
12636 in alignment units of the element type. So multiply by that value. */
12638 {
12639 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12640 sizetype from another type of the same width and signedness. */
12645 }
12647 /* Otherwise, take the size from that of the element type. Substitute
12648 any PLACEHOLDER_EXPR that we have. */
12649 else
12651 }
12653 /* Return a tree representing the lower bound of the array mentioned in
12654 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12656 tree
12658 {
12661 /* If a lower bound is specified in EXP, use it. */
12665 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12666 substituting for a PLACEHOLDER_EXPR as needed. */
12670 /* Otherwise, return a zero of the appropriate type. */
12674 }
12676 /* Return a tree representing the upper bound of the array mentioned in
12677 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12679 tree
12681 {
12684 /* If there is a domain type and it has an upper bound, use it, substituting
12685 for a PLACEHOLDER_EXPR as needed. */
12689 /* Otherwise fail. */
12691 }
12693 /* Returns true if REF is an array reference, component reference,
12694 or memory reference to an array at the end of a structure.
12695 If this is the case, the array may be allocated larger
12696 than its upper bound implies. */
12698 bool
12700 {
12701 tree atype;
12705 {
12708 }
12713 {
12719 {
12721 {
12727 }
12728 else
12730 }
12731 else
12733 }
12734 else
12742 {
12743 /* If the reference chain contains a component reference to a
12744 non-union type and there follows another field the reference
12745 is not at the end of a structure. */
12747 {
12749 {
12755 }
12756 }
12757 /* If we have a multi-dimensional array we do not consider
12758 a non-innermost dimension as flex array if the whole
12759 multi-dimensional array is at struct end.
12760 Same for an array of aggregates with a trailing array
12761 member. */
12765 ;
12766 /* If we view an underlying object as sth else then what we
12767 gathered up to now is what we have to rely on. */
12770 else
12774 }
12776 /* The array now is at struct end. Treat flexible arrays as
12777 always subject to extend, even into just padding constrained by
12778 an underlying decl. */
12784 /* If the reference is based on a declared entity, the size of the array
12785 is constrained by its given domain. (Do not trust commons PR/69368). */
12789 && !(flag_unconstrained_commons
12793 {
12794 /* If the object itself is the array it is not at struct end. */
12798 /* Check whether the array domain covers all of the available
12799 padding. */
12800 poly_int64 offset;
12808 /* If at least one extra element fits it is a flexarray. */
12817 }
12820 }
12822 /* Return a tree representing the offset, in bytes, of the field referenced
12823 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12825 tree
12827 {
12832 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12833 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12834 value. */
12836 {
12837 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12838 sizetype from another type of the same width and signedness. */
12844 }
12846 /* Otherwise, take the offset from that of the field. Substitute
12847 any PLACEHOLDER_EXPR that we have. */
12848 else
12850 }
12852 /* Given the initializer INIT, return the initializer for the field
12853 DECL if it exists, otherwise null. Used to obtain the initializer
12854 for a flexible array member and determine its size. */
12856 static tree
12858 {
12864 {
12869 {
12873 }
12874 }
12877 }
12879 /* Determines the size of the member referenced by the COMPONENT_REF
12880 REF, using its initializer expression if necessary in order to
12881 determine the size of an initialized flexible array member.
12882 If non-null, set *ARK when REF refers to an interior zero-length
12883 array or a trailing one-element array.
12884 Returns the size as sizetype (which might be zero for an object
12885 with an uninitialized flexible array member) or null if the size
12886 cannot be determined. */
12888 tree
12890 {
12893 special_array_member sambuf;
12898 /* The object/argument referenced by the COMPONENT_REF and its type. */
12901 /* The referenced member. */
12906 {
12909 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
12910 to the type of a class with a virtual base which doesn't
12911 reflect the size of the virtual's members (see pr97595).
12912 If that's the case fail for now and implement something
12913 more robust in the future. */
12920 /* MEMBER is either an interior array or is an array with
12921 more than one element. */
12925 {
12928 else
12929 {
12932 }
12933 }
12941 {
12946 /* MEMBER is an array with more than one element. */
12951 }
12953 /* For a reference to a zero- or one-element array member of a union
12954 use the size of the union instead of the size of the member. */
12957 }
12959 /* MEMBER is either a bona fide flexible array member, or a zero-length
12960 array member, or an array of length one treated as such. */
12962 /* If the reference is to a declared object and the member a true
12963 flexible array, try to determine its size from its initializer. */
12967 {
12978 }
12980 /* BASE is the declared object of which MEMBER is either a member
12981 or that is cast to ARGTYPE (e.g., a char buffer used to store
12982 an ARGTYPE object). */
12985 /* Determine the base type of the referenced object. If it's
12986 the same as ARGTYPE and MEMBER has a known size, return it. */
12998 /* MEMBER is a true flexible array member. Compute its size from
12999 the initializer of the BASE object if it has one. */
13002 {
13005 {
13008 {
13009 /* Use the larger of the initializer size and the tail
13010 padding in the enclosing struct. */
13015 }
13018 }
13019 }
13022 {
13024 {
13029 /* The size of a flexible array member of an extern struct
13030 with no initializer cannot be determined (it's defined
13031 in another translation unit and can have an initializer
13032 with an arbitrary number of elements). */
13035 /* Use the size of the base struct or, for interior zero-length
13036 arrays, the size of the enclosing type. */
13038 }
13040 /* Use the size of the BASE object (possibly an array of some
13041 other type such as char used to store the struct). */
13043 else
13045 }
13047 /* If the flexible array member has a known size use the greater
13048 of it and the tail padding in the enclosing struct.
13049 Otherwise, when the size of the flexible array member is unknown
13050 and the referenced object is not a struct, use the size of its
13051 type when known. This detects sizes of array buffers when cast
13052 to struct types with flexible array members. */
13054 {
13059 {
13062 }
13064 }
13066 /* Return "don't know" for an external non-array object since its
13067 flexible array member can be initialized to have any number of
13068 elements. Otherwise, return zero because the flexible array
13069 member has no elements. */
13072 && (!typematch
13075 }
13077 /* Return the machine mode of T. For vectors, returns the mode of the
13078 inner type. The main use case is to feed the result to HONOR_NANS,
13079 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13081 machine_mode
13083 {
13089 }
13091 /* Vector types need to re-check the target flags each time we report
13092 the machine mode. We need to do this because attribute target can
13093 change the result of vector_mode_supported_p and have_regs_of_mode
13094 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13095 change on a per-function basis. */
13096 /* ??? Possibly a better solution is to run through all the types
13097 referenced by a function and re-compute the TYPE_MODE once, rather
13098 than make the TYPE_MODE macro call a function. */
13100 machine_mode
13102 {
13103 machine_mode mode;
13111 {
13112 scalar_int_mode innermode;
13114 /* For integers, try mapping it to a same-sized scalar mode. */
13116 {
13119 scalar_int_mode mode;
13123 }
13126 }
13129 }
13131 /* Return the size in bits of each element of vector type TYPE. */
13133 unsigned int
13135 {
13140 }
13142 /* Calculate the size in bits of each element of vector type TYPE
13143 and return the result as a tree of type bitsizetype. */
13145 tree
13147 {
13152 }
13154 /* Verify that basic properties of T match TV and thus T can be a variant of
13155 TV. TV should be the more specified variant (i.e. the main variant). */
13157 static bool
13159 {
13160 /* Type variant can differ by:
13162 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13163 ENCODE_QUAL_ADDR_SPACE.
13164 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13165 in this case some values may not be set in the variant types
13166 (see TYPE_COMPLETE_P checks).
13167 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13168 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13169 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13170 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13171 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13172 this is necessary to make it possible to merge types form different TUs
13173 - arrays, pointers and references may have TREE_TYPE that is a variant
13174 of TREE_TYPE of their main variants.
13175 - aggregates may have new TYPE_FIELDS list that list variants of
13176 the main variant TYPE_FIELDS.
13177 - vector types may differ by TYPE_VECTOR_OPAQUE
13178 */
13180 /* Convenience macro for matching individual fields. */
13181 #define verify_variant_match(flag) \
13182 do { \
13183 if (flag (tv) != flag (t)) \
13184 { \
13186 debug_tree (tv); \
13187 return false; \
13188 } \
13189 } while (false)
13191 /* tree_base checks. */
13194 /* FIXME: Ada builds non-artificial variants of artificial types. */
13195 #if 0
13198 #endif
13201 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13208 else
13210 /* FIXME: This check trigger during libstdc++ build. */
13211 #if 0
13214 #endif
13216 /* tree_type_common checks. */
13219 {
13227 {
13237 }
13239 }
13245 /* During LTO we merge variant lists from diferent translation units
13246 that may differ BY TYPE_CONTEXT that in turn may point
13247 to TRANSLATION_UNIT_DECL.
13248 Ada also builds variants of types with different TYPE_CONTEXT. */
13249 #if 0
13252 #endif
13258 {
13262 }
13264 /* tree_type_non_common checks. */
13266 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13267 and dangle the pointer from time to time. */
13271 {
13275 }
13281 {
13284 }
13291 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13292 or even type's main variant. This is needed to make bootstrap pass
13293 and the bug seems new in GCC 5.
13294 C++ FE should be updated to make this consistent and we should check
13295 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13296 is a match with main variant.
13298 Also disable the check for Java for now because of parser hack that builds
13299 first an dummy BINFO and then sometimes replace it by real BINFO in some
13300 of the copies. */
13303 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13304 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13305 at LTO time only. */
13307 {
13315 }
13317 /* Check various uses of TYPE_VALUES_RAW. */
13323 /* Permit incomplete variants of complete type. While FEs may complete
13324 all variants, this does not happen for C++ templates in all cases. */
13328 {
13331 /* Fortran builds qualified variants as new records with items of
13332 qualified type. Verify that they looks same. */
13339 /* FIXME: gfc_nonrestricted_type builds all types as variants
13340 with exception of pointer types. It deeply copies the type
13341 which means that we may end up with a variant type
13342 referring non-variant pointer. We may change it to
13343 produce types as variants, too, like
13344 objc_get_protocol_qualified_type does. */
13350 {
13358 }
13359 }
13362 /* For C++ the qualified variant of array type is really an array type
13363 of qualified TREE_TYPE.
13364 objc builds variants of pointer where pointer to type is a variant, too
13365 in objc_get_protocol_qualified_type. */
13371 {
13379 }
13382 {
13390 }
13392 #undef verify_variant_match
13393 }
13396 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13397 the middle-end types_compatible_p function. It needs to avoid
13398 claiming types are different for types that should be treated
13399 the same with respect to TBAA. Canonical types are also used
13400 for IL consistency checks via the useless_type_conversion_p
13401 predicate which does not handle all type kinds itself but falls
13402 back to pointer-comparison of TYPE_CANONICAL for aggregates
13403 for example. */
13405 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13406 type calculation because we need to allow inter-operability between signed
13407 and unsigned variants. */
13409 bool
13411 {
13412 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13413 signed char and unsigned char. Similarly fortran FE builds
13414 C_SIZE_T as signed type, while C defines it unsigned. */
13417 == INTEGER_TYPE
13420 }
13422 /* Return true iff T1 and T2 are structurally identical for what
13423 TBAA is concerned.
13424 This function is used both by lto.cc canonical type merging and by the
13425 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13426 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13427 only for LTO because only in these cases TYPE_CANONICAL equivalence
13428 correspond to one defined by gimple_canonical_types_compatible_p. */
13430 bool
13433 {
13434 /* Type variants should be same as the main variant. When not doing sanity
13435 checking to verify this fact, go to main variants and save some work. */
13437 {
13440 }
13442 /* Check first for the obvious case of pointer identity. */
13446 /* Check that we have two types to compare. */
13450 /* We consider complete types always compatible with incomplete type.
13451 This does not make sense for canonical type calculation and thus we
13452 need to ensure that we are never called on it.
13454 FIXME: For more correctness the function probably should have three modes
13455 1) mode assuming that types are complete mathcing their structure
13456 2) mode allowing incomplete types but producing equivalence classes
13457 and thus ignoring all info from complete types
13458 3) mode allowing incomplete types to match complete but checking
13459 compatibility between complete types.
13461 1 and 2 can be used for canonical type calculation. 3 is the real
13462 definition of type compatibility that can be used i.e. for warnings during
13463 declaration merging. */
13468 /* If the types have been previously registered and found equal
13469 they still are. */
13473 {
13474 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13475 they are always NULL, but they are set to non-NULL for types
13476 constructed by build_pointer_type and variants. In this case the
13477 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13478 all pointers are considered equal. Be sure to not return false
13479 negatives. */
13483 }
13485 /* For types where we do ODR based TBAA the canonical type is always
13486 set correctly, so we know that types are different if their
13487 canonical types does not match. */
13493 /* Can't be the same type if the types don't have the same code. */
13498 /* Qualifiers do not matter for canonical type comparison purposes. */
13500 /* Void types and nullptr types are always the same. */
13505 /* Can't be the same type if they have different mode. */
13509 /* Non-aggregate types can be handled cheaply. */
13517 {
13518 /* Can't be the same type if they have different recision. */
13522 /* In some cases the signed and unsigned types are required to be
13523 inter-operable. */
13528 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13529 interoperable with "signed char". Unless all frontends are revisited
13530 to agree on these types, we must ignore the flag completely. */
13532 /* Fortran standard define C_PTR type that is compatible with every
13533 C pointer. For this reason we need to glob all pointers into one.
13534 Still pointers in different address spaces are not compatible. */
13536 {
13540 }
13542 /* Tail-recurse to components. */
13547 trust_type_canonical);
13550 }
13552 /* Do type-specific comparisons. */
13554 {
13556 /* Array types are the same if the element types are the same and
13557 the number of elements are the same. */
13559 trust_type_canonical)
13564 else
13565 {
13569 /* For an incomplete external array, the type domain can be
13570 NULL_TREE. Check this condition also. */
13575 else
13576 {
13582 /* The minimum/maximum values have to be the same. */
13594 else
13596 }
13597 }
13601 /* Function types are the same if the return type and arguments types
13602 are the same. */
13604 trust_type_canonical))
13609 else
13610 {
13616 {
13619 trust_type_canonical))
13621 }
13627 }
13632 {
13635 /* Don't try to compare variants of an incomplete type, before
13636 TYPE_FIELDS has been copied around. */
13644 /* For aggregate types, all the fields must be the same. */
13648 {
13649 /* Skip non-fields and zero-sized fields. */
13660 /* The fields must have the same name, offset and type. */
13663 || !gimple_canonical_types_compatible_p
13665 trust_type_canonical))
13667 }
13669 /* If one aggregate has more fields than the other, they
13670 are not the same. */
13675 }
13678 /* Consider all types with language specific trees in them mutually
13679 compatible. This is executed only from verify_type and false
13680 positives can be tolerated. */
13683 }
13684 }
13686 /* For OPAQUE_TYPE T, it should have only size and alignment information
13687 and its mode should be of class MODE_OPAQUE. This function verifies
13688 these properties of T match TV which is the main variant of T and TC
13689 which is the canonical of T. */
13691 static void
13693 {
13698 /* For an opaque type T1, check if some of its properties match
13699 the corresponding ones of the other opaque type T2, emit some
13700 error messages for those inconsistent ones. */
13703 {
13705 {
13709 }
13711 {
13715 }
13717 {
13721 }
13725 {
13729 }
13731 {
13735 }
13737 {
13741 }
13742 };
13749 }
13751 /* Verify type T. */
13753 void
13755 {
13761 {
13764 }
13767 {
13770 }
13772 {
13776 }
13781 ;
13783 {
13787 }
13788 /* Method and function types cannot be used to address memory and thus
13789 TYPE_CANONICAL really matters only for determining useless conversions.
13791 FIXME: C++ FE produce declarations of builtin functions that are not
13792 compatible with main variants. */
13794 ;
13796 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
13797 with variably sized arrays because their sizes possibly
13798 gimplified to different variables. */
13802 {
13806 }
13810 {
13814 }
13816 {
13821 }
13824 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13826 {
13827 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13828 and danagle the pointer from time to time. */
13832 {
13836 }
13837 }
13839 {
13842 {
13846 }
13847 }
13849 {
13852 {
13856 }
13857 }
13860 {
13861 /* FIXME: The following check should pass:
13862 useless_type_conversion_p (const_cast <tree> (t),
13863 TREE_TYPE (TYPE_MIN_VALUE (t))
13864 but does not for C sizetypes in LTO. */
13865 }
13867 /* Check various uses of TYPE_MAXVAL_RAW. */
13869 {
13871 ;
13873 {
13877 }
13879 {
13883 }
13884 }
13886 {
13890 {
13894 }
13895 }
13897 {
13901 {
13905 }
13906 }
13909 {
13910 /* FIXME: The following check should pass:
13911 useless_type_conversion_p (const_cast <tree> (t),
13912 TREE_TYPE (TYPE_MAX_VALUE (t))
13913 but does not for C sizetypes in LTO. */
13914 }
13916 {
13919 {
13923 }
13924 }
13926 {
13930 }
13933 {
13937 }
13939 /* Check various uses of TYPE_VALUES_RAW. */
13942 {
13946 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13947 CONST_DECL of ENUMERAL TYPE. */
13949 {
13954 }
13958 {
13964 }
13966 {
13971 }
13972 }
13974 {
13976 {
13980 }
13981 }
13983 {
13985 {
13988 }
13990 {
13991 /* TODO: verify properties of decls. */
13993 ;
13995 ;
13997 ;
13999 ;
14001 ;
14003 ;
14005 ;
14006 else
14007 {
14011 }
14012 }
14013 }
14020 {
14022 {
14027 }
14029 {
14033 }
14034 /* Verify just enough of cache to ensure that no one copied it to new type.
14035 All copying should go by copy_node that should clear it. */
14037 {
14042 {
14047 }
14048 }
14049 }
14052 {
14053 /* C++ FE uses TREE_PURPOSE to store initial values. */
14055 {
14059 }
14061 {
14065 }
14066 }
14068 {
14072 }
14080 {
14083 }
14085 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14086 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14087 of a type. */
14090 {
14093 }
14096 {
14099 }
14100 }
14103 /* Return 1 if ARG interpreted as signed in its precision is known to be
14104 always positive or 2 if ARG is known to be always negative, or 3 if
14105 ARG may be positive or negative. */
14107 int
14109 {
14116 {
14120 else
14122 }
14126 {
14128 /* Narrower value zero extended into wider type
14129 will always result in positive values. */
14136 }
14140 value_range r;
14142 {
14146 {
14150 {
14159 }
14160 }
14162 }
14164 {
14165 /* For unsigned values, the "positive" range comes
14166 below the "negative" range. */
14171 }
14172 else
14173 {
14178 }
14180 }
14185 /* Return true if ARG is marked with the nonnull attribute in the
14186 current function signature. */
14188 bool
14190 {
14198 /* The static chain decl is always non null. */
14202 /* THIS argument of method is always non-NULL. */
14208 /* Values passed by reference are always non-NULL. */
14215 {
14218 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14222 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14226 /* Get the position number for ARG in the function signature. */
14228 t;
14230 {
14233 }
14237 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14239 {
14242 }
14243 }
14246 }
14248 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14249 information. */
14251 location_t
14253 {
14257 }
14259 location_t
14261 {
14262 source_range src_range;
14266 }
14268 location_t
14270 {
14276 pure_loc,
14277 src_range,
14278 NULL);
14281 }
14283 /* Return EXPR, potentially wrapped with a node expression LOC,
14284 if !CAN_HAVE_LOCATION_P (expr).
14286 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14287 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14289 Wrapper nodes can be identified using location_wrapper_p. */
14291 tree
14293 {
14300 /* We should only be adding wrappers for constants and for decls,
14301 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14306 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14307 any impact of the wrapper nodes. */
14311 /* Compiler-generated temporary variables don't need a wrapper. */
14315 /* If any auto_suppress_location_wrappers are active, don't create
14316 wrappers. */
14320 tree_code code
14325 /* Mark this node as being a wrapper. */
14328 }
14332 /* Return the name of combined function FN, for debugging purposes. */
14336 {
14338 {
14341 }
14342 else
14344 }
14346 /* Return a bitmap with a bit set corresponding to each argument in
14347 a function call type FNTYPE declared with attribute nonnull,
14348 or null if none of the function's argument are nonnull. The caller
14349 must free the bitmap. */
14351 bitmap
14353 {
14359 {
14360 /* The this pointer in C++ non-static member functions is
14361 implicitly nonnull whether or not it's declared as such. */
14364 }
14370 /* A function declaration can specify multiple attribute nonnull,
14371 each with zero or more arguments. The loop below creates a bitmap
14372 representing a union of all the arguments. An empty (but non-null)
14373 bitmap means that all arguments have been declaraed nonnull. */
14375 {
14384 {
14385 /* Clear the bitmap in case a previous attribute nonnull
14386 set it and this one overrides it for all arguments. */
14389 }
14391 /* Iterate over the indices of the format arguments declared nonnull
14392 and set a bit for each. */
14394 {
14397 }
14398 }
14401 }
14403 /* Returns true if TYPE is a type where it and all of its subobjects
14404 (recursively) are of structure, union, or array type. */
14406 bool
14408 {
14410 {
14417 }
14423 }
14425 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14426 that shouldn't be passed via stack. */
14428 bool
14430 {
14441 }
14443 /* Determine whether TYPE is a structure with a flexible array member,
14444 or a union containing such a structure (possibly recursively). */
14446 bool
14448 {
14451 {
14467 {
14471 }
14475 }
14476 }
14478 /* Like int_size_in_bytes, but handle empty records specially. */
14480 HOST_WIDE_INT
14482 {
14484 }
14486 /* Like size_in_bytes, but handle empty records specially. */
14488 tree
14490 {
14492 }
14494 /* Return true if an expression with CODE has to have the same result type as
14495 its first operand. */
14497 bool
14499 {
14501 {
14535 }
14536 }
14538 /* Return a typenode for the "standard" C type with a given name. */
14539 tree
14541 {
14573 }
14575 /* List of pointer types used to declare builtins before we have seen their
14576 real declaration.
14578 Keep the size up to date in tree.h ! */
14580 {
14587 };
14589 /* Return the maximum object size. */
14591 tree
14593 {
14594 /* To do: Make this a configurable parameter. */
14596 }
14598 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14599 parameter default to false and that weeds out error_mark_node. */
14601 bool
14604 {
14611 }
14613 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14614 delete operators. Return false if they may or may not name such
14615 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14616 do not. */
14618 bool
14621 {
14631 /* The following failures are due to invalid names so they're not
14632 considered certain mismatches. */
14648 /* The following failures are due to names of user-defined operators
14649 so they're also not considered certain mismatches. */
14651 /* *_len is now just the length after initial underscores. */
14657 /* The following failures are certain mismatches. */
14660 /* _Znw must match _Zdl, _Zna must match _Zda. */
14664 /* 'j', 'm' and 'y' correspond to size_t. */
14671 {
14672 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14673 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14680 }
14684 {
14685 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14686 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14687 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14697 }
14699 /* The negative result is conservative. */
14702 }
14704 /* Return the zero-based number corresponding to the argument being
14705 deallocated if FNDECL is a deallocation function or an out-of-bounds
14706 value if it isn't. */
14708 unsigned
14710 {
14711 /* A call to operator delete isn't recognized as one to a built-in. */
14713 {
14717 /* Avoid placement delete that's not been inlined. */
14723 }
14725 /* TODO: Handle user-defined functions with attribute malloc? Handle
14726 known non-built-ins like fopen? */
14728 {
14730 {
14736 }
14738 }
14747 {
14758 }
14761 }
14763 /* If EXPR refers to a character array or pointer declared attribute
14764 nonstring, return a decl for that array or pointer and set *REF
14765 to the referenced enclosing object or pointer. Otherwise return
14766 null. */
14768 tree
14770 {
14774 {
14778 {
14784 }
14785 else
14787 }
14792 /* To simplify calling code, store the referenced DECL regardless of
14793 the attribute determined below, but avoid storing the SSA_NAME_VAR
14794 obtained above (it's not useful for dataflow purposes). */
14798 /* Use the SSA_NAME_VAR that was determined above to see if it's
14799 declared nonstring. Otherwise drill down into the referenced
14800 DECL. */
14815 }
14817 /* Return length of attribute names string,
14818 if arglist chain > 1, -1 otherwise. */
14820 int
14822 {
14823 tree arg;
14828 {
14833 argnum++;
14834 argnum++;
14835 }
14839 }
14841 void
14843 {
14845 }
14847 #if CHECKING_P
14851 /* Selftests for tree. */
14853 /* Verify that integer constants are sane. */
14855 static void
14857 {
14870 }
14872 /* Verify identifiers. */
14874 static void
14876 {
14880 }
14882 /* Verify LABEL_DECL. */
14884 static void
14886 {
14892 }
14894 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14895 are given by VALS. */
14897 static tree
14899 {
14904 }
14906 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14908 static void
14910 {
14916 }
14918 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14919 and that its elements match EXPECTED. */
14921 static void
14924 {
14931 }
14933 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14934 and NPATTERNS background elements, and that its elements match
14935 EXPECTED. */
14937 static void
14940 {
14947 }
14949 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14950 and that its elements match EXPECTED. */
14952 static void
14955 {
14962 }
14964 /* Test the creation of VECTOR_CSTs. */
14966 static void
14968 {
14974 /* Test a simple linear series with a base of 0 and a step of 1:
14975 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14981 /* Try the same with the first element replaced by 100:
14982 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14987 /* Try a series that wraps around.
14988 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14994 /* Try a downward series:
14995 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15001 /* Try two interleaved series with different bases and steps:
15002 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15005 {
15008 }
15012 /* Try a duplicated value:
15013 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15019 /* Try an interleaved duplicated value:
15020 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15027 /* Try a duplicated value with 2 exceptions
15028 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15034 /* Try with and without a step
15035 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15041 /* Try a fully-general constant:
15042 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15046 }
15048 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15049 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15050 modifying its argument in-place. */
15052 static void
15054 {
15057 }
15059 /* Verify location wrappers. */
15061 static void
15063 {
15068 /* Wrapping a constant. */
15078 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15081 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15086 /* Wrapping a STRING_CST. */
15098 /* Wrapping a variable. */
15101 integer_type_node);
15110 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15111 wrapper. */
15116 /* Verify that STRIP_NOPS removes wrappers. */
15120 }
15122 /* Test various tree predicates. Verify that location wrappers don't
15123 affect the results. */
15125 static void
15127 {
15128 /* Build various constants and wrappers around them. */
15156 /* TODO: vector constants. */
15158 /* Test integer_onep. */
15178 /* Test integer_zerop. */
15198 /* Test integer_all_onesp. */
15218 /* Test integer_minus_onep. */
15238 /* Test integer_each_onep. */
15258 /* Test integer_truep. */
15278 /* Test integer_nonzerop. */
15298 /* Test real_zerop. */
15318 /* Test real_onep. */
15338 /* Test real_minus_onep. */
15358 /* Test zerop. */
15378 /* Test tree_expr_nonnegative_p. */
15398 /* Test tree_expr_nonzero_p. */
15406 /* Test integer_valued_real_p. */
15413 /* Test integer_pow2p. */
15418 /* Test uniform_integer_cst_p. */
15437 }
15439 /* Check that string escaping works correctly. */
15441 static void
15443 {
15445 escaped_string msg;
15448 /* ASSERT_STREQ does not accept NULL as a valid test
15449 result, so we have to use ASSERT_EQ instead. */
15458 /* Ensure that we have -fmessage-length set to 0. */
15468 /* Now repeat the tests with -fmessage-length set to 5. */
15471 /* Note that the newline is not translated into an escape. */
15478 /* Restore the original message length setting. */
15480 }
15482 /* Run all of the selftests within this file. */
15484 void
15486 {
15494 }