| blob | 1ad4ad5a5f7403cbff656e4f596f7333e73e57bf |
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 {
884 }
897 {
909 }
913 {
934 }
938 }
939 }
941 /* Compute the number of bytes occupied by NODE. This routine only
942 looks at TREE_CODE, except for those nodes that have variable sizes. */
943 size_t
945 {
948 {
978 else
980 }
981 }
983 /* Return tree node kind based on tree CODE. */
985 static tree_node_kind
987 {
991 {
1009 {
1026 }
1032 }
1033 }
1035 /* Record interesting allocation statistics for a tree node with CODE
1036 and LENGTH. */
1038 static void
1040 {
1049 }
1051 /* Allocate and return a new UID from the DECL_UID namespace. */
1053 int
1055 {
1057 }
1059 /* Return a newly allocated node of code CODE. For decl and type
1060 nodes, some other fields are initialized. The rest of the node is
1061 initialized to zero. This function cannot be used for TREE_VEC,
1062 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1063 tree_code_size.
1065 Achoo! I got a code in the node. */
1067 tree
1069 {
1070 tree t;
1080 {
1088 {
1090 {
1093 }
1094 else
1096 }
1100 else
1101 {
1104 }
1117 /* Default to no attributes for type, but let target change that. */
1121 /* We have not yet computed the alias set for this type. */
1131 {
1139 /* All of these have side-effects, no matter what their
1140 operands are. */
1146 }
1151 {
1164 }
1168 /* Other classes need no special treatment. */
1170 }
1173 }
1175 /* Free tree node. */
1177 void
1179 {
1182 {
1192 }
1204 }
1205 \f
1206 /* Return a new node with the same contents as NODE except that its
1207 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1209 tree
1211 {
1212 tree t;
1229 {
1232 else
1233 {
1237 }
1240 {
1243 }
1244 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1246 {
1249 }
1251 {
1254 }
1256 {
1259 }
1260 }
1262 {
1264 /* The following is so that the debug code for
1265 the copy is different from the original type.
1266 The two statements usually duplicate each other
1267 (because they clear fields of the same union),
1268 but the optimizer should catch that. */
1272 /* Do not copy the values cache. */
1274 {
1277 }
1278 }
1280 {
1284 }
1286 {
1290 }
1293 }
1295 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1296 For example, this can copy a list made of TREE_LIST nodes. */
1298 tree
1300 {
1301 tree head;
1310 {
1314 }
1316 }
1318 \f
1319 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1320 INTEGER_CST with value CST and type TYPE. */
1322 static unsigned int
1324 {
1326 /* We need extra HWIs if CST is an unsigned integer with its
1327 upper bit set. */
1331 }
1333 /* Return a new INTEGER_CST with value CST and type TYPE. */
1335 static tree
1337 {
1343 {
1349 }
1352 {
1353 len--;
1357 }
1363 }
1365 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1367 static tree
1369 CXX_MEM_STAT_INFO)
1370 {
1382 }
1384 /* Create a constant tree that contains CST sign-extended to TYPE. */
1386 tree
1388 {
1389 /* Support legacy code. */
1394 }
1396 /* Create a constant tree that contains CST zero-extended to TYPE. */
1398 tree
1400 {
1402 }
1404 /* Create a constant tree that contains CST sign-extended to TYPE. */
1406 tree
1408 {
1411 }
1413 /* Constructs tree in type TYPE from with value given by CST. Signedness
1414 of CST is assumed to be the same as the signedness of TYPE. */
1416 tree
1418 {
1420 }
1422 /* We force the wide_int CST to the range of the type TYPE by sign or
1423 zero extending it. OVERFLOWABLE indicates if we are interested in
1424 overflow of the value, when >0 we are only interested in signed
1425 overflow, for <0 we are interested in any overflow. OVERFLOWED
1426 indicates whether overflow has already occurred. CONST_OVERFLOWED
1427 indicates whether constant overflow has already occurred. We force
1428 T's value to be within range of T's type (by setting to 0 or 1 all
1429 the bits outside the type's range). We set TREE_OVERFLOWED if,
1430 OVERFLOWED is nonzero,
1431 or OVERFLOWABLE is >0 and signed overflow occurs
1432 or OVERFLOWABLE is <0 and any overflow occurs
1433 We return a new tree node for the extended wide_int. The node
1434 is shared if no overflow flags are set. */
1437 tree
1440 {
1443 /* If we need to set overflow flags, return a new unshared node. */
1445 {
1449 {
1451 sign);
1452 tree t;
1455 else
1456 {
1459 {
1462 }
1464 }
1467 }
1468 }
1470 /* Else build a shared node. */
1472 }
1474 /* These are the hash table functions for the hash table of INTEGER_CST
1475 nodes of a sizetype. */
1477 /* Return the hash code X, an INTEGER_CST. */
1479 hashval_t
1481 {
1490 }
1492 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1493 is the same as that given by *Y, which is the same. */
1495 bool
1497 {
1511 }
1513 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1514 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1515 number of slots that can be cached for the type. */
1520 {
1522 /* Initialize cache. */
1524 {
1527 }
1530 {
1531 /* Create a new shared int. */
1534 }
1536 }
1538 /* Create an INT_CST node of TYPE and value CST.
1539 The returned node is always shared. For small integers we use a
1540 per-type vector cache, for larger ones we use a single hash table.
1541 The value is extended from its precision according to the sign of
1542 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1543 the upper bits and ensures that hashing and value equality based
1544 upon the underlying HOST_WIDE_INTs works without masking. */
1546 static tree
1548 {
1549 tree t;
1557 /* Verify that everything is canonical. */
1560 {
1565 }
1572 {
1573 /* Cache NULL pointer and zero bounds. */
1576 /* Cache upper bounds of pointers. */
1579 /* Cache 1 which is used for a non-zero range. */
1584 {
1586 /* Make sure no one is clobbering the shared constant. */
1590 }
1591 }
1593 {
1594 /* We just need to store a single HOST_WIDE_INT. */
1595 HOST_WIDE_INT hwi;
1598 else
1602 {
1605 /* Fallthru. */
1609 /* Ignore pointers, as they were already handled above. */
1613 /* Cache false or true. */
1622 {
1623 /* Cache [0, N). */
1627 }
1628 else
1629 {
1630 /* Cache [-1, N). */
1634 }
1642 }
1645 {
1647 /* Make sure no one is clobbering the shared constant. */
1654 }
1655 else
1656 {
1657 /* Use the cache of larger shared ints, using int_cst_node as
1658 a temporary. */
1666 {
1667 /* Insert this one into the hash table. */
1670 /* Make a new node for next time round. */
1672 }
1673 }
1674 }
1675 else
1676 {
1677 /* The value either hashes properly or we drop it on the floor
1678 for the gc to take care of. There will not be enough of them
1679 to worry about. */
1685 {
1686 /* Insert this one into the hash table. */
1689 }
1690 else
1692 }
1695 }
1697 hashval_t
1699 {
1707 }
1709 bool
1711 {
1718 }
1720 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1721 The elements must also have type TYPE. */
1723 tree
1725 {
1736 INSERT);
1738 {
1743 }
1745 }
1747 /* Create a constant tree with value VALUE in type TYPE. */
1749 tree
1751 {
1755 }
1757 void
1759 {
1767 /* The caching indices here must match those in
1768 wide_int_to_type_1. */
1770 {
1773 /* Fallthru. */
1777 {
1785 }
1789 /* Cache false or true. */
1798 {
1799 /* Cache 0..N */
1802 /* This is a little hokie, but if the prec is smaller than
1803 what is necessary to hold param_integer_share_limit, then the
1804 obvious test will not get the correct answer. */
1806 {
1810 }
1813 }
1814 else
1815 {
1816 /* Cache -1..N */
1822 {
1824 {
1827 }
1830 }
1831 }
1835 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1836 members. */
1841 }
1844 {
1845 /* Look for it in the type's vector of small shared ints. */
1847 {
1850 }
1854 }
1855 else
1856 {
1857 /* Use the cache of larger shared ints. */
1859 /* If there is already an entry for the number verify it's the
1860 same. */
1863 else
1864 /* Otherwise insert this one into the hash table. */
1866 }
1867 }
1870 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1871 and the rest are zeros. */
1873 tree
1875 {
1880 }
1882 /* Checks that X is integer constant that can be expressed in (unsigned)
1883 HOST_WIDE_INT without loss of precision. */
1885 bool
1887 {
1890 }
1892 /* Build a newly constructed VECTOR_CST with the given values of
1893 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1895 tree
1898 {
1900 tree t;
1916 }
1918 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1919 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1921 tree
1923 {
1928 tree value;
1930 /* We can't construct a VECTOR_CST for a variable number of elements. */
1934 {
1936 {
1937 /* If NELTS is constant then this must be too. */
1941 }
1942 else
1944 }
1949 }
1951 /* Build a vector of type VECTYPE where all the elements are SCs. */
1952 tree
1954 {
1960 /* Verify that the vector type is suitable for SC. Note that there
1961 is some inconsistency in the type-system with respect to restrict
1962 qualifications of pointers. Vector types always have a main-variant
1963 element type and the qualification is applied to the vector-type.
1964 So TREE_TYPE (vector-type) does not return a properly qualified
1965 vector element-type. */
1970 {
1974 }
1977 else
1978 {
1984 }
1985 }
1987 /* If TYPE is not a vector type, just return SC, otherwise return
1988 build_vector_from_val (TYPE, SC). */
1990 tree
1992 {
1997 }
1999 /* Build a vector series of type TYPE in which element I has the value
2000 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2001 and a VEC_SERIES_EXPR otherwise. */
2003 tree
2005 {
2009 {
2019 }
2021 }
2023 /* Return a vector with the same number of units and number of bits
2024 as VEC_TYPE, but in which the elements are a linear series of unsigned
2025 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2027 tree
2029 {
2034 {
2035 index_elt_type = build_nonstandard_integer_type
2038 }
2044 }
2046 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2047 elements are A and the rest are B. */
2049 tree
2051 {
2054 /* Optimize the constant case. */
2061 }
2063 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2064 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2066 void
2068 {
2070 tree val;
2076 {
2077 /* Mostly ctors will have elts that don't have side-effects, so
2078 the usual case is to scan all the elements. Hence a single
2079 loop for both const and side effects, rather than one loop
2080 each (with early outs). */
2085 }
2089 }
2091 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2092 CONSTRUCTOR C. */
2094 void
2096 {
2098 tree val;
2104 {
2109 }
2110 }
2112 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2113 are in the vec pointed to by VALS. */
2114 tree
2116 {
2125 }
2127 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2128 INDEX and VALUE. */
2129 tree
2131 {
2139 }
2142 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2143 are in a list pointed to by VALS. */
2144 tree
2146 {
2147 tree t;
2151 {
2155 }
2158 }
2160 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2161 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2162 fields in the constructor remain null. */
2164 tree
2166 {
2173 }
2175 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2176 of elements, provided as index/value pairs. */
2178 tree
2180 {
2187 {
2191 }
2194 }
2196 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2198 tree
2200 {
2204 }
2206 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2208 tree
2210 {
2211 tree v;
2221 }
2223 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2225 tree
2227 {
2228 tree v;
2232 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2233 Consider doing it via real_convert now. */
2243 }
2245 /* Like build_real, but first truncate D to the type. */
2247 tree
2249 {
2251 }
2253 /* Return a new REAL_CST node whose type is TYPE
2254 and whose value is the integer value of the INTEGER_CST node I. */
2256 REAL_VALUE_TYPE
2258 {
2259 REAL_VALUE_TYPE d;
2261 /* Clear all bits of the real value type so that we can later do
2262 bitwise comparisons to see if two values are the same. */
2268 }
2270 /* Given a tree representing an integer constant I, return a tree
2271 representing the same value as a floating-point constant of type TYPE. */
2273 tree
2275 {
2276 tree v;
2283 }
2285 /* Return a new REAL_CST node whose type is TYPE
2286 and whose value is the integer value I which has sign SGN. */
2288 tree
2290 {
2291 REAL_VALUE_TYPE d;
2293 /* Clear all bits of the real value type so that we can later do
2294 bitwise comparisons to see if two values are the same. */
2299 }
2301 /* Return a newly constructed STRING_CST node whose value is the LEN
2302 characters at STR when STR is nonnull, or all zeros otherwise.
2303 Note that for a C string literal, LEN should include the trailing NUL.
2304 The TREE_TYPE is not initialized. */
2306 tree
2308 {
2309 /* Do not waste bytes provided by padding of struct tree_string. */
2322 else
2327 }
2329 /* Return a newly constructed COMPLEX_CST node whose value is
2330 specified by the real and imaginary parts REAL and IMAG.
2331 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2332 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2334 tree
2336 {
2347 }
2349 /* Build a complex (inf +- 0i), such as for the result of cproj.
2350 TYPE is the complex tree type of the result. If NEG is true, the
2351 imaginary zero is negative. */
2353 tree
2355 {
2362 }
2364 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2365 element is set to 1. In particular, this is 1 + i for complex types. */
2367 tree
2369 {
2371 {
2374 }
2375 else
2377 }
2379 /* Return a constant of arithmetic type TYPE which is the
2380 multiplicative identity of the set TYPE. */
2382 tree
2384 {
2386 {
2396 /* We can only generate 1 for accum types. */
2401 {
2405 }
2414 }
2415 }
2417 /* Return an integer of type TYPE containing all 1's in as much precision as
2418 it contains, or a complex or vector whose subparts are such integers. */
2420 tree
2422 {
2424 {
2427 }
2428 else
2430 }
2432 /* Return a constant of arithmetic type TYPE which is the
2433 opposite of the multiplicative identity of the set TYPE. */
2435 tree
2437 {
2439 {
2449 /* We can only generate 1 for accum types. */
2456 {
2460 }
2469 }
2470 }
2472 /* Build 0 constant of type TYPE. This is used by constructor folding
2473 and thus the constant should be represented in memory by
2474 zero(es). */
2476 tree
2478 {
2480 {
2493 {
2497 }
2500 {
2504 }
2510 }
2511 }
2514 /* Build a BINFO with LEN language slots. */
2516 tree
2518 {
2519 tree t;
2534 }
2536 /* Create a CASE_LABEL_EXPR tree node and return it. */
2538 tree
2540 {
2552 }
2554 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2555 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2556 The latter determines the length of the HOST_WIDE_INT vector. */
2558 tree
2560 {
2561 tree t;
2573 /* to_offset can only be applied to trees that are offset_int-sized
2574 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2575 must be exactly the precision of offset_int and so LEN is correct. */
2578 else
2584 }
2586 /* Build a newly constructed TREE_VEC node of length LEN. */
2588 tree
2590 {
2591 tree t;
2602 }
2604 /* Grow a TREE_VEC node to new length LEN. */
2606 tree
2608 {
2624 }
2625 \f
2626 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2627 fixed, and scalar, complex or vector. */
2629 bool
2631 {
2635 }
2637 /* Return 1 if EXPR is the integer constant zero or a complex constant
2638 of zero, or a location wrapper for such a constant. */
2640 bool
2642 {
2646 {
2658 }
2659 }
2661 /* Return 1 if EXPR is the integer constant one or the corresponding
2662 complex constant, or a location wrapper for such a constant. */
2664 bool
2666 {
2670 {
2682 }
2683 }
2685 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2686 return 1 if every piece is the integer constant one.
2687 Also return 1 for location wrappers for such a constant. */
2689 bool
2691 {
2697 else
2699 }
2701 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2702 it contains, or a complex or vector whose subparts are such integers,
2703 or a location wrapper for such a constant. */
2705 bool
2707 {
2725 }
2727 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2728 for such a constant. */
2730 bool
2732 {
2738 else
2740 }
2742 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2743 one bit on), or a location wrapper for such a constant. */
2745 bool
2747 {
2759 }
2761 /* Return 1 if EXPR is an integer constant other than zero or a
2762 complex constant other than zero, or a location wrapper for such a
2763 constant. */
2765 bool
2767 {
2775 }
2777 /* Return 1 if EXPR is the integer constant one. For vector,
2778 return 1 if every piece is the integer constant minus one
2779 (representing the value TRUE).
2780 Also return 1 for location wrappers for such a constant. */
2782 bool
2784 {
2790 }
2792 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2793 for such a constant. */
2795 bool
2797 {
2802 }
2804 /* Return the power of two represented by a tree node known to be a
2805 power of two. */
2807 int
2809 {
2814 }
2816 /* Similar, but return the largest integer Y such that 2 ** Y is less
2817 than or equal to EXPR. */
2819 int
2821 {
2826 }
2828 /* Return number of known trailing zero bits in EXPR, or, if the value of
2829 EXPR is known to be zero, the precision of it's type. */
2831 unsigned int
2833 {
2840 {
2861 /* Second operand is sizetype, which could be in theory
2862 wider than pointer's precision. Make sure we never
2863 return more than prec. */
2878 {
2881 }
2886 {
2891 }
2900 {
2903 {
2908 }
2909 }
2911 CASE_CONVERT:
2929 {
2932 }
2936 }
2937 }
2939 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2940 decimal float constants, so don't return 1 for them.
2941 Also return 1 for location wrappers around such a constant. */
2943 bool
2945 {
2949 {
2957 {
2958 /* Don't simply check for a duplicate because the predicate
2959 accepts both +0.0 and -0.0. */
2965 }
2968 }
2969 }
2971 /* Return 1 if EXPR is the real constant one in real or complex form.
2972 Trailing zeroes matter for decimal float constants, so don't return
2973 1 for them.
2974 Also return 1 for location wrappers around such a constant. */
2976 bool
2978 {
2982 {
2995 }
2996 }
2998 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2999 matter for decimal float constants, so don't return 1 for them.
3000 Also return 1 for location wrappers around such a constant. */
3002 bool
3004 {
3008 {
3021 }
3022 }
3024 /* Nonzero if EXP is a constant or a cast of a constant. */
3026 bool
3028 {
3029 /* This is not quite the same as STRIP_NOPS. It does more. */
3034 }
3036 /* Return true if T holds a polynomial pointer difference, storing it in
3037 *VALUE if so. A true return means that T's precision is no greater
3038 than 64 bits, which is the largest address space we support, so *VALUE
3039 never loses precision. However, the signedness of the result does
3040 not necessarily match the signedness of T: sometimes an unsigned type
3041 like sizetype is used to encode a value that is actually negative. */
3043 bool
3045 {
3049 {
3054 }
3056 {
3063 }
3065 }
3067 poly_int64
3069 {
3074 }
3076 poly_uint64
3078 {
3083 }
3084 \f
3085 /* Return first list element whose TREE_VALUE is ELEM.
3086 Return 0 if ELEM is not in LIST. */
3088 tree
3090 {
3092 {
3096 }
3098 }
3100 /* Return first list element whose TREE_PURPOSE is ELEM.
3101 Return 0 if ELEM is not in LIST. */
3103 tree
3105 {
3107 {
3111 }
3113 }
3115 /* Return true if ELEM is in V. */
3117 bool
3119 {
3121 tree t;
3126 }
3128 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3129 NULL_TREE. */
3131 tree
3133 {
3137 }
3139 /* Return nonzero if ELEM is part of the chain CHAIN. */
3141 bool
3143 {
3145 {
3149 }
3152 }
3154 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3155 We expect a null pointer to mark the end of the chain.
3156 This is the Lisp primitive `length'. */
3158 int
3160 {
3162 #ifdef ENABLE_TREE_CHECKING
3164 #endif
3168 {
3170 #ifdef ENABLE_TREE_CHECKING
3174 #endif
3175 len++;
3176 }
3179 }
3181 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3182 UNION_TYPE TYPE, or NULL_TREE if none. */
3184 tree
3186 {
3191 }
3193 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3194 UNION_TYPE TYPE, or NULL_TREE if none. */
3196 tree
3198 {
3202 {
3207 }
3210 }
3212 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3213 by modifying the last node in chain 1 to point to chain 2.
3214 This is the Lisp primitive `nconc'. */
3216 tree
3218 {
3219 tree t1;
3230 #ifdef ENABLE_TREE_CHECKING
3231 {
3232 tree t2;
3235 }
3236 #endif
3239 }
3241 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3243 tree
3245 {
3246 tree next;
3251 }
3253 /* Reverse the order of elements in the chain T,
3254 and return the new head of the chain (old last element). */
3256 tree
3258 {
3261 {
3262 /* We shouldn't be using this function to reverse BLOCK chains; we
3263 have blocks_nreverse for that. */
3268 }
3270 }
3271 \f
3272 /* Return a newly created TREE_LIST node whose
3273 purpose and value fields are PARM and VALUE. */
3275 tree
3277 {
3282 }
3284 /* Build a chain of TREE_LIST nodes from a vector. */
3286 tree
3288 {
3292 tree t;
3294 {
3297 }
3299 }
3301 /* Return a newly created TREE_LIST node whose
3302 purpose and value fields are PURPOSE and VALUE
3303 and whose TREE_CHAIN is CHAIN. */
3305 tree
3307 {
3308 tree node;
3320 }
3322 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3323 trees. */
3327 {
3331 tree val;
3337 }
3338 \f
3339 /* Return the size nominally occupied by an object of type TYPE
3340 when it resides in memory. The value is measured in units of bytes,
3341 and its data type is that normally used for type sizes
3342 (which is the first type created by make_signed_type or
3343 make_unsigned_type). */
3345 tree
3347 {
3348 tree t;
3357 {
3360 }
3363 }
3365 /* Return the size of TYPE (in bytes) as a wide integer
3366 or return -1 if the size can vary or is larger than an integer. */
3368 HOST_WIDE_INT
3370 {
3371 tree t;
3381 else
3383 }
3385 /* Return the maximum size of TYPE (in bytes) as a wide integer
3386 or return -1 if the size can vary or is larger than an integer. */
3388 HOST_WIDE_INT
3390 {
3392 tree size_tree;
3394 /* If this is an array type, check for a possible MAX_SIZE attached. */
3397 {
3402 }
3404 /* If we still haven't been able to get a size, see if the language
3405 can compute a maximum size. */
3408 {
3413 }
3416 }
3417 \f
3418 /* Return the bit position of FIELD, in bits from the start of the record.
3419 This is a tree of type bitsizetype. */
3421 tree
3423 {
3426 }
3427 \f
3428 /* Return the byte position of FIELD, in bytes from the start of the record.
3429 This is a tree of type sizetype. */
3431 tree
3433 {
3436 }
3438 /* Likewise, but return as an integer. It must be representable in
3439 that way (since it could be a signed value, we don't have the
3440 option of returning -1 like int_size_in_byte can. */
3442 HOST_WIDE_INT
3444 {
3446 }
3447 \f
3448 /* Return, as a tree node, the number of elements for TYPE (which is an
3449 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3451 tree
3453 {
3456 /* If they did it with unspecified bounds, then we should have already
3457 given an error about it before we got here. */
3465 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3470 ? max
3472 }
3473 \f
3474 /* If arg is static -- a reference to an object in static storage -- then
3475 return the object. This is not the same as the C meaning of `static'.
3476 If arg isn't static, return NULL. */
3478 tree
3480 {
3482 {
3484 /* Nested functions are static, even though taking their address will
3485 involve a trampoline as we unnest the nested function and create
3486 the trampoline on the tree level. */
3507 /* If the thing being referenced is not a field, then it is
3508 something language specific. */
3511 /* If we are referencing a bitfield, we can't evaluate an
3512 ADDR_EXPR at compile time and so it isn't a constant. */
3529 else
3537 }
3538 }
3540 \f
3543 /* Return whether OP is a DECL whose address is function-invariant. */
3545 bool
3547 {
3548 /* The conditions below are slightly less strict than the one in
3549 staticp. */
3552 {
3575 }
3578 }
3580 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3582 bool
3584 {
3585 /* The conditions below are slightly less strict than the one in
3586 staticp. */
3589 {
3609 }
3612 }
3615 /* Return true if T is function-invariant (internal function, does
3616 not handle arithmetic; that's handled in skip_simple_arithmetic and
3617 tree_invariant_p). */
3619 static bool
3621 {
3622 tree op;
3629 {
3636 {
3638 {
3653 }
3655 }
3661 }
3664 }
3666 /* Return true if T is function-invariant. */
3668 bool
3670 {
3673 }
3675 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3676 Do this to any expression which may be used in more than one place,
3677 but must be evaluated only once.
3679 Normally, expand_expr would reevaluate the expression each time.
3680 Calling save_expr produces something that is evaluated and recorded
3681 the first time expand_expr is called on it. Subsequent calls to
3682 expand_expr just reuse the recorded value.
3684 The call to expand_expr that generates code that actually computes
3685 the value is the first call *at compile time*. Subsequent calls
3686 *at compile time* generate code to use the saved value.
3687 This produces correct result provided that *at run time* control
3688 always flows through the insns made by the first expand_expr
3689 before reaching the other places where the save_expr was evaluated.
3690 You, the caller of save_expr, must make sure this is so.
3692 Constants, and certain read-only nodes, are returned with no
3693 SAVE_EXPR because that is safe. Expressions containing placeholders
3694 are not touched; see tree.def for an explanation of what these
3695 are used for. */
3697 tree
3699 {
3700 tree inner;
3702 /* If the tree evaluates to a constant, then we don't want to hide that
3703 fact (i.e. this allows further folding, and direct checks for constants).
3704 However, a read-only object that has side effects cannot be bypassed.
3705 Since it is no problem to reevaluate literals, we just return the
3706 literal node. */
3714 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3715 it means that the size or offset of some field of an object depends on
3716 the value within another field.
3718 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3719 and some variable since it would then need to be both evaluated once and
3720 evaluated more than once. Front-ends must assure this case cannot
3721 happen by surrounding any such subexpressions in their own SAVE_EXPR
3722 and forcing evaluation at the proper time. */
3728 /* This expression might be placed ahead of a jump to ensure that the
3729 value was computed on both sides of the jump. So make sure it isn't
3730 eliminated as dead. */
3733 }
3735 /* Look inside EXPR into any simple arithmetic operations. Return the
3736 outermost non-arithmetic or non-invariant node. */
3738 tree
3740 {
3741 /* We don't care about whether this can be used as an lvalue in this
3742 context. */
3746 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3747 a constant, it will be more efficient to not make another SAVE_EXPR since
3748 it will allow better simplification and GCSE will be able to merge the
3749 computations if they actually occur. */
3751 {
3755 {
3760 else
3762 }
3763 else
3765 }
3768 }
3770 /* Look inside EXPR into simple arithmetic operations involving constants.
3771 Return the outermost non-arithmetic or non-constant node. */
3773 tree
3775 {
3780 {
3784 {
3789 else
3791 }
3792 else
3794 }
3797 }
3799 /* Return which tree structure is used by T. */
3801 enum tree_node_structure_enum
3803 {
3806 }
3808 /* Set various status flags when building a CALL_EXPR object T. */
3810 static void
3812 {
3817 /* Calls have side-effects, except those to const or pure functions. */
3820 /* Propagate TREE_READONLY of arguments for const functions. */
3826 {
3832 }
3836 }
3837 \f
3838 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3839 size or offset that depends on a field within a record. */
3841 bool
3843 {
3854 {
3856 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3857 position computations since they will be converted into a
3858 WITH_RECORD_EXPR involving the reference, which will assume
3859 here will be valid. */
3873 {
3875 /* Ignoring the first operand isn't quite right, but works best. */
3884 /* The save_expr function never wraps anything containing
3885 a PLACEHOLDER_EXPR. */
3890 }
3893 {
3901 }
3905 {
3907 {
3908 const_tree arg;
3909 const_call_expr_arg_iterator iter;
3914 }
3917 }
3921 }
3923 }
3925 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3926 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3927 field positions. */
3929 static bool
3931 {
3932 /* If the size contains a placeholder or the parent type (component type in
3933 the case of arrays) type involves a placeholder, this type does. */
3941 /* Now do type-specific checks. Note that the last part of the check above
3942 greatly limits what we have to do below. */
3944 {
3961 /* Here we just check the bounds. */
3966 /* We have already checked the component type above, so just check
3967 the domain type. Flexible array members have a null domain. */
3974 {
3975 tree field;
3986 }
3990 }
3991 }
3993 /* Wrapper around above function used to cache its result. */
3995 bool
3997 {
4000 /* If the contains_placeholder_bits field has been initialized,
4001 then we know the answer. */
4005 /* Indicate that we've seen this type node, and the answer is false.
4006 This is what we want to return if we run into recursion via fields. */
4009 /* Compute the real value. */
4012 /* Store the real value. */
4016 }
4017 \f
4018 /* Push tree EXP onto vector QUEUE if it is not already present. */
4020 static void
4022 {
4024 tree iter;
4032 }
4034 /* Given a tree EXP, find all occurrences of references to fields
4035 in a PLACEHOLDER_EXPR and place them in vector REFS without
4036 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4037 we assume here that EXP contains only arithmetic expressions
4038 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4039 argument list. */
4041 void
4043 {
4045 tree inner;
4048 /* We handle TREE_LIST and COMPONENT_REF separately. */
4050 {
4053 }
4055 {
4059 ;
4063 else
4065 }
4066 else
4068 {
4073 /* Variables allocated to static storage can stay. */
4079 /* This is the pattern built in ada/make_aligning_type. */
4082 {
4085 }
4087 /* Fall through. */
4105 }
4106 }
4108 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4109 return a tree with all occurrences of references to F in a
4110 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4111 CONST_DECLs. Note that we assume here that EXP contains only
4112 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4113 occurring only in their argument list. */
4115 tree
4117 {
4120 tree new_tree;
4122 /* We handle TREE_LIST and COMPONENT_REF separately. */
4124 {
4131 }
4133 {
4134 tree inner;
4136 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4137 and it is the right field, replace it with R. */
4141 ;
4143 /* The field. */
4149 /* If this expression hasn't been completed let, leave it alone. */
4157 new_tree
4159 }
4160 else
4162 {
4169 else
4176 /* Fall through. */
4184 {
4229 new_tree
4235 }
4239 {
4244 /* If we are trying to replace F with a constant or with another
4245 instance of one of the arguments of the call, inline back
4246 functions which do nothing else than computing a value from
4247 the arguments they are passed. This makes it possible to
4248 fold partially or entirely the replacement expression. */
4250 {
4254 else
4257 {
4260 }
4262 {
4266 }
4267 }
4270 {
4274 {
4278 }
4279 }
4282 {
4286 }
4287 else
4289 }
4294 }
4302 }
4304 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4305 for it within OBJ, a tree that is an object or a chain of references. */
4307 tree
4309 {
4312 tree new_tree;
4314 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4315 in the chain of OBJ. */
4317 {
4319 tree elt;
4349 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4350 survives until RTL generation, there will be an error. */
4352 }
4354 /* TREE_LIST is special because we need to look at TREE_VALUE
4355 and TREE_CHAIN, not TREE_OPERANDS. */
4357 {
4364 }
4365 else
4367 {
4380 {
4425 new_tree
4431 }
4435 {
4441 {
4445 {
4449 }
4450 }
4453 {
4457 }
4458 else
4460 }
4465 }
4473 }
4474 \f
4476 /* Subroutine of stabilize_reference; this is called for subtrees of
4477 references. Any expression with side-effects must be put in a SAVE_EXPR
4478 to ensure that it is only evaluated once.
4480 We don't put SAVE_EXPR nodes around everything, because assigning very
4481 simple expressions to temporaries causes us to miss good opportunities
4482 for optimizations. Among other things, the opportunity to fold in the
4483 addition of a constant into an addressing mode often gets lost, e.g.
4484 "y[i+1] += x;". In general, we take the approach that we should not make
4485 an assignment unless we are forced into it - i.e., that any non-side effect
4486 operator should be allowed, and that cse should take care of coalescing
4487 multiple utterances of the same expression should that prove fruitful. */
4489 static tree
4491 {
4492 tree result;
4495 /* We cannot ignore const expressions because it might be a reference
4496 to a const array but whose index contains side-effects. But we can
4497 ignore things that are actual constant or that already have been
4498 handled by this function. */
4504 {
4506 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4507 have side-effects. */
4510 /* FALLTHRU */
4518 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4519 so that it will only be evaluated once. */
4520 /* The reference (r) and comparison (<) classes could be handled as
4521 below, but it is generally faster to only evaluate them once. */
4527 /* Constants need no processing. In fact, we should never reach
4528 here. */
4532 /* Division is slow and tends to be compiled with jumps,
4533 especially the division by powers of 2 that is often
4534 found inside of an array reference. So do it just once. */
4540 /* Recursively stabilize each operand. */
4546 /* Recursively stabilize each operand. */
4552 }
4560 }
4562 /* Stabilize a reference so that we can use it any number of times
4563 without causing its operands to be evaluated more than once.
4564 Returns the stabilized reference. This works by means of save_expr,
4565 so see the caveats in the comments about save_expr.
4567 Also allows conversion expressions whose operands are references.
4568 Any other kind of expression is returned unchanged. */
4570 tree
4572 {
4573 tree result;
4577 {
4581 /* No action is needed in this case. */
4584 CASE_CONVERT:
4623 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4624 it wouldn't be ignored. This matters when dealing with
4625 volatiles. */
4628 /* If arg isn't a kind of lvalue we recognize, make no change.
4629 Caller should recognize the error for an invalid lvalue. */
4635 }
4643 }
4644 \f
4645 /* Low-level constructors for expressions. */
4647 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4648 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4650 void
4652 {
4653 tree node;
4658 /* We started out assuming this address is both invariant and constant, but
4659 does not have side effects. Now go down any handled components and see if
4660 any of them involve offsets that are either non-constant or non-invariant.
4661 Also check for side-effects.
4663 ??? Note that this code makes no attempt to deal with the case where
4664 taking the address of something causes a copy due to misalignment. */
4666 #define UPDATE_FLAGS(NODE) \
4667 do { tree _node = (NODE); \
4668 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4669 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4673 {
4674 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4675 array reference (probably made temporarily by the G++ front end),
4676 so ignore all the operands. */
4680 {
4686 }
4687 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4688 FIELD_DECL, apparently. The G++ front end can put something else
4689 there, at least temporarily. */
4692 {
4695 }
4696 }
4700 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4701 the address, since &(*a)->b is a form of addition. If it's a constant, the
4702 address is constant too. If it's a decl, its address is constant if the
4703 decl is static. Everything else is not constant and, furthermore,
4704 taking the address of a volatile variable is not volatile. */
4709 ;
4712 else
4713 {
4716 }
4721 #undef UPDATE_FLAGS
4722 }
4724 /* Build an expression of code CODE, data type TYPE, and operands as
4725 specified. Expressions and reference nodes can be created this way.
4726 Constants, decls, types and misc nodes cannot be.
4728 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4729 enough for all extant tree codes. */
4731 tree
4733 {
4734 tree t;
4742 }
4744 tree
4746 {
4748 tree t;
4764 {
4767 }
4770 {
4773 }
4775 {
4777 /* All of these have side-effects, no matter what their
4778 operands are. */
4784 /* Whether a dereference is readonly has nothing to do with whether
4785 its operand is readonly. */
4803 }
4806 }
4808 #define PROCESS_ARG(N) \
4809 do { \
4810 TREE_OPERAND (t, N) = arg##N; \
4811 if (arg##N &&!TYPE_P (arg##N)) \
4812 { \
4813 if (TREE_SIDE_EFFECTS (arg##N)) \
4814 side_effects = 1; \
4815 if (!TREE_READONLY (arg##N) \
4816 && !CONSTANT_CLASS_P (arg##N)) \
4817 (void) (read_only = 0); \
4818 if (!TREE_CONSTANT (arg##N)) \
4819 (void) (constant = 0); \
4820 } \
4821 } while (0)
4823 tree
4825 {
4827 tree t;
4833 /* When sizetype precision doesn't match that of pointers
4834 we need to be able to build explicit extensions or truncations
4835 of the offset argument. */
4847 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4848 result based on those same flags for the arguments. But if the
4849 arguments aren't really even `tree' expressions, we shouldn't be trying
4850 to do this. */
4852 /* Expressions without side effects may be constant if their
4853 arguments are as well. */
4860 {
4874 }
4881 {
4883 {
4887 }
4888 }
4889 else
4890 {
4892 /* Don't mark X / 0 as constant. */
4897 }
4900 }
4903 tree
4905 tree arg2 MEM_STAT_DECL)
4906 {
4908 tree t;
4918 /* As a special exception, if COND_EXPR has NULL branches, we
4919 assume that it is a gimple statement and always consider
4920 it to have side effects. */
4926 else
4942 }
4944 tree
4947 {
4949 tree t;
4969 }
4971 tree
4974 {
4976 tree t;
4993 {
4995 {
4999 }
5000 }
5001 else
5007 }
5009 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5010 on the pointer PTR. */
5012 tree
5014 {
5017 tree tem;
5018 /* For convenience allow addresses that collapse to a simple base
5019 and offset. */
5023 {
5027 {
5030 }
5031 else
5034 }
5039 }
5041 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5043 poly_offset_int
5045 {
5047 SIGNED);
5048 }
5050 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5051 offsetted by OFFSET units. */
5053 tree
5055 {
5062 }
5064 /* Similar except don't specify the TREE_TYPE
5065 and leave the TREE_SIDE_EFFECTS as 0.
5066 It is permissible for arguments to be null,
5067 or even garbage if their values do not matter. */
5069 tree
5071 {
5072 tree t;
5089 }
5091 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5092 tree vec. */
5094 tree
5096 {
5106 }
5107 \f
5108 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5109 and data type TYPE.
5110 We do NOT enter this node in any sort of symbol table.
5112 LOC is the location of the decl.
5114 layout_decl is used to set up the decl's storage layout.
5115 Other slots are initialized to 0 or null pointers. */
5117 tree
5119 tree type MEM_STAT_DECL)
5120 {
5121 tree t;
5126 /* if (type == error_mark_node)
5127 type = integer_type_node; */
5128 /* That is not done, deliberately, so that having error_mark_node
5129 as the type can suppress useless errors in the use of this variable. */
5138 }
5140 /* Builds and returns function declaration with NAME and TYPE. */
5142 tree
5144 {
5154 }
5158 /* Builds a new translation-unit decl with name NAME, queues it in the
5159 global list of translation-unit decls and returns it. */
5161 tree
5163 {
5169 }
5171 \f
5172 /* BLOCK nodes are used to represent the structure of binding contours
5173 and declarations, once those contours have been exited and their contents
5174 compiled. This information is used for outputting debugging info. */
5176 tree
5178 {
5186 }
5188 \f
5189 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5191 LOC is the location to use in tree T. */
5193 void
5195 {
5199 {
5203 }
5204 }
5206 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5207 UNKNOWN_LOCATION. */
5209 void
5211 {
5215 }
5217 /* Data used when collecting DECLs and TYPEs for language data removal. */
5219 class free_lang_data_d
5220 {
5224 /* Worklist to avoid excessive recursion. */
5227 /* Set of traversed objects. Used to avoid duplicate visits. */
5230 /* Array of symbols to process with free_lang_data_in_decl. */
5233 /* Array of types to process with free_lang_data_in_type. */
5235 };
5238 /* Add type or decl T to one of the list of tree nodes that need their
5239 language data removed. The lists are held inside FLD. */
5241 static void
5243 {
5248 else
5250 }
5252 /* Push tree node T into FLD->WORKLIST. */
5256 {
5259 }
5262 \f
5263 /* Return simplified TYPE_NAME of TYPE. */
5265 static tree
5267 {
5270 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5271 TYPE_DECL if the type doesn't have linkage.
5272 this must match fld_ */
5280 }
5282 /* Do same comparsion as check_qualified_type skipping lang part of type
5283 and be more permissive about type names: we only care that names are
5284 same (for diagnostics) and that ODR names are the same.
5285 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5287 static bool
5289 {
5291 /* We want to match incomplete variants with complete types.
5292 In this case we need to ignore alignment. */
5303 }
5305 /* Find variant of FIRST that match T and create new one if necessary.
5306 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5308 static tree
5311 {
5326 /* Variants of incomplete types should have alignment
5327 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5329 {
5332 }
5339 }
5341 /* Map complete types to incomplete types. */
5345 /* Map types to simplified types. */
5349 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5350 use MAP to prevent duplicates. */
5352 static tree
5355 {
5360 {
5361 return fld_type_variant
5365 }
5368 tree &array
5371 {
5372 array
5378 }
5380 }
5382 /* Return CTX after removal of contexts that are not relevant */
5384 static tree
5386 {
5387 /* Variably modified types are needed for tree_is_indexable to decide
5388 whether the type needs to go to local or global section.
5389 This code is semi-broken but for now it is easiest to keep contexts
5390 as expected. */
5393 {
5396 }
5398 }
5400 /* For T being aggregate type try to turn it into a incomplete variant.
5401 Return T if no simplification is possible. */
5403 static tree
5405 {
5409 {
5412 {
5413 tree first;
5417 else
5425 }
5427 }
5436 {
5438 tree ©
5442 {
5445 /* It is possible that type was not seen by free_lang_data yet. */
5454 {
5462 }
5463 else
5464 {
5468 }
5470 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5471 This is needed for ODR violation warnings to come out right (we
5472 want duplicate TYPE_DECLs whenever the type is duplicated because
5473 of ODR violation. Because lang data in the TYPE_DECL may not
5474 have been freed yet, rebuild it from scratch and copy relevant
5475 fields. */
5480 {
5490 }
5491 }
5493 }
5496 }
5498 /* Simplify type T for scenarios where we do not need complete pointer
5499 types. */
5501 static tree
5503 {
5508 /* FIXME: This triggers verification error, see PR88140. */
5513 }
5515 /* Reset the expression *EXPR_P, a size or position.
5517 ??? We could reset all non-constant sizes or positions. But it's cheap
5518 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5520 We need to reset self-referential sizes or positions because they cannot
5521 be gimplified and thus can contain a CALL_EXPR after the gimplification
5522 is finished, which will run afoul of LTO streaming. And they need to be
5523 reset to something essentially dummy but not constant, so as to preserve
5524 the properties of the object they are attached to. */
5528 {
5532 }
5535 /* Reset all the fields in a binfo node BINFO. We only keep
5536 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5538 static void
5540 {
5542 tree t;
5555 }
5558 /* Reset all language specific information still present in TYPE. */
5560 static void
5562 {
5565 /* Give the FE a chance to remove its own data first. */
5578 /* Purge non-marked variants from the variants chain, so that they
5579 don't reappear in the IL after free_lang_data. */
5582 {
5585 /* Turn the removed types into distinct types. */
5588 }
5591 {
5593 /* Remove the const and volatile qualifiers from arguments. The
5594 C++ front end removes them, but the C front end does not,
5595 leading to false ODR violation errors when merging two
5596 instances of the same function signature compiled by
5597 different front ends. */
5599 {
5604 {
5606 & ~TYPE_QUAL_CONST
5611 }
5612 /* C++ FE uses TREE_PURPOSE to store initial values. */
5614 }
5615 }
5617 {
5620 {
5621 /* C++ FE uses TREE_PURPOSE to store initial values. */
5624 }
5625 }
5627 {
5628 /* Remove members that are not FIELD_DECLs from the field list
5629 of an aggregate. These occur in C++. */
5633 else
5639 {
5641 /* We need to preserve link to bases and virtual table for all
5642 polymorphic types to make devirtualization machinery working. */
5645 }
5646 }
5650 {
5652 {
5655 /* Type values are used only for C++ ODR checking. Drop them
5656 for all type variants and non-ODR types.
5657 For ODR types the data is freed in free_odr_warning_data. */
5659 ;
5664 else
5666 }
5669 }
5678 {
5680 do
5681 {
5683 }
5686 }
5690 }
5693 /* Return true if DECL may need an assembler name to be set. */
5697 {
5698 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5699 Rule merging. This makes type_odr_p to return true on those types during
5700 LTO and by comparing the mangled name, we can say what types are intended
5701 to be equivalent across compilation unit.
5703 We do not store names of type_in_anonymous_namespace_p.
5705 Record, union and enumeration type have linkage that allows use
5706 to check type_in_anonymous_namespace_p. We do not mangle compound types
5707 that always can be compared structurally.
5709 Similarly for builtin types, we compare properties of their main variant.
5710 A special case are integer types where mangling do make differences
5711 between char/signed char/unsigned char etc. Storing name for these makes
5712 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5713 See cp/mangle.c:write_builtin_type for details. */
5716 {
5729 }
5730 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5734 /* If DECL already has its assembler name set, it does not need a
5735 new one. */
5740 /* Abstract decls do not need an assembler name. */
5744 /* For VAR_DECLs, only static, public and external symbols need an
5745 assembler name. */
5753 {
5754 /* Do not set assembler name on builtins. Allow RTL expansion to
5755 decide whether to expand inline or via a regular call. */
5760 /* Functions represented in the callgraph need an assembler name. */
5764 /* Unused and not public functions don't need an assembler name. */
5767 }
5770 }
5773 /* Reset all language specific information still present in symbol
5774 DECL. */
5776 static void
5778 {
5781 /* Give the FE a chance to remove its own data first. */
5795 {
5800 }
5803 {
5805 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5806 the address may be taken in other unit, so this flag has no practical
5807 use for middle-end.
5809 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5810 for public objects that indeed cannot be adressed, but it is not
5811 the case. Set the flag to true so we do not get merge failures for
5812 i.e. virtual tables between units that take address of it and
5813 units that don't. */
5819 {
5822 else
5823 {
5828 }
5829 }
5831 {
5832 tree t;
5834 /* If DECL has a gimple body, then the context for its
5835 arguments must be DECL. Otherwise, it doesn't really
5836 matter, as we will not be emitting any code for DECL. In
5837 general, there may be other instances of DECL created by
5838 the front end and since PARM_DECLs are generally shared,
5839 their DECL_CONTEXT changes as the replicas of DECL are
5840 created. The only time where DECL_CONTEXT is important
5841 is for the FUNCTION_DECLs that have a gimple body (since
5842 the PARM_DECL will be used in the function's body). */
5851 }
5853 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5854 At this point, it is not needed anymore. */
5857 /* Clear the abstract origin if it refers to a method.
5858 Otherwise dwarf2out.c will ICE as we splice functions out of
5859 TYPE_FIELDS and thus the origin will not be output
5860 correctly. */
5863 && RECORD_OR_UNION_TYPE_P
5868 }
5870 {
5871 /* See comment above why we set the flag for functions. */
5878 }
5880 {
5891 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5892 }
5894 {
5897 }
5901 {
5902 /* Strip builtins from the translation-unit BLOCK. We still have targets
5903 without builtin_decl_explicit support and also builtins are shared
5904 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5907 {
5912 else
5914 }
5915 }
5916 /* We need to keep field decls associated with their trees. Otherwise tree
5917 merging may merge some fileds and keep others disjoint wich in turn will
5918 not do well with TREE_CHAIN pointers linking them.
5920 Also do not drop containing types for virtual methods and tables because
5921 these are needed by devirtualization.
5922 C++ destructors are special because C++ frontends sometimes produces
5923 virtual destructor as an alias of non-virtual destructor. In
5924 devirutalization code we always walk through aliases and we need
5925 context to be preserved too. See PR89335 */
5932 }
5935 /* Operand callback helper for free_lang_data_in_node. *TP is the
5936 subtree operand being considered. */
5938 static tree
5940 {
5947 /* Language specific nodes will be removed, so there is no need
5948 to gather anything under them. */
5950 {
5953 }
5956 {
5957 /* Note that walk_tree does not traverse every possible field in
5958 decls, so we have to do our own traversals here. */
5966 /* We are going to remove everything under DECL_INITIAL for
5967 TYPE_DECLs. No point walking them. */
5975 {
5978 }
5980 {
5985 }
5995 }
5997 {
5998 /* Note that walk_tree does not traverse every possible field in
5999 types, so we have to do our own traversals here. */
6010 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
6011 lists, we may look types up in these lists and use them while
6012 optimizing the function body. Thus we need to free lang data
6013 in them. */
6020 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
6024 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
6025 do not and want not to reach unused variants this way. */
6027 {
6029 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
6030 So push that instead. */
6034 }
6038 {
6040 tree tem;
6045 }
6047 {
6048 tree tem;
6049 /* Push all TYPE_FIELDS - there can be interleaving interesting
6050 and non-interesting things. */
6053 {
6057 }
6058 }
6064 }
6066 {
6068 {
6072 {
6076 }
6077 else
6078 {
6081 }
6082 }
6086 }
6093 }
6096 /* Find decls and types in T. */
6098 static void
6100 {
6102 {
6108 }
6109 }
6111 /* Translate all the types in LIST with the corresponding runtime
6112 types. */
6114 static tree
6116 {
6126 {
6131 }
6134 }
6137 /* Find decls and types referenced in EH region R and store them in
6138 FLD->DECLS and FLD->TYPES. */
6140 static void
6142 {
6144 {
6149 {
6150 eh_catch c;
6152 /* The types referenced in each catch must first be changed to the
6153 EH types used at runtime. This removes references to FE types
6154 in the region. */
6156 {
6159 }
6160 }
6173 }
6174 }
6177 /* Find decls and types referenced in cgraph node N and store them in
6178 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6179 look for *every* kind of DECL and TYPE node reachable from N,
6180 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6181 NAMESPACE_DECLs, etc). */
6183 static void
6185 {
6186 basic_block bb;
6189 tree t;
6200 /* Traverse locals. */
6204 /* Traverse EH regions in FN. */
6205 {
6206 eh_region r;
6209 }
6211 /* Traverse every statement in FN. */
6213 {
6214 gphi_iterator psi;
6215 gimple_stmt_iterator si;
6219 {
6223 {
6226 }
6227 }
6230 {
6237 {
6240 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6241 which we need for asm stmts. */
6247 }
6248 }
6249 }
6250 }
6253 /* Find decls and types referenced in varpool node N and store them in
6254 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6255 look for *every* kind of DECL and TYPE node reachable from N,
6256 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6257 NAMESPACE_DECLs, etc). */
6259 static void
6261 {
6263 }
6265 /* If T needs an assembler name, have one created for it. */
6267 void
6269 {
6271 {
6272 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6273 diagnostics that use input_location to show locus
6274 information. The problem here is that, at this point,
6275 input_location is generally anchored to the end of the file
6276 (since the parser is long gone), so we don't have a good
6277 position to pin it to.
6279 To alleviate this problem, this uses the location of T's
6280 declaration. Examples of this are
6281 testsuite/g++.dg/template/cond2.C and
6282 testsuite/g++.dg/template/pr35240.C. */
6289 }
6290 }
6293 /* Free language specific information for every operand and expression
6294 in every node of the call graph. This process operates in three stages:
6296 1- Every callgraph node and varpool node is traversed looking for
6297 decls and types embedded in them. This is a more exhaustive
6298 search than that done by find_referenced_vars, because it will
6299 also collect individual fields, decls embedded in types, etc.
6301 2- All the decls found are sent to free_lang_data_in_decl.
6303 3- All the types found are sent to free_lang_data_in_type.
6305 The ordering between decls and types is important because
6306 free_lang_data_in_decl sets assembler names, which includes
6307 mangling. So types cannot be freed up until assembler names have
6308 been set up. */
6310 static void
6312 {
6315 tree t;
6319 /* Find decls and types in the body of every function in the callgraph. */
6326 /* Find decls and types in every varpool symbol. */
6330 /* Set the assembler name on every decl found. We need to do this
6331 now because free_lang_data_in_decl will invalidate data needed
6332 for mangling. This breaks mangling on interdependent decls. */
6336 /* Traverse every decl found freeing its language data. */
6340 /* Traverse every type found freeing its language data. */
6343 }
6346 /* Free resources that are used by FE but are not needed once they are done. */
6348 static unsigned
6350 {
6354 /* If we are the LTO frontend we have freed lang-specific data already. */
6357 {
6358 /* Rebuild type inheritance graph even when not doing LTO to get
6359 consistent profile data. */
6362 }
6367 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6371 /* Allocate and assign alias sets to the standard integer types
6372 while the slots are still in the way the frontends generated them. */
6377 /* Traverse the IL resetting language specific information for
6378 operands, expressions, etc. */
6381 /* Create gimple variants for common types. */
6387 /* Reset some langhooks. Do not reset types_compatible_p, it may
6388 still be used indirectly via the get_alias_set langhook. */
6401 {
6403 tree t;
6407 }
6409 /* We do not want the default decl_assembler_name implementation,
6410 rather if we have fixed everything we want a wrapper around it
6411 asserting that all non-local symbols already got their assembler
6412 name and only produce assembler names for local symbols. Or rather
6413 make sure we never call decl_assembler_name on local symbols and
6414 devise a separate, middle-end private scheme for it. */
6416 /* Reset diagnostic machinery. */
6425 }
6431 {
6441 };
6444 {
6448 {}
6450 /* opt_pass methods: */
6457 simple_ipa_opt_pass *
6459 {
6461 }
6462 \f
6463 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6464 of the various TYPE_QUAL values. */
6466 static void
6468 {
6474 }
6476 /* Returns true iff CAND and BASE have equivalent language-specific
6477 qualifiers. */
6479 bool
6481 {
6484 /* type_hash_eq currently only applies to these types. */
6489 }
6491 /* This function checks to see if TYPE matches the size one of the built-in
6492 atomic types, and returns that core atomic type. */
6494 static tree
6496 {
6497 tree base_atomic_type;
6499 /* Only handle complete types. */
6504 {
6527 }
6530 }
6532 /* Returns true iff unqualified CAND and BASE are equivalent. */
6534 bool
6536 {
6538 /* Apparently this is needed for Objective-C. */
6543 /* Check alignment. */
6546 /* Atomic types increase minimal alignment. We must to do so as well
6547 or we get duplicated canonical types. See PR88686. */
6549 {
6550 /* See if this object can map to a basic atomic type. */
6554 }
6556 }
6558 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6560 bool
6562 {
6566 }
6568 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6570 static bool
6572 {
6575 /* Apparently this is needed for Objective-C. */
6577 /* Check alignment. */
6582 }
6584 /* Return a version of the TYPE, qualified as indicated by the
6585 TYPE_QUALS, if one exists. If no qualified version exists yet,
6586 return NULL_TREE. */
6588 tree
6590 {
6598 /* Search the chain of variants to see if there is already one there just
6599 like the one we need to have. If so, use that existing one. We must
6600 preserve the TYPE_NAME, since there is code that depends on this. */
6603 {
6604 /* Put the found variant at the head of the variant list so
6605 frequently searched variants get found faster. The C++ FE
6606 benefits greatly from this. */
6612 }
6615 }
6617 /* Like get_qualified_type, but creates the type if it does not
6618 exist. This function never returns NULL_TREE. */
6620 tree
6622 {
6623 tree t;
6625 /* See if we already have the appropriate qualified variant. */
6628 /* If not, build it. */
6630 {
6635 {
6636 /* See if this object can map to a basic atomic type. */
6639 {
6640 /* Ensure the alignment of this type is compatible with
6641 the required alignment of the atomic type. */
6644 }
6645 }
6648 /* Propagate structural equality. */
6651 /* Build the underlying canonical type, since it is different
6652 from TYPE. */
6653 {
6656 }
6657 else
6658 /* T is its own canonical type. */
6661 }
6664 }
6666 /* Create a variant of type T with alignment ALIGN. */
6668 tree
6670 {
6671 tree t;
6686 }
6688 /* Create a new distinct copy of TYPE. The new type is made its own
6689 MAIN_VARIANT. If TYPE requires structural equality checks, the
6690 resulting type requires structural equality checks; otherwise, its
6691 TYPE_CANONICAL points to itself. */
6693 tree
6695 {
6701 /* Set the canonical type either to a new equivalence class, or
6702 propagate the need for structural equality checks. */
6705 else
6708 /* Make it its own variant. */
6712 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6713 whose TREE_TYPE is not t. This can also happen in the Ada
6714 frontend when using subtypes. */
6717 }
6719 /* Create a new variant of TYPE, equivalent but distinct. This is so
6720 the caller can modify it. TYPE_CANONICAL for the return type will
6721 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6722 are considered equal by the language itself (or that both types
6723 require structural equality checks). */
6725 tree
6727 {
6732 /* Since we're building a variant, assume that it is a non-semantic
6733 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6735 /* Type variants have no alias set defined. */
6738 /* Add the new type to the chain of variants of TYPE. */
6744 }
6745 \f
6746 /* Return true if the from tree in both tree maps are equal. */
6748 int
6750 {
6754 }
6756 /* Hash a from tree in a tree_base_map. */
6758 unsigned int
6760 {
6762 }
6764 /* Return true if this tree map structure is marked for garbage collection
6765 purposes. We simply return true if the from tree is marked, so that this
6766 structure goes away when the from tree goes away. */
6768 int
6770 {
6772 }
6774 /* Hash a from tree in a tree_map. */
6776 unsigned int
6778 {
6780 }
6782 /* Hash a from tree in a tree_decl_map. */
6784 unsigned int
6786 {
6788 }
6790 /* Return the initialization priority for DECL. */
6792 priority_type
6794 {
6799 return
6801 }
6803 /* Return the finalization priority for DECL. */
6805 priority_type
6807 {
6812 return
6814 }
6816 /* Set the initialization priority for DECL to PRIORITY. */
6818 void
6820 {
6824 {
6828 }
6831 else
6834 }
6836 /* Set the finalization priority for DECL to PRIORITY. */
6838 void
6840 {
6844 {
6848 }
6849 else
6852 }
6854 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6856 static void
6858 {
6863 }
6865 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6867 static void
6869 {
6874 }
6876 /* Lookup a debug expression for FROM, and return it if we find one. */
6878 tree
6880 {
6888 }
6890 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6892 void
6894 {
6901 }
6903 /* Lookup a value expression for FROM, and return it if we find one. */
6905 tree
6907 {
6915 }
6917 /* Insert a mapping FROM->TO in the value expression hashtable. */
6919 void
6921 {
6928 }
6930 /* Lookup a vector of debug arguments for FROM, and return it if we
6931 find one. */
6935 {
6946 }
6948 /* Insert a mapping FROM->empty vector of debug arguments in the value
6949 expression hashtable. */
6953 {
6968 }
6970 /* Hashing of types so that we don't make duplicates.
6971 The entry point is `type_hash_canon'. */
6973 /* Generate the default hash code for TYPE. This is designed for
6974 speed, rather than maximum entropy. */
6976 hashval_t
6978 {
6987 /* Just the identifier is adequate to distinguish. */
6991 {
6994 /* FALLTHROUGH. */
7006 {
7010 {
7013 }
7014 }
7018 {
7025 }
7029 {
7033 }
7041 }
7044 }
7046 /* These are the Hashtable callback functions. */
7048 /* Returns true iff the types are equivalent. */
7050 bool
7052 {
7053 /* First test the things that are the same for all types. */
7063 /* Be careful about comparing arrays before and after the element type
7064 has been completed; don't compare TYPE_ALIGN unless both types are
7065 complete. */
7072 {
7094 /* fall through */
7126 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7127 where the flag should be inherited from the element type
7128 and can change after ARRAY_TYPEs are created; on non-aggregates
7129 compare it and hash it, scalars will never have that flag set
7130 and we need to differentiate between arrays created by different
7131 front-ends or middle-end created arrays. */
7161 }
7167 }
7169 /* Given TYPE, and HASHCODE its hash code, return the canonical
7170 object for an identical type if one already exists.
7171 Otherwise, return TYPE, and record it as the canonical object.
7173 To use this function, first create a type of the sort you want.
7174 Then compute its hash code from the fields of the type that
7175 make it different from other similar types.
7176 Then call this function and use the value. */
7178 tree
7180 {
7181 type_hash in;
7184 /* The hash table only contains main variants, so ensure that's what we're
7185 being passed. */
7188 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7189 must call that routine before comparing TYPE_ALIGNs. */
7197 {
7203 /* Free also min/max values and the cache for integer
7204 types. This can't be done in free_node, as LTO frees
7205 those on its own. */
7207 {
7210 {
7211 /* Zero is always in TYPE_CACHED_VALUES. */
7215 }
7218 {
7221 }
7224 }
7227 }
7228 else
7229 {
7238 }
7239 }
7241 static void
7243 {
7248 }
7250 /* Given two lists of types
7251 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7252 return 1 if the lists contain the same types in the same order.
7253 Also, the TREE_PURPOSEs must match. */
7255 bool
7257 {
7269 }
7271 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7272 given by TYPE. If the argument list accepts variable arguments,
7273 then this function counts only the ordinary arguments. */
7275 int
7277 {
7281 /* If the function does not take a variable number of arguments,
7282 the last element in the list will have type `void'. */
7285 else
7289 }
7291 /* Return the type of the function TYPE's argument ARGNO if known.
7292 For vararg function's where ARGNO refers to one of the variadic
7293 arguments return null. Otherwise, return a void_type_node for
7294 out-of-bounds ARGNO. */
7296 tree
7298 {
7299 /* Treat zero the same as an out-of-bounds argument number. */
7303 function_args_iterator iter;
7305 tree argtype;
7308 {
7309 /* A vararg function's argument list ends in a null. Otherwise,
7310 an ordinary function's argument list ends with void. Return
7311 null if ARGNO refers to a vararg argument, void_type_node if
7312 it's out of bounds, and the formal argument type otherwise. */
7320 }
7323 }
7325 /* Nonzero if integer constants T1 and T2
7326 represent the same constant value. */
7328 int
7330 {
7346 }
7348 /* Return true if T is an INTEGER_CST whose numerical value (extended
7349 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7351 bool
7353 {
7357 }
7359 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7360 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7362 bool
7364 {
7368 {
7373 }
7376 }
7378 /* Return true if T is an INTEGER_CST whose numerical value (extended
7379 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7381 bool
7383 {
7387 }
7389 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7390 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7392 bool
7394 {
7398 {
7403 }
7406 }
7408 /* T is an INTEGER_CST whose numerical value (extended according to
7409 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7410 HOST_WIDE_INT. */
7412 HOST_WIDE_INT
7414 {
7417 }
7419 /* T is an INTEGER_CST whose numerical value (extended according to
7420 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7421 HOST_WIDE_INT. */
7423 unsigned HOST_WIDE_INT
7425 {
7428 }
7430 /* Return the most significant (sign) bit of T. */
7432 int
7434 {
7438 }
7440 /* Return an indication of the sign of the integer constant T.
7441 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7442 Note that -1 will never be returned if T's type is unsigned. */
7444 int
7446 {
7453 else
7455 }
7457 /* Return the minimum number of bits needed to represent VALUE in a
7458 signed or unsigned type, UNSIGNEDP says which. */
7460 unsigned int
7462 {
7463 /* If the value is negative, compute its negative minus 1. The latter
7464 adjustment is because the absolute value of the largest negative value
7465 is one larger than the largest positive value. This is equivalent to
7466 a bit-wise negation, so use that operation instead. */
7471 /* Return the number of bits needed, taking into account the fact
7472 that we need one more bit for a signed than unsigned type.
7473 If value is 0 or -1, the minimum precision is 1 no matter
7474 whether unsignedp is true or false. */
7478 else
7480 }
7482 /* Return truthvalue of whether T1 is the same tree structure as T2.
7483 Return 1 if they are the same.
7484 Return 0 if they are understandably different.
7485 Return -1 if either contains tree structure not understood by
7486 this function. */
7488 int
7490 {
7500 /* For location wrappers to be the same, they must be at the same
7501 source location (and wrap the same thing). */
7503 {
7507 }
7513 {
7517 else
7519 }
7529 {
7545 {
7554 /* ??? Should we handle also fields here? */
7558 }
7569 {
7577 {
7581 }
7583 }
7586 /* Special case: if either target is an unallocated VAR_DECL,
7587 it means that it's going to be unified with whatever the
7588 TARGET_EXPR is really supposed to initialize, so treat it
7589 as being equivalent to anything. */
7597 else
7626 /* A false return means maybe_ne rather than known_ne. */
7632 }
7634 /* This general rule works for most tree codes. All exceptions should be
7635 handled above. If this is a language-specific tree code, we can't
7636 trust what might be in the operand, so say we don't know
7637 the situation. */
7642 {
7651 {
7655 }
7661 }
7662 }
7664 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7665 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7666 than U, respectively. */
7668 int
7670 {
7679 else
7681 }
7683 /* Return true if SIZE represents a constant size that is in bounds of
7684 what the middle-end and the backend accepts (covering not more than
7685 half of the address-space).
7686 When PERR is non-null, set *PERR on failure to the description of
7687 why SIZE is not valid. */
7689 bool
7691 {
7693 {
7700 }
7702 cst_size_error error;
7707 {
7710 }
7713 {
7716 }
7719 {
7722 }
7726 {
7729 }
7732 }
7734 /* Return the precision of the type, or for a complex or vector type the
7735 precision of the type of its elements. */
7737 unsigned int
7739 {
7747 }
7749 /* Return true if CODE represents an associative tree code. Otherwise
7750 return false. */
7751 bool
7753 {
7755 {
7767 }
7769 }
7771 /* Return true if CODE represents a commutative tree code. Otherwise
7772 return false. */
7773 bool
7775 {
7777 {
7804 }
7806 }
7808 /* Return true if CODE represents a ternary tree code for which the
7809 first two operands are commutative. Otherwise return false. */
7810 bool
7812 {
7814 {
7822 }
7824 }
7826 /* Returns true if CODE can overflow. */
7828 bool
7830 {
7832 {
7837 /* Can overflow in various ways. */
7843 /* For INT_MIN / -1. */
7847 /* For -INT_MIN. */
7850 /* These operators cannot overflow. */
7852 }
7853 }
7855 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7856 ftrapv doesn't generate trapping insns for CODE. */
7858 bool
7860 {
7863 /* We don't generate instructions that trap on overflow for complex or vector
7864 types. */
7872 {
7878 /* These operators can overflow, and -ftrapv generates trapping code for
7879 these. */
7886 /* These operators can overflow, but -ftrapv does not generate trapping
7887 code for these. */
7890 /* These operators cannot overflow. */
7892 }
7893 }
7895 /* Constructors for pointer, array and function types.
7896 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7897 constructed by language-dependent code, not here.) */
7899 /* Construct, lay out and return the type of pointers to TO_TYPE with
7900 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7901 reference all of memory. If such a type has already been
7902 constructed, reuse it. */
7904 tree
7907 {
7908 tree t;
7914 /* If the pointed-to type has the may_alias attribute set, force
7915 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7919 /* In some cases, languages will have things that aren't a POINTER_TYPE
7920 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7921 In that case, return that type without regard to the rest of our
7922 operands.
7924 ??? This is a kludge, but consistent with the way this function has
7925 always operated and there doesn't seem to be a good way to avoid this
7926 at the moment. */
7931 /* First, if we already have a type for pointers to TO_TYPE and it's
7932 the proper mode, use it. */
7945 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7953 /* Lay out the type. This function has many callers that are concerned
7954 with expression-construction, and this simplifies them all. */
7958 }
7960 /* By default build pointers in ptr_mode. */
7962 tree
7964 {
7969 }
7971 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7973 tree
7976 {
7977 tree t;
7983 /* If the pointed-to type has the may_alias attribute set, force
7984 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7988 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7989 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7990 In that case, return that type without regard to the rest of our
7991 operands.
7993 ??? This is a kludge, but consistent with the way this function has
7994 always operated and there doesn't seem to be a good way to avoid this
7995 at the moment. */
8000 /* First, if we already have a type for pointers to TO_TYPE and it's
8001 the proper mode, use it. */
8014 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8025 }
8028 /* Build the node for the type of references-to-TO_TYPE by default
8029 in ptr_mode. */
8031 tree
8033 {
8038 }
8040 #define MAX_INT_CACHED_PREC \
8041 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8044 /* Builds a signed or unsigned integer type of precision PRECISION.
8045 Used for C bitfields whose precision does not match that of
8046 built-in target types. */
8047 tree
8050 {
8057 {
8061 }
8068 else
8078 }
8080 #define MAX_BOOL_CACHED_PREC \
8081 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8084 /* Builds a boolean type of precision PRECISION.
8085 Used for boolean vectors to choose proper vector element size. */
8086 tree
8088 {
8089 tree type;
8092 {
8096 }
8106 }
8108 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8109 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8110 is true, reuse such a type that has already been constructed. */
8112 static tree
8114 {
8137 {
8138 /* Since we cannot reliably merge this type, we need to compare it using
8139 structural equality checks. */
8142 }
8148 }
8150 /* Wrapper around build_range_type_1 with SHARED set to true. */
8152 tree
8154 {
8156 }
8158 /* Wrapper around build_range_type_1 with SHARED set to false. */
8160 tree
8162 {
8164 }
8166 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8167 MAXVAL should be the maximum value in the domain
8168 (one less than the length of the array).
8170 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8171 We don't enforce this limit, that is up to caller (e.g. language front end).
8172 The limit exists because the result is a signed type and we don't handle
8173 sizes that use more than one HOST_WIDE_INT. */
8175 tree
8177 {
8179 }
8181 /* Return true if the debug information for TYPE, a subtype, should be emitted
8182 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8183 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8184 debug info and doesn't reflect the source code. */
8186 bool
8188 {
8191 /* Subrange types have a base type which is an integral type. */
8195 /* Get the real bounds of the subtype. */
8198 else
8199 {
8202 }
8204 /* If the type and its base type have the same representation and the same
8205 name, then the type is not a subrange but a copy of the base type. */
8219 }
8221 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8222 and number of elements specified by the range of values of INDEX_TYPE.
8223 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8224 If SHARED is true, reuse such a type that has already been constructed.
8225 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8227 static tree
8230 {
8231 tree t;
8234 {
8237 }
8247 {
8250 }
8253 {
8262 index_type
8265 }
8268 }
8270 /* Wrapper around build_array_type_1 with SHARED set to true. */
8272 tree
8274 {
8275 return
8277 }
8279 /* Wrapper around build_array_type_1 with SHARED set to false. */
8281 tree
8283 {
8285 }
8287 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8288 sizetype. */
8290 tree
8292 {
8294 }
8296 /* Recursively examines the array elements of TYPE, until a non-array
8297 element type is found. */
8299 tree
8301 {
8306 }
8308 /* Computes the canonical argument types from the argument type list
8309 ARGTYPES.
8311 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8312 on entry to this function, or if any of the ARGTYPES are
8313 structural.
8315 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8316 true on entry to this function, or if any of the ARGTYPES are
8317 non-canonical.
8319 Returns a canonical argument list, which may be ARGTYPES when the
8320 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8321 true) or would not differ from ARGTYPES. */
8323 static tree
8327 {
8328 tree arg;
8332 {
8334 /* Fail gracefully by stating that the type is structural. */
8340 /* If the argument has a default argument, we consider it
8341 non-canonical even though the type itself is canonical.
8342 That way, different variants of function and method types
8343 with default arguments will all point to the variant with
8344 no defaults as their canonical type. */
8346 }
8352 {
8353 /* Build the canonical list of argument types. */
8358 {
8361 else
8364 canon_argtypes);
8365 }
8371 /* There is a non-canonical type. */
8374 }
8376 /* The canonical argument types are the same as ARGTYPES. */
8378 }
8380 /* Construct, lay out and return
8381 the type of functions returning type VALUE_TYPE
8382 given arguments of types ARG_TYPES.
8383 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8384 are data type nodes for the arguments of the function.
8385 If such a type has already been constructed, reuse it. */
8387 tree
8389 {
8390 tree t;
8393 tree canon_argtypes;
8398 {
8401 }
8403 /* Make a node of the sort we want. */
8408 /* If we already have such a type, use the old one. */
8412 /* Set up the canonical type. */
8422 canon_argtypes);
8427 }
8429 /* Build a function type. The RETURN_TYPE is the type returned by the
8430 function. If VAARGS is set, no void_type_node is appended to the
8431 list. ARGP must be always be terminated be a NULL_TREE. */
8433 static tree
8435 {
8443 {
8448 }
8451 else
8452 {
8456 }
8460 }
8462 /* Build a function type. The RETURN_TYPE is the type returned by the
8463 function. If additional arguments are provided, they are
8464 additional argument types. The list of argument types must always
8465 be terminated by NULL_TREE. */
8467 tree
8469 {
8470 tree args;
8477 }
8479 /* Build a variable argument function type. The RETURN_TYPE is the
8480 type returned by the function. If additional arguments are provided,
8481 they are additional argument types. The list of argument types must
8482 always be terminated by NULL_TREE. */
8484 tree
8486 {
8487 tree args;
8495 }
8497 /* Build a function type. RETURN_TYPE is the type returned by the
8498 function; VAARGS indicates whether the function takes varargs. The
8499 function takes N named arguments, the types of which are provided in
8500 ARG_TYPES. */
8502 static tree
8505 {
8513 }
8515 /* Build a function type. RETURN_TYPE is the type returned by the
8516 function. The function takes N named arguments, the types of which
8517 are provided in ARG_TYPES. */
8519 tree
8521 {
8523 }
8525 /* Build a variable argument function type. RETURN_TYPE is the type
8526 returned by the function. The function takes N named arguments, the
8527 types of which are provided in ARG_TYPES. */
8529 tree
8531 {
8533 }
8535 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8536 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8537 for the method. An implicit additional parameter (of type
8538 pointer-to-BASETYPE) is added to the ARGTYPES. */
8540 tree
8542 tree rettype,
8543 tree argtypes)
8544 {
8545 tree t;
8546 tree ptype;
8548 tree canon_argtypes;
8550 /* Make a node of the sort we want. */
8557 /* The actual arglist for this function includes a "hidden" argument
8558 which is "this". Put it into the list of argument types. */
8562 /* If we already have such a type, use the old one. */
8566 /* Set up the canonical type. */
8567 any_structural_p
8570 any_noncanonical_p
8582 canon_argtypes);
8587 }
8589 /* Construct, lay out and return the type of methods belonging to class
8590 BASETYPE and whose arguments and values are described by TYPE.
8591 If that type exists already, reuse it.
8592 TYPE must be a FUNCTION_TYPE node. */
8594 tree
8596 {
8602 }
8604 /* Construct, lay out and return the type of offsets to a value
8605 of type TYPE, within an object of type BASETYPE.
8606 If a suitable offset type exists already, reuse it. */
8608 tree
8610 {
8611 tree t;
8613 /* Make a node of the sort we want. */
8619 /* If we already have such a type, use the old one. */
8627 {
8636 }
8639 }
8641 /* Create a complex type whose components are COMPONENT_TYPE.
8643 If NAMED is true, the type is given a TYPE_NAME. We do not always
8644 do so because this creates a DECL node and thus make the DECL_UIDs
8645 dependent on the type canonicalization hashtable, which is GC-ed,
8646 so the DECL_UIDs would not be stable wrt garbage collection. */
8648 tree
8650 {
8655 /* Make a node of the sort we want. */
8660 /* If we already have such a type, use the old one. */
8665 {
8666 /* We created a new type. The hash insertion will have laid
8667 out the type. We need to check the canonicalization and
8668 maybe set the name. */
8679 /* We need to create a name, since complex is a fundamental type. */
8681 {
8710 }
8711 }
8714 }
8716 /* If TYPE is a real or complex floating-point type and the target
8717 does not directly support arithmetic on TYPE then return the wider
8718 type to be used for arithmetic on TYPE. Otherwise, return
8719 NULL_TREE. */
8721 tree
8723 {
8724 /* The target can give two different responses to the question of
8725 which excess precision mode it would like depending on whether we
8726 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8728 enum excess_precision_type requested_type
8730 ? EXCESS_PRECISION_TYPE_FAST
8733 enum flt_eval_method target_flt_eval_method
8736 /* The target should not ask for unpredictable float evaluation (though
8737 it might advertise that implicitly the evaluation is unpredictable,
8738 but we don't care about that here, it will have been reported
8739 elsewhere). If it does ask for unpredictable evaluation, we have
8740 nothing to do here. */
8743 /* Nothing to do. The target has asked for all types we know about
8744 to be computed with their native precision and range. */
8748 /* The target will promote this type in a target-dependent way, so excess
8749 precision ought to leave it alone. */
8753 machine_mode float16_type_mode = (float16_type_node
8760 {
8762 {
8765 {
8783 }
8785 }
8787 {
8792 {
8810 }
8812 }
8815 }
8818 }
8819 \f
8820 /* Return OP, stripped of any conversions to wider types as much as is safe.
8821 Converting the value back to OP's type makes a value equivalent to OP.
8823 If FOR_TYPE is nonzero, we return a value which, if converted to
8824 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8826 OP must have integer, real or enumeral type. Pointers are not allowed!
8828 There are some cases where the obvious value we could return
8829 would regenerate to OP if converted to OP's type,
8830 but would not extend like OP to wider types.
8831 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8832 For example, if OP is (unsigned short)(signed char)-1,
8833 we avoid returning (signed char)-1 if FOR_TYPE is int,
8834 even though extending that to an unsigned short would regenerate OP,
8835 since the result of extending (signed char)-1 to (int)
8836 is different from (int) OP. */
8838 tree
8840 {
8841 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8843 unsigned final_prec
8845 int uns
8852 {
8855 /* TYPE_PRECISION on vector types has different meaning
8856 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8857 so avoid them here. */
8864 /* Truncations are many-one so cannot be removed.
8865 Unless we are later going to truncate down even farther. */
8870 /* See what's inside this conversion. If we decide to strip it,
8871 we will set WIN. */
8874 /* If we have not stripped any zero-extensions (uns is 0),
8875 we can strip any kind of extension.
8876 If we have previously stripped a zero-extension,
8877 only zero-extensions can safely be stripped.
8878 Any extension can be stripped if the bits it would produce
8879 are all going to be discarded later by truncating to FOR_TYPE. */
8882 {
8885 /* TYPE_UNSIGNED says whether this is a zero-extension.
8886 Let's avoid computing it if it does not affect WIN
8887 and if UNS will not be needed again. */
8891 {
8894 }
8895 }
8896 }
8898 /* If we finally reach a constant see if it fits in sth smaller and
8899 in that case convert it. */
8901 {
8907 {
8911 }
8912 }
8915 }
8916 \f
8917 /* Return OP or a simpler expression for a narrower value
8918 which can be sign-extended or zero-extended to give back OP.
8919 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8920 or 0 if the value should be sign-extended. */
8922 tree
8924 {
8931 {
8932 do
8946 ret);
8948 }
8950 {
8951 int bitschange
8955 /* Truncations are many-one so cannot be removed. */
8959 /* See what's inside this conversion. If we decide to strip it,
8960 we will set WIN. */
8963 {
8965 /* An extension: the outermost one can be stripped,
8966 but remember whether it is zero or sign extension. */
8969 /* Otherwise, if a sign extension has been stripped,
8970 only sign extensions can now be stripped;
8971 if a zero extension has been stripped, only zero-extensions. */
8975 }
8977 {
8978 /* A change in nominal type can always be stripped, but we must
8979 preserve the unsignedness. */
8984 /* Keep trying to narrow, but don't assign op to win if it
8985 would turn an integral type into something else. */
8988 }
8991 }
8994 /* Since type_for_size always gives an integer type. */
8997 /* Ensure field is laid out already. */
9000 {
9001 unsigned HOST_WIDE_INT innerprec
9007 /* We can get this structure field in a narrower type that fits it,
9008 but the resulting extension to its nominal type (a fullword type)
9009 must satisfy the same conditions as for other extensions.
9011 Do this only for fields that are aligned (not bit-fields),
9012 because when bit-field insns will be used there is no
9013 advantage in doing this. */
9019 {
9023 }
9024 }
9028 }
9029 \f
9030 /* Return true if integer constant C has a value that is permissible
9031 for TYPE, an integral type. */
9033 bool
9035 {
9040 /* Non-standard boolean types can have arbitrary precision but various
9041 transformations assume that they can only take values 0 and +/-1. */
9045 retry:
9049 /* If at least one bound of the type is a constant integer, we can check
9050 ourselves and maybe make a decision. If no such decision is possible, but
9051 this type is a subtype, try checking against that. Otherwise, use
9052 fits_to_tree_p, which checks against the precision.
9054 Compute the status for each possibly constant bound, and return if we see
9055 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9056 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9057 for "constant known to fit". */
9059 /* Check if c >= type_low_bound. */
9061 {
9065 }
9066 else
9069 /* Check if c <= type_high_bound. */
9071 {
9075 }
9076 else
9079 /* If the constant fits both bounds, the result is known. */
9083 /* Perform some generic filtering which may allow making a decision
9084 even if the bounds are not constant. First, negative integers
9085 never fit in unsigned types, */
9089 /* Second, narrower types always fit in wider ones. */
9093 /* Third, unsigned integers with top bit set never fit signed types. */
9095 {
9098 {
9099 /* When a tree_cst is converted to a wide-int, the precision
9100 is taken from the type. However, if the precision of the
9101 mode underneath the type is smaller than that, it is
9102 possible that the value will not fit. The test below
9103 fails if any bit is set between the sign bit of the
9104 underlying mode and the top bit of the type. */
9107 }
9110 }
9112 /* If we haven't been able to decide at this point, there nothing more we
9113 can check ourselves here. Look at the base type if we have one and it
9114 has the same precision. */
9118 {
9121 }
9123 /* Or to fits_to_tree_p, if nothing else. */
9125 }
9127 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9128 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9129 represented (assuming two's-complement arithmetic) within the bit
9130 precision of the type are returned instead. */
9132 void
9134 {
9138 else
9139 {
9142 else
9143 {
9146 }
9147 }
9152 else
9153 {
9156 }
9157 }
9159 /* Return true if VAR is an automatic variable. */
9161 bool
9163 {
9168 }
9170 /* Return true if VAR is an automatic variable defined in function FN. */
9172 bool
9174 {
9178 }
9180 /* Subprogram of following function. Called by walk_tree.
9182 Return *TP if it is an automatic variable or parameter of the
9183 function passed in as DATA. */
9185 static tree
9187 {
9198 }
9200 /* Returns true if T is, contains, or refers to a type with variable
9201 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9202 arguments, but not the return type. If FN is nonzero, only return
9203 true if a modifier of the type or position of FN is a variable or
9204 parameter inside FN.
9206 This concept is more general than that of C99 'variably modified types':
9207 in C99, a struct type is never variably modified because a VLA may not
9208 appear as a structure member. However, in GNU C code like:
9210 struct S { int i[f()]; };
9212 is valid, and other languages may define similar constructs. */
9214 bool
9216 {
9217 tree t;
9219 /* Test if T is either variable (if FN is zero) or an expression containing
9220 a variable in FN. If TYPE isn't gimplified, return true also if
9221 gimplify_one_sizepos would gimplify the expression into a local
9222 variable. */
9223 #define RETURN_TRUE_IF_VAR(T) \
9224 do { tree _t = (T); \
9225 if (_t != NULL_TREE \
9226 && _t != error_mark_node \
9227 && !CONSTANT_CLASS_P (_t) \
9228 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9229 && (!fn \
9230 || (!TYPE_SIZES_GIMPLIFIED (type) \
9231 && (TREE_CODE (_t) != VAR_DECL \
9232 && !CONTAINS_PLACEHOLDER_P (_t))) \
9233 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9234 return true; } while (0)
9239 /* If TYPE itself has variable size, it is variably modified. */
9244 {
9248 /* Ada can have pointer types refering to themselves indirectly. */
9253 {
9256 }
9262 /* If TYPE is a function type, it is variably modified if the
9263 return type is variably modified. */
9273 /* Scalar types are variably modified if their end points
9274 aren't constant. */
9282 /* We can't see if any of the fields are variably-modified by the
9283 definition we normally use, since that would produce infinite
9284 recursion via pointers. */
9285 /* This is variably modified if some field's type is. */
9288 {
9293 /* If the type is a qualified union, then the DECL_QUALIFIER
9294 of fields can also be an expression containing a variable. */
9298 /* If the field is a qualified union, then it's only a container
9299 for what's inside so we look into it. That's necessary in LTO
9300 mode because the sizes of the field tested above have been set
9301 to PLACEHOLDER_EXPRs by free_lang_data. */
9305 }
9309 /* Do not call ourselves to avoid infinite recursion. This is
9310 variably modified if the element type is. */
9317 }
9319 /* The current language may have other cases to check, but in general,
9320 all other types are not variably modified. */
9323 #undef RETURN_TRUE_IF_VAR
9324 }
9326 /* Given a DECL or TYPE, return the scope in which it was declared, or
9327 NULL_TREE if there is no containing scope. */
9329 tree
9331 {
9333 }
9335 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9337 const_tree
9339 {
9341 {
9344 else
9346 }
9348 }
9350 /* Return the innermost context enclosing DECL that is
9351 a FUNCTION_DECL, or zero if none. */
9353 tree
9355 {
9356 tree context;
9361 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9362 where we look up the function at runtime. Such functions always take
9363 a first argument of type 'pointer to real context'.
9365 C++ should really be fixed to use DECL_CONTEXT for the real context,
9366 and use something else for the "virtual context". */
9368 context
9369 = TYPE_MAIN_VARIANT
9371 else
9375 {
9378 else
9380 }
9383 }
9385 /* Return the innermost context enclosing DECL that is
9386 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9387 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9389 tree
9391 {
9396 {
9417 }
9420 }
9422 /* CALL is a CALL_EXPR. Return the declaration for the function
9423 called, or NULL_TREE if the called function cannot be
9424 determined. */
9426 tree
9428 {
9429 tree addr;
9434 /* It's invalid to call this function with anything but a
9435 CALL_EXPR. */
9438 /* The first operand to the CALL is the address of the function
9439 called. */
9442 /* If there is no function, return early. */
9448 /* If this is a readonly function pointer, extract its initial value. */
9454 /* If the address is just `&f' for some function `f', then we know
9455 that `f' is being called. */
9460 /* We couldn't figure out what was being called. */
9462 }
9464 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9465 return the associated function code, otherwise return CFN_LAST. */
9467 combined_fn
9469 {
9470 /* It's invalid to call this function with anything but a CALL_EXPR. */
9481 }
9483 /* Comparator of indices based on tree_node_counts. */
9485 static int
9487 {
9492 }
9494 /* Comparator of indices based on tree_code_counts. */
9496 static int
9498 {
9503 }
9505 #define TREE_MEM_USAGE_SPACES 40
9507 /* Print debugging information about tree nodes generated during the compile,
9508 and any language-specific information. */
9510 void
9512 {
9514 {
9520 {
9527 {
9534 }
9539 }
9541 {
9551 {
9556 }
9563 }
9564 }
9565 else
9572 }
9573 \f
9576 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9578 unsigned
9580 {
9581 /* This relies on the raw feedback's top 4 bits being zero. */
9582 #define FEEDBACK(X) ((X) * 0x04c11db7)
9583 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9584 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9586 {
9591 };
9592 #undef FEEDBACK
9593 #undef SYNDROME
9597 {
9601 }
9604 }
9606 /* Generate a crc32 of a string. */
9608 unsigned
9610 {
9611 do
9615 }
9617 /* P is a string that will be used in a symbol. Mask out any characters
9618 that are not valid in that context. */
9620 void
9622 {
9627 #endif
9630 #endif
9631 ))
9633 }
9637 /* Create a unique anonymous identifier. The identifier is still a
9638 valid assembly label. */
9640 tree
9642 {
9644 #if !defined (NO_DOT_IN_LABEL)
9645 "."
9646 #elif !defined (NO_DOLLAR_IN_LABEL)
9647 "$"
9648 #else
9649 "_"
9650 #endif
9661 }
9663 /* Generate a name for a special-purpose function.
9664 The generated name may need to be unique across the whole link.
9665 Changes to this function may also require corresponding changes to
9666 xstrdup_mask_random.
9667 TYPE is some string to identify the purpose of this function to the
9668 linker or collect2; it must start with an uppercase letter,
9669 one of:
9670 I - for constructors
9671 D - for destructors
9672 N - for C++ anonymous namespaces
9673 F - for DWARF unwind frame information. */
9675 tree
9677 {
9682 /* If we already have a name we know to be unique, just use that. */
9685 /* If the target is handling the constructors/destructors, they
9686 will be local to this file and the name is only necessary for
9687 debugging purposes.
9688 We also assign sub_I and sub_D sufixes to constructors called from
9689 the global static constructors. These are always local. */
9693 {
9697 /* Just use the file's basename, because the full pathname
9698 might be quite long. */
9700 }
9701 else
9702 {
9703 /* Otherwise, the name must be unique across the entire link.
9704 We don't have anything that we know to be unique to this translation
9705 unit, so use what we do have and throw in some randomness. */
9723 }
9729 /* Set up the name of the file-level functions we may need.
9730 Use a global object (which is already required to be unique over
9731 the program) rather than the file name (which imposes extra
9732 constraints). */
9736 }
9737 \f
9738 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9740 /* Complain that the tree code of NODE does not match the expected 0
9741 terminated list of trailing codes. The trailing code list can be
9742 empty, for a more vague error message. FILE, LINE, and FUNCTION
9743 are of the caller. */
9745 void
9748 {
9759 {
9766 {
9773 }
9775 }
9776 else
9782 }
9784 /* Complain that the tree code of NODE does match the expected 0
9785 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9786 the caller. */
9788 void
9791 {
9805 {
9807 {
9810 }
9813 }
9819 }
9821 /* Similar to tree_check_failed, except that we check for a class of tree
9822 code, given in CL. */
9824 void
9827 {
9828 internal_error
9833 }
9835 /* Similar to tree_check_failed, except that instead of specifying a
9836 dozen codes, use the knowledge that they're all sequential. */
9838 void
9842 {
9855 {
9862 }
9867 }
9870 /* Similar to tree_check_failed, except that we check that a tree does
9871 not have the specified code, given in CL. */
9873 void
9876 {
9877 internal_error
9882 }
9885 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9887 void
9890 {
9896 }
9899 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9901 void
9905 {
9918 {
9925 }
9930 }
9933 #undef DEFTREESTRUCT
9934 #define DEFTREESTRUCT(VAL, NAME) NAME,
9938 };
9939 #undef DEFTREESTRUCT
9941 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9943 /* Similar to tree_class_check_failed, except that we check for
9944 whether CODE contains the tree structure identified by EN. */
9946 void
9951 {
9952 internal_error
9956 }
9959 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9960 (dynamically sized) vector. */
9962 void
9965 {
9966 internal_error
9970 }
9972 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9973 (dynamically sized) vector. */
9975 void
9978 {
9979 internal_error
9982 }
9984 /* Similar to above, except that the check is for the bounds of the operand
9985 vector of an expression node EXP. */
9987 void
9990 {
9992 internal_error
9996 }
9998 /* Similar to above, except that the check is for the number of
9999 operands of an OMP_CLAUSE node. */
10001 void
10004 {
10005 internal_error
10010 }
10012 \f
10013 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10014 and mapped to the machine mode MODE. Initialize its fields and build
10015 the information necessary for debugging output. */
10017 static tree
10019 {
10020 tree t;
10041 /* We have built a main variant, based on the main variant of the
10042 inner type. Use it to build the variant we return. */
10050 }
10052 static tree
10054 {
10077 else
10079 }
10081 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10083 static tree
10085 {
10087 {
10099 }
10100 else
10101 {
10113 }
10116 }
10118 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10120 static tree
10122 {
10124 {
10136 }
10137 else
10138 {
10150 }
10153 }
10156 /* Create an atomic variant node for TYPE. This routine is called
10157 during initialization of data types to create the 5 basic atomic
10158 types. The generic build_variant_type function requires these to
10159 already be set up in order to function properly, so cannot be
10160 called from there. If ALIGN is non-zero, then ensure alignment is
10161 overridden to this value. */
10163 static tree
10165 {
10166 tree t;
10168 /* Make sure its not already registered. */
10179 }
10181 /* Information about the _FloatN and _FloatNx types. This must be in
10182 the same order as the corresponding TI_* enum values. */
10184 {
10192 };
10195 /* Create nodes for all integer types (and error_mark_node) using the sizes
10196 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10198 void
10200 {
10208 /* Define both `signed char' and `unsigned char'. */
10214 /* Define `char', which is like either `signed char' or `unsigned char'
10215 but not the same as either. */
10216 char_type_node
10217 = (signed_char
10232 {
10237 {
10240 }
10241 }
10243 /* Define a boolean type. This type only represents boolean values but
10244 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10250 /* Define what type to use for size_t. */
10259 else
10260 {
10266 {
10273 {
10275 }
10276 }
10279 }
10281 /* Define what type to use for ptrdiff_t. */
10290 else
10291 {
10295 {
10303 }
10306 }
10308 /* Fill in the rest of the sized types. Reuse existing type nodes
10309 when possible. */
10322 /* Don't call build_qualified type for atomics. That routine does
10323 special processing for atomics, and until they are initialized
10324 it's better not to make that call.
10326 Check to see if there is a target override for atomic types. */
10343 /* Define these next since types below may used them. */
10361 /* We are not going to have real types in C with less than byte alignment,
10362 so we might as well not have any types that claim to have it. */
10373 const_ptr_type_node
10395 {
10398 scalar_float_mode mode;
10402 /* Work around the rs6000 KFmode having precision 113 not
10403 128. */
10415 }
10422 /* Fixed size integer types. */
10429 /* Decimal float types. */
10431 {
10446 }
10455 {
10459 }
10461 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10462 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10463 sat_ ## KIND ## _type_node = \
10464 make_sat_signed_ ## KIND ## _type (SIZE); \
10465 sat_unsigned_ ## KIND ## _type_node = \
10466 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10467 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10468 unsigned_ ## KIND ## _type_node = \
10469 make_unsigned_ ## KIND ## _type (SIZE);
10471 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10472 sat_ ## WIDTH ## KIND ## _type_node = \
10473 make_sat_signed_ ## KIND ## _type (SIZE); \
10474 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10475 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10476 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10477 unsigned_ ## WIDTH ## KIND ## _type_node = \
10478 make_unsigned_ ## KIND ## _type (SIZE);
10480 /* Make fixed-point type nodes based on four different widths. */
10481 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10482 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10483 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10484 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10485 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10487 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10488 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10489 NAME ## _type_node = \
10490 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10491 u ## NAME ## _type_node = \
10492 make_or_reuse_unsigned_ ## KIND ## _type \
10493 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10494 sat_ ## NAME ## _type_node = \
10495 make_or_reuse_sat_signed_ ## KIND ## _type \
10496 (GET_MODE_BITSIZE (MODE ## mode)); \
10497 sat_u ## NAME ## _type_node = \
10498 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10499 (GET_MODE_BITSIZE (U ## MODE ## mode));
10501 /* Fixed-point type and mode nodes. */
10514 {
10517 /* Many back-ends define record types without setting TYPE_NAME.
10518 If we copied the record type here, we'd keep the original
10519 record type without a name. This breaks name mangling. So,
10520 don't copy record types and let c_common_nodes_and_builtins()
10521 declare the type to be __builtin_va_list. */
10526 }
10528 /* SCEV analyzer global shared trees. */
10533 }
10535 /* Modify DECL for given flags.
10536 TM_PURE attribute is set only on types, so the function will modify
10537 DECL's type when ECF_TM_PURE is used. */
10539 void
10541 {
10571 /* Looping const or pure is implied by noreturn.
10572 There is currently no way to declare looping const or looping pure alone. */
10575 }
10578 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10580 static void
10583 {
10584 tree decl;
10591 }
10593 /* Call this function after instantiating all builtins that the language
10594 front end cares about. This will build the rest of the builtins
10595 and internal functions that are relied upon by the tree optimizers and
10596 the middle-end. */
10598 void
10600 {
10606 {
10610 BUILT_IN_UNREACHABLE,
10618 }
10622 {
10633 }
10636 {
10639 NULL_TREE);
10642 }
10645 {
10651 }
10653 /* If we're checking the stack, `alloca' can throw. */
10654 const int alloca_flags
10658 {
10663 }
10668 BUILT_IN_ALLOCA_WITH_ALIGN,
10670 alloca_flags);
10675 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10677 alloca_flags);
10683 BUILT_IN_INIT_TRAMPOLINE,
10686 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10690 BUILT_IN_INIT_DESCRIPTOR,
10695 BUILT_IN_ADJUST_TRAMPOLINE,
10699 BUILT_IN_ADJUST_DESCRIPTOR,
10706 BUILT_IN_NONLOCAL_GOTO,
10713 BUILT_IN_SETJMP_SETUP,
10718 BUILT_IN_SETJMP_RECEIVER,
10727 BUILT_IN_STACK_RESTORE,
10732 NULL_TREE);
10745 /* If there's a possibility that we might use the ARM EABI, build the
10746 alternate __cxa_end_cleanup node used to resume from C++. */
10748 {
10751 BUILT_IN_CXA_END_CLEANUP,
10753 }
10757 BUILT_IN_UNWIND_RESUME,
10761 ECF_NORETURN);
10764 {
10766 NULL_TREE);
10768 BUILT_IN_RETURN_ADDRESS,
10770 ECF_NOTHROW);
10771 }
10775 {
10780 BUILT_IN_PROFILE_FUNC_ENTER,
10784 BUILT_IN_PROFILE_FUNC_EXIT,
10786 }
10788 /* The exception object and filter values from the runtime. The argument
10789 must be zero before exception lowering, i.e. from the front end. After
10790 exception lowering, it will be the region number for the exception
10791 landing pad. These functions are PURE instead of CONST to prevent
10792 them from being hoisted past the exception edge that will initialize
10793 its value in the landing pad. */
10797 /* Only use TM_PURE if we have TM language support. */
10810 NULL_TREE);
10812 BUILT_IN_EH_COPY_VALUES,
10815 /* Complex multiplication and division. These are handled as builtins
10816 rather than optabs because emit_library_call_value doesn't support
10817 complex. Further, we can do slightly better with folding these
10818 beasties if the real and complex parts of the arguments are separate. */
10819 {
10823 {
10850 /* For -ftrapping-math these should throw from a former
10851 -fnon-call-exception stmt. */
10853 NULL);
10859 NULL);
10863 }
10864 }
10867 }
10869 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10870 better way.
10872 If we requested a pointer to a vector, build up the pointers that
10873 we stripped off while looking for the inner type. Similarly for
10874 return values from functions.
10876 The argument TYPE is the top of the chain, and BOTTOM is the
10877 new type which we will point to. */
10879 tree
10881 {
10885 {
10889 }
10891 {
10895 }
10897 {
10900 }
10902 {
10905 }
10907 {
10909 /* The build_method_type_directly() routine prepends 'this' to argument list,
10910 so we must compensate by getting rid of it. */
10911 outer
10912 = build_method_type_directly
10914 inner,
10916 }
10918 {
10921 }
10922 else
10927 }
10929 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10930 the inner type. */
10931 tree
10933 {
10934 poly_int64 nunits;
10938 {
10950 /* Check that there are no leftover bits. */
10958 }
10961 }
10963 /* Similarly, but takes the inner type and number of units, which must be
10964 a power of two. */
10966 tree
10968 {
10970 }
10972 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10974 tree
10976 {
10981 {
10984 }
10985 else
10991 }
10993 /* Build a vector type that holds one boolean result for each element of
10994 vector type VECTYPE. The public interface for this operation is
10995 truth_type_for. */
10997 static tree
10999 {
11003 machine_mode mask_mode;
11013 }
11015 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
11016 set. */
11018 tree
11020 {
11022 tree cand;
11023 /* We always build the non-opaque variant before the opaque one,
11024 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11030 /* Othewise build a variant type and make sure to queue it after
11031 the non-opaque type. */
11039 }
11041 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11043 wide_int
11045 {
11046 /* First handle elements that are directly encoded. */
11051 /* Identify the pattern that contains element I and work out the index of
11052 the last encoded element for that pattern. */
11058 /* If there are no steps, the final encoded value is the right one. */
11062 /* Otherwise work out the value from the last two encoded elements. */
11067 }
11069 /* Return the value of element I of VECTOR_CST T. */
11071 tree
11073 {
11074 /* First handle elements that are directly encoded. */
11079 /* If there are no steps, the final encoded value is the right one. */
11081 {
11082 /* Identify the pattern that contains element I and work out the index of
11083 the last encoded element for that pattern. */
11088 }
11090 /* Otherwise work out the value from the last two encoded elements. */
11093 }
11095 /* Given an initializer INIT, return TRUE if INIT is zero or some
11096 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11097 null, set *NONZERO if and only if INIT is known not to be all
11098 zeros. The combination of return value of false and *NONZERO
11099 false implies that INIT may but need not be all zeros. Other
11100 combinations indicate definitive answers. */
11102 bool
11104 {
11109 /* Conservatively clear NONZERO and set it only if INIT is definitely
11110 not all zero. */
11118 {
11127 /* ??? Note that this is not correct for C4X float formats. There,
11128 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11129 negative exponent. */
11164 {
11169 tree elt;
11176 }
11179 {
11194 }
11195 /* Fall through. */
11198 {
11206 /* We need to loop through all elements to handle cases like
11207 "\0" and "\0foobar". */
11210 {
11213 }
11216 }
11220 }
11221 }
11223 /* Return true if EXPR is an initializer expression in which every element
11224 is a constant that is numerically equal to 0 or 1. The elements do not
11225 need to be equal to each other. */
11227 bool
11229 {
11233 {
11241 {
11248 {
11252 }
11255 }
11259 }
11260 }
11262 /* Check if vector VEC consists of all the equal elements and
11263 that the number of elements corresponds to the type of VEC.
11264 The function returns first element of the vector
11265 or NULL_TREE if the vector is not uniform. */
11266 tree
11268 {
11281 {
11285 }
11289 {
11293 {
11295 {
11298 }
11301 }
11306 }
11309 }
11311 /* If the argument is INTEGER_CST, return it. If the argument is vector
11312 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11313 return NULL_TREE.
11314 Look through location wrappers. */
11316 tree
11318 {
11325 {
11329 }
11332 }
11334 /* If VECTOR_CST T has a single nonzero element, return the index of that
11335 element, otherwise return -1. */
11337 int
11339 {
11345 {
11348 }
11349 else
11354 {
11357 {
11361 }
11362 }
11364 }
11366 /* Build an empty statement at location LOC. */
11368 tree
11370 {
11374 }
11377 /* Build an OpenMP clause with code CODE. LOC is the location of the
11378 clause. */
11380 tree
11382 {
11383 tree t;
11398 }
11400 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11401 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11402 Except for the CODE and operand count field, other storage for the
11403 object is initialized to zeros. */
11405 tree
11407 {
11408 tree t;
11420 /* Can't use TREE_OPERAND to store the length because if checking is
11421 enabled, it will try to check the length before we store it. :-P */
11425 }
11427 /* Helper function for build_call_* functions; build a CALL_EXPR with
11428 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11429 the argument slots. */
11431 static tree
11433 {
11434 tree t;
11442 }
11444 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11445 FN and a null static chain slot. NARGS is the number of call arguments
11446 which are specified as "..." arguments. */
11448 tree
11450 {
11451 tree ret;
11457 }
11459 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11460 FN and a null static chain slot. NARGS is the number of call arguments
11461 which are specified as a va_list ARGS. */
11463 tree
11465 {
11466 tree t;
11474 }
11476 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11477 FN and a null static chain slot. NARGS is the number of call arguments
11478 which are specified as a tree array ARGS. */
11480 tree
11483 {
11484 tree t;
11493 }
11495 /* Like build_call_array, but takes a vec. */
11497 tree
11499 {
11508 }
11510 /* Conveniently construct a function call expression. FNDECL names the
11511 function to be called and N arguments are passed in the array
11512 ARGARRAY. */
11514 tree
11516 {
11521 }
11523 /* Conveniently construct a function call expression. FNDECL names the
11524 function to be called and the arguments are passed in the vector
11525 VEC. */
11527 tree
11529 {
11532 }
11535 /* Conveniently construct a function call expression. FNDECL names the
11536 function to be called, N is the number of arguments, and the "..."
11537 parameters are the argument expressions. */
11539 tree
11541 {
11551 }
11553 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11554 varargs macros aren't supported by all bootstrap compilers. */
11556 tree
11558 {
11568 }
11570 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11571 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11572 It will get gimplified later into an ordinary internal function. */
11574 tree
11577 {
11585 }
11587 /* Build internal call expression. This is just like CALL_EXPR, except
11588 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11589 internal function. */
11591 tree
11594 {
11604 }
11606 /* Return a function call to FN, if the target is guaranteed to support it,
11607 or null otherwise.
11609 N is the number of arguments, passed in the "...", and TYPE is the
11610 type of the return value. */
11612 tree
11615 {
11625 {
11628 {
11631 OPTIMIZE_FOR_BOTH))
11633 }
11635 }
11636 else
11637 {
11642 }
11643 }
11645 /* Return a function call to the appropriate builtin alloca variant.
11647 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11648 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11649 bound for SIZE in case it is not a fixed value. */
11651 tree
11653 {
11655 {
11657 return
11659 }
11661 {
11664 }
11665 else
11666 {
11669 }
11670 }
11672 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11673 if SIZE == -1) and return a tree node representing char* pointer to
11674 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11675 the STRING_CST value is the LEN bytes at STR (the representation
11676 of the string, which may be wide). Otherwise it's all zeros. */
11678 tree
11682 {
11684 /* Set the maximum valid index based on the string length or SIZE. */
11685 unsigned HOST_WIDE_INT maxidx
11701 }
11705 /* Return true if T (assumed to be a DECL) must be assigned a memory
11706 location. */
11708 bool
11710 {
11716 }
11718 /* Return value of a constant X and sign-extend it. */
11720 HOST_WIDE_INT
11722 {
11726 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11730 {
11734 else
11736 }
11739 }
11741 /* If TYPE is an integral or pointer type, return an integer type with
11742 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11743 if TYPE is already an integer type of signedness UNSIGNEDP.
11744 If TYPE is a floating-point type, return an integer type with the same
11745 bitsize and with the signedness given by UNSIGNEDP; this is useful
11746 when doing bit-level operations on a floating-point value. */
11748 tree
11750 {
11755 {
11763 }
11766 {
11774 }
11783 else
11787 }
11789 /* If TYPE is an integral or pointer type, return an integer type with
11790 the same precision which is unsigned, or itself if TYPE is already an
11791 unsigned integer type. If TYPE is a floating-point type, return an
11792 unsigned integer type with the same bitsize as TYPE. */
11794 tree
11796 {
11798 }
11800 /* If TYPE is an integral or pointer type, return an integer type with
11801 the same precision which is signed, or itself if TYPE is already a
11802 signed integer type. If TYPE is a floating-point type, return a
11803 signed integer type with the same bitsize as TYPE. */
11805 tree
11807 {
11809 }
11811 /* If TYPE is a vector type, return a signed integer vector type with the
11812 same width and number of subparts. Otherwise return boolean_type_node. */
11814 tree
11816 {
11818 {
11822 }
11823 else
11825 }
11827 /* Returns the largest value obtainable by casting something in INNER type to
11828 OUTER type. */
11830 tree
11832 {
11838 /* Compute a unique number for every combination. */
11843 /* Determine the exponent to use. */
11845 {
11848 /* oprec <= iprec, outer: signed, inner: don't care. */
11853 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11857 /* oprec > iprec, outer: signed, inner: signed. */
11861 /* oprec > iprec, outer: signed, inner: unsigned. */
11865 /* oprec > iprec, outer: unsigned, inner: signed. */
11869 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11874 }
11878 }
11880 /* Returns the smallest value obtainable by casting something in INNER type to
11881 OUTER type. */
11883 tree
11885 {
11889 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11890 and obtain 0. */
11892 /* If we are widening something of an unsigned type, OUTER type
11893 contains all values of INNER type. In particular, both INNER
11894 and OUTER types have zero in common. */
11897 else
11898 {
11899 /* If we are widening a signed type to another signed type, we
11900 want to obtain -2^^(iprec-1). If we are keeping the
11901 precision or narrowing to a signed type, we want to obtain
11902 -2^(oprec-1). */
11907 }
11908 }
11910 /* Return nonzero if two operands that are suitable for PHI nodes are
11911 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11912 SSA_NAME or invariant. Note that this is strictly an optimization.
11913 That is, callers of this function can directly call operand_equal_p
11914 and get the same result, only slower. */
11916 int
11918 {
11924 }
11926 /* Returns number of zeros at the end of binary representation of X. */
11928 tree
11930 {
11932 }
11935 #define WALK_SUBTREE(NODE) \
11936 do \
11937 { \
11938 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11939 if (result) \
11940 return result; \
11941 } \
11942 while (0)
11944 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11945 be walked whenever a type is seen in the tree. Rest of operands and return
11946 value are as for walk_tree. */
11948 static tree
11951 {
11955 {
11959 /* We have to worry about mutually recursive pointers. These can't
11960 be written in C. They can in Ada. It's pathological, but
11961 there's an ACATS test (c38102a) that checks it. Deal with this
11962 by checking if we're pointing to another pointer, that one
11963 points to another pointer, that one does too, and we have no htab.
11964 If so, get a hash table. We check three levels deep to avoid
11965 the cost of the hash table if we don't need one. */
11970 {
11977 }
11979 /* fall through */
11988 /* Fall through. */
11992 {
11993 tree arg;
11995 /* We never want to walk into default arguments. */
11998 }
12002 /* Don't follow this nodes's type if a pointer for fear that
12003 we'll have infinite recursion. If we have a PSET, then we
12004 need not fear. */
12019 }
12022 }
12024 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12025 called with the DATA and the address of each sub-tree. If FUNC returns a
12026 non-NULL value, the traversal is stopped, and the value returned by FUNC
12027 is returned. If PSET is non-NULL it is used to record the nodes visited,
12028 and to avoid visiting a node more than once. */
12030 tree
12033 {
12036 tree result;
12038 #define WALK_SUBTREE_TAIL(NODE) \
12039 do \
12040 { \
12041 tp = & (NODE); \
12042 goto tail_recurse; \
12043 } \
12044 while (0)
12046 tail_recurse:
12047 /* Skip empty subtrees. */
12051 /* Don't walk the same tree twice, if the user has requested
12052 that we avoid doing so. */
12056 /* Call the function. */
12060 /* If we found something, return it. */
12066 /* Even if we didn't, FUNC may have decided that there was nothing
12067 interesting below this point in the tree. */
12069 {
12070 /* But we still need to check our siblings. */
12075 else
12077 }
12080 {
12084 }
12087 {
12100 /* None of these have subtrees other than those already walked
12101 above. */
12110 {
12116 /* Walk all elements but the first. */
12120 /* Now walk the first one as a tail call. */
12122 }
12129 {
12134 idx++)
12136 }
12143 {
12144 tree decl;
12146 {
12147 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12148 into declarations that are just mentioned, rather than
12149 declared; they don't really belong to this part of the tree.
12150 And, we can see cycles: the initializer for a declaration
12151 can refer to the declaration itself. */
12155 }
12157 }
12160 {
12161 tree_stmt_iterator i;
12164 }
12169 {
12172 /* FALLTHRU */
12217 /* FALLTHRU */
12252 {
12257 }
12278 {
12283 }
12287 }
12291 {
12294 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12295 But, we only want to walk once. */
12300 }
12303 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12304 defining. We only want to walk into these fields of a type in this
12305 case and not in the general case of a mere reference to the type.
12307 The criterion is as follows: if the field can be an expression, it
12308 must be walked only here. This should be in keeping with the fields
12309 that are directly gimplified in gimplify_type_sizes in order for the
12310 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12311 variable-sized types.
12313 Note that DECLs get walked as part of processing the BIND_EXPR. */
12315 {
12316 /* Call the function for the decl so e.g. copy_tree_body_r can
12317 replace it with the remapped one. */
12326 /* Call the function for the type. See if it returns anything or
12327 doesn't want us to continue. If we are to continue, walk both
12328 the normal fields and those for the declaration case. */
12333 /* But do not walk a pointed-to type since it may itself need to
12334 be walked in the declaration case if it isn't anonymous. */
12336 {
12340 }
12342 /* If this is a record type, also walk the fields. */
12344 {
12345 tree field;
12349 {
12350 /* We'd like to look at the type of the field, but we can
12351 easily get infinite recursion. So assume it's pointed
12352 to elsewhere in the tree. Also, ignore things that
12353 aren't fields. */
12362 }
12363 }
12365 /* Same for scalar types. */
12371 {
12374 }
12378 }
12379 /* FALLTHRU */
12383 {
12386 /* Walk over all the sub-trees of this operand. */
12389 /* Go through the subtrees. We need to do this in forward order so
12390 that the scope of a FOR_EXPR is handled properly. */
12392 {
12396 }
12397 }
12398 /* If this is a type, walk the needed fields in the type. */
12402 }
12404 /* We didn't find what we were looking for. */
12407 #undef WALK_SUBTREE_TAIL
12408 }
12409 #undef WALK_SUBTREE
12411 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12413 tree
12415 walk_tree_lh lh)
12416 {
12417 tree result;
12422 }
12425 tree
12427 {
12434 }
12436 void
12438 {
12442 {
12444 }
12445 else
12447 }
12449 /* Create a nameless artificial label and put it in the current
12450 function context. The label has a location of LOC. Returns the
12451 newly created label. */
12453 tree
12455 {
12463 }
12465 /* Given a tree, try to return a useful variable name that we can use
12466 to prefix a temporary that is being assigned the value of the tree.
12467 I.E. given <temp> = &A, return A. */
12471 {
12472 tree stripped_decl;
12479 {
12484 }
12485 else
12486 {
12488 {
12493 }
12494 }
12495 }
12497 /* Return true if TYPE has a variable argument list. */
12499 bool
12501 {
12502 function_args_iterator args_iter;
12509 {
12511 }
12514 }
12516 /* Return true if TYPE has a prototype. */
12518 bool
12520 {
12521 tree t;
12527 }
12529 /* If BLOCK is inlined from an __attribute__((__artificial__))
12530 routine, return pointer to location from where it has been
12531 called. */
12532 location_t *
12534 {
12539 {
12542 {
12543 /* If AO is an artificial inline, point RET to the
12544 call site locus at which it has been inlined and continue
12545 the loop, in case AO's caller is also an artificial
12546 inline. */
12550 else
12552 }
12557 }
12559 }
12562 /* If EXP is inlined from an __attribute__((__artificial__))
12563 function, return the location of the original call expression. */
12565 location_t
12567 {
12572 else
12574 }
12577 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12578 nodes. */
12580 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12582 hashval_t
12584 {
12592 {
12595 }
12600 else
12603 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12604 something else. */
12610 }
12612 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12613 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12614 same. */
12616 bool
12618 {
12631 else
12633 }
12635 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
12637 tree
12640 {
12641 tree t;
12643 /* Use the cache of optimization nodes. */
12651 {
12652 /* Insert this one into the hash table. */
12656 /* Make a new node for next time round. */
12658 }
12661 }
12663 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
12665 tree
12668 {
12669 tree t;
12671 /* Use the cache of optimization nodes. */
12679 {
12680 /* Insert this one into the hash table. */
12684 /* Make a new node for next time round. */
12686 }
12689 }
12691 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12692 so that they aren't saved during PCH writing. */
12694 void
12696 {
12701 }
12703 /* Determine the "ultimate origin" of a block. */
12705 tree
12707 {
12712 else
12713 {
12718 }
12719 }
12721 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12722 no instruction. */
12724 bool
12726 {
12727 /* Do not strip casts into or out of differing address spaces. */
12730 {
12735 }
12738 {
12739 /* We already know that outer_type is not a pointer with
12740 a non-generic address space. */
12742 }
12744 /* Use precision rather then machine mode when we can, which gives
12745 the correct answer even for submode (bit-field) types. */
12754 /* Otherwise fall back on comparing machine modes (e.g. for
12755 aggregate types, floats). */
12757 }
12759 /* Return true iff conversion in EXP generates no instruction. Mark
12760 it inline so that we fully inline into the stripping functions even
12761 though we have two uses of this function. */
12765 {
12780 }
12782 /* Return true iff conversion in EXP generates no instruction. Don't
12783 consider conversions changing the signedness. */
12785 static bool
12787 {
12798 }
12800 /* Strip conversions from EXP according to tree_nop_conversion and
12801 return the resulting expression. */
12803 tree
12805 {
12809 }
12811 /* Strip conversions from EXP according to tree_sign_nop_conversion
12812 and return the resulting expression. */
12814 tree
12816 {
12820 }
12822 /* Avoid any floating point extensions from EXP. */
12823 tree
12825 {
12828 /* For floating point constant look up the narrowest type that can hold
12829 it properly and handle it like (type)(narrowest_type)constant.
12830 This way we can optimize for instance a=a*2.0 where "a" is float
12831 but 2.0 is double constant. */
12833 {
12834 REAL_VALUE_TYPE orig;
12847 }
12866 }
12868 /* Strip out all handled components that produce invariant
12869 offsets. */
12871 const_tree
12873 {
12875 {
12877 {
12892 }
12894 }
12897 }
12901 /* Return the GCC personality function decl. */
12903 tree
12905 {
12909 }
12911 /* TARGET is a call target of GIMPLE call statement
12912 (obtained by gimple_call_fn). Return true if it is
12913 OBJ_TYPE_REF representing an virtual call of C++ method.
12914 (As opposed to OBJ_TYPE_REF representing objc calls
12915 through a cast where middle-end devirtualization machinery
12916 can't apply.) FOR_DUMP_P is true when being called from
12917 the dump routines. */
12919 bool
12921 {
12930 /* If we do not have BINFO associated, it means that type was built
12931 without devirtualization enabled. Do not consider this a virtual
12932 call. */
12936 }
12938 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12940 static tree
12942 {
12953 }
12955 /* Try to find a base info of BINFO that would have its field decl at offset
12956 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12957 found, return, otherwise return NULL_TREE. */
12959 tree
12961 {
12965 {
12967 tree fld;
12976 {
12984 }
12988 /* Offset 0 indicates the primary base, whose vtable contents are
12989 represented in the binfo for the derived class. */
12991 {
12993 /* Offsets in BINFO are in bytes relative to the whole structure
12994 while POS is in bits relative to the containing field. */
13001 {
13004 }
13007 else
13009 binfo_offset);
13010 }
13014 }
13015 }
13017 /* Returns true if X is a typedef decl. */
13019 bool
13021 {
13024 }
13026 /* Returns true iff TYPE is a type variant created for a typedef. */
13028 bool
13030 {
13032 }
13034 /* PR 84195: Replace control characters in "unescaped" with their
13035 escaped equivalents. Allow newlines if -fmessage-length has
13036 been set to a non-zero value. This is done here, rather than
13037 where the attribute is recorded as the message length can
13038 change between these two locations. */
13040 void
13042 {
13060 {
13064 {
13068 }
13071 {
13073 {
13074 /* We only allocate space for a new string if we
13075 actually encounter a control character that
13076 needs replacing. */
13080 }
13085 {
13094 }
13095 }
13098 }
13101 {
13105 }
13106 }
13108 /* Warn about a use of an identifier which was marked deprecated. Returns
13109 whether a warning was given. */
13111 bool
13113 {
13114 escaped_string msg;
13120 {
13124 {
13129 }
13130 }
13140 {
13141 auto_diagnostic_group d;
13145 else
13150 }
13152 {
13157 {
13163 }
13165 auto_diagnostic_group d;
13167 {
13171 else
13174 }
13175 else
13176 {
13180 else
13183 }
13187 }
13190 }
13192 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13193 somewhere in it. */
13195 bool
13197 {
13199 {
13204 }
13207 }
13209 /* Try to determine whether a TRY_CATCH expression can fall through.
13210 This is a subroutine of block_may_fallthru. */
13212 static bool
13214 {
13215 tree_stmt_iterator i;
13217 /* If the TRY block can fall through, the whole TRY_CATCH can
13218 fall through. */
13224 {
13226 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13227 catch expression and a body. The whole TRY_CATCH may fall
13228 through iff any of the catch bodies falls through. */
13230 {
13233 }
13237 /* The exception filter expression only matters if there is an
13238 exception. If the exception does not match EH_FILTER_TYPES,
13239 we will execute EH_FILTER_FAILURE, and we will fall through
13240 if that falls through. If the exception does match
13241 EH_FILTER_TYPES, the stack unwinder will continue up the
13242 stack, so we will not fall through. We don't know whether we
13243 will throw an exception which matches EH_FILTER_TYPES or not,
13244 so we just ignore EH_FILTER_TYPES and assume that we might
13245 throw an exception which doesn't match. */
13249 /* This case represents statements to be executed when an
13250 exception occurs. Those statements are implicitly followed
13251 by a RESX statement to resume execution after the exception.
13252 So in this case the TRY_CATCH never falls through. */
13254 }
13255 }
13257 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13258 need not be 100% accurate; simply be conservative and return true if we
13259 don't know. This is used only to avoid stupidly generating extra code.
13260 If we're wrong, we'll just delete the extra code later. */
13262 bool
13264 {
13265 /* This CONST_CAST is okay because expr_last returns its argument
13266 unmodified and we assign it to a const_tree. */
13270 {
13273 /* Easy cases. If the last statement of the block implies
13274 control transfer, then we can't fall through. */
13278 /* If there is a default: label or case labels cover all possible
13279 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13280 to some case label in all cases and all we care is whether the
13281 SWITCH_BODY falls through. */
13298 /* The finally clause is always executed after the try clause,
13299 so if it does not fall through, then the try-finally will not
13300 fall through. Otherwise, if the try clause does not fall
13301 through, then when the finally clause falls through it will
13302 resume execution wherever the try clause was going. So the
13303 whole try-finally will only fall through if both the try
13304 clause and the finally clause fall through. */
13314 else
13316 /* FALLTHRU */
13319 /* Functions that do not return do not fall through. */
13333 }
13334 }
13336 /* True if we are using EH to handle cleanups. */
13339 /* This routine is called from front ends to indicate eh should be used for
13340 cleanups. */
13341 void
13343 {
13345 }
13347 /* Query whether EH is used for cleanups. */
13348 bool
13350 {
13352 }
13354 /* Wrapper for tree_code_name to ensure that tree code is valid */
13357 {
13360 /* The tree_code enum promotes to signed, but we could be getting
13361 invalid values, so force an unsigned comparison. */
13363 {
13367 }
13370 }
13372 /* Drops the TREE_OVERFLOW flag from T. */
13374 tree
13376 {
13379 /* For tree codes with a sharing machinery re-build the result. */
13383 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13384 and canonicalize the result. */
13386 {
13387 tree_vector_builder builder;
13391 {
13396 }
13398 }
13400 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13401 and drop the flag. */
13405 /* For constants that contain nested constants, drop the flag
13406 from those as well. */
13408 {
13413 }
13416 }
13418 /* Given a memory reference expression T, return its base address.
13419 The base address of a memory reference expression is the main
13420 object being referenced. For instance, the base address for
13421 'array[i].fld[j]' is 'array'. You can think of this as stripping
13422 away the offset part from a memory address.
13424 This function calls handled_component_p to strip away all the inner
13425 parts of the memory reference until it reaches the base object. */
13427 tree
13429 {
13438 /* ??? Either the alias oracle or all callers need to properly deal
13439 with WITH_SIZE_EXPRs before we can look through those. */
13444 }
13446 /* Return a tree of sizetype representing the size, in bytes, of the element
13447 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13449 tree
13451 {
13456 /* If a size was specified in the ARRAY_REF, it's the size measured
13457 in alignment units of the element type. So multiply by that value. */
13459 {
13460 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13461 sizetype from another type of the same width and signedness. */
13466 }
13468 /* Otherwise, take the size from that of the element type. Substitute
13469 any PLACEHOLDER_EXPR that we have. */
13470 else
13472 }
13474 /* Return a tree representing the lower bound of the array mentioned in
13475 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13477 tree
13479 {
13482 /* If a lower bound is specified in EXP, use it. */
13486 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13487 substituting for a PLACEHOLDER_EXPR as needed. */
13491 /* Otherwise, return a zero of the appropriate type. */
13495 }
13497 /* Return a tree representing the upper bound of the array mentioned in
13498 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13500 tree
13502 {
13505 /* If there is a domain type and it has an upper bound, use it, substituting
13506 for a PLACEHOLDER_EXPR as needed. */
13510 /* Otherwise fail. */
13512 }
13514 /* Returns true if REF is an array reference, component reference,
13515 or memory reference to an array at the end of a structure.
13516 If this is the case, the array may be allocated larger
13517 than its upper bound implies. */
13519 bool
13521 {
13522 tree atype;
13526 {
13529 }
13534 {
13540 {
13542 {
13548 }
13549 else
13551 }
13552 else
13554 }
13555 else
13563 {
13564 /* If the reference chain contains a component reference to a
13565 non-union type and there follows another field the reference
13566 is not at the end of a structure. */
13568 {
13570 {
13576 }
13577 }
13578 /* If we have a multi-dimensional array we do not consider
13579 a non-innermost dimension as flex array if the whole
13580 multi-dimensional array is at struct end.
13581 Same for an array of aggregates with a trailing array
13582 member. */
13586 ;
13587 /* If we view an underlying object as sth else then what we
13588 gathered up to now is what we have to rely on. */
13591 else
13595 }
13597 /* The array now is at struct end. Treat flexible arrays as
13598 always subject to extend, even into just padding constrained by
13599 an underlying decl. */
13609 /* If the reference is based on a declared entity, the size of the array
13610 is constrained by its given domain. (Do not trust commons PR/69368). */
13612 && !(flag_unconstrained_commons
13616 {
13617 /* Check whether the array domain covers all of the available
13618 padding. */
13619 poly_int64 offset;
13627 /* If at least one extra element fits it is a flexarray. */
13636 }
13639 }
13641 /* Return a tree representing the offset, in bytes, of the field referenced
13642 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13644 tree
13646 {
13651 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13652 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13653 value. */
13655 {
13656 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13657 sizetype from another type of the same width and signedness. */
13663 }
13665 /* Otherwise, take the offset from that of the field. Substitute
13666 any PLACEHOLDER_EXPR that we have. */
13667 else
13669 }
13671 /* Given the initializer INIT, return the initializer for the field
13672 DECL if it exists, otherwise null. Used to obtain the initializer
13673 for a flexible array member and determine its size. */
13675 static tree
13677 {
13683 {
13688 {
13692 }
13693 }
13696 }
13698 /* Determines the size of the member referenced by the COMPONENT_REF
13699 REF, using its initializer expression if necessary in order to
13700 determine the size of an initialized flexible array member.
13701 If non-null, set *ARK when REF refers to an interior zero-length
13702 array or a trailing one-element array.
13703 Returns the size as sizetype (which might be zero for an object
13704 with an uninitialized flexible array member) or null if the size
13705 cannot be determined. */
13707 tree
13709 {
13712 special_array_member arkbuf;
13717 /* The object/argument referenced by the COMPONENT_REF and its type. */
13720 /* The referenced member. */
13725 {
13733 /* MEMBER is either an interior array or is an array with
13734 more than one element. */
13738 {
13741 else
13742 {
13745 }
13746 }
13754 {
13759 /* MEMBER is an array with more than one element. */
13764 }
13766 /* For a refernce to a zero- or one-element array member of a union
13767 use the size of the union instead of the size of the member. */
13770 }
13772 /* MEMBER is either a bona fide flexible array member, or a zero-length
13773 array member, or an array of length one treated as such. */
13775 /* If the reference is to a declared object and the member a true
13776 flexible array, try to determine its size from its initializer. */
13780 {
13791 }
13793 /* BASE is the declared object of which MEMBER is either a member
13794 or that is cast to ARGTYPE (e.g., a char buffer used to store
13795 an ARGTYPE object). */
13798 /* Determine the base type of the referenced object. If it's
13799 the same as ARGTYPE and MEMBER has a known size, return it. */
13811 /* MEMBER is a true flexible array member. Compute its size from
13812 the initializer of the BASE object if it has one. */
13815 {
13818 {
13821 {
13822 /* Use the larger of the initializer size and the tail
13823 padding in the enclosing struct. */
13828 }
13831 }
13832 }
13835 {
13837 {
13842 /* The size of a flexible array member of an extern struct
13843 with no initializer cannot be determined (it's defined
13844 in another translation unit and can have an initializer
13845 with an arbitrary number of elements). */
13848 /* Use the size of the base struct or, for interior zero-length
13849 arrays, the size of the enclosing type. */
13851 }
13853 /* Use the size of the BASE object (possibly an array of some
13854 other type such as char used to store the struct). */
13856 else
13858 }
13860 /* If the flexible array member has a known size use the greater
13861 of it and the tail padding in the enclosing struct.
13862 Otherwise, when the size of the flexible array member is unknown
13863 and the referenced object is not a struct, use the size of its
13864 type when known. This detects sizes of array buffers when cast
13865 to struct types with flexible array members. */
13867 {
13870 {
13873 }
13875 }
13877 /* Return "don't know" for an external non-array object since its
13878 flexible array member can be initialized to have any number of
13879 elements. Otherwise, return zero because the flexible array
13880 member has no elements. */
13883 && (!typematch
13886 }
13888 /* Return the machine mode of T. For vectors, returns the mode of the
13889 inner type. The main use case is to feed the result to HONOR_NANS,
13890 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13892 machine_mode
13894 {
13900 }
13902 /* Vector types need to re-check the target flags each time we report
13903 the machine mode. We need to do this because attribute target can
13904 change the result of vector_mode_supported_p and have_regs_of_mode
13905 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13906 change on a per-function basis. */
13907 /* ??? Possibly a better solution is to run through all the types
13908 referenced by a function and re-compute the TYPE_MODE once, rather
13909 than make the TYPE_MODE macro call a function. */
13911 machine_mode
13913 {
13914 machine_mode mode;
13922 {
13923 scalar_int_mode innermode;
13925 /* For integers, try mapping it to a same-sized scalar mode. */
13927 {
13930 scalar_int_mode mode;
13934 }
13937 }
13940 }
13942 /* Return the size in bits of each element of vector type TYPE. */
13944 unsigned int
13946 {
13952 }
13954 /* Calculate the size in bits of each element of vector type TYPE
13955 and return the result as a tree of type bitsizetype. */
13957 tree
13959 {
13964 }
13966 /* Verify that basic properties of T match TV and thus T can be a variant of
13967 TV. TV should be the more specified variant (i.e. the main variant). */
13969 static bool
13971 {
13972 /* Type variant can differ by:
13974 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13975 ENCODE_QUAL_ADDR_SPACE.
13976 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13977 in this case some values may not be set in the variant types
13978 (see TYPE_COMPLETE_P checks).
13979 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13980 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13981 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13982 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13983 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13984 this is necessary to make it possible to merge types form different TUs
13985 - arrays, pointers and references may have TREE_TYPE that is a variant
13986 of TREE_TYPE of their main variants.
13987 - aggregates may have new TYPE_FIELDS list that list variants of
13988 the main variant TYPE_FIELDS.
13989 - vector types may differ by TYPE_VECTOR_OPAQUE
13990 */
13992 /* Convenience macro for matching individual fields. */
13993 #define verify_variant_match(flag) \
13994 do { \
13995 if (flag (tv) != flag (t)) \
13996 { \
13998 debug_tree (tv); \
13999 return false; \
14000 } \
14001 } while (false)
14003 /* tree_base checks. */
14006 /* FIXME: Ada builds non-artificial variants of artificial types. */
14011 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
14018 else
14020 /* FIXME: This check trigger during libstdc++ build. */
14024 /* tree_type_common checks. */
14027 {
14035 {
14045 }
14047 }
14053 /* During LTO we merge variant lists from diferent translation units
14054 that may differ BY TYPE_CONTEXT that in turn may point
14055 to TRANSLATION_UNIT_DECL.
14056 Ada also builds variants of types with different TYPE_CONTEXT. */
14064 {
14068 }
14070 /* tree_type_non_common checks. */
14072 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14073 and dangle the pointer from time to time. */
14077 {
14081 }
14087 {
14090 }
14097 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14098 or even type's main variant. This is needed to make bootstrap pass
14099 and the bug seems new in GCC 5.
14100 C++ FE should be updated to make this consistent and we should check
14101 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14102 is a match with main variant.
14104 Also disable the check for Java for now because of parser hack that builds
14105 first an dummy BINFO and then sometimes replace it by real BINFO in some
14106 of the copies. */
14109 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14110 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14111 at LTO time only. */
14113 {
14121 }
14123 /* Check various uses of TYPE_VALUES_RAW. */
14129 /* Permit incomplete variants of complete type. While FEs may complete
14130 all variants, this does not happen for C++ templates in all cases. */
14134 {
14137 /* Fortran builds qualified variants as new records with items of
14138 qualified type. Verify that they looks same. */
14145 /* FIXME: gfc_nonrestricted_type builds all types as variants
14146 with exception of pointer types. It deeply copies the type
14147 which means that we may end up with a variant type
14148 referring non-variant pointer. We may change it to
14149 produce types as variants, too, like
14150 objc_get_protocol_qualified_type does. */
14156 {
14164 }
14165 }
14168 /* For C++ the qualified variant of array type is really an array type
14169 of qualified TREE_TYPE.
14170 objc builds variants of pointer where pointer to type is a variant, too
14171 in objc_get_protocol_qualified_type. */
14177 {
14185 }
14188 {
14196 }
14198 #undef verify_variant_match
14199 }
14202 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14203 the middle-end types_compatible_p function. It needs to avoid
14204 claiming types are different for types that should be treated
14205 the same with respect to TBAA. Canonical types are also used
14206 for IL consistency checks via the useless_type_conversion_p
14207 predicate which does not handle all type kinds itself but falls
14208 back to pointer-comparison of TYPE_CANONICAL for aggregates
14209 for example. */
14211 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14212 type calculation because we need to allow inter-operability between signed
14213 and unsigned variants. */
14215 bool
14217 {
14218 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14219 signed char and unsigned char. Similarly fortran FE builds
14220 C_SIZE_T as signed type, while C defines it unsigned. */
14223 == INTEGER_TYPE
14226 }
14228 /* Return true iff T1 and T2 are structurally identical for what
14229 TBAA is concerned.
14230 This function is used both by lto.c canonical type merging and by the
14231 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14232 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14233 only for LTO because only in these cases TYPE_CANONICAL equivalence
14234 correspond to one defined by gimple_canonical_types_compatible_p. */
14236 bool
14239 {
14240 /* Type variants should be same as the main variant. When not doing sanity
14241 checking to verify this fact, go to main variants and save some work. */
14243 {
14246 }
14248 /* Check first for the obvious case of pointer identity. */
14252 /* Check that we have two types to compare. */
14256 /* We consider complete types always compatible with incomplete type.
14257 This does not make sense for canonical type calculation and thus we
14258 need to ensure that we are never called on it.
14260 FIXME: For more correctness the function probably should have three modes
14261 1) mode assuming that types are complete mathcing their structure
14262 2) mode allowing incomplete types but producing equivalence classes
14263 and thus ignoring all info from complete types
14264 3) mode allowing incomplete types to match complete but checking
14265 compatibility between complete types.
14267 1 and 2 can be used for canonical type calculation. 3 is the real
14268 definition of type compatibility that can be used i.e. for warnings during
14269 declaration merging. */
14274 /* If the types have been previously registered and found equal
14275 they still are. */
14279 {
14280 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14281 they are always NULL, but they are set to non-NULL for types
14282 constructed by build_pointer_type and variants. In this case the
14283 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14284 all pointers are considered equal. Be sure to not return false
14285 negatives. */
14289 }
14291 /* For types where we do ODR based TBAA the canonical type is always
14292 set correctly, so we know that types are different if their
14293 canonical types does not match. */
14299 /* Can't be the same type if the types don't have the same code. */
14304 /* Qualifiers do not matter for canonical type comparison purposes. */
14306 /* Void types and nullptr types are always the same. */
14311 /* Can't be the same type if they have different mode. */
14315 /* Non-aggregate types can be handled cheaply. */
14323 {
14324 /* Can't be the same type if they have different recision. */
14328 /* In some cases the signed and unsigned types are required to be
14329 inter-operable. */
14334 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14335 interoperable with "signed char". Unless all frontends are revisited
14336 to agree on these types, we must ignore the flag completely. */
14338 /* Fortran standard define C_PTR type that is compatible with every
14339 C pointer. For this reason we need to glob all pointers into one.
14340 Still pointers in different address spaces are not compatible. */
14342 {
14346 }
14348 /* Tail-recurse to components. */
14353 trust_type_canonical);
14356 }
14358 /* Do type-specific comparisons. */
14360 {
14362 /* Array types are the same if the element types are the same and
14363 the number of elements are the same. */
14365 trust_type_canonical)
14370 else
14371 {
14375 /* For an incomplete external array, the type domain can be
14376 NULL_TREE. Check this condition also. */
14381 else
14382 {
14388 /* The minimum/maximum values have to be the same. */
14400 else
14402 }
14403 }
14407 /* Function types are the same if the return type and arguments types
14408 are the same. */
14410 trust_type_canonical))
14415 else
14416 {
14422 {
14425 trust_type_canonical))
14427 }
14433 }
14438 {
14441 /* Don't try to compare variants of an incomplete type, before
14442 TYPE_FIELDS has been copied around. */
14450 /* For aggregate types, all the fields must be the same. */
14454 {
14455 /* Skip non-fields and zero-sized fields. */
14466 /* The fields must have the same name, offset and type. */
14469 || !gimple_canonical_types_compatible_p
14471 trust_type_canonical))
14473 }
14475 /* If one aggregate has more fields than the other, they
14476 are not the same. */
14481 }
14484 /* Consider all types with language specific trees in them mutually
14485 compatible. This is executed only from verify_type and false
14486 positives can be tolerated. */
14489 }
14490 }
14492 /* Verify type T. */
14494 void
14496 {
14500 {
14503 }
14505 {
14509 }
14515 ;
14517 {
14521 }
14522 /* Method and function types cannot be used to address memory and thus
14523 TYPE_CANONICAL really matters only for determining useless conversions.
14525 FIXME: C++ FE produce declarations of builtin functions that are not
14526 compatible with main variants. */
14528 ;
14530 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14531 with variably sized arrays because their sizes possibly
14532 gimplified to different variables. */
14536 {
14540 }
14544 {
14548 }
14550 {
14555 }
14558 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14560 {
14561 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14562 and danagle the pointer from time to time. */
14566 {
14570 }
14571 }
14573 {
14576 {
14580 }
14581 }
14583 {
14586 {
14590 }
14591 }
14594 {
14595 /* FIXME: The following check should pass:
14596 useless_type_conversion_p (const_cast <tree> (t),
14597 TREE_TYPE (TYPE_MIN_VALUE (t))
14598 but does not for C sizetypes in LTO. */
14599 }
14601 /* Check various uses of TYPE_MAXVAL_RAW. */
14603 {
14605 ;
14607 {
14611 }
14613 {
14617 }
14618 }
14620 {
14624 {
14628 }
14629 }
14631 {
14635 {
14639 }
14640 }
14643 {
14644 /* FIXME: The following check should pass:
14645 useless_type_conversion_p (const_cast <tree> (t),
14646 TREE_TYPE (TYPE_MAX_VALUE (t))
14647 but does not for C sizetypes in LTO. */
14648 }
14650 {
14653 {
14657 }
14658 }
14660 {
14664 }
14667 {
14671 }
14673 /* Check various uses of TYPE_VALUES_RAW. */
14676 {
14680 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14681 CONST_DECL of ENUMERAL TYPE. */
14683 {
14688 }
14691 {
14697 }
14699 {
14704 }
14705 }
14707 {
14709 {
14713 }
14714 }
14716 {
14718 {
14721 }
14723 {
14724 /* TODO: verify properties of decls. */
14726 ;
14728 ;
14730 ;
14732 ;
14734 ;
14736 ;
14738 ;
14739 else
14740 {
14744 }
14745 }
14746 }
14753 {
14755 {
14760 }
14762 {
14766 }
14767 /* Verify just enough of cache to ensure that no one copied it to new type.
14768 All copying should go by copy_node that should clear it. */
14770 {
14775 {
14780 }
14781 }
14782 }
14785 {
14786 /* C++ FE uses TREE_PURPOSE to store initial values. */
14788 {
14792 }
14794 {
14798 }
14799 }
14801 {
14805 }
14813 {
14816 }
14818 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14819 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14820 of a type. */
14823 {
14826 }
14829 {
14832 }
14833 }
14836 /* Return 1 if ARG interpreted as signed in its precision is known to be
14837 always positive or 2 if ARG is known to be always negative, or 3 if
14838 ARG may be positive or negative. */
14840 int
14842 {
14849 {
14853 else
14855 }
14859 {
14861 /* Narrower value zero extended into wider type
14862 will always result in positive values. */
14869 }
14875 {
14879 {
14883 {
14892 }
14893 }
14895 }
14897 {
14898 /* For unsigned values, the "positive" range comes
14899 below the "negative" range. */
14904 }
14905 else
14906 {
14911 }
14913 }
14918 /* Return true if ARG is marked with the nonnull attribute in the
14919 current function signature. */
14921 bool
14923 {
14931 /* The static chain decl is always non null. */
14935 /* THIS argument of method is always non-NULL. */
14941 /* Values passed by reference are always non-NULL. */
14948 {
14951 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14955 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14959 /* Get the position number for ARG in the function signature. */
14961 t;
14963 {
14966 }
14970 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14972 {
14975 }
14976 }
14979 }
14981 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14982 information. */
14984 location_t
14986 {
14990 }
14992 location_t
14994 {
14995 source_range src_range;
14999 }
15001 location_t
15003 {
15009 pure_loc,
15010 src_range,
15011 NULL);
15014 }
15016 /* Return EXPR, potentially wrapped with a node expression LOC,
15017 if !CAN_HAVE_LOCATION_P (expr).
15019 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
15020 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
15022 Wrapper nodes can be identified using location_wrapper_p. */
15024 tree
15026 {
15033 /* We should only be adding wrappers for constants and for decls,
15034 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
15039 /* For now, don't add wrappers to exceptional tree nodes, to minimize
15040 any impact of the wrapper nodes. */
15044 /* Compiler-generated temporary variables don't need a wrapper. */
15048 /* If any auto_suppress_location_wrappers are active, don't create
15049 wrappers. */
15053 tree_code code
15058 /* Mark this node as being a wrapper. */
15061 }
15065 /* Return the name of combined function FN, for debugging purposes. */
15069 {
15071 {
15074 }
15075 else
15077 }
15079 /* Return a bitmap with a bit set corresponding to each argument in
15080 a function call type FNTYPE declared with attribute nonnull,
15081 or null if none of the function's argument are nonnull. The caller
15082 must free the bitmap. */
15084 bitmap
15086 {
15092 {
15093 /* The this pointer in C++ non-static member functions is
15094 implicitly nonnull whether or not it's declared as such. */
15097 }
15103 /* A function declaration can specify multiple attribute nonnull,
15104 each with zero or more arguments. The loop below creates a bitmap
15105 representing a union of all the arguments. An empty (but non-null)
15106 bitmap means that all arguments have been declaraed nonnull. */
15108 {
15117 {
15118 /* Clear the bitmap in case a previous attribute nonnull
15119 set it and this one overrides it for all arguments. */
15122 }
15124 /* Iterate over the indices of the format arguments declared nonnull
15125 and set a bit for each. */
15127 {
15130 }
15131 }
15134 }
15136 /* Returns true if TYPE is a type where it and all of its subobjects
15137 (recursively) are of structure, union, or array type. */
15139 static bool
15141 {
15143 {
15150 }
15156 }
15158 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15159 that shouldn't be passed via stack. */
15161 bool
15163 {
15174 }
15176 /* Determine whether TYPE is a structure with a flexible array member,
15177 or a union containing such a structure (possibly recursively). */
15179 bool
15181 {
15184 {
15200 {
15204 }
15208 }
15209 }
15211 /* Like int_size_in_bytes, but handle empty records specially. */
15213 HOST_WIDE_INT
15215 {
15217 }
15219 /* Like size_in_bytes, but handle empty records specially. */
15221 tree
15223 {
15225 }
15227 /* Return true if an expression with CODE has to have the same result type as
15228 its first operand. */
15230 bool
15232 {
15234 {
15268 }
15269 }
15271 /* Return a typenode for the "standard" C type with a given name. */
15272 tree
15274 {
15306 }
15308 /* List of pointer types used to declare builtins before we have seen their
15309 real declaration.
15311 Keep the size up to date in tree.h ! */
15313 {
15320 };
15322 /* Return the maximum object size. */
15324 tree
15326 {
15327 /* To do: Make this a configurable parameter. */
15329 }
15331 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15332 parameter default to false and that weeds out error_mark_node. */
15334 bool
15337 {
15344 }
15346 #if CHECKING_P
15350 /* Selftests for tree. */
15352 /* Verify that integer constants are sane. */
15354 static void
15356 {
15369 }
15371 /* Verify identifiers. */
15373 static void
15375 {
15379 }
15381 /* Verify LABEL_DECL. */
15383 static void
15385 {
15391 }
15393 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15394 are given by VALS. */
15396 static tree
15398 {
15403 }
15405 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15407 static void
15409 {
15415 }
15417 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15418 and that its elements match EXPECTED. */
15420 static void
15423 {
15430 }
15432 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15433 and NPATTERNS background elements, and that its elements match
15434 EXPECTED. */
15436 static void
15439 {
15446 }
15448 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15449 and that its elements match EXPECTED. */
15451 static void
15454 {
15461 }
15463 /* Test the creation of VECTOR_CSTs. */
15465 static void
15467 {
15473 /* Test a simple linear series with a base of 0 and a step of 1:
15474 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15480 /* Try the same with the first element replaced by 100:
15481 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15486 /* Try a series that wraps around.
15487 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15493 /* Try a downward series:
15494 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15500 /* Try two interleaved series with different bases and steps:
15501 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15504 {
15507 }
15511 /* Try a duplicated value:
15512 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15518 /* Try an interleaved duplicated value:
15519 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15526 /* Try a duplicated value with 2 exceptions
15527 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15533 /* Try with and without a step
15534 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15540 /* Try a fully-general constant:
15541 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15545 }
15547 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15548 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15549 modifying its argument in-place. */
15551 static void
15553 {
15556 }
15558 /* Verify location wrappers. */
15560 static void
15562 {
15567 /* Wrapping a constant. */
15577 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15580 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15585 /* Wrapping a STRING_CST. */
15597 /* Wrapping a variable. */
15600 integer_type_node);
15609 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15610 wrapper. */
15615 /* Verify that STRIP_NOPS removes wrappers. */
15619 }
15621 /* Test various tree predicates. Verify that location wrappers don't
15622 affect the results. */
15624 static void
15626 {
15627 /* Build various constants and wrappers around them. */
15655 /* TODO: vector constants. */
15657 /* Test integer_onep. */
15677 /* Test integer_zerop. */
15697 /* Test integer_all_onesp. */
15717 /* Test integer_minus_onep. */
15737 /* Test integer_each_onep. */
15757 /* Test integer_truep. */
15777 /* Test integer_nonzerop. */
15797 /* Test real_zerop. */
15817 /* Test real_onep. */
15837 /* Test real_minus_onep. */
15857 /* Test zerop. */
15877 /* Test tree_expr_nonnegative_p. */
15897 /* Test tree_expr_nonzero_p. */
15905 /* Test integer_valued_real_p. */
15912 /* Test integer_pow2p. */
15917 /* Test uniform_integer_cst_p. */
15936 }
15938 /* Check that string escaping works correctly. */
15940 static void
15942 {
15944 escaped_string msg;
15947 /* ASSERT_STREQ does not accept NULL as a valid test
15948 result, so we have to use ASSERT_EQ instead. */
15957 /* Ensure that we have -fmessage-length set to 0. */
15967 /* Now repeat the tests with -fmessage-length set to 5. */
15970 /* Note that the newline is not translated into an escape. */
15977 /* Restore the original message length setting. */
15979 }
15981 /* Run all of the selftests within this file. */
15983 void
15985 {
15993 }