| blob | 9c9b057cd88ccddb423b9383b9df08964620e806 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2023 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
77 /* Names of tree components.
78 Used for printing out the tree and error messages. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
84 };
86 #undef DEFTREECODE
87 #undef END_OF_BASE_TREE_CODES
89 /* Each tree code class has an associated string representation.
90 These must correspond to the tree_code_class entries. */
93 {
104 "expression"
105 };
107 /* obstack.[ch] explicitly declined to prototype this. */
110 /* Statistics-gathering stuff. */
116 /* Keep in sync with tree.h:enum tree_node_kind. */
134 };
136 /* Unique id for next decl created. */
138 /* Unique id for next type created. */
140 /* Unique id for next debug decl created. Use negative numbers,
141 to catch erroneous uses. */
144 /* Since we cannot rehash a type after it is in the table, we have to
145 keep the hash code. */
149 tree type;
150 };
152 /* Initial size of the hash table (rounded to next prime). */
153 #define TYPE_HASH_INITIAL_SIZE 1000
156 {
160 static int
162 {
164 }
165 };
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
176 /* Hash table and temporary node for larger integer const values. */
180 {
183 };
187 /* Class and variable for making sure that there is a single POLY_INT_CST
188 for a given value. */
190 {
194 };
198 /* Hash table for optimization flags and target option flags. Use the same
199 hash table for both sets of options. Nodes for building the current
200 optimization and target option nodes. The assumption is most of the time
201 the options created will already be in the hash table, so we avoid
202 allocating and freeing up a node repeatably. */
207 {
210 };
214 /* General tree->tree mapping structure for use in hash tables. */
239 /* Number of operands for each OMP clause. */
241 {
330 };
333 {
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 {
1001 }
1014 {
1026 }
1030 {
1051 }
1055 }
1056 }
1058 /* Compute the number of bytes occupied by NODE. This routine only
1059 looks at TREE_CODE, except for those nodes that have variable sizes. */
1060 size_t
1062 {
1065 {
1095 else
1097 }
1098 }
1100 /* Return tree node kind based on tree CODE. */
1102 static tree_node_kind
1104 {
1108 {
1126 {
1143 }
1149 }
1150 }
1152 /* Record interesting allocation statistics for a tree node with CODE
1153 and LENGTH. */
1155 static void
1157 {
1166 }
1168 /* Allocate and return a new UID from the DECL_UID namespace. */
1170 int
1172 {
1174 }
1176 /* Return a newly allocated node of code CODE. For decl and type
1177 nodes, some other fields are initialized. The rest of the node is
1178 initialized to zero. This function cannot be used for TREE_VEC,
1179 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1180 tree_code_size.
1182 Achoo! I got a code in the node. */
1184 tree
1186 {
1187 tree t;
1197 {
1205 {
1207 {
1210 }
1211 else
1213 }
1217 else
1218 {
1221 }
1234 /* Default to no attributes for type, but let target change that. */
1238 /* We have not yet computed the alias set for this type. */
1248 {
1256 /* All of these have side-effects, no matter what their
1257 operands are. */
1263 }
1268 {
1281 }
1285 /* Other classes need no special treatment. */
1287 }
1290 }
1292 /* Free tree node. */
1294 void
1296 {
1299 {
1309 }
1321 }
1322 \f
1323 /* Return a new node with the same contents as NODE except that its
1324 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1326 tree
1328 {
1329 tree t;
1346 {
1349 else
1350 {
1354 }
1357 {
1360 }
1361 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1363 {
1366 }
1368 {
1371 }
1373 {
1376 }
1377 }
1379 {
1381 /* The following is so that the debug code for
1382 the copy is different from the original type.
1383 The two statements usually duplicate each other
1384 (because they clear fields of the same union),
1385 but the optimizer should catch that. */
1389 /* Do not copy the values cache. */
1391 {
1394 }
1395 }
1397 {
1401 }
1403 {
1407 }
1410 }
1412 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1413 For example, this can copy a list made of TREE_LIST nodes. */
1415 tree
1417 {
1418 tree head;
1427 {
1431 }
1433 }
1435 \f
1436 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1437 INTEGER_CST with value CST and type TYPE. */
1439 static unsigned int
1441 {
1443 /* We need extra HWIs if CST is an unsigned integer with its
1444 upper bit set. */
1448 }
1450 /* Return a new INTEGER_CST with value CST and type TYPE. */
1452 static tree
1454 {
1460 {
1466 }
1469 {
1470 len--;
1474 }
1480 }
1482 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1484 static tree
1486 CXX_MEM_STAT_INFO)
1487 {
1499 }
1501 /* Create a constant tree that contains CST sign-extended to TYPE. */
1503 tree
1505 {
1506 /* Support legacy code. */
1511 }
1513 /* Create a constant tree that contains CST zero-extended to TYPE. */
1515 tree
1517 {
1519 }
1521 /* Create a constant tree that contains CST sign-extended to TYPE. */
1523 tree
1525 {
1528 }
1530 /* Constructs tree in type TYPE from with value given by CST. Signedness
1531 of CST is assumed to be the same as the signedness of TYPE. */
1533 tree
1535 {
1537 }
1539 /* We force the wide_int CST to the range of the type TYPE by sign or
1540 zero extending it. OVERFLOWABLE indicates if we are interested in
1541 overflow of the value, when >0 we are only interested in signed
1542 overflow, for <0 we are interested in any overflow. OVERFLOWED
1543 indicates whether overflow has already occurred. CONST_OVERFLOWED
1544 indicates whether constant overflow has already occurred. We force
1545 T's value to be within range of T's type (by setting to 0 or 1 all
1546 the bits outside the type's range). We set TREE_OVERFLOWED if,
1547 OVERFLOWED is nonzero,
1548 or OVERFLOWABLE is >0 and signed overflow occurs
1549 or OVERFLOWABLE is <0 and any overflow occurs
1550 We return a new tree node for the extended wide_int. The node
1551 is shared if no overflow flags are set. */
1554 tree
1557 {
1560 /* If we need to set overflow flags, return a new unshared node. */
1562 {
1566 {
1568 sign);
1569 tree t;
1572 else
1573 {
1576 {
1579 }
1581 }
1584 }
1585 }
1587 /* Else build a shared node. */
1589 }
1591 /* These are the hash table functions for the hash table of INTEGER_CST
1592 nodes of a sizetype. */
1594 /* Return the hash code X, an INTEGER_CST. */
1596 hashval_t
1598 {
1607 }
1609 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1610 is the same as that given by *Y, which is the same. */
1612 bool
1614 {
1628 }
1630 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1631 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1632 number of slots that can be cached for the type. */
1637 {
1639 /* Initialize cache. */
1641 {
1644 }
1647 {
1648 /* Create a new shared int. */
1651 }
1653 }
1655 /* Create an INT_CST node of TYPE and value CST.
1656 The returned node is always shared. For small integers we use a
1657 per-type vector cache, for larger ones we use a single hash table.
1658 The value is extended from its precision according to the sign of
1659 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1660 the upper bits and ensures that hashing and value equality based
1661 upon the underlying HOST_WIDE_INTs works without masking. */
1663 static tree
1665 {
1666 tree t;
1674 /* Verify that everything is canonical. */
1677 {
1682 }
1689 {
1690 /* Cache NULL pointer and zero bounds. */
1693 /* Cache upper bounds of pointers. */
1696 /* Cache 1 which is used for a non-zero range. */
1701 {
1703 /* Make sure no one is clobbering the shared constant. */
1707 }
1708 }
1710 {
1711 /* We just need to store a single HOST_WIDE_INT. */
1712 HOST_WIDE_INT hwi;
1715 else
1719 {
1722 /* Fallthru. */
1726 /* Ignore pointers, as they were already handled above. */
1730 /* Cache false or true. */
1740 {
1741 /* Cache [0, N). */
1745 }
1746 else
1747 {
1748 /* Cache [-1, N). */
1752 }
1760 }
1763 {
1765 /* Make sure no one is clobbering the shared constant. */
1771 }
1772 else
1773 {
1774 /* Use the cache of larger shared ints, using int_cst_node as
1775 a temporary. */
1783 {
1784 /* Insert this one into the hash table. */
1787 /* Make a new node for next time round. */
1789 }
1790 }
1791 }
1792 else
1793 {
1794 /* The value either hashes properly or we drop it on the floor
1795 for the gc to take care of. There will not be enough of them
1796 to worry about. */
1802 {
1803 /* Insert this one into the hash table. */
1806 }
1807 else
1809 }
1812 }
1814 hashval_t
1816 {
1824 }
1826 bool
1828 {
1835 }
1837 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1838 The elements must also have type TYPE. */
1840 tree
1842 {
1853 INSERT);
1855 {
1860 }
1862 }
1864 /* Create a constant tree with value VALUE in type TYPE. */
1866 tree
1868 {
1872 }
1874 /* Insert INTEGER_CST T into a cache of integer constants. And return
1875 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1876 is false, and T falls into the type's 'smaller values' range, there
1877 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1878 or the value is large, should an existing entry exist, it is
1879 returned (rather than inserting T). */
1881 tree
1883 {
1891 /* The caching indices here must match those in
1892 wide_int_to_type_1. */
1894 {
1897 /* Fallthru. */
1901 {
1909 }
1913 /* Cache false or true. */
1923 {
1924 /* Cache 0..N */
1927 /* This is a little hokie, but if the prec is smaller than
1928 what is necessary to hold param_integer_share_limit, then the
1929 obvious test will not get the correct answer. */
1931 {
1935 }
1938 }
1939 else
1940 {
1941 /* Cache -1..N */
1947 {
1949 {
1952 }
1955 }
1956 }
1960 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1961 members. */
1966 }
1969 {
1970 /* Look for it in the type's vector of small shared ints. */
1972 {
1975 }
1978 {
1981 }
1982 else
1984 }
1985 else
1986 {
1987 /* Use the cache of larger shared ints. */
1990 {
1991 /* If there is already an entry for the number verify it's the
1992 same value. */
1994 /* And return the cached value. */
1996 }
1997 else
1998 /* Otherwise insert this one into the hash table. */
2000 }
2003 }
2006 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2007 and the rest are zeros. */
2009 tree
2011 {
2016 }
2018 /* Checks that X is integer constant that can be expressed in (unsigned)
2019 HOST_WIDE_INT without loss of precision. */
2021 bool
2023 {
2026 }
2028 /* Build a newly constructed VECTOR_CST with the given values of
2029 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2031 tree
2034 {
2036 tree t;
2052 }
2054 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2055 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2057 tree
2059 {
2064 tree value;
2066 /* We can't construct a VECTOR_CST for a variable number of elements. */
2070 {
2072 {
2073 /* If NELTS is constant then this must be too. */
2077 }
2078 else
2080 }
2085 }
2087 /* Build a vector of type VECTYPE where all the elements are SCs. */
2088 tree
2090 {
2096 /* Verify that the vector type is suitable for SC. Note that there
2097 is some inconsistency in the type-system with respect to restrict
2098 qualifications of pointers. Vector types always have a main-variant
2099 element type and the qualification is applied to the vector-type.
2100 So TREE_TYPE (vector-type) does not return a properly qualified
2101 vector element-type. */
2106 {
2110 }
2113 else
2114 {
2120 }
2121 }
2123 /* If TYPE is not a vector type, just return SC, otherwise return
2124 build_vector_from_val (TYPE, SC). */
2126 tree
2128 {
2133 }
2135 /* Build a vector series of type TYPE in which element I has the value
2136 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2137 and a VEC_SERIES_EXPR otherwise. */
2139 tree
2141 {
2145 {
2155 }
2157 }
2159 /* Return a vector with the same number of units and number of bits
2160 as VEC_TYPE, but in which the elements are a linear series of unsigned
2161 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2163 tree
2165 {
2170 {
2171 index_elt_type = build_nonstandard_integer_type
2174 }
2180 }
2182 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2183 elements are A and the rest are B. */
2185 tree
2187 {
2190 /* Optimize the constant case. */
2197 }
2199 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2200 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2202 void
2204 {
2206 tree val;
2212 {
2213 /* Mostly ctors will have elts that don't have side-effects, so
2214 the usual case is to scan all the elements. Hence a single
2215 loop for both const and side effects, rather than one loop
2216 each (with early outs). */
2221 }
2225 }
2227 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2228 CONSTRUCTOR C. */
2230 void
2232 {
2234 tree val;
2240 {
2245 }
2246 }
2248 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2249 are in the vec pointed to by VALS. */
2250 tree
2252 {
2261 }
2263 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2264 INDEX and VALUE. */
2265 tree
2267 {
2275 }
2278 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2279 are in a list pointed to by VALS. */
2280 tree
2282 {
2283 tree t;
2287 {
2291 }
2294 }
2296 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2297 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2298 fields in the constructor remain null. */
2300 tree
2302 {
2309 }
2311 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2312 of elements, provided as index/value pairs. */
2314 tree
2316 {
2323 {
2327 }
2330 }
2332 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2334 tree
2336 {
2341 }
2343 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2345 tree
2347 {
2348 tree v;
2358 }
2360 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2362 tree
2364 {
2365 tree v;
2368 /* dconst{0,1,2,m1,half} are used in various places in
2369 the middle-end and optimizers, allow them here
2370 even for decimal floating point types as an exception
2371 by converting them to decimal. */
2375 {
2385 {
2386 /* Make sure to give zero the minimum quantum exponent for
2387 the type (which corresponds to all bits zero). */
2392 }
2393 else
2395 }
2397 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2398 Consider doing it via real_convert now. */
2405 }
2407 /* Like build_real, but first truncate D to the type. */
2409 tree
2411 {
2413 }
2415 /* Return a new REAL_CST node whose type is TYPE
2416 and whose value is the integer value of the INTEGER_CST node I. */
2418 REAL_VALUE_TYPE
2420 {
2421 REAL_VALUE_TYPE d;
2423 /* Clear all bits of the real value type so that we can later do
2424 bitwise comparisons to see if two values are the same. */
2430 }
2432 /* Given a tree representing an integer constant I, return a tree
2433 representing the same value as a floating-point constant of type TYPE. */
2435 tree
2437 {
2438 tree v;
2445 }
2447 /* Return a new REAL_CST node whose type is TYPE
2448 and whose value is the integer value I which has sign SGN. */
2450 tree
2452 {
2453 REAL_VALUE_TYPE d;
2455 /* Clear all bits of the real value type so that we can later do
2456 bitwise comparisons to see if two values are the same. */
2461 }
2463 /* Return a newly constructed STRING_CST node whose value is the LEN
2464 characters at STR when STR is nonnull, or all zeros otherwise.
2465 Note that for a C string literal, LEN should include the trailing NUL.
2466 The TREE_TYPE is not initialized. */
2468 tree
2470 {
2471 /* Do not waste bytes provided by padding of struct tree_string. */
2484 else
2489 }
2491 /* Return a newly constructed COMPLEX_CST node whose value is
2492 specified by the real and imaginary parts REAL and IMAG.
2493 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2494 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2496 tree
2498 {
2509 }
2511 /* Build a complex (inf +- 0i), such as for the result of cproj.
2512 TYPE is the complex tree type of the result. If NEG is true, the
2513 imaginary zero is negative. */
2515 tree
2517 {
2523 }
2525 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2526 element is set to 1. In particular, this is 1 + i for complex types. */
2528 tree
2530 {
2532 {
2535 }
2536 else
2538 }
2540 /* Return a constant of arithmetic type TYPE which is the
2541 multiplicative identity of the set TYPE. */
2543 tree
2545 {
2547 {
2557 /* We can only generate 1 for accum types. */
2562 {
2566 }
2575 }
2576 }
2578 /* Return an integer of type TYPE containing all 1's in as much precision as
2579 it contains, or a complex or vector whose subparts are such integers. */
2581 tree
2583 {
2585 {
2588 }
2589 else
2591 }
2593 /* Return a constant of arithmetic type TYPE which is the
2594 opposite of the multiplicative identity of the set TYPE. */
2596 tree
2598 {
2600 {
2610 /* We can only generate 1 for accum types. */
2617 {
2621 }
2630 }
2631 }
2633 /* Build 0 constant of type TYPE. This is used by constructor folding
2634 and thus the constant should be represented in memory by
2635 zero(es). */
2637 tree
2639 {
2641 {
2654 {
2658 }
2661 {
2665 }
2671 }
2672 }
2674 /* Build a constant of integer type TYPE, made of VALUE's bits replicated
2675 every WIDTH bits to fit TYPE's precision. */
2677 tree
2679 {
2690 else
2691 {
2694 }
2702 }
2704 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2705 unsigned constant in which only the sign bit is set. Return null
2706 otherwise. */
2708 tree
2710 {
2711 /* Avoid having to choose between a real-only sign and a pair of signs.
2712 This could be relaxed if the choice becomes obvious later. */
2727 {
2730 }
2732 }
2734 /* Build a BINFO with LEN language slots. */
2736 tree
2738 {
2739 tree t;
2754 }
2756 /* Create a CASE_LABEL_EXPR tree node and return it. */
2758 tree
2760 {
2772 }
2774 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2775 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2776 The latter determines the length of the HOST_WIDE_INT vector. */
2778 tree
2780 {
2781 tree t;
2796 }
2798 /* Build a newly constructed TREE_VEC node of length LEN. */
2800 tree
2802 {
2803 tree t;
2814 }
2816 /* Grow a TREE_VEC node to new length LEN. */
2818 tree
2820 {
2836 }
2837 \f
2838 /* Return true if EXPR is the constant zero, whether it is integral, float or
2839 fixed, and scalar, complex or vector. */
2841 bool
2843 {
2847 }
2849 /* Return true if EXPR is the integer constant zero or a complex constant
2850 of zero, or a location wrapper for such a constant. */
2852 bool
2854 {
2858 {
2870 }
2871 }
2873 /* Return true if EXPR is the integer constant one or the corresponding
2874 complex constant, or a location wrapper for such a constant. */
2876 bool
2878 {
2882 {
2894 }
2895 }
2897 /* Return true if EXPR is the integer constant one. For complex and vector,
2898 return true if every piece is the integer constant one.
2899 Also return true for location wrappers for such a constant. */
2901 bool
2903 {
2909 else
2911 }
2913 /* Return true if EXPR is an integer containing all 1's in as much precision
2914 as it contains, or a complex or vector whose subparts are such integers,
2915 or a location wrapper for such a constant. */
2917 bool
2919 {
2937 }
2939 /* Return true if EXPR is the integer constant minus one, or a location
2940 wrapper for such a constant. */
2942 bool
2944 {
2950 else
2952 }
2954 /* Return true if EXPR is an integer constant that is a power of 2 (i.e., has
2955 only one bit on), or a location wrapper for such a constant. */
2957 bool
2959 {
2971 }
2973 /* Return true if EXPR is an integer constant other than zero or a
2974 complex constant other than zero, or a location wrapper for such a
2975 constant. */
2977 bool
2979 {
2987 }
2989 /* Return true if EXPR is the integer constant one. For vector,
2990 return true if every piece is the integer constant minus one
2991 (representing the value TRUE).
2992 Also return true for location wrappers for such a constant. */
2994 bool
2996 {
3002 }
3004 /* Return true if EXPR is the fixed-point constant zero, or a location wrapper
3005 for such a constant. */
3007 bool
3009 {
3014 }
3016 /* Return the power of two represented by a tree node known to be a
3017 power of two. */
3019 int
3021 {
3026 }
3028 /* Similar, but return the largest integer Y such that 2 ** Y is less
3029 than or equal to EXPR. */
3031 int
3033 {
3038 }
3040 /* Return number of known trailing zero bits in EXPR, or, if the value of
3041 EXPR is known to be zero, the precision of it's type. */
3043 unsigned int
3045 {
3052 {
3073 /* Second operand is sizetype, which could be in theory
3074 wider than pointer's precision. Make sure we never
3075 return more than prec. */
3090 {
3093 }
3098 {
3103 }
3112 {
3115 {
3120 }
3121 }
3123 CASE_CONVERT:
3141 {
3144 }
3148 }
3149 }
3151 /* Return true if EXPR is the real constant zero. Trailing zeroes matter for
3152 decimal float constants, so don't return true for them.
3153 Also return true for location wrappers around such a constant. */
3155 bool
3157 {
3161 {
3169 {
3170 /* Don't simply check for a duplicate because the predicate
3171 accepts both +0.0 and -0.0. */
3177 }
3180 }
3181 }
3183 /* Return true if EXPR is the real constant one in real or complex form.
3184 Trailing zeroes matter for decimal float constants, so don't return
3185 true for them.
3186 Also return true for location wrappers around such a constant. */
3188 bool
3190 {
3194 {
3207 }
3208 }
3210 /* Return true if EXPR is the real constant minus one. Trailing zeroes
3211 matter for decimal float constants, so don't return true for them.
3212 Also return true for location wrappers around such a constant. */
3214 bool
3216 {
3220 {
3233 }
3234 }
3236 /* Return true if T could be a floating point zero. */
3238 bool
3240 {
3242 {
3244 /* Can't use real_zerop here, as it always returns false for decimal
3245 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3246 either, as decimal zeros are rvc_normal. */
3252 {
3258 }
3260 /* Perhaps for SSA_NAMEs we could query frange. */
3262 }
3263 }
3265 /* True if EXP is a constant or a cast of a constant. */
3267 bool
3269 {
3270 /* This is not quite the same as STRIP_NOPS. It does more. */
3275 }
3277 /* Return true if T holds a polynomial pointer difference, storing it in
3278 *VALUE if so. A true return means that T's precision is no greater
3279 than 64 bits, which is the largest address space we support, so *VALUE
3280 never loses precision. However, the signedness of the result does
3281 not necessarily match the signedness of T: sometimes an unsigned type
3282 like sizetype is used to encode a value that is actually negative. */
3284 bool
3286 {
3290 {
3295 }
3297 {
3304 }
3306 }
3308 poly_int64
3310 {
3315 }
3317 poly_uint64
3319 {
3324 }
3325 \f
3326 /* Return first list element whose TREE_VALUE is ELEM.
3327 Return 0 if ELEM is not in LIST. */
3329 tree
3331 {
3333 {
3337 }
3339 }
3341 /* Return first list element whose TREE_PURPOSE is ELEM.
3342 Return 0 if ELEM is not in LIST. */
3344 tree
3346 {
3348 {
3352 }
3354 }
3356 /* Return true if ELEM is in V. */
3358 bool
3360 {
3362 tree t;
3367 }
3369 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3370 NULL_TREE. */
3372 tree
3374 {
3378 }
3380 /* Return true if ELEM is part of the chain CHAIN. */
3382 bool
3384 {
3386 {
3390 }
3393 }
3395 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3396 We expect a null pointer to mark the end of the chain.
3397 This is the Lisp primitive `length'. */
3399 int
3401 {
3403 #ifdef ENABLE_TREE_CHECKING
3405 #endif
3409 {
3411 #ifdef ENABLE_TREE_CHECKING
3415 #endif
3416 len++;
3417 }
3420 }
3422 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3423 UNION_TYPE TYPE, or NULL_TREE if none. */
3425 tree
3427 {
3432 }
3434 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3435 UNION_TYPE TYPE, or NULL_TREE if none. */
3437 tree
3439 {
3443 {
3448 }
3451 }
3453 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3454 by modifying the last node in chain 1 to point to chain 2.
3455 This is the Lisp primitive `nconc'. */
3457 tree
3459 {
3460 tree t1;
3471 #ifdef ENABLE_TREE_CHECKING
3472 {
3473 tree t2;
3476 }
3477 #endif
3480 }
3482 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3484 tree
3486 {
3487 tree next;
3492 }
3494 /* Reverse the order of elements in the chain T,
3495 and return the new head of the chain (old last element). */
3497 tree
3499 {
3502 {
3503 /* We shouldn't be using this function to reverse BLOCK chains; we
3504 have blocks_nreverse for that. */
3509 }
3511 }
3512 \f
3513 /* Return a newly created TREE_LIST node whose
3514 purpose and value fields are PARM and VALUE. */
3516 tree
3518 {
3523 }
3525 /* Build a chain of TREE_LIST nodes from a vector. */
3527 tree
3529 {
3533 tree t;
3535 {
3538 }
3540 }
3542 /* Return a newly created TREE_LIST node whose
3543 purpose and value fields are PURPOSE and VALUE
3544 and whose TREE_CHAIN is CHAIN. */
3546 tree
3548 {
3549 tree node;
3561 }
3563 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3564 trees. */
3568 {
3572 tree val;
3578 }
3579 \f
3580 /* Return the size nominally occupied by an object of type TYPE
3581 when it resides in memory. The value is measured in units of bytes,
3582 and its data type is that normally used for type sizes
3583 (which is the first type created by make_signed_type or
3584 make_unsigned_type). */
3586 tree
3588 {
3589 tree t;
3598 {
3601 }
3604 }
3606 /* Return the size of TYPE (in bytes) as a wide integer
3607 or return -1 if the size can vary or is larger than an integer. */
3609 HOST_WIDE_INT
3611 {
3612 tree t;
3622 else
3624 }
3626 /* Return the maximum size of TYPE (in bytes) as a wide integer
3627 or return -1 if the size can vary or is larger than an integer. */
3629 HOST_WIDE_INT
3631 {
3633 tree size_tree;
3635 /* If this is an array type, check for a possible MAX_SIZE attached. */
3638 {
3643 }
3645 /* If we still haven't been able to get a size, see if the language
3646 can compute a maximum size. */
3649 {
3654 }
3657 }
3658 \f
3659 /* Return the bit position of FIELD, in bits from the start of the record.
3660 This is a tree of type bitsizetype. */
3662 tree
3664 {
3667 }
3668 \f
3669 /* Return the byte position of FIELD, in bytes from the start of the record.
3670 This is a tree of type sizetype. */
3672 tree
3674 {
3677 }
3679 /* Likewise, but return as an integer. It must be representable in
3680 that way (since it could be a signed value, we don't have the
3681 option of returning -1 like int_size_in_byte can. */
3683 HOST_WIDE_INT
3685 {
3687 }
3688 \f
3689 /* Return, as a tree node, the number of elements for TYPE (which is an
3690 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3692 tree
3694 {
3697 /* If they did it with unspecified bounds, then we should have already
3698 given an error about it before we got here. */
3706 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3708 {
3709 /* zero sized arrays are represented from C FE as complete types with
3710 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3711 them as min 0, max -1. */
3718 }
3721 ? max
3723 }
3724 \f
3725 /* If arg is static -- a reference to an object in static storage -- then
3726 return the object. This is not the same as the C meaning of `static'.
3727 If arg isn't static, return NULL. */
3729 tree
3731 {
3733 {
3735 /* Nested functions are static, even though taking their address will
3736 involve a trampoline as we unnest the nested function and create
3737 the trampoline on the tree level. */
3758 /* If the thing being referenced is not a field, then it is
3759 something language specific. */
3762 /* If we are referencing a bitfield, we can't evaluate an
3763 ADDR_EXPR at compile time and so it isn't a constant. */
3780 else
3788 }
3789 }
3791 \f
3794 /* Return whether OP is a DECL whose address is function-invariant. */
3796 bool
3798 {
3799 /* The conditions below are slightly less strict than the one in
3800 staticp. */
3803 {
3826 }
3829 }
3831 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3833 bool
3835 {
3836 /* The conditions below are slightly less strict than the one in
3837 staticp. */
3840 {
3860 }
3863 }
3866 /* Return true if T is function-invariant (internal function, does
3867 not handle arithmetic; that's handled in skip_simple_arithmetic and
3868 tree_invariant_p). */
3870 static bool
3872 {
3873 tree op;
3880 {
3887 {
3889 {
3904 }
3906 }
3912 }
3915 }
3917 /* Return true if T is function-invariant. */
3919 bool
3921 {
3924 }
3926 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3927 Do this to any expression which may be used in more than one place,
3928 but must be evaluated only once.
3930 Normally, expand_expr would reevaluate the expression each time.
3931 Calling save_expr produces something that is evaluated and recorded
3932 the first time expand_expr is called on it. Subsequent calls to
3933 expand_expr just reuse the recorded value.
3935 The call to expand_expr that generates code that actually computes
3936 the value is the first call *at compile time*. Subsequent calls
3937 *at compile time* generate code to use the saved value.
3938 This produces correct result provided that *at run time* control
3939 always flows through the insns made by the first expand_expr
3940 before reaching the other places where the save_expr was evaluated.
3941 You, the caller of save_expr, must make sure this is so.
3943 Constants, and certain read-only nodes, are returned with no
3944 SAVE_EXPR because that is safe. Expressions containing placeholders
3945 are not touched; see tree.def for an explanation of what these
3946 are used for. */
3948 tree
3950 {
3951 tree inner;
3953 /* If the tree evaluates to a constant, then we don't want to hide that
3954 fact (i.e. this allows further folding, and direct checks for constants).
3955 However, a read-only object that has side effects cannot be bypassed.
3956 Since it is no problem to reevaluate literals, we just return the
3957 literal node. */
3965 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3966 it means that the size or offset of some field of an object depends on
3967 the value within another field.
3969 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3970 and some variable since it would then need to be both evaluated once and
3971 evaluated more than once. Front-ends must assure this case cannot
3972 happen by surrounding any such subexpressions in their own SAVE_EXPR
3973 and forcing evaluation at the proper time. */
3979 /* This expression might be placed ahead of a jump to ensure that the
3980 value was computed on both sides of the jump. So make sure it isn't
3981 eliminated as dead. */
3984 }
3986 /* Look inside EXPR into any simple arithmetic operations. Return the
3987 outermost non-arithmetic or non-invariant node. */
3989 tree
3991 {
3992 /* We don't care about whether this can be used as an lvalue in this
3993 context. */
3997 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3998 a constant, it will be more efficient to not make another SAVE_EXPR since
3999 it will allow better simplification and GCSE will be able to merge the
4000 computations if they actually occur. */
4002 {
4006 {
4011 else
4013 }
4014 else
4016 }
4019 }
4021 /* Look inside EXPR into simple arithmetic operations involving constants.
4022 Return the outermost non-arithmetic or non-constant node. */
4024 tree
4026 {
4031 {
4035 {
4040 else
4042 }
4043 else
4045 }
4048 }
4050 /* Return which tree structure is used by T. */
4052 enum tree_node_structure_enum
4054 {
4057 }
4059 /* Set various status flags when building a CALL_EXPR object T. */
4061 static void
4063 {
4068 /* Calls have side-effects, except those to const or pure functions. */
4071 /* Propagate TREE_READONLY of arguments for const functions. */
4077 {
4083 }
4087 }
4088 \f
4089 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4090 size or offset that depends on a field within a record. */
4092 bool
4094 {
4105 {
4107 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4108 position computations since they will be converted into a
4109 WITH_RECORD_EXPR involving the reference, which will assume
4110 here will be valid. */
4124 {
4126 /* Ignoring the first operand isn't quite right, but works best. */
4135 /* The save_expr function never wraps anything containing
4136 a PLACEHOLDER_EXPR. */
4141 }
4144 {
4152 }
4156 {
4158 {
4159 const_tree arg;
4160 const_call_expr_arg_iterator iter;
4165 }
4168 }
4172 }
4174 }
4176 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4177 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4178 field positions. */
4180 static bool
4182 {
4183 /* If the size contains a placeholder or the parent type (component type in
4184 the case of arrays) type involves a placeholder, this type does. */
4192 /* Now do type-specific checks. Note that the last part of the check above
4193 greatly limits what we have to do below. */
4195 {
4213 /* Here we just check the bounds. */
4218 /* We have already checked the component type above, so just check
4219 the domain type. Flexible array members have a null domain. */
4226 {
4227 tree field;
4238 }
4242 }
4243 }
4245 /* Wrapper around above function used to cache its result. */
4247 bool
4249 {
4252 /* If the contains_placeholder_bits field has been initialized,
4253 then we know the answer. */
4257 /* Indicate that we've seen this type node, and the answer is false.
4258 This is what we want to return if we run into recursion via fields. */
4261 /* Compute the real value. */
4264 /* Store the real value. */
4268 }
4269 \f
4270 /* Push tree EXP onto vector QUEUE if it is not already present. */
4272 static void
4274 {
4276 tree iter;
4284 }
4286 /* Given a tree EXP, find all occurrences of references to fields
4287 in a PLACEHOLDER_EXPR and place them in vector REFS without
4288 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4289 we assume here that EXP contains only arithmetic expressions
4290 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4291 argument list. */
4293 void
4295 {
4297 tree inner;
4300 /* We handle TREE_LIST and COMPONENT_REF separately. */
4302 {
4305 }
4307 {
4311 ;
4315 else
4317 }
4318 else
4320 {
4325 /* Variables allocated to static storage can stay. */
4331 /* This is the pattern built in ada/make_aligning_type. */
4334 {
4337 }
4339 /* Fall through. */
4357 }
4358 }
4360 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4361 return a tree with all occurrences of references to F in a
4362 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4363 CONST_DECLs. Note that we assume here that EXP contains only
4364 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4365 occurring only in their argument list. */
4367 tree
4369 {
4372 tree new_tree;
4374 /* We handle TREE_LIST and COMPONENT_REF separately. */
4376 {
4383 }
4385 {
4386 tree inner;
4388 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4389 and it is the right field, replace it with R. */
4393 ;
4395 /* The field. */
4401 /* If this expression hasn't been completed let, leave it alone. */
4409 new_tree
4411 }
4412 else
4414 {
4421 else
4428 /* Fall through. */
4436 {
4481 new_tree
4487 }
4491 {
4496 /* If we are trying to replace F with a constant or with another
4497 instance of one of the arguments of the call, inline back
4498 functions which do nothing else than computing a value from
4499 the arguments they are passed. This makes it possible to
4500 fold partially or entirely the replacement expression. */
4502 {
4506 else
4509 {
4512 }
4514 {
4518 }
4519 }
4522 {
4526 {
4530 }
4531 }
4534 {
4538 }
4539 else
4541 }
4546 }
4554 }
4556 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4557 for it within OBJ, a tree that is an object or a chain of references. */
4559 tree
4561 {
4564 tree new_tree;
4566 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4567 in the chain of OBJ. */
4569 {
4571 tree elt;
4601 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4602 survives until RTL generation, there will be an error. */
4604 }
4606 /* TREE_LIST is special because we need to look at TREE_VALUE
4607 and TREE_CHAIN, not TREE_OPERANDS. */
4609 {
4616 }
4617 else
4619 {
4632 {
4677 new_tree
4683 }
4687 {
4693 {
4697 {
4701 }
4702 }
4705 {
4709 }
4710 else
4712 }
4717 }
4725 }
4726 \f
4728 /* Subroutine of stabilize_reference; this is called for subtrees of
4729 references. Any expression with side-effects must be put in a SAVE_EXPR
4730 to ensure that it is only evaluated once.
4732 We don't put SAVE_EXPR nodes around everything, because assigning very
4733 simple expressions to temporaries causes us to miss good opportunities
4734 for optimizations. Among other things, the opportunity to fold in the
4735 addition of a constant into an addressing mode often gets lost, e.g.
4736 "y[i+1] += x;". In general, we take the approach that we should not make
4737 an assignment unless we are forced into it - i.e., that any non-side effect
4738 operator should be allowed, and that cse should take care of coalescing
4739 multiple utterances of the same expression should that prove fruitful. */
4741 static tree
4743 {
4744 tree result;
4747 /* We cannot ignore const expressions because it might be a reference
4748 to a const array but whose index contains side-effects. But we can
4749 ignore things that are actual constant or that already have been
4750 handled by this function. */
4756 {
4758 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4759 have side-effects. */
4762 /* FALLTHRU */
4770 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4771 so that it will only be evaluated once. */
4772 /* The reference (r) and comparison (<) classes could be handled as
4773 below, but it is generally faster to only evaluate them once. */
4779 /* Constants need no processing. In fact, we should never reach
4780 here. */
4784 /* Division is slow and tends to be compiled with jumps,
4785 especially the division by powers of 2 that is often
4786 found inside of an array reference. So do it just once. */
4792 /* Recursively stabilize each operand. */
4798 /* Recursively stabilize each operand. */
4804 }
4812 }
4814 /* Stabilize a reference so that we can use it any number of times
4815 without causing its operands to be evaluated more than once.
4816 Returns the stabilized reference. This works by means of save_expr,
4817 so see the caveats in the comments about save_expr.
4819 Also allows conversion expressions whose operands are references.
4820 Any other kind of expression is returned unchanged. */
4822 tree
4824 {
4825 tree result;
4829 {
4833 /* No action is needed in this case. */
4836 CASE_CONVERT:
4875 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4876 it wouldn't be ignored. This matters when dealing with
4877 volatiles. */
4880 /* If arg isn't a kind of lvalue we recognize, make no change.
4881 Caller should recognize the error for an invalid lvalue. */
4887 }
4896 }
4897 \f
4898 /* Low-level constructors for expressions. */
4900 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4901 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4903 void
4905 {
4906 tree node;
4911 /* We started out assuming this address is both invariant and constant, but
4912 does not have side effects. Now go down any handled components and see if
4913 any of them involve offsets that are either non-constant or non-invariant.
4914 Also check for side-effects.
4916 ??? Note that this code makes no attempt to deal with the case where
4917 taking the address of something causes a copy due to misalignment. */
4919 #define UPDATE_FLAGS(NODE) \
4920 do { tree _node = (NODE); \
4921 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4922 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4926 {
4927 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4928 array reference (probably made temporarily by the G++ front end),
4929 so ignore all the operands. */
4933 {
4939 }
4940 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4941 FIELD_DECL, apparently. The G++ front end can put something else
4942 there, at least temporarily. */
4945 {
4948 }
4949 }
4953 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4954 the address, since &(*a)->b is a form of addition. If it's a constant, the
4955 address is constant too. If it's a decl, its address is constant if the
4956 decl is static. Everything else is not constant and, furthermore,
4957 taking the address of a volatile variable is not volatile. */
4962 ;
4965 else
4966 {
4969 }
4974 #undef UPDATE_FLAGS
4975 }
4977 /* Build an expression of code CODE, data type TYPE, and operands as
4978 specified. Expressions and reference nodes can be created this way.
4979 Constants, decls, types and misc nodes cannot be.
4981 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4982 enough for all extant tree codes. */
4984 tree
4986 {
4987 tree t;
4995 }
4997 tree
4999 {
5001 tree t;
5017 {
5020 }
5023 {
5026 }
5028 {
5030 /* All of these have side-effects, no matter what their
5031 operands are. */
5037 /* Whether a dereference is readonly has nothing to do with whether
5038 its operand is readonly. */
5056 }
5059 }
5061 #define PROCESS_ARG(N) \
5062 do { \
5063 TREE_OPERAND (t, N) = arg##N; \
5064 if (arg##N &&!TYPE_P (arg##N)) \
5065 { \
5066 if (TREE_SIDE_EFFECTS (arg##N)) \
5067 side_effects = 1; \
5068 if (!TREE_READONLY (arg##N) \
5069 && !CONSTANT_CLASS_P (arg##N)) \
5070 (void) (read_only = 0); \
5071 if (!TREE_CONSTANT (arg##N)) \
5072 (void) (constant = 0); \
5073 } \
5074 } while (0)
5076 tree
5078 {
5080 tree t;
5086 /* When sizetype precision doesn't match that of pointers
5087 we need to be able to build explicit extensions or truncations
5088 of the offset argument. */
5100 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5101 result based on those same flags for the arguments. But if the
5102 arguments aren't really even `tree' expressions, we shouldn't be trying
5103 to do this. */
5105 /* Expressions without side effects may be constant if their
5106 arguments are as well. */
5113 {
5127 }
5134 {
5136 {
5140 }
5141 }
5142 else
5143 {
5145 /* Don't mark X / 0 as constant. */
5150 }
5153 }
5156 tree
5158 tree arg2 MEM_STAT_DECL)
5159 {
5161 tree t;
5171 /* As a special exception, if COND_EXPR has NULL branches, we
5172 assume that it is a gimple statement and always consider
5173 it to have side effects. */
5179 else
5195 }
5197 tree
5200 {
5202 tree t;
5222 }
5224 tree
5227 {
5229 tree t;
5246 {
5248 {
5252 }
5253 }
5254 else
5260 }
5262 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5263 on the pointer PTR. */
5265 tree
5267 {
5270 tree tem;
5271 /* For convenience allow addresses that collapse to a simple base
5272 and offset. */
5276 {
5280 {
5283 }
5284 else
5287 }
5292 }
5294 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5296 poly_offset_int
5298 {
5300 SIGNED);
5301 }
5303 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5304 offsetted by OFFSET units. */
5306 tree
5308 {
5315 }
5317 /* Similar except don't specify the TREE_TYPE
5318 and leave the TREE_SIDE_EFFECTS as 0.
5319 It is permissible for arguments to be null,
5320 or even garbage if their values do not matter. */
5322 tree
5324 {
5325 tree t;
5342 }
5344 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5345 tree vec. */
5347 tree
5349 {
5359 }
5360 \f
5361 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5362 and data type TYPE.
5363 We do NOT enter this node in any sort of symbol table.
5365 LOC is the location of the decl.
5367 layout_decl is used to set up the decl's storage layout.
5368 Other slots are initialized to 0 or null pointers. */
5370 tree
5372 tree type MEM_STAT_DECL)
5373 {
5374 tree t;
5379 /* if (type == error_mark_node)
5380 type = integer_type_node; */
5381 /* That is not done, deliberately, so that having error_mark_node
5382 as the type can suppress useless errors in the use of this variable. */
5391 }
5393 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5395 tree
5397 {
5403 }
5405 /* Builds and returns function declaration with NAME and TYPE. */
5407 tree
5409 {
5419 }
5423 /* Builds a new translation-unit decl with name NAME, queues it in the
5424 global list of translation-unit decls and returns it. */
5426 tree
5428 {
5434 }
5436 \f
5437 /* BLOCK nodes are used to represent the structure of binding contours
5438 and declarations, once those contours have been exited and their contents
5439 compiled. This information is used for outputting debugging info. */
5441 tree
5443 {
5451 }
5453 \f
5454 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5456 LOC is the location to use in tree T. */
5458 void
5460 {
5464 {
5468 }
5469 }
5471 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5472 UNKNOWN_LOCATION. */
5474 void
5476 {
5480 }
5481 \f
5482 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5483 of the various TYPE_QUAL values. */
5485 static void
5487 {
5493 }
5495 /* Returns true iff CAND and BASE have equivalent language-specific
5496 qualifiers. */
5498 bool
5500 {
5503 /* type_hash_eq currently only applies to these types. */
5508 }
5510 /* This function checks to see if TYPE matches the size one of the built-in
5511 atomic types, and returns that core atomic type. */
5513 static tree
5515 {
5516 tree base_atomic_type;
5518 /* Only handle complete types. */
5523 {
5546 }
5549 }
5551 /* Returns true iff unqualified CAND and BASE are equivalent. */
5553 bool
5555 {
5557 /* Apparently this is needed for Objective-C. */
5562 /* Check alignment. */
5566 /* Atomic types increase minimal alignment. We must to do so as well
5567 or we get duplicated canonical types. See PR88686. */
5569 {
5570 /* See if this object can map to a basic atomic type. */
5574 }
5576 }
5578 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5580 bool
5582 {
5586 }
5588 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5590 static bool
5592 {
5595 /* Apparently this is needed for Objective-C. */
5597 /* Check alignment. */
5599 /* Check this is a user-aligned type as build_aligned_type
5600 would create. */
5605 }
5607 /* Return a version of the TYPE, qualified as indicated by the
5608 TYPE_QUALS, if one exists. If no qualified version exists yet,
5609 return NULL_TREE. */
5611 tree
5613 {
5621 /* Search the chain of variants to see if there is already one there just
5622 like the one we need to have. If so, use that existing one. We must
5623 preserve the TYPE_NAME, since there is code that depends on this. */
5626 {
5627 /* Put the found variant at the head of the variant list so
5628 frequently searched variants get found faster. The C++ FE
5629 benefits greatly from this. */
5635 }
5638 }
5640 /* Like get_qualified_type, but creates the type if it does not
5641 exist. This function never returns NULL_TREE. */
5643 tree
5645 {
5646 tree t;
5648 /* See if we already have the appropriate qualified variant. */
5651 /* If not, build it. */
5653 {
5658 {
5659 /* See if this object can map to a basic atomic type. */
5662 {
5663 /* Ensure the alignment of this type is compatible with
5664 the required alignment of the atomic type. */
5667 }
5668 }
5671 /* Propagate structural equality. */
5674 /* Build the underlying canonical type, since it is different
5675 from TYPE. */
5676 {
5679 }
5680 else
5681 /* T is its own canonical type. */
5684 }
5687 }
5689 /* Create a variant of type T with alignment ALIGN. */
5691 tree
5693 {
5694 tree t;
5709 }
5711 /* Create a new distinct copy of TYPE. The new type is made its own
5712 MAIN_VARIANT. If TYPE requires structural equality checks, the
5713 resulting type requires structural equality checks; otherwise, its
5714 TYPE_CANONICAL points to itself. */
5716 tree
5718 {
5724 /* Set the canonical type either to a new equivalence class, or
5725 propagate the need for structural equality checks. */
5728 else
5731 /* Make it its own variant. */
5735 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5736 whose TREE_TYPE is not t. This can also happen in the Ada
5737 frontend when using subtypes. */
5740 }
5742 /* Create a new variant of TYPE, equivalent but distinct. This is so
5743 the caller can modify it. TYPE_CANONICAL for the return type will
5744 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5745 are considered equal by the language itself (or that both types
5746 require structural equality checks). */
5748 tree
5750 {
5755 /* Since we're building a variant, assume that it is a non-semantic
5756 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5758 /* Type variants have no alias set defined. */
5761 /* Add the new type to the chain of variants of TYPE. */
5767 }
5768 \f
5769 /* Return true if the from tree in both tree maps are equal. */
5771 int
5773 {
5777 }
5779 /* Hash a from tree in a tree_base_map. */
5781 unsigned int
5783 {
5785 }
5787 /* Return true if this tree map structure is marked for garbage collection
5788 purposes. We simply return true if the from tree is marked, so that this
5789 structure goes away when the from tree goes away. */
5791 bool
5793 {
5795 }
5797 /* Hash a from tree in a tree_map. */
5799 unsigned int
5801 {
5803 }
5805 /* Hash a from tree in a tree_decl_map. */
5807 unsigned int
5809 {
5811 }
5813 /* Return the initialization priority for DECL. */
5815 priority_type
5817 {
5822 return
5824 }
5826 /* Return the finalization priority for DECL. */
5828 priority_type
5830 {
5835 return
5837 }
5839 /* Set the initialization priority for DECL to PRIORITY. */
5841 void
5843 {
5847 {
5851 }
5854 else
5857 }
5859 /* Set the finalization priority for DECL to PRIORITY. */
5861 void
5863 {
5867 {
5871 }
5872 else
5875 }
5877 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5879 static void
5881 {
5886 }
5888 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5890 static void
5892 {
5897 }
5899 /* Lookup a debug expression for FROM, and return it if we find one. */
5901 tree
5903 {
5911 }
5913 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5915 void
5917 {
5924 }
5926 /* Lookup a value expression for FROM, and return it if we find one. */
5928 tree
5930 {
5938 }
5940 /* Insert a mapping FROM->TO in the value expression hashtable. */
5942 void
5944 {
5947 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5954 }
5956 /* Lookup a vector of debug arguments for FROM, and return it if we
5957 find one. */
5961 {
5972 }
5974 /* Insert a mapping FROM->empty vector of debug arguments in the value
5975 expression hashtable. */
5979 {
5994 }
5996 /* Hashing of types so that we don't make duplicates.
5997 The entry point is `type_hash_canon'. */
5999 /* Generate the default hash code for TYPE. This is designed for
6000 speed, rather than maximum entropy. */
6002 hashval_t
6004 {
6013 /* Just the identifier is adequate to distinguish. */
6017 {
6020 /* FALLTHROUGH. */
6032 {
6036 {
6039 }
6040 }
6044 {
6051 }
6054 {
6060 }
6064 {
6068 }
6076 }
6079 }
6081 /* These are the Hashtable callback functions. */
6083 /* Returns true iff the types are equivalent. */
6085 bool
6087 {
6088 /* First test the things that are the same for all types. */
6098 /* Be careful about comparing arrays before and after the element type
6099 has been completed; don't compare TYPE_ALIGN unless both types are
6100 complete. */
6107 {
6130 /* fall through */
6167 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6168 where the flag should be inherited from the element type
6169 and can change after ARRAY_TYPEs are created; on non-aggregates
6170 compare it and hash it, scalars will never have that flag set
6171 and we need to differentiate between arrays created by different
6172 front-ends or middle-end created arrays. */
6204 }
6210 }
6212 /* Given TYPE, and HASHCODE its hash code, return the canonical
6213 object for an identical type if one already exists.
6214 Otherwise, return TYPE, and record it as the canonical object.
6216 To use this function, first create a type of the sort you want.
6217 Then compute its hash code from the fields of the type that
6218 make it different from other similar types.
6219 Then call this function and use the value. */
6221 tree
6223 {
6224 type_hash in;
6227 /* The hash table only contains main variants, so ensure that's what we're
6228 being passed. */
6231 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6232 must call that routine before comparing TYPE_ALIGNs. */
6240 {
6246 /* Free also min/max values and the cache for integer
6247 types. This can't be done in free_node, as LTO frees
6248 those on its own. */
6250 {
6253 {
6254 /* Zero is always in TYPE_CACHED_VALUES. */
6258 }
6261 {
6264 }
6267 }
6270 }
6271 else
6272 {
6281 }
6282 }
6284 static void
6286 {
6291 }
6293 /* Given two lists of types
6294 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6295 return 1 if the lists contain the same types in the same order.
6296 Also, the TREE_PURPOSEs must match. */
6298 bool
6300 {
6312 }
6314 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6315 given by TYPE. If the argument list accepts variable arguments,
6316 then this function counts only the ordinary arguments. */
6318 int
6320 {
6324 /* If the function does not take a variable number of arguments,
6325 the last element in the list will have type `void'. */
6328 else
6332 }
6334 /* Return the type of the function TYPE's argument ARGNO if known.
6335 For vararg function's where ARGNO refers to one of the variadic
6336 arguments return null. Otherwise, return a void_type_node for
6337 out-of-bounds ARGNO. */
6339 tree
6341 {
6342 /* Treat zero the same as an out-of-bounds argument number. */
6346 function_args_iterator iter;
6348 tree argtype;
6351 {
6352 /* A vararg function's argument list ends in a null. Otherwise,
6353 an ordinary function's argument list ends with void. Return
6354 null if ARGNO refers to a vararg argument, void_type_node if
6355 it's out of bounds, and the formal argument type otherwise. */
6363 }
6366 }
6368 /* True if integer constants T1 and T2
6369 represent the same constant value. */
6371 bool
6373 {
6389 }
6391 /* Return true if T is an INTEGER_CST whose numerical value (extended
6392 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6394 bool
6396 {
6400 }
6402 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6403 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6405 bool
6407 {
6411 {
6416 }
6419 }
6421 /* Return true if T is an INTEGER_CST whose numerical value (extended
6422 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6424 bool
6426 {
6430 }
6432 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6433 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6435 bool
6437 {
6441 {
6446 }
6449 }
6451 /* T is an INTEGER_CST whose numerical value (extended according to
6452 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6453 HOST_WIDE_INT. */
6455 HOST_WIDE_INT
6457 {
6460 }
6462 /* T is an INTEGER_CST whose numerical value (extended according to
6463 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6464 HOST_WIDE_INT. */
6466 unsigned HOST_WIDE_INT
6468 {
6471 }
6473 /* Return the most significant (sign) bit of T. */
6475 int
6477 {
6481 }
6483 /* Return an indication of the sign of the integer constant T.
6484 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6485 Note that -1 will never be returned if T's type is unsigned. */
6487 int
6489 {
6496 else
6498 }
6500 /* Return the minimum number of bits needed to represent VALUE in a
6501 signed or unsigned type, UNSIGNEDP says which. */
6503 unsigned int
6505 {
6506 /* If the value is negative, compute its negative minus 1. The latter
6507 adjustment is because the absolute value of the largest negative value
6508 is one larger than the largest positive value. This is equivalent to
6509 a bit-wise negation, so use that operation instead. */
6514 /* Return the number of bits needed, taking into account the fact
6515 that we need one more bit for a signed than unsigned type.
6516 If value is 0 or -1, the minimum precision is 1 no matter
6517 whether unsignedp is true or false. */
6521 else
6523 }
6525 /* Return truthvalue of whether T1 is the same tree structure as T2.
6526 Return 1 if they are the same.
6527 Return 0 if they are understandably different.
6528 Return -1 if either contains tree structure not understood by
6529 this function. */
6531 int
6533 {
6543 /* For location wrappers to be the same, they must be at the same
6544 source location (and wrap the same thing). */
6546 {
6550 }
6556 {
6560 else
6562 }
6572 {
6588 {
6597 /* ??? Should we handle also fields here? */
6601 }
6612 {
6620 {
6624 }
6626 }
6629 /* Special case: if either target is an unallocated VAR_DECL,
6630 it means that it's going to be unified with whatever the
6631 TARGET_EXPR is really supposed to initialize, so treat it
6632 as being equivalent to anything. */
6640 else
6669 /* A false return means maybe_ne rather than known_ne. */
6675 }
6677 /* This general rule works for most tree codes. All exceptions should be
6678 handled above. If this is a language-specific tree code, we can't
6679 trust what might be in the operand, so say we don't know
6680 the situation. */
6685 {
6694 {
6698 }
6704 }
6705 }
6707 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6708 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6709 than U, respectively. */
6711 int
6713 {
6722 else
6724 }
6726 /* Return true if SIZE represents a constant size that is in bounds of
6727 what the middle-end and the backend accepts (covering not more than
6728 half of the address-space).
6729 When PERR is non-null, set *PERR on failure to the description of
6730 why SIZE is not valid. */
6732 bool
6734 {
6736 {
6743 }
6745 cst_size_error error;
6750 {
6753 }
6756 {
6759 }
6762 {
6765 }
6769 {
6772 }
6775 }
6777 /* Return the precision of the type, or for a complex or vector type the
6778 precision of the type of its elements. */
6780 unsigned int
6782 {
6790 }
6792 /* Return true if CODE represents an associative tree code. Otherwise
6793 return false. */
6794 bool
6796 {
6798 {
6810 }
6812 }
6814 /* Return true if CODE represents a commutative tree code. Otherwise
6815 return false. */
6816 bool
6818 {
6820 {
6847 }
6849 }
6851 /* Return true if CODE represents a ternary tree code for which the
6852 first two operands are commutative. Otherwise return false. */
6853 bool
6855 {
6857 {
6865 }
6867 }
6869 /* Returns true if CODE can overflow. */
6871 bool
6873 {
6875 {
6880 /* Can overflow in various ways. */
6886 /* For INT_MIN / -1. */
6890 /* For -INT_MIN. */
6893 /* These operators cannot overflow. */
6895 }
6896 }
6898 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6899 ftrapv doesn't generate trapping insns for CODE. */
6901 bool
6903 {
6906 /* We don't generate instructions that trap on overflow for complex or vector
6907 types. */
6915 {
6921 /* These operators can overflow, and -ftrapv generates trapping code for
6922 these. */
6929 /* These operators can overflow, but -ftrapv does not generate trapping
6930 code for these. */
6933 /* These operators cannot overflow. */
6935 }
6936 }
6938 /* Constructors for pointer, array and function types.
6939 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6940 constructed by language-dependent code, not here.) */
6942 /* Construct, lay out and return the type of pointers to TO_TYPE with
6943 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6944 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6945 indicate this type can reference all of memory. If such a type has
6946 already been constructed, reuse it. */
6948 tree
6951 {
6952 tree t;
6959 {
6962 }
6964 /* If the pointed-to type has the may_alias attribute set, force
6965 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6969 /* In some cases, languages will have things that aren't a POINTER_TYPE
6970 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6971 In that case, return that type without regard to the rest of our
6972 operands.
6974 ??? This is a kludge, but consistent with the way this function has
6975 always operated and there doesn't seem to be a good way to avoid this
6976 at the moment. */
6981 /* First, if we already have a type for pointers to TO_TYPE and it's
6982 the proper mode, use it. */
6995 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7003 /* Lay out the type. This function has many callers that are concerned
7004 with expression-construction, and this simplifies them all. */
7008 }
7010 /* By default build pointers in ptr_mode. */
7012 tree
7014 {
7016 }
7018 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7020 tree
7023 {
7024 tree t;
7031 {
7034 }
7036 /* If the pointed-to type has the may_alias attribute set, force
7037 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7041 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7042 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7043 In that case, return that type without regard to the rest of our
7044 operands.
7046 ??? This is a kludge, but consistent with the way this function has
7047 always operated and there doesn't seem to be a good way to avoid this
7048 at the moment. */
7053 /* First, if we already have a type for pointers to TO_TYPE and it's
7054 the proper mode, use it. */
7067 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7078 }
7081 /* Build the node for the type of references-to-TO_TYPE by default
7082 in ptr_mode. */
7084 tree
7086 {
7088 }
7090 #define MAX_INT_CACHED_PREC \
7091 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7094 static void
7096 {
7098 {
7100 }
7101 }
7103 /* Builds a signed or unsigned integer type of precision PRECISION.
7104 Used for C bitfields whose precision does not match that of
7105 built-in target types. */
7106 tree
7109 {
7116 {
7120 }
7127 else
7137 }
7139 #define MAX_BOOL_CACHED_PREC \
7140 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7143 /* Builds a boolean type of precision PRECISION.
7144 Used for boolean vectors to choose proper vector element size. */
7145 tree
7147 {
7148 tree type;
7151 {
7155 }
7165 }
7169 /* Builds a signed or unsigned _BitInt(PRECISION) type. */
7170 tree
7172 {
7184 {
7188 }
7195 else
7205 }
7207 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7208 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7209 is true, reuse such a type that has already been constructed. */
7211 static tree
7213 {
7236 {
7237 /* Since we cannot reliably merge this type, we need to compare it using
7238 structural equality checks. */
7241 }
7247 }
7249 /* Wrapper around build_range_type_1 with SHARED set to true. */
7251 tree
7253 {
7255 }
7257 /* Wrapper around build_range_type_1 with SHARED set to false. */
7259 tree
7261 {
7263 }
7265 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7266 MAXVAL should be the maximum value in the domain
7267 (one less than the length of the array).
7269 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7270 We don't enforce this limit, that is up to caller (e.g. language front end).
7271 The limit exists because the result is a signed type and we don't handle
7272 sizes that use more than one HOST_WIDE_INT. */
7274 tree
7276 {
7278 }
7280 /* Return true if the debug information for TYPE, a subtype, should be emitted
7281 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7282 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7283 debug info and doesn't reflect the source code. */
7285 bool
7287 {
7290 /* Subrange types have a base type which is an integral type. */
7294 /* Get the real bounds of the subtype. */
7297 else
7298 {
7301 }
7303 /* If the type and its base type have the same representation and the same
7304 name, then the type is not a subrange but a copy of the base type. */
7318 }
7320 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7321 and number of elements specified by the range of values of INDEX_TYPE.
7322 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7323 If SHARED is true, reuse such a type that has already been constructed.
7324 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7326 tree
7329 {
7330 tree t;
7333 {
7336 }
7346 {
7349 }
7352 {
7361 index_type
7364 }
7367 }
7369 /* Wrapper around build_array_type_1 with SHARED set to true. */
7371 tree
7373 {
7374 return
7376 }
7378 /* Wrapper around build_array_type_1 with SHARED set to false. */
7380 tree
7382 {
7384 }
7386 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7387 sizetype. */
7389 tree
7391 {
7393 }
7395 /* Computes the canonical argument types from the argument type list
7396 ARGTYPES.
7398 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7399 on entry to this function, or if any of the ARGTYPES are
7400 structural.
7402 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7403 true on entry to this function, or if any of the ARGTYPES are
7404 non-canonical.
7406 Returns a canonical argument list, which may be ARGTYPES when the
7407 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7408 true) or would not differ from ARGTYPES. */
7410 static tree
7414 {
7415 tree arg;
7419 {
7421 /* Fail gracefully by stating that the type is structural. */
7427 /* If the argument has a default argument, we consider it
7428 non-canonical even though the type itself is canonical.
7429 That way, different variants of function and method types
7430 with default arguments will all point to the variant with
7431 no defaults as their canonical type. */
7433 }
7439 {
7440 /* Build the canonical list of argument types. */
7445 {
7448 else
7451 canon_argtypes);
7452 }
7458 /* There is a non-canonical type. */
7461 }
7463 /* The canonical argument types are the same as ARGTYPES. */
7465 }
7467 /* Construct, lay out and return
7468 the type of functions returning type VALUE_TYPE
7469 given arguments of types ARG_TYPES.
7470 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7471 are data type nodes for the arguments of the function.
7472 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7473 variable-arguments function with (...) prototype (no named arguments).
7474 If such a type has already been constructed, reuse it. */
7476 tree
7479 {
7480 tree t;
7483 tree canon_argtypes;
7488 {
7491 }
7493 /* Make a node of the sort we want. */
7498 {
7501 }
7503 /* If we already have such a type, use the old one. */
7507 /* Set up the canonical type. */
7517 canon_argtypes);
7522 }
7524 /* Build a function type. The RETURN_TYPE is the type returned by the
7525 function. If VAARGS is set, no void_type_node is appended to the
7526 list. ARGP must be always be terminated be a NULL_TREE. */
7528 static tree
7530 {
7538 {
7543 }
7546 else
7547 {
7551 }
7555 }
7557 /* Build a function type. The RETURN_TYPE is the type returned by the
7558 function. If additional arguments are provided, they are
7559 additional argument types. The list of argument types must always
7560 be terminated by NULL_TREE. */
7562 tree
7564 {
7565 tree args;
7572 }
7574 /* Build a variable argument function type. The RETURN_TYPE is the
7575 type returned by the function. If additional arguments are provided,
7576 they are additional argument types. The list of argument types must
7577 always be terminated by NULL_TREE. */
7579 tree
7581 {
7582 tree args;
7590 }
7592 /* Build a function type. RETURN_TYPE is the type returned by the
7593 function; VAARGS indicates whether the function takes varargs. The
7594 function takes N named arguments, the types of which are provided in
7595 ARG_TYPES. */
7597 static tree
7600 {
7608 }
7610 /* Build a function type. RETURN_TYPE is the type returned by the
7611 function. The function takes N named arguments, the types of which
7612 are provided in ARG_TYPES. */
7614 tree
7616 {
7618 }
7620 /* Build a variable argument function type. RETURN_TYPE is the type
7621 returned by the function. The function takes N named arguments, the
7622 types of which are provided in ARG_TYPES. */
7624 tree
7626 {
7628 }
7630 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7631 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7632 for the method. An implicit additional parameter (of type
7633 pointer-to-BASETYPE) is added to the ARGTYPES. */
7635 tree
7637 tree rettype,
7638 tree argtypes)
7639 {
7640 tree t;
7641 tree ptype;
7643 tree canon_argtypes;
7645 /* Make a node of the sort we want. */
7652 /* The actual arglist for this function includes a "hidden" argument
7653 which is "this". Put it into the list of argument types. */
7657 /* If we already have such a type, use the old one. */
7661 /* Set up the canonical type. */
7662 any_structural_p
7665 any_noncanonical_p
7677 canon_argtypes);
7682 }
7684 /* Construct, lay out and return the type of methods belonging to class
7685 BASETYPE and whose arguments and values are described by TYPE.
7686 If that type exists already, reuse it.
7687 TYPE must be a FUNCTION_TYPE node. */
7689 tree
7691 {
7697 }
7699 /* Construct, lay out and return the type of offsets to a value
7700 of type TYPE, within an object of type BASETYPE.
7701 If a suitable offset type exists already, reuse it. */
7703 tree
7705 {
7706 tree t;
7708 /* Make a node of the sort we want. */
7714 /* If we already have such a type, use the old one. */
7722 {
7731 }
7734 }
7736 /* Create a complex type whose components are COMPONENT_TYPE.
7738 If NAMED is true, the type is given a TYPE_NAME. We do not always
7739 do so because this creates a DECL node and thus make the DECL_UIDs
7740 dependent on the type canonicalization hashtable, which is GC-ed,
7741 so the DECL_UIDs would not be stable wrt garbage collection. */
7743 tree
7745 {
7750 /* Make a node of the sort we want. */
7755 /* If we already have such a type, use the old one. */
7760 {
7761 /* We created a new type. The hash insertion will have laid
7762 out the type. We need to check the canonicalization and
7763 maybe set the name. */
7774 /* We need to create a name, since complex is a fundamental type. */
7776 {
7805 }
7806 }
7809 }
7811 /* If TYPE is a real or complex floating-point type and the target
7812 does not directly support arithmetic on TYPE then return the wider
7813 type to be used for arithmetic on TYPE. Otherwise, return
7814 NULL_TREE. */
7816 tree
7818 {
7819 /* The target can give two different responses to the question of
7820 which excess precision mode it would like depending on whether we
7821 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7823 enum excess_precision_type requested_type
7825 ? EXCESS_PRECISION_TYPE_FAST
7829 enum flt_eval_method target_flt_eval_method
7832 /* The target should not ask for unpredictable float evaluation (though
7833 it might advertise that implicitly the evaluation is unpredictable,
7834 but we don't care about that here, it will have been reported
7835 elsewhere). If it does ask for unpredictable evaluation, we have
7836 nothing to do here. */
7839 /* Nothing to do. The target has asked for all types we know about
7840 to be computed with their native precision and range. */
7844 /* The target will promote this type in a target-dependent way, so excess
7845 precision ought to leave it alone. */
7849 machine_mode float16_type_mode = (float16_type_node
7852 machine_mode bfloat16_type_mode = (bfloat16_type_node
7859 {
7861 {
7864 {
7885 }
7887 }
7889 {
7894 {
7915 }
7917 }
7920 }
7923 }
7924 \f
7925 /* Return OP, stripped of any conversions to wider types as much as is safe.
7926 Converting the value back to OP's type makes a value equivalent to OP.
7928 If FOR_TYPE is nonzero, we return a value which, if converted to
7929 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7931 OP must have integer, real or enumeral type. Pointers are not allowed!
7933 There are some cases where the obvious value we could return
7934 would regenerate to OP if converted to OP's type,
7935 but would not extend like OP to wider types.
7936 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7937 For example, if OP is (unsigned short)(signed char)-1,
7938 we avoid returning (signed char)-1 if FOR_TYPE is int,
7939 even though extending that to an unsigned short would regenerate OP,
7940 since the result of extending (signed char)-1 to (int)
7941 is different from (int) OP. */
7943 tree
7945 {
7946 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7948 unsigned final_prec
7950 int uns
7957 {
7960 /* TYPE_PRECISION on vector types has different meaning
7961 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7962 so avoid them here. */
7969 /* Truncations are many-one so cannot be removed.
7970 Unless we are later going to truncate down even farther. */
7975 /* See what's inside this conversion. If we decide to strip it,
7976 we will set WIN. */
7979 /* If we have not stripped any zero-extensions (uns is 0),
7980 we can strip any kind of extension.
7981 If we have previously stripped a zero-extension,
7982 only zero-extensions can safely be stripped.
7983 Any extension can be stripped if the bits it would produce
7984 are all going to be discarded later by truncating to FOR_TYPE. */
7987 {
7990 /* TYPE_UNSIGNED says whether this is a zero-extension.
7991 Let's avoid computing it if it does not affect WIN
7992 and if UNS will not be needed again. */
7996 {
7999 }
8000 }
8001 }
8003 /* If we finally reach a constant see if it fits in sth smaller and
8004 in that case convert it. */
8006 {
8012 {
8016 }
8017 }
8020 }
8021 \f
8022 /* Return OP or a simpler expression for a narrower value
8023 which can be sign-extended or zero-extended to give back OP.
8024 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8025 or 0 if the value should be sign-extended. */
8027 tree
8029 {
8036 {
8037 do
8051 ret);
8053 }
8055 {
8056 int bitschange
8060 /* Truncations are many-one so cannot be removed. */
8064 /* See what's inside this conversion. If we decide to strip it,
8065 we will set WIN. */
8068 {
8070 /* An extension: the outermost one can be stripped,
8071 but remember whether it is zero or sign extension. */
8074 /* Otherwise, if a sign extension has been stripped,
8075 only sign extensions can now be stripped;
8076 if a zero extension has been stripped, only zero-extensions. */
8080 }
8082 {
8083 /* A change in nominal type can always be stripped, but we must
8084 preserve the unsignedness. */
8089 /* Keep trying to narrow, but don't assign op to win if it
8090 would turn an integral type into something else. */
8093 }
8096 }
8099 /* Since type_for_size always gives an integer type. */
8102 /* Ensure field is laid out already. */
8105 {
8106 unsigned HOST_WIDE_INT innerprec
8112 /* We can get this structure field in a narrower type that fits it,
8113 but the resulting extension to its nominal type (a fullword type)
8114 must satisfy the same conditions as for other extensions.
8116 Do this only for fields that are aligned (not bit-fields),
8117 because when bit-field insns will be used there is no
8118 advantage in doing this. */
8124 {
8128 }
8129 }
8133 }
8134 \f
8135 /* Return true if integer constant C has a value that is permissible
8136 for TYPE, an integral type. */
8138 bool
8140 {
8145 /* Non-standard boolean types can have arbitrary precision but various
8146 transformations assume that they can only take values 0 and +/-1. */
8150 retry:
8154 /* If at least one bound of the type is a constant integer, we can check
8155 ourselves and maybe make a decision. If no such decision is possible, but
8156 this type is a subtype, try checking against that. Otherwise, use
8157 fits_to_tree_p, which checks against the precision.
8159 Compute the status for each possibly constant bound, and return if we see
8160 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8161 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8162 for "constant known to fit". */
8164 /* Check if c >= type_low_bound. */
8166 {
8170 }
8171 else
8174 /* Check if c <= type_high_bound. */
8176 {
8180 }
8181 else
8184 /* If the constant fits both bounds, the result is known. */
8188 /* Perform some generic filtering which may allow making a decision
8189 even if the bounds are not constant. First, negative integers
8190 never fit in unsigned types, */
8194 /* Second, narrower types always fit in wider ones. */
8198 /* Third, unsigned integers with top bit set never fit signed types. */
8200 {
8203 {
8204 /* When a tree_cst is converted to a wide-int, the precision
8205 is taken from the type. However, if the precision of the
8206 mode underneath the type is smaller than that, it is
8207 possible that the value will not fit. The test below
8208 fails if any bit is set between the sign bit of the
8209 underlying mode and the top bit of the type. */
8212 }
8215 }
8217 /* If we haven't been able to decide at this point, there nothing more we
8218 can check ourselves here. Look at the base type if we have one and it
8219 has the same precision. */
8223 {
8226 }
8228 /* Or to fits_to_tree_p, if nothing else. */
8230 }
8232 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8233 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8234 represented (assuming two's-complement arithmetic) within the bit
8235 precision of the type are returned instead. */
8237 void
8239 {
8243 else
8244 {
8247 else
8248 {
8251 }
8252 }
8257 else
8258 {
8261 }
8262 }
8264 /* Return true if VAR is an automatic variable. */
8266 bool
8268 {
8273 }
8275 /* Return true if VAR is an automatic variable defined in function FN. */
8277 bool
8279 {
8283 }
8285 /* Subprogram of following function. Called by walk_tree.
8287 Return *TP if it is an automatic variable or parameter of the
8288 function passed in as DATA. */
8290 static tree
8292 {
8303 }
8305 /* Returns true if T is, contains, or refers to a type with variable
8306 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8307 arguments, but not the return type. If FN is nonzero, only return
8308 true if a modifier of the type or position of FN is a variable or
8309 parameter inside FN.
8311 This concept is more general than that of C99 'variably modified types':
8312 in C99, a struct type is never variably modified because a VLA may not
8313 appear as a structure member. However, in GNU C code like:
8315 struct S { int i[f()]; };
8317 is valid, and other languages may define similar constructs. */
8319 bool
8321 {
8322 tree t;
8324 /* Test if T is either variable (if FN is zero) or an expression containing
8325 a variable in FN. If TYPE isn't gimplified, return true also if
8326 gimplify_one_sizepos would gimplify the expression into a local
8327 variable. */
8328 #define RETURN_TRUE_IF_VAR(T) \
8329 do { tree _t = (T); \
8330 if (_t != NULL_TREE \
8331 && _t != error_mark_node \
8332 && !CONSTANT_CLASS_P (_t) \
8333 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8334 && (!fn \
8335 || (!TYPE_SIZES_GIMPLIFIED (type) \
8336 && (TREE_CODE (_t) != VAR_DECL \
8337 && !CONTAINS_PLACEHOLDER_P (_t))) \
8338 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8339 return true; } while (0)
8344 /* If TYPE itself has variable size, it is variably modified. */
8349 {
8353 /* Ada can have pointer types refering to themselves indirectly. */
8358 {
8361 }
8367 /* If TYPE is a function type, it is variably modified if the
8368 return type is variably modified. */
8378 /* Scalar types are variably modified if their end points
8379 aren't constant. */
8387 /* We can't see if any of the fields are variably-modified by the
8388 definition we normally use, since that would produce infinite
8389 recursion via pointers. */
8390 /* This is variably modified if some field's type is. */
8393 {
8398 /* If the type is a qualified union, then the DECL_QUALIFIER
8399 of fields can also be an expression containing a variable. */
8403 /* If the field is a qualified union, then it's only a container
8404 for what's inside so we look into it. That's necessary in LTO
8405 mode because the sizes of the field tested above have been set
8406 to PLACEHOLDER_EXPRs by free_lang_data. */
8410 }
8414 /* Do not call ourselves to avoid infinite recursion. This is
8415 variably modified if the element type is. */
8422 }
8424 /* The current language may have other cases to check, but in general,
8425 all other types are not variably modified. */
8428 #undef RETURN_TRUE_IF_VAR
8429 }
8431 /* Given a DECL or TYPE, return the scope in which it was declared, or
8432 NULL_TREE if there is no containing scope. */
8434 tree
8436 {
8438 }
8440 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8442 const_tree
8444 {
8446 {
8449 else
8451 }
8453 }
8455 /* Return the innermost context enclosing DECL that is
8456 a FUNCTION_DECL, or zero if none. */
8458 tree
8460 {
8461 tree context;
8466 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8467 where we look up the function at runtime. Such functions always take
8468 a first argument of type 'pointer to real context'.
8470 C++ should really be fixed to use DECL_CONTEXT for the real context,
8471 and use something else for the "virtual context". */
8473 context
8474 = TYPE_MAIN_VARIANT
8476 else
8480 {
8483 else
8485 }
8488 }
8490 /* Return the innermost context enclosing DECL that is
8491 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8492 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8494 tree
8496 {
8501 {
8522 }
8525 }
8527 /* CALL is a CALL_EXPR. Return the declaration for the function
8528 called, or NULL_TREE if the called function cannot be
8529 determined. */
8531 tree
8533 {
8534 tree addr;
8539 /* It's invalid to call this function with anything but a
8540 CALL_EXPR. */
8543 /* The first operand to the CALL is the address of the function
8544 called. */
8547 /* If there is no function, return early. */
8553 /* If this is a readonly function pointer, extract its initial value. */
8559 /* If the address is just `&f' for some function `f', then we know
8560 that `f' is being called. */
8565 /* We couldn't figure out what was being called. */
8567 }
8569 /* Return true when STMTs arguments and return value match those of FNDECL,
8570 a decl of a builtin function. */
8572 static bool
8574 {
8592 {
8593 /* Variadic args follow. */
8601 {
8602 /* For pointer arguments be more forgiving, e.g. due to
8603 FILE * vs. fileptr_type_node, or say char * vs. const char *
8604 differences etc. */
8610 /* char/short integral arguments are promoted to int
8611 by several frontends if targetm.calls.promote_prototypes
8612 is true. Allow such promotion too. */
8618 && (gimple_form
8625 }
8626 }
8630 }
8632 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8633 return the associated function code, otherwise return CFN_LAST. */
8635 combined_fn
8637 {
8638 /* It's invalid to call this function with anything but a CALL_EXPR. */
8651 }
8653 /* Comparator of indices based on tree_node_counts. */
8655 static int
8657 {
8662 }
8664 /* Comparator of indices based on tree_code_counts. */
8666 static int
8668 {
8673 }
8675 #define TREE_MEM_USAGE_SPACES 40
8677 /* Print debugging information about tree nodes generated during the compile,
8678 and any language-specific information. */
8680 void
8682 {
8684 {
8690 {
8697 {
8704 }
8709 }
8711 {
8721 {
8726 }
8733 }
8734 }
8735 else
8742 }
8743 \f
8746 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8748 unsigned
8750 {
8751 /* This relies on the raw feedback's top 4 bits being zero. */
8752 #define FEEDBACK(X) ((X) * 0x04c11db7)
8753 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8754 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8756 {
8761 };
8762 #undef FEEDBACK
8763 #undef SYNDROME
8767 {
8771 }
8774 }
8776 /* Generate a crc32 of a string. */
8778 unsigned
8780 {
8781 do
8785 }
8787 /* P is a string that will be used in a symbol. Mask out any characters
8788 that are not valid in that context. */
8790 void
8792 {
8797 #endif
8800 #endif
8801 ))
8803 }
8807 /* Create a unique anonymous identifier. The identifier is still a
8808 valid assembly label. */
8810 tree
8812 {
8814 #if !defined (NO_DOT_IN_LABEL)
8815 "."
8816 #elif !defined (NO_DOLLAR_IN_LABEL)
8817 "$"
8818 #else
8819 "_"
8820 #endif
8831 }
8833 /* Generate a name for a special-purpose function.
8834 The generated name may need to be unique across the whole link.
8835 Changes to this function may also require corresponding changes to
8836 xstrdup_mask_random.
8837 TYPE is some string to identify the purpose of this function to the
8838 linker or collect2; it must start with an uppercase letter,
8839 one of:
8840 I - for constructors
8841 D - for destructors
8842 N - for C++ anonymous namespaces
8843 F - for DWARF unwind frame information. */
8845 tree
8847 {
8852 /* If we already have a name we know to be unique, just use that. */
8855 /* If the target is handling the constructors/destructors, they
8856 will be local to this file and the name is only necessary for
8857 debugging purposes.
8858 We also assign sub_I and sub_D sufixes to constructors called from
8859 the global static constructors. These are always local. */
8863 {
8867 /* Just use the file's basename, because the full pathname
8868 might be quite long. */
8870 }
8871 else
8872 {
8873 /* Otherwise, the name must be unique across the entire link.
8874 We don't have anything that we know to be unique to this translation
8875 unit, so use what we do have and throw in some randomness. */
8893 }
8899 /* Set up the name of the file-level functions we may need.
8900 Use a global object (which is already required to be unique over
8901 the program) rather than the file name (which imposes extra
8902 constraints). */
8906 }
8907 \f
8908 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8910 /* Complain that the tree code of NODE does not match the expected 0
8911 terminated list of trailing codes. The trailing code list can be
8912 empty, for a more vague error message. FILE, LINE, and FUNCTION
8913 are of the caller. */
8915 void
8918 {
8929 {
8936 {
8943 }
8945 }
8946 else
8952 }
8954 /* Complain that the tree code of NODE does match the expected 0
8955 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8956 the caller. */
8958 void
8961 {
8975 {
8977 {
8980 }
8983 }
8989 }
8991 /* Similar to tree_check_failed, except that we check for a class of tree
8992 code, given in CL. */
8994 void
8997 {
8998 internal_error
9003 }
9005 /* Similar to tree_check_failed, except that instead of specifying a
9006 dozen codes, use the knowledge that they're all sequential. */
9008 void
9012 {
9025 {
9032 }
9037 }
9040 /* Similar to tree_check_failed, except that we check that a tree does
9041 not have the specified code, given in CL. */
9043 void
9046 {
9047 internal_error
9052 }
9055 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9057 void
9060 {
9066 }
9069 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9071 void
9075 {
9088 {
9095 }
9100 }
9103 #undef DEFTREESTRUCT
9104 #define DEFTREESTRUCT(VAL, NAME) NAME,
9108 };
9109 #undef DEFTREESTRUCT
9111 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9113 /* Similar to tree_class_check_failed, except that we check for
9114 whether CODE contains the tree structure identified by EN. */
9116 void
9121 {
9122 internal_error
9126 }
9129 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9130 (dynamically sized) vector. */
9132 void
9135 {
9136 internal_error
9140 }
9142 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9143 (dynamically sized) vector. */
9145 void
9148 {
9149 internal_error
9152 }
9154 /* Similar to above, except that the check is for the bounds of the operand
9155 vector of an expression node EXP. */
9157 void
9160 {
9162 internal_error
9166 }
9168 /* Similar to above, except that the check is for the number of
9169 operands of an OMP_CLAUSE node. */
9171 void
9174 {
9175 internal_error
9180 }
9182 \f
9183 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9184 and mapped to the machine mode MODE. Initialize its fields and build
9185 the information necessary for debugging output. */
9187 static tree
9189 {
9190 tree t;
9211 /* We have built a main variant, based on the main variant of the
9212 inner type. Use it to build the variant we return. */
9220 }
9222 static tree
9224 {
9247 else
9249 }
9251 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9253 static tree
9255 {
9257 {
9269 }
9270 else
9271 {
9283 }
9286 }
9288 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9290 static tree
9292 {
9294 {
9306 }
9307 else
9308 {
9320 }
9323 }
9326 /* Create an atomic variant node for TYPE. This routine is called
9327 during initialization of data types to create the 5 basic atomic
9328 types. The generic build_variant_type function requires these to
9329 already be set up in order to function properly, so cannot be
9330 called from there. If ALIGN is non-zero, then ensure alignment is
9331 overridden to this value. */
9333 static tree
9335 {
9336 tree t;
9338 /* Make sure its not already registered. */
9349 }
9351 /* Information about the _FloatN and _FloatNx types. This must be in
9352 the same order as the corresponding TI_* enum values. */
9354 {
9362 };
9365 /* Create nodes for all integer types (and error_mark_node) using the sizes
9366 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9368 void
9370 {
9378 /* Define both `signed char' and `unsigned char'. */
9384 /* Define `char', which is like either `signed char' or `unsigned char'
9385 but not the same as either. */
9386 char_type_node
9387 = (signed_char
9402 {
9407 {
9410 }
9411 }
9413 /* Define a boolean type. This type only represents boolean values but
9414 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9420 /* Define what type to use for size_t. */
9429 else
9430 {
9436 {
9443 {
9445 }
9446 }
9449 }
9451 /* Define what type to use for ptrdiff_t. */
9460 else
9461 {
9465 {
9473 }
9476 }
9478 /* Fill in the rest of the sized types. Reuse existing type nodes
9479 when possible. */
9492 /* Don't call build_qualified type for atomics. That routine does
9493 special processing for atomics, and until they are initialized
9494 it's better not to make that call.
9496 Check to see if there is a target override for atomic types. */
9513 /* Define these next since types below may used them. */
9531 /* We are not going to have real types in C with less than byte alignment,
9532 so we might as well not have any types that claim to have it. */
9545 const_ptr_type_node
9565 {
9568 scalar_float_mode mode;
9572 /* Work around the rs6000 KFmode having precision 113 not
9573 128. */
9585 }
9587 #ifdef HAVE_BFmode
9591 {
9596 }
9597 #endif
9604 /* Fixed size integer types. */
9611 /* Decimal float types. */
9613 {
9628 }
9637 {
9641 }
9643 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9644 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9645 sat_ ## KIND ## _type_node = \
9646 make_sat_signed_ ## KIND ## _type (SIZE); \
9647 sat_unsigned_ ## KIND ## _type_node = \
9648 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9649 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9650 unsigned_ ## KIND ## _type_node = \
9651 make_unsigned_ ## KIND ## _type (SIZE);
9653 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9654 sat_ ## WIDTH ## KIND ## _type_node = \
9655 make_sat_signed_ ## KIND ## _type (SIZE); \
9656 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9657 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9658 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9659 unsigned_ ## WIDTH ## KIND ## _type_node = \
9660 make_unsigned_ ## KIND ## _type (SIZE);
9662 /* Make fixed-point type nodes based on four different widths. */
9663 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9664 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9665 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9666 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9667 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9669 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9670 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9671 NAME ## _type_node = \
9672 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9673 u ## NAME ## _type_node = \
9674 make_or_reuse_unsigned_ ## KIND ## _type \
9675 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9676 sat_ ## NAME ## _type_node = \
9677 make_or_reuse_sat_signed_ ## KIND ## _type \
9678 (GET_MODE_BITSIZE (MODE ## mode)); \
9679 sat_u ## NAME ## _type_node = \
9680 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9681 (GET_MODE_BITSIZE (U ## MODE ## mode));
9683 /* Fixed-point type and mode nodes. */
9696 {
9699 /* Many back-ends define record types without setting TYPE_NAME.
9700 If we copied the record type here, we'd keep the original
9701 record type without a name. This breaks name mangling. So,
9702 don't copy record types and let c_common_nodes_and_builtins()
9703 declare the type to be __builtin_va_list. */
9708 }
9710 /* SCEV analyzer global shared trees. */
9715 }
9717 /* Modify DECL for given flags.
9718 TM_PURE attribute is set only on types, so the function will modify
9719 DECL's type when ECF_TM_PURE is used. */
9721 void
9723 {
9757 /* Looping const or pure is implied by noreturn.
9758 There is currently no way to declare looping const or looping pure alone. */
9761 }
9764 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9766 static void
9769 {
9770 tree decl;
9777 }
9779 /* Call this function after instantiating all builtins that the language
9780 front end cares about. This will build the rest of the builtins
9781 and internal functions that are relied upon by the tree optimizers and
9782 the middle-end. */
9784 void
9786 {
9791 {
9793 ptr_type_node,
9794 ptr_type_node,
9795 integer_type_node,
9796 NULL_TREE);
9798 BUILT_IN_CLEAR_PADDING,
9801 }
9807 {
9811 BUILT_IN_UNREACHABLE,
9817 BUILT_IN_UNREACHABLE_TRAP,
9829 }
9833 {
9844 }
9847 {
9850 NULL_TREE);
9853 }
9856 {
9862 }
9864 /* If we're checking the stack, `alloca' can throw. */
9865 const int alloca_flags
9869 {
9874 }
9879 BUILT_IN_ALLOCA_WITH_ALIGN,
9881 alloca_flags);
9886 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9888 alloca_flags);
9894 BUILT_IN_INIT_TRAMPOLINE,
9897 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9901 BUILT_IN_INIT_DESCRIPTOR,
9906 BUILT_IN_ADJUST_TRAMPOLINE,
9910 BUILT_IN_ADJUST_DESCRIPTOR,
9918 BUILT_IN_CLEAR_CACHE,
9920 ECF_NOTHROW);
9923 BUILT_IN_NONLOCAL_GOTO,
9933 NULL_TREE);
9935 BUILT_IN_NESTED_PTR_CREATED,
9939 NULL_TREE);
9941 BUILT_IN_NESTED_PTR_DELETED,
9947 BUILT_IN_SETJMP_SETUP,
9952 BUILT_IN_SETJMP_RECEIVER,
9961 BUILT_IN_STACK_RESTORE,
9966 NULL_TREE);
9979 /* If there's a possibility that we might use the ARM EABI, build the
9980 alternate __cxa_end_cleanup node used to resume from C++. */
9982 {
9985 BUILT_IN_CXA_END_CLEANUP,
9988 }
9992 BUILT_IN_UNWIND_RESUME,
9999 {
10001 NULL_TREE);
10003 BUILT_IN_RETURN_ADDRESS,
10005 ECF_NOTHROW);
10006 }
10010 {
10015 BUILT_IN_PROFILE_FUNC_ENTER,
10019 BUILT_IN_PROFILE_FUNC_EXIT,
10021 }
10023 /* The exception object and filter values from the runtime. The argument
10024 must be zero before exception lowering, i.e. from the front end. After
10025 exception lowering, it will be the region number for the exception
10026 landing pad. These functions are PURE instead of CONST to prevent
10027 them from being hoisted past the exception edge that will initialize
10028 its value in the landing pad. */
10032 /* Only use TM_PURE if we have TM language support. */
10045 NULL_TREE);
10047 BUILT_IN_EH_COPY_VALUES,
10050 /* Complex multiplication and division. These are handled as builtins
10051 rather than optabs because emit_library_call_value doesn't support
10052 complex. Further, we can do slightly better with folding these
10053 beasties if the real and complex parts of the arguments are separate. */
10054 {
10058 {
10085 /* For -ftrapping-math these should throw from a former
10086 -fnon-call-exception stmt. */
10088 NULL);
10094 NULL);
10098 }
10099 }
10102 }
10104 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10105 better way.
10107 If we requested a pointer to a vector, build up the pointers that
10108 we stripped off while looking for the inner type. Similarly for
10109 return values from functions.
10111 The argument TYPE is the top of the chain, and BOTTOM is the
10112 new type which we will point to. */
10114 tree
10116 {
10120 {
10124 }
10126 {
10130 }
10132 {
10135 }
10137 {
10141 }
10143 {
10145 /* The build_method_type_directly() routine prepends 'this' to argument list,
10146 so we must compensate by getting rid of it. */
10147 outer
10148 = build_method_type_directly
10150 inner,
10152 }
10154 {
10157 }
10158 else
10163 }
10165 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10166 the inner type. */
10167 tree
10169 {
10170 poly_int64 nunits;
10174 {
10186 /* Check that there are no leftover bits. */
10194 }
10197 }
10199 /* Similarly, but takes the inner type and number of units, which must be
10200 a power of two. */
10202 tree
10204 {
10206 }
10208 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10210 tree
10212 {
10217 {
10220 }
10221 else
10227 }
10229 /* Build a vector type that holds one boolean result for each element of
10230 vector type VECTYPE. The public interface for this operation is
10231 truth_type_for. */
10233 static tree
10235 {
10239 machine_mode mask_mode;
10249 }
10251 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10252 set. */
10254 tree
10256 {
10258 tree cand;
10259 /* We always build the non-opaque variant before the opaque one,
10260 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10266 /* Othewise build a variant type and make sure to queue it after
10267 the non-opaque type. */
10275 }
10277 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10279 static poly_wide_int
10281 {
10282 /* First handle elements that are directly encoded. */
10287 /* Identify the pattern that contains element I and work out the index of
10288 the last encoded element for that pattern. */
10294 /* If there are no steps, the final encoded value is the right one. */
10298 /* Otherwise work out the value from the last two encoded elements. */
10303 }
10305 /* Return the value of element I of VECTOR_CST T. */
10307 tree
10309 {
10310 /* First handle elements that are directly encoded. */
10315 /* If there are no steps, the final encoded value is the right one. */
10317 {
10318 /* Identify the pattern that contains element I and work out the index of
10319 the last encoded element for that pattern. */
10324 }
10326 /* Otherwise work out the value from the last two encoded elements. */
10329 }
10331 /* Given an initializer INIT, return TRUE if INIT is zero or some
10332 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10333 null, set *NONZERO if and only if INIT is known not to be all
10334 zeros. The combination of return value of false and *NONZERO
10335 false implies that INIT may but need not be all zeros. Other
10336 combinations indicate definitive answers. */
10338 bool
10340 {
10345 /* Conservatively clear NONZERO and set it only if INIT is definitely
10346 not all zero. */
10354 {
10363 /* ??? Note that this is not correct for C4X float formats. There,
10364 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10365 negative exponent. */
10400 {
10405 tree elt;
10412 }
10415 {
10430 }
10431 /* Fall through. */
10434 {
10442 /* We need to loop through all elements to handle cases like
10443 "\0" and "\0foobar". */
10446 {
10449 }
10452 }
10456 }
10457 }
10459 /* Return true if EXPR is an initializer expression in which every element
10460 is a constant that is numerically equal to 0 or 1. The elements do not
10461 need to be equal to each other. */
10463 bool
10465 {
10469 {
10477 {
10484 {
10488 }
10491 }
10495 }
10496 }
10498 /* Check if vector VEC consists of all the equal elements and
10499 that the number of elements corresponds to the type of VEC.
10500 The function returns first element of the vector
10501 or NULL_TREE if the vector is not uniform. */
10502 tree
10504 {
10517 {
10521 }
10525 {
10529 {
10531 {
10534 }
10537 }
10544 }
10547 }
10549 /* If the argument is INTEGER_CST, return it. If the argument is vector
10550 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10551 return NULL_TREE.
10552 Look through location wrappers. */
10554 tree
10556 {
10563 {
10567 }
10570 }
10572 /* Checks to see if T is a constant or a constant vector and if each element E
10573 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10575 tree
10577 {
10587 tree cst;
10591 tree_vector_builder builder;
10594 else
10595 {
10601 }
10605 do
10606 {
10621 }
10625 }
10627 /* If VECTOR_CST T has a single nonzero element, return the index of that
10628 element, otherwise return -1. */
10630 int
10632 {
10638 {
10641 }
10642 else
10647 {
10650 {
10654 }
10655 }
10657 }
10659 /* Build an empty statement at location LOC. */
10661 tree
10663 {
10667 }
10670 /* Build an OMP clause with code CODE. LOC is the location of the
10671 clause. */
10673 tree
10675 {
10676 tree t;
10691 }
10693 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10694 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10695 Except for the CODE and operand count field, other storage for the
10696 object is initialized to zeros. */
10698 tree
10700 {
10701 tree t;
10713 /* Can't use TREE_OPERAND to store the length because if checking is
10714 enabled, it will try to check the length before we store it. :-P */
10718 }
10720 /* Helper function for build_call_* functions; build a CALL_EXPR with
10721 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10722 the argument slots. */
10724 static tree
10726 {
10727 tree t;
10735 }
10737 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10738 FN and a null static chain slot. NARGS is the number of call arguments
10739 which are specified as "..." arguments. */
10741 tree
10743 {
10744 tree ret;
10750 }
10752 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10753 FN and a null static chain slot. NARGS is the number of call arguments
10754 which are specified as a va_list ARGS. */
10756 tree
10758 {
10759 tree t;
10767 }
10769 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10770 FN and a null static chain slot. NARGS is the number of call arguments
10771 which are specified as a tree array ARGS. */
10773 tree
10776 {
10777 tree t;
10786 }
10788 /* Like build_call_array, but takes a vec. */
10790 tree
10792 {
10801 }
10803 /* Conveniently construct a function call expression. FNDECL names the
10804 function to be called and N arguments are passed in the array
10805 ARGARRAY. */
10807 tree
10809 {
10814 }
10816 /* Conveniently construct a function call expression. FNDECL names the
10817 function to be called and the arguments are passed in the vector
10818 VEC. */
10820 tree
10822 {
10825 }
10828 /* Conveniently construct a function call expression. FNDECL names the
10829 function to be called, N is the number of arguments, and the "..."
10830 parameters are the argument expressions. */
10832 tree
10834 {
10844 }
10846 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10847 varargs macros aren't supported by all bootstrap compilers. */
10849 tree
10851 {
10861 }
10863 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10864 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10865 It will get gimplified later into an ordinary internal function. */
10867 tree
10870 {
10878 }
10880 /* Build internal call expression. This is just like CALL_EXPR, except
10881 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10882 internal function. */
10884 tree
10887 {
10897 }
10899 /* Return a function call to FN, if the target is guaranteed to support it,
10900 or null otherwise.
10902 N is the number of arguments, passed in the "...", and TYPE is the
10903 type of the return value. */
10905 tree
10908 {
10918 {
10921 {
10924 OPTIMIZE_FOR_BOTH))
10926 }
10928 }
10929 else
10930 {
10935 }
10936 }
10938 /* Return a function call to the appropriate builtin alloca variant.
10940 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10941 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10942 bound for SIZE in case it is not a fixed value. */
10944 tree
10946 {
10948 {
10950 return
10952 }
10954 {
10957 }
10958 else
10959 {
10962 }
10963 }
10965 /* The built-in decl to use to mark code points believed to be unreachable.
10966 Typically __builtin_unreachable, but __builtin_trap if
10967 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10968 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10969 appropriate ubsan function. When building a call directly, use
10970 {gimple_},build_builtin_unreachable instead. */
10972 tree
10974 {
10981 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10982 in the sanopt pass. */
10985 }
10987 /* Build a call to __builtin_unreachable, possibly rewritten by
10988 -fsanitize=unreachable. Use this rather than the above when practical. */
10990 tree
10992 {
10996 }
10998 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10999 if SIZE == -1) and return a tree node representing char* pointer to
11000 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11001 the STRING_CST value is the LEN bytes at STR (the representation
11002 of the string, which may be wide). Otherwise it's all zeros. */
11004 tree
11008 {
11010 /* Set the maximum valid index based on the string length or SIZE. */
11011 unsigned HOST_WIDE_INT maxidx
11027 }
11031 /* Return true if T (assumed to be a DECL) must be assigned a memory
11032 location. */
11034 bool
11036 {
11042 }
11044 /* Return value of a constant X and sign-extend it. */
11046 HOST_WIDE_INT
11048 {
11052 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11056 {
11060 else
11062 }
11065 }
11067 /* If TYPE is an integral or pointer type, return an integer type with
11068 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11069 if TYPE is already an integer type of signedness UNSIGNEDP.
11070 If TYPE is a floating-point type, return an integer type with the same
11071 bitsize and with the signedness given by UNSIGNEDP; this is useful
11072 when doing bit-level operations on a floating-point value. */
11074 tree
11076 {
11081 {
11088 machine_mode new_mode;
11093 }
11096 {
11104 }
11113 else
11119 }
11121 /* If TYPE is an integral or pointer type, return an integer type with
11122 the same precision which is unsigned, or itself if TYPE is already an
11123 unsigned integer type. If TYPE is a floating-point type, return an
11124 unsigned integer type with the same bitsize as TYPE. */
11126 tree
11128 {
11130 }
11132 /* If TYPE is an integral or pointer type, return an integer type with
11133 the same precision which is signed, or itself if TYPE is already a
11134 signed integer type. If TYPE is a floating-point type, return a
11135 signed integer type with the same bitsize as TYPE. */
11137 tree
11139 {
11141 }
11143 /* - For VECTOR_TYPEs:
11144 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11145 - The number of elements must match (known_eq).
11146 - targetm.vectorize.get_mask_mode exists, and exactly
11147 the same mode as the truth type.
11148 - Otherwise, the truth type must be a BOOLEAN_TYPE
11149 or useless_type_conversion_p to BOOLEAN_TYPE. */
11150 bool
11152 {
11155 machine_mode tmask_mode;
11158 {
11167 }
11170 }
11172 /* If TYPE is a vector type, return a signed integer vector type with the
11173 same width and number of subparts. Otherwise return boolean_type_node. */
11175 tree
11177 {
11179 {
11183 }
11184 else
11186 }
11188 /* Returns the largest value obtainable by casting something in INNER type to
11189 OUTER type. */
11191 tree
11193 {
11199 /* Compute a unique number for every combination. */
11204 /* Determine the exponent to use. */
11206 {
11209 /* oprec <= iprec, outer: signed, inner: don't care. */
11214 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11218 /* oprec > iprec, outer: signed, inner: signed. */
11222 /* oprec > iprec, outer: signed, inner: unsigned. */
11226 /* oprec > iprec, outer: unsigned, inner: signed. */
11230 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11235 }
11239 }
11241 /* Returns the smallest value obtainable by casting something in INNER type to
11242 OUTER type. */
11244 tree
11246 {
11250 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11251 and obtain 0. */
11253 /* If we are widening something of an unsigned type, OUTER type
11254 contains all values of INNER type. In particular, both INNER
11255 and OUTER types have zero in common. */
11258 else
11259 {
11260 /* If we are widening a signed type to another signed type, we
11261 want to obtain -2^^(iprec-1). If we are keeping the
11262 precision or narrowing to a signed type, we want to obtain
11263 -2^(oprec-1). */
11268 }
11269 }
11271 /* Return true if two operands that are suitable for PHI nodes are
11272 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11273 SSA_NAME or invariant. Note that this is strictly an optimization.
11274 That is, callers of this function can directly call operand_equal_p
11275 and get the same result, only slower. */
11277 bool
11279 {
11285 }
11287 /* Returns number of zeros at the end of binary representation of X. */
11289 tree
11291 {
11293 }
11296 #define WALK_SUBTREE(NODE) \
11297 do \
11298 { \
11299 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11300 if (result) \
11301 return result; \
11302 } \
11303 while (0)
11305 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11306 be walked whenever a type is seen in the tree. Rest of operands and return
11307 value are as for walk_tree. */
11309 static tree
11312 {
11316 {
11320 /* We have to worry about mutually recursive pointers. These can't
11321 be written in C. They can in Ada. It's pathological, but
11322 there's an ACATS test (c38102a) that checks it. Deal with this
11323 by checking if we're pointing to another pointer, that one
11324 points to another pointer, that one does too, and we have no htab.
11325 If so, get a hash table. We check three levels deep to avoid
11326 the cost of the hash table if we don't need one. */
11331 {
11338 }
11340 /* fall through */
11349 /* Fall through. */
11353 {
11354 tree arg;
11356 /* We never want to walk into default arguments. */
11359 }
11363 /* Don't follow this nodes's type if a pointer for fear that
11364 we'll have infinite recursion. If we have a PSET, then we
11365 need not fear. */
11380 }
11383 }
11385 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11386 called with the DATA and the address of each sub-tree. If FUNC returns a
11387 non-NULL value, the traversal is stopped, and the value returned by FUNC
11388 is returned. If PSET is non-NULL it is used to record the nodes visited,
11389 and to avoid visiting a node more than once. */
11391 tree
11394 {
11395 #define WALK_SUBTREE_TAIL(NODE) \
11396 do \
11397 { \
11398 tp = & (NODE); \
11399 goto tail_recurse; \
11400 } \
11401 while (0)
11403 tail_recurse:
11404 /* Skip empty subtrees. */
11408 /* Don't walk the same tree twice, if the user has requested
11409 that we avoid doing so. */
11413 /* Call the function. */
11417 /* If we found something, return it. */
11424 /* Even if we didn't, FUNC may have decided that there was nothing
11425 interesting below this point in the tree. */
11427 {
11428 /* But we still need to check our siblings. */
11433 else
11435 }
11438 {
11442 }
11445 {
11457 /* None of these have subtrees other than those already walked
11458 above. */
11466 {
11472 /* Walk all elements but the last. */
11476 /* Now walk the last one as a tail call. */
11478 }
11481 {
11485 /* Walk all elements but the last. */
11488 /* Now walk the last one as a tail call. */
11490 }
11497 {
11502 idx++)
11504 }
11511 {
11512 tree decl;
11514 {
11515 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11516 into declarations that are just mentioned, rather than
11517 declared; they don't really belong to this part of the tree.
11518 And, we can see cycles: the initializer for a declaration
11519 can refer to the declaration itself. */
11523 }
11525 }
11528 {
11529 tree_stmt_iterator i;
11532 }
11536 {
11541 }
11544 {
11547 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11548 But, we only want to walk once. */
11553 }
11556 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11557 defining. We only want to walk into these fields of a type in this
11558 case and not in the general case of a mere reference to the type.
11560 The criterion is as follows: if the field can be an expression, it
11561 must be walked only here. This should be in keeping with the fields
11562 that are directly gimplified in gimplify_type_sizes in order for the
11563 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11564 variable-sized types.
11566 Note that DECLs get walked as part of processing the BIND_EXPR. */
11568 {
11569 /* Call the function for the decl so e.g. copy_tree_body_r can
11570 replace it with the remapped one. */
11579 /* Call the function for the type. See if it returns anything or
11580 doesn't want us to continue. If we are to continue, walk both
11581 the normal fields and those for the declaration case. */
11588 /* But do not walk a pointed-to type since it may itself need to
11589 be walked in the declaration case if it isn't anonymous. */
11591 {
11595 }
11597 /* If this is a record type, also walk the fields. */
11599 {
11600 tree field;
11604 {
11605 /* We'd like to look at the type of the field, but we can
11606 easily get infinite recursion. So assume it's pointed
11607 to elsewhere in the tree. Also, ignore things that
11608 aren't fields. */
11617 }
11618 }
11620 /* Same for scalar types. */
11626 {
11629 }
11633 }
11634 /* FALLTHRU */
11638 {
11641 /* Walk over all the sub-trees of this operand. */
11644 /* Go through the subtrees. We need to do this in forward order so
11645 that the scope of a FOR_EXPR is handled properly. */
11647 {
11651 }
11652 }
11653 /* If this is a type, walk the needed fields in the type. */
11657 }
11659 /* We didn't find what we were looking for. */
11662 #undef WALK_SUBTREE_TAIL
11663 }
11664 #undef WALK_SUBTREE
11666 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11668 tree
11670 walk_tree_lh lh)
11671 {
11672 tree result;
11677 }
11680 tree
11682 {
11689 }
11691 void
11693 {
11697 {
11699 }
11700 else
11702 }
11704 /* Create a nameless artificial label and put it in the current
11705 function context. The label has a location of LOC. Returns the
11706 newly created label. */
11708 tree
11710 {
11718 }
11720 /* Given a tree, try to return a useful variable name that we can use
11721 to prefix a temporary that is being assigned the value of the tree.
11722 I.E. given <temp> = &A, return A. */
11726 {
11727 tree stripped_decl;
11734 {
11739 }
11740 else
11741 {
11743 {
11748 }
11749 }
11750 }
11752 /* Return true if TYPE has a variable argument list. */
11754 bool
11756 {
11757 function_args_iterator args_iter;
11767 {
11769 }
11772 }
11774 /* Return true if TYPE has a prototype. */
11776 bool
11778 {
11779 tree t;
11788 }
11790 /* If BLOCK is inlined from an __attribute__((__artificial__))
11791 routine, return pointer to location from where it has been
11792 called. */
11793 location_t *
11795 {
11800 {
11803 {
11804 /* If AO is an artificial inline, point RET to the
11805 call site locus at which it has been inlined and continue
11806 the loop, in case AO's caller is also an artificial
11807 inline. */
11811 else
11813 }
11818 }
11820 }
11823 /* If EXP is inlined from an __attribute__((__artificial__))
11824 function, return the location of the original call expression. */
11826 location_t
11828 {
11833 else
11835 }
11837 /* Return the location into which EXP has been inlined. Analogous
11838 to tree_nonartificial_location() above but not limited to artificial
11839 functions declared inline. If SYSTEM_HEADER is true, return
11840 the macro expansion point of the location if it's in a system header */
11842 location_t
11844 {
11851 {
11859 }
11862 {
11865 /* Only consider macro expansion when the block traversal failed
11866 to find a location. Otherwise it's not relevant. */
11868 }
11871 }
11873 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11874 nodes. */
11876 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11878 hashval_t
11880 {
11887 else
11889 }
11891 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11892 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11893 same. */
11895 bool
11897 {
11910 else
11912 }
11914 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11916 tree
11919 {
11920 tree t;
11922 /* Use the cache of optimization nodes. */
11930 {
11931 /* Insert this one into the hash table. */
11935 /* Make a new node for next time round. */
11937 }
11940 }
11942 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11944 tree
11947 {
11948 tree t;
11950 /* Use the cache of optimization nodes. */
11958 {
11959 /* Insert this one into the hash table. */
11963 /* Make a new node for next time round. */
11965 }
11968 }
11970 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11971 so that they aren't saved during PCH writing. */
11973 void
11975 {
11980 }
11982 /* Determine the "ultimate origin" of a block. */
11984 tree
11986 {
11991 else
11992 {
11997 }
11998 }
12000 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12001 no instruction. */
12003 bool
12005 {
12006 /* Do not strip casts into or out of differing address spaces. */
12009 {
12014 }
12017 {
12018 /* We already know that outer_type is not a pointer with
12019 a non-generic address space. */
12021 }
12023 /* Use precision rather then machine mode when we can, which gives
12024 the correct answer even for submode (bit-field) types. */
12033 /* Otherwise fall back on comparing machine modes (e.g. for
12034 aggregate types, floats). */
12036 }
12038 /* Return true iff conversion in EXP generates no instruction. Mark
12039 it inline so that we fully inline into the stripping functions even
12040 though we have two uses of this function. */
12044 {
12059 }
12061 /* Return true iff conversion in EXP generates no instruction. Don't
12062 consider conversions changing the signedness. */
12064 static bool
12066 {
12077 }
12079 /* Strip conversions from EXP according to tree_nop_conversion and
12080 return the resulting expression. */
12082 tree
12084 {
12088 }
12090 /* Strip conversions from EXP according to tree_sign_nop_conversion
12091 and return the resulting expression. */
12093 tree
12095 {
12099 }
12101 /* Avoid any floating point extensions from EXP. */
12102 tree
12104 {
12107 /* For floating point constant look up the narrowest type that can hold
12108 it properly and handle it like (type)(narrowest_type)constant.
12109 This way we can optimize for instance a=a*2.0 where "a" is float
12110 but 2.0 is double constant. */
12112 {
12113 REAL_VALUE_TYPE orig;
12126 }
12145 }
12147 /* Strip out all handled components that produce invariant
12148 offsets. */
12150 const_tree
12152 {
12154 {
12156 {
12171 }
12173 }
12176 }
12178 /* Strip handled components with zero offset from OP. */
12180 tree
12182 {
12188 }
12192 /* Return the GCC personality function decl. */
12194 tree
12196 {
12200 }
12202 /* TARGET is a call target of GIMPLE call statement
12203 (obtained by gimple_call_fn). Return true if it is
12204 OBJ_TYPE_REF representing an virtual call of C++ method.
12205 (As opposed to OBJ_TYPE_REF representing objc calls
12206 through a cast where middle-end devirtualization machinery
12207 can't apply.) FOR_DUMP_P is true when being called from
12208 the dump routines. */
12210 bool
12212 {
12221 /* If we do not have BINFO associated, it means that type was built
12222 without devirtualization enabled. Do not consider this a virtual
12223 call. */
12227 }
12229 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12231 static tree
12233 {
12244 }
12246 /* Try to find a base info of BINFO that would have its field decl at offset
12247 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12248 found, return, otherwise return NULL_TREE. */
12250 tree
12252 {
12256 {
12258 tree fld;
12267 {
12275 }
12279 /* Offset 0 indicates the primary base, whose vtable contents are
12280 represented in the binfo for the derived class. */
12282 {
12284 /* Offsets in BINFO are in bytes relative to the whole structure
12285 while POS is in bits relative to the containing field. */
12292 {
12295 }
12298 else
12300 binfo_offset);
12301 }
12305 }
12306 }
12308 /* PR 84195: Replace control characters in "unescaped" with their
12309 escaped equivalents. Allow newlines if -fmessage-length has
12310 been set to a non-zero value. This is done here, rather than
12311 where the attribute is recorded as the message length can
12312 change between these two locations. */
12314 void
12316 {
12334 {
12338 {
12342 }
12345 {
12347 {
12348 /* We only allocate space for a new string if we
12349 actually encounter a control character that
12350 needs replacing. */
12354 }
12359 {
12368 }
12369 }
12372 }
12375 {
12379 }
12380 }
12382 /* Warn about a use of an identifier which was marked deprecated. Returns
12383 whether a warning was given. */
12385 bool
12387 {
12388 escaped_string msg;
12394 {
12398 {
12404 {
12407 }
12408 }
12409 }
12419 {
12420 auto_diagnostic_group d;
12424 else
12429 }
12431 {
12436 {
12442 }
12444 auto_diagnostic_group d;
12446 {
12450 else
12453 }
12454 else
12455 {
12459 else
12462 }
12466 }
12469 }
12471 /* Error out with an identifier which was marked 'unavailable'. */
12472 void
12474 {
12475 escaped_string msg;
12481 {
12485 {
12490 }
12491 }
12500 {
12501 auto_diagnostic_group d;
12504 else
12507 }
12509 {
12514 {
12520 }
12522 auto_diagnostic_group d;
12524 {
12527 else
12529 }
12530 else
12531 {
12534 else
12536 }
12540 }
12541 }
12543 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12544 somewhere in it. */
12546 bool
12548 {
12550 {
12555 }
12558 }
12560 /* Try to determine whether a TRY_CATCH expression can fall through.
12561 This is a subroutine of block_may_fallthru. */
12563 static bool
12565 {
12566 tree_stmt_iterator i;
12568 /* If the TRY block can fall through, the whole TRY_CATCH can
12569 fall through. */
12575 {
12577 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12578 catch expression and a body. The whole TRY_CATCH may fall
12579 through iff any of the catch bodies falls through. */
12581 {
12584 }
12588 /* The exception filter expression only matters if there is an
12589 exception. If the exception does not match EH_FILTER_TYPES,
12590 we will execute EH_FILTER_FAILURE, and we will fall through
12591 if that falls through. If the exception does match
12592 EH_FILTER_TYPES, the stack unwinder will continue up the
12593 stack, so we will not fall through. We don't know whether we
12594 will throw an exception which matches EH_FILTER_TYPES or not,
12595 so we just ignore EH_FILTER_TYPES and assume that we might
12596 throw an exception which doesn't match. */
12600 /* This case represents statements to be executed when an
12601 exception occurs. Those statements are implicitly followed
12602 by a RESX statement to resume execution after the exception.
12603 So in this case the TRY_CATCH never falls through. */
12605 }
12606 }
12608 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12609 need not be 100% accurate; simply be conservative and return true if we
12610 don't know. This is used only to avoid stupidly generating extra code.
12611 If we're wrong, we'll just delete the extra code later. */
12613 bool
12615 {
12616 /* This CONST_CAST is okay because expr_last returns its argument
12617 unmodified and we assign it to a const_tree. */
12621 {
12624 /* Easy cases. If the last statement of the block implies
12625 control transfer, then we can't fall through. */
12629 /* If there is a default: label or case labels cover all possible
12630 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12631 to some case label in all cases and all we care is whether the
12632 SWITCH_BODY falls through. */
12649 /* The finally clause is always executed after the try clause,
12650 so if it does not fall through, then the try-finally will not
12651 fall through. Otherwise, if the try clause does not fall
12652 through, then when the finally clause falls through it will
12653 resume execution wherever the try clause was going. So the
12654 whole try-finally will only fall through if both the try
12655 clause and the finally clause fall through. */
12665 else
12667 /* FALLTHRU */
12670 /* Functions that do not return do not fall through. */
12684 }
12685 }
12687 /* True if we are using EH to handle cleanups. */
12690 /* This routine is called from front ends to indicate eh should be used for
12691 cleanups. */
12692 void
12694 {
12696 }
12698 /* Query whether EH is used for cleanups. */
12699 bool
12701 {
12703 }
12705 /* Wrapper for tree_code_name to ensure that tree code is valid */
12708 {
12711 /* The tree_code enum promotes to signed, but we could be getting
12712 invalid values, so force an unsigned comparison. */
12714 {
12718 }
12721 }
12723 /* Drops the TREE_OVERFLOW flag from T. */
12725 tree
12727 {
12730 /* For tree codes with a sharing machinery re-build the result. */
12734 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12735 and canonicalize the result. */
12737 {
12738 tree_vector_builder builder;
12742 {
12747 }
12749 }
12751 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12752 and drop the flag. */
12756 /* For constants that contain nested constants, drop the flag
12757 from those as well. */
12759 {
12764 }
12767 }
12769 /* Given a memory reference expression T, return its base address.
12770 The base address of a memory reference expression is the main
12771 object being referenced. For instance, the base address for
12772 'array[i].fld[j]' is 'array'. You can think of this as stripping
12773 away the offset part from a memory address.
12775 This function calls handled_component_p to strip away all the inner
12776 parts of the memory reference until it reaches the base object. */
12778 tree
12780 {
12792 }
12794 /* Return a tree of sizetype representing the size, in bytes, of the element
12795 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12797 tree
12799 {
12804 /* If a size was specified in the ARRAY_REF, it's the size measured
12805 in alignment units of the element type. So multiply by that value. */
12807 {
12808 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12809 sizetype from another type of the same width and signedness. */
12814 }
12816 /* Otherwise, take the size from that of the element type. Substitute
12817 any PLACEHOLDER_EXPR that we have. */
12818 else
12820 }
12822 /* Return a tree representing the lower bound of the array mentioned in
12823 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12825 tree
12827 {
12830 /* If a lower bound is specified in EXP, use it. */
12834 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12835 substituting for a PLACEHOLDER_EXPR as needed. */
12839 /* Otherwise, return a zero of the appropriate type. */
12843 }
12845 /* Return a tree representing the upper bound of the array mentioned in
12846 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12848 tree
12850 {
12853 /* If there is a domain type and it has an upper bound, use it, substituting
12854 for a PLACEHOLDER_EXPR as needed. */
12858 /* Otherwise fail. */
12860 }
12862 /* Returns true if REF is an array reference, a component reference,
12863 or a memory reference to an array whose actual size might be larger
12864 than its upper bound implies, there are multiple cases:
12865 A. a ref to a flexible array member at the end of a structure;
12866 B. a ref to an array with a different type against the original decl;
12867 for example:
12869 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12870 (*((char(*)[16])&a[0]))[i+8]
12872 C. a ref to an array that was passed as a parameter;
12873 for example:
12875 int test (uint8_t *p, uint32_t t[1][1], int n) {
12876 for (int i = 0; i < 4; i++, p++)
12877 t[i][0] = ...;
12879 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12880 */
12882 bool
12884 {
12885 /* The TYPE for this array referece. */
12887 /* The FIELD_DECL for the array field in the containing structure. */
12889 /* Whether this array is the trailing array of a structure. */
12896 {
12899 }
12902 {
12905 }
12907 {
12913 {
12915 {
12922 }
12923 else
12925 }
12926 else
12928 }
12929 else
12937 {
12938 /* If the reference chain contains a component reference to a
12939 non-union type and there follows another field the reference
12940 is not at the end of a structure. */
12942 {
12944 {
12950 }
12951 }
12952 /* If we have a multi-dimensional array we do not consider
12953 a non-innermost dimension as flex array if the whole
12954 multi-dimensional array is at struct end.
12955 Same for an array of aggregates with a trailing array
12956 member. */
12960 ;
12961 /* If we view an underlying object as sth else then what we
12962 gathered up to now is what we have to rely on. */
12965 else
12969 }
12974 /* The array now is at struct end. Treat flexible array member as
12975 always subject to extend, even into just padding constrained by
12976 an underlying decl. */
12980 {
12983 }
12985 /* If the reference is based on a declared entity, the size of the array
12986 is constrained by its given domain. (Do not trust commons PR/69368). */
12990 && !(flag_unconstrained_commons
12994 {
12995 /* If the object itself is the array it is not at struct end. */
12999 /* Check whether the array domain covers all of the available
13000 padding. */
13001 poly_int64 offset;
13005 {
13006 *is_trailing_array
13009 }
13011 {
13012 *is_trailing_array
13015 }
13017 /* If at least one extra element fits it is a flexarray. */
13023 {
13024 *is_trailing_array
13027 }
13030 }
13034 }
13037 /* Return a tree representing the offset, in bytes, of the field referenced
13038 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13040 tree
13042 {
13047 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13048 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13049 value. */
13051 {
13052 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13053 sizetype from another type of the same width and signedness. */
13059 }
13061 /* Otherwise, take the offset from that of the field. Substitute
13062 any PLACEHOLDER_EXPR that we have. */
13063 else
13065 }
13067 /* Given the initializer INIT, return the initializer for the field
13068 DECL if it exists, otherwise null. Used to obtain the initializer
13069 for a flexible array member and determine its size. */
13071 static tree
13073 {
13079 {
13084 {
13088 }
13089 }
13092 }
13094 /* Determines the special array member type for the array reference REF. */
13095 special_array_member
13097 {
13103 {
13112 {
13113 /* If array element has zero size, verify if it is a flexible
13114 array member or zero length array. Clear zero_elts if
13115 it has one or more members or is a VLA member. */
13124 }
13126 /* MEMBER is an interior array with more than one element. */
13130 {
13133 else
13135 }
13143 {
13148 /* MEMBER is a trailing array with more than
13149 one elements. */
13154 }
13155 }
13158 }
13160 /* Determines the size of the member referenced by the COMPONENT_REF
13161 REF, using its initializer expression if necessary in order to
13162 determine the size of an initialized flexible array member.
13163 If non-null, set *SAM to the type of special array member.
13164 Returns the size as sizetype (which might be zero for an object
13165 with an uninitialized flexible array member) or null if the size
13166 cannot be determined. */
13168 tree
13170 {
13173 special_array_member sambuf;
13178 /* The object/argument referenced by the COMPONENT_REF and its type. */
13181 /* The referenced member. */
13186 {
13189 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13190 to the type of a class with a virtual base which doesn't
13191 reflect the size of the virtual's members (see pr97595).
13192 If that's the case fail for now and implement something
13193 more robust in the future. */
13197 /* 2-or-more elements arrays are treated as normal arrays by default. */
13204 /* If the trailing array is a not a flexible array member, treat it as
13205 a normal array. */
13213 /* For a reference to a flexible array member of a union
13214 use the size of the union instead of the size of the member. */
13217 }
13219 /* MEMBER is either a bona fide flexible array member, or a zero-elements
13220 array member, or an array of length one treated as such. */
13222 /* If the reference is to a declared object and the member a true
13223 flexible array, try to determine its size from its initializer. */
13227 {
13238 }
13240 /* BASE is the declared object of which MEMBER is either a member
13241 or that is cast to ARGTYPE (e.g., a char buffer used to store
13242 an ARGTYPE object). */
13245 /* Determine the base type of the referenced object. If it's
13246 the same as ARGTYPE and MEMBER has a known size, return it. */
13258 /* MEMBER is a true flexible array member. Compute its size from
13259 the initializer of the BASE object if it has one. */
13262 {
13265 {
13268 {
13269 /* Use the larger of the initializer size and the tail
13270 padding in the enclosing struct. */
13275 }
13278 }
13279 }
13282 {
13284 {
13289 /* The size of a flexible array member of an extern struct
13290 with no initializer cannot be determined (it's defined
13291 in another translation unit and can have an initializer
13292 with an arbitrary number of elements). */
13295 /* Use the size of the base struct or, for interior zero-length
13296 arrays, the size of the enclosing type. */
13298 }
13300 /* Use the size of the BASE object (possibly an array of some
13301 other type such as char used to store the struct). */
13303 else
13305 }
13307 /* If the flexible array member has a known size use the greater
13308 of it and the tail padding in the enclosing struct.
13309 Otherwise, when the size of the flexible array member is unknown
13310 and the referenced object is not a struct, use the size of its
13311 type when known. This detects sizes of array buffers when cast
13312 to struct types with flexible array members. */
13314 {
13319 {
13322 }
13324 }
13326 /* Return "don't know" for an external non-array object since its
13327 flexible array member can be initialized to have any number of
13328 elements. Otherwise, return zero because the flexible array
13329 member has no elements. */
13332 && (!typematch
13335 }
13337 /* Return the machine mode of T. For vectors, returns the mode of the
13338 inner type. The main use case is to feed the result to HONOR_NANS,
13339 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13341 machine_mode
13343 {
13349 }
13351 /* Vector types need to re-check the target flags each time we report
13352 the machine mode. We need to do this because attribute target can
13353 change the result of vector_mode_supported_p and have_regs_of_mode
13354 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13355 change on a per-function basis. */
13356 /* ??? Possibly a better solution is to run through all the types
13357 referenced by a function and re-compute the TYPE_MODE once, rather
13358 than make the TYPE_MODE macro call a function. */
13360 machine_mode
13362 {
13363 machine_mode mode;
13371 {
13372 scalar_int_mode innermode;
13374 /* For integers, try mapping it to a same-sized scalar mode. */
13376 {
13379 scalar_int_mode mode;
13383 }
13386 }
13389 }
13391 /* Return the size in bits of each element of vector type TYPE. */
13393 unsigned int
13395 {
13400 }
13402 /* Calculate the size in bits of each element of vector type TYPE
13403 and return the result as a tree of type bitsizetype. */
13405 tree
13407 {
13412 }
13414 /* Verify that basic properties of T match TV and thus T can be a variant of
13415 TV. TV should be the more specified variant (i.e. the main variant). */
13417 static bool
13419 {
13420 /* Type variant can differ by:
13422 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13423 ENCODE_QUAL_ADDR_SPACE.
13424 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13425 in this case some values may not be set in the variant types
13426 (see TYPE_COMPLETE_P checks).
13427 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13428 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13429 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13430 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13431 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13432 this is necessary to make it possible to merge types form different TUs
13433 - arrays, pointers and references may have TREE_TYPE that is a variant
13434 of TREE_TYPE of their main variants.
13435 - aggregates may have new TYPE_FIELDS list that list variants of
13436 the main variant TYPE_FIELDS.
13437 - vector types may differ by TYPE_VECTOR_OPAQUE
13438 */
13440 /* Convenience macro for matching individual fields. */
13441 #define verify_variant_match(flag) \
13442 do { \
13443 if (flag (tv) != flag (t)) \
13444 { \
13446 debug_tree (tv); \
13447 return false; \
13448 } \
13449 } while (false)
13451 /* tree_base checks. */
13454 /* FIXME: Ada builds non-artificial variants of artificial types. */
13455 #if 0
13458 #endif
13461 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13468 else
13470 /* FIXME: This check trigger during libstdc++ build. */
13471 #if 0
13474 #endif
13476 /* tree_type_common checks. */
13479 {
13487 {
13497 }
13499 }
13505 /* During LTO we merge variant lists from diferent translation units
13506 that may differ BY TYPE_CONTEXT that in turn may point
13507 to TRANSLATION_UNIT_DECL.
13508 Ada also builds variants of types with different TYPE_CONTEXT. */
13509 #if 0
13512 #endif
13518 {
13522 }
13524 /* tree_type_non_common checks. */
13526 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13527 and dangle the pointer from time to time. */
13531 {
13535 }
13542 {
13545 }
13552 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13553 or even type's main variant. This is needed to make bootstrap pass
13554 and the bug seems new in GCC 5.
13555 C++ FE should be updated to make this consistent and we should check
13556 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13557 is a match with main variant.
13559 Also disable the check for Java for now because of parser hack that builds
13560 first an dummy BINFO and then sometimes replace it by real BINFO in some
13561 of the copies. */
13564 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13565 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13566 at LTO time only. */
13568 {
13576 }
13578 /* Check various uses of TYPE_VALUES_RAW. */
13584 /* Permit incomplete variants of complete type. While FEs may complete
13585 all variants, this does not happen for C++ templates in all cases. */
13589 {
13592 /* Fortran builds qualified variants as new records with items of
13593 qualified type. Verify that they looks same. */
13600 /* FIXME: gfc_nonrestricted_type builds all types as variants
13601 with exception of pointer types. It deeply copies the type
13602 which means that we may end up with a variant type
13603 referring non-variant pointer. We may change it to
13604 produce types as variants, too, like
13605 objc_get_protocol_qualified_type does. */
13611 {
13619 }
13620 }
13623 /* For C++ the qualified variant of array type is really an array type
13624 of qualified TREE_TYPE.
13625 objc builds variants of pointer where pointer to type is a variant, too
13626 in objc_get_protocol_qualified_type. */
13632 {
13640 }
13643 {
13651 }
13653 #undef verify_variant_match
13654 }
13657 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13658 the middle-end types_compatible_p function. It needs to avoid
13659 claiming types are different for types that should be treated
13660 the same with respect to TBAA. Canonical types are also used
13661 for IL consistency checks via the useless_type_conversion_p
13662 predicate which does not handle all type kinds itself but falls
13663 back to pointer-comparison of TYPE_CANONICAL for aggregates
13664 for example. */
13666 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13667 type calculation because we need to allow inter-operability between signed
13668 and unsigned variants. */
13670 bool
13672 {
13673 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13674 signed char and unsigned char. Similarly fortran FE builds
13675 C_SIZE_T as signed type, while C defines it unsigned. */
13678 == INTEGER_TYPE
13681 }
13683 /* Return true iff T1 and T2 are structurally identical for what
13684 TBAA is concerned.
13685 This function is used both by lto.cc canonical type merging and by the
13686 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13687 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13688 only for LTO because only in these cases TYPE_CANONICAL equivalence
13689 correspond to one defined by gimple_canonical_types_compatible_p. */
13691 bool
13694 {
13695 /* Type variants should be same as the main variant. When not doing sanity
13696 checking to verify this fact, go to main variants and save some work. */
13698 {
13701 }
13703 /* Check first for the obvious case of pointer identity. */
13707 /* Check that we have two types to compare. */
13711 /* We consider complete types always compatible with incomplete type.
13712 This does not make sense for canonical type calculation and thus we
13713 need to ensure that we are never called on it.
13715 FIXME: For more correctness the function probably should have three modes
13716 1) mode assuming that types are complete mathcing their structure
13717 2) mode allowing incomplete types but producing equivalence classes
13718 and thus ignoring all info from complete types
13719 3) mode allowing incomplete types to match complete but checking
13720 compatibility between complete types.
13722 1 and 2 can be used for canonical type calculation. 3 is the real
13723 definition of type compatibility that can be used i.e. for warnings during
13724 declaration merging. */
13729 /* If the types have been previously registered and found equal
13730 they still are. */
13734 {
13735 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13736 they are always NULL, but they are set to non-NULL for types
13737 constructed by build_pointer_type and variants. In this case the
13738 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13739 all pointers are considered equal. Be sure to not return false
13740 negatives. */
13744 }
13746 /* For types where we do ODR based TBAA the canonical type is always
13747 set correctly, so we know that types are different if their
13748 canonical types does not match. */
13754 /* Can't be the same type if the types don't have the same code. */
13759 /* Qualifiers do not matter for canonical type comparison purposes. */
13761 /* Void types and nullptr types are always the same. */
13766 /* Can't be the same type if they have different mode. */
13770 /* Non-aggregate types can be handled cheaply. */
13778 {
13779 /* Can't be the same type if they have different precision. */
13783 /* In some cases the signed and unsigned types are required to be
13784 inter-operable. */
13789 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13790 interoperable with "signed char". Unless all frontends are revisited
13791 to agree on these types, we must ignore the flag completely. */
13793 /* Fortran standard define C_PTR type that is compatible with every
13794 C pointer. For this reason we need to glob all pointers into one.
13795 Still pointers in different address spaces are not compatible. */
13797 {
13801 }
13803 /* Tail-recurse to components. */
13808 trust_type_canonical);
13811 }
13813 /* Do type-specific comparisons. */
13815 {
13817 /* Array types are the same if the element types are the same and
13818 the number of elements are the same. */
13820 trust_type_canonical)
13825 else
13826 {
13830 /* For an incomplete external array, the type domain can be
13831 NULL_TREE. Check this condition also. */
13836 else
13837 {
13843 /* The minimum/maximum values have to be the same. */
13855 else
13857 }
13858 }
13862 /* Function types are the same if the return type and arguments types
13863 are the same. */
13865 trust_type_canonical))
13872 else
13873 {
13879 {
13882 trust_type_canonical))
13884 }
13890 }
13895 {
13898 /* Don't try to compare variants of an incomplete type, before
13899 TYPE_FIELDS has been copied around. */
13907 /* For aggregate types, all the fields must be the same. */
13911 {
13912 /* Skip non-fields and zero-sized fields. */
13923 /* The fields must have the same name, offset and type. */
13926 || !gimple_canonical_types_compatible_p
13928 trust_type_canonical))
13930 }
13932 /* If one aggregate has more fields than the other, they
13933 are not the same. */
13938 }
13941 /* Consider all types with language specific trees in them mutually
13942 compatible. This is executed only from verify_type and false
13943 positives can be tolerated. */
13946 }
13947 }
13949 /* For OPAQUE_TYPE T, it should have only size and alignment information
13950 and its mode should be of class MODE_OPAQUE. This function verifies
13951 these properties of T match TV which is the main variant of T and TC
13952 which is the canonical of T. */
13954 static void
13956 {
13961 /* For an opaque type T1, check if some of its properties match
13962 the corresponding ones of the other opaque type T2, emit some
13963 error messages for those inconsistent ones. */
13966 {
13968 {
13972 }
13974 {
13978 }
13980 {
13984 }
13988 {
13992 }
13994 {
13998 }
14000 {
14004 }
14005 };
14012 }
14014 /* Verify type T. */
14016 void
14018 {
14024 {
14027 }
14030 {
14033 }
14035 {
14039 }
14044 ;
14046 {
14050 }
14051 /* Method and function types cannot be used to address memory and thus
14052 TYPE_CANONICAL really matters only for determining useless conversions.
14054 FIXME: C++ FE produce declarations of builtin functions that are not
14055 compatible with main variants. */
14057 ;
14059 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14060 with variably sized arrays because their sizes possibly
14061 gimplified to different variables. */
14065 {
14069 }
14073 {
14077 }
14079 {
14084 }
14087 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14089 {
14090 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14091 and danagle the pointer from time to time. */
14095 {
14099 }
14100 }
14102 {
14105 {
14109 }
14110 }
14112 {
14115 {
14119 }
14120 }
14123 {
14124 /* FIXME: The following check should pass:
14125 useless_type_conversion_p (const_cast <tree> (t),
14126 TREE_TYPE (TYPE_MIN_VALUE (t))
14127 but does not for C sizetypes in LTO. */
14128 }
14130 /* Check various uses of TYPE_MAXVAL_RAW. */
14132 {
14134 ;
14136 {
14140 }
14142 {
14146 }
14147 }
14149 {
14153 {
14157 }
14158 }
14160 {
14164 {
14168 }
14169 }
14172 {
14173 /* FIXME: The following check should pass:
14174 useless_type_conversion_p (const_cast <tree> (t),
14175 TREE_TYPE (TYPE_MAX_VALUE (t))
14176 but does not for C sizetypes in LTO. */
14177 }
14179 {
14182 {
14186 }
14187 }
14189 {
14193 }
14196 {
14200 }
14202 /* Check various uses of TYPE_VALUES_RAW. */
14205 {
14209 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14210 CONST_DECL of ENUMERAL TYPE. */
14212 {
14217 }
14221 {
14227 }
14229 {
14234 }
14235 }
14237 {
14239 {
14243 }
14244 }
14246 {
14248 {
14251 }
14253 {
14254 /* TODO: verify properties of decls. */
14256 ;
14258 ;
14260 ;
14262 ;
14264 ;
14266 ;
14268 ;
14269 else
14270 {
14274 }
14275 }
14276 }
14284 {
14286 {
14291 }
14293 {
14297 }
14298 /* Verify just enough of cache to ensure that no one copied it to new type.
14299 All copying should go by copy_node that should clear it. */
14301 {
14306 {
14311 }
14312 }
14313 }
14316 {
14317 /* C++ FE uses TREE_PURPOSE to store initial values. */
14319 {
14323 }
14325 {
14329 }
14330 }
14332 {
14336 }
14345 {
14348 }
14350 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14351 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14352 of a type. */
14355 {
14358 }
14361 {
14364 }
14365 }
14368 /* Return 1 if ARG interpreted as signed in its precision is known to be
14369 always positive or 2 if ARG is known to be always negative, or 3 if
14370 ARG may be positive or negative. */
14372 int
14374 {
14381 {
14385 else
14387 }
14391 {
14393 /* Narrower value zero extended into wider type
14394 will always result in positive values. */
14401 }
14405 value_range r;
14408 {
14412 {
14416 {
14425 }
14426 }
14428 }
14430 {
14431 /* For unsigned values, the "positive" range comes
14432 below the "negative" range. */
14437 }
14438 else
14439 {
14444 }
14446 }
14451 /* Return true if ARG is marked with the nonnull attribute in the
14452 current function signature. */
14454 bool
14456 {
14464 /* The static chain decl is always non null. */
14468 /* THIS argument of method is always non-NULL. */
14474 /* Values passed by reference are always non-NULL. */
14481 {
14484 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14488 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14492 /* Get the position number for ARG in the function signature. */
14494 t;
14496 {
14499 }
14503 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14505 {
14508 }
14509 }
14512 }
14514 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14515 information. */
14517 location_t
14519 {
14524 discriminator);
14525 }
14527 location_t
14529 {
14530 source_range src_range;
14534 }
14536 location_t
14538 {
14546 src_range,
14548 discriminator);
14551 }
14553 /* Return EXPR, potentially wrapped with a node expression LOC,
14554 if !CAN_HAVE_LOCATION_P (expr).
14556 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14557 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14559 Wrapper nodes can be identified using location_wrapper_p. */
14561 tree
14563 {
14570 /* We should only be adding wrappers for constants and for decls,
14571 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14576 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14577 any impact of the wrapper nodes. */
14581 /* Compiler-generated temporary variables don't need a wrapper. */
14585 /* If any auto_suppress_location_wrappers are active, don't create
14586 wrappers. */
14590 tree_code code
14595 /* Mark this node as being a wrapper. */
14598 }
14602 /* Return the name of combined function FN, for debugging purposes. */
14606 {
14608 {
14611 }
14612 else
14614 }
14616 /* Return a bitmap with a bit set corresponding to each argument in
14617 a function call type FNTYPE declared with attribute nonnull,
14618 or null if none of the function's argument are nonnull. The caller
14619 must free the bitmap. */
14621 bitmap
14623 {
14629 {
14630 /* The this pointer in C++ non-static member functions is
14631 implicitly nonnull whether or not it's declared as such. */
14634 }
14640 /* A function declaration can specify multiple attribute nonnull,
14641 each with zero or more arguments. The loop below creates a bitmap
14642 representing a union of all the arguments. An empty (but non-null)
14643 bitmap means that all arguments have been declaraed nonnull. */
14645 {
14654 {
14655 /* Clear the bitmap in case a previous attribute nonnull
14656 set it and this one overrides it for all arguments. */
14659 }
14661 /* Iterate over the indices of the format arguments declared nonnull
14662 and set a bit for each. */
14664 {
14667 }
14668 }
14671 }
14673 /* Returns true if TYPE is a type where it and all of its subobjects
14674 (recursively) are of structure, union, or array type. */
14676 bool
14678 {
14680 {
14687 }
14693 }
14695 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14696 that shouldn't be passed via stack. */
14698 bool
14700 {
14711 }
14713 /* Determine whether TYPE is a structure with a flexible array member,
14714 or a union containing such a structure (possibly recursively). */
14716 bool
14718 {
14721 {
14737 {
14741 }
14745 }
14746 }
14748 /* Like int_size_in_bytes, but handle empty records specially. */
14750 HOST_WIDE_INT
14752 {
14754 }
14756 /* Like size_in_bytes, but handle empty records specially. */
14758 tree
14760 {
14762 }
14764 /* Return true if an expression with CODE has to have the same result type as
14765 its first operand. */
14767 bool
14769 {
14771 {
14805 }
14806 }
14808 /* Return a typenode for the "standard" C type with a given name. */
14809 tree
14811 {
14843 }
14845 /* List of pointer types used to declare builtins before we have seen their
14846 real declaration.
14848 Keep the size up to date in tree.h ! */
14850 {
14857 };
14859 /* Return the maximum object size. */
14861 tree
14863 {
14864 /* To do: Make this a configurable parameter. */
14866 }
14868 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14869 parameter default to false and that weeds out error_mark_node. */
14871 bool
14874 {
14881 }
14883 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14884 delete operators. Return false if they may or may not name such
14885 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14886 do not. */
14888 bool
14891 {
14901 /* The following failures are due to invalid names so they're not
14902 considered certain mismatches. */
14918 /* The following failures are due to names of user-defined operators
14919 so they're also not considered certain mismatches. */
14921 /* *_len is now just the length after initial underscores. */
14927 /* The following failures are certain mismatches. */
14930 /* _Znw must match _Zdl, _Zna must match _Zda. */
14934 /* 'j', 'm' and 'y' correspond to size_t. */
14941 {
14942 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14943 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14950 }
14954 {
14955 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14956 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14957 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14967 }
14969 /* The negative result is conservative. */
14972 }
14974 /* Return the zero-based number corresponding to the argument being
14975 deallocated if FNDECL is a deallocation function or an out-of-bounds
14976 value if it isn't. */
14978 unsigned
14980 {
14981 /* A call to operator delete isn't recognized as one to a built-in. */
14983 {
14987 /* Avoid placement delete that's not been inlined. */
14993 }
14995 /* TODO: Handle user-defined functions with attribute malloc? Handle
14996 known non-built-ins like fopen? */
14998 {
15000 {
15006 }
15008 }
15017 {
15028 }
15031 }
15033 /* If EXPR refers to a character array or pointer declared attribute
15034 nonstring, return a decl for that array or pointer and set *REF
15035 to the referenced enclosing object or pointer. Otherwise return
15036 null. */
15038 tree
15040 {
15044 {
15048 {
15054 }
15055 else
15057 }
15062 /* To simplify calling code, store the referenced DECL regardless of
15063 the attribute determined below, but avoid storing the SSA_NAME_VAR
15064 obtained above (it's not useful for dataflow purposes). */
15068 /* Use the SSA_NAME_VAR that was determined above to see if it's
15069 declared nonstring. Otherwise drill down into the referenced
15070 DECL. */
15085 }
15087 /* Return length of attribute names string,
15088 if arglist chain > 1, -1 otherwise. */
15090 int
15092 {
15093 tree arg;
15098 {
15103 argnum++;
15104 argnum++;
15105 }
15109 }
15111 void
15113 {
15116 }
15118 #if CHECKING_P
15122 /* Selftests for tree. */
15124 /* Verify that integer constants are sane. */
15126 static void
15128 {
15141 }
15143 /* Verify identifiers. */
15145 static void
15147 {
15151 }
15153 /* Verify LABEL_DECL. */
15155 static void
15157 {
15163 }
15165 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15166 are given by VALS. */
15168 static tree
15170 {
15175 }
15177 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15179 static void
15181 {
15187 }
15189 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15190 and that its elements match EXPECTED. */
15192 static void
15195 {
15202 }
15204 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15205 and NPATTERNS background elements, and that its elements match
15206 EXPECTED. */
15208 static void
15211 {
15218 }
15220 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15221 and that its elements match EXPECTED. */
15223 static void
15226 {
15233 }
15235 /* Test the creation of VECTOR_CSTs. */
15237 static void
15239 {
15245 /* Test a simple linear series with a base of 0 and a step of 1:
15246 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15252 /* Try the same with the first element replaced by 100:
15253 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15258 /* Try a series that wraps around.
15259 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15265 /* Try a downward series:
15266 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15272 /* Try two interleaved series with different bases and steps:
15273 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15276 {
15279 }
15283 /* Try a duplicated value:
15284 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15290 /* Try an interleaved duplicated value:
15291 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15298 /* Try a duplicated value with 2 exceptions
15299 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15305 /* Try with and without a step
15306 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15312 /* Try a fully-general constant:
15313 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15317 }
15319 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15320 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15321 modifying its argument in-place. */
15323 static void
15325 {
15328 }
15330 /* Verify location wrappers. */
15332 static void
15334 {
15339 /* Wrapping a constant. */
15349 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15352 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15357 /* Wrapping a STRING_CST. */
15369 /* Wrapping a variable. */
15372 integer_type_node);
15381 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15382 wrapper. */
15387 /* Verify that STRIP_NOPS removes wrappers. */
15391 }
15393 /* Test various tree predicates. Verify that location wrappers don't
15394 affect the results. */
15396 static void
15398 {
15399 /* Build various constants and wrappers around them. */
15427 /* TODO: vector constants. */
15429 /* Test integer_onep. */
15449 /* Test integer_zerop. */
15469 /* Test integer_all_onesp. */
15489 /* Test integer_minus_onep. */
15509 /* Test integer_each_onep. */
15529 /* Test integer_truep. */
15549 /* Test integer_nonzerop. */
15569 /* Test real_zerop. */
15589 /* Test real_onep. */
15609 /* Test real_minus_onep. */
15629 /* Test zerop. */
15649 /* Test tree_expr_nonnegative_p. */
15669 /* Test tree_expr_nonzero_p. */
15677 /* Test integer_valued_real_p. */
15684 /* Test integer_pow2p. */
15689 /* Test uniform_integer_cst_p. */
15708 }
15710 /* Check that string escaping works correctly. */
15712 static void
15714 {
15716 escaped_string msg;
15719 /* ASSERT_STREQ does not accept NULL as a valid test
15720 result, so we have to use ASSERT_EQ instead. */
15729 /* Ensure that we have -fmessage-length set to 0. */
15739 /* Now repeat the tests with -fmessage-length set to 5. */
15742 /* Note that the newline is not translated into an escape. */
15749 /* Restore the original message length setting. */
15751 }
15753 /* Run all of the selftests within this file. */
15755 void
15757 {
15765 }