| blob | 3dff8c510832d154d1ac5de3871384ab21141a94 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2024 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 {
331 };
334 {
424 };
426 /* Unless specific to OpenACC, we tend to internally maintain OpenMP-centric
427 clause names, but for use in diagnostics etc. would like to use the "user"
428 clause names. */
432 {
433 /* For OpenACC, the 'OMP_CLAUSE_MAP_KIND' of an 'OMP_CLAUSE_MAP' is used to
434 distinguish clauses as seen by the user. See also where front ends do
435 'build_omp_clause' with 'OMP_CLAUSE_MAP'. */
438 {
456 }
459 }
462 /* Return the tree node structure used by tree code CODE. */
466 {
468 {
471 {
483 }
497 }
500 {
501 /* tcc_constant cases. */
511 /* tcc_exceptional cases. */
528 }
529 }
532 /* Initialize tree_contains_struct to describe the hierarchy of tree
533 nodes. */
535 static void
537 {
541 {
548 /* Mark the TS structure itself. */
551 /* Mark all the structures that TS is derived from. */
553 {
633 }
634 }
636 /* Basic consistency checks for attributes used in fold. */
677 }
680 /* Init tree.cc. */
682 void
684 {
685 /* Initialize the hash table of types. */
686 type_hash_table
689 debug_expr_for_decl
692 value_expr_for_decl
706 /* Initialize the tree_contains_struct array. */
709 }
711 \f
712 /* The name of the object as the assembler will see it (but before any
713 translations made by ASM_OUTPUT_LABELREF). Often this is the same
714 as DECL_NAME. It is an IDENTIFIER_NODE. */
715 tree
717 {
721 }
723 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
724 (either of which may be NULL). Inform the FE, if this changes the
725 name. */
727 void
729 {
732 }
734 /* Return true if DECL may need an assembler name to be set. */
738 {
739 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
740 Rule merging. This makes type_odr_p to return true on those types during
741 LTO and by comparing the mangled name, we can say what types are intended
742 to be equivalent across compilation unit.
744 We do not store names of type_in_anonymous_namespace_p.
746 Record, union and enumeration type have linkage that allows use
747 to check type_in_anonymous_namespace_p. We do not mangle compound types
748 that always can be compared structurally.
750 Similarly for builtin types, we compare properties of their main variant.
751 A special case are integer types where mangling do make differences
752 between char/signed char/unsigned char etc. Storing name for these makes
753 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
754 See cp/mangle.cc:write_builtin_type for details. */
757 {
770 }
771 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
775 /* If DECL already has its assembler name set, it does not need a
776 new one. */
781 /* Abstract decls do not need an assembler name. */
785 /* For VAR_DECLs, only static, public and external symbols need an
786 assembler name. */
794 {
795 /* Do not set assembler name on builtins. Allow RTL expansion to
796 decide whether to expand inline or via a regular call. */
801 /* Functions represented in the callgraph need an assembler name. */
805 /* Unused and not public functions don't need an assembler name. */
808 }
811 }
813 /* If T needs an assembler name, have one created for it. */
815 void
817 {
819 {
820 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
821 diagnostics that use input_location to show locus
822 information. The problem here is that, at this point,
823 input_location is generally anchored to the end of the file
824 (since the parser is long gone), so we don't have a good
825 position to pin it to.
827 To alleviate this problem, this uses the location of T's
828 declaration. Examples of this are
829 testsuite/g++.dg/template/cond2.C and
830 testsuite/g++.dg/template/pr35240.C. */
837 }
838 }
840 /* When the target supports COMDAT groups, this indicates which group the
841 DECL is associated with. This can be either an IDENTIFIER_NODE or a
842 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
843 tree
845 {
850 }
852 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
853 tree
855 {
860 }
862 /* When the target supports named section, return its name as IDENTIFIER_NODE
863 or NULL if it is in no section. */
866 {
871 }
873 /* Set section name of NODE to VALUE (that is expected to be
874 identifier node) */
875 void
877 {
881 {
885 }
888 else
891 }
893 /* Set section name of NODE to match the section name of OTHER.
895 set_decl_section_name (decl, other) is equivalent to
896 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
897 efficient. */
898 void
900 {
903 {
907 else
910 }
911 else
912 {
917 }
918 }
920 /* Return TLS model of a variable NODE. */
921 enum tls_model
923 {
928 }
930 /* Set TLS model of variable NODE to MODEL. */
931 void
933 {
937 {
941 }
942 else
945 }
947 /* Compute the number of bytes occupied by a tree with code CODE.
948 This function cannot be used for nodes that have variable sizes,
949 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
950 size_t
952 {
954 {
957 {
974 }
978 {
1003 }
1016 {
1028 }
1032 {
1053 }
1057 }
1058 }
1060 /* Compute the number of bytes occupied by NODE. This routine only
1061 looks at TREE_CODE, except for those nodes that have variable sizes. */
1062 size_t
1064 {
1067 {
1097 else
1099 }
1100 }
1102 /* Return tree node kind based on tree CODE. */
1104 static tree_node_kind
1106 {
1110 {
1128 {
1145 }
1151 }
1152 }
1154 /* Record interesting allocation statistics for a tree node with CODE
1155 and LENGTH. */
1157 static void
1159 {
1168 }
1170 /* Allocate and return a new UID from the DECL_UID namespace. */
1172 int
1174 {
1176 }
1178 /* Return a newly allocated node of code CODE. For decl and type
1179 nodes, some other fields are initialized. The rest of the node is
1180 initialized to zero. This function cannot be used for TREE_VEC,
1181 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1182 tree_code_size.
1184 Achoo! I got a code in the node. */
1186 tree
1188 {
1189 tree t;
1199 {
1207 {
1209 {
1212 }
1213 else
1215 }
1219 else
1220 {
1223 }
1236 /* Default to no attributes for type, but let target change that. */
1240 /* We have not yet computed the alias set for this type. */
1250 {
1258 /* All of these have side-effects, no matter what their
1259 operands are. */
1265 }
1270 {
1283 }
1287 /* Other classes need no special treatment. */
1289 }
1292 }
1294 /* Free tree node. */
1296 void
1298 {
1301 {
1311 }
1323 }
1324 \f
1325 /* Return a new node with the same contents as NODE except that its
1326 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1328 tree
1330 {
1331 tree t;
1348 {
1351 else
1352 {
1356 }
1359 {
1362 }
1363 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1365 {
1368 }
1370 {
1373 }
1375 {
1378 }
1379 }
1381 {
1383 /* The following is so that the debug code for
1384 the copy is different from the original type.
1385 The two statements usually duplicate each other
1386 (because they clear fields of the same union),
1387 but the optimizer should catch that. */
1391 /* Do not copy the values cache. */
1393 {
1396 }
1397 }
1399 {
1403 }
1405 {
1409 }
1412 }
1414 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1415 For example, this can copy a list made of TREE_LIST nodes. */
1417 tree
1419 {
1420 tree head;
1429 {
1433 }
1435 }
1437 \f
1438 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1439 INTEGER_CST with value CST and type TYPE. */
1441 static unsigned int
1443 {
1445 /* We need extra HWIs if CST is an unsigned integer with its
1446 upper bit set. */
1450 }
1452 /* Return a new INTEGER_CST with value CST and type TYPE. */
1454 static tree
1456 {
1462 {
1468 }
1471 {
1472 len--;
1476 }
1482 }
1484 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1486 static tree
1488 CXX_MEM_STAT_INFO)
1489 {
1501 }
1503 /* Create a constant tree that contains CST sign-extended to TYPE. */
1505 tree
1507 {
1508 /* Support legacy code. */
1513 }
1515 /* Create a constant tree that contains CST zero-extended to TYPE. */
1517 tree
1519 {
1521 }
1523 /* Create a constant tree that contains CST sign-extended to TYPE. */
1525 tree
1527 {
1530 }
1532 /* Constructs tree in type TYPE from with value given by CST. Signedness
1533 of CST is assumed to be the same as the signedness of TYPE. */
1535 tree
1537 {
1539 }
1541 /* We force the wide_int CST to the range of the type TYPE by sign or
1542 zero extending it. OVERFLOWABLE indicates if we are interested in
1543 overflow of the value, when >0 we are only interested in signed
1544 overflow, for <0 we are interested in any overflow. OVERFLOWED
1545 indicates whether overflow has already occurred. CONST_OVERFLOWED
1546 indicates whether constant overflow has already occurred. We force
1547 T's value to be within range of T's type (by setting to 0 or 1 all
1548 the bits outside the type's range). We set TREE_OVERFLOWED if,
1549 OVERFLOWED is nonzero,
1550 or OVERFLOWABLE is >0 and signed overflow occurs
1551 or OVERFLOWABLE is <0 and any overflow occurs
1552 We return a new tree node for the extended wide_int. The node
1553 is shared if no overflow flags are set. */
1556 tree
1559 {
1562 /* If we need to set overflow flags, return a new unshared node. */
1564 {
1568 {
1570 sign);
1571 tree t;
1574 else
1575 {
1578 {
1581 }
1583 }
1586 }
1587 }
1589 /* Else build a shared node. */
1591 }
1593 /* These are the hash table functions for the hash table of INTEGER_CST
1594 nodes of a sizetype. */
1596 /* Return the hash code X, an INTEGER_CST. */
1598 hashval_t
1600 {
1609 }
1611 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1612 is the same as that given by *Y, which is the same. */
1614 bool
1616 {
1630 }
1632 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1633 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1634 number of slots that can be cached for the type. */
1639 {
1641 /* Initialize cache. */
1643 {
1646 }
1649 {
1650 /* Create a new shared int. */
1653 }
1655 }
1657 /* Create an INT_CST node of TYPE and value CST.
1658 The returned node is always shared. For small integers we use a
1659 per-type vector cache, for larger ones we use a single hash table.
1660 The value is extended from its precision according to the sign of
1661 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1662 the upper bits and ensures that hashing and value equality based
1663 upon the underlying HOST_WIDE_INTs works without masking. */
1665 static tree
1667 {
1668 tree t;
1676 /* Verify that everything is canonical. */
1679 {
1684 }
1691 {
1692 /* Cache NULL pointer and zero bounds. */
1695 /* Cache upper bounds of pointers. */
1698 /* Cache 1 which is used for a non-zero range. */
1703 {
1705 /* Make sure no one is clobbering the shared constant. */
1709 }
1710 }
1712 {
1713 /* We just need to store a single HOST_WIDE_INT. */
1714 HOST_WIDE_INT hwi;
1717 else
1721 {
1724 /* Fallthru. */
1728 /* Ignore pointers, as they were already handled above. */
1732 /* Cache false or true. */
1742 {
1743 /* Cache [0, N). */
1747 }
1748 else
1749 {
1750 /* Cache [-1, N). */
1754 }
1762 }
1765 {
1767 /* Make sure no one is clobbering the shared constant. */
1773 }
1774 else
1775 {
1776 /* Use the cache of larger shared ints, using int_cst_node as
1777 a temporary. */
1785 {
1786 /* Insert this one into the hash table. */
1789 /* Make a new node for next time round. */
1791 }
1792 }
1793 }
1794 else
1795 {
1796 /* The value either hashes properly or we drop it on the floor
1797 for the gc to take care of. There will not be enough of them
1798 to worry about. */
1804 {
1805 /* Insert this one into the hash table. */
1808 }
1809 else
1811 }
1814 }
1816 hashval_t
1818 {
1826 }
1828 bool
1830 {
1837 }
1839 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1840 The elements must also have type TYPE. */
1842 tree
1844 {
1855 INSERT);
1857 {
1862 }
1864 }
1866 /* Create a constant tree with value VALUE in type TYPE. */
1868 tree
1870 {
1874 }
1876 /* Insert INTEGER_CST T into a cache of integer constants. And return
1877 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1878 is false, and T falls into the type's 'smaller values' range, there
1879 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1880 or the value is large, should an existing entry exist, it is
1881 returned (rather than inserting T). */
1883 tree
1885 {
1893 /* The caching indices here must match those in
1894 wide_int_to_type_1. */
1896 {
1899 /* Fallthru. */
1903 {
1911 }
1915 /* Cache false or true. */
1925 {
1926 /* Cache 0..N */
1929 /* This is a little hokie, but if the prec is smaller than
1930 what is necessary to hold param_integer_share_limit, then the
1931 obvious test will not get the correct answer. */
1933 {
1937 }
1940 }
1941 else
1942 {
1943 /* Cache -1..N */
1949 {
1951 {
1954 }
1957 }
1958 }
1962 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1963 members. */
1968 }
1971 {
1972 /* Look for it in the type's vector of small shared ints. */
1974 {
1977 }
1980 {
1983 }
1984 else
1986 }
1987 else
1988 {
1989 /* Use the cache of larger shared ints. */
1992 {
1993 /* If there is already an entry for the number verify it's the
1994 same value. */
1996 /* And return the cached value. */
1998 }
1999 else
2000 /* Otherwise insert this one into the hash table. */
2002 }
2005 }
2008 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2009 and the rest are zeros. */
2011 tree
2013 {
2018 }
2020 /* Checks that X is integer constant that can be expressed in (unsigned)
2021 HOST_WIDE_INT without loss of precision. */
2023 bool
2025 {
2028 }
2030 /* Build a newly constructed VECTOR_CST with the given values of
2031 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2033 tree
2036 {
2038 tree t;
2054 }
2056 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2057 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2059 tree
2061 {
2066 tree value;
2068 /* We can't construct a VECTOR_CST for a variable number of elements. */
2072 {
2074 {
2075 /* If NELTS is constant then this must be too. */
2079 }
2080 else
2082 }
2087 }
2089 /* Build a vector of type VECTYPE where all the elements are SCs. */
2090 tree
2092 {
2098 /* Verify that the vector type is suitable for SC. Note that there
2099 is some inconsistency in the type-system with respect to restrict
2100 qualifications of pointers. Vector types always have a main-variant
2101 element type and the qualification is applied to the vector-type.
2102 So TREE_TYPE (vector-type) does not return a properly qualified
2103 vector element-type. */
2108 {
2112 }
2115 else
2116 {
2122 }
2123 }
2125 /* If TYPE is not a vector type, just return SC, otherwise return
2126 build_vector_from_val (TYPE, SC). */
2128 tree
2130 {
2135 }
2137 /* Build a vector series of type TYPE in which element I has the value
2138 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2139 and a VEC_SERIES_EXPR otherwise. */
2141 tree
2143 {
2147 {
2157 }
2159 }
2161 /* Return a vector with the same number of units and number of bits
2162 as VEC_TYPE, but in which the elements are a linear series of unsigned
2163 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2165 tree
2167 {
2172 {
2173 index_elt_type = build_nonstandard_integer_type
2176 }
2182 }
2184 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2185 elements are A and the rest are B. */
2187 tree
2189 {
2192 /* Optimize the constant case. */
2199 }
2201 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2202 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2204 void
2206 {
2208 tree val;
2214 {
2215 /* Mostly ctors will have elts that don't have side-effects, so
2216 the usual case is to scan all the elements. Hence a single
2217 loop for both const and side effects, rather than one loop
2218 each (with early outs). */
2223 }
2227 }
2229 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2230 CONSTRUCTOR C. */
2232 void
2234 {
2236 tree val;
2242 {
2247 }
2248 }
2250 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2251 are in the vec pointed to by VALS. */
2252 tree
2254 {
2263 }
2265 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2266 INDEX and VALUE. */
2267 tree
2269 {
2277 }
2280 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2281 are in a list pointed to by VALS. */
2282 tree
2284 {
2285 tree t;
2289 {
2293 }
2296 }
2298 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2299 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2300 fields in the constructor remain null. */
2302 tree
2304 {
2311 }
2313 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2314 of elements, provided as index/value pairs. */
2316 tree
2318 {
2325 {
2329 }
2332 }
2334 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2336 tree
2338 {
2343 }
2345 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2347 tree
2349 {
2350 tree v;
2360 }
2362 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2364 tree
2366 {
2367 tree v;
2370 /* dconst{0,1,2,m1,half} are used in various places in
2371 the middle-end and optimizers, allow them here
2372 even for decimal floating point types as an exception
2373 by converting them to decimal. */
2377 {
2387 {
2388 /* Make sure to give zero the minimum quantum exponent for
2389 the type (which corresponds to all bits zero). */
2394 }
2395 else
2397 }
2399 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2400 Consider doing it via real_convert now. */
2407 }
2409 /* Like build_real, but first truncate D to the type. */
2411 tree
2413 {
2415 }
2417 /* Return a new REAL_CST node whose type is TYPE
2418 and whose value is the integer value of the INTEGER_CST node I. */
2420 REAL_VALUE_TYPE
2422 {
2423 REAL_VALUE_TYPE d;
2425 /* Clear all bits of the real value type so that we can later do
2426 bitwise comparisons to see if two values are the same. */
2432 }
2434 /* Given a tree representing an integer constant I, return a tree
2435 representing the same value as a floating-point constant of type TYPE. */
2437 tree
2439 {
2440 tree v;
2447 }
2449 /* Return a new REAL_CST node whose type is TYPE
2450 and whose value is the integer value I which has sign SGN. */
2452 tree
2454 {
2455 REAL_VALUE_TYPE d;
2457 /* Clear all bits of the real value type so that we can later do
2458 bitwise comparisons to see if two values are the same. */
2463 }
2465 /* Return a newly constructed STRING_CST node whose value is the LEN
2466 characters at STR when STR is nonnull, or all zeros otherwise.
2467 Note that for a C string literal, LEN should include the trailing NUL.
2468 The TREE_TYPE is not initialized. */
2470 tree
2472 {
2473 /* Do not waste bytes provided by padding of struct tree_string. */
2486 else
2491 }
2493 /* Return a newly constructed COMPLEX_CST node whose value is
2494 specified by the real and imaginary parts REAL and IMAG.
2495 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2496 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2498 tree
2500 {
2511 }
2513 /* Build a complex (inf +- 0i), such as for the result of cproj.
2514 TYPE is the complex tree type of the result. If NEG is true, the
2515 imaginary zero is negative. */
2517 tree
2519 {
2525 }
2527 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2528 element is set to 1. In particular, this is 1 + i for complex types. */
2530 tree
2532 {
2534 {
2537 }
2538 else
2540 }
2542 /* Return a constant of arithmetic type TYPE which is the
2543 multiplicative identity of the set TYPE. */
2545 tree
2547 {
2549 {
2559 /* We can only generate 1 for accum types. */
2564 {
2568 }
2577 }
2578 }
2580 /* Return an integer of type TYPE containing all 1's in as much precision as
2581 it contains, or a complex or vector whose subparts are such integers. */
2583 tree
2585 {
2587 {
2590 }
2591 else
2593 }
2595 /* Return a constant of arithmetic type TYPE which is the
2596 opposite of the multiplicative identity of the set TYPE. */
2598 tree
2600 {
2602 {
2612 /* We can only generate 1 for accum types. */
2619 {
2623 }
2632 }
2633 }
2635 /* Build 0 constant of type TYPE. This is used by constructor folding
2636 and thus the constant should be represented in memory by
2637 zero(es). */
2639 tree
2641 {
2643 {
2656 {
2660 }
2663 {
2667 }
2673 }
2674 }
2676 /* Build a constant of integer type TYPE, made of VALUE's bits replicated
2677 every WIDTH bits to fit TYPE's precision. */
2679 tree
2681 {
2692 else
2693 {
2696 }
2704 }
2706 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2707 unsigned constant in which only the sign bit is set. Return null
2708 otherwise. */
2710 tree
2712 {
2713 /* Avoid having to choose between a real-only sign and a pair of signs.
2714 This could be relaxed if the choice becomes obvious later. */
2729 {
2732 }
2734 }
2736 /* Build a BINFO with LEN language slots. */
2738 tree
2740 {
2741 tree t;
2756 }
2758 /* Create a CASE_LABEL_EXPR tree node and return it. */
2760 tree
2762 {
2774 }
2776 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2777 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2778 The latter determines the length of the HOST_WIDE_INT vector. */
2780 tree
2782 {
2783 tree t;
2798 }
2800 /* Build a newly constructed TREE_VEC node of length LEN. */
2802 tree
2804 {
2805 tree t;
2816 }
2818 /* Grow a TREE_VEC node to new length LEN. */
2820 tree
2822 {
2838 }
2839 \f
2840 /* Return true if EXPR is the constant zero, whether it is integral, float or
2841 fixed, and scalar, complex or vector. */
2843 bool
2845 {
2849 }
2851 /* Return true if EXPR is the integer constant zero or a complex constant
2852 of zero, or a location wrapper for such a constant. */
2854 bool
2856 {
2860 {
2872 }
2873 }
2875 /* Return true if EXPR is the integer constant one or the corresponding
2876 complex constant, or a location wrapper for such a constant. */
2878 bool
2880 {
2884 {
2896 }
2897 }
2899 /* Return true if EXPR is the integer constant one. For complex and vector,
2900 return true if every piece is the integer constant one.
2901 Also return true for location wrappers for such a constant. */
2903 bool
2905 {
2911 else
2913 }
2915 /* Return true if EXPR is an integer containing all 1's in as much precision
2916 as it contains, or a complex or vector whose subparts are such integers,
2917 or a location wrapper for such a constant. */
2919 bool
2921 {
2939 }
2941 /* Return true if EXPR is the integer constant minus one, or a location
2942 wrapper for such a constant. */
2944 bool
2946 {
2952 else
2954 }
2956 /* Return true if EXPR is an integer constant that is a power of 2 (i.e., has
2957 only one bit on), or a location wrapper for such a constant. */
2959 bool
2961 {
2973 }
2975 /* Return true if EXPR is an integer constant other than zero or a
2976 complex constant other than zero, or a location wrapper for such a
2977 constant. */
2979 bool
2981 {
2989 }
2991 /* Return true if EXPR is the integer constant one. For vector,
2992 return true if every piece is the integer constant minus one
2993 (representing the value TRUE).
2994 Also return true for location wrappers for such a constant. */
2996 bool
2998 {
3004 }
3006 /* Return true if EXPR is the fixed-point constant zero, or a location wrapper
3007 for such a constant. */
3009 bool
3011 {
3016 }
3018 /* Return the power of two represented by a tree node known to be a
3019 power of two. */
3021 int
3023 {
3028 }
3030 /* Similar, but return the largest integer Y such that 2 ** Y is less
3031 than or equal to EXPR. */
3033 int
3035 {
3040 }
3042 /* Return number of known trailing zero bits in EXPR, or, if the value of
3043 EXPR is known to be zero, the precision of it's type. */
3045 unsigned int
3047 {
3054 {
3075 /* Second operand is sizetype, which could be in theory
3076 wider than pointer's precision. Make sure we never
3077 return more than prec. */
3092 {
3095 }
3100 {
3105 }
3114 {
3117 {
3122 }
3123 }
3125 CASE_CONVERT:
3143 {
3146 }
3150 }
3151 }
3153 /* Return true if EXPR is the real constant zero. Trailing zeroes matter for
3154 decimal float constants, so don't return true for them.
3155 Also return true for location wrappers around such a constant. */
3157 bool
3159 {
3163 {
3171 {
3172 /* Don't simply check for a duplicate because the predicate
3173 accepts both +0.0 and -0.0. */
3179 }
3182 }
3183 }
3185 /* Return true if EXPR is the real constant one in real or complex form.
3186 Trailing zeroes matter for decimal float constants, so don't return
3187 true for them.
3188 Also return true for location wrappers around such a constant. */
3190 bool
3192 {
3196 {
3209 }
3210 }
3212 /* Return true if EXPR is the real constant minus one. Trailing zeroes
3213 matter for decimal float constants, so don't return true for them.
3214 Also return true for location wrappers around such a constant. */
3216 bool
3218 {
3222 {
3235 }
3236 }
3238 /* Return true if T could be a floating point zero. */
3240 bool
3242 {
3244 {
3246 /* Can't use real_zerop here, as it always returns false for decimal
3247 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3248 either, as decimal zeros are rvc_normal. */
3254 {
3260 }
3262 /* Perhaps for SSA_NAMEs we could query frange. */
3264 }
3265 }
3267 /* True if EXP is a constant or a cast of a constant. */
3269 bool
3271 {
3272 /* This is not quite the same as STRIP_NOPS. It does more. */
3277 }
3279 /* Return true if T holds a polynomial pointer difference, storing it in
3280 *VALUE if so. A true return means that T's precision is no greater
3281 than 64 bits, which is the largest address space we support, so *VALUE
3282 never loses precision. However, the signedness of the result does
3283 not necessarily match the signedness of T: sometimes an unsigned type
3284 like sizetype is used to encode a value that is actually negative. */
3286 bool
3288 {
3292 {
3297 }
3299 {
3306 }
3308 }
3310 poly_int64
3312 {
3317 }
3319 poly_uint64
3321 {
3326 }
3327 \f
3328 /* Return first list element whose TREE_VALUE is ELEM.
3329 Return 0 if ELEM is not in LIST. */
3331 tree
3333 {
3335 {
3339 }
3341 }
3343 /* Return first list element whose TREE_PURPOSE is ELEM.
3344 Return 0 if ELEM is not in LIST. */
3346 tree
3348 {
3350 {
3354 }
3356 }
3358 /* Return true if ELEM is in V. */
3360 bool
3362 {
3364 tree t;
3369 }
3371 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3372 NULL_TREE. */
3374 tree
3376 {
3380 }
3382 /* Return true if ELEM is part of the chain CHAIN. */
3384 bool
3386 {
3388 {
3392 }
3395 }
3397 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3398 We expect a null pointer to mark the end of the chain.
3399 This is the Lisp primitive `length'. */
3401 int
3403 {
3405 #ifdef ENABLE_TREE_CHECKING
3407 #endif
3411 {
3413 #ifdef ENABLE_TREE_CHECKING
3417 #endif
3418 len++;
3419 }
3422 }
3424 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3425 UNION_TYPE TYPE, or NULL_TREE if none. */
3427 tree
3429 {
3434 }
3436 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3437 UNION_TYPE TYPE, or NULL_TREE if none. */
3439 tree
3441 {
3445 {
3450 }
3453 }
3455 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3456 by modifying the last node in chain 1 to point to chain 2.
3457 This is the Lisp primitive `nconc'. */
3459 tree
3461 {
3462 tree t1;
3473 #ifdef ENABLE_TREE_CHECKING
3474 {
3475 tree t2;
3478 }
3479 #endif
3482 }
3484 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3486 tree
3488 {
3489 tree next;
3494 }
3496 /* Reverse the order of elements in the chain T,
3497 and return the new head of the chain (old last element). */
3499 tree
3501 {
3504 {
3505 /* We shouldn't be using this function to reverse BLOCK chains; we
3506 have blocks_nreverse for that. */
3511 }
3513 }
3514 \f
3515 /* Return a newly created TREE_LIST node whose
3516 purpose and value fields are PARM and VALUE. */
3518 tree
3520 {
3525 }
3527 /* Build a chain of TREE_LIST nodes from a vector. */
3529 tree
3531 {
3535 tree t;
3537 {
3540 }
3542 }
3544 /* Return a newly created TREE_LIST node whose
3545 purpose and value fields are PURPOSE and VALUE
3546 and whose TREE_CHAIN is CHAIN. */
3548 tree
3550 {
3551 tree node;
3563 }
3565 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3566 trees. */
3570 {
3574 tree val;
3580 }
3581 \f
3582 /* Return the size nominally occupied by an object of type TYPE
3583 when it resides in memory. The value is measured in units of bytes,
3584 and its data type is that normally used for type sizes
3585 (which is the first type created by make_signed_type or
3586 make_unsigned_type). */
3588 tree
3590 {
3591 tree t;
3600 {
3603 }
3606 }
3608 /* Return the size of TYPE (in bytes) as a wide integer
3609 or return -1 if the size can vary or is larger than an integer. */
3611 HOST_WIDE_INT
3613 {
3614 tree t;
3624 else
3626 }
3628 /* Return the maximum size of TYPE (in bytes) as a wide integer
3629 or return -1 if the size can vary or is larger than an integer. */
3631 HOST_WIDE_INT
3633 {
3635 tree size_tree;
3637 /* If this is an array type, check for a possible MAX_SIZE attached. */
3640 {
3645 }
3647 /* If we still haven't been able to get a size, see if the language
3648 can compute a maximum size. */
3651 {
3656 }
3659 }
3660 \f
3661 /* Return the bit position of FIELD, in bits from the start of the record.
3662 This is a tree of type bitsizetype. */
3664 tree
3666 {
3669 }
3670 \f
3671 /* Return the byte position of FIELD, in bytes from the start of the record.
3672 This is a tree of type sizetype. */
3674 tree
3676 {
3679 }
3681 /* Likewise, but return as an integer. It must be representable in
3682 that way (since it could be a signed value, we don't have the
3683 option of returning -1 like int_size_in_byte can. */
3685 HOST_WIDE_INT
3687 {
3689 }
3690 \f
3691 /* Return, as a tree node, the number of elements for TYPE (which is an
3692 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3694 tree
3696 {
3699 /* If they did it with unspecified bounds, then we should have already
3700 given an error about it before we got here. */
3708 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3710 {
3711 /* zero sized arrays are represented from C FE as complete types with
3712 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3713 them as min 0, max -1. */
3720 }
3723 ? max
3725 }
3726 \f
3727 /* If arg is static -- a reference to an object in static storage -- then
3728 return the object. This is not the same as the C meaning of `static'.
3729 If arg isn't static, return NULL. */
3731 tree
3733 {
3735 {
3737 /* Nested functions are static, even though taking their address will
3738 involve a trampoline as we unnest the nested function and create
3739 the trampoline on the tree level. */
3760 /* If the thing being referenced is not a field, then it is
3761 something language specific. */
3764 /* If we are referencing a bitfield, we can't evaluate an
3765 ADDR_EXPR at compile time and so it isn't a constant. */
3782 else
3790 }
3791 }
3793 \f
3796 /* Return whether OP is a DECL whose address is function-invariant. */
3798 bool
3800 {
3801 /* The conditions below are slightly less strict than the one in
3802 staticp. */
3805 {
3828 }
3831 }
3833 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3835 bool
3837 {
3838 /* The conditions below are slightly less strict than the one in
3839 staticp. */
3842 {
3862 }
3865 }
3868 /* Return true if T is function-invariant (internal function, does
3869 not handle arithmetic; that's handled in skip_simple_arithmetic and
3870 tree_invariant_p). */
3872 static bool
3874 {
3875 tree op;
3882 {
3889 {
3891 {
3906 }
3908 }
3914 }
3917 }
3919 /* Return true if T is function-invariant. */
3921 bool
3923 {
3926 }
3928 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3929 Do this to any expression which may be used in more than one place,
3930 but must be evaluated only once.
3932 Normally, expand_expr would reevaluate the expression each time.
3933 Calling save_expr produces something that is evaluated and recorded
3934 the first time expand_expr is called on it. Subsequent calls to
3935 expand_expr just reuse the recorded value.
3937 The call to expand_expr that generates code that actually computes
3938 the value is the first call *at compile time*. Subsequent calls
3939 *at compile time* generate code to use the saved value.
3940 This produces correct result provided that *at run time* control
3941 always flows through the insns made by the first expand_expr
3942 before reaching the other places where the save_expr was evaluated.
3943 You, the caller of save_expr, must make sure this is so.
3945 Constants, and certain read-only nodes, are returned with no
3946 SAVE_EXPR because that is safe. Expressions containing placeholders
3947 are not touched; see tree.def for an explanation of what these
3948 are used for. */
3950 tree
3952 {
3953 tree inner;
3955 /* If the tree evaluates to a constant, then we don't want to hide that
3956 fact (i.e. this allows further folding, and direct checks for constants).
3957 However, a read-only object that has side effects cannot be bypassed.
3958 Since it is no problem to reevaluate literals, we just return the
3959 literal node. */
3967 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3968 it means that the size or offset of some field of an object depends on
3969 the value within another field.
3971 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3972 and some variable since it would then need to be both evaluated once and
3973 evaluated more than once. Front-ends must assure this case cannot
3974 happen by surrounding any such subexpressions in their own SAVE_EXPR
3975 and forcing evaluation at the proper time. */
3981 /* This expression might be placed ahead of a jump to ensure that the
3982 value was computed on both sides of the jump. So make sure it isn't
3983 eliminated as dead. */
3986 }
3988 /* Look inside EXPR into any simple arithmetic operations. Return the
3989 outermost non-arithmetic or non-invariant node. */
3991 tree
3993 {
3994 /* We don't care about whether this can be used as an lvalue in this
3995 context. */
3999 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
4000 a constant, it will be more efficient to not make another SAVE_EXPR since
4001 it will allow better simplification and GCSE will be able to merge the
4002 computations if they actually occur. */
4004 {
4008 {
4013 else
4015 }
4016 else
4018 }
4021 }
4023 /* Look inside EXPR into simple arithmetic operations involving constants.
4024 Return the outermost non-arithmetic or non-constant node. */
4026 tree
4028 {
4033 {
4037 {
4042 else
4044 }
4045 else
4047 }
4050 }
4052 /* Return which tree structure is used by T. */
4054 enum tree_node_structure_enum
4056 {
4059 }
4061 /* Set various status flags when building a CALL_EXPR object T. */
4063 static void
4065 {
4070 /* Calls have side-effects, except those to const or pure functions. */
4073 /* Propagate TREE_READONLY of arguments for const functions. */
4079 {
4085 }
4089 }
4090 \f
4091 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4092 size or offset that depends on a field within a record. */
4094 bool
4096 {
4107 {
4109 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4110 position computations since they will be converted into a
4111 WITH_RECORD_EXPR involving the reference, which will assume
4112 here will be valid. */
4126 {
4128 /* Ignoring the first operand isn't quite right, but works best. */
4137 /* The save_expr function never wraps anything containing
4138 a PLACEHOLDER_EXPR. */
4143 }
4146 {
4154 }
4158 {
4160 {
4161 const_tree arg;
4162 const_call_expr_arg_iterator iter;
4167 }
4170 }
4174 }
4176 }
4178 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4179 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4180 field positions. */
4182 static bool
4184 {
4185 /* If the size contains a placeholder or the parent type (component type in
4186 the case of arrays) type involves a placeholder, this type does. */
4194 /* Now do type-specific checks. Note that the last part of the check above
4195 greatly limits what we have to do below. */
4197 {
4216 /* Here we just check the bounds. */
4221 /* We have already checked the component type above, so just check
4222 the domain type. Flexible array members have a null domain. */
4229 {
4230 tree field;
4241 }
4245 }
4246 }
4248 /* Wrapper around above function used to cache its result. */
4250 bool
4252 {
4255 /* If the contains_placeholder_bits field has been initialized,
4256 then we know the answer. */
4260 /* Indicate that we've seen this type node, and the answer is false.
4261 This is what we want to return if we run into recursion via fields. */
4264 /* Compute the real value. */
4267 /* Store the real value. */
4271 }
4272 \f
4273 /* Push tree EXP onto vector QUEUE if it is not already present. */
4275 static void
4277 {
4279 tree iter;
4287 }
4289 /* Given a tree EXP, find all occurrences of references to fields
4290 in a PLACEHOLDER_EXPR and place them in vector REFS without
4291 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4292 we assume here that EXP contains only arithmetic expressions
4293 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4294 argument list. */
4296 void
4298 {
4300 tree inner;
4303 /* We handle TREE_LIST and COMPONENT_REF separately. */
4305 {
4308 }
4310 {
4314 ;
4318 else
4320 }
4321 else
4323 {
4328 /* Variables allocated to static storage can stay. */
4334 /* This is the pattern built in ada/make_aligning_type. */
4337 {
4340 }
4342 /* Fall through. */
4360 }
4361 }
4363 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4364 return a tree with all occurrences of references to F in a
4365 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4366 CONST_DECLs. Note that we assume here that EXP contains only
4367 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4368 occurring only in their argument list. */
4370 tree
4372 {
4375 tree new_tree;
4377 /* We handle TREE_LIST and COMPONENT_REF separately. */
4379 {
4386 }
4388 {
4389 tree inner;
4391 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4392 and it is the right field, replace it with R. */
4396 ;
4398 /* The field. */
4404 /* If this expression hasn't been completed let, leave it alone. */
4412 new_tree
4414 }
4415 else
4417 {
4424 else
4431 /* Fall through. */
4439 {
4484 new_tree
4490 }
4494 {
4499 /* If we are trying to replace F with a constant or with another
4500 instance of one of the arguments of the call, inline back
4501 functions which do nothing else than computing a value from
4502 the arguments they are passed. This makes it possible to
4503 fold partially or entirely the replacement expression. */
4505 {
4509 else
4512 {
4515 }
4517 {
4521 }
4522 }
4525 {
4529 {
4533 }
4534 }
4537 {
4541 }
4542 else
4544 }
4549 }
4557 }
4559 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4560 for it within OBJ, a tree that is an object or a chain of references. */
4562 tree
4564 {
4567 tree new_tree;
4569 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4570 in the chain of OBJ. */
4572 {
4574 tree elt;
4604 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4605 survives until RTL generation, there will be an error. */
4607 }
4609 /* TREE_LIST is special because we need to look at TREE_VALUE
4610 and TREE_CHAIN, not TREE_OPERANDS. */
4612 {
4619 }
4620 else
4622 {
4635 {
4680 new_tree
4686 }
4690 {
4696 {
4700 {
4704 }
4705 }
4708 {
4712 }
4713 else
4715 }
4720 }
4728 }
4729 \f
4731 /* Subroutine of stabilize_reference; this is called for subtrees of
4732 references. Any expression with side-effects must be put in a SAVE_EXPR
4733 to ensure that it is only evaluated once.
4735 We don't put SAVE_EXPR nodes around everything, because assigning very
4736 simple expressions to temporaries causes us to miss good opportunities
4737 for optimizations. Among other things, the opportunity to fold in the
4738 addition of a constant into an addressing mode often gets lost, e.g.
4739 "y[i+1] += x;". In general, we take the approach that we should not make
4740 an assignment unless we are forced into it - i.e., that any non-side effect
4741 operator should be allowed, and that cse should take care of coalescing
4742 multiple utterances of the same expression should that prove fruitful. */
4744 static tree
4746 {
4747 tree result;
4750 /* We cannot ignore const expressions because it might be a reference
4751 to a const array but whose index contains side-effects. But we can
4752 ignore things that are actual constant or that already have been
4753 handled by this function. */
4759 {
4761 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4762 have side-effects. */
4765 /* FALLTHRU */
4773 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4774 so that it will only be evaluated once. */
4775 /* The reference (r) and comparison (<) classes could be handled as
4776 below, but it is generally faster to only evaluate them once. */
4782 /* Constants need no processing. In fact, we should never reach
4783 here. */
4787 /* Division is slow and tends to be compiled with jumps,
4788 especially the division by powers of 2 that is often
4789 found inside of an array reference. So do it just once. */
4795 /* Recursively stabilize each operand. */
4801 /* Recursively stabilize each operand. */
4807 }
4815 }
4817 /* Stabilize a reference so that we can use it any number of times
4818 without causing its operands to be evaluated more than once.
4819 Returns the stabilized reference. This works by means of save_expr,
4820 so see the caveats in the comments about save_expr.
4822 Also allows conversion expressions whose operands are references.
4823 Any other kind of expression is returned unchanged. */
4825 tree
4827 {
4828 tree result;
4832 {
4836 /* No action is needed in this case. */
4839 CASE_CONVERT:
4878 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4879 it wouldn't be ignored. This matters when dealing with
4880 volatiles. */
4883 /* If arg isn't a kind of lvalue we recognize, make no change.
4884 Caller should recognize the error for an invalid lvalue. */
4890 }
4899 }
4900 \f
4901 /* Low-level constructors for expressions. */
4903 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4904 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4906 void
4908 {
4909 tree node;
4914 /* We started out assuming this address is both invariant and constant, but
4915 does not have side effects. Now go down any handled components and see if
4916 any of them involve offsets that are either non-constant or non-invariant.
4917 Also check for side-effects.
4919 ??? Note that this code makes no attempt to deal with the case where
4920 taking the address of something causes a copy due to misalignment. */
4922 #define UPDATE_FLAGS(NODE) \
4923 do { tree _node = (NODE); \
4924 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4925 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4929 {
4930 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4931 array reference (probably made temporarily by the G++ front end),
4932 so ignore all the operands. */
4936 {
4942 }
4943 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4944 FIELD_DECL, apparently. The G++ front end can put something else
4945 there, at least temporarily. */
4948 {
4951 }
4952 }
4956 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4957 the address, since &(*a)->b is a form of addition. If it's a constant, the
4958 address is constant too. If it's a decl, its address is constant if the
4959 decl is static. Everything else is not constant and, furthermore,
4960 taking the address of a volatile variable is not volatile. */
4965 ;
4968 else
4969 {
4972 }
4977 #undef UPDATE_FLAGS
4978 }
4980 /* Build an expression of code CODE, data type TYPE, and operands as
4981 specified. Expressions and reference nodes can be created this way.
4982 Constants, decls, types and misc nodes cannot be.
4984 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4985 enough for all extant tree codes. */
4987 tree
4989 {
4990 tree t;
4998 }
5000 tree
5002 {
5004 tree t;
5020 {
5023 }
5026 {
5029 }
5031 {
5033 /* All of these have side-effects, no matter what their
5034 operands are. */
5040 /* Whether a dereference is readonly has nothing to do with whether
5041 its operand is readonly. */
5059 }
5062 }
5064 #define PROCESS_ARG(N) \
5065 do { \
5066 TREE_OPERAND (t, N) = arg##N; \
5067 if (arg##N &&!TYPE_P (arg##N)) \
5068 { \
5069 if (TREE_SIDE_EFFECTS (arg##N)) \
5070 side_effects = 1; \
5071 if (!TREE_READONLY (arg##N) \
5072 && !CONSTANT_CLASS_P (arg##N)) \
5073 (void) (read_only = 0); \
5074 if (!TREE_CONSTANT (arg##N)) \
5075 (void) (constant = 0); \
5076 } \
5077 } while (0)
5079 tree
5081 {
5083 tree t;
5089 /* When sizetype precision doesn't match that of pointers
5090 we need to be able to build explicit extensions or truncations
5091 of the offset argument. */
5103 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5104 result based on those same flags for the arguments. But if the
5105 arguments aren't really even `tree' expressions, we shouldn't be trying
5106 to do this. */
5108 /* Expressions without side effects may be constant if their
5109 arguments are as well. */
5116 {
5130 }
5137 {
5139 {
5143 }
5144 }
5145 else
5146 {
5148 /* Don't mark X / 0 as constant. */
5153 }
5156 }
5159 tree
5161 tree arg2 MEM_STAT_DECL)
5162 {
5164 tree t;
5174 /* As a special exception, if COND_EXPR has NULL branches, we
5175 assume that it is a gimple statement and always consider
5176 it to have side effects. */
5182 else
5198 }
5200 tree
5203 {
5205 tree t;
5225 }
5227 tree
5230 {
5232 tree t;
5249 {
5251 {
5255 }
5256 }
5257 else
5263 }
5265 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5266 on the pointer PTR. */
5268 tree
5270 {
5273 tree tem;
5274 /* For convenience allow addresses that collapse to a simple base
5275 and offset. */
5279 {
5283 {
5286 }
5287 else
5290 }
5295 }
5297 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5299 poly_offset_int
5301 {
5303 SIGNED);
5304 }
5306 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5307 offsetted by OFFSET units. */
5309 tree
5311 {
5318 }
5320 /* Similar except don't specify the TREE_TYPE
5321 and leave the TREE_SIDE_EFFECTS as 0.
5322 It is permissible for arguments to be null,
5323 or even garbage if their values do not matter. */
5325 tree
5327 {
5328 tree t;
5345 }
5347 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5348 tree vec. */
5350 tree
5352 {
5362 }
5363 \f
5364 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5365 and data type TYPE.
5366 We do NOT enter this node in any sort of symbol table.
5368 LOC is the location of the decl.
5370 layout_decl is used to set up the decl's storage layout.
5371 Other slots are initialized to 0 or null pointers. */
5373 tree
5375 tree type MEM_STAT_DECL)
5376 {
5377 tree t;
5382 /* if (type == error_mark_node)
5383 type = integer_type_node; */
5384 /* That is not done, deliberately, so that having error_mark_node
5385 as the type can suppress useless errors in the use of this variable. */
5394 }
5396 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5398 tree
5400 {
5406 }
5408 /* Builds and returns function declaration with NAME and TYPE. */
5410 tree
5412 {
5422 }
5426 /* Builds a new translation-unit decl with name NAME, queues it in the
5427 global list of translation-unit decls and returns it. */
5429 tree
5431 {
5437 }
5439 \f
5440 /* BLOCK nodes are used to represent the structure of binding contours
5441 and declarations, once those contours have been exited and their contents
5442 compiled. This information is used for outputting debugging info. */
5444 tree
5446 {
5454 }
5456 \f
5457 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5459 LOC is the location to use in tree T. */
5461 void
5463 {
5467 {
5471 }
5472 }
5474 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5475 UNKNOWN_LOCATION. */
5477 void
5479 {
5483 }
5484 \f
5485 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5486 of the various TYPE_QUAL values. */
5488 static void
5490 {
5496 }
5498 /* Returns true iff CAND and BASE have equivalent language-specific
5499 qualifiers. */
5501 bool
5503 {
5506 /* type_hash_eq currently only applies to these types. */
5511 }
5513 /* This function checks to see if TYPE matches the size one of the built-in
5514 atomic types, and returns that core atomic type. */
5516 static tree
5518 {
5519 tree base_atomic_type;
5521 /* Only handle complete types. */
5526 {
5549 }
5552 }
5554 /* Returns true iff unqualified CAND and BASE are equivalent. */
5556 bool
5558 {
5560 /* Apparently this is needed for Objective-C. */
5565 /* Check alignment. */
5569 /* Atomic types increase minimal alignment. We must to do so as well
5570 or we get duplicated canonical types. See PR88686. */
5572 {
5573 /* See if this object can map to a basic atomic type. */
5577 }
5579 }
5581 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5583 bool
5585 {
5589 }
5591 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5593 static bool
5595 {
5598 /* Apparently this is needed for Objective-C. */
5600 /* Check alignment. */
5602 /* Check this is a user-aligned type as build_aligned_type
5603 would create. */
5608 }
5610 /* Return a version of the TYPE, qualified as indicated by the
5611 TYPE_QUALS, if one exists. If no qualified version exists yet,
5612 return NULL_TREE. */
5614 tree
5616 {
5624 /* Search the chain of variants to see if there is already one there just
5625 like the one we need to have. If so, use that existing one. We must
5626 preserve the TYPE_NAME, since there is code that depends on this. */
5629 {
5630 /* Put the found variant at the head of the variant list so
5631 frequently searched variants get found faster. The C++ FE
5632 benefits greatly from this. */
5638 }
5641 }
5643 /* Like get_qualified_type, but creates the type if it does not
5644 exist. This function never returns NULL_TREE. */
5646 tree
5648 {
5649 tree t;
5651 /* See if we already have the appropriate qualified variant. */
5654 /* If not, build it. */
5656 {
5661 {
5662 /* See if this object can map to a basic atomic type. */
5665 {
5666 /* Ensure the alignment of this type is compatible with
5667 the required alignment of the atomic type. */
5670 }
5671 }
5674 /* Propagate structural equality. */
5677 /* Build the underlying canonical type, since it is different
5678 from TYPE. */
5679 {
5682 }
5683 else
5684 /* T is its own canonical type. */
5687 }
5690 }
5692 /* Create a variant of type T with alignment ALIGN. */
5694 tree
5696 {
5697 tree t;
5712 }
5714 /* Create a new distinct copy of TYPE. The new type is made its own
5715 MAIN_VARIANT. If TYPE requires structural equality checks, the
5716 resulting type requires structural equality checks; otherwise, its
5717 TYPE_CANONICAL points to itself. */
5719 tree
5721 {
5727 /* Set the canonical type either to a new equivalence class, or
5728 propagate the need for structural equality checks. */
5731 else
5734 /* Make it its own variant. */
5738 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5739 whose TREE_TYPE is not t. This can also happen in the Ada
5740 frontend when using subtypes. */
5743 }
5745 /* Create a new variant of TYPE, equivalent but distinct. This is so
5746 the caller can modify it. TYPE_CANONICAL for the return type will
5747 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5748 are considered equal by the language itself (or that both types
5749 require structural equality checks). */
5751 tree
5753 {
5758 /* Since we're building a variant, assume that it is a non-semantic
5759 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5761 /* Type variants have no alias set defined. */
5764 /* Add the new type to the chain of variants of TYPE. */
5770 }
5771 \f
5772 /* Return true if the from tree in both tree maps are equal. */
5774 int
5776 {
5780 }
5782 /* Hash a from tree in a tree_base_map. */
5784 unsigned int
5786 {
5788 }
5790 /* Return true if this tree map structure is marked for garbage collection
5791 purposes. We simply return true if the from tree is marked, so that this
5792 structure goes away when the from tree goes away. */
5794 bool
5796 {
5798 }
5800 /* Hash a from tree in a tree_map. */
5802 unsigned int
5804 {
5806 }
5808 /* Hash a from tree in a tree_decl_map. */
5810 unsigned int
5812 {
5814 }
5816 /* Return the initialization priority for DECL. */
5818 priority_type
5820 {
5825 return
5827 }
5829 /* Return the finalization priority for DECL. */
5831 priority_type
5833 {
5838 return
5840 }
5842 /* Set the initialization priority for DECL to PRIORITY. */
5844 void
5846 {
5850 {
5854 }
5857 else
5860 }
5862 /* Set the finalization priority for DECL to PRIORITY. */
5864 void
5866 {
5870 {
5874 }
5875 else
5878 }
5880 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5882 static void
5884 {
5889 }
5891 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5893 static void
5895 {
5900 }
5902 /* Lookup a debug expression for FROM, and return it if we find one. */
5904 tree
5906 {
5914 }
5916 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5918 void
5920 {
5927 }
5929 /* Lookup a value expression for FROM, and return it if we find one. */
5931 tree
5933 {
5941 }
5943 /* Insert a mapping FROM->TO in the value expression hashtable. */
5945 void
5947 {
5950 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5957 }
5959 /* Lookup a vector of debug arguments for FROM, and return it if we
5960 find one. */
5964 {
5975 }
5977 /* Insert a mapping FROM->empty vector of debug arguments in the value
5978 expression hashtable. */
5982 {
5997 }
5999 /* Hashing of types so that we don't make duplicates.
6000 The entry point is `type_hash_canon'. */
6002 /* Generate the default hash code for TYPE. This is designed for
6003 speed, rather than maximum entropy. */
6005 hashval_t
6007 {
6016 /* Just the identifier is adequate to distinguish. */
6020 {
6023 /* FALLTHROUGH. */
6035 {
6039 {
6042 }
6043 }
6047 {
6054 }
6057 {
6063 }
6067 {
6071 }
6079 }
6082 }
6084 /* These are the Hashtable callback functions. */
6086 /* Returns true iff the types are equivalent. */
6088 bool
6090 {
6091 /* First test the things that are the same for all types. */
6101 /* Be careful about comparing arrays before and after the element type
6102 has been completed; don't compare TYPE_ALIGN unless both types are
6103 complete. */
6110 {
6133 /* fall through */
6170 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6171 where the flag should be inherited from the element type
6172 and can change after ARRAY_TYPEs are created; on non-aggregates
6173 compare it and hash it, scalars will never have that flag set
6174 and we need to differentiate between arrays created by different
6175 front-ends or middle-end created arrays. */
6207 }
6213 }
6215 /* Given TYPE, and HASHCODE its hash code, return the canonical
6216 object for an identical type if one already exists.
6217 Otherwise, return TYPE, and record it as the canonical object.
6219 To use this function, first create a type of the sort you want.
6220 Then compute its hash code from the fields of the type that
6221 make it different from other similar types.
6222 Then call this function and use the value. */
6224 tree
6226 {
6227 type_hash in;
6230 /* The hash table only contains main variants, so ensure that's what we're
6231 being passed. */
6234 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6235 must call that routine before comparing TYPE_ALIGNs. */
6243 {
6249 /* Free also min/max values and the cache for integer
6250 types. This can't be done in free_node, as LTO frees
6251 those on its own. */
6253 {
6256 {
6257 /* Zero is always in TYPE_CACHED_VALUES. */
6261 }
6264 {
6267 }
6270 }
6273 }
6274 else
6275 {
6284 }
6285 }
6287 static void
6289 {
6294 }
6296 /* Given two lists of types
6297 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6298 return 1 if the lists contain the same types in the same order.
6299 Also, the TREE_PURPOSEs must match. */
6301 bool
6303 {
6315 }
6317 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6318 given by TYPE. If the argument list accepts variable arguments,
6319 then this function counts only the ordinary arguments. */
6321 int
6323 {
6327 /* If the function does not take a variable number of arguments,
6328 the last element in the list will have type `void'. */
6331 else
6335 }
6337 /* Return the type of the function TYPE's argument ARGNO if known.
6338 For vararg function's where ARGNO refers to one of the variadic
6339 arguments return null. Otherwise, return a void_type_node for
6340 out-of-bounds ARGNO. */
6342 tree
6344 {
6345 /* Treat zero the same as an out-of-bounds argument number. */
6349 function_args_iterator iter;
6351 tree argtype;
6354 {
6355 /* A vararg function's argument list ends in a null. Otherwise,
6356 an ordinary function's argument list ends with void. Return
6357 null if ARGNO refers to a vararg argument, void_type_node if
6358 it's out of bounds, and the formal argument type otherwise. */
6366 }
6369 }
6371 /* True if integer constants T1 and T2
6372 represent the same constant value. */
6374 bool
6376 {
6392 }
6394 /* Return true if T is an INTEGER_CST whose numerical value (extended
6395 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6397 bool
6399 {
6403 }
6405 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6406 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6408 bool
6410 {
6414 {
6419 }
6422 }
6424 /* Return true if T is an INTEGER_CST whose numerical value (extended
6425 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6427 bool
6429 {
6433 }
6435 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6436 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6438 bool
6440 {
6444 {
6449 }
6452 }
6454 /* T is an INTEGER_CST whose numerical value (extended according to
6455 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6456 HOST_WIDE_INT. */
6458 HOST_WIDE_INT
6460 {
6463 }
6465 /* T is an INTEGER_CST whose numerical value (extended according to
6466 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6467 HOST_WIDE_INT. */
6469 unsigned HOST_WIDE_INT
6471 {
6474 }
6476 /* Return the most significant (sign) bit of T. */
6478 int
6480 {
6484 }
6486 /* Return an indication of the sign of the integer constant T.
6487 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6488 Note that -1 will never be returned if T's type is unsigned. */
6490 int
6492 {
6499 else
6501 }
6503 /* Return the minimum number of bits needed to represent VALUE in a
6504 signed or unsigned type, UNSIGNEDP says which. */
6506 unsigned int
6508 {
6509 /* If the value is negative, compute its negative minus 1. The latter
6510 adjustment is because the absolute value of the largest negative value
6511 is one larger than the largest positive value. This is equivalent to
6512 a bit-wise negation, so use that operation instead. */
6517 /* Return the number of bits needed, taking into account the fact
6518 that we need one more bit for a signed than unsigned type.
6519 If value is 0 or -1, the minimum precision is 1 no matter
6520 whether unsignedp is true or false. */
6524 else
6526 }
6528 /* Return truthvalue of whether T1 is the same tree structure as T2.
6529 Return 1 if they are the same.
6530 Return 0 if they are understandably different.
6531 Return -1 if either contains tree structure not understood by
6532 this function. */
6534 int
6536 {
6546 /* For location wrappers to be the same, they must be at the same
6547 source location (and wrap the same thing). */
6549 {
6553 }
6559 {
6563 else
6565 }
6575 {
6591 {
6600 /* ??? Should we handle also fields here? */
6604 }
6615 {
6623 {
6627 }
6629 }
6632 /* Special case: if either target is an unallocated VAR_DECL,
6633 it means that it's going to be unified with whatever the
6634 TARGET_EXPR is really supposed to initialize, so treat it
6635 as being equivalent to anything. */
6643 else
6672 /* A false return means maybe_ne rather than known_ne. */
6678 }
6680 /* This general rule works for most tree codes. All exceptions should be
6681 handled above. If this is a language-specific tree code, we can't
6682 trust what might be in the operand, so say we don't know
6683 the situation. */
6688 {
6697 {
6701 }
6707 }
6708 }
6710 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6711 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6712 than U, respectively. */
6714 int
6716 {
6725 else
6727 }
6729 /* Return true if SIZE represents a constant size that is in bounds of
6730 what the middle-end and the backend accepts (covering not more than
6731 half of the address-space).
6732 When PERR is non-null, set *PERR on failure to the description of
6733 why SIZE is not valid. */
6735 bool
6737 {
6739 {
6746 }
6748 cst_size_error error;
6753 {
6756 }
6759 {
6762 }
6765 {
6768 }
6772 {
6775 }
6778 }
6780 /* Return the precision of the type, or for a complex or vector type the
6781 precision of the type of its elements. */
6783 unsigned int
6785 {
6793 }
6795 /* Return true if CODE represents an associative tree code. Otherwise
6796 return false. */
6797 bool
6799 {
6801 {
6813 }
6815 }
6817 /* Return true if CODE represents a commutative tree code. Otherwise
6818 return false. */
6819 bool
6821 {
6823 {
6850 }
6852 }
6854 /* Return true if CODE represents a ternary tree code for which the
6855 first two operands are commutative. Otherwise return false. */
6856 bool
6858 {
6860 {
6868 }
6870 }
6872 /* Returns true if CODE can overflow. */
6874 bool
6876 {
6878 {
6883 /* Can overflow in various ways. */
6889 /* For INT_MIN / -1. */
6893 /* For -INT_MIN. */
6896 /* These operators cannot overflow. */
6898 }
6899 }
6901 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6902 ftrapv doesn't generate trapping insns for CODE. */
6904 bool
6906 {
6909 /* We don't generate instructions that trap on overflow for complex or vector
6910 types. */
6918 {
6924 /* These operators can overflow, and -ftrapv generates trapping code for
6925 these. */
6932 /* These operators can overflow, but -ftrapv does not generate trapping
6933 code for these. */
6936 /* These operators cannot overflow. */
6938 }
6939 }
6941 /* Constructors for pointer, array and function types.
6942 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6943 constructed by language-dependent code, not here.) */
6945 /* Construct, lay out and return the type of pointers to TO_TYPE with
6946 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6947 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6948 indicate this type can reference all of memory. If such a type has
6949 already been constructed, reuse it. */
6951 tree
6954 {
6955 tree t;
6962 {
6965 }
6967 /* If the pointed-to type has the may_alias attribute set, force
6968 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6972 /* In some cases, languages will have things that aren't a POINTER_TYPE
6973 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6974 In that case, return that type without regard to the rest of our
6975 operands.
6977 ??? This is a kludge, but consistent with the way this function has
6978 always operated and there doesn't seem to be a good way to avoid this
6979 at the moment. */
6984 /* First, if we already have a type for pointers to TO_TYPE and it's
6985 the proper mode, use it. */
6998 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7006 /* Lay out the type. This function has many callers that are concerned
7007 with expression-construction, and this simplifies them all. */
7011 }
7013 /* By default build pointers in ptr_mode. */
7015 tree
7017 {
7019 }
7021 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7023 tree
7026 {
7027 tree t;
7034 {
7037 }
7039 /* If the pointed-to type has the may_alias attribute set, force
7040 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7044 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7045 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7046 In that case, return that type without regard to the rest of our
7047 operands.
7049 ??? This is a kludge, but consistent with the way this function has
7050 always operated and there doesn't seem to be a good way to avoid this
7051 at the moment. */
7056 /* First, if we already have a type for pointers to TO_TYPE and it's
7057 the proper mode, use it. */
7070 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7081 }
7084 /* Build the node for the type of references-to-TO_TYPE by default
7085 in ptr_mode. */
7087 tree
7089 {
7091 }
7093 #define MAX_INT_CACHED_PREC \
7094 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7097 static void
7099 {
7101 {
7103 }
7104 }
7106 /* Builds a signed or unsigned integer type of precision PRECISION.
7107 Used for C bitfields whose precision does not match that of
7108 built-in target types. */
7109 tree
7112 {
7119 {
7123 }
7130 else
7140 }
7142 #define MAX_BOOL_CACHED_PREC \
7143 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7146 /* Builds a boolean type of precision PRECISION.
7147 Used for boolean vectors to choose proper vector element size. */
7148 tree
7150 {
7151 tree type;
7154 {
7158 }
7168 }
7172 /* Builds a signed or unsigned _BitInt(PRECISION) type. */
7173 tree
7175 {
7187 {
7191 }
7198 else
7208 }
7210 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7211 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7212 is true, reuse such a type that has already been constructed. */
7214 static tree
7216 {
7239 {
7240 /* Since we cannot reliably merge this type, we need to compare it using
7241 structural equality checks. */
7244 }
7250 }
7252 /* Wrapper around build_range_type_1 with SHARED set to true. */
7254 tree
7256 {
7258 }
7260 /* Wrapper around build_range_type_1 with SHARED set to false. */
7262 tree
7264 {
7266 }
7268 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7269 MAXVAL should be the maximum value in the domain
7270 (one less than the length of the array).
7272 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7273 We don't enforce this limit, that is up to caller (e.g. language front end).
7274 The limit exists because the result is a signed type and we don't handle
7275 sizes that use more than one HOST_WIDE_INT. */
7277 tree
7279 {
7281 }
7283 /* Return true if the debug information for TYPE, a subtype, should be emitted
7284 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7285 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7286 debug info and doesn't reflect the source code. */
7288 bool
7290 {
7293 /* Subrange types have a base type which is an integral type. */
7297 /* Get the real bounds of the subtype. */
7300 else
7301 {
7304 }
7306 /* If the type and its base type have the same representation and the same
7307 name, then the type is not a subrange but a copy of the base type. */
7321 }
7323 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7324 and number of elements specified by the range of values of INDEX_TYPE.
7325 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7326 If SHARED is true, reuse such a type that has already been constructed.
7327 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7329 tree
7332 {
7333 tree t;
7336 {
7339 }
7349 {
7352 }
7355 {
7364 index_type
7367 }
7370 }
7372 /* Wrapper around build_array_type_1 with SHARED set to true. */
7374 tree
7376 {
7377 return
7379 }
7381 /* Wrapper around build_array_type_1 with SHARED set to false. */
7383 tree
7385 {
7387 }
7389 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7390 sizetype. */
7392 tree
7394 {
7396 }
7398 /* Computes the canonical argument types from the argument type list
7399 ARGTYPES.
7401 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7402 on entry to this function, or if any of the ARGTYPES are
7403 structural.
7405 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7406 true on entry to this function, or if any of the ARGTYPES are
7407 non-canonical.
7409 Returns a canonical argument list, which may be ARGTYPES when the
7410 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7411 true) or would not differ from ARGTYPES. */
7413 static tree
7417 {
7418 tree arg;
7422 {
7424 /* Fail gracefully by stating that the type is structural. */
7430 /* If the argument has a default argument, we consider it
7431 non-canonical even though the type itself is canonical.
7432 That way, different variants of function and method types
7433 with default arguments will all point to the variant with
7434 no defaults as their canonical type. */
7436 }
7442 {
7443 /* Build the canonical list of argument types. */
7448 {
7451 else
7454 canon_argtypes);
7455 }
7461 /* There is a non-canonical type. */
7464 }
7466 /* The canonical argument types are the same as ARGTYPES. */
7468 }
7470 /* Construct, lay out and return
7471 the type of functions returning type VALUE_TYPE
7472 given arguments of types ARG_TYPES.
7473 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7474 are data type nodes for the arguments of the function.
7475 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7476 variable-arguments function with (...) prototype (no named arguments).
7477 If such a type has already been constructed, reuse it. */
7479 tree
7482 {
7483 tree t;
7486 tree canon_argtypes;
7491 {
7494 }
7496 /* Make a node of the sort we want. */
7501 {
7504 }
7506 /* If we already have such a type, use the old one. */
7510 /* Set up the canonical type. */
7520 canon_argtypes);
7525 }
7527 /* Build a function type. The RETURN_TYPE is the type returned by the
7528 function. If VAARGS is set, no void_type_node is appended to the
7529 list. ARGP must be always be terminated be a NULL_TREE. */
7531 static tree
7533 {
7541 {
7546 }
7549 else
7550 {
7554 }
7558 }
7560 /* Build a function type. The RETURN_TYPE is the type returned by the
7561 function. If additional arguments are provided, they are
7562 additional argument types. The list of argument types must always
7563 be terminated by NULL_TREE. */
7565 tree
7567 {
7568 tree args;
7575 }
7577 /* Build a variable argument function type. The RETURN_TYPE is the
7578 type returned by the function. If additional arguments are provided,
7579 they are additional argument types. The list of argument types must
7580 always be terminated by NULL_TREE. */
7582 tree
7584 {
7585 tree args;
7593 }
7595 /* Build a function type. RETURN_TYPE is the type returned by the
7596 function; VAARGS indicates whether the function takes varargs. The
7597 function takes N named arguments, the types of which are provided in
7598 ARG_TYPES. */
7600 static tree
7603 {
7611 }
7613 /* Build a function type. RETURN_TYPE is the type returned by the
7614 function. The function takes N named arguments, the types of which
7615 are provided in ARG_TYPES. */
7617 tree
7619 {
7621 }
7623 /* Build a variable argument function type. RETURN_TYPE is the type
7624 returned by the function. The function takes N named arguments, the
7625 types of which are provided in ARG_TYPES. */
7627 tree
7629 {
7631 }
7633 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7634 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7635 for the method. An implicit additional parameter (of type
7636 pointer-to-BASETYPE) is added to the ARGTYPES. */
7638 tree
7640 tree rettype,
7641 tree argtypes)
7642 {
7643 tree t;
7644 tree ptype;
7646 tree canon_argtypes;
7648 /* Make a node of the sort we want. */
7655 /* The actual arglist for this function includes a "hidden" argument
7656 which is "this". Put it into the list of argument types. */
7660 /* If we already have such a type, use the old one. */
7664 /* Set up the canonical type. */
7665 any_structural_p
7668 any_noncanonical_p
7680 canon_argtypes);
7685 }
7687 /* Construct, lay out and return the type of methods belonging to class
7688 BASETYPE and whose arguments and values are described by TYPE.
7689 If that type exists already, reuse it.
7690 TYPE must be a FUNCTION_TYPE node. */
7692 tree
7694 {
7700 }
7702 /* Construct, lay out and return the type of offsets to a value
7703 of type TYPE, within an object of type BASETYPE.
7704 If a suitable offset type exists already, reuse it. */
7706 tree
7708 {
7709 tree t;
7711 /* Make a node of the sort we want. */
7717 /* If we already have such a type, use the old one. */
7725 {
7734 }
7737 }
7739 /* Create a complex type whose components are COMPONENT_TYPE.
7741 If NAMED is true, the type is given a TYPE_NAME. We do not always
7742 do so because this creates a DECL node and thus make the DECL_UIDs
7743 dependent on the type canonicalization hashtable, which is GC-ed,
7744 so the DECL_UIDs would not be stable wrt garbage collection. */
7746 tree
7748 {
7753 /* Make a node of the sort we want. */
7758 /* If we already have such a type, use the old one. */
7763 {
7764 /* We created a new type. The hash insertion will have laid
7765 out the type. We need to check the canonicalization and
7766 maybe set the name. */
7777 /* We need to create a name, since complex is a fundamental type. */
7779 {
7808 }
7809 }
7812 }
7814 /* If TYPE is a real or complex floating-point type and the target
7815 does not directly support arithmetic on TYPE then return the wider
7816 type to be used for arithmetic on TYPE. Otherwise, return
7817 NULL_TREE. */
7819 tree
7821 {
7822 /* The target can give two different responses to the question of
7823 which excess precision mode it would like depending on whether we
7824 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7826 enum excess_precision_type requested_type
7828 ? EXCESS_PRECISION_TYPE_FAST
7832 enum flt_eval_method target_flt_eval_method
7835 /* The target should not ask for unpredictable float evaluation (though
7836 it might advertise that implicitly the evaluation is unpredictable,
7837 but we don't care about that here, it will have been reported
7838 elsewhere). If it does ask for unpredictable evaluation, we have
7839 nothing to do here. */
7842 /* Nothing to do. The target has asked for all types we know about
7843 to be computed with their native precision and range. */
7847 /* The target will promote this type in a target-dependent way, so excess
7848 precision ought to leave it alone. */
7852 machine_mode float16_type_mode = (float16_type_node
7855 machine_mode bfloat16_type_mode = (bfloat16_type_node
7862 {
7864 {
7867 {
7888 }
7890 }
7892 {
7897 {
7918 }
7920 }
7923 }
7926 }
7927 \f
7928 /* Return OP, stripped of any conversions to wider types as much as is safe.
7929 Converting the value back to OP's type makes a value equivalent to OP.
7931 If FOR_TYPE is nonzero, we return a value which, if converted to
7932 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7934 OP must have integer, real or enumeral type. Pointers are not allowed!
7936 There are some cases where the obvious value we could return
7937 would regenerate to OP if converted to OP's type,
7938 but would not extend like OP to wider types.
7939 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7940 For example, if OP is (unsigned short)(signed char)-1,
7941 we avoid returning (signed char)-1 if FOR_TYPE is int,
7942 even though extending that to an unsigned short would regenerate OP,
7943 since the result of extending (signed char)-1 to (int)
7944 is different from (int) OP. */
7946 tree
7948 {
7949 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7951 unsigned final_prec
7953 int uns
7960 {
7963 /* TYPE_PRECISION on vector types has different meaning
7964 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7965 so avoid them here. */
7972 /* Truncations are many-one so cannot be removed.
7973 Unless we are later going to truncate down even farther. */
7978 /* See what's inside this conversion. If we decide to strip it,
7979 we will set WIN. */
7982 /* If we have not stripped any zero-extensions (uns is 0),
7983 we can strip any kind of extension.
7984 If we have previously stripped a zero-extension,
7985 only zero-extensions can safely be stripped.
7986 Any extension can be stripped if the bits it would produce
7987 are all going to be discarded later by truncating to FOR_TYPE. */
7990 {
7993 /* TYPE_UNSIGNED says whether this is a zero-extension.
7994 Let's avoid computing it if it does not affect WIN
7995 and if UNS will not be needed again. */
7999 {
8002 }
8003 }
8004 }
8006 /* If we finally reach a constant see if it fits in sth smaller and
8007 in that case convert it. */
8009 {
8015 {
8019 }
8020 }
8023 }
8024 \f
8025 /* Return OP or a simpler expression for a narrower value
8026 which can be sign-extended or zero-extended to give back OP.
8027 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8028 or 0 if the value should be sign-extended. */
8030 tree
8032 {
8039 {
8040 do
8054 ret);
8056 }
8058 {
8059 int bitschange
8063 /* Truncations are many-one so cannot be removed. */
8067 /* See what's inside this conversion. If we decide to strip it,
8068 we will set WIN. */
8071 {
8073 /* An extension: the outermost one can be stripped,
8074 but remember whether it is zero or sign extension. */
8077 /* Otherwise, if a sign extension has been stripped,
8078 only sign extensions can now be stripped;
8079 if a zero extension has been stripped, only zero-extensions. */
8083 }
8085 {
8086 /* A change in nominal type can always be stripped, but we must
8087 preserve the unsignedness. */
8092 /* Keep trying to narrow, but don't assign op to win if it
8093 would turn an integral type into something else. */
8096 }
8099 }
8102 /* Since type_for_size always gives an integer type. */
8105 /* Ensure field is laid out already. */
8108 {
8109 unsigned HOST_WIDE_INT innerprec
8115 /* We can get this structure field in a narrower type that fits it,
8116 but the resulting extension to its nominal type (a fullword type)
8117 must satisfy the same conditions as for other extensions.
8119 Do this only for fields that are aligned (not bit-fields),
8120 because when bit-field insns will be used there is no
8121 advantage in doing this. */
8127 {
8131 }
8132 }
8136 }
8137 \f
8138 /* Return true if integer constant C has a value that is permissible
8139 for TYPE, an integral type. */
8141 bool
8143 {
8148 /* Non-standard boolean types can have arbitrary precision but various
8149 transformations assume that they can only take values 0 and +/-1. */
8153 retry:
8157 /* If at least one bound of the type is a constant integer, we can check
8158 ourselves and maybe make a decision. If no such decision is possible, but
8159 this type is a subtype, try checking against that. Otherwise, use
8160 fits_to_tree_p, which checks against the precision.
8162 Compute the status for each possibly constant bound, and return if we see
8163 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8164 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8165 for "constant known to fit". */
8167 /* Check if c >= type_low_bound. */
8169 {
8173 }
8174 else
8177 /* Check if c <= type_high_bound. */
8179 {
8183 }
8184 else
8187 /* If the constant fits both bounds, the result is known. */
8191 /* Perform some generic filtering which may allow making a decision
8192 even if the bounds are not constant. First, negative integers
8193 never fit in unsigned types, */
8197 /* Second, narrower types always fit in wider ones. */
8201 /* Third, unsigned integers with top bit set never fit signed types. */
8203 {
8206 {
8207 /* When a tree_cst is converted to a wide-int, the precision
8208 is taken from the type. However, if the precision of the
8209 mode underneath the type is smaller than that, it is
8210 possible that the value will not fit. The test below
8211 fails if any bit is set between the sign bit of the
8212 underlying mode and the top bit of the type. */
8215 }
8218 }
8220 /* If we haven't been able to decide at this point, there nothing more we
8221 can check ourselves here. Look at the base type if we have one and it
8222 has the same precision. */
8226 {
8229 }
8231 /* Or to fits_to_tree_p, if nothing else. */
8233 }
8235 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8236 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8237 represented (assuming two's-complement arithmetic) within the bit
8238 precision of the type are returned instead. */
8240 void
8242 {
8246 else
8247 {
8250 else
8251 {
8254 }
8255 }
8260 else
8261 {
8264 }
8265 }
8267 /* Return true if VAR is an automatic variable. */
8269 bool
8271 {
8276 }
8278 /* Return true if VAR is an automatic variable defined in function FN. */
8280 bool
8282 {
8286 }
8288 /* Subprogram of following function. Called by walk_tree.
8290 Return *TP if it is an automatic variable or parameter of the
8291 function passed in as DATA. */
8293 static tree
8295 {
8306 }
8308 /* Returns true if T is, contains, or refers to a type with variable
8309 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8310 arguments, but not the return type. If FN is nonzero, only return
8311 true if a modifier of the type or position of FN is a variable or
8312 parameter inside FN.
8314 This concept is more general than that of C99 'variably modified types':
8315 in C99, a struct type is never variably modified because a VLA may not
8316 appear as a structure member. However, in GNU C code like:
8318 struct S { int i[f()]; };
8320 is valid, and other languages may define similar constructs. */
8322 bool
8324 {
8325 tree t;
8327 /* Test if T is either variable (if FN is zero) or an expression containing
8328 a variable in FN. If TYPE isn't gimplified, return true also if
8329 gimplify_one_sizepos would gimplify the expression into a local
8330 variable. */
8331 #define RETURN_TRUE_IF_VAR(T) \
8332 do { tree _t = (T); \
8333 if (_t != NULL_TREE \
8334 && _t != error_mark_node \
8335 && !CONSTANT_CLASS_P (_t) \
8336 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8337 && (!fn \
8338 || (!TYPE_SIZES_GIMPLIFIED (type) \
8339 && (TREE_CODE (_t) != VAR_DECL \
8340 && !CONTAINS_PLACEHOLDER_P (_t))) \
8341 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8342 return true; } while (0)
8347 /* If TYPE itself has variable size, it is variably modified. */
8352 {
8356 /* Ada can have pointer types refering to themselves indirectly. */
8361 {
8364 }
8370 /* If TYPE is a function type, it is variably modified if the
8371 return type is variably modified. */
8381 /* Scalar types are variably modified if their end points
8382 aren't constant. */
8390 /* We can't see if any of the fields are variably-modified by the
8391 definition we normally use, since that would produce infinite
8392 recursion via pointers. */
8393 /* This is variably modified if some field's type is. */
8396 {
8401 /* If the type is a qualified union, then the DECL_QUALIFIER
8402 of fields can also be an expression containing a variable. */
8406 /* If the field is a qualified union, then it's only a container
8407 for what's inside so we look into it. That's necessary in LTO
8408 mode because the sizes of the field tested above have been set
8409 to PLACEHOLDER_EXPRs by free_lang_data. */
8413 }
8417 /* Do not call ourselves to avoid infinite recursion. This is
8418 variably modified if the element type is. */
8425 }
8427 /* The current language may have other cases to check, but in general,
8428 all other types are not variably modified. */
8431 #undef RETURN_TRUE_IF_VAR
8432 }
8434 /* Given a DECL or TYPE, return the scope in which it was declared, or
8435 NULL_TREE if there is no containing scope. */
8437 tree
8439 {
8441 }
8443 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8445 const_tree
8447 {
8449 {
8452 else
8454 }
8456 }
8458 /* Return the innermost context enclosing DECL that is
8459 a FUNCTION_DECL, or zero if none. */
8461 tree
8463 {
8464 tree context;
8469 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8470 where we look up the function at runtime. Such functions always take
8471 a first argument of type 'pointer to real context'.
8473 C++ should really be fixed to use DECL_CONTEXT for the real context,
8474 and use something else for the "virtual context". */
8476 context
8477 = TYPE_MAIN_VARIANT
8479 else
8483 {
8486 else
8488 }
8491 }
8493 /* Return the innermost context enclosing DECL that is
8494 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8495 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8497 tree
8499 {
8504 {
8525 }
8528 }
8530 /* CALL is a CALL_EXPR. Return the declaration for the function
8531 called, or NULL_TREE if the called function cannot be
8532 determined. */
8534 tree
8536 {
8537 tree addr;
8542 /* It's invalid to call this function with anything but a
8543 CALL_EXPR. */
8546 /* The first operand to the CALL is the address of the function
8547 called. */
8550 /* If there is no function, return early. */
8556 /* If this is a readonly function pointer, extract its initial value. */
8562 /* If the address is just `&f' for some function `f', then we know
8563 that `f' is being called. */
8568 /* We couldn't figure out what was being called. */
8570 }
8572 /* Return true when STMTs arguments and return value match those of FNDECL,
8573 a decl of a builtin function. */
8575 static bool
8577 {
8595 {
8596 /* Variadic args follow. */
8604 {
8605 /* For pointer arguments be more forgiving, e.g. due to
8606 FILE * vs. fileptr_type_node, or say char * vs. const char *
8607 differences etc. */
8613 /* char/short integral arguments are promoted to int
8614 by several frontends if targetm.calls.promote_prototypes
8615 is true. Allow such promotion too. */
8621 && (gimple_form
8628 }
8629 }
8633 }
8635 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8636 return the associated function code, otherwise return CFN_LAST. */
8638 combined_fn
8640 {
8641 /* It's invalid to call this function with anything but a CALL_EXPR. */
8654 }
8656 /* Comparator of indices based on tree_node_counts. */
8658 static int
8660 {
8665 }
8667 /* Comparator of indices based on tree_code_counts. */
8669 static int
8671 {
8676 }
8678 #define TREE_MEM_USAGE_SPACES 40
8680 /* Print debugging information about tree nodes generated during the compile,
8681 and any language-specific information. */
8683 void
8685 {
8687 {
8693 {
8700 {
8707 }
8712 }
8714 {
8724 {
8729 }
8736 }
8737 }
8738 else
8745 }
8746 \f
8749 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8751 unsigned
8753 {
8754 /* This relies on the raw feedback's top 4 bits being zero. */
8755 #define FEEDBACK(X) ((X) * 0x04c11db7)
8756 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8757 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8759 {
8764 };
8765 #undef FEEDBACK
8766 #undef SYNDROME
8770 {
8774 }
8777 }
8779 /* Generate a crc32 of a string. */
8781 unsigned
8783 {
8784 do
8788 }
8790 /* P is a string that will be used in a symbol. Mask out any characters
8791 that are not valid in that context. */
8793 void
8795 {
8800 #endif
8803 #endif
8804 ))
8806 }
8810 /* Create a unique anonymous identifier. The identifier is still a
8811 valid assembly label. */
8813 tree
8815 {
8817 #if !defined (NO_DOT_IN_LABEL)
8818 "."
8819 #elif !defined (NO_DOLLAR_IN_LABEL)
8820 "$"
8821 #else
8822 "_"
8823 #endif
8834 }
8836 /* Generate a name for a special-purpose function.
8837 The generated name may need to be unique across the whole link.
8838 Changes to this function may also require corresponding changes to
8839 xstrdup_mask_random.
8840 TYPE is some string to identify the purpose of this function to the
8841 linker or collect2; it must start with an uppercase letter,
8842 one of:
8843 I - for constructors
8844 D - for destructors
8845 N - for C++ anonymous namespaces
8846 F - for DWARF unwind frame information. */
8848 tree
8850 {
8855 /* If we already have a name we know to be unique, just use that. */
8858 /* If the target is handling the constructors/destructors, they
8859 will be local to this file and the name is only necessary for
8860 debugging purposes.
8861 We also assign sub_I and sub_D sufixes to constructors called from
8862 the global static constructors. These are always local. */
8866 {
8870 /* Just use the file's basename, because the full pathname
8871 might be quite long. */
8873 }
8874 else
8875 {
8876 /* Otherwise, the name must be unique across the entire link.
8877 We don't have anything that we know to be unique to this translation
8878 unit, so use what we do have and throw in some randomness. */
8896 }
8902 /* Set up the name of the file-level functions we may need.
8903 Use a global object (which is already required to be unique over
8904 the program) rather than the file name (which imposes extra
8905 constraints). */
8909 }
8910 \f
8911 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8913 /* Complain that the tree code of NODE does not match the expected 0
8914 terminated list of trailing codes. The trailing code list can be
8915 empty, for a more vague error message. FILE, LINE, and FUNCTION
8916 are of the caller. */
8918 void
8921 {
8932 {
8939 {
8946 }
8948 }
8949 else
8955 }
8957 /* Complain that the tree code of NODE does match the expected 0
8958 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8959 the caller. */
8961 void
8964 {
8978 {
8980 {
8983 }
8986 }
8992 }
8994 /* Similar to tree_check_failed, except that we check for a class of tree
8995 code, given in CL. */
8997 void
9000 {
9001 internal_error
9006 }
9008 /* Similar to tree_check_failed, except that instead of specifying a
9009 dozen codes, use the knowledge that they're all sequential. */
9011 void
9015 {
9028 {
9035 }
9040 }
9043 /* Similar to tree_check_failed, except that we check that a tree does
9044 not have the specified code, given in CL. */
9046 void
9049 {
9050 internal_error
9055 }
9058 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9060 void
9063 {
9069 }
9072 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9074 void
9078 {
9091 {
9098 }
9103 }
9106 #undef DEFTREESTRUCT
9107 #define DEFTREESTRUCT(VAL, NAME) NAME,
9111 };
9112 #undef DEFTREESTRUCT
9114 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9116 /* Similar to tree_class_check_failed, except that we check for
9117 whether CODE contains the tree structure identified by EN. */
9119 void
9124 {
9125 internal_error
9129 }
9132 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9133 (dynamically sized) vector. */
9135 void
9138 {
9139 internal_error
9143 }
9145 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9146 (dynamically sized) vector. */
9148 void
9151 {
9152 internal_error
9155 }
9157 /* Similar to above, except that the check is for the bounds of the operand
9158 vector of an expression node EXP. */
9160 void
9163 {
9165 internal_error
9169 }
9171 /* Similar to above, except that the check is for the number of
9172 operands of an OMP_CLAUSE node. */
9174 void
9177 {
9178 internal_error
9183 }
9185 \f
9186 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9187 and mapped to the machine mode MODE. Initialize its fields and build
9188 the information necessary for debugging output. */
9190 static tree
9192 {
9193 tree t;
9214 /* We have built a main variant, based on the main variant of the
9215 inner type. Use it to build the variant we return. */
9223 }
9225 static tree
9227 {
9250 else
9252 }
9254 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9256 static tree
9258 {
9260 {
9272 }
9273 else
9274 {
9286 }
9289 }
9291 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9293 static tree
9295 {
9297 {
9309 }
9310 else
9311 {
9323 }
9326 }
9329 /* Create an atomic variant node for TYPE. This routine is called
9330 during initialization of data types to create the 5 basic atomic
9331 types. The generic build_variant_type function requires these to
9332 already be set up in order to function properly, so cannot be
9333 called from there. If ALIGN is non-zero, then ensure alignment is
9334 overridden to this value. */
9336 static tree
9338 {
9339 tree t;
9341 /* Make sure its not already registered. */
9352 }
9354 /* Information about the _FloatN and _FloatNx types. This must be in
9355 the same order as the corresponding TI_* enum values. */
9357 {
9365 };
9368 /* Create nodes for all integer types (and error_mark_node) using the sizes
9369 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9371 void
9373 {
9381 /* Define both `signed char' and `unsigned char'. */
9387 /* Define `char', which is like either `signed char' or `unsigned char'
9388 but not the same as either. */
9389 char_type_node
9390 = (signed_char
9405 {
9410 {
9413 }
9414 }
9416 /* Define a boolean type. This type only represents boolean values but
9417 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9423 /* Define what type to use for size_t. */
9432 else
9433 {
9439 {
9446 {
9448 }
9449 }
9452 }
9454 /* Define what type to use for ptrdiff_t. */
9463 else
9464 {
9468 {
9476 }
9479 }
9481 /* Fill in the rest of the sized types. Reuse existing type nodes
9482 when possible. */
9495 /* Don't call build_qualified type for atomics. That routine does
9496 special processing for atomics, and until they are initialized
9497 it's better not to make that call.
9499 Check to see if there is a target override for atomic types. */
9516 /* Define these next since types below may used them. */
9534 /* We are not going to have real types in C with less than byte alignment,
9535 so we might as well not have any types that claim to have it. */
9548 const_ptr_type_node
9568 {
9571 scalar_float_mode mode;
9575 /* Work around the rs6000 KFmode having precision 113 not
9576 128. */
9588 }
9590 #ifdef HAVE_BFmode
9594 {
9599 }
9600 #endif
9607 /* Fixed size integer types. */
9614 /* Decimal float types. */
9616 {
9631 }
9640 {
9644 }
9646 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9647 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9648 sat_ ## KIND ## _type_node = \
9649 make_sat_signed_ ## KIND ## _type (SIZE); \
9650 sat_unsigned_ ## KIND ## _type_node = \
9651 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9652 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9653 unsigned_ ## KIND ## _type_node = \
9654 make_unsigned_ ## KIND ## _type (SIZE);
9656 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9657 sat_ ## WIDTH ## KIND ## _type_node = \
9658 make_sat_signed_ ## KIND ## _type (SIZE); \
9659 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9660 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9661 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9662 unsigned_ ## WIDTH ## KIND ## _type_node = \
9663 make_unsigned_ ## KIND ## _type (SIZE);
9665 /* Make fixed-point type nodes based on four different widths. */
9666 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9667 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9668 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9669 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9670 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9672 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9673 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9674 NAME ## _type_node = \
9675 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9676 u ## NAME ## _type_node = \
9677 make_or_reuse_unsigned_ ## KIND ## _type \
9678 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9679 sat_ ## NAME ## _type_node = \
9680 make_or_reuse_sat_signed_ ## KIND ## _type \
9681 (GET_MODE_BITSIZE (MODE ## mode)); \
9682 sat_u ## NAME ## _type_node = \
9683 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9684 (GET_MODE_BITSIZE (U ## MODE ## mode));
9686 /* Fixed-point type and mode nodes. */
9699 {
9702 /* Many back-ends define record types without setting TYPE_NAME.
9703 If we copied the record type here, we'd keep the original
9704 record type without a name. This breaks name mangling. So,
9705 don't copy record types and let c_common_nodes_and_builtins()
9706 declare the type to be __builtin_va_list. */
9711 }
9713 /* SCEV analyzer global shared trees. */
9718 }
9720 /* Modify DECL for given flags.
9721 TM_PURE attribute is set only on types, so the function will modify
9722 DECL's type when ECF_TM_PURE is used. */
9724 void
9726 {
9760 /* Looping const or pure is implied by noreturn.
9761 There is currently no way to declare looping const or looping pure alone. */
9764 }
9767 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9769 static void
9772 {
9773 tree decl;
9780 }
9782 /* Call this function after instantiating all builtins that the language
9783 front end cares about. This will build the rest of the builtins
9784 and internal functions that are relied upon by the tree optimizers and
9785 the middle-end. */
9787 void
9789 {
9794 {
9796 ptr_type_node,
9797 ptr_type_node,
9798 integer_type_node,
9799 NULL_TREE);
9801 BUILT_IN_CLEAR_PADDING,
9804 }
9810 {
9814 BUILT_IN_UNREACHABLE,
9820 BUILT_IN_UNREACHABLE_TRAP,
9832 }
9836 {
9847 }
9850 {
9853 NULL_TREE);
9856 }
9859 {
9865 }
9867 /* If we're checking the stack, `alloca' can throw. */
9868 const int alloca_flags
9872 {
9877 }
9882 BUILT_IN_ALLOCA_WITH_ALIGN,
9884 alloca_flags);
9889 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9891 alloca_flags);
9897 BUILT_IN_INIT_TRAMPOLINE,
9900 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9904 BUILT_IN_INIT_DESCRIPTOR,
9909 BUILT_IN_ADJUST_TRAMPOLINE,
9913 BUILT_IN_ADJUST_DESCRIPTOR,
9921 BUILT_IN_CLEAR_CACHE,
9923 ECF_NOTHROW);
9926 BUILT_IN_NONLOCAL_GOTO,
9933 {
9938 NULL_TREE);
9940 BUILT_IN_GCC_NESTED_PTR_CREATED,
9942 }
9945 {
9948 BUILT_IN_GCC_NESTED_PTR_DELETED,
9950 }
9955 BUILT_IN_SETJMP_SETUP,
9960 BUILT_IN_SETJMP_RECEIVER,
9969 BUILT_IN_STACK_RESTORE,
9974 NULL_TREE);
9987 /* If there's a possibility that we might use the ARM EABI, build the
9988 alternate __cxa_end_cleanup node used to resume from C++. */
9990 {
9993 BUILT_IN_CXA_END_CLEANUP,
9996 }
10000 BUILT_IN_UNWIND_RESUME,
10007 {
10009 NULL_TREE);
10011 BUILT_IN_RETURN_ADDRESS,
10013 ECF_NOTHROW);
10014 }
10018 {
10023 BUILT_IN_PROFILE_FUNC_ENTER,
10027 BUILT_IN_PROFILE_FUNC_EXIT,
10029 }
10031 /* The exception object and filter values from the runtime. The argument
10032 must be zero before exception lowering, i.e. from the front end. After
10033 exception lowering, it will be the region number for the exception
10034 landing pad. These functions are PURE instead of CONST to prevent
10035 them from being hoisted past the exception edge that will initialize
10036 its value in the landing pad. */
10040 /* Only use TM_PURE if we have TM language support. */
10053 NULL_TREE);
10055 BUILT_IN_EH_COPY_VALUES,
10058 /* Complex multiplication and division. These are handled as builtins
10059 rather than optabs because emit_library_call_value doesn't support
10060 complex. Further, we can do slightly better with folding these
10061 beasties if the real and complex parts of the arguments are separate. */
10062 {
10066 {
10093 /* For -ftrapping-math these should throw from a former
10094 -fnon-call-exception stmt. */
10096 NULL);
10102 NULL);
10106 }
10107 }
10110 }
10112 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10113 better way.
10115 If we requested a pointer to a vector, build up the pointers that
10116 we stripped off while looking for the inner type. Similarly for
10117 return values from functions.
10119 The argument TYPE is the top of the chain, and BOTTOM is the
10120 new type which we will point to. */
10122 tree
10124 {
10128 {
10132 }
10134 {
10138 }
10140 {
10143 }
10145 {
10149 }
10151 {
10153 /* The build_method_type_directly() routine prepends 'this' to argument list,
10154 so we must compensate by getting rid of it. */
10155 outer
10156 = build_method_type_directly
10158 inner,
10160 }
10162 {
10165 }
10166 else
10171 }
10173 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10174 the inner type. */
10175 tree
10177 {
10178 poly_int64 nunits;
10182 {
10194 /* Check that there are no leftover bits. */
10202 }
10205 }
10207 /* Similarly, but takes the inner type and number of units, which must be
10208 a power of two. */
10210 tree
10212 {
10214 }
10216 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10218 tree
10220 {
10225 {
10228 }
10229 else
10235 }
10237 /* Build a vector type that holds one boolean result for each element of
10238 vector type VECTYPE. The public interface for this operation is
10239 truth_type_for. */
10241 static tree
10243 {
10247 machine_mode mask_mode;
10257 }
10259 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10260 set. */
10262 tree
10264 {
10266 tree cand;
10267 /* We always build the non-opaque variant before the opaque one,
10268 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10274 /* Othewise build a variant type and make sure to queue it after
10275 the non-opaque type. */
10282 /* Type variants have no alias set defined. */
10285 }
10287 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10289 static poly_wide_int
10291 {
10292 /* First handle elements that are directly encoded. */
10297 /* Identify the pattern that contains element I and work out the index of
10298 the last encoded element for that pattern. */
10304 /* If there are no steps, the final encoded value is the right one. */
10308 /* Otherwise work out the value from the last two encoded elements. */
10313 }
10315 /* Return the value of element I of VECTOR_CST T. */
10317 tree
10319 {
10320 /* First handle elements that are directly encoded. */
10325 /* If there are no steps, the final encoded value is the right one. */
10327 {
10328 /* Identify the pattern that contains element I and work out the index of
10329 the last encoded element for that pattern. */
10334 }
10336 /* Otherwise work out the value from the last two encoded elements. */
10339 }
10341 /* Given an initializer INIT, return TRUE if INIT is zero or some
10342 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10343 null, set *NONZERO if and only if INIT is known not to be all
10344 zeros. The combination of return value of false and *NONZERO
10345 false implies that INIT may but need not be all zeros. Other
10346 combinations indicate definitive answers. */
10348 bool
10350 {
10355 /* Conservatively clear NONZERO and set it only if INIT is definitely
10356 not all zero. */
10364 {
10373 /* ??? Note that this is not correct for C4X float formats. There,
10374 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10375 negative exponent. */
10410 {
10415 tree elt;
10422 }
10425 {
10440 }
10441 /* Fall through. */
10444 {
10452 /* We need to loop through all elements to handle cases like
10453 "\0" and "\0foobar". */
10456 {
10459 }
10462 }
10466 }
10467 }
10469 /* Return true if EXPR is an initializer expression in which every element
10470 is a constant that is numerically equal to 0 or 1. The elements do not
10471 need to be equal to each other. */
10473 bool
10475 {
10479 {
10487 {
10494 {
10498 }
10501 }
10505 }
10506 }
10508 /* Check if vector VEC consists of all the equal elements and
10509 that the number of elements corresponds to the type of VEC.
10510 The function returns first element of the vector
10511 or NULL_TREE if the vector is not uniform. */
10512 tree
10514 {
10527 {
10531 }
10535 {
10539 {
10541 {
10544 }
10547 }
10554 }
10557 }
10559 /* If the argument is INTEGER_CST, return it. If the argument is vector
10560 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10561 return NULL_TREE.
10562 Look through location wrappers. */
10564 tree
10566 {
10573 {
10577 }
10580 }
10582 /* Checks to see if T is a constant or a constant vector and if each element E
10583 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10585 tree
10587 {
10597 tree cst;
10601 tree_vector_builder builder;
10604 else
10605 {
10611 }
10615 do
10616 {
10631 }
10635 }
10637 /* If VECTOR_CST T has a single nonzero element, return the index of that
10638 element, otherwise return -1. */
10640 int
10642 {
10648 {
10651 }
10652 else
10657 {
10660 {
10664 }
10665 }
10667 }
10669 /* Build an empty statement at location LOC. */
10671 tree
10673 {
10677 }
10680 /* Build an OMP clause with code CODE. LOC is the location of the
10681 clause. */
10683 tree
10685 {
10686 tree t;
10701 }
10703 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10704 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10705 Except for the CODE and operand count field, other storage for the
10706 object is initialized to zeros. */
10708 tree
10710 {
10711 tree t;
10723 /* Can't use TREE_OPERAND to store the length because if checking is
10724 enabled, it will try to check the length before we store it. :-P */
10728 }
10730 /* Helper function for build_call_* functions; build a CALL_EXPR with
10731 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10732 the argument slots. */
10734 static tree
10736 {
10737 tree t;
10745 }
10747 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10748 FN and a null static chain slot. NARGS is the number of call arguments
10749 which are specified as "..." arguments. */
10751 tree
10753 {
10754 tree ret;
10760 }
10762 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10763 FN and a null static chain slot. NARGS is the number of call arguments
10764 which are specified as a va_list ARGS. */
10766 tree
10768 {
10769 tree t;
10777 }
10779 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10780 FN and a null static chain slot. NARGS is the number of call arguments
10781 which are specified as a tree array ARGS. */
10783 tree
10786 {
10787 tree t;
10796 }
10798 /* Like build_call_array, but takes a vec. */
10800 tree
10802 {
10811 }
10813 /* Conveniently construct a function call expression. FNDECL names the
10814 function to be called and N arguments are passed in the array
10815 ARGARRAY. */
10817 tree
10819 {
10824 }
10826 /* Conveniently construct a function call expression. FNDECL names the
10827 function to be called and the arguments are passed in the vector
10828 VEC. */
10830 tree
10832 {
10835 }
10838 /* Conveniently construct a function call expression. FNDECL names the
10839 function to be called, N is the number of arguments, and the "..."
10840 parameters are the argument expressions. */
10842 tree
10844 {
10854 }
10856 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10857 varargs macros aren't supported by all bootstrap compilers. */
10859 tree
10861 {
10871 }
10873 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10874 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10875 It will get gimplified later into an ordinary internal function. */
10877 tree
10880 {
10888 }
10890 /* Build internal call expression. This is just like CALL_EXPR, except
10891 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10892 internal function. */
10894 tree
10897 {
10907 }
10909 /* Return a function call to FN, if the target is guaranteed to support it,
10910 or null otherwise.
10912 N is the number of arguments, passed in the "...", and TYPE is the
10913 type of the return value. */
10915 tree
10918 {
10928 {
10931 {
10934 OPTIMIZE_FOR_BOTH))
10936 }
10938 }
10939 else
10940 {
10945 }
10946 }
10948 /* Return a function call to the appropriate builtin alloca variant.
10950 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10951 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10952 bound for SIZE in case it is not a fixed value. */
10954 tree
10956 {
10958 {
10960 return
10962 }
10964 {
10967 }
10968 else
10969 {
10972 }
10973 }
10975 /* The built-in decl to use to mark code points believed to be unreachable.
10976 Typically __builtin_unreachable, but __builtin_trap if
10977 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10978 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10979 appropriate ubsan function. When building a call directly, use
10980 {gimple_},build_builtin_unreachable instead. */
10982 tree
10984 {
10991 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10992 in the sanopt pass. */
10995 }
10997 /* Build a call to __builtin_unreachable, possibly rewritten by
10998 -fsanitize=unreachable. Use this rather than the above when practical. */
11000 tree
11002 {
11006 }
11008 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11009 if SIZE == -1) and return a tree node representing char* pointer to
11010 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11011 the STRING_CST value is the LEN bytes at STR (the representation
11012 of the string, which may be wide). Otherwise it's all zeros. */
11014 tree
11018 {
11020 /* Set the maximum valid index based on the string length or SIZE. */
11021 unsigned HOST_WIDE_INT maxidx
11037 }
11041 /* Return true if T (assumed to be a DECL) must be assigned a memory
11042 location. */
11044 bool
11046 {
11052 }
11054 /* Return value of a constant X and sign-extend it. */
11056 HOST_WIDE_INT
11058 {
11062 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11066 {
11070 else
11072 }
11075 }
11077 /* If TYPE is an integral or pointer type, return an integer type with
11078 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11079 if TYPE is already an integer type of signedness UNSIGNEDP.
11080 If TYPE is a floating-point type, return an integer type with the same
11081 bitsize and with the signedness given by UNSIGNEDP; this is useful
11082 when doing bit-level operations on a floating-point value. */
11084 tree
11086 {
11091 {
11098 machine_mode new_mode;
11103 }
11106 {
11114 }
11123 else
11129 }
11131 /* If TYPE is an integral or pointer type, return an integer type with
11132 the same precision which is unsigned, or itself if TYPE is already an
11133 unsigned integer type. If TYPE is a floating-point type, return an
11134 unsigned integer type with the same bitsize as TYPE. */
11136 tree
11138 {
11140 }
11142 /* If TYPE is an integral or pointer type, return an integer type with
11143 the same precision which is signed, or itself if TYPE is already a
11144 signed integer type. If TYPE is a floating-point type, return a
11145 signed integer type with the same bitsize as TYPE. */
11147 tree
11149 {
11151 }
11153 /* - For VECTOR_TYPEs:
11154 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11155 - The number of elements must match (known_eq).
11156 - targetm.vectorize.get_mask_mode exists, and exactly
11157 the same mode as the truth type.
11158 - Otherwise, the truth type must be a BOOLEAN_TYPE
11159 or useless_type_conversion_p to BOOLEAN_TYPE. */
11160 bool
11162 {
11165 machine_mode tmask_mode;
11168 {
11177 }
11180 }
11182 /* If TYPE is a vector type, return a signed integer vector type with the
11183 same width and number of subparts. Otherwise return boolean_type_node. */
11185 tree
11187 {
11189 {
11193 }
11194 else
11196 }
11198 /* Returns the largest value obtainable by casting something in INNER type to
11199 OUTER type. */
11201 tree
11203 {
11209 /* Compute a unique number for every combination. */
11214 /* Determine the exponent to use. */
11216 {
11219 /* oprec <= iprec, outer: signed, inner: don't care. */
11224 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11228 /* oprec > iprec, outer: signed, inner: signed. */
11232 /* oprec > iprec, outer: signed, inner: unsigned. */
11236 /* oprec > iprec, outer: unsigned, inner: signed. */
11240 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11245 }
11249 }
11251 /* Returns the smallest value obtainable by casting something in INNER type to
11252 OUTER type. */
11254 tree
11256 {
11260 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11261 and obtain 0. */
11263 /* If we are widening something of an unsigned type, OUTER type
11264 contains all values of INNER type. In particular, both INNER
11265 and OUTER types have zero in common. */
11268 else
11269 {
11270 /* If we are widening a signed type to another signed type, we
11271 want to obtain -2^^(iprec-1). If we are keeping the
11272 precision or narrowing to a signed type, we want to obtain
11273 -2^(oprec-1). */
11278 }
11279 }
11281 /* Return true if two operands that are suitable for PHI nodes are
11282 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11283 SSA_NAME or invariant. Note that this is strictly an optimization.
11284 That is, callers of this function can directly call operand_equal_p
11285 and get the same result, only slower. */
11287 bool
11289 {
11295 }
11297 /* Returns number of zeros at the end of binary representation of X. */
11299 tree
11301 {
11303 }
11306 #define WALK_SUBTREE(NODE) \
11307 do \
11308 { \
11309 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11310 if (result) \
11311 return result; \
11312 } \
11313 while (0)
11315 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11316 be walked whenever a type is seen in the tree. Rest of operands and return
11317 value are as for walk_tree. */
11319 static tree
11322 {
11326 {
11330 /* We have to worry about mutually recursive pointers. These can't
11331 be written in C. They can in Ada. It's pathological, but
11332 there's an ACATS test (c38102a) that checks it. Deal with this
11333 by checking if we're pointing to another pointer, that one
11334 points to another pointer, that one does too, and we have no htab.
11335 If so, get a hash table. We check three levels deep to avoid
11336 the cost of the hash table if we don't need one. */
11341 {
11348 }
11350 /* fall through */
11359 /* Fall through. */
11363 {
11364 tree arg;
11366 /* We never want to walk into default arguments. */
11369 }
11373 /* Don't follow this nodes's type if a pointer for fear that
11374 we'll have infinite recursion. If we have a PSET, then we
11375 need not fear. */
11390 }
11393 }
11395 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11396 called with the DATA and the address of each sub-tree. If FUNC returns a
11397 non-NULL value, the traversal is stopped, and the value returned by FUNC
11398 is returned. If PSET is non-NULL it is used to record the nodes visited,
11399 and to avoid visiting a node more than once. */
11401 tree
11404 {
11405 #define WALK_SUBTREE_TAIL(NODE) \
11406 do \
11407 { \
11408 tp = & (NODE); \
11409 goto tail_recurse; \
11410 } \
11411 while (0)
11413 tail_recurse:
11414 /* Skip empty subtrees. */
11418 /* Don't walk the same tree twice, if the user has requested
11419 that we avoid doing so. */
11423 /* Call the function. */
11427 /* If we found something, return it. */
11434 /* Even if we didn't, FUNC may have decided that there was nothing
11435 interesting below this point in the tree. */
11437 {
11438 /* But we still need to check our siblings. */
11443 else
11445 }
11448 {
11452 }
11455 {
11467 /* None of these have subtrees other than those already walked
11468 above. */
11476 {
11482 /* Walk all elements but the last. */
11486 /* Now walk the last one as a tail call. */
11488 }
11491 {
11495 /* Walk all elements but the last. */
11498 /* Now walk the last one as a tail call. */
11500 }
11507 {
11512 idx++)
11514 }
11521 {
11522 tree decl;
11524 {
11525 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11526 into declarations that are just mentioned, rather than
11527 declared; they don't really belong to this part of the tree.
11528 And, we can see cycles: the initializer for a declaration
11529 can refer to the declaration itself. */
11533 }
11535 }
11538 {
11539 tree_stmt_iterator i;
11542 }
11546 {
11551 }
11554 {
11557 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11558 But, we only want to walk once. */
11563 }
11566 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11567 defining. We only want to walk into these fields of a type in this
11568 case and not in the general case of a mere reference to the type.
11570 The criterion is as follows: if the field can be an expression, it
11571 must be walked only here. This should be in keeping with the fields
11572 that are directly gimplified in gimplify_type_sizes in order for the
11573 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11574 variable-sized types.
11576 Note that DECLs get walked as part of processing the BIND_EXPR. */
11578 {
11579 /* Call the function for the decl so e.g. copy_tree_body_r can
11580 replace it with the remapped one. */
11589 /* Call the function for the type. See if it returns anything or
11590 doesn't want us to continue. If we are to continue, walk both
11591 the normal fields and those for the declaration case. */
11598 /* But do not walk a pointed-to type since it may itself need to
11599 be walked in the declaration case if it isn't anonymous. */
11601 {
11605 }
11607 /* If this is a record type, also walk the fields. */
11609 {
11610 tree field;
11614 {
11615 /* We'd like to look at the type of the field, but we can
11616 easily get infinite recursion. So assume it's pointed
11617 to elsewhere in the tree. Also, ignore things that
11618 aren't fields. */
11627 }
11628 }
11630 /* Same for scalar types. */
11636 {
11639 }
11643 }
11644 /* FALLTHRU */
11648 {
11651 /* Walk over all the sub-trees of this operand. */
11654 /* Go through the subtrees. We need to do this in forward order so
11655 that the scope of a FOR_EXPR is handled properly. */
11657 {
11661 }
11662 }
11663 /* If this is a type, walk the needed fields in the type. */
11667 }
11669 /* We didn't find what we were looking for. */
11672 #undef WALK_SUBTREE_TAIL
11673 }
11674 #undef WALK_SUBTREE
11676 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11678 tree
11680 walk_tree_lh lh)
11681 {
11682 tree result;
11687 }
11690 tree
11692 {
11699 }
11701 void
11703 {
11707 {
11709 }
11710 else
11712 }
11714 /* Create a nameless artificial label and put it in the current
11715 function context. The label has a location of LOC. Returns the
11716 newly created label. */
11718 tree
11720 {
11728 }
11730 /* Given a tree, try to return a useful variable name that we can use
11731 to prefix a temporary that is being assigned the value of the tree.
11732 I.E. given <temp> = &A, return A. */
11736 {
11737 tree stripped_decl;
11744 {
11749 }
11750 else
11751 {
11753 {
11758 }
11759 }
11760 }
11762 /* Return true if TYPE has a variable argument list. */
11764 bool
11766 {
11767 function_args_iterator args_iter;
11777 {
11779 }
11782 }
11784 /* Return true if TYPE has a prototype. */
11786 bool
11788 {
11789 tree t;
11798 }
11800 /* If BLOCK is inlined from an __attribute__((__artificial__))
11801 routine, return pointer to location from where it has been
11802 called. */
11803 location_t *
11805 {
11810 {
11813 {
11814 /* If AO is an artificial inline, point RET to the
11815 call site locus at which it has been inlined and continue
11816 the loop, in case AO's caller is also an artificial
11817 inline. */
11821 else
11823 }
11828 }
11830 }
11833 /* If EXP is inlined from an __attribute__((__artificial__))
11834 function, return the location of the original call expression. */
11836 location_t
11838 {
11843 else
11845 }
11847 /* Return the location into which EXP has been inlined. Analogous
11848 to tree_nonartificial_location() above but not limited to artificial
11849 functions declared inline. If SYSTEM_HEADER is true, return
11850 the macro expansion point of the location if it's in a system header */
11852 location_t
11854 {
11861 {
11869 }
11872 {
11875 /* Only consider macro expansion when the block traversal failed
11876 to find a location. Otherwise it's not relevant. */
11878 }
11881 }
11883 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11884 nodes. */
11886 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11888 hashval_t
11890 {
11897 else
11899 }
11901 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11902 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11903 same. */
11905 bool
11907 {
11920 else
11922 }
11924 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11926 tree
11929 {
11930 tree t;
11932 /* Use the cache of optimization nodes. */
11940 {
11941 /* Insert this one into the hash table. */
11945 /* Make a new node for next time round. */
11947 }
11950 }
11952 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11954 tree
11957 {
11958 tree t;
11960 /* Use the cache of optimization nodes. */
11968 {
11969 /* Insert this one into the hash table. */
11973 /* Make a new node for next time round. */
11975 }
11978 }
11980 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11981 so that they aren't saved during PCH writing. */
11983 void
11985 {
11990 }
11992 /* Determine the "ultimate origin" of a block. */
11994 tree
11996 {
12001 else
12002 {
12007 }
12008 }
12010 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12011 no instruction. */
12013 bool
12015 {
12016 /* Do not strip casts into or out of differing address spaces. */
12019 {
12024 }
12027 {
12028 /* We already know that outer_type is not a pointer with
12029 a non-generic address space. */
12031 }
12033 /* Use precision rather then machine mode when we can, which gives
12034 the correct answer even for submode (bit-field) types. */
12043 /* Otherwise fall back on comparing machine modes (e.g. for
12044 aggregate types, floats). */
12046 }
12048 /* Return true iff conversion in EXP generates no instruction. Mark
12049 it inline so that we fully inline into the stripping functions even
12050 though we have two uses of this function. */
12054 {
12069 }
12071 /* Return true iff conversion in EXP generates no instruction. Don't
12072 consider conversions changing the signedness. */
12074 static bool
12076 {
12087 }
12089 /* Strip conversions from EXP according to tree_nop_conversion and
12090 return the resulting expression. */
12092 tree
12094 {
12098 }
12100 /* Strip conversions from EXP according to tree_sign_nop_conversion
12101 and return the resulting expression. */
12103 tree
12105 {
12109 }
12111 /* Avoid any floating point extensions from EXP. */
12112 tree
12114 {
12117 /* For floating point constant look up the narrowest type that can hold
12118 it properly and handle it like (type)(narrowest_type)constant.
12119 This way we can optimize for instance a=a*2.0 where "a" is float
12120 but 2.0 is double constant. */
12122 {
12123 REAL_VALUE_TYPE orig;
12136 }
12155 }
12157 /* Strip out all handled components that produce invariant
12158 offsets. */
12160 const_tree
12162 {
12164 {
12166 {
12181 }
12183 }
12186 }
12188 /* Strip handled components with zero offset from OP. */
12190 tree
12192 {
12198 }
12202 /* Return the GCC personality function decl. */
12204 tree
12206 {
12210 }
12212 /* TARGET is a call target of GIMPLE call statement
12213 (obtained by gimple_call_fn). Return true if it is
12214 OBJ_TYPE_REF representing an virtual call of C++ method.
12215 (As opposed to OBJ_TYPE_REF representing objc calls
12216 through a cast where middle-end devirtualization machinery
12217 can't apply.) FOR_DUMP_P is true when being called from
12218 the dump routines. */
12220 bool
12222 {
12231 /* If we do not have BINFO associated, it means that type was built
12232 without devirtualization enabled. Do not consider this a virtual
12233 call. */
12237 }
12239 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12241 static tree
12243 {
12254 }
12256 /* Try to find a base info of BINFO that would have its field decl at offset
12257 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12258 found, return, otherwise return NULL_TREE. */
12260 tree
12262 {
12266 {
12268 tree fld;
12277 {
12285 }
12289 /* Offset 0 indicates the primary base, whose vtable contents are
12290 represented in the binfo for the derived class. */
12292 {
12294 /* Offsets in BINFO are in bytes relative to the whole structure
12295 while POS is in bits relative to the containing field. */
12302 {
12305 }
12308 else
12310 binfo_offset);
12311 }
12315 }
12316 }
12318 /* PR 84195: Replace control characters in "unescaped" with their
12319 escaped equivalents. Allow newlines if -fmessage-length has
12320 been set to a non-zero value. This is done here, rather than
12321 where the attribute is recorded as the message length can
12322 change between these two locations. */
12324 void
12326 {
12344 {
12348 {
12352 }
12355 {
12357 {
12358 /* We only allocate space for a new string if we
12359 actually encounter a control character that
12360 needs replacing. */
12364 }
12369 {
12378 }
12379 }
12382 }
12385 {
12389 }
12390 }
12392 /* Warn about a use of an identifier which was marked deprecated. Returns
12393 whether a warning was given. */
12395 bool
12397 {
12398 escaped_string msg;
12404 {
12408 {
12414 {
12417 }
12418 }
12419 }
12429 {
12430 auto_diagnostic_group d;
12434 else
12439 }
12441 {
12446 {
12452 }
12454 auto_diagnostic_group d;
12456 {
12460 else
12463 }
12464 else
12465 {
12469 else
12472 }
12476 }
12479 }
12481 /* Error out with an identifier which was marked 'unavailable'. */
12482 void
12484 {
12485 escaped_string msg;
12491 {
12495 {
12500 }
12501 }
12510 {
12511 auto_diagnostic_group d;
12514 else
12517 }
12519 {
12524 {
12530 }
12532 auto_diagnostic_group d;
12534 {
12537 else
12539 }
12540 else
12541 {
12544 else
12546 }
12550 }
12551 }
12553 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12554 somewhere in it. */
12556 bool
12558 {
12560 {
12565 }
12568 }
12570 /* Try to determine whether a TRY_CATCH expression can fall through.
12571 This is a subroutine of block_may_fallthru. */
12573 static bool
12575 {
12576 tree_stmt_iterator i;
12578 /* If the TRY block can fall through, the whole TRY_CATCH can
12579 fall through. */
12584 {
12586 /* See below. */
12590 /* See below. */
12597 /* See below. */
12599 }
12603 {
12605 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12606 catch expression and a body. The whole TRY_CATCH may fall
12607 through iff any of the catch bodies falls through. */
12609 {
12612 }
12616 /* The exception filter expression only matters if there is an
12617 exception. If the exception does not match EH_FILTER_TYPES,
12618 we will execute EH_FILTER_FAILURE, and we will fall through
12619 if that falls through. If the exception does match
12620 EH_FILTER_TYPES, the stack unwinder will continue up the
12621 stack, so we will not fall through. We don't know whether we
12622 will throw an exception which matches EH_FILTER_TYPES or not,
12623 so we just ignore EH_FILTER_TYPES and assume that we might
12624 throw an exception which doesn't match. */
12628 /* This case represents statements to be executed when an
12629 exception occurs. Those statements are implicitly followed
12630 by a RESX statement to resume execution after the exception.
12631 So in this case the TRY_CATCH never falls through. */
12633 }
12634 }
12636 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12637 need not be 100% accurate; simply be conservative and return true if we
12638 don't know. This is used only to avoid stupidly generating extra code.
12639 If we're wrong, we'll just delete the extra code later. */
12641 bool
12643 {
12644 /* This CONST_CAST is okay because expr_last returns its argument
12645 unmodified and we assign it to a const_tree. */
12649 {
12652 /* Easy cases. If the last statement of the block implies
12653 control transfer, then we can't fall through. */
12657 /* If there is a default: label or case labels cover all possible
12658 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12659 to some case label in all cases and all we care is whether the
12660 SWITCH_BODY falls through. */
12677 /* The finally clause is always executed after the try clause,
12678 so if it does not fall through, then the try-finally will not
12679 fall through. Otherwise, if the try clause does not fall
12680 through, then when the finally clause falls through it will
12681 resume execution wherever the try clause was going. So the
12682 whole try-finally will only fall through if both the try
12683 clause and the finally clause fall through. */
12693 else
12695 /* FALLTHRU */
12698 /* Functions that do not return do not fall through. */
12712 }
12713 }
12715 /* True if we are using EH to handle cleanups. */
12718 /* This routine is called from front ends to indicate eh should be used for
12719 cleanups. */
12720 void
12722 {
12724 }
12726 /* Query whether EH is used for cleanups. */
12727 bool
12729 {
12731 }
12733 /* Wrapper for tree_code_name to ensure that tree code is valid */
12736 {
12739 /* The tree_code enum promotes to signed, but we could be getting
12740 invalid values, so force an unsigned comparison. */
12742 {
12746 }
12749 }
12751 /* Drops the TREE_OVERFLOW flag from T. */
12753 tree
12755 {
12758 /* For tree codes with a sharing machinery re-build the result. */
12762 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12763 and canonicalize the result. */
12765 {
12766 tree_vector_builder builder;
12770 {
12775 }
12777 }
12779 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12780 and drop the flag. */
12784 /* For constants that contain nested constants, drop the flag
12785 from those as well. */
12787 {
12792 }
12795 }
12797 /* Given a memory reference expression T, return its base address.
12798 The base address of a memory reference expression is the main
12799 object being referenced. For instance, the base address for
12800 'array[i].fld[j]' is 'array'. You can think of this as stripping
12801 away the offset part from a memory address.
12803 This function calls handled_component_p to strip away all the inner
12804 parts of the memory reference until it reaches the base object. */
12806 tree
12808 {
12820 }
12822 /* Return a tree of sizetype representing the size, in bytes, of the element
12823 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12825 tree
12827 {
12832 /* If a size was specified in the ARRAY_REF, it's the size measured
12833 in alignment units of the element type. So multiply by that value. */
12835 {
12836 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12837 sizetype from another type of the same width and signedness. */
12842 }
12844 /* Otherwise, take the size from that of the element type. Substitute
12845 any PLACEHOLDER_EXPR that we have. */
12846 else
12848 }
12850 /* Return a tree representing the lower bound of the array mentioned in
12851 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12853 tree
12855 {
12858 /* If a lower bound is specified in EXP, use it. */
12862 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12863 substituting for a PLACEHOLDER_EXPR as needed. */
12867 /* Otherwise, return a zero of the appropriate type. */
12871 }
12873 /* Return a tree representing the upper bound of the array mentioned in
12874 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12876 tree
12878 {
12881 /* If there is a domain type and it has an upper bound, use it, substituting
12882 for a PLACEHOLDER_EXPR as needed. */
12886 /* Otherwise fail. */
12888 }
12890 /* Returns true if REF is an array reference, a component reference,
12891 or a memory reference to an array whose actual size might be larger
12892 than its upper bound implies, there are multiple cases:
12893 A. a ref to a flexible array member at the end of a structure;
12894 B. a ref to an array with a different type against the original decl;
12895 for example:
12897 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12898 (*((char(*)[16])&a[0]))[i+8]
12900 C. a ref to an array that was passed as a parameter;
12901 for example:
12903 int test (uint8_t *p, uint32_t t[1][1], int n) {
12904 for (int i = 0; i < 4; i++, p++)
12905 t[i][0] = ...;
12907 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12908 */
12910 bool
12912 {
12913 /* The TYPE for this array referece. */
12915 /* The FIELD_DECL for the array field in the containing structure. */
12917 /* Whether this array is the trailing array of a structure. */
12924 {
12927 }
12930 {
12933 }
12935 {
12941 {
12943 {
12950 }
12951 else
12953 }
12954 else
12956 }
12957 else
12965 {
12966 /* If the reference chain contains a component reference to a
12967 non-union type and there follows another field the reference
12968 is not at the end of a structure. */
12970 {
12972 {
12978 }
12979 }
12980 /* If we have a multi-dimensional array we do not consider
12981 a non-innermost dimension as flex array if the whole
12982 multi-dimensional array is at struct end.
12983 Same for an array of aggregates with a trailing array
12984 member. */
12988 ;
12989 /* If we view an underlying object as sth else then what we
12990 gathered up to now is what we have to rely on. */
12993 else
12997 }
13002 /* The array now is at struct end. Treat flexible array member as
13003 always subject to extend, even into just padding constrained by
13004 an underlying decl. */
13008 {
13011 }
13013 /* If the reference is based on a declared entity, the size of the array
13014 is constrained by its given domain. (Do not trust commons PR/69368). */
13018 && !(flag_unconstrained_commons
13022 {
13023 /* If the object itself is the array it is not at struct end. */
13027 /* Check whether the array domain covers all of the available
13028 padding. */
13029 poly_int64 offset;
13033 {
13034 *is_trailing_array
13037 }
13039 {
13040 *is_trailing_array
13043 }
13045 /* If at least one extra element fits it is a flexarray. */
13051 {
13052 *is_trailing_array
13055 }
13058 }
13062 }
13065 /* Return a tree representing the offset, in bytes, of the field referenced
13066 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13068 tree
13070 {
13075 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13076 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13077 value. */
13079 {
13080 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13081 sizetype from another type of the same width and signedness. */
13087 }
13089 /* Otherwise, take the offset from that of the field. Substitute
13090 any PLACEHOLDER_EXPR that we have. */
13091 else
13093 }
13095 /* Given the initializer INIT, return the initializer for the field
13096 DECL if it exists, otherwise null. Used to obtain the initializer
13097 for a flexible array member and determine its size. */
13099 static tree
13101 {
13107 {
13112 {
13116 }
13117 }
13120 }
13122 /* Determines the special array member type for the array reference REF. */
13123 special_array_member
13125 {
13131 {
13140 {
13141 /* If array element has zero size, verify if it is a flexible
13142 array member or zero length array. Clear zero_elts if
13143 it has one or more members or is a VLA member. */
13152 }
13154 /* MEMBER is an interior array with more than one element. */
13158 {
13161 else
13163 }
13171 {
13176 /* MEMBER is a trailing array with more than
13177 one elements. */
13182 }
13183 }
13186 }
13188 /* Determines the size of the member referenced by the COMPONENT_REF
13189 REF, using its initializer expression if necessary in order to
13190 determine the size of an initialized flexible array member.
13191 If non-null, set *SAM to the type of special array member.
13192 Returns the size as sizetype (which might be zero for an object
13193 with an uninitialized flexible array member) or null if the size
13194 cannot be determined. */
13196 tree
13198 {
13201 special_array_member sambuf;
13206 /* The object/argument referenced by the COMPONENT_REF and its type. */
13209 /* The referenced member. */
13214 {
13217 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13218 to the type of a class with a virtual base which doesn't
13219 reflect the size of the virtual's members (see pr97595).
13220 If that's the case fail for now and implement something
13221 more robust in the future. */
13225 /* 2-or-more elements arrays are treated as normal arrays by default. */
13232 /* If the trailing array is a not a flexible array member, treat it as
13233 a normal array. */
13241 /* For a reference to a flexible array member of a union
13242 use the size of the union instead of the size of the member. */
13245 }
13247 /* MEMBER is either a bona fide flexible array member, or a zero-elements
13248 array member, or an array of length one treated as such. */
13250 /* If the reference is to a declared object and the member a true
13251 flexible array, try to determine its size from its initializer. */
13255 {
13266 }
13268 /* BASE is the declared object of which MEMBER is either a member
13269 or that is cast to ARGTYPE (e.g., a char buffer used to store
13270 an ARGTYPE object). */
13273 /* Determine the base type of the referenced object. If it's
13274 the same as ARGTYPE and MEMBER has a known size, return it. */
13286 /* MEMBER is a true flexible array member. Compute its size from
13287 the initializer of the BASE object if it has one. */
13290 {
13293 {
13296 {
13297 /* Use the larger of the initializer size and the tail
13298 padding in the enclosing struct. */
13303 }
13306 }
13307 }
13310 {
13312 {
13317 /* The size of a flexible array member of an extern struct
13318 with no initializer cannot be determined (it's defined
13319 in another translation unit and can have an initializer
13320 with an arbitrary number of elements). */
13323 /* Use the size of the base struct or, for interior zero-length
13324 arrays, the size of the enclosing type. */
13326 }
13328 /* Use the size of the BASE object (possibly an array of some
13329 other type such as char used to store the struct). */
13331 else
13333 }
13335 /* If the flexible array member has a known size use the greater
13336 of it and the tail padding in the enclosing struct.
13337 Otherwise, when the size of the flexible array member is unknown
13338 and the referenced object is not a struct, use the size of its
13339 type when known. This detects sizes of array buffers when cast
13340 to struct types with flexible array members. */
13342 {
13347 {
13350 }
13352 }
13354 /* Return "don't know" for an external non-array object since its
13355 flexible array member can be initialized to have any number of
13356 elements. Otherwise, return zero because the flexible array
13357 member has no elements. */
13360 && (!typematch
13363 }
13365 /* Return the machine mode of T. For vectors, returns the mode of the
13366 inner type. The main use case is to feed the result to HONOR_NANS,
13367 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13369 machine_mode
13371 {
13377 }
13379 /* Vector types need to re-check the target flags each time we report
13380 the machine mode. We need to do this because attribute target can
13381 change the result of vector_mode_supported_p and have_regs_of_mode
13382 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13383 change on a per-function basis. */
13384 /* ??? Possibly a better solution is to run through all the types
13385 referenced by a function and re-compute the TYPE_MODE once, rather
13386 than make the TYPE_MODE macro call a function. */
13388 machine_mode
13390 {
13391 machine_mode mode;
13399 {
13400 scalar_int_mode innermode;
13402 /* For integers, try mapping it to a same-sized scalar mode. */
13404 {
13407 scalar_int_mode mode;
13411 }
13414 }
13417 }
13419 /* Return the size in bits of each element of vector type TYPE. */
13421 unsigned int
13423 {
13428 }
13430 /* Calculate the size in bits of each element of vector type TYPE
13431 and return the result as a tree of type bitsizetype. */
13433 tree
13435 {
13440 }
13442 /* Verify that basic properties of T match TV and thus T can be a variant of
13443 TV. TV should be the more specified variant (i.e. the main variant). */
13445 static bool
13447 {
13448 /* Type variant can differ by:
13450 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13451 ENCODE_QUAL_ADDR_SPACE.
13452 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13453 in this case some values may not be set in the variant types
13454 (see TYPE_COMPLETE_P checks).
13455 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13456 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13457 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13458 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13459 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13460 this is necessary to make it possible to merge types form different TUs
13461 - arrays, pointers and references may have TREE_TYPE that is a variant
13462 of TREE_TYPE of their main variants.
13463 - aggregates may have new TYPE_FIELDS list that list variants of
13464 the main variant TYPE_FIELDS.
13465 - vector types may differ by TYPE_VECTOR_OPAQUE
13466 */
13468 /* Convenience macro for matching individual fields. */
13469 #define verify_variant_match(flag) \
13470 do { \
13471 if (flag (tv) != flag (t)) \
13472 { \
13474 debug_tree (tv); \
13475 return false; \
13476 } \
13477 } while (false)
13479 /* tree_base checks. */
13482 /* FIXME: Ada builds non-artificial variants of artificial types. */
13483 #if 0
13486 #endif
13489 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13496 else
13498 /* FIXME: This check trigger during libstdc++ build. */
13499 #if 0
13502 #endif
13504 /* tree_type_common checks. */
13507 {
13515 {
13525 }
13527 }
13533 /* During LTO we merge variant lists from diferent translation units
13534 that may differ BY TYPE_CONTEXT that in turn may point
13535 to TRANSLATION_UNIT_DECL.
13536 Ada also builds variants of types with different TYPE_CONTEXT. */
13537 #if 0
13540 #endif
13546 {
13550 }
13552 /* tree_type_non_common checks. */
13554 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13555 and dangle the pointer from time to time. */
13559 {
13563 }
13570 {
13573 }
13580 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13581 or even type's main variant. This is needed to make bootstrap pass
13582 and the bug seems new in GCC 5.
13583 C++ FE should be updated to make this consistent and we should check
13584 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13585 is a match with main variant.
13587 Also disable the check for Java for now because of parser hack that builds
13588 first an dummy BINFO and then sometimes replace it by real BINFO in some
13589 of the copies. */
13592 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13593 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13594 at LTO time only. */
13596 {
13604 }
13606 /* Check various uses of TYPE_VALUES_RAW. */
13612 /* Permit incomplete variants of complete type. While FEs may complete
13613 all variants, this does not happen for C++ templates in all cases. */
13617 {
13620 /* Fortran builds qualified variants as new records with items of
13621 qualified type. Verify that they looks same. */
13628 /* FIXME: gfc_nonrestricted_type builds all types as variants
13629 with exception of pointer types. It deeply copies the type
13630 which means that we may end up with a variant type
13631 referring non-variant pointer. We may change it to
13632 produce types as variants, too, like
13633 objc_get_protocol_qualified_type does. */
13639 {
13647 }
13648 }
13651 /* For C++ the qualified variant of array type is really an array type
13652 of qualified TREE_TYPE.
13653 objc builds variants of pointer where pointer to type is a variant, too
13654 in objc_get_protocol_qualified_type. */
13660 {
13668 }
13671 {
13679 }
13681 #undef verify_variant_match
13682 }
13685 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13686 the middle-end types_compatible_p function. It needs to avoid
13687 claiming types are different for types that should be treated
13688 the same with respect to TBAA. Canonical types are also used
13689 for IL consistency checks via the useless_type_conversion_p
13690 predicate which does not handle all type kinds itself but falls
13691 back to pointer-comparison of TYPE_CANONICAL for aggregates
13692 for example. */
13694 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13695 type calculation because we need to allow inter-operability between signed
13696 and unsigned variants. */
13698 bool
13700 {
13701 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13702 signed char and unsigned char. Similarly fortran FE builds
13703 C_SIZE_T as signed type, while C defines it unsigned. */
13706 == INTEGER_TYPE
13709 }
13711 /* Return true iff T1 and T2 are structurally identical for what
13712 TBAA is concerned.
13713 This function is used both by lto.cc canonical type merging and by the
13714 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13715 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13716 only for LTO because only in these cases TYPE_CANONICAL equivalence
13717 correspond to one defined by gimple_canonical_types_compatible_p. */
13719 bool
13722 {
13723 /* Type variants should be same as the main variant. When not doing sanity
13724 checking to verify this fact, go to main variants and save some work. */
13726 {
13729 }
13731 /* Check first for the obvious case of pointer identity. */
13735 /* Check that we have two types to compare. */
13739 /* We consider complete types always compatible with incomplete type.
13740 This does not make sense for canonical type calculation and thus we
13741 need to ensure that we are never called on it.
13743 FIXME: For more correctness the function probably should have three modes
13744 1) mode assuming that types are complete mathcing their structure
13745 2) mode allowing incomplete types but producing equivalence classes
13746 and thus ignoring all info from complete types
13747 3) mode allowing incomplete types to match complete but checking
13748 compatibility between complete types.
13750 1 and 2 can be used for canonical type calculation. 3 is the real
13751 definition of type compatibility that can be used i.e. for warnings during
13752 declaration merging. */
13757 /* If the types have been previously registered and found equal
13758 they still are. */
13762 {
13763 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13764 they are always NULL, but they are set to non-NULL for types
13765 constructed by build_pointer_type and variants. In this case the
13766 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13767 all pointers are considered equal. Be sure to not return false
13768 negatives. */
13772 }
13774 /* For types where we do ODR based TBAA the canonical type is always
13775 set correctly, so we know that types are different if their
13776 canonical types does not match. */
13782 /* Can't be the same type if the types don't have the same code. */
13787 /* Qualifiers do not matter for canonical type comparison purposes. */
13789 /* Void types and nullptr types are always the same. */
13794 /* Can't be the same type if they have different mode. */
13798 /* Non-aggregate types can be handled cheaply. */
13806 {
13807 /* Can't be the same type if they have different precision. */
13811 /* In some cases the signed and unsigned types are required to be
13812 inter-operable. */
13817 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13818 interoperable with "signed char". Unless all frontends are revisited
13819 to agree on these types, we must ignore the flag completely. */
13821 /* Fortran standard define C_PTR type that is compatible with every
13822 C pointer. For this reason we need to glob all pointers into one.
13823 Still pointers in different address spaces are not compatible. */
13825 {
13829 }
13831 /* Tail-recurse to components. */
13836 trust_type_canonical);
13839 }
13841 /* Do type-specific comparisons. */
13843 {
13845 /* Array types are the same if the element types are the same and
13846 the number of elements are the same. */
13848 trust_type_canonical)
13853 else
13854 {
13858 /* For an incomplete external array, the type domain can be
13859 NULL_TREE. Check this condition also. */
13864 else
13865 {
13871 /* The minimum/maximum values have to be the same. */
13883 else
13885 }
13886 }
13890 /* Function types are the same if the return type and arguments types
13891 are the same. */
13893 trust_type_canonical))
13900 else
13901 {
13907 {
13910 trust_type_canonical))
13912 }
13918 }
13923 {
13926 /* Don't try to compare variants of an incomplete type, before
13927 TYPE_FIELDS has been copied around. */
13935 /* For aggregate types, all the fields must be the same. */
13939 {
13940 /* Skip non-fields and zero-sized fields. */
13951 /* The fields must have the same name, offset and type. */
13954 || !gimple_canonical_types_compatible_p
13956 trust_type_canonical))
13958 }
13960 /* If one aggregate has more fields than the other, they
13961 are not the same. */
13966 }
13969 /* Consider all types with language specific trees in them mutually
13970 compatible. This is executed only from verify_type and false
13971 positives can be tolerated. */
13974 }
13975 }
13977 /* For OPAQUE_TYPE T, it should have only size and alignment information
13978 and its mode should be of class MODE_OPAQUE. This function verifies
13979 these properties of T match TV which is the main variant of T and TC
13980 which is the canonical of T. */
13982 static void
13984 {
13989 /* For an opaque type T1, check if some of its properties match
13990 the corresponding ones of the other opaque type T2, emit some
13991 error messages for those inconsistent ones. */
13994 {
13996 {
14000 }
14002 {
14006 }
14008 {
14012 }
14016 {
14020 }
14022 {
14026 }
14028 {
14032 }
14033 };
14040 }
14042 /* Verify type T. */
14044 void
14046 {
14052 {
14055 }
14058 {
14061 }
14063 {
14067 }
14072 ;
14074 {
14078 }
14079 /* Method and function types cannot be used to address memory and thus
14080 TYPE_CANONICAL really matters only for determining useless conversions.
14082 FIXME: C++ FE produce declarations of builtin functions that are not
14083 compatible with main variants. */
14085 ;
14087 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14088 with variably sized arrays because their sizes possibly
14089 gimplified to different variables. */
14093 {
14097 }
14101 {
14105 }
14107 {
14112 }
14115 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14117 {
14118 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14119 and danagle the pointer from time to time. */
14123 {
14127 }
14128 }
14130 {
14133 {
14137 }
14138 }
14140 {
14143 {
14147 }
14148 }
14151 {
14152 /* FIXME: The following check should pass:
14153 useless_type_conversion_p (const_cast <tree> (t),
14154 TREE_TYPE (TYPE_MIN_VALUE (t))
14155 but does not for C sizetypes in LTO. */
14156 }
14158 /* Check various uses of TYPE_MAXVAL_RAW. */
14160 {
14162 ;
14164 {
14168 }
14170 {
14174 }
14175 }
14177 {
14181 {
14185 }
14186 }
14188 {
14192 {
14196 }
14197 }
14200 {
14201 /* FIXME: The following check should pass:
14202 useless_type_conversion_p (const_cast <tree> (t),
14203 TREE_TYPE (TYPE_MAX_VALUE (t))
14204 but does not for C sizetypes in LTO. */
14205 }
14207 {
14210 {
14214 }
14215 }
14217 {
14221 }
14224 {
14228 }
14230 /* Check various uses of TYPE_VALUES_RAW. */
14233 {
14237 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14238 CONST_DECL of ENUMERAL TYPE. */
14240 {
14245 }
14249 {
14255 }
14257 {
14262 }
14263 }
14265 {
14267 {
14271 }
14272 }
14274 {
14276 {
14279 }
14281 {
14282 /* TODO: verify properties of decls. */
14284 ;
14286 ;
14288 ;
14290 ;
14292 ;
14294 ;
14296 ;
14297 else
14298 {
14302 }
14303 }
14304 }
14312 {
14314 {
14319 }
14321 {
14325 }
14326 /* Verify just enough of cache to ensure that no one copied it to new type.
14327 All copying should go by copy_node that should clear it. */
14329 {
14334 {
14339 }
14340 }
14341 }
14344 {
14345 /* C++ FE uses TREE_PURPOSE to store initial values. */
14347 {
14351 }
14353 {
14357 }
14358 }
14360 {
14364 }
14373 {
14376 }
14378 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14379 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14380 of a type. */
14383 {
14386 }
14389 {
14392 }
14393 }
14396 /* Return 1 if ARG interpreted as signed in its precision is known to be
14397 always positive or 2 if ARG is known to be always negative, or 3 if
14398 ARG may be positive or negative. */
14400 int
14402 {
14409 {
14413 else
14415 }
14419 {
14421 /* Narrower value zero extended into wider type
14422 will always result in positive values. */
14429 }
14433 value_range r;
14436 {
14440 {
14444 {
14453 }
14454 }
14456 }
14458 {
14459 /* For unsigned values, the "positive" range comes
14460 below the "negative" range. */
14465 }
14466 else
14467 {
14472 }
14474 }
14479 /* Return true if ARG is marked with the nonnull attribute in the
14480 current function signature. */
14482 bool
14484 {
14492 /* The static chain decl is always non null. */
14496 /* THIS argument of method is always non-NULL. */
14502 /* Values passed by reference are always non-NULL. */
14509 {
14512 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14516 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14520 /* Get the position number for ARG in the function signature. */
14522 t;
14524 {
14527 }
14531 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14533 {
14536 }
14537 }
14540 }
14542 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14543 information. */
14545 location_t
14547 {
14552 discriminator);
14553 }
14555 location_t
14557 {
14558 source_range src_range;
14562 }
14564 location_t
14566 {
14574 src_range,
14576 discriminator);
14579 }
14581 /* Return EXPR, potentially wrapped with a node expression LOC,
14582 if !CAN_HAVE_LOCATION_P (expr).
14584 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14585 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14587 Wrapper nodes can be identified using location_wrapper_p. */
14589 tree
14591 {
14598 /* We should only be adding wrappers for constants and for decls,
14599 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14604 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14605 any impact of the wrapper nodes. */
14609 /* Compiler-generated temporary variables don't need a wrapper. */
14613 /* If any auto_suppress_location_wrappers are active, don't create
14614 wrappers. */
14618 tree_code code
14623 /* Mark this node as being a wrapper. */
14626 }
14630 /* Return the name of combined function FN, for debugging purposes. */
14634 {
14636 {
14639 }
14640 else
14642 }
14644 /* Return a bitmap with a bit set corresponding to each argument in
14645 a function call type FNTYPE declared with attribute nonnull,
14646 or null if none of the function's argument are nonnull. The caller
14647 must free the bitmap. */
14649 bitmap
14651 {
14657 {
14658 /* The this pointer in C++ non-static member functions is
14659 implicitly nonnull whether or not it's declared as such. */
14662 }
14668 /* A function declaration can specify multiple attribute nonnull,
14669 each with zero or more arguments. The loop below creates a bitmap
14670 representing a union of all the arguments. An empty (but non-null)
14671 bitmap means that all arguments have been declaraed nonnull. */
14673 {
14682 {
14683 /* Clear the bitmap in case a previous attribute nonnull
14684 set it and this one overrides it for all arguments. */
14687 }
14689 /* Iterate over the indices of the format arguments declared nonnull
14690 and set a bit for each. */
14692 {
14695 }
14696 }
14699 }
14701 /* Returns true if TYPE is a type where it and all of its subobjects
14702 (recursively) are of structure, union, or array type. */
14704 bool
14706 {
14708 {
14715 }
14721 }
14723 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14724 that shouldn't be passed via stack. */
14726 bool
14728 {
14739 }
14741 /* Determine whether TYPE is a structure with a flexible array member,
14742 or a union containing such a structure (possibly recursively). */
14744 bool
14746 {
14749 {
14765 {
14769 }
14773 }
14774 }
14776 /* Like int_size_in_bytes, but handle empty records specially. */
14778 HOST_WIDE_INT
14780 {
14782 }
14784 /* Like size_in_bytes, but handle empty records specially. */
14786 tree
14788 {
14790 }
14792 /* Return true if an expression with CODE has to have the same result type as
14793 its first operand. */
14795 bool
14797 {
14799 {
14833 }
14834 }
14836 /* Return a typenode for the "standard" C type with a given name. */
14837 tree
14839 {
14871 }
14873 /* List of pointer types used to declare builtins before we have seen their
14874 real declaration.
14876 Keep the size up to date in tree.h ! */
14878 {
14885 };
14887 /* Return the maximum object size. */
14889 tree
14891 {
14892 /* To do: Make this a configurable parameter. */
14894 }
14896 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14897 parameter default to false and that weeds out error_mark_node. */
14899 bool
14902 {
14909 }
14911 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14912 delete operators. Return false if they may or may not name such
14913 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14914 do not. */
14916 bool
14919 {
14929 /* The following failures are due to invalid names so they're not
14930 considered certain mismatches. */
14946 /* The following failures are due to names of user-defined operators
14947 so they're also not considered certain mismatches. */
14949 /* *_len is now just the length after initial underscores. */
14955 /* The following failures are certain mismatches. */
14958 /* _Znw must match _Zdl, _Zna must match _Zda. */
14962 /* 'j', 'm' and 'y' correspond to size_t. */
14969 {
14970 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14971 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14978 }
14982 {
14983 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14984 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14985 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14995 }
14997 /* The negative result is conservative. */
15000 }
15002 /* Return the zero-based number corresponding to the argument being
15003 deallocated if FNDECL is a deallocation function or an out-of-bounds
15004 value if it isn't. */
15006 unsigned
15008 {
15009 /* A call to operator delete isn't recognized as one to a built-in. */
15011 {
15015 /* Avoid placement delete that's not been inlined. */
15021 }
15023 /* TODO: Handle user-defined functions with attribute malloc? Handle
15024 known non-built-ins like fopen? */
15026 {
15028 {
15036 }
15038 }
15047 {
15058 }
15061 }
15063 /* If EXPR refers to a character array or pointer declared attribute
15064 nonstring, return a decl for that array or pointer and set *REF
15065 to the referenced enclosing object or pointer. Otherwise return
15066 null. */
15068 tree
15070 {
15074 {
15078 {
15084 }
15085 else
15087 }
15092 /* To simplify calling code, store the referenced DECL regardless of
15093 the attribute determined below, but avoid storing the SSA_NAME_VAR
15094 obtained above (it's not useful for dataflow purposes). */
15098 /* Use the SSA_NAME_VAR that was determined above to see if it's
15099 declared nonstring. Otherwise drill down into the referenced
15100 DECL. */
15115 }
15117 /* Return length of attribute names string,
15118 if arglist chain > 1, -1 otherwise. */
15120 int
15122 {
15123 tree arg;
15128 {
15133 argnum++;
15134 argnum++;
15135 }
15139 }
15141 void
15143 {
15146 }
15148 #if CHECKING_P
15152 /* Selftests for tree. */
15154 /* Verify that integer constants are sane. */
15156 static void
15158 {
15171 }
15173 /* Verify identifiers. */
15175 static void
15177 {
15181 }
15183 /* Verify LABEL_DECL. */
15185 static void
15187 {
15193 }
15195 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15196 are given by VALS. */
15198 static tree
15200 {
15205 }
15207 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15209 static void
15211 {
15217 }
15219 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15220 and that its elements match EXPECTED. */
15222 static void
15225 {
15232 }
15234 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15235 and NPATTERNS background elements, and that its elements match
15236 EXPECTED. */
15238 static void
15241 {
15248 }
15250 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15251 and that its elements match EXPECTED. */
15253 static void
15256 {
15263 }
15265 /* Test the creation of VECTOR_CSTs. */
15267 static void
15269 {
15275 /* Test a simple linear series with a base of 0 and a step of 1:
15276 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15282 /* Try the same with the first element replaced by 100:
15283 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15288 /* Try a series that wraps around.
15289 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15295 /* Try a downward series:
15296 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15302 /* Try two interleaved series with different bases and steps:
15303 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15306 {
15309 }
15313 /* Try a duplicated value:
15314 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15320 /* Try an interleaved duplicated value:
15321 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15328 /* Try a duplicated value with 2 exceptions
15329 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15335 /* Try with and without a step
15336 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15342 /* Try a fully-general constant:
15343 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15347 }
15349 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15350 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15351 modifying its argument in-place. */
15353 static void
15355 {
15358 }
15360 /* Verify location wrappers. */
15362 static void
15364 {
15369 /* Wrapping a constant. */
15379 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15382 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15387 /* Wrapping a STRING_CST. */
15399 /* Wrapping a variable. */
15402 integer_type_node);
15411 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15412 wrapper. */
15417 /* Verify that STRIP_NOPS removes wrappers. */
15421 }
15423 /* Test various tree predicates. Verify that location wrappers don't
15424 affect the results. */
15426 static void
15428 {
15429 /* Build various constants and wrappers around them. */
15457 /* TODO: vector constants. */
15459 /* Test integer_onep. */
15479 /* Test integer_zerop. */
15499 /* Test integer_all_onesp. */
15519 /* Test integer_minus_onep. */
15539 /* Test integer_each_onep. */
15559 /* Test integer_truep. */
15579 /* Test integer_nonzerop. */
15599 /* Test real_zerop. */
15619 /* Test real_onep. */
15639 /* Test real_minus_onep. */
15659 /* Test zerop. */
15679 /* Test tree_expr_nonnegative_p. */
15699 /* Test tree_expr_nonzero_p. */
15707 /* Test integer_valued_real_p. */
15714 /* Test integer_pow2p. */
15719 /* Test uniform_integer_cst_p. */
15738 }
15740 /* Check that string escaping works correctly. */
15742 static void
15744 {
15746 escaped_string msg;
15749 /* ASSERT_STREQ does not accept NULL as a valid test
15750 result, so we have to use ASSERT_EQ instead. */
15759 /* Ensure that we have -fmessage-length set to 0. */
15769 /* Now repeat the tests with -fmessage-length set to 5. */
15772 /* Note that the newline is not translated into an escape. */
15779 /* Restore the original message length setting. */
15781 }
15783 /* Run all of the selftests within this file. */
15785 void
15787 {
15795 }