| blob | 72311005f57b2f0ec8b0233c178456114eac339f |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2020 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
72 /* Tree code classes. */
74 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
75 #define END_OF_BASE_TREE_CODES tcc_exceptional,
79 };
81 #undef DEFTREECODE
82 #undef END_OF_BASE_TREE_CODES
84 /* Table indexed by tree code giving number of expression
85 operands beyond the fixed part of the node structure.
86 Not used for types or decls. */
88 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
89 #define END_OF_BASE_TREE_CODES 0,
93 };
95 #undef DEFTREECODE
96 #undef END_OF_BASE_TREE_CODES
98 /* Names of tree components.
99 Used for printing out the tree and error messages. */
100 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
105 };
107 #undef DEFTREECODE
108 #undef END_OF_BASE_TREE_CODES
110 /* Each tree code class has an associated string representation.
111 These must correspond to the tree_code_class entries. */
114 {
125 "expression"
126 };
128 /* obstack.[ch] explicitly declined to prototype this. */
131 /* Statistics-gathering stuff. */
137 /* Keep in sync with tree.h:enum tree_node_kind. */
155 };
157 /* Unique id for next decl created. */
159 /* Unique id for next type created. */
161 /* Unique id for next debug decl created. Use negative numbers,
162 to catch erroneous uses. */
165 /* Since we cannot rehash a type after it is in the table, we have to
166 keep the hash code. */
170 tree type;
171 };
173 /* Initial size of the hash table (rounded to next prime). */
174 #define TYPE_HASH_INITIAL_SIZE 1000
177 {
181 static int
183 {
185 }
186 };
188 /* Now here is the hash table. When recording a type, it is added to
189 the slot whose index is the hash code. Note that the hash table is
190 used for several kinds of types (function types, array types and
191 array index range types, for now). While all these live in the
192 same table, they are completely independent, and the hash code is
193 computed differently for each of these. */
197 /* Hash table and temporary node for larger integer const values. */
201 {
204 };
208 /* Class and variable for making sure that there is a single POLY_INT_CST
209 for a given value. */
211 {
215 };
219 /* Hash table for optimization flags and target option flags. Use the same
220 hash table for both sets of options. Nodes for building the current
221 optimization and target option nodes. The assumption is most of the time
222 the options created will already be in the hash table, so we avoid
223 allocating and freeing up a node repeatably. */
228 {
231 };
235 /* General tree->tree mapping structure for use in hash tables. */
245 {
248 static bool
250 {
252 }
254 static int
256 {
258 }
259 };
279 /* Number of operands for each OpenMP clause. */
281 {
363 };
366 {
448 };
451 /* Return the tree node structure used by tree code CODE. */
455 {
457 {
460 {
472 }
486 }
489 {
490 /* tcc_constant cases. */
500 /* tcc_exceptional cases. */
517 }
518 }
521 /* Initialize tree_contains_struct to describe the hierarchy of tree
522 nodes. */
524 static void
526 {
530 {
537 /* Mark the TS structure itself. */
540 /* Mark all the structures that TS is derived from. */
542 {
622 }
623 }
625 /* Basic consistency checks for attributes used in fold. */
666 }
669 /* Init tree.c. */
671 void
673 {
674 /* Initialize the hash table of types. */
675 type_hash_table
678 debug_expr_for_decl
681 value_expr_for_decl
695 /* Initialize the tree_contains_struct array. */
698 }
700 \f
701 /* The name of the object as the assembler will see it (but before any
702 translations made by ASM_OUTPUT_LABELREF). Often this is the same
703 as DECL_NAME. It is an IDENTIFIER_NODE. */
704 tree
706 {
710 }
712 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
713 (either of which may be NULL). Inform the FE, if this changes the
714 name. */
716 void
718 {
721 }
723 /* When the target supports COMDAT groups, this indicates which group the
724 DECL is associated with. This can be either an IDENTIFIER_NODE or a
725 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
726 tree
728 {
733 }
735 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
736 tree
738 {
743 }
745 /* When the target supports named section, return its name as IDENTIFIER_NODE
746 or NULL if it is in no section. */
749 {
754 }
756 /* Set section name of NODE to VALUE (that is expected to be
757 identifier node) */
758 void
760 {
764 {
768 }
771 else
774 }
776 /* Set section name of NODE to match the section name of OTHER.
778 set_decl_section_name (decl, other) is equivalent to
779 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
780 efficient. */
781 void
783 {
786 {
790 else
793 }
794 else
795 {
800 }
801 }
803 /* Return TLS model of a variable NODE. */
804 enum tls_model
806 {
811 }
813 /* Set TLS model of variable NODE to MODEL. */
814 void
816 {
820 {
824 }
825 else
828 }
830 /* Compute the number of bytes occupied by a tree with code CODE.
831 This function cannot be used for nodes that have variable sizes,
832 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
833 size_t
835 {
837 {
840 {
857 }
861 {
885 }
898 {
910 }
914 {
935 }
939 }
940 }
942 /* Compute the number of bytes occupied by NODE. This routine only
943 looks at TREE_CODE, except for those nodes that have variable sizes. */
944 size_t
946 {
949 {
979 else
981 }
982 }
984 /* Return tree node kind based on tree CODE. */
986 static tree_node_kind
988 {
992 {
1010 {
1027 }
1033 }
1034 }
1036 /* Record interesting allocation statistics for a tree node with CODE
1037 and LENGTH. */
1039 static void
1041 {
1050 }
1052 /* Allocate and return a new UID from the DECL_UID namespace. */
1054 int
1056 {
1058 }
1060 /* Return a newly allocated node of code CODE. For decl and type
1061 nodes, some other fields are initialized. The rest of the node is
1062 initialized to zero. This function cannot be used for TREE_VEC,
1063 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1064 tree_code_size.
1066 Achoo! I got a code in the node. */
1068 tree
1070 {
1071 tree t;
1081 {
1089 {
1091 {
1094 }
1095 else
1097 }
1101 else
1102 {
1105 }
1118 /* Default to no attributes for type, but let target change that. */
1122 /* We have not yet computed the alias set for this type. */
1132 {
1140 /* All of these have side-effects, no matter what their
1141 operands are. */
1147 }
1152 {
1165 }
1169 /* Other classes need no special treatment. */
1171 }
1174 }
1176 /* Free tree node. */
1178 void
1180 {
1183 {
1193 }
1205 }
1206 \f
1207 /* Return a new node with the same contents as NODE except that its
1208 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1210 tree
1212 {
1213 tree t;
1230 {
1233 else
1234 {
1238 }
1241 {
1244 }
1245 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1247 {
1250 }
1252 {
1255 }
1257 {
1260 }
1261 }
1263 {
1265 /* The following is so that the debug code for
1266 the copy is different from the original type.
1267 The two statements usually duplicate each other
1268 (because they clear fields of the same union),
1269 but the optimizer should catch that. */
1273 /* Do not copy the values cache. */
1275 {
1278 }
1279 }
1281 {
1285 }
1287 {
1291 }
1294 }
1296 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1297 For example, this can copy a list made of TREE_LIST nodes. */
1299 tree
1301 {
1302 tree head;
1311 {
1315 }
1317 }
1319 \f
1320 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1321 INTEGER_CST with value CST and type TYPE. */
1323 static unsigned int
1325 {
1327 /* We need extra HWIs if CST is an unsigned integer with its
1328 upper bit set. */
1332 }
1334 /* Return a new INTEGER_CST with value CST and type TYPE. */
1336 static tree
1338 {
1344 {
1350 }
1353 {
1354 len--;
1358 }
1364 }
1366 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1368 static tree
1370 CXX_MEM_STAT_INFO)
1371 {
1383 }
1385 /* Create a constant tree that contains CST sign-extended to TYPE. */
1387 tree
1389 {
1390 /* Support legacy code. */
1395 }
1397 /* Create a constant tree that contains CST zero-extended to TYPE. */
1399 tree
1401 {
1403 }
1405 /* Create a constant tree that contains CST sign-extended to TYPE. */
1407 tree
1409 {
1412 }
1414 /* Constructs tree in type TYPE from with value given by CST. Signedness
1415 of CST is assumed to be the same as the signedness of TYPE. */
1417 tree
1419 {
1421 }
1423 /* We force the wide_int CST to the range of the type TYPE by sign or
1424 zero extending it. OVERFLOWABLE indicates if we are interested in
1425 overflow of the value, when >0 we are only interested in signed
1426 overflow, for <0 we are interested in any overflow. OVERFLOWED
1427 indicates whether overflow has already occurred. CONST_OVERFLOWED
1428 indicates whether constant overflow has already occurred. We force
1429 T's value to be within range of T's type (by setting to 0 or 1 all
1430 the bits outside the type's range). We set TREE_OVERFLOWED if,
1431 OVERFLOWED is nonzero,
1432 or OVERFLOWABLE is >0 and signed overflow occurs
1433 or OVERFLOWABLE is <0 and any overflow occurs
1434 We return a new tree node for the extended wide_int. The node
1435 is shared if no overflow flags are set. */
1438 tree
1441 {
1444 /* If we need to set overflow flags, return a new unshared node. */
1446 {
1450 {
1452 sign);
1453 tree t;
1456 else
1457 {
1460 {
1463 }
1465 }
1468 }
1469 }
1471 /* Else build a shared node. */
1473 }
1475 /* These are the hash table functions for the hash table of INTEGER_CST
1476 nodes of a sizetype. */
1478 /* Return the hash code X, an INTEGER_CST. */
1480 hashval_t
1482 {
1491 }
1493 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1494 is the same as that given by *Y, which is the same. */
1496 bool
1498 {
1512 }
1514 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1515 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1516 number of slots that can be cached for the type. */
1521 {
1523 /* Initialize cache. */
1525 {
1528 }
1531 {
1532 /* Create a new shared int. */
1535 }
1537 }
1539 /* Create an INT_CST node of TYPE and value CST.
1540 The returned node is always shared. For small integers we use a
1541 per-type vector cache, for larger ones we use a single hash table.
1542 The value is extended from its precision according to the sign of
1543 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1544 the upper bits and ensures that hashing and value equality based
1545 upon the underlying HOST_WIDE_INTs works without masking. */
1547 static tree
1549 {
1550 tree t;
1558 /* Verify that everything is canonical. */
1561 {
1566 }
1573 {
1574 /* Cache NULL pointer and zero bounds. */
1577 /* Cache upper bounds of pointers. */
1580 /* Cache 1 which is used for a non-zero range. */
1585 {
1587 /* Make sure no one is clobbering the shared constant. */
1591 }
1592 }
1594 {
1595 /* We just need to store a single HOST_WIDE_INT. */
1596 HOST_WIDE_INT hwi;
1599 else
1603 {
1606 /* Fallthru. */
1610 /* Ignore pointers, as they were already handled above. */
1614 /* Cache false or true. */
1623 {
1624 /* Cache [0, N). */
1628 }
1629 else
1630 {
1631 /* Cache [-1, N). */
1635 }
1643 }
1646 {
1648 /* Make sure no one is clobbering the shared constant. */
1655 }
1656 else
1657 {
1658 /* Use the cache of larger shared ints, using int_cst_node as
1659 a temporary. */
1667 {
1668 /* Insert this one into the hash table. */
1671 /* Make a new node for next time round. */
1673 }
1674 }
1675 }
1676 else
1677 {
1678 /* The value either hashes properly or we drop it on the floor
1679 for the gc to take care of. There will not be enough of them
1680 to worry about. */
1686 {
1687 /* Insert this one into the hash table. */
1690 }
1691 else
1693 }
1696 }
1698 hashval_t
1700 {
1708 }
1710 bool
1712 {
1719 }
1721 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1722 The elements must also have type TYPE. */
1724 tree
1726 {
1737 INSERT);
1739 {
1744 }
1746 }
1748 /* Create a constant tree with value VALUE in type TYPE. */
1750 tree
1752 {
1756 }
1758 /* Insert INTEGER_CST T into a cache of integer constants. And return
1759 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1760 is false, and T falls into the type's 'smaller values' range, there
1761 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1762 or the value is large, should an existing entry exist, it is
1763 returned (rather than inserting T). */
1765 tree
1767 {
1775 /* The caching indices here must match those in
1776 wide_int_to_type_1. */
1778 {
1781 /* Fallthru. */
1785 {
1793 }
1797 /* Cache false or true. */
1806 {
1807 /* Cache 0..N */
1810 /* This is a little hokie, but if the prec is smaller than
1811 what is necessary to hold param_integer_share_limit, then the
1812 obvious test will not get the correct answer. */
1814 {
1818 }
1821 }
1822 else
1823 {
1824 /* Cache -1..N */
1830 {
1832 {
1835 }
1838 }
1839 }
1843 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1844 members. */
1849 }
1852 {
1853 /* Look for it in the type's vector of small shared ints. */
1855 {
1858 }
1861 {
1864 }
1865 else
1867 }
1868 else
1869 {
1870 /* Use the cache of larger shared ints. */
1873 {
1874 /* If there is already an entry for the number verify it's the
1875 same value. */
1877 /* And return the cached value. */
1879 }
1880 else
1881 /* Otherwise insert this one into the hash table. */
1883 }
1886 }
1889 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1890 and the rest are zeros. */
1892 tree
1894 {
1899 }
1901 /* Checks that X is integer constant that can be expressed in (unsigned)
1902 HOST_WIDE_INT without loss of precision. */
1904 bool
1906 {
1909 }
1911 /* Build a newly constructed VECTOR_CST with the given values of
1912 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1914 tree
1917 {
1919 tree t;
1935 }
1937 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1938 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1940 tree
1942 {
1947 tree value;
1949 /* We can't construct a VECTOR_CST for a variable number of elements. */
1953 {
1955 {
1956 /* If NELTS is constant then this must be too. */
1960 }
1961 else
1963 }
1968 }
1970 /* Build a vector of type VECTYPE where all the elements are SCs. */
1971 tree
1973 {
1979 /* Verify that the vector type is suitable for SC. Note that there
1980 is some inconsistency in the type-system with respect to restrict
1981 qualifications of pointers. Vector types always have a main-variant
1982 element type and the qualification is applied to the vector-type.
1983 So TREE_TYPE (vector-type) does not return a properly qualified
1984 vector element-type. */
1989 {
1993 }
1996 else
1997 {
2003 }
2004 }
2006 /* If TYPE is not a vector type, just return SC, otherwise return
2007 build_vector_from_val (TYPE, SC). */
2009 tree
2011 {
2016 }
2018 /* Build a vector series of type TYPE in which element I has the value
2019 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2020 and a VEC_SERIES_EXPR otherwise. */
2022 tree
2024 {
2028 {
2038 }
2040 }
2042 /* Return a vector with the same number of units and number of bits
2043 as VEC_TYPE, but in which the elements are a linear series of unsigned
2044 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2046 tree
2048 {
2053 {
2054 index_elt_type = build_nonstandard_integer_type
2057 }
2063 }
2065 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2066 elements are A and the rest are B. */
2068 tree
2070 {
2073 /* Optimize the constant case. */
2080 }
2082 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2083 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2085 void
2087 {
2089 tree val;
2095 {
2096 /* Mostly ctors will have elts that don't have side-effects, so
2097 the usual case is to scan all the elements. Hence a single
2098 loop for both const and side effects, rather than one loop
2099 each (with early outs). */
2104 }
2108 }
2110 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2111 CONSTRUCTOR C. */
2113 void
2115 {
2117 tree val;
2123 {
2128 }
2129 }
2131 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2132 are in the vec pointed to by VALS. */
2133 tree
2135 {
2144 }
2146 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2147 INDEX and VALUE. */
2148 tree
2150 {
2158 }
2161 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2162 are in a list pointed to by VALS. */
2163 tree
2165 {
2166 tree t;
2170 {
2174 }
2177 }
2179 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2180 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2181 fields in the constructor remain null. */
2183 tree
2185 {
2192 }
2194 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2195 of elements, provided as index/value pairs. */
2197 tree
2199 {
2206 {
2210 }
2213 }
2215 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2217 tree
2219 {
2223 }
2225 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2227 tree
2229 {
2230 tree v;
2240 }
2242 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2244 tree
2246 {
2247 tree v;
2251 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2252 Consider doing it via real_convert now. */
2262 }
2264 /* Like build_real, but first truncate D to the type. */
2266 tree
2268 {
2270 }
2272 /* Return a new REAL_CST node whose type is TYPE
2273 and whose value is the integer value of the INTEGER_CST node I. */
2275 REAL_VALUE_TYPE
2277 {
2278 REAL_VALUE_TYPE d;
2280 /* Clear all bits of the real value type so that we can later do
2281 bitwise comparisons to see if two values are the same. */
2287 }
2289 /* Given a tree representing an integer constant I, return a tree
2290 representing the same value as a floating-point constant of type TYPE. */
2292 tree
2294 {
2295 tree v;
2302 }
2304 /* Return a new REAL_CST node whose type is TYPE
2305 and whose value is the integer value I which has sign SGN. */
2307 tree
2309 {
2310 REAL_VALUE_TYPE d;
2312 /* Clear all bits of the real value type so that we can later do
2313 bitwise comparisons to see if two values are the same. */
2318 }
2320 /* Return a newly constructed STRING_CST node whose value is the LEN
2321 characters at STR when STR is nonnull, or all zeros otherwise.
2322 Note that for a C string literal, LEN should include the trailing NUL.
2323 The TREE_TYPE is not initialized. */
2325 tree
2327 {
2328 /* Do not waste bytes provided by padding of struct tree_string. */
2341 else
2346 }
2348 /* Return a newly constructed COMPLEX_CST node whose value is
2349 specified by the real and imaginary parts REAL and IMAG.
2350 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2351 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2353 tree
2355 {
2366 }
2368 /* Build a complex (inf +- 0i), such as for the result of cproj.
2369 TYPE is the complex tree type of the result. If NEG is true, the
2370 imaginary zero is negative. */
2372 tree
2374 {
2381 }
2383 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2384 element is set to 1. In particular, this is 1 + i for complex types. */
2386 tree
2388 {
2390 {
2393 }
2394 else
2396 }
2398 /* Return a constant of arithmetic type TYPE which is the
2399 multiplicative identity of the set TYPE. */
2401 tree
2403 {
2405 {
2415 /* We can only generate 1 for accum types. */
2420 {
2424 }
2433 }
2434 }
2436 /* Return an integer of type TYPE containing all 1's in as much precision as
2437 it contains, or a complex or vector whose subparts are such integers. */
2439 tree
2441 {
2443 {
2446 }
2447 else
2449 }
2451 /* Return a constant of arithmetic type TYPE which is the
2452 opposite of the multiplicative identity of the set TYPE. */
2454 tree
2456 {
2458 {
2468 /* We can only generate 1 for accum types. */
2475 {
2479 }
2488 }
2489 }
2491 /* Build 0 constant of type TYPE. This is used by constructor folding
2492 and thus the constant should be represented in memory by
2493 zero(es). */
2495 tree
2497 {
2499 {
2512 {
2516 }
2519 {
2523 }
2529 }
2530 }
2533 /* Build a BINFO with LEN language slots. */
2535 tree
2537 {
2538 tree t;
2553 }
2555 /* Create a CASE_LABEL_EXPR tree node and return it. */
2557 tree
2559 {
2571 }
2573 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2574 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2575 The latter determines the length of the HOST_WIDE_INT vector. */
2577 tree
2579 {
2580 tree t;
2592 /* to_offset can only be applied to trees that are offset_int-sized
2593 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2594 must be exactly the precision of offset_int and so LEN is correct. */
2597 else
2603 }
2605 /* Build a newly constructed TREE_VEC node of length LEN. */
2607 tree
2609 {
2610 tree t;
2621 }
2623 /* Grow a TREE_VEC node to new length LEN. */
2625 tree
2627 {
2643 }
2644 \f
2645 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2646 fixed, and scalar, complex or vector. */
2648 bool
2650 {
2654 }
2656 /* Return 1 if EXPR is the integer constant zero or a complex constant
2657 of zero, or a location wrapper for such a constant. */
2659 bool
2661 {
2665 {
2677 }
2678 }
2680 /* Return 1 if EXPR is the integer constant one or the corresponding
2681 complex constant, or a location wrapper for such a constant. */
2683 bool
2685 {
2689 {
2701 }
2702 }
2704 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2705 return 1 if every piece is the integer constant one.
2706 Also return 1 for location wrappers for such a constant. */
2708 bool
2710 {
2716 else
2718 }
2720 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2721 it contains, or a complex or vector whose subparts are such integers,
2722 or a location wrapper for such a constant. */
2724 bool
2726 {
2744 }
2746 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2747 for such a constant. */
2749 bool
2751 {
2757 else
2759 }
2761 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2762 one bit on), or a location wrapper for such a constant. */
2764 bool
2766 {
2778 }
2780 /* Return 1 if EXPR is an integer constant other than zero or a
2781 complex constant other than zero, or a location wrapper for such a
2782 constant. */
2784 bool
2786 {
2794 }
2796 /* Return 1 if EXPR is the integer constant one. For vector,
2797 return 1 if every piece is the integer constant minus one
2798 (representing the value TRUE).
2799 Also return 1 for location wrappers for such a constant. */
2801 bool
2803 {
2809 }
2811 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2812 for such a constant. */
2814 bool
2816 {
2821 }
2823 /* Return the power of two represented by a tree node known to be a
2824 power of two. */
2826 int
2828 {
2833 }
2835 /* Similar, but return the largest integer Y such that 2 ** Y is less
2836 than or equal to EXPR. */
2838 int
2840 {
2845 }
2847 /* Return number of known trailing zero bits in EXPR, or, if the value of
2848 EXPR is known to be zero, the precision of it's type. */
2850 unsigned int
2852 {
2859 {
2880 /* Second operand is sizetype, which could be in theory
2881 wider than pointer's precision. Make sure we never
2882 return more than prec. */
2897 {
2900 }
2905 {
2910 }
2919 {
2922 {
2927 }
2928 }
2930 CASE_CONVERT:
2948 {
2951 }
2955 }
2956 }
2958 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2959 decimal float constants, so don't return 1 for them.
2960 Also return 1 for location wrappers around such a constant. */
2962 bool
2964 {
2968 {
2976 {
2977 /* Don't simply check for a duplicate because the predicate
2978 accepts both +0.0 and -0.0. */
2984 }
2987 }
2988 }
2990 /* Return 1 if EXPR is the real constant one in real or complex form.
2991 Trailing zeroes matter for decimal float constants, so don't return
2992 1 for them.
2993 Also return 1 for location wrappers around such a constant. */
2995 bool
2997 {
3001 {
3014 }
3015 }
3017 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3018 matter for decimal float constants, so don't return 1 for them.
3019 Also return 1 for location wrappers around such a constant. */
3021 bool
3023 {
3027 {
3040 }
3041 }
3043 /* Nonzero if EXP is a constant or a cast of a constant. */
3045 bool
3047 {
3048 /* This is not quite the same as STRIP_NOPS. It does more. */
3053 }
3055 /* Return true if T holds a polynomial pointer difference, storing it in
3056 *VALUE if so. A true return means that T's precision is no greater
3057 than 64 bits, which is the largest address space we support, so *VALUE
3058 never loses precision. However, the signedness of the result does
3059 not necessarily match the signedness of T: sometimes an unsigned type
3060 like sizetype is used to encode a value that is actually negative. */
3062 bool
3064 {
3068 {
3073 }
3075 {
3082 }
3084 }
3086 poly_int64
3088 {
3093 }
3095 poly_uint64
3097 {
3102 }
3103 \f
3104 /* Return first list element whose TREE_VALUE is ELEM.
3105 Return 0 if ELEM is not in LIST. */
3107 tree
3109 {
3111 {
3115 }
3117 }
3119 /* Return first list element whose TREE_PURPOSE is ELEM.
3120 Return 0 if ELEM is not in LIST. */
3122 tree
3124 {
3126 {
3130 }
3132 }
3134 /* Return true if ELEM is in V. */
3136 bool
3138 {
3140 tree t;
3145 }
3147 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3148 NULL_TREE. */
3150 tree
3152 {
3156 }
3158 /* Return nonzero if ELEM is part of the chain CHAIN. */
3160 bool
3162 {
3164 {
3168 }
3171 }
3173 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3174 We expect a null pointer to mark the end of the chain.
3175 This is the Lisp primitive `length'. */
3177 int
3179 {
3181 #ifdef ENABLE_TREE_CHECKING
3183 #endif
3187 {
3189 #ifdef ENABLE_TREE_CHECKING
3193 #endif
3194 len++;
3195 }
3198 }
3200 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3201 UNION_TYPE TYPE, or NULL_TREE if none. */
3203 tree
3205 {
3210 }
3212 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3213 UNION_TYPE TYPE, or NULL_TREE if none. */
3215 tree
3217 {
3221 {
3226 }
3229 }
3231 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3232 by modifying the last node in chain 1 to point to chain 2.
3233 This is the Lisp primitive `nconc'. */
3235 tree
3237 {
3238 tree t1;
3249 #ifdef ENABLE_TREE_CHECKING
3250 {
3251 tree t2;
3254 }
3255 #endif
3258 }
3260 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3262 tree
3264 {
3265 tree next;
3270 }
3272 /* Reverse the order of elements in the chain T,
3273 and return the new head of the chain (old last element). */
3275 tree
3277 {
3280 {
3281 /* We shouldn't be using this function to reverse BLOCK chains; we
3282 have blocks_nreverse for that. */
3287 }
3289 }
3290 \f
3291 /* Return a newly created TREE_LIST node whose
3292 purpose and value fields are PARM and VALUE. */
3294 tree
3296 {
3301 }
3303 /* Build a chain of TREE_LIST nodes from a vector. */
3305 tree
3307 {
3311 tree t;
3313 {
3316 }
3318 }
3320 /* Return a newly created TREE_LIST node whose
3321 purpose and value fields are PURPOSE and VALUE
3322 and whose TREE_CHAIN is CHAIN. */
3324 tree
3326 {
3327 tree node;
3339 }
3341 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3342 trees. */
3346 {
3350 tree val;
3356 }
3357 \f
3358 /* Return the size nominally occupied by an object of type TYPE
3359 when it resides in memory. The value is measured in units of bytes,
3360 and its data type is that normally used for type sizes
3361 (which is the first type created by make_signed_type or
3362 make_unsigned_type). */
3364 tree
3366 {
3367 tree t;
3376 {
3379 }
3382 }
3384 /* Return the size of TYPE (in bytes) as a wide integer
3385 or return -1 if the size can vary or is larger than an integer. */
3387 HOST_WIDE_INT
3389 {
3390 tree t;
3400 else
3402 }
3404 /* Return the maximum size of TYPE (in bytes) as a wide integer
3405 or return -1 if the size can vary or is larger than an integer. */
3407 HOST_WIDE_INT
3409 {
3411 tree size_tree;
3413 /* If this is an array type, check for a possible MAX_SIZE attached. */
3416 {
3421 }
3423 /* If we still haven't been able to get a size, see if the language
3424 can compute a maximum size. */
3427 {
3432 }
3435 }
3436 \f
3437 /* Return the bit position of FIELD, in bits from the start of the record.
3438 This is a tree of type bitsizetype. */
3440 tree
3442 {
3445 }
3446 \f
3447 /* Return the byte position of FIELD, in bytes from the start of the record.
3448 This is a tree of type sizetype. */
3450 tree
3452 {
3455 }
3457 /* Likewise, but return as an integer. It must be representable in
3458 that way (since it could be a signed value, we don't have the
3459 option of returning -1 like int_size_in_byte can. */
3461 HOST_WIDE_INT
3463 {
3465 }
3466 \f
3467 /* Return, as a tree node, the number of elements for TYPE (which is an
3468 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3470 tree
3472 {
3475 /* If they did it with unspecified bounds, then we should have already
3476 given an error about it before we got here. */
3484 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3486 {
3487 /* zero sized arrays are represented from C FE as complete types with
3488 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3489 them as min 0, max -1. */
3496 }
3499 ? max
3501 }
3502 \f
3503 /* If arg is static -- a reference to an object in static storage -- then
3504 return the object. This is not the same as the C meaning of `static'.
3505 If arg isn't static, return NULL. */
3507 tree
3509 {
3511 {
3513 /* Nested functions are static, even though taking their address will
3514 involve a trampoline as we unnest the nested function and create
3515 the trampoline on the tree level. */
3536 /* If the thing being referenced is not a field, then it is
3537 something language specific. */
3540 /* If we are referencing a bitfield, we can't evaluate an
3541 ADDR_EXPR at compile time and so it isn't a constant. */
3558 else
3566 }
3567 }
3569 \f
3572 /* Return whether OP is a DECL whose address is function-invariant. */
3574 bool
3576 {
3577 /* The conditions below are slightly less strict than the one in
3578 staticp. */
3581 {
3604 }
3607 }
3609 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3611 bool
3613 {
3614 /* The conditions below are slightly less strict than the one in
3615 staticp. */
3618 {
3638 }
3641 }
3644 /* Return true if T is function-invariant (internal function, does
3645 not handle arithmetic; that's handled in skip_simple_arithmetic and
3646 tree_invariant_p). */
3648 static bool
3650 {
3651 tree op;
3658 {
3665 {
3667 {
3682 }
3684 }
3690 }
3693 }
3695 /* Return true if T is function-invariant. */
3697 bool
3699 {
3702 }
3704 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3705 Do this to any expression which may be used in more than one place,
3706 but must be evaluated only once.
3708 Normally, expand_expr would reevaluate the expression each time.
3709 Calling save_expr produces something that is evaluated and recorded
3710 the first time expand_expr is called on it. Subsequent calls to
3711 expand_expr just reuse the recorded value.
3713 The call to expand_expr that generates code that actually computes
3714 the value is the first call *at compile time*. Subsequent calls
3715 *at compile time* generate code to use the saved value.
3716 This produces correct result provided that *at run time* control
3717 always flows through the insns made by the first expand_expr
3718 before reaching the other places where the save_expr was evaluated.
3719 You, the caller of save_expr, must make sure this is so.
3721 Constants, and certain read-only nodes, are returned with no
3722 SAVE_EXPR because that is safe. Expressions containing placeholders
3723 are not touched; see tree.def for an explanation of what these
3724 are used for. */
3726 tree
3728 {
3729 tree inner;
3731 /* If the tree evaluates to a constant, then we don't want to hide that
3732 fact (i.e. this allows further folding, and direct checks for constants).
3733 However, a read-only object that has side effects cannot be bypassed.
3734 Since it is no problem to reevaluate literals, we just return the
3735 literal node. */
3743 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3744 it means that the size or offset of some field of an object depends on
3745 the value within another field.
3747 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3748 and some variable since it would then need to be both evaluated once and
3749 evaluated more than once. Front-ends must assure this case cannot
3750 happen by surrounding any such subexpressions in their own SAVE_EXPR
3751 and forcing evaluation at the proper time. */
3757 /* This expression might be placed ahead of a jump to ensure that the
3758 value was computed on both sides of the jump. So make sure it isn't
3759 eliminated as dead. */
3762 }
3764 /* Look inside EXPR into any simple arithmetic operations. Return the
3765 outermost non-arithmetic or non-invariant node. */
3767 tree
3769 {
3770 /* We don't care about whether this can be used as an lvalue in this
3771 context. */
3775 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3776 a constant, it will be more efficient to not make another SAVE_EXPR since
3777 it will allow better simplification and GCSE will be able to merge the
3778 computations if they actually occur. */
3780 {
3784 {
3789 else
3791 }
3792 else
3794 }
3797 }
3799 /* Look inside EXPR into simple arithmetic operations involving constants.
3800 Return the outermost non-arithmetic or non-constant node. */
3802 tree
3804 {
3809 {
3813 {
3818 else
3820 }
3821 else
3823 }
3826 }
3828 /* Return which tree structure is used by T. */
3830 enum tree_node_structure_enum
3832 {
3835 }
3837 /* Set various status flags when building a CALL_EXPR object T. */
3839 static void
3841 {
3846 /* Calls have side-effects, except those to const or pure functions. */
3849 /* Propagate TREE_READONLY of arguments for const functions. */
3855 {
3861 }
3865 }
3866 \f
3867 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3868 size or offset that depends on a field within a record. */
3870 bool
3872 {
3883 {
3885 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3886 position computations since they will be converted into a
3887 WITH_RECORD_EXPR involving the reference, which will assume
3888 here will be valid. */
3902 {
3904 /* Ignoring the first operand isn't quite right, but works best. */
3913 /* The save_expr function never wraps anything containing
3914 a PLACEHOLDER_EXPR. */
3919 }
3922 {
3930 }
3934 {
3936 {
3937 const_tree arg;
3938 const_call_expr_arg_iterator iter;
3943 }
3946 }
3950 }
3952 }
3954 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3955 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3956 field positions. */
3958 static bool
3960 {
3961 /* If the size contains a placeholder or the parent type (component type in
3962 the case of arrays) type involves a placeholder, this type does. */
3970 /* Now do type-specific checks. Note that the last part of the check above
3971 greatly limits what we have to do below. */
3973 {
3991 /* Here we just check the bounds. */
3996 /* We have already checked the component type above, so just check
3997 the domain type. Flexible array members have a null domain. */
4004 {
4005 tree field;
4016 }
4020 }
4021 }
4023 /* Wrapper around above function used to cache its result. */
4025 bool
4027 {
4030 /* If the contains_placeholder_bits field has been initialized,
4031 then we know the answer. */
4035 /* Indicate that we've seen this type node, and the answer is false.
4036 This is what we want to return if we run into recursion via fields. */
4039 /* Compute the real value. */
4042 /* Store the real value. */
4046 }
4047 \f
4048 /* Push tree EXP onto vector QUEUE if it is not already present. */
4050 static void
4052 {
4054 tree iter;
4062 }
4064 /* Given a tree EXP, find all occurrences of references to fields
4065 in a PLACEHOLDER_EXPR and place them in vector REFS without
4066 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4067 we assume here that EXP contains only arithmetic expressions
4068 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4069 argument list. */
4071 void
4073 {
4075 tree inner;
4078 /* We handle TREE_LIST and COMPONENT_REF separately. */
4080 {
4083 }
4085 {
4089 ;
4093 else
4095 }
4096 else
4098 {
4103 /* Variables allocated to static storage can stay. */
4109 /* This is the pattern built in ada/make_aligning_type. */
4112 {
4115 }
4117 /* Fall through. */
4135 }
4136 }
4138 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4139 return a tree with all occurrences of references to F in a
4140 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4141 CONST_DECLs. Note that we assume here that EXP contains only
4142 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4143 occurring only in their argument list. */
4145 tree
4147 {
4150 tree new_tree;
4152 /* We handle TREE_LIST and COMPONENT_REF separately. */
4154 {
4161 }
4163 {
4164 tree inner;
4166 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4167 and it is the right field, replace it with R. */
4171 ;
4173 /* The field. */
4179 /* If this expression hasn't been completed let, leave it alone. */
4187 new_tree
4189 }
4190 else
4192 {
4199 else
4206 /* Fall through. */
4214 {
4259 new_tree
4265 }
4269 {
4274 /* If we are trying to replace F with a constant or with another
4275 instance of one of the arguments of the call, inline back
4276 functions which do nothing else than computing a value from
4277 the arguments they are passed. This makes it possible to
4278 fold partially or entirely the replacement expression. */
4280 {
4284 else
4287 {
4290 }
4292 {
4296 }
4297 }
4300 {
4304 {
4308 }
4309 }
4312 {
4316 }
4317 else
4319 }
4324 }
4332 }
4334 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4335 for it within OBJ, a tree that is an object or a chain of references. */
4337 tree
4339 {
4342 tree new_tree;
4344 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4345 in the chain of OBJ. */
4347 {
4349 tree elt;
4379 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4380 survives until RTL generation, there will be an error. */
4382 }
4384 /* TREE_LIST is special because we need to look at TREE_VALUE
4385 and TREE_CHAIN, not TREE_OPERANDS. */
4387 {
4394 }
4395 else
4397 {
4410 {
4455 new_tree
4461 }
4465 {
4471 {
4475 {
4479 }
4480 }
4483 {
4487 }
4488 else
4490 }
4495 }
4503 }
4504 \f
4506 /* Subroutine of stabilize_reference; this is called for subtrees of
4507 references. Any expression with side-effects must be put in a SAVE_EXPR
4508 to ensure that it is only evaluated once.
4510 We don't put SAVE_EXPR nodes around everything, because assigning very
4511 simple expressions to temporaries causes us to miss good opportunities
4512 for optimizations. Among other things, the opportunity to fold in the
4513 addition of a constant into an addressing mode often gets lost, e.g.
4514 "y[i+1] += x;". In general, we take the approach that we should not make
4515 an assignment unless we are forced into it - i.e., that any non-side effect
4516 operator should be allowed, and that cse should take care of coalescing
4517 multiple utterances of the same expression should that prove fruitful. */
4519 static tree
4521 {
4522 tree result;
4525 /* We cannot ignore const expressions because it might be a reference
4526 to a const array but whose index contains side-effects. But we can
4527 ignore things that are actual constant or that already have been
4528 handled by this function. */
4534 {
4536 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4537 have side-effects. */
4540 /* FALLTHRU */
4548 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4549 so that it will only be evaluated once. */
4550 /* The reference (r) and comparison (<) classes could be handled as
4551 below, but it is generally faster to only evaluate them once. */
4557 /* Constants need no processing. In fact, we should never reach
4558 here. */
4562 /* Division is slow and tends to be compiled with jumps,
4563 especially the division by powers of 2 that is often
4564 found inside of an array reference. So do it just once. */
4570 /* Recursively stabilize each operand. */
4576 /* Recursively stabilize each operand. */
4582 }
4590 }
4592 /* Stabilize a reference so that we can use it any number of times
4593 without causing its operands to be evaluated more than once.
4594 Returns the stabilized reference. This works by means of save_expr,
4595 so see the caveats in the comments about save_expr.
4597 Also allows conversion expressions whose operands are references.
4598 Any other kind of expression is returned unchanged. */
4600 tree
4602 {
4603 tree result;
4607 {
4611 /* No action is needed in this case. */
4614 CASE_CONVERT:
4653 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4654 it wouldn't be ignored. This matters when dealing with
4655 volatiles. */
4658 /* If arg isn't a kind of lvalue we recognize, make no change.
4659 Caller should recognize the error for an invalid lvalue. */
4665 }
4673 }
4674 \f
4675 /* Low-level constructors for expressions. */
4677 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4678 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4680 void
4682 {
4683 tree node;
4688 /* We started out assuming this address is both invariant and constant, but
4689 does not have side effects. Now go down any handled components and see if
4690 any of them involve offsets that are either non-constant or non-invariant.
4691 Also check for side-effects.
4693 ??? Note that this code makes no attempt to deal with the case where
4694 taking the address of something causes a copy due to misalignment. */
4696 #define UPDATE_FLAGS(NODE) \
4697 do { tree _node = (NODE); \
4698 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4699 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4703 {
4704 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4705 array reference (probably made temporarily by the G++ front end),
4706 so ignore all the operands. */
4710 {
4716 }
4717 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4718 FIELD_DECL, apparently. The G++ front end can put something else
4719 there, at least temporarily. */
4722 {
4725 }
4726 }
4730 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4731 the address, since &(*a)->b is a form of addition. If it's a constant, the
4732 address is constant too. If it's a decl, its address is constant if the
4733 decl is static. Everything else is not constant and, furthermore,
4734 taking the address of a volatile variable is not volatile. */
4739 ;
4742 else
4743 {
4746 }
4751 #undef UPDATE_FLAGS
4752 }
4754 /* Build an expression of code CODE, data type TYPE, and operands as
4755 specified. Expressions and reference nodes can be created this way.
4756 Constants, decls, types and misc nodes cannot be.
4758 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4759 enough for all extant tree codes. */
4761 tree
4763 {
4764 tree t;
4772 }
4774 tree
4776 {
4778 tree t;
4794 {
4797 }
4800 {
4803 }
4805 {
4807 /* All of these have side-effects, no matter what their
4808 operands are. */
4814 /* Whether a dereference is readonly has nothing to do with whether
4815 its operand is readonly. */
4833 }
4836 }
4838 #define PROCESS_ARG(N) \
4839 do { \
4840 TREE_OPERAND (t, N) = arg##N; \
4841 if (arg##N &&!TYPE_P (arg##N)) \
4842 { \
4843 if (TREE_SIDE_EFFECTS (arg##N)) \
4844 side_effects = 1; \
4845 if (!TREE_READONLY (arg##N) \
4846 && !CONSTANT_CLASS_P (arg##N)) \
4847 (void) (read_only = 0); \
4848 if (!TREE_CONSTANT (arg##N)) \
4849 (void) (constant = 0); \
4850 } \
4851 } while (0)
4853 tree
4855 {
4857 tree t;
4863 /* When sizetype precision doesn't match that of pointers
4864 we need to be able to build explicit extensions or truncations
4865 of the offset argument. */
4877 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4878 result based on those same flags for the arguments. But if the
4879 arguments aren't really even `tree' expressions, we shouldn't be trying
4880 to do this. */
4882 /* Expressions without side effects may be constant if their
4883 arguments are as well. */
4890 {
4904 }
4911 {
4913 {
4917 }
4918 }
4919 else
4920 {
4922 /* Don't mark X / 0 as constant. */
4927 }
4930 }
4933 tree
4935 tree arg2 MEM_STAT_DECL)
4936 {
4938 tree t;
4948 /* As a special exception, if COND_EXPR has NULL branches, we
4949 assume that it is a gimple statement and always consider
4950 it to have side effects. */
4956 else
4972 }
4974 tree
4977 {
4979 tree t;
4999 }
5001 tree
5004 {
5006 tree t;
5023 {
5025 {
5029 }
5030 }
5031 else
5037 }
5039 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5040 on the pointer PTR. */
5042 tree
5044 {
5047 tree tem;
5048 /* For convenience allow addresses that collapse to a simple base
5049 and offset. */
5053 {
5057 {
5060 }
5061 else
5064 }
5069 }
5071 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5073 poly_offset_int
5075 {
5077 SIGNED);
5078 }
5080 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5081 offsetted by OFFSET units. */
5083 tree
5085 {
5092 }
5094 /* Similar except don't specify the TREE_TYPE
5095 and leave the TREE_SIDE_EFFECTS as 0.
5096 It is permissible for arguments to be null,
5097 or even garbage if their values do not matter. */
5099 tree
5101 {
5102 tree t;
5119 }
5121 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5122 tree vec. */
5124 tree
5126 {
5136 }
5137 \f
5138 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5139 and data type TYPE.
5140 We do NOT enter this node in any sort of symbol table.
5142 LOC is the location of the decl.
5144 layout_decl is used to set up the decl's storage layout.
5145 Other slots are initialized to 0 or null pointers. */
5147 tree
5149 tree type MEM_STAT_DECL)
5150 {
5151 tree t;
5156 /* if (type == error_mark_node)
5157 type = integer_type_node; */
5158 /* That is not done, deliberately, so that having error_mark_node
5159 as the type can suppress useless errors in the use of this variable. */
5168 }
5170 /* Builds and returns function declaration with NAME and TYPE. */
5172 tree
5174 {
5184 }
5188 /* Builds a new translation-unit decl with name NAME, queues it in the
5189 global list of translation-unit decls and returns it. */
5191 tree
5193 {
5199 }
5201 \f
5202 /* BLOCK nodes are used to represent the structure of binding contours
5203 and declarations, once those contours have been exited and their contents
5204 compiled. This information is used for outputting debugging info. */
5206 tree
5208 {
5216 }
5218 \f
5219 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5221 LOC is the location to use in tree T. */
5223 void
5225 {
5229 {
5233 }
5234 }
5236 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5237 UNKNOWN_LOCATION. */
5239 void
5241 {
5245 }
5247 /* Data used when collecting DECLs and TYPEs for language data removal. */
5249 class free_lang_data_d
5250 {
5254 /* Worklist to avoid excessive recursion. */
5257 /* Set of traversed objects. Used to avoid duplicate visits. */
5260 /* Array of symbols to process with free_lang_data_in_decl. */
5263 /* Array of types to process with free_lang_data_in_type. */
5265 };
5268 /* Add type or decl T to one of the list of tree nodes that need their
5269 language data removed. The lists are held inside FLD. */
5271 static void
5273 {
5278 else
5280 }
5282 /* Push tree node T into FLD->WORKLIST. */
5286 {
5289 }
5292 \f
5293 /* Return simplified TYPE_NAME of TYPE. */
5295 static tree
5297 {
5300 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5301 TYPE_DECL if the type doesn't have linkage.
5302 this must match fld_ */
5310 }
5312 /* Do same comparsion as check_qualified_type skipping lang part of type
5313 and be more permissive about type names: we only care that names are
5314 same (for diagnostics) and that ODR names are the same.
5315 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5317 static bool
5319 {
5321 /* We want to match incomplete variants with complete types.
5322 In this case we need to ignore alignment. */
5333 }
5335 /* Find variant of FIRST that match T and create new one if necessary.
5336 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5338 static tree
5341 {
5356 /* Variants of incomplete types should have alignment
5357 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5359 {
5362 }
5369 }
5371 /* Map complete types to incomplete types. */
5375 /* Map types to simplified types. */
5379 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5380 use MAP to prevent duplicates. */
5382 static tree
5385 {
5390 {
5391 return fld_type_variant
5395 }
5398 tree &array
5401 {
5402 array
5408 }
5410 }
5412 /* Return CTX after removal of contexts that are not relevant */
5414 static tree
5416 {
5417 /* Variably modified types are needed for tree_is_indexable to decide
5418 whether the type needs to go to local or global section.
5419 This code is semi-broken but for now it is easiest to keep contexts
5420 as expected. */
5423 {
5426 }
5428 }
5430 /* For T being aggregate type try to turn it into a incomplete variant.
5431 Return T if no simplification is possible. */
5433 static tree
5435 {
5439 {
5442 {
5443 tree first;
5447 else
5455 }
5457 }
5466 {
5468 tree ©
5472 {
5475 /* It is possible that type was not seen by free_lang_data yet. */
5484 {
5492 }
5493 else
5494 {
5498 }
5500 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5501 This is needed for ODR violation warnings to come out right (we
5502 want duplicate TYPE_DECLs whenever the type is duplicated because
5503 of ODR violation. Because lang data in the TYPE_DECL may not
5504 have been freed yet, rebuild it from scratch and copy relevant
5505 fields. */
5510 {
5520 }
5521 }
5523 }
5526 }
5528 /* Simplify type T for scenarios where we do not need complete pointer
5529 types. */
5531 static tree
5533 {
5538 /* FIXME: This triggers verification error, see PR88140. */
5543 }
5545 /* Reset the expression *EXPR_P, a size or position.
5547 ??? We could reset all non-constant sizes or positions. But it's cheap
5548 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5550 We need to reset self-referential sizes or positions because they cannot
5551 be gimplified and thus can contain a CALL_EXPR after the gimplification
5552 is finished, which will run afoul of LTO streaming. And they need to be
5553 reset to something essentially dummy but not constant, so as to preserve
5554 the properties of the object they are attached to. */
5558 {
5562 }
5565 /* Reset all the fields in a binfo node BINFO. We only keep
5566 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5568 static void
5570 {
5572 tree t;
5585 }
5588 /* Reset all language specific information still present in TYPE. */
5590 static void
5592 {
5595 /* Give the FE a chance to remove its own data first. */
5608 /* Purge non-marked variants from the variants chain, so that they
5609 don't reappear in the IL after free_lang_data. */
5612 {
5615 /* Turn the removed types into distinct types. */
5618 }
5621 {
5623 /* Remove the const and volatile qualifiers from arguments. The
5624 C++ front end removes them, but the C front end does not,
5625 leading to false ODR violation errors when merging two
5626 instances of the same function signature compiled by
5627 different front ends. */
5629 {
5634 {
5636 & ~TYPE_QUAL_CONST
5641 }
5642 /* C++ FE uses TREE_PURPOSE to store initial values. */
5644 }
5645 }
5647 {
5650 {
5651 /* C++ FE uses TREE_PURPOSE to store initial values. */
5654 }
5655 }
5657 {
5658 /* Remove members that are not FIELD_DECLs from the field list
5659 of an aggregate. These occur in C++. */
5663 else
5669 {
5671 /* We need to preserve link to bases and virtual table for all
5672 polymorphic types to make devirtualization machinery working. */
5675 }
5676 }
5680 {
5682 {
5685 /* Type values are used only for C++ ODR checking. Drop them
5686 for all type variants and non-ODR types.
5687 For ODR types the data is freed in free_odr_warning_data. */
5689 ;
5694 else
5696 }
5699 }
5708 {
5710 do
5711 {
5713 }
5716 }
5720 }
5723 /* Return true if DECL may need an assembler name to be set. */
5727 {
5728 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5729 Rule merging. This makes type_odr_p to return true on those types during
5730 LTO and by comparing the mangled name, we can say what types are intended
5731 to be equivalent across compilation unit.
5733 We do not store names of type_in_anonymous_namespace_p.
5735 Record, union and enumeration type have linkage that allows use
5736 to check type_in_anonymous_namespace_p. We do not mangle compound types
5737 that always can be compared structurally.
5739 Similarly for builtin types, we compare properties of their main variant.
5740 A special case are integer types where mangling do make differences
5741 between char/signed char/unsigned char etc. Storing name for these makes
5742 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5743 See cp/mangle.c:write_builtin_type for details. */
5746 {
5759 }
5760 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5764 /* If DECL already has its assembler name set, it does not need a
5765 new one. */
5770 /* Abstract decls do not need an assembler name. */
5774 /* For VAR_DECLs, only static, public and external symbols need an
5775 assembler name. */
5783 {
5784 /* Do not set assembler name on builtins. Allow RTL expansion to
5785 decide whether to expand inline or via a regular call. */
5790 /* Functions represented in the callgraph need an assembler name. */
5794 /* Unused and not public functions don't need an assembler name. */
5797 }
5800 }
5803 /* Reset all language specific information still present in symbol
5804 DECL. */
5806 static void
5808 {
5811 /* Give the FE a chance to remove its own data first. */
5825 {
5830 }
5833 {
5835 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5836 the address may be taken in other unit, so this flag has no practical
5837 use for middle-end.
5839 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5840 for public objects that indeed cannot be adressed, but it is not
5841 the case. Set the flag to true so we do not get merge failures for
5842 i.e. virtual tables between units that take address of it and
5843 units that don't. */
5849 {
5852 else
5853 {
5858 }
5859 }
5861 {
5862 tree t;
5864 /* If DECL has a gimple body, then the context for its
5865 arguments must be DECL. Otherwise, it doesn't really
5866 matter, as we will not be emitting any code for DECL. In
5867 general, there may be other instances of DECL created by
5868 the front end and since PARM_DECLs are generally shared,
5869 their DECL_CONTEXT changes as the replicas of DECL are
5870 created. The only time where DECL_CONTEXT is important
5871 is for the FUNCTION_DECLs that have a gimple body (since
5872 the PARM_DECL will be used in the function's body). */
5881 }
5883 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5884 At this point, it is not needed anymore. */
5887 /* Clear the abstract origin if it refers to a method.
5888 Otherwise dwarf2out.c will ICE as we splice functions out of
5889 TYPE_FIELDS and thus the origin will not be output
5890 correctly. */
5893 && RECORD_OR_UNION_TYPE_P
5898 }
5900 {
5901 /* See comment above why we set the flag for functions. */
5908 }
5910 {
5921 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5922 }
5924 {
5927 }
5931 {
5932 /* Strip builtins from the translation-unit BLOCK. We still have targets
5933 without builtin_decl_explicit support and also builtins are shared
5934 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5937 {
5942 else
5944 }
5945 }
5946 /* We need to keep field decls associated with their trees. Otherwise tree
5947 merging may merge some fileds and keep others disjoint wich in turn will
5948 not do well with TREE_CHAIN pointers linking them.
5950 Also do not drop containing types for virtual methods and tables because
5951 these are needed by devirtualization.
5952 C++ destructors are special because C++ frontends sometimes produces
5953 virtual destructor as an alias of non-virtual destructor. In
5954 devirutalization code we always walk through aliases and we need
5955 context to be preserved too. See PR89335 */
5962 }
5965 /* Operand callback helper for free_lang_data_in_node. *TP is the
5966 subtree operand being considered. */
5968 static tree
5970 {
5977 /* Language specific nodes will be removed, so there is no need
5978 to gather anything under them. */
5980 {
5983 }
5986 {
5987 /* Note that walk_tree does not traverse every possible field in
5988 decls, so we have to do our own traversals here. */
5996 /* We are going to remove everything under DECL_INITIAL for
5997 TYPE_DECLs. No point walking them. */
6005 {
6008 }
6010 {
6015 }
6025 }
6027 {
6028 /* Note that walk_tree does not traverse every possible field in
6029 types, so we have to do our own traversals here. */
6040 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
6041 lists, we may look types up in these lists and use them while
6042 optimizing the function body. Thus we need to free lang data
6043 in them. */
6050 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
6054 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
6055 do not and want not to reach unused variants this way. */
6057 {
6059 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
6060 So push that instead. */
6064 }
6068 {
6070 tree tem;
6075 }
6077 {
6078 tree tem;
6079 /* Push all TYPE_FIELDS - there can be interleaving interesting
6080 and non-interesting things. */
6083 {
6087 }
6088 }
6094 }
6096 {
6098 {
6102 {
6106 }
6107 else
6108 {
6111 }
6112 }
6116 }
6123 }
6126 /* Find decls and types in T. */
6128 static void
6130 {
6132 {
6138 }
6139 }
6141 /* Translate all the types in LIST with the corresponding runtime
6142 types. */
6144 static tree
6146 {
6156 {
6161 }
6164 }
6167 /* Find decls and types referenced in EH region R and store them in
6168 FLD->DECLS and FLD->TYPES. */
6170 static void
6172 {
6174 {
6179 {
6180 eh_catch c;
6182 /* The types referenced in each catch must first be changed to the
6183 EH types used at runtime. This removes references to FE types
6184 in the region. */
6186 {
6189 }
6190 }
6203 }
6204 }
6207 /* Find decls and types referenced in cgraph node N and store them in
6208 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6209 look for *every* kind of DECL and TYPE node reachable from N,
6210 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6211 NAMESPACE_DECLs, etc). */
6213 static void
6215 {
6216 basic_block bb;
6219 tree t;
6230 /* Traverse locals. */
6234 /* Traverse EH regions in FN. */
6235 {
6236 eh_region r;
6239 }
6241 /* Traverse every statement in FN. */
6243 {
6244 gphi_iterator psi;
6245 gimple_stmt_iterator si;
6249 {
6253 {
6256 }
6257 }
6260 {
6267 {
6270 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6271 which we need for asm stmts. */
6277 }
6278 }
6279 }
6280 }
6283 /* Find decls and types referenced in varpool node N and store them in
6284 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6285 look for *every* kind of DECL and TYPE node reachable from N,
6286 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6287 NAMESPACE_DECLs, etc). */
6289 static void
6291 {
6293 }
6295 /* If T needs an assembler name, have one created for it. */
6297 void
6299 {
6301 {
6302 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6303 diagnostics that use input_location to show locus
6304 information. The problem here is that, at this point,
6305 input_location is generally anchored to the end of the file
6306 (since the parser is long gone), so we don't have a good
6307 position to pin it to.
6309 To alleviate this problem, this uses the location of T's
6310 declaration. Examples of this are
6311 testsuite/g++.dg/template/cond2.C and
6312 testsuite/g++.dg/template/pr35240.C. */
6319 }
6320 }
6323 /* Free language specific information for every operand and expression
6324 in every node of the call graph. This process operates in three stages:
6326 1- Every callgraph node and varpool node is traversed looking for
6327 decls and types embedded in them. This is a more exhaustive
6328 search than that done by find_referenced_vars, because it will
6329 also collect individual fields, decls embedded in types, etc.
6331 2- All the decls found are sent to free_lang_data_in_decl.
6333 3- All the types found are sent to free_lang_data_in_type.
6335 The ordering between decls and types is important because
6336 free_lang_data_in_decl sets assembler names, which includes
6337 mangling. So types cannot be freed up until assembler names have
6338 been set up. */
6340 static void
6342 {
6345 tree t;
6349 /* Find decls and types in the body of every function in the callgraph. */
6356 /* Find decls and types in every varpool symbol. */
6360 /* Set the assembler name on every decl found. We need to do this
6361 now because free_lang_data_in_decl will invalidate data needed
6362 for mangling. This breaks mangling on interdependent decls. */
6366 /* Traverse every decl found freeing its language data. */
6370 /* Traverse every type found freeing its language data. */
6373 }
6376 /* Free resources that are used by FE but are not needed once they are done. */
6378 static unsigned
6380 {
6384 /* If we are the LTO frontend we have freed lang-specific data already. */
6387 {
6388 /* Rebuild type inheritance graph even when not doing LTO to get
6389 consistent profile data. */
6392 }
6397 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6401 /* Allocate and assign alias sets to the standard integer types
6402 while the slots are still in the way the frontends generated them. */
6407 /* Traverse the IL resetting language specific information for
6408 operands, expressions, etc. */
6411 /* Create gimple variants for common types. */
6417 /* Reset some langhooks. Do not reset types_compatible_p, it may
6418 still be used indirectly via the get_alias_set langhook. */
6431 {
6433 tree t;
6437 }
6439 /* We do not want the default decl_assembler_name implementation,
6440 rather if we have fixed everything we want a wrapper around it
6441 asserting that all non-local symbols already got their assembler
6442 name and only produce assembler names for local symbols. Or rather
6443 make sure we never call decl_assembler_name on local symbols and
6444 devise a separate, middle-end private scheme for it. */
6446 /* Reset diagnostic machinery. */
6455 }
6461 {
6471 };
6474 {
6478 {}
6480 /* opt_pass methods: */
6487 simple_ipa_opt_pass *
6489 {
6491 }
6492 \f
6493 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6494 of the various TYPE_QUAL values. */
6496 static void
6498 {
6504 }
6506 /* Returns true iff CAND and BASE have equivalent language-specific
6507 qualifiers. */
6509 bool
6511 {
6514 /* type_hash_eq currently only applies to these types. */
6519 }
6521 /* This function checks to see if TYPE matches the size one of the built-in
6522 atomic types, and returns that core atomic type. */
6524 static tree
6526 {
6527 tree base_atomic_type;
6529 /* Only handle complete types. */
6534 {
6557 }
6560 }
6562 /* Returns true iff unqualified CAND and BASE are equivalent. */
6564 bool
6566 {
6568 /* Apparently this is needed for Objective-C. */
6573 /* Check alignment. */
6576 /* Atomic types increase minimal alignment. We must to do so as well
6577 or we get duplicated canonical types. See PR88686. */
6579 {
6580 /* See if this object can map to a basic atomic type. */
6584 }
6586 }
6588 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6590 bool
6592 {
6596 }
6598 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6600 static bool
6602 {
6605 /* Apparently this is needed for Objective-C. */
6607 /* Check alignment. */
6612 }
6614 /* Return a version of the TYPE, qualified as indicated by the
6615 TYPE_QUALS, if one exists. If no qualified version exists yet,
6616 return NULL_TREE. */
6618 tree
6620 {
6628 /* Search the chain of variants to see if there is already one there just
6629 like the one we need to have. If so, use that existing one. We must
6630 preserve the TYPE_NAME, since there is code that depends on this. */
6633 {
6634 /* Put the found variant at the head of the variant list so
6635 frequently searched variants get found faster. The C++ FE
6636 benefits greatly from this. */
6642 }
6645 }
6647 /* Like get_qualified_type, but creates the type if it does not
6648 exist. This function never returns NULL_TREE. */
6650 tree
6652 {
6653 tree t;
6655 /* See if we already have the appropriate qualified variant. */
6658 /* If not, build it. */
6660 {
6665 {
6666 /* See if this object can map to a basic atomic type. */
6669 {
6670 /* Ensure the alignment of this type is compatible with
6671 the required alignment of the atomic type. */
6674 }
6675 }
6678 /* Propagate structural equality. */
6681 /* Build the underlying canonical type, since it is different
6682 from TYPE. */
6683 {
6686 }
6687 else
6688 /* T is its own canonical type. */
6691 }
6694 }
6696 /* Create a variant of type T with alignment ALIGN. */
6698 tree
6700 {
6701 tree t;
6716 }
6718 /* Create a new distinct copy of TYPE. The new type is made its own
6719 MAIN_VARIANT. If TYPE requires structural equality checks, the
6720 resulting type requires structural equality checks; otherwise, its
6721 TYPE_CANONICAL points to itself. */
6723 tree
6725 {
6731 /* Set the canonical type either to a new equivalence class, or
6732 propagate the need for structural equality checks. */
6735 else
6738 /* Make it its own variant. */
6742 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6743 whose TREE_TYPE is not t. This can also happen in the Ada
6744 frontend when using subtypes. */
6747 }
6749 /* Create a new variant of TYPE, equivalent but distinct. This is so
6750 the caller can modify it. TYPE_CANONICAL for the return type will
6751 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6752 are considered equal by the language itself (or that both types
6753 require structural equality checks). */
6755 tree
6757 {
6762 /* Since we're building a variant, assume that it is a non-semantic
6763 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6765 /* Type variants have no alias set defined. */
6768 /* Add the new type to the chain of variants of TYPE. */
6774 }
6775 \f
6776 /* Return true if the from tree in both tree maps are equal. */
6778 int
6780 {
6784 }
6786 /* Hash a from tree in a tree_base_map. */
6788 unsigned int
6790 {
6792 }
6794 /* Return true if this tree map structure is marked for garbage collection
6795 purposes. We simply return true if the from tree is marked, so that this
6796 structure goes away when the from tree goes away. */
6798 int
6800 {
6802 }
6804 /* Hash a from tree in a tree_map. */
6806 unsigned int
6808 {
6810 }
6812 /* Hash a from tree in a tree_decl_map. */
6814 unsigned int
6816 {
6818 }
6820 /* Return the initialization priority for DECL. */
6822 priority_type
6824 {
6829 return
6831 }
6833 /* Return the finalization priority for DECL. */
6835 priority_type
6837 {
6842 return
6844 }
6846 /* Set the initialization priority for DECL to PRIORITY. */
6848 void
6850 {
6854 {
6858 }
6861 else
6864 }
6866 /* Set the finalization priority for DECL to PRIORITY. */
6868 void
6870 {
6874 {
6878 }
6879 else
6882 }
6884 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6886 static void
6888 {
6893 }
6895 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6897 static void
6899 {
6904 }
6906 /* Lookup a debug expression for FROM, and return it if we find one. */
6908 tree
6910 {
6918 }
6920 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6922 void
6924 {
6931 }
6933 /* Lookup a value expression for FROM, and return it if we find one. */
6935 tree
6937 {
6945 }
6947 /* Insert a mapping FROM->TO in the value expression hashtable. */
6949 void
6951 {
6958 }
6960 /* Lookup a vector of debug arguments for FROM, and return it if we
6961 find one. */
6965 {
6976 }
6978 /* Insert a mapping FROM->empty vector of debug arguments in the value
6979 expression hashtable. */
6983 {
6998 }
7000 /* Hashing of types so that we don't make duplicates.
7001 The entry point is `type_hash_canon'. */
7003 /* Generate the default hash code for TYPE. This is designed for
7004 speed, rather than maximum entropy. */
7006 hashval_t
7008 {
7017 /* Just the identifier is adequate to distinguish. */
7021 {
7024 /* FALLTHROUGH. */
7036 {
7040 {
7043 }
7044 }
7048 {
7055 }
7059 {
7063 }
7071 }
7074 }
7076 /* These are the Hashtable callback functions. */
7078 /* Returns true iff the types are equivalent. */
7080 bool
7082 {
7083 /* First test the things that are the same for all types. */
7093 /* Be careful about comparing arrays before and after the element type
7094 has been completed; don't compare TYPE_ALIGN unless both types are
7095 complete. */
7102 {
7125 /* fall through */
7157 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7158 where the flag should be inherited from the element type
7159 and can change after ARRAY_TYPEs are created; on non-aggregates
7160 compare it and hash it, scalars will never have that flag set
7161 and we need to differentiate between arrays created by different
7162 front-ends or middle-end created arrays. */
7192 }
7198 }
7200 /* Given TYPE, and HASHCODE its hash code, return the canonical
7201 object for an identical type if one already exists.
7202 Otherwise, return TYPE, and record it as the canonical object.
7204 To use this function, first create a type of the sort you want.
7205 Then compute its hash code from the fields of the type that
7206 make it different from other similar types.
7207 Then call this function and use the value. */
7209 tree
7211 {
7212 type_hash in;
7215 /* The hash table only contains main variants, so ensure that's what we're
7216 being passed. */
7219 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7220 must call that routine before comparing TYPE_ALIGNs. */
7228 {
7234 /* Free also min/max values and the cache for integer
7235 types. This can't be done in free_node, as LTO frees
7236 those on its own. */
7238 {
7241 {
7242 /* Zero is always in TYPE_CACHED_VALUES. */
7246 }
7249 {
7252 }
7255 }
7258 }
7259 else
7260 {
7269 }
7270 }
7272 static void
7274 {
7279 }
7281 /* Given two lists of types
7282 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7283 return 1 if the lists contain the same types in the same order.
7284 Also, the TREE_PURPOSEs must match. */
7286 bool
7288 {
7300 }
7302 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7303 given by TYPE. If the argument list accepts variable arguments,
7304 then this function counts only the ordinary arguments. */
7306 int
7308 {
7312 /* If the function does not take a variable number of arguments,
7313 the last element in the list will have type `void'. */
7316 else
7320 }
7322 /* Return the type of the function TYPE's argument ARGNO if known.
7323 For vararg function's where ARGNO refers to one of the variadic
7324 arguments return null. Otherwise, return a void_type_node for
7325 out-of-bounds ARGNO. */
7327 tree
7329 {
7330 /* Treat zero the same as an out-of-bounds argument number. */
7334 function_args_iterator iter;
7336 tree argtype;
7339 {
7340 /* A vararg function's argument list ends in a null. Otherwise,
7341 an ordinary function's argument list ends with void. Return
7342 null if ARGNO refers to a vararg argument, void_type_node if
7343 it's out of bounds, and the formal argument type otherwise. */
7351 }
7354 }
7356 /* Nonzero if integer constants T1 and T2
7357 represent the same constant value. */
7359 int
7361 {
7377 }
7379 /* Return true if T is an INTEGER_CST whose numerical value (extended
7380 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7382 bool
7384 {
7388 }
7390 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7391 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7393 bool
7395 {
7399 {
7404 }
7407 }
7409 /* Return true if T is an INTEGER_CST whose numerical value (extended
7410 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7412 bool
7414 {
7418 }
7420 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7421 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7423 bool
7425 {
7429 {
7434 }
7437 }
7439 /* T is an INTEGER_CST whose numerical value (extended according to
7440 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7441 HOST_WIDE_INT. */
7443 HOST_WIDE_INT
7445 {
7448 }
7450 /* T is an INTEGER_CST whose numerical value (extended according to
7451 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7452 HOST_WIDE_INT. */
7454 unsigned HOST_WIDE_INT
7456 {
7459 }
7461 /* Return the most significant (sign) bit of T. */
7463 int
7465 {
7469 }
7471 /* Return an indication of the sign of the integer constant T.
7472 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7473 Note that -1 will never be returned if T's type is unsigned. */
7475 int
7477 {
7484 else
7486 }
7488 /* Return the minimum number of bits needed to represent VALUE in a
7489 signed or unsigned type, UNSIGNEDP says which. */
7491 unsigned int
7493 {
7494 /* If the value is negative, compute its negative minus 1. The latter
7495 adjustment is because the absolute value of the largest negative value
7496 is one larger than the largest positive value. This is equivalent to
7497 a bit-wise negation, so use that operation instead. */
7502 /* Return the number of bits needed, taking into account the fact
7503 that we need one more bit for a signed than unsigned type.
7504 If value is 0 or -1, the minimum precision is 1 no matter
7505 whether unsignedp is true or false. */
7509 else
7511 }
7513 /* Return truthvalue of whether T1 is the same tree structure as T2.
7514 Return 1 if they are the same.
7515 Return 0 if they are understandably different.
7516 Return -1 if either contains tree structure not understood by
7517 this function. */
7519 int
7521 {
7531 /* For location wrappers to be the same, they must be at the same
7532 source location (and wrap the same thing). */
7534 {
7538 }
7544 {
7548 else
7550 }
7560 {
7576 {
7585 /* ??? Should we handle also fields here? */
7589 }
7600 {
7608 {
7612 }
7614 }
7617 /* Special case: if either target is an unallocated VAR_DECL,
7618 it means that it's going to be unified with whatever the
7619 TARGET_EXPR is really supposed to initialize, so treat it
7620 as being equivalent to anything. */
7628 else
7657 /* A false return means maybe_ne rather than known_ne. */
7663 }
7665 /* This general rule works for most tree codes. All exceptions should be
7666 handled above. If this is a language-specific tree code, we can't
7667 trust what might be in the operand, so say we don't know
7668 the situation. */
7673 {
7682 {
7686 }
7692 }
7693 }
7695 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7696 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7697 than U, respectively. */
7699 int
7701 {
7710 else
7712 }
7714 /* Return true if SIZE represents a constant size that is in bounds of
7715 what the middle-end and the backend accepts (covering not more than
7716 half of the address-space).
7717 When PERR is non-null, set *PERR on failure to the description of
7718 why SIZE is not valid. */
7720 bool
7722 {
7724 {
7731 }
7733 cst_size_error error;
7738 {
7741 }
7744 {
7747 }
7750 {
7753 }
7757 {
7760 }
7763 }
7765 /* Return the precision of the type, or for a complex or vector type the
7766 precision of the type of its elements. */
7768 unsigned int
7770 {
7778 }
7780 /* Return true if CODE represents an associative tree code. Otherwise
7781 return false. */
7782 bool
7784 {
7786 {
7798 }
7800 }
7802 /* Return true if CODE represents a commutative tree code. Otherwise
7803 return false. */
7804 bool
7806 {
7808 {
7835 }
7837 }
7839 /* Return true if CODE represents a ternary tree code for which the
7840 first two operands are commutative. Otherwise return false. */
7841 bool
7843 {
7845 {
7853 }
7855 }
7857 /* Returns true if CODE can overflow. */
7859 bool
7861 {
7863 {
7868 /* Can overflow in various ways. */
7874 /* For INT_MIN / -1. */
7878 /* For -INT_MIN. */
7881 /* These operators cannot overflow. */
7883 }
7884 }
7886 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7887 ftrapv doesn't generate trapping insns for CODE. */
7889 bool
7891 {
7894 /* We don't generate instructions that trap on overflow for complex or vector
7895 types. */
7903 {
7909 /* These operators can overflow, and -ftrapv generates trapping code for
7910 these. */
7917 /* These operators can overflow, but -ftrapv does not generate trapping
7918 code for these. */
7921 /* These operators cannot overflow. */
7923 }
7924 }
7926 /* Constructors for pointer, array and function types.
7927 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7928 constructed by language-dependent code, not here.) */
7930 /* Construct, lay out and return the type of pointers to TO_TYPE with
7931 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7932 reference all of memory. If such a type has already been
7933 constructed, reuse it. */
7935 tree
7938 {
7939 tree t;
7945 /* If the pointed-to type has the may_alias attribute set, force
7946 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7950 /* In some cases, languages will have things that aren't a POINTER_TYPE
7951 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7952 In that case, return that type without regard to the rest of our
7953 operands.
7955 ??? This is a kludge, but consistent with the way this function has
7956 always operated and there doesn't seem to be a good way to avoid this
7957 at the moment. */
7962 /* First, if we already have a type for pointers to TO_TYPE and it's
7963 the proper mode, use it. */
7976 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7984 /* Lay out the type. This function has many callers that are concerned
7985 with expression-construction, and this simplifies them all. */
7989 }
7991 /* By default build pointers in ptr_mode. */
7993 tree
7995 {
8000 }
8002 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8004 tree
8007 {
8008 tree t;
8014 /* If the pointed-to type has the may_alias attribute set, force
8015 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8019 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8020 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8021 In that case, return that type without regard to the rest of our
8022 operands.
8024 ??? This is a kludge, but consistent with the way this function has
8025 always operated and there doesn't seem to be a good way to avoid this
8026 at the moment. */
8031 /* First, if we already have a type for pointers to TO_TYPE and it's
8032 the proper mode, use it. */
8045 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8056 }
8059 /* Build the node for the type of references-to-TO_TYPE by default
8060 in ptr_mode. */
8062 tree
8064 {
8069 }
8071 #define MAX_INT_CACHED_PREC \
8072 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8075 /* Builds a signed or unsigned integer type of precision PRECISION.
8076 Used for C bitfields whose precision does not match that of
8077 built-in target types. */
8078 tree
8081 {
8088 {
8092 }
8099 else
8109 }
8111 #define MAX_BOOL_CACHED_PREC \
8112 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8115 /* Builds a boolean type of precision PRECISION.
8116 Used for boolean vectors to choose proper vector element size. */
8117 tree
8119 {
8120 tree type;
8123 {
8127 }
8137 }
8139 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8140 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8141 is true, reuse such a type that has already been constructed. */
8143 static tree
8145 {
8168 {
8169 /* Since we cannot reliably merge this type, we need to compare it using
8170 structural equality checks. */
8173 }
8179 }
8181 /* Wrapper around build_range_type_1 with SHARED set to true. */
8183 tree
8185 {
8187 }
8189 /* Wrapper around build_range_type_1 with SHARED set to false. */
8191 tree
8193 {
8195 }
8197 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8198 MAXVAL should be the maximum value in the domain
8199 (one less than the length of the array).
8201 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8202 We don't enforce this limit, that is up to caller (e.g. language front end).
8203 The limit exists because the result is a signed type and we don't handle
8204 sizes that use more than one HOST_WIDE_INT. */
8206 tree
8208 {
8210 }
8212 /* Return true if the debug information for TYPE, a subtype, should be emitted
8213 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8214 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8215 debug info and doesn't reflect the source code. */
8217 bool
8219 {
8222 /* Subrange types have a base type which is an integral type. */
8226 /* Get the real bounds of the subtype. */
8229 else
8230 {
8233 }
8235 /* If the type and its base type have the same representation and the same
8236 name, then the type is not a subrange but a copy of the base type. */
8250 }
8252 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8253 and number of elements specified by the range of values of INDEX_TYPE.
8254 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8255 If SHARED is true, reuse such a type that has already been constructed.
8256 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8258 static tree
8261 {
8262 tree t;
8265 {
8268 }
8278 {
8281 }
8284 {
8293 index_type
8296 }
8299 }
8301 /* Wrapper around build_array_type_1 with SHARED set to true. */
8303 tree
8305 {
8306 return
8308 }
8310 /* Wrapper around build_array_type_1 with SHARED set to false. */
8312 tree
8314 {
8316 }
8318 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8319 sizetype. */
8321 tree
8323 {
8325 }
8327 /* Recursively examines the array elements of TYPE, until a non-array
8328 element type is found. */
8330 tree
8332 {
8337 }
8339 /* Computes the canonical argument types from the argument type list
8340 ARGTYPES.
8342 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8343 on entry to this function, or if any of the ARGTYPES are
8344 structural.
8346 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8347 true on entry to this function, or if any of the ARGTYPES are
8348 non-canonical.
8350 Returns a canonical argument list, which may be ARGTYPES when the
8351 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8352 true) or would not differ from ARGTYPES. */
8354 static tree
8358 {
8359 tree arg;
8363 {
8365 /* Fail gracefully by stating that the type is structural. */
8371 /* If the argument has a default argument, we consider it
8372 non-canonical even though the type itself is canonical.
8373 That way, different variants of function and method types
8374 with default arguments will all point to the variant with
8375 no defaults as their canonical type. */
8377 }
8383 {
8384 /* Build the canonical list of argument types. */
8389 {
8392 else
8395 canon_argtypes);
8396 }
8402 /* There is a non-canonical type. */
8405 }
8407 /* The canonical argument types are the same as ARGTYPES. */
8409 }
8411 /* Construct, lay out and return
8412 the type of functions returning type VALUE_TYPE
8413 given arguments of types ARG_TYPES.
8414 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8415 are data type nodes for the arguments of the function.
8416 If such a type has already been constructed, reuse it. */
8418 tree
8420 {
8421 tree t;
8424 tree canon_argtypes;
8429 {
8432 }
8434 /* Make a node of the sort we want. */
8439 /* If we already have such a type, use the old one. */
8443 /* Set up the canonical type. */
8453 canon_argtypes);
8458 }
8460 /* Build a function type. The RETURN_TYPE is the type returned by the
8461 function. If VAARGS is set, no void_type_node is appended to the
8462 list. ARGP must be always be terminated be a NULL_TREE. */
8464 static tree
8466 {
8474 {
8479 }
8482 else
8483 {
8487 }
8491 }
8493 /* Build a function type. The RETURN_TYPE is the type returned by the
8494 function. If additional arguments are provided, they are
8495 additional argument types. The list of argument types must always
8496 be terminated by NULL_TREE. */
8498 tree
8500 {
8501 tree args;
8508 }
8510 /* Build a variable argument function type. The RETURN_TYPE is the
8511 type returned by the function. If additional arguments are provided,
8512 they are additional argument types. The list of argument types must
8513 always be terminated by NULL_TREE. */
8515 tree
8517 {
8518 tree args;
8526 }
8528 /* Build a function type. RETURN_TYPE is the type returned by the
8529 function; VAARGS indicates whether the function takes varargs. The
8530 function takes N named arguments, the types of which are provided in
8531 ARG_TYPES. */
8533 static tree
8536 {
8544 }
8546 /* Build a function type. RETURN_TYPE is the type returned by the
8547 function. The function takes N named arguments, the types of which
8548 are provided in ARG_TYPES. */
8550 tree
8552 {
8554 }
8556 /* Build a variable argument function type. RETURN_TYPE is the type
8557 returned by the function. The function takes N named arguments, the
8558 types of which are provided in ARG_TYPES. */
8560 tree
8562 {
8564 }
8566 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8567 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8568 for the method. An implicit additional parameter (of type
8569 pointer-to-BASETYPE) is added to the ARGTYPES. */
8571 tree
8573 tree rettype,
8574 tree argtypes)
8575 {
8576 tree t;
8577 tree ptype;
8579 tree canon_argtypes;
8581 /* Make a node of the sort we want. */
8588 /* The actual arglist for this function includes a "hidden" argument
8589 which is "this". Put it into the list of argument types. */
8593 /* If we already have such a type, use the old one. */
8597 /* Set up the canonical type. */
8598 any_structural_p
8601 any_noncanonical_p
8613 canon_argtypes);
8618 }
8620 /* Construct, lay out and return the type of methods belonging to class
8621 BASETYPE and whose arguments and values are described by TYPE.
8622 If that type exists already, reuse it.
8623 TYPE must be a FUNCTION_TYPE node. */
8625 tree
8627 {
8633 }
8635 /* Construct, lay out and return the type of offsets to a value
8636 of type TYPE, within an object of type BASETYPE.
8637 If a suitable offset type exists already, reuse it. */
8639 tree
8641 {
8642 tree t;
8644 /* Make a node of the sort we want. */
8650 /* If we already have such a type, use the old one. */
8658 {
8667 }
8670 }
8672 /* Create a complex type whose components are COMPONENT_TYPE.
8674 If NAMED is true, the type is given a TYPE_NAME. We do not always
8675 do so because this creates a DECL node and thus make the DECL_UIDs
8676 dependent on the type canonicalization hashtable, which is GC-ed,
8677 so the DECL_UIDs would not be stable wrt garbage collection. */
8679 tree
8681 {
8686 /* Make a node of the sort we want. */
8691 /* If we already have such a type, use the old one. */
8696 {
8697 /* We created a new type. The hash insertion will have laid
8698 out the type. We need to check the canonicalization and
8699 maybe set the name. */
8710 /* We need to create a name, since complex is a fundamental type. */
8712 {
8741 }
8742 }
8745 }
8747 /* If TYPE is a real or complex floating-point type and the target
8748 does not directly support arithmetic on TYPE then return the wider
8749 type to be used for arithmetic on TYPE. Otherwise, return
8750 NULL_TREE. */
8752 tree
8754 {
8755 /* The target can give two different responses to the question of
8756 which excess precision mode it would like depending on whether we
8757 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8759 enum excess_precision_type requested_type
8761 ? EXCESS_PRECISION_TYPE_FAST
8764 enum flt_eval_method target_flt_eval_method
8767 /* The target should not ask for unpredictable float evaluation (though
8768 it might advertise that implicitly the evaluation is unpredictable,
8769 but we don't care about that here, it will have been reported
8770 elsewhere). If it does ask for unpredictable evaluation, we have
8771 nothing to do here. */
8774 /* Nothing to do. The target has asked for all types we know about
8775 to be computed with their native precision and range. */
8779 /* The target will promote this type in a target-dependent way, so excess
8780 precision ought to leave it alone. */
8784 machine_mode float16_type_mode = (float16_type_node
8791 {
8793 {
8796 {
8814 }
8816 }
8818 {
8823 {
8841 }
8843 }
8846 }
8849 }
8850 \f
8851 /* Return OP, stripped of any conversions to wider types as much as is safe.
8852 Converting the value back to OP's type makes a value equivalent to OP.
8854 If FOR_TYPE is nonzero, we return a value which, if converted to
8855 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8857 OP must have integer, real or enumeral type. Pointers are not allowed!
8859 There are some cases where the obvious value we could return
8860 would regenerate to OP if converted to OP's type,
8861 but would not extend like OP to wider types.
8862 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8863 For example, if OP is (unsigned short)(signed char)-1,
8864 we avoid returning (signed char)-1 if FOR_TYPE is int,
8865 even though extending that to an unsigned short would regenerate OP,
8866 since the result of extending (signed char)-1 to (int)
8867 is different from (int) OP. */
8869 tree
8871 {
8872 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8874 unsigned final_prec
8876 int uns
8883 {
8886 /* TYPE_PRECISION on vector types has different meaning
8887 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8888 so avoid them here. */
8895 /* Truncations are many-one so cannot be removed.
8896 Unless we are later going to truncate down even farther. */
8901 /* See what's inside this conversion. If we decide to strip it,
8902 we will set WIN. */
8905 /* If we have not stripped any zero-extensions (uns is 0),
8906 we can strip any kind of extension.
8907 If we have previously stripped a zero-extension,
8908 only zero-extensions can safely be stripped.
8909 Any extension can be stripped if the bits it would produce
8910 are all going to be discarded later by truncating to FOR_TYPE. */
8913 {
8916 /* TYPE_UNSIGNED says whether this is a zero-extension.
8917 Let's avoid computing it if it does not affect WIN
8918 and if UNS will not be needed again. */
8922 {
8925 }
8926 }
8927 }
8929 /* If we finally reach a constant see if it fits in sth smaller and
8930 in that case convert it. */
8932 {
8938 {
8942 }
8943 }
8946 }
8947 \f
8948 /* Return OP or a simpler expression for a narrower value
8949 which can be sign-extended or zero-extended to give back OP.
8950 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8951 or 0 if the value should be sign-extended. */
8953 tree
8955 {
8962 {
8963 do
8977 ret);
8979 }
8981 {
8982 int bitschange
8986 /* Truncations are many-one so cannot be removed. */
8990 /* See what's inside this conversion. If we decide to strip it,
8991 we will set WIN. */
8994 {
8996 /* An extension: the outermost one can be stripped,
8997 but remember whether it is zero or sign extension. */
9000 /* Otherwise, if a sign extension has been stripped,
9001 only sign extensions can now be stripped;
9002 if a zero extension has been stripped, only zero-extensions. */
9006 }
9008 {
9009 /* A change in nominal type can always be stripped, but we must
9010 preserve the unsignedness. */
9015 /* Keep trying to narrow, but don't assign op to win if it
9016 would turn an integral type into something else. */
9019 }
9022 }
9025 /* Since type_for_size always gives an integer type. */
9028 /* Ensure field is laid out already. */
9031 {
9032 unsigned HOST_WIDE_INT innerprec
9038 /* We can get this structure field in a narrower type that fits it,
9039 but the resulting extension to its nominal type (a fullword type)
9040 must satisfy the same conditions as for other extensions.
9042 Do this only for fields that are aligned (not bit-fields),
9043 because when bit-field insns will be used there is no
9044 advantage in doing this. */
9050 {
9054 }
9055 }
9059 }
9060 \f
9061 /* Return true if integer constant C has a value that is permissible
9062 for TYPE, an integral type. */
9064 bool
9066 {
9071 /* Non-standard boolean types can have arbitrary precision but various
9072 transformations assume that they can only take values 0 and +/-1. */
9076 retry:
9080 /* If at least one bound of the type is a constant integer, we can check
9081 ourselves and maybe make a decision. If no such decision is possible, but
9082 this type is a subtype, try checking against that. Otherwise, use
9083 fits_to_tree_p, which checks against the precision.
9085 Compute the status for each possibly constant bound, and return if we see
9086 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9087 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9088 for "constant known to fit". */
9090 /* Check if c >= type_low_bound. */
9092 {
9096 }
9097 else
9100 /* Check if c <= type_high_bound. */
9102 {
9106 }
9107 else
9110 /* If the constant fits both bounds, the result is known. */
9114 /* Perform some generic filtering which may allow making a decision
9115 even if the bounds are not constant. First, negative integers
9116 never fit in unsigned types, */
9120 /* Second, narrower types always fit in wider ones. */
9124 /* Third, unsigned integers with top bit set never fit signed types. */
9126 {
9129 {
9130 /* When a tree_cst is converted to a wide-int, the precision
9131 is taken from the type. However, if the precision of the
9132 mode underneath the type is smaller than that, it is
9133 possible that the value will not fit. The test below
9134 fails if any bit is set between the sign bit of the
9135 underlying mode and the top bit of the type. */
9138 }
9141 }
9143 /* If we haven't been able to decide at this point, there nothing more we
9144 can check ourselves here. Look at the base type if we have one and it
9145 has the same precision. */
9149 {
9152 }
9154 /* Or to fits_to_tree_p, if nothing else. */
9156 }
9158 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9159 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9160 represented (assuming two's-complement arithmetic) within the bit
9161 precision of the type are returned instead. */
9163 void
9165 {
9169 else
9170 {
9173 else
9174 {
9177 }
9178 }
9183 else
9184 {
9187 }
9188 }
9190 /* Return true if VAR is an automatic variable. */
9192 bool
9194 {
9199 }
9201 /* Return true if VAR is an automatic variable defined in function FN. */
9203 bool
9205 {
9209 }
9211 /* Subprogram of following function. Called by walk_tree.
9213 Return *TP if it is an automatic variable or parameter of the
9214 function passed in as DATA. */
9216 static tree
9218 {
9229 }
9231 /* Returns true if T is, contains, or refers to a type with variable
9232 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9233 arguments, but not the return type. If FN is nonzero, only return
9234 true if a modifier of the type or position of FN is a variable or
9235 parameter inside FN.
9237 This concept is more general than that of C99 'variably modified types':
9238 in C99, a struct type is never variably modified because a VLA may not
9239 appear as a structure member. However, in GNU C code like:
9241 struct S { int i[f()]; };
9243 is valid, and other languages may define similar constructs. */
9245 bool
9247 {
9248 tree t;
9250 /* Test if T is either variable (if FN is zero) or an expression containing
9251 a variable in FN. If TYPE isn't gimplified, return true also if
9252 gimplify_one_sizepos would gimplify the expression into a local
9253 variable. */
9254 #define RETURN_TRUE_IF_VAR(T) \
9255 do { tree _t = (T); \
9256 if (_t != NULL_TREE \
9257 && _t != error_mark_node \
9258 && !CONSTANT_CLASS_P (_t) \
9259 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9260 && (!fn \
9261 || (!TYPE_SIZES_GIMPLIFIED (type) \
9262 && (TREE_CODE (_t) != VAR_DECL \
9263 && !CONTAINS_PLACEHOLDER_P (_t))) \
9264 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9265 return true; } while (0)
9270 /* If TYPE itself has variable size, it is variably modified. */
9275 {
9279 /* Ada can have pointer types refering to themselves indirectly. */
9284 {
9287 }
9293 /* If TYPE is a function type, it is variably modified if the
9294 return type is variably modified. */
9304 /* Scalar types are variably modified if their end points
9305 aren't constant. */
9313 /* We can't see if any of the fields are variably-modified by the
9314 definition we normally use, since that would produce infinite
9315 recursion via pointers. */
9316 /* This is variably modified if some field's type is. */
9319 {
9324 /* If the type is a qualified union, then the DECL_QUALIFIER
9325 of fields can also be an expression containing a variable. */
9329 /* If the field is a qualified union, then it's only a container
9330 for what's inside so we look into it. That's necessary in LTO
9331 mode because the sizes of the field tested above have been set
9332 to PLACEHOLDER_EXPRs by free_lang_data. */
9336 }
9340 /* Do not call ourselves to avoid infinite recursion. This is
9341 variably modified if the element type is. */
9348 }
9350 /* The current language may have other cases to check, but in general,
9351 all other types are not variably modified. */
9354 #undef RETURN_TRUE_IF_VAR
9355 }
9357 /* Given a DECL or TYPE, return the scope in which it was declared, or
9358 NULL_TREE if there is no containing scope. */
9360 tree
9362 {
9364 }
9366 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9368 const_tree
9370 {
9372 {
9375 else
9377 }
9379 }
9381 /* Return the innermost context enclosing DECL that is
9382 a FUNCTION_DECL, or zero if none. */
9384 tree
9386 {
9387 tree context;
9392 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9393 where we look up the function at runtime. Such functions always take
9394 a first argument of type 'pointer to real context'.
9396 C++ should really be fixed to use DECL_CONTEXT for the real context,
9397 and use something else for the "virtual context". */
9399 context
9400 = TYPE_MAIN_VARIANT
9402 else
9406 {
9409 else
9411 }
9414 }
9416 /* Return the innermost context enclosing DECL that is
9417 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9418 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9420 tree
9422 {
9427 {
9448 }
9451 }
9453 /* CALL is a CALL_EXPR. Return the declaration for the function
9454 called, or NULL_TREE if the called function cannot be
9455 determined. */
9457 tree
9459 {
9460 tree addr;
9465 /* It's invalid to call this function with anything but a
9466 CALL_EXPR. */
9469 /* The first operand to the CALL is the address of the function
9470 called. */
9473 /* If there is no function, return early. */
9479 /* If this is a readonly function pointer, extract its initial value. */
9485 /* If the address is just `&f' for some function `f', then we know
9486 that `f' is being called. */
9491 /* We couldn't figure out what was being called. */
9493 }
9495 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9496 return the associated function code, otherwise return CFN_LAST. */
9498 combined_fn
9500 {
9501 /* It's invalid to call this function with anything but a CALL_EXPR. */
9512 }
9514 /* Comparator of indices based on tree_node_counts. */
9516 static int
9518 {
9523 }
9525 /* Comparator of indices based on tree_code_counts. */
9527 static int
9529 {
9534 }
9536 #define TREE_MEM_USAGE_SPACES 40
9538 /* Print debugging information about tree nodes generated during the compile,
9539 and any language-specific information. */
9541 void
9543 {
9545 {
9551 {
9558 {
9565 }
9570 }
9572 {
9582 {
9587 }
9594 }
9595 }
9596 else
9603 }
9604 \f
9607 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9609 unsigned
9611 {
9612 /* This relies on the raw feedback's top 4 bits being zero. */
9613 #define FEEDBACK(X) ((X) * 0x04c11db7)
9614 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9615 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9617 {
9622 };
9623 #undef FEEDBACK
9624 #undef SYNDROME
9628 {
9632 }
9635 }
9637 /* Generate a crc32 of a string. */
9639 unsigned
9641 {
9642 do
9646 }
9648 /* P is a string that will be used in a symbol. Mask out any characters
9649 that are not valid in that context. */
9651 void
9653 {
9658 #endif
9661 #endif
9662 ))
9664 }
9668 /* Create a unique anonymous identifier. The identifier is still a
9669 valid assembly label. */
9671 tree
9673 {
9675 #if !defined (NO_DOT_IN_LABEL)
9676 "."
9677 #elif !defined (NO_DOLLAR_IN_LABEL)
9678 "$"
9679 #else
9680 "_"
9681 #endif
9692 }
9694 /* Generate a name for a special-purpose function.
9695 The generated name may need to be unique across the whole link.
9696 Changes to this function may also require corresponding changes to
9697 xstrdup_mask_random.
9698 TYPE is some string to identify the purpose of this function to the
9699 linker or collect2; it must start with an uppercase letter,
9700 one of:
9701 I - for constructors
9702 D - for destructors
9703 N - for C++ anonymous namespaces
9704 F - for DWARF unwind frame information. */
9706 tree
9708 {
9713 /* If we already have a name we know to be unique, just use that. */
9716 /* If the target is handling the constructors/destructors, they
9717 will be local to this file and the name is only necessary for
9718 debugging purposes.
9719 We also assign sub_I and sub_D sufixes to constructors called from
9720 the global static constructors. These are always local. */
9724 {
9728 /* Just use the file's basename, because the full pathname
9729 might be quite long. */
9731 }
9732 else
9733 {
9734 /* Otherwise, the name must be unique across the entire link.
9735 We don't have anything that we know to be unique to this translation
9736 unit, so use what we do have and throw in some randomness. */
9754 }
9760 /* Set up the name of the file-level functions we may need.
9761 Use a global object (which is already required to be unique over
9762 the program) rather than the file name (which imposes extra
9763 constraints). */
9767 }
9768 \f
9769 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9771 /* Complain that the tree code of NODE does not match the expected 0
9772 terminated list of trailing codes. The trailing code list can be
9773 empty, for a more vague error message. FILE, LINE, and FUNCTION
9774 are of the caller. */
9776 void
9779 {
9790 {
9797 {
9804 }
9806 }
9807 else
9813 }
9815 /* Complain that the tree code of NODE does match the expected 0
9816 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9817 the caller. */
9819 void
9822 {
9836 {
9838 {
9841 }
9844 }
9850 }
9852 /* Similar to tree_check_failed, except that we check for a class of tree
9853 code, given in CL. */
9855 void
9858 {
9859 internal_error
9864 }
9866 /* Similar to tree_check_failed, except that instead of specifying a
9867 dozen codes, use the knowledge that they're all sequential. */
9869 void
9873 {
9886 {
9893 }
9898 }
9901 /* Similar to tree_check_failed, except that we check that a tree does
9902 not have the specified code, given in CL. */
9904 void
9907 {
9908 internal_error
9913 }
9916 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9918 void
9921 {
9927 }
9930 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9932 void
9936 {
9949 {
9956 }
9961 }
9964 #undef DEFTREESTRUCT
9965 #define DEFTREESTRUCT(VAL, NAME) NAME,
9969 };
9970 #undef DEFTREESTRUCT
9972 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9974 /* Similar to tree_class_check_failed, except that we check for
9975 whether CODE contains the tree structure identified by EN. */
9977 void
9982 {
9983 internal_error
9987 }
9990 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9991 (dynamically sized) vector. */
9993 void
9996 {
9997 internal_error
10001 }
10003 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10004 (dynamically sized) vector. */
10006 void
10009 {
10010 internal_error
10013 }
10015 /* Similar to above, except that the check is for the bounds of the operand
10016 vector of an expression node EXP. */
10018 void
10021 {
10023 internal_error
10027 }
10029 /* Similar to above, except that the check is for the number of
10030 operands of an OMP_CLAUSE node. */
10032 void
10035 {
10036 internal_error
10041 }
10043 \f
10044 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10045 and mapped to the machine mode MODE. Initialize its fields and build
10046 the information necessary for debugging output. */
10048 static tree
10050 {
10051 tree t;
10072 /* We have built a main variant, based on the main variant of the
10073 inner type. Use it to build the variant we return. */
10081 }
10083 static tree
10085 {
10108 else
10110 }
10112 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10114 static tree
10116 {
10118 {
10130 }
10131 else
10132 {
10144 }
10147 }
10149 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10151 static tree
10153 {
10155 {
10167 }
10168 else
10169 {
10181 }
10184 }
10187 /* Create an atomic variant node for TYPE. This routine is called
10188 during initialization of data types to create the 5 basic atomic
10189 types. The generic build_variant_type function requires these to
10190 already be set up in order to function properly, so cannot be
10191 called from there. If ALIGN is non-zero, then ensure alignment is
10192 overridden to this value. */
10194 static tree
10196 {
10197 tree t;
10199 /* Make sure its not already registered. */
10210 }
10212 /* Information about the _FloatN and _FloatNx types. This must be in
10213 the same order as the corresponding TI_* enum values. */
10215 {
10223 };
10226 /* Create nodes for all integer types (and error_mark_node) using the sizes
10227 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10229 void
10231 {
10239 /* Define both `signed char' and `unsigned char'. */
10245 /* Define `char', which is like either `signed char' or `unsigned char'
10246 but not the same as either. */
10247 char_type_node
10248 = (signed_char
10263 {
10268 {
10271 }
10272 }
10274 /* Define a boolean type. This type only represents boolean values but
10275 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10281 /* Define what type to use for size_t. */
10290 else
10291 {
10297 {
10304 {
10306 }
10307 }
10310 }
10312 /* Define what type to use for ptrdiff_t. */
10321 else
10322 {
10326 {
10334 }
10337 }
10339 /* Fill in the rest of the sized types. Reuse existing type nodes
10340 when possible. */
10353 /* Don't call build_qualified type for atomics. That routine does
10354 special processing for atomics, and until they are initialized
10355 it's better not to make that call.
10357 Check to see if there is a target override for atomic types. */
10374 /* Define these next since types below may used them. */
10392 /* We are not going to have real types in C with less than byte alignment,
10393 so we might as well not have any types that claim to have it. */
10404 const_ptr_type_node
10426 {
10429 scalar_float_mode mode;
10433 /* Work around the rs6000 KFmode having precision 113 not
10434 128. */
10446 }
10453 /* Fixed size integer types. */
10460 /* Decimal float types. */
10462 {
10477 }
10486 {
10490 }
10492 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10493 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10494 sat_ ## KIND ## _type_node = \
10495 make_sat_signed_ ## KIND ## _type (SIZE); \
10496 sat_unsigned_ ## KIND ## _type_node = \
10497 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10498 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10499 unsigned_ ## KIND ## _type_node = \
10500 make_unsigned_ ## KIND ## _type (SIZE);
10502 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10503 sat_ ## WIDTH ## KIND ## _type_node = \
10504 make_sat_signed_ ## KIND ## _type (SIZE); \
10505 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10506 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10507 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10508 unsigned_ ## WIDTH ## KIND ## _type_node = \
10509 make_unsigned_ ## KIND ## _type (SIZE);
10511 /* Make fixed-point type nodes based on four different widths. */
10512 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10513 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10514 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10515 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10516 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10518 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10519 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10520 NAME ## _type_node = \
10521 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10522 u ## NAME ## _type_node = \
10523 make_or_reuse_unsigned_ ## KIND ## _type \
10524 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10525 sat_ ## NAME ## _type_node = \
10526 make_or_reuse_sat_signed_ ## KIND ## _type \
10527 (GET_MODE_BITSIZE (MODE ## mode)); \
10528 sat_u ## NAME ## _type_node = \
10529 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10530 (GET_MODE_BITSIZE (U ## MODE ## mode));
10532 /* Fixed-point type and mode nodes. */
10545 {
10548 /* Many back-ends define record types without setting TYPE_NAME.
10549 If we copied the record type here, we'd keep the original
10550 record type without a name. This breaks name mangling. So,
10551 don't copy record types and let c_common_nodes_and_builtins()
10552 declare the type to be __builtin_va_list. */
10557 }
10559 /* SCEV analyzer global shared trees. */
10564 }
10566 /* Modify DECL for given flags.
10567 TM_PURE attribute is set only on types, so the function will modify
10568 DECL's type when ECF_TM_PURE is used. */
10570 void
10572 {
10602 /* Looping const or pure is implied by noreturn.
10603 There is currently no way to declare looping const or looping pure alone. */
10606 }
10609 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10611 static void
10614 {
10615 tree decl;
10622 }
10624 /* Call this function after instantiating all builtins that the language
10625 front end cares about. This will build the rest of the builtins
10626 and internal functions that are relied upon by the tree optimizers and
10627 the middle-end. */
10629 void
10631 {
10637 {
10641 BUILT_IN_UNREACHABLE,
10649 }
10653 {
10664 }
10667 {
10670 NULL_TREE);
10673 }
10676 {
10682 }
10684 /* If we're checking the stack, `alloca' can throw. */
10685 const int alloca_flags
10689 {
10694 }
10699 BUILT_IN_ALLOCA_WITH_ALIGN,
10701 alloca_flags);
10706 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10708 alloca_flags);
10714 BUILT_IN_INIT_TRAMPOLINE,
10717 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10721 BUILT_IN_INIT_DESCRIPTOR,
10726 BUILT_IN_ADJUST_TRAMPOLINE,
10730 BUILT_IN_ADJUST_DESCRIPTOR,
10738 BUILT_IN_CLEAR_CACHE,
10740 ECF_NOTHROW);
10743 BUILT_IN_NONLOCAL_GOTO,
10750 BUILT_IN_SETJMP_SETUP,
10755 BUILT_IN_SETJMP_RECEIVER,
10764 BUILT_IN_STACK_RESTORE,
10769 NULL_TREE);
10782 /* If there's a possibility that we might use the ARM EABI, build the
10783 alternate __cxa_end_cleanup node used to resume from C++. */
10785 {
10788 BUILT_IN_CXA_END_CLEANUP,
10790 }
10794 BUILT_IN_UNWIND_RESUME,
10798 ECF_NORETURN);
10801 {
10803 NULL_TREE);
10805 BUILT_IN_RETURN_ADDRESS,
10807 ECF_NOTHROW);
10808 }
10812 {
10817 BUILT_IN_PROFILE_FUNC_ENTER,
10821 BUILT_IN_PROFILE_FUNC_EXIT,
10823 }
10825 /* The exception object and filter values from the runtime. The argument
10826 must be zero before exception lowering, i.e. from the front end. After
10827 exception lowering, it will be the region number for the exception
10828 landing pad. These functions are PURE instead of CONST to prevent
10829 them from being hoisted past the exception edge that will initialize
10830 its value in the landing pad. */
10834 /* Only use TM_PURE if we have TM language support. */
10847 NULL_TREE);
10849 BUILT_IN_EH_COPY_VALUES,
10852 /* Complex multiplication and division. These are handled as builtins
10853 rather than optabs because emit_library_call_value doesn't support
10854 complex. Further, we can do slightly better with folding these
10855 beasties if the real and complex parts of the arguments are separate. */
10856 {
10860 {
10887 /* For -ftrapping-math these should throw from a former
10888 -fnon-call-exception stmt. */
10890 NULL);
10896 NULL);
10900 }
10901 }
10904 }
10906 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10907 better way.
10909 If we requested a pointer to a vector, build up the pointers that
10910 we stripped off while looking for the inner type. Similarly for
10911 return values from functions.
10913 The argument TYPE is the top of the chain, and BOTTOM is the
10914 new type which we will point to. */
10916 tree
10918 {
10922 {
10926 }
10928 {
10932 }
10934 {
10937 }
10939 {
10942 }
10944 {
10946 /* The build_method_type_directly() routine prepends 'this' to argument list,
10947 so we must compensate by getting rid of it. */
10948 outer
10949 = build_method_type_directly
10951 inner,
10953 }
10955 {
10958 }
10959 else
10964 }
10966 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10967 the inner type. */
10968 tree
10970 {
10971 poly_int64 nunits;
10975 {
10987 /* Check that there are no leftover bits. */
10995 }
10998 }
11000 /* Similarly, but takes the inner type and number of units, which must be
11001 a power of two. */
11003 tree
11005 {
11007 }
11009 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
11011 tree
11013 {
11018 {
11021 }
11022 else
11028 }
11030 /* Build a vector type that holds one boolean result for each element of
11031 vector type VECTYPE. The public interface for this operation is
11032 truth_type_for. */
11034 static tree
11036 {
11040 machine_mode mask_mode;
11050 }
11052 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
11053 set. */
11055 tree
11057 {
11059 tree cand;
11060 /* We always build the non-opaque variant before the opaque one,
11061 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11067 /* Othewise build a variant type and make sure to queue it after
11068 the non-opaque type. */
11076 }
11078 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11080 wide_int
11082 {
11083 /* First handle elements that are directly encoded. */
11088 /* Identify the pattern that contains element I and work out the index of
11089 the last encoded element for that pattern. */
11095 /* If there are no steps, the final encoded value is the right one. */
11099 /* Otherwise work out the value from the last two encoded elements. */
11104 }
11106 /* Return the value of element I of VECTOR_CST T. */
11108 tree
11110 {
11111 /* First handle elements that are directly encoded. */
11116 /* If there are no steps, the final encoded value is the right one. */
11118 {
11119 /* Identify the pattern that contains element I and work out the index of
11120 the last encoded element for that pattern. */
11125 }
11127 /* Otherwise work out the value from the last two encoded elements. */
11130 }
11132 /* Given an initializer INIT, return TRUE if INIT is zero or some
11133 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11134 null, set *NONZERO if and only if INIT is known not to be all
11135 zeros. The combination of return value of false and *NONZERO
11136 false implies that INIT may but need not be all zeros. Other
11137 combinations indicate definitive answers. */
11139 bool
11141 {
11146 /* Conservatively clear NONZERO and set it only if INIT is definitely
11147 not all zero. */
11155 {
11164 /* ??? Note that this is not correct for C4X float formats. There,
11165 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11166 negative exponent. */
11201 {
11206 tree elt;
11213 }
11216 {
11231 }
11232 /* Fall through. */
11235 {
11243 /* We need to loop through all elements to handle cases like
11244 "\0" and "\0foobar". */
11247 {
11250 }
11253 }
11257 }
11258 }
11260 /* Return true if EXPR is an initializer expression in which every element
11261 is a constant that is numerically equal to 0 or 1. The elements do not
11262 need to be equal to each other. */
11264 bool
11266 {
11270 {
11278 {
11285 {
11289 }
11292 }
11296 }
11297 }
11299 /* Check if vector VEC consists of all the equal elements and
11300 that the number of elements corresponds to the type of VEC.
11301 The function returns first element of the vector
11302 or NULL_TREE if the vector is not uniform. */
11303 tree
11305 {
11318 {
11322 }
11326 {
11330 {
11332 {
11335 }
11338 }
11343 }
11346 }
11348 /* If the argument is INTEGER_CST, return it. If the argument is vector
11349 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11350 return NULL_TREE.
11351 Look through location wrappers. */
11353 tree
11355 {
11362 {
11366 }
11369 }
11371 /* If VECTOR_CST T has a single nonzero element, return the index of that
11372 element, otherwise return -1. */
11374 int
11376 {
11382 {
11385 }
11386 else
11391 {
11394 {
11398 }
11399 }
11401 }
11403 /* Build an empty statement at location LOC. */
11405 tree
11407 {
11411 }
11414 /* Build an OpenMP clause with code CODE. LOC is the location of the
11415 clause. */
11417 tree
11419 {
11420 tree t;
11435 }
11437 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11438 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11439 Except for the CODE and operand count field, other storage for the
11440 object is initialized to zeros. */
11442 tree
11444 {
11445 tree t;
11457 /* Can't use TREE_OPERAND to store the length because if checking is
11458 enabled, it will try to check the length before we store it. :-P */
11462 }
11464 /* Helper function for build_call_* functions; build a CALL_EXPR with
11465 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11466 the argument slots. */
11468 static tree
11470 {
11471 tree t;
11479 }
11481 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11482 FN and a null static chain slot. NARGS is the number of call arguments
11483 which are specified as "..." arguments. */
11485 tree
11487 {
11488 tree ret;
11494 }
11496 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11497 FN and a null static chain slot. NARGS is the number of call arguments
11498 which are specified as a va_list ARGS. */
11500 tree
11502 {
11503 tree t;
11511 }
11513 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11514 FN and a null static chain slot. NARGS is the number of call arguments
11515 which are specified as a tree array ARGS. */
11517 tree
11520 {
11521 tree t;
11530 }
11532 /* Like build_call_array, but takes a vec. */
11534 tree
11536 {
11545 }
11547 /* Conveniently construct a function call expression. FNDECL names the
11548 function to be called and N arguments are passed in the array
11549 ARGARRAY. */
11551 tree
11553 {
11558 }
11560 /* Conveniently construct a function call expression. FNDECL names the
11561 function to be called and the arguments are passed in the vector
11562 VEC. */
11564 tree
11566 {
11569 }
11572 /* Conveniently construct a function call expression. FNDECL names the
11573 function to be called, N is the number of arguments, and the "..."
11574 parameters are the argument expressions. */
11576 tree
11578 {
11588 }
11590 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11591 varargs macros aren't supported by all bootstrap compilers. */
11593 tree
11595 {
11605 }
11607 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11608 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11609 It will get gimplified later into an ordinary internal function. */
11611 tree
11614 {
11622 }
11624 /* Build internal call expression. This is just like CALL_EXPR, except
11625 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11626 internal function. */
11628 tree
11631 {
11641 }
11643 /* Return a function call to FN, if the target is guaranteed to support it,
11644 or null otherwise.
11646 N is the number of arguments, passed in the "...", and TYPE is the
11647 type of the return value. */
11649 tree
11652 {
11662 {
11665 {
11668 OPTIMIZE_FOR_BOTH))
11670 }
11672 }
11673 else
11674 {
11679 }
11680 }
11682 /* Return a function call to the appropriate builtin alloca variant.
11684 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11685 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11686 bound for SIZE in case it is not a fixed value. */
11688 tree
11690 {
11692 {
11694 return
11696 }
11698 {
11701 }
11702 else
11703 {
11706 }
11707 }
11709 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11710 if SIZE == -1) and return a tree node representing char* pointer to
11711 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11712 the STRING_CST value is the LEN bytes at STR (the representation
11713 of the string, which may be wide). Otherwise it's all zeros. */
11715 tree
11719 {
11721 /* Set the maximum valid index based on the string length or SIZE. */
11722 unsigned HOST_WIDE_INT maxidx
11738 }
11742 /* Return true if T (assumed to be a DECL) must be assigned a memory
11743 location. */
11745 bool
11747 {
11753 }
11755 /* Return value of a constant X and sign-extend it. */
11757 HOST_WIDE_INT
11759 {
11763 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11767 {
11771 else
11773 }
11776 }
11778 /* If TYPE is an integral or pointer type, return an integer type with
11779 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11780 if TYPE is already an integer type of signedness UNSIGNEDP.
11781 If TYPE is a floating-point type, return an integer type with the same
11782 bitsize and with the signedness given by UNSIGNEDP; this is useful
11783 when doing bit-level operations on a floating-point value. */
11785 tree
11787 {
11792 {
11800 }
11803 {
11811 }
11820 else
11824 }
11826 /* If TYPE is an integral or pointer type, return an integer type with
11827 the same precision which is unsigned, or itself if TYPE is already an
11828 unsigned integer type. If TYPE is a floating-point type, return an
11829 unsigned integer type with the same bitsize as TYPE. */
11831 tree
11833 {
11835 }
11837 /* If TYPE is an integral or pointer type, return an integer type with
11838 the same precision which is signed, or itself if TYPE is already a
11839 signed integer type. If TYPE is a floating-point type, return a
11840 signed integer type with the same bitsize as TYPE. */
11842 tree
11844 {
11846 }
11848 /* If TYPE is a vector type, return a signed integer vector type with the
11849 same width and number of subparts. Otherwise return boolean_type_node. */
11851 tree
11853 {
11855 {
11859 }
11860 else
11862 }
11864 /* Returns the largest value obtainable by casting something in INNER type to
11865 OUTER type. */
11867 tree
11869 {
11875 /* Compute a unique number for every combination. */
11880 /* Determine the exponent to use. */
11882 {
11885 /* oprec <= iprec, outer: signed, inner: don't care. */
11890 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11894 /* oprec > iprec, outer: signed, inner: signed. */
11898 /* oprec > iprec, outer: signed, inner: unsigned. */
11902 /* oprec > iprec, outer: unsigned, inner: signed. */
11906 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11911 }
11915 }
11917 /* Returns the smallest value obtainable by casting something in INNER type to
11918 OUTER type. */
11920 tree
11922 {
11926 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11927 and obtain 0. */
11929 /* If we are widening something of an unsigned type, OUTER type
11930 contains all values of INNER type. In particular, both INNER
11931 and OUTER types have zero in common. */
11934 else
11935 {
11936 /* If we are widening a signed type to another signed type, we
11937 want to obtain -2^^(iprec-1). If we are keeping the
11938 precision or narrowing to a signed type, we want to obtain
11939 -2^(oprec-1). */
11944 }
11945 }
11947 /* Return nonzero if two operands that are suitable for PHI nodes are
11948 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11949 SSA_NAME or invariant. Note that this is strictly an optimization.
11950 That is, callers of this function can directly call operand_equal_p
11951 and get the same result, only slower. */
11953 int
11955 {
11961 }
11963 /* Returns number of zeros at the end of binary representation of X. */
11965 tree
11967 {
11969 }
11972 #define WALK_SUBTREE(NODE) \
11973 do \
11974 { \
11975 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11976 if (result) \
11977 return result; \
11978 } \
11979 while (0)
11981 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11982 be walked whenever a type is seen in the tree. Rest of operands and return
11983 value are as for walk_tree. */
11985 static tree
11988 {
11992 {
11996 /* We have to worry about mutually recursive pointers. These can't
11997 be written in C. They can in Ada. It's pathological, but
11998 there's an ACATS test (c38102a) that checks it. Deal with this
11999 by checking if we're pointing to another pointer, that one
12000 points to another pointer, that one does too, and we have no htab.
12001 If so, get a hash table. We check three levels deep to avoid
12002 the cost of the hash table if we don't need one. */
12007 {
12014 }
12016 /* fall through */
12025 /* Fall through. */
12029 {
12030 tree arg;
12032 /* We never want to walk into default arguments. */
12035 }
12039 /* Don't follow this nodes's type if a pointer for fear that
12040 we'll have infinite recursion. If we have a PSET, then we
12041 need not fear. */
12056 }
12059 }
12061 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12062 called with the DATA and the address of each sub-tree. If FUNC returns a
12063 non-NULL value, the traversal is stopped, and the value returned by FUNC
12064 is returned. If PSET is non-NULL it is used to record the nodes visited,
12065 and to avoid visiting a node more than once. */
12067 tree
12070 {
12073 tree result;
12075 #define WALK_SUBTREE_TAIL(NODE) \
12076 do \
12077 { \
12078 tp = & (NODE); \
12079 goto tail_recurse; \
12080 } \
12081 while (0)
12083 tail_recurse:
12084 /* Skip empty subtrees. */
12088 /* Don't walk the same tree twice, if the user has requested
12089 that we avoid doing so. */
12093 /* Call the function. */
12097 /* If we found something, return it. */
12103 /* Even if we didn't, FUNC may have decided that there was nothing
12104 interesting below this point in the tree. */
12106 {
12107 /* But we still need to check our siblings. */
12112 else
12114 }
12117 {
12121 }
12124 {
12137 /* None of these have subtrees other than those already walked
12138 above. */
12147 {
12153 /* Walk all elements but the first. */
12157 /* Now walk the first one as a tail call. */
12159 }
12166 {
12171 idx++)
12173 }
12180 {
12181 tree decl;
12183 {
12184 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12185 into declarations that are just mentioned, rather than
12186 declared; they don't really belong to this part of the tree.
12187 And, we can see cycles: the initializer for a declaration
12188 can refer to the declaration itself. */
12192 }
12194 }
12197 {
12198 tree_stmt_iterator i;
12201 }
12206 {
12209 /* FALLTHRU */
12254 /* FALLTHRU */
12289 {
12294 }
12315 {
12320 }
12324 }
12328 {
12331 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12332 But, we only want to walk once. */
12337 }
12340 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12341 defining. We only want to walk into these fields of a type in this
12342 case and not in the general case of a mere reference to the type.
12344 The criterion is as follows: if the field can be an expression, it
12345 must be walked only here. This should be in keeping with the fields
12346 that are directly gimplified in gimplify_type_sizes in order for the
12347 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12348 variable-sized types.
12350 Note that DECLs get walked as part of processing the BIND_EXPR. */
12352 {
12353 /* Call the function for the decl so e.g. copy_tree_body_r can
12354 replace it with the remapped one. */
12363 /* Call the function for the type. See if it returns anything or
12364 doesn't want us to continue. If we are to continue, walk both
12365 the normal fields and those for the declaration case. */
12370 /* But do not walk a pointed-to type since it may itself need to
12371 be walked in the declaration case if it isn't anonymous. */
12373 {
12377 }
12379 /* If this is a record type, also walk the fields. */
12381 {
12382 tree field;
12386 {
12387 /* We'd like to look at the type of the field, but we can
12388 easily get infinite recursion. So assume it's pointed
12389 to elsewhere in the tree. Also, ignore things that
12390 aren't fields. */
12399 }
12400 }
12402 /* Same for scalar types. */
12408 {
12411 }
12415 }
12416 /* FALLTHRU */
12420 {
12423 /* Walk over all the sub-trees of this operand. */
12426 /* Go through the subtrees. We need to do this in forward order so
12427 that the scope of a FOR_EXPR is handled properly. */
12429 {
12433 }
12434 }
12435 /* If this is a type, walk the needed fields in the type. */
12439 }
12441 /* We didn't find what we were looking for. */
12444 #undef WALK_SUBTREE_TAIL
12445 }
12446 #undef WALK_SUBTREE
12448 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12450 tree
12452 walk_tree_lh lh)
12453 {
12454 tree result;
12459 }
12462 tree
12464 {
12471 }
12473 void
12475 {
12479 {
12481 }
12482 else
12484 }
12486 /* Create a nameless artificial label and put it in the current
12487 function context. The label has a location of LOC. Returns the
12488 newly created label. */
12490 tree
12492 {
12500 }
12502 /* Given a tree, try to return a useful variable name that we can use
12503 to prefix a temporary that is being assigned the value of the tree.
12504 I.E. given <temp> = &A, return A. */
12508 {
12509 tree stripped_decl;
12516 {
12521 }
12522 else
12523 {
12525 {
12530 }
12531 }
12532 }
12534 /* Return true if TYPE has a variable argument list. */
12536 bool
12538 {
12539 function_args_iterator args_iter;
12546 {
12548 }
12551 }
12553 /* Return true if TYPE has a prototype. */
12555 bool
12557 {
12558 tree t;
12564 }
12566 /* If BLOCK is inlined from an __attribute__((__artificial__))
12567 routine, return pointer to location from where it has been
12568 called. */
12569 location_t *
12571 {
12576 {
12579 {
12580 /* If AO is an artificial inline, point RET to the
12581 call site locus at which it has been inlined and continue
12582 the loop, in case AO's caller is also an artificial
12583 inline. */
12587 else
12589 }
12594 }
12596 }
12599 /* If EXP is inlined from an __attribute__((__artificial__))
12600 function, return the location of the original call expression. */
12602 location_t
12604 {
12609 else
12611 }
12614 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12615 nodes. */
12617 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12619 hashval_t
12621 {
12629 {
12632 }
12637 else
12640 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12641 something else. */
12647 }
12649 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12650 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12651 same. */
12653 bool
12655 {
12668 else
12670 }
12672 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
12674 tree
12677 {
12678 tree t;
12680 /* Use the cache of optimization nodes. */
12688 {
12689 /* Insert this one into the hash table. */
12693 /* Make a new node for next time round. */
12695 }
12698 }
12700 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
12702 tree
12705 {
12706 tree t;
12708 /* Use the cache of optimization nodes. */
12716 {
12717 /* Insert this one into the hash table. */
12721 /* Make a new node for next time round. */
12723 }
12726 }
12728 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12729 so that they aren't saved during PCH writing. */
12731 void
12733 {
12738 }
12740 /* Determine the "ultimate origin" of a block. */
12742 tree
12744 {
12749 else
12750 {
12755 }
12756 }
12758 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12759 no instruction. */
12761 bool
12763 {
12764 /* Do not strip casts into or out of differing address spaces. */
12767 {
12772 }
12775 {
12776 /* We already know that outer_type is not a pointer with
12777 a non-generic address space. */
12779 }
12781 /* Use precision rather then machine mode when we can, which gives
12782 the correct answer even for submode (bit-field) types. */
12791 /* Otherwise fall back on comparing machine modes (e.g. for
12792 aggregate types, floats). */
12794 }
12796 /* Return true iff conversion in EXP generates no instruction. Mark
12797 it inline so that we fully inline into the stripping functions even
12798 though we have two uses of this function. */
12802 {
12817 }
12819 /* Return true iff conversion in EXP generates no instruction. Don't
12820 consider conversions changing the signedness. */
12822 static bool
12824 {
12835 }
12837 /* Strip conversions from EXP according to tree_nop_conversion and
12838 return the resulting expression. */
12840 tree
12842 {
12846 }
12848 /* Strip conversions from EXP according to tree_sign_nop_conversion
12849 and return the resulting expression. */
12851 tree
12853 {
12857 }
12859 /* Avoid any floating point extensions from EXP. */
12860 tree
12862 {
12865 /* For floating point constant look up the narrowest type that can hold
12866 it properly and handle it like (type)(narrowest_type)constant.
12867 This way we can optimize for instance a=a*2.0 where "a" is float
12868 but 2.0 is double constant. */
12870 {
12871 REAL_VALUE_TYPE orig;
12884 }
12903 }
12905 /* Strip out all handled components that produce invariant
12906 offsets. */
12908 const_tree
12910 {
12912 {
12914 {
12929 }
12931 }
12934 }
12938 /* Return the GCC personality function decl. */
12940 tree
12942 {
12946 }
12948 /* TARGET is a call target of GIMPLE call statement
12949 (obtained by gimple_call_fn). Return true if it is
12950 OBJ_TYPE_REF representing an virtual call of C++ method.
12951 (As opposed to OBJ_TYPE_REF representing objc calls
12952 through a cast where middle-end devirtualization machinery
12953 can't apply.) FOR_DUMP_P is true when being called from
12954 the dump routines. */
12956 bool
12958 {
12967 /* If we do not have BINFO associated, it means that type was built
12968 without devirtualization enabled. Do not consider this a virtual
12969 call. */
12973 }
12975 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12977 static tree
12979 {
12990 }
12992 /* Try to find a base info of BINFO that would have its field decl at offset
12993 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12994 found, return, otherwise return NULL_TREE. */
12996 tree
12998 {
13002 {
13004 tree fld;
13013 {
13021 }
13025 /* Offset 0 indicates the primary base, whose vtable contents are
13026 represented in the binfo for the derived class. */
13028 {
13030 /* Offsets in BINFO are in bytes relative to the whole structure
13031 while POS is in bits relative to the containing field. */
13038 {
13041 }
13044 else
13046 binfo_offset);
13047 }
13051 }
13052 }
13054 /* Returns true if X is a typedef decl. */
13056 bool
13058 {
13061 }
13063 /* Returns true iff TYPE is a type variant created for a typedef. */
13065 bool
13067 {
13069 }
13071 /* PR 84195: Replace control characters in "unescaped" with their
13072 escaped equivalents. Allow newlines if -fmessage-length has
13073 been set to a non-zero value. This is done here, rather than
13074 where the attribute is recorded as the message length can
13075 change between these two locations. */
13077 void
13079 {
13097 {
13101 {
13105 }
13108 {
13110 {
13111 /* We only allocate space for a new string if we
13112 actually encounter a control character that
13113 needs replacing. */
13117 }
13122 {
13131 }
13132 }
13135 }
13138 {
13142 }
13143 }
13145 /* Warn about a use of an identifier which was marked deprecated. Returns
13146 whether a warning was given. */
13148 bool
13150 {
13151 escaped_string msg;
13157 {
13161 {
13166 }
13167 }
13177 {
13178 auto_diagnostic_group d;
13182 else
13187 }
13189 {
13194 {
13200 }
13202 auto_diagnostic_group d;
13204 {
13208 else
13211 }
13212 else
13213 {
13217 else
13220 }
13224 }
13227 }
13229 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13230 somewhere in it. */
13232 bool
13234 {
13236 {
13241 }
13244 }
13246 /* Try to determine whether a TRY_CATCH expression can fall through.
13247 This is a subroutine of block_may_fallthru. */
13249 static bool
13251 {
13252 tree_stmt_iterator i;
13254 /* If the TRY block can fall through, the whole TRY_CATCH can
13255 fall through. */
13261 {
13263 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13264 catch expression and a body. The whole TRY_CATCH may fall
13265 through iff any of the catch bodies falls through. */
13267 {
13270 }
13274 /* The exception filter expression only matters if there is an
13275 exception. If the exception does not match EH_FILTER_TYPES,
13276 we will execute EH_FILTER_FAILURE, and we will fall through
13277 if that falls through. If the exception does match
13278 EH_FILTER_TYPES, the stack unwinder will continue up the
13279 stack, so we will not fall through. We don't know whether we
13280 will throw an exception which matches EH_FILTER_TYPES or not,
13281 so we just ignore EH_FILTER_TYPES and assume that we might
13282 throw an exception which doesn't match. */
13286 /* This case represents statements to be executed when an
13287 exception occurs. Those statements are implicitly followed
13288 by a RESX statement to resume execution after the exception.
13289 So in this case the TRY_CATCH never falls through. */
13291 }
13292 }
13294 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13295 need not be 100% accurate; simply be conservative and return true if we
13296 don't know. This is used only to avoid stupidly generating extra code.
13297 If we're wrong, we'll just delete the extra code later. */
13299 bool
13301 {
13302 /* This CONST_CAST is okay because expr_last returns its argument
13303 unmodified and we assign it to a const_tree. */
13307 {
13310 /* Easy cases. If the last statement of the block implies
13311 control transfer, then we can't fall through. */
13315 /* If there is a default: label or case labels cover all possible
13316 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13317 to some case label in all cases and all we care is whether the
13318 SWITCH_BODY falls through. */
13335 /* The finally clause is always executed after the try clause,
13336 so if it does not fall through, then the try-finally will not
13337 fall through. Otherwise, if the try clause does not fall
13338 through, then when the finally clause falls through it will
13339 resume execution wherever the try clause was going. So the
13340 whole try-finally will only fall through if both the try
13341 clause and the finally clause fall through. */
13351 else
13353 /* FALLTHRU */
13356 /* Functions that do not return do not fall through. */
13370 }
13371 }
13373 /* True if we are using EH to handle cleanups. */
13376 /* This routine is called from front ends to indicate eh should be used for
13377 cleanups. */
13378 void
13380 {
13382 }
13384 /* Query whether EH is used for cleanups. */
13385 bool
13387 {
13389 }
13391 /* Wrapper for tree_code_name to ensure that tree code is valid */
13394 {
13397 /* The tree_code enum promotes to signed, but we could be getting
13398 invalid values, so force an unsigned comparison. */
13400 {
13404 }
13407 }
13409 /* Drops the TREE_OVERFLOW flag from T. */
13411 tree
13413 {
13416 /* For tree codes with a sharing machinery re-build the result. */
13420 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13421 and canonicalize the result. */
13423 {
13424 tree_vector_builder builder;
13428 {
13433 }
13435 }
13437 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13438 and drop the flag. */
13442 /* For constants that contain nested constants, drop the flag
13443 from those as well. */
13445 {
13450 }
13453 }
13455 /* Given a memory reference expression T, return its base address.
13456 The base address of a memory reference expression is the main
13457 object being referenced. For instance, the base address for
13458 'array[i].fld[j]' is 'array'. You can think of this as stripping
13459 away the offset part from a memory address.
13461 This function calls handled_component_p to strip away all the inner
13462 parts of the memory reference until it reaches the base object. */
13464 tree
13466 {
13475 /* ??? Either the alias oracle or all callers need to properly deal
13476 with WITH_SIZE_EXPRs before we can look through those. */
13481 }
13483 /* Return a tree of sizetype representing the size, in bytes, of the element
13484 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13486 tree
13488 {
13493 /* If a size was specified in the ARRAY_REF, it's the size measured
13494 in alignment units of the element type. So multiply by that value. */
13496 {
13497 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13498 sizetype from another type of the same width and signedness. */
13503 }
13505 /* Otherwise, take the size from that of the element type. Substitute
13506 any PLACEHOLDER_EXPR that we have. */
13507 else
13509 }
13511 /* Return a tree representing the lower bound of the array mentioned in
13512 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13514 tree
13516 {
13519 /* If a lower bound is specified in EXP, use it. */
13523 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13524 substituting for a PLACEHOLDER_EXPR as needed. */
13528 /* Otherwise, return a zero of the appropriate type. */
13532 }
13534 /* Return a tree representing the upper bound of the array mentioned in
13535 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13537 tree
13539 {
13542 /* If there is a domain type and it has an upper bound, use it, substituting
13543 for a PLACEHOLDER_EXPR as needed. */
13547 /* Otherwise fail. */
13549 }
13551 /* Returns true if REF is an array reference, component reference,
13552 or memory reference to an array at the end of a structure.
13553 If this is the case, the array may be allocated larger
13554 than its upper bound implies. */
13556 bool
13558 {
13559 tree atype;
13563 {
13566 }
13571 {
13577 {
13579 {
13585 }
13586 else
13588 }
13589 else
13591 }
13592 else
13600 {
13601 /* If the reference chain contains a component reference to a
13602 non-union type and there follows another field the reference
13603 is not at the end of a structure. */
13605 {
13607 {
13613 }
13614 }
13615 /* If we have a multi-dimensional array we do not consider
13616 a non-innermost dimension as flex array if the whole
13617 multi-dimensional array is at struct end.
13618 Same for an array of aggregates with a trailing array
13619 member. */
13623 ;
13624 /* If we view an underlying object as sth else then what we
13625 gathered up to now is what we have to rely on. */
13628 else
13632 }
13634 /* The array now is at struct end. Treat flexible arrays as
13635 always subject to extend, even into just padding constrained by
13636 an underlying decl. */
13646 /* If the reference is based on a declared entity, the size of the array
13647 is constrained by its given domain. (Do not trust commons PR/69368). */
13649 && !(flag_unconstrained_commons
13653 {
13654 /* Check whether the array domain covers all of the available
13655 padding. */
13656 poly_int64 offset;
13664 /* If at least one extra element fits it is a flexarray. */
13673 }
13676 }
13678 /* Return a tree representing the offset, in bytes, of the field referenced
13679 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13681 tree
13683 {
13688 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13689 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13690 value. */
13692 {
13693 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13694 sizetype from another type of the same width and signedness. */
13700 }
13702 /* Otherwise, take the offset from that of the field. Substitute
13703 any PLACEHOLDER_EXPR that we have. */
13704 else
13706 }
13708 /* Given the initializer INIT, return the initializer for the field
13709 DECL if it exists, otherwise null. Used to obtain the initializer
13710 for a flexible array member and determine its size. */
13712 static tree
13714 {
13720 {
13725 {
13729 }
13730 }
13733 }
13735 /* Determines the size of the member referenced by the COMPONENT_REF
13736 REF, using its initializer expression if necessary in order to
13737 determine the size of an initialized flexible array member.
13738 If non-null, set *ARK when REF refers to an interior zero-length
13739 array or a trailing one-element array.
13740 Returns the size as sizetype (which might be zero for an object
13741 with an uninitialized flexible array member) or null if the size
13742 cannot be determined. */
13744 tree
13746 {
13749 special_array_member sambuf;
13754 /* The object/argument referenced by the COMPONENT_REF and its type. */
13757 /* The referenced member. */
13762 {
13765 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13766 to the type of a class with a virtual base which doesn't
13767 reflect the size of the virtual's members (see pr97595).
13768 If that's the case fail for now and implement something
13769 more robust in the future. */
13776 /* MEMBER is either an interior array or is an array with
13777 more than one element. */
13781 {
13784 else
13785 {
13788 }
13789 }
13797 {
13802 /* MEMBER is an array with more than one element. */
13807 }
13809 /* For a refernce to a zero- or one-element array member of a union
13810 use the size of the union instead of the size of the member. */
13813 }
13815 /* MEMBER is either a bona fide flexible array member, or a zero-length
13816 array member, or an array of length one treated as such. */
13818 /* If the reference is to a declared object and the member a true
13819 flexible array, try to determine its size from its initializer. */
13823 {
13834 }
13836 /* BASE is the declared object of which MEMBER is either a member
13837 or that is cast to ARGTYPE (e.g., a char buffer used to store
13838 an ARGTYPE object). */
13841 /* Determine the base type of the referenced object. If it's
13842 the same as ARGTYPE and MEMBER has a known size, return it. */
13854 /* MEMBER is a true flexible array member. Compute its size from
13855 the initializer of the BASE object if it has one. */
13858 {
13861 {
13864 {
13865 /* Use the larger of the initializer size and the tail
13866 padding in the enclosing struct. */
13871 }
13874 }
13875 }
13878 {
13880 {
13885 /* The size of a flexible array member of an extern struct
13886 with no initializer cannot be determined (it's defined
13887 in another translation unit and can have an initializer
13888 with an arbitrary number of elements). */
13891 /* Use the size of the base struct or, for interior zero-length
13892 arrays, the size of the enclosing type. */
13894 }
13896 /* Use the size of the BASE object (possibly an array of some
13897 other type such as char used to store the struct). */
13899 else
13901 }
13903 /* If the flexible array member has a known size use the greater
13904 of it and the tail padding in the enclosing struct.
13905 Otherwise, when the size of the flexible array member is unknown
13906 and the referenced object is not a struct, use the size of its
13907 type when known. This detects sizes of array buffers when cast
13908 to struct types with flexible array members. */
13910 {
13913 {
13916 }
13918 }
13920 /* Return "don't know" for an external non-array object since its
13921 flexible array member can be initialized to have any number of
13922 elements. Otherwise, return zero because the flexible array
13923 member has no elements. */
13926 && (!typematch
13929 }
13931 /* Return the machine mode of T. For vectors, returns the mode of the
13932 inner type. The main use case is to feed the result to HONOR_NANS,
13933 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13935 machine_mode
13937 {
13943 }
13945 /* Vector types need to re-check the target flags each time we report
13946 the machine mode. We need to do this because attribute target can
13947 change the result of vector_mode_supported_p and have_regs_of_mode
13948 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13949 change on a per-function basis. */
13950 /* ??? Possibly a better solution is to run through all the types
13951 referenced by a function and re-compute the TYPE_MODE once, rather
13952 than make the TYPE_MODE macro call a function. */
13954 machine_mode
13956 {
13957 machine_mode mode;
13965 {
13966 scalar_int_mode innermode;
13968 /* For integers, try mapping it to a same-sized scalar mode. */
13970 {
13973 scalar_int_mode mode;
13977 }
13980 }
13983 }
13985 /* Return the size in bits of each element of vector type TYPE. */
13987 unsigned int
13989 {
13995 }
13997 /* Calculate the size in bits of each element of vector type TYPE
13998 and return the result as a tree of type bitsizetype. */
14000 tree
14002 {
14007 }
14009 /* Verify that basic properties of T match TV and thus T can be a variant of
14010 TV. TV should be the more specified variant (i.e. the main variant). */
14012 static bool
14014 {
14015 /* Type variant can differ by:
14017 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
14018 ENCODE_QUAL_ADDR_SPACE.
14019 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
14020 in this case some values may not be set in the variant types
14021 (see TYPE_COMPLETE_P checks).
14022 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
14023 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
14024 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
14025 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
14026 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
14027 this is necessary to make it possible to merge types form different TUs
14028 - arrays, pointers and references may have TREE_TYPE that is a variant
14029 of TREE_TYPE of their main variants.
14030 - aggregates may have new TYPE_FIELDS list that list variants of
14031 the main variant TYPE_FIELDS.
14032 - vector types may differ by TYPE_VECTOR_OPAQUE
14033 */
14035 /* Convenience macro for matching individual fields. */
14036 #define verify_variant_match(flag) \
14037 do { \
14038 if (flag (tv) != flag (t)) \
14039 { \
14041 debug_tree (tv); \
14042 return false; \
14043 } \
14044 } while (false)
14046 /* tree_base checks. */
14049 /* FIXME: Ada builds non-artificial variants of artificial types. */
14054 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
14061 else
14063 /* FIXME: This check trigger during libstdc++ build. */
14067 /* tree_type_common checks. */
14070 {
14078 {
14088 }
14090 }
14096 /* During LTO we merge variant lists from diferent translation units
14097 that may differ BY TYPE_CONTEXT that in turn may point
14098 to TRANSLATION_UNIT_DECL.
14099 Ada also builds variants of types with different TYPE_CONTEXT. */
14107 {
14111 }
14113 /* tree_type_non_common checks. */
14115 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14116 and dangle the pointer from time to time. */
14120 {
14124 }
14130 {
14133 }
14140 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14141 or even type's main variant. This is needed to make bootstrap pass
14142 and the bug seems new in GCC 5.
14143 C++ FE should be updated to make this consistent and we should check
14144 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14145 is a match with main variant.
14147 Also disable the check for Java for now because of parser hack that builds
14148 first an dummy BINFO and then sometimes replace it by real BINFO in some
14149 of the copies. */
14152 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14153 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14154 at LTO time only. */
14156 {
14164 }
14166 /* Check various uses of TYPE_VALUES_RAW. */
14172 /* Permit incomplete variants of complete type. While FEs may complete
14173 all variants, this does not happen for C++ templates in all cases. */
14177 {
14180 /* Fortran builds qualified variants as new records with items of
14181 qualified type. Verify that they looks same. */
14188 /* FIXME: gfc_nonrestricted_type builds all types as variants
14189 with exception of pointer types. It deeply copies the type
14190 which means that we may end up with a variant type
14191 referring non-variant pointer. We may change it to
14192 produce types as variants, too, like
14193 objc_get_protocol_qualified_type does. */
14199 {
14207 }
14208 }
14211 /* For C++ the qualified variant of array type is really an array type
14212 of qualified TREE_TYPE.
14213 objc builds variants of pointer where pointer to type is a variant, too
14214 in objc_get_protocol_qualified_type. */
14220 {
14228 }
14231 {
14239 }
14241 #undef verify_variant_match
14242 }
14245 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14246 the middle-end types_compatible_p function. It needs to avoid
14247 claiming types are different for types that should be treated
14248 the same with respect to TBAA. Canonical types are also used
14249 for IL consistency checks via the useless_type_conversion_p
14250 predicate which does not handle all type kinds itself but falls
14251 back to pointer-comparison of TYPE_CANONICAL for aggregates
14252 for example. */
14254 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14255 type calculation because we need to allow inter-operability between signed
14256 and unsigned variants. */
14258 bool
14260 {
14261 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14262 signed char and unsigned char. Similarly fortran FE builds
14263 C_SIZE_T as signed type, while C defines it unsigned. */
14266 == INTEGER_TYPE
14269 }
14271 /* Return true iff T1 and T2 are structurally identical for what
14272 TBAA is concerned.
14273 This function is used both by lto.c canonical type merging and by the
14274 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14275 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14276 only for LTO because only in these cases TYPE_CANONICAL equivalence
14277 correspond to one defined by gimple_canonical_types_compatible_p. */
14279 bool
14282 {
14283 /* Type variants should be same as the main variant. When not doing sanity
14284 checking to verify this fact, go to main variants and save some work. */
14286 {
14289 }
14291 /* Check first for the obvious case of pointer identity. */
14295 /* Check that we have two types to compare. */
14299 /* We consider complete types always compatible with incomplete type.
14300 This does not make sense for canonical type calculation and thus we
14301 need to ensure that we are never called on it.
14303 FIXME: For more correctness the function probably should have three modes
14304 1) mode assuming that types are complete mathcing their structure
14305 2) mode allowing incomplete types but producing equivalence classes
14306 and thus ignoring all info from complete types
14307 3) mode allowing incomplete types to match complete but checking
14308 compatibility between complete types.
14310 1 and 2 can be used for canonical type calculation. 3 is the real
14311 definition of type compatibility that can be used i.e. for warnings during
14312 declaration merging. */
14317 /* If the types have been previously registered and found equal
14318 they still are. */
14322 {
14323 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14324 they are always NULL, but they are set to non-NULL for types
14325 constructed by build_pointer_type and variants. In this case the
14326 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14327 all pointers are considered equal. Be sure to not return false
14328 negatives. */
14332 }
14334 /* For types where we do ODR based TBAA the canonical type is always
14335 set correctly, so we know that types are different if their
14336 canonical types does not match. */
14342 /* Can't be the same type if the types don't have the same code. */
14347 /* Qualifiers do not matter for canonical type comparison purposes. */
14349 /* Void types and nullptr types are always the same. */
14354 /* Can't be the same type if they have different mode. */
14358 /* Non-aggregate types can be handled cheaply. */
14366 {
14367 /* Can't be the same type if they have different recision. */
14371 /* In some cases the signed and unsigned types are required to be
14372 inter-operable. */
14377 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14378 interoperable with "signed char". Unless all frontends are revisited
14379 to agree on these types, we must ignore the flag completely. */
14381 /* Fortran standard define C_PTR type that is compatible with every
14382 C pointer. For this reason we need to glob all pointers into one.
14383 Still pointers in different address spaces are not compatible. */
14385 {
14389 }
14391 /* Tail-recurse to components. */
14396 trust_type_canonical);
14399 }
14401 /* Do type-specific comparisons. */
14403 {
14405 /* Array types are the same if the element types are the same and
14406 the number of elements are the same. */
14408 trust_type_canonical)
14413 else
14414 {
14418 /* For an incomplete external array, the type domain can be
14419 NULL_TREE. Check this condition also. */
14424 else
14425 {
14431 /* The minimum/maximum values have to be the same. */
14443 else
14445 }
14446 }
14450 /* Function types are the same if the return type and arguments types
14451 are the same. */
14453 trust_type_canonical))
14458 else
14459 {
14465 {
14468 trust_type_canonical))
14470 }
14476 }
14481 {
14484 /* Don't try to compare variants of an incomplete type, before
14485 TYPE_FIELDS has been copied around. */
14493 /* For aggregate types, all the fields must be the same. */
14497 {
14498 /* Skip non-fields and zero-sized fields. */
14509 /* The fields must have the same name, offset and type. */
14512 || !gimple_canonical_types_compatible_p
14514 trust_type_canonical))
14516 }
14518 /* If one aggregate has more fields than the other, they
14519 are not the same. */
14524 }
14527 /* Consider all types with language specific trees in them mutually
14528 compatible. This is executed only from verify_type and false
14529 positives can be tolerated. */
14532 }
14533 }
14535 /* Verify type T. */
14537 void
14539 {
14543 {
14546 }
14548 {
14552 }
14558 ;
14560 {
14564 }
14565 /* Method and function types cannot be used to address memory and thus
14566 TYPE_CANONICAL really matters only for determining useless conversions.
14568 FIXME: C++ FE produce declarations of builtin functions that are not
14569 compatible with main variants. */
14571 ;
14573 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14574 with variably sized arrays because their sizes possibly
14575 gimplified to different variables. */
14579 {
14583 }
14587 {
14591 }
14593 {
14598 }
14601 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14603 {
14604 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14605 and danagle the pointer from time to time. */
14609 {
14613 }
14614 }
14616 {
14619 {
14623 }
14624 }
14626 {
14629 {
14633 }
14634 }
14637 {
14638 /* FIXME: The following check should pass:
14639 useless_type_conversion_p (const_cast <tree> (t),
14640 TREE_TYPE (TYPE_MIN_VALUE (t))
14641 but does not for C sizetypes in LTO. */
14642 }
14644 /* Check various uses of TYPE_MAXVAL_RAW. */
14646 {
14648 ;
14650 {
14654 }
14656 {
14660 }
14661 }
14663 {
14667 {
14671 }
14672 }
14674 {
14678 {
14682 }
14683 }
14686 {
14687 /* FIXME: The following check should pass:
14688 useless_type_conversion_p (const_cast <tree> (t),
14689 TREE_TYPE (TYPE_MAX_VALUE (t))
14690 but does not for C sizetypes in LTO. */
14691 }
14693 {
14696 {
14700 }
14701 }
14703 {
14707 }
14710 {
14714 }
14716 /* Check various uses of TYPE_VALUES_RAW. */
14719 {
14723 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14724 CONST_DECL of ENUMERAL TYPE. */
14726 {
14731 }
14734 {
14740 }
14742 {
14747 }
14748 }
14750 {
14752 {
14756 }
14757 }
14759 {
14761 {
14764 }
14766 {
14767 /* TODO: verify properties of decls. */
14769 ;
14771 ;
14773 ;
14775 ;
14777 ;
14779 ;
14781 ;
14782 else
14783 {
14787 }
14788 }
14789 }
14796 {
14798 {
14803 }
14805 {
14809 }
14810 /* Verify just enough of cache to ensure that no one copied it to new type.
14811 All copying should go by copy_node that should clear it. */
14813 {
14818 {
14823 }
14824 }
14825 }
14828 {
14829 /* C++ FE uses TREE_PURPOSE to store initial values. */
14831 {
14835 }
14837 {
14841 }
14842 }
14844 {
14848 }
14856 {
14859 }
14861 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14862 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14863 of a type. */
14866 {
14869 }
14872 {
14875 }
14876 }
14879 /* Return 1 if ARG interpreted as signed in its precision is known to be
14880 always positive or 2 if ARG is known to be always negative, or 3 if
14881 ARG may be positive or negative. */
14883 int
14885 {
14892 {
14896 else
14898 }
14902 {
14904 /* Narrower value zero extended into wider type
14905 will always result in positive values. */
14912 }
14918 {
14922 {
14926 {
14935 }
14936 }
14938 }
14940 {
14941 /* For unsigned values, the "positive" range comes
14942 below the "negative" range. */
14947 }
14948 else
14949 {
14954 }
14956 }
14961 /* Return true if ARG is marked with the nonnull attribute in the
14962 current function signature. */
14964 bool
14966 {
14974 /* The static chain decl is always non null. */
14978 /* THIS argument of method is always non-NULL. */
14984 /* Values passed by reference are always non-NULL. */
14991 {
14994 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14998 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
15002 /* Get the position number for ARG in the function signature. */
15004 t;
15006 {
15009 }
15013 /* Now see if ARG_NUM is mentioned in the nonnull list. */
15015 {
15018 }
15019 }
15022 }
15024 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
15025 information. */
15027 location_t
15029 {
15033 }
15035 location_t
15037 {
15038 source_range src_range;
15042 }
15044 location_t
15046 {
15052 pure_loc,
15053 src_range,
15054 NULL);
15057 }
15059 /* Return EXPR, potentially wrapped with a node expression LOC,
15060 if !CAN_HAVE_LOCATION_P (expr).
15062 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
15063 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
15065 Wrapper nodes can be identified using location_wrapper_p. */
15067 tree
15069 {
15076 /* We should only be adding wrappers for constants and for decls,
15077 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
15082 /* For now, don't add wrappers to exceptional tree nodes, to minimize
15083 any impact of the wrapper nodes. */
15087 /* Compiler-generated temporary variables don't need a wrapper. */
15091 /* If any auto_suppress_location_wrappers are active, don't create
15092 wrappers. */
15096 tree_code code
15101 /* Mark this node as being a wrapper. */
15104 }
15108 /* Return the name of combined function FN, for debugging purposes. */
15112 {
15114 {
15117 }
15118 else
15120 }
15122 /* Return a bitmap with a bit set corresponding to each argument in
15123 a function call type FNTYPE declared with attribute nonnull,
15124 or null if none of the function's argument are nonnull. The caller
15125 must free the bitmap. */
15127 bitmap
15129 {
15135 {
15136 /* The this pointer in C++ non-static member functions is
15137 implicitly nonnull whether or not it's declared as such. */
15140 }
15146 /* A function declaration can specify multiple attribute nonnull,
15147 each with zero or more arguments. The loop below creates a bitmap
15148 representing a union of all the arguments. An empty (but non-null)
15149 bitmap means that all arguments have been declaraed nonnull. */
15151 {
15160 {
15161 /* Clear the bitmap in case a previous attribute nonnull
15162 set it and this one overrides it for all arguments. */
15165 }
15167 /* Iterate over the indices of the format arguments declared nonnull
15168 and set a bit for each. */
15170 {
15173 }
15174 }
15177 }
15179 /* Returns true if TYPE is a type where it and all of its subobjects
15180 (recursively) are of structure, union, or array type. */
15182 bool
15184 {
15186 {
15193 }
15199 }
15201 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15202 that shouldn't be passed via stack. */
15204 bool
15206 {
15217 }
15219 /* Determine whether TYPE is a structure with a flexible array member,
15220 or a union containing such a structure (possibly recursively). */
15222 bool
15224 {
15227 {
15243 {
15247 }
15251 }
15252 }
15254 /* Like int_size_in_bytes, but handle empty records specially. */
15256 HOST_WIDE_INT
15258 {
15260 }
15262 /* Like size_in_bytes, but handle empty records specially. */
15264 tree
15266 {
15268 }
15270 /* Return true if an expression with CODE has to have the same result type as
15271 its first operand. */
15273 bool
15275 {
15277 {
15311 }
15312 }
15314 /* Return a typenode for the "standard" C type with a given name. */
15315 tree
15317 {
15349 }
15351 /* List of pointer types used to declare builtins before we have seen their
15352 real declaration.
15354 Keep the size up to date in tree.h ! */
15356 {
15363 };
15365 /* Return the maximum object size. */
15367 tree
15369 {
15370 /* To do: Make this a configurable parameter. */
15372 }
15374 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15375 parameter default to false and that weeds out error_mark_node. */
15377 bool
15380 {
15387 }
15389 #if CHECKING_P
15393 /* Selftests for tree. */
15395 /* Verify that integer constants are sane. */
15397 static void
15399 {
15412 }
15414 /* Verify identifiers. */
15416 static void
15418 {
15422 }
15424 /* Verify LABEL_DECL. */
15426 static void
15428 {
15434 }
15436 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15437 are given by VALS. */
15439 static tree
15441 {
15446 }
15448 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15450 static void
15452 {
15458 }
15460 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15461 and that its elements match EXPECTED. */
15463 static void
15466 {
15473 }
15475 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15476 and NPATTERNS background elements, and that its elements match
15477 EXPECTED. */
15479 static void
15482 {
15489 }
15491 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15492 and that its elements match EXPECTED. */
15494 static void
15497 {
15504 }
15506 /* Test the creation of VECTOR_CSTs. */
15508 static void
15510 {
15516 /* Test a simple linear series with a base of 0 and a step of 1:
15517 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15523 /* Try the same with the first element replaced by 100:
15524 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15529 /* Try a series that wraps around.
15530 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15536 /* Try a downward series:
15537 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15543 /* Try two interleaved series with different bases and steps:
15544 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15547 {
15550 }
15554 /* Try a duplicated value:
15555 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15561 /* Try an interleaved duplicated value:
15562 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15569 /* Try a duplicated value with 2 exceptions
15570 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15576 /* Try with and without a step
15577 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15583 /* Try a fully-general constant:
15584 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15588 }
15590 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15591 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15592 modifying its argument in-place. */
15594 static void
15596 {
15599 }
15601 /* Verify location wrappers. */
15603 static void
15605 {
15610 /* Wrapping a constant. */
15620 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15623 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15628 /* Wrapping a STRING_CST. */
15640 /* Wrapping a variable. */
15643 integer_type_node);
15652 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15653 wrapper. */
15658 /* Verify that STRIP_NOPS removes wrappers. */
15662 }
15664 /* Test various tree predicates. Verify that location wrappers don't
15665 affect the results. */
15667 static void
15669 {
15670 /* Build various constants and wrappers around them. */
15698 /* TODO: vector constants. */
15700 /* Test integer_onep. */
15720 /* Test integer_zerop. */
15740 /* Test integer_all_onesp. */
15760 /* Test integer_minus_onep. */
15780 /* Test integer_each_onep. */
15800 /* Test integer_truep. */
15820 /* Test integer_nonzerop. */
15840 /* Test real_zerop. */
15860 /* Test real_onep. */
15880 /* Test real_minus_onep. */
15900 /* Test zerop. */
15920 /* Test tree_expr_nonnegative_p. */
15940 /* Test tree_expr_nonzero_p. */
15948 /* Test integer_valued_real_p. */
15955 /* Test integer_pow2p. */
15960 /* Test uniform_integer_cst_p. */
15979 }
15981 /* Check that string escaping works correctly. */
15983 static void
15985 {
15987 escaped_string msg;
15990 /* ASSERT_STREQ does not accept NULL as a valid test
15991 result, so we have to use ASSERT_EQ instead. */
16000 /* Ensure that we have -fmessage-length set to 0. */
16010 /* Now repeat the tests with -fmessage-length set to 5. */
16013 /* Note that the newline is not translated into an escape. */
16020 /* Restore the original message length setting. */
16022 }
16024 /* Run all of the selftests within this file. */
16026 void
16028 {
16036 }