| blob | 1aa6e557a049377a0d7000bdb60f959bfb5d7f1f |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2021 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
73 /* Tree code classes. */
75 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
76 #define END_OF_BASE_TREE_CODES tcc_exceptional,
80 };
82 #undef DEFTREECODE
83 #undef END_OF_BASE_TREE_CODES
85 /* Table indexed by tree code giving number of expression
86 operands beyond the fixed part of the node structure.
87 Not used for types or decls. */
89 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
90 #define END_OF_BASE_TREE_CODES 0,
94 };
96 #undef DEFTREECODE
97 #undef END_OF_BASE_TREE_CODES
99 /* Names of tree components.
100 Used for printing out the tree and error messages. */
101 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
106 };
108 #undef DEFTREECODE
109 #undef END_OF_BASE_TREE_CODES
111 /* Each tree code class has an associated string representation.
112 These must correspond to the tree_code_class entries. */
115 {
126 "expression"
127 };
129 /* obstack.[ch] explicitly declined to prototype this. */
132 /* Statistics-gathering stuff. */
138 /* Keep in sync with tree.h:enum tree_node_kind. */
156 };
158 /* Unique id for next decl created. */
160 /* Unique id for next type created. */
162 /* Unique id for next debug decl created. Use negative numbers,
163 to catch erroneous uses. */
166 /* Since we cannot rehash a type after it is in the table, we have to
167 keep the hash code. */
171 tree type;
172 };
174 /* Initial size of the hash table (rounded to next prime). */
175 #define TYPE_HASH_INITIAL_SIZE 1000
178 {
182 static int
184 {
186 }
187 };
189 /* Now here is the hash table. When recording a type, it is added to
190 the slot whose index is the hash code. Note that the hash table is
191 used for several kinds of types (function types, array types and
192 array index range types, for now). While all these live in the
193 same table, they are completely independent, and the hash code is
194 computed differently for each of these. */
198 /* Hash table and temporary node for larger integer const values. */
202 {
205 };
209 /* Class and variable for making sure that there is a single POLY_INT_CST
210 for a given value. */
212 {
216 };
220 /* Hash table for optimization flags and target option flags. Use the same
221 hash table for both sets of options. Nodes for building the current
222 optimization and target option nodes. The assumption is most of the time
223 the options created will already be in the hash table, so we avoid
224 allocating and freeing up a node repeatably. */
229 {
232 };
236 /* General tree->tree mapping structure for use in hash tables. */
246 {
249 static bool
251 {
253 }
255 static int
257 {
259 }
260 };
278 /* Number of operands for each OpenMP clause. */
280 {
364 };
367 {
451 };
454 /* Return the tree node structure used by tree code CODE. */
458 {
460 {
463 {
475 }
489 }
492 {
493 /* tcc_constant cases. */
503 /* tcc_exceptional cases. */
520 }
521 }
524 /* Initialize tree_contains_struct to describe the hierarchy of tree
525 nodes. */
527 static void
529 {
533 {
540 /* Mark the TS structure itself. */
543 /* Mark all the structures that TS is derived from. */
545 {
625 }
626 }
628 /* Basic consistency checks for attributes used in fold. */
669 }
672 /* Init tree.c. */
674 void
676 {
677 /* Initialize the hash table of types. */
678 type_hash_table
681 debug_expr_for_decl
684 value_expr_for_decl
698 /* Initialize the tree_contains_struct array. */
701 }
703 \f
704 /* The name of the object as the assembler will see it (but before any
705 translations made by ASM_OUTPUT_LABELREF). Often this is the same
706 as DECL_NAME. It is an IDENTIFIER_NODE. */
707 tree
709 {
713 }
715 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
716 (either of which may be NULL). Inform the FE, if this changes the
717 name. */
719 void
721 {
724 }
726 /* Return true if DECL may need an assembler name to be set. */
730 {
731 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
732 Rule merging. This makes type_odr_p to return true on those types during
733 LTO and by comparing the mangled name, we can say what types are intended
734 to be equivalent across compilation unit.
736 We do not store names of type_in_anonymous_namespace_p.
738 Record, union and enumeration type have linkage that allows use
739 to check type_in_anonymous_namespace_p. We do not mangle compound types
740 that always can be compared structurally.
742 Similarly for builtin types, we compare properties of their main variant.
743 A special case are integer types where mangling do make differences
744 between char/signed char/unsigned char etc. Storing name for these makes
745 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
746 See cp/mangle.c:write_builtin_type for details. */
749 {
762 }
763 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
767 /* If DECL already has its assembler name set, it does not need a
768 new one. */
773 /* Abstract decls do not need an assembler name. */
777 /* For VAR_DECLs, only static, public and external symbols need an
778 assembler name. */
786 {
787 /* Do not set assembler name on builtins. Allow RTL expansion to
788 decide whether to expand inline or via a regular call. */
793 /* Functions represented in the callgraph need an assembler name. */
797 /* Unused and not public functions don't need an assembler name. */
800 }
803 }
805 /* If T needs an assembler name, have one created for it. */
807 void
809 {
811 {
812 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
813 diagnostics that use input_location to show locus
814 information. The problem here is that, at this point,
815 input_location is generally anchored to the end of the file
816 (since the parser is long gone), so we don't have a good
817 position to pin it to.
819 To alleviate this problem, this uses the location of T's
820 declaration. Examples of this are
821 testsuite/g++.dg/template/cond2.C and
822 testsuite/g++.dg/template/pr35240.C. */
829 }
830 }
832 /* When the target supports COMDAT groups, this indicates which group the
833 DECL is associated with. This can be either an IDENTIFIER_NODE or a
834 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
835 tree
837 {
842 }
844 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
845 tree
847 {
852 }
854 /* When the target supports named section, return its name as IDENTIFIER_NODE
855 or NULL if it is in no section. */
858 {
863 }
865 /* Set section name of NODE to VALUE (that is expected to be
866 identifier node) */
867 void
869 {
873 {
877 }
880 else
883 }
885 /* Set section name of NODE to match the section name of OTHER.
887 set_decl_section_name (decl, other) is equivalent to
888 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
889 efficient. */
890 void
892 {
895 {
899 else
902 }
903 else
904 {
909 }
910 }
912 /* Return TLS model of a variable NODE. */
913 enum tls_model
915 {
920 }
922 /* Set TLS model of variable NODE to MODEL. */
923 void
925 {
929 {
933 }
934 else
937 }
939 /* Compute the number of bytes occupied by a tree with code CODE.
940 This function cannot be used for nodes that have variable sizes,
941 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
942 size_t
944 {
946 {
949 {
966 }
970 {
994 }
1007 {
1019 }
1023 {
1044 }
1048 }
1049 }
1051 /* Compute the number of bytes occupied by NODE. This routine only
1052 looks at TREE_CODE, except for those nodes that have variable sizes. */
1053 size_t
1055 {
1058 {
1088 else
1090 }
1091 }
1093 /* Return tree node kind based on tree CODE. */
1095 static tree_node_kind
1097 {
1101 {
1119 {
1136 }
1142 }
1143 }
1145 /* Record interesting allocation statistics for a tree node with CODE
1146 and LENGTH. */
1148 static void
1150 {
1159 }
1161 /* Allocate and return a new UID from the DECL_UID namespace. */
1163 int
1165 {
1167 }
1169 /* Return a newly allocated node of code CODE. For decl and type
1170 nodes, some other fields are initialized. The rest of the node is
1171 initialized to zero. This function cannot be used for TREE_VEC,
1172 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1173 tree_code_size.
1175 Achoo! I got a code in the node. */
1177 tree
1179 {
1180 tree t;
1190 {
1198 {
1200 {
1203 }
1204 else
1206 }
1210 else
1211 {
1214 }
1227 /* Default to no attributes for type, but let target change that. */
1231 /* We have not yet computed the alias set for this type. */
1241 {
1249 /* All of these have side-effects, no matter what their
1250 operands are. */
1256 }
1261 {
1274 }
1278 /* Other classes need no special treatment. */
1280 }
1283 }
1285 /* Free tree node. */
1287 void
1289 {
1292 {
1302 }
1314 }
1315 \f
1316 /* Return a new node with the same contents as NODE except that its
1317 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1319 tree
1321 {
1322 tree t;
1339 {
1342 else
1343 {
1347 }
1350 {
1353 }
1354 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1356 {
1359 }
1361 {
1364 }
1366 {
1369 }
1370 }
1372 {
1374 /* The following is so that the debug code for
1375 the copy is different from the original type.
1376 The two statements usually duplicate each other
1377 (because they clear fields of the same union),
1378 but the optimizer should catch that. */
1382 /* Do not copy the values cache. */
1384 {
1387 }
1388 }
1390 {
1394 }
1396 {
1400 }
1403 }
1405 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1406 For example, this can copy a list made of TREE_LIST nodes. */
1408 tree
1410 {
1411 tree head;
1420 {
1424 }
1426 }
1428 \f
1429 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1430 INTEGER_CST with value CST and type TYPE. */
1432 static unsigned int
1434 {
1436 /* We need extra HWIs if CST is an unsigned integer with its
1437 upper bit set. */
1441 }
1443 /* Return a new INTEGER_CST with value CST and type TYPE. */
1445 static tree
1447 {
1453 {
1459 }
1462 {
1463 len--;
1467 }
1473 }
1475 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1477 static tree
1479 CXX_MEM_STAT_INFO)
1480 {
1492 }
1494 /* Create a constant tree that contains CST sign-extended to TYPE. */
1496 tree
1498 {
1499 /* Support legacy code. */
1504 }
1506 /* Create a constant tree that contains CST zero-extended to TYPE. */
1508 tree
1510 {
1512 }
1514 /* Create a constant tree that contains CST sign-extended to TYPE. */
1516 tree
1518 {
1521 }
1523 /* Constructs tree in type TYPE from with value given by CST. Signedness
1524 of CST is assumed to be the same as the signedness of TYPE. */
1526 tree
1528 {
1530 }
1532 /* We force the wide_int CST to the range of the type TYPE by sign or
1533 zero extending it. OVERFLOWABLE indicates if we are interested in
1534 overflow of the value, when >0 we are only interested in signed
1535 overflow, for <0 we are interested in any overflow. OVERFLOWED
1536 indicates whether overflow has already occurred. CONST_OVERFLOWED
1537 indicates whether constant overflow has already occurred. We force
1538 T's value to be within range of T's type (by setting to 0 or 1 all
1539 the bits outside the type's range). We set TREE_OVERFLOWED if,
1540 OVERFLOWED is nonzero,
1541 or OVERFLOWABLE is >0 and signed overflow occurs
1542 or OVERFLOWABLE is <0 and any overflow occurs
1543 We return a new tree node for the extended wide_int. The node
1544 is shared if no overflow flags are set. */
1547 tree
1550 {
1553 /* If we need to set overflow flags, return a new unshared node. */
1555 {
1559 {
1561 sign);
1562 tree t;
1565 else
1566 {
1569 {
1572 }
1574 }
1577 }
1578 }
1580 /* Else build a shared node. */
1582 }
1584 /* These are the hash table functions for the hash table of INTEGER_CST
1585 nodes of a sizetype. */
1587 /* Return the hash code X, an INTEGER_CST. */
1589 hashval_t
1591 {
1600 }
1602 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1603 is the same as that given by *Y, which is the same. */
1605 bool
1607 {
1621 }
1623 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1624 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1625 number of slots that can be cached for the type. */
1630 {
1632 /* Initialize cache. */
1634 {
1637 }
1640 {
1641 /* Create a new shared int. */
1644 }
1646 }
1648 /* Create an INT_CST node of TYPE and value CST.
1649 The returned node is always shared. For small integers we use a
1650 per-type vector cache, for larger ones we use a single hash table.
1651 The value is extended from its precision according to the sign of
1652 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1653 the upper bits and ensures that hashing and value equality based
1654 upon the underlying HOST_WIDE_INTs works without masking. */
1656 static tree
1658 {
1659 tree t;
1667 /* Verify that everything is canonical. */
1670 {
1675 }
1682 {
1683 /* Cache NULL pointer and zero bounds. */
1686 /* Cache upper bounds of pointers. */
1689 /* Cache 1 which is used for a non-zero range. */
1694 {
1696 /* Make sure no one is clobbering the shared constant. */
1700 }
1701 }
1703 {
1704 /* We just need to store a single HOST_WIDE_INT. */
1705 HOST_WIDE_INT hwi;
1708 else
1712 {
1715 /* Fallthru. */
1719 /* Ignore pointers, as they were already handled above. */
1723 /* Cache false or true. */
1732 {
1733 /* Cache [0, N). */
1737 }
1738 else
1739 {
1740 /* Cache [-1, N). */
1744 }
1752 }
1755 {
1757 /* Make sure no one is clobbering the shared constant. */
1764 }
1765 else
1766 {
1767 /* Use the cache of larger shared ints, using int_cst_node as
1768 a temporary. */
1776 {
1777 /* Insert this one into the hash table. */
1780 /* Make a new node for next time round. */
1782 }
1783 }
1784 }
1785 else
1786 {
1787 /* The value either hashes properly or we drop it on the floor
1788 for the gc to take care of. There will not be enough of them
1789 to worry about. */
1795 {
1796 /* Insert this one into the hash table. */
1799 }
1800 else
1802 }
1805 }
1807 hashval_t
1809 {
1817 }
1819 bool
1821 {
1828 }
1830 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1831 The elements must also have type TYPE. */
1833 tree
1835 {
1846 INSERT);
1848 {
1853 }
1855 }
1857 /* Create a constant tree with value VALUE in type TYPE. */
1859 tree
1861 {
1865 }
1867 /* Insert INTEGER_CST T into a cache of integer constants. And return
1868 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1869 is false, and T falls into the type's 'smaller values' range, there
1870 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1871 or the value is large, should an existing entry exist, it is
1872 returned (rather than inserting T). */
1874 tree
1876 {
1884 /* The caching indices here must match those in
1885 wide_int_to_type_1. */
1887 {
1890 /* Fallthru. */
1894 {
1902 }
1906 /* Cache false or true. */
1915 {
1916 /* Cache 0..N */
1919 /* This is a little hokie, but if the prec is smaller than
1920 what is necessary to hold param_integer_share_limit, then the
1921 obvious test will not get the correct answer. */
1923 {
1927 }
1930 }
1931 else
1932 {
1933 /* Cache -1..N */
1939 {
1941 {
1944 }
1947 }
1948 }
1952 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1953 members. */
1958 }
1961 {
1962 /* Look for it in the type's vector of small shared ints. */
1964 {
1967 }
1970 {
1973 }
1974 else
1976 }
1977 else
1978 {
1979 /* Use the cache of larger shared ints. */
1982 {
1983 /* If there is already an entry for the number verify it's the
1984 same value. */
1986 /* And return the cached value. */
1988 }
1989 else
1990 /* Otherwise insert this one into the hash table. */
1992 }
1995 }
1998 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1999 and the rest are zeros. */
2001 tree
2003 {
2008 }
2010 /* Checks that X is integer constant that can be expressed in (unsigned)
2011 HOST_WIDE_INT without loss of precision. */
2013 bool
2015 {
2018 }
2020 /* Build a newly constructed VECTOR_CST with the given values of
2021 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2023 tree
2026 {
2028 tree t;
2044 }
2046 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2047 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2049 tree
2051 {
2056 tree value;
2058 /* We can't construct a VECTOR_CST for a variable number of elements. */
2062 {
2064 {
2065 /* If NELTS is constant then this must be too. */
2069 }
2070 else
2072 }
2077 }
2079 /* Build a vector of type VECTYPE where all the elements are SCs. */
2080 tree
2082 {
2088 /* Verify that the vector type is suitable for SC. Note that there
2089 is some inconsistency in the type-system with respect to restrict
2090 qualifications of pointers. Vector types always have a main-variant
2091 element type and the qualification is applied to the vector-type.
2092 So TREE_TYPE (vector-type) does not return a properly qualified
2093 vector element-type. */
2098 {
2102 }
2105 else
2106 {
2112 }
2113 }
2115 /* If TYPE is not a vector type, just return SC, otherwise return
2116 build_vector_from_val (TYPE, SC). */
2118 tree
2120 {
2125 }
2127 /* Build a vector series of type TYPE in which element I has the value
2128 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2129 and a VEC_SERIES_EXPR otherwise. */
2131 tree
2133 {
2137 {
2147 }
2149 }
2151 /* Return a vector with the same number of units and number of bits
2152 as VEC_TYPE, but in which the elements are a linear series of unsigned
2153 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2155 tree
2157 {
2162 {
2163 index_elt_type = build_nonstandard_integer_type
2166 }
2172 }
2174 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2175 elements are A and the rest are B. */
2177 tree
2179 {
2182 /* Optimize the constant case. */
2189 }
2191 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2192 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2194 void
2196 {
2198 tree val;
2204 {
2205 /* Mostly ctors will have elts that don't have side-effects, so
2206 the usual case is to scan all the elements. Hence a single
2207 loop for both const and side effects, rather than one loop
2208 each (with early outs). */
2213 }
2217 }
2219 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2220 CONSTRUCTOR C. */
2222 void
2224 {
2226 tree val;
2232 {
2237 }
2238 }
2240 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2241 are in the vec pointed to by VALS. */
2242 tree
2244 {
2253 }
2255 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2256 INDEX and VALUE. */
2257 tree
2259 {
2267 }
2270 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2271 are in a list pointed to by VALS. */
2272 tree
2274 {
2275 tree t;
2279 {
2283 }
2286 }
2288 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2289 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2290 fields in the constructor remain null. */
2292 tree
2294 {
2301 }
2303 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2304 of elements, provided as index/value pairs. */
2306 tree
2308 {
2315 {
2319 }
2322 }
2324 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2326 tree
2328 {
2332 }
2334 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2336 tree
2338 {
2339 tree v;
2349 }
2351 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2353 tree
2355 {
2356 tree v;
2360 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2361 Consider doing it via real_convert now. */
2371 }
2373 /* Like build_real, but first truncate D to the type. */
2375 tree
2377 {
2379 }
2381 /* Return a new REAL_CST node whose type is TYPE
2382 and whose value is the integer value of the INTEGER_CST node I. */
2384 REAL_VALUE_TYPE
2386 {
2387 REAL_VALUE_TYPE d;
2389 /* Clear all bits of the real value type so that we can later do
2390 bitwise comparisons to see if two values are the same. */
2396 }
2398 /* Given a tree representing an integer constant I, return a tree
2399 representing the same value as a floating-point constant of type TYPE. */
2401 tree
2403 {
2404 tree v;
2411 }
2413 /* Return a new REAL_CST node whose type is TYPE
2414 and whose value is the integer value I which has sign SGN. */
2416 tree
2418 {
2419 REAL_VALUE_TYPE d;
2421 /* Clear all bits of the real value type so that we can later do
2422 bitwise comparisons to see if two values are the same. */
2427 }
2429 /* Return a newly constructed STRING_CST node whose value is the LEN
2430 characters at STR when STR is nonnull, or all zeros otherwise.
2431 Note that for a C string literal, LEN should include the trailing NUL.
2432 The TREE_TYPE is not initialized. */
2434 tree
2436 {
2437 /* Do not waste bytes provided by padding of struct tree_string. */
2450 else
2455 }
2457 /* Return a newly constructed COMPLEX_CST node whose value is
2458 specified by the real and imaginary parts REAL and IMAG.
2459 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2460 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2462 tree
2464 {
2475 }
2477 /* Build a complex (inf +- 0i), such as for the result of cproj.
2478 TYPE is the complex tree type of the result. If NEG is true, the
2479 imaginary zero is negative. */
2481 tree
2483 {
2490 }
2492 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2493 element is set to 1. In particular, this is 1 + i for complex types. */
2495 tree
2497 {
2499 {
2502 }
2503 else
2505 }
2507 /* Return a constant of arithmetic type TYPE which is the
2508 multiplicative identity of the set TYPE. */
2510 tree
2512 {
2514 {
2524 /* We can only generate 1 for accum types. */
2529 {
2533 }
2542 }
2543 }
2545 /* Return an integer of type TYPE containing all 1's in as much precision as
2546 it contains, or a complex or vector whose subparts are such integers. */
2548 tree
2550 {
2552 {
2555 }
2556 else
2558 }
2560 /* Return a constant of arithmetic type TYPE which is the
2561 opposite of the multiplicative identity of the set TYPE. */
2563 tree
2565 {
2567 {
2577 /* We can only generate 1 for accum types. */
2584 {
2588 }
2597 }
2598 }
2600 /* Build 0 constant of type TYPE. This is used by constructor folding
2601 and thus the constant should be represented in memory by
2602 zero(es). */
2604 tree
2606 {
2608 {
2621 {
2625 }
2628 {
2632 }
2638 }
2639 }
2642 /* Build a BINFO with LEN language slots. */
2644 tree
2646 {
2647 tree t;
2662 }
2664 /* Create a CASE_LABEL_EXPR tree node and return it. */
2666 tree
2668 {
2680 }
2682 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2683 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2684 The latter determines the length of the HOST_WIDE_INT vector. */
2686 tree
2688 {
2689 tree t;
2701 /* to_offset can only be applied to trees that are offset_int-sized
2702 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2703 must be exactly the precision of offset_int and so LEN is correct. */
2706 else
2712 }
2714 /* Build a newly constructed TREE_VEC node of length LEN. */
2716 tree
2718 {
2719 tree t;
2730 }
2732 /* Grow a TREE_VEC node to new length LEN. */
2734 tree
2736 {
2752 }
2753 \f
2754 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2755 fixed, and scalar, complex or vector. */
2757 bool
2759 {
2763 }
2765 /* Return 1 if EXPR is the integer constant zero or a complex constant
2766 of zero, or a location wrapper for such a constant. */
2768 bool
2770 {
2774 {
2786 }
2787 }
2789 /* Return 1 if EXPR is the integer constant one or the corresponding
2790 complex constant, or a location wrapper for such a constant. */
2792 bool
2794 {
2798 {
2810 }
2811 }
2813 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2814 return 1 if every piece is the integer constant one.
2815 Also return 1 for location wrappers for such a constant. */
2817 bool
2819 {
2825 else
2827 }
2829 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2830 it contains, or a complex or vector whose subparts are such integers,
2831 or a location wrapper for such a constant. */
2833 bool
2835 {
2853 }
2855 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2856 for such a constant. */
2858 bool
2860 {
2866 else
2868 }
2870 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2871 one bit on), or a location wrapper for such a constant. */
2873 bool
2875 {
2887 }
2889 /* Return 1 if EXPR is an integer constant other than zero or a
2890 complex constant other than zero, or a location wrapper for such a
2891 constant. */
2893 bool
2895 {
2903 }
2905 /* Return 1 if EXPR is the integer constant one. For vector,
2906 return 1 if every piece is the integer constant minus one
2907 (representing the value TRUE).
2908 Also return 1 for location wrappers for such a constant. */
2910 bool
2912 {
2918 }
2920 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2921 for such a constant. */
2923 bool
2925 {
2930 }
2932 /* Return the power of two represented by a tree node known to be a
2933 power of two. */
2935 int
2937 {
2942 }
2944 /* Similar, but return the largest integer Y such that 2 ** Y is less
2945 than or equal to EXPR. */
2947 int
2949 {
2954 }
2956 /* Return number of known trailing zero bits in EXPR, or, if the value of
2957 EXPR is known to be zero, the precision of it's type. */
2959 unsigned int
2961 {
2968 {
2989 /* Second operand is sizetype, which could be in theory
2990 wider than pointer's precision. Make sure we never
2991 return more than prec. */
3006 {
3009 }
3014 {
3019 }
3028 {
3031 {
3036 }
3037 }
3039 CASE_CONVERT:
3057 {
3060 }
3064 }
3065 }
3067 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
3068 decimal float constants, so don't return 1 for them.
3069 Also return 1 for location wrappers around such a constant. */
3071 bool
3073 {
3077 {
3085 {
3086 /* Don't simply check for a duplicate because the predicate
3087 accepts both +0.0 and -0.0. */
3093 }
3096 }
3097 }
3099 /* Return 1 if EXPR is the real constant one in real or complex form.
3100 Trailing zeroes matter for decimal float constants, so don't return
3101 1 for them.
3102 Also return 1 for location wrappers around such a constant. */
3104 bool
3106 {
3110 {
3123 }
3124 }
3126 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3127 matter for decimal float constants, so don't return 1 for them.
3128 Also return 1 for location wrappers around such a constant. */
3130 bool
3132 {
3136 {
3149 }
3150 }
3152 /* Nonzero if EXP is a constant or a cast of a constant. */
3154 bool
3156 {
3157 /* This is not quite the same as STRIP_NOPS. It does more. */
3162 }
3164 /* Return true if T holds a polynomial pointer difference, storing it in
3165 *VALUE if so. A true return means that T's precision is no greater
3166 than 64 bits, which is the largest address space we support, so *VALUE
3167 never loses precision. However, the signedness of the result does
3168 not necessarily match the signedness of T: sometimes an unsigned type
3169 like sizetype is used to encode a value that is actually negative. */
3171 bool
3173 {
3177 {
3182 }
3184 {
3191 }
3193 }
3195 poly_int64
3197 {
3202 }
3204 poly_uint64
3206 {
3211 }
3212 \f
3213 /* Return first list element whose TREE_VALUE is ELEM.
3214 Return 0 if ELEM is not in LIST. */
3216 tree
3218 {
3220 {
3224 }
3226 }
3228 /* Return first list element whose TREE_PURPOSE is ELEM.
3229 Return 0 if ELEM is not in LIST. */
3231 tree
3233 {
3235 {
3239 }
3241 }
3243 /* Return true if ELEM is in V. */
3245 bool
3247 {
3249 tree t;
3254 }
3256 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3257 NULL_TREE. */
3259 tree
3261 {
3265 }
3267 /* Return nonzero if ELEM is part of the chain CHAIN. */
3269 bool
3271 {
3273 {
3277 }
3280 }
3282 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3283 We expect a null pointer to mark the end of the chain.
3284 This is the Lisp primitive `length'. */
3286 int
3288 {
3290 #ifdef ENABLE_TREE_CHECKING
3292 #endif
3296 {
3298 #ifdef ENABLE_TREE_CHECKING
3302 #endif
3303 len++;
3304 }
3307 }
3309 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3310 UNION_TYPE TYPE, or NULL_TREE if none. */
3312 tree
3314 {
3319 }
3321 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3322 UNION_TYPE TYPE, or NULL_TREE if none. */
3324 tree
3326 {
3330 {
3335 }
3338 }
3340 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3341 by modifying the last node in chain 1 to point to chain 2.
3342 This is the Lisp primitive `nconc'. */
3344 tree
3346 {
3347 tree t1;
3358 #ifdef ENABLE_TREE_CHECKING
3359 {
3360 tree t2;
3363 }
3364 #endif
3367 }
3369 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3371 tree
3373 {
3374 tree next;
3379 }
3381 /* Reverse the order of elements in the chain T,
3382 and return the new head of the chain (old last element). */
3384 tree
3386 {
3389 {
3390 /* We shouldn't be using this function to reverse BLOCK chains; we
3391 have blocks_nreverse for that. */
3396 }
3398 }
3399 \f
3400 /* Return a newly created TREE_LIST node whose
3401 purpose and value fields are PARM and VALUE. */
3403 tree
3405 {
3410 }
3412 /* Build a chain of TREE_LIST nodes from a vector. */
3414 tree
3416 {
3420 tree t;
3422 {
3425 }
3427 }
3429 /* Return a newly created TREE_LIST node whose
3430 purpose and value fields are PURPOSE and VALUE
3431 and whose TREE_CHAIN is CHAIN. */
3433 tree
3435 {
3436 tree node;
3448 }
3450 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3451 trees. */
3455 {
3459 tree val;
3465 }
3466 \f
3467 /* Return the size nominally occupied by an object of type TYPE
3468 when it resides in memory. The value is measured in units of bytes,
3469 and its data type is that normally used for type sizes
3470 (which is the first type created by make_signed_type or
3471 make_unsigned_type). */
3473 tree
3475 {
3476 tree t;
3485 {
3488 }
3491 }
3493 /* Return the size of TYPE (in bytes) as a wide integer
3494 or return -1 if the size can vary or is larger than an integer. */
3496 HOST_WIDE_INT
3498 {
3499 tree t;
3509 else
3511 }
3513 /* Return the maximum size of TYPE (in bytes) as a wide integer
3514 or return -1 if the size can vary or is larger than an integer. */
3516 HOST_WIDE_INT
3518 {
3520 tree size_tree;
3522 /* If this is an array type, check for a possible MAX_SIZE attached. */
3525 {
3530 }
3532 /* If we still haven't been able to get a size, see if the language
3533 can compute a maximum size. */
3536 {
3541 }
3544 }
3545 \f
3546 /* Return the bit position of FIELD, in bits from the start of the record.
3547 This is a tree of type bitsizetype. */
3549 tree
3551 {
3554 }
3555 \f
3556 /* Return the byte position of FIELD, in bytes from the start of the record.
3557 This is a tree of type sizetype. */
3559 tree
3561 {
3564 }
3566 /* Likewise, but return as an integer. It must be representable in
3567 that way (since it could be a signed value, we don't have the
3568 option of returning -1 like int_size_in_byte can. */
3570 HOST_WIDE_INT
3572 {
3574 }
3575 \f
3576 /* Return, as a tree node, the number of elements for TYPE (which is an
3577 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3579 tree
3581 {
3584 /* If they did it with unspecified bounds, then we should have already
3585 given an error about it before we got here. */
3593 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3595 {
3596 /* zero sized arrays are represented from C FE as complete types with
3597 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3598 them as min 0, max -1. */
3605 }
3608 ? max
3610 }
3611 \f
3612 /* If arg is static -- a reference to an object in static storage -- then
3613 return the object. This is not the same as the C meaning of `static'.
3614 If arg isn't static, return NULL. */
3616 tree
3618 {
3620 {
3622 /* Nested functions are static, even though taking their address will
3623 involve a trampoline as we unnest the nested function and create
3624 the trampoline on the tree level. */
3645 /* If the thing being referenced is not a field, then it is
3646 something language specific. */
3649 /* If we are referencing a bitfield, we can't evaluate an
3650 ADDR_EXPR at compile time and so it isn't a constant. */
3667 else
3675 }
3676 }
3678 \f
3681 /* Return whether OP is a DECL whose address is function-invariant. */
3683 bool
3685 {
3686 /* The conditions below are slightly less strict than the one in
3687 staticp. */
3690 {
3713 }
3716 }
3718 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3720 bool
3722 {
3723 /* The conditions below are slightly less strict than the one in
3724 staticp. */
3727 {
3747 }
3750 }
3753 /* Return true if T is function-invariant (internal function, does
3754 not handle arithmetic; that's handled in skip_simple_arithmetic and
3755 tree_invariant_p). */
3757 static bool
3759 {
3760 tree op;
3767 {
3774 {
3776 {
3791 }
3793 }
3799 }
3802 }
3804 /* Return true if T is function-invariant. */
3806 bool
3808 {
3811 }
3813 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3814 Do this to any expression which may be used in more than one place,
3815 but must be evaluated only once.
3817 Normally, expand_expr would reevaluate the expression each time.
3818 Calling save_expr produces something that is evaluated and recorded
3819 the first time expand_expr is called on it. Subsequent calls to
3820 expand_expr just reuse the recorded value.
3822 The call to expand_expr that generates code that actually computes
3823 the value is the first call *at compile time*. Subsequent calls
3824 *at compile time* generate code to use the saved value.
3825 This produces correct result provided that *at run time* control
3826 always flows through the insns made by the first expand_expr
3827 before reaching the other places where the save_expr was evaluated.
3828 You, the caller of save_expr, must make sure this is so.
3830 Constants, and certain read-only nodes, are returned with no
3831 SAVE_EXPR because that is safe. Expressions containing placeholders
3832 are not touched; see tree.def for an explanation of what these
3833 are used for. */
3835 tree
3837 {
3838 tree inner;
3840 /* If the tree evaluates to a constant, then we don't want to hide that
3841 fact (i.e. this allows further folding, and direct checks for constants).
3842 However, a read-only object that has side effects cannot be bypassed.
3843 Since it is no problem to reevaluate literals, we just return the
3844 literal node. */
3852 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3853 it means that the size or offset of some field of an object depends on
3854 the value within another field.
3856 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3857 and some variable since it would then need to be both evaluated once and
3858 evaluated more than once. Front-ends must assure this case cannot
3859 happen by surrounding any such subexpressions in their own SAVE_EXPR
3860 and forcing evaluation at the proper time. */
3866 /* This expression might be placed ahead of a jump to ensure that the
3867 value was computed on both sides of the jump. So make sure it isn't
3868 eliminated as dead. */
3871 }
3873 /* Look inside EXPR into any simple arithmetic operations. Return the
3874 outermost non-arithmetic or non-invariant node. */
3876 tree
3878 {
3879 /* We don't care about whether this can be used as an lvalue in this
3880 context. */
3884 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3885 a constant, it will be more efficient to not make another SAVE_EXPR since
3886 it will allow better simplification and GCSE will be able to merge the
3887 computations if they actually occur. */
3889 {
3893 {
3898 else
3900 }
3901 else
3903 }
3906 }
3908 /* Look inside EXPR into simple arithmetic operations involving constants.
3909 Return the outermost non-arithmetic or non-constant node. */
3911 tree
3913 {
3918 {
3922 {
3927 else
3929 }
3930 else
3932 }
3935 }
3937 /* Return which tree structure is used by T. */
3939 enum tree_node_structure_enum
3941 {
3944 }
3946 /* Set various status flags when building a CALL_EXPR object T. */
3948 static void
3950 {
3955 /* Calls have side-effects, except those to const or pure functions. */
3958 /* Propagate TREE_READONLY of arguments for const functions. */
3964 {
3970 }
3974 }
3975 \f
3976 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3977 size or offset that depends on a field within a record. */
3979 bool
3981 {
3992 {
3994 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3995 position computations since they will be converted into a
3996 WITH_RECORD_EXPR involving the reference, which will assume
3997 here will be valid. */
4011 {
4013 /* Ignoring the first operand isn't quite right, but works best. */
4022 /* The save_expr function never wraps anything containing
4023 a PLACEHOLDER_EXPR. */
4028 }
4031 {
4039 }
4043 {
4045 {
4046 const_tree arg;
4047 const_call_expr_arg_iterator iter;
4052 }
4055 }
4059 }
4061 }
4063 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4064 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4065 field positions. */
4067 static bool
4069 {
4070 /* If the size contains a placeholder or the parent type (component type in
4071 the case of arrays) type involves a placeholder, this type does. */
4079 /* Now do type-specific checks. Note that the last part of the check above
4080 greatly limits what we have to do below. */
4082 {
4100 /* Here we just check the bounds. */
4105 /* We have already checked the component type above, so just check
4106 the domain type. Flexible array members have a null domain. */
4113 {
4114 tree field;
4125 }
4129 }
4130 }
4132 /* Wrapper around above function used to cache its result. */
4134 bool
4136 {
4139 /* If the contains_placeholder_bits field has been initialized,
4140 then we know the answer. */
4144 /* Indicate that we've seen this type node, and the answer is false.
4145 This is what we want to return if we run into recursion via fields. */
4148 /* Compute the real value. */
4151 /* Store the real value. */
4155 }
4156 \f
4157 /* Push tree EXP onto vector QUEUE if it is not already present. */
4159 static void
4161 {
4163 tree iter;
4171 }
4173 /* Given a tree EXP, find all occurrences of references to fields
4174 in a PLACEHOLDER_EXPR and place them in vector REFS without
4175 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4176 we assume here that EXP contains only arithmetic expressions
4177 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4178 argument list. */
4180 void
4182 {
4184 tree inner;
4187 /* We handle TREE_LIST and COMPONENT_REF separately. */
4189 {
4192 }
4194 {
4198 ;
4202 else
4204 }
4205 else
4207 {
4212 /* Variables allocated to static storage can stay. */
4218 /* This is the pattern built in ada/make_aligning_type. */
4221 {
4224 }
4226 /* Fall through. */
4244 }
4245 }
4247 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4248 return a tree with all occurrences of references to F in a
4249 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4250 CONST_DECLs. Note that we assume here that EXP contains only
4251 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4252 occurring only in their argument list. */
4254 tree
4256 {
4259 tree new_tree;
4261 /* We handle TREE_LIST and COMPONENT_REF separately. */
4263 {
4270 }
4272 {
4273 tree inner;
4275 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4276 and it is the right field, replace it with R. */
4280 ;
4282 /* The field. */
4288 /* If this expression hasn't been completed let, leave it alone. */
4296 new_tree
4298 }
4299 else
4301 {
4308 else
4315 /* Fall through. */
4323 {
4368 new_tree
4374 }
4378 {
4383 /* If we are trying to replace F with a constant or with another
4384 instance of one of the arguments of the call, inline back
4385 functions which do nothing else than computing a value from
4386 the arguments they are passed. This makes it possible to
4387 fold partially or entirely the replacement expression. */
4389 {
4393 else
4396 {
4399 }
4401 {
4405 }
4406 }
4409 {
4413 {
4417 }
4418 }
4421 {
4425 }
4426 else
4428 }
4433 }
4441 }
4443 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4444 for it within OBJ, a tree that is an object or a chain of references. */
4446 tree
4448 {
4451 tree new_tree;
4453 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4454 in the chain of OBJ. */
4456 {
4458 tree elt;
4488 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4489 survives until RTL generation, there will be an error. */
4491 }
4493 /* TREE_LIST is special because we need to look at TREE_VALUE
4494 and TREE_CHAIN, not TREE_OPERANDS. */
4496 {
4503 }
4504 else
4506 {
4519 {
4564 new_tree
4570 }
4574 {
4580 {
4584 {
4588 }
4589 }
4592 {
4596 }
4597 else
4599 }
4604 }
4612 }
4613 \f
4615 /* Subroutine of stabilize_reference; this is called for subtrees of
4616 references. Any expression with side-effects must be put in a SAVE_EXPR
4617 to ensure that it is only evaluated once.
4619 We don't put SAVE_EXPR nodes around everything, because assigning very
4620 simple expressions to temporaries causes us to miss good opportunities
4621 for optimizations. Among other things, the opportunity to fold in the
4622 addition of a constant into an addressing mode often gets lost, e.g.
4623 "y[i+1] += x;". In general, we take the approach that we should not make
4624 an assignment unless we are forced into it - i.e., that any non-side effect
4625 operator should be allowed, and that cse should take care of coalescing
4626 multiple utterances of the same expression should that prove fruitful. */
4628 static tree
4630 {
4631 tree result;
4634 /* We cannot ignore const expressions because it might be a reference
4635 to a const array but whose index contains side-effects. But we can
4636 ignore things that are actual constant or that already have been
4637 handled by this function. */
4643 {
4645 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4646 have side-effects. */
4649 /* FALLTHRU */
4657 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4658 so that it will only be evaluated once. */
4659 /* The reference (r) and comparison (<) classes could be handled as
4660 below, but it is generally faster to only evaluate them once. */
4666 /* Constants need no processing. In fact, we should never reach
4667 here. */
4671 /* Division is slow and tends to be compiled with jumps,
4672 especially the division by powers of 2 that is often
4673 found inside of an array reference. So do it just once. */
4679 /* Recursively stabilize each operand. */
4685 /* Recursively stabilize each operand. */
4691 }
4699 }
4701 /* Stabilize a reference so that we can use it any number of times
4702 without causing its operands to be evaluated more than once.
4703 Returns the stabilized reference. This works by means of save_expr,
4704 so see the caveats in the comments about save_expr.
4706 Also allows conversion expressions whose operands are references.
4707 Any other kind of expression is returned unchanged. */
4709 tree
4711 {
4712 tree result;
4716 {
4720 /* No action is needed in this case. */
4723 CASE_CONVERT:
4762 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4763 it wouldn't be ignored. This matters when dealing with
4764 volatiles. */
4767 /* If arg isn't a kind of lvalue we recognize, make no change.
4768 Caller should recognize the error for an invalid lvalue. */
4774 }
4782 }
4783 \f
4784 /* Low-level constructors for expressions. */
4786 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4787 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4789 void
4791 {
4792 tree node;
4797 /* We started out assuming this address is both invariant and constant, but
4798 does not have side effects. Now go down any handled components and see if
4799 any of them involve offsets that are either non-constant or non-invariant.
4800 Also check for side-effects.
4802 ??? Note that this code makes no attempt to deal with the case where
4803 taking the address of something causes a copy due to misalignment. */
4805 #define UPDATE_FLAGS(NODE) \
4806 do { tree _node = (NODE); \
4807 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4808 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4812 {
4813 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4814 array reference (probably made temporarily by the G++ front end),
4815 so ignore all the operands. */
4819 {
4825 }
4826 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4827 FIELD_DECL, apparently. The G++ front end can put something else
4828 there, at least temporarily. */
4831 {
4834 }
4835 }
4839 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4840 the address, since &(*a)->b is a form of addition. If it's a constant, the
4841 address is constant too. If it's a decl, its address is constant if the
4842 decl is static. Everything else is not constant and, furthermore,
4843 taking the address of a volatile variable is not volatile. */
4848 ;
4851 else
4852 {
4855 }
4860 #undef UPDATE_FLAGS
4861 }
4863 /* Build an expression of code CODE, data type TYPE, and operands as
4864 specified. Expressions and reference nodes can be created this way.
4865 Constants, decls, types and misc nodes cannot be.
4867 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4868 enough for all extant tree codes. */
4870 tree
4872 {
4873 tree t;
4881 }
4883 tree
4885 {
4887 tree t;
4903 {
4906 }
4909 {
4912 }
4914 {
4916 /* All of these have side-effects, no matter what their
4917 operands are. */
4923 /* Whether a dereference is readonly has nothing to do with whether
4924 its operand is readonly. */
4942 }
4945 }
4947 #define PROCESS_ARG(N) \
4948 do { \
4949 TREE_OPERAND (t, N) = arg##N; \
4950 if (arg##N &&!TYPE_P (arg##N)) \
4951 { \
4952 if (TREE_SIDE_EFFECTS (arg##N)) \
4953 side_effects = 1; \
4954 if (!TREE_READONLY (arg##N) \
4955 && !CONSTANT_CLASS_P (arg##N)) \
4956 (void) (read_only = 0); \
4957 if (!TREE_CONSTANT (arg##N)) \
4958 (void) (constant = 0); \
4959 } \
4960 } while (0)
4962 tree
4964 {
4966 tree t;
4972 /* When sizetype precision doesn't match that of pointers
4973 we need to be able to build explicit extensions or truncations
4974 of the offset argument. */
4986 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4987 result based on those same flags for the arguments. But if the
4988 arguments aren't really even `tree' expressions, we shouldn't be trying
4989 to do this. */
4991 /* Expressions without side effects may be constant if their
4992 arguments are as well. */
4999 {
5013 }
5020 {
5022 {
5026 }
5027 }
5028 else
5029 {
5031 /* Don't mark X / 0 as constant. */
5036 }
5039 }
5042 tree
5044 tree arg2 MEM_STAT_DECL)
5045 {
5047 tree t;
5057 /* As a special exception, if COND_EXPR has NULL branches, we
5058 assume that it is a gimple statement and always consider
5059 it to have side effects. */
5065 else
5081 }
5083 tree
5086 {
5088 tree t;
5108 }
5110 tree
5113 {
5115 tree t;
5132 {
5134 {
5138 }
5139 }
5140 else
5146 }
5148 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5149 on the pointer PTR. */
5151 tree
5153 {
5156 tree tem;
5157 /* For convenience allow addresses that collapse to a simple base
5158 and offset. */
5162 {
5166 {
5169 }
5170 else
5173 }
5178 }
5180 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5182 poly_offset_int
5184 {
5186 SIGNED);
5187 }
5189 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5190 offsetted by OFFSET units. */
5192 tree
5194 {
5201 }
5203 /* Similar except don't specify the TREE_TYPE
5204 and leave the TREE_SIDE_EFFECTS as 0.
5205 It is permissible for arguments to be null,
5206 or even garbage if their values do not matter. */
5208 tree
5210 {
5211 tree t;
5228 }
5230 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5231 tree vec. */
5233 tree
5235 {
5245 }
5246 \f
5247 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5248 and data type TYPE.
5249 We do NOT enter this node in any sort of symbol table.
5251 LOC is the location of the decl.
5253 layout_decl is used to set up the decl's storage layout.
5254 Other slots are initialized to 0 or null pointers. */
5256 tree
5258 tree type MEM_STAT_DECL)
5259 {
5260 tree t;
5265 /* if (type == error_mark_node)
5266 type = integer_type_node; */
5267 /* That is not done, deliberately, so that having error_mark_node
5268 as the type can suppress useless errors in the use of this variable. */
5277 }
5279 /* Builds and returns function declaration with NAME and TYPE. */
5281 tree
5283 {
5293 }
5297 /* Builds a new translation-unit decl with name NAME, queues it in the
5298 global list of translation-unit decls and returns it. */
5300 tree
5302 {
5308 }
5310 \f
5311 /* BLOCK nodes are used to represent the structure of binding contours
5312 and declarations, once those contours have been exited and their contents
5313 compiled. This information is used for outputting debugging info. */
5315 tree
5317 {
5325 }
5327 \f
5328 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5330 LOC is the location to use in tree T. */
5332 void
5334 {
5338 {
5342 }
5343 }
5345 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5346 UNKNOWN_LOCATION. */
5348 void
5350 {
5354 }
5355 \f
5356 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5357 of the various TYPE_QUAL values. */
5359 static void
5361 {
5367 }
5369 /* Returns true iff CAND and BASE have equivalent language-specific
5370 qualifiers. */
5372 bool
5374 {
5377 /* type_hash_eq currently only applies to these types. */
5382 }
5384 /* This function checks to see if TYPE matches the size one of the built-in
5385 atomic types, and returns that core atomic type. */
5387 static tree
5389 {
5390 tree base_atomic_type;
5392 /* Only handle complete types. */
5397 {
5420 }
5423 }
5425 /* Returns true iff unqualified CAND and BASE are equivalent. */
5427 bool
5429 {
5431 /* Apparently this is needed for Objective-C. */
5436 /* Check alignment. */
5440 /* Atomic types increase minimal alignment. We must to do so as well
5441 or we get duplicated canonical types. See PR88686. */
5443 {
5444 /* See if this object can map to a basic atomic type. */
5448 }
5450 }
5452 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5454 bool
5456 {
5460 }
5462 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5464 static bool
5466 {
5469 /* Apparently this is needed for Objective-C. */
5471 /* Check alignment. */
5473 /* Check this is a user-aligned type as build_aligned_type
5474 would create. */
5479 }
5481 /* Return a version of the TYPE, qualified as indicated by the
5482 TYPE_QUALS, if one exists. If no qualified version exists yet,
5483 return NULL_TREE. */
5485 tree
5487 {
5495 /* Search the chain of variants to see if there is already one there just
5496 like the one we need to have. If so, use that existing one. We must
5497 preserve the TYPE_NAME, since there is code that depends on this. */
5500 {
5501 /* Put the found variant at the head of the variant list so
5502 frequently searched variants get found faster. The C++ FE
5503 benefits greatly from this. */
5509 }
5512 }
5514 /* Like get_qualified_type, but creates the type if it does not
5515 exist. This function never returns NULL_TREE. */
5517 tree
5519 {
5520 tree t;
5522 /* See if we already have the appropriate qualified variant. */
5525 /* If not, build it. */
5527 {
5532 {
5533 /* See if this object can map to a basic atomic type. */
5536 {
5537 /* Ensure the alignment of this type is compatible with
5538 the required alignment of the atomic type. */
5541 }
5542 }
5545 /* Propagate structural equality. */
5548 /* Build the underlying canonical type, since it is different
5549 from TYPE. */
5550 {
5553 }
5554 else
5555 /* T is its own canonical type. */
5558 }
5561 }
5563 /* Create a variant of type T with alignment ALIGN. */
5565 tree
5567 {
5568 tree t;
5583 }
5585 /* Create a new distinct copy of TYPE. The new type is made its own
5586 MAIN_VARIANT. If TYPE requires structural equality checks, the
5587 resulting type requires structural equality checks; otherwise, its
5588 TYPE_CANONICAL points to itself. */
5590 tree
5592 {
5598 /* Set the canonical type either to a new equivalence class, or
5599 propagate the need for structural equality checks. */
5602 else
5605 /* Make it its own variant. */
5609 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5610 whose TREE_TYPE is not t. This can also happen in the Ada
5611 frontend when using subtypes. */
5614 }
5616 /* Create a new variant of TYPE, equivalent but distinct. This is so
5617 the caller can modify it. TYPE_CANONICAL for the return type will
5618 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5619 are considered equal by the language itself (or that both types
5620 require structural equality checks). */
5622 tree
5624 {
5629 /* Since we're building a variant, assume that it is a non-semantic
5630 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5632 /* Type variants have no alias set defined. */
5635 /* Add the new type to the chain of variants of TYPE. */
5641 }
5642 \f
5643 /* Return true if the from tree in both tree maps are equal. */
5645 int
5647 {
5651 }
5653 /* Hash a from tree in a tree_base_map. */
5655 unsigned int
5657 {
5659 }
5661 /* Return true if this tree map structure is marked for garbage collection
5662 purposes. We simply return true if the from tree is marked, so that this
5663 structure goes away when the from tree goes away. */
5665 int
5667 {
5669 }
5671 /* Hash a from tree in a tree_map. */
5673 unsigned int
5675 {
5677 }
5679 /* Hash a from tree in a tree_decl_map. */
5681 unsigned int
5683 {
5685 }
5687 /* Return the initialization priority for DECL. */
5689 priority_type
5691 {
5696 return
5698 }
5700 /* Return the finalization priority for DECL. */
5702 priority_type
5704 {
5709 return
5711 }
5713 /* Set the initialization priority for DECL to PRIORITY. */
5715 void
5717 {
5721 {
5725 }
5728 else
5731 }
5733 /* Set the finalization priority for DECL to PRIORITY. */
5735 void
5737 {
5741 {
5745 }
5746 else
5749 }
5751 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5753 static void
5755 {
5760 }
5762 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5764 static void
5766 {
5771 }
5773 /* Lookup a debug expression for FROM, and return it if we find one. */
5775 tree
5777 {
5785 }
5787 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5789 void
5791 {
5798 }
5800 /* Lookup a value expression for FROM, and return it if we find one. */
5802 tree
5804 {
5812 }
5814 /* Insert a mapping FROM->TO in the value expression hashtable. */
5816 void
5818 {
5825 }
5827 /* Lookup a vector of debug arguments for FROM, and return it if we
5828 find one. */
5832 {
5843 }
5845 /* Insert a mapping FROM->empty vector of debug arguments in the value
5846 expression hashtable. */
5850 {
5865 }
5867 /* Hashing of types so that we don't make duplicates.
5868 The entry point is `type_hash_canon'. */
5870 /* Generate the default hash code for TYPE. This is designed for
5871 speed, rather than maximum entropy. */
5873 hashval_t
5875 {
5884 /* Just the identifier is adequate to distinguish. */
5888 {
5891 /* FALLTHROUGH. */
5903 {
5907 {
5910 }
5911 }
5915 {
5922 }
5926 {
5930 }
5938 }
5941 }
5943 /* These are the Hashtable callback functions. */
5945 /* Returns true iff the types are equivalent. */
5947 bool
5949 {
5950 /* First test the things that are the same for all types. */
5960 /* Be careful about comparing arrays before and after the element type
5961 has been completed; don't compare TYPE_ALIGN unless both types are
5962 complete. */
5969 {
5992 /* fall through */
6024 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6025 where the flag should be inherited from the element type
6026 and can change after ARRAY_TYPEs are created; on non-aggregates
6027 compare it and hash it, scalars will never have that flag set
6028 and we need to differentiate between arrays created by different
6029 front-ends or middle-end created arrays. */
6059 }
6065 }
6067 /* Given TYPE, and HASHCODE its hash code, return the canonical
6068 object for an identical type if one already exists.
6069 Otherwise, return TYPE, and record it as the canonical object.
6071 To use this function, first create a type of the sort you want.
6072 Then compute its hash code from the fields of the type that
6073 make it different from other similar types.
6074 Then call this function and use the value. */
6076 tree
6078 {
6079 type_hash in;
6082 /* The hash table only contains main variants, so ensure that's what we're
6083 being passed. */
6086 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6087 must call that routine before comparing TYPE_ALIGNs. */
6095 {
6101 /* Free also min/max values and the cache for integer
6102 types. This can't be done in free_node, as LTO frees
6103 those on its own. */
6105 {
6108 {
6109 /* Zero is always in TYPE_CACHED_VALUES. */
6113 }
6116 {
6119 }
6122 }
6125 }
6126 else
6127 {
6136 }
6137 }
6139 static void
6141 {
6146 }
6148 /* Given two lists of types
6149 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6150 return 1 if the lists contain the same types in the same order.
6151 Also, the TREE_PURPOSEs must match. */
6153 bool
6155 {
6167 }
6169 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6170 given by TYPE. If the argument list accepts variable arguments,
6171 then this function counts only the ordinary arguments. */
6173 int
6175 {
6179 /* If the function does not take a variable number of arguments,
6180 the last element in the list will have type `void'. */
6183 else
6187 }
6189 /* Return the type of the function TYPE's argument ARGNO if known.
6190 For vararg function's where ARGNO refers to one of the variadic
6191 arguments return null. Otherwise, return a void_type_node for
6192 out-of-bounds ARGNO. */
6194 tree
6196 {
6197 /* Treat zero the same as an out-of-bounds argument number. */
6201 function_args_iterator iter;
6203 tree argtype;
6206 {
6207 /* A vararg function's argument list ends in a null. Otherwise,
6208 an ordinary function's argument list ends with void. Return
6209 null if ARGNO refers to a vararg argument, void_type_node if
6210 it's out of bounds, and the formal argument type otherwise. */
6218 }
6221 }
6223 /* Nonzero if integer constants T1 and T2
6224 represent the same constant value. */
6226 int
6228 {
6244 }
6246 /* Return true if T is an INTEGER_CST whose numerical value (extended
6247 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6249 bool
6251 {
6255 }
6257 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6258 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6260 bool
6262 {
6266 {
6271 }
6274 }
6276 /* Return true if T is an INTEGER_CST whose numerical value (extended
6277 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6279 bool
6281 {
6285 }
6287 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6288 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6290 bool
6292 {
6296 {
6301 }
6304 }
6306 /* T is an INTEGER_CST whose numerical value (extended according to
6307 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6308 HOST_WIDE_INT. */
6310 HOST_WIDE_INT
6312 {
6315 }
6317 /* T is an INTEGER_CST whose numerical value (extended according to
6318 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6319 HOST_WIDE_INT. */
6321 unsigned HOST_WIDE_INT
6323 {
6326 }
6328 /* Return the most significant (sign) bit of T. */
6330 int
6332 {
6336 }
6338 /* Return an indication of the sign of the integer constant T.
6339 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6340 Note that -1 will never be returned if T's type is unsigned. */
6342 int
6344 {
6351 else
6353 }
6355 /* Return the minimum number of bits needed to represent VALUE in a
6356 signed or unsigned type, UNSIGNEDP says which. */
6358 unsigned int
6360 {
6361 /* If the value is negative, compute its negative minus 1. The latter
6362 adjustment is because the absolute value of the largest negative value
6363 is one larger than the largest positive value. This is equivalent to
6364 a bit-wise negation, so use that operation instead. */
6369 /* Return the number of bits needed, taking into account the fact
6370 that we need one more bit for a signed than unsigned type.
6371 If value is 0 or -1, the minimum precision is 1 no matter
6372 whether unsignedp is true or false. */
6376 else
6378 }
6380 /* Return truthvalue of whether T1 is the same tree structure as T2.
6381 Return 1 if they are the same.
6382 Return 0 if they are understandably different.
6383 Return -1 if either contains tree structure not understood by
6384 this function. */
6386 int
6388 {
6398 /* For location wrappers to be the same, they must be at the same
6399 source location (and wrap the same thing). */
6401 {
6405 }
6411 {
6415 else
6417 }
6427 {
6443 {
6452 /* ??? Should we handle also fields here? */
6456 }
6467 {
6475 {
6479 }
6481 }
6484 /* Special case: if either target is an unallocated VAR_DECL,
6485 it means that it's going to be unified with whatever the
6486 TARGET_EXPR is really supposed to initialize, so treat it
6487 as being equivalent to anything. */
6495 else
6524 /* A false return means maybe_ne rather than known_ne. */
6530 }
6532 /* This general rule works for most tree codes. All exceptions should be
6533 handled above. If this is a language-specific tree code, we can't
6534 trust what might be in the operand, so say we don't know
6535 the situation. */
6540 {
6549 {
6553 }
6559 }
6560 }
6562 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6563 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6564 than U, respectively. */
6566 int
6568 {
6577 else
6579 }
6581 /* Return true if SIZE represents a constant size that is in bounds of
6582 what the middle-end and the backend accepts (covering not more than
6583 half of the address-space).
6584 When PERR is non-null, set *PERR on failure to the description of
6585 why SIZE is not valid. */
6587 bool
6589 {
6591 {
6598 }
6600 cst_size_error error;
6605 {
6608 }
6611 {
6614 }
6617 {
6620 }
6624 {
6627 }
6630 }
6632 /* Return the precision of the type, or for a complex or vector type the
6633 precision of the type of its elements. */
6635 unsigned int
6637 {
6645 }
6647 /* Return true if CODE represents an associative tree code. Otherwise
6648 return false. */
6649 bool
6651 {
6653 {
6665 }
6667 }
6669 /* Return true if CODE represents a commutative tree code. Otherwise
6670 return false. */
6671 bool
6673 {
6675 {
6702 }
6704 }
6706 /* Return true if CODE represents a ternary tree code for which the
6707 first two operands are commutative. Otherwise return false. */
6708 bool
6710 {
6712 {
6720 }
6722 }
6724 /* Returns true if CODE can overflow. */
6726 bool
6728 {
6730 {
6735 /* Can overflow in various ways. */
6741 /* For INT_MIN / -1. */
6745 /* For -INT_MIN. */
6748 /* These operators cannot overflow. */
6750 }
6751 }
6753 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6754 ftrapv doesn't generate trapping insns for CODE. */
6756 bool
6758 {
6761 /* We don't generate instructions that trap on overflow for complex or vector
6762 types. */
6770 {
6776 /* These operators can overflow, and -ftrapv generates trapping code for
6777 these. */
6784 /* These operators can overflow, but -ftrapv does not generate trapping
6785 code for these. */
6788 /* These operators cannot overflow. */
6790 }
6791 }
6793 /* Constructors for pointer, array and function types.
6794 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6795 constructed by language-dependent code, not here.) */
6797 /* Construct, lay out and return the type of pointers to TO_TYPE with
6798 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6799 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6800 indicate this type can reference all of memory. If such a type has
6801 already been constructed, reuse it. */
6803 tree
6806 {
6807 tree t;
6814 {
6817 }
6819 /* If the pointed-to type has the may_alias attribute set, force
6820 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6824 /* In some cases, languages will have things that aren't a POINTER_TYPE
6825 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6826 In that case, return that type without regard to the rest of our
6827 operands.
6829 ??? This is a kludge, but consistent with the way this function has
6830 always operated and there doesn't seem to be a good way to avoid this
6831 at the moment. */
6836 /* First, if we already have a type for pointers to TO_TYPE and it's
6837 the proper mode, use it. */
6850 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6858 /* Lay out the type. This function has many callers that are concerned
6859 with expression-construction, and this simplifies them all. */
6863 }
6865 /* By default build pointers in ptr_mode. */
6867 tree
6869 {
6871 }
6873 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6875 tree
6878 {
6879 tree t;
6886 {
6889 }
6891 /* If the pointed-to type has the may_alias attribute set, force
6892 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6896 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6897 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6898 In that case, return that type without regard to the rest of our
6899 operands.
6901 ??? This is a kludge, but consistent with the way this function has
6902 always operated and there doesn't seem to be a good way to avoid this
6903 at the moment. */
6908 /* First, if we already have a type for pointers to TO_TYPE and it's
6909 the proper mode, use it. */
6922 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6933 }
6936 /* Build the node for the type of references-to-TO_TYPE by default
6937 in ptr_mode. */
6939 tree
6941 {
6943 }
6945 #define MAX_INT_CACHED_PREC \
6946 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6949 /* Builds a signed or unsigned integer type of precision PRECISION.
6950 Used for C bitfields whose precision does not match that of
6951 built-in target types. */
6952 tree
6955 {
6962 {
6966 }
6973 else
6983 }
6985 #define MAX_BOOL_CACHED_PREC \
6986 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6989 /* Builds a boolean type of precision PRECISION.
6990 Used for boolean vectors to choose proper vector element size. */
6991 tree
6993 {
6994 tree type;
6997 {
7001 }
7011 }
7013 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7014 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7015 is true, reuse such a type that has already been constructed. */
7017 static tree
7019 {
7042 {
7043 /* Since we cannot reliably merge this type, we need to compare it using
7044 structural equality checks. */
7047 }
7053 }
7055 /* Wrapper around build_range_type_1 with SHARED set to true. */
7057 tree
7059 {
7061 }
7063 /* Wrapper around build_range_type_1 with SHARED set to false. */
7065 tree
7067 {
7069 }
7071 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7072 MAXVAL should be the maximum value in the domain
7073 (one less than the length of the array).
7075 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7076 We don't enforce this limit, that is up to caller (e.g. language front end).
7077 The limit exists because the result is a signed type and we don't handle
7078 sizes that use more than one HOST_WIDE_INT. */
7080 tree
7082 {
7084 }
7086 /* Return true if the debug information for TYPE, a subtype, should be emitted
7087 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7088 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7089 debug info and doesn't reflect the source code. */
7091 bool
7093 {
7096 /* Subrange types have a base type which is an integral type. */
7100 /* Get the real bounds of the subtype. */
7103 else
7104 {
7107 }
7109 /* If the type and its base type have the same representation and the same
7110 name, then the type is not a subrange but a copy of the base type. */
7124 }
7126 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7127 and number of elements specified by the range of values of INDEX_TYPE.
7128 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7129 If SHARED is true, reuse such a type that has already been constructed.
7130 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7132 tree
7135 {
7136 tree t;
7139 {
7142 }
7152 {
7155 }
7158 {
7167 index_type
7170 }
7173 }
7175 /* Wrapper around build_array_type_1 with SHARED set to true. */
7177 tree
7179 {
7180 return
7182 }
7184 /* Wrapper around build_array_type_1 with SHARED set to false. */
7186 tree
7188 {
7190 }
7192 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7193 sizetype. */
7195 tree
7197 {
7199 }
7201 /* Recursively examines the array elements of TYPE, until a non-array
7202 element type is found. */
7204 tree
7206 {
7211 }
7213 /* Computes the canonical argument types from the argument type list
7214 ARGTYPES.
7216 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7217 on entry to this function, or if any of the ARGTYPES are
7218 structural.
7220 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7221 true on entry to this function, or if any of the ARGTYPES are
7222 non-canonical.
7224 Returns a canonical argument list, which may be ARGTYPES when the
7225 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7226 true) or would not differ from ARGTYPES. */
7228 static tree
7232 {
7233 tree arg;
7237 {
7239 /* Fail gracefully by stating that the type is structural. */
7245 /* If the argument has a default argument, we consider it
7246 non-canonical even though the type itself is canonical.
7247 That way, different variants of function and method types
7248 with default arguments will all point to the variant with
7249 no defaults as their canonical type. */
7251 }
7257 {
7258 /* Build the canonical list of argument types. */
7263 {
7266 else
7269 canon_argtypes);
7270 }
7276 /* There is a non-canonical type. */
7279 }
7281 /* The canonical argument types are the same as ARGTYPES. */
7283 }
7285 /* Construct, lay out and return
7286 the type of functions returning type VALUE_TYPE
7287 given arguments of types ARG_TYPES.
7288 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7289 are data type nodes for the arguments of the function.
7290 If such a type has already been constructed, reuse it. */
7292 tree
7294 {
7295 tree t;
7298 tree canon_argtypes;
7303 {
7306 }
7308 /* Make a node of the sort we want. */
7313 /* If we already have such a type, use the old one. */
7317 /* Set up the canonical type. */
7327 canon_argtypes);
7332 }
7334 /* Build a function type. The RETURN_TYPE is the type returned by the
7335 function. If VAARGS is set, no void_type_node is appended to the
7336 list. ARGP must be always be terminated be a NULL_TREE. */
7338 static tree
7340 {
7348 {
7353 }
7356 else
7357 {
7361 }
7365 }
7367 /* Build a function type. The RETURN_TYPE is the type returned by the
7368 function. If additional arguments are provided, they are
7369 additional argument types. The list of argument types must always
7370 be terminated by NULL_TREE. */
7372 tree
7374 {
7375 tree args;
7382 }
7384 /* Build a variable argument function type. The RETURN_TYPE is the
7385 type returned by the function. If additional arguments are provided,
7386 they are additional argument types. The list of argument types must
7387 always be terminated by NULL_TREE. */
7389 tree
7391 {
7392 tree args;
7400 }
7402 /* Build a function type. RETURN_TYPE is the type returned by the
7403 function; VAARGS indicates whether the function takes varargs. The
7404 function takes N named arguments, the types of which are provided in
7405 ARG_TYPES. */
7407 static tree
7410 {
7418 }
7420 /* Build a function type. RETURN_TYPE is the type returned by the
7421 function. The function takes N named arguments, the types of which
7422 are provided in ARG_TYPES. */
7424 tree
7426 {
7428 }
7430 /* Build a variable argument function type. RETURN_TYPE is the type
7431 returned by the function. The function takes N named arguments, the
7432 types of which are provided in ARG_TYPES. */
7434 tree
7436 {
7438 }
7440 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7441 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7442 for the method. An implicit additional parameter (of type
7443 pointer-to-BASETYPE) is added to the ARGTYPES. */
7445 tree
7447 tree rettype,
7448 tree argtypes)
7449 {
7450 tree t;
7451 tree ptype;
7453 tree canon_argtypes;
7455 /* Make a node of the sort we want. */
7462 /* The actual arglist for this function includes a "hidden" argument
7463 which is "this". Put it into the list of argument types. */
7467 /* If we already have such a type, use the old one. */
7471 /* Set up the canonical type. */
7472 any_structural_p
7475 any_noncanonical_p
7487 canon_argtypes);
7492 }
7494 /* Construct, lay out and return the type of methods belonging to class
7495 BASETYPE and whose arguments and values are described by TYPE.
7496 If that type exists already, reuse it.
7497 TYPE must be a FUNCTION_TYPE node. */
7499 tree
7501 {
7507 }
7509 /* Construct, lay out and return the type of offsets to a value
7510 of type TYPE, within an object of type BASETYPE.
7511 If a suitable offset type exists already, reuse it. */
7513 tree
7515 {
7516 tree t;
7518 /* Make a node of the sort we want. */
7524 /* If we already have such a type, use the old one. */
7532 {
7541 }
7544 }
7546 /* Create a complex type whose components are COMPONENT_TYPE.
7548 If NAMED is true, the type is given a TYPE_NAME. We do not always
7549 do so because this creates a DECL node and thus make the DECL_UIDs
7550 dependent on the type canonicalization hashtable, which is GC-ed,
7551 so the DECL_UIDs would not be stable wrt garbage collection. */
7553 tree
7555 {
7560 /* Make a node of the sort we want. */
7565 /* If we already have such a type, use the old one. */
7570 {
7571 /* We created a new type. The hash insertion will have laid
7572 out the type. We need to check the canonicalization and
7573 maybe set the name. */
7584 /* We need to create a name, since complex is a fundamental type. */
7586 {
7615 }
7616 }
7619 }
7621 /* If TYPE is a real or complex floating-point type and the target
7622 does not directly support arithmetic on TYPE then return the wider
7623 type to be used for arithmetic on TYPE. Otherwise, return
7624 NULL_TREE. */
7626 tree
7628 {
7629 /* The target can give two different responses to the question of
7630 which excess precision mode it would like depending on whether we
7631 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7633 enum excess_precision_type requested_type
7635 ? EXCESS_PRECISION_TYPE_FAST
7638 enum flt_eval_method target_flt_eval_method
7641 /* The target should not ask for unpredictable float evaluation (though
7642 it might advertise that implicitly the evaluation is unpredictable,
7643 but we don't care about that here, it will have been reported
7644 elsewhere). If it does ask for unpredictable evaluation, we have
7645 nothing to do here. */
7648 /* Nothing to do. The target has asked for all types we know about
7649 to be computed with their native precision and range. */
7653 /* The target will promote this type in a target-dependent way, so excess
7654 precision ought to leave it alone. */
7658 machine_mode float16_type_mode = (float16_type_node
7665 {
7667 {
7670 {
7688 }
7690 }
7692 {
7697 {
7715 }
7717 }
7720 }
7723 }
7724 \f
7725 /* Return OP, stripped of any conversions to wider types as much as is safe.
7726 Converting the value back to OP's type makes a value equivalent to OP.
7728 If FOR_TYPE is nonzero, we return a value which, if converted to
7729 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7731 OP must have integer, real or enumeral type. Pointers are not allowed!
7733 There are some cases where the obvious value we could return
7734 would regenerate to OP if converted to OP's type,
7735 but would not extend like OP to wider types.
7736 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7737 For example, if OP is (unsigned short)(signed char)-1,
7738 we avoid returning (signed char)-1 if FOR_TYPE is int,
7739 even though extending that to an unsigned short would regenerate OP,
7740 since the result of extending (signed char)-1 to (int)
7741 is different from (int) OP. */
7743 tree
7745 {
7746 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7748 unsigned final_prec
7750 int uns
7757 {
7760 /* TYPE_PRECISION on vector types has different meaning
7761 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7762 so avoid them here. */
7769 /* Truncations are many-one so cannot be removed.
7770 Unless we are later going to truncate down even farther. */
7775 /* See what's inside this conversion. If we decide to strip it,
7776 we will set WIN. */
7779 /* If we have not stripped any zero-extensions (uns is 0),
7780 we can strip any kind of extension.
7781 If we have previously stripped a zero-extension,
7782 only zero-extensions can safely be stripped.
7783 Any extension can be stripped if the bits it would produce
7784 are all going to be discarded later by truncating to FOR_TYPE. */
7787 {
7790 /* TYPE_UNSIGNED says whether this is a zero-extension.
7791 Let's avoid computing it if it does not affect WIN
7792 and if UNS will not be needed again. */
7796 {
7799 }
7800 }
7801 }
7803 /* If we finally reach a constant see if it fits in sth smaller and
7804 in that case convert it. */
7806 {
7812 {
7816 }
7817 }
7820 }
7821 \f
7822 /* Return OP or a simpler expression for a narrower value
7823 which can be sign-extended or zero-extended to give back OP.
7824 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7825 or 0 if the value should be sign-extended. */
7827 tree
7829 {
7836 {
7837 do
7851 ret);
7853 }
7855 {
7856 int bitschange
7860 /* Truncations are many-one so cannot be removed. */
7864 /* See what's inside this conversion. If we decide to strip it,
7865 we will set WIN. */
7868 {
7870 /* An extension: the outermost one can be stripped,
7871 but remember whether it is zero or sign extension. */
7874 /* Otherwise, if a sign extension has been stripped,
7875 only sign extensions can now be stripped;
7876 if a zero extension has been stripped, only zero-extensions. */
7880 }
7882 {
7883 /* A change in nominal type can always be stripped, but we must
7884 preserve the unsignedness. */
7889 /* Keep trying to narrow, but don't assign op to win if it
7890 would turn an integral type into something else. */
7893 }
7896 }
7899 /* Since type_for_size always gives an integer type. */
7902 /* Ensure field is laid out already. */
7905 {
7906 unsigned HOST_WIDE_INT innerprec
7912 /* We can get this structure field in a narrower type that fits it,
7913 but the resulting extension to its nominal type (a fullword type)
7914 must satisfy the same conditions as for other extensions.
7916 Do this only for fields that are aligned (not bit-fields),
7917 because when bit-field insns will be used there is no
7918 advantage in doing this. */
7924 {
7928 }
7929 }
7933 }
7934 \f
7935 /* Return true if integer constant C has a value that is permissible
7936 for TYPE, an integral type. */
7938 bool
7940 {
7945 /* Non-standard boolean types can have arbitrary precision but various
7946 transformations assume that they can only take values 0 and +/-1. */
7950 retry:
7954 /* If at least one bound of the type is a constant integer, we can check
7955 ourselves and maybe make a decision. If no such decision is possible, but
7956 this type is a subtype, try checking against that. Otherwise, use
7957 fits_to_tree_p, which checks against the precision.
7959 Compute the status for each possibly constant bound, and return if we see
7960 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7961 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7962 for "constant known to fit". */
7964 /* Check if c >= type_low_bound. */
7966 {
7970 }
7971 else
7974 /* Check if c <= type_high_bound. */
7976 {
7980 }
7981 else
7984 /* If the constant fits both bounds, the result is known. */
7988 /* Perform some generic filtering which may allow making a decision
7989 even if the bounds are not constant. First, negative integers
7990 never fit in unsigned types, */
7994 /* Second, narrower types always fit in wider ones. */
7998 /* Third, unsigned integers with top bit set never fit signed types. */
8000 {
8003 {
8004 /* When a tree_cst is converted to a wide-int, the precision
8005 is taken from the type. However, if the precision of the
8006 mode underneath the type is smaller than that, it is
8007 possible that the value will not fit. The test below
8008 fails if any bit is set between the sign bit of the
8009 underlying mode and the top bit of the type. */
8012 }
8015 }
8017 /* If we haven't been able to decide at this point, there nothing more we
8018 can check ourselves here. Look at the base type if we have one and it
8019 has the same precision. */
8023 {
8026 }
8028 /* Or to fits_to_tree_p, if nothing else. */
8030 }
8032 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8033 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8034 represented (assuming two's-complement arithmetic) within the bit
8035 precision of the type are returned instead. */
8037 void
8039 {
8043 else
8044 {
8047 else
8048 {
8051 }
8052 }
8057 else
8058 {
8061 }
8062 }
8064 /* Return true if VAR is an automatic variable. */
8066 bool
8068 {
8073 }
8075 /* Return true if VAR is an automatic variable defined in function FN. */
8077 bool
8079 {
8083 }
8085 /* Subprogram of following function. Called by walk_tree.
8087 Return *TP if it is an automatic variable or parameter of the
8088 function passed in as DATA. */
8090 static tree
8092 {
8103 }
8105 /* Returns true if T is, contains, or refers to a type with variable
8106 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8107 arguments, but not the return type. If FN is nonzero, only return
8108 true if a modifier of the type or position of FN is a variable or
8109 parameter inside FN.
8111 This concept is more general than that of C99 'variably modified types':
8112 in C99, a struct type is never variably modified because a VLA may not
8113 appear as a structure member. However, in GNU C code like:
8115 struct S { int i[f()]; };
8117 is valid, and other languages may define similar constructs. */
8119 bool
8121 {
8122 tree t;
8124 /* Test if T is either variable (if FN is zero) or an expression containing
8125 a variable in FN. If TYPE isn't gimplified, return true also if
8126 gimplify_one_sizepos would gimplify the expression into a local
8127 variable. */
8128 #define RETURN_TRUE_IF_VAR(T) \
8129 do { tree _t = (T); \
8130 if (_t != NULL_TREE \
8131 && _t != error_mark_node \
8132 && !CONSTANT_CLASS_P (_t) \
8133 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8134 && (!fn \
8135 || (!TYPE_SIZES_GIMPLIFIED (type) \
8136 && (TREE_CODE (_t) != VAR_DECL \
8137 && !CONTAINS_PLACEHOLDER_P (_t))) \
8138 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8139 return true; } while (0)
8144 /* If TYPE itself has variable size, it is variably modified. */
8149 {
8153 /* Ada can have pointer types refering to themselves indirectly. */
8158 {
8161 }
8167 /* If TYPE is a function type, it is variably modified if the
8168 return type is variably modified. */
8178 /* Scalar types are variably modified if their end points
8179 aren't constant. */
8187 /* We can't see if any of the fields are variably-modified by the
8188 definition we normally use, since that would produce infinite
8189 recursion via pointers. */
8190 /* This is variably modified if some field's type is. */
8193 {
8198 /* If the type is a qualified union, then the DECL_QUALIFIER
8199 of fields can also be an expression containing a variable. */
8203 /* If the field is a qualified union, then it's only a container
8204 for what's inside so we look into it. That's necessary in LTO
8205 mode because the sizes of the field tested above have been set
8206 to PLACEHOLDER_EXPRs by free_lang_data. */
8210 }
8214 /* Do not call ourselves to avoid infinite recursion. This is
8215 variably modified if the element type is. */
8222 }
8224 /* The current language may have other cases to check, but in general,
8225 all other types are not variably modified. */
8228 #undef RETURN_TRUE_IF_VAR
8229 }
8231 /* Given a DECL or TYPE, return the scope in which it was declared, or
8232 NULL_TREE if there is no containing scope. */
8234 tree
8236 {
8238 }
8240 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8242 const_tree
8244 {
8246 {
8249 else
8251 }
8253 }
8255 /* Return the innermost context enclosing DECL that is
8256 a FUNCTION_DECL, or zero if none. */
8258 tree
8260 {
8261 tree context;
8266 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8267 where we look up the function at runtime. Such functions always take
8268 a first argument of type 'pointer to real context'.
8270 C++ should really be fixed to use DECL_CONTEXT for the real context,
8271 and use something else for the "virtual context". */
8273 context
8274 = TYPE_MAIN_VARIANT
8276 else
8280 {
8283 else
8285 }
8288 }
8290 /* Return the innermost context enclosing DECL that is
8291 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8292 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8294 tree
8296 {
8301 {
8322 }
8325 }
8327 /* CALL is a CALL_EXPR. Return the declaration for the function
8328 called, or NULL_TREE if the called function cannot be
8329 determined. */
8331 tree
8333 {
8334 tree addr;
8339 /* It's invalid to call this function with anything but a
8340 CALL_EXPR. */
8343 /* The first operand to the CALL is the address of the function
8344 called. */
8347 /* If there is no function, return early. */
8353 /* If this is a readonly function pointer, extract its initial value. */
8359 /* If the address is just `&f' for some function `f', then we know
8360 that `f' is being called. */
8365 /* We couldn't figure out what was being called. */
8367 }
8369 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8370 return the associated function code, otherwise return CFN_LAST. */
8372 combined_fn
8374 {
8375 /* It's invalid to call this function with anything but a CALL_EXPR. */
8386 }
8388 /* Comparator of indices based on tree_node_counts. */
8390 static int
8392 {
8397 }
8399 /* Comparator of indices based on tree_code_counts. */
8401 static int
8403 {
8408 }
8410 #define TREE_MEM_USAGE_SPACES 40
8412 /* Print debugging information about tree nodes generated during the compile,
8413 and any language-specific information. */
8415 void
8417 {
8419 {
8425 {
8432 {
8439 }
8444 }
8446 {
8456 {
8461 }
8468 }
8469 }
8470 else
8477 }
8478 \f
8481 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8483 unsigned
8485 {
8486 /* This relies on the raw feedback's top 4 bits being zero. */
8487 #define FEEDBACK(X) ((X) * 0x04c11db7)
8488 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8489 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8491 {
8496 };
8497 #undef FEEDBACK
8498 #undef SYNDROME
8502 {
8506 }
8509 }
8511 /* Generate a crc32 of a string. */
8513 unsigned
8515 {
8516 do
8520 }
8522 /* P is a string that will be used in a symbol. Mask out any characters
8523 that are not valid in that context. */
8525 void
8527 {
8532 #endif
8535 #endif
8536 ))
8538 }
8542 /* Create a unique anonymous identifier. The identifier is still a
8543 valid assembly label. */
8545 tree
8547 {
8549 #if !defined (NO_DOT_IN_LABEL)
8550 "."
8551 #elif !defined (NO_DOLLAR_IN_LABEL)
8552 "$"
8553 #else
8554 "_"
8555 #endif
8566 }
8568 /* Generate a name for a special-purpose function.
8569 The generated name may need to be unique across the whole link.
8570 Changes to this function may also require corresponding changes to
8571 xstrdup_mask_random.
8572 TYPE is some string to identify the purpose of this function to the
8573 linker or collect2; it must start with an uppercase letter,
8574 one of:
8575 I - for constructors
8576 D - for destructors
8577 N - for C++ anonymous namespaces
8578 F - for DWARF unwind frame information. */
8580 tree
8582 {
8587 /* If we already have a name we know to be unique, just use that. */
8590 /* If the target is handling the constructors/destructors, they
8591 will be local to this file and the name is only necessary for
8592 debugging purposes.
8593 We also assign sub_I and sub_D sufixes to constructors called from
8594 the global static constructors. These are always local. */
8598 {
8602 /* Just use the file's basename, because the full pathname
8603 might be quite long. */
8605 }
8606 else
8607 {
8608 /* Otherwise, the name must be unique across the entire link.
8609 We don't have anything that we know to be unique to this translation
8610 unit, so use what we do have and throw in some randomness. */
8628 }
8634 /* Set up the name of the file-level functions we may need.
8635 Use a global object (which is already required to be unique over
8636 the program) rather than the file name (which imposes extra
8637 constraints). */
8641 }
8642 \f
8643 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8645 /* Complain that the tree code of NODE does not match the expected 0
8646 terminated list of trailing codes. The trailing code list can be
8647 empty, for a more vague error message. FILE, LINE, and FUNCTION
8648 are of the caller. */
8650 void
8653 {
8664 {
8671 {
8678 }
8680 }
8681 else
8687 }
8689 /* Complain that the tree code of NODE does match the expected 0
8690 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8691 the caller. */
8693 void
8696 {
8710 {
8712 {
8715 }
8718 }
8724 }
8726 /* Similar to tree_check_failed, except that we check for a class of tree
8727 code, given in CL. */
8729 void
8732 {
8733 internal_error
8738 }
8740 /* Similar to tree_check_failed, except that instead of specifying a
8741 dozen codes, use the knowledge that they're all sequential. */
8743 void
8747 {
8760 {
8767 }
8772 }
8775 /* Similar to tree_check_failed, except that we check that a tree does
8776 not have the specified code, given in CL. */
8778 void
8781 {
8782 internal_error
8787 }
8790 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8792 void
8795 {
8801 }
8804 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8806 void
8810 {
8823 {
8830 }
8835 }
8838 #undef DEFTREESTRUCT
8839 #define DEFTREESTRUCT(VAL, NAME) NAME,
8843 };
8844 #undef DEFTREESTRUCT
8846 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8848 /* Similar to tree_class_check_failed, except that we check for
8849 whether CODE contains the tree structure identified by EN. */
8851 void
8856 {
8857 internal_error
8861 }
8864 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8865 (dynamically sized) vector. */
8867 void
8870 {
8871 internal_error
8875 }
8877 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8878 (dynamically sized) vector. */
8880 void
8883 {
8884 internal_error
8887 }
8889 /* Similar to above, except that the check is for the bounds of the operand
8890 vector of an expression node EXP. */
8892 void
8895 {
8897 internal_error
8901 }
8903 /* Similar to above, except that the check is for the number of
8904 operands of an OMP_CLAUSE node. */
8906 void
8909 {
8910 internal_error
8915 }
8917 \f
8918 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
8919 and mapped to the machine mode MODE. Initialize its fields and build
8920 the information necessary for debugging output. */
8922 static tree
8924 {
8925 tree t;
8946 /* We have built a main variant, based on the main variant of the
8947 inner type. Use it to build the variant we return. */
8955 }
8957 static tree
8959 {
8982 else
8984 }
8986 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8988 static tree
8990 {
8992 {
9004 }
9005 else
9006 {
9018 }
9021 }
9023 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9025 static tree
9027 {
9029 {
9041 }
9042 else
9043 {
9055 }
9058 }
9061 /* Create an atomic variant node for TYPE. This routine is called
9062 during initialization of data types to create the 5 basic atomic
9063 types. The generic build_variant_type function requires these to
9064 already be set up in order to function properly, so cannot be
9065 called from there. If ALIGN is non-zero, then ensure alignment is
9066 overridden to this value. */
9068 static tree
9070 {
9071 tree t;
9073 /* Make sure its not already registered. */
9084 }
9086 /* Information about the _FloatN and _FloatNx types. This must be in
9087 the same order as the corresponding TI_* enum values. */
9089 {
9097 };
9100 /* Create nodes for all integer types (and error_mark_node) using the sizes
9101 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9103 void
9105 {
9113 /* Define both `signed char' and `unsigned char'. */
9119 /* Define `char', which is like either `signed char' or `unsigned char'
9120 but not the same as either. */
9121 char_type_node
9122 = (signed_char
9137 {
9142 {
9145 }
9146 }
9148 /* Define a boolean type. This type only represents boolean values but
9149 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9155 /* Define what type to use for size_t. */
9164 else
9165 {
9171 {
9178 {
9180 }
9181 }
9184 }
9186 /* Define what type to use for ptrdiff_t. */
9195 else
9196 {
9200 {
9208 }
9211 }
9213 /* Fill in the rest of the sized types. Reuse existing type nodes
9214 when possible. */
9227 /* Don't call build_qualified type for atomics. That routine does
9228 special processing for atomics, and until they are initialized
9229 it's better not to make that call.
9231 Check to see if there is a target override for atomic types. */
9248 /* Define these next since types below may used them. */
9266 /* We are not going to have real types in C with less than byte alignment,
9267 so we might as well not have any types that claim to have it. */
9278 const_ptr_type_node
9300 {
9303 scalar_float_mode mode;
9307 /* Work around the rs6000 KFmode having precision 113 not
9308 128. */
9320 }
9327 /* Fixed size integer types. */
9334 /* Decimal float types. */
9336 {
9351 }
9360 {
9364 }
9366 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9367 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9368 sat_ ## KIND ## _type_node = \
9369 make_sat_signed_ ## KIND ## _type (SIZE); \
9370 sat_unsigned_ ## KIND ## _type_node = \
9371 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9372 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9373 unsigned_ ## KIND ## _type_node = \
9374 make_unsigned_ ## KIND ## _type (SIZE);
9376 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9377 sat_ ## WIDTH ## KIND ## _type_node = \
9378 make_sat_signed_ ## KIND ## _type (SIZE); \
9379 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9380 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9381 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9382 unsigned_ ## WIDTH ## KIND ## _type_node = \
9383 make_unsigned_ ## KIND ## _type (SIZE);
9385 /* Make fixed-point type nodes based on four different widths. */
9386 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9387 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9388 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9389 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9390 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9392 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9393 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9394 NAME ## _type_node = \
9395 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9396 u ## NAME ## _type_node = \
9397 make_or_reuse_unsigned_ ## KIND ## _type \
9398 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9399 sat_ ## NAME ## _type_node = \
9400 make_or_reuse_sat_signed_ ## KIND ## _type \
9401 (GET_MODE_BITSIZE (MODE ## mode)); \
9402 sat_u ## NAME ## _type_node = \
9403 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9404 (GET_MODE_BITSIZE (U ## MODE ## mode));
9406 /* Fixed-point type and mode nodes. */
9419 {
9422 /* Many back-ends define record types without setting TYPE_NAME.
9423 If we copied the record type here, we'd keep the original
9424 record type without a name. This breaks name mangling. So,
9425 don't copy record types and let c_common_nodes_and_builtins()
9426 declare the type to be __builtin_va_list. */
9431 }
9433 /* SCEV analyzer global shared trees. */
9438 }
9440 /* Modify DECL for given flags.
9441 TM_PURE attribute is set only on types, so the function will modify
9442 DECL's type when ECF_TM_PURE is used. */
9444 void
9446 {
9476 /* Looping const or pure is implied by noreturn.
9477 There is currently no way to declare looping const or looping pure alone. */
9480 }
9483 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9485 static void
9488 {
9489 tree decl;
9496 }
9498 /* Call this function after instantiating all builtins that the language
9499 front end cares about. This will build the rest of the builtins
9500 and internal functions that are relied upon by the tree optimizers and
9501 the middle-end. */
9503 void
9505 {
9511 {
9515 BUILT_IN_UNREACHABLE,
9523 }
9527 {
9538 }
9541 {
9544 NULL_TREE);
9547 }
9550 {
9556 }
9558 /* If we're checking the stack, `alloca' can throw. */
9559 const int alloca_flags
9563 {
9568 }
9573 BUILT_IN_ALLOCA_WITH_ALIGN,
9575 alloca_flags);
9580 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9582 alloca_flags);
9588 BUILT_IN_INIT_TRAMPOLINE,
9591 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9595 BUILT_IN_INIT_DESCRIPTOR,
9600 BUILT_IN_ADJUST_TRAMPOLINE,
9604 BUILT_IN_ADJUST_DESCRIPTOR,
9612 BUILT_IN_CLEAR_CACHE,
9614 ECF_NOTHROW);
9617 BUILT_IN_NONLOCAL_GOTO,
9624 BUILT_IN_SETJMP_SETUP,
9629 BUILT_IN_SETJMP_RECEIVER,
9638 BUILT_IN_STACK_RESTORE,
9643 NULL_TREE);
9656 /* If there's a possibility that we might use the ARM EABI, build the
9657 alternate __cxa_end_cleanup node used to resume from C++. */
9659 {
9662 BUILT_IN_CXA_END_CLEANUP,
9664 }
9668 BUILT_IN_UNWIND_RESUME,
9672 ECF_NORETURN);
9675 {
9677 NULL_TREE);
9679 BUILT_IN_RETURN_ADDRESS,
9681 ECF_NOTHROW);
9682 }
9686 {
9691 BUILT_IN_PROFILE_FUNC_ENTER,
9695 BUILT_IN_PROFILE_FUNC_EXIT,
9697 }
9699 /* The exception object and filter values from the runtime. The argument
9700 must be zero before exception lowering, i.e. from the front end. After
9701 exception lowering, it will be the region number for the exception
9702 landing pad. These functions are PURE instead of CONST to prevent
9703 them from being hoisted past the exception edge that will initialize
9704 its value in the landing pad. */
9708 /* Only use TM_PURE if we have TM language support. */
9721 NULL_TREE);
9723 BUILT_IN_EH_COPY_VALUES,
9726 /* Complex multiplication and division. These are handled as builtins
9727 rather than optabs because emit_library_call_value doesn't support
9728 complex. Further, we can do slightly better with folding these
9729 beasties if the real and complex parts of the arguments are separate. */
9730 {
9734 {
9761 /* For -ftrapping-math these should throw from a former
9762 -fnon-call-exception stmt. */
9764 NULL);
9770 NULL);
9774 }
9775 }
9778 }
9780 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9781 better way.
9783 If we requested a pointer to a vector, build up the pointers that
9784 we stripped off while looking for the inner type. Similarly for
9785 return values from functions.
9787 The argument TYPE is the top of the chain, and BOTTOM is the
9788 new type which we will point to. */
9790 tree
9792 {
9796 {
9800 }
9802 {
9806 }
9808 {
9811 }
9813 {
9816 }
9818 {
9820 /* The build_method_type_directly() routine prepends 'this' to argument list,
9821 so we must compensate by getting rid of it. */
9822 outer
9823 = build_method_type_directly
9825 inner,
9827 }
9829 {
9832 }
9833 else
9838 }
9840 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9841 the inner type. */
9842 tree
9844 {
9845 poly_int64 nunits;
9849 {
9861 /* Check that there are no leftover bits. */
9869 }
9872 }
9874 /* Similarly, but takes the inner type and number of units, which must be
9875 a power of two. */
9877 tree
9879 {
9881 }
9883 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
9885 tree
9887 {
9892 {
9895 }
9896 else
9902 }
9904 /* Build a vector type that holds one boolean result for each element of
9905 vector type VECTYPE. The public interface for this operation is
9906 truth_type_for. */
9908 static tree
9910 {
9914 machine_mode mask_mode;
9924 }
9926 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
9927 set. */
9929 tree
9931 {
9933 tree cand;
9934 /* We always build the non-opaque variant before the opaque one,
9935 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9941 /* Othewise build a variant type and make sure to queue it after
9942 the non-opaque type. */
9950 }
9952 /* Return the value of element I of VECTOR_CST T as a wide_int. */
9954 static poly_wide_int
9956 {
9957 /* First handle elements that are directly encoded. */
9962 /* Identify the pattern that contains element I and work out the index of
9963 the last encoded element for that pattern. */
9969 /* If there are no steps, the final encoded value is the right one. */
9973 /* Otherwise work out the value from the last two encoded elements. */
9978 }
9980 /* Return the value of element I of VECTOR_CST T. */
9982 tree
9984 {
9985 /* First handle elements that are directly encoded. */
9990 /* If there are no steps, the final encoded value is the right one. */
9992 {
9993 /* Identify the pattern that contains element I and work out the index of
9994 the last encoded element for that pattern. */
9999 }
10001 /* Otherwise work out the value from the last two encoded elements. */
10004 }
10006 /* Given an initializer INIT, return TRUE if INIT is zero or some
10007 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10008 null, set *NONZERO if and only if INIT is known not to be all
10009 zeros. The combination of return value of false and *NONZERO
10010 false implies that INIT may but need not be all zeros. Other
10011 combinations indicate definitive answers. */
10013 bool
10015 {
10020 /* Conservatively clear NONZERO and set it only if INIT is definitely
10021 not all zero. */
10029 {
10038 /* ??? Note that this is not correct for C4X float formats. There,
10039 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10040 negative exponent. */
10075 {
10080 tree elt;
10087 }
10090 {
10105 }
10106 /* Fall through. */
10109 {
10117 /* We need to loop through all elements to handle cases like
10118 "\0" and "\0foobar". */
10121 {
10124 }
10127 }
10131 }
10132 }
10134 /* Return true if EXPR is an initializer expression in which every element
10135 is a constant that is numerically equal to 0 or 1. The elements do not
10136 need to be equal to each other. */
10138 bool
10140 {
10144 {
10152 {
10159 {
10163 }
10166 }
10170 }
10171 }
10173 /* Check if vector VEC consists of all the equal elements and
10174 that the number of elements corresponds to the type of VEC.
10175 The function returns first element of the vector
10176 or NULL_TREE if the vector is not uniform. */
10177 tree
10179 {
10192 {
10196 }
10200 {
10204 {
10206 {
10209 }
10212 }
10217 }
10220 }
10222 /* If the argument is INTEGER_CST, return it. If the argument is vector
10223 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10224 return NULL_TREE.
10225 Look through location wrappers. */
10227 tree
10229 {
10236 {
10240 }
10243 }
10245 /* If VECTOR_CST T has a single nonzero element, return the index of that
10246 element, otherwise return -1. */
10248 int
10250 {
10256 {
10259 }
10260 else
10265 {
10268 {
10272 }
10273 }
10275 }
10277 /* Build an empty statement at location LOC. */
10279 tree
10281 {
10285 }
10288 /* Build an OpenMP clause with code CODE. LOC is the location of the
10289 clause. */
10291 tree
10293 {
10294 tree t;
10309 }
10311 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10312 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10313 Except for the CODE and operand count field, other storage for the
10314 object is initialized to zeros. */
10316 tree
10318 {
10319 tree t;
10331 /* Can't use TREE_OPERAND to store the length because if checking is
10332 enabled, it will try to check the length before we store it. :-P */
10336 }
10338 /* Helper function for build_call_* functions; build a CALL_EXPR with
10339 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10340 the argument slots. */
10342 static tree
10344 {
10345 tree t;
10353 }
10355 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10356 FN and a null static chain slot. NARGS is the number of call arguments
10357 which are specified as "..." arguments. */
10359 tree
10361 {
10362 tree ret;
10368 }
10370 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10371 FN and a null static chain slot. NARGS is the number of call arguments
10372 which are specified as a va_list ARGS. */
10374 tree
10376 {
10377 tree t;
10385 }
10387 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10388 FN and a null static chain slot. NARGS is the number of call arguments
10389 which are specified as a tree array ARGS. */
10391 tree
10394 {
10395 tree t;
10404 }
10406 /* Like build_call_array, but takes a vec. */
10408 tree
10410 {
10419 }
10421 /* Conveniently construct a function call expression. FNDECL names the
10422 function to be called and N arguments are passed in the array
10423 ARGARRAY. */
10425 tree
10427 {
10432 }
10434 /* Conveniently construct a function call expression. FNDECL names the
10435 function to be called and the arguments are passed in the vector
10436 VEC. */
10438 tree
10440 {
10443 }
10446 /* Conveniently construct a function call expression. FNDECL names the
10447 function to be called, N is the number of arguments, and the "..."
10448 parameters are the argument expressions. */
10450 tree
10452 {
10462 }
10464 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10465 varargs macros aren't supported by all bootstrap compilers. */
10467 tree
10469 {
10479 }
10481 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10482 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10483 It will get gimplified later into an ordinary internal function. */
10485 tree
10488 {
10496 }
10498 /* Build internal call expression. This is just like CALL_EXPR, except
10499 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10500 internal function. */
10502 tree
10505 {
10515 }
10517 /* Return a function call to FN, if the target is guaranteed to support it,
10518 or null otherwise.
10520 N is the number of arguments, passed in the "...", and TYPE is the
10521 type of the return value. */
10523 tree
10526 {
10536 {
10539 {
10542 OPTIMIZE_FOR_BOTH))
10544 }
10546 }
10547 else
10548 {
10553 }
10554 }
10556 /* Return a function call to the appropriate builtin alloca variant.
10558 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10559 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10560 bound for SIZE in case it is not a fixed value. */
10562 tree
10564 {
10566 {
10568 return
10570 }
10572 {
10575 }
10576 else
10577 {
10580 }
10581 }
10583 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10584 if SIZE == -1) and return a tree node representing char* pointer to
10585 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10586 the STRING_CST value is the LEN bytes at STR (the representation
10587 of the string, which may be wide). Otherwise it's all zeros. */
10589 tree
10593 {
10595 /* Set the maximum valid index based on the string length or SIZE. */
10596 unsigned HOST_WIDE_INT maxidx
10612 }
10616 /* Return true if T (assumed to be a DECL) must be assigned a memory
10617 location. */
10619 bool
10621 {
10627 }
10629 /* Return value of a constant X and sign-extend it. */
10631 HOST_WIDE_INT
10633 {
10637 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10641 {
10645 else
10647 }
10650 }
10652 /* If TYPE is an integral or pointer type, return an integer type with
10653 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10654 if TYPE is already an integer type of signedness UNSIGNEDP.
10655 If TYPE is a floating-point type, return an integer type with the same
10656 bitsize and with the signedness given by UNSIGNEDP; this is useful
10657 when doing bit-level operations on a floating-point value. */
10659 tree
10661 {
10666 {
10674 }
10677 {
10685 }
10694 else
10698 }
10700 /* If TYPE is an integral or pointer type, return an integer type with
10701 the same precision which is unsigned, or itself if TYPE is already an
10702 unsigned integer type. If TYPE is a floating-point type, return an
10703 unsigned integer type with the same bitsize as TYPE. */
10705 tree
10707 {
10709 }
10711 /* If TYPE is an integral or pointer type, return an integer type with
10712 the same precision which is signed, or itself if TYPE is already a
10713 signed integer type. If TYPE is a floating-point type, return a
10714 signed integer type with the same bitsize as TYPE. */
10716 tree
10718 {
10720 }
10722 /* If TYPE is a vector type, return a signed integer vector type with the
10723 same width and number of subparts. Otherwise return boolean_type_node. */
10725 tree
10727 {
10729 {
10733 }
10734 else
10736 }
10738 /* Returns the largest value obtainable by casting something in INNER type to
10739 OUTER type. */
10741 tree
10743 {
10749 /* Compute a unique number for every combination. */
10754 /* Determine the exponent to use. */
10756 {
10759 /* oprec <= iprec, outer: signed, inner: don't care. */
10764 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10768 /* oprec > iprec, outer: signed, inner: signed. */
10772 /* oprec > iprec, outer: signed, inner: unsigned. */
10776 /* oprec > iprec, outer: unsigned, inner: signed. */
10780 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10785 }
10789 }
10791 /* Returns the smallest value obtainable by casting something in INNER type to
10792 OUTER type. */
10794 tree
10796 {
10800 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10801 and obtain 0. */
10803 /* If we are widening something of an unsigned type, OUTER type
10804 contains all values of INNER type. In particular, both INNER
10805 and OUTER types have zero in common. */
10808 else
10809 {
10810 /* If we are widening a signed type to another signed type, we
10811 want to obtain -2^^(iprec-1). If we are keeping the
10812 precision or narrowing to a signed type, we want to obtain
10813 -2^(oprec-1). */
10818 }
10819 }
10821 /* Return nonzero if two operands that are suitable for PHI nodes are
10822 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10823 SSA_NAME or invariant. Note that this is strictly an optimization.
10824 That is, callers of this function can directly call operand_equal_p
10825 and get the same result, only slower. */
10827 int
10829 {
10835 }
10837 /* Returns number of zeros at the end of binary representation of X. */
10839 tree
10841 {
10843 }
10846 #define WALK_SUBTREE(NODE) \
10847 do \
10848 { \
10849 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10850 if (result) \
10851 return result; \
10852 } \
10853 while (0)
10855 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10856 be walked whenever a type is seen in the tree. Rest of operands and return
10857 value are as for walk_tree. */
10859 static tree
10862 {
10866 {
10870 /* We have to worry about mutually recursive pointers. These can't
10871 be written in C. They can in Ada. It's pathological, but
10872 there's an ACATS test (c38102a) that checks it. Deal with this
10873 by checking if we're pointing to another pointer, that one
10874 points to another pointer, that one does too, and we have no htab.
10875 If so, get a hash table. We check three levels deep to avoid
10876 the cost of the hash table if we don't need one. */
10881 {
10888 }
10890 /* fall through */
10899 /* Fall through. */
10903 {
10904 tree arg;
10906 /* We never want to walk into default arguments. */
10909 }
10913 /* Don't follow this nodes's type if a pointer for fear that
10914 we'll have infinite recursion. If we have a PSET, then we
10915 need not fear. */
10930 }
10933 }
10935 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10936 called with the DATA and the address of each sub-tree. If FUNC returns a
10937 non-NULL value, the traversal is stopped, and the value returned by FUNC
10938 is returned. If PSET is non-NULL it is used to record the nodes visited,
10939 and to avoid visiting a node more than once. */
10941 tree
10944 {
10947 tree result;
10949 #define WALK_SUBTREE_TAIL(NODE) \
10950 do \
10951 { \
10952 tp = & (NODE); \
10953 goto tail_recurse; \
10954 } \
10955 while (0)
10957 tail_recurse:
10958 /* Skip empty subtrees. */
10962 /* Don't walk the same tree twice, if the user has requested
10963 that we avoid doing so. */
10967 /* Call the function. */
10971 /* If we found something, return it. */
10977 /* Even if we didn't, FUNC may have decided that there was nothing
10978 interesting below this point in the tree. */
10980 {
10981 /* But we still need to check our siblings. */
10986 else
10988 }
10991 {
10995 }
10998 {
11010 /* None of these have subtrees other than those already walked
11011 above. */
11020 {
11026 /* Walk all elements but the first. */
11030 /* Now walk the first one as a tail call. */
11032 }
11035 {
11039 /* Walk all elements but the first. */
11042 /* Now walk the first one as a tail call. */
11044 }
11051 {
11056 idx++)
11058 }
11065 {
11066 tree decl;
11068 {
11069 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11070 into declarations that are just mentioned, rather than
11071 declared; they don't really belong to this part of the tree.
11072 And, we can see cycles: the initializer for a declaration
11073 can refer to the declaration itself. */
11077 }
11079 }
11082 {
11083 tree_stmt_iterator i;
11086 }
11091 {
11094 /* FALLTHRU */
11141 /* FALLTHRU */
11176 {
11181 }
11202 {
11207 }
11211 }
11215 {
11218 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11219 But, we only want to walk once. */
11224 }
11227 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11228 defining. We only want to walk into these fields of a type in this
11229 case and not in the general case of a mere reference to the type.
11231 The criterion is as follows: if the field can be an expression, it
11232 must be walked only here. This should be in keeping with the fields
11233 that are directly gimplified in gimplify_type_sizes in order for the
11234 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11235 variable-sized types.
11237 Note that DECLs get walked as part of processing the BIND_EXPR. */
11239 {
11240 /* Call the function for the decl so e.g. copy_tree_body_r can
11241 replace it with the remapped one. */
11250 /* Call the function for the type. See if it returns anything or
11251 doesn't want us to continue. If we are to continue, walk both
11252 the normal fields and those for the declaration case. */
11257 /* But do not walk a pointed-to type since it may itself need to
11258 be walked in the declaration case if it isn't anonymous. */
11260 {
11264 }
11266 /* If this is a record type, also walk the fields. */
11268 {
11269 tree field;
11273 {
11274 /* We'd like to look at the type of the field, but we can
11275 easily get infinite recursion. So assume it's pointed
11276 to elsewhere in the tree. Also, ignore things that
11277 aren't fields. */
11286 }
11287 }
11289 /* Same for scalar types. */
11295 {
11298 }
11302 }
11303 /* FALLTHRU */
11307 {
11310 /* Walk over all the sub-trees of this operand. */
11313 /* Go through the subtrees. We need to do this in forward order so
11314 that the scope of a FOR_EXPR is handled properly. */
11316 {
11320 }
11321 }
11322 /* If this is a type, walk the needed fields in the type. */
11326 }
11328 /* We didn't find what we were looking for. */
11331 #undef WALK_SUBTREE_TAIL
11332 }
11333 #undef WALK_SUBTREE
11335 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11337 tree
11339 walk_tree_lh lh)
11340 {
11341 tree result;
11346 }
11349 tree
11351 {
11358 }
11360 void
11362 {
11366 {
11368 }
11369 else
11371 }
11373 /* Create a nameless artificial label and put it in the current
11374 function context. The label has a location of LOC. Returns the
11375 newly created label. */
11377 tree
11379 {
11387 }
11389 /* Given a tree, try to return a useful variable name that we can use
11390 to prefix a temporary that is being assigned the value of the tree.
11391 I.E. given <temp> = &A, return A. */
11395 {
11396 tree stripped_decl;
11403 {
11408 }
11409 else
11410 {
11412 {
11417 }
11418 }
11419 }
11421 /* Return true if TYPE has a variable argument list. */
11423 bool
11425 {
11426 function_args_iterator args_iter;
11433 {
11435 }
11438 }
11440 /* Return true if TYPE has a prototype. */
11442 bool
11444 {
11445 tree t;
11451 }
11453 /* If BLOCK is inlined from an __attribute__((__artificial__))
11454 routine, return pointer to location from where it has been
11455 called. */
11456 location_t *
11458 {
11463 {
11466 {
11467 /* If AO is an artificial inline, point RET to the
11468 call site locus at which it has been inlined and continue
11469 the loop, in case AO's caller is also an artificial
11470 inline. */
11474 else
11476 }
11481 }
11483 }
11486 /* If EXP is inlined from an __attribute__((__artificial__))
11487 function, return the location of the original call expression. */
11489 location_t
11491 {
11496 else
11498 }
11500 /* Return the location into which EXP has been inlined. Analogous
11501 to tree_nonartificial_location() above but not limited to artificial
11502 functions declared inline. If SYSTEM_HEADER is true, return
11503 the macro expansion point of the location if it's in a system header */
11505 location_t
11507 {
11514 {
11522 }
11525 {
11528 /* Only consider macro expansion when the block traversal failed
11529 to find a location. Otherwise it's not relevant. */
11531 }
11534 }
11536 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11537 nodes. */
11539 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11541 hashval_t
11543 {
11551 {
11554 }
11559 else
11562 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11563 something else. */
11569 }
11571 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11572 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11573 same. */
11575 bool
11577 {
11590 else
11592 }
11594 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11596 tree
11599 {
11600 tree t;
11602 /* Use the cache of optimization nodes. */
11610 {
11611 /* Insert this one into the hash table. */
11615 /* Make a new node for next time round. */
11617 }
11620 }
11622 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11624 tree
11627 {
11628 tree t;
11630 /* Use the cache of optimization nodes. */
11638 {
11639 /* Insert this one into the hash table. */
11643 /* Make a new node for next time round. */
11645 }
11648 }
11650 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11651 so that they aren't saved during PCH writing. */
11653 void
11655 {
11660 }
11662 /* Determine the "ultimate origin" of a block. */
11664 tree
11666 {
11671 else
11672 {
11677 }
11678 }
11680 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11681 no instruction. */
11683 bool
11685 {
11686 /* Do not strip casts into or out of differing address spaces. */
11689 {
11694 }
11697 {
11698 /* We already know that outer_type is not a pointer with
11699 a non-generic address space. */
11701 }
11703 /* Use precision rather then machine mode when we can, which gives
11704 the correct answer even for submode (bit-field) types. */
11713 /* Otherwise fall back on comparing machine modes (e.g. for
11714 aggregate types, floats). */
11716 }
11718 /* Return true iff conversion in EXP generates no instruction. Mark
11719 it inline so that we fully inline into the stripping functions even
11720 though we have two uses of this function. */
11724 {
11739 }
11741 /* Return true iff conversion in EXP generates no instruction. Don't
11742 consider conversions changing the signedness. */
11744 static bool
11746 {
11757 }
11759 /* Strip conversions from EXP according to tree_nop_conversion and
11760 return the resulting expression. */
11762 tree
11764 {
11768 }
11770 /* Strip conversions from EXP according to tree_sign_nop_conversion
11771 and return the resulting expression. */
11773 tree
11775 {
11779 }
11781 /* Avoid any floating point extensions from EXP. */
11782 tree
11784 {
11787 /* For floating point constant look up the narrowest type that can hold
11788 it properly and handle it like (type)(narrowest_type)constant.
11789 This way we can optimize for instance a=a*2.0 where "a" is float
11790 but 2.0 is double constant. */
11792 {
11793 REAL_VALUE_TYPE orig;
11806 }
11825 }
11827 /* Strip out all handled components that produce invariant
11828 offsets. */
11830 const_tree
11832 {
11834 {
11836 {
11851 }
11853 }
11856 }
11860 /* Return the GCC personality function decl. */
11862 tree
11864 {
11868 }
11870 /* TARGET is a call target of GIMPLE call statement
11871 (obtained by gimple_call_fn). Return true if it is
11872 OBJ_TYPE_REF representing an virtual call of C++ method.
11873 (As opposed to OBJ_TYPE_REF representing objc calls
11874 through a cast where middle-end devirtualization machinery
11875 can't apply.) FOR_DUMP_P is true when being called from
11876 the dump routines. */
11878 bool
11880 {
11889 /* If we do not have BINFO associated, it means that type was built
11890 without devirtualization enabled. Do not consider this a virtual
11891 call. */
11895 }
11897 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
11899 static tree
11901 {
11912 }
11914 /* Try to find a base info of BINFO that would have its field decl at offset
11915 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11916 found, return, otherwise return NULL_TREE. */
11918 tree
11920 {
11924 {
11926 tree fld;
11935 {
11943 }
11947 /* Offset 0 indicates the primary base, whose vtable contents are
11948 represented in the binfo for the derived class. */
11950 {
11952 /* Offsets in BINFO are in bytes relative to the whole structure
11953 while POS is in bits relative to the containing field. */
11960 {
11963 }
11966 else
11968 binfo_offset);
11969 }
11973 }
11974 }
11976 /* Returns true if X is a typedef decl. */
11978 bool
11980 {
11983 }
11985 /* Returns true iff TYPE is a type variant created for a typedef. */
11987 bool
11989 {
11991 }
11993 /* PR 84195: Replace control characters in "unescaped" with their
11994 escaped equivalents. Allow newlines if -fmessage-length has
11995 been set to a non-zero value. This is done here, rather than
11996 where the attribute is recorded as the message length can
11997 change between these two locations. */
11999 void
12001 {
12019 {
12023 {
12027 }
12030 {
12032 {
12033 /* We only allocate space for a new string if we
12034 actually encounter a control character that
12035 needs replacing. */
12039 }
12044 {
12053 }
12054 }
12057 }
12060 {
12064 }
12065 }
12067 /* Warn about a use of an identifier which was marked deprecated. Returns
12068 whether a warning was given. */
12070 bool
12072 {
12073 escaped_string msg;
12079 {
12083 {
12088 }
12089 }
12099 {
12100 auto_diagnostic_group d;
12104 else
12109 }
12111 {
12116 {
12122 }
12124 auto_diagnostic_group d;
12126 {
12130 else
12133 }
12134 else
12135 {
12139 else
12142 }
12146 }
12149 }
12151 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12152 somewhere in it. */
12154 bool
12156 {
12158 {
12163 }
12166 }
12168 /* Try to determine whether a TRY_CATCH expression can fall through.
12169 This is a subroutine of block_may_fallthru. */
12171 static bool
12173 {
12174 tree_stmt_iterator i;
12176 /* If the TRY block can fall through, the whole TRY_CATCH can
12177 fall through. */
12183 {
12185 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12186 catch expression and a body. The whole TRY_CATCH may fall
12187 through iff any of the catch bodies falls through. */
12189 {
12192 }
12196 /* The exception filter expression only matters if there is an
12197 exception. If the exception does not match EH_FILTER_TYPES,
12198 we will execute EH_FILTER_FAILURE, and we will fall through
12199 if that falls through. If the exception does match
12200 EH_FILTER_TYPES, the stack unwinder will continue up the
12201 stack, so we will not fall through. We don't know whether we
12202 will throw an exception which matches EH_FILTER_TYPES or not,
12203 so we just ignore EH_FILTER_TYPES and assume that we might
12204 throw an exception which doesn't match. */
12208 /* This case represents statements to be executed when an
12209 exception occurs. Those statements are implicitly followed
12210 by a RESX statement to resume execution after the exception.
12211 So in this case the TRY_CATCH never falls through. */
12213 }
12214 }
12216 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12217 need not be 100% accurate; simply be conservative and return true if we
12218 don't know. This is used only to avoid stupidly generating extra code.
12219 If we're wrong, we'll just delete the extra code later. */
12221 bool
12223 {
12224 /* This CONST_CAST is okay because expr_last returns its argument
12225 unmodified and we assign it to a const_tree. */
12229 {
12232 /* Easy cases. If the last statement of the block implies
12233 control transfer, then we can't fall through. */
12237 /* If there is a default: label or case labels cover all possible
12238 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12239 to some case label in all cases and all we care is whether the
12240 SWITCH_BODY falls through. */
12257 /* The finally clause is always executed after the try clause,
12258 so if it does not fall through, then the try-finally will not
12259 fall through. Otherwise, if the try clause does not fall
12260 through, then when the finally clause falls through it will
12261 resume execution wherever the try clause was going. So the
12262 whole try-finally will only fall through if both the try
12263 clause and the finally clause fall through. */
12273 else
12275 /* FALLTHRU */
12278 /* Functions that do not return do not fall through. */
12292 }
12293 }
12295 /* True if we are using EH to handle cleanups. */
12298 /* This routine is called from front ends to indicate eh should be used for
12299 cleanups. */
12300 void
12302 {
12304 }
12306 /* Query whether EH is used for cleanups. */
12307 bool
12309 {
12311 }
12313 /* Wrapper for tree_code_name to ensure that tree code is valid */
12316 {
12319 /* The tree_code enum promotes to signed, but we could be getting
12320 invalid values, so force an unsigned comparison. */
12322 {
12326 }
12329 }
12331 /* Drops the TREE_OVERFLOW flag from T. */
12333 tree
12335 {
12338 /* For tree codes with a sharing machinery re-build the result. */
12342 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12343 and canonicalize the result. */
12345 {
12346 tree_vector_builder builder;
12350 {
12355 }
12357 }
12359 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12360 and drop the flag. */
12364 /* For constants that contain nested constants, drop the flag
12365 from those as well. */
12367 {
12372 }
12375 }
12377 /* Given a memory reference expression T, return its base address.
12378 The base address of a memory reference expression is the main
12379 object being referenced. For instance, the base address for
12380 'array[i].fld[j]' is 'array'. You can think of this as stripping
12381 away the offset part from a memory address.
12383 This function calls handled_component_p to strip away all the inner
12384 parts of the memory reference until it reaches the base object. */
12386 tree
12388 {
12400 }
12402 /* Return a tree of sizetype representing the size, in bytes, of the element
12403 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12405 tree
12407 {
12412 /* If a size was specified in the ARRAY_REF, it's the size measured
12413 in alignment units of the element type. So multiply by that value. */
12415 {
12416 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12417 sizetype from another type of the same width and signedness. */
12422 }
12424 /* Otherwise, take the size from that of the element type. Substitute
12425 any PLACEHOLDER_EXPR that we have. */
12426 else
12428 }
12430 /* Return a tree representing the lower bound of the array mentioned in
12431 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12433 tree
12435 {
12438 /* If a lower bound is specified in EXP, use it. */
12442 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12443 substituting for a PLACEHOLDER_EXPR as needed. */
12447 /* Otherwise, return a zero of the appropriate type. */
12451 }
12453 /* Return a tree representing the upper bound of the array mentioned in
12454 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12456 tree
12458 {
12461 /* If there is a domain type and it has an upper bound, use it, substituting
12462 for a PLACEHOLDER_EXPR as needed. */
12466 /* Otherwise fail. */
12468 }
12470 /* Returns true if REF is an array reference, component reference,
12471 or memory reference to an array at the end of a structure.
12472 If this is the case, the array may be allocated larger
12473 than its upper bound implies. */
12475 bool
12477 {
12478 tree atype;
12482 {
12485 }
12490 {
12496 {
12498 {
12504 }
12505 else
12507 }
12508 else
12510 }
12511 else
12519 {
12520 /* If the reference chain contains a component reference to a
12521 non-union type and there follows another field the reference
12522 is not at the end of a structure. */
12524 {
12526 {
12532 }
12533 }
12534 /* If we have a multi-dimensional array we do not consider
12535 a non-innermost dimension as flex array if the whole
12536 multi-dimensional array is at struct end.
12537 Same for an array of aggregates with a trailing array
12538 member. */
12542 ;
12543 /* If we view an underlying object as sth else then what we
12544 gathered up to now is what we have to rely on. */
12547 else
12551 }
12553 /* The array now is at struct end. Treat flexible arrays as
12554 always subject to extend, even into just padding constrained by
12555 an underlying decl. */
12561 /* If the reference is based on a declared entity, the size of the array
12562 is constrained by its given domain. (Do not trust commons PR/69368). */
12566 && !(flag_unconstrained_commons
12570 {
12571 /* Check whether the array domain covers all of the available
12572 padding. */
12573 poly_int64 offset;
12581 /* If at least one extra element fits it is a flexarray. */
12590 }
12593 }
12595 /* Return a tree representing the offset, in bytes, of the field referenced
12596 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12598 tree
12600 {
12605 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12606 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12607 value. */
12609 {
12610 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12611 sizetype from another type of the same width and signedness. */
12617 }
12619 /* Otherwise, take the offset from that of the field. Substitute
12620 any PLACEHOLDER_EXPR that we have. */
12621 else
12623 }
12625 /* Given the initializer INIT, return the initializer for the field
12626 DECL if it exists, otherwise null. Used to obtain the initializer
12627 for a flexible array member and determine its size. */
12629 static tree
12631 {
12637 {
12642 {
12646 }
12647 }
12650 }
12652 /* Determines the size of the member referenced by the COMPONENT_REF
12653 REF, using its initializer expression if necessary in order to
12654 determine the size of an initialized flexible array member.
12655 If non-null, set *ARK when REF refers to an interior zero-length
12656 array or a trailing one-element array.
12657 Returns the size as sizetype (which might be zero for an object
12658 with an uninitialized flexible array member) or null if the size
12659 cannot be determined. */
12661 tree
12663 {
12666 special_array_member sambuf;
12671 /* The object/argument referenced by the COMPONENT_REF and its type. */
12674 /* The referenced member. */
12679 {
12682 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
12683 to the type of a class with a virtual base which doesn't
12684 reflect the size of the virtual's members (see pr97595).
12685 If that's the case fail for now and implement something
12686 more robust in the future. */
12693 /* MEMBER is either an interior array or is an array with
12694 more than one element. */
12698 {
12701 else
12702 {
12705 }
12706 }
12714 {
12719 /* MEMBER is an array with more than one element. */
12724 }
12726 /* For a reference to a zero- or one-element array member of a union
12727 use the size of the union instead of the size of the member. */
12730 }
12732 /* MEMBER is either a bona fide flexible array member, or a zero-length
12733 array member, or an array of length one treated as such. */
12735 /* If the reference is to a declared object and the member a true
12736 flexible array, try to determine its size from its initializer. */
12740 {
12751 }
12753 /* BASE is the declared object of which MEMBER is either a member
12754 or that is cast to ARGTYPE (e.g., a char buffer used to store
12755 an ARGTYPE object). */
12758 /* Determine the base type of the referenced object. If it's
12759 the same as ARGTYPE and MEMBER has a known size, return it. */
12771 /* MEMBER is a true flexible array member. Compute its size from
12772 the initializer of the BASE object if it has one. */
12775 {
12778 {
12781 {
12782 /* Use the larger of the initializer size and the tail
12783 padding in the enclosing struct. */
12788 }
12791 }
12792 }
12795 {
12797 {
12802 /* The size of a flexible array member of an extern struct
12803 with no initializer cannot be determined (it's defined
12804 in another translation unit and can have an initializer
12805 with an arbitrary number of elements). */
12808 /* Use the size of the base struct or, for interior zero-length
12809 arrays, the size of the enclosing type. */
12811 }
12813 /* Use the size of the BASE object (possibly an array of some
12814 other type such as char used to store the struct). */
12816 else
12818 }
12820 /* If the flexible array member has a known size use the greater
12821 of it and the tail padding in the enclosing struct.
12822 Otherwise, when the size of the flexible array member is unknown
12823 and the referenced object is not a struct, use the size of its
12824 type when known. This detects sizes of array buffers when cast
12825 to struct types with flexible array members. */
12827 {
12830 {
12833 }
12835 }
12837 /* Return "don't know" for an external non-array object since its
12838 flexible array member can be initialized to have any number of
12839 elements. Otherwise, return zero because the flexible array
12840 member has no elements. */
12843 && (!typematch
12846 }
12848 /* Return the machine mode of T. For vectors, returns the mode of the
12849 inner type. The main use case is to feed the result to HONOR_NANS,
12850 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12852 machine_mode
12854 {
12860 }
12862 /* Vector types need to re-check the target flags each time we report
12863 the machine mode. We need to do this because attribute target can
12864 change the result of vector_mode_supported_p and have_regs_of_mode
12865 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
12866 change on a per-function basis. */
12867 /* ??? Possibly a better solution is to run through all the types
12868 referenced by a function and re-compute the TYPE_MODE once, rather
12869 than make the TYPE_MODE macro call a function. */
12871 machine_mode
12873 {
12874 machine_mode mode;
12882 {
12883 scalar_int_mode innermode;
12885 /* For integers, try mapping it to a same-sized scalar mode. */
12887 {
12890 scalar_int_mode mode;
12894 }
12897 }
12900 }
12902 /* Return the size in bits of each element of vector type TYPE. */
12904 unsigned int
12906 {
12911 }
12913 /* Calculate the size in bits of each element of vector type TYPE
12914 and return the result as a tree of type bitsizetype. */
12916 tree
12918 {
12923 }
12925 /* Verify that basic properties of T match TV and thus T can be a variant of
12926 TV. TV should be the more specified variant (i.e. the main variant). */
12928 static bool
12930 {
12931 /* Type variant can differ by:
12933 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
12934 ENCODE_QUAL_ADDR_SPACE.
12935 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
12936 in this case some values may not be set in the variant types
12937 (see TYPE_COMPLETE_P checks).
12938 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
12939 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
12940 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
12941 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
12942 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
12943 this is necessary to make it possible to merge types form different TUs
12944 - arrays, pointers and references may have TREE_TYPE that is a variant
12945 of TREE_TYPE of their main variants.
12946 - aggregates may have new TYPE_FIELDS list that list variants of
12947 the main variant TYPE_FIELDS.
12948 - vector types may differ by TYPE_VECTOR_OPAQUE
12949 */
12951 /* Convenience macro for matching individual fields. */
12952 #define verify_variant_match(flag) \
12953 do { \
12954 if (flag (tv) != flag (t)) \
12955 { \
12957 debug_tree (tv); \
12958 return false; \
12959 } \
12960 } while (false)
12962 /* tree_base checks. */
12965 /* FIXME: Ada builds non-artificial variants of artificial types. */
12966 #if 0
12969 #endif
12972 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
12979 else
12981 /* FIXME: This check trigger during libstdc++ build. */
12982 #if 0
12985 #endif
12987 /* tree_type_common checks. */
12990 {
12998 {
13008 }
13010 }
13016 /* During LTO we merge variant lists from diferent translation units
13017 that may differ BY TYPE_CONTEXT that in turn may point
13018 to TRANSLATION_UNIT_DECL.
13019 Ada also builds variants of types with different TYPE_CONTEXT. */
13020 #if 0
13023 #endif
13029 {
13033 }
13035 /* tree_type_non_common checks. */
13037 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13038 and dangle the pointer from time to time. */
13042 {
13046 }
13052 {
13055 }
13062 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13063 or even type's main variant. This is needed to make bootstrap pass
13064 and the bug seems new in GCC 5.
13065 C++ FE should be updated to make this consistent and we should check
13066 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13067 is a match with main variant.
13069 Also disable the check for Java for now because of parser hack that builds
13070 first an dummy BINFO and then sometimes replace it by real BINFO in some
13071 of the copies. */
13074 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13075 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13076 at LTO time only. */
13078 {
13086 }
13088 /* Check various uses of TYPE_VALUES_RAW. */
13094 /* Permit incomplete variants of complete type. While FEs may complete
13095 all variants, this does not happen for C++ templates in all cases. */
13099 {
13102 /* Fortran builds qualified variants as new records with items of
13103 qualified type. Verify that they looks same. */
13110 /* FIXME: gfc_nonrestricted_type builds all types as variants
13111 with exception of pointer types. It deeply copies the type
13112 which means that we may end up with a variant type
13113 referring non-variant pointer. We may change it to
13114 produce types as variants, too, like
13115 objc_get_protocol_qualified_type does. */
13121 {
13129 }
13130 }
13133 /* For C++ the qualified variant of array type is really an array type
13134 of qualified TREE_TYPE.
13135 objc builds variants of pointer where pointer to type is a variant, too
13136 in objc_get_protocol_qualified_type. */
13142 {
13150 }
13153 {
13161 }
13163 #undef verify_variant_match
13164 }
13167 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13168 the middle-end types_compatible_p function. It needs to avoid
13169 claiming types are different for types that should be treated
13170 the same with respect to TBAA. Canonical types are also used
13171 for IL consistency checks via the useless_type_conversion_p
13172 predicate which does not handle all type kinds itself but falls
13173 back to pointer-comparison of TYPE_CANONICAL for aggregates
13174 for example. */
13176 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13177 type calculation because we need to allow inter-operability between signed
13178 and unsigned variants. */
13180 bool
13182 {
13183 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13184 signed char and unsigned char. Similarly fortran FE builds
13185 C_SIZE_T as signed type, while C defines it unsigned. */
13188 == INTEGER_TYPE
13191 }
13193 /* Return true iff T1 and T2 are structurally identical for what
13194 TBAA is concerned.
13195 This function is used both by lto.c canonical type merging and by the
13196 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13197 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13198 only for LTO because only in these cases TYPE_CANONICAL equivalence
13199 correspond to one defined by gimple_canonical_types_compatible_p. */
13201 bool
13204 {
13205 /* Type variants should be same as the main variant. When not doing sanity
13206 checking to verify this fact, go to main variants and save some work. */
13208 {
13211 }
13213 /* Check first for the obvious case of pointer identity. */
13217 /* Check that we have two types to compare. */
13221 /* We consider complete types always compatible with incomplete type.
13222 This does not make sense for canonical type calculation and thus we
13223 need to ensure that we are never called on it.
13225 FIXME: For more correctness the function probably should have three modes
13226 1) mode assuming that types are complete mathcing their structure
13227 2) mode allowing incomplete types but producing equivalence classes
13228 and thus ignoring all info from complete types
13229 3) mode allowing incomplete types to match complete but checking
13230 compatibility between complete types.
13232 1 and 2 can be used for canonical type calculation. 3 is the real
13233 definition of type compatibility that can be used i.e. for warnings during
13234 declaration merging. */
13239 /* If the types have been previously registered and found equal
13240 they still are. */
13244 {
13245 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13246 they are always NULL, but they are set to non-NULL for types
13247 constructed by build_pointer_type and variants. In this case the
13248 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13249 all pointers are considered equal. Be sure to not return false
13250 negatives. */
13254 }
13256 /* For types where we do ODR based TBAA the canonical type is always
13257 set correctly, so we know that types are different if their
13258 canonical types does not match. */
13264 /* Can't be the same type if the types don't have the same code. */
13269 /* Qualifiers do not matter for canonical type comparison purposes. */
13271 /* Void types and nullptr types are always the same. */
13276 /* Can't be the same type if they have different mode. */
13280 /* Non-aggregate types can be handled cheaply. */
13288 {
13289 /* Can't be the same type if they have different recision. */
13293 /* In some cases the signed and unsigned types are required to be
13294 inter-operable. */
13299 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13300 interoperable with "signed char". Unless all frontends are revisited
13301 to agree on these types, we must ignore the flag completely. */
13303 /* Fortran standard define C_PTR type that is compatible with every
13304 C pointer. For this reason we need to glob all pointers into one.
13305 Still pointers in different address spaces are not compatible. */
13307 {
13311 }
13313 /* Tail-recurse to components. */
13318 trust_type_canonical);
13321 }
13323 /* Do type-specific comparisons. */
13325 {
13327 /* Array types are the same if the element types are the same and
13328 the number of elements are the same. */
13330 trust_type_canonical)
13335 else
13336 {
13340 /* For an incomplete external array, the type domain can be
13341 NULL_TREE. Check this condition also. */
13346 else
13347 {
13353 /* The minimum/maximum values have to be the same. */
13365 else
13367 }
13368 }
13372 /* Function types are the same if the return type and arguments types
13373 are the same. */
13375 trust_type_canonical))
13380 else
13381 {
13387 {
13390 trust_type_canonical))
13392 }
13398 }
13403 {
13406 /* Don't try to compare variants of an incomplete type, before
13407 TYPE_FIELDS has been copied around. */
13415 /* For aggregate types, all the fields must be the same. */
13419 {
13420 /* Skip non-fields and zero-sized fields. */
13431 /* The fields must have the same name, offset and type. */
13434 || !gimple_canonical_types_compatible_p
13436 trust_type_canonical))
13438 }
13440 /* If one aggregate has more fields than the other, they
13441 are not the same. */
13446 }
13449 /* Consider all types with language specific trees in them mutually
13450 compatible. This is executed only from verify_type and false
13451 positives can be tolerated. */
13454 }
13455 }
13457 /* Verify type T. */
13459 void
13461 {
13465 {
13468 }
13470 {
13474 }
13480 ;
13482 {
13486 }
13487 /* Method and function types cannot be used to address memory and thus
13488 TYPE_CANONICAL really matters only for determining useless conversions.
13490 FIXME: C++ FE produce declarations of builtin functions that are not
13491 compatible with main variants. */
13493 ;
13495 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
13496 with variably sized arrays because their sizes possibly
13497 gimplified to different variables. */
13501 {
13505 }
13509 {
13513 }
13515 {
13520 }
13523 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13525 {
13526 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13527 and danagle the pointer from time to time. */
13531 {
13535 }
13536 }
13538 {
13541 {
13545 }
13546 }
13548 {
13551 {
13555 }
13556 }
13559 {
13560 /* FIXME: The following check should pass:
13561 useless_type_conversion_p (const_cast <tree> (t),
13562 TREE_TYPE (TYPE_MIN_VALUE (t))
13563 but does not for C sizetypes in LTO. */
13564 }
13566 /* Check various uses of TYPE_MAXVAL_RAW. */
13568 {
13570 ;
13572 {
13576 }
13578 {
13582 }
13583 }
13585 {
13589 {
13593 }
13594 }
13596 {
13600 {
13604 }
13605 }
13608 {
13609 /* FIXME: The following check should pass:
13610 useless_type_conversion_p (const_cast <tree> (t),
13611 TREE_TYPE (TYPE_MAX_VALUE (t))
13612 but does not for C sizetypes in LTO. */
13613 }
13615 {
13618 {
13622 }
13623 }
13625 {
13629 }
13632 {
13636 }
13638 /* Check various uses of TYPE_VALUES_RAW. */
13641 {
13645 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13646 CONST_DECL of ENUMERAL TYPE. */
13648 {
13653 }
13656 {
13662 }
13664 {
13669 }
13670 }
13672 {
13674 {
13678 }
13679 }
13681 {
13683 {
13686 }
13688 {
13689 /* TODO: verify properties of decls. */
13691 ;
13693 ;
13695 ;
13697 ;
13699 ;
13701 ;
13703 ;
13704 else
13705 {
13709 }
13710 }
13711 }
13718 {
13720 {
13725 }
13727 {
13731 }
13732 /* Verify just enough of cache to ensure that no one copied it to new type.
13733 All copying should go by copy_node that should clear it. */
13735 {
13740 {
13745 }
13746 }
13747 }
13750 {
13751 /* C++ FE uses TREE_PURPOSE to store initial values. */
13753 {
13757 }
13759 {
13763 }
13764 }
13766 {
13770 }
13778 {
13781 }
13783 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13784 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13785 of a type. */
13788 {
13791 }
13794 {
13797 }
13798 }
13801 /* Return 1 if ARG interpreted as signed in its precision is known to be
13802 always positive or 2 if ARG is known to be always negative, or 3 if
13803 ARG may be positive or negative. */
13805 int
13807 {
13814 {
13818 else
13820 }
13824 {
13826 /* Narrower value zero extended into wider type
13827 will always result in positive values. */
13834 }
13838 value_range r;
13840 {
13844 {
13848 {
13857 }
13858 }
13860 }
13862 {
13863 /* For unsigned values, the "positive" range comes
13864 below the "negative" range. */
13869 }
13870 else
13871 {
13876 }
13878 }
13883 /* Return true if ARG is marked with the nonnull attribute in the
13884 current function signature. */
13886 bool
13888 {
13896 /* The static chain decl is always non null. */
13900 /* THIS argument of method is always non-NULL. */
13906 /* Values passed by reference are always non-NULL. */
13913 {
13916 /* If "nonnull" wasn't specified, we know nothing about the argument. */
13920 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
13924 /* Get the position number for ARG in the function signature. */
13926 t;
13928 {
13931 }
13935 /* Now see if ARG_NUM is mentioned in the nonnull list. */
13937 {
13940 }
13941 }
13944 }
13946 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
13947 information. */
13949 location_t
13951 {
13955 }
13957 location_t
13959 {
13960 source_range src_range;
13964 }
13966 location_t
13968 {
13974 pure_loc,
13975 src_range,
13976 NULL);
13979 }
13981 /* Return EXPR, potentially wrapped with a node expression LOC,
13982 if !CAN_HAVE_LOCATION_P (expr).
13984 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
13985 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
13987 Wrapper nodes can be identified using location_wrapper_p. */
13989 tree
13991 {
13998 /* We should only be adding wrappers for constants and for decls,
13999 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14004 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14005 any impact of the wrapper nodes. */
14009 /* Compiler-generated temporary variables don't need a wrapper. */
14013 /* If any auto_suppress_location_wrappers are active, don't create
14014 wrappers. */
14018 tree_code code
14023 /* Mark this node as being a wrapper. */
14026 }
14030 /* Return the name of combined function FN, for debugging purposes. */
14034 {
14036 {
14039 }
14040 else
14042 }
14044 /* Return a bitmap with a bit set corresponding to each argument in
14045 a function call type FNTYPE declared with attribute nonnull,
14046 or null if none of the function's argument are nonnull. The caller
14047 must free the bitmap. */
14049 bitmap
14051 {
14057 {
14058 /* The this pointer in C++ non-static member functions is
14059 implicitly nonnull whether or not it's declared as such. */
14062 }
14068 /* A function declaration can specify multiple attribute nonnull,
14069 each with zero or more arguments. The loop below creates a bitmap
14070 representing a union of all the arguments. An empty (but non-null)
14071 bitmap means that all arguments have been declaraed nonnull. */
14073 {
14082 {
14083 /* Clear the bitmap in case a previous attribute nonnull
14084 set it and this one overrides it for all arguments. */
14087 }
14089 /* Iterate over the indices of the format arguments declared nonnull
14090 and set a bit for each. */
14092 {
14095 }
14096 }
14099 }
14101 /* Returns true if TYPE is a type where it and all of its subobjects
14102 (recursively) are of structure, union, or array type. */
14104 bool
14106 {
14108 {
14115 }
14121 }
14123 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14124 that shouldn't be passed via stack. */
14126 bool
14128 {
14139 }
14141 /* Determine whether TYPE is a structure with a flexible array member,
14142 or a union containing such a structure (possibly recursively). */
14144 bool
14146 {
14149 {
14165 {
14169 }
14173 }
14174 }
14176 /* Like int_size_in_bytes, but handle empty records specially. */
14178 HOST_WIDE_INT
14180 {
14182 }
14184 /* Like size_in_bytes, but handle empty records specially. */
14186 tree
14188 {
14190 }
14192 /* Return true if an expression with CODE has to have the same result type as
14193 its first operand. */
14195 bool
14197 {
14199 {
14233 }
14234 }
14236 /* Return a typenode for the "standard" C type with a given name. */
14237 tree
14239 {
14271 }
14273 /* List of pointer types used to declare builtins before we have seen their
14274 real declaration.
14276 Keep the size up to date in tree.h ! */
14278 {
14285 };
14287 /* Return the maximum object size. */
14289 tree
14291 {
14292 /* To do: Make this a configurable parameter. */
14294 }
14296 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14297 parameter default to false and that weeds out error_mark_node. */
14299 bool
14302 {
14309 }
14311 /* Return that NEW_ASM and DELETE_ASM name a valid pair of new and
14312 delete operators. */
14314 bool
14316 {
14334 /* *_len is now just the length after initial underscores. */
14339 /* _Znw must match _Zdl, _Zna must match _Zda. */
14343 /* 'j', 'm' and 'y' correspond to size_t. */
14350 {
14351 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14352 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14359 }
14363 {
14364 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14365 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14366 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14376 }
14378 }
14380 #if CHECKING_P
14384 /* Selftests for tree. */
14386 /* Verify that integer constants are sane. */
14388 static void
14390 {
14403 }
14405 /* Verify identifiers. */
14407 static void
14409 {
14413 }
14415 /* Verify LABEL_DECL. */
14417 static void
14419 {
14425 }
14427 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14428 are given by VALS. */
14430 static tree
14432 {
14437 }
14439 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14441 static void
14443 {
14449 }
14451 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14452 and that its elements match EXPECTED. */
14454 static void
14457 {
14464 }
14466 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14467 and NPATTERNS background elements, and that its elements match
14468 EXPECTED. */
14470 static void
14473 {
14480 }
14482 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14483 and that its elements match EXPECTED. */
14485 static void
14488 {
14495 }
14497 /* Test the creation of VECTOR_CSTs. */
14499 static void
14501 {
14507 /* Test a simple linear series with a base of 0 and a step of 1:
14508 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14514 /* Try the same with the first element replaced by 100:
14515 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14520 /* Try a series that wraps around.
14521 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14527 /* Try a downward series:
14528 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14534 /* Try two interleaved series with different bases and steps:
14535 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14538 {
14541 }
14545 /* Try a duplicated value:
14546 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14552 /* Try an interleaved duplicated value:
14553 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14560 /* Try a duplicated value with 2 exceptions
14561 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14567 /* Try with and without a step
14568 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14574 /* Try a fully-general constant:
14575 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14579 }
14581 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
14582 Helper function for test_location_wrappers, to deal with STRIP_NOPS
14583 modifying its argument in-place. */
14585 static void
14587 {
14590 }
14592 /* Verify location wrappers. */
14594 static void
14596 {
14601 /* Wrapping a constant. */
14611 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
14614 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
14619 /* Wrapping a STRING_CST. */
14631 /* Wrapping a variable. */
14634 integer_type_node);
14643 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
14644 wrapper. */
14649 /* Verify that STRIP_NOPS removes wrappers. */
14653 }
14655 /* Test various tree predicates. Verify that location wrappers don't
14656 affect the results. */
14658 static void
14660 {
14661 /* Build various constants and wrappers around them. */
14689 /* TODO: vector constants. */
14691 /* Test integer_onep. */
14711 /* Test integer_zerop. */
14731 /* Test integer_all_onesp. */
14751 /* Test integer_minus_onep. */
14771 /* Test integer_each_onep. */
14791 /* Test integer_truep. */
14811 /* Test integer_nonzerop. */
14831 /* Test real_zerop. */
14851 /* Test real_onep. */
14871 /* Test real_minus_onep. */
14891 /* Test zerop. */
14911 /* Test tree_expr_nonnegative_p. */
14931 /* Test tree_expr_nonzero_p. */
14939 /* Test integer_valued_real_p. */
14946 /* Test integer_pow2p. */
14951 /* Test uniform_integer_cst_p. */
14970 }
14972 /* Check that string escaping works correctly. */
14974 static void
14976 {
14978 escaped_string msg;
14981 /* ASSERT_STREQ does not accept NULL as a valid test
14982 result, so we have to use ASSERT_EQ instead. */
14991 /* Ensure that we have -fmessage-length set to 0. */
15001 /* Now repeat the tests with -fmessage-length set to 5. */
15004 /* Note that the newline is not translated into an escape. */
15011 /* Restore the original message length setting. */
15013 }
15015 /* Run all of the selftests within this file. */
15017 void
15019 {
15027 }