| blob | 0a51f9ddb4d83cd84f73ee274b90b9dd90773446 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2022 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
79 /* Names of tree components.
80 Used for printing out the tree and error messages. */
81 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
86 };
88 #undef DEFTREECODE
89 #undef END_OF_BASE_TREE_CODES
91 /* Each tree code class has an associated string representation.
92 These must correspond to the tree_code_class entries. */
95 {
106 "expression"
107 };
109 /* obstack.[ch] explicitly declined to prototype this. */
112 /* Statistics-gathering stuff. */
118 /* Keep in sync with tree.h:enum tree_node_kind. */
136 };
138 /* Unique id for next decl created. */
140 /* Unique id for next type created. */
142 /* Unique id for next debug decl created. Use negative numbers,
143 to catch erroneous uses. */
146 /* Since we cannot rehash a type after it is in the table, we have to
147 keep the hash code. */
151 tree type;
152 };
154 /* Initial size of the hash table (rounded to next prime). */
155 #define TYPE_HASH_INITIAL_SIZE 1000
158 {
162 static int
164 {
166 }
167 };
169 /* Now here is the hash table. When recording a type, it is added to
170 the slot whose index is the hash code. Note that the hash table is
171 used for several kinds of types (function types, array types and
172 array index range types, for now). While all these live in the
173 same table, they are completely independent, and the hash code is
174 computed differently for each of these. */
178 /* Hash table and temporary node for larger integer const values. */
182 {
185 };
189 /* Class and variable for making sure that there is a single POLY_INT_CST
190 for a given value. */
192 {
196 };
200 /* Hash table for optimization flags and target option flags. Use the same
201 hash table for both sets of options. Nodes for building the current
202 optimization and target option nodes. The assumption is most of the time
203 the options created will already be in the hash table, so we avoid
204 allocating and freeing up a node repeatably. */
209 {
212 };
216 /* General tree->tree mapping structure for use in hash tables. */
241 /* Number of operands for each OMP clause. */
243 {
331 };
334 {
422 };
424 /* Unless specific to OpenACC, we tend to internally maintain OpenMP-centric
425 clause names, but for use in diagnostics etc. would like to use the "user"
426 clause names. */
430 {
431 /* For OpenACC, the 'OMP_CLAUSE_MAP_KIND' of an 'OMP_CLAUSE_MAP' is used to
432 distinguish clauses as seen by the user. See also where front ends do
433 'build_omp_clause' with 'OMP_CLAUSE_MAP'. */
436 {
454 }
457 }
460 /* Return the tree node structure used by tree code CODE. */
464 {
466 {
469 {
481 }
495 }
498 {
499 /* tcc_constant cases. */
509 /* tcc_exceptional cases. */
526 }
527 }
530 /* Initialize tree_contains_struct to describe the hierarchy of tree
531 nodes. */
533 static void
535 {
539 {
546 /* Mark the TS structure itself. */
549 /* Mark all the structures that TS is derived from. */
551 {
631 }
632 }
634 /* Basic consistency checks for attributes used in fold. */
675 }
678 /* Init tree.cc. */
680 void
682 {
683 /* Initialize the hash table of types. */
684 type_hash_table
687 debug_expr_for_decl
690 value_expr_for_decl
704 /* Initialize the tree_contains_struct array. */
707 }
709 \f
710 /* The name of the object as the assembler will see it (but before any
711 translations made by ASM_OUTPUT_LABELREF). Often this is the same
712 as DECL_NAME. It is an IDENTIFIER_NODE. */
713 tree
715 {
719 }
721 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
722 (either of which may be NULL). Inform the FE, if this changes the
723 name. */
725 void
727 {
730 }
732 /* Return true if DECL may need an assembler name to be set. */
736 {
737 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
738 Rule merging. This makes type_odr_p to return true on those types during
739 LTO and by comparing the mangled name, we can say what types are intended
740 to be equivalent across compilation unit.
742 We do not store names of type_in_anonymous_namespace_p.
744 Record, union and enumeration type have linkage that allows use
745 to check type_in_anonymous_namespace_p. We do not mangle compound types
746 that always can be compared structurally.
748 Similarly for builtin types, we compare properties of their main variant.
749 A special case are integer types where mangling do make differences
750 between char/signed char/unsigned char etc. Storing name for these makes
751 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
752 See cp/mangle.cc:write_builtin_type for details. */
755 {
768 }
769 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
773 /* If DECL already has its assembler name set, it does not need a
774 new one. */
779 /* Abstract decls do not need an assembler name. */
783 /* For VAR_DECLs, only static, public and external symbols need an
784 assembler name. */
792 {
793 /* Do not set assembler name on builtins. Allow RTL expansion to
794 decide whether to expand inline or via a regular call. */
799 /* Functions represented in the callgraph need an assembler name. */
803 /* Unused and not public functions don't need an assembler name. */
806 }
809 }
811 /* If T needs an assembler name, have one created for it. */
813 void
815 {
817 {
818 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
819 diagnostics that use input_location to show locus
820 information. The problem here is that, at this point,
821 input_location is generally anchored to the end of the file
822 (since the parser is long gone), so we don't have a good
823 position to pin it to.
825 To alleviate this problem, this uses the location of T's
826 declaration. Examples of this are
827 testsuite/g++.dg/template/cond2.C and
828 testsuite/g++.dg/template/pr35240.C. */
835 }
836 }
838 /* When the target supports COMDAT groups, this indicates which group the
839 DECL is associated with. This can be either an IDENTIFIER_NODE or a
840 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
841 tree
843 {
848 }
850 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
851 tree
853 {
858 }
860 /* When the target supports named section, return its name as IDENTIFIER_NODE
861 or NULL if it is in no section. */
864 {
869 }
871 /* Set section name of NODE to VALUE (that is expected to be
872 identifier node) */
873 void
875 {
879 {
883 }
886 else
889 }
891 /* Set section name of NODE to match the section name of OTHER.
893 set_decl_section_name (decl, other) is equivalent to
894 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
895 efficient. */
896 void
898 {
901 {
905 else
908 }
909 else
910 {
915 }
916 }
918 /* Return TLS model of a variable NODE. */
919 enum tls_model
921 {
926 }
928 /* Set TLS model of variable NODE to MODEL. */
929 void
931 {
935 {
939 }
940 else
943 }
945 /* Compute the number of bytes occupied by a tree with code CODE.
946 This function cannot be used for nodes that have variable sizes,
947 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
948 size_t
950 {
952 {
955 {
972 }
976 {
1000 }
1013 {
1025 }
1029 {
1050 }
1054 }
1055 }
1057 /* Compute the number of bytes occupied by NODE. This routine only
1058 looks at TREE_CODE, except for those nodes that have variable sizes. */
1059 size_t
1061 {
1064 {
1094 else
1096 }
1097 }
1099 /* Return tree node kind based on tree CODE. */
1101 static tree_node_kind
1103 {
1107 {
1125 {
1142 }
1148 }
1149 }
1151 /* Record interesting allocation statistics for a tree node with CODE
1152 and LENGTH. */
1154 static void
1156 {
1165 }
1167 /* Allocate and return a new UID from the DECL_UID namespace. */
1169 int
1171 {
1173 }
1175 /* Return a newly allocated node of code CODE. For decl and type
1176 nodes, some other fields are initialized. The rest of the node is
1177 initialized to zero. This function cannot be used for TREE_VEC,
1178 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1179 tree_code_size.
1181 Achoo! I got a code in the node. */
1183 tree
1185 {
1186 tree t;
1196 {
1204 {
1206 {
1209 }
1210 else
1212 }
1216 else
1217 {
1220 }
1233 /* Default to no attributes for type, but let target change that. */
1237 /* We have not yet computed the alias set for this type. */
1247 {
1255 /* All of these have side-effects, no matter what their
1256 operands are. */
1262 }
1267 {
1280 }
1284 /* Other classes need no special treatment. */
1286 }
1289 }
1291 /* Free tree node. */
1293 void
1295 {
1298 {
1308 }
1320 }
1321 \f
1322 /* Return a new node with the same contents as NODE except that its
1323 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1325 tree
1327 {
1328 tree t;
1345 {
1348 else
1349 {
1353 }
1356 {
1359 }
1360 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1362 {
1365 }
1367 {
1370 }
1372 {
1375 }
1376 }
1378 {
1380 /* The following is so that the debug code for
1381 the copy is different from the original type.
1382 The two statements usually duplicate each other
1383 (because they clear fields of the same union),
1384 but the optimizer should catch that. */
1388 /* Do not copy the values cache. */
1390 {
1393 }
1394 }
1396 {
1400 }
1402 {
1406 }
1409 }
1411 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1412 For example, this can copy a list made of TREE_LIST nodes. */
1414 tree
1416 {
1417 tree head;
1426 {
1430 }
1432 }
1434 \f
1435 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1436 INTEGER_CST with value CST and type TYPE. */
1438 static unsigned int
1440 {
1442 /* We need extra HWIs if CST is an unsigned integer with its
1443 upper bit set. */
1447 }
1449 /* Return a new INTEGER_CST with value CST and type TYPE. */
1451 static tree
1453 {
1459 {
1465 }
1468 {
1469 len--;
1473 }
1479 }
1481 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1483 static tree
1485 CXX_MEM_STAT_INFO)
1486 {
1498 }
1500 /* Create a constant tree that contains CST sign-extended to TYPE. */
1502 tree
1504 {
1505 /* Support legacy code. */
1510 }
1512 /* Create a constant tree that contains CST zero-extended to TYPE. */
1514 tree
1516 {
1518 }
1520 /* Create a constant tree that contains CST sign-extended to TYPE. */
1522 tree
1524 {
1527 }
1529 /* Constructs tree in type TYPE from with value given by CST. Signedness
1530 of CST is assumed to be the same as the signedness of TYPE. */
1532 tree
1534 {
1536 }
1538 /* We force the wide_int CST to the range of the type TYPE by sign or
1539 zero extending it. OVERFLOWABLE indicates if we are interested in
1540 overflow of the value, when >0 we are only interested in signed
1541 overflow, for <0 we are interested in any overflow. OVERFLOWED
1542 indicates whether overflow has already occurred. CONST_OVERFLOWED
1543 indicates whether constant overflow has already occurred. We force
1544 T's value to be within range of T's type (by setting to 0 or 1 all
1545 the bits outside the type's range). We set TREE_OVERFLOWED if,
1546 OVERFLOWED is nonzero,
1547 or OVERFLOWABLE is >0 and signed overflow occurs
1548 or OVERFLOWABLE is <0 and any overflow occurs
1549 We return a new tree node for the extended wide_int. The node
1550 is shared if no overflow flags are set. */
1553 tree
1556 {
1559 /* If we need to set overflow flags, return a new unshared node. */
1561 {
1565 {
1567 sign);
1568 tree t;
1571 else
1572 {
1575 {
1578 }
1580 }
1583 }
1584 }
1586 /* Else build a shared node. */
1588 }
1590 /* These are the hash table functions for the hash table of INTEGER_CST
1591 nodes of a sizetype. */
1593 /* Return the hash code X, an INTEGER_CST. */
1595 hashval_t
1597 {
1606 }
1608 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1609 is the same as that given by *Y, which is the same. */
1611 bool
1613 {
1627 }
1629 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1630 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1631 number of slots that can be cached for the type. */
1636 {
1638 /* Initialize cache. */
1640 {
1643 }
1646 {
1647 /* Create a new shared int. */
1650 }
1652 }
1654 /* Create an INT_CST node of TYPE and value CST.
1655 The returned node is always shared. For small integers we use a
1656 per-type vector cache, for larger ones we use a single hash table.
1657 The value is extended from its precision according to the sign of
1658 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1659 the upper bits and ensures that hashing and value equality based
1660 upon the underlying HOST_WIDE_INTs works without masking. */
1662 static tree
1664 {
1665 tree t;
1673 /* Verify that everything is canonical. */
1676 {
1681 }
1688 {
1689 /* Cache NULL pointer and zero bounds. */
1692 /* Cache upper bounds of pointers. */
1695 /* Cache 1 which is used for a non-zero range. */
1700 {
1702 /* Make sure no one is clobbering the shared constant. */
1706 }
1707 }
1709 {
1710 /* We just need to store a single HOST_WIDE_INT. */
1711 HOST_WIDE_INT hwi;
1714 else
1718 {
1721 /* Fallthru. */
1725 /* Ignore pointers, as they were already handled above. */
1729 /* Cache false or true. */
1738 {
1739 /* Cache [0, N). */
1743 }
1744 else
1745 {
1746 /* Cache [-1, N). */
1750 }
1758 }
1761 {
1763 /* Make sure no one is clobbering the shared constant. */
1770 }
1771 else
1772 {
1773 /* Use the cache of larger shared ints, using int_cst_node as
1774 a temporary. */
1782 {
1783 /* Insert this one into the hash table. */
1786 /* Make a new node for next time round. */
1788 }
1789 }
1790 }
1791 else
1792 {
1793 /* The value either hashes properly or we drop it on the floor
1794 for the gc to take care of. There will not be enough of them
1795 to worry about. */
1801 {
1802 /* Insert this one into the hash table. */
1805 }
1806 else
1808 }
1811 }
1813 hashval_t
1815 {
1823 }
1825 bool
1827 {
1834 }
1836 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1837 The elements must also have type TYPE. */
1839 tree
1841 {
1852 INSERT);
1854 {
1859 }
1861 }
1863 /* Create a constant tree with value VALUE in type TYPE. */
1865 tree
1867 {
1871 }
1873 /* Insert INTEGER_CST T into a cache of integer constants. And return
1874 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1875 is false, and T falls into the type's 'smaller values' range, there
1876 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1877 or the value is large, should an existing entry exist, it is
1878 returned (rather than inserting T). */
1880 tree
1882 {
1890 /* The caching indices here must match those in
1891 wide_int_to_type_1. */
1893 {
1896 /* Fallthru. */
1900 {
1908 }
1912 /* Cache false or true. */
1921 {
1922 /* Cache 0..N */
1925 /* This is a little hokie, but if the prec is smaller than
1926 what is necessary to hold param_integer_share_limit, then the
1927 obvious test will not get the correct answer. */
1929 {
1933 }
1936 }
1937 else
1938 {
1939 /* Cache -1..N */
1945 {
1947 {
1950 }
1953 }
1954 }
1958 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1959 members. */
1964 }
1967 {
1968 /* Look for it in the type's vector of small shared ints. */
1970 {
1973 }
1976 {
1979 }
1980 else
1982 }
1983 else
1984 {
1985 /* Use the cache of larger shared ints. */
1988 {
1989 /* If there is already an entry for the number verify it's the
1990 same value. */
1992 /* And return the cached value. */
1994 }
1995 else
1996 /* Otherwise insert this one into the hash table. */
1998 }
2001 }
2004 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2005 and the rest are zeros. */
2007 tree
2009 {
2014 }
2016 /* Checks that X is integer constant that can be expressed in (unsigned)
2017 HOST_WIDE_INT without loss of precision. */
2019 bool
2021 {
2024 }
2026 /* Build a newly constructed VECTOR_CST with the given values of
2027 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2029 tree
2032 {
2034 tree t;
2050 }
2052 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2053 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2055 tree
2057 {
2062 tree value;
2064 /* We can't construct a VECTOR_CST for a variable number of elements. */
2068 {
2070 {
2071 /* If NELTS is constant then this must be too. */
2075 }
2076 else
2078 }
2083 }
2085 /* Build a vector of type VECTYPE where all the elements are SCs. */
2086 tree
2088 {
2094 /* Verify that the vector type is suitable for SC. Note that there
2095 is some inconsistency in the type-system with respect to restrict
2096 qualifications of pointers. Vector types always have a main-variant
2097 element type and the qualification is applied to the vector-type.
2098 So TREE_TYPE (vector-type) does not return a properly qualified
2099 vector element-type. */
2104 {
2108 }
2111 else
2112 {
2118 }
2119 }
2121 /* If TYPE is not a vector type, just return SC, otherwise return
2122 build_vector_from_val (TYPE, SC). */
2124 tree
2126 {
2131 }
2133 /* Build a vector series of type TYPE in which element I has the value
2134 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2135 and a VEC_SERIES_EXPR otherwise. */
2137 tree
2139 {
2143 {
2153 }
2155 }
2157 /* Return a vector with the same number of units and number of bits
2158 as VEC_TYPE, but in which the elements are a linear series of unsigned
2159 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2161 tree
2163 {
2168 {
2169 index_elt_type = build_nonstandard_integer_type
2172 }
2178 }
2180 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2181 elements are A and the rest are B. */
2183 tree
2185 {
2188 /* Optimize the constant case. */
2195 }
2197 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2198 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2200 void
2202 {
2204 tree val;
2210 {
2211 /* Mostly ctors will have elts that don't have side-effects, so
2212 the usual case is to scan all the elements. Hence a single
2213 loop for both const and side effects, rather than one loop
2214 each (with early outs). */
2219 }
2223 }
2225 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2226 CONSTRUCTOR C. */
2228 void
2230 {
2232 tree val;
2238 {
2243 }
2244 }
2246 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2247 are in the vec pointed to by VALS. */
2248 tree
2250 {
2259 }
2261 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2262 INDEX and VALUE. */
2263 tree
2265 {
2273 }
2276 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2277 are in a list pointed to by VALS. */
2278 tree
2280 {
2281 tree t;
2285 {
2289 }
2292 }
2294 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2295 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2296 fields in the constructor remain null. */
2298 tree
2300 {
2307 }
2309 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2310 of elements, provided as index/value pairs. */
2312 tree
2314 {
2321 {
2325 }
2328 }
2330 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2332 tree
2334 {
2339 }
2341 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2343 tree
2345 {
2346 tree v;
2356 }
2358 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2360 tree
2362 {
2363 tree v;
2366 /* dconst{0,1,2,m1,half} are used in various places in
2367 the middle-end and optimizers, allow them here
2368 even for decimal floating point types as an exception
2369 by converting them to decimal. */
2373 {
2383 {
2384 /* Make sure to give zero the minimum quantum exponent for
2385 the type (which corresponds to all bits zero). */
2390 }
2391 else
2393 }
2395 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2396 Consider doing it via real_convert now. */
2403 }
2405 /* Like build_real, but first truncate D to the type. */
2407 tree
2409 {
2411 }
2413 /* Return a new REAL_CST node whose type is TYPE
2414 and whose value is the integer value of the INTEGER_CST node I. */
2416 REAL_VALUE_TYPE
2418 {
2419 REAL_VALUE_TYPE d;
2421 /* Clear all bits of the real value type so that we can later do
2422 bitwise comparisons to see if two values are the same. */
2428 }
2430 /* Given a tree representing an integer constant I, return a tree
2431 representing the same value as a floating-point constant of type TYPE. */
2433 tree
2435 {
2436 tree v;
2443 }
2445 /* Return a new REAL_CST node whose type is TYPE
2446 and whose value is the integer value I which has sign SGN. */
2448 tree
2450 {
2451 REAL_VALUE_TYPE d;
2453 /* Clear all bits of the real value type so that we can later do
2454 bitwise comparisons to see if two values are the same. */
2459 }
2461 /* Return a newly constructed STRING_CST node whose value is the LEN
2462 characters at STR when STR is nonnull, or all zeros otherwise.
2463 Note that for a C string literal, LEN should include the trailing NUL.
2464 The TREE_TYPE is not initialized. */
2466 tree
2468 {
2469 /* Do not waste bytes provided by padding of struct tree_string. */
2482 else
2487 }
2489 /* Return a newly constructed COMPLEX_CST node whose value is
2490 specified by the real and imaginary parts REAL and IMAG.
2491 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2492 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2494 tree
2496 {
2507 }
2509 /* Build a complex (inf +- 0i), such as for the result of cproj.
2510 TYPE is the complex tree type of the result. If NEG is true, the
2511 imaginary zero is negative. */
2513 tree
2515 {
2521 }
2523 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2524 element is set to 1. In particular, this is 1 + i for complex types. */
2526 tree
2528 {
2530 {
2533 }
2534 else
2536 }
2538 /* Return a constant of arithmetic type TYPE which is the
2539 multiplicative identity of the set TYPE. */
2541 tree
2543 {
2545 {
2555 /* We can only generate 1 for accum types. */
2560 {
2564 }
2573 }
2574 }
2576 /* Return an integer of type TYPE containing all 1's in as much precision as
2577 it contains, or a complex or vector whose subparts are such integers. */
2579 tree
2581 {
2583 {
2586 }
2587 else
2589 }
2591 /* Return a constant of arithmetic type TYPE which is the
2592 opposite of the multiplicative identity of the set TYPE. */
2594 tree
2596 {
2598 {
2608 /* We can only generate 1 for accum types. */
2615 {
2619 }
2628 }
2629 }
2631 /* Build 0 constant of type TYPE. This is used by constructor folding
2632 and thus the constant should be represented in memory by
2633 zero(es). */
2635 tree
2637 {
2639 {
2652 {
2656 }
2659 {
2663 }
2669 }
2670 }
2673 /* Build a BINFO with LEN language slots. */
2675 tree
2677 {
2678 tree t;
2693 }
2695 /* Create a CASE_LABEL_EXPR tree node and return it. */
2697 tree
2699 {
2711 }
2713 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2714 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2715 The latter determines the length of the HOST_WIDE_INT vector. */
2717 tree
2719 {
2720 tree t;
2732 /* to_offset can only be applied to trees that are offset_int-sized
2733 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2734 must be exactly the precision of offset_int and so LEN is correct. */
2737 else
2743 }
2745 /* Build a newly constructed TREE_VEC node of length LEN. */
2747 tree
2749 {
2750 tree t;
2761 }
2763 /* Grow a TREE_VEC node to new length LEN. */
2765 tree
2767 {
2783 }
2784 \f
2785 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2786 fixed, and scalar, complex or vector. */
2788 bool
2790 {
2794 }
2796 /* Return 1 if EXPR is the integer constant zero or a complex constant
2797 of zero, or a location wrapper for such a constant. */
2799 bool
2801 {
2805 {
2817 }
2818 }
2820 /* Return 1 if EXPR is the integer constant one or the corresponding
2821 complex constant, or a location wrapper for such a constant. */
2823 bool
2825 {
2829 {
2841 }
2842 }
2844 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2845 return 1 if every piece is the integer constant one.
2846 Also return 1 for location wrappers for such a constant. */
2848 bool
2850 {
2856 else
2858 }
2860 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2861 it contains, or a complex or vector whose subparts are such integers,
2862 or a location wrapper for such a constant. */
2864 bool
2866 {
2884 }
2886 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2887 for such a constant. */
2889 bool
2891 {
2897 else
2899 }
2901 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2902 one bit on), or a location wrapper for such a constant. */
2904 bool
2906 {
2918 }
2920 /* Return 1 if EXPR is an integer constant other than zero or a
2921 complex constant other than zero, or a location wrapper for such a
2922 constant. */
2924 bool
2926 {
2934 }
2936 /* Return 1 if EXPR is the integer constant one. For vector,
2937 return 1 if every piece is the integer constant minus one
2938 (representing the value TRUE).
2939 Also return 1 for location wrappers for such a constant. */
2941 bool
2943 {
2949 }
2951 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2952 for such a constant. */
2954 bool
2956 {
2961 }
2963 /* Return the power of two represented by a tree node known to be a
2964 power of two. */
2966 int
2968 {
2973 }
2975 /* Similar, but return the largest integer Y such that 2 ** Y is less
2976 than or equal to EXPR. */
2978 int
2980 {
2985 }
2987 /* Return number of known trailing zero bits in EXPR, or, if the value of
2988 EXPR is known to be zero, the precision of it's type. */
2990 unsigned int
2992 {
2999 {
3020 /* Second operand is sizetype, which could be in theory
3021 wider than pointer's precision. Make sure we never
3022 return more than prec. */
3037 {
3040 }
3045 {
3050 }
3059 {
3062 {
3067 }
3068 }
3070 CASE_CONVERT:
3088 {
3091 }
3095 }
3096 }
3098 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
3099 decimal float constants, so don't return 1 for them.
3100 Also return 1 for location wrappers around such a constant. */
3102 bool
3104 {
3108 {
3116 {
3117 /* Don't simply check for a duplicate because the predicate
3118 accepts both +0.0 and -0.0. */
3124 }
3127 }
3128 }
3130 /* Return 1 if EXPR is the real constant one in real or complex form.
3131 Trailing zeroes matter for decimal float constants, so don't return
3132 1 for them.
3133 Also return 1 for location wrappers around such a constant. */
3135 bool
3137 {
3141 {
3154 }
3155 }
3157 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3158 matter for decimal float constants, so don't return 1 for them.
3159 Also return 1 for location wrappers around such a constant. */
3161 bool
3163 {
3167 {
3180 }
3181 }
3183 /* Nonzero if EXP is a constant or a cast of a constant. */
3185 bool
3187 {
3188 /* This is not quite the same as STRIP_NOPS. It does more. */
3193 }
3195 /* Return true if T holds a polynomial pointer difference, storing it in
3196 *VALUE if so. A true return means that T's precision is no greater
3197 than 64 bits, which is the largest address space we support, so *VALUE
3198 never loses precision. However, the signedness of the result does
3199 not necessarily match the signedness of T: sometimes an unsigned type
3200 like sizetype is used to encode a value that is actually negative. */
3202 bool
3204 {
3208 {
3213 }
3215 {
3222 }
3224 }
3226 poly_int64
3228 {
3233 }
3235 poly_uint64
3237 {
3242 }
3243 \f
3244 /* Return first list element whose TREE_VALUE is ELEM.
3245 Return 0 if ELEM is not in LIST. */
3247 tree
3249 {
3251 {
3255 }
3257 }
3259 /* Return first list element whose TREE_PURPOSE is ELEM.
3260 Return 0 if ELEM is not in LIST. */
3262 tree
3264 {
3266 {
3270 }
3272 }
3274 /* Return true if ELEM is in V. */
3276 bool
3278 {
3280 tree t;
3285 }
3287 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3288 NULL_TREE. */
3290 tree
3292 {
3296 }
3298 /* Return nonzero if ELEM is part of the chain CHAIN. */
3300 bool
3302 {
3304 {
3308 }
3311 }
3313 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3314 We expect a null pointer to mark the end of the chain.
3315 This is the Lisp primitive `length'. */
3317 int
3319 {
3321 #ifdef ENABLE_TREE_CHECKING
3323 #endif
3327 {
3329 #ifdef ENABLE_TREE_CHECKING
3333 #endif
3334 len++;
3335 }
3338 }
3340 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3341 UNION_TYPE TYPE, or NULL_TREE if none. */
3343 tree
3345 {
3350 }
3352 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3353 UNION_TYPE TYPE, or NULL_TREE if none. */
3355 tree
3357 {
3361 {
3366 }
3369 }
3371 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3372 by modifying the last node in chain 1 to point to chain 2.
3373 This is the Lisp primitive `nconc'. */
3375 tree
3377 {
3378 tree t1;
3389 #ifdef ENABLE_TREE_CHECKING
3390 {
3391 tree t2;
3394 }
3395 #endif
3398 }
3400 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3402 tree
3404 {
3405 tree next;
3410 }
3412 /* Reverse the order of elements in the chain T,
3413 and return the new head of the chain (old last element). */
3415 tree
3417 {
3420 {
3421 /* We shouldn't be using this function to reverse BLOCK chains; we
3422 have blocks_nreverse for that. */
3427 }
3429 }
3430 \f
3431 /* Return a newly created TREE_LIST node whose
3432 purpose and value fields are PARM and VALUE. */
3434 tree
3436 {
3441 }
3443 /* Build a chain of TREE_LIST nodes from a vector. */
3445 tree
3447 {
3451 tree t;
3453 {
3456 }
3458 }
3460 /* Return a newly created TREE_LIST node whose
3461 purpose and value fields are PURPOSE and VALUE
3462 and whose TREE_CHAIN is CHAIN. */
3464 tree
3466 {
3467 tree node;
3479 }
3481 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3482 trees. */
3486 {
3490 tree val;
3496 }
3497 \f
3498 /* Return the size nominally occupied by an object of type TYPE
3499 when it resides in memory. The value is measured in units of bytes,
3500 and its data type is that normally used for type sizes
3501 (which is the first type created by make_signed_type or
3502 make_unsigned_type). */
3504 tree
3506 {
3507 tree t;
3516 {
3519 }
3522 }
3524 /* Return the size of TYPE (in bytes) as a wide integer
3525 or return -1 if the size can vary or is larger than an integer. */
3527 HOST_WIDE_INT
3529 {
3530 tree t;
3540 else
3542 }
3544 /* Return the maximum size of TYPE (in bytes) as a wide integer
3545 or return -1 if the size can vary or is larger than an integer. */
3547 HOST_WIDE_INT
3549 {
3551 tree size_tree;
3553 /* If this is an array type, check for a possible MAX_SIZE attached. */
3556 {
3561 }
3563 /* If we still haven't been able to get a size, see if the language
3564 can compute a maximum size. */
3567 {
3572 }
3575 }
3576 \f
3577 /* Return the bit position of FIELD, in bits from the start of the record.
3578 This is a tree of type bitsizetype. */
3580 tree
3582 {
3585 }
3586 \f
3587 /* Return the byte position of FIELD, in bytes from the start of the record.
3588 This is a tree of type sizetype. */
3590 tree
3592 {
3595 }
3597 /* Likewise, but return as an integer. It must be representable in
3598 that way (since it could be a signed value, we don't have the
3599 option of returning -1 like int_size_in_byte can. */
3601 HOST_WIDE_INT
3603 {
3605 }
3606 \f
3607 /* Return, as a tree node, the number of elements for TYPE (which is an
3608 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3610 tree
3612 {
3615 /* If they did it with unspecified bounds, then we should have already
3616 given an error about it before we got here. */
3624 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3626 {
3627 /* zero sized arrays are represented from C FE as complete types with
3628 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3629 them as min 0, max -1. */
3636 }
3639 ? max
3641 }
3642 \f
3643 /* If arg is static -- a reference to an object in static storage -- then
3644 return the object. This is not the same as the C meaning of `static'.
3645 If arg isn't static, return NULL. */
3647 tree
3649 {
3651 {
3653 /* Nested functions are static, even though taking their address will
3654 involve a trampoline as we unnest the nested function and create
3655 the trampoline on the tree level. */
3676 /* If the thing being referenced is not a field, then it is
3677 something language specific. */
3680 /* If we are referencing a bitfield, we can't evaluate an
3681 ADDR_EXPR at compile time and so it isn't a constant. */
3698 else
3706 }
3707 }
3709 \f
3712 /* Return whether OP is a DECL whose address is function-invariant. */
3714 bool
3716 {
3717 /* The conditions below are slightly less strict than the one in
3718 staticp. */
3721 {
3744 }
3747 }
3749 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3751 bool
3753 {
3754 /* The conditions below are slightly less strict than the one in
3755 staticp. */
3758 {
3778 }
3781 }
3784 /* Return true if T is function-invariant (internal function, does
3785 not handle arithmetic; that's handled in skip_simple_arithmetic and
3786 tree_invariant_p). */
3788 static bool
3790 {
3791 tree op;
3798 {
3805 {
3807 {
3822 }
3824 }
3830 }
3833 }
3835 /* Return true if T is function-invariant. */
3837 bool
3839 {
3842 }
3844 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3845 Do this to any expression which may be used in more than one place,
3846 but must be evaluated only once.
3848 Normally, expand_expr would reevaluate the expression each time.
3849 Calling save_expr produces something that is evaluated and recorded
3850 the first time expand_expr is called on it. Subsequent calls to
3851 expand_expr just reuse the recorded value.
3853 The call to expand_expr that generates code that actually computes
3854 the value is the first call *at compile time*. Subsequent calls
3855 *at compile time* generate code to use the saved value.
3856 This produces correct result provided that *at run time* control
3857 always flows through the insns made by the first expand_expr
3858 before reaching the other places where the save_expr was evaluated.
3859 You, the caller of save_expr, must make sure this is so.
3861 Constants, and certain read-only nodes, are returned with no
3862 SAVE_EXPR because that is safe. Expressions containing placeholders
3863 are not touched; see tree.def for an explanation of what these
3864 are used for. */
3866 tree
3868 {
3869 tree inner;
3871 /* If the tree evaluates to a constant, then we don't want to hide that
3872 fact (i.e. this allows further folding, and direct checks for constants).
3873 However, a read-only object that has side effects cannot be bypassed.
3874 Since it is no problem to reevaluate literals, we just return the
3875 literal node. */
3883 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3884 it means that the size or offset of some field of an object depends on
3885 the value within another field.
3887 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3888 and some variable since it would then need to be both evaluated once and
3889 evaluated more than once. Front-ends must assure this case cannot
3890 happen by surrounding any such subexpressions in their own SAVE_EXPR
3891 and forcing evaluation at the proper time. */
3897 /* This expression might be placed ahead of a jump to ensure that the
3898 value was computed on both sides of the jump. So make sure it isn't
3899 eliminated as dead. */
3902 }
3904 /* Look inside EXPR into any simple arithmetic operations. Return the
3905 outermost non-arithmetic or non-invariant node. */
3907 tree
3909 {
3910 /* We don't care about whether this can be used as an lvalue in this
3911 context. */
3915 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3916 a constant, it will be more efficient to not make another SAVE_EXPR since
3917 it will allow better simplification and GCSE will be able to merge the
3918 computations if they actually occur. */
3920 {
3924 {
3929 else
3931 }
3932 else
3934 }
3937 }
3939 /* Look inside EXPR into simple arithmetic operations involving constants.
3940 Return the outermost non-arithmetic or non-constant node. */
3942 tree
3944 {
3949 {
3953 {
3958 else
3960 }
3961 else
3963 }
3966 }
3968 /* Return which tree structure is used by T. */
3970 enum tree_node_structure_enum
3972 {
3975 }
3977 /* Set various status flags when building a CALL_EXPR object T. */
3979 static void
3981 {
3986 /* Calls have side-effects, except those to const or pure functions. */
3989 /* Propagate TREE_READONLY of arguments for const functions. */
3995 {
4001 }
4005 }
4006 \f
4007 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4008 size or offset that depends on a field within a record. */
4010 bool
4012 {
4023 {
4025 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4026 position computations since they will be converted into a
4027 WITH_RECORD_EXPR involving the reference, which will assume
4028 here will be valid. */
4042 {
4044 /* Ignoring the first operand isn't quite right, but works best. */
4053 /* The save_expr function never wraps anything containing
4054 a PLACEHOLDER_EXPR. */
4059 }
4062 {
4070 }
4074 {
4076 {
4077 const_tree arg;
4078 const_call_expr_arg_iterator iter;
4083 }
4086 }
4090 }
4092 }
4094 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4095 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4096 field positions. */
4098 static bool
4100 {
4101 /* If the size contains a placeholder or the parent type (component type in
4102 the case of arrays) type involves a placeholder, this type does. */
4110 /* Now do type-specific checks. Note that the last part of the check above
4111 greatly limits what we have to do below. */
4113 {
4131 /* Here we just check the bounds. */
4136 /* We have already checked the component type above, so just check
4137 the domain type. Flexible array members have a null domain. */
4144 {
4145 tree field;
4156 }
4160 }
4161 }
4163 /* Wrapper around above function used to cache its result. */
4165 bool
4167 {
4170 /* If the contains_placeholder_bits field has been initialized,
4171 then we know the answer. */
4175 /* Indicate that we've seen this type node, and the answer is false.
4176 This is what we want to return if we run into recursion via fields. */
4179 /* Compute the real value. */
4182 /* Store the real value. */
4186 }
4187 \f
4188 /* Push tree EXP onto vector QUEUE if it is not already present. */
4190 static void
4192 {
4194 tree iter;
4202 }
4204 /* Given a tree EXP, find all occurrences of references to fields
4205 in a PLACEHOLDER_EXPR and place them in vector REFS without
4206 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4207 we assume here that EXP contains only arithmetic expressions
4208 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4209 argument list. */
4211 void
4213 {
4215 tree inner;
4218 /* We handle TREE_LIST and COMPONENT_REF separately. */
4220 {
4223 }
4225 {
4229 ;
4233 else
4235 }
4236 else
4238 {
4243 /* Variables allocated to static storage can stay. */
4249 /* This is the pattern built in ada/make_aligning_type. */
4252 {
4255 }
4257 /* Fall through. */
4275 }
4276 }
4278 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4279 return a tree with all occurrences of references to F in a
4280 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4281 CONST_DECLs. Note that we assume here that EXP contains only
4282 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4283 occurring only in their argument list. */
4285 tree
4287 {
4290 tree new_tree;
4292 /* We handle TREE_LIST and COMPONENT_REF separately. */
4294 {
4301 }
4303 {
4304 tree inner;
4306 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4307 and it is the right field, replace it with R. */
4311 ;
4313 /* The field. */
4319 /* If this expression hasn't been completed let, leave it alone. */
4327 new_tree
4329 }
4330 else
4332 {
4339 else
4346 /* Fall through. */
4354 {
4399 new_tree
4405 }
4409 {
4414 /* If we are trying to replace F with a constant or with another
4415 instance of one of the arguments of the call, inline back
4416 functions which do nothing else than computing a value from
4417 the arguments they are passed. This makes it possible to
4418 fold partially or entirely the replacement expression. */
4420 {
4424 else
4427 {
4430 }
4432 {
4436 }
4437 }
4440 {
4444 {
4448 }
4449 }
4452 {
4456 }
4457 else
4459 }
4464 }
4472 }
4474 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4475 for it within OBJ, a tree that is an object or a chain of references. */
4477 tree
4479 {
4482 tree new_tree;
4484 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4485 in the chain of OBJ. */
4487 {
4489 tree elt;
4519 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4520 survives until RTL generation, there will be an error. */
4522 }
4524 /* TREE_LIST is special because we need to look at TREE_VALUE
4525 and TREE_CHAIN, not TREE_OPERANDS. */
4527 {
4534 }
4535 else
4537 {
4550 {
4595 new_tree
4601 }
4605 {
4611 {
4615 {
4619 }
4620 }
4623 {
4627 }
4628 else
4630 }
4635 }
4643 }
4644 \f
4646 /* Subroutine of stabilize_reference; this is called for subtrees of
4647 references. Any expression with side-effects must be put in a SAVE_EXPR
4648 to ensure that it is only evaluated once.
4650 We don't put SAVE_EXPR nodes around everything, because assigning very
4651 simple expressions to temporaries causes us to miss good opportunities
4652 for optimizations. Among other things, the opportunity to fold in the
4653 addition of a constant into an addressing mode often gets lost, e.g.
4654 "y[i+1] += x;". In general, we take the approach that we should not make
4655 an assignment unless we are forced into it - i.e., that any non-side effect
4656 operator should be allowed, and that cse should take care of coalescing
4657 multiple utterances of the same expression should that prove fruitful. */
4659 static tree
4661 {
4662 tree result;
4665 /* We cannot ignore const expressions because it might be a reference
4666 to a const array but whose index contains side-effects. But we can
4667 ignore things that are actual constant or that already have been
4668 handled by this function. */
4674 {
4676 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4677 have side-effects. */
4680 /* FALLTHRU */
4688 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4689 so that it will only be evaluated once. */
4690 /* The reference (r) and comparison (<) classes could be handled as
4691 below, but it is generally faster to only evaluate them once. */
4697 /* Constants need no processing. In fact, we should never reach
4698 here. */
4702 /* Division is slow and tends to be compiled with jumps,
4703 especially the division by powers of 2 that is often
4704 found inside of an array reference. So do it just once. */
4710 /* Recursively stabilize each operand. */
4716 /* Recursively stabilize each operand. */
4722 }
4730 }
4732 /* Stabilize a reference so that we can use it any number of times
4733 without causing its operands to be evaluated more than once.
4734 Returns the stabilized reference. This works by means of save_expr,
4735 so see the caveats in the comments about save_expr.
4737 Also allows conversion expressions whose operands are references.
4738 Any other kind of expression is returned unchanged. */
4740 tree
4742 {
4743 tree result;
4747 {
4751 /* No action is needed in this case. */
4754 CASE_CONVERT:
4793 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4794 it wouldn't be ignored. This matters when dealing with
4795 volatiles. */
4798 /* If arg isn't a kind of lvalue we recognize, make no change.
4799 Caller should recognize the error for an invalid lvalue. */
4805 }
4814 }
4815 \f
4816 /* Low-level constructors for expressions. */
4818 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4819 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4821 void
4823 {
4824 tree node;
4829 /* We started out assuming this address is both invariant and constant, but
4830 does not have side effects. Now go down any handled components and see if
4831 any of them involve offsets that are either non-constant or non-invariant.
4832 Also check for side-effects.
4834 ??? Note that this code makes no attempt to deal with the case where
4835 taking the address of something causes a copy due to misalignment. */
4837 #define UPDATE_FLAGS(NODE) \
4838 do { tree _node = (NODE); \
4839 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4840 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4844 {
4845 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4846 array reference (probably made temporarily by the G++ front end),
4847 so ignore all the operands. */
4851 {
4857 }
4858 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4859 FIELD_DECL, apparently. The G++ front end can put something else
4860 there, at least temporarily. */
4863 {
4866 }
4867 }
4871 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4872 the address, since &(*a)->b is a form of addition. If it's a constant, the
4873 address is constant too. If it's a decl, its address is constant if the
4874 decl is static. Everything else is not constant and, furthermore,
4875 taking the address of a volatile variable is not volatile. */
4880 ;
4883 else
4884 {
4887 }
4892 #undef UPDATE_FLAGS
4893 }
4895 /* Build an expression of code CODE, data type TYPE, and operands as
4896 specified. Expressions and reference nodes can be created this way.
4897 Constants, decls, types and misc nodes cannot be.
4899 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4900 enough for all extant tree codes. */
4902 tree
4904 {
4905 tree t;
4913 }
4915 tree
4917 {
4919 tree t;
4935 {
4938 }
4941 {
4944 }
4946 {
4948 /* All of these have side-effects, no matter what their
4949 operands are. */
4955 /* Whether a dereference is readonly has nothing to do with whether
4956 its operand is readonly. */
4974 }
4977 }
4979 #define PROCESS_ARG(N) \
4980 do { \
4981 TREE_OPERAND (t, N) = arg##N; \
4982 if (arg##N &&!TYPE_P (arg##N)) \
4983 { \
4984 if (TREE_SIDE_EFFECTS (arg##N)) \
4985 side_effects = 1; \
4986 if (!TREE_READONLY (arg##N) \
4987 && !CONSTANT_CLASS_P (arg##N)) \
4988 (void) (read_only = 0); \
4989 if (!TREE_CONSTANT (arg##N)) \
4990 (void) (constant = 0); \
4991 } \
4992 } while (0)
4994 tree
4996 {
4998 tree t;
5004 /* When sizetype precision doesn't match that of pointers
5005 we need to be able to build explicit extensions or truncations
5006 of the offset argument. */
5018 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5019 result based on those same flags for the arguments. But if the
5020 arguments aren't really even `tree' expressions, we shouldn't be trying
5021 to do this. */
5023 /* Expressions without side effects may be constant if their
5024 arguments are as well. */
5031 {
5045 }
5052 {
5054 {
5058 }
5059 }
5060 else
5061 {
5063 /* Don't mark X / 0 as constant. */
5068 }
5071 }
5074 tree
5076 tree arg2 MEM_STAT_DECL)
5077 {
5079 tree t;
5089 /* As a special exception, if COND_EXPR has NULL branches, we
5090 assume that it is a gimple statement and always consider
5091 it to have side effects. */
5097 else
5113 }
5115 tree
5118 {
5120 tree t;
5140 }
5142 tree
5145 {
5147 tree t;
5164 {
5166 {
5170 }
5171 }
5172 else
5178 }
5180 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5181 on the pointer PTR. */
5183 tree
5185 {
5188 tree tem;
5189 /* For convenience allow addresses that collapse to a simple base
5190 and offset. */
5194 {
5198 {
5201 }
5202 else
5205 }
5210 }
5212 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5214 poly_offset_int
5216 {
5218 SIGNED);
5219 }
5221 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5222 offsetted by OFFSET units. */
5224 tree
5226 {
5233 }
5235 /* Similar except don't specify the TREE_TYPE
5236 and leave the TREE_SIDE_EFFECTS as 0.
5237 It is permissible for arguments to be null,
5238 or even garbage if their values do not matter. */
5240 tree
5242 {
5243 tree t;
5260 }
5262 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5263 tree vec. */
5265 tree
5267 {
5277 }
5278 \f
5279 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5280 and data type TYPE.
5281 We do NOT enter this node in any sort of symbol table.
5283 LOC is the location of the decl.
5285 layout_decl is used to set up the decl's storage layout.
5286 Other slots are initialized to 0 or null pointers. */
5288 tree
5290 tree type MEM_STAT_DECL)
5291 {
5292 tree t;
5297 /* if (type == error_mark_node)
5298 type = integer_type_node; */
5299 /* That is not done, deliberately, so that having error_mark_node
5300 as the type can suppress useless errors in the use of this variable. */
5309 }
5311 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5313 tree
5315 {
5321 }
5323 /* Builds and returns function declaration with NAME and TYPE. */
5325 tree
5327 {
5337 }
5341 /* Builds a new translation-unit decl with name NAME, queues it in the
5342 global list of translation-unit decls and returns it. */
5344 tree
5346 {
5352 }
5354 \f
5355 /* BLOCK nodes are used to represent the structure of binding contours
5356 and declarations, once those contours have been exited and their contents
5357 compiled. This information is used for outputting debugging info. */
5359 tree
5361 {
5369 }
5371 \f
5372 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5374 LOC is the location to use in tree T. */
5376 void
5378 {
5382 {
5386 }
5387 }
5389 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5390 UNKNOWN_LOCATION. */
5392 void
5394 {
5398 }
5399 \f
5400 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5401 of the various TYPE_QUAL values. */
5403 static void
5405 {
5411 }
5413 /* Returns true iff CAND and BASE have equivalent language-specific
5414 qualifiers. */
5416 bool
5418 {
5421 /* type_hash_eq currently only applies to these types. */
5426 }
5428 /* This function checks to see if TYPE matches the size one of the built-in
5429 atomic types, and returns that core atomic type. */
5431 static tree
5433 {
5434 tree base_atomic_type;
5436 /* Only handle complete types. */
5441 {
5464 }
5467 }
5469 /* Returns true iff unqualified CAND and BASE are equivalent. */
5471 bool
5473 {
5475 /* Apparently this is needed for Objective-C. */
5480 /* Check alignment. */
5484 /* Atomic types increase minimal alignment. We must to do so as well
5485 or we get duplicated canonical types. See PR88686. */
5487 {
5488 /* See if this object can map to a basic atomic type. */
5492 }
5494 }
5496 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5498 bool
5500 {
5504 }
5506 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5508 static bool
5510 {
5513 /* Apparently this is needed for Objective-C. */
5515 /* Check alignment. */
5517 /* Check this is a user-aligned type as build_aligned_type
5518 would create. */
5523 }
5525 /* Return a version of the TYPE, qualified as indicated by the
5526 TYPE_QUALS, if one exists. If no qualified version exists yet,
5527 return NULL_TREE. */
5529 tree
5531 {
5539 /* Search the chain of variants to see if there is already one there just
5540 like the one we need to have. If so, use that existing one. We must
5541 preserve the TYPE_NAME, since there is code that depends on this. */
5544 {
5545 /* Put the found variant at the head of the variant list so
5546 frequently searched variants get found faster. The C++ FE
5547 benefits greatly from this. */
5553 }
5556 }
5558 /* Like get_qualified_type, but creates the type if it does not
5559 exist. This function never returns NULL_TREE. */
5561 tree
5563 {
5564 tree t;
5566 /* See if we already have the appropriate qualified variant. */
5569 /* If not, build it. */
5571 {
5576 {
5577 /* See if this object can map to a basic atomic type. */
5580 {
5581 /* Ensure the alignment of this type is compatible with
5582 the required alignment of the atomic type. */
5585 }
5586 }
5589 /* Propagate structural equality. */
5592 /* Build the underlying canonical type, since it is different
5593 from TYPE. */
5594 {
5597 }
5598 else
5599 /* T is its own canonical type. */
5602 }
5605 }
5607 /* Create a variant of type T with alignment ALIGN. */
5609 tree
5611 {
5612 tree t;
5627 }
5629 /* Create a new distinct copy of TYPE. The new type is made its own
5630 MAIN_VARIANT. If TYPE requires structural equality checks, the
5631 resulting type requires structural equality checks; otherwise, its
5632 TYPE_CANONICAL points to itself. */
5634 tree
5636 {
5642 /* Set the canonical type either to a new equivalence class, or
5643 propagate the need for structural equality checks. */
5646 else
5649 /* Make it its own variant. */
5653 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5654 whose TREE_TYPE is not t. This can also happen in the Ada
5655 frontend when using subtypes. */
5658 }
5660 /* Create a new variant of TYPE, equivalent but distinct. This is so
5661 the caller can modify it. TYPE_CANONICAL for the return type will
5662 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5663 are considered equal by the language itself (or that both types
5664 require structural equality checks). */
5666 tree
5668 {
5673 /* Since we're building a variant, assume that it is a non-semantic
5674 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5676 /* Type variants have no alias set defined. */
5679 /* Add the new type to the chain of variants of TYPE. */
5685 }
5686 \f
5687 /* Return true if the from tree in both tree maps are equal. */
5689 int
5691 {
5695 }
5697 /* Hash a from tree in a tree_base_map. */
5699 unsigned int
5701 {
5703 }
5705 /* Return true if this tree map structure is marked for garbage collection
5706 purposes. We simply return true if the from tree is marked, so that this
5707 structure goes away when the from tree goes away. */
5709 int
5711 {
5713 }
5715 /* Hash a from tree in a tree_map. */
5717 unsigned int
5719 {
5721 }
5723 /* Hash a from tree in a tree_decl_map. */
5725 unsigned int
5727 {
5729 }
5731 /* Return the initialization priority for DECL. */
5733 priority_type
5735 {
5740 return
5742 }
5744 /* Return the finalization priority for DECL. */
5746 priority_type
5748 {
5753 return
5755 }
5757 /* Set the initialization priority for DECL to PRIORITY. */
5759 void
5761 {
5765 {
5769 }
5772 else
5775 }
5777 /* Set the finalization priority for DECL to PRIORITY. */
5779 void
5781 {
5785 {
5789 }
5790 else
5793 }
5795 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5797 static void
5799 {
5804 }
5806 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5808 static void
5810 {
5815 }
5817 /* Lookup a debug expression for FROM, and return it if we find one. */
5819 tree
5821 {
5829 }
5831 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5833 void
5835 {
5842 }
5844 /* Lookup a value expression for FROM, and return it if we find one. */
5846 tree
5848 {
5856 }
5858 /* Insert a mapping FROM->TO in the value expression hashtable. */
5860 void
5862 {
5869 }
5871 /* Lookup a vector of debug arguments for FROM, and return it if we
5872 find one. */
5876 {
5887 }
5889 /* Insert a mapping FROM->empty vector of debug arguments in the value
5890 expression hashtable. */
5894 {
5909 }
5911 /* Hashing of types so that we don't make duplicates.
5912 The entry point is `type_hash_canon'. */
5914 /* Generate the default hash code for TYPE. This is designed for
5915 speed, rather than maximum entropy. */
5917 hashval_t
5919 {
5928 /* Just the identifier is adequate to distinguish. */
5932 {
5935 /* FALLTHROUGH. */
5947 {
5951 {
5954 }
5955 }
5959 {
5966 }
5970 {
5974 }
5982 }
5985 }
5987 /* These are the Hashtable callback functions. */
5989 /* Returns true iff the types are equivalent. */
5991 bool
5993 {
5994 /* First test the things that are the same for all types. */
6004 /* Be careful about comparing arrays before and after the element type
6005 has been completed; don't compare TYPE_ALIGN unless both types are
6006 complete. */
6013 {
6036 /* fall through */
6068 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6069 where the flag should be inherited from the element type
6070 and can change after ARRAY_TYPEs are created; on non-aggregates
6071 compare it and hash it, scalars will never have that flag set
6072 and we need to differentiate between arrays created by different
6073 front-ends or middle-end created arrays. */
6105 }
6111 }
6113 /* Given TYPE, and HASHCODE its hash code, return the canonical
6114 object for an identical type if one already exists.
6115 Otherwise, return TYPE, and record it as the canonical object.
6117 To use this function, first create a type of the sort you want.
6118 Then compute its hash code from the fields of the type that
6119 make it different from other similar types.
6120 Then call this function and use the value. */
6122 tree
6124 {
6125 type_hash in;
6128 /* The hash table only contains main variants, so ensure that's what we're
6129 being passed. */
6132 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6133 must call that routine before comparing TYPE_ALIGNs. */
6141 {
6147 /* Free also min/max values and the cache for integer
6148 types. This can't be done in free_node, as LTO frees
6149 those on its own. */
6151 {
6154 {
6155 /* Zero is always in TYPE_CACHED_VALUES. */
6159 }
6162 {
6165 }
6168 }
6171 }
6172 else
6173 {
6182 }
6183 }
6185 static void
6187 {
6192 }
6194 /* Given two lists of types
6195 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6196 return 1 if the lists contain the same types in the same order.
6197 Also, the TREE_PURPOSEs must match. */
6199 bool
6201 {
6213 }
6215 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6216 given by TYPE. If the argument list accepts variable arguments,
6217 then this function counts only the ordinary arguments. */
6219 int
6221 {
6225 /* If the function does not take a variable number of arguments,
6226 the last element in the list will have type `void'. */
6229 else
6233 }
6235 /* Return the type of the function TYPE's argument ARGNO if known.
6236 For vararg function's where ARGNO refers to one of the variadic
6237 arguments return null. Otherwise, return a void_type_node for
6238 out-of-bounds ARGNO. */
6240 tree
6242 {
6243 /* Treat zero the same as an out-of-bounds argument number. */
6247 function_args_iterator iter;
6249 tree argtype;
6252 {
6253 /* A vararg function's argument list ends in a null. Otherwise,
6254 an ordinary function's argument list ends with void. Return
6255 null if ARGNO refers to a vararg argument, void_type_node if
6256 it's out of bounds, and the formal argument type otherwise. */
6264 }
6267 }
6269 /* Nonzero if integer constants T1 and T2
6270 represent the same constant value. */
6272 int
6274 {
6290 }
6292 /* Return true if T is an INTEGER_CST whose numerical value (extended
6293 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6295 bool
6297 {
6301 }
6303 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6304 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6306 bool
6308 {
6312 {
6317 }
6320 }
6322 /* Return true if T is an INTEGER_CST whose numerical value (extended
6323 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6325 bool
6327 {
6331 }
6333 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6334 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6336 bool
6338 {
6342 {
6347 }
6350 }
6352 /* T is an INTEGER_CST whose numerical value (extended according to
6353 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6354 HOST_WIDE_INT. */
6356 HOST_WIDE_INT
6358 {
6361 }
6363 /* T is an INTEGER_CST whose numerical value (extended according to
6364 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6365 HOST_WIDE_INT. */
6367 unsigned HOST_WIDE_INT
6369 {
6372 }
6374 /* Return the most significant (sign) bit of T. */
6376 int
6378 {
6382 }
6384 /* Return an indication of the sign of the integer constant T.
6385 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6386 Note that -1 will never be returned if T's type is unsigned. */
6388 int
6390 {
6397 else
6399 }
6401 /* Return the minimum number of bits needed to represent VALUE in a
6402 signed or unsigned type, UNSIGNEDP says which. */
6404 unsigned int
6406 {
6407 /* If the value is negative, compute its negative minus 1. The latter
6408 adjustment is because the absolute value of the largest negative value
6409 is one larger than the largest positive value. This is equivalent to
6410 a bit-wise negation, so use that operation instead. */
6415 /* Return the number of bits needed, taking into account the fact
6416 that we need one more bit for a signed than unsigned type.
6417 If value is 0 or -1, the minimum precision is 1 no matter
6418 whether unsignedp is true or false. */
6422 else
6424 }
6426 /* Return truthvalue of whether T1 is the same tree structure as T2.
6427 Return 1 if they are the same.
6428 Return 0 if they are understandably different.
6429 Return -1 if either contains tree structure not understood by
6430 this function. */
6432 int
6434 {
6444 /* For location wrappers to be the same, they must be at the same
6445 source location (and wrap the same thing). */
6447 {
6451 }
6457 {
6461 else
6463 }
6473 {
6489 {
6498 /* ??? Should we handle also fields here? */
6502 }
6513 {
6521 {
6525 }
6527 }
6530 /* Special case: if either target is an unallocated VAR_DECL,
6531 it means that it's going to be unified with whatever the
6532 TARGET_EXPR is really supposed to initialize, so treat it
6533 as being equivalent to anything. */
6541 else
6570 /* A false return means maybe_ne rather than known_ne. */
6576 }
6578 /* This general rule works for most tree codes. All exceptions should be
6579 handled above. If this is a language-specific tree code, we can't
6580 trust what might be in the operand, so say we don't know
6581 the situation. */
6586 {
6595 {
6599 }
6605 }
6606 }
6608 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6609 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6610 than U, respectively. */
6612 int
6614 {
6623 else
6625 }
6627 /* Return true if SIZE represents a constant size that is in bounds of
6628 what the middle-end and the backend accepts (covering not more than
6629 half of the address-space).
6630 When PERR is non-null, set *PERR on failure to the description of
6631 why SIZE is not valid. */
6633 bool
6635 {
6637 {
6644 }
6646 cst_size_error error;
6651 {
6654 }
6657 {
6660 }
6663 {
6666 }
6670 {
6673 }
6676 }
6678 /* Return the precision of the type, or for a complex or vector type the
6679 precision of the type of its elements. */
6681 unsigned int
6683 {
6691 }
6693 /* Return true if CODE represents an associative tree code. Otherwise
6694 return false. */
6695 bool
6697 {
6699 {
6711 }
6713 }
6715 /* Return true if CODE represents a commutative tree code. Otherwise
6716 return false. */
6717 bool
6719 {
6721 {
6748 }
6750 }
6752 /* Return true if CODE represents a ternary tree code for which the
6753 first two operands are commutative. Otherwise return false. */
6754 bool
6756 {
6758 {
6766 }
6768 }
6770 /* Returns true if CODE can overflow. */
6772 bool
6774 {
6776 {
6781 /* Can overflow in various ways. */
6787 /* For INT_MIN / -1. */
6791 /* For -INT_MIN. */
6794 /* These operators cannot overflow. */
6796 }
6797 }
6799 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6800 ftrapv doesn't generate trapping insns for CODE. */
6802 bool
6804 {
6807 /* We don't generate instructions that trap on overflow for complex or vector
6808 types. */
6816 {
6822 /* These operators can overflow, and -ftrapv generates trapping code for
6823 these. */
6830 /* These operators can overflow, but -ftrapv does not generate trapping
6831 code for these. */
6834 /* These operators cannot overflow. */
6836 }
6837 }
6839 /* Constructors for pointer, array and function types.
6840 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6841 constructed by language-dependent code, not here.) */
6843 /* Construct, lay out and return the type of pointers to TO_TYPE with
6844 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6845 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6846 indicate this type can reference all of memory. If such a type has
6847 already been constructed, reuse it. */
6849 tree
6852 {
6853 tree t;
6860 {
6863 }
6865 /* If the pointed-to type has the may_alias attribute set, force
6866 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6870 /* In some cases, languages will have things that aren't a POINTER_TYPE
6871 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6872 In that case, return that type without regard to the rest of our
6873 operands.
6875 ??? This is a kludge, but consistent with the way this function has
6876 always operated and there doesn't seem to be a good way to avoid this
6877 at the moment. */
6882 /* First, if we already have a type for pointers to TO_TYPE and it's
6883 the proper mode, use it. */
6896 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6904 /* Lay out the type. This function has many callers that are concerned
6905 with expression-construction, and this simplifies them all. */
6909 }
6911 /* By default build pointers in ptr_mode. */
6913 tree
6915 {
6917 }
6919 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6921 tree
6924 {
6925 tree t;
6932 {
6935 }
6937 /* If the pointed-to type has the may_alias attribute set, force
6938 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6942 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6943 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6944 In that case, return that type without regard to the rest of our
6945 operands.
6947 ??? This is a kludge, but consistent with the way this function has
6948 always operated and there doesn't seem to be a good way to avoid this
6949 at the moment. */
6954 /* First, if we already have a type for pointers to TO_TYPE and it's
6955 the proper mode, use it. */
6968 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6979 }
6982 /* Build the node for the type of references-to-TO_TYPE by default
6983 in ptr_mode. */
6985 tree
6987 {
6989 }
6991 #define MAX_INT_CACHED_PREC \
6992 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6995 static void
6997 {
6999 {
7001 }
7002 }
7004 /* Builds a signed or unsigned integer type of precision PRECISION.
7005 Used for C bitfields whose precision does not match that of
7006 built-in target types. */
7007 tree
7010 {
7017 {
7021 }
7028 else
7038 }
7040 #define MAX_BOOL_CACHED_PREC \
7041 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7044 /* Builds a boolean type of precision PRECISION.
7045 Used for boolean vectors to choose proper vector element size. */
7046 tree
7048 {
7049 tree type;
7052 {
7056 }
7066 }
7068 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7069 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7070 is true, reuse such a type that has already been constructed. */
7072 static tree
7074 {
7097 {
7098 /* Since we cannot reliably merge this type, we need to compare it using
7099 structural equality checks. */
7102 }
7108 }
7110 /* Wrapper around build_range_type_1 with SHARED set to true. */
7112 tree
7114 {
7116 }
7118 /* Wrapper around build_range_type_1 with SHARED set to false. */
7120 tree
7122 {
7124 }
7126 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7127 MAXVAL should be the maximum value in the domain
7128 (one less than the length of the array).
7130 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7131 We don't enforce this limit, that is up to caller (e.g. language front end).
7132 The limit exists because the result is a signed type and we don't handle
7133 sizes that use more than one HOST_WIDE_INT. */
7135 tree
7137 {
7139 }
7141 /* Return true if the debug information for TYPE, a subtype, should be emitted
7142 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7143 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7144 debug info and doesn't reflect the source code. */
7146 bool
7148 {
7151 /* Subrange types have a base type which is an integral type. */
7155 /* Get the real bounds of the subtype. */
7158 else
7159 {
7162 }
7164 /* If the type and its base type have the same representation and the same
7165 name, then the type is not a subrange but a copy of the base type. */
7179 }
7181 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7182 and number of elements specified by the range of values of INDEX_TYPE.
7183 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7184 If SHARED is true, reuse such a type that has already been constructed.
7185 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7187 tree
7190 {
7191 tree t;
7194 {
7197 }
7207 {
7210 }
7213 {
7222 index_type
7225 }
7228 }
7230 /* Wrapper around build_array_type_1 with SHARED set to true. */
7232 tree
7234 {
7235 return
7237 }
7239 /* Wrapper around build_array_type_1 with SHARED set to false. */
7241 tree
7243 {
7245 }
7247 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7248 sizetype. */
7250 tree
7252 {
7254 }
7256 /* Recursively examines the array elements of TYPE, until a non-array
7257 element type is found. */
7259 tree
7261 {
7266 }
7268 /* Computes the canonical argument types from the argument type list
7269 ARGTYPES.
7271 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7272 on entry to this function, or if any of the ARGTYPES are
7273 structural.
7275 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7276 true on entry to this function, or if any of the ARGTYPES are
7277 non-canonical.
7279 Returns a canonical argument list, which may be ARGTYPES when the
7280 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7281 true) or would not differ from ARGTYPES. */
7283 static tree
7287 {
7288 tree arg;
7292 {
7294 /* Fail gracefully by stating that the type is structural. */
7300 /* If the argument has a default argument, we consider it
7301 non-canonical even though the type itself is canonical.
7302 That way, different variants of function and method types
7303 with default arguments will all point to the variant with
7304 no defaults as their canonical type. */
7306 }
7312 {
7313 /* Build the canonical list of argument types. */
7318 {
7321 else
7324 canon_argtypes);
7325 }
7331 /* There is a non-canonical type. */
7334 }
7336 /* The canonical argument types are the same as ARGTYPES. */
7338 }
7340 /* Construct, lay out and return
7341 the type of functions returning type VALUE_TYPE
7342 given arguments of types ARG_TYPES.
7343 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7344 are data type nodes for the arguments of the function.
7345 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7346 variable-arguments function with (...) prototype (no named arguments).
7347 If such a type has already been constructed, reuse it. */
7349 tree
7352 {
7353 tree t;
7356 tree canon_argtypes;
7361 {
7364 }
7366 /* Make a node of the sort we want. */
7371 {
7374 }
7376 /* If we already have such a type, use the old one. */
7380 /* Set up the canonical type. */
7390 canon_argtypes);
7395 }
7397 /* Build a function type. The RETURN_TYPE is the type returned by the
7398 function. If VAARGS is set, no void_type_node is appended to the
7399 list. ARGP must be always be terminated be a NULL_TREE. */
7401 static tree
7403 {
7411 {
7416 }
7419 else
7420 {
7424 }
7428 }
7430 /* Build a function type. The RETURN_TYPE is the type returned by the
7431 function. If additional arguments are provided, they are
7432 additional argument types. The list of argument types must always
7433 be terminated by NULL_TREE. */
7435 tree
7437 {
7438 tree args;
7445 }
7447 /* Build a variable argument function type. The RETURN_TYPE is the
7448 type returned by the function. If additional arguments are provided,
7449 they are additional argument types. The list of argument types must
7450 always be terminated by NULL_TREE. */
7452 tree
7454 {
7455 tree args;
7463 }
7465 /* Build a function type. RETURN_TYPE is the type returned by the
7466 function; VAARGS indicates whether the function takes varargs. The
7467 function takes N named arguments, the types of which are provided in
7468 ARG_TYPES. */
7470 static tree
7473 {
7481 }
7483 /* Build a function type. RETURN_TYPE is the type returned by the
7484 function. The function takes N named arguments, the types of which
7485 are provided in ARG_TYPES. */
7487 tree
7489 {
7491 }
7493 /* Build a variable argument function type. RETURN_TYPE is the type
7494 returned by the function. The function takes N named arguments, the
7495 types of which are provided in ARG_TYPES. */
7497 tree
7499 {
7501 }
7503 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7504 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7505 for the method. An implicit additional parameter (of type
7506 pointer-to-BASETYPE) is added to the ARGTYPES. */
7508 tree
7510 tree rettype,
7511 tree argtypes)
7512 {
7513 tree t;
7514 tree ptype;
7516 tree canon_argtypes;
7518 /* Make a node of the sort we want. */
7525 /* The actual arglist for this function includes a "hidden" argument
7526 which is "this". Put it into the list of argument types. */
7530 /* If we already have such a type, use the old one. */
7534 /* Set up the canonical type. */
7535 any_structural_p
7538 any_noncanonical_p
7550 canon_argtypes);
7555 }
7557 /* Construct, lay out and return the type of methods belonging to class
7558 BASETYPE and whose arguments and values are described by TYPE.
7559 If that type exists already, reuse it.
7560 TYPE must be a FUNCTION_TYPE node. */
7562 tree
7564 {
7570 }
7572 /* Construct, lay out and return the type of offsets to a value
7573 of type TYPE, within an object of type BASETYPE.
7574 If a suitable offset type exists already, reuse it. */
7576 tree
7578 {
7579 tree t;
7581 /* Make a node of the sort we want. */
7587 /* If we already have such a type, use the old one. */
7595 {
7604 }
7607 }
7609 /* Create a complex type whose components are COMPONENT_TYPE.
7611 If NAMED is true, the type is given a TYPE_NAME. We do not always
7612 do so because this creates a DECL node and thus make the DECL_UIDs
7613 dependent on the type canonicalization hashtable, which is GC-ed,
7614 so the DECL_UIDs would not be stable wrt garbage collection. */
7616 tree
7618 {
7623 /* Make a node of the sort we want. */
7628 /* If we already have such a type, use the old one. */
7633 {
7634 /* We created a new type. The hash insertion will have laid
7635 out the type. We need to check the canonicalization and
7636 maybe set the name. */
7647 /* We need to create a name, since complex is a fundamental type. */
7649 {
7678 }
7679 }
7682 }
7684 /* If TYPE is a real or complex floating-point type and the target
7685 does not directly support arithmetic on TYPE then return the wider
7686 type to be used for arithmetic on TYPE. Otherwise, return
7687 NULL_TREE. */
7689 tree
7691 {
7692 /* The target can give two different responses to the question of
7693 which excess precision mode it would like depending on whether we
7694 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7696 enum excess_precision_type requested_type
7698 ? EXCESS_PRECISION_TYPE_FAST
7702 enum flt_eval_method target_flt_eval_method
7705 /* The target should not ask for unpredictable float evaluation (though
7706 it might advertise that implicitly the evaluation is unpredictable,
7707 but we don't care about that here, it will have been reported
7708 elsewhere). If it does ask for unpredictable evaluation, we have
7709 nothing to do here. */
7712 /* Nothing to do. The target has asked for all types we know about
7713 to be computed with their native precision and range. */
7717 /* The target will promote this type in a target-dependent way, so excess
7718 precision ought to leave it alone. */
7722 machine_mode float16_type_mode = (float16_type_node
7725 machine_mode bfloat16_type_mode = (bfloat16_type_node
7732 {
7734 {
7737 {
7758 }
7760 }
7762 {
7767 {
7788 }
7790 }
7793 }
7796 }
7797 \f
7798 /* Return OP, stripped of any conversions to wider types as much as is safe.
7799 Converting the value back to OP's type makes a value equivalent to OP.
7801 If FOR_TYPE is nonzero, we return a value which, if converted to
7802 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7804 OP must have integer, real or enumeral type. Pointers are not allowed!
7806 There are some cases where the obvious value we could return
7807 would regenerate to OP if converted to OP's type,
7808 but would not extend like OP to wider types.
7809 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7810 For example, if OP is (unsigned short)(signed char)-1,
7811 we avoid returning (signed char)-1 if FOR_TYPE is int,
7812 even though extending that to an unsigned short would regenerate OP,
7813 since the result of extending (signed char)-1 to (int)
7814 is different from (int) OP. */
7816 tree
7818 {
7819 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7821 unsigned final_prec
7823 int uns
7830 {
7833 /* TYPE_PRECISION on vector types has different meaning
7834 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7835 so avoid them here. */
7842 /* Truncations are many-one so cannot be removed.
7843 Unless we are later going to truncate down even farther. */
7848 /* See what's inside this conversion. If we decide to strip it,
7849 we will set WIN. */
7852 /* If we have not stripped any zero-extensions (uns is 0),
7853 we can strip any kind of extension.
7854 If we have previously stripped a zero-extension,
7855 only zero-extensions can safely be stripped.
7856 Any extension can be stripped if the bits it would produce
7857 are all going to be discarded later by truncating to FOR_TYPE. */
7860 {
7863 /* TYPE_UNSIGNED says whether this is a zero-extension.
7864 Let's avoid computing it if it does not affect WIN
7865 and if UNS will not be needed again. */
7869 {
7872 }
7873 }
7874 }
7876 /* If we finally reach a constant see if it fits in sth smaller and
7877 in that case convert it. */
7879 {
7885 {
7889 }
7890 }
7893 }
7894 \f
7895 /* Return OP or a simpler expression for a narrower value
7896 which can be sign-extended or zero-extended to give back OP.
7897 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7898 or 0 if the value should be sign-extended. */
7900 tree
7902 {
7909 {
7910 do
7924 ret);
7926 }
7928 {
7929 int bitschange
7933 /* Truncations are many-one so cannot be removed. */
7937 /* See what's inside this conversion. If we decide to strip it,
7938 we will set WIN. */
7941 {
7943 /* An extension: the outermost one can be stripped,
7944 but remember whether it is zero or sign extension. */
7947 /* Otherwise, if a sign extension has been stripped,
7948 only sign extensions can now be stripped;
7949 if a zero extension has been stripped, only zero-extensions. */
7953 }
7955 {
7956 /* A change in nominal type can always be stripped, but we must
7957 preserve the unsignedness. */
7962 /* Keep trying to narrow, but don't assign op to win if it
7963 would turn an integral type into something else. */
7966 }
7969 }
7972 /* Since type_for_size always gives an integer type. */
7975 /* Ensure field is laid out already. */
7978 {
7979 unsigned HOST_WIDE_INT innerprec
7985 /* We can get this structure field in a narrower type that fits it,
7986 but the resulting extension to its nominal type (a fullword type)
7987 must satisfy the same conditions as for other extensions.
7989 Do this only for fields that are aligned (not bit-fields),
7990 because when bit-field insns will be used there is no
7991 advantage in doing this. */
7997 {
8001 }
8002 }
8006 }
8007 \f
8008 /* Return true if integer constant C has a value that is permissible
8009 for TYPE, an integral type. */
8011 bool
8013 {
8018 /* Non-standard boolean types can have arbitrary precision but various
8019 transformations assume that they can only take values 0 and +/-1. */
8023 retry:
8027 /* If at least one bound of the type is a constant integer, we can check
8028 ourselves and maybe make a decision. If no such decision is possible, but
8029 this type is a subtype, try checking against that. Otherwise, use
8030 fits_to_tree_p, which checks against the precision.
8032 Compute the status for each possibly constant bound, and return if we see
8033 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8034 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8035 for "constant known to fit". */
8037 /* Check if c >= type_low_bound. */
8039 {
8043 }
8044 else
8047 /* Check if c <= type_high_bound. */
8049 {
8053 }
8054 else
8057 /* If the constant fits both bounds, the result is known. */
8061 /* Perform some generic filtering which may allow making a decision
8062 even if the bounds are not constant. First, negative integers
8063 never fit in unsigned types, */
8067 /* Second, narrower types always fit in wider ones. */
8071 /* Third, unsigned integers with top bit set never fit signed types. */
8073 {
8076 {
8077 /* When a tree_cst is converted to a wide-int, the precision
8078 is taken from the type. However, if the precision of the
8079 mode underneath the type is smaller than that, it is
8080 possible that the value will not fit. The test below
8081 fails if any bit is set between the sign bit of the
8082 underlying mode and the top bit of the type. */
8085 }
8088 }
8090 /* If we haven't been able to decide at this point, there nothing more we
8091 can check ourselves here. Look at the base type if we have one and it
8092 has the same precision. */
8096 {
8099 }
8101 /* Or to fits_to_tree_p, if nothing else. */
8103 }
8105 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8106 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8107 represented (assuming two's-complement arithmetic) within the bit
8108 precision of the type are returned instead. */
8110 void
8112 {
8116 else
8117 {
8120 else
8121 {
8124 }
8125 }
8130 else
8131 {
8134 }
8135 }
8137 /* Return true if VAR is an automatic variable. */
8139 bool
8141 {
8146 }
8148 /* Return true if VAR is an automatic variable defined in function FN. */
8150 bool
8152 {
8156 }
8158 /* Subprogram of following function. Called by walk_tree.
8160 Return *TP if it is an automatic variable or parameter of the
8161 function passed in as DATA. */
8163 static tree
8165 {
8176 }
8178 /* Returns true if T is, contains, or refers to a type with variable
8179 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8180 arguments, but not the return type. If FN is nonzero, only return
8181 true if a modifier of the type or position of FN is a variable or
8182 parameter inside FN.
8184 This concept is more general than that of C99 'variably modified types':
8185 in C99, a struct type is never variably modified because a VLA may not
8186 appear as a structure member. However, in GNU C code like:
8188 struct S { int i[f()]; };
8190 is valid, and other languages may define similar constructs. */
8192 bool
8194 {
8195 tree t;
8197 /* Test if T is either variable (if FN is zero) or an expression containing
8198 a variable in FN. If TYPE isn't gimplified, return true also if
8199 gimplify_one_sizepos would gimplify the expression into a local
8200 variable. */
8201 #define RETURN_TRUE_IF_VAR(T) \
8202 do { tree _t = (T); \
8203 if (_t != NULL_TREE \
8204 && _t != error_mark_node \
8205 && !CONSTANT_CLASS_P (_t) \
8206 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8207 && (!fn \
8208 || (!TYPE_SIZES_GIMPLIFIED (type) \
8209 && (TREE_CODE (_t) != VAR_DECL \
8210 && !CONTAINS_PLACEHOLDER_P (_t))) \
8211 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8212 return true; } while (0)
8217 /* If TYPE itself has variable size, it is variably modified. */
8222 {
8226 /* Ada can have pointer types refering to themselves indirectly. */
8231 {
8234 }
8240 /* If TYPE is a function type, it is variably modified if the
8241 return type is variably modified. */
8251 /* Scalar types are variably modified if their end points
8252 aren't constant. */
8260 /* We can't see if any of the fields are variably-modified by the
8261 definition we normally use, since that would produce infinite
8262 recursion via pointers. */
8263 /* This is variably modified if some field's type is. */
8266 {
8271 /* If the type is a qualified union, then the DECL_QUALIFIER
8272 of fields can also be an expression containing a variable. */
8276 /* If the field is a qualified union, then it's only a container
8277 for what's inside so we look into it. That's necessary in LTO
8278 mode because the sizes of the field tested above have been set
8279 to PLACEHOLDER_EXPRs by free_lang_data. */
8283 }
8287 /* Do not call ourselves to avoid infinite recursion. This is
8288 variably modified if the element type is. */
8295 }
8297 /* The current language may have other cases to check, but in general,
8298 all other types are not variably modified. */
8301 #undef RETURN_TRUE_IF_VAR
8302 }
8304 /* Given a DECL or TYPE, return the scope in which it was declared, or
8305 NULL_TREE if there is no containing scope. */
8307 tree
8309 {
8311 }
8313 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8315 const_tree
8317 {
8319 {
8322 else
8324 }
8326 }
8328 /* Return the innermost context enclosing DECL that is
8329 a FUNCTION_DECL, or zero if none. */
8331 tree
8333 {
8334 tree context;
8339 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8340 where we look up the function at runtime. Such functions always take
8341 a first argument of type 'pointer to real context'.
8343 C++ should really be fixed to use DECL_CONTEXT for the real context,
8344 and use something else for the "virtual context". */
8346 context
8347 = TYPE_MAIN_VARIANT
8349 else
8353 {
8356 else
8358 }
8361 }
8363 /* Return the innermost context enclosing DECL that is
8364 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8365 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8367 tree
8369 {
8374 {
8395 }
8398 }
8400 /* CALL is a CALL_EXPR. Return the declaration for the function
8401 called, or NULL_TREE if the called function cannot be
8402 determined. */
8404 tree
8406 {
8407 tree addr;
8412 /* It's invalid to call this function with anything but a
8413 CALL_EXPR. */
8416 /* The first operand to the CALL is the address of the function
8417 called. */
8420 /* If there is no function, return early. */
8426 /* If this is a readonly function pointer, extract its initial value. */
8432 /* If the address is just `&f' for some function `f', then we know
8433 that `f' is being called. */
8438 /* We couldn't figure out what was being called. */
8440 }
8442 /* Return true when STMTs arguments and return value match those of FNDECL,
8443 a decl of a builtin function. */
8445 static bool
8447 {
8465 {
8466 /* Variadic args follow. */
8474 {
8475 /* For pointer arguments be more forgiving, e.g. due to
8476 FILE * vs. fileptr_type_node, or say char * vs. const char *
8477 differences etc. */
8483 /* char/short integral arguments are promoted to int
8484 by several frontends if targetm.calls.promote_prototypes
8485 is true. Allow such promotion too. */
8491 && (gimple_form
8498 }
8499 }
8503 }
8505 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8506 return the associated function code, otherwise return CFN_LAST. */
8508 combined_fn
8510 {
8511 /* It's invalid to call this function with anything but a CALL_EXPR. */
8524 }
8526 /* Comparator of indices based on tree_node_counts. */
8528 static int
8530 {
8535 }
8537 /* Comparator of indices based on tree_code_counts. */
8539 static int
8541 {
8546 }
8548 #define TREE_MEM_USAGE_SPACES 40
8550 /* Print debugging information about tree nodes generated during the compile,
8551 and any language-specific information. */
8553 void
8555 {
8557 {
8563 {
8570 {
8577 }
8582 }
8584 {
8594 {
8599 }
8606 }
8607 }
8608 else
8615 }
8616 \f
8619 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8621 unsigned
8623 {
8624 /* This relies on the raw feedback's top 4 bits being zero. */
8625 #define FEEDBACK(X) ((X) * 0x04c11db7)
8626 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8627 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8629 {
8634 };
8635 #undef FEEDBACK
8636 #undef SYNDROME
8640 {
8644 }
8647 }
8649 /* Generate a crc32 of a string. */
8651 unsigned
8653 {
8654 do
8658 }
8660 /* P is a string that will be used in a symbol. Mask out any characters
8661 that are not valid in that context. */
8663 void
8665 {
8670 #endif
8673 #endif
8674 ))
8676 }
8680 /* Create a unique anonymous identifier. The identifier is still a
8681 valid assembly label. */
8683 tree
8685 {
8687 #if !defined (NO_DOT_IN_LABEL)
8688 "."
8689 #elif !defined (NO_DOLLAR_IN_LABEL)
8690 "$"
8691 #else
8692 "_"
8693 #endif
8704 }
8706 /* Generate a name for a special-purpose function.
8707 The generated name may need to be unique across the whole link.
8708 Changes to this function may also require corresponding changes to
8709 xstrdup_mask_random.
8710 TYPE is some string to identify the purpose of this function to the
8711 linker or collect2; it must start with an uppercase letter,
8712 one of:
8713 I - for constructors
8714 D - for destructors
8715 N - for C++ anonymous namespaces
8716 F - for DWARF unwind frame information. */
8718 tree
8720 {
8725 /* If we already have a name we know to be unique, just use that. */
8728 /* If the target is handling the constructors/destructors, they
8729 will be local to this file and the name is only necessary for
8730 debugging purposes.
8731 We also assign sub_I and sub_D sufixes to constructors called from
8732 the global static constructors. These are always local. */
8736 {
8740 /* Just use the file's basename, because the full pathname
8741 might be quite long. */
8743 }
8744 else
8745 {
8746 /* Otherwise, the name must be unique across the entire link.
8747 We don't have anything that we know to be unique to this translation
8748 unit, so use what we do have and throw in some randomness. */
8766 }
8772 /* Set up the name of the file-level functions we may need.
8773 Use a global object (which is already required to be unique over
8774 the program) rather than the file name (which imposes extra
8775 constraints). */
8779 }
8780 \f
8781 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8783 /* Complain that the tree code of NODE does not match the expected 0
8784 terminated list of trailing codes. The trailing code list can be
8785 empty, for a more vague error message. FILE, LINE, and FUNCTION
8786 are of the caller. */
8788 void
8791 {
8802 {
8809 {
8816 }
8818 }
8819 else
8825 }
8827 /* Complain that the tree code of NODE does match the expected 0
8828 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8829 the caller. */
8831 void
8834 {
8848 {
8850 {
8853 }
8856 }
8862 }
8864 /* Similar to tree_check_failed, except that we check for a class of tree
8865 code, given in CL. */
8867 void
8870 {
8871 internal_error
8876 }
8878 /* Similar to tree_check_failed, except that instead of specifying a
8879 dozen codes, use the knowledge that they're all sequential. */
8881 void
8885 {
8898 {
8905 }
8910 }
8913 /* Similar to tree_check_failed, except that we check that a tree does
8914 not have the specified code, given in CL. */
8916 void
8919 {
8920 internal_error
8925 }
8928 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8930 void
8933 {
8939 }
8942 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8944 void
8948 {
8961 {
8968 }
8973 }
8976 #undef DEFTREESTRUCT
8977 #define DEFTREESTRUCT(VAL, NAME) NAME,
8981 };
8982 #undef DEFTREESTRUCT
8984 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8986 /* Similar to tree_class_check_failed, except that we check for
8987 whether CODE contains the tree structure identified by EN. */
8989 void
8994 {
8995 internal_error
8999 }
9002 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9003 (dynamically sized) vector. */
9005 void
9008 {
9009 internal_error
9013 }
9015 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9016 (dynamically sized) vector. */
9018 void
9021 {
9022 internal_error
9025 }
9027 /* Similar to above, except that the check is for the bounds of the operand
9028 vector of an expression node EXP. */
9030 void
9033 {
9035 internal_error
9039 }
9041 /* Similar to above, except that the check is for the number of
9042 operands of an OMP_CLAUSE node. */
9044 void
9047 {
9048 internal_error
9053 }
9055 \f
9056 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9057 and mapped to the machine mode MODE. Initialize its fields and build
9058 the information necessary for debugging output. */
9060 static tree
9062 {
9063 tree t;
9084 /* We have built a main variant, based on the main variant of the
9085 inner type. Use it to build the variant we return. */
9093 }
9095 static tree
9097 {
9120 else
9122 }
9124 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9126 static tree
9128 {
9130 {
9142 }
9143 else
9144 {
9156 }
9159 }
9161 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9163 static tree
9165 {
9167 {
9179 }
9180 else
9181 {
9193 }
9196 }
9199 /* Create an atomic variant node for TYPE. This routine is called
9200 during initialization of data types to create the 5 basic atomic
9201 types. The generic build_variant_type function requires these to
9202 already be set up in order to function properly, so cannot be
9203 called from there. If ALIGN is non-zero, then ensure alignment is
9204 overridden to this value. */
9206 static tree
9208 {
9209 tree t;
9211 /* Make sure its not already registered. */
9222 }
9224 /* Information about the _FloatN and _FloatNx types. This must be in
9225 the same order as the corresponding TI_* enum values. */
9227 {
9235 };
9238 /* Create nodes for all integer types (and error_mark_node) using the sizes
9239 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9241 void
9243 {
9251 /* Define both `signed char' and `unsigned char'. */
9257 /* Define `char', which is like either `signed char' or `unsigned char'
9258 but not the same as either. */
9259 char_type_node
9260 = (signed_char
9275 {
9280 {
9283 }
9284 }
9286 /* Define a boolean type. This type only represents boolean values but
9287 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9293 /* Define what type to use for size_t. */
9302 else
9303 {
9309 {
9316 {
9318 }
9319 }
9322 }
9324 /* Define what type to use for ptrdiff_t. */
9333 else
9334 {
9338 {
9346 }
9349 }
9351 /* Fill in the rest of the sized types. Reuse existing type nodes
9352 when possible. */
9365 /* Don't call build_qualified type for atomics. That routine does
9366 special processing for atomics, and until they are initialized
9367 it's better not to make that call.
9369 Check to see if there is a target override for atomic types. */
9386 /* Define these next since types below may used them. */
9404 /* We are not going to have real types in C with less than byte alignment,
9405 so we might as well not have any types that claim to have it. */
9418 const_ptr_type_node
9438 {
9441 scalar_float_mode mode;
9445 /* Work around the rs6000 KFmode having precision 113 not
9446 128. */
9458 }
9460 #ifdef HAVE_BFmode
9464 {
9469 }
9470 #endif
9477 /* Fixed size integer types. */
9484 /* Decimal float types. */
9486 {
9501 }
9510 {
9514 }
9516 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9517 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9518 sat_ ## KIND ## _type_node = \
9519 make_sat_signed_ ## KIND ## _type (SIZE); \
9520 sat_unsigned_ ## KIND ## _type_node = \
9521 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9522 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9523 unsigned_ ## KIND ## _type_node = \
9524 make_unsigned_ ## KIND ## _type (SIZE);
9526 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9527 sat_ ## WIDTH ## KIND ## _type_node = \
9528 make_sat_signed_ ## KIND ## _type (SIZE); \
9529 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9530 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9531 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9532 unsigned_ ## WIDTH ## KIND ## _type_node = \
9533 make_unsigned_ ## KIND ## _type (SIZE);
9535 /* Make fixed-point type nodes based on four different widths. */
9536 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9537 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9538 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9539 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9540 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9542 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9543 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9544 NAME ## _type_node = \
9545 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9546 u ## NAME ## _type_node = \
9547 make_or_reuse_unsigned_ ## KIND ## _type \
9548 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9549 sat_ ## NAME ## _type_node = \
9550 make_or_reuse_sat_signed_ ## KIND ## _type \
9551 (GET_MODE_BITSIZE (MODE ## mode)); \
9552 sat_u ## NAME ## _type_node = \
9553 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9554 (GET_MODE_BITSIZE (U ## MODE ## mode));
9556 /* Fixed-point type and mode nodes. */
9569 {
9572 /* Many back-ends define record types without setting TYPE_NAME.
9573 If we copied the record type here, we'd keep the original
9574 record type without a name. This breaks name mangling. So,
9575 don't copy record types and let c_common_nodes_and_builtins()
9576 declare the type to be __builtin_va_list. */
9581 }
9583 /* SCEV analyzer global shared trees. */
9588 }
9590 /* Modify DECL for given flags.
9591 TM_PURE attribute is set only on types, so the function will modify
9592 DECL's type when ECF_TM_PURE is used. */
9594 void
9596 {
9626 /* Looping const or pure is implied by noreturn.
9627 There is currently no way to declare looping const or looping pure alone. */
9630 }
9633 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9635 static void
9638 {
9639 tree decl;
9646 }
9648 /* Call this function after instantiating all builtins that the language
9649 front end cares about. This will build the rest of the builtins
9650 and internal functions that are relied upon by the tree optimizers and
9651 the middle-end. */
9653 void
9655 {
9660 {
9662 ptr_type_node,
9663 ptr_type_node,
9664 integer_type_node,
9665 NULL_TREE);
9667 BUILT_IN_CLEAR_PADDING,
9670 }
9675 {
9679 BUILT_IN_UNREACHABLE,
9691 }
9695 {
9706 }
9709 {
9712 NULL_TREE);
9715 }
9718 {
9724 }
9726 /* If we're checking the stack, `alloca' can throw. */
9727 const int alloca_flags
9731 {
9736 }
9741 BUILT_IN_ALLOCA_WITH_ALIGN,
9743 alloca_flags);
9748 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9750 alloca_flags);
9756 BUILT_IN_INIT_TRAMPOLINE,
9759 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9763 BUILT_IN_INIT_DESCRIPTOR,
9768 BUILT_IN_ADJUST_TRAMPOLINE,
9772 BUILT_IN_ADJUST_DESCRIPTOR,
9780 BUILT_IN_CLEAR_CACHE,
9782 ECF_NOTHROW);
9785 BUILT_IN_NONLOCAL_GOTO,
9792 BUILT_IN_SETJMP_SETUP,
9797 BUILT_IN_SETJMP_RECEIVER,
9806 BUILT_IN_STACK_RESTORE,
9811 NULL_TREE);
9824 /* If there's a possibility that we might use the ARM EABI, build the
9825 alternate __cxa_end_cleanup node used to resume from C++. */
9827 {
9830 BUILT_IN_CXA_END_CLEANUP,
9832 }
9836 BUILT_IN_UNWIND_RESUME,
9840 ECF_NORETURN);
9843 {
9845 NULL_TREE);
9847 BUILT_IN_RETURN_ADDRESS,
9849 ECF_NOTHROW);
9850 }
9854 {
9859 BUILT_IN_PROFILE_FUNC_ENTER,
9863 BUILT_IN_PROFILE_FUNC_EXIT,
9865 }
9867 /* The exception object and filter values from the runtime. The argument
9868 must be zero before exception lowering, i.e. from the front end. After
9869 exception lowering, it will be the region number for the exception
9870 landing pad. These functions are PURE instead of CONST to prevent
9871 them from being hoisted past the exception edge that will initialize
9872 its value in the landing pad. */
9876 /* Only use TM_PURE if we have TM language support. */
9889 NULL_TREE);
9891 BUILT_IN_EH_COPY_VALUES,
9894 /* Complex multiplication and division. These are handled as builtins
9895 rather than optabs because emit_library_call_value doesn't support
9896 complex. Further, we can do slightly better with folding these
9897 beasties if the real and complex parts of the arguments are separate. */
9898 {
9902 {
9929 /* For -ftrapping-math these should throw from a former
9930 -fnon-call-exception stmt. */
9932 NULL);
9938 NULL);
9942 }
9943 }
9946 }
9948 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9949 better way.
9951 If we requested a pointer to a vector, build up the pointers that
9952 we stripped off while looking for the inner type. Similarly for
9953 return values from functions.
9955 The argument TYPE is the top of the chain, and BOTTOM is the
9956 new type which we will point to. */
9958 tree
9960 {
9964 {
9968 }
9970 {
9974 }
9976 {
9979 }
9981 {
9985 }
9987 {
9989 /* The build_method_type_directly() routine prepends 'this' to argument list,
9990 so we must compensate by getting rid of it. */
9991 outer
9992 = build_method_type_directly
9994 inner,
9996 }
9998 {
10001 }
10002 else
10007 }
10009 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10010 the inner type. */
10011 tree
10013 {
10014 poly_int64 nunits;
10018 {
10030 /* Check that there are no leftover bits. */
10038 }
10041 }
10043 /* Similarly, but takes the inner type and number of units, which must be
10044 a power of two. */
10046 tree
10048 {
10050 }
10052 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10054 tree
10056 {
10061 {
10064 }
10065 else
10071 }
10073 /* Build a vector type that holds one boolean result for each element of
10074 vector type VECTYPE. The public interface for this operation is
10075 truth_type_for. */
10077 static tree
10079 {
10083 machine_mode mask_mode;
10093 }
10095 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10096 set. */
10098 tree
10100 {
10102 tree cand;
10103 /* We always build the non-opaque variant before the opaque one,
10104 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10110 /* Othewise build a variant type and make sure to queue it after
10111 the non-opaque type. */
10119 }
10121 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10123 static poly_wide_int
10125 {
10126 /* First handle elements that are directly encoded. */
10131 /* Identify the pattern that contains element I and work out the index of
10132 the last encoded element for that pattern. */
10138 /* If there are no steps, the final encoded value is the right one. */
10142 /* Otherwise work out the value from the last two encoded elements. */
10147 }
10149 /* Return the value of element I of VECTOR_CST T. */
10151 tree
10153 {
10154 /* First handle elements that are directly encoded. */
10159 /* If there are no steps, the final encoded value is the right one. */
10161 {
10162 /* Identify the pattern that contains element I and work out the index of
10163 the last encoded element for that pattern. */
10168 }
10170 /* Otherwise work out the value from the last two encoded elements. */
10173 }
10175 /* Given an initializer INIT, return TRUE if INIT is zero or some
10176 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10177 null, set *NONZERO if and only if INIT is known not to be all
10178 zeros. The combination of return value of false and *NONZERO
10179 false implies that INIT may but need not be all zeros. Other
10180 combinations indicate definitive answers. */
10182 bool
10184 {
10189 /* Conservatively clear NONZERO and set it only if INIT is definitely
10190 not all zero. */
10198 {
10207 /* ??? Note that this is not correct for C4X float formats. There,
10208 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10209 negative exponent. */
10244 {
10249 tree elt;
10256 }
10259 {
10274 }
10275 /* Fall through. */
10278 {
10286 /* We need to loop through all elements to handle cases like
10287 "\0" and "\0foobar". */
10290 {
10293 }
10296 }
10300 }
10301 }
10303 /* Return true if EXPR is an initializer expression in which every element
10304 is a constant that is numerically equal to 0 or 1. The elements do not
10305 need to be equal to each other. */
10307 bool
10309 {
10313 {
10321 {
10328 {
10332 }
10335 }
10339 }
10340 }
10342 /* Check if vector VEC consists of all the equal elements and
10343 that the number of elements corresponds to the type of VEC.
10344 The function returns first element of the vector
10345 or NULL_TREE if the vector is not uniform. */
10346 tree
10348 {
10361 {
10365 }
10369 {
10373 {
10375 {
10378 }
10381 }
10388 }
10391 }
10393 /* If the argument is INTEGER_CST, return it. If the argument is vector
10394 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10395 return NULL_TREE.
10396 Look through location wrappers. */
10398 tree
10400 {
10407 {
10411 }
10414 }
10416 /* Checks to see if T is a constant or a constant vector and if each element E
10417 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10419 tree
10421 {
10431 tree cst;
10435 tree_vector_builder builder;
10438 else
10439 {
10445 }
10449 do
10450 {
10465 }
10469 }
10471 /* If VECTOR_CST T has a single nonzero element, return the index of that
10472 element, otherwise return -1. */
10474 int
10476 {
10482 {
10485 }
10486 else
10491 {
10494 {
10498 }
10499 }
10501 }
10503 /* Build an empty statement at location LOC. */
10505 tree
10507 {
10511 }
10514 /* Build an OMP clause with code CODE. LOC is the location of the
10515 clause. */
10517 tree
10519 {
10520 tree t;
10535 }
10537 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10538 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10539 Except for the CODE and operand count field, other storage for the
10540 object is initialized to zeros. */
10542 tree
10544 {
10545 tree t;
10557 /* Can't use TREE_OPERAND to store the length because if checking is
10558 enabled, it will try to check the length before we store it. :-P */
10562 }
10564 /* Helper function for build_call_* functions; build a CALL_EXPR with
10565 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10566 the argument slots. */
10568 static tree
10570 {
10571 tree t;
10579 }
10581 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10582 FN and a null static chain slot. NARGS is the number of call arguments
10583 which are specified as "..." arguments. */
10585 tree
10587 {
10588 tree ret;
10594 }
10596 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10597 FN and a null static chain slot. NARGS is the number of call arguments
10598 which are specified as a va_list ARGS. */
10600 tree
10602 {
10603 tree t;
10611 }
10613 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10614 FN and a null static chain slot. NARGS is the number of call arguments
10615 which are specified as a tree array ARGS. */
10617 tree
10620 {
10621 tree t;
10630 }
10632 /* Like build_call_array, but takes a vec. */
10634 tree
10636 {
10645 }
10647 /* Conveniently construct a function call expression. FNDECL names the
10648 function to be called and N arguments are passed in the array
10649 ARGARRAY. */
10651 tree
10653 {
10658 }
10660 /* Conveniently construct a function call expression. FNDECL names the
10661 function to be called and the arguments are passed in the vector
10662 VEC. */
10664 tree
10666 {
10669 }
10672 /* Conveniently construct a function call expression. FNDECL names the
10673 function to be called, N is the number of arguments, and the "..."
10674 parameters are the argument expressions. */
10676 tree
10678 {
10688 }
10690 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10691 varargs macros aren't supported by all bootstrap compilers. */
10693 tree
10695 {
10705 }
10707 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10708 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10709 It will get gimplified later into an ordinary internal function. */
10711 tree
10714 {
10722 }
10724 /* Build internal call expression. This is just like CALL_EXPR, except
10725 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10726 internal function. */
10728 tree
10731 {
10741 }
10743 /* Return a function call to FN, if the target is guaranteed to support it,
10744 or null otherwise.
10746 N is the number of arguments, passed in the "...", and TYPE is the
10747 type of the return value. */
10749 tree
10752 {
10762 {
10765 {
10768 OPTIMIZE_FOR_BOTH))
10770 }
10772 }
10773 else
10774 {
10779 }
10780 }
10782 /* Return a function call to the appropriate builtin alloca variant.
10784 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10785 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10786 bound for SIZE in case it is not a fixed value. */
10788 tree
10790 {
10792 {
10794 return
10796 }
10798 {
10801 }
10802 else
10803 {
10806 }
10807 }
10809 /* The built-in decl to use to mark code points believed to be unreachable.
10810 Typically __builtin_unreachable, but __builtin_trap if
10811 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10812 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10813 appropriate ubsan function. When building a call directly, use
10814 {gimple_},build_builtin_unreachable instead. */
10816 tree
10818 {
10825 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10826 in the sanopt pass. */
10829 }
10831 /* Build a call to __builtin_unreachable, possibly rewritten by
10832 -fsanitize=unreachable. Use this rather than the above when practical. */
10834 tree
10836 {
10840 }
10842 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10843 if SIZE == -1) and return a tree node representing char* pointer to
10844 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10845 the STRING_CST value is the LEN bytes at STR (the representation
10846 of the string, which may be wide). Otherwise it's all zeros. */
10848 tree
10852 {
10854 /* Set the maximum valid index based on the string length or SIZE. */
10855 unsigned HOST_WIDE_INT maxidx
10871 }
10875 /* Return true if T (assumed to be a DECL) must be assigned a memory
10876 location. */
10878 bool
10880 {
10886 }
10888 /* Return value of a constant X and sign-extend it. */
10890 HOST_WIDE_INT
10892 {
10896 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10900 {
10904 else
10906 }
10909 }
10911 /* If TYPE is an integral or pointer type, return an integer type with
10912 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10913 if TYPE is already an integer type of signedness UNSIGNEDP.
10914 If TYPE is a floating-point type, return an integer type with the same
10915 bitsize and with the signedness given by UNSIGNEDP; this is useful
10916 when doing bit-level operations on a floating-point value. */
10918 tree
10920 {
10925 {
10933 }
10936 {
10944 }
10953 else
10957 }
10959 /* If TYPE is an integral or pointer type, return an integer type with
10960 the same precision which is unsigned, or itself if TYPE is already an
10961 unsigned integer type. If TYPE is a floating-point type, return an
10962 unsigned integer type with the same bitsize as TYPE. */
10964 tree
10966 {
10968 }
10970 /* If TYPE is an integral or pointer type, return an integer type with
10971 the same precision which is signed, or itself if TYPE is already a
10972 signed integer type. If TYPE is a floating-point type, return a
10973 signed integer type with the same bitsize as TYPE. */
10975 tree
10977 {
10979 }
10981 /* - For VECTOR_TYPEs:
10982 - The truth type must be a VECTOR_BOOLEAN_TYPE.
10983 - The number of elements must match (known_eq).
10984 - targetm.vectorize.get_mask_mode exists, and exactly
10985 the same mode as the truth type.
10986 - Otherwise, the truth type must be a BOOLEAN_TYPE
10987 or useless_type_conversion_p to BOOLEAN_TYPE. */
10988 bool
10990 {
10993 machine_mode tmask_mode;
10996 {
11005 }
11008 }
11010 /* If TYPE is a vector type, return a signed integer vector type with the
11011 same width and number of subparts. Otherwise return boolean_type_node. */
11013 tree
11015 {
11017 {
11021 }
11022 else
11024 }
11026 /* Returns the largest value obtainable by casting something in INNER type to
11027 OUTER type. */
11029 tree
11031 {
11037 /* Compute a unique number for every combination. */
11042 /* Determine the exponent to use. */
11044 {
11047 /* oprec <= iprec, outer: signed, inner: don't care. */
11052 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11056 /* oprec > iprec, outer: signed, inner: signed. */
11060 /* oprec > iprec, outer: signed, inner: unsigned. */
11064 /* oprec > iprec, outer: unsigned, inner: signed. */
11068 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11073 }
11077 }
11079 /* Returns the smallest value obtainable by casting something in INNER type to
11080 OUTER type. */
11082 tree
11084 {
11088 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11089 and obtain 0. */
11091 /* If we are widening something of an unsigned type, OUTER type
11092 contains all values of INNER type. In particular, both INNER
11093 and OUTER types have zero in common. */
11096 else
11097 {
11098 /* If we are widening a signed type to another signed type, we
11099 want to obtain -2^^(iprec-1). If we are keeping the
11100 precision or narrowing to a signed type, we want to obtain
11101 -2^(oprec-1). */
11106 }
11107 }
11109 /* Return nonzero if two operands that are suitable for PHI nodes are
11110 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11111 SSA_NAME or invariant. Note that this is strictly an optimization.
11112 That is, callers of this function can directly call operand_equal_p
11113 and get the same result, only slower. */
11115 int
11117 {
11123 }
11125 /* Returns number of zeros at the end of binary representation of X. */
11127 tree
11129 {
11131 }
11134 #define WALK_SUBTREE(NODE) \
11135 do \
11136 { \
11137 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11138 if (result) \
11139 return result; \
11140 } \
11141 while (0)
11143 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11144 be walked whenever a type is seen in the tree. Rest of operands and return
11145 value are as for walk_tree. */
11147 static tree
11150 {
11154 {
11158 /* We have to worry about mutually recursive pointers. These can't
11159 be written in C. They can in Ada. It's pathological, but
11160 there's an ACATS test (c38102a) that checks it. Deal with this
11161 by checking if we're pointing to another pointer, that one
11162 points to another pointer, that one does too, and we have no htab.
11163 If so, get a hash table. We check three levels deep to avoid
11164 the cost of the hash table if we don't need one. */
11169 {
11176 }
11178 /* fall through */
11187 /* Fall through. */
11191 {
11192 tree arg;
11194 /* We never want to walk into default arguments. */
11197 }
11201 /* Don't follow this nodes's type if a pointer for fear that
11202 we'll have infinite recursion. If we have a PSET, then we
11203 need not fear. */
11218 }
11221 }
11223 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11224 called with the DATA and the address of each sub-tree. If FUNC returns a
11225 non-NULL value, the traversal is stopped, and the value returned by FUNC
11226 is returned. If PSET is non-NULL it is used to record the nodes visited,
11227 and to avoid visiting a node more than once. */
11229 tree
11232 {
11235 tree result;
11237 #define WALK_SUBTREE_TAIL(NODE) \
11238 do \
11239 { \
11240 tp = & (NODE); \
11241 goto tail_recurse; \
11242 } \
11243 while (0)
11245 tail_recurse:
11246 /* Skip empty subtrees. */
11250 /* Don't walk the same tree twice, if the user has requested
11251 that we avoid doing so. */
11255 /* Call the function. */
11259 /* If we found something, return it. */
11265 /* Even if we didn't, FUNC may have decided that there was nothing
11266 interesting below this point in the tree. */
11268 {
11269 /* But we still need to check our siblings. */
11274 else
11276 }
11279 {
11283 }
11286 {
11298 /* None of these have subtrees other than those already walked
11299 above. */
11307 {
11313 /* Walk all elements but the first. */
11317 /* Now walk the first one as a tail call. */
11319 }
11322 {
11326 /* Walk all elements but the first. */
11329 /* Now walk the first one as a tail call. */
11331 }
11338 {
11343 idx++)
11345 }
11352 {
11353 tree decl;
11355 {
11356 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11357 into declarations that are just mentioned, rather than
11358 declared; they don't really belong to this part of the tree.
11359 And, we can see cycles: the initializer for a declaration
11360 can refer to the declaration itself. */
11364 }
11366 }
11369 {
11370 tree_stmt_iterator i;
11373 }
11377 {
11382 }
11385 {
11388 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11389 But, we only want to walk once. */
11394 }
11397 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11398 defining. We only want to walk into these fields of a type in this
11399 case and not in the general case of a mere reference to the type.
11401 The criterion is as follows: if the field can be an expression, it
11402 must be walked only here. This should be in keeping with the fields
11403 that are directly gimplified in gimplify_type_sizes in order for the
11404 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11405 variable-sized types.
11407 Note that DECLs get walked as part of processing the BIND_EXPR. */
11409 {
11410 /* Call the function for the decl so e.g. copy_tree_body_r can
11411 replace it with the remapped one. */
11420 /* Call the function for the type. See if it returns anything or
11421 doesn't want us to continue. If we are to continue, walk both
11422 the normal fields and those for the declaration case. */
11427 /* But do not walk a pointed-to type since it may itself need to
11428 be walked in the declaration case if it isn't anonymous. */
11430 {
11434 }
11436 /* If this is a record type, also walk the fields. */
11438 {
11439 tree field;
11443 {
11444 /* We'd like to look at the type of the field, but we can
11445 easily get infinite recursion. So assume it's pointed
11446 to elsewhere in the tree. Also, ignore things that
11447 aren't fields. */
11456 }
11457 }
11459 /* Same for scalar types. */
11465 {
11468 }
11472 }
11473 /* FALLTHRU */
11477 {
11480 /* Walk over all the sub-trees of this operand. */
11483 /* Go through the subtrees. We need to do this in forward order so
11484 that the scope of a FOR_EXPR is handled properly. */
11486 {
11490 }
11491 }
11492 /* If this is a type, walk the needed fields in the type. */
11496 }
11498 /* We didn't find what we were looking for. */
11501 #undef WALK_SUBTREE_TAIL
11502 }
11503 #undef WALK_SUBTREE
11505 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11507 tree
11509 walk_tree_lh lh)
11510 {
11511 tree result;
11516 }
11519 tree
11521 {
11528 }
11530 void
11532 {
11536 {
11538 }
11539 else
11541 }
11543 /* Create a nameless artificial label and put it in the current
11544 function context. The label has a location of LOC. Returns the
11545 newly created label. */
11547 tree
11549 {
11557 }
11559 /* Given a tree, try to return a useful variable name that we can use
11560 to prefix a temporary that is being assigned the value of the tree.
11561 I.E. given <temp> = &A, return A. */
11565 {
11566 tree stripped_decl;
11573 {
11578 }
11579 else
11580 {
11582 {
11587 }
11588 }
11589 }
11591 /* Return true if TYPE has a variable argument list. */
11593 bool
11595 {
11596 function_args_iterator args_iter;
11606 {
11608 }
11611 }
11613 /* Return true if TYPE has a prototype. */
11615 bool
11617 {
11618 tree t;
11627 }
11629 /* If BLOCK is inlined from an __attribute__((__artificial__))
11630 routine, return pointer to location from where it has been
11631 called. */
11632 location_t *
11634 {
11639 {
11642 {
11643 /* If AO is an artificial inline, point RET to the
11644 call site locus at which it has been inlined and continue
11645 the loop, in case AO's caller is also an artificial
11646 inline. */
11650 else
11652 }
11657 }
11659 }
11662 /* If EXP is inlined from an __attribute__((__artificial__))
11663 function, return the location of the original call expression. */
11665 location_t
11667 {
11672 else
11674 }
11676 /* Return the location into which EXP has been inlined. Analogous
11677 to tree_nonartificial_location() above but not limited to artificial
11678 functions declared inline. If SYSTEM_HEADER is true, return
11679 the macro expansion point of the location if it's in a system header */
11681 location_t
11683 {
11690 {
11698 }
11701 {
11704 /* Only consider macro expansion when the block traversal failed
11705 to find a location. Otherwise it's not relevant. */
11707 }
11710 }
11712 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11713 nodes. */
11715 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11717 hashval_t
11719 {
11726 else
11728 }
11730 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11731 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11732 same. */
11734 bool
11736 {
11749 else
11751 }
11753 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11755 tree
11758 {
11759 tree t;
11761 /* Use the cache of optimization nodes. */
11769 {
11770 /* Insert this one into the hash table. */
11774 /* Make a new node for next time round. */
11776 }
11779 }
11781 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11783 tree
11786 {
11787 tree t;
11789 /* Use the cache of optimization nodes. */
11797 {
11798 /* Insert this one into the hash table. */
11802 /* Make a new node for next time round. */
11804 }
11807 }
11809 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11810 so that they aren't saved during PCH writing. */
11812 void
11814 {
11819 }
11821 /* Determine the "ultimate origin" of a block. */
11823 tree
11825 {
11830 else
11831 {
11836 }
11837 }
11839 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11840 no instruction. */
11842 bool
11844 {
11845 /* Do not strip casts into or out of differing address spaces. */
11848 {
11853 }
11856 {
11857 /* We already know that outer_type is not a pointer with
11858 a non-generic address space. */
11860 }
11862 /* Use precision rather then machine mode when we can, which gives
11863 the correct answer even for submode (bit-field) types. */
11872 /* Otherwise fall back on comparing machine modes (e.g. for
11873 aggregate types, floats). */
11875 }
11877 /* Return true iff conversion in EXP generates no instruction. Mark
11878 it inline so that we fully inline into the stripping functions even
11879 though we have two uses of this function. */
11883 {
11898 }
11900 /* Return true iff conversion in EXP generates no instruction. Don't
11901 consider conversions changing the signedness. */
11903 static bool
11905 {
11916 }
11918 /* Strip conversions from EXP according to tree_nop_conversion and
11919 return the resulting expression. */
11921 tree
11923 {
11927 }
11929 /* Strip conversions from EXP according to tree_sign_nop_conversion
11930 and return the resulting expression. */
11932 tree
11934 {
11938 }
11940 /* Avoid any floating point extensions from EXP. */
11941 tree
11943 {
11946 /* For floating point constant look up the narrowest type that can hold
11947 it properly and handle it like (type)(narrowest_type)constant.
11948 This way we can optimize for instance a=a*2.0 where "a" is float
11949 but 2.0 is double constant. */
11951 {
11952 REAL_VALUE_TYPE orig;
11965 }
11984 }
11986 /* Strip out all handled components that produce invariant
11987 offsets. */
11989 const_tree
11991 {
11993 {
11995 {
12010 }
12012 }
12015 }
12017 /* Strip handled components with zero offset from OP. */
12019 tree
12021 {
12027 }
12031 /* Return the GCC personality function decl. */
12033 tree
12035 {
12039 }
12041 /* TARGET is a call target of GIMPLE call statement
12042 (obtained by gimple_call_fn). Return true if it is
12043 OBJ_TYPE_REF representing an virtual call of C++ method.
12044 (As opposed to OBJ_TYPE_REF representing objc calls
12045 through a cast where middle-end devirtualization machinery
12046 can't apply.) FOR_DUMP_P is true when being called from
12047 the dump routines. */
12049 bool
12051 {
12060 /* If we do not have BINFO associated, it means that type was built
12061 without devirtualization enabled. Do not consider this a virtual
12062 call. */
12066 }
12068 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12070 static tree
12072 {
12083 }
12085 /* Try to find a base info of BINFO that would have its field decl at offset
12086 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12087 found, return, otherwise return NULL_TREE. */
12089 tree
12091 {
12095 {
12097 tree fld;
12106 {
12114 }
12118 /* Offset 0 indicates the primary base, whose vtable contents are
12119 represented in the binfo for the derived class. */
12121 {
12123 /* Offsets in BINFO are in bytes relative to the whole structure
12124 while POS is in bits relative to the containing field. */
12131 {
12134 }
12137 else
12139 binfo_offset);
12140 }
12144 }
12145 }
12147 /* Returns true if X is a typedef decl. */
12149 bool
12151 {
12154 }
12156 /* Returns true iff TYPE is a type variant created for a typedef. */
12158 bool
12160 {
12162 }
12164 /* PR 84195: Replace control characters in "unescaped" with their
12165 escaped equivalents. Allow newlines if -fmessage-length has
12166 been set to a non-zero value. This is done here, rather than
12167 where the attribute is recorded as the message length can
12168 change between these two locations. */
12170 void
12172 {
12190 {
12194 {
12198 }
12201 {
12203 {
12204 /* We only allocate space for a new string if we
12205 actually encounter a control character that
12206 needs replacing. */
12210 }
12215 {
12224 }
12225 }
12228 }
12231 {
12235 }
12236 }
12238 /* Warn about a use of an identifier which was marked deprecated. Returns
12239 whether a warning was given. */
12241 bool
12243 {
12244 escaped_string msg;
12250 {
12254 {
12260 {
12263 }
12264 }
12265 }
12275 {
12276 auto_diagnostic_group d;
12280 else
12285 }
12287 {
12292 {
12298 }
12300 auto_diagnostic_group d;
12302 {
12306 else
12309 }
12310 else
12311 {
12315 else
12318 }
12322 }
12325 }
12327 /* Error out with an identifier which was marked 'unavailable'. */
12328 void
12330 {
12331 escaped_string msg;
12337 {
12341 {
12346 }
12347 }
12356 {
12357 auto_diagnostic_group d;
12360 else
12363 }
12365 {
12370 {
12376 }
12378 auto_diagnostic_group d;
12380 {
12383 else
12385 }
12386 else
12387 {
12390 else
12392 }
12396 }
12397 }
12399 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12400 somewhere in it. */
12402 bool
12404 {
12406 {
12411 }
12414 }
12416 /* Try to determine whether a TRY_CATCH expression can fall through.
12417 This is a subroutine of block_may_fallthru. */
12419 static bool
12421 {
12422 tree_stmt_iterator i;
12424 /* If the TRY block can fall through, the whole TRY_CATCH can
12425 fall through. */
12431 {
12433 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12434 catch expression and a body. The whole TRY_CATCH may fall
12435 through iff any of the catch bodies falls through. */
12437 {
12440 }
12444 /* The exception filter expression only matters if there is an
12445 exception. If the exception does not match EH_FILTER_TYPES,
12446 we will execute EH_FILTER_FAILURE, and we will fall through
12447 if that falls through. If the exception does match
12448 EH_FILTER_TYPES, the stack unwinder will continue up the
12449 stack, so we will not fall through. We don't know whether we
12450 will throw an exception which matches EH_FILTER_TYPES or not,
12451 so we just ignore EH_FILTER_TYPES and assume that we might
12452 throw an exception which doesn't match. */
12456 /* This case represents statements to be executed when an
12457 exception occurs. Those statements are implicitly followed
12458 by a RESX statement to resume execution after the exception.
12459 So in this case the TRY_CATCH never falls through. */
12461 }
12462 }
12464 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12465 need not be 100% accurate; simply be conservative and return true if we
12466 don't know. This is used only to avoid stupidly generating extra code.
12467 If we're wrong, we'll just delete the extra code later. */
12469 bool
12471 {
12472 /* This CONST_CAST is okay because expr_last returns its argument
12473 unmodified and we assign it to a const_tree. */
12477 {
12480 /* Easy cases. If the last statement of the block implies
12481 control transfer, then we can't fall through. */
12485 /* If there is a default: label or case labels cover all possible
12486 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12487 to some case label in all cases and all we care is whether the
12488 SWITCH_BODY falls through. */
12505 /* The finally clause is always executed after the try clause,
12506 so if it does not fall through, then the try-finally will not
12507 fall through. Otherwise, if the try clause does not fall
12508 through, then when the finally clause falls through it will
12509 resume execution wherever the try clause was going. So the
12510 whole try-finally will only fall through if both the try
12511 clause and the finally clause fall through. */
12521 else
12523 /* FALLTHRU */
12526 /* Functions that do not return do not fall through. */
12540 }
12541 }
12543 /* True if we are using EH to handle cleanups. */
12546 /* This routine is called from front ends to indicate eh should be used for
12547 cleanups. */
12548 void
12550 {
12552 }
12554 /* Query whether EH is used for cleanups. */
12555 bool
12557 {
12559 }
12561 /* Wrapper for tree_code_name to ensure that tree code is valid */
12564 {
12567 /* The tree_code enum promotes to signed, but we could be getting
12568 invalid values, so force an unsigned comparison. */
12570 {
12574 }
12577 }
12579 /* Drops the TREE_OVERFLOW flag from T. */
12581 tree
12583 {
12586 /* For tree codes with a sharing machinery re-build the result. */
12590 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12591 and canonicalize the result. */
12593 {
12594 tree_vector_builder builder;
12598 {
12603 }
12605 }
12607 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12608 and drop the flag. */
12612 /* For constants that contain nested constants, drop the flag
12613 from those as well. */
12615 {
12620 }
12623 }
12625 /* Given a memory reference expression T, return its base address.
12626 The base address of a memory reference expression is the main
12627 object being referenced. For instance, the base address for
12628 'array[i].fld[j]' is 'array'. You can think of this as stripping
12629 away the offset part from a memory address.
12631 This function calls handled_component_p to strip away all the inner
12632 parts of the memory reference until it reaches the base object. */
12634 tree
12636 {
12648 }
12650 /* Return a tree of sizetype representing the size, in bytes, of the element
12651 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12653 tree
12655 {
12660 /* If a size was specified in the ARRAY_REF, it's the size measured
12661 in alignment units of the element type. So multiply by that value. */
12663 {
12664 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12665 sizetype from another type of the same width and signedness. */
12670 }
12672 /* Otherwise, take the size from that of the element type. Substitute
12673 any PLACEHOLDER_EXPR that we have. */
12674 else
12676 }
12678 /* Return a tree representing the lower bound of the array mentioned in
12679 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12681 tree
12683 {
12686 /* If a lower bound is specified in EXP, use it. */
12690 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12691 substituting for a PLACEHOLDER_EXPR as needed. */
12695 /* Otherwise, return a zero of the appropriate type. */
12699 }
12701 /* Return a tree representing the upper bound of the array mentioned in
12702 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12704 tree
12706 {
12709 /* If there is a domain type and it has an upper bound, use it, substituting
12710 for a PLACEHOLDER_EXPR as needed. */
12714 /* Otherwise fail. */
12716 }
12718 /* Returns true if REF is an array reference, a component reference,
12719 or a memory reference to an array whose actual size might be larger
12720 than its upper bound implies, there are multiple cases:
12721 A. a ref to a flexible array member at the end of a structure;
12722 B. a ref to an array with a different type against the original decl;
12723 for example:
12725 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12726 (*((char(*)[16])&a[0]))[i+8]
12728 C. a ref to an array that was passed as a parameter;
12729 for example:
12731 int test (uint8_t *p, uint32_t t[1][1], int n) {
12732 for (int i = 0; i < 4; i++, p++)
12733 t[i][0] = ...;
12735 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12736 */
12738 bool
12740 {
12741 /* The TYPE for this array referece. */
12743 /* The FIELD_DECL for the array field in the containing structure. */
12745 /* Whether this array is the trailing array of a structure. */
12752 {
12755 }
12758 {
12761 }
12763 {
12769 {
12771 {
12778 }
12779 else
12781 }
12782 else
12784 }
12785 else
12793 {
12794 /* If the reference chain contains a component reference to a
12795 non-union type and there follows another field the reference
12796 is not at the end of a structure. */
12798 {
12800 {
12806 }
12807 }
12808 /* If we have a multi-dimensional array we do not consider
12809 a non-innermost dimension as flex array if the whole
12810 multi-dimensional array is at struct end.
12811 Same for an array of aggregates with a trailing array
12812 member. */
12816 ;
12817 /* If we view an underlying object as sth else then what we
12818 gathered up to now is what we have to rely on. */
12821 else
12825 }
12830 /* The array now is at struct end. Treat flexible array member as
12831 always subject to extend, even into just padding constrained by
12832 an underlying decl. */
12836 {
12839 }
12841 /* If the reference is based on a declared entity, the size of the array
12842 is constrained by its given domain. (Do not trust commons PR/69368). */
12846 && !(flag_unconstrained_commons
12850 {
12851 /* If the object itself is the array it is not at struct end. */
12855 /* Check whether the array domain covers all of the available
12856 padding. */
12857 poly_int64 offset;
12861 {
12862 *is_trailing_array
12865 }
12867 {
12868 *is_trailing_array
12871 }
12873 /* If at least one extra element fits it is a flexarray. */
12879 {
12880 *is_trailing_array
12883 }
12886 }
12890 }
12893 /* Return a tree representing the offset, in bytes, of the field referenced
12894 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12896 tree
12898 {
12903 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12904 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12905 value. */
12907 {
12908 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12909 sizetype from another type of the same width and signedness. */
12915 }
12917 /* Otherwise, take the offset from that of the field. Substitute
12918 any PLACEHOLDER_EXPR that we have. */
12919 else
12921 }
12923 /* Given the initializer INIT, return the initializer for the field
12924 DECL if it exists, otherwise null. Used to obtain the initializer
12925 for a flexible array member and determine its size. */
12927 static tree
12929 {
12935 {
12940 {
12944 }
12945 }
12948 }
12950 /* Determines the special array member type for the array reference REF. */
12951 special_array_member
12953 {
12959 {
12968 /* MEMBER is an interior array with
12969 more than one element. */
12973 {
12976 else
12978 }
12986 {
12991 /* MEMBER is a trailing array with more than
12992 one elements. */
12997 }
12998 }
13001 }
13003 /* Determines the size of the member referenced by the COMPONENT_REF
13004 REF, using its initializer expression if necessary in order to
13005 determine the size of an initialized flexible array member.
13006 If non-null, set *SAM to the type of special array member.
13007 Returns the size as sizetype (which might be zero for an object
13008 with an uninitialized flexible array member) or null if the size
13009 cannot be determined. */
13011 tree
13013 {
13016 special_array_member sambuf;
13021 /* The object/argument referenced by the COMPONENT_REF and its type. */
13024 /* The referenced member. */
13029 {
13032 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13033 to the type of a class with a virtual base which doesn't
13034 reflect the size of the virtual's members (see pr97595).
13035 If that's the case fail for now and implement something
13036 more robust in the future. */
13040 /* 2-or-more elements arrays are treated as normal arrays by default. */
13045 /* flag_strict_flex_arrays will control how to treat
13046 the trailing arrays as flexiable array members. */
13049 unsigned int strict_flex_array_level
13053 {
13055 /* Treaing 0-length trailing arrays as normal array. */
13058 /* FALLTHROUGH. */
13060 /* Treating 1-element trailing arrays as normal array. */
13063 /* FALLTHROUGH. */
13065 /* Treating 2-or-more elements trailing arrays as normal
13066 array. */
13069 /* FALLTHROUGH. */
13074 }
13079 /* For a reference to a flexible array member of a union
13080 use the size of the union instead of the size of the member. */
13083 }
13085 /* MEMBER is either a bona fide flexible array member, or a zero-length
13086 array member, or an array of length one treated as such. */
13088 /* If the reference is to a declared object and the member a true
13089 flexible array, try to determine its size from its initializer. */
13093 {
13104 }
13106 /* BASE is the declared object of which MEMBER is either a member
13107 or that is cast to ARGTYPE (e.g., a char buffer used to store
13108 an ARGTYPE object). */
13111 /* Determine the base type of the referenced object. If it's
13112 the same as ARGTYPE and MEMBER has a known size, return it. */
13124 /* MEMBER is a true flexible array member. Compute its size from
13125 the initializer of the BASE object if it has one. */
13128 {
13131 {
13134 {
13135 /* Use the larger of the initializer size and the tail
13136 padding in the enclosing struct. */
13141 }
13144 }
13145 }
13148 {
13150 {
13155 /* The size of a flexible array member of an extern struct
13156 with no initializer cannot be determined (it's defined
13157 in another translation unit and can have an initializer
13158 with an arbitrary number of elements). */
13161 /* Use the size of the base struct or, for interior zero-length
13162 arrays, the size of the enclosing type. */
13164 }
13166 /* Use the size of the BASE object (possibly an array of some
13167 other type such as char used to store the struct). */
13169 else
13171 }
13173 /* If the flexible array member has a known size use the greater
13174 of it and the tail padding in the enclosing struct.
13175 Otherwise, when the size of the flexible array member is unknown
13176 and the referenced object is not a struct, use the size of its
13177 type when known. This detects sizes of array buffers when cast
13178 to struct types with flexible array members. */
13180 {
13185 {
13188 }
13190 }
13192 /* Return "don't know" for an external non-array object since its
13193 flexible array member can be initialized to have any number of
13194 elements. Otherwise, return zero because the flexible array
13195 member has no elements. */
13198 && (!typematch
13201 }
13203 /* Return the machine mode of T. For vectors, returns the mode of the
13204 inner type. The main use case is to feed the result to HONOR_NANS,
13205 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13207 machine_mode
13209 {
13215 }
13217 /* Vector types need to re-check the target flags each time we report
13218 the machine mode. We need to do this because attribute target can
13219 change the result of vector_mode_supported_p and have_regs_of_mode
13220 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13221 change on a per-function basis. */
13222 /* ??? Possibly a better solution is to run through all the types
13223 referenced by a function and re-compute the TYPE_MODE once, rather
13224 than make the TYPE_MODE macro call a function. */
13226 machine_mode
13228 {
13229 machine_mode mode;
13237 {
13238 scalar_int_mode innermode;
13240 /* For integers, try mapping it to a same-sized scalar mode. */
13242 {
13245 scalar_int_mode mode;
13249 }
13252 }
13255 }
13257 /* Return the size in bits of each element of vector type TYPE. */
13259 unsigned int
13261 {
13266 }
13268 /* Calculate the size in bits of each element of vector type TYPE
13269 and return the result as a tree of type bitsizetype. */
13271 tree
13273 {
13278 }
13280 /* Verify that basic properties of T match TV and thus T can be a variant of
13281 TV. TV should be the more specified variant (i.e. the main variant). */
13283 static bool
13285 {
13286 /* Type variant can differ by:
13288 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13289 ENCODE_QUAL_ADDR_SPACE.
13290 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13291 in this case some values may not be set in the variant types
13292 (see TYPE_COMPLETE_P checks).
13293 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13294 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13295 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13296 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13297 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13298 this is necessary to make it possible to merge types form different TUs
13299 - arrays, pointers and references may have TREE_TYPE that is a variant
13300 of TREE_TYPE of their main variants.
13301 - aggregates may have new TYPE_FIELDS list that list variants of
13302 the main variant TYPE_FIELDS.
13303 - vector types may differ by TYPE_VECTOR_OPAQUE
13304 */
13306 /* Convenience macro for matching individual fields. */
13307 #define verify_variant_match(flag) \
13308 do { \
13309 if (flag (tv) != flag (t)) \
13310 { \
13312 debug_tree (tv); \
13313 return false; \
13314 } \
13315 } while (false)
13317 /* tree_base checks. */
13320 /* FIXME: Ada builds non-artificial variants of artificial types. */
13321 #if 0
13324 #endif
13327 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13334 else
13336 /* FIXME: This check trigger during libstdc++ build. */
13337 #if 0
13340 #endif
13342 /* tree_type_common checks. */
13345 {
13353 {
13363 }
13365 }
13371 /* During LTO we merge variant lists from diferent translation units
13372 that may differ BY TYPE_CONTEXT that in turn may point
13373 to TRANSLATION_UNIT_DECL.
13374 Ada also builds variants of types with different TYPE_CONTEXT. */
13375 #if 0
13378 #endif
13384 {
13388 }
13390 /* tree_type_non_common checks. */
13392 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13393 and dangle the pointer from time to time. */
13397 {
13401 }
13407 {
13410 }
13417 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13418 or even type's main variant. This is needed to make bootstrap pass
13419 and the bug seems new in GCC 5.
13420 C++ FE should be updated to make this consistent and we should check
13421 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13422 is a match with main variant.
13424 Also disable the check for Java for now because of parser hack that builds
13425 first an dummy BINFO and then sometimes replace it by real BINFO in some
13426 of the copies. */
13429 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13430 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13431 at LTO time only. */
13433 {
13441 }
13443 /* Check various uses of TYPE_VALUES_RAW. */
13449 /* Permit incomplete variants of complete type. While FEs may complete
13450 all variants, this does not happen for C++ templates in all cases. */
13454 {
13457 /* Fortran builds qualified variants as new records with items of
13458 qualified type. Verify that they looks same. */
13465 /* FIXME: gfc_nonrestricted_type builds all types as variants
13466 with exception of pointer types. It deeply copies the type
13467 which means that we may end up with a variant type
13468 referring non-variant pointer. We may change it to
13469 produce types as variants, too, like
13470 objc_get_protocol_qualified_type does. */
13476 {
13484 }
13485 }
13488 /* For C++ the qualified variant of array type is really an array type
13489 of qualified TREE_TYPE.
13490 objc builds variants of pointer where pointer to type is a variant, too
13491 in objc_get_protocol_qualified_type. */
13497 {
13505 }
13508 {
13516 }
13518 #undef verify_variant_match
13519 }
13522 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13523 the middle-end types_compatible_p function. It needs to avoid
13524 claiming types are different for types that should be treated
13525 the same with respect to TBAA. Canonical types are also used
13526 for IL consistency checks via the useless_type_conversion_p
13527 predicate which does not handle all type kinds itself but falls
13528 back to pointer-comparison of TYPE_CANONICAL for aggregates
13529 for example. */
13531 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13532 type calculation because we need to allow inter-operability between signed
13533 and unsigned variants. */
13535 bool
13537 {
13538 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13539 signed char and unsigned char. Similarly fortran FE builds
13540 C_SIZE_T as signed type, while C defines it unsigned. */
13543 == INTEGER_TYPE
13546 }
13548 /* Return true iff T1 and T2 are structurally identical for what
13549 TBAA is concerned.
13550 This function is used both by lto.cc canonical type merging and by the
13551 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13552 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13553 only for LTO because only in these cases TYPE_CANONICAL equivalence
13554 correspond to one defined by gimple_canonical_types_compatible_p. */
13556 bool
13559 {
13560 /* Type variants should be same as the main variant. When not doing sanity
13561 checking to verify this fact, go to main variants and save some work. */
13563 {
13566 }
13568 /* Check first for the obvious case of pointer identity. */
13572 /* Check that we have two types to compare. */
13576 /* We consider complete types always compatible with incomplete type.
13577 This does not make sense for canonical type calculation and thus we
13578 need to ensure that we are never called on it.
13580 FIXME: For more correctness the function probably should have three modes
13581 1) mode assuming that types are complete mathcing their structure
13582 2) mode allowing incomplete types but producing equivalence classes
13583 and thus ignoring all info from complete types
13584 3) mode allowing incomplete types to match complete but checking
13585 compatibility between complete types.
13587 1 and 2 can be used for canonical type calculation. 3 is the real
13588 definition of type compatibility that can be used i.e. for warnings during
13589 declaration merging. */
13594 /* If the types have been previously registered and found equal
13595 they still are. */
13599 {
13600 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13601 they are always NULL, but they are set to non-NULL for types
13602 constructed by build_pointer_type and variants. In this case the
13603 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13604 all pointers are considered equal. Be sure to not return false
13605 negatives. */
13609 }
13611 /* For types where we do ODR based TBAA the canonical type is always
13612 set correctly, so we know that types are different if their
13613 canonical types does not match. */
13619 /* Can't be the same type if the types don't have the same code. */
13624 /* Qualifiers do not matter for canonical type comparison purposes. */
13626 /* Void types and nullptr types are always the same. */
13631 /* Can't be the same type if they have different mode. */
13635 /* Non-aggregate types can be handled cheaply. */
13643 {
13644 /* Can't be the same type if they have different recision. */
13648 /* In some cases the signed and unsigned types are required to be
13649 inter-operable. */
13654 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13655 interoperable with "signed char". Unless all frontends are revisited
13656 to agree on these types, we must ignore the flag completely. */
13658 /* Fortran standard define C_PTR type that is compatible with every
13659 C pointer. For this reason we need to glob all pointers into one.
13660 Still pointers in different address spaces are not compatible. */
13662 {
13666 }
13668 /* Tail-recurse to components. */
13673 trust_type_canonical);
13676 }
13678 /* Do type-specific comparisons. */
13680 {
13682 /* Array types are the same if the element types are the same and
13683 the number of elements are the same. */
13685 trust_type_canonical)
13690 else
13691 {
13695 /* For an incomplete external array, the type domain can be
13696 NULL_TREE. Check this condition also. */
13701 else
13702 {
13708 /* The minimum/maximum values have to be the same. */
13720 else
13722 }
13723 }
13727 /* Function types are the same if the return type and arguments types
13728 are the same. */
13730 trust_type_canonical))
13737 else
13738 {
13744 {
13747 trust_type_canonical))
13749 }
13755 }
13760 {
13763 /* Don't try to compare variants of an incomplete type, before
13764 TYPE_FIELDS has been copied around. */
13772 /* For aggregate types, all the fields must be the same. */
13776 {
13777 /* Skip non-fields and zero-sized fields. */
13788 /* The fields must have the same name, offset and type. */
13791 || !gimple_canonical_types_compatible_p
13793 trust_type_canonical))
13795 }
13797 /* If one aggregate has more fields than the other, they
13798 are not the same. */
13803 }
13806 /* Consider all types with language specific trees in them mutually
13807 compatible. This is executed only from verify_type and false
13808 positives can be tolerated. */
13811 }
13812 }
13814 /* For OPAQUE_TYPE T, it should have only size and alignment information
13815 and its mode should be of class MODE_OPAQUE. This function verifies
13816 these properties of T match TV which is the main variant of T and TC
13817 which is the canonical of T. */
13819 static void
13821 {
13826 /* For an opaque type T1, check if some of its properties match
13827 the corresponding ones of the other opaque type T2, emit some
13828 error messages for those inconsistent ones. */
13831 {
13833 {
13837 }
13839 {
13843 }
13845 {
13849 }
13853 {
13857 }
13859 {
13863 }
13865 {
13869 }
13870 };
13877 }
13879 /* Verify type T. */
13881 void
13883 {
13889 {
13892 }
13895 {
13898 }
13900 {
13904 }
13909 ;
13911 {
13915 }
13916 /* Method and function types cannot be used to address memory and thus
13917 TYPE_CANONICAL really matters only for determining useless conversions.
13919 FIXME: C++ FE produce declarations of builtin functions that are not
13920 compatible with main variants. */
13922 ;
13924 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
13925 with variably sized arrays because their sizes possibly
13926 gimplified to different variables. */
13930 {
13934 }
13938 {
13942 }
13944 {
13949 }
13952 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13954 {
13955 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13956 and danagle the pointer from time to time. */
13960 {
13964 }
13965 }
13967 {
13970 {
13974 }
13975 }
13977 {
13980 {
13984 }
13985 }
13988 {
13989 /* FIXME: The following check should pass:
13990 useless_type_conversion_p (const_cast <tree> (t),
13991 TREE_TYPE (TYPE_MIN_VALUE (t))
13992 but does not for C sizetypes in LTO. */
13993 }
13995 /* Check various uses of TYPE_MAXVAL_RAW. */
13997 {
13999 ;
14001 {
14005 }
14007 {
14011 }
14012 }
14014 {
14018 {
14022 }
14023 }
14025 {
14029 {
14033 }
14034 }
14037 {
14038 /* FIXME: The following check should pass:
14039 useless_type_conversion_p (const_cast <tree> (t),
14040 TREE_TYPE (TYPE_MAX_VALUE (t))
14041 but does not for C sizetypes in LTO. */
14042 }
14044 {
14047 {
14051 }
14052 }
14054 {
14058 }
14061 {
14065 }
14067 /* Check various uses of TYPE_VALUES_RAW. */
14070 {
14074 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14075 CONST_DECL of ENUMERAL TYPE. */
14077 {
14082 }
14086 {
14092 }
14094 {
14099 }
14100 }
14102 {
14104 {
14108 }
14109 }
14111 {
14113 {
14116 }
14118 {
14119 /* TODO: verify properties of decls. */
14121 ;
14123 ;
14125 ;
14127 ;
14129 ;
14131 ;
14133 ;
14134 else
14135 {
14139 }
14140 }
14141 }
14148 {
14150 {
14155 }
14157 {
14161 }
14162 /* Verify just enough of cache to ensure that no one copied it to new type.
14163 All copying should go by copy_node that should clear it. */
14165 {
14170 {
14175 }
14176 }
14177 }
14180 {
14181 /* C++ FE uses TREE_PURPOSE to store initial values. */
14183 {
14187 }
14189 {
14193 }
14194 }
14196 {
14200 }
14208 {
14211 }
14213 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14214 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14215 of a type. */
14218 {
14221 }
14224 {
14227 }
14228 }
14231 /* Return 1 if ARG interpreted as signed in its precision is known to be
14232 always positive or 2 if ARG is known to be always negative, or 3 if
14233 ARG may be positive or negative. */
14235 int
14237 {
14244 {
14248 else
14250 }
14254 {
14256 /* Narrower value zero extended into wider type
14257 will always result in positive values. */
14264 }
14268 value_range r;
14270 {
14274 {
14278 {
14287 }
14288 }
14290 }
14292 {
14293 /* For unsigned values, the "positive" range comes
14294 below the "negative" range. */
14299 }
14300 else
14301 {
14306 }
14308 }
14313 /* Return true if ARG is marked with the nonnull attribute in the
14314 current function signature. */
14316 bool
14318 {
14326 /* The static chain decl is always non null. */
14330 /* THIS argument of method is always non-NULL. */
14336 /* Values passed by reference are always non-NULL. */
14343 {
14346 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14350 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14354 /* Get the position number for ARG in the function signature. */
14356 t;
14358 {
14361 }
14365 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14367 {
14370 }
14371 }
14374 }
14376 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14377 information. */
14379 location_t
14381 {
14386 }
14388 location_t
14390 {
14391 source_range src_range;
14395 }
14397 location_t
14399 {
14407 pure_loc,
14408 src_range,
14409 NULL,
14410 discriminator);
14413 }
14415 /* Return EXPR, potentially wrapped with a node expression LOC,
14416 if !CAN_HAVE_LOCATION_P (expr).
14418 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14419 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14421 Wrapper nodes can be identified using location_wrapper_p. */
14423 tree
14425 {
14432 /* We should only be adding wrappers for constants and for decls,
14433 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14438 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14439 any impact of the wrapper nodes. */
14443 /* Compiler-generated temporary variables don't need a wrapper. */
14447 /* If any auto_suppress_location_wrappers are active, don't create
14448 wrappers. */
14452 tree_code code
14457 /* Mark this node as being a wrapper. */
14460 }
14464 /* Return the name of combined function FN, for debugging purposes. */
14468 {
14470 {
14473 }
14474 else
14476 }
14478 /* Return a bitmap with a bit set corresponding to each argument in
14479 a function call type FNTYPE declared with attribute nonnull,
14480 or null if none of the function's argument are nonnull. The caller
14481 must free the bitmap. */
14483 bitmap
14485 {
14491 {
14492 /* The this pointer in C++ non-static member functions is
14493 implicitly nonnull whether or not it's declared as such. */
14496 }
14502 /* A function declaration can specify multiple attribute nonnull,
14503 each with zero or more arguments. The loop below creates a bitmap
14504 representing a union of all the arguments. An empty (but non-null)
14505 bitmap means that all arguments have been declaraed nonnull. */
14507 {
14516 {
14517 /* Clear the bitmap in case a previous attribute nonnull
14518 set it and this one overrides it for all arguments. */
14521 }
14523 /* Iterate over the indices of the format arguments declared nonnull
14524 and set a bit for each. */
14526 {
14529 }
14530 }
14533 }
14535 /* Returns true if TYPE is a type where it and all of its subobjects
14536 (recursively) are of structure, union, or array type. */
14538 bool
14540 {
14542 {
14549 }
14555 }
14557 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14558 that shouldn't be passed via stack. */
14560 bool
14562 {
14573 }
14575 /* Determine whether TYPE is a structure with a flexible array member,
14576 or a union containing such a structure (possibly recursively). */
14578 bool
14580 {
14583 {
14599 {
14603 }
14607 }
14608 }
14610 /* Like int_size_in_bytes, but handle empty records specially. */
14612 HOST_WIDE_INT
14614 {
14616 }
14618 /* Like size_in_bytes, but handle empty records specially. */
14620 tree
14622 {
14624 }
14626 /* Return true if an expression with CODE has to have the same result type as
14627 its first operand. */
14629 bool
14631 {
14633 {
14667 }
14668 }
14670 /* Return a typenode for the "standard" C type with a given name. */
14671 tree
14673 {
14705 }
14707 /* List of pointer types used to declare builtins before we have seen their
14708 real declaration.
14710 Keep the size up to date in tree.h ! */
14712 {
14719 };
14721 /* Return the maximum object size. */
14723 tree
14725 {
14726 /* To do: Make this a configurable parameter. */
14728 }
14730 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14731 parameter default to false and that weeds out error_mark_node. */
14733 bool
14736 {
14743 }
14745 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14746 delete operators. Return false if they may or may not name such
14747 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14748 do not. */
14750 bool
14753 {
14763 /* The following failures are due to invalid names so they're not
14764 considered certain mismatches. */
14780 /* The following failures are due to names of user-defined operators
14781 so they're also not considered certain mismatches. */
14783 /* *_len is now just the length after initial underscores. */
14789 /* The following failures are certain mismatches. */
14792 /* _Znw must match _Zdl, _Zna must match _Zda. */
14796 /* 'j', 'm' and 'y' correspond to size_t. */
14803 {
14804 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14805 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14812 }
14816 {
14817 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14818 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14819 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14829 }
14831 /* The negative result is conservative. */
14834 }
14836 /* Return the zero-based number corresponding to the argument being
14837 deallocated if FNDECL is a deallocation function or an out-of-bounds
14838 value if it isn't. */
14840 unsigned
14842 {
14843 /* A call to operator delete isn't recognized as one to a built-in. */
14845 {
14849 /* Avoid placement delete that's not been inlined. */
14855 }
14857 /* TODO: Handle user-defined functions with attribute malloc? Handle
14858 known non-built-ins like fopen? */
14860 {
14862 {
14868 }
14870 }
14879 {
14890 }
14893 }
14895 /* If EXPR refers to a character array or pointer declared attribute
14896 nonstring, return a decl for that array or pointer and set *REF
14897 to the referenced enclosing object or pointer. Otherwise return
14898 null. */
14900 tree
14902 {
14906 {
14910 {
14916 }
14917 else
14919 }
14924 /* To simplify calling code, store the referenced DECL regardless of
14925 the attribute determined below, but avoid storing the SSA_NAME_VAR
14926 obtained above (it's not useful for dataflow purposes). */
14930 /* Use the SSA_NAME_VAR that was determined above to see if it's
14931 declared nonstring. Otherwise drill down into the referenced
14932 DECL. */
14947 }
14949 /* Return length of attribute names string,
14950 if arglist chain > 1, -1 otherwise. */
14952 int
14954 {
14955 tree arg;
14960 {
14965 argnum++;
14966 argnum++;
14967 }
14971 }
14973 void
14975 {
14977 }
14979 #if CHECKING_P
14983 /* Selftests for tree. */
14985 /* Verify that integer constants are sane. */
14987 static void
14989 {
15002 }
15004 /* Verify identifiers. */
15006 static void
15008 {
15012 }
15014 /* Verify LABEL_DECL. */
15016 static void
15018 {
15024 }
15026 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15027 are given by VALS. */
15029 static tree
15031 {
15036 }
15038 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15040 static void
15042 {
15048 }
15050 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15051 and that its elements match EXPECTED. */
15053 static void
15056 {
15063 }
15065 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15066 and NPATTERNS background elements, and that its elements match
15067 EXPECTED. */
15069 static void
15072 {
15079 }
15081 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15082 and that its elements match EXPECTED. */
15084 static void
15087 {
15094 }
15096 /* Test the creation of VECTOR_CSTs. */
15098 static void
15100 {
15106 /* Test a simple linear series with a base of 0 and a step of 1:
15107 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15113 /* Try the same with the first element replaced by 100:
15114 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15119 /* Try a series that wraps around.
15120 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15126 /* Try a downward series:
15127 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15133 /* Try two interleaved series with different bases and steps:
15134 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15137 {
15140 }
15144 /* Try a duplicated value:
15145 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15151 /* Try an interleaved duplicated value:
15152 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15159 /* Try a duplicated value with 2 exceptions
15160 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15166 /* Try with and without a step
15167 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15173 /* Try a fully-general constant:
15174 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15178 }
15180 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15181 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15182 modifying its argument in-place. */
15184 static void
15186 {
15189 }
15191 /* Verify location wrappers. */
15193 static void
15195 {
15200 /* Wrapping a constant. */
15210 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15213 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15218 /* Wrapping a STRING_CST. */
15230 /* Wrapping a variable. */
15233 integer_type_node);
15242 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15243 wrapper. */
15248 /* Verify that STRIP_NOPS removes wrappers. */
15252 }
15254 /* Test various tree predicates. Verify that location wrappers don't
15255 affect the results. */
15257 static void
15259 {
15260 /* Build various constants and wrappers around them. */
15288 /* TODO: vector constants. */
15290 /* Test integer_onep. */
15310 /* Test integer_zerop. */
15330 /* Test integer_all_onesp. */
15350 /* Test integer_minus_onep. */
15370 /* Test integer_each_onep. */
15390 /* Test integer_truep. */
15410 /* Test integer_nonzerop. */
15430 /* Test real_zerop. */
15450 /* Test real_onep. */
15470 /* Test real_minus_onep. */
15490 /* Test zerop. */
15510 /* Test tree_expr_nonnegative_p. */
15530 /* Test tree_expr_nonzero_p. */
15538 /* Test integer_valued_real_p. */
15545 /* Test integer_pow2p. */
15550 /* Test uniform_integer_cst_p. */
15569 }
15571 /* Check that string escaping works correctly. */
15573 static void
15575 {
15577 escaped_string msg;
15580 /* ASSERT_STREQ does not accept NULL as a valid test
15581 result, so we have to use ASSERT_EQ instead. */
15590 /* Ensure that we have -fmessage-length set to 0. */
15600 /* Now repeat the tests with -fmessage-length set to 5. */
15603 /* Note that the newline is not translated into an escape. */
15610 /* Restore the original message length setting. */
15612 }
15614 /* Run all of the selftests within this file. */
15616 void
15618 {
15626 }