| blob | 58288efa2e2f91ae5bd6f71667c89b4ae3051010 |
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 /* Build a constant of integer type TYPE, made of VALUE's bits replicated
2671 every WIDTH bits to fit TYPE's precision. */
2673 tree
2675 {
2686 else
2687 {
2690 }
2696 return wide_int_to_tree
2698 }
2700 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2701 unsigned constant in which only the sign bit is set. Return null
2702 otherwise. */
2704 tree
2706 {
2707 /* Avoid having to choose between a real-only sign and a pair of signs.
2708 This could be relaxed if the choice becomes obvious later. */
2723 {
2726 }
2728 }
2730 /* Build a BINFO with LEN language slots. */
2732 tree
2734 {
2735 tree t;
2750 }
2752 /* Create a CASE_LABEL_EXPR tree node and return it. */
2754 tree
2756 {
2768 }
2770 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2771 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2772 The latter determines the length of the HOST_WIDE_INT vector. */
2774 tree
2776 {
2777 tree t;
2789 /* to_offset can only be applied to trees that are offset_int-sized
2790 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2791 must be exactly the precision of offset_int and so LEN is correct. */
2794 else
2800 }
2802 /* Build a newly constructed TREE_VEC node of length LEN. */
2804 tree
2806 {
2807 tree t;
2818 }
2820 /* Grow a TREE_VEC node to new length LEN. */
2822 tree
2824 {
2840 }
2841 \f
2842 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2843 fixed, and scalar, complex or vector. */
2845 bool
2847 {
2851 }
2853 /* Return 1 if EXPR is the integer constant zero or a complex constant
2854 of zero, or a location wrapper for such a constant. */
2856 bool
2858 {
2862 {
2874 }
2875 }
2877 /* Return 1 if EXPR is the integer constant one or the corresponding
2878 complex constant, or a location wrapper for such a constant. */
2880 bool
2882 {
2886 {
2898 }
2899 }
2901 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2902 return 1 if every piece is the integer constant one.
2903 Also return 1 for location wrappers for such a constant. */
2905 bool
2907 {
2913 else
2915 }
2917 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2918 it contains, or a complex or vector whose subparts are such integers,
2919 or a location wrapper for such a constant. */
2921 bool
2923 {
2941 }
2943 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2944 for such a constant. */
2946 bool
2948 {
2954 else
2956 }
2958 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2959 one bit on), or a location wrapper for such a constant. */
2961 bool
2963 {
2975 }
2977 /* Return 1 if EXPR is an integer constant other than zero or a
2978 complex constant other than zero, or a location wrapper for such a
2979 constant. */
2981 bool
2983 {
2991 }
2993 /* Return 1 if EXPR is the integer constant one. For vector,
2994 return 1 if every piece is the integer constant minus one
2995 (representing the value TRUE).
2996 Also return 1 for location wrappers for such a constant. */
2998 bool
3000 {
3006 }
3008 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
3009 for such a constant. */
3011 bool
3013 {
3018 }
3020 /* Return the power of two represented by a tree node known to be a
3021 power of two. */
3023 int
3025 {
3030 }
3032 /* Similar, but return the largest integer Y such that 2 ** Y is less
3033 than or equal to EXPR. */
3035 int
3037 {
3042 }
3044 /* Return number of known trailing zero bits in EXPR, or, if the value of
3045 EXPR is known to be zero, the precision of it's type. */
3047 unsigned int
3049 {
3056 {
3077 /* Second operand is sizetype, which could be in theory
3078 wider than pointer's precision. Make sure we never
3079 return more than prec. */
3094 {
3097 }
3102 {
3107 }
3116 {
3119 {
3124 }
3125 }
3127 CASE_CONVERT:
3145 {
3148 }
3152 }
3153 }
3155 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
3156 decimal float constants, so don't return 1 for them.
3157 Also return 1 for location wrappers around such a constant. */
3159 bool
3161 {
3165 {
3173 {
3174 /* Don't simply check for a duplicate because the predicate
3175 accepts both +0.0 and -0.0. */
3181 }
3184 }
3185 }
3187 /* Return 1 if EXPR is the real constant one in real or complex form.
3188 Trailing zeroes matter for decimal float constants, so don't return
3189 1 for them.
3190 Also return 1 for location wrappers around such a constant. */
3192 bool
3194 {
3198 {
3211 }
3212 }
3214 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3215 matter for decimal float constants, so don't return 1 for them.
3216 Also return 1 for location wrappers around such a constant. */
3218 bool
3220 {
3224 {
3237 }
3238 }
3240 /* Return true if T could be a floating point zero. */
3242 bool
3244 {
3246 {
3248 /* Can't use real_zerop here, as it always returns false for decimal
3249 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3250 either, as decimal zeros are rvc_normal. */
3256 {
3262 }
3264 /* Perhaps for SSA_NAMEs we could query frange. */
3266 }
3267 }
3269 /* Nonzero if EXP is a constant or a cast of a constant. */
3271 bool
3273 {
3274 /* This is not quite the same as STRIP_NOPS. It does more. */
3279 }
3281 /* Return true if T holds a polynomial pointer difference, storing it in
3282 *VALUE if so. A true return means that T's precision is no greater
3283 than 64 bits, which is the largest address space we support, so *VALUE
3284 never loses precision. However, the signedness of the result does
3285 not necessarily match the signedness of T: sometimes an unsigned type
3286 like sizetype is used to encode a value that is actually negative. */
3288 bool
3290 {
3294 {
3299 }
3301 {
3308 }
3310 }
3312 poly_int64
3314 {
3319 }
3321 poly_uint64
3323 {
3328 }
3329 \f
3330 /* Return first list element whose TREE_VALUE is ELEM.
3331 Return 0 if ELEM is not in LIST. */
3333 tree
3335 {
3337 {
3341 }
3343 }
3345 /* Return first list element whose TREE_PURPOSE is ELEM.
3346 Return 0 if ELEM is not in LIST. */
3348 tree
3350 {
3352 {
3356 }
3358 }
3360 /* Return true if ELEM is in V. */
3362 bool
3364 {
3366 tree t;
3371 }
3373 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3374 NULL_TREE. */
3376 tree
3378 {
3382 }
3384 /* Return nonzero if ELEM is part of the chain CHAIN. */
3386 bool
3388 {
3390 {
3394 }
3397 }
3399 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3400 We expect a null pointer to mark the end of the chain.
3401 This is the Lisp primitive `length'. */
3403 int
3405 {
3407 #ifdef ENABLE_TREE_CHECKING
3409 #endif
3413 {
3415 #ifdef ENABLE_TREE_CHECKING
3419 #endif
3420 len++;
3421 }
3424 }
3426 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3427 UNION_TYPE TYPE, or NULL_TREE if none. */
3429 tree
3431 {
3436 }
3438 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3439 UNION_TYPE TYPE, or NULL_TREE if none. */
3441 tree
3443 {
3447 {
3452 }
3455 }
3457 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3458 by modifying the last node in chain 1 to point to chain 2.
3459 This is the Lisp primitive `nconc'. */
3461 tree
3463 {
3464 tree t1;
3475 #ifdef ENABLE_TREE_CHECKING
3476 {
3477 tree t2;
3480 }
3481 #endif
3484 }
3486 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3488 tree
3490 {
3491 tree next;
3496 }
3498 /* Reverse the order of elements in the chain T,
3499 and return the new head of the chain (old last element). */
3501 tree
3503 {
3506 {
3507 /* We shouldn't be using this function to reverse BLOCK chains; we
3508 have blocks_nreverse for that. */
3513 }
3515 }
3516 \f
3517 /* Return a newly created TREE_LIST node whose
3518 purpose and value fields are PARM and VALUE. */
3520 tree
3522 {
3527 }
3529 /* Build a chain of TREE_LIST nodes from a vector. */
3531 tree
3533 {
3537 tree t;
3539 {
3542 }
3544 }
3546 /* Return a newly created TREE_LIST node whose
3547 purpose and value fields are PURPOSE and VALUE
3548 and whose TREE_CHAIN is CHAIN. */
3550 tree
3552 {
3553 tree node;
3565 }
3567 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3568 trees. */
3572 {
3576 tree val;
3582 }
3583 \f
3584 /* Return the size nominally occupied by an object of type TYPE
3585 when it resides in memory. The value is measured in units of bytes,
3586 and its data type is that normally used for type sizes
3587 (which is the first type created by make_signed_type or
3588 make_unsigned_type). */
3590 tree
3592 {
3593 tree t;
3602 {
3605 }
3608 }
3610 /* Return the size of TYPE (in bytes) as a wide integer
3611 or return -1 if the size can vary or is larger than an integer. */
3613 HOST_WIDE_INT
3615 {
3616 tree t;
3626 else
3628 }
3630 /* Return the maximum size of TYPE (in bytes) as a wide integer
3631 or return -1 if the size can vary or is larger than an integer. */
3633 HOST_WIDE_INT
3635 {
3637 tree size_tree;
3639 /* If this is an array type, check for a possible MAX_SIZE attached. */
3642 {
3647 }
3649 /* If we still haven't been able to get a size, see if the language
3650 can compute a maximum size. */
3653 {
3658 }
3661 }
3662 \f
3663 /* Return the bit position of FIELD, in bits from the start of the record.
3664 This is a tree of type bitsizetype. */
3666 tree
3668 {
3671 }
3672 \f
3673 /* Return the byte position of FIELD, in bytes from the start of the record.
3674 This is a tree of type sizetype. */
3676 tree
3678 {
3681 }
3683 /* Likewise, but return as an integer. It must be representable in
3684 that way (since it could be a signed value, we don't have the
3685 option of returning -1 like int_size_in_byte can. */
3687 HOST_WIDE_INT
3689 {
3691 }
3692 \f
3693 /* Return, as a tree node, the number of elements for TYPE (which is an
3694 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3696 tree
3698 {
3701 /* If they did it with unspecified bounds, then we should have already
3702 given an error about it before we got here. */
3710 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3712 {
3713 /* zero sized arrays are represented from C FE as complete types with
3714 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3715 them as min 0, max -1. */
3722 }
3725 ? max
3727 }
3728 \f
3729 /* If arg is static -- a reference to an object in static storage -- then
3730 return the object. This is not the same as the C meaning of `static'.
3731 If arg isn't static, return NULL. */
3733 tree
3735 {
3737 {
3739 /* Nested functions are static, even though taking their address will
3740 involve a trampoline as we unnest the nested function and create
3741 the trampoline on the tree level. */
3762 /* If the thing being referenced is not a field, then it is
3763 something language specific. */
3766 /* If we are referencing a bitfield, we can't evaluate an
3767 ADDR_EXPR at compile time and so it isn't a constant. */
3784 else
3792 }
3793 }
3795 \f
3798 /* Return whether OP is a DECL whose address is function-invariant. */
3800 bool
3802 {
3803 /* The conditions below are slightly less strict than the one in
3804 staticp. */
3807 {
3830 }
3833 }
3835 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3837 bool
3839 {
3840 /* The conditions below are slightly less strict than the one in
3841 staticp. */
3844 {
3864 }
3867 }
3870 /* Return true if T is function-invariant (internal function, does
3871 not handle arithmetic; that's handled in skip_simple_arithmetic and
3872 tree_invariant_p). */
3874 static bool
3876 {
3877 tree op;
3884 {
3891 {
3893 {
3908 }
3910 }
3916 }
3919 }
3921 /* Return true if T is function-invariant. */
3923 bool
3925 {
3928 }
3930 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3931 Do this to any expression which may be used in more than one place,
3932 but must be evaluated only once.
3934 Normally, expand_expr would reevaluate the expression each time.
3935 Calling save_expr produces something that is evaluated and recorded
3936 the first time expand_expr is called on it. Subsequent calls to
3937 expand_expr just reuse the recorded value.
3939 The call to expand_expr that generates code that actually computes
3940 the value is the first call *at compile time*. Subsequent calls
3941 *at compile time* generate code to use the saved value.
3942 This produces correct result provided that *at run time* control
3943 always flows through the insns made by the first expand_expr
3944 before reaching the other places where the save_expr was evaluated.
3945 You, the caller of save_expr, must make sure this is so.
3947 Constants, and certain read-only nodes, are returned with no
3948 SAVE_EXPR because that is safe. Expressions containing placeholders
3949 are not touched; see tree.def for an explanation of what these
3950 are used for. */
3952 tree
3954 {
3955 tree inner;
3957 /* If the tree evaluates to a constant, then we don't want to hide that
3958 fact (i.e. this allows further folding, and direct checks for constants).
3959 However, a read-only object that has side effects cannot be bypassed.
3960 Since it is no problem to reevaluate literals, we just return the
3961 literal node. */
3969 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3970 it means that the size or offset of some field of an object depends on
3971 the value within another field.
3973 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3974 and some variable since it would then need to be both evaluated once and
3975 evaluated more than once. Front-ends must assure this case cannot
3976 happen by surrounding any such subexpressions in their own SAVE_EXPR
3977 and forcing evaluation at the proper time. */
3983 /* This expression might be placed ahead of a jump to ensure that the
3984 value was computed on both sides of the jump. So make sure it isn't
3985 eliminated as dead. */
3988 }
3990 /* Look inside EXPR into any simple arithmetic operations. Return the
3991 outermost non-arithmetic or non-invariant node. */
3993 tree
3995 {
3996 /* We don't care about whether this can be used as an lvalue in this
3997 context. */
4001 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
4002 a constant, it will be more efficient to not make another SAVE_EXPR since
4003 it will allow better simplification and GCSE will be able to merge the
4004 computations if they actually occur. */
4006 {
4010 {
4015 else
4017 }
4018 else
4020 }
4023 }
4025 /* Look inside EXPR into simple arithmetic operations involving constants.
4026 Return the outermost non-arithmetic or non-constant node. */
4028 tree
4030 {
4035 {
4039 {
4044 else
4046 }
4047 else
4049 }
4052 }
4054 /* Return which tree structure is used by T. */
4056 enum tree_node_structure_enum
4058 {
4061 }
4063 /* Set various status flags when building a CALL_EXPR object T. */
4065 static void
4067 {
4072 /* Calls have side-effects, except those to const or pure functions. */
4075 /* Propagate TREE_READONLY of arguments for const functions. */
4081 {
4087 }
4091 }
4092 \f
4093 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4094 size or offset that depends on a field within a record. */
4096 bool
4098 {
4109 {
4111 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4112 position computations since they will be converted into a
4113 WITH_RECORD_EXPR involving the reference, which will assume
4114 here will be valid. */
4128 {
4130 /* Ignoring the first operand isn't quite right, but works best. */
4139 /* The save_expr function never wraps anything containing
4140 a PLACEHOLDER_EXPR. */
4145 }
4148 {
4156 }
4160 {
4162 {
4163 const_tree arg;
4164 const_call_expr_arg_iterator iter;
4169 }
4172 }
4176 }
4178 }
4180 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4181 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4182 field positions. */
4184 static bool
4186 {
4187 /* If the size contains a placeholder or the parent type (component type in
4188 the case of arrays) type involves a placeholder, this type does. */
4196 /* Now do type-specific checks. Note that the last part of the check above
4197 greatly limits what we have to do below. */
4199 {
4217 /* Here we just check the bounds. */
4222 /* We have already checked the component type above, so just check
4223 the domain type. Flexible array members have a null domain. */
4230 {
4231 tree field;
4242 }
4246 }
4247 }
4249 /* Wrapper around above function used to cache its result. */
4251 bool
4253 {
4256 /* If the contains_placeholder_bits field has been initialized,
4257 then we know the answer. */
4261 /* Indicate that we've seen this type node, and the answer is false.
4262 This is what we want to return if we run into recursion via fields. */
4265 /* Compute the real value. */
4268 /* Store the real value. */
4272 }
4273 \f
4274 /* Push tree EXP onto vector QUEUE if it is not already present. */
4276 static void
4278 {
4280 tree iter;
4288 }
4290 /* Given a tree EXP, find all occurrences of references to fields
4291 in a PLACEHOLDER_EXPR and place them in vector REFS without
4292 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4293 we assume here that EXP contains only arithmetic expressions
4294 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4295 argument list. */
4297 void
4299 {
4301 tree inner;
4304 /* We handle TREE_LIST and COMPONENT_REF separately. */
4306 {
4309 }
4311 {
4315 ;
4319 else
4321 }
4322 else
4324 {
4329 /* Variables allocated to static storage can stay. */
4335 /* This is the pattern built in ada/make_aligning_type. */
4338 {
4341 }
4343 /* Fall through. */
4361 }
4362 }
4364 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4365 return a tree with all occurrences of references to F in a
4366 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4367 CONST_DECLs. Note that we assume here that EXP contains only
4368 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4369 occurring only in their argument list. */
4371 tree
4373 {
4376 tree new_tree;
4378 /* We handle TREE_LIST and COMPONENT_REF separately. */
4380 {
4387 }
4389 {
4390 tree inner;
4392 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4393 and it is the right field, replace it with R. */
4397 ;
4399 /* The field. */
4405 /* If this expression hasn't been completed let, leave it alone. */
4413 new_tree
4415 }
4416 else
4418 {
4425 else
4432 /* Fall through. */
4440 {
4485 new_tree
4491 }
4495 {
4500 /* If we are trying to replace F with a constant or with another
4501 instance of one of the arguments of the call, inline back
4502 functions which do nothing else than computing a value from
4503 the arguments they are passed. This makes it possible to
4504 fold partially or entirely the replacement expression. */
4506 {
4510 else
4513 {
4516 }
4518 {
4522 }
4523 }
4526 {
4530 {
4534 }
4535 }
4538 {
4542 }
4543 else
4545 }
4550 }
4558 }
4560 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4561 for it within OBJ, a tree that is an object or a chain of references. */
4563 tree
4565 {
4568 tree new_tree;
4570 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4571 in the chain of OBJ. */
4573 {
4575 tree elt;
4605 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4606 survives until RTL generation, there will be an error. */
4608 }
4610 /* TREE_LIST is special because we need to look at TREE_VALUE
4611 and TREE_CHAIN, not TREE_OPERANDS. */
4613 {
4620 }
4621 else
4623 {
4636 {
4681 new_tree
4687 }
4691 {
4697 {
4701 {
4705 }
4706 }
4709 {
4713 }
4714 else
4716 }
4721 }
4729 }
4730 \f
4732 /* Subroutine of stabilize_reference; this is called for subtrees of
4733 references. Any expression with side-effects must be put in a SAVE_EXPR
4734 to ensure that it is only evaluated once.
4736 We don't put SAVE_EXPR nodes around everything, because assigning very
4737 simple expressions to temporaries causes us to miss good opportunities
4738 for optimizations. Among other things, the opportunity to fold in the
4739 addition of a constant into an addressing mode often gets lost, e.g.
4740 "y[i+1] += x;". In general, we take the approach that we should not make
4741 an assignment unless we are forced into it - i.e., that any non-side effect
4742 operator should be allowed, and that cse should take care of coalescing
4743 multiple utterances of the same expression should that prove fruitful. */
4745 static tree
4747 {
4748 tree result;
4751 /* We cannot ignore const expressions because it might be a reference
4752 to a const array but whose index contains side-effects. But we can
4753 ignore things that are actual constant or that already have been
4754 handled by this function. */
4760 {
4762 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4763 have side-effects. */
4766 /* FALLTHRU */
4774 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4775 so that it will only be evaluated once. */
4776 /* The reference (r) and comparison (<) classes could be handled as
4777 below, but it is generally faster to only evaluate them once. */
4783 /* Constants need no processing. In fact, we should never reach
4784 here. */
4788 /* Division is slow and tends to be compiled with jumps,
4789 especially the division by powers of 2 that is often
4790 found inside of an array reference. So do it just once. */
4796 /* Recursively stabilize each operand. */
4802 /* Recursively stabilize each operand. */
4808 }
4816 }
4818 /* Stabilize a reference so that we can use it any number of times
4819 without causing its operands to be evaluated more than once.
4820 Returns the stabilized reference. This works by means of save_expr,
4821 so see the caveats in the comments about save_expr.
4823 Also allows conversion expressions whose operands are references.
4824 Any other kind of expression is returned unchanged. */
4826 tree
4828 {
4829 tree result;
4833 {
4837 /* No action is needed in this case. */
4840 CASE_CONVERT:
4879 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4880 it wouldn't be ignored. This matters when dealing with
4881 volatiles. */
4884 /* If arg isn't a kind of lvalue we recognize, make no change.
4885 Caller should recognize the error for an invalid lvalue. */
4891 }
4900 }
4901 \f
4902 /* Low-level constructors for expressions. */
4904 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4905 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4907 void
4909 {
4910 tree node;
4915 /* We started out assuming this address is both invariant and constant, but
4916 does not have side effects. Now go down any handled components and see if
4917 any of them involve offsets that are either non-constant or non-invariant.
4918 Also check for side-effects.
4920 ??? Note that this code makes no attempt to deal with the case where
4921 taking the address of something causes a copy due to misalignment. */
4923 #define UPDATE_FLAGS(NODE) \
4924 do { tree _node = (NODE); \
4925 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4926 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4930 {
4931 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4932 array reference (probably made temporarily by the G++ front end),
4933 so ignore all the operands. */
4937 {
4943 }
4944 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4945 FIELD_DECL, apparently. The G++ front end can put something else
4946 there, at least temporarily. */
4949 {
4952 }
4953 }
4957 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4958 the address, since &(*a)->b is a form of addition. If it's a constant, the
4959 address is constant too. If it's a decl, its address is constant if the
4960 decl is static. Everything else is not constant and, furthermore,
4961 taking the address of a volatile variable is not volatile. */
4966 ;
4969 else
4970 {
4973 }
4978 #undef UPDATE_FLAGS
4979 }
4981 /* Build an expression of code CODE, data type TYPE, and operands as
4982 specified. Expressions and reference nodes can be created this way.
4983 Constants, decls, types and misc nodes cannot be.
4985 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4986 enough for all extant tree codes. */
4988 tree
4990 {
4991 tree t;
4999 }
5001 tree
5003 {
5005 tree t;
5021 {
5024 }
5027 {
5030 }
5032 {
5034 /* All of these have side-effects, no matter what their
5035 operands are. */
5041 /* Whether a dereference is readonly has nothing to do with whether
5042 its operand is readonly. */
5060 }
5063 }
5065 #define PROCESS_ARG(N) \
5066 do { \
5067 TREE_OPERAND (t, N) = arg##N; \
5068 if (arg##N &&!TYPE_P (arg##N)) \
5069 { \
5070 if (TREE_SIDE_EFFECTS (arg##N)) \
5071 side_effects = 1; \
5072 if (!TREE_READONLY (arg##N) \
5073 && !CONSTANT_CLASS_P (arg##N)) \
5074 (void) (read_only = 0); \
5075 if (!TREE_CONSTANT (arg##N)) \
5076 (void) (constant = 0); \
5077 } \
5078 } while (0)
5080 tree
5082 {
5084 tree t;
5090 /* When sizetype precision doesn't match that of pointers
5091 we need to be able to build explicit extensions or truncations
5092 of the offset argument. */
5104 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5105 result based on those same flags for the arguments. But if the
5106 arguments aren't really even `tree' expressions, we shouldn't be trying
5107 to do this. */
5109 /* Expressions without side effects may be constant if their
5110 arguments are as well. */
5117 {
5131 }
5138 {
5140 {
5144 }
5145 }
5146 else
5147 {
5149 /* Don't mark X / 0 as constant. */
5154 }
5157 }
5160 tree
5162 tree arg2 MEM_STAT_DECL)
5163 {
5165 tree t;
5175 /* As a special exception, if COND_EXPR has NULL branches, we
5176 assume that it is a gimple statement and always consider
5177 it to have side effects. */
5183 else
5199 }
5201 tree
5204 {
5206 tree t;
5226 }
5228 tree
5231 {
5233 tree t;
5250 {
5252 {
5256 }
5257 }
5258 else
5264 }
5266 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5267 on the pointer PTR. */
5269 tree
5271 {
5274 tree tem;
5275 /* For convenience allow addresses that collapse to a simple base
5276 and offset. */
5280 {
5284 {
5287 }
5288 else
5291 }
5296 }
5298 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5300 poly_offset_int
5302 {
5304 SIGNED);
5305 }
5307 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5308 offsetted by OFFSET units. */
5310 tree
5312 {
5319 }
5321 /* Similar except don't specify the TREE_TYPE
5322 and leave the TREE_SIDE_EFFECTS as 0.
5323 It is permissible for arguments to be null,
5324 or even garbage if their values do not matter. */
5326 tree
5328 {
5329 tree t;
5346 }
5348 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5349 tree vec. */
5351 tree
5353 {
5363 }
5364 \f
5365 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5366 and data type TYPE.
5367 We do NOT enter this node in any sort of symbol table.
5369 LOC is the location of the decl.
5371 layout_decl is used to set up the decl's storage layout.
5372 Other slots are initialized to 0 or null pointers. */
5374 tree
5376 tree type MEM_STAT_DECL)
5377 {
5378 tree t;
5383 /* if (type == error_mark_node)
5384 type = integer_type_node; */
5385 /* That is not done, deliberately, so that having error_mark_node
5386 as the type can suppress useless errors in the use of this variable. */
5395 }
5397 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5399 tree
5401 {
5407 }
5409 /* Builds and returns function declaration with NAME and TYPE. */
5411 tree
5413 {
5423 }
5427 /* Builds a new translation-unit decl with name NAME, queues it in the
5428 global list of translation-unit decls and returns it. */
5430 tree
5432 {
5438 }
5440 \f
5441 /* BLOCK nodes are used to represent the structure of binding contours
5442 and declarations, once those contours have been exited and their contents
5443 compiled. This information is used for outputting debugging info. */
5445 tree
5447 {
5455 }
5457 \f
5458 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5460 LOC is the location to use in tree T. */
5462 void
5464 {
5468 {
5472 }
5473 }
5475 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5476 UNKNOWN_LOCATION. */
5478 void
5480 {
5484 }
5485 \f
5486 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5487 of the various TYPE_QUAL values. */
5489 static void
5491 {
5497 }
5499 /* Returns true iff CAND and BASE have equivalent language-specific
5500 qualifiers. */
5502 bool
5504 {
5507 /* type_hash_eq currently only applies to these types. */
5512 }
5514 /* This function checks to see if TYPE matches the size one of the built-in
5515 atomic types, and returns that core atomic type. */
5517 static tree
5519 {
5520 tree base_atomic_type;
5522 /* Only handle complete types. */
5527 {
5550 }
5553 }
5555 /* Returns true iff unqualified CAND and BASE are equivalent. */
5557 bool
5559 {
5561 /* Apparently this is needed for Objective-C. */
5566 /* Check alignment. */
5570 /* Atomic types increase minimal alignment. We must to do so as well
5571 or we get duplicated canonical types. See PR88686. */
5573 {
5574 /* See if this object can map to a basic atomic type. */
5578 }
5580 }
5582 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5584 bool
5586 {
5590 }
5592 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5594 static bool
5596 {
5599 /* Apparently this is needed for Objective-C. */
5601 /* Check alignment. */
5603 /* Check this is a user-aligned type as build_aligned_type
5604 would create. */
5609 }
5611 /* Return a version of the TYPE, qualified as indicated by the
5612 TYPE_QUALS, if one exists. If no qualified version exists yet,
5613 return NULL_TREE. */
5615 tree
5617 {
5625 /* Search the chain of variants to see if there is already one there just
5626 like the one we need to have. If so, use that existing one. We must
5627 preserve the TYPE_NAME, since there is code that depends on this. */
5630 {
5631 /* Put the found variant at the head of the variant list so
5632 frequently searched variants get found faster. The C++ FE
5633 benefits greatly from this. */
5639 }
5642 }
5644 /* Like get_qualified_type, but creates the type if it does not
5645 exist. This function never returns NULL_TREE. */
5647 tree
5649 {
5650 tree t;
5652 /* See if we already have the appropriate qualified variant. */
5655 /* If not, build it. */
5657 {
5662 {
5663 /* See if this object can map to a basic atomic type. */
5666 {
5667 /* Ensure the alignment of this type is compatible with
5668 the required alignment of the atomic type. */
5671 }
5672 }
5675 /* Propagate structural equality. */
5678 /* Build the underlying canonical type, since it is different
5679 from TYPE. */
5680 {
5683 }
5684 else
5685 /* T is its own canonical type. */
5688 }
5691 }
5693 /* Create a variant of type T with alignment ALIGN. */
5695 tree
5697 {
5698 tree t;
5713 }
5715 /* Create a new distinct copy of TYPE. The new type is made its own
5716 MAIN_VARIANT. If TYPE requires structural equality checks, the
5717 resulting type requires structural equality checks; otherwise, its
5718 TYPE_CANONICAL points to itself. */
5720 tree
5722 {
5728 /* Set the canonical type either to a new equivalence class, or
5729 propagate the need for structural equality checks. */
5732 else
5735 /* Make it its own variant. */
5739 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5740 whose TREE_TYPE is not t. This can also happen in the Ada
5741 frontend when using subtypes. */
5744 }
5746 /* Create a new variant of TYPE, equivalent but distinct. This is so
5747 the caller can modify it. TYPE_CANONICAL for the return type will
5748 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5749 are considered equal by the language itself (or that both types
5750 require structural equality checks). */
5752 tree
5754 {
5759 /* Since we're building a variant, assume that it is a non-semantic
5760 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5762 /* Type variants have no alias set defined. */
5765 /* Add the new type to the chain of variants of TYPE. */
5771 }
5772 \f
5773 /* Return true if the from tree in both tree maps are equal. */
5775 int
5777 {
5781 }
5783 /* Hash a from tree in a tree_base_map. */
5785 unsigned int
5787 {
5789 }
5791 /* Return true if this tree map structure is marked for garbage collection
5792 purposes. We simply return true if the from tree is marked, so that this
5793 structure goes away when the from tree goes away. */
5795 int
5797 {
5799 }
5801 /* Hash a from tree in a tree_map. */
5803 unsigned int
5805 {
5807 }
5809 /* Hash a from tree in a tree_decl_map. */
5811 unsigned int
5813 {
5815 }
5817 /* Return the initialization priority for DECL. */
5819 priority_type
5821 {
5826 return
5828 }
5830 /* Return the finalization priority for DECL. */
5832 priority_type
5834 {
5839 return
5841 }
5843 /* Set the initialization priority for DECL to PRIORITY. */
5845 void
5847 {
5851 {
5855 }
5858 else
5861 }
5863 /* Set the finalization priority for DECL to PRIORITY. */
5865 void
5867 {
5871 {
5875 }
5876 else
5879 }
5881 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5883 static void
5885 {
5890 }
5892 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5894 static void
5896 {
5901 }
5903 /* Lookup a debug expression for FROM, and return it if we find one. */
5905 tree
5907 {
5915 }
5917 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5919 void
5921 {
5928 }
5930 /* Lookup a value expression for FROM, and return it if we find one. */
5932 tree
5934 {
5942 }
5944 /* Insert a mapping FROM->TO in the value expression hashtable. */
5946 void
5948 {
5951 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5958 }
5960 /* Lookup a vector of debug arguments for FROM, and return it if we
5961 find one. */
5965 {
5976 }
5978 /* Insert a mapping FROM->empty vector of debug arguments in the value
5979 expression hashtable. */
5983 {
5998 }
6000 /* Hashing of types so that we don't make duplicates.
6001 The entry point is `type_hash_canon'. */
6003 /* Generate the default hash code for TYPE. This is designed for
6004 speed, rather than maximum entropy. */
6006 hashval_t
6008 {
6017 /* Just the identifier is adequate to distinguish. */
6021 {
6024 /* FALLTHROUGH. */
6036 {
6040 {
6043 }
6044 }
6048 {
6055 }
6059 {
6063 }
6071 }
6074 }
6076 /* These are the Hashtable callback functions. */
6078 /* Returns true iff the types are equivalent. */
6080 bool
6082 {
6083 /* First test the things that are the same for all types. */
6093 /* Be careful about comparing arrays before and after the element type
6094 has been completed; don't compare TYPE_ALIGN unless both types are
6095 complete. */
6102 {
6125 /* fall through */
6157 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6158 where the flag should be inherited from the element type
6159 and can change after ARRAY_TYPEs are created; on non-aggregates
6160 compare it and hash it, scalars will never have that flag set
6161 and we need to differentiate between arrays created by different
6162 front-ends or middle-end created arrays. */
6194 }
6200 }
6202 /* Given TYPE, and HASHCODE its hash code, return the canonical
6203 object for an identical type if one already exists.
6204 Otherwise, return TYPE, and record it as the canonical object.
6206 To use this function, first create a type of the sort you want.
6207 Then compute its hash code from the fields of the type that
6208 make it different from other similar types.
6209 Then call this function and use the value. */
6211 tree
6213 {
6214 type_hash in;
6217 /* The hash table only contains main variants, so ensure that's what we're
6218 being passed. */
6221 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6222 must call that routine before comparing TYPE_ALIGNs. */
6230 {
6236 /* Free also min/max values and the cache for integer
6237 types. This can't be done in free_node, as LTO frees
6238 those on its own. */
6240 {
6243 {
6244 /* Zero is always in TYPE_CACHED_VALUES. */
6248 }
6251 {
6254 }
6257 }
6260 }
6261 else
6262 {
6271 }
6272 }
6274 static void
6276 {
6281 }
6283 /* Given two lists of types
6284 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6285 return 1 if the lists contain the same types in the same order.
6286 Also, the TREE_PURPOSEs must match. */
6288 bool
6290 {
6302 }
6304 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6305 given by TYPE. If the argument list accepts variable arguments,
6306 then this function counts only the ordinary arguments. */
6308 int
6310 {
6314 /* If the function does not take a variable number of arguments,
6315 the last element in the list will have type `void'. */
6318 else
6322 }
6324 /* Return the type of the function TYPE's argument ARGNO if known.
6325 For vararg function's where ARGNO refers to one of the variadic
6326 arguments return null. Otherwise, return a void_type_node for
6327 out-of-bounds ARGNO. */
6329 tree
6331 {
6332 /* Treat zero the same as an out-of-bounds argument number. */
6336 function_args_iterator iter;
6338 tree argtype;
6341 {
6342 /* A vararg function's argument list ends in a null. Otherwise,
6343 an ordinary function's argument list ends with void. Return
6344 null if ARGNO refers to a vararg argument, void_type_node if
6345 it's out of bounds, and the formal argument type otherwise. */
6353 }
6356 }
6358 /* Nonzero if integer constants T1 and T2
6359 represent the same constant value. */
6361 int
6363 {
6379 }
6381 /* Return true if T is an INTEGER_CST whose numerical value (extended
6382 according to TYPE_UNSIGNED) fits in a signed 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_int64. */
6395 bool
6397 {
6401 {
6406 }
6409 }
6411 /* Return true if T is an INTEGER_CST whose numerical value (extended
6412 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6414 bool
6416 {
6420 }
6422 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6423 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6425 bool
6427 {
6431 {
6436 }
6439 }
6441 /* T is an INTEGER_CST whose numerical value (extended according to
6442 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6443 HOST_WIDE_INT. */
6445 HOST_WIDE_INT
6447 {
6450 }
6452 /* T is an INTEGER_CST whose numerical value (extended according to
6453 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6454 HOST_WIDE_INT. */
6456 unsigned HOST_WIDE_INT
6458 {
6461 }
6463 /* Return the most significant (sign) bit of T. */
6465 int
6467 {
6471 }
6473 /* Return an indication of the sign of the integer constant T.
6474 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6475 Note that -1 will never be returned if T's type is unsigned. */
6477 int
6479 {
6486 else
6488 }
6490 /* Return the minimum number of bits needed to represent VALUE in a
6491 signed or unsigned type, UNSIGNEDP says which. */
6493 unsigned int
6495 {
6496 /* If the value is negative, compute its negative minus 1. The latter
6497 adjustment is because the absolute value of the largest negative value
6498 is one larger than the largest positive value. This is equivalent to
6499 a bit-wise negation, so use that operation instead. */
6504 /* Return the number of bits needed, taking into account the fact
6505 that we need one more bit for a signed than unsigned type.
6506 If value is 0 or -1, the minimum precision is 1 no matter
6507 whether unsignedp is true or false. */
6511 else
6513 }
6515 /* Return truthvalue of whether T1 is the same tree structure as T2.
6516 Return 1 if they are the same.
6517 Return 0 if they are understandably different.
6518 Return -1 if either contains tree structure not understood by
6519 this function. */
6521 int
6523 {
6533 /* For location wrappers to be the same, they must be at the same
6534 source location (and wrap the same thing). */
6536 {
6540 }
6546 {
6550 else
6552 }
6562 {
6578 {
6587 /* ??? Should we handle also fields here? */
6591 }
6602 {
6610 {
6614 }
6616 }
6619 /* Special case: if either target is an unallocated VAR_DECL,
6620 it means that it's going to be unified with whatever the
6621 TARGET_EXPR is really supposed to initialize, so treat it
6622 as being equivalent to anything. */
6630 else
6659 /* A false return means maybe_ne rather than known_ne. */
6665 }
6667 /* This general rule works for most tree codes. All exceptions should be
6668 handled above. If this is a language-specific tree code, we can't
6669 trust what might be in the operand, so say we don't know
6670 the situation. */
6675 {
6684 {
6688 }
6694 }
6695 }
6697 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6698 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6699 than U, respectively. */
6701 int
6703 {
6712 else
6714 }
6716 /* Return true if SIZE represents a constant size that is in bounds of
6717 what the middle-end and the backend accepts (covering not more than
6718 half of the address-space).
6719 When PERR is non-null, set *PERR on failure to the description of
6720 why SIZE is not valid. */
6722 bool
6724 {
6726 {
6733 }
6735 cst_size_error error;
6740 {
6743 }
6746 {
6749 }
6752 {
6755 }
6759 {
6762 }
6765 }
6767 /* Return the precision of the type, or for a complex or vector type the
6768 precision of the type of its elements. */
6770 unsigned int
6772 {
6780 }
6782 /* Return true if CODE represents an associative tree code. Otherwise
6783 return false. */
6784 bool
6786 {
6788 {
6800 }
6802 }
6804 /* Return true if CODE represents a commutative tree code. Otherwise
6805 return false. */
6806 bool
6808 {
6810 {
6837 }
6839 }
6841 /* Return true if CODE represents a ternary tree code for which the
6842 first two operands are commutative. Otherwise return false. */
6843 bool
6845 {
6847 {
6855 }
6857 }
6859 /* Returns true if CODE can overflow. */
6861 bool
6863 {
6865 {
6870 /* Can overflow in various ways. */
6876 /* For INT_MIN / -1. */
6880 /* For -INT_MIN. */
6883 /* These operators cannot overflow. */
6885 }
6886 }
6888 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6889 ftrapv doesn't generate trapping insns for CODE. */
6891 bool
6893 {
6896 /* We don't generate instructions that trap on overflow for complex or vector
6897 types. */
6905 {
6911 /* These operators can overflow, and -ftrapv generates trapping code for
6912 these. */
6919 /* These operators can overflow, but -ftrapv does not generate trapping
6920 code for these. */
6923 /* These operators cannot overflow. */
6925 }
6926 }
6928 /* Constructors for pointer, array and function types.
6929 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6930 constructed by language-dependent code, not here.) */
6932 /* Construct, lay out and return the type of pointers to TO_TYPE with
6933 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6934 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6935 indicate this type can reference all of memory. If such a type has
6936 already been constructed, reuse it. */
6938 tree
6941 {
6942 tree t;
6949 {
6952 }
6954 /* If the pointed-to type has the may_alias attribute set, force
6955 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6959 /* In some cases, languages will have things that aren't a POINTER_TYPE
6960 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6961 In that case, return that type without regard to the rest of our
6962 operands.
6964 ??? This is a kludge, but consistent with the way this function has
6965 always operated and there doesn't seem to be a good way to avoid this
6966 at the moment. */
6971 /* First, if we already have a type for pointers to TO_TYPE and it's
6972 the proper mode, use it. */
6985 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6993 /* Lay out the type. This function has many callers that are concerned
6994 with expression-construction, and this simplifies them all. */
6998 }
7000 /* By default build pointers in ptr_mode. */
7002 tree
7004 {
7006 }
7008 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7010 tree
7013 {
7014 tree t;
7021 {
7024 }
7026 /* If the pointed-to type has the may_alias attribute set, force
7027 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7031 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7032 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7033 In that case, return that type without regard to the rest of our
7034 operands.
7036 ??? This is a kludge, but consistent with the way this function has
7037 always operated and there doesn't seem to be a good way to avoid this
7038 at the moment. */
7043 /* First, if we already have a type for pointers to TO_TYPE and it's
7044 the proper mode, use it. */
7057 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7068 }
7071 /* Build the node for the type of references-to-TO_TYPE by default
7072 in ptr_mode. */
7074 tree
7076 {
7078 }
7080 #define MAX_INT_CACHED_PREC \
7081 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7084 static void
7086 {
7088 {
7090 }
7091 }
7093 /* Builds a signed or unsigned integer type of precision PRECISION.
7094 Used for C bitfields whose precision does not match that of
7095 built-in target types. */
7096 tree
7099 {
7106 {
7110 }
7117 else
7127 }
7129 #define MAX_BOOL_CACHED_PREC \
7130 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7133 /* Builds a boolean type of precision PRECISION.
7134 Used for boolean vectors to choose proper vector element size. */
7135 tree
7137 {
7138 tree type;
7141 {
7145 }
7155 }
7157 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7158 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7159 is true, reuse such a type that has already been constructed. */
7161 static tree
7163 {
7186 {
7187 /* Since we cannot reliably merge this type, we need to compare it using
7188 structural equality checks. */
7191 }
7197 }
7199 /* Wrapper around build_range_type_1 with SHARED set to true. */
7201 tree
7203 {
7205 }
7207 /* Wrapper around build_range_type_1 with SHARED set to false. */
7209 tree
7211 {
7213 }
7215 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7216 MAXVAL should be the maximum value in the domain
7217 (one less than the length of the array).
7219 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7220 We don't enforce this limit, that is up to caller (e.g. language front end).
7221 The limit exists because the result is a signed type and we don't handle
7222 sizes that use more than one HOST_WIDE_INT. */
7224 tree
7226 {
7228 }
7230 /* Return true if the debug information for TYPE, a subtype, should be emitted
7231 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7232 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7233 debug info and doesn't reflect the source code. */
7235 bool
7237 {
7240 /* Subrange types have a base type which is an integral type. */
7244 /* Get the real bounds of the subtype. */
7247 else
7248 {
7251 }
7253 /* If the type and its base type have the same representation and the same
7254 name, then the type is not a subrange but a copy of the base type. */
7268 }
7270 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7271 and number of elements specified by the range of values of INDEX_TYPE.
7272 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7273 If SHARED is true, reuse such a type that has already been constructed.
7274 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7276 tree
7279 {
7280 tree t;
7283 {
7286 }
7296 {
7299 }
7302 {
7311 index_type
7314 }
7317 }
7319 /* Wrapper around build_array_type_1 with SHARED set to true. */
7321 tree
7323 {
7324 return
7326 }
7328 /* Wrapper around build_array_type_1 with SHARED set to false. */
7330 tree
7332 {
7334 }
7336 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7337 sizetype. */
7339 tree
7341 {
7343 }
7345 /* Computes the canonical argument types from the argument type list
7346 ARGTYPES.
7348 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7349 on entry to this function, or if any of the ARGTYPES are
7350 structural.
7352 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7353 true on entry to this function, or if any of the ARGTYPES are
7354 non-canonical.
7356 Returns a canonical argument list, which may be ARGTYPES when the
7357 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7358 true) or would not differ from ARGTYPES. */
7360 static tree
7364 {
7365 tree arg;
7369 {
7371 /* Fail gracefully by stating that the type is structural. */
7377 /* If the argument has a default argument, we consider it
7378 non-canonical even though the type itself is canonical.
7379 That way, different variants of function and method types
7380 with default arguments will all point to the variant with
7381 no defaults as their canonical type. */
7383 }
7389 {
7390 /* Build the canonical list of argument types. */
7395 {
7398 else
7401 canon_argtypes);
7402 }
7408 /* There is a non-canonical type. */
7411 }
7413 /* The canonical argument types are the same as ARGTYPES. */
7415 }
7417 /* Construct, lay out and return
7418 the type of functions returning type VALUE_TYPE
7419 given arguments of types ARG_TYPES.
7420 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7421 are data type nodes for the arguments of the function.
7422 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7423 variable-arguments function with (...) prototype (no named arguments).
7424 If such a type has already been constructed, reuse it. */
7426 tree
7429 {
7430 tree t;
7433 tree canon_argtypes;
7438 {
7441 }
7443 /* Make a node of the sort we want. */
7448 {
7451 }
7453 /* If we already have such a type, use the old one. */
7457 /* Set up the canonical type. */
7467 canon_argtypes);
7472 }
7474 /* Build a function type. The RETURN_TYPE is the type returned by the
7475 function. If VAARGS is set, no void_type_node is appended to the
7476 list. ARGP must be always be terminated be a NULL_TREE. */
7478 static tree
7480 {
7488 {
7493 }
7496 else
7497 {
7501 }
7505 }
7507 /* Build a function type. The RETURN_TYPE is the type returned by the
7508 function. If additional arguments are provided, they are
7509 additional argument types. The list of argument types must always
7510 be terminated by NULL_TREE. */
7512 tree
7514 {
7515 tree args;
7522 }
7524 /* Build a variable argument function type. The RETURN_TYPE is the
7525 type returned by the function. If additional arguments are provided,
7526 they are additional argument types. The list of argument types must
7527 always be terminated by NULL_TREE. */
7529 tree
7531 {
7532 tree args;
7540 }
7542 /* Build a function type. RETURN_TYPE is the type returned by the
7543 function; VAARGS indicates whether the function takes varargs. The
7544 function takes N named arguments, the types of which are provided in
7545 ARG_TYPES. */
7547 static tree
7550 {
7558 }
7560 /* Build a function type. RETURN_TYPE is the type returned by the
7561 function. The function takes N named arguments, the types of which
7562 are provided in ARG_TYPES. */
7564 tree
7566 {
7568 }
7570 /* Build a variable argument function type. RETURN_TYPE is the type
7571 returned by the function. The function takes N named arguments, the
7572 types of which are provided in ARG_TYPES. */
7574 tree
7576 {
7578 }
7580 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7581 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7582 for the method. An implicit additional parameter (of type
7583 pointer-to-BASETYPE) is added to the ARGTYPES. */
7585 tree
7587 tree rettype,
7588 tree argtypes)
7589 {
7590 tree t;
7591 tree ptype;
7593 tree canon_argtypes;
7595 /* Make a node of the sort we want. */
7602 /* The actual arglist for this function includes a "hidden" argument
7603 which is "this". Put it into the list of argument types. */
7607 /* If we already have such a type, use the old one. */
7611 /* Set up the canonical type. */
7612 any_structural_p
7615 any_noncanonical_p
7627 canon_argtypes);
7632 }
7634 /* Construct, lay out and return the type of methods belonging to class
7635 BASETYPE and whose arguments and values are described by TYPE.
7636 If that type exists already, reuse it.
7637 TYPE must be a FUNCTION_TYPE node. */
7639 tree
7641 {
7647 }
7649 /* Construct, lay out and return the type of offsets to a value
7650 of type TYPE, within an object of type BASETYPE.
7651 If a suitable offset type exists already, reuse it. */
7653 tree
7655 {
7656 tree t;
7658 /* Make a node of the sort we want. */
7664 /* If we already have such a type, use the old one. */
7672 {
7681 }
7684 }
7686 /* Create a complex type whose components are COMPONENT_TYPE.
7688 If NAMED is true, the type is given a TYPE_NAME. We do not always
7689 do so because this creates a DECL node and thus make the DECL_UIDs
7690 dependent on the type canonicalization hashtable, which is GC-ed,
7691 so the DECL_UIDs would not be stable wrt garbage collection. */
7693 tree
7695 {
7700 /* Make a node of the sort we want. */
7705 /* If we already have such a type, use the old one. */
7710 {
7711 /* We created a new type. The hash insertion will have laid
7712 out the type. We need to check the canonicalization and
7713 maybe set the name. */
7724 /* We need to create a name, since complex is a fundamental type. */
7726 {
7755 }
7756 }
7759 }
7761 /* If TYPE is a real or complex floating-point type and the target
7762 does not directly support arithmetic on TYPE then return the wider
7763 type to be used for arithmetic on TYPE. Otherwise, return
7764 NULL_TREE. */
7766 tree
7768 {
7769 /* The target can give two different responses to the question of
7770 which excess precision mode it would like depending on whether we
7771 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7773 enum excess_precision_type requested_type
7775 ? EXCESS_PRECISION_TYPE_FAST
7779 enum flt_eval_method target_flt_eval_method
7782 /* The target should not ask for unpredictable float evaluation (though
7783 it might advertise that implicitly the evaluation is unpredictable,
7784 but we don't care about that here, it will have been reported
7785 elsewhere). If it does ask for unpredictable evaluation, we have
7786 nothing to do here. */
7789 /* Nothing to do. The target has asked for all types we know about
7790 to be computed with their native precision and range. */
7794 /* The target will promote this type in a target-dependent way, so excess
7795 precision ought to leave it alone. */
7799 machine_mode float16_type_mode = (float16_type_node
7802 machine_mode bfloat16_type_mode = (bfloat16_type_node
7809 {
7811 {
7814 {
7835 }
7837 }
7839 {
7844 {
7865 }
7867 }
7870 }
7873 }
7874 \f
7875 /* Return OP, stripped of any conversions to wider types as much as is safe.
7876 Converting the value back to OP's type makes a value equivalent to OP.
7878 If FOR_TYPE is nonzero, we return a value which, if converted to
7879 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7881 OP must have integer, real or enumeral type. Pointers are not allowed!
7883 There are some cases where the obvious value we could return
7884 would regenerate to OP if converted to OP's type,
7885 but would not extend like OP to wider types.
7886 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7887 For example, if OP is (unsigned short)(signed char)-1,
7888 we avoid returning (signed char)-1 if FOR_TYPE is int,
7889 even though extending that to an unsigned short would regenerate OP,
7890 since the result of extending (signed char)-1 to (int)
7891 is different from (int) OP. */
7893 tree
7895 {
7896 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7898 unsigned final_prec
7900 int uns
7907 {
7910 /* TYPE_PRECISION on vector types has different meaning
7911 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7912 so avoid them here. */
7919 /* Truncations are many-one so cannot be removed.
7920 Unless we are later going to truncate down even farther. */
7925 /* See what's inside this conversion. If we decide to strip it,
7926 we will set WIN. */
7929 /* If we have not stripped any zero-extensions (uns is 0),
7930 we can strip any kind of extension.
7931 If we have previously stripped a zero-extension,
7932 only zero-extensions can safely be stripped.
7933 Any extension can be stripped if the bits it would produce
7934 are all going to be discarded later by truncating to FOR_TYPE. */
7937 {
7940 /* TYPE_UNSIGNED says whether this is a zero-extension.
7941 Let's avoid computing it if it does not affect WIN
7942 and if UNS will not be needed again. */
7946 {
7949 }
7950 }
7951 }
7953 /* If we finally reach a constant see if it fits in sth smaller and
7954 in that case convert it. */
7956 {
7962 {
7966 }
7967 }
7970 }
7971 \f
7972 /* Return OP or a simpler expression for a narrower value
7973 which can be sign-extended or zero-extended to give back OP.
7974 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7975 or 0 if the value should be sign-extended. */
7977 tree
7979 {
7986 {
7987 do
8001 ret);
8003 }
8005 {
8006 int bitschange
8010 /* Truncations are many-one so cannot be removed. */
8014 /* See what's inside this conversion. If we decide to strip it,
8015 we will set WIN. */
8018 {
8020 /* An extension: the outermost one can be stripped,
8021 but remember whether it is zero or sign extension. */
8024 /* Otherwise, if a sign extension has been stripped,
8025 only sign extensions can now be stripped;
8026 if a zero extension has been stripped, only zero-extensions. */
8030 }
8032 {
8033 /* A change in nominal type can always be stripped, but we must
8034 preserve the unsignedness. */
8039 /* Keep trying to narrow, but don't assign op to win if it
8040 would turn an integral type into something else. */
8043 }
8046 }
8049 /* Since type_for_size always gives an integer type. */
8052 /* Ensure field is laid out already. */
8055 {
8056 unsigned HOST_WIDE_INT innerprec
8062 /* We can get this structure field in a narrower type that fits it,
8063 but the resulting extension to its nominal type (a fullword type)
8064 must satisfy the same conditions as for other extensions.
8066 Do this only for fields that are aligned (not bit-fields),
8067 because when bit-field insns will be used there is no
8068 advantage in doing this. */
8074 {
8078 }
8079 }
8083 }
8084 \f
8085 /* Return true if integer constant C has a value that is permissible
8086 for TYPE, an integral type. */
8088 bool
8090 {
8095 /* Non-standard boolean types can have arbitrary precision but various
8096 transformations assume that they can only take values 0 and +/-1. */
8100 retry:
8104 /* If at least one bound of the type is a constant integer, we can check
8105 ourselves and maybe make a decision. If no such decision is possible, but
8106 this type is a subtype, try checking against that. Otherwise, use
8107 fits_to_tree_p, which checks against the precision.
8109 Compute the status for each possibly constant bound, and return if we see
8110 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8111 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8112 for "constant known to fit". */
8114 /* Check if c >= type_low_bound. */
8116 {
8120 }
8121 else
8124 /* Check if c <= type_high_bound. */
8126 {
8130 }
8131 else
8134 /* If the constant fits both bounds, the result is known. */
8138 /* Perform some generic filtering which may allow making a decision
8139 even if the bounds are not constant. First, negative integers
8140 never fit in unsigned types, */
8144 /* Second, narrower types always fit in wider ones. */
8148 /* Third, unsigned integers with top bit set never fit signed types. */
8150 {
8153 {
8154 /* When a tree_cst is converted to a wide-int, the precision
8155 is taken from the type. However, if the precision of the
8156 mode underneath the type is smaller than that, it is
8157 possible that the value will not fit. The test below
8158 fails if any bit is set between the sign bit of the
8159 underlying mode and the top bit of the type. */
8162 }
8165 }
8167 /* If we haven't been able to decide at this point, there nothing more we
8168 can check ourselves here. Look at the base type if we have one and it
8169 has the same precision. */
8173 {
8176 }
8178 /* Or to fits_to_tree_p, if nothing else. */
8180 }
8182 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8183 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8184 represented (assuming two's-complement arithmetic) within the bit
8185 precision of the type are returned instead. */
8187 void
8189 {
8193 else
8194 {
8197 else
8198 {
8201 }
8202 }
8207 else
8208 {
8211 }
8212 }
8214 /* Return true if VAR is an automatic variable. */
8216 bool
8218 {
8223 }
8225 /* Return true if VAR is an automatic variable defined in function FN. */
8227 bool
8229 {
8233 }
8235 /* Subprogram of following function. Called by walk_tree.
8237 Return *TP if it is an automatic variable or parameter of the
8238 function passed in as DATA. */
8240 static tree
8242 {
8253 }
8255 /* Returns true if T is, contains, or refers to a type with variable
8256 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8257 arguments, but not the return type. If FN is nonzero, only return
8258 true if a modifier of the type or position of FN is a variable or
8259 parameter inside FN.
8261 This concept is more general than that of C99 'variably modified types':
8262 in C99, a struct type is never variably modified because a VLA may not
8263 appear as a structure member. However, in GNU C code like:
8265 struct S { int i[f()]; };
8267 is valid, and other languages may define similar constructs. */
8269 bool
8271 {
8272 tree t;
8274 /* Test if T is either variable (if FN is zero) or an expression containing
8275 a variable in FN. If TYPE isn't gimplified, return true also if
8276 gimplify_one_sizepos would gimplify the expression into a local
8277 variable. */
8278 #define RETURN_TRUE_IF_VAR(T) \
8279 do { tree _t = (T); \
8280 if (_t != NULL_TREE \
8281 && _t != error_mark_node \
8282 && !CONSTANT_CLASS_P (_t) \
8283 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8284 && (!fn \
8285 || (!TYPE_SIZES_GIMPLIFIED (type) \
8286 && (TREE_CODE (_t) != VAR_DECL \
8287 && !CONTAINS_PLACEHOLDER_P (_t))) \
8288 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8289 return true; } while (0)
8294 /* If TYPE itself has variable size, it is variably modified. */
8299 {
8303 /* Ada can have pointer types refering to themselves indirectly. */
8308 {
8311 }
8317 /* If TYPE is a function type, it is variably modified if the
8318 return type is variably modified. */
8328 /* Scalar types are variably modified if their end points
8329 aren't constant. */
8337 /* We can't see if any of the fields are variably-modified by the
8338 definition we normally use, since that would produce infinite
8339 recursion via pointers. */
8340 /* This is variably modified if some field's type is. */
8343 {
8348 /* If the type is a qualified union, then the DECL_QUALIFIER
8349 of fields can also be an expression containing a variable. */
8353 /* If the field is a qualified union, then it's only a container
8354 for what's inside so we look into it. That's necessary in LTO
8355 mode because the sizes of the field tested above have been set
8356 to PLACEHOLDER_EXPRs by free_lang_data. */
8360 }
8364 /* Do not call ourselves to avoid infinite recursion. This is
8365 variably modified if the element type is. */
8372 }
8374 /* The current language may have other cases to check, but in general,
8375 all other types are not variably modified. */
8378 #undef RETURN_TRUE_IF_VAR
8379 }
8381 /* Given a DECL or TYPE, return the scope in which it was declared, or
8382 NULL_TREE if there is no containing scope. */
8384 tree
8386 {
8388 }
8390 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8392 const_tree
8394 {
8396 {
8399 else
8401 }
8403 }
8405 /* Return the innermost context enclosing DECL that is
8406 a FUNCTION_DECL, or zero if none. */
8408 tree
8410 {
8411 tree context;
8416 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8417 where we look up the function at runtime. Such functions always take
8418 a first argument of type 'pointer to real context'.
8420 C++ should really be fixed to use DECL_CONTEXT for the real context,
8421 and use something else for the "virtual context". */
8423 context
8424 = TYPE_MAIN_VARIANT
8426 else
8430 {
8433 else
8435 }
8438 }
8440 /* Return the innermost context enclosing DECL that is
8441 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8442 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8444 tree
8446 {
8451 {
8472 }
8475 }
8477 /* CALL is a CALL_EXPR. Return the declaration for the function
8478 called, or NULL_TREE if the called function cannot be
8479 determined. */
8481 tree
8483 {
8484 tree addr;
8489 /* It's invalid to call this function with anything but a
8490 CALL_EXPR. */
8493 /* The first operand to the CALL is the address of the function
8494 called. */
8497 /* If there is no function, return early. */
8503 /* If this is a readonly function pointer, extract its initial value. */
8509 /* If the address is just `&f' for some function `f', then we know
8510 that `f' is being called. */
8515 /* We couldn't figure out what was being called. */
8517 }
8519 /* Return true when STMTs arguments and return value match those of FNDECL,
8520 a decl of a builtin function. */
8522 static bool
8524 {
8542 {
8543 /* Variadic args follow. */
8551 {
8552 /* For pointer arguments be more forgiving, e.g. due to
8553 FILE * vs. fileptr_type_node, or say char * vs. const char *
8554 differences etc. */
8560 /* char/short integral arguments are promoted to int
8561 by several frontends if targetm.calls.promote_prototypes
8562 is true. Allow such promotion too. */
8568 && (gimple_form
8575 }
8576 }
8580 }
8582 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8583 return the associated function code, otherwise return CFN_LAST. */
8585 combined_fn
8587 {
8588 /* It's invalid to call this function with anything but a CALL_EXPR. */
8601 }
8603 /* Comparator of indices based on tree_node_counts. */
8605 static int
8607 {
8612 }
8614 /* Comparator of indices based on tree_code_counts. */
8616 static int
8618 {
8623 }
8625 #define TREE_MEM_USAGE_SPACES 40
8627 /* Print debugging information about tree nodes generated during the compile,
8628 and any language-specific information. */
8630 void
8632 {
8634 {
8640 {
8647 {
8654 }
8659 }
8661 {
8671 {
8676 }
8683 }
8684 }
8685 else
8692 }
8693 \f
8696 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8698 unsigned
8700 {
8701 /* This relies on the raw feedback's top 4 bits being zero. */
8702 #define FEEDBACK(X) ((X) * 0x04c11db7)
8703 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8704 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8706 {
8711 };
8712 #undef FEEDBACK
8713 #undef SYNDROME
8717 {
8721 }
8724 }
8726 /* Generate a crc32 of a string. */
8728 unsigned
8730 {
8731 do
8735 }
8737 /* P is a string that will be used in a symbol. Mask out any characters
8738 that are not valid in that context. */
8740 void
8742 {
8747 #endif
8750 #endif
8751 ))
8753 }
8757 /* Create a unique anonymous identifier. The identifier is still a
8758 valid assembly label. */
8760 tree
8762 {
8764 #if !defined (NO_DOT_IN_LABEL)
8765 "."
8766 #elif !defined (NO_DOLLAR_IN_LABEL)
8767 "$"
8768 #else
8769 "_"
8770 #endif
8781 }
8783 /* Generate a name for a special-purpose function.
8784 The generated name may need to be unique across the whole link.
8785 Changes to this function may also require corresponding changes to
8786 xstrdup_mask_random.
8787 TYPE is some string to identify the purpose of this function to the
8788 linker or collect2; it must start with an uppercase letter,
8789 one of:
8790 I - for constructors
8791 D - for destructors
8792 N - for C++ anonymous namespaces
8793 F - for DWARF unwind frame information. */
8795 tree
8797 {
8802 /* If we already have a name we know to be unique, just use that. */
8805 /* If the target is handling the constructors/destructors, they
8806 will be local to this file and the name is only necessary for
8807 debugging purposes.
8808 We also assign sub_I and sub_D sufixes to constructors called from
8809 the global static constructors. These are always local. */
8813 {
8817 /* Just use the file's basename, because the full pathname
8818 might be quite long. */
8820 }
8821 else
8822 {
8823 /* Otherwise, the name must be unique across the entire link.
8824 We don't have anything that we know to be unique to this translation
8825 unit, so use what we do have and throw in some randomness. */
8843 }
8849 /* Set up the name of the file-level functions we may need.
8850 Use a global object (which is already required to be unique over
8851 the program) rather than the file name (which imposes extra
8852 constraints). */
8856 }
8857 \f
8858 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8860 /* Complain that the tree code of NODE does not match the expected 0
8861 terminated list of trailing codes. The trailing code list can be
8862 empty, for a more vague error message. FILE, LINE, and FUNCTION
8863 are of the caller. */
8865 void
8868 {
8879 {
8886 {
8893 }
8895 }
8896 else
8902 }
8904 /* Complain that the tree code of NODE does match the expected 0
8905 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8906 the caller. */
8908 void
8911 {
8925 {
8927 {
8930 }
8933 }
8939 }
8941 /* Similar to tree_check_failed, except that we check for a class of tree
8942 code, given in CL. */
8944 void
8947 {
8948 internal_error
8953 }
8955 /* Similar to tree_check_failed, except that instead of specifying a
8956 dozen codes, use the knowledge that they're all sequential. */
8958 void
8962 {
8975 {
8982 }
8987 }
8990 /* Similar to tree_check_failed, except that we check that a tree does
8991 not have the specified code, given in CL. */
8993 void
8996 {
8997 internal_error
9002 }
9005 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9007 void
9010 {
9016 }
9019 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9021 void
9025 {
9038 {
9045 }
9050 }
9053 #undef DEFTREESTRUCT
9054 #define DEFTREESTRUCT(VAL, NAME) NAME,
9058 };
9059 #undef DEFTREESTRUCT
9061 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9063 /* Similar to tree_class_check_failed, except that we check for
9064 whether CODE contains the tree structure identified by EN. */
9066 void
9071 {
9072 internal_error
9076 }
9079 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9080 (dynamically sized) vector. */
9082 void
9085 {
9086 internal_error
9090 }
9092 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9093 (dynamically sized) vector. */
9095 void
9098 {
9099 internal_error
9102 }
9104 /* Similar to above, except that the check is for the bounds of the operand
9105 vector of an expression node EXP. */
9107 void
9110 {
9112 internal_error
9116 }
9118 /* Similar to above, except that the check is for the number of
9119 operands of an OMP_CLAUSE node. */
9121 void
9124 {
9125 internal_error
9130 }
9132 \f
9133 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9134 and mapped to the machine mode MODE. Initialize its fields and build
9135 the information necessary for debugging output. */
9137 static tree
9139 {
9140 tree t;
9161 /* We have built a main variant, based on the main variant of the
9162 inner type. Use it to build the variant we return. */
9170 }
9172 static tree
9174 {
9197 else
9199 }
9201 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9203 static tree
9205 {
9207 {
9219 }
9220 else
9221 {
9233 }
9236 }
9238 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9240 static tree
9242 {
9244 {
9256 }
9257 else
9258 {
9270 }
9273 }
9276 /* Create an atomic variant node for TYPE. This routine is called
9277 during initialization of data types to create the 5 basic atomic
9278 types. The generic build_variant_type function requires these to
9279 already be set up in order to function properly, so cannot be
9280 called from there. If ALIGN is non-zero, then ensure alignment is
9281 overridden to this value. */
9283 static tree
9285 {
9286 tree t;
9288 /* Make sure its not already registered. */
9299 }
9301 /* Information about the _FloatN and _FloatNx types. This must be in
9302 the same order as the corresponding TI_* enum values. */
9304 {
9312 };
9315 /* Create nodes for all integer types (and error_mark_node) using the sizes
9316 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9318 void
9320 {
9328 /* Define both `signed char' and `unsigned char'. */
9334 /* Define `char', which is like either `signed char' or `unsigned char'
9335 but not the same as either. */
9336 char_type_node
9337 = (signed_char
9352 {
9357 {
9360 }
9361 }
9363 /* Define a boolean type. This type only represents boolean values but
9364 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9370 /* Define what type to use for size_t. */
9379 else
9380 {
9386 {
9393 {
9395 }
9396 }
9399 }
9401 /* Define what type to use for ptrdiff_t. */
9410 else
9411 {
9415 {
9423 }
9426 }
9428 /* Fill in the rest of the sized types. Reuse existing type nodes
9429 when possible. */
9442 /* Don't call build_qualified type for atomics. That routine does
9443 special processing for atomics, and until they are initialized
9444 it's better not to make that call.
9446 Check to see if there is a target override for atomic types. */
9463 /* Define these next since types below may used them. */
9481 /* We are not going to have real types in C with less than byte alignment,
9482 so we might as well not have any types that claim to have it. */
9495 const_ptr_type_node
9515 {
9518 scalar_float_mode mode;
9522 /* Work around the rs6000 KFmode having precision 113 not
9523 128. */
9535 }
9537 #ifdef HAVE_BFmode
9541 {
9546 }
9547 #endif
9554 /* Fixed size integer types. */
9561 /* Decimal float types. */
9563 {
9578 }
9587 {
9591 }
9593 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9594 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9595 sat_ ## KIND ## _type_node = \
9596 make_sat_signed_ ## KIND ## _type (SIZE); \
9597 sat_unsigned_ ## KIND ## _type_node = \
9598 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9599 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9600 unsigned_ ## KIND ## _type_node = \
9601 make_unsigned_ ## KIND ## _type (SIZE);
9603 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9604 sat_ ## WIDTH ## KIND ## _type_node = \
9605 make_sat_signed_ ## KIND ## _type (SIZE); \
9606 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9607 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9608 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9609 unsigned_ ## WIDTH ## KIND ## _type_node = \
9610 make_unsigned_ ## KIND ## _type (SIZE);
9612 /* Make fixed-point type nodes based on four different widths. */
9613 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9614 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9615 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9616 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9617 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9619 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9620 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9621 NAME ## _type_node = \
9622 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9623 u ## NAME ## _type_node = \
9624 make_or_reuse_unsigned_ ## KIND ## _type \
9625 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9626 sat_ ## NAME ## _type_node = \
9627 make_or_reuse_sat_signed_ ## KIND ## _type \
9628 (GET_MODE_BITSIZE (MODE ## mode)); \
9629 sat_u ## NAME ## _type_node = \
9630 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9631 (GET_MODE_BITSIZE (U ## MODE ## mode));
9633 /* Fixed-point type and mode nodes. */
9646 {
9649 /* Many back-ends define record types without setting TYPE_NAME.
9650 If we copied the record type here, we'd keep the original
9651 record type without a name. This breaks name mangling. So,
9652 don't copy record types and let c_common_nodes_and_builtins()
9653 declare the type to be __builtin_va_list. */
9658 }
9660 /* SCEV analyzer global shared trees. */
9665 }
9667 /* Modify DECL for given flags.
9668 TM_PURE attribute is set only on types, so the function will modify
9669 DECL's type when ECF_TM_PURE is used. */
9671 void
9673 {
9703 /* Looping const or pure is implied by noreturn.
9704 There is currently no way to declare looping const or looping pure alone. */
9707 }
9710 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9712 static void
9715 {
9716 tree decl;
9723 }
9725 /* Call this function after instantiating all builtins that the language
9726 front end cares about. This will build the rest of the builtins
9727 and internal functions that are relied upon by the tree optimizers and
9728 the middle-end. */
9730 void
9732 {
9737 {
9739 ptr_type_node,
9740 ptr_type_node,
9741 integer_type_node,
9742 NULL_TREE);
9744 BUILT_IN_CLEAR_PADDING,
9747 }
9753 {
9757 BUILT_IN_UNREACHABLE,
9763 BUILT_IN_UNREACHABLE_TRAP,
9775 }
9779 {
9790 }
9793 {
9796 NULL_TREE);
9799 }
9802 {
9808 }
9810 /* If we're checking the stack, `alloca' can throw. */
9811 const int alloca_flags
9815 {
9820 }
9825 BUILT_IN_ALLOCA_WITH_ALIGN,
9827 alloca_flags);
9832 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9834 alloca_flags);
9840 BUILT_IN_INIT_TRAMPOLINE,
9843 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9847 BUILT_IN_INIT_DESCRIPTOR,
9852 BUILT_IN_ADJUST_TRAMPOLINE,
9856 BUILT_IN_ADJUST_DESCRIPTOR,
9864 BUILT_IN_CLEAR_CACHE,
9866 ECF_NOTHROW);
9869 BUILT_IN_NONLOCAL_GOTO,
9876 BUILT_IN_SETJMP_SETUP,
9881 BUILT_IN_SETJMP_RECEIVER,
9890 BUILT_IN_STACK_RESTORE,
9895 NULL_TREE);
9908 /* If there's a possibility that we might use the ARM EABI, build the
9909 alternate __cxa_end_cleanup node used to resume from C++. */
9911 {
9914 BUILT_IN_CXA_END_CLEANUP,
9916 }
9920 BUILT_IN_UNWIND_RESUME,
9924 ECF_NORETURN);
9927 {
9929 NULL_TREE);
9931 BUILT_IN_RETURN_ADDRESS,
9933 ECF_NOTHROW);
9934 }
9938 {
9943 BUILT_IN_PROFILE_FUNC_ENTER,
9947 BUILT_IN_PROFILE_FUNC_EXIT,
9949 }
9951 /* The exception object and filter values from the runtime. The argument
9952 must be zero before exception lowering, i.e. from the front end. After
9953 exception lowering, it will be the region number for the exception
9954 landing pad. These functions are PURE instead of CONST to prevent
9955 them from being hoisted past the exception edge that will initialize
9956 its value in the landing pad. */
9960 /* Only use TM_PURE if we have TM language support. */
9973 NULL_TREE);
9975 BUILT_IN_EH_COPY_VALUES,
9978 /* Complex multiplication and division. These are handled as builtins
9979 rather than optabs because emit_library_call_value doesn't support
9980 complex. Further, we can do slightly better with folding these
9981 beasties if the real and complex parts of the arguments are separate. */
9982 {
9986 {
10013 /* For -ftrapping-math these should throw from a former
10014 -fnon-call-exception stmt. */
10016 NULL);
10022 NULL);
10026 }
10027 }
10030 }
10032 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10033 better way.
10035 If we requested a pointer to a vector, build up the pointers that
10036 we stripped off while looking for the inner type. Similarly for
10037 return values from functions.
10039 The argument TYPE is the top of the chain, and BOTTOM is the
10040 new type which we will point to. */
10042 tree
10044 {
10048 {
10052 }
10054 {
10058 }
10060 {
10063 }
10065 {
10069 }
10071 {
10073 /* The build_method_type_directly() routine prepends 'this' to argument list,
10074 so we must compensate by getting rid of it. */
10075 outer
10076 = build_method_type_directly
10078 inner,
10080 }
10082 {
10085 }
10086 else
10091 }
10093 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10094 the inner type. */
10095 tree
10097 {
10098 poly_int64 nunits;
10102 {
10114 /* Check that there are no leftover bits. */
10122 }
10125 }
10127 /* Similarly, but takes the inner type and number of units, which must be
10128 a power of two. */
10130 tree
10132 {
10134 }
10136 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10138 tree
10140 {
10145 {
10148 }
10149 else
10155 }
10157 /* Build a vector type that holds one boolean result for each element of
10158 vector type VECTYPE. The public interface for this operation is
10159 truth_type_for. */
10161 static tree
10163 {
10167 machine_mode mask_mode;
10177 }
10179 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10180 set. */
10182 tree
10184 {
10186 tree cand;
10187 /* We always build the non-opaque variant before the opaque one,
10188 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10194 /* Othewise build a variant type and make sure to queue it after
10195 the non-opaque type. */
10203 }
10205 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10207 static poly_wide_int
10209 {
10210 /* First handle elements that are directly encoded. */
10215 /* Identify the pattern that contains element I and work out the index of
10216 the last encoded element for that pattern. */
10222 /* If there are no steps, the final encoded value is the right one. */
10226 /* Otherwise work out the value from the last two encoded elements. */
10231 }
10233 /* Return the value of element I of VECTOR_CST T. */
10235 tree
10237 {
10238 /* First handle elements that are directly encoded. */
10243 /* If there are no steps, the final encoded value is the right one. */
10245 {
10246 /* Identify the pattern that contains element I and work out the index of
10247 the last encoded element for that pattern. */
10252 }
10254 /* Otherwise work out the value from the last two encoded elements. */
10257 }
10259 /* Given an initializer INIT, return TRUE if INIT is zero or some
10260 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10261 null, set *NONZERO if and only if INIT is known not to be all
10262 zeros. The combination of return value of false and *NONZERO
10263 false implies that INIT may but need not be all zeros. Other
10264 combinations indicate definitive answers. */
10266 bool
10268 {
10273 /* Conservatively clear NONZERO and set it only if INIT is definitely
10274 not all zero. */
10282 {
10291 /* ??? Note that this is not correct for C4X float formats. There,
10292 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10293 negative exponent. */
10328 {
10333 tree elt;
10340 }
10343 {
10358 }
10359 /* Fall through. */
10362 {
10370 /* We need to loop through all elements to handle cases like
10371 "\0" and "\0foobar". */
10374 {
10377 }
10380 }
10384 }
10385 }
10387 /* Return true if EXPR is an initializer expression in which every element
10388 is a constant that is numerically equal to 0 or 1. The elements do not
10389 need to be equal to each other. */
10391 bool
10393 {
10397 {
10405 {
10412 {
10416 }
10419 }
10423 }
10424 }
10426 /* Check if vector VEC consists of all the equal elements and
10427 that the number of elements corresponds to the type of VEC.
10428 The function returns first element of the vector
10429 or NULL_TREE if the vector is not uniform. */
10430 tree
10432 {
10445 {
10449 }
10453 {
10457 {
10459 {
10462 }
10465 }
10472 }
10475 }
10477 /* If the argument is INTEGER_CST, return it. If the argument is vector
10478 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10479 return NULL_TREE.
10480 Look through location wrappers. */
10482 tree
10484 {
10491 {
10495 }
10498 }
10500 /* Checks to see if T is a constant or a constant vector and if each element E
10501 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10503 tree
10505 {
10515 tree cst;
10519 tree_vector_builder builder;
10522 else
10523 {
10529 }
10533 do
10534 {
10549 }
10553 }
10555 /* If VECTOR_CST T has a single nonzero element, return the index of that
10556 element, otherwise return -1. */
10558 int
10560 {
10566 {
10569 }
10570 else
10575 {
10578 {
10582 }
10583 }
10585 }
10587 /* Build an empty statement at location LOC. */
10589 tree
10591 {
10595 }
10598 /* Build an OMP clause with code CODE. LOC is the location of the
10599 clause. */
10601 tree
10603 {
10604 tree t;
10619 }
10621 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10622 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10623 Except for the CODE and operand count field, other storage for the
10624 object is initialized to zeros. */
10626 tree
10628 {
10629 tree t;
10641 /* Can't use TREE_OPERAND to store the length because if checking is
10642 enabled, it will try to check the length before we store it. :-P */
10646 }
10648 /* Helper function for build_call_* functions; build a CALL_EXPR with
10649 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10650 the argument slots. */
10652 static tree
10654 {
10655 tree t;
10663 }
10665 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10666 FN and a null static chain slot. NARGS is the number of call arguments
10667 which are specified as "..." arguments. */
10669 tree
10671 {
10672 tree ret;
10678 }
10680 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10681 FN and a null static chain slot. NARGS is the number of call arguments
10682 which are specified as a va_list ARGS. */
10684 tree
10686 {
10687 tree t;
10695 }
10697 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10698 FN and a null static chain slot. NARGS is the number of call arguments
10699 which are specified as a tree array ARGS. */
10701 tree
10704 {
10705 tree t;
10714 }
10716 /* Like build_call_array, but takes a vec. */
10718 tree
10720 {
10729 }
10731 /* Conveniently construct a function call expression. FNDECL names the
10732 function to be called and N arguments are passed in the array
10733 ARGARRAY. */
10735 tree
10737 {
10742 }
10744 /* Conveniently construct a function call expression. FNDECL names the
10745 function to be called and the arguments are passed in the vector
10746 VEC. */
10748 tree
10750 {
10753 }
10756 /* Conveniently construct a function call expression. FNDECL names the
10757 function to be called, N is the number of arguments, and the "..."
10758 parameters are the argument expressions. */
10760 tree
10762 {
10772 }
10774 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10775 varargs macros aren't supported by all bootstrap compilers. */
10777 tree
10779 {
10789 }
10791 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10792 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10793 It will get gimplified later into an ordinary internal function. */
10795 tree
10798 {
10806 }
10808 /* Build internal call expression. This is just like CALL_EXPR, except
10809 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10810 internal function. */
10812 tree
10815 {
10825 }
10827 /* Return a function call to FN, if the target is guaranteed to support it,
10828 or null otherwise.
10830 N is the number of arguments, passed in the "...", and TYPE is the
10831 type of the return value. */
10833 tree
10836 {
10846 {
10849 {
10852 OPTIMIZE_FOR_BOTH))
10854 }
10856 }
10857 else
10858 {
10863 }
10864 }
10866 /* Return a function call to the appropriate builtin alloca variant.
10868 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10869 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10870 bound for SIZE in case it is not a fixed value. */
10872 tree
10874 {
10876 {
10878 return
10880 }
10882 {
10885 }
10886 else
10887 {
10890 }
10891 }
10893 /* The built-in decl to use to mark code points believed to be unreachable.
10894 Typically __builtin_unreachable, but __builtin_trap if
10895 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10896 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10897 appropriate ubsan function. When building a call directly, use
10898 {gimple_},build_builtin_unreachable instead. */
10900 tree
10902 {
10909 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10910 in the sanopt pass. */
10913 }
10915 /* Build a call to __builtin_unreachable, possibly rewritten by
10916 -fsanitize=unreachable. Use this rather than the above when practical. */
10918 tree
10920 {
10924 }
10926 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10927 if SIZE == -1) and return a tree node representing char* pointer to
10928 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10929 the STRING_CST value is the LEN bytes at STR (the representation
10930 of the string, which may be wide). Otherwise it's all zeros. */
10932 tree
10936 {
10938 /* Set the maximum valid index based on the string length or SIZE. */
10939 unsigned HOST_WIDE_INT maxidx
10955 }
10959 /* Return true if T (assumed to be a DECL) must be assigned a memory
10960 location. */
10962 bool
10964 {
10970 }
10972 /* Return value of a constant X and sign-extend it. */
10974 HOST_WIDE_INT
10976 {
10980 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10984 {
10988 else
10990 }
10993 }
10995 /* If TYPE is an integral or pointer type, return an integer type with
10996 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10997 if TYPE is already an integer type of signedness UNSIGNEDP.
10998 If TYPE is a floating-point type, return an integer type with the same
10999 bitsize and with the signedness given by UNSIGNEDP; this is useful
11000 when doing bit-level operations on a floating-point value. */
11002 tree
11004 {
11009 {
11016 machine_mode new_mode;
11021 }
11024 {
11032 }
11041 else
11045 }
11047 /* If TYPE is an integral or pointer type, return an integer type with
11048 the same precision which is unsigned, or itself if TYPE is already an
11049 unsigned integer type. If TYPE is a floating-point type, return an
11050 unsigned integer type with the same bitsize as TYPE. */
11052 tree
11054 {
11056 }
11058 /* If TYPE is an integral or pointer type, return an integer type with
11059 the same precision which is signed, or itself if TYPE is already a
11060 signed integer type. If TYPE is a floating-point type, return a
11061 signed integer type with the same bitsize as TYPE. */
11063 tree
11065 {
11067 }
11069 /* - For VECTOR_TYPEs:
11070 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11071 - The number of elements must match (known_eq).
11072 - targetm.vectorize.get_mask_mode exists, and exactly
11073 the same mode as the truth type.
11074 - Otherwise, the truth type must be a BOOLEAN_TYPE
11075 or useless_type_conversion_p to BOOLEAN_TYPE. */
11076 bool
11078 {
11081 machine_mode tmask_mode;
11084 {
11093 }
11096 }
11098 /* If TYPE is a vector type, return a signed integer vector type with the
11099 same width and number of subparts. Otherwise return boolean_type_node. */
11101 tree
11103 {
11105 {
11109 }
11110 else
11112 }
11114 /* Returns the largest value obtainable by casting something in INNER type to
11115 OUTER type. */
11117 tree
11119 {
11125 /* Compute a unique number for every combination. */
11130 /* Determine the exponent to use. */
11132 {
11135 /* oprec <= iprec, outer: signed, inner: don't care. */
11140 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11144 /* oprec > iprec, outer: signed, inner: signed. */
11148 /* oprec > iprec, outer: signed, inner: unsigned. */
11152 /* oprec > iprec, outer: unsigned, inner: signed. */
11156 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11161 }
11165 }
11167 /* Returns the smallest value obtainable by casting something in INNER type to
11168 OUTER type. */
11170 tree
11172 {
11176 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11177 and obtain 0. */
11179 /* If we are widening something of an unsigned type, OUTER type
11180 contains all values of INNER type. In particular, both INNER
11181 and OUTER types have zero in common. */
11184 else
11185 {
11186 /* If we are widening a signed type to another signed type, we
11187 want to obtain -2^^(iprec-1). If we are keeping the
11188 precision or narrowing to a signed type, we want to obtain
11189 -2^(oprec-1). */
11194 }
11195 }
11197 /* Return nonzero if two operands that are suitable for PHI nodes are
11198 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11199 SSA_NAME or invariant. Note that this is strictly an optimization.
11200 That is, callers of this function can directly call operand_equal_p
11201 and get the same result, only slower. */
11203 int
11205 {
11211 }
11213 /* Returns number of zeros at the end of binary representation of X. */
11215 tree
11217 {
11219 }
11222 #define WALK_SUBTREE(NODE) \
11223 do \
11224 { \
11225 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11226 if (result) \
11227 return result; \
11228 } \
11229 while (0)
11231 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11232 be walked whenever a type is seen in the tree. Rest of operands and return
11233 value are as for walk_tree. */
11235 static tree
11238 {
11242 {
11246 /* We have to worry about mutually recursive pointers. These can't
11247 be written in C. They can in Ada. It's pathological, but
11248 there's an ACATS test (c38102a) that checks it. Deal with this
11249 by checking if we're pointing to another pointer, that one
11250 points to another pointer, that one does too, and we have no htab.
11251 If so, get a hash table. We check three levels deep to avoid
11252 the cost of the hash table if we don't need one. */
11257 {
11264 }
11266 /* fall through */
11275 /* Fall through. */
11279 {
11280 tree arg;
11282 /* We never want to walk into default arguments. */
11285 }
11289 /* Don't follow this nodes's type if a pointer for fear that
11290 we'll have infinite recursion. If we have a PSET, then we
11291 need not fear. */
11306 }
11309 }
11311 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11312 called with the DATA and the address of each sub-tree. If FUNC returns a
11313 non-NULL value, the traversal is stopped, and the value returned by FUNC
11314 is returned. If PSET is non-NULL it is used to record the nodes visited,
11315 and to avoid visiting a node more than once. */
11317 tree
11320 {
11321 #define WALK_SUBTREE_TAIL(NODE) \
11322 do \
11323 { \
11324 tp = & (NODE); \
11325 goto tail_recurse; \
11326 } \
11327 while (0)
11329 tail_recurse:
11330 /* Skip empty subtrees. */
11334 /* Don't walk the same tree twice, if the user has requested
11335 that we avoid doing so. */
11339 /* Call the function. */
11343 /* If we found something, return it. */
11350 /* Even if we didn't, FUNC may have decided that there was nothing
11351 interesting below this point in the tree. */
11353 {
11354 /* But we still need to check our siblings. */
11359 else
11361 }
11364 {
11368 }
11371 {
11383 /* None of these have subtrees other than those already walked
11384 above. */
11392 {
11398 /* Walk all elements but the last. */
11402 /* Now walk the last one as a tail call. */
11404 }
11407 {
11411 /* Walk all elements but the last. */
11414 /* Now walk the last one as a tail call. */
11416 }
11423 {
11428 idx++)
11430 }
11437 {
11438 tree decl;
11440 {
11441 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11442 into declarations that are just mentioned, rather than
11443 declared; they don't really belong to this part of the tree.
11444 And, we can see cycles: the initializer for a declaration
11445 can refer to the declaration itself. */
11449 }
11451 }
11454 {
11455 tree_stmt_iterator i;
11458 }
11462 {
11467 }
11470 {
11473 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11474 But, we only want to walk once. */
11479 }
11482 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11483 defining. We only want to walk into these fields of a type in this
11484 case and not in the general case of a mere reference to the type.
11486 The criterion is as follows: if the field can be an expression, it
11487 must be walked only here. This should be in keeping with the fields
11488 that are directly gimplified in gimplify_type_sizes in order for the
11489 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11490 variable-sized types.
11492 Note that DECLs get walked as part of processing the BIND_EXPR. */
11494 {
11495 /* Call the function for the decl so e.g. copy_tree_body_r can
11496 replace it with the remapped one. */
11505 /* Call the function for the type. See if it returns anything or
11506 doesn't want us to continue. If we are to continue, walk both
11507 the normal fields and those for the declaration case. */
11514 /* But do not walk a pointed-to type since it may itself need to
11515 be walked in the declaration case if it isn't anonymous. */
11517 {
11521 }
11523 /* If this is a record type, also walk the fields. */
11525 {
11526 tree field;
11530 {
11531 /* We'd like to look at the type of the field, but we can
11532 easily get infinite recursion. So assume it's pointed
11533 to elsewhere in the tree. Also, ignore things that
11534 aren't fields. */
11543 }
11544 }
11546 /* Same for scalar types. */
11552 {
11555 }
11559 }
11560 /* FALLTHRU */
11564 {
11567 /* Walk over all the sub-trees of this operand. */
11570 /* Go through the subtrees. We need to do this in forward order so
11571 that the scope of a FOR_EXPR is handled properly. */
11573 {
11577 }
11578 }
11579 /* If this is a type, walk the needed fields in the type. */
11583 }
11585 /* We didn't find what we were looking for. */
11588 #undef WALK_SUBTREE_TAIL
11589 }
11590 #undef WALK_SUBTREE
11592 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11594 tree
11596 walk_tree_lh lh)
11597 {
11598 tree result;
11603 }
11606 tree
11608 {
11615 }
11617 void
11619 {
11623 {
11625 }
11626 else
11628 }
11630 /* Create a nameless artificial label and put it in the current
11631 function context. The label has a location of LOC. Returns the
11632 newly created label. */
11634 tree
11636 {
11644 }
11646 /* Given a tree, try to return a useful variable name that we can use
11647 to prefix a temporary that is being assigned the value of the tree.
11648 I.E. given <temp> = &A, return A. */
11652 {
11653 tree stripped_decl;
11660 {
11665 }
11666 else
11667 {
11669 {
11674 }
11675 }
11676 }
11678 /* Return true if TYPE has a variable argument list. */
11680 bool
11682 {
11683 function_args_iterator args_iter;
11693 {
11695 }
11698 }
11700 /* Return true if TYPE has a prototype. */
11702 bool
11704 {
11705 tree t;
11714 }
11716 /* If BLOCK is inlined from an __attribute__((__artificial__))
11717 routine, return pointer to location from where it has been
11718 called. */
11719 location_t *
11721 {
11726 {
11729 {
11730 /* If AO is an artificial inline, point RET to the
11731 call site locus at which it has been inlined and continue
11732 the loop, in case AO's caller is also an artificial
11733 inline. */
11737 else
11739 }
11744 }
11746 }
11749 /* If EXP is inlined from an __attribute__((__artificial__))
11750 function, return the location of the original call expression. */
11752 location_t
11754 {
11759 else
11761 }
11763 /* Return the location into which EXP has been inlined. Analogous
11764 to tree_nonartificial_location() above but not limited to artificial
11765 functions declared inline. If SYSTEM_HEADER is true, return
11766 the macro expansion point of the location if it's in a system header */
11768 location_t
11770 {
11777 {
11785 }
11788 {
11791 /* Only consider macro expansion when the block traversal failed
11792 to find a location. Otherwise it's not relevant. */
11794 }
11797 }
11799 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11800 nodes. */
11802 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11804 hashval_t
11806 {
11813 else
11815 }
11817 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11818 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11819 same. */
11821 bool
11823 {
11836 else
11838 }
11840 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11842 tree
11845 {
11846 tree t;
11848 /* Use the cache of optimization nodes. */
11856 {
11857 /* Insert this one into the hash table. */
11861 /* Make a new node for next time round. */
11863 }
11866 }
11868 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11870 tree
11873 {
11874 tree t;
11876 /* Use the cache of optimization nodes. */
11884 {
11885 /* Insert this one into the hash table. */
11889 /* Make a new node for next time round. */
11891 }
11894 }
11896 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11897 so that they aren't saved during PCH writing. */
11899 void
11901 {
11906 }
11908 /* Determine the "ultimate origin" of a block. */
11910 tree
11912 {
11917 else
11918 {
11923 }
11924 }
11926 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11927 no instruction. */
11929 bool
11931 {
11932 /* Do not strip casts into or out of differing address spaces. */
11935 {
11940 }
11943 {
11944 /* We already know that outer_type is not a pointer with
11945 a non-generic address space. */
11947 }
11949 /* Use precision rather then machine mode when we can, which gives
11950 the correct answer even for submode (bit-field) types. */
11959 /* Otherwise fall back on comparing machine modes (e.g. for
11960 aggregate types, floats). */
11962 }
11964 /* Return true iff conversion in EXP generates no instruction. Mark
11965 it inline so that we fully inline into the stripping functions even
11966 though we have two uses of this function. */
11970 {
11985 }
11987 /* Return true iff conversion in EXP generates no instruction. Don't
11988 consider conversions changing the signedness. */
11990 static bool
11992 {
12003 }
12005 /* Strip conversions from EXP according to tree_nop_conversion and
12006 return the resulting expression. */
12008 tree
12010 {
12014 }
12016 /* Strip conversions from EXP according to tree_sign_nop_conversion
12017 and return the resulting expression. */
12019 tree
12021 {
12025 }
12027 /* Avoid any floating point extensions from EXP. */
12028 tree
12030 {
12033 /* For floating point constant look up the narrowest type that can hold
12034 it properly and handle it like (type)(narrowest_type)constant.
12035 This way we can optimize for instance a=a*2.0 where "a" is float
12036 but 2.0 is double constant. */
12038 {
12039 REAL_VALUE_TYPE orig;
12052 }
12071 }
12073 /* Strip out all handled components that produce invariant
12074 offsets. */
12076 const_tree
12078 {
12080 {
12082 {
12097 }
12099 }
12102 }
12104 /* Strip handled components with zero offset from OP. */
12106 tree
12108 {
12114 }
12118 /* Return the GCC personality function decl. */
12120 tree
12122 {
12126 }
12128 /* TARGET is a call target of GIMPLE call statement
12129 (obtained by gimple_call_fn). Return true if it is
12130 OBJ_TYPE_REF representing an virtual call of C++ method.
12131 (As opposed to OBJ_TYPE_REF representing objc calls
12132 through a cast where middle-end devirtualization machinery
12133 can't apply.) FOR_DUMP_P is true when being called from
12134 the dump routines. */
12136 bool
12138 {
12147 /* If we do not have BINFO associated, it means that type was built
12148 without devirtualization enabled. Do not consider this a virtual
12149 call. */
12153 }
12155 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12157 static tree
12159 {
12170 }
12172 /* Try to find a base info of BINFO that would have its field decl at offset
12173 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12174 found, return, otherwise return NULL_TREE. */
12176 tree
12178 {
12182 {
12184 tree fld;
12193 {
12201 }
12205 /* Offset 0 indicates the primary base, whose vtable contents are
12206 represented in the binfo for the derived class. */
12208 {
12210 /* Offsets in BINFO are in bytes relative to the whole structure
12211 while POS is in bits relative to the containing field. */
12218 {
12221 }
12224 else
12226 binfo_offset);
12227 }
12231 }
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 precision. */
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;
14331 {
14335 {
14339 {
14348 }
14349 }
14351 }
14353 {
14354 /* For unsigned values, the "positive" range comes
14355 below the "negative" range. */
14360 }
14361 else
14362 {
14367 }
14369 }
14374 /* Return true if ARG is marked with the nonnull attribute in the
14375 current function signature. */
14377 bool
14379 {
14387 /* The static chain decl is always non null. */
14391 /* THIS argument of method is always non-NULL. */
14397 /* Values passed by reference are always non-NULL. */
14404 {
14407 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14411 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14415 /* Get the position number for ARG in the function signature. */
14417 t;
14419 {
14422 }
14426 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14428 {
14431 }
14432 }
14435 }
14437 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14438 information. */
14440 location_t
14442 {
14447 }
14449 location_t
14451 {
14452 source_range src_range;
14456 }
14458 location_t
14460 {
14468 pure_loc,
14469 src_range,
14470 NULL,
14471 discriminator);
14474 }
14476 /* Return EXPR, potentially wrapped with a node expression LOC,
14477 if !CAN_HAVE_LOCATION_P (expr).
14479 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14480 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14482 Wrapper nodes can be identified using location_wrapper_p. */
14484 tree
14486 {
14493 /* We should only be adding wrappers for constants and for decls,
14494 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14499 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14500 any impact of the wrapper nodes. */
14504 /* Compiler-generated temporary variables don't need a wrapper. */
14508 /* If any auto_suppress_location_wrappers are active, don't create
14509 wrappers. */
14513 tree_code code
14518 /* Mark this node as being a wrapper. */
14521 }
14525 /* Return the name of combined function FN, for debugging purposes. */
14529 {
14531 {
14534 }
14535 else
14537 }
14539 /* Return a bitmap with a bit set corresponding to each argument in
14540 a function call type FNTYPE declared with attribute nonnull,
14541 or null if none of the function's argument are nonnull. The caller
14542 must free the bitmap. */
14544 bitmap
14546 {
14552 {
14553 /* The this pointer in C++ non-static member functions is
14554 implicitly nonnull whether or not it's declared as such. */
14557 }
14563 /* A function declaration can specify multiple attribute nonnull,
14564 each with zero or more arguments. The loop below creates a bitmap
14565 representing a union of all the arguments. An empty (but non-null)
14566 bitmap means that all arguments have been declaraed nonnull. */
14568 {
14577 {
14578 /* Clear the bitmap in case a previous attribute nonnull
14579 set it and this one overrides it for all arguments. */
14582 }
14584 /* Iterate over the indices of the format arguments declared nonnull
14585 and set a bit for each. */
14587 {
14590 }
14591 }
14594 }
14596 /* Returns true if TYPE is a type where it and all of its subobjects
14597 (recursively) are of structure, union, or array type. */
14599 bool
14601 {
14603 {
14610 }
14616 }
14618 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14619 that shouldn't be passed via stack. */
14621 bool
14623 {
14634 }
14636 /* Determine whether TYPE is a structure with a flexible array member,
14637 or a union containing such a structure (possibly recursively). */
14639 bool
14641 {
14644 {
14660 {
14664 }
14668 }
14669 }
14671 /* Like int_size_in_bytes, but handle empty records specially. */
14673 HOST_WIDE_INT
14675 {
14677 }
14679 /* Like size_in_bytes, but handle empty records specially. */
14681 tree
14683 {
14685 }
14687 /* Return true if an expression with CODE has to have the same result type as
14688 its first operand. */
14690 bool
14692 {
14694 {
14728 }
14729 }
14731 /* Return a typenode for the "standard" C type with a given name. */
14732 tree
14734 {
14766 }
14768 /* List of pointer types used to declare builtins before we have seen their
14769 real declaration.
14771 Keep the size up to date in tree.h ! */
14773 {
14780 };
14782 /* Return the maximum object size. */
14784 tree
14786 {
14787 /* To do: Make this a configurable parameter. */
14789 }
14791 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14792 parameter default to false and that weeds out error_mark_node. */
14794 bool
14797 {
14804 }
14806 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14807 delete operators. Return false if they may or may not name such
14808 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14809 do not. */
14811 bool
14814 {
14824 /* The following failures are due to invalid names so they're not
14825 considered certain mismatches. */
14841 /* The following failures are due to names of user-defined operators
14842 so they're also not considered certain mismatches. */
14844 /* *_len is now just the length after initial underscores. */
14850 /* The following failures are certain mismatches. */
14853 /* _Znw must match _Zdl, _Zna must match _Zda. */
14857 /* 'j', 'm' and 'y' correspond to size_t. */
14864 {
14865 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14866 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14873 }
14877 {
14878 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14879 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14880 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14890 }
14892 /* The negative result is conservative. */
14895 }
14897 /* Return the zero-based number corresponding to the argument being
14898 deallocated if FNDECL is a deallocation function or an out-of-bounds
14899 value if it isn't. */
14901 unsigned
14903 {
14904 /* A call to operator delete isn't recognized as one to a built-in. */
14906 {
14910 /* Avoid placement delete that's not been inlined. */
14916 }
14918 /* TODO: Handle user-defined functions with attribute malloc? Handle
14919 known non-built-ins like fopen? */
14921 {
14923 {
14929 }
14931 }
14940 {
14951 }
14954 }
14956 /* If EXPR refers to a character array or pointer declared attribute
14957 nonstring, return a decl for that array or pointer and set *REF
14958 to the referenced enclosing object or pointer. Otherwise return
14959 null. */
14961 tree
14963 {
14967 {
14971 {
14977 }
14978 else
14980 }
14985 /* To simplify calling code, store the referenced DECL regardless of
14986 the attribute determined below, but avoid storing the SSA_NAME_VAR
14987 obtained above (it's not useful for dataflow purposes). */
14991 /* Use the SSA_NAME_VAR that was determined above to see if it's
14992 declared nonstring. Otherwise drill down into the referenced
14993 DECL. */
15008 }
15010 /* Return length of attribute names string,
15011 if arglist chain > 1, -1 otherwise. */
15013 int
15015 {
15016 tree arg;
15021 {
15026 argnum++;
15027 argnum++;
15028 }
15032 }
15034 void
15036 {
15038 }
15040 #if CHECKING_P
15044 /* Selftests for tree. */
15046 /* Verify that integer constants are sane. */
15048 static void
15050 {
15063 }
15065 /* Verify identifiers. */
15067 static void
15069 {
15073 }
15075 /* Verify LABEL_DECL. */
15077 static void
15079 {
15085 }
15087 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15088 are given by VALS. */
15090 static tree
15092 {
15097 }
15099 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15101 static void
15103 {
15109 }
15111 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15112 and that its elements match EXPECTED. */
15114 static void
15117 {
15124 }
15126 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15127 and NPATTERNS background elements, and that its elements match
15128 EXPECTED. */
15130 static void
15133 {
15140 }
15142 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15143 and that its elements match EXPECTED. */
15145 static void
15148 {
15155 }
15157 /* Test the creation of VECTOR_CSTs. */
15159 static void
15161 {
15167 /* Test a simple linear series with a base of 0 and a step of 1:
15168 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15174 /* Try the same with the first element replaced by 100:
15175 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15180 /* Try a series that wraps around.
15181 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15187 /* Try a downward series:
15188 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15194 /* Try two interleaved series with different bases and steps:
15195 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15198 {
15201 }
15205 /* Try a duplicated value:
15206 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15212 /* Try an interleaved duplicated value:
15213 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15220 /* Try a duplicated value with 2 exceptions
15221 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15227 /* Try with and without a step
15228 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15234 /* Try a fully-general constant:
15235 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15239 }
15241 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15242 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15243 modifying its argument in-place. */
15245 static void
15247 {
15250 }
15252 /* Verify location wrappers. */
15254 static void
15256 {
15261 /* Wrapping a constant. */
15271 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15274 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15279 /* Wrapping a STRING_CST. */
15291 /* Wrapping a variable. */
15294 integer_type_node);
15303 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15304 wrapper. */
15309 /* Verify that STRIP_NOPS removes wrappers. */
15313 }
15315 /* Test various tree predicates. Verify that location wrappers don't
15316 affect the results. */
15318 static void
15320 {
15321 /* Build various constants and wrappers around them. */
15349 /* TODO: vector constants. */
15351 /* Test integer_onep. */
15371 /* Test integer_zerop. */
15391 /* Test integer_all_onesp. */
15411 /* Test integer_minus_onep. */
15431 /* Test integer_each_onep. */
15451 /* Test integer_truep. */
15471 /* Test integer_nonzerop. */
15491 /* Test real_zerop. */
15511 /* Test real_onep. */
15531 /* Test real_minus_onep. */
15551 /* Test zerop. */
15571 /* Test tree_expr_nonnegative_p. */
15591 /* Test tree_expr_nonzero_p. */
15599 /* Test integer_valued_real_p. */
15606 /* Test integer_pow2p. */
15611 /* Test uniform_integer_cst_p. */
15630 }
15632 /* Check that string escaping works correctly. */
15634 static void
15636 {
15638 escaped_string msg;
15641 /* ASSERT_STREQ does not accept NULL as a valid test
15642 result, so we have to use ASSERT_EQ instead. */
15651 /* Ensure that we have -fmessage-length set to 0. */
15661 /* Now repeat the tests with -fmessage-length set to 5. */
15664 /* Note that the newline is not translated into an escape. */
15671 /* Restore the original message length setting. */
15673 }
15675 /* Run all of the selftests within this file. */
15677 void
15679 {
15687 }