| blob | 207293c48cba64c973d379779e69159eefdb1088 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2023 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
77 /* Names of tree components.
78 Used for printing out the tree and error messages. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
84 };
86 #undef DEFTREECODE
87 #undef END_OF_BASE_TREE_CODES
89 /* Each tree code class has an associated string representation.
90 These must correspond to the tree_code_class entries. */
93 {
104 "expression"
105 };
107 /* obstack.[ch] explicitly declined to prototype this. */
110 /* Statistics-gathering stuff. */
116 /* Keep in sync with tree.h:enum tree_node_kind. */
134 };
136 /* Unique id for next decl created. */
138 /* Unique id for next type created. */
140 /* Unique id for next debug decl created. Use negative numbers,
141 to catch erroneous uses. */
144 /* Since we cannot rehash a type after it is in the table, we have to
145 keep the hash code. */
149 tree type;
150 };
152 /* Initial size of the hash table (rounded to next prime). */
153 #define TYPE_HASH_INITIAL_SIZE 1000
156 {
160 static int
162 {
164 }
165 };
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
176 /* Hash table and temporary node for larger integer const values. */
180 {
183 };
187 /* Class and variable for making sure that there is a single POLY_INT_CST
188 for a given value. */
190 {
194 };
198 /* Hash table for optimization flags and target option flags. Use the same
199 hash table for both sets of options. Nodes for building the current
200 optimization and target option nodes. The assumption is most of the time
201 the options created will already be in the hash table, so we avoid
202 allocating and freeing up a node repeatably. */
207 {
210 };
214 /* General tree->tree mapping structure for use in hash tables. */
239 /* Number of operands for each OMP clause. */
241 {
329 };
332 {
420 };
422 /* Unless specific to OpenACC, we tend to internally maintain OpenMP-centric
423 clause names, but for use in diagnostics etc. would like to use the "user"
424 clause names. */
428 {
429 /* For OpenACC, the 'OMP_CLAUSE_MAP_KIND' of an 'OMP_CLAUSE_MAP' is used to
430 distinguish clauses as seen by the user. See also where front ends do
431 'build_omp_clause' with 'OMP_CLAUSE_MAP'. */
434 {
452 }
455 }
458 /* Return the tree node structure used by tree code CODE. */
462 {
464 {
467 {
479 }
493 }
496 {
497 /* tcc_constant cases. */
507 /* tcc_exceptional cases. */
524 }
525 }
528 /* Initialize tree_contains_struct to describe the hierarchy of tree
529 nodes. */
531 static void
533 {
537 {
544 /* Mark the TS structure itself. */
547 /* Mark all the structures that TS is derived from. */
549 {
629 }
630 }
632 /* Basic consistency checks for attributes used in fold. */
673 }
676 /* Init tree.cc. */
678 void
680 {
681 /* Initialize the hash table of types. */
682 type_hash_table
685 debug_expr_for_decl
688 value_expr_for_decl
702 /* Initialize the tree_contains_struct array. */
705 }
707 \f
708 /* The name of the object as the assembler will see it (but before any
709 translations made by ASM_OUTPUT_LABELREF). Often this is the same
710 as DECL_NAME. It is an IDENTIFIER_NODE. */
711 tree
713 {
717 }
719 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
720 (either of which may be NULL). Inform the FE, if this changes the
721 name. */
723 void
725 {
728 }
730 /* Return true if DECL may need an assembler name to be set. */
734 {
735 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
736 Rule merging. This makes type_odr_p to return true on those types during
737 LTO and by comparing the mangled name, we can say what types are intended
738 to be equivalent across compilation unit.
740 We do not store names of type_in_anonymous_namespace_p.
742 Record, union and enumeration type have linkage that allows use
743 to check type_in_anonymous_namespace_p. We do not mangle compound types
744 that always can be compared structurally.
746 Similarly for builtin types, we compare properties of their main variant.
747 A special case are integer types where mangling do make differences
748 between char/signed char/unsigned char etc. Storing name for these makes
749 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
750 See cp/mangle.cc:write_builtin_type for details. */
753 {
766 }
767 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
771 /* If DECL already has its assembler name set, it does not need a
772 new one. */
777 /* Abstract decls do not need an assembler name. */
781 /* For VAR_DECLs, only static, public and external symbols need an
782 assembler name. */
790 {
791 /* Do not set assembler name on builtins. Allow RTL expansion to
792 decide whether to expand inline or via a regular call. */
797 /* Functions represented in the callgraph need an assembler name. */
801 /* Unused and not public functions don't need an assembler name. */
804 }
807 }
809 /* If T needs an assembler name, have one created for it. */
811 void
813 {
815 {
816 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
817 diagnostics that use input_location to show locus
818 information. The problem here is that, at this point,
819 input_location is generally anchored to the end of the file
820 (since the parser is long gone), so we don't have a good
821 position to pin it to.
823 To alleviate this problem, this uses the location of T's
824 declaration. Examples of this are
825 testsuite/g++.dg/template/cond2.C and
826 testsuite/g++.dg/template/pr35240.C. */
833 }
834 }
836 /* When the target supports COMDAT groups, this indicates which group the
837 DECL is associated with. This can be either an IDENTIFIER_NODE or a
838 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
839 tree
841 {
846 }
848 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
849 tree
851 {
856 }
858 /* When the target supports named section, return its name as IDENTIFIER_NODE
859 or NULL if it is in no section. */
862 {
867 }
869 /* Set section name of NODE to VALUE (that is expected to be
870 identifier node) */
871 void
873 {
877 {
881 }
884 else
887 }
889 /* Set section name of NODE to match the section name of OTHER.
891 set_decl_section_name (decl, other) is equivalent to
892 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
893 efficient. */
894 void
896 {
899 {
903 else
906 }
907 else
908 {
913 }
914 }
916 /* Return TLS model of a variable NODE. */
917 enum tls_model
919 {
924 }
926 /* Set TLS model of variable NODE to MODEL. */
927 void
929 {
933 {
937 }
938 else
941 }
943 /* Compute the number of bytes occupied by a tree with code CODE.
944 This function cannot be used for nodes that have variable sizes,
945 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
946 size_t
948 {
950 {
953 {
970 }
974 {
998 }
1011 {
1023 }
1027 {
1048 }
1052 }
1053 }
1055 /* Compute the number of bytes occupied by NODE. This routine only
1056 looks at TREE_CODE, except for those nodes that have variable sizes. */
1057 size_t
1059 {
1062 {
1092 else
1094 }
1095 }
1097 /* Return tree node kind based on tree CODE. */
1099 static tree_node_kind
1101 {
1105 {
1123 {
1140 }
1146 }
1147 }
1149 /* Record interesting allocation statistics for a tree node with CODE
1150 and LENGTH. */
1152 static void
1154 {
1163 }
1165 /* Allocate and return a new UID from the DECL_UID namespace. */
1167 int
1169 {
1171 }
1173 /* Return a newly allocated node of code CODE. For decl and type
1174 nodes, some other fields are initialized. The rest of the node is
1175 initialized to zero. This function cannot be used for TREE_VEC,
1176 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1177 tree_code_size.
1179 Achoo! I got a code in the node. */
1181 tree
1183 {
1184 tree t;
1194 {
1202 {
1204 {
1207 }
1208 else
1210 }
1214 else
1215 {
1218 }
1231 /* Default to no attributes for type, but let target change that. */
1235 /* We have not yet computed the alias set for this type. */
1245 {
1253 /* All of these have side-effects, no matter what their
1254 operands are. */
1260 }
1265 {
1278 }
1282 /* Other classes need no special treatment. */
1284 }
1287 }
1289 /* Free tree node. */
1291 void
1293 {
1296 {
1306 }
1318 }
1319 \f
1320 /* Return a new node with the same contents as NODE except that its
1321 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1323 tree
1325 {
1326 tree t;
1343 {
1346 else
1347 {
1351 }
1354 {
1357 }
1358 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1360 {
1363 }
1365 {
1368 }
1370 {
1373 }
1374 }
1376 {
1378 /* The following is so that the debug code for
1379 the copy is different from the original type.
1380 The two statements usually duplicate each other
1381 (because they clear fields of the same union),
1382 but the optimizer should catch that. */
1386 /* Do not copy the values cache. */
1388 {
1391 }
1392 }
1394 {
1398 }
1400 {
1404 }
1407 }
1409 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1410 For example, this can copy a list made of TREE_LIST nodes. */
1412 tree
1414 {
1415 tree head;
1424 {
1428 }
1430 }
1432 \f
1433 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1434 INTEGER_CST with value CST and type TYPE. */
1436 static unsigned int
1438 {
1440 /* We need extra HWIs if CST is an unsigned integer with its
1441 upper bit set. */
1445 }
1447 /* Return a new INTEGER_CST with value CST and type TYPE. */
1449 static tree
1451 {
1457 {
1463 }
1466 {
1467 len--;
1471 }
1477 }
1479 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1481 static tree
1483 CXX_MEM_STAT_INFO)
1484 {
1496 }
1498 /* Create a constant tree that contains CST sign-extended to TYPE. */
1500 tree
1502 {
1503 /* Support legacy code. */
1508 }
1510 /* Create a constant tree that contains CST zero-extended to TYPE. */
1512 tree
1514 {
1516 }
1518 /* Create a constant tree that contains CST sign-extended to TYPE. */
1520 tree
1522 {
1525 }
1527 /* Constructs tree in type TYPE from with value given by CST. Signedness
1528 of CST is assumed to be the same as the signedness of TYPE. */
1530 tree
1532 {
1534 }
1536 /* We force the wide_int CST to the range of the type TYPE by sign or
1537 zero extending it. OVERFLOWABLE indicates if we are interested in
1538 overflow of the value, when >0 we are only interested in signed
1539 overflow, for <0 we are interested in any overflow. OVERFLOWED
1540 indicates whether overflow has already occurred. CONST_OVERFLOWED
1541 indicates whether constant overflow has already occurred. We force
1542 T's value to be within range of T's type (by setting to 0 or 1 all
1543 the bits outside the type's range). We set TREE_OVERFLOWED if,
1544 OVERFLOWED is nonzero,
1545 or OVERFLOWABLE is >0 and signed overflow occurs
1546 or OVERFLOWABLE is <0 and any overflow occurs
1547 We return a new tree node for the extended wide_int. The node
1548 is shared if no overflow flags are set. */
1551 tree
1554 {
1557 /* If we need to set overflow flags, return a new unshared node. */
1559 {
1563 {
1565 sign);
1566 tree t;
1569 else
1570 {
1573 {
1576 }
1578 }
1581 }
1582 }
1584 /* Else build a shared node. */
1586 }
1588 /* These are the hash table functions for the hash table of INTEGER_CST
1589 nodes of a sizetype. */
1591 /* Return the hash code X, an INTEGER_CST. */
1593 hashval_t
1595 {
1604 }
1606 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1607 is the same as that given by *Y, which is the same. */
1609 bool
1611 {
1625 }
1627 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1628 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1629 number of slots that can be cached for the type. */
1634 {
1636 /* Initialize cache. */
1638 {
1641 }
1644 {
1645 /* Create a new shared int. */
1648 }
1650 }
1652 /* Create an INT_CST node of TYPE and value CST.
1653 The returned node is always shared. For small integers we use a
1654 per-type vector cache, for larger ones we use a single hash table.
1655 The value is extended from its precision according to the sign of
1656 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1657 the upper bits and ensures that hashing and value equality based
1658 upon the underlying HOST_WIDE_INTs works without masking. */
1660 static tree
1662 {
1663 tree t;
1671 /* Verify that everything is canonical. */
1674 {
1679 }
1686 {
1687 /* Cache NULL pointer and zero bounds. */
1690 /* Cache upper bounds of pointers. */
1693 /* Cache 1 which is used for a non-zero range. */
1698 {
1700 /* Make sure no one is clobbering the shared constant. */
1704 }
1705 }
1707 {
1708 /* We just need to store a single HOST_WIDE_INT. */
1709 HOST_WIDE_INT hwi;
1712 else
1716 {
1719 /* Fallthru. */
1723 /* Ignore pointers, as they were already handled above. */
1727 /* Cache false or true. */
1736 {
1737 /* Cache [0, N). */
1741 }
1742 else
1743 {
1744 /* Cache [-1, N). */
1748 }
1756 }
1759 {
1761 /* Make sure no one is clobbering the shared constant. */
1768 }
1769 else
1770 {
1771 /* Use the cache of larger shared ints, using int_cst_node as
1772 a temporary. */
1780 {
1781 /* Insert this one into the hash table. */
1784 /* Make a new node for next time round. */
1786 }
1787 }
1788 }
1789 else
1790 {
1791 /* The value either hashes properly or we drop it on the floor
1792 for the gc to take care of. There will not be enough of them
1793 to worry about. */
1799 {
1800 /* Insert this one into the hash table. */
1803 }
1804 else
1806 }
1809 }
1811 hashval_t
1813 {
1821 }
1823 bool
1825 {
1832 }
1834 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1835 The elements must also have type TYPE. */
1837 tree
1839 {
1850 INSERT);
1852 {
1857 }
1859 }
1861 /* Create a constant tree with value VALUE in type TYPE. */
1863 tree
1865 {
1869 }
1871 /* Insert INTEGER_CST T into a cache of integer constants. And return
1872 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1873 is false, and T falls into the type's 'smaller values' range, there
1874 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1875 or the value is large, should an existing entry exist, it is
1876 returned (rather than inserting T). */
1878 tree
1880 {
1888 /* The caching indices here must match those in
1889 wide_int_to_type_1. */
1891 {
1894 /* Fallthru. */
1898 {
1906 }
1910 /* Cache false or true. */
1919 {
1920 /* Cache 0..N */
1923 /* This is a little hokie, but if the prec is smaller than
1924 what is necessary to hold param_integer_share_limit, then the
1925 obvious test will not get the correct answer. */
1927 {
1931 }
1934 }
1935 else
1936 {
1937 /* Cache -1..N */
1943 {
1945 {
1948 }
1951 }
1952 }
1956 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1957 members. */
1962 }
1965 {
1966 /* Look for it in the type's vector of small shared ints. */
1968 {
1971 }
1974 {
1977 }
1978 else
1980 }
1981 else
1982 {
1983 /* Use the cache of larger shared ints. */
1986 {
1987 /* If there is already an entry for the number verify it's the
1988 same value. */
1990 /* And return the cached value. */
1992 }
1993 else
1994 /* Otherwise insert this one into the hash table. */
1996 }
1999 }
2002 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2003 and the rest are zeros. */
2005 tree
2007 {
2012 }
2014 /* Checks that X is integer constant that can be expressed in (unsigned)
2015 HOST_WIDE_INT without loss of precision. */
2017 bool
2019 {
2022 }
2024 /* Build a newly constructed VECTOR_CST with the given values of
2025 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2027 tree
2030 {
2032 tree t;
2048 }
2050 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2051 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2053 tree
2055 {
2060 tree value;
2062 /* We can't construct a VECTOR_CST for a variable number of elements. */
2066 {
2068 {
2069 /* If NELTS is constant then this must be too. */
2073 }
2074 else
2076 }
2081 }
2083 /* Build a vector of type VECTYPE where all the elements are SCs. */
2084 tree
2086 {
2092 /* Verify that the vector type is suitable for SC. Note that there
2093 is some inconsistency in the type-system with respect to restrict
2094 qualifications of pointers. Vector types always have a main-variant
2095 element type and the qualification is applied to the vector-type.
2096 So TREE_TYPE (vector-type) does not return a properly qualified
2097 vector element-type. */
2102 {
2106 }
2109 else
2110 {
2116 }
2117 }
2119 /* If TYPE is not a vector type, just return SC, otherwise return
2120 build_vector_from_val (TYPE, SC). */
2122 tree
2124 {
2129 }
2131 /* Build a vector series of type TYPE in which element I has the value
2132 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2133 and a VEC_SERIES_EXPR otherwise. */
2135 tree
2137 {
2141 {
2151 }
2153 }
2155 /* Return a vector with the same number of units and number of bits
2156 as VEC_TYPE, but in which the elements are a linear series of unsigned
2157 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2159 tree
2161 {
2166 {
2167 index_elt_type = build_nonstandard_integer_type
2170 }
2176 }
2178 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2179 elements are A and the rest are B. */
2181 tree
2183 {
2186 /* Optimize the constant case. */
2193 }
2195 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2196 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2198 void
2200 {
2202 tree val;
2208 {
2209 /* Mostly ctors will have elts that don't have side-effects, so
2210 the usual case is to scan all the elements. Hence a single
2211 loop for both const and side effects, rather than one loop
2212 each (with early outs). */
2217 }
2221 }
2223 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2224 CONSTRUCTOR C. */
2226 void
2228 {
2230 tree val;
2236 {
2241 }
2242 }
2244 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2245 are in the vec pointed to by VALS. */
2246 tree
2248 {
2257 }
2259 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2260 INDEX and VALUE. */
2261 tree
2263 {
2271 }
2274 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2275 are in a list pointed to by VALS. */
2276 tree
2278 {
2279 tree t;
2283 {
2287 }
2290 }
2292 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2293 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2294 fields in the constructor remain null. */
2296 tree
2298 {
2305 }
2307 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2308 of elements, provided as index/value pairs. */
2310 tree
2312 {
2319 {
2323 }
2326 }
2328 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2330 tree
2332 {
2337 }
2339 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2341 tree
2343 {
2344 tree v;
2354 }
2356 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2358 tree
2360 {
2361 tree v;
2364 /* dconst{0,1,2,m1,half} are used in various places in
2365 the middle-end and optimizers, allow them here
2366 even for decimal floating point types as an exception
2367 by converting them to decimal. */
2371 {
2381 {
2382 /* Make sure to give zero the minimum quantum exponent for
2383 the type (which corresponds to all bits zero). */
2388 }
2389 else
2391 }
2393 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2394 Consider doing it via real_convert now. */
2401 }
2403 /* Like build_real, but first truncate D to the type. */
2405 tree
2407 {
2409 }
2411 /* Return a new REAL_CST node whose type is TYPE
2412 and whose value is the integer value of the INTEGER_CST node I. */
2414 REAL_VALUE_TYPE
2416 {
2417 REAL_VALUE_TYPE d;
2419 /* Clear all bits of the real value type so that we can later do
2420 bitwise comparisons to see if two values are the same. */
2426 }
2428 /* Given a tree representing an integer constant I, return a tree
2429 representing the same value as a floating-point constant of type TYPE. */
2431 tree
2433 {
2434 tree v;
2441 }
2443 /* Return a new REAL_CST node whose type is TYPE
2444 and whose value is the integer value I which has sign SGN. */
2446 tree
2448 {
2449 REAL_VALUE_TYPE d;
2451 /* Clear all bits of the real value type so that we can later do
2452 bitwise comparisons to see if two values are the same. */
2457 }
2459 /* Return a newly constructed STRING_CST node whose value is the LEN
2460 characters at STR when STR is nonnull, or all zeros otherwise.
2461 Note that for a C string literal, LEN should include the trailing NUL.
2462 The TREE_TYPE is not initialized. */
2464 tree
2466 {
2467 /* Do not waste bytes provided by padding of struct tree_string. */
2480 else
2485 }
2487 /* Return a newly constructed COMPLEX_CST node whose value is
2488 specified by the real and imaginary parts REAL and IMAG.
2489 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2490 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2492 tree
2494 {
2505 }
2507 /* Build a complex (inf +- 0i), such as for the result of cproj.
2508 TYPE is the complex tree type of the result. If NEG is true, the
2509 imaginary zero is negative. */
2511 tree
2513 {
2519 }
2521 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2522 element is set to 1. In particular, this is 1 + i for complex types. */
2524 tree
2526 {
2528 {
2531 }
2532 else
2534 }
2536 /* Return a constant of arithmetic type TYPE which is the
2537 multiplicative identity of the set TYPE. */
2539 tree
2541 {
2543 {
2553 /* We can only generate 1 for accum types. */
2558 {
2562 }
2571 }
2572 }
2574 /* Return an integer of type TYPE containing all 1's in as much precision as
2575 it contains, or a complex or vector whose subparts are such integers. */
2577 tree
2579 {
2581 {
2584 }
2585 else
2587 }
2589 /* Return a constant of arithmetic type TYPE which is the
2590 opposite of the multiplicative identity of the set TYPE. */
2592 tree
2594 {
2596 {
2606 /* We can only generate 1 for accum types. */
2613 {
2617 }
2626 }
2627 }
2629 /* Build 0 constant of type TYPE. This is used by constructor folding
2630 and thus the constant should be represented in memory by
2631 zero(es). */
2633 tree
2635 {
2637 {
2650 {
2654 }
2657 {
2661 }
2667 }
2668 }
2670 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2671 unsigned constant in which only the sign bit is set. Return null
2672 otherwise. */
2674 tree
2676 {
2677 /* Avoid having to choose between a real-only sign and a pair of signs.
2678 This could be relaxed if the choice becomes obvious later. */
2693 {
2696 }
2698 }
2700 /* Build a BINFO with LEN language slots. */
2702 tree
2704 {
2705 tree t;
2720 }
2722 /* Create a CASE_LABEL_EXPR tree node and return it. */
2724 tree
2726 {
2738 }
2740 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2741 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2742 The latter determines the length of the HOST_WIDE_INT vector. */
2744 tree
2746 {
2747 tree t;
2759 /* to_offset can only be applied to trees that are offset_int-sized
2760 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2761 must be exactly the precision of offset_int and so LEN is correct. */
2764 else
2770 }
2772 /* Build a newly constructed TREE_VEC node of length LEN. */
2774 tree
2776 {
2777 tree t;
2788 }
2790 /* Grow a TREE_VEC node to new length LEN. */
2792 tree
2794 {
2810 }
2811 \f
2812 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2813 fixed, and scalar, complex or vector. */
2815 bool
2817 {
2821 }
2823 /* Return 1 if EXPR is the integer constant zero or a complex constant
2824 of zero, or a location wrapper for such a constant. */
2826 bool
2828 {
2832 {
2844 }
2845 }
2847 /* Return 1 if EXPR is the integer constant one or the corresponding
2848 complex constant, or a location wrapper for such a constant. */
2850 bool
2852 {
2856 {
2868 }
2869 }
2871 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2872 return 1 if every piece is the integer constant one.
2873 Also return 1 for location wrappers for such a constant. */
2875 bool
2877 {
2883 else
2885 }
2887 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2888 it contains, or a complex or vector whose subparts are such integers,
2889 or a location wrapper for such a constant. */
2891 bool
2893 {
2911 }
2913 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2914 for such a constant. */
2916 bool
2918 {
2924 else
2926 }
2928 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2929 one bit on), or a location wrapper for such a constant. */
2931 bool
2933 {
2945 }
2947 /* Return 1 if EXPR is an integer constant other than zero or a
2948 complex constant other than zero, or a location wrapper for such a
2949 constant. */
2951 bool
2953 {
2961 }
2963 /* Return 1 if EXPR is the integer constant one. For vector,
2964 return 1 if every piece is the integer constant minus one
2965 (representing the value TRUE).
2966 Also return 1 for location wrappers for such a constant. */
2968 bool
2970 {
2976 }
2978 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2979 for such a constant. */
2981 bool
2983 {
2988 }
2990 /* Return the power of two represented by a tree node known to be a
2991 power of two. */
2993 int
2995 {
3000 }
3002 /* Similar, but return the largest integer Y such that 2 ** Y is less
3003 than or equal to EXPR. */
3005 int
3007 {
3012 }
3014 /* Return number of known trailing zero bits in EXPR, or, if the value of
3015 EXPR is known to be zero, the precision of it's type. */
3017 unsigned int
3019 {
3026 {
3047 /* Second operand is sizetype, which could be in theory
3048 wider than pointer's precision. Make sure we never
3049 return more than prec. */
3064 {
3067 }
3072 {
3077 }
3086 {
3089 {
3094 }
3095 }
3097 CASE_CONVERT:
3115 {
3118 }
3122 }
3123 }
3125 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
3126 decimal float constants, so don't return 1 for them.
3127 Also return 1 for location wrappers around such a constant. */
3129 bool
3131 {
3135 {
3143 {
3144 /* Don't simply check for a duplicate because the predicate
3145 accepts both +0.0 and -0.0. */
3151 }
3154 }
3155 }
3157 /* Return 1 if EXPR is the real constant one in real or complex form.
3158 Trailing zeroes matter for decimal float constants, so don't return
3159 1 for them.
3160 Also return 1 for location wrappers around such a constant. */
3162 bool
3164 {
3168 {
3181 }
3182 }
3184 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3185 matter for decimal float constants, so don't return 1 for them.
3186 Also return 1 for location wrappers around such a constant. */
3188 bool
3190 {
3194 {
3207 }
3208 }
3210 /* Return true if T could be a floating point zero. */
3212 bool
3214 {
3216 {
3218 /* Can't use real_zerop here, as it always returns false for decimal
3219 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3220 either, as decimal zeros are rvc_normal. */
3226 {
3232 }
3234 /* Perhaps for SSA_NAMEs we could query frange. */
3236 }
3237 }
3239 /* Nonzero if EXP is a constant or a cast of a constant. */
3241 bool
3243 {
3244 /* This is not quite the same as STRIP_NOPS. It does more. */
3249 }
3251 /* Return true if T holds a polynomial pointer difference, storing it in
3252 *VALUE if so. A true return means that T's precision is no greater
3253 than 64 bits, which is the largest address space we support, so *VALUE
3254 never loses precision. However, the signedness of the result does
3255 not necessarily match the signedness of T: sometimes an unsigned type
3256 like sizetype is used to encode a value that is actually negative. */
3258 bool
3260 {
3264 {
3269 }
3271 {
3278 }
3280 }
3282 poly_int64
3284 {
3289 }
3291 poly_uint64
3293 {
3298 }
3299 \f
3300 /* Return first list element whose TREE_VALUE is ELEM.
3301 Return 0 if ELEM is not in LIST. */
3303 tree
3305 {
3307 {
3311 }
3313 }
3315 /* Return first list element whose TREE_PURPOSE is ELEM.
3316 Return 0 if ELEM is not in LIST. */
3318 tree
3320 {
3322 {
3326 }
3328 }
3330 /* Return true if ELEM is in V. */
3332 bool
3334 {
3336 tree t;
3341 }
3343 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3344 NULL_TREE. */
3346 tree
3348 {
3352 }
3354 /* Return nonzero if ELEM is part of the chain CHAIN. */
3356 bool
3358 {
3360 {
3364 }
3367 }
3369 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3370 We expect a null pointer to mark the end of the chain.
3371 This is the Lisp primitive `length'. */
3373 int
3375 {
3377 #ifdef ENABLE_TREE_CHECKING
3379 #endif
3383 {
3385 #ifdef ENABLE_TREE_CHECKING
3389 #endif
3390 len++;
3391 }
3394 }
3396 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3397 UNION_TYPE TYPE, or NULL_TREE if none. */
3399 tree
3401 {
3406 }
3408 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3409 UNION_TYPE TYPE, or NULL_TREE if none. */
3411 tree
3413 {
3417 {
3422 }
3425 }
3427 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3428 by modifying the last node in chain 1 to point to chain 2.
3429 This is the Lisp primitive `nconc'. */
3431 tree
3433 {
3434 tree t1;
3445 #ifdef ENABLE_TREE_CHECKING
3446 {
3447 tree t2;
3450 }
3451 #endif
3454 }
3456 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3458 tree
3460 {
3461 tree next;
3466 }
3468 /* Reverse the order of elements in the chain T,
3469 and return the new head of the chain (old last element). */
3471 tree
3473 {
3476 {
3477 /* We shouldn't be using this function to reverse BLOCK chains; we
3478 have blocks_nreverse for that. */
3483 }
3485 }
3486 \f
3487 /* Return a newly created TREE_LIST node whose
3488 purpose and value fields are PARM and VALUE. */
3490 tree
3492 {
3497 }
3499 /* Build a chain of TREE_LIST nodes from a vector. */
3501 tree
3503 {
3507 tree t;
3509 {
3512 }
3514 }
3516 /* Return a newly created TREE_LIST node whose
3517 purpose and value fields are PURPOSE and VALUE
3518 and whose TREE_CHAIN is CHAIN. */
3520 tree
3522 {
3523 tree node;
3535 }
3537 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3538 trees. */
3542 {
3546 tree val;
3552 }
3553 \f
3554 /* Return the size nominally occupied by an object of type TYPE
3555 when it resides in memory. The value is measured in units of bytes,
3556 and its data type is that normally used for type sizes
3557 (which is the first type created by make_signed_type or
3558 make_unsigned_type). */
3560 tree
3562 {
3563 tree t;
3572 {
3575 }
3578 }
3580 /* Return the size of TYPE (in bytes) as a wide integer
3581 or return -1 if the size can vary or is larger than an integer. */
3583 HOST_WIDE_INT
3585 {
3586 tree t;
3596 else
3598 }
3600 /* Return the maximum size of TYPE (in bytes) as a wide integer
3601 or return -1 if the size can vary or is larger than an integer. */
3603 HOST_WIDE_INT
3605 {
3607 tree size_tree;
3609 /* If this is an array type, check for a possible MAX_SIZE attached. */
3612 {
3617 }
3619 /* If we still haven't been able to get a size, see if the language
3620 can compute a maximum size. */
3623 {
3628 }
3631 }
3632 \f
3633 /* Return the bit position of FIELD, in bits from the start of the record.
3634 This is a tree of type bitsizetype. */
3636 tree
3638 {
3641 }
3642 \f
3643 /* Return the byte position of FIELD, in bytes from the start of the record.
3644 This is a tree of type sizetype. */
3646 tree
3648 {
3651 }
3653 /* Likewise, but return as an integer. It must be representable in
3654 that way (since it could be a signed value, we don't have the
3655 option of returning -1 like int_size_in_byte can. */
3657 HOST_WIDE_INT
3659 {
3661 }
3662 \f
3663 /* Return, as a tree node, the number of elements for TYPE (which is an
3664 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3666 tree
3668 {
3671 /* If they did it with unspecified bounds, then we should have already
3672 given an error about it before we got here. */
3680 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3682 {
3683 /* zero sized arrays are represented from C FE as complete types with
3684 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3685 them as min 0, max -1. */
3692 }
3695 ? max
3697 }
3698 \f
3699 /* If arg is static -- a reference to an object in static storage -- then
3700 return the object. This is not the same as the C meaning of `static'.
3701 If arg isn't static, return NULL. */
3703 tree
3705 {
3707 {
3709 /* Nested functions are static, even though taking their address will
3710 involve a trampoline as we unnest the nested function and create
3711 the trampoline on the tree level. */
3732 /* If the thing being referenced is not a field, then it is
3733 something language specific. */
3736 /* If we are referencing a bitfield, we can't evaluate an
3737 ADDR_EXPR at compile time and so it isn't a constant. */
3754 else
3762 }
3763 }
3765 \f
3768 /* Return whether OP is a DECL whose address is function-invariant. */
3770 bool
3772 {
3773 /* The conditions below are slightly less strict than the one in
3774 staticp. */
3777 {
3800 }
3803 }
3805 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3807 bool
3809 {
3810 /* The conditions below are slightly less strict than the one in
3811 staticp. */
3814 {
3834 }
3837 }
3840 /* Return true if T is function-invariant (internal function, does
3841 not handle arithmetic; that's handled in skip_simple_arithmetic and
3842 tree_invariant_p). */
3844 static bool
3846 {
3847 tree op;
3854 {
3861 {
3863 {
3878 }
3880 }
3886 }
3889 }
3891 /* Return true if T is function-invariant. */
3893 bool
3895 {
3898 }
3900 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3901 Do this to any expression which may be used in more than one place,
3902 but must be evaluated only once.
3904 Normally, expand_expr would reevaluate the expression each time.
3905 Calling save_expr produces something that is evaluated and recorded
3906 the first time expand_expr is called on it. Subsequent calls to
3907 expand_expr just reuse the recorded value.
3909 The call to expand_expr that generates code that actually computes
3910 the value is the first call *at compile time*. Subsequent calls
3911 *at compile time* generate code to use the saved value.
3912 This produces correct result provided that *at run time* control
3913 always flows through the insns made by the first expand_expr
3914 before reaching the other places where the save_expr was evaluated.
3915 You, the caller of save_expr, must make sure this is so.
3917 Constants, and certain read-only nodes, are returned with no
3918 SAVE_EXPR because that is safe. Expressions containing placeholders
3919 are not touched; see tree.def for an explanation of what these
3920 are used for. */
3922 tree
3924 {
3925 tree inner;
3927 /* If the tree evaluates to a constant, then we don't want to hide that
3928 fact (i.e. this allows further folding, and direct checks for constants).
3929 However, a read-only object that has side effects cannot be bypassed.
3930 Since it is no problem to reevaluate literals, we just return the
3931 literal node. */
3939 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3940 it means that the size or offset of some field of an object depends on
3941 the value within another field.
3943 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3944 and some variable since it would then need to be both evaluated once and
3945 evaluated more than once. Front-ends must assure this case cannot
3946 happen by surrounding any such subexpressions in their own SAVE_EXPR
3947 and forcing evaluation at the proper time. */
3953 /* This expression might be placed ahead of a jump to ensure that the
3954 value was computed on both sides of the jump. So make sure it isn't
3955 eliminated as dead. */
3958 }
3960 /* Look inside EXPR into any simple arithmetic operations. Return the
3961 outermost non-arithmetic or non-invariant node. */
3963 tree
3965 {
3966 /* We don't care about whether this can be used as an lvalue in this
3967 context. */
3971 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3972 a constant, it will be more efficient to not make another SAVE_EXPR since
3973 it will allow better simplification and GCSE will be able to merge the
3974 computations if they actually occur. */
3976 {
3980 {
3985 else
3987 }
3988 else
3990 }
3993 }
3995 /* Look inside EXPR into simple arithmetic operations involving constants.
3996 Return the outermost non-arithmetic or non-constant node. */
3998 tree
4000 {
4005 {
4009 {
4014 else
4016 }
4017 else
4019 }
4022 }
4024 /* Return which tree structure is used by T. */
4026 enum tree_node_structure_enum
4028 {
4031 }
4033 /* Set various status flags when building a CALL_EXPR object T. */
4035 static void
4037 {
4042 /* Calls have side-effects, except those to const or pure functions. */
4045 /* Propagate TREE_READONLY of arguments for const functions. */
4051 {
4057 }
4061 }
4062 \f
4063 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4064 size or offset that depends on a field within a record. */
4066 bool
4068 {
4079 {
4081 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4082 position computations since they will be converted into a
4083 WITH_RECORD_EXPR involving the reference, which will assume
4084 here will be valid. */
4098 {
4100 /* Ignoring the first operand isn't quite right, but works best. */
4109 /* The save_expr function never wraps anything containing
4110 a PLACEHOLDER_EXPR. */
4115 }
4118 {
4126 }
4130 {
4132 {
4133 const_tree arg;
4134 const_call_expr_arg_iterator iter;
4139 }
4142 }
4146 }
4148 }
4150 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4151 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4152 field positions. */
4154 static bool
4156 {
4157 /* If the size contains a placeholder or the parent type (component type in
4158 the case of arrays) type involves a placeholder, this type does. */
4166 /* Now do type-specific checks. Note that the last part of the check above
4167 greatly limits what we have to do below. */
4169 {
4187 /* Here we just check the bounds. */
4192 /* We have already checked the component type above, so just check
4193 the domain type. Flexible array members have a null domain. */
4200 {
4201 tree field;
4212 }
4216 }
4217 }
4219 /* Wrapper around above function used to cache its result. */
4221 bool
4223 {
4226 /* If the contains_placeholder_bits field has been initialized,
4227 then we know the answer. */
4231 /* Indicate that we've seen this type node, and the answer is false.
4232 This is what we want to return if we run into recursion via fields. */
4235 /* Compute the real value. */
4238 /* Store the real value. */
4242 }
4243 \f
4244 /* Push tree EXP onto vector QUEUE if it is not already present. */
4246 static void
4248 {
4250 tree iter;
4258 }
4260 /* Given a tree EXP, find all occurrences of references to fields
4261 in a PLACEHOLDER_EXPR and place them in vector REFS without
4262 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4263 we assume here that EXP contains only arithmetic expressions
4264 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4265 argument list. */
4267 void
4269 {
4271 tree inner;
4274 /* We handle TREE_LIST and COMPONENT_REF separately. */
4276 {
4279 }
4281 {
4285 ;
4289 else
4291 }
4292 else
4294 {
4299 /* Variables allocated to static storage can stay. */
4305 /* This is the pattern built in ada/make_aligning_type. */
4308 {
4311 }
4313 /* Fall through. */
4331 }
4332 }
4334 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4335 return a tree with all occurrences of references to F in a
4336 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4337 CONST_DECLs. Note that we assume here that EXP contains only
4338 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4339 occurring only in their argument list. */
4341 tree
4343 {
4346 tree new_tree;
4348 /* We handle TREE_LIST and COMPONENT_REF separately. */
4350 {
4357 }
4359 {
4360 tree inner;
4362 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4363 and it is the right field, replace it with R. */
4367 ;
4369 /* The field. */
4375 /* If this expression hasn't been completed let, leave it alone. */
4383 new_tree
4385 }
4386 else
4388 {
4395 else
4402 /* Fall through. */
4410 {
4455 new_tree
4461 }
4465 {
4470 /* If we are trying to replace F with a constant or with another
4471 instance of one of the arguments of the call, inline back
4472 functions which do nothing else than computing a value from
4473 the arguments they are passed. This makes it possible to
4474 fold partially or entirely the replacement expression. */
4476 {
4480 else
4483 {
4486 }
4488 {
4492 }
4493 }
4496 {
4500 {
4504 }
4505 }
4508 {
4512 }
4513 else
4515 }
4520 }
4528 }
4530 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4531 for it within OBJ, a tree that is an object or a chain of references. */
4533 tree
4535 {
4538 tree new_tree;
4540 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4541 in the chain of OBJ. */
4543 {
4545 tree elt;
4575 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4576 survives until RTL generation, there will be an error. */
4578 }
4580 /* TREE_LIST is special because we need to look at TREE_VALUE
4581 and TREE_CHAIN, not TREE_OPERANDS. */
4583 {
4590 }
4591 else
4593 {
4606 {
4651 new_tree
4657 }
4661 {
4667 {
4671 {
4675 }
4676 }
4679 {
4683 }
4684 else
4686 }
4691 }
4699 }
4700 \f
4702 /* Subroutine of stabilize_reference; this is called for subtrees of
4703 references. Any expression with side-effects must be put in a SAVE_EXPR
4704 to ensure that it is only evaluated once.
4706 We don't put SAVE_EXPR nodes around everything, because assigning very
4707 simple expressions to temporaries causes us to miss good opportunities
4708 for optimizations. Among other things, the opportunity to fold in the
4709 addition of a constant into an addressing mode often gets lost, e.g.
4710 "y[i+1] += x;". In general, we take the approach that we should not make
4711 an assignment unless we are forced into it - i.e., that any non-side effect
4712 operator should be allowed, and that cse should take care of coalescing
4713 multiple utterances of the same expression should that prove fruitful. */
4715 static tree
4717 {
4718 tree result;
4721 /* We cannot ignore const expressions because it might be a reference
4722 to a const array but whose index contains side-effects. But we can
4723 ignore things that are actual constant or that already have been
4724 handled by this function. */
4730 {
4732 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4733 have side-effects. */
4736 /* FALLTHRU */
4744 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4745 so that it will only be evaluated once. */
4746 /* The reference (r) and comparison (<) classes could be handled as
4747 below, but it is generally faster to only evaluate them once. */
4753 /* Constants need no processing. In fact, we should never reach
4754 here. */
4758 /* Division is slow and tends to be compiled with jumps,
4759 especially the division by powers of 2 that is often
4760 found inside of an array reference. So do it just once. */
4766 /* Recursively stabilize each operand. */
4772 /* Recursively stabilize each operand. */
4778 }
4786 }
4788 /* Stabilize a reference so that we can use it any number of times
4789 without causing its operands to be evaluated more than once.
4790 Returns the stabilized reference. This works by means of save_expr,
4791 so see the caveats in the comments about save_expr.
4793 Also allows conversion expressions whose operands are references.
4794 Any other kind of expression is returned unchanged. */
4796 tree
4798 {
4799 tree result;
4803 {
4807 /* No action is needed in this case. */
4810 CASE_CONVERT:
4849 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4850 it wouldn't be ignored. This matters when dealing with
4851 volatiles. */
4854 /* If arg isn't a kind of lvalue we recognize, make no change.
4855 Caller should recognize the error for an invalid lvalue. */
4861 }
4870 }
4871 \f
4872 /* Low-level constructors for expressions. */
4874 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4875 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4877 void
4879 {
4880 tree node;
4885 /* We started out assuming this address is both invariant and constant, but
4886 does not have side effects. Now go down any handled components and see if
4887 any of them involve offsets that are either non-constant or non-invariant.
4888 Also check for side-effects.
4890 ??? Note that this code makes no attempt to deal with the case where
4891 taking the address of something causes a copy due to misalignment. */
4893 #define UPDATE_FLAGS(NODE) \
4894 do { tree _node = (NODE); \
4895 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4896 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4900 {
4901 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4902 array reference (probably made temporarily by the G++ front end),
4903 so ignore all the operands. */
4907 {
4913 }
4914 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4915 FIELD_DECL, apparently. The G++ front end can put something else
4916 there, at least temporarily. */
4919 {
4922 }
4923 }
4927 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4928 the address, since &(*a)->b is a form of addition. If it's a constant, the
4929 address is constant too. If it's a decl, its address is constant if the
4930 decl is static. Everything else is not constant and, furthermore,
4931 taking the address of a volatile variable is not volatile. */
4936 ;
4939 else
4940 {
4943 }
4948 #undef UPDATE_FLAGS
4949 }
4951 /* Build an expression of code CODE, data type TYPE, and operands as
4952 specified. Expressions and reference nodes can be created this way.
4953 Constants, decls, types and misc nodes cannot be.
4955 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4956 enough for all extant tree codes. */
4958 tree
4960 {
4961 tree t;
4969 }
4971 tree
4973 {
4975 tree t;
4991 {
4994 }
4997 {
5000 }
5002 {
5004 /* All of these have side-effects, no matter what their
5005 operands are. */
5011 /* Whether a dereference is readonly has nothing to do with whether
5012 its operand is readonly. */
5030 }
5033 }
5035 #define PROCESS_ARG(N) \
5036 do { \
5037 TREE_OPERAND (t, N) = arg##N; \
5038 if (arg##N &&!TYPE_P (arg##N)) \
5039 { \
5040 if (TREE_SIDE_EFFECTS (arg##N)) \
5041 side_effects = 1; \
5042 if (!TREE_READONLY (arg##N) \
5043 && !CONSTANT_CLASS_P (arg##N)) \
5044 (void) (read_only = 0); \
5045 if (!TREE_CONSTANT (arg##N)) \
5046 (void) (constant = 0); \
5047 } \
5048 } while (0)
5050 tree
5052 {
5054 tree t;
5060 /* When sizetype precision doesn't match that of pointers
5061 we need to be able to build explicit extensions or truncations
5062 of the offset argument. */
5074 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5075 result based on those same flags for the arguments. But if the
5076 arguments aren't really even `tree' expressions, we shouldn't be trying
5077 to do this. */
5079 /* Expressions without side effects may be constant if their
5080 arguments are as well. */
5087 {
5101 }
5108 {
5110 {
5114 }
5115 }
5116 else
5117 {
5119 /* Don't mark X / 0 as constant. */
5124 }
5127 }
5130 tree
5132 tree arg2 MEM_STAT_DECL)
5133 {
5135 tree t;
5145 /* As a special exception, if COND_EXPR has NULL branches, we
5146 assume that it is a gimple statement and always consider
5147 it to have side effects. */
5153 else
5169 }
5171 tree
5174 {
5176 tree t;
5196 }
5198 tree
5201 {
5203 tree t;
5220 {
5222 {
5226 }
5227 }
5228 else
5234 }
5236 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5237 on the pointer PTR. */
5239 tree
5241 {
5244 tree tem;
5245 /* For convenience allow addresses that collapse to a simple base
5246 and offset. */
5250 {
5254 {
5257 }
5258 else
5261 }
5266 }
5268 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5270 poly_offset_int
5272 {
5274 SIGNED);
5275 }
5277 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5278 offsetted by OFFSET units. */
5280 tree
5282 {
5289 }
5291 /* Similar except don't specify the TREE_TYPE
5292 and leave the TREE_SIDE_EFFECTS as 0.
5293 It is permissible for arguments to be null,
5294 or even garbage if their values do not matter. */
5296 tree
5298 {
5299 tree t;
5316 }
5318 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5319 tree vec. */
5321 tree
5323 {
5333 }
5334 \f
5335 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5336 and data type TYPE.
5337 We do NOT enter this node in any sort of symbol table.
5339 LOC is the location of the decl.
5341 layout_decl is used to set up the decl's storage layout.
5342 Other slots are initialized to 0 or null pointers. */
5344 tree
5346 tree type MEM_STAT_DECL)
5347 {
5348 tree t;
5353 /* if (type == error_mark_node)
5354 type = integer_type_node; */
5355 /* That is not done, deliberately, so that having error_mark_node
5356 as the type can suppress useless errors in the use of this variable. */
5365 }
5367 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5369 tree
5371 {
5377 }
5379 /* Builds and returns function declaration with NAME and TYPE. */
5381 tree
5383 {
5393 }
5397 /* Builds a new translation-unit decl with name NAME, queues it in the
5398 global list of translation-unit decls and returns it. */
5400 tree
5402 {
5408 }
5410 \f
5411 /* BLOCK nodes are used to represent the structure of binding contours
5412 and declarations, once those contours have been exited and their contents
5413 compiled. This information is used for outputting debugging info. */
5415 tree
5417 {
5425 }
5427 \f
5428 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5430 LOC is the location to use in tree T. */
5432 void
5434 {
5438 {
5442 }
5443 }
5445 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5446 UNKNOWN_LOCATION. */
5448 void
5450 {
5454 }
5455 \f
5456 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5457 of the various TYPE_QUAL values. */
5459 static void
5461 {
5467 }
5469 /* Returns true iff CAND and BASE have equivalent language-specific
5470 qualifiers. */
5472 bool
5474 {
5477 /* type_hash_eq currently only applies to these types. */
5482 }
5484 /* This function checks to see if TYPE matches the size one of the built-in
5485 atomic types, and returns that core atomic type. */
5487 static tree
5489 {
5490 tree base_atomic_type;
5492 /* Only handle complete types. */
5497 {
5520 }
5523 }
5525 /* Returns true iff unqualified CAND and BASE are equivalent. */
5527 bool
5529 {
5531 /* Apparently this is needed for Objective-C. */
5536 /* Check alignment. */
5540 /* Atomic types increase minimal alignment. We must to do so as well
5541 or we get duplicated canonical types. See PR88686. */
5543 {
5544 /* See if this object can map to a basic atomic type. */
5548 }
5550 }
5552 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5554 bool
5556 {
5560 }
5562 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5564 static bool
5566 {
5569 /* Apparently this is needed for Objective-C. */
5571 /* Check alignment. */
5573 /* Check this is a user-aligned type as build_aligned_type
5574 would create. */
5579 }
5581 /* Return a version of the TYPE, qualified as indicated by the
5582 TYPE_QUALS, if one exists. If no qualified version exists yet,
5583 return NULL_TREE. */
5585 tree
5587 {
5595 /* Search the chain of variants to see if there is already one there just
5596 like the one we need to have. If so, use that existing one. We must
5597 preserve the TYPE_NAME, since there is code that depends on this. */
5600 {
5601 /* Put the found variant at the head of the variant list so
5602 frequently searched variants get found faster. The C++ FE
5603 benefits greatly from this. */
5609 }
5612 }
5614 /* Like get_qualified_type, but creates the type if it does not
5615 exist. This function never returns NULL_TREE. */
5617 tree
5619 {
5620 tree t;
5622 /* See if we already have the appropriate qualified variant. */
5625 /* If not, build it. */
5627 {
5632 {
5633 /* See if this object can map to a basic atomic type. */
5636 {
5637 /* Ensure the alignment of this type is compatible with
5638 the required alignment of the atomic type. */
5641 }
5642 }
5645 /* Propagate structural equality. */
5648 /* Build the underlying canonical type, since it is different
5649 from TYPE. */
5650 {
5653 }
5654 else
5655 /* T is its own canonical type. */
5658 }
5661 }
5663 /* Create a variant of type T with alignment ALIGN. */
5665 tree
5667 {
5668 tree t;
5683 }
5685 /* Create a new distinct copy of TYPE. The new type is made its own
5686 MAIN_VARIANT. If TYPE requires structural equality checks, the
5687 resulting type requires structural equality checks; otherwise, its
5688 TYPE_CANONICAL points to itself. */
5690 tree
5692 {
5698 /* Set the canonical type either to a new equivalence class, or
5699 propagate the need for structural equality checks. */
5702 else
5705 /* Make it its own variant. */
5709 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5710 whose TREE_TYPE is not t. This can also happen in the Ada
5711 frontend when using subtypes. */
5714 }
5716 /* Create a new variant of TYPE, equivalent but distinct. This is so
5717 the caller can modify it. TYPE_CANONICAL for the return type will
5718 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5719 are considered equal by the language itself (or that both types
5720 require structural equality checks). */
5722 tree
5724 {
5729 /* Since we're building a variant, assume that it is a non-semantic
5730 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5732 /* Type variants have no alias set defined. */
5735 /* Add the new type to the chain of variants of TYPE. */
5741 }
5742 \f
5743 /* Return true if the from tree in both tree maps are equal. */
5745 int
5747 {
5751 }
5753 /* Hash a from tree in a tree_base_map. */
5755 unsigned int
5757 {
5759 }
5761 /* Return true if this tree map structure is marked for garbage collection
5762 purposes. We simply return true if the from tree is marked, so that this
5763 structure goes away when the from tree goes away. */
5765 int
5767 {
5769 }
5771 /* Hash a from tree in a tree_map. */
5773 unsigned int
5775 {
5777 }
5779 /* Hash a from tree in a tree_decl_map. */
5781 unsigned int
5783 {
5785 }
5787 /* Return the initialization priority for DECL. */
5789 priority_type
5791 {
5796 return
5798 }
5800 /* Return the finalization priority for DECL. */
5802 priority_type
5804 {
5809 return
5811 }
5813 /* Set the initialization priority for DECL to PRIORITY. */
5815 void
5817 {
5821 {
5825 }
5828 else
5831 }
5833 /* Set the finalization priority for DECL to PRIORITY. */
5835 void
5837 {
5841 {
5845 }
5846 else
5849 }
5851 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5853 static void
5855 {
5860 }
5862 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5864 static void
5866 {
5871 }
5873 /* Lookup a debug expression for FROM, and return it if we find one. */
5875 tree
5877 {
5885 }
5887 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5889 void
5891 {
5898 }
5900 /* Lookup a value expression for FROM, and return it if we find one. */
5902 tree
5904 {
5912 }
5914 /* Insert a mapping FROM->TO in the value expression hashtable. */
5916 void
5918 {
5921 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5928 }
5930 /* Lookup a vector of debug arguments for FROM, and return it if we
5931 find one. */
5935 {
5946 }
5948 /* Insert a mapping FROM->empty vector of debug arguments in the value
5949 expression hashtable. */
5953 {
5968 }
5970 /* Hashing of types so that we don't make duplicates.
5971 The entry point is `type_hash_canon'. */
5973 /* Generate the default hash code for TYPE. This is designed for
5974 speed, rather than maximum entropy. */
5976 hashval_t
5978 {
5987 /* Just the identifier is adequate to distinguish. */
5991 {
5994 /* FALLTHROUGH. */
6006 {
6010 {
6013 }
6014 }
6018 {
6025 }
6029 {
6033 }
6041 }
6044 }
6046 /* These are the Hashtable callback functions. */
6048 /* Returns true iff the types are equivalent. */
6050 bool
6052 {
6053 /* First test the things that are the same for all types. */
6063 /* Be careful about comparing arrays before and after the element type
6064 has been completed; don't compare TYPE_ALIGN unless both types are
6065 complete. */
6072 {
6095 /* fall through */
6127 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6128 where the flag should be inherited from the element type
6129 and can change after ARRAY_TYPEs are created; on non-aggregates
6130 compare it and hash it, scalars will never have that flag set
6131 and we need to differentiate between arrays created by different
6132 front-ends or middle-end created arrays. */
6164 }
6170 }
6172 /* Given TYPE, and HASHCODE its hash code, return the canonical
6173 object for an identical type if one already exists.
6174 Otherwise, return TYPE, and record it as the canonical object.
6176 To use this function, first create a type of the sort you want.
6177 Then compute its hash code from the fields of the type that
6178 make it different from other similar types.
6179 Then call this function and use the value. */
6181 tree
6183 {
6184 type_hash in;
6187 /* The hash table only contains main variants, so ensure that's what we're
6188 being passed. */
6191 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6192 must call that routine before comparing TYPE_ALIGNs. */
6200 {
6206 /* Free also min/max values and the cache for integer
6207 types. This can't be done in free_node, as LTO frees
6208 those on its own. */
6210 {
6213 {
6214 /* Zero is always in TYPE_CACHED_VALUES. */
6218 }
6221 {
6224 }
6227 }
6230 }
6231 else
6232 {
6241 }
6242 }
6244 static void
6246 {
6251 }
6253 /* Given two lists of types
6254 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6255 return 1 if the lists contain the same types in the same order.
6256 Also, the TREE_PURPOSEs must match. */
6258 bool
6260 {
6272 }
6274 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6275 given by TYPE. If the argument list accepts variable arguments,
6276 then this function counts only the ordinary arguments. */
6278 int
6280 {
6284 /* If the function does not take a variable number of arguments,
6285 the last element in the list will have type `void'. */
6288 else
6292 }
6294 /* Return the type of the function TYPE's argument ARGNO if known.
6295 For vararg function's where ARGNO refers to one of the variadic
6296 arguments return null. Otherwise, return a void_type_node for
6297 out-of-bounds ARGNO. */
6299 tree
6301 {
6302 /* Treat zero the same as an out-of-bounds argument number. */
6306 function_args_iterator iter;
6308 tree argtype;
6311 {
6312 /* A vararg function's argument list ends in a null. Otherwise,
6313 an ordinary function's argument list ends with void. Return
6314 null if ARGNO refers to a vararg argument, void_type_node if
6315 it's out of bounds, and the formal argument type otherwise. */
6323 }
6326 }
6328 /* Nonzero if integer constants T1 and T2
6329 represent the same constant value. */
6331 int
6333 {
6349 }
6351 /* Return true if T is an INTEGER_CST whose numerical value (extended
6352 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6354 bool
6356 {
6360 }
6362 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6363 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6365 bool
6367 {
6371 {
6376 }
6379 }
6381 /* Return true if T is an INTEGER_CST whose numerical value (extended
6382 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6384 bool
6386 {
6390 }
6392 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6393 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6395 bool
6397 {
6401 {
6406 }
6409 }
6411 /* T is an INTEGER_CST whose numerical value (extended according to
6412 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6413 HOST_WIDE_INT. */
6415 HOST_WIDE_INT
6417 {
6420 }
6422 /* T is an INTEGER_CST whose numerical value (extended according to
6423 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6424 HOST_WIDE_INT. */
6426 unsigned HOST_WIDE_INT
6428 {
6431 }
6433 /* Return the most significant (sign) bit of T. */
6435 int
6437 {
6441 }
6443 /* Return an indication of the sign of the integer constant T.
6444 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6445 Note that -1 will never be returned if T's type is unsigned. */
6447 int
6449 {
6456 else
6458 }
6460 /* Return the minimum number of bits needed to represent VALUE in a
6461 signed or unsigned type, UNSIGNEDP says which. */
6463 unsigned int
6465 {
6466 /* If the value is negative, compute its negative minus 1. The latter
6467 adjustment is because the absolute value of the largest negative value
6468 is one larger than the largest positive value. This is equivalent to
6469 a bit-wise negation, so use that operation instead. */
6474 /* Return the number of bits needed, taking into account the fact
6475 that we need one more bit for a signed than unsigned type.
6476 If value is 0 or -1, the minimum precision is 1 no matter
6477 whether unsignedp is true or false. */
6481 else
6483 }
6485 /* Return truthvalue of whether T1 is the same tree structure as T2.
6486 Return 1 if they are the same.
6487 Return 0 if they are understandably different.
6488 Return -1 if either contains tree structure not understood by
6489 this function. */
6491 int
6493 {
6503 /* For location wrappers to be the same, they must be at the same
6504 source location (and wrap the same thing). */
6506 {
6510 }
6516 {
6520 else
6522 }
6532 {
6548 {
6557 /* ??? Should we handle also fields here? */
6561 }
6572 {
6580 {
6584 }
6586 }
6589 /* Special case: if either target is an unallocated VAR_DECL,
6590 it means that it's going to be unified with whatever the
6591 TARGET_EXPR is really supposed to initialize, so treat it
6592 as being equivalent to anything. */
6600 else
6629 /* A false return means maybe_ne rather than known_ne. */
6635 }
6637 /* This general rule works for most tree codes. All exceptions should be
6638 handled above. If this is a language-specific tree code, we can't
6639 trust what might be in the operand, so say we don't know
6640 the situation. */
6645 {
6654 {
6658 }
6664 }
6665 }
6667 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6668 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6669 than U, respectively. */
6671 int
6673 {
6682 else
6684 }
6686 /* Return true if SIZE represents a constant size that is in bounds of
6687 what the middle-end and the backend accepts (covering not more than
6688 half of the address-space).
6689 When PERR is non-null, set *PERR on failure to the description of
6690 why SIZE is not valid. */
6692 bool
6694 {
6696 {
6703 }
6705 cst_size_error error;
6710 {
6713 }
6716 {
6719 }
6722 {
6725 }
6729 {
6732 }
6735 }
6737 /* Return the precision of the type, or for a complex or vector type the
6738 precision of the type of its elements. */
6740 unsigned int
6742 {
6750 }
6752 /* Return true if CODE represents an associative tree code. Otherwise
6753 return false. */
6754 bool
6756 {
6758 {
6770 }
6772 }
6774 /* Return true if CODE represents a commutative tree code. Otherwise
6775 return false. */
6776 bool
6778 {
6780 {
6807 }
6809 }
6811 /* Return true if CODE represents a ternary tree code for which the
6812 first two operands are commutative. Otherwise return false. */
6813 bool
6815 {
6817 {
6825 }
6827 }
6829 /* Returns true if CODE can overflow. */
6831 bool
6833 {
6835 {
6840 /* Can overflow in various ways. */
6846 /* For INT_MIN / -1. */
6850 /* For -INT_MIN. */
6853 /* These operators cannot overflow. */
6855 }
6856 }
6858 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6859 ftrapv doesn't generate trapping insns for CODE. */
6861 bool
6863 {
6866 /* We don't generate instructions that trap on overflow for complex or vector
6867 types. */
6875 {
6881 /* These operators can overflow, and -ftrapv generates trapping code for
6882 these. */
6889 /* These operators can overflow, but -ftrapv does not generate trapping
6890 code for these. */
6893 /* These operators cannot overflow. */
6895 }
6896 }
6898 /* Constructors for pointer, array and function types.
6899 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6900 constructed by language-dependent code, not here.) */
6902 /* Construct, lay out and return the type of pointers to TO_TYPE with
6903 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6904 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6905 indicate this type can reference all of memory. If such a type has
6906 already been constructed, reuse it. */
6908 tree
6911 {
6912 tree t;
6919 {
6922 }
6924 /* If the pointed-to type has the may_alias attribute set, force
6925 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6929 /* In some cases, languages will have things that aren't a POINTER_TYPE
6930 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6931 In that case, return that type without regard to the rest of our
6932 operands.
6934 ??? This is a kludge, but consistent with the way this function has
6935 always operated and there doesn't seem to be a good way to avoid this
6936 at the moment. */
6941 /* First, if we already have a type for pointers to TO_TYPE and it's
6942 the proper mode, use it. */
6955 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6963 /* Lay out the type. This function has many callers that are concerned
6964 with expression-construction, and this simplifies them all. */
6968 }
6970 /* By default build pointers in ptr_mode. */
6972 tree
6974 {
6976 }
6978 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6980 tree
6983 {
6984 tree t;
6991 {
6994 }
6996 /* If the pointed-to type has the may_alias attribute set, force
6997 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7001 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7002 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7003 In that case, return that type without regard to the rest of our
7004 operands.
7006 ??? This is a kludge, but consistent with the way this function has
7007 always operated and there doesn't seem to be a good way to avoid this
7008 at the moment. */
7013 /* First, if we already have a type for pointers to TO_TYPE and it's
7014 the proper mode, use it. */
7027 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7038 }
7041 /* Build the node for the type of references-to-TO_TYPE by default
7042 in ptr_mode. */
7044 tree
7046 {
7048 }
7050 #define MAX_INT_CACHED_PREC \
7051 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7054 static void
7056 {
7058 {
7060 }
7061 }
7063 /* Builds a signed or unsigned integer type of precision PRECISION.
7064 Used for C bitfields whose precision does not match that of
7065 built-in target types. */
7066 tree
7069 {
7076 {
7080 }
7087 else
7097 }
7099 #define MAX_BOOL_CACHED_PREC \
7100 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7103 /* Builds a boolean type of precision PRECISION.
7104 Used for boolean vectors to choose proper vector element size. */
7105 tree
7107 {
7108 tree type;
7111 {
7115 }
7125 }
7127 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7128 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7129 is true, reuse such a type that has already been constructed. */
7131 static tree
7133 {
7156 {
7157 /* Since we cannot reliably merge this type, we need to compare it using
7158 structural equality checks. */
7161 }
7167 }
7169 /* Wrapper around build_range_type_1 with SHARED set to true. */
7171 tree
7173 {
7175 }
7177 /* Wrapper around build_range_type_1 with SHARED set to false. */
7179 tree
7181 {
7183 }
7185 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7186 MAXVAL should be the maximum value in the domain
7187 (one less than the length of the array).
7189 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7190 We don't enforce this limit, that is up to caller (e.g. language front end).
7191 The limit exists because the result is a signed type and we don't handle
7192 sizes that use more than one HOST_WIDE_INT. */
7194 tree
7196 {
7198 }
7200 /* Return true if the debug information for TYPE, a subtype, should be emitted
7201 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7202 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7203 debug info and doesn't reflect the source code. */
7205 bool
7207 {
7210 /* Subrange types have a base type which is an integral type. */
7214 /* Get the real bounds of the subtype. */
7217 else
7218 {
7221 }
7223 /* If the type and its base type have the same representation and the same
7224 name, then the type is not a subrange but a copy of the base type. */
7238 }
7240 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7241 and number of elements specified by the range of values of INDEX_TYPE.
7242 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7243 If SHARED is true, reuse such a type that has already been constructed.
7244 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7246 tree
7249 {
7250 tree t;
7253 {
7256 }
7266 {
7269 }
7272 {
7281 index_type
7284 }
7287 }
7289 /* Wrapper around build_array_type_1 with SHARED set to true. */
7291 tree
7293 {
7294 return
7296 }
7298 /* Wrapper around build_array_type_1 with SHARED set to false. */
7300 tree
7302 {
7304 }
7306 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7307 sizetype. */
7309 tree
7311 {
7313 }
7315 /* Recursively examines the array elements of TYPE, until a non-array
7316 element type is found. */
7318 tree
7320 {
7325 }
7327 /* Computes the canonical argument types from the argument type list
7328 ARGTYPES.
7330 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7331 on entry to this function, or if any of the ARGTYPES are
7332 structural.
7334 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7335 true on entry to this function, or if any of the ARGTYPES are
7336 non-canonical.
7338 Returns a canonical argument list, which may be ARGTYPES when the
7339 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7340 true) or would not differ from ARGTYPES. */
7342 static tree
7346 {
7347 tree arg;
7351 {
7353 /* Fail gracefully by stating that the type is structural. */
7359 /* If the argument has a default argument, we consider it
7360 non-canonical even though the type itself is canonical.
7361 That way, different variants of function and method types
7362 with default arguments will all point to the variant with
7363 no defaults as their canonical type. */
7365 }
7371 {
7372 /* Build the canonical list of argument types. */
7377 {
7380 else
7383 canon_argtypes);
7384 }
7390 /* There is a non-canonical type. */
7393 }
7395 /* The canonical argument types are the same as ARGTYPES. */
7397 }
7399 /* Construct, lay out and return
7400 the type of functions returning type VALUE_TYPE
7401 given arguments of types ARG_TYPES.
7402 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7403 are data type nodes for the arguments of the function.
7404 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7405 variable-arguments function with (...) prototype (no named arguments).
7406 If such a type has already been constructed, reuse it. */
7408 tree
7411 {
7412 tree t;
7415 tree canon_argtypes;
7420 {
7423 }
7425 /* Make a node of the sort we want. */
7430 {
7433 }
7435 /* If we already have such a type, use the old one. */
7439 /* Set up the canonical type. */
7449 canon_argtypes);
7454 }
7456 /* Build a function type. The RETURN_TYPE is the type returned by the
7457 function. If VAARGS is set, no void_type_node is appended to the
7458 list. ARGP must be always be terminated be a NULL_TREE. */
7460 static tree
7462 {
7470 {
7475 }
7478 else
7479 {
7483 }
7487 }
7489 /* Build a function type. The RETURN_TYPE is the type returned by the
7490 function. If additional arguments are provided, they are
7491 additional argument types. The list of argument types must always
7492 be terminated by NULL_TREE. */
7494 tree
7496 {
7497 tree args;
7504 }
7506 /* Build a variable argument function type. The RETURN_TYPE is the
7507 type returned by the function. If additional arguments are provided,
7508 they are additional argument types. The list of argument types must
7509 always be terminated by NULL_TREE. */
7511 tree
7513 {
7514 tree args;
7522 }
7524 /* Build a function type. RETURN_TYPE is the type returned by the
7525 function; VAARGS indicates whether the function takes varargs. The
7526 function takes N named arguments, the types of which are provided in
7527 ARG_TYPES. */
7529 static tree
7532 {
7540 }
7542 /* Build a function type. RETURN_TYPE is the type returned by the
7543 function. The function takes N named arguments, the types of which
7544 are provided in ARG_TYPES. */
7546 tree
7548 {
7550 }
7552 /* Build a variable argument function type. RETURN_TYPE is the type
7553 returned by the function. The function takes N named arguments, the
7554 types of which are provided in ARG_TYPES. */
7556 tree
7558 {
7560 }
7562 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7563 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7564 for the method. An implicit additional parameter (of type
7565 pointer-to-BASETYPE) is added to the ARGTYPES. */
7567 tree
7569 tree rettype,
7570 tree argtypes)
7571 {
7572 tree t;
7573 tree ptype;
7575 tree canon_argtypes;
7577 /* Make a node of the sort we want. */
7584 /* The actual arglist for this function includes a "hidden" argument
7585 which is "this". Put it into the list of argument types. */
7589 /* If we already have such a type, use the old one. */
7593 /* Set up the canonical type. */
7594 any_structural_p
7597 any_noncanonical_p
7609 canon_argtypes);
7614 }
7616 /* Construct, lay out and return the type of methods belonging to class
7617 BASETYPE and whose arguments and values are described by TYPE.
7618 If that type exists already, reuse it.
7619 TYPE must be a FUNCTION_TYPE node. */
7621 tree
7623 {
7629 }
7631 /* Construct, lay out and return the type of offsets to a value
7632 of type TYPE, within an object of type BASETYPE.
7633 If a suitable offset type exists already, reuse it. */
7635 tree
7637 {
7638 tree t;
7640 /* Make a node of the sort we want. */
7646 /* If we already have such a type, use the old one. */
7654 {
7663 }
7666 }
7668 /* Create a complex type whose components are COMPONENT_TYPE.
7670 If NAMED is true, the type is given a TYPE_NAME. We do not always
7671 do so because this creates a DECL node and thus make the DECL_UIDs
7672 dependent on the type canonicalization hashtable, which is GC-ed,
7673 so the DECL_UIDs would not be stable wrt garbage collection. */
7675 tree
7677 {
7682 /* Make a node of the sort we want. */
7687 /* If we already have such a type, use the old one. */
7692 {
7693 /* We created a new type. The hash insertion will have laid
7694 out the type. We need to check the canonicalization and
7695 maybe set the name. */
7706 /* We need to create a name, since complex is a fundamental type. */
7708 {
7737 }
7738 }
7741 }
7743 /* If TYPE is a real or complex floating-point type and the target
7744 does not directly support arithmetic on TYPE then return the wider
7745 type to be used for arithmetic on TYPE. Otherwise, return
7746 NULL_TREE. */
7748 tree
7750 {
7751 /* The target can give two different responses to the question of
7752 which excess precision mode it would like depending on whether we
7753 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7755 enum excess_precision_type requested_type
7757 ? EXCESS_PRECISION_TYPE_FAST
7761 enum flt_eval_method target_flt_eval_method
7764 /* The target should not ask for unpredictable float evaluation (though
7765 it might advertise that implicitly the evaluation is unpredictable,
7766 but we don't care about that here, it will have been reported
7767 elsewhere). If it does ask for unpredictable evaluation, we have
7768 nothing to do here. */
7771 /* Nothing to do. The target has asked for all types we know about
7772 to be computed with their native precision and range. */
7776 /* The target will promote this type in a target-dependent way, so excess
7777 precision ought to leave it alone. */
7781 machine_mode float16_type_mode = (float16_type_node
7784 machine_mode bfloat16_type_mode = (bfloat16_type_node
7791 {
7793 {
7796 {
7817 }
7819 }
7821 {
7826 {
7847 }
7849 }
7852 }
7855 }
7856 \f
7857 /* Return OP, stripped of any conversions to wider types as much as is safe.
7858 Converting the value back to OP's type makes a value equivalent to OP.
7860 If FOR_TYPE is nonzero, we return a value which, if converted to
7861 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7863 OP must have integer, real or enumeral type. Pointers are not allowed!
7865 There are some cases where the obvious value we could return
7866 would regenerate to OP if converted to OP's type,
7867 but would not extend like OP to wider types.
7868 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7869 For example, if OP is (unsigned short)(signed char)-1,
7870 we avoid returning (signed char)-1 if FOR_TYPE is int,
7871 even though extending that to an unsigned short would regenerate OP,
7872 since the result of extending (signed char)-1 to (int)
7873 is different from (int) OP. */
7875 tree
7877 {
7878 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7880 unsigned final_prec
7882 int uns
7889 {
7892 /* TYPE_PRECISION on vector types has different meaning
7893 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7894 so avoid them here. */
7901 /* Truncations are many-one so cannot be removed.
7902 Unless we are later going to truncate down even farther. */
7907 /* See what's inside this conversion. If we decide to strip it,
7908 we will set WIN. */
7911 /* If we have not stripped any zero-extensions (uns is 0),
7912 we can strip any kind of extension.
7913 If we have previously stripped a zero-extension,
7914 only zero-extensions can safely be stripped.
7915 Any extension can be stripped if the bits it would produce
7916 are all going to be discarded later by truncating to FOR_TYPE. */
7919 {
7922 /* TYPE_UNSIGNED says whether this is a zero-extension.
7923 Let's avoid computing it if it does not affect WIN
7924 and if UNS will not be needed again. */
7928 {
7931 }
7932 }
7933 }
7935 /* If we finally reach a constant see if it fits in sth smaller and
7936 in that case convert it. */
7938 {
7944 {
7948 }
7949 }
7952 }
7953 \f
7954 /* Return OP or a simpler expression for a narrower value
7955 which can be sign-extended or zero-extended to give back OP.
7956 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7957 or 0 if the value should be sign-extended. */
7959 tree
7961 {
7968 {
7969 do
7983 ret);
7985 }
7987 {
7988 int bitschange
7992 /* Truncations are many-one so cannot be removed. */
7996 /* See what's inside this conversion. If we decide to strip it,
7997 we will set WIN. */
8000 {
8002 /* An extension: the outermost one can be stripped,
8003 but remember whether it is zero or sign extension. */
8006 /* Otherwise, if a sign extension has been stripped,
8007 only sign extensions can now be stripped;
8008 if a zero extension has been stripped, only zero-extensions. */
8012 }
8014 {
8015 /* A change in nominal type can always be stripped, but we must
8016 preserve the unsignedness. */
8021 /* Keep trying to narrow, but don't assign op to win if it
8022 would turn an integral type into something else. */
8025 }
8028 }
8031 /* Since type_for_size always gives an integer type. */
8034 /* Ensure field is laid out already. */
8037 {
8038 unsigned HOST_WIDE_INT innerprec
8044 /* We can get this structure field in a narrower type that fits it,
8045 but the resulting extension to its nominal type (a fullword type)
8046 must satisfy the same conditions as for other extensions.
8048 Do this only for fields that are aligned (not bit-fields),
8049 because when bit-field insns will be used there is no
8050 advantage in doing this. */
8056 {
8060 }
8061 }
8065 }
8066 \f
8067 /* Return true if integer constant C has a value that is permissible
8068 for TYPE, an integral type. */
8070 bool
8072 {
8077 /* Non-standard boolean types can have arbitrary precision but various
8078 transformations assume that they can only take values 0 and +/-1. */
8082 retry:
8086 /* If at least one bound of the type is a constant integer, we can check
8087 ourselves and maybe make a decision. If no such decision is possible, but
8088 this type is a subtype, try checking against that. Otherwise, use
8089 fits_to_tree_p, which checks against the precision.
8091 Compute the status for each possibly constant bound, and return if we see
8092 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8093 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8094 for "constant known to fit". */
8096 /* Check if c >= type_low_bound. */
8098 {
8102 }
8103 else
8106 /* Check if c <= type_high_bound. */
8108 {
8112 }
8113 else
8116 /* If the constant fits both bounds, the result is known. */
8120 /* Perform some generic filtering which may allow making a decision
8121 even if the bounds are not constant. First, negative integers
8122 never fit in unsigned types, */
8126 /* Second, narrower types always fit in wider ones. */
8130 /* Third, unsigned integers with top bit set never fit signed types. */
8132 {
8135 {
8136 /* When a tree_cst is converted to a wide-int, the precision
8137 is taken from the type. However, if the precision of the
8138 mode underneath the type is smaller than that, it is
8139 possible that the value will not fit. The test below
8140 fails if any bit is set between the sign bit of the
8141 underlying mode and the top bit of the type. */
8144 }
8147 }
8149 /* If we haven't been able to decide at this point, there nothing more we
8150 can check ourselves here. Look at the base type if we have one and it
8151 has the same precision. */
8155 {
8158 }
8160 /* Or to fits_to_tree_p, if nothing else. */
8162 }
8164 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8165 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8166 represented (assuming two's-complement arithmetic) within the bit
8167 precision of the type are returned instead. */
8169 void
8171 {
8175 else
8176 {
8179 else
8180 {
8183 }
8184 }
8189 else
8190 {
8193 }
8194 }
8196 /* Return true if VAR is an automatic variable. */
8198 bool
8200 {
8205 }
8207 /* Return true if VAR is an automatic variable defined in function FN. */
8209 bool
8211 {
8215 }
8217 /* Subprogram of following function. Called by walk_tree.
8219 Return *TP if it is an automatic variable or parameter of the
8220 function passed in as DATA. */
8222 static tree
8224 {
8235 }
8237 /* Returns true if T is, contains, or refers to a type with variable
8238 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8239 arguments, but not the return type. If FN is nonzero, only return
8240 true if a modifier of the type or position of FN is a variable or
8241 parameter inside FN.
8243 This concept is more general than that of C99 'variably modified types':
8244 in C99, a struct type is never variably modified because a VLA may not
8245 appear as a structure member. However, in GNU C code like:
8247 struct S { int i[f()]; };
8249 is valid, and other languages may define similar constructs. */
8251 bool
8253 {
8254 tree t;
8256 /* Test if T is either variable (if FN is zero) or an expression containing
8257 a variable in FN. If TYPE isn't gimplified, return true also if
8258 gimplify_one_sizepos would gimplify the expression into a local
8259 variable. */
8260 #define RETURN_TRUE_IF_VAR(T) \
8261 do { tree _t = (T); \
8262 if (_t != NULL_TREE \
8263 && _t != error_mark_node \
8264 && !CONSTANT_CLASS_P (_t) \
8265 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8266 && (!fn \
8267 || (!TYPE_SIZES_GIMPLIFIED (type) \
8268 && (TREE_CODE (_t) != VAR_DECL \
8269 && !CONTAINS_PLACEHOLDER_P (_t))) \
8270 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8271 return true; } while (0)
8276 /* If TYPE itself has variable size, it is variably modified. */
8281 {
8285 /* Ada can have pointer types refering to themselves indirectly. */
8290 {
8293 }
8299 /* If TYPE is a function type, it is variably modified if the
8300 return type is variably modified. */
8310 /* Scalar types are variably modified if their end points
8311 aren't constant. */
8319 /* We can't see if any of the fields are variably-modified by the
8320 definition we normally use, since that would produce infinite
8321 recursion via pointers. */
8322 /* This is variably modified if some field's type is. */
8325 {
8330 /* If the type is a qualified union, then the DECL_QUALIFIER
8331 of fields can also be an expression containing a variable. */
8335 /* If the field is a qualified union, then it's only a container
8336 for what's inside so we look into it. That's necessary in LTO
8337 mode because the sizes of the field tested above have been set
8338 to PLACEHOLDER_EXPRs by free_lang_data. */
8342 }
8346 /* Do not call ourselves to avoid infinite recursion. This is
8347 variably modified if the element type is. */
8354 }
8356 /* The current language may have other cases to check, but in general,
8357 all other types are not variably modified. */
8360 #undef RETURN_TRUE_IF_VAR
8361 }
8363 /* Given a DECL or TYPE, return the scope in which it was declared, or
8364 NULL_TREE if there is no containing scope. */
8366 tree
8368 {
8370 }
8372 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8374 const_tree
8376 {
8378 {
8381 else
8383 }
8385 }
8387 /* Return the innermost context enclosing DECL that is
8388 a FUNCTION_DECL, or zero if none. */
8390 tree
8392 {
8393 tree context;
8398 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8399 where we look up the function at runtime. Such functions always take
8400 a first argument of type 'pointer to real context'.
8402 C++ should really be fixed to use DECL_CONTEXT for the real context,
8403 and use something else for the "virtual context". */
8405 context
8406 = TYPE_MAIN_VARIANT
8408 else
8412 {
8415 else
8417 }
8420 }
8422 /* Return the innermost context enclosing DECL that is
8423 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8424 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8426 tree
8428 {
8433 {
8454 }
8457 }
8459 /* CALL is a CALL_EXPR. Return the declaration for the function
8460 called, or NULL_TREE if the called function cannot be
8461 determined. */
8463 tree
8465 {
8466 tree addr;
8471 /* It's invalid to call this function with anything but a
8472 CALL_EXPR. */
8475 /* The first operand to the CALL is the address of the function
8476 called. */
8479 /* If there is no function, return early. */
8485 /* If this is a readonly function pointer, extract its initial value. */
8491 /* If the address is just `&f' for some function `f', then we know
8492 that `f' is being called. */
8497 /* We couldn't figure out what was being called. */
8499 }
8501 /* Return true when STMTs arguments and return value match those of FNDECL,
8502 a decl of a builtin function. */
8504 static bool
8506 {
8524 {
8525 /* Variadic args follow. */
8533 {
8534 /* For pointer arguments be more forgiving, e.g. due to
8535 FILE * vs. fileptr_type_node, or say char * vs. const char *
8536 differences etc. */
8542 /* char/short integral arguments are promoted to int
8543 by several frontends if targetm.calls.promote_prototypes
8544 is true. Allow such promotion too. */
8550 && (gimple_form
8557 }
8558 }
8562 }
8564 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8565 return the associated function code, otherwise return CFN_LAST. */
8567 combined_fn
8569 {
8570 /* It's invalid to call this function with anything but a CALL_EXPR. */
8583 }
8585 /* Comparator of indices based on tree_node_counts. */
8587 static int
8589 {
8594 }
8596 /* Comparator of indices based on tree_code_counts. */
8598 static int
8600 {
8605 }
8607 #define TREE_MEM_USAGE_SPACES 40
8609 /* Print debugging information about tree nodes generated during the compile,
8610 and any language-specific information. */
8612 void
8614 {
8616 {
8622 {
8629 {
8636 }
8641 }
8643 {
8653 {
8658 }
8665 }
8666 }
8667 else
8674 }
8675 \f
8678 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8680 unsigned
8682 {
8683 /* This relies on the raw feedback's top 4 bits being zero. */
8684 #define FEEDBACK(X) ((X) * 0x04c11db7)
8685 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8686 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8688 {
8693 };
8694 #undef FEEDBACK
8695 #undef SYNDROME
8699 {
8703 }
8706 }
8708 /* Generate a crc32 of a string. */
8710 unsigned
8712 {
8713 do
8717 }
8719 /* P is a string that will be used in a symbol. Mask out any characters
8720 that are not valid in that context. */
8722 void
8724 {
8729 #endif
8732 #endif
8733 ))
8735 }
8739 /* Create a unique anonymous identifier. The identifier is still a
8740 valid assembly label. */
8742 tree
8744 {
8746 #if !defined (NO_DOT_IN_LABEL)
8747 "."
8748 #elif !defined (NO_DOLLAR_IN_LABEL)
8749 "$"
8750 #else
8751 "_"
8752 #endif
8763 }
8765 /* Generate a name for a special-purpose function.
8766 The generated name may need to be unique across the whole link.
8767 Changes to this function may also require corresponding changes to
8768 xstrdup_mask_random.
8769 TYPE is some string to identify the purpose of this function to the
8770 linker or collect2; it must start with an uppercase letter,
8771 one of:
8772 I - for constructors
8773 D - for destructors
8774 N - for C++ anonymous namespaces
8775 F - for DWARF unwind frame information. */
8777 tree
8779 {
8784 /* If we already have a name we know to be unique, just use that. */
8787 /* If the target is handling the constructors/destructors, they
8788 will be local to this file and the name is only necessary for
8789 debugging purposes.
8790 We also assign sub_I and sub_D sufixes to constructors called from
8791 the global static constructors. These are always local. */
8795 {
8799 /* Just use the file's basename, because the full pathname
8800 might be quite long. */
8802 }
8803 else
8804 {
8805 /* Otherwise, the name must be unique across the entire link.
8806 We don't have anything that we know to be unique to this translation
8807 unit, so use what we do have and throw in some randomness. */
8825 }
8831 /* Set up the name of the file-level functions we may need.
8832 Use a global object (which is already required to be unique over
8833 the program) rather than the file name (which imposes extra
8834 constraints). */
8838 }
8839 \f
8840 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8842 /* Complain that the tree code of NODE does not match the expected 0
8843 terminated list of trailing codes. The trailing code list can be
8844 empty, for a more vague error message. FILE, LINE, and FUNCTION
8845 are of the caller. */
8847 void
8850 {
8861 {
8868 {
8875 }
8877 }
8878 else
8884 }
8886 /* Complain that the tree code of NODE does match the expected 0
8887 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8888 the caller. */
8890 void
8893 {
8907 {
8909 {
8912 }
8915 }
8921 }
8923 /* Similar to tree_check_failed, except that we check for a class of tree
8924 code, given in CL. */
8926 void
8929 {
8930 internal_error
8935 }
8937 /* Similar to tree_check_failed, except that instead of specifying a
8938 dozen codes, use the knowledge that they're all sequential. */
8940 void
8944 {
8957 {
8964 }
8969 }
8972 /* Similar to tree_check_failed, except that we check that a tree does
8973 not have the specified code, given in CL. */
8975 void
8978 {
8979 internal_error
8984 }
8987 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8989 void
8992 {
8998 }
9001 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9003 void
9007 {
9020 {
9027 }
9032 }
9035 #undef DEFTREESTRUCT
9036 #define DEFTREESTRUCT(VAL, NAME) NAME,
9040 };
9041 #undef DEFTREESTRUCT
9043 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9045 /* Similar to tree_class_check_failed, except that we check for
9046 whether CODE contains the tree structure identified by EN. */
9048 void
9053 {
9054 internal_error
9058 }
9061 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9062 (dynamically sized) vector. */
9064 void
9067 {
9068 internal_error
9072 }
9074 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9075 (dynamically sized) vector. */
9077 void
9080 {
9081 internal_error
9084 }
9086 /* Similar to above, except that the check is for the bounds of the operand
9087 vector of an expression node EXP. */
9089 void
9092 {
9094 internal_error
9098 }
9100 /* Similar to above, except that the check is for the number of
9101 operands of an OMP_CLAUSE node. */
9103 void
9106 {
9107 internal_error
9112 }
9114 \f
9115 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9116 and mapped to the machine mode MODE. Initialize its fields and build
9117 the information necessary for debugging output. */
9119 static tree
9121 {
9122 tree t;
9143 /* We have built a main variant, based on the main variant of the
9144 inner type. Use it to build the variant we return. */
9152 }
9154 static tree
9156 {
9179 else
9181 }
9183 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9185 static tree
9187 {
9189 {
9201 }
9202 else
9203 {
9215 }
9218 }
9220 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9222 static tree
9224 {
9226 {
9238 }
9239 else
9240 {
9252 }
9255 }
9258 /* Create an atomic variant node for TYPE. This routine is called
9259 during initialization of data types to create the 5 basic atomic
9260 types. The generic build_variant_type function requires these to
9261 already be set up in order to function properly, so cannot be
9262 called from there. If ALIGN is non-zero, then ensure alignment is
9263 overridden to this value. */
9265 static tree
9267 {
9268 tree t;
9270 /* Make sure its not already registered. */
9281 }
9283 /* Information about the _FloatN and _FloatNx types. This must be in
9284 the same order as the corresponding TI_* enum values. */
9286 {
9294 };
9297 /* Create nodes for all integer types (and error_mark_node) using the sizes
9298 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9300 void
9302 {
9310 /* Define both `signed char' and `unsigned char'. */
9316 /* Define `char', which is like either `signed char' or `unsigned char'
9317 but not the same as either. */
9318 char_type_node
9319 = (signed_char
9334 {
9339 {
9342 }
9343 }
9345 /* Define a boolean type. This type only represents boolean values but
9346 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9352 /* Define what type to use for size_t. */
9361 else
9362 {
9368 {
9375 {
9377 }
9378 }
9381 }
9383 /* Define what type to use for ptrdiff_t. */
9392 else
9393 {
9397 {
9405 }
9408 }
9410 /* Fill in the rest of the sized types. Reuse existing type nodes
9411 when possible. */
9424 /* Don't call build_qualified type for atomics. That routine does
9425 special processing for atomics, and until they are initialized
9426 it's better not to make that call.
9428 Check to see if there is a target override for atomic types. */
9445 /* Define these next since types below may used them. */
9463 /* We are not going to have real types in C with less than byte alignment,
9464 so we might as well not have any types that claim to have it. */
9477 const_ptr_type_node
9497 {
9500 scalar_float_mode mode;
9504 /* Work around the rs6000 KFmode having precision 113 not
9505 128. */
9517 }
9519 #ifdef HAVE_BFmode
9523 {
9528 }
9529 #endif
9536 /* Fixed size integer types. */
9543 /* Decimal float types. */
9545 {
9560 }
9569 {
9573 }
9575 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9576 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9577 sat_ ## KIND ## _type_node = \
9578 make_sat_signed_ ## KIND ## _type (SIZE); \
9579 sat_unsigned_ ## KIND ## _type_node = \
9580 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9581 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9582 unsigned_ ## KIND ## _type_node = \
9583 make_unsigned_ ## KIND ## _type (SIZE);
9585 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9586 sat_ ## WIDTH ## KIND ## _type_node = \
9587 make_sat_signed_ ## KIND ## _type (SIZE); \
9588 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9589 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9590 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9591 unsigned_ ## WIDTH ## KIND ## _type_node = \
9592 make_unsigned_ ## KIND ## _type (SIZE);
9594 /* Make fixed-point type nodes based on four different widths. */
9595 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9596 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9597 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9598 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9599 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9601 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9602 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9603 NAME ## _type_node = \
9604 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9605 u ## NAME ## _type_node = \
9606 make_or_reuse_unsigned_ ## KIND ## _type \
9607 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9608 sat_ ## NAME ## _type_node = \
9609 make_or_reuse_sat_signed_ ## KIND ## _type \
9610 (GET_MODE_BITSIZE (MODE ## mode)); \
9611 sat_u ## NAME ## _type_node = \
9612 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9613 (GET_MODE_BITSIZE (U ## MODE ## mode));
9615 /* Fixed-point type and mode nodes. */
9628 {
9631 /* Many back-ends define record types without setting TYPE_NAME.
9632 If we copied the record type here, we'd keep the original
9633 record type without a name. This breaks name mangling. So,
9634 don't copy record types and let c_common_nodes_and_builtins()
9635 declare the type to be __builtin_va_list. */
9640 }
9642 /* SCEV analyzer global shared trees. */
9647 }
9649 /* Modify DECL for given flags.
9650 TM_PURE attribute is set only on types, so the function will modify
9651 DECL's type when ECF_TM_PURE is used. */
9653 void
9655 {
9685 /* Looping const or pure is implied by noreturn.
9686 There is currently no way to declare looping const or looping pure alone. */
9689 }
9692 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9694 static void
9697 {
9698 tree decl;
9705 }
9707 /* Call this function after instantiating all builtins that the language
9708 front end cares about. This will build the rest of the builtins
9709 and internal functions that are relied upon by the tree optimizers and
9710 the middle-end. */
9712 void
9714 {
9719 {
9721 ptr_type_node,
9722 ptr_type_node,
9723 integer_type_node,
9724 NULL_TREE);
9726 BUILT_IN_CLEAR_PADDING,
9729 }
9735 {
9739 BUILT_IN_UNREACHABLE,
9745 BUILT_IN_UNREACHABLE_TRAP,
9757 }
9761 {
9772 }
9775 {
9778 NULL_TREE);
9781 }
9784 {
9790 }
9792 /* If we're checking the stack, `alloca' can throw. */
9793 const int alloca_flags
9797 {
9802 }
9807 BUILT_IN_ALLOCA_WITH_ALIGN,
9809 alloca_flags);
9814 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9816 alloca_flags);
9822 BUILT_IN_INIT_TRAMPOLINE,
9825 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9829 BUILT_IN_INIT_DESCRIPTOR,
9834 BUILT_IN_ADJUST_TRAMPOLINE,
9838 BUILT_IN_ADJUST_DESCRIPTOR,
9846 BUILT_IN_CLEAR_CACHE,
9848 ECF_NOTHROW);
9851 BUILT_IN_NONLOCAL_GOTO,
9858 BUILT_IN_SETJMP_SETUP,
9863 BUILT_IN_SETJMP_RECEIVER,
9872 BUILT_IN_STACK_RESTORE,
9877 NULL_TREE);
9890 /* If there's a possibility that we might use the ARM EABI, build the
9891 alternate __cxa_end_cleanup node used to resume from C++. */
9893 {
9896 BUILT_IN_CXA_END_CLEANUP,
9898 }
9902 BUILT_IN_UNWIND_RESUME,
9906 ECF_NORETURN);
9909 {
9911 NULL_TREE);
9913 BUILT_IN_RETURN_ADDRESS,
9915 ECF_NOTHROW);
9916 }
9920 {
9925 BUILT_IN_PROFILE_FUNC_ENTER,
9929 BUILT_IN_PROFILE_FUNC_EXIT,
9931 }
9933 /* The exception object and filter values from the runtime. The argument
9934 must be zero before exception lowering, i.e. from the front end. After
9935 exception lowering, it will be the region number for the exception
9936 landing pad. These functions are PURE instead of CONST to prevent
9937 them from being hoisted past the exception edge that will initialize
9938 its value in the landing pad. */
9942 /* Only use TM_PURE if we have TM language support. */
9955 NULL_TREE);
9957 BUILT_IN_EH_COPY_VALUES,
9960 /* Complex multiplication and division. These are handled as builtins
9961 rather than optabs because emit_library_call_value doesn't support
9962 complex. Further, we can do slightly better with folding these
9963 beasties if the real and complex parts of the arguments are separate. */
9964 {
9968 {
9995 /* For -ftrapping-math these should throw from a former
9996 -fnon-call-exception stmt. */
9998 NULL);
10004 NULL);
10008 }
10009 }
10012 }
10014 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10015 better way.
10017 If we requested a pointer to a vector, build up the pointers that
10018 we stripped off while looking for the inner type. Similarly for
10019 return values from functions.
10021 The argument TYPE is the top of the chain, and BOTTOM is the
10022 new type which we will point to. */
10024 tree
10026 {
10030 {
10034 }
10036 {
10040 }
10042 {
10045 }
10047 {
10051 }
10053 {
10055 /* The build_method_type_directly() routine prepends 'this' to argument list,
10056 so we must compensate by getting rid of it. */
10057 outer
10058 = build_method_type_directly
10060 inner,
10062 }
10064 {
10067 }
10068 else
10073 }
10075 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10076 the inner type. */
10077 tree
10079 {
10080 poly_int64 nunits;
10084 {
10096 /* Check that there are no leftover bits. */
10104 }
10107 }
10109 /* Similarly, but takes the inner type and number of units, which must be
10110 a power of two. */
10112 tree
10114 {
10116 }
10118 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10120 tree
10122 {
10127 {
10130 }
10131 else
10137 }
10139 /* Build a vector type that holds one boolean result for each element of
10140 vector type VECTYPE. The public interface for this operation is
10141 truth_type_for. */
10143 static tree
10145 {
10149 machine_mode mask_mode;
10159 }
10161 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10162 set. */
10164 tree
10166 {
10168 tree cand;
10169 /* We always build the non-opaque variant before the opaque one,
10170 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10176 /* Othewise build a variant type and make sure to queue it after
10177 the non-opaque type. */
10185 }
10187 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10189 static poly_wide_int
10191 {
10192 /* First handle elements that are directly encoded. */
10197 /* Identify the pattern that contains element I and work out the index of
10198 the last encoded element for that pattern. */
10204 /* If there are no steps, the final encoded value is the right one. */
10208 /* Otherwise work out the value from the last two encoded elements. */
10213 }
10215 /* Return the value of element I of VECTOR_CST T. */
10217 tree
10219 {
10220 /* First handle elements that are directly encoded. */
10225 /* If there are no steps, the final encoded value is the right one. */
10227 {
10228 /* Identify the pattern that contains element I and work out the index of
10229 the last encoded element for that pattern. */
10234 }
10236 /* Otherwise work out the value from the last two encoded elements. */
10239 }
10241 /* Given an initializer INIT, return TRUE if INIT is zero or some
10242 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10243 null, set *NONZERO if and only if INIT is known not to be all
10244 zeros. The combination of return value of false and *NONZERO
10245 false implies that INIT may but need not be all zeros. Other
10246 combinations indicate definitive answers. */
10248 bool
10250 {
10255 /* Conservatively clear NONZERO and set it only if INIT is definitely
10256 not all zero. */
10264 {
10273 /* ??? Note that this is not correct for C4X float formats. There,
10274 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10275 negative exponent. */
10310 {
10315 tree elt;
10322 }
10325 {
10340 }
10341 /* Fall through. */
10344 {
10352 /* We need to loop through all elements to handle cases like
10353 "\0" and "\0foobar". */
10356 {
10359 }
10362 }
10366 }
10367 }
10369 /* Return true if EXPR is an initializer expression in which every element
10370 is a constant that is numerically equal to 0 or 1. The elements do not
10371 need to be equal to each other. */
10373 bool
10375 {
10379 {
10387 {
10394 {
10398 }
10401 }
10405 }
10406 }
10408 /* Check if vector VEC consists of all the equal elements and
10409 that the number of elements corresponds to the type of VEC.
10410 The function returns first element of the vector
10411 or NULL_TREE if the vector is not uniform. */
10412 tree
10414 {
10427 {
10431 }
10435 {
10439 {
10441 {
10444 }
10447 }
10454 }
10457 }
10459 /* If the argument is INTEGER_CST, return it. If the argument is vector
10460 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10461 return NULL_TREE.
10462 Look through location wrappers. */
10464 tree
10466 {
10473 {
10477 }
10480 }
10482 /* Checks to see if T is a constant or a constant vector and if each element E
10483 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10485 tree
10487 {
10497 tree cst;
10501 tree_vector_builder builder;
10504 else
10505 {
10511 }
10515 do
10516 {
10531 }
10535 }
10537 /* If VECTOR_CST T has a single nonzero element, return the index of that
10538 element, otherwise return -1. */
10540 int
10542 {
10548 {
10551 }
10552 else
10557 {
10560 {
10564 }
10565 }
10567 }
10569 /* Build an empty statement at location LOC. */
10571 tree
10573 {
10577 }
10580 /* Build an OMP clause with code CODE. LOC is the location of the
10581 clause. */
10583 tree
10585 {
10586 tree t;
10601 }
10603 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10604 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10605 Except for the CODE and operand count field, other storage for the
10606 object is initialized to zeros. */
10608 tree
10610 {
10611 tree t;
10623 /* Can't use TREE_OPERAND to store the length because if checking is
10624 enabled, it will try to check the length before we store it. :-P */
10628 }
10630 /* Helper function for build_call_* functions; build a CALL_EXPR with
10631 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10632 the argument slots. */
10634 static tree
10636 {
10637 tree t;
10645 }
10647 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10648 FN and a null static chain slot. NARGS is the number of call arguments
10649 which are specified as "..." arguments. */
10651 tree
10653 {
10654 tree ret;
10660 }
10662 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10663 FN and a null static chain slot. NARGS is the number of call arguments
10664 which are specified as a va_list ARGS. */
10666 tree
10668 {
10669 tree t;
10677 }
10679 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10680 FN and a null static chain slot. NARGS is the number of call arguments
10681 which are specified as a tree array ARGS. */
10683 tree
10686 {
10687 tree t;
10696 }
10698 /* Like build_call_array, but takes a vec. */
10700 tree
10702 {
10711 }
10713 /* Conveniently construct a function call expression. FNDECL names the
10714 function to be called and N arguments are passed in the array
10715 ARGARRAY. */
10717 tree
10719 {
10724 }
10726 /* Conveniently construct a function call expression. FNDECL names the
10727 function to be called and the arguments are passed in the vector
10728 VEC. */
10730 tree
10732 {
10735 }
10738 /* Conveniently construct a function call expression. FNDECL names the
10739 function to be called, N is the number of arguments, and the "..."
10740 parameters are the argument expressions. */
10742 tree
10744 {
10754 }
10756 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10757 varargs macros aren't supported by all bootstrap compilers. */
10759 tree
10761 {
10771 }
10773 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10774 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10775 It will get gimplified later into an ordinary internal function. */
10777 tree
10780 {
10788 }
10790 /* Build internal call expression. This is just like CALL_EXPR, except
10791 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10792 internal function. */
10794 tree
10797 {
10807 }
10809 /* Return a function call to FN, if the target is guaranteed to support it,
10810 or null otherwise.
10812 N is the number of arguments, passed in the "...", and TYPE is the
10813 type of the return value. */
10815 tree
10818 {
10828 {
10831 {
10834 OPTIMIZE_FOR_BOTH))
10836 }
10838 }
10839 else
10840 {
10845 }
10846 }
10848 /* Return a function call to the appropriate builtin alloca variant.
10850 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10851 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10852 bound for SIZE in case it is not a fixed value. */
10854 tree
10856 {
10858 {
10860 return
10862 }
10864 {
10867 }
10868 else
10869 {
10872 }
10873 }
10875 /* The built-in decl to use to mark code points believed to be unreachable.
10876 Typically __builtin_unreachable, but __builtin_trap if
10877 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10878 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10879 appropriate ubsan function. When building a call directly, use
10880 {gimple_},build_builtin_unreachable instead. */
10882 tree
10884 {
10891 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10892 in the sanopt pass. */
10895 }
10897 /* Build a call to __builtin_unreachable, possibly rewritten by
10898 -fsanitize=unreachable. Use this rather than the above when practical. */
10900 tree
10902 {
10906 }
10908 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10909 if SIZE == -1) and return a tree node representing char* pointer to
10910 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10911 the STRING_CST value is the LEN bytes at STR (the representation
10912 of the string, which may be wide). Otherwise it's all zeros. */
10914 tree
10918 {
10920 /* Set the maximum valid index based on the string length or SIZE. */
10921 unsigned HOST_WIDE_INT maxidx
10937 }
10941 /* Return true if T (assumed to be a DECL) must be assigned a memory
10942 location. */
10944 bool
10946 {
10952 }
10954 /* Return value of a constant X and sign-extend it. */
10956 HOST_WIDE_INT
10958 {
10962 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10966 {
10970 else
10972 }
10975 }
10977 /* If TYPE is an integral or pointer type, return an integer type with
10978 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10979 if TYPE is already an integer type of signedness UNSIGNEDP.
10980 If TYPE is a floating-point type, return an integer type with the same
10981 bitsize and with the signedness given by UNSIGNEDP; this is useful
10982 when doing bit-level operations on a floating-point value. */
10984 tree
10986 {
10991 {
10998 machine_mode new_mode;
11003 }
11006 {
11014 }
11023 else
11027 }
11029 /* If TYPE is an integral or pointer type, return an integer type with
11030 the same precision which is unsigned, or itself if TYPE is already an
11031 unsigned integer type. If TYPE is a floating-point type, return an
11032 unsigned integer type with the same bitsize as TYPE. */
11034 tree
11036 {
11038 }
11040 /* If TYPE is an integral or pointer type, return an integer type with
11041 the same precision which is signed, or itself if TYPE is already a
11042 signed integer type. If TYPE is a floating-point type, return a
11043 signed integer type with the same bitsize as TYPE. */
11045 tree
11047 {
11049 }
11051 /* - For VECTOR_TYPEs:
11052 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11053 - The number of elements must match (known_eq).
11054 - targetm.vectorize.get_mask_mode exists, and exactly
11055 the same mode as the truth type.
11056 - Otherwise, the truth type must be a BOOLEAN_TYPE
11057 or useless_type_conversion_p to BOOLEAN_TYPE. */
11058 bool
11060 {
11063 machine_mode tmask_mode;
11066 {
11075 }
11078 }
11080 /* If TYPE is a vector type, return a signed integer vector type with the
11081 same width and number of subparts. Otherwise return boolean_type_node. */
11083 tree
11085 {
11087 {
11091 }
11092 else
11094 }
11096 /* Returns the largest value obtainable by casting something in INNER type to
11097 OUTER type. */
11099 tree
11101 {
11107 /* Compute a unique number for every combination. */
11112 /* Determine the exponent to use. */
11114 {
11117 /* oprec <= iprec, outer: signed, inner: don't care. */
11122 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11126 /* oprec > iprec, outer: signed, inner: signed. */
11130 /* oprec > iprec, outer: signed, inner: unsigned. */
11134 /* oprec > iprec, outer: unsigned, inner: signed. */
11138 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11143 }
11147 }
11149 /* Returns the smallest value obtainable by casting something in INNER type to
11150 OUTER type. */
11152 tree
11154 {
11158 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11159 and obtain 0. */
11161 /* If we are widening something of an unsigned type, OUTER type
11162 contains all values of INNER type. In particular, both INNER
11163 and OUTER types have zero in common. */
11166 else
11167 {
11168 /* If we are widening a signed type to another signed type, we
11169 want to obtain -2^^(iprec-1). If we are keeping the
11170 precision or narrowing to a signed type, we want to obtain
11171 -2^(oprec-1). */
11176 }
11177 }
11179 /* Return nonzero if two operands that are suitable for PHI nodes are
11180 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11181 SSA_NAME or invariant. Note that this is strictly an optimization.
11182 That is, callers of this function can directly call operand_equal_p
11183 and get the same result, only slower. */
11185 int
11187 {
11193 }
11195 /* Returns number of zeros at the end of binary representation of X. */
11197 tree
11199 {
11201 }
11204 #define WALK_SUBTREE(NODE) \
11205 do \
11206 { \
11207 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11208 if (result) \
11209 return result; \
11210 } \
11211 while (0)
11213 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11214 be walked whenever a type is seen in the tree. Rest of operands and return
11215 value are as for walk_tree. */
11217 static tree
11220 {
11224 {
11228 /* We have to worry about mutually recursive pointers. These can't
11229 be written in C. They can in Ada. It's pathological, but
11230 there's an ACATS test (c38102a) that checks it. Deal with this
11231 by checking if we're pointing to another pointer, that one
11232 points to another pointer, that one does too, and we have no htab.
11233 If so, get a hash table. We check three levels deep to avoid
11234 the cost of the hash table if we don't need one. */
11239 {
11246 }
11248 /* fall through */
11257 /* Fall through. */
11261 {
11262 tree arg;
11264 /* We never want to walk into default arguments. */
11267 }
11271 /* Don't follow this nodes's type if a pointer for fear that
11272 we'll have infinite recursion. If we have a PSET, then we
11273 need not fear. */
11288 }
11291 }
11293 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11294 called with the DATA and the address of each sub-tree. If FUNC returns a
11295 non-NULL value, the traversal is stopped, and the value returned by FUNC
11296 is returned. If PSET is non-NULL it is used to record the nodes visited,
11297 and to avoid visiting a node more than once. */
11299 tree
11302 {
11305 tree result;
11307 #define WALK_SUBTREE_TAIL(NODE) \
11308 do \
11309 { \
11310 tp = & (NODE); \
11311 goto tail_recurse; \
11312 } \
11313 while (0)
11315 tail_recurse:
11316 /* Skip empty subtrees. */
11320 /* Don't walk the same tree twice, if the user has requested
11321 that we avoid doing so. */
11325 /* Call the function. */
11329 /* If we found something, return it. */
11335 /* Even if we didn't, FUNC may have decided that there was nothing
11336 interesting below this point in the tree. */
11338 {
11339 /* But we still need to check our siblings. */
11344 else
11346 }
11349 {
11353 }
11356 {
11368 /* None of these have subtrees other than those already walked
11369 above. */
11377 {
11383 /* Walk all elements but the last. */
11387 /* Now walk the last one as a tail call. */
11389 }
11392 {
11396 /* Walk all elements but the last. */
11399 /* Now walk the last one as a tail call. */
11401 }
11408 {
11413 idx++)
11415 }
11422 {
11423 tree decl;
11425 {
11426 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11427 into declarations that are just mentioned, rather than
11428 declared; they don't really belong to this part of the tree.
11429 And, we can see cycles: the initializer for a declaration
11430 can refer to the declaration itself. */
11434 }
11436 }
11439 {
11440 tree_stmt_iterator i;
11443 }
11447 {
11452 }
11455 {
11458 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11459 But, we only want to walk once. */
11464 }
11467 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11468 defining. We only want to walk into these fields of a type in this
11469 case and not in the general case of a mere reference to the type.
11471 The criterion is as follows: if the field can be an expression, it
11472 must be walked only here. This should be in keeping with the fields
11473 that are directly gimplified in gimplify_type_sizes in order for the
11474 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11475 variable-sized types.
11477 Note that DECLs get walked as part of processing the BIND_EXPR. */
11479 {
11480 /* Call the function for the decl so e.g. copy_tree_body_r can
11481 replace it with the remapped one. */
11490 /* Call the function for the type. See if it returns anything or
11491 doesn't want us to continue. If we are to continue, walk both
11492 the normal fields and those for the declaration case. */
11497 /* But do not walk a pointed-to type since it may itself need to
11498 be walked in the declaration case if it isn't anonymous. */
11500 {
11504 }
11506 /* If this is a record type, also walk the fields. */
11508 {
11509 tree field;
11513 {
11514 /* We'd like to look at the type of the field, but we can
11515 easily get infinite recursion. So assume it's pointed
11516 to elsewhere in the tree. Also, ignore things that
11517 aren't fields. */
11526 }
11527 }
11529 /* Same for scalar types. */
11535 {
11538 }
11542 }
11543 /* FALLTHRU */
11547 {
11550 /* Walk over all the sub-trees of this operand. */
11553 /* Go through the subtrees. We need to do this in forward order so
11554 that the scope of a FOR_EXPR is handled properly. */
11556 {
11560 }
11561 }
11562 /* If this is a type, walk the needed fields in the type. */
11566 }
11568 /* We didn't find what we were looking for. */
11571 #undef WALK_SUBTREE_TAIL
11572 }
11573 #undef WALK_SUBTREE
11575 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11577 tree
11579 walk_tree_lh lh)
11580 {
11581 tree result;
11586 }
11589 tree
11591 {
11598 }
11600 void
11602 {
11606 {
11608 }
11609 else
11611 }
11613 /* Create a nameless artificial label and put it in the current
11614 function context. The label has a location of LOC. Returns the
11615 newly created label. */
11617 tree
11619 {
11627 }
11629 /* Given a tree, try to return a useful variable name that we can use
11630 to prefix a temporary that is being assigned the value of the tree.
11631 I.E. given <temp> = &A, return A. */
11635 {
11636 tree stripped_decl;
11643 {
11648 }
11649 else
11650 {
11652 {
11657 }
11658 }
11659 }
11661 /* Return true if TYPE has a variable argument list. */
11663 bool
11665 {
11666 function_args_iterator args_iter;
11676 {
11678 }
11681 }
11683 /* Return true if TYPE has a prototype. */
11685 bool
11687 {
11688 tree t;
11697 }
11699 /* If BLOCK is inlined from an __attribute__((__artificial__))
11700 routine, return pointer to location from where it has been
11701 called. */
11702 location_t *
11704 {
11709 {
11712 {
11713 /* If AO is an artificial inline, point RET to the
11714 call site locus at which it has been inlined and continue
11715 the loop, in case AO's caller is also an artificial
11716 inline. */
11720 else
11722 }
11727 }
11729 }
11732 /* If EXP is inlined from an __attribute__((__artificial__))
11733 function, return the location of the original call expression. */
11735 location_t
11737 {
11742 else
11744 }
11746 /* Return the location into which EXP has been inlined. Analogous
11747 to tree_nonartificial_location() above but not limited to artificial
11748 functions declared inline. If SYSTEM_HEADER is true, return
11749 the macro expansion point of the location if it's in a system header */
11751 location_t
11753 {
11760 {
11768 }
11771 {
11774 /* Only consider macro expansion when the block traversal failed
11775 to find a location. Otherwise it's not relevant. */
11777 }
11780 }
11782 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11783 nodes. */
11785 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11787 hashval_t
11789 {
11796 else
11798 }
11800 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11801 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11802 same. */
11804 bool
11806 {
11819 else
11821 }
11823 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11825 tree
11828 {
11829 tree t;
11831 /* Use the cache of optimization nodes. */
11839 {
11840 /* Insert this one into the hash table. */
11844 /* Make a new node for next time round. */
11846 }
11849 }
11851 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11853 tree
11856 {
11857 tree t;
11859 /* Use the cache of optimization nodes. */
11867 {
11868 /* Insert this one into the hash table. */
11872 /* Make a new node for next time round. */
11874 }
11877 }
11879 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11880 so that they aren't saved during PCH writing. */
11882 void
11884 {
11889 }
11891 /* Determine the "ultimate origin" of a block. */
11893 tree
11895 {
11900 else
11901 {
11906 }
11907 }
11909 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11910 no instruction. */
11912 bool
11914 {
11915 /* Do not strip casts into or out of differing address spaces. */
11918 {
11923 }
11926 {
11927 /* We already know that outer_type is not a pointer with
11928 a non-generic address space. */
11930 }
11932 /* Use precision rather then machine mode when we can, which gives
11933 the correct answer even for submode (bit-field) types. */
11942 /* Otherwise fall back on comparing machine modes (e.g. for
11943 aggregate types, floats). */
11945 }
11947 /* Return true iff conversion in EXP generates no instruction. Mark
11948 it inline so that we fully inline into the stripping functions even
11949 though we have two uses of this function. */
11953 {
11968 }
11970 /* Return true iff conversion in EXP generates no instruction. Don't
11971 consider conversions changing the signedness. */
11973 static bool
11975 {
11986 }
11988 /* Strip conversions from EXP according to tree_nop_conversion and
11989 return the resulting expression. */
11991 tree
11993 {
11997 }
11999 /* Strip conversions from EXP according to tree_sign_nop_conversion
12000 and return the resulting expression. */
12002 tree
12004 {
12008 }
12010 /* Avoid any floating point extensions from EXP. */
12011 tree
12013 {
12016 /* For floating point constant look up the narrowest type that can hold
12017 it properly and handle it like (type)(narrowest_type)constant.
12018 This way we can optimize for instance a=a*2.0 where "a" is float
12019 but 2.0 is double constant. */
12021 {
12022 REAL_VALUE_TYPE orig;
12035 }
12054 }
12056 /* Strip out all handled components that produce invariant
12057 offsets. */
12059 const_tree
12061 {
12063 {
12065 {
12080 }
12082 }
12085 }
12087 /* Strip handled components with zero offset from OP. */
12089 tree
12091 {
12097 }
12101 /* Return the GCC personality function decl. */
12103 tree
12105 {
12109 }
12111 /* TARGET is a call target of GIMPLE call statement
12112 (obtained by gimple_call_fn). Return true if it is
12113 OBJ_TYPE_REF representing an virtual call of C++ method.
12114 (As opposed to OBJ_TYPE_REF representing objc calls
12115 through a cast where middle-end devirtualization machinery
12116 can't apply.) FOR_DUMP_P is true when being called from
12117 the dump routines. */
12119 bool
12121 {
12130 /* If we do not have BINFO associated, it means that type was built
12131 without devirtualization enabled. Do not consider this a virtual
12132 call. */
12136 }
12138 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12140 static tree
12142 {
12153 }
12155 /* Try to find a base info of BINFO that would have its field decl at offset
12156 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12157 found, return, otherwise return NULL_TREE. */
12159 tree
12161 {
12165 {
12167 tree fld;
12176 {
12184 }
12188 /* Offset 0 indicates the primary base, whose vtable contents are
12189 represented in the binfo for the derived class. */
12191 {
12193 /* Offsets in BINFO are in bytes relative to the whole structure
12194 while POS is in bits relative to the containing field. */
12201 {
12204 }
12207 else
12209 binfo_offset);
12210 }
12214 }
12215 }
12217 /* Returns true if X is a typedef decl. */
12219 bool
12221 {
12224 }
12226 /* Returns true iff TYPE is a type variant created for a typedef. */
12228 bool
12230 {
12232 }
12234 /* PR 84195: Replace control characters in "unescaped" with their
12235 escaped equivalents. Allow newlines if -fmessage-length has
12236 been set to a non-zero value. This is done here, rather than
12237 where the attribute is recorded as the message length can
12238 change between these two locations. */
12240 void
12242 {
12260 {
12264 {
12268 }
12271 {
12273 {
12274 /* We only allocate space for a new string if we
12275 actually encounter a control character that
12276 needs replacing. */
12280 }
12285 {
12294 }
12295 }
12298 }
12301 {
12305 }
12306 }
12308 /* Warn about a use of an identifier which was marked deprecated. Returns
12309 whether a warning was given. */
12311 bool
12313 {
12314 escaped_string msg;
12320 {
12324 {
12330 {
12333 }
12334 }
12335 }
12345 {
12346 auto_diagnostic_group d;
12350 else
12355 }
12357 {
12362 {
12368 }
12370 auto_diagnostic_group d;
12372 {
12376 else
12379 }
12380 else
12381 {
12385 else
12388 }
12392 }
12395 }
12397 /* Error out with an identifier which was marked 'unavailable'. */
12398 void
12400 {
12401 escaped_string msg;
12407 {
12411 {
12416 }
12417 }
12426 {
12427 auto_diagnostic_group d;
12430 else
12433 }
12435 {
12440 {
12446 }
12448 auto_diagnostic_group d;
12450 {
12453 else
12455 }
12456 else
12457 {
12460 else
12462 }
12466 }
12467 }
12469 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12470 somewhere in it. */
12472 bool
12474 {
12476 {
12481 }
12484 }
12486 /* Try to determine whether a TRY_CATCH expression can fall through.
12487 This is a subroutine of block_may_fallthru. */
12489 static bool
12491 {
12492 tree_stmt_iterator i;
12494 /* If the TRY block can fall through, the whole TRY_CATCH can
12495 fall through. */
12501 {
12503 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12504 catch expression and a body. The whole TRY_CATCH may fall
12505 through iff any of the catch bodies falls through. */
12507 {
12510 }
12514 /* The exception filter expression only matters if there is an
12515 exception. If the exception does not match EH_FILTER_TYPES,
12516 we will execute EH_FILTER_FAILURE, and we will fall through
12517 if that falls through. If the exception does match
12518 EH_FILTER_TYPES, the stack unwinder will continue up the
12519 stack, so we will not fall through. We don't know whether we
12520 will throw an exception which matches EH_FILTER_TYPES or not,
12521 so we just ignore EH_FILTER_TYPES and assume that we might
12522 throw an exception which doesn't match. */
12526 /* This case represents statements to be executed when an
12527 exception occurs. Those statements are implicitly followed
12528 by a RESX statement to resume execution after the exception.
12529 So in this case the TRY_CATCH never falls through. */
12531 }
12532 }
12534 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12535 need not be 100% accurate; simply be conservative and return true if we
12536 don't know. This is used only to avoid stupidly generating extra code.
12537 If we're wrong, we'll just delete the extra code later. */
12539 bool
12541 {
12542 /* This CONST_CAST is okay because expr_last returns its argument
12543 unmodified and we assign it to a const_tree. */
12547 {
12550 /* Easy cases. If the last statement of the block implies
12551 control transfer, then we can't fall through. */
12555 /* If there is a default: label or case labels cover all possible
12556 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12557 to some case label in all cases and all we care is whether the
12558 SWITCH_BODY falls through. */
12575 /* The finally clause is always executed after the try clause,
12576 so if it does not fall through, then the try-finally will not
12577 fall through. Otherwise, if the try clause does not fall
12578 through, then when the finally clause falls through it will
12579 resume execution wherever the try clause was going. So the
12580 whole try-finally will only fall through if both the try
12581 clause and the finally clause fall through. */
12591 else
12593 /* FALLTHRU */
12596 /* Functions that do not return do not fall through. */
12610 }
12611 }
12613 /* True if we are using EH to handle cleanups. */
12616 /* This routine is called from front ends to indicate eh should be used for
12617 cleanups. */
12618 void
12620 {
12622 }
12624 /* Query whether EH is used for cleanups. */
12625 bool
12627 {
12629 }
12631 /* Wrapper for tree_code_name to ensure that tree code is valid */
12634 {
12637 /* The tree_code enum promotes to signed, but we could be getting
12638 invalid values, so force an unsigned comparison. */
12640 {
12644 }
12647 }
12649 /* Drops the TREE_OVERFLOW flag from T. */
12651 tree
12653 {
12656 /* For tree codes with a sharing machinery re-build the result. */
12660 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12661 and canonicalize the result. */
12663 {
12664 tree_vector_builder builder;
12668 {
12673 }
12675 }
12677 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12678 and drop the flag. */
12682 /* For constants that contain nested constants, drop the flag
12683 from those as well. */
12685 {
12690 }
12693 }
12695 /* Given a memory reference expression T, return its base address.
12696 The base address of a memory reference expression is the main
12697 object being referenced. For instance, the base address for
12698 'array[i].fld[j]' is 'array'. You can think of this as stripping
12699 away the offset part from a memory address.
12701 This function calls handled_component_p to strip away all the inner
12702 parts of the memory reference until it reaches the base object. */
12704 tree
12706 {
12718 }
12720 /* Return a tree of sizetype representing the size, in bytes, of the element
12721 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12723 tree
12725 {
12730 /* If a size was specified in the ARRAY_REF, it's the size measured
12731 in alignment units of the element type. So multiply by that value. */
12733 {
12734 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12735 sizetype from another type of the same width and signedness. */
12740 }
12742 /* Otherwise, take the size from that of the element type. Substitute
12743 any PLACEHOLDER_EXPR that we have. */
12744 else
12746 }
12748 /* Return a tree representing the lower bound of the array mentioned in
12749 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12751 tree
12753 {
12756 /* If a lower bound is specified in EXP, use it. */
12760 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12761 substituting for a PLACEHOLDER_EXPR as needed. */
12765 /* Otherwise, return a zero of the appropriate type. */
12769 }
12771 /* Return a tree representing the upper bound of the array mentioned in
12772 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12774 tree
12776 {
12779 /* If there is a domain type and it has an upper bound, use it, substituting
12780 for a PLACEHOLDER_EXPR as needed. */
12784 /* Otherwise fail. */
12786 }
12788 /* Returns true if REF is an array reference, a component reference,
12789 or a memory reference to an array whose actual size might be larger
12790 than its upper bound implies, there are multiple cases:
12791 A. a ref to a flexible array member at the end of a structure;
12792 B. a ref to an array with a different type against the original decl;
12793 for example:
12795 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12796 (*((char(*)[16])&a[0]))[i+8]
12798 C. a ref to an array that was passed as a parameter;
12799 for example:
12801 int test (uint8_t *p, uint32_t t[1][1], int n) {
12802 for (int i = 0; i < 4; i++, p++)
12803 t[i][0] = ...;
12805 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12806 */
12808 bool
12810 {
12811 /* The TYPE for this array referece. */
12813 /* The FIELD_DECL for the array field in the containing structure. */
12815 /* Whether this array is the trailing array of a structure. */
12822 {
12825 }
12828 {
12831 }
12833 {
12839 {
12841 {
12848 }
12849 else
12851 }
12852 else
12854 }
12855 else
12863 {
12864 /* If the reference chain contains a component reference to a
12865 non-union type and there follows another field the reference
12866 is not at the end of a structure. */
12868 {
12870 {
12876 }
12877 }
12878 /* If we have a multi-dimensional array we do not consider
12879 a non-innermost dimension as flex array if the whole
12880 multi-dimensional array is at struct end.
12881 Same for an array of aggregates with a trailing array
12882 member. */
12886 ;
12887 /* If we view an underlying object as sth else then what we
12888 gathered up to now is what we have to rely on. */
12891 else
12895 }
12900 /* The array now is at struct end. Treat flexible array member as
12901 always subject to extend, even into just padding constrained by
12902 an underlying decl. */
12906 {
12909 }
12911 /* If the reference is based on a declared entity, the size of the array
12912 is constrained by its given domain. (Do not trust commons PR/69368). */
12916 && !(flag_unconstrained_commons
12920 {
12921 /* If the object itself is the array it is not at struct end. */
12925 /* Check whether the array domain covers all of the available
12926 padding. */
12927 poly_int64 offset;
12931 {
12932 *is_trailing_array
12935 }
12937 {
12938 *is_trailing_array
12941 }
12943 /* If at least one extra element fits it is a flexarray. */
12949 {
12950 *is_trailing_array
12953 }
12956 }
12960 }
12963 /* Return a tree representing the offset, in bytes, of the field referenced
12964 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12966 tree
12968 {
12973 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12974 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12975 value. */
12977 {
12978 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12979 sizetype from another type of the same width and signedness. */
12985 }
12987 /* Otherwise, take the offset from that of the field. Substitute
12988 any PLACEHOLDER_EXPR that we have. */
12989 else
12991 }
12993 /* Given the initializer INIT, return the initializer for the field
12994 DECL if it exists, otherwise null. Used to obtain the initializer
12995 for a flexible array member and determine its size. */
12997 static tree
12999 {
13005 {
13010 {
13014 }
13015 }
13018 }
13020 /* Determines the special array member type for the array reference REF. */
13021 special_array_member
13023 {
13029 {
13038 {
13039 /* If array element has zero size, verify if it is a flexible
13040 array member or zero length array. Clear zero_elts if
13041 it has one or more members or is a VLA member. */
13050 }
13052 /* MEMBER is an interior array with more than one element. */
13056 {
13059 else
13061 }
13069 {
13074 /* MEMBER is a trailing array with more than
13075 one elements. */
13080 }
13081 }
13084 }
13086 /* Determines the size of the member referenced by the COMPONENT_REF
13087 REF, using its initializer expression if necessary in order to
13088 determine the size of an initialized flexible array member.
13089 If non-null, set *SAM to the type of special array member.
13090 Returns the size as sizetype (which might be zero for an object
13091 with an uninitialized flexible array member) or null if the size
13092 cannot be determined. */
13094 tree
13096 {
13099 special_array_member sambuf;
13104 /* The object/argument referenced by the COMPONENT_REF and its type. */
13107 /* The referenced member. */
13112 {
13115 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13116 to the type of a class with a virtual base which doesn't
13117 reflect the size of the virtual's members (see pr97595).
13118 If that's the case fail for now and implement something
13119 more robust in the future. */
13123 /* 2-or-more elements arrays are treated as normal arrays by default. */
13130 /* If the trailing array is a not a flexible array member, treat it as
13131 a normal array. */
13139 /* For a reference to a flexible array member of a union
13140 use the size of the union instead of the size of the member. */
13143 }
13145 /* MEMBER is either a bona fide flexible array member, or a zero-elements
13146 array member, or an array of length one treated as such. */
13148 /* If the reference is to a declared object and the member a true
13149 flexible array, try to determine its size from its initializer. */
13153 {
13164 }
13166 /* BASE is the declared object of which MEMBER is either a member
13167 or that is cast to ARGTYPE (e.g., a char buffer used to store
13168 an ARGTYPE object). */
13171 /* Determine the base type of the referenced object. If it's
13172 the same as ARGTYPE and MEMBER has a known size, return it. */
13184 /* MEMBER is a true flexible array member. Compute its size from
13185 the initializer of the BASE object if it has one. */
13188 {
13191 {
13194 {
13195 /* Use the larger of the initializer size and the tail
13196 padding in the enclosing struct. */
13201 }
13204 }
13205 }
13208 {
13210 {
13215 /* The size of a flexible array member of an extern struct
13216 with no initializer cannot be determined (it's defined
13217 in another translation unit and can have an initializer
13218 with an arbitrary number of elements). */
13221 /* Use the size of the base struct or, for interior zero-length
13222 arrays, the size of the enclosing type. */
13224 }
13226 /* Use the size of the BASE object (possibly an array of some
13227 other type such as char used to store the struct). */
13229 else
13231 }
13233 /* If the flexible array member has a known size use the greater
13234 of it and the tail padding in the enclosing struct.
13235 Otherwise, when the size of the flexible array member is unknown
13236 and the referenced object is not a struct, use the size of its
13237 type when known. This detects sizes of array buffers when cast
13238 to struct types with flexible array members. */
13240 {
13245 {
13248 }
13250 }
13252 /* Return "don't know" for an external non-array object since its
13253 flexible array member can be initialized to have any number of
13254 elements. Otherwise, return zero because the flexible array
13255 member has no elements. */
13258 && (!typematch
13261 }
13263 /* Return the machine mode of T. For vectors, returns the mode of the
13264 inner type. The main use case is to feed the result to HONOR_NANS,
13265 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13267 machine_mode
13269 {
13275 }
13277 /* Vector types need to re-check the target flags each time we report
13278 the machine mode. We need to do this because attribute target can
13279 change the result of vector_mode_supported_p and have_regs_of_mode
13280 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13281 change on a per-function basis. */
13282 /* ??? Possibly a better solution is to run through all the types
13283 referenced by a function and re-compute the TYPE_MODE once, rather
13284 than make the TYPE_MODE macro call a function. */
13286 machine_mode
13288 {
13289 machine_mode mode;
13297 {
13298 scalar_int_mode innermode;
13300 /* For integers, try mapping it to a same-sized scalar mode. */
13302 {
13305 scalar_int_mode mode;
13309 }
13312 }
13315 }
13317 /* Return the size in bits of each element of vector type TYPE. */
13319 unsigned int
13321 {
13326 }
13328 /* Calculate the size in bits of each element of vector type TYPE
13329 and return the result as a tree of type bitsizetype. */
13331 tree
13333 {
13338 }
13340 /* Verify that basic properties of T match TV and thus T can be a variant of
13341 TV. TV should be the more specified variant (i.e. the main variant). */
13343 static bool
13345 {
13346 /* Type variant can differ by:
13348 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13349 ENCODE_QUAL_ADDR_SPACE.
13350 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13351 in this case some values may not be set in the variant types
13352 (see TYPE_COMPLETE_P checks).
13353 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13354 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13355 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13356 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13357 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13358 this is necessary to make it possible to merge types form different TUs
13359 - arrays, pointers and references may have TREE_TYPE that is a variant
13360 of TREE_TYPE of their main variants.
13361 - aggregates may have new TYPE_FIELDS list that list variants of
13362 the main variant TYPE_FIELDS.
13363 - vector types may differ by TYPE_VECTOR_OPAQUE
13364 */
13366 /* Convenience macro for matching individual fields. */
13367 #define verify_variant_match(flag) \
13368 do { \
13369 if (flag (tv) != flag (t)) \
13370 { \
13372 debug_tree (tv); \
13373 return false; \
13374 } \
13375 } while (false)
13377 /* tree_base checks. */
13380 /* FIXME: Ada builds non-artificial variants of artificial types. */
13381 #if 0
13384 #endif
13387 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13394 else
13396 /* FIXME: This check trigger during libstdc++ build. */
13397 #if 0
13400 #endif
13402 /* tree_type_common checks. */
13405 {
13413 {
13423 }
13425 }
13431 /* During LTO we merge variant lists from diferent translation units
13432 that may differ BY TYPE_CONTEXT that in turn may point
13433 to TRANSLATION_UNIT_DECL.
13434 Ada also builds variants of types with different TYPE_CONTEXT. */
13435 #if 0
13438 #endif
13444 {
13448 }
13450 /* tree_type_non_common checks. */
13452 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13453 and dangle the pointer from time to time. */
13457 {
13461 }
13467 {
13470 }
13477 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13478 or even type's main variant. This is needed to make bootstrap pass
13479 and the bug seems new in GCC 5.
13480 C++ FE should be updated to make this consistent and we should check
13481 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13482 is a match with main variant.
13484 Also disable the check for Java for now because of parser hack that builds
13485 first an dummy BINFO and then sometimes replace it by real BINFO in some
13486 of the copies. */
13489 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13490 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13491 at LTO time only. */
13493 {
13501 }
13503 /* Check various uses of TYPE_VALUES_RAW. */
13509 /* Permit incomplete variants of complete type. While FEs may complete
13510 all variants, this does not happen for C++ templates in all cases. */
13514 {
13517 /* Fortran builds qualified variants as new records with items of
13518 qualified type. Verify that they looks same. */
13525 /* FIXME: gfc_nonrestricted_type builds all types as variants
13526 with exception of pointer types. It deeply copies the type
13527 which means that we may end up with a variant type
13528 referring non-variant pointer. We may change it to
13529 produce types as variants, too, like
13530 objc_get_protocol_qualified_type does. */
13536 {
13544 }
13545 }
13548 /* For C++ the qualified variant of array type is really an array type
13549 of qualified TREE_TYPE.
13550 objc builds variants of pointer where pointer to type is a variant, too
13551 in objc_get_protocol_qualified_type. */
13557 {
13565 }
13568 {
13576 }
13578 #undef verify_variant_match
13579 }
13582 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13583 the middle-end types_compatible_p function. It needs to avoid
13584 claiming types are different for types that should be treated
13585 the same with respect to TBAA. Canonical types are also used
13586 for IL consistency checks via the useless_type_conversion_p
13587 predicate which does not handle all type kinds itself but falls
13588 back to pointer-comparison of TYPE_CANONICAL for aggregates
13589 for example. */
13591 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13592 type calculation because we need to allow inter-operability between signed
13593 and unsigned variants. */
13595 bool
13597 {
13598 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13599 signed char and unsigned char. Similarly fortran FE builds
13600 C_SIZE_T as signed type, while C defines it unsigned. */
13603 == INTEGER_TYPE
13606 }
13608 /* Return true iff T1 and T2 are structurally identical for what
13609 TBAA is concerned.
13610 This function is used both by lto.cc canonical type merging and by the
13611 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13612 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13613 only for LTO because only in these cases TYPE_CANONICAL equivalence
13614 correspond to one defined by gimple_canonical_types_compatible_p. */
13616 bool
13619 {
13620 /* Type variants should be same as the main variant. When not doing sanity
13621 checking to verify this fact, go to main variants and save some work. */
13623 {
13626 }
13628 /* Check first for the obvious case of pointer identity. */
13632 /* Check that we have two types to compare. */
13636 /* We consider complete types always compatible with incomplete type.
13637 This does not make sense for canonical type calculation and thus we
13638 need to ensure that we are never called on it.
13640 FIXME: For more correctness the function probably should have three modes
13641 1) mode assuming that types are complete mathcing their structure
13642 2) mode allowing incomplete types but producing equivalence classes
13643 and thus ignoring all info from complete types
13644 3) mode allowing incomplete types to match complete but checking
13645 compatibility between complete types.
13647 1 and 2 can be used for canonical type calculation. 3 is the real
13648 definition of type compatibility that can be used i.e. for warnings during
13649 declaration merging. */
13654 /* If the types have been previously registered and found equal
13655 they still are. */
13659 {
13660 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13661 they are always NULL, but they are set to non-NULL for types
13662 constructed by build_pointer_type and variants. In this case the
13663 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13664 all pointers are considered equal. Be sure to not return false
13665 negatives. */
13669 }
13671 /* For types where we do ODR based TBAA the canonical type is always
13672 set correctly, so we know that types are different if their
13673 canonical types does not match. */
13679 /* Can't be the same type if the types don't have the same code. */
13684 /* Qualifiers do not matter for canonical type comparison purposes. */
13686 /* Void types and nullptr types are always the same. */
13691 /* Can't be the same type if they have different mode. */
13695 /* Non-aggregate types can be handled cheaply. */
13703 {
13704 /* Can't be the same type if they have different recision. */
13708 /* In some cases the signed and unsigned types are required to be
13709 inter-operable. */
13714 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13715 interoperable with "signed char". Unless all frontends are revisited
13716 to agree on these types, we must ignore the flag completely. */
13718 /* Fortran standard define C_PTR type that is compatible with every
13719 C pointer. For this reason we need to glob all pointers into one.
13720 Still pointers in different address spaces are not compatible. */
13722 {
13726 }
13728 /* Tail-recurse to components. */
13733 trust_type_canonical);
13736 }
13738 /* Do type-specific comparisons. */
13740 {
13742 /* Array types are the same if the element types are the same and
13743 the number of elements are the same. */
13745 trust_type_canonical)
13750 else
13751 {
13755 /* For an incomplete external array, the type domain can be
13756 NULL_TREE. Check this condition also. */
13761 else
13762 {
13768 /* The minimum/maximum values have to be the same. */
13780 else
13782 }
13783 }
13787 /* Function types are the same if the return type and arguments types
13788 are the same. */
13790 trust_type_canonical))
13797 else
13798 {
13804 {
13807 trust_type_canonical))
13809 }
13815 }
13820 {
13823 /* Don't try to compare variants of an incomplete type, before
13824 TYPE_FIELDS has been copied around. */
13832 /* For aggregate types, all the fields must be the same. */
13836 {
13837 /* Skip non-fields and zero-sized fields. */
13848 /* The fields must have the same name, offset and type. */
13851 || !gimple_canonical_types_compatible_p
13853 trust_type_canonical))
13855 }
13857 /* If one aggregate has more fields than the other, they
13858 are not the same. */
13863 }
13866 /* Consider all types with language specific trees in them mutually
13867 compatible. This is executed only from verify_type and false
13868 positives can be tolerated. */
13871 }
13872 }
13874 /* For OPAQUE_TYPE T, it should have only size and alignment information
13875 and its mode should be of class MODE_OPAQUE. This function verifies
13876 these properties of T match TV which is the main variant of T and TC
13877 which is the canonical of T. */
13879 static void
13881 {
13886 /* For an opaque type T1, check if some of its properties match
13887 the corresponding ones of the other opaque type T2, emit some
13888 error messages for those inconsistent ones. */
13891 {
13893 {
13897 }
13899 {
13903 }
13905 {
13909 }
13913 {
13917 }
13919 {
13923 }
13925 {
13929 }
13930 };
13937 }
13939 /* Verify type T. */
13941 void
13943 {
13949 {
13952 }
13955 {
13958 }
13960 {
13964 }
13969 ;
13971 {
13975 }
13976 /* Method and function types cannot be used to address memory and thus
13977 TYPE_CANONICAL really matters only for determining useless conversions.
13979 FIXME: C++ FE produce declarations of builtin functions that are not
13980 compatible with main variants. */
13982 ;
13984 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
13985 with variably sized arrays because their sizes possibly
13986 gimplified to different variables. */
13990 {
13994 }
13998 {
14002 }
14004 {
14009 }
14012 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14014 {
14015 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14016 and danagle the pointer from time to time. */
14020 {
14024 }
14025 }
14027 {
14030 {
14034 }
14035 }
14037 {
14040 {
14044 }
14045 }
14048 {
14049 /* FIXME: The following check should pass:
14050 useless_type_conversion_p (const_cast <tree> (t),
14051 TREE_TYPE (TYPE_MIN_VALUE (t))
14052 but does not for C sizetypes in LTO. */
14053 }
14055 /* Check various uses of TYPE_MAXVAL_RAW. */
14057 {
14059 ;
14061 {
14065 }
14067 {
14071 }
14072 }
14074 {
14078 {
14082 }
14083 }
14085 {
14089 {
14093 }
14094 }
14097 {
14098 /* FIXME: The following check should pass:
14099 useless_type_conversion_p (const_cast <tree> (t),
14100 TREE_TYPE (TYPE_MAX_VALUE (t))
14101 but does not for C sizetypes in LTO. */
14102 }
14104 {
14107 {
14111 }
14112 }
14114 {
14118 }
14121 {
14125 }
14127 /* Check various uses of TYPE_VALUES_RAW. */
14130 {
14134 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14135 CONST_DECL of ENUMERAL TYPE. */
14137 {
14142 }
14146 {
14152 }
14154 {
14159 }
14160 }
14162 {
14164 {
14168 }
14169 }
14171 {
14173 {
14176 }
14178 {
14179 /* TODO: verify properties of decls. */
14181 ;
14183 ;
14185 ;
14187 ;
14189 ;
14191 ;
14193 ;
14194 else
14195 {
14199 }
14200 }
14201 }
14208 {
14210 {
14215 }
14217 {
14221 }
14222 /* Verify just enough of cache to ensure that no one copied it to new type.
14223 All copying should go by copy_node that should clear it. */
14225 {
14230 {
14235 }
14236 }
14237 }
14240 {
14241 /* C++ FE uses TREE_PURPOSE to store initial values. */
14243 {
14247 }
14249 {
14253 }
14254 }
14256 {
14260 }
14268 {
14271 }
14273 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14274 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14275 of a type. */
14278 {
14281 }
14284 {
14287 }
14288 }
14291 /* Return 1 if ARG interpreted as signed in its precision is known to be
14292 always positive or 2 if ARG is known to be always negative, or 3 if
14293 ARG may be positive or negative. */
14295 int
14297 {
14304 {
14308 else
14310 }
14314 {
14316 /* Narrower value zero extended into wider type
14317 will always result in positive values. */
14324 }
14328 value_range r;
14330 {
14334 {
14338 {
14347 }
14348 }
14350 }
14352 {
14353 /* For unsigned values, the "positive" range comes
14354 below the "negative" range. */
14359 }
14360 else
14361 {
14366 }
14368 }
14373 /* Return true if ARG is marked with the nonnull attribute in the
14374 current function signature. */
14376 bool
14378 {
14386 /* The static chain decl is always non null. */
14390 /* THIS argument of method is always non-NULL. */
14396 /* Values passed by reference are always non-NULL. */
14403 {
14406 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14410 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14414 /* Get the position number for ARG in the function signature. */
14416 t;
14418 {
14421 }
14425 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14427 {
14430 }
14431 }
14434 }
14436 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14437 information. */
14439 location_t
14441 {
14446 }
14448 location_t
14450 {
14451 source_range src_range;
14455 }
14457 location_t
14459 {
14467 pure_loc,
14468 src_range,
14469 NULL,
14470 discriminator);
14473 }
14475 /* Return EXPR, potentially wrapped with a node expression LOC,
14476 if !CAN_HAVE_LOCATION_P (expr).
14478 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14479 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14481 Wrapper nodes can be identified using location_wrapper_p. */
14483 tree
14485 {
14492 /* We should only be adding wrappers for constants and for decls,
14493 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14498 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14499 any impact of the wrapper nodes. */
14503 /* Compiler-generated temporary variables don't need a wrapper. */
14507 /* If any auto_suppress_location_wrappers are active, don't create
14508 wrappers. */
14512 tree_code code
14517 /* Mark this node as being a wrapper. */
14520 }
14524 /* Return the name of combined function FN, for debugging purposes. */
14528 {
14530 {
14533 }
14534 else
14536 }
14538 /* Return a bitmap with a bit set corresponding to each argument in
14539 a function call type FNTYPE declared with attribute nonnull,
14540 or null if none of the function's argument are nonnull. The caller
14541 must free the bitmap. */
14543 bitmap
14545 {
14551 {
14552 /* The this pointer in C++ non-static member functions is
14553 implicitly nonnull whether or not it's declared as such. */
14556 }
14562 /* A function declaration can specify multiple attribute nonnull,
14563 each with zero or more arguments. The loop below creates a bitmap
14564 representing a union of all the arguments. An empty (but non-null)
14565 bitmap means that all arguments have been declaraed nonnull. */
14567 {
14576 {
14577 /* Clear the bitmap in case a previous attribute nonnull
14578 set it and this one overrides it for all arguments. */
14581 }
14583 /* Iterate over the indices of the format arguments declared nonnull
14584 and set a bit for each. */
14586 {
14589 }
14590 }
14593 }
14595 /* Returns true if TYPE is a type where it and all of its subobjects
14596 (recursively) are of structure, union, or array type. */
14598 bool
14600 {
14602 {
14609 }
14615 }
14617 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14618 that shouldn't be passed via stack. */
14620 bool
14622 {
14633 }
14635 /* Determine whether TYPE is a structure with a flexible array member,
14636 or a union containing such a structure (possibly recursively). */
14638 bool
14640 {
14643 {
14659 {
14663 }
14667 }
14668 }
14670 /* Like int_size_in_bytes, but handle empty records specially. */
14672 HOST_WIDE_INT
14674 {
14676 }
14678 /* Like size_in_bytes, but handle empty records specially. */
14680 tree
14682 {
14684 }
14686 /* Return true if an expression with CODE has to have the same result type as
14687 its first operand. */
14689 bool
14691 {
14693 {
14727 }
14728 }
14730 /* Return a typenode for the "standard" C type with a given name. */
14731 tree
14733 {
14765 }
14767 /* List of pointer types used to declare builtins before we have seen their
14768 real declaration.
14770 Keep the size up to date in tree.h ! */
14772 {
14779 };
14781 /* Return the maximum object size. */
14783 tree
14785 {
14786 /* To do: Make this a configurable parameter. */
14788 }
14790 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14791 parameter default to false and that weeds out error_mark_node. */
14793 bool
14796 {
14803 }
14805 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14806 delete operators. Return false if they may or may not name such
14807 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14808 do not. */
14810 bool
14813 {
14823 /* The following failures are due to invalid names so they're not
14824 considered certain mismatches. */
14840 /* The following failures are due to names of user-defined operators
14841 so they're also not considered certain mismatches. */
14843 /* *_len is now just the length after initial underscores. */
14849 /* The following failures are certain mismatches. */
14852 /* _Znw must match _Zdl, _Zna must match _Zda. */
14856 /* 'j', 'm' and 'y' correspond to size_t. */
14863 {
14864 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14865 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14872 }
14876 {
14877 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14878 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14879 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14889 }
14891 /* The negative result is conservative. */
14894 }
14896 /* Return the zero-based number corresponding to the argument being
14897 deallocated if FNDECL is a deallocation function or an out-of-bounds
14898 value if it isn't. */
14900 unsigned
14902 {
14903 /* A call to operator delete isn't recognized as one to a built-in. */
14905 {
14909 /* Avoid placement delete that's not been inlined. */
14915 }
14917 /* TODO: Handle user-defined functions with attribute malloc? Handle
14918 known non-built-ins like fopen? */
14920 {
14922 {
14928 }
14930 }
14939 {
14950 }
14953 }
14955 /* If EXPR refers to a character array or pointer declared attribute
14956 nonstring, return a decl for that array or pointer and set *REF
14957 to the referenced enclosing object or pointer. Otherwise return
14958 null. */
14960 tree
14962 {
14966 {
14970 {
14976 }
14977 else
14979 }
14984 /* To simplify calling code, store the referenced DECL regardless of
14985 the attribute determined below, but avoid storing the SSA_NAME_VAR
14986 obtained above (it's not useful for dataflow purposes). */
14990 /* Use the SSA_NAME_VAR that was determined above to see if it's
14991 declared nonstring. Otherwise drill down into the referenced
14992 DECL. */
15007 }
15009 /* Return length of attribute names string,
15010 if arglist chain > 1, -1 otherwise. */
15012 int
15014 {
15015 tree arg;
15020 {
15025 argnum++;
15026 argnum++;
15027 }
15031 }
15033 void
15035 {
15037 }
15039 #if CHECKING_P
15043 /* Selftests for tree. */
15045 /* Verify that integer constants are sane. */
15047 static void
15049 {
15062 }
15064 /* Verify identifiers. */
15066 static void
15068 {
15072 }
15074 /* Verify LABEL_DECL. */
15076 static void
15078 {
15084 }
15086 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15087 are given by VALS. */
15089 static tree
15091 {
15096 }
15098 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15100 static void
15102 {
15108 }
15110 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15111 and that its elements match EXPECTED. */
15113 static void
15116 {
15123 }
15125 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15126 and NPATTERNS background elements, and that its elements match
15127 EXPECTED. */
15129 static void
15132 {
15139 }
15141 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15142 and that its elements match EXPECTED. */
15144 static void
15147 {
15154 }
15156 /* Test the creation of VECTOR_CSTs. */
15158 static void
15160 {
15166 /* Test a simple linear series with a base of 0 and a step of 1:
15167 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15173 /* Try the same with the first element replaced by 100:
15174 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15179 /* Try a series that wraps around.
15180 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15186 /* Try a downward series:
15187 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15193 /* Try two interleaved series with different bases and steps:
15194 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15197 {
15200 }
15204 /* Try a duplicated value:
15205 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15211 /* Try an interleaved duplicated value:
15212 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15219 /* Try a duplicated value with 2 exceptions
15220 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15226 /* Try with and without a step
15227 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15233 /* Try a fully-general constant:
15234 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15238 }
15240 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15241 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15242 modifying its argument in-place. */
15244 static void
15246 {
15249 }
15251 /* Verify location wrappers. */
15253 static void
15255 {
15260 /* Wrapping a constant. */
15270 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15273 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15278 /* Wrapping a STRING_CST. */
15290 /* Wrapping a variable. */
15293 integer_type_node);
15302 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15303 wrapper. */
15308 /* Verify that STRIP_NOPS removes wrappers. */
15312 }
15314 /* Test various tree predicates. Verify that location wrappers don't
15315 affect the results. */
15317 static void
15319 {
15320 /* Build various constants and wrappers around them. */
15348 /* TODO: vector constants. */
15350 /* Test integer_onep. */
15370 /* Test integer_zerop. */
15390 /* Test integer_all_onesp. */
15410 /* Test integer_minus_onep. */
15430 /* Test integer_each_onep. */
15450 /* Test integer_truep. */
15470 /* Test integer_nonzerop. */
15490 /* Test real_zerop. */
15510 /* Test real_onep. */
15530 /* Test real_minus_onep. */
15550 /* Test zerop. */
15570 /* Test tree_expr_nonnegative_p. */
15590 /* Test tree_expr_nonzero_p. */
15598 /* Test integer_valued_real_p. */
15605 /* Test integer_pow2p. */
15610 /* Test uniform_integer_cst_p. */
15629 }
15631 /* Check that string escaping works correctly. */
15633 static void
15635 {
15637 escaped_string msg;
15640 /* ASSERT_STREQ does not accept NULL as a valid test
15641 result, so we have to use ASSERT_EQ instead. */
15650 /* Ensure that we have -fmessage-length set to 0. */
15660 /* Now repeat the tests with -fmessage-length set to 5. */
15663 /* Note that the newline is not translated into an escape. */
15670 /* Restore the original message length setting. */
15672 }
15674 /* Run all of the selftests within this file. */
15676 void
15678 {
15686 }