| blob | f7bfd9e3451b3b19675bd0d856b4074e6e266cfe |
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 {
999 }
1012 {
1024 }
1028 {
1049 }
1053 }
1054 }
1056 /* Compute the number of bytes occupied by NODE. This routine only
1057 looks at TREE_CODE, except for those nodes that have variable sizes. */
1058 size_t
1060 {
1063 {
1093 else
1095 }
1096 }
1098 /* Return tree node kind based on tree CODE. */
1100 static tree_node_kind
1102 {
1106 {
1124 {
1141 }
1147 }
1148 }
1150 /* Record interesting allocation statistics for a tree node with CODE
1151 and LENGTH. */
1153 static void
1155 {
1164 }
1166 /* Allocate and return a new UID from the DECL_UID namespace. */
1168 int
1170 {
1172 }
1174 /* Return a newly allocated node of code CODE. For decl and type
1175 nodes, some other fields are initialized. The rest of the node is
1176 initialized to zero. This function cannot be used for TREE_VEC,
1177 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1178 tree_code_size.
1180 Achoo! I got a code in the node. */
1182 tree
1184 {
1185 tree t;
1195 {
1203 {
1205 {
1208 }
1209 else
1211 }
1215 else
1216 {
1219 }
1232 /* Default to no attributes for type, but let target change that. */
1236 /* We have not yet computed the alias set for this type. */
1246 {
1254 /* All of these have side-effects, no matter what their
1255 operands are. */
1261 }
1266 {
1279 }
1283 /* Other classes need no special treatment. */
1285 }
1288 }
1290 /* Free tree node. */
1292 void
1294 {
1297 {
1307 }
1319 }
1320 \f
1321 /* Return a new node with the same contents as NODE except that its
1322 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1324 tree
1326 {
1327 tree t;
1344 {
1347 else
1348 {
1352 }
1355 {
1358 }
1359 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1361 {
1364 }
1366 {
1369 }
1371 {
1374 }
1375 }
1377 {
1379 /* The following is so that the debug code for
1380 the copy is different from the original type.
1381 The two statements usually duplicate each other
1382 (because they clear fields of the same union),
1383 but the optimizer should catch that. */
1387 /* Do not copy the values cache. */
1389 {
1392 }
1393 }
1395 {
1399 }
1401 {
1405 }
1408 }
1410 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1411 For example, this can copy a list made of TREE_LIST nodes. */
1413 tree
1415 {
1416 tree head;
1425 {
1429 }
1431 }
1433 \f
1434 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1435 INTEGER_CST with value CST and type TYPE. */
1437 static unsigned int
1439 {
1441 /* We need extra HWIs if CST is an unsigned integer with its
1442 upper bit set. */
1446 }
1448 /* Return a new INTEGER_CST with value CST and type TYPE. */
1450 static tree
1452 {
1458 {
1464 }
1467 {
1468 len--;
1472 }
1478 }
1480 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1482 static tree
1484 CXX_MEM_STAT_INFO)
1485 {
1497 }
1499 /* Create a constant tree that contains CST sign-extended to TYPE. */
1501 tree
1503 {
1504 /* Support legacy code. */
1509 }
1511 /* Create a constant tree that contains CST zero-extended to TYPE. */
1513 tree
1515 {
1517 }
1519 /* Create a constant tree that contains CST sign-extended to TYPE. */
1521 tree
1523 {
1526 }
1528 /* Constructs tree in type TYPE from with value given by CST. Signedness
1529 of CST is assumed to be the same as the signedness of TYPE. */
1531 tree
1533 {
1535 }
1537 /* We force the wide_int CST to the range of the type TYPE by sign or
1538 zero extending it. OVERFLOWABLE indicates if we are interested in
1539 overflow of the value, when >0 we are only interested in signed
1540 overflow, for <0 we are interested in any overflow. OVERFLOWED
1541 indicates whether overflow has already occurred. CONST_OVERFLOWED
1542 indicates whether constant overflow has already occurred. We force
1543 T's value to be within range of T's type (by setting to 0 or 1 all
1544 the bits outside the type's range). We set TREE_OVERFLOWED if,
1545 OVERFLOWED is nonzero,
1546 or OVERFLOWABLE is >0 and signed overflow occurs
1547 or OVERFLOWABLE is <0 and any overflow occurs
1548 We return a new tree node for the extended wide_int. The node
1549 is shared if no overflow flags are set. */
1552 tree
1555 {
1558 /* If we need to set overflow flags, return a new unshared node. */
1560 {
1564 {
1566 sign);
1567 tree t;
1570 else
1571 {
1574 {
1577 }
1579 }
1582 }
1583 }
1585 /* Else build a shared node. */
1587 }
1589 /* These are the hash table functions for the hash table of INTEGER_CST
1590 nodes of a sizetype. */
1592 /* Return the hash code X, an INTEGER_CST. */
1594 hashval_t
1596 {
1605 }
1607 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1608 is the same as that given by *Y, which is the same. */
1610 bool
1612 {
1626 }
1628 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1629 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1630 number of slots that can be cached for the type. */
1635 {
1637 /* Initialize cache. */
1639 {
1642 }
1645 {
1646 /* Create a new shared int. */
1649 }
1651 }
1653 /* Create an INT_CST node of TYPE and value CST.
1654 The returned node is always shared. For small integers we use a
1655 per-type vector cache, for larger ones we use a single hash table.
1656 The value is extended from its precision according to the sign of
1657 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1658 the upper bits and ensures that hashing and value equality based
1659 upon the underlying HOST_WIDE_INTs works without masking. */
1661 static tree
1663 {
1664 tree t;
1672 /* Verify that everything is canonical. */
1675 {
1680 }
1687 {
1688 /* Cache NULL pointer and zero bounds. */
1691 /* Cache upper bounds of pointers. */
1694 /* Cache 1 which is used for a non-zero range. */
1699 {
1701 /* Make sure no one is clobbering the shared constant. */
1705 }
1706 }
1708 {
1709 /* We just need to store a single HOST_WIDE_INT. */
1710 HOST_WIDE_INT hwi;
1713 else
1717 {
1720 /* Fallthru. */
1724 /* Ignore pointers, as they were already handled above. */
1728 /* Cache false or true. */
1738 {
1739 /* Cache [0, N). */
1743 }
1744 else
1745 {
1746 /* Cache [-1, N). */
1750 }
1758 }
1761 {
1763 /* Make sure no one is clobbering the shared constant. */
1769 }
1770 else
1771 {
1772 /* Use the cache of larger shared ints, using int_cst_node as
1773 a temporary. */
1781 {
1782 /* Insert this one into the hash table. */
1785 /* Make a new node for next time round. */
1787 }
1788 }
1789 }
1790 else
1791 {
1792 /* The value either hashes properly or we drop it on the floor
1793 for the gc to take care of. There will not be enough of them
1794 to worry about. */
1800 {
1801 /* Insert this one into the hash table. */
1804 }
1805 else
1807 }
1810 }
1812 hashval_t
1814 {
1822 }
1824 bool
1826 {
1833 }
1835 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1836 The elements must also have type TYPE. */
1838 tree
1840 {
1851 INSERT);
1853 {
1858 }
1860 }
1862 /* Create a constant tree with value VALUE in type TYPE. */
1864 tree
1866 {
1870 }
1872 /* Insert INTEGER_CST T into a cache of integer constants. And return
1873 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1874 is false, and T falls into the type's 'smaller values' range, there
1875 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1876 or the value is large, should an existing entry exist, it is
1877 returned (rather than inserting T). */
1879 tree
1881 {
1889 /* The caching indices here must match those in
1890 wide_int_to_type_1. */
1892 {
1895 /* Fallthru. */
1899 {
1907 }
1911 /* Cache false or true. */
1921 {
1922 /* Cache 0..N */
1925 /* This is a little hokie, but if the prec is smaller than
1926 what is necessary to hold param_integer_share_limit, then the
1927 obvious test will not get the correct answer. */
1929 {
1933 }
1936 }
1937 else
1938 {
1939 /* Cache -1..N */
1945 {
1947 {
1950 }
1953 }
1954 }
1958 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1959 members. */
1964 }
1967 {
1968 /* Look for it in the type's vector of small shared ints. */
1970 {
1973 }
1976 {
1979 }
1980 else
1982 }
1983 else
1984 {
1985 /* Use the cache of larger shared ints. */
1988 {
1989 /* If there is already an entry for the number verify it's the
1990 same value. */
1992 /* And return the cached value. */
1994 }
1995 else
1996 /* Otherwise insert this one into the hash table. */
1998 }
2001 }
2004 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2005 and the rest are zeros. */
2007 tree
2009 {
2014 }
2016 /* Checks that X is integer constant that can be expressed in (unsigned)
2017 HOST_WIDE_INT without loss of precision. */
2019 bool
2021 {
2024 }
2026 /* Build a newly constructed VECTOR_CST with the given values of
2027 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2029 tree
2032 {
2034 tree t;
2050 }
2052 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2053 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2055 tree
2057 {
2062 tree value;
2064 /* We can't construct a VECTOR_CST for a variable number of elements. */
2068 {
2070 {
2071 /* If NELTS is constant then this must be too. */
2075 }
2076 else
2078 }
2083 }
2085 /* Build a vector of type VECTYPE where all the elements are SCs. */
2086 tree
2088 {
2094 /* Verify that the vector type is suitable for SC. Note that there
2095 is some inconsistency in the type-system with respect to restrict
2096 qualifications of pointers. Vector types always have a main-variant
2097 element type and the qualification is applied to the vector-type.
2098 So TREE_TYPE (vector-type) does not return a properly qualified
2099 vector element-type. */
2104 {
2108 }
2111 else
2112 {
2118 }
2119 }
2121 /* If TYPE is not a vector type, just return SC, otherwise return
2122 build_vector_from_val (TYPE, SC). */
2124 tree
2126 {
2131 }
2133 /* Build a vector series of type TYPE in which element I has the value
2134 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2135 and a VEC_SERIES_EXPR otherwise. */
2137 tree
2139 {
2143 {
2153 }
2155 }
2157 /* Return a vector with the same number of units and number of bits
2158 as VEC_TYPE, but in which the elements are a linear series of unsigned
2159 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2161 tree
2163 {
2168 {
2169 index_elt_type = build_nonstandard_integer_type
2172 }
2178 }
2180 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2181 elements are A and the rest are B. */
2183 tree
2185 {
2188 /* Optimize the constant case. */
2195 }
2197 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2198 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2200 void
2202 {
2204 tree val;
2210 {
2211 /* Mostly ctors will have elts that don't have side-effects, so
2212 the usual case is to scan all the elements. Hence a single
2213 loop for both const and side effects, rather than one loop
2214 each (with early outs). */
2219 }
2223 }
2225 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2226 CONSTRUCTOR C. */
2228 void
2230 {
2232 tree val;
2238 {
2243 }
2244 }
2246 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2247 are in the vec pointed to by VALS. */
2248 tree
2250 {
2259 }
2261 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2262 INDEX and VALUE. */
2263 tree
2265 {
2273 }
2276 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2277 are in a list pointed to by VALS. */
2278 tree
2280 {
2281 tree t;
2285 {
2289 }
2292 }
2294 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2295 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2296 fields in the constructor remain null. */
2298 tree
2300 {
2307 }
2309 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2310 of elements, provided as index/value pairs. */
2312 tree
2314 {
2321 {
2325 }
2328 }
2330 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2332 tree
2334 {
2339 }
2341 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2343 tree
2345 {
2346 tree v;
2356 }
2358 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2360 tree
2362 {
2363 tree v;
2366 /* dconst{0,1,2,m1,half} are used in various places in
2367 the middle-end and optimizers, allow them here
2368 even for decimal floating point types as an exception
2369 by converting them to decimal. */
2373 {
2383 {
2384 /* Make sure to give zero the minimum quantum exponent for
2385 the type (which corresponds to all bits zero). */
2390 }
2391 else
2393 }
2395 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2396 Consider doing it via real_convert now. */
2403 }
2405 /* Like build_real, but first truncate D to the type. */
2407 tree
2409 {
2411 }
2413 /* Return a new REAL_CST node whose type is TYPE
2414 and whose value is the integer value of the INTEGER_CST node I. */
2416 REAL_VALUE_TYPE
2418 {
2419 REAL_VALUE_TYPE d;
2421 /* Clear all bits of the real value type so that we can later do
2422 bitwise comparisons to see if two values are the same. */
2428 }
2430 /* Given a tree representing an integer constant I, return a tree
2431 representing the same value as a floating-point constant of type TYPE. */
2433 tree
2435 {
2436 tree v;
2443 }
2445 /* Return a new REAL_CST node whose type is TYPE
2446 and whose value is the integer value I which has sign SGN. */
2448 tree
2450 {
2451 REAL_VALUE_TYPE d;
2453 /* Clear all bits of the real value type so that we can later do
2454 bitwise comparisons to see if two values are the same. */
2459 }
2461 /* Return a newly constructed STRING_CST node whose value is the LEN
2462 characters at STR when STR is nonnull, or all zeros otherwise.
2463 Note that for a C string literal, LEN should include the trailing NUL.
2464 The TREE_TYPE is not initialized. */
2466 tree
2468 {
2469 /* Do not waste bytes provided by padding of struct tree_string. */
2482 else
2487 }
2489 /* Return a newly constructed COMPLEX_CST node whose value is
2490 specified by the real and imaginary parts REAL and IMAG.
2491 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2492 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2494 tree
2496 {
2507 }
2509 /* Build a complex (inf +- 0i), such as for the result of cproj.
2510 TYPE is the complex tree type of the result. If NEG is true, the
2511 imaginary zero is negative. */
2513 tree
2515 {
2521 }
2523 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2524 element is set to 1. In particular, this is 1 + i for complex types. */
2526 tree
2528 {
2530 {
2533 }
2534 else
2536 }
2538 /* Return a constant of arithmetic type TYPE which is the
2539 multiplicative identity of the set TYPE. */
2541 tree
2543 {
2545 {
2555 /* We can only generate 1 for accum types. */
2560 {
2564 }
2573 }
2574 }
2576 /* Return an integer of type TYPE containing all 1's in as much precision as
2577 it contains, or a complex or vector whose subparts are such integers. */
2579 tree
2581 {
2583 {
2586 }
2587 else
2589 }
2591 /* Return a constant of arithmetic type TYPE which is the
2592 opposite of the multiplicative identity of the set TYPE. */
2594 tree
2596 {
2598 {
2608 /* We can only generate 1 for accum types. */
2615 {
2619 }
2628 }
2629 }
2631 /* Build 0 constant of type TYPE. This is used by constructor folding
2632 and thus the constant should be represented in memory by
2633 zero(es). */
2635 tree
2637 {
2639 {
2652 {
2656 }
2659 {
2663 }
2669 }
2670 }
2672 /* Build a constant of integer type TYPE, made of VALUE's bits replicated
2673 every WIDTH bits to fit TYPE's precision. */
2675 tree
2677 {
2688 else
2689 {
2692 }
2700 }
2702 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2703 unsigned constant in which only the sign bit is set. Return null
2704 otherwise. */
2706 tree
2708 {
2709 /* Avoid having to choose between a real-only sign and a pair of signs.
2710 This could be relaxed if the choice becomes obvious later. */
2725 {
2728 }
2730 }
2732 /* Build a BINFO with LEN language slots. */
2734 tree
2736 {
2737 tree t;
2752 }
2754 /* Create a CASE_LABEL_EXPR tree node and return it. */
2756 tree
2758 {
2770 }
2772 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2773 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2774 The latter determines the length of the HOST_WIDE_INT vector. */
2776 tree
2778 {
2779 tree t;
2794 }
2796 /* Build a newly constructed TREE_VEC node of length LEN. */
2798 tree
2800 {
2801 tree t;
2812 }
2814 /* Grow a TREE_VEC node to new length LEN. */
2816 tree
2818 {
2834 }
2835 \f
2836 /* Return true if EXPR is the constant zero, whether it is integral, float or
2837 fixed, and scalar, complex or vector. */
2839 bool
2841 {
2845 }
2847 /* Return true if EXPR is the integer constant zero or a complex constant
2848 of zero, or a location wrapper for such a constant. */
2850 bool
2852 {
2856 {
2868 }
2869 }
2871 /* Return true if EXPR is the integer constant one or the corresponding
2872 complex constant, or a location wrapper for such a constant. */
2874 bool
2876 {
2880 {
2892 }
2893 }
2895 /* Return true if EXPR is the integer constant one. For complex and vector,
2896 return true if every piece is the integer constant one.
2897 Also return true for location wrappers for such a constant. */
2899 bool
2901 {
2907 else
2909 }
2911 /* Return true if EXPR is an integer containing all 1's in as much precision
2912 as it contains, or a complex or vector whose subparts are such integers,
2913 or a location wrapper for such a constant. */
2915 bool
2917 {
2935 }
2937 /* Return true if EXPR is the integer constant minus one, or a location
2938 wrapper for such a constant. */
2940 bool
2942 {
2948 else
2950 }
2952 /* Return true if EXPR is an integer constant that is a power of 2 (i.e., has
2953 only one bit on), or a location wrapper for such a constant. */
2955 bool
2957 {
2969 }
2971 /* Return true if EXPR is an integer constant other than zero or a
2972 complex constant other than zero, or a location wrapper for such a
2973 constant. */
2975 bool
2977 {
2985 }
2987 /* Return true if EXPR is the integer constant one. For vector,
2988 return true if every piece is the integer constant minus one
2989 (representing the value TRUE).
2990 Also return true for location wrappers for such a constant. */
2992 bool
2994 {
3000 }
3002 /* Return true if EXPR is the fixed-point constant zero, or a location wrapper
3003 for such a constant. */
3005 bool
3007 {
3012 }
3014 /* Return the power of two represented by a tree node known to be a
3015 power of two. */
3017 int
3019 {
3024 }
3026 /* Similar, but return the largest integer Y such that 2 ** Y is less
3027 than or equal to EXPR. */
3029 int
3031 {
3036 }
3038 /* Return number of known trailing zero bits in EXPR, or, if the value of
3039 EXPR is known to be zero, the precision of it's type. */
3041 unsigned int
3043 {
3050 {
3071 /* Second operand is sizetype, which could be in theory
3072 wider than pointer's precision. Make sure we never
3073 return more than prec. */
3088 {
3091 }
3096 {
3101 }
3110 {
3113 {
3118 }
3119 }
3121 CASE_CONVERT:
3139 {
3142 }
3146 }
3147 }
3149 /* Return true if EXPR is the real constant zero. Trailing zeroes matter for
3150 decimal float constants, so don't return true for them.
3151 Also return true for location wrappers around such a constant. */
3153 bool
3155 {
3159 {
3167 {
3168 /* Don't simply check for a duplicate because the predicate
3169 accepts both +0.0 and -0.0. */
3175 }
3178 }
3179 }
3181 /* Return true if EXPR is the real constant one in real or complex form.
3182 Trailing zeroes matter for decimal float constants, so don't return
3183 true for them.
3184 Also return true for location wrappers around such a constant. */
3186 bool
3188 {
3192 {
3205 }
3206 }
3208 /* Return true if EXPR is the real constant minus one. Trailing zeroes
3209 matter for decimal float constants, so don't return true for them.
3210 Also return true for location wrappers around such a constant. */
3212 bool
3214 {
3218 {
3231 }
3232 }
3234 /* Return true if T could be a floating point zero. */
3236 bool
3238 {
3240 {
3242 /* Can't use real_zerop here, as it always returns false for decimal
3243 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3244 either, as decimal zeros are rvc_normal. */
3250 {
3256 }
3258 /* Perhaps for SSA_NAMEs we could query frange. */
3260 }
3261 }
3263 /* True if EXP is a constant or a cast of a constant. */
3265 bool
3267 {
3268 /* This is not quite the same as STRIP_NOPS. It does more. */
3273 }
3275 /* Return true if T holds a polynomial pointer difference, storing it in
3276 *VALUE if so. A true return means that T's precision is no greater
3277 than 64 bits, which is the largest address space we support, so *VALUE
3278 never loses precision. However, the signedness of the result does
3279 not necessarily match the signedness of T: sometimes an unsigned type
3280 like sizetype is used to encode a value that is actually negative. */
3282 bool
3284 {
3288 {
3293 }
3295 {
3302 }
3304 }
3306 poly_int64
3308 {
3313 }
3315 poly_uint64
3317 {
3322 }
3323 \f
3324 /* Return first list element whose TREE_VALUE is ELEM.
3325 Return 0 if ELEM is not in LIST. */
3327 tree
3329 {
3331 {
3335 }
3337 }
3339 /* Return first list element whose TREE_PURPOSE is ELEM.
3340 Return 0 if ELEM is not in LIST. */
3342 tree
3344 {
3346 {
3350 }
3352 }
3354 /* Return true if ELEM is in V. */
3356 bool
3358 {
3360 tree t;
3365 }
3367 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3368 NULL_TREE. */
3370 tree
3372 {
3376 }
3378 /* Return true if ELEM is part of the chain CHAIN. */
3380 bool
3382 {
3384 {
3388 }
3391 }
3393 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3394 We expect a null pointer to mark the end of the chain.
3395 This is the Lisp primitive `length'. */
3397 int
3399 {
3401 #ifdef ENABLE_TREE_CHECKING
3403 #endif
3407 {
3409 #ifdef ENABLE_TREE_CHECKING
3413 #endif
3414 len++;
3415 }
3418 }
3420 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3421 UNION_TYPE TYPE, or NULL_TREE if none. */
3423 tree
3425 {
3430 }
3432 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3433 UNION_TYPE TYPE, or NULL_TREE if none. */
3435 tree
3437 {
3441 {
3446 }
3449 }
3451 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3452 by modifying the last node in chain 1 to point to chain 2.
3453 This is the Lisp primitive `nconc'. */
3455 tree
3457 {
3458 tree t1;
3469 #ifdef ENABLE_TREE_CHECKING
3470 {
3471 tree t2;
3474 }
3475 #endif
3478 }
3480 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3482 tree
3484 {
3485 tree next;
3490 }
3492 /* Reverse the order of elements in the chain T,
3493 and return the new head of the chain (old last element). */
3495 tree
3497 {
3500 {
3501 /* We shouldn't be using this function to reverse BLOCK chains; we
3502 have blocks_nreverse for that. */
3507 }
3509 }
3510 \f
3511 /* Return a newly created TREE_LIST node whose
3512 purpose and value fields are PARM and VALUE. */
3514 tree
3516 {
3521 }
3523 /* Build a chain of TREE_LIST nodes from a vector. */
3525 tree
3527 {
3531 tree t;
3533 {
3536 }
3538 }
3540 /* Return a newly created TREE_LIST node whose
3541 purpose and value fields are PURPOSE and VALUE
3542 and whose TREE_CHAIN is CHAIN. */
3544 tree
3546 {
3547 tree node;
3559 }
3561 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3562 trees. */
3566 {
3570 tree val;
3576 }
3577 \f
3578 /* Return the size nominally occupied by an object of type TYPE
3579 when it resides in memory. The value is measured in units of bytes,
3580 and its data type is that normally used for type sizes
3581 (which is the first type created by make_signed_type or
3582 make_unsigned_type). */
3584 tree
3586 {
3587 tree t;
3596 {
3599 }
3602 }
3604 /* Return the size of TYPE (in bytes) as a wide integer
3605 or return -1 if the size can vary or is larger than an integer. */
3607 HOST_WIDE_INT
3609 {
3610 tree t;
3620 else
3622 }
3624 /* Return the maximum size of TYPE (in bytes) as a wide integer
3625 or return -1 if the size can vary or is larger than an integer. */
3627 HOST_WIDE_INT
3629 {
3631 tree size_tree;
3633 /* If this is an array type, check for a possible MAX_SIZE attached. */
3636 {
3641 }
3643 /* If we still haven't been able to get a size, see if the language
3644 can compute a maximum size. */
3647 {
3652 }
3655 }
3656 \f
3657 /* Return the bit position of FIELD, in bits from the start of the record.
3658 This is a tree of type bitsizetype. */
3660 tree
3662 {
3665 }
3666 \f
3667 /* Return the byte position of FIELD, in bytes from the start of the record.
3668 This is a tree of type sizetype. */
3670 tree
3672 {
3675 }
3677 /* Likewise, but return as an integer. It must be representable in
3678 that way (since it could be a signed value, we don't have the
3679 option of returning -1 like int_size_in_byte can. */
3681 HOST_WIDE_INT
3683 {
3685 }
3686 \f
3687 /* Return, as a tree node, the number of elements for TYPE (which is an
3688 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3690 tree
3692 {
3695 /* If they did it with unspecified bounds, then we should have already
3696 given an error about it before we got here. */
3704 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3706 {
3707 /* zero sized arrays are represented from C FE as complete types with
3708 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3709 them as min 0, max -1. */
3716 }
3719 ? max
3721 }
3722 \f
3723 /* If arg is static -- a reference to an object in static storage -- then
3724 return the object. This is not the same as the C meaning of `static'.
3725 If arg isn't static, return NULL. */
3727 tree
3729 {
3731 {
3733 /* Nested functions are static, even though taking their address will
3734 involve a trampoline as we unnest the nested function and create
3735 the trampoline on the tree level. */
3756 /* If the thing being referenced is not a field, then it is
3757 something language specific. */
3760 /* If we are referencing a bitfield, we can't evaluate an
3761 ADDR_EXPR at compile time and so it isn't a constant. */
3778 else
3786 }
3787 }
3789 \f
3792 /* Return whether OP is a DECL whose address is function-invariant. */
3794 bool
3796 {
3797 /* The conditions below are slightly less strict than the one in
3798 staticp. */
3801 {
3824 }
3827 }
3829 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3831 bool
3833 {
3834 /* The conditions below are slightly less strict than the one in
3835 staticp. */
3838 {
3858 }
3861 }
3864 /* Return true if T is function-invariant (internal function, does
3865 not handle arithmetic; that's handled in skip_simple_arithmetic and
3866 tree_invariant_p). */
3868 static bool
3870 {
3871 tree op;
3878 {
3885 {
3887 {
3902 }
3904 }
3910 }
3913 }
3915 /* Return true if T is function-invariant. */
3917 bool
3919 {
3922 }
3924 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3925 Do this to any expression which may be used in more than one place,
3926 but must be evaluated only once.
3928 Normally, expand_expr would reevaluate the expression each time.
3929 Calling save_expr produces something that is evaluated and recorded
3930 the first time expand_expr is called on it. Subsequent calls to
3931 expand_expr just reuse the recorded value.
3933 The call to expand_expr that generates code that actually computes
3934 the value is the first call *at compile time*. Subsequent calls
3935 *at compile time* generate code to use the saved value.
3936 This produces correct result provided that *at run time* control
3937 always flows through the insns made by the first expand_expr
3938 before reaching the other places where the save_expr was evaluated.
3939 You, the caller of save_expr, must make sure this is so.
3941 Constants, and certain read-only nodes, are returned with no
3942 SAVE_EXPR because that is safe. Expressions containing placeholders
3943 are not touched; see tree.def for an explanation of what these
3944 are used for. */
3946 tree
3948 {
3949 tree inner;
3951 /* If the tree evaluates to a constant, then we don't want to hide that
3952 fact (i.e. this allows further folding, and direct checks for constants).
3953 However, a read-only object that has side effects cannot be bypassed.
3954 Since it is no problem to reevaluate literals, we just return the
3955 literal node. */
3963 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3964 it means that the size or offset of some field of an object depends on
3965 the value within another field.
3967 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3968 and some variable since it would then need to be both evaluated once and
3969 evaluated more than once. Front-ends must assure this case cannot
3970 happen by surrounding any such subexpressions in their own SAVE_EXPR
3971 and forcing evaluation at the proper time. */
3977 /* This expression might be placed ahead of a jump to ensure that the
3978 value was computed on both sides of the jump. So make sure it isn't
3979 eliminated as dead. */
3982 }
3984 /* Look inside EXPR into any simple arithmetic operations. Return the
3985 outermost non-arithmetic or non-invariant node. */
3987 tree
3989 {
3990 /* We don't care about whether this can be used as an lvalue in this
3991 context. */
3995 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3996 a constant, it will be more efficient to not make another SAVE_EXPR since
3997 it will allow better simplification and GCSE will be able to merge the
3998 computations if they actually occur. */
4000 {
4004 {
4009 else
4011 }
4012 else
4014 }
4017 }
4019 /* Look inside EXPR into simple arithmetic operations involving constants.
4020 Return the outermost non-arithmetic or non-constant node. */
4022 tree
4024 {
4029 {
4033 {
4038 else
4040 }
4041 else
4043 }
4046 }
4048 /* Return which tree structure is used by T. */
4050 enum tree_node_structure_enum
4052 {
4055 }
4057 /* Set various status flags when building a CALL_EXPR object T. */
4059 static void
4061 {
4066 /* Calls have side-effects, except those to const or pure functions. */
4069 /* Propagate TREE_READONLY of arguments for const functions. */
4075 {
4081 }
4085 }
4086 \f
4087 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4088 size or offset that depends on a field within a record. */
4090 bool
4092 {
4103 {
4105 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4106 position computations since they will be converted into a
4107 WITH_RECORD_EXPR involving the reference, which will assume
4108 here will be valid. */
4122 {
4124 /* Ignoring the first operand isn't quite right, but works best. */
4133 /* The save_expr function never wraps anything containing
4134 a PLACEHOLDER_EXPR. */
4139 }
4142 {
4150 }
4154 {
4156 {
4157 const_tree arg;
4158 const_call_expr_arg_iterator iter;
4163 }
4166 }
4170 }
4172 }
4174 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4175 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4176 field positions. */
4178 static bool
4180 {
4181 /* If the size contains a placeholder or the parent type (component type in
4182 the case of arrays) type involves a placeholder, this type does. */
4190 /* Now do type-specific checks. Note that the last part of the check above
4191 greatly limits what we have to do below. */
4193 {
4211 /* Here we just check the bounds. */
4216 /* We have already checked the component type above, so just check
4217 the domain type. Flexible array members have a null domain. */
4224 {
4225 tree field;
4236 }
4240 }
4241 }
4243 /* Wrapper around above function used to cache its result. */
4245 bool
4247 {
4250 /* If the contains_placeholder_bits field has been initialized,
4251 then we know the answer. */
4255 /* Indicate that we've seen this type node, and the answer is false.
4256 This is what we want to return if we run into recursion via fields. */
4259 /* Compute the real value. */
4262 /* Store the real value. */
4266 }
4267 \f
4268 /* Push tree EXP onto vector QUEUE if it is not already present. */
4270 static void
4272 {
4274 tree iter;
4282 }
4284 /* Given a tree EXP, find all occurrences of references to fields
4285 in a PLACEHOLDER_EXPR and place them in vector REFS without
4286 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4287 we assume here that EXP contains only arithmetic expressions
4288 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4289 argument list. */
4291 void
4293 {
4295 tree inner;
4298 /* We handle TREE_LIST and COMPONENT_REF separately. */
4300 {
4303 }
4305 {
4309 ;
4313 else
4315 }
4316 else
4318 {
4323 /* Variables allocated to static storage can stay. */
4329 /* This is the pattern built in ada/make_aligning_type. */
4332 {
4335 }
4337 /* Fall through. */
4355 }
4356 }
4358 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4359 return a tree with all occurrences of references to F in a
4360 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4361 CONST_DECLs. Note that we assume here that EXP contains only
4362 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4363 occurring only in their argument list. */
4365 tree
4367 {
4370 tree new_tree;
4372 /* We handle TREE_LIST and COMPONENT_REF separately. */
4374 {
4381 }
4383 {
4384 tree inner;
4386 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4387 and it is the right field, replace it with R. */
4391 ;
4393 /* The field. */
4399 /* If this expression hasn't been completed let, leave it alone. */
4407 new_tree
4409 }
4410 else
4412 {
4419 else
4426 /* Fall through. */
4434 {
4479 new_tree
4485 }
4489 {
4494 /* If we are trying to replace F with a constant or with another
4495 instance of one of the arguments of the call, inline back
4496 functions which do nothing else than computing a value from
4497 the arguments they are passed. This makes it possible to
4498 fold partially or entirely the replacement expression. */
4500 {
4504 else
4507 {
4510 }
4512 {
4516 }
4517 }
4520 {
4524 {
4528 }
4529 }
4532 {
4536 }
4537 else
4539 }
4544 }
4552 }
4554 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4555 for it within OBJ, a tree that is an object or a chain of references. */
4557 tree
4559 {
4562 tree new_tree;
4564 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4565 in the chain of OBJ. */
4567 {
4569 tree elt;
4599 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4600 survives until RTL generation, there will be an error. */
4602 }
4604 /* TREE_LIST is special because we need to look at TREE_VALUE
4605 and TREE_CHAIN, not TREE_OPERANDS. */
4607 {
4614 }
4615 else
4617 {
4630 {
4675 new_tree
4681 }
4685 {
4691 {
4695 {
4699 }
4700 }
4703 {
4707 }
4708 else
4710 }
4715 }
4723 }
4724 \f
4726 /* Subroutine of stabilize_reference; this is called for subtrees of
4727 references. Any expression with side-effects must be put in a SAVE_EXPR
4728 to ensure that it is only evaluated once.
4730 We don't put SAVE_EXPR nodes around everything, because assigning very
4731 simple expressions to temporaries causes us to miss good opportunities
4732 for optimizations. Among other things, the opportunity to fold in the
4733 addition of a constant into an addressing mode often gets lost, e.g.
4734 "y[i+1] += x;". In general, we take the approach that we should not make
4735 an assignment unless we are forced into it - i.e., that any non-side effect
4736 operator should be allowed, and that cse should take care of coalescing
4737 multiple utterances of the same expression should that prove fruitful. */
4739 static tree
4741 {
4742 tree result;
4745 /* We cannot ignore const expressions because it might be a reference
4746 to a const array but whose index contains side-effects. But we can
4747 ignore things that are actual constant or that already have been
4748 handled by this function. */
4754 {
4756 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4757 have side-effects. */
4760 /* FALLTHRU */
4768 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4769 so that it will only be evaluated once. */
4770 /* The reference (r) and comparison (<) classes could be handled as
4771 below, but it is generally faster to only evaluate them once. */
4777 /* Constants need no processing. In fact, we should never reach
4778 here. */
4782 /* Division is slow and tends to be compiled with jumps,
4783 especially the division by powers of 2 that is often
4784 found inside of an array reference. So do it just once. */
4790 /* Recursively stabilize each operand. */
4796 /* Recursively stabilize each operand. */
4802 }
4810 }
4812 /* Stabilize a reference so that we can use it any number of times
4813 without causing its operands to be evaluated more than once.
4814 Returns the stabilized reference. This works by means of save_expr,
4815 so see the caveats in the comments about save_expr.
4817 Also allows conversion expressions whose operands are references.
4818 Any other kind of expression is returned unchanged. */
4820 tree
4822 {
4823 tree result;
4827 {
4831 /* No action is needed in this case. */
4834 CASE_CONVERT:
4873 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4874 it wouldn't be ignored. This matters when dealing with
4875 volatiles. */
4878 /* If arg isn't a kind of lvalue we recognize, make no change.
4879 Caller should recognize the error for an invalid lvalue. */
4885 }
4894 }
4895 \f
4896 /* Low-level constructors for expressions. */
4898 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4899 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4901 void
4903 {
4904 tree node;
4909 /* We started out assuming this address is both invariant and constant, but
4910 does not have side effects. Now go down any handled components and see if
4911 any of them involve offsets that are either non-constant or non-invariant.
4912 Also check for side-effects.
4914 ??? Note that this code makes no attempt to deal with the case where
4915 taking the address of something causes a copy due to misalignment. */
4917 #define UPDATE_FLAGS(NODE) \
4918 do { tree _node = (NODE); \
4919 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4920 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4924 {
4925 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4926 array reference (probably made temporarily by the G++ front end),
4927 so ignore all the operands. */
4931 {
4937 }
4938 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4939 FIELD_DECL, apparently. The G++ front end can put something else
4940 there, at least temporarily. */
4943 {
4946 }
4947 }
4951 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4952 the address, since &(*a)->b is a form of addition. If it's a constant, the
4953 address is constant too. If it's a decl, its address is constant if the
4954 decl is static. Everything else is not constant and, furthermore,
4955 taking the address of a volatile variable is not volatile. */
4960 ;
4963 else
4964 {
4967 }
4972 #undef UPDATE_FLAGS
4973 }
4975 /* Build an expression of code CODE, data type TYPE, and operands as
4976 specified. Expressions and reference nodes can be created this way.
4977 Constants, decls, types and misc nodes cannot be.
4979 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4980 enough for all extant tree codes. */
4982 tree
4984 {
4985 tree t;
4993 }
4995 tree
4997 {
4999 tree t;
5015 {
5018 }
5021 {
5024 }
5026 {
5028 /* All of these have side-effects, no matter what their
5029 operands are. */
5035 /* Whether a dereference is readonly has nothing to do with whether
5036 its operand is readonly. */
5054 }
5057 }
5059 #define PROCESS_ARG(N) \
5060 do { \
5061 TREE_OPERAND (t, N) = arg##N; \
5062 if (arg##N &&!TYPE_P (arg##N)) \
5063 { \
5064 if (TREE_SIDE_EFFECTS (arg##N)) \
5065 side_effects = 1; \
5066 if (!TREE_READONLY (arg##N) \
5067 && !CONSTANT_CLASS_P (arg##N)) \
5068 (void) (read_only = 0); \
5069 if (!TREE_CONSTANT (arg##N)) \
5070 (void) (constant = 0); \
5071 } \
5072 } while (0)
5074 tree
5076 {
5078 tree t;
5084 /* When sizetype precision doesn't match that of pointers
5085 we need to be able to build explicit extensions or truncations
5086 of the offset argument. */
5098 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5099 result based on those same flags for the arguments. But if the
5100 arguments aren't really even `tree' expressions, we shouldn't be trying
5101 to do this. */
5103 /* Expressions without side effects may be constant if their
5104 arguments are as well. */
5111 {
5125 }
5132 {
5134 {
5138 }
5139 }
5140 else
5141 {
5143 /* Don't mark X / 0 as constant. */
5148 }
5151 }
5154 tree
5156 tree arg2 MEM_STAT_DECL)
5157 {
5159 tree t;
5169 /* As a special exception, if COND_EXPR has NULL branches, we
5170 assume that it is a gimple statement and always consider
5171 it to have side effects. */
5177 else
5193 }
5195 tree
5198 {
5200 tree t;
5220 }
5222 tree
5225 {
5227 tree t;
5244 {
5246 {
5250 }
5251 }
5252 else
5258 }
5260 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5261 on the pointer PTR. */
5263 tree
5265 {
5268 tree tem;
5269 /* For convenience allow addresses that collapse to a simple base
5270 and offset. */
5274 {
5278 {
5281 }
5282 else
5285 }
5290 }
5292 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5294 poly_offset_int
5296 {
5298 SIGNED);
5299 }
5301 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5302 offsetted by OFFSET units. */
5304 tree
5306 {
5313 }
5315 /* Similar except don't specify the TREE_TYPE
5316 and leave the TREE_SIDE_EFFECTS as 0.
5317 It is permissible for arguments to be null,
5318 or even garbage if their values do not matter. */
5320 tree
5322 {
5323 tree t;
5340 }
5342 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5343 tree vec. */
5345 tree
5347 {
5357 }
5358 \f
5359 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5360 and data type TYPE.
5361 We do NOT enter this node in any sort of symbol table.
5363 LOC is the location of the decl.
5365 layout_decl is used to set up the decl's storage layout.
5366 Other slots are initialized to 0 or null pointers. */
5368 tree
5370 tree type MEM_STAT_DECL)
5371 {
5372 tree t;
5377 /* if (type == error_mark_node)
5378 type = integer_type_node; */
5379 /* That is not done, deliberately, so that having error_mark_node
5380 as the type can suppress useless errors in the use of this variable. */
5389 }
5391 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5393 tree
5395 {
5401 }
5403 /* Builds and returns function declaration with NAME and TYPE. */
5405 tree
5407 {
5417 }
5421 /* Builds a new translation-unit decl with name NAME, queues it in the
5422 global list of translation-unit decls and returns it. */
5424 tree
5426 {
5432 }
5434 \f
5435 /* BLOCK nodes are used to represent the structure of binding contours
5436 and declarations, once those contours have been exited and their contents
5437 compiled. This information is used for outputting debugging info. */
5439 tree
5441 {
5449 }
5451 \f
5452 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5454 LOC is the location to use in tree T. */
5456 void
5458 {
5462 {
5466 }
5467 }
5469 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5470 UNKNOWN_LOCATION. */
5472 void
5474 {
5478 }
5479 \f
5480 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5481 of the various TYPE_QUAL values. */
5483 static void
5485 {
5491 }
5493 /* Returns true iff CAND and BASE have equivalent language-specific
5494 qualifiers. */
5496 bool
5498 {
5501 /* type_hash_eq currently only applies to these types. */
5506 }
5508 /* This function checks to see if TYPE matches the size one of the built-in
5509 atomic types, and returns that core atomic type. */
5511 static tree
5513 {
5514 tree base_atomic_type;
5516 /* Only handle complete types. */
5521 {
5544 }
5547 }
5549 /* Returns true iff unqualified CAND and BASE are equivalent. */
5551 bool
5553 {
5555 /* Apparently this is needed for Objective-C. */
5560 /* Check alignment. */
5564 /* Atomic types increase minimal alignment. We must to do so as well
5565 or we get duplicated canonical types. See PR88686. */
5567 {
5568 /* See if this object can map to a basic atomic type. */
5572 }
5574 }
5576 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5578 bool
5580 {
5584 }
5586 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5588 static bool
5590 {
5593 /* Apparently this is needed for Objective-C. */
5595 /* Check alignment. */
5597 /* Check this is a user-aligned type as build_aligned_type
5598 would create. */
5603 }
5605 /* Return a version of the TYPE, qualified as indicated by the
5606 TYPE_QUALS, if one exists. If no qualified version exists yet,
5607 return NULL_TREE. */
5609 tree
5611 {
5619 /* Search the chain of variants to see if there is already one there just
5620 like the one we need to have. If so, use that existing one. We must
5621 preserve the TYPE_NAME, since there is code that depends on this. */
5624 {
5625 /* Put the found variant at the head of the variant list so
5626 frequently searched variants get found faster. The C++ FE
5627 benefits greatly from this. */
5633 }
5636 }
5638 /* Like get_qualified_type, but creates the type if it does not
5639 exist. This function never returns NULL_TREE. */
5641 tree
5643 {
5644 tree t;
5646 /* See if we already have the appropriate qualified variant. */
5649 /* If not, build it. */
5651 {
5656 {
5657 /* See if this object can map to a basic atomic type. */
5660 {
5661 /* Ensure the alignment of this type is compatible with
5662 the required alignment of the atomic type. */
5665 }
5666 }
5669 /* Propagate structural equality. */
5672 /* Build the underlying canonical type, since it is different
5673 from TYPE. */
5674 {
5677 }
5678 else
5679 /* T is its own canonical type. */
5682 }
5685 }
5687 /* Create a variant of type T with alignment ALIGN. */
5689 tree
5691 {
5692 tree t;
5707 }
5709 /* Create a new distinct copy of TYPE. The new type is made its own
5710 MAIN_VARIANT. If TYPE requires structural equality checks, the
5711 resulting type requires structural equality checks; otherwise, its
5712 TYPE_CANONICAL points to itself. */
5714 tree
5716 {
5722 /* Set the canonical type either to a new equivalence class, or
5723 propagate the need for structural equality checks. */
5726 else
5729 /* Make it its own variant. */
5733 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5734 whose TREE_TYPE is not t. This can also happen in the Ada
5735 frontend when using subtypes. */
5738 }
5740 /* Create a new variant of TYPE, equivalent but distinct. This is so
5741 the caller can modify it. TYPE_CANONICAL for the return type will
5742 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5743 are considered equal by the language itself (or that both types
5744 require structural equality checks). */
5746 tree
5748 {
5753 /* Since we're building a variant, assume that it is a non-semantic
5754 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5756 /* Type variants have no alias set defined. */
5759 /* Add the new type to the chain of variants of TYPE. */
5765 }
5766 \f
5767 /* Return true if the from tree in both tree maps are equal. */
5769 int
5771 {
5775 }
5777 /* Hash a from tree in a tree_base_map. */
5779 unsigned int
5781 {
5783 }
5785 /* Return true if this tree map structure is marked for garbage collection
5786 purposes. We simply return true if the from tree is marked, so that this
5787 structure goes away when the from tree goes away. */
5789 bool
5791 {
5793 }
5795 /* Hash a from tree in a tree_map. */
5797 unsigned int
5799 {
5801 }
5803 /* Hash a from tree in a tree_decl_map. */
5805 unsigned int
5807 {
5809 }
5811 /* Return the initialization priority for DECL. */
5813 priority_type
5815 {
5820 return
5822 }
5824 /* Return the finalization priority for DECL. */
5826 priority_type
5828 {
5833 return
5835 }
5837 /* Set the initialization priority for DECL to PRIORITY. */
5839 void
5841 {
5845 {
5849 }
5852 else
5855 }
5857 /* Set the finalization priority for DECL to PRIORITY. */
5859 void
5861 {
5865 {
5869 }
5870 else
5873 }
5875 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5877 static void
5879 {
5884 }
5886 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5888 static void
5890 {
5895 }
5897 /* Lookup a debug expression for FROM, and return it if we find one. */
5899 tree
5901 {
5909 }
5911 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5913 void
5915 {
5922 }
5924 /* Lookup a value expression for FROM, and return it if we find one. */
5926 tree
5928 {
5936 }
5938 /* Insert a mapping FROM->TO in the value expression hashtable. */
5940 void
5942 {
5945 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5952 }
5954 /* Lookup a vector of debug arguments for FROM, and return it if we
5955 find one. */
5959 {
5970 }
5972 /* Insert a mapping FROM->empty vector of debug arguments in the value
5973 expression hashtable. */
5977 {
5992 }
5994 /* Hashing of types so that we don't make duplicates.
5995 The entry point is `type_hash_canon'. */
5997 /* Generate the default hash code for TYPE. This is designed for
5998 speed, rather than maximum entropy. */
6000 hashval_t
6002 {
6011 /* Just the identifier is adequate to distinguish. */
6015 {
6018 /* FALLTHROUGH. */
6030 {
6034 {
6037 }
6038 }
6042 {
6049 }
6052 {
6058 }
6062 {
6066 }
6074 }
6077 }
6079 /* These are the Hashtable callback functions. */
6081 /* Returns true iff the types are equivalent. */
6083 bool
6085 {
6086 /* First test the things that are the same for all types. */
6096 /* Be careful about comparing arrays before and after the element type
6097 has been completed; don't compare TYPE_ALIGN unless both types are
6098 complete. */
6105 {
6128 /* fall through */
6165 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6166 where the flag should be inherited from the element type
6167 and can change after ARRAY_TYPEs are created; on non-aggregates
6168 compare it and hash it, scalars will never have that flag set
6169 and we need to differentiate between arrays created by different
6170 front-ends or middle-end created arrays. */
6202 }
6208 }
6210 /* Given TYPE, and HASHCODE its hash code, return the canonical
6211 object for an identical type if one already exists.
6212 Otherwise, return TYPE, and record it as the canonical object.
6214 To use this function, first create a type of the sort you want.
6215 Then compute its hash code from the fields of the type that
6216 make it different from other similar types.
6217 Then call this function and use the value. */
6219 tree
6221 {
6222 type_hash in;
6225 /* The hash table only contains main variants, so ensure that's what we're
6226 being passed. */
6229 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6230 must call that routine before comparing TYPE_ALIGNs. */
6238 {
6244 /* Free also min/max values and the cache for integer
6245 types. This can't be done in free_node, as LTO frees
6246 those on its own. */
6248 {
6251 {
6252 /* Zero is always in TYPE_CACHED_VALUES. */
6256 }
6259 {
6262 }
6265 }
6268 }
6269 else
6270 {
6279 }
6280 }
6282 static void
6284 {
6289 }
6291 /* Given two lists of types
6292 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6293 return 1 if the lists contain the same types in the same order.
6294 Also, the TREE_PURPOSEs must match. */
6296 bool
6298 {
6310 }
6312 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6313 given by TYPE. If the argument list accepts variable arguments,
6314 then this function counts only the ordinary arguments. */
6316 int
6318 {
6322 /* If the function does not take a variable number of arguments,
6323 the last element in the list will have type `void'. */
6326 else
6330 }
6332 /* Return the type of the function TYPE's argument ARGNO if known.
6333 For vararg function's where ARGNO refers to one of the variadic
6334 arguments return null. Otherwise, return a void_type_node for
6335 out-of-bounds ARGNO. */
6337 tree
6339 {
6340 /* Treat zero the same as an out-of-bounds argument number. */
6344 function_args_iterator iter;
6346 tree argtype;
6349 {
6350 /* A vararg function's argument list ends in a null. Otherwise,
6351 an ordinary function's argument list ends with void. Return
6352 null if ARGNO refers to a vararg argument, void_type_node if
6353 it's out of bounds, and the formal argument type otherwise. */
6361 }
6364 }
6366 /* True if integer constants T1 and T2
6367 represent the same constant value. */
6369 bool
6371 {
6387 }
6389 /* Return true if T is an INTEGER_CST whose numerical value (extended
6390 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6392 bool
6394 {
6398 }
6400 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6401 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6403 bool
6405 {
6409 {
6414 }
6417 }
6419 /* Return true if T is an INTEGER_CST whose numerical value (extended
6420 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6422 bool
6424 {
6428 }
6430 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6431 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6433 bool
6435 {
6439 {
6444 }
6447 }
6449 /* T is an INTEGER_CST whose numerical value (extended according to
6450 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6451 HOST_WIDE_INT. */
6453 HOST_WIDE_INT
6455 {
6458 }
6460 /* T is an INTEGER_CST whose numerical value (extended according to
6461 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6462 HOST_WIDE_INT. */
6464 unsigned HOST_WIDE_INT
6466 {
6469 }
6471 /* Return the most significant (sign) bit of T. */
6473 int
6475 {
6479 }
6481 /* Return an indication of the sign of the integer constant T.
6482 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6483 Note that -1 will never be returned if T's type is unsigned. */
6485 int
6487 {
6494 else
6496 }
6498 /* Return the minimum number of bits needed to represent VALUE in a
6499 signed or unsigned type, UNSIGNEDP says which. */
6501 unsigned int
6503 {
6504 /* If the value is negative, compute its negative minus 1. The latter
6505 adjustment is because the absolute value of the largest negative value
6506 is one larger than the largest positive value. This is equivalent to
6507 a bit-wise negation, so use that operation instead. */
6512 /* Return the number of bits needed, taking into account the fact
6513 that we need one more bit for a signed than unsigned type.
6514 If value is 0 or -1, the minimum precision is 1 no matter
6515 whether unsignedp is true or false. */
6519 else
6521 }
6523 /* Return truthvalue of whether T1 is the same tree structure as T2.
6524 Return 1 if they are the same.
6525 Return 0 if they are understandably different.
6526 Return -1 if either contains tree structure not understood by
6527 this function. */
6529 int
6531 {
6541 /* For location wrappers to be the same, they must be at the same
6542 source location (and wrap the same thing). */
6544 {
6548 }
6554 {
6558 else
6560 }
6570 {
6586 {
6595 /* ??? Should we handle also fields here? */
6599 }
6610 {
6618 {
6622 }
6624 }
6627 /* Special case: if either target is an unallocated VAR_DECL,
6628 it means that it's going to be unified with whatever the
6629 TARGET_EXPR is really supposed to initialize, so treat it
6630 as being equivalent to anything. */
6638 else
6667 /* A false return means maybe_ne rather than known_ne. */
6673 }
6675 /* This general rule works for most tree codes. All exceptions should be
6676 handled above. If this is a language-specific tree code, we can't
6677 trust what might be in the operand, so say we don't know
6678 the situation. */
6683 {
6692 {
6696 }
6702 }
6703 }
6705 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6706 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6707 than U, respectively. */
6709 int
6711 {
6720 else
6722 }
6724 /* Return true if SIZE represents a constant size that is in bounds of
6725 what the middle-end and the backend accepts (covering not more than
6726 half of the address-space).
6727 When PERR is non-null, set *PERR on failure to the description of
6728 why SIZE is not valid. */
6730 bool
6732 {
6734 {
6741 }
6743 cst_size_error error;
6748 {
6751 }
6754 {
6757 }
6760 {
6763 }
6767 {
6770 }
6773 }
6775 /* Return the precision of the type, or for a complex or vector type the
6776 precision of the type of its elements. */
6778 unsigned int
6780 {
6788 }
6790 /* Return true if CODE represents an associative tree code. Otherwise
6791 return false. */
6792 bool
6794 {
6796 {
6808 }
6810 }
6812 /* Return true if CODE represents a commutative tree code. Otherwise
6813 return false. */
6814 bool
6816 {
6818 {
6845 }
6847 }
6849 /* Return true if CODE represents a ternary tree code for which the
6850 first two operands are commutative. Otherwise return false. */
6851 bool
6853 {
6855 {
6863 }
6865 }
6867 /* Returns true if CODE can overflow. */
6869 bool
6871 {
6873 {
6878 /* Can overflow in various ways. */
6884 /* For INT_MIN / -1. */
6888 /* For -INT_MIN. */
6891 /* These operators cannot overflow. */
6893 }
6894 }
6896 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6897 ftrapv doesn't generate trapping insns for CODE. */
6899 bool
6901 {
6904 /* We don't generate instructions that trap on overflow for complex or vector
6905 types. */
6913 {
6919 /* These operators can overflow, and -ftrapv generates trapping code for
6920 these. */
6927 /* These operators can overflow, but -ftrapv does not generate trapping
6928 code for these. */
6931 /* These operators cannot overflow. */
6933 }
6934 }
6936 /* Constructors for pointer, array and function types.
6937 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6938 constructed by language-dependent code, not here.) */
6940 /* Construct, lay out and return the type of pointers to TO_TYPE with
6941 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6942 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6943 indicate this type can reference all of memory. If such a type has
6944 already been constructed, reuse it. */
6946 tree
6949 {
6950 tree t;
6957 {
6960 }
6962 /* If the pointed-to type has the may_alias attribute set, force
6963 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6967 /* In some cases, languages will have things that aren't a POINTER_TYPE
6968 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6969 In that case, return that type without regard to the rest of our
6970 operands.
6972 ??? This is a kludge, but consistent with the way this function has
6973 always operated and there doesn't seem to be a good way to avoid this
6974 at the moment. */
6979 /* First, if we already have a type for pointers to TO_TYPE and it's
6980 the proper mode, use it. */
6993 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7001 /* Lay out the type. This function has many callers that are concerned
7002 with expression-construction, and this simplifies them all. */
7006 }
7008 /* By default build pointers in ptr_mode. */
7010 tree
7012 {
7014 }
7016 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7018 tree
7021 {
7022 tree t;
7029 {
7032 }
7034 /* If the pointed-to type has the may_alias attribute set, force
7035 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7039 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7040 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7041 In that case, return that type without regard to the rest of our
7042 operands.
7044 ??? This is a kludge, but consistent with the way this function has
7045 always operated and there doesn't seem to be a good way to avoid this
7046 at the moment. */
7051 /* First, if we already have a type for pointers to TO_TYPE and it's
7052 the proper mode, use it. */
7065 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7076 }
7079 /* Build the node for the type of references-to-TO_TYPE by default
7080 in ptr_mode. */
7082 tree
7084 {
7086 }
7088 #define MAX_INT_CACHED_PREC \
7089 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7092 static void
7094 {
7096 {
7098 }
7099 }
7101 /* Builds a signed or unsigned integer type of precision PRECISION.
7102 Used for C bitfields whose precision does not match that of
7103 built-in target types. */
7104 tree
7107 {
7114 {
7118 }
7125 else
7135 }
7137 #define MAX_BOOL_CACHED_PREC \
7138 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7141 /* Builds a boolean type of precision PRECISION.
7142 Used for boolean vectors to choose proper vector element size. */
7143 tree
7145 {
7146 tree type;
7149 {
7153 }
7163 }
7167 /* Builds a signed or unsigned _BitInt(PRECISION) type. */
7168 tree
7170 {
7182 {
7186 }
7193 else
7203 }
7205 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7206 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7207 is true, reuse such a type that has already been constructed. */
7209 static tree
7211 {
7234 {
7235 /* Since we cannot reliably merge this type, we need to compare it using
7236 structural equality checks. */
7239 }
7245 }
7247 /* Wrapper around build_range_type_1 with SHARED set to true. */
7249 tree
7251 {
7253 }
7255 /* Wrapper around build_range_type_1 with SHARED set to false. */
7257 tree
7259 {
7261 }
7263 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7264 MAXVAL should be the maximum value in the domain
7265 (one less than the length of the array).
7267 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7268 We don't enforce this limit, that is up to caller (e.g. language front end).
7269 The limit exists because the result is a signed type and we don't handle
7270 sizes that use more than one HOST_WIDE_INT. */
7272 tree
7274 {
7276 }
7278 /* Return true if the debug information for TYPE, a subtype, should be emitted
7279 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7280 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7281 debug info and doesn't reflect the source code. */
7283 bool
7285 {
7288 /* Subrange types have a base type which is an integral type. */
7292 /* Get the real bounds of the subtype. */
7295 else
7296 {
7299 }
7301 /* If the type and its base type have the same representation and the same
7302 name, then the type is not a subrange but a copy of the base type. */
7316 }
7318 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7319 and number of elements specified by the range of values of INDEX_TYPE.
7320 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7321 If SHARED is true, reuse such a type that has already been constructed.
7322 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7324 tree
7327 {
7328 tree t;
7331 {
7334 }
7344 {
7347 }
7350 {
7359 index_type
7362 }
7365 }
7367 /* Wrapper around build_array_type_1 with SHARED set to true. */
7369 tree
7371 {
7372 return
7374 }
7376 /* Wrapper around build_array_type_1 with SHARED set to false. */
7378 tree
7380 {
7382 }
7384 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7385 sizetype. */
7387 tree
7389 {
7391 }
7393 /* Computes the canonical argument types from the argument type list
7394 ARGTYPES.
7396 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7397 on entry to this function, or if any of the ARGTYPES are
7398 structural.
7400 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7401 true on entry to this function, or if any of the ARGTYPES are
7402 non-canonical.
7404 Returns a canonical argument list, which may be ARGTYPES when the
7405 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7406 true) or would not differ from ARGTYPES. */
7408 static tree
7412 {
7413 tree arg;
7417 {
7419 /* Fail gracefully by stating that the type is structural. */
7425 /* If the argument has a default argument, we consider it
7426 non-canonical even though the type itself is canonical.
7427 That way, different variants of function and method types
7428 with default arguments will all point to the variant with
7429 no defaults as their canonical type. */
7431 }
7437 {
7438 /* Build the canonical list of argument types. */
7443 {
7446 else
7449 canon_argtypes);
7450 }
7456 /* There is a non-canonical type. */
7459 }
7461 /* The canonical argument types are the same as ARGTYPES. */
7463 }
7465 /* Construct, lay out and return
7466 the type of functions returning type VALUE_TYPE
7467 given arguments of types ARG_TYPES.
7468 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7469 are data type nodes for the arguments of the function.
7470 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7471 variable-arguments function with (...) prototype (no named arguments).
7472 If such a type has already been constructed, reuse it. */
7474 tree
7477 {
7478 tree t;
7481 tree canon_argtypes;
7486 {
7489 }
7491 /* Make a node of the sort we want. */
7496 {
7499 }
7501 /* If we already have such a type, use the old one. */
7505 /* Set up the canonical type. */
7515 canon_argtypes);
7520 }
7522 /* Build a function type. The RETURN_TYPE is the type returned by the
7523 function. If VAARGS is set, no void_type_node is appended to the
7524 list. ARGP must be always be terminated be a NULL_TREE. */
7526 static tree
7528 {
7536 {
7541 }
7544 else
7545 {
7549 }
7553 }
7555 /* Build a function type. The RETURN_TYPE is the type returned by the
7556 function. If additional arguments are provided, they are
7557 additional argument types. The list of argument types must always
7558 be terminated by NULL_TREE. */
7560 tree
7562 {
7563 tree args;
7570 }
7572 /* Build a variable argument function type. The RETURN_TYPE is the
7573 type returned by the function. If additional arguments are provided,
7574 they are additional argument types. The list of argument types must
7575 always be terminated by NULL_TREE. */
7577 tree
7579 {
7580 tree args;
7588 }
7590 /* Build a function type. RETURN_TYPE is the type returned by the
7591 function; VAARGS indicates whether the function takes varargs. The
7592 function takes N named arguments, the types of which are provided in
7593 ARG_TYPES. */
7595 static tree
7598 {
7606 }
7608 /* Build a function type. RETURN_TYPE is the type returned by the
7609 function. The function takes N named arguments, the types of which
7610 are provided in ARG_TYPES. */
7612 tree
7614 {
7616 }
7618 /* Build a variable argument function type. RETURN_TYPE is the type
7619 returned by the function. The function takes N named arguments, the
7620 types of which are provided in ARG_TYPES. */
7622 tree
7624 {
7626 }
7628 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7629 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7630 for the method. An implicit additional parameter (of type
7631 pointer-to-BASETYPE) is added to the ARGTYPES. */
7633 tree
7635 tree rettype,
7636 tree argtypes)
7637 {
7638 tree t;
7639 tree ptype;
7641 tree canon_argtypes;
7643 /* Make a node of the sort we want. */
7650 /* The actual arglist for this function includes a "hidden" argument
7651 which is "this". Put it into the list of argument types. */
7655 /* If we already have such a type, use the old one. */
7659 /* Set up the canonical type. */
7660 any_structural_p
7663 any_noncanonical_p
7675 canon_argtypes);
7680 }
7682 /* Construct, lay out and return the type of methods belonging to class
7683 BASETYPE and whose arguments and values are described by TYPE.
7684 If that type exists already, reuse it.
7685 TYPE must be a FUNCTION_TYPE node. */
7687 tree
7689 {
7695 }
7697 /* Construct, lay out and return the type of offsets to a value
7698 of type TYPE, within an object of type BASETYPE.
7699 If a suitable offset type exists already, reuse it. */
7701 tree
7703 {
7704 tree t;
7706 /* Make a node of the sort we want. */
7712 /* If we already have such a type, use the old one. */
7720 {
7729 }
7732 }
7734 /* Create a complex type whose components are COMPONENT_TYPE.
7736 If NAMED is true, the type is given a TYPE_NAME. We do not always
7737 do so because this creates a DECL node and thus make the DECL_UIDs
7738 dependent on the type canonicalization hashtable, which is GC-ed,
7739 so the DECL_UIDs would not be stable wrt garbage collection. */
7741 tree
7743 {
7748 /* Make a node of the sort we want. */
7753 /* If we already have such a type, use the old one. */
7758 {
7759 /* We created a new type. The hash insertion will have laid
7760 out the type. We need to check the canonicalization and
7761 maybe set the name. */
7772 /* We need to create a name, since complex is a fundamental type. */
7774 {
7803 }
7804 }
7807 }
7809 /* If TYPE is a real or complex floating-point type and the target
7810 does not directly support arithmetic on TYPE then return the wider
7811 type to be used for arithmetic on TYPE. Otherwise, return
7812 NULL_TREE. */
7814 tree
7816 {
7817 /* The target can give two different responses to the question of
7818 which excess precision mode it would like depending on whether we
7819 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7821 enum excess_precision_type requested_type
7823 ? EXCESS_PRECISION_TYPE_FAST
7827 enum flt_eval_method target_flt_eval_method
7830 /* The target should not ask for unpredictable float evaluation (though
7831 it might advertise that implicitly the evaluation is unpredictable,
7832 but we don't care about that here, it will have been reported
7833 elsewhere). If it does ask for unpredictable evaluation, we have
7834 nothing to do here. */
7837 /* Nothing to do. The target has asked for all types we know about
7838 to be computed with their native precision and range. */
7842 /* The target will promote this type in a target-dependent way, so excess
7843 precision ought to leave it alone. */
7847 machine_mode float16_type_mode = (float16_type_node
7850 machine_mode bfloat16_type_mode = (bfloat16_type_node
7857 {
7859 {
7862 {
7883 }
7885 }
7887 {
7892 {
7913 }
7915 }
7918 }
7921 }
7922 \f
7923 /* Return OP, stripped of any conversions to wider types as much as is safe.
7924 Converting the value back to OP's type makes a value equivalent to OP.
7926 If FOR_TYPE is nonzero, we return a value which, if converted to
7927 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7929 OP must have integer, real or enumeral type. Pointers are not allowed!
7931 There are some cases where the obvious value we could return
7932 would regenerate to OP if converted to OP's type,
7933 but would not extend like OP to wider types.
7934 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7935 For example, if OP is (unsigned short)(signed char)-1,
7936 we avoid returning (signed char)-1 if FOR_TYPE is int,
7937 even though extending that to an unsigned short would regenerate OP,
7938 since the result of extending (signed char)-1 to (int)
7939 is different from (int) OP. */
7941 tree
7943 {
7944 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7946 unsigned final_prec
7948 int uns
7955 {
7958 /* TYPE_PRECISION on vector types has different meaning
7959 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7960 so avoid them here. */
7967 /* Truncations are many-one so cannot be removed.
7968 Unless we are later going to truncate down even farther. */
7973 /* See what's inside this conversion. If we decide to strip it,
7974 we will set WIN. */
7977 /* If we have not stripped any zero-extensions (uns is 0),
7978 we can strip any kind of extension.
7979 If we have previously stripped a zero-extension,
7980 only zero-extensions can safely be stripped.
7981 Any extension can be stripped if the bits it would produce
7982 are all going to be discarded later by truncating to FOR_TYPE. */
7985 {
7988 /* TYPE_UNSIGNED says whether this is a zero-extension.
7989 Let's avoid computing it if it does not affect WIN
7990 and if UNS will not be needed again. */
7994 {
7997 }
7998 }
7999 }
8001 /* If we finally reach a constant see if it fits in sth smaller and
8002 in that case convert it. */
8004 {
8010 {
8014 }
8015 }
8018 }
8019 \f
8020 /* Return OP or a simpler expression for a narrower value
8021 which can be sign-extended or zero-extended to give back OP.
8022 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8023 or 0 if the value should be sign-extended. */
8025 tree
8027 {
8034 {
8035 do
8049 ret);
8051 }
8053 {
8054 int bitschange
8058 /* Truncations are many-one so cannot be removed. */
8062 /* See what's inside this conversion. If we decide to strip it,
8063 we will set WIN. */
8066 {
8068 /* An extension: the outermost one can be stripped,
8069 but remember whether it is zero or sign extension. */
8072 /* Otherwise, if a sign extension has been stripped,
8073 only sign extensions can now be stripped;
8074 if a zero extension has been stripped, only zero-extensions. */
8078 }
8080 {
8081 /* A change in nominal type can always be stripped, but we must
8082 preserve the unsignedness. */
8087 /* Keep trying to narrow, but don't assign op to win if it
8088 would turn an integral type into something else. */
8091 }
8094 }
8097 /* Since type_for_size always gives an integer type. */
8100 /* Ensure field is laid out already. */
8103 {
8104 unsigned HOST_WIDE_INT innerprec
8110 /* We can get this structure field in a narrower type that fits it,
8111 but the resulting extension to its nominal type (a fullword type)
8112 must satisfy the same conditions as for other extensions.
8114 Do this only for fields that are aligned (not bit-fields),
8115 because when bit-field insns will be used there is no
8116 advantage in doing this. */
8122 {
8126 }
8127 }
8131 }
8132 \f
8133 /* Return true if integer constant C has a value that is permissible
8134 for TYPE, an integral type. */
8136 bool
8138 {
8143 /* Non-standard boolean types can have arbitrary precision but various
8144 transformations assume that they can only take values 0 and +/-1. */
8148 retry:
8152 /* If at least one bound of the type is a constant integer, we can check
8153 ourselves and maybe make a decision. If no such decision is possible, but
8154 this type is a subtype, try checking against that. Otherwise, use
8155 fits_to_tree_p, which checks against the precision.
8157 Compute the status for each possibly constant bound, and return if we see
8158 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8159 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8160 for "constant known to fit". */
8162 /* Check if c >= type_low_bound. */
8164 {
8168 }
8169 else
8172 /* Check if c <= type_high_bound. */
8174 {
8178 }
8179 else
8182 /* If the constant fits both bounds, the result is known. */
8186 /* Perform some generic filtering which may allow making a decision
8187 even if the bounds are not constant. First, negative integers
8188 never fit in unsigned types, */
8192 /* Second, narrower types always fit in wider ones. */
8196 /* Third, unsigned integers with top bit set never fit signed types. */
8198 {
8201 {
8202 /* When a tree_cst is converted to a wide-int, the precision
8203 is taken from the type. However, if the precision of the
8204 mode underneath the type is smaller than that, it is
8205 possible that the value will not fit. The test below
8206 fails if any bit is set between the sign bit of the
8207 underlying mode and the top bit of the type. */
8210 }
8213 }
8215 /* If we haven't been able to decide at this point, there nothing more we
8216 can check ourselves here. Look at the base type if we have one and it
8217 has the same precision. */
8221 {
8224 }
8226 /* Or to fits_to_tree_p, if nothing else. */
8228 }
8230 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8231 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8232 represented (assuming two's-complement arithmetic) within the bit
8233 precision of the type are returned instead. */
8235 void
8237 {
8241 else
8242 {
8245 else
8246 {
8249 }
8250 }
8255 else
8256 {
8259 }
8260 }
8262 /* Return true if VAR is an automatic variable. */
8264 bool
8266 {
8271 }
8273 /* Return true if VAR is an automatic variable defined in function FN. */
8275 bool
8277 {
8281 }
8283 /* Subprogram of following function. Called by walk_tree.
8285 Return *TP if it is an automatic variable or parameter of the
8286 function passed in as DATA. */
8288 static tree
8290 {
8301 }
8303 /* Returns true if T is, contains, or refers to a type with variable
8304 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8305 arguments, but not the return type. If FN is nonzero, only return
8306 true if a modifier of the type or position of FN is a variable or
8307 parameter inside FN.
8309 This concept is more general than that of C99 'variably modified types':
8310 in C99, a struct type is never variably modified because a VLA may not
8311 appear as a structure member. However, in GNU C code like:
8313 struct S { int i[f()]; };
8315 is valid, and other languages may define similar constructs. */
8317 bool
8319 {
8320 tree t;
8322 /* Test if T is either variable (if FN is zero) or an expression containing
8323 a variable in FN. If TYPE isn't gimplified, return true also if
8324 gimplify_one_sizepos would gimplify the expression into a local
8325 variable. */
8326 #define RETURN_TRUE_IF_VAR(T) \
8327 do { tree _t = (T); \
8328 if (_t != NULL_TREE \
8329 && _t != error_mark_node \
8330 && !CONSTANT_CLASS_P (_t) \
8331 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8332 && (!fn \
8333 || (!TYPE_SIZES_GIMPLIFIED (type) \
8334 && (TREE_CODE (_t) != VAR_DECL \
8335 && !CONTAINS_PLACEHOLDER_P (_t))) \
8336 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8337 return true; } while (0)
8342 /* If TYPE itself has variable size, it is variably modified. */
8347 {
8351 /* Ada can have pointer types refering to themselves indirectly. */
8356 {
8359 }
8365 /* If TYPE is a function type, it is variably modified if the
8366 return type is variably modified. */
8376 /* Scalar types are variably modified if their end points
8377 aren't constant. */
8385 /* We can't see if any of the fields are variably-modified by the
8386 definition we normally use, since that would produce infinite
8387 recursion via pointers. */
8388 /* This is variably modified if some field's type is. */
8391 {
8396 /* If the type is a qualified union, then the DECL_QUALIFIER
8397 of fields can also be an expression containing a variable. */
8401 /* If the field is a qualified union, then it's only a container
8402 for what's inside so we look into it. That's necessary in LTO
8403 mode because the sizes of the field tested above have been set
8404 to PLACEHOLDER_EXPRs by free_lang_data. */
8408 }
8412 /* Do not call ourselves to avoid infinite recursion. This is
8413 variably modified if the element type is. */
8420 }
8422 /* The current language may have other cases to check, but in general,
8423 all other types are not variably modified. */
8426 #undef RETURN_TRUE_IF_VAR
8427 }
8429 /* Given a DECL or TYPE, return the scope in which it was declared, or
8430 NULL_TREE if there is no containing scope. */
8432 tree
8434 {
8436 }
8438 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8440 const_tree
8442 {
8444 {
8447 else
8449 }
8451 }
8453 /* Return the innermost context enclosing DECL that is
8454 a FUNCTION_DECL, or zero if none. */
8456 tree
8458 {
8459 tree context;
8464 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8465 where we look up the function at runtime. Such functions always take
8466 a first argument of type 'pointer to real context'.
8468 C++ should really be fixed to use DECL_CONTEXT for the real context,
8469 and use something else for the "virtual context". */
8471 context
8472 = TYPE_MAIN_VARIANT
8474 else
8478 {
8481 else
8483 }
8486 }
8488 /* Return the innermost context enclosing DECL that is
8489 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8490 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8492 tree
8494 {
8499 {
8520 }
8523 }
8525 /* CALL is a CALL_EXPR. Return the declaration for the function
8526 called, or NULL_TREE if the called function cannot be
8527 determined. */
8529 tree
8531 {
8532 tree addr;
8537 /* It's invalid to call this function with anything but a
8538 CALL_EXPR. */
8541 /* The first operand to the CALL is the address of the function
8542 called. */
8545 /* If there is no function, return early. */
8551 /* If this is a readonly function pointer, extract its initial value. */
8557 /* If the address is just `&f' for some function `f', then we know
8558 that `f' is being called. */
8563 /* We couldn't figure out what was being called. */
8565 }
8567 /* Return true when STMTs arguments and return value match those of FNDECL,
8568 a decl of a builtin function. */
8570 static bool
8572 {
8590 {
8591 /* Variadic args follow. */
8599 {
8600 /* For pointer arguments be more forgiving, e.g. due to
8601 FILE * vs. fileptr_type_node, or say char * vs. const char *
8602 differences etc. */
8608 /* char/short integral arguments are promoted to int
8609 by several frontends if targetm.calls.promote_prototypes
8610 is true. Allow such promotion too. */
8616 && (gimple_form
8623 }
8624 }
8628 }
8630 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8631 return the associated function code, otherwise return CFN_LAST. */
8633 combined_fn
8635 {
8636 /* It's invalid to call this function with anything but a CALL_EXPR. */
8649 }
8651 /* Comparator of indices based on tree_node_counts. */
8653 static int
8655 {
8660 }
8662 /* Comparator of indices based on tree_code_counts. */
8664 static int
8666 {
8671 }
8673 #define TREE_MEM_USAGE_SPACES 40
8675 /* Print debugging information about tree nodes generated during the compile,
8676 and any language-specific information. */
8678 void
8680 {
8682 {
8688 {
8695 {
8702 }
8707 }
8709 {
8719 {
8724 }
8731 }
8732 }
8733 else
8740 }
8741 \f
8744 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8746 unsigned
8748 {
8749 /* This relies on the raw feedback's top 4 bits being zero. */
8750 #define FEEDBACK(X) ((X) * 0x04c11db7)
8751 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8752 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8754 {
8759 };
8760 #undef FEEDBACK
8761 #undef SYNDROME
8765 {
8769 }
8772 }
8774 /* Generate a crc32 of a string. */
8776 unsigned
8778 {
8779 do
8783 }
8785 /* P is a string that will be used in a symbol. Mask out any characters
8786 that are not valid in that context. */
8788 void
8790 {
8795 #endif
8798 #endif
8799 ))
8801 }
8805 /* Create a unique anonymous identifier. The identifier is still a
8806 valid assembly label. */
8808 tree
8810 {
8812 #if !defined (NO_DOT_IN_LABEL)
8813 "."
8814 #elif !defined (NO_DOLLAR_IN_LABEL)
8815 "$"
8816 #else
8817 "_"
8818 #endif
8829 }
8831 /* Generate a name for a special-purpose function.
8832 The generated name may need to be unique across the whole link.
8833 Changes to this function may also require corresponding changes to
8834 xstrdup_mask_random.
8835 TYPE is some string to identify the purpose of this function to the
8836 linker or collect2; it must start with an uppercase letter,
8837 one of:
8838 I - for constructors
8839 D - for destructors
8840 N - for C++ anonymous namespaces
8841 F - for DWARF unwind frame information. */
8843 tree
8845 {
8850 /* If we already have a name we know to be unique, just use that. */
8853 /* If the target is handling the constructors/destructors, they
8854 will be local to this file and the name is only necessary for
8855 debugging purposes.
8856 We also assign sub_I and sub_D sufixes to constructors called from
8857 the global static constructors. These are always local. */
8861 {
8865 /* Just use the file's basename, because the full pathname
8866 might be quite long. */
8868 }
8869 else
8870 {
8871 /* Otherwise, the name must be unique across the entire link.
8872 We don't have anything that we know to be unique to this translation
8873 unit, so use what we do have and throw in some randomness. */
8891 }
8897 /* Set up the name of the file-level functions we may need.
8898 Use a global object (which is already required to be unique over
8899 the program) rather than the file name (which imposes extra
8900 constraints). */
8904 }
8905 \f
8906 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8908 /* Complain that the tree code of NODE does not match the expected 0
8909 terminated list of trailing codes. The trailing code list can be
8910 empty, for a more vague error message. FILE, LINE, and FUNCTION
8911 are of the caller. */
8913 void
8916 {
8927 {
8934 {
8941 }
8943 }
8944 else
8950 }
8952 /* Complain that the tree code of NODE does match the expected 0
8953 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8954 the caller. */
8956 void
8959 {
8973 {
8975 {
8978 }
8981 }
8987 }
8989 /* Similar to tree_check_failed, except that we check for a class of tree
8990 code, given in CL. */
8992 void
8995 {
8996 internal_error
9001 }
9003 /* Similar to tree_check_failed, except that instead of specifying a
9004 dozen codes, use the knowledge that they're all sequential. */
9006 void
9010 {
9023 {
9030 }
9035 }
9038 /* Similar to tree_check_failed, except that we check that a tree does
9039 not have the specified code, given in CL. */
9041 void
9044 {
9045 internal_error
9050 }
9053 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9055 void
9058 {
9064 }
9067 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9069 void
9073 {
9086 {
9093 }
9098 }
9101 #undef DEFTREESTRUCT
9102 #define DEFTREESTRUCT(VAL, NAME) NAME,
9106 };
9107 #undef DEFTREESTRUCT
9109 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9111 /* Similar to tree_class_check_failed, except that we check for
9112 whether CODE contains the tree structure identified by EN. */
9114 void
9119 {
9120 internal_error
9124 }
9127 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9128 (dynamically sized) vector. */
9130 void
9133 {
9134 internal_error
9138 }
9140 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9141 (dynamically sized) vector. */
9143 void
9146 {
9147 internal_error
9150 }
9152 /* Similar to above, except that the check is for the bounds of the operand
9153 vector of an expression node EXP. */
9155 void
9158 {
9160 internal_error
9164 }
9166 /* Similar to above, except that the check is for the number of
9167 operands of an OMP_CLAUSE node. */
9169 void
9172 {
9173 internal_error
9178 }
9180 \f
9181 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9182 and mapped to the machine mode MODE. Initialize its fields and build
9183 the information necessary for debugging output. */
9185 static tree
9187 {
9188 tree t;
9209 /* We have built a main variant, based on the main variant of the
9210 inner type. Use it to build the variant we return. */
9218 }
9220 static tree
9222 {
9245 else
9247 }
9249 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9251 static tree
9253 {
9255 {
9267 }
9268 else
9269 {
9281 }
9284 }
9286 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9288 static tree
9290 {
9292 {
9304 }
9305 else
9306 {
9318 }
9321 }
9324 /* Create an atomic variant node for TYPE. This routine is called
9325 during initialization of data types to create the 5 basic atomic
9326 types. The generic build_variant_type function requires these to
9327 already be set up in order to function properly, so cannot be
9328 called from there. If ALIGN is non-zero, then ensure alignment is
9329 overridden to this value. */
9331 static tree
9333 {
9334 tree t;
9336 /* Make sure its not already registered. */
9347 }
9349 /* Information about the _FloatN and _FloatNx types. This must be in
9350 the same order as the corresponding TI_* enum values. */
9352 {
9360 };
9363 /* Create nodes for all integer types (and error_mark_node) using the sizes
9364 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9366 void
9368 {
9376 /* Define both `signed char' and `unsigned char'. */
9382 /* Define `char', which is like either `signed char' or `unsigned char'
9383 but not the same as either. */
9384 char_type_node
9385 = (signed_char
9400 {
9405 {
9408 }
9409 }
9411 /* Define a boolean type. This type only represents boolean values but
9412 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9418 /* Define what type to use for size_t. */
9427 else
9428 {
9434 {
9441 {
9443 }
9444 }
9447 }
9449 /* Define what type to use for ptrdiff_t. */
9458 else
9459 {
9463 {
9471 }
9474 }
9476 /* Fill in the rest of the sized types. Reuse existing type nodes
9477 when possible. */
9490 /* Don't call build_qualified type for atomics. That routine does
9491 special processing for atomics, and until they are initialized
9492 it's better not to make that call.
9494 Check to see if there is a target override for atomic types. */
9511 /* Define these next since types below may used them. */
9529 /* We are not going to have real types in C with less than byte alignment,
9530 so we might as well not have any types that claim to have it. */
9543 const_ptr_type_node
9563 {
9566 scalar_float_mode mode;
9570 /* Work around the rs6000 KFmode having precision 113 not
9571 128. */
9583 }
9585 #ifdef HAVE_BFmode
9589 {
9594 }
9595 #endif
9602 /* Fixed size integer types. */
9609 /* Decimal float types. */
9611 {
9626 }
9635 {
9639 }
9641 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9642 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9643 sat_ ## KIND ## _type_node = \
9644 make_sat_signed_ ## KIND ## _type (SIZE); \
9645 sat_unsigned_ ## KIND ## _type_node = \
9646 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9647 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9648 unsigned_ ## KIND ## _type_node = \
9649 make_unsigned_ ## KIND ## _type (SIZE);
9651 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9652 sat_ ## WIDTH ## KIND ## _type_node = \
9653 make_sat_signed_ ## KIND ## _type (SIZE); \
9654 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9655 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9656 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9657 unsigned_ ## WIDTH ## KIND ## _type_node = \
9658 make_unsigned_ ## KIND ## _type (SIZE);
9660 /* Make fixed-point type nodes based on four different widths. */
9661 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9662 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9663 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9664 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9665 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9667 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9668 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9669 NAME ## _type_node = \
9670 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9671 u ## NAME ## _type_node = \
9672 make_or_reuse_unsigned_ ## KIND ## _type \
9673 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9674 sat_ ## NAME ## _type_node = \
9675 make_or_reuse_sat_signed_ ## KIND ## _type \
9676 (GET_MODE_BITSIZE (MODE ## mode)); \
9677 sat_u ## NAME ## _type_node = \
9678 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9679 (GET_MODE_BITSIZE (U ## MODE ## mode));
9681 /* Fixed-point type and mode nodes. */
9694 {
9697 /* Many back-ends define record types without setting TYPE_NAME.
9698 If we copied the record type here, we'd keep the original
9699 record type without a name. This breaks name mangling. So,
9700 don't copy record types and let c_common_nodes_and_builtins()
9701 declare the type to be __builtin_va_list. */
9706 }
9708 /* SCEV analyzer global shared trees. */
9713 }
9715 /* Modify DECL for given flags.
9716 TM_PURE attribute is set only on types, so the function will modify
9717 DECL's type when ECF_TM_PURE is used. */
9719 void
9721 {
9755 /* Looping const or pure is implied by noreturn.
9756 There is currently no way to declare looping const or looping pure alone. */
9759 }
9762 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9764 static void
9767 {
9768 tree decl;
9775 }
9777 /* Call this function after instantiating all builtins that the language
9778 front end cares about. This will build the rest of the builtins
9779 and internal functions that are relied upon by the tree optimizers and
9780 the middle-end. */
9782 void
9784 {
9789 {
9791 ptr_type_node,
9792 ptr_type_node,
9793 integer_type_node,
9794 NULL_TREE);
9796 BUILT_IN_CLEAR_PADDING,
9799 }
9805 {
9809 BUILT_IN_UNREACHABLE,
9815 BUILT_IN_UNREACHABLE_TRAP,
9827 }
9831 {
9842 }
9845 {
9848 NULL_TREE);
9851 }
9854 {
9860 }
9862 /* If we're checking the stack, `alloca' can throw. */
9863 const int alloca_flags
9867 {
9872 }
9877 BUILT_IN_ALLOCA_WITH_ALIGN,
9879 alloca_flags);
9884 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9886 alloca_flags);
9892 BUILT_IN_INIT_TRAMPOLINE,
9895 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9899 BUILT_IN_INIT_DESCRIPTOR,
9904 BUILT_IN_ADJUST_TRAMPOLINE,
9908 BUILT_IN_ADJUST_DESCRIPTOR,
9916 BUILT_IN_CLEAR_CACHE,
9918 ECF_NOTHROW);
9921 BUILT_IN_NONLOCAL_GOTO,
9928 BUILT_IN_SETJMP_SETUP,
9933 BUILT_IN_SETJMP_RECEIVER,
9942 BUILT_IN_STACK_RESTORE,
9947 NULL_TREE);
9960 /* If there's a possibility that we might use the ARM EABI, build the
9961 alternate __cxa_end_cleanup node used to resume from C++. */
9963 {
9966 BUILT_IN_CXA_END_CLEANUP,
9969 }
9973 BUILT_IN_UNWIND_RESUME,
9980 {
9982 NULL_TREE);
9984 BUILT_IN_RETURN_ADDRESS,
9986 ECF_NOTHROW);
9987 }
9991 {
9996 BUILT_IN_PROFILE_FUNC_ENTER,
10000 BUILT_IN_PROFILE_FUNC_EXIT,
10002 }
10004 /* The exception object and filter values from the runtime. The argument
10005 must be zero before exception lowering, i.e. from the front end. After
10006 exception lowering, it will be the region number for the exception
10007 landing pad. These functions are PURE instead of CONST to prevent
10008 them from being hoisted past the exception edge that will initialize
10009 its value in the landing pad. */
10013 /* Only use TM_PURE if we have TM language support. */
10026 NULL_TREE);
10028 BUILT_IN_EH_COPY_VALUES,
10031 /* Complex multiplication and division. These are handled as builtins
10032 rather than optabs because emit_library_call_value doesn't support
10033 complex. Further, we can do slightly better with folding these
10034 beasties if the real and complex parts of the arguments are separate. */
10035 {
10039 {
10066 /* For -ftrapping-math these should throw from a former
10067 -fnon-call-exception stmt. */
10069 NULL);
10075 NULL);
10079 }
10080 }
10083 }
10085 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10086 better way.
10088 If we requested a pointer to a vector, build up the pointers that
10089 we stripped off while looking for the inner type. Similarly for
10090 return values from functions.
10092 The argument TYPE is the top of the chain, and BOTTOM is the
10093 new type which we will point to. */
10095 tree
10097 {
10101 {
10105 }
10107 {
10111 }
10113 {
10116 }
10118 {
10122 }
10124 {
10126 /* The build_method_type_directly() routine prepends 'this' to argument list,
10127 so we must compensate by getting rid of it. */
10128 outer
10129 = build_method_type_directly
10131 inner,
10133 }
10135 {
10138 }
10139 else
10144 }
10146 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10147 the inner type. */
10148 tree
10150 {
10151 poly_int64 nunits;
10155 {
10167 /* Check that there are no leftover bits. */
10175 }
10178 }
10180 /* Similarly, but takes the inner type and number of units, which must be
10181 a power of two. */
10183 tree
10185 {
10187 }
10189 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10191 tree
10193 {
10198 {
10201 }
10202 else
10208 }
10210 /* Build a vector type that holds one boolean result for each element of
10211 vector type VECTYPE. The public interface for this operation is
10212 truth_type_for. */
10214 static tree
10216 {
10220 machine_mode mask_mode;
10230 }
10232 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10233 set. */
10235 tree
10237 {
10239 tree cand;
10240 /* We always build the non-opaque variant before the opaque one,
10241 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10247 /* Othewise build a variant type and make sure to queue it after
10248 the non-opaque type. */
10256 }
10258 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10260 static poly_wide_int
10262 {
10263 /* First handle elements that are directly encoded. */
10268 /* Identify the pattern that contains element I and work out the index of
10269 the last encoded element for that pattern. */
10275 /* If there are no steps, the final encoded value is the right one. */
10279 /* Otherwise work out the value from the last two encoded elements. */
10284 }
10286 /* Return the value of element I of VECTOR_CST T. */
10288 tree
10290 {
10291 /* First handle elements that are directly encoded. */
10296 /* If there are no steps, the final encoded value is the right one. */
10298 {
10299 /* Identify the pattern that contains element I and work out the index of
10300 the last encoded element for that pattern. */
10305 }
10307 /* Otherwise work out the value from the last two encoded elements. */
10310 }
10312 /* Given an initializer INIT, return TRUE if INIT is zero or some
10313 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10314 null, set *NONZERO if and only if INIT is known not to be all
10315 zeros. The combination of return value of false and *NONZERO
10316 false implies that INIT may but need not be all zeros. Other
10317 combinations indicate definitive answers. */
10319 bool
10321 {
10326 /* Conservatively clear NONZERO and set it only if INIT is definitely
10327 not all zero. */
10335 {
10344 /* ??? Note that this is not correct for C4X float formats. There,
10345 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10346 negative exponent. */
10381 {
10386 tree elt;
10393 }
10396 {
10411 }
10412 /* Fall through. */
10415 {
10423 /* We need to loop through all elements to handle cases like
10424 "\0" and "\0foobar". */
10427 {
10430 }
10433 }
10437 }
10438 }
10440 /* Return true if EXPR is an initializer expression in which every element
10441 is a constant that is numerically equal to 0 or 1. The elements do not
10442 need to be equal to each other. */
10444 bool
10446 {
10450 {
10458 {
10465 {
10469 }
10472 }
10476 }
10477 }
10479 /* Check if vector VEC consists of all the equal elements and
10480 that the number of elements corresponds to the type of VEC.
10481 The function returns first element of the vector
10482 or NULL_TREE if the vector is not uniform. */
10483 tree
10485 {
10498 {
10502 }
10506 {
10510 {
10512 {
10515 }
10518 }
10525 }
10528 }
10530 /* If the argument is INTEGER_CST, return it. If the argument is vector
10531 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10532 return NULL_TREE.
10533 Look through location wrappers. */
10535 tree
10537 {
10544 {
10548 }
10551 }
10553 /* Checks to see if T is a constant or a constant vector and if each element E
10554 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10556 tree
10558 {
10568 tree cst;
10572 tree_vector_builder builder;
10575 else
10576 {
10582 }
10586 do
10587 {
10602 }
10606 }
10608 /* If VECTOR_CST T has a single nonzero element, return the index of that
10609 element, otherwise return -1. */
10611 int
10613 {
10619 {
10622 }
10623 else
10628 {
10631 {
10635 }
10636 }
10638 }
10640 /* Build an empty statement at location LOC. */
10642 tree
10644 {
10648 }
10651 /* Build an OMP clause with code CODE. LOC is the location of the
10652 clause. */
10654 tree
10656 {
10657 tree t;
10672 }
10674 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10675 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10676 Except for the CODE and operand count field, other storage for the
10677 object is initialized to zeros. */
10679 tree
10681 {
10682 tree t;
10694 /* Can't use TREE_OPERAND to store the length because if checking is
10695 enabled, it will try to check the length before we store it. :-P */
10699 }
10701 /* Helper function for build_call_* functions; build a CALL_EXPR with
10702 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10703 the argument slots. */
10705 static tree
10707 {
10708 tree t;
10716 }
10718 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10719 FN and a null static chain slot. NARGS is the number of call arguments
10720 which are specified as "..." arguments. */
10722 tree
10724 {
10725 tree ret;
10731 }
10733 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10734 FN and a null static chain slot. NARGS is the number of call arguments
10735 which are specified as a va_list ARGS. */
10737 tree
10739 {
10740 tree t;
10748 }
10750 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10751 FN and a null static chain slot. NARGS is the number of call arguments
10752 which are specified as a tree array ARGS. */
10754 tree
10757 {
10758 tree t;
10767 }
10769 /* Like build_call_array, but takes a vec. */
10771 tree
10773 {
10782 }
10784 /* Conveniently construct a function call expression. FNDECL names the
10785 function to be called and N arguments are passed in the array
10786 ARGARRAY. */
10788 tree
10790 {
10795 }
10797 /* Conveniently construct a function call expression. FNDECL names the
10798 function to be called and the arguments are passed in the vector
10799 VEC. */
10801 tree
10803 {
10806 }
10809 /* Conveniently construct a function call expression. FNDECL names the
10810 function to be called, N is the number of arguments, and the "..."
10811 parameters are the argument expressions. */
10813 tree
10815 {
10825 }
10827 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10828 varargs macros aren't supported by all bootstrap compilers. */
10830 tree
10832 {
10842 }
10844 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10845 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10846 It will get gimplified later into an ordinary internal function. */
10848 tree
10851 {
10859 }
10861 /* Build internal call expression. This is just like CALL_EXPR, except
10862 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10863 internal function. */
10865 tree
10868 {
10878 }
10880 /* Return a function call to FN, if the target is guaranteed to support it,
10881 or null otherwise.
10883 N is the number of arguments, passed in the "...", and TYPE is the
10884 type of the return value. */
10886 tree
10889 {
10899 {
10902 {
10905 OPTIMIZE_FOR_BOTH))
10907 }
10909 }
10910 else
10911 {
10916 }
10917 }
10919 /* Return a function call to the appropriate builtin alloca variant.
10921 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10922 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10923 bound for SIZE in case it is not a fixed value. */
10925 tree
10927 {
10929 {
10931 return
10933 }
10935 {
10938 }
10939 else
10940 {
10943 }
10944 }
10946 /* The built-in decl to use to mark code points believed to be unreachable.
10947 Typically __builtin_unreachable, but __builtin_trap if
10948 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10949 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10950 appropriate ubsan function. When building a call directly, use
10951 {gimple_},build_builtin_unreachable instead. */
10953 tree
10955 {
10962 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10963 in the sanopt pass. */
10966 }
10968 /* Build a call to __builtin_unreachable, possibly rewritten by
10969 -fsanitize=unreachable. Use this rather than the above when practical. */
10971 tree
10973 {
10977 }
10979 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10980 if SIZE == -1) and return a tree node representing char* pointer to
10981 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10982 the STRING_CST value is the LEN bytes at STR (the representation
10983 of the string, which may be wide). Otherwise it's all zeros. */
10985 tree
10989 {
10991 /* Set the maximum valid index based on the string length or SIZE. */
10992 unsigned HOST_WIDE_INT maxidx
11008 }
11012 /* Return true if T (assumed to be a DECL) must be assigned a memory
11013 location. */
11015 bool
11017 {
11023 }
11025 /* Return value of a constant X and sign-extend it. */
11027 HOST_WIDE_INT
11029 {
11033 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11037 {
11041 else
11043 }
11046 }
11048 /* If TYPE is an integral or pointer type, return an integer type with
11049 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11050 if TYPE is already an integer type of signedness UNSIGNEDP.
11051 If TYPE is a floating-point type, return an integer type with the same
11052 bitsize and with the signedness given by UNSIGNEDP; this is useful
11053 when doing bit-level operations on a floating-point value. */
11055 tree
11057 {
11062 {
11069 machine_mode new_mode;
11074 }
11077 {
11085 }
11094 else
11100 }
11102 /* If TYPE is an integral or pointer type, return an integer type with
11103 the same precision which is unsigned, or itself if TYPE is already an
11104 unsigned integer type. If TYPE is a floating-point type, return an
11105 unsigned integer type with the same bitsize as TYPE. */
11107 tree
11109 {
11111 }
11113 /* If TYPE is an integral or pointer type, return an integer type with
11114 the same precision which is signed, or itself if TYPE is already a
11115 signed integer type. If TYPE is a floating-point type, return a
11116 signed integer type with the same bitsize as TYPE. */
11118 tree
11120 {
11122 }
11124 /* - For VECTOR_TYPEs:
11125 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11126 - The number of elements must match (known_eq).
11127 - targetm.vectorize.get_mask_mode exists, and exactly
11128 the same mode as the truth type.
11129 - Otherwise, the truth type must be a BOOLEAN_TYPE
11130 or useless_type_conversion_p to BOOLEAN_TYPE. */
11131 bool
11133 {
11136 machine_mode tmask_mode;
11139 {
11148 }
11151 }
11153 /* If TYPE is a vector type, return a signed integer vector type with the
11154 same width and number of subparts. Otherwise return boolean_type_node. */
11156 tree
11158 {
11160 {
11164 }
11165 else
11167 }
11169 /* Returns the largest value obtainable by casting something in INNER type to
11170 OUTER type. */
11172 tree
11174 {
11180 /* Compute a unique number for every combination. */
11185 /* Determine the exponent to use. */
11187 {
11190 /* oprec <= iprec, outer: signed, inner: don't care. */
11195 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11199 /* oprec > iprec, outer: signed, inner: signed. */
11203 /* oprec > iprec, outer: signed, inner: unsigned. */
11207 /* oprec > iprec, outer: unsigned, inner: signed. */
11211 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11216 }
11220 }
11222 /* Returns the smallest value obtainable by casting something in INNER type to
11223 OUTER type. */
11225 tree
11227 {
11231 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11232 and obtain 0. */
11234 /* If we are widening something of an unsigned type, OUTER type
11235 contains all values of INNER type. In particular, both INNER
11236 and OUTER types have zero in common. */
11239 else
11240 {
11241 /* If we are widening a signed type to another signed type, we
11242 want to obtain -2^^(iprec-1). If we are keeping the
11243 precision or narrowing to a signed type, we want to obtain
11244 -2^(oprec-1). */
11249 }
11250 }
11252 /* Return true if two operands that are suitable for PHI nodes are
11253 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11254 SSA_NAME or invariant. Note that this is strictly an optimization.
11255 That is, callers of this function can directly call operand_equal_p
11256 and get the same result, only slower. */
11258 bool
11260 {
11266 }
11268 /* Returns number of zeros at the end of binary representation of X. */
11270 tree
11272 {
11274 }
11277 #define WALK_SUBTREE(NODE) \
11278 do \
11279 { \
11280 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11281 if (result) \
11282 return result; \
11283 } \
11284 while (0)
11286 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11287 be walked whenever a type is seen in the tree. Rest of operands and return
11288 value are as for walk_tree. */
11290 static tree
11293 {
11297 {
11301 /* We have to worry about mutually recursive pointers. These can't
11302 be written in C. They can in Ada. It's pathological, but
11303 there's an ACATS test (c38102a) that checks it. Deal with this
11304 by checking if we're pointing to another pointer, that one
11305 points to another pointer, that one does too, and we have no htab.
11306 If so, get a hash table. We check three levels deep to avoid
11307 the cost of the hash table if we don't need one. */
11312 {
11319 }
11321 /* fall through */
11330 /* Fall through. */
11334 {
11335 tree arg;
11337 /* We never want to walk into default arguments. */
11340 }
11344 /* Don't follow this nodes's type if a pointer for fear that
11345 we'll have infinite recursion. If we have a PSET, then we
11346 need not fear. */
11361 }
11364 }
11366 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11367 called with the DATA and the address of each sub-tree. If FUNC returns a
11368 non-NULL value, the traversal is stopped, and the value returned by FUNC
11369 is returned. If PSET is non-NULL it is used to record the nodes visited,
11370 and to avoid visiting a node more than once. */
11372 tree
11375 {
11376 #define WALK_SUBTREE_TAIL(NODE) \
11377 do \
11378 { \
11379 tp = & (NODE); \
11380 goto tail_recurse; \
11381 } \
11382 while (0)
11384 tail_recurse:
11385 /* Skip empty subtrees. */
11389 /* Don't walk the same tree twice, if the user has requested
11390 that we avoid doing so. */
11394 /* Call the function. */
11398 /* If we found something, return it. */
11405 /* Even if we didn't, FUNC may have decided that there was nothing
11406 interesting below this point in the tree. */
11408 {
11409 /* But we still need to check our siblings. */
11414 else
11416 }
11419 {
11423 }
11426 {
11438 /* None of these have subtrees other than those already walked
11439 above. */
11447 {
11453 /* Walk all elements but the last. */
11457 /* Now walk the last one as a tail call. */
11459 }
11462 {
11466 /* Walk all elements but the last. */
11469 /* Now walk the last one as a tail call. */
11471 }
11478 {
11483 idx++)
11485 }
11492 {
11493 tree decl;
11495 {
11496 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11497 into declarations that are just mentioned, rather than
11498 declared; they don't really belong to this part of the tree.
11499 And, we can see cycles: the initializer for a declaration
11500 can refer to the declaration itself. */
11504 }
11506 }
11509 {
11510 tree_stmt_iterator i;
11513 }
11517 {
11522 }
11525 {
11528 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11529 But, we only want to walk once. */
11534 }
11537 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11538 defining. We only want to walk into these fields of a type in this
11539 case and not in the general case of a mere reference to the type.
11541 The criterion is as follows: if the field can be an expression, it
11542 must be walked only here. This should be in keeping with the fields
11543 that are directly gimplified in gimplify_type_sizes in order for the
11544 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11545 variable-sized types.
11547 Note that DECLs get walked as part of processing the BIND_EXPR. */
11549 {
11550 /* Call the function for the decl so e.g. copy_tree_body_r can
11551 replace it with the remapped one. */
11560 /* Call the function for the type. See if it returns anything or
11561 doesn't want us to continue. If we are to continue, walk both
11562 the normal fields and those for the declaration case. */
11569 /* But do not walk a pointed-to type since it may itself need to
11570 be walked in the declaration case if it isn't anonymous. */
11572 {
11576 }
11578 /* If this is a record type, also walk the fields. */
11580 {
11581 tree field;
11585 {
11586 /* We'd like to look at the type of the field, but we can
11587 easily get infinite recursion. So assume it's pointed
11588 to elsewhere in the tree. Also, ignore things that
11589 aren't fields. */
11598 }
11599 }
11601 /* Same for scalar types. */
11607 {
11610 }
11614 }
11615 /* FALLTHRU */
11619 {
11622 /* Walk over all the sub-trees of this operand. */
11625 /* Go through the subtrees. We need to do this in forward order so
11626 that the scope of a FOR_EXPR is handled properly. */
11628 {
11632 }
11633 }
11634 /* If this is a type, walk the needed fields in the type. */
11638 }
11640 /* We didn't find what we were looking for. */
11643 #undef WALK_SUBTREE_TAIL
11644 }
11645 #undef WALK_SUBTREE
11647 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11649 tree
11651 walk_tree_lh lh)
11652 {
11653 tree result;
11658 }
11661 tree
11663 {
11670 }
11672 void
11674 {
11678 {
11680 }
11681 else
11683 }
11685 /* Create a nameless artificial label and put it in the current
11686 function context. The label has a location of LOC. Returns the
11687 newly created label. */
11689 tree
11691 {
11699 }
11701 /* Given a tree, try to return a useful variable name that we can use
11702 to prefix a temporary that is being assigned the value of the tree.
11703 I.E. given <temp> = &A, return A. */
11707 {
11708 tree stripped_decl;
11715 {
11720 }
11721 else
11722 {
11724 {
11729 }
11730 }
11731 }
11733 /* Return true if TYPE has a variable argument list. */
11735 bool
11737 {
11738 function_args_iterator args_iter;
11748 {
11750 }
11753 }
11755 /* Return true if TYPE has a prototype. */
11757 bool
11759 {
11760 tree t;
11769 }
11771 /* If BLOCK is inlined from an __attribute__((__artificial__))
11772 routine, return pointer to location from where it has been
11773 called. */
11774 location_t *
11776 {
11781 {
11784 {
11785 /* If AO is an artificial inline, point RET to the
11786 call site locus at which it has been inlined and continue
11787 the loop, in case AO's caller is also an artificial
11788 inline. */
11792 else
11794 }
11799 }
11801 }
11804 /* If EXP is inlined from an __attribute__((__artificial__))
11805 function, return the location of the original call expression. */
11807 location_t
11809 {
11814 else
11816 }
11818 /* Return the location into which EXP has been inlined. Analogous
11819 to tree_nonartificial_location() above but not limited to artificial
11820 functions declared inline. If SYSTEM_HEADER is true, return
11821 the macro expansion point of the location if it's in a system header */
11823 location_t
11825 {
11832 {
11840 }
11843 {
11846 /* Only consider macro expansion when the block traversal failed
11847 to find a location. Otherwise it's not relevant. */
11849 }
11852 }
11854 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11855 nodes. */
11857 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11859 hashval_t
11861 {
11868 else
11870 }
11872 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11873 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11874 same. */
11876 bool
11878 {
11891 else
11893 }
11895 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11897 tree
11900 {
11901 tree t;
11903 /* Use the cache of optimization nodes. */
11911 {
11912 /* Insert this one into the hash table. */
11916 /* Make a new node for next time round. */
11918 }
11921 }
11923 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11925 tree
11928 {
11929 tree t;
11931 /* Use the cache of optimization nodes. */
11939 {
11940 /* Insert this one into the hash table. */
11944 /* Make a new node for next time round. */
11946 }
11949 }
11951 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11952 so that they aren't saved during PCH writing. */
11954 void
11956 {
11961 }
11963 /* Determine the "ultimate origin" of a block. */
11965 tree
11967 {
11972 else
11973 {
11978 }
11979 }
11981 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11982 no instruction. */
11984 bool
11986 {
11987 /* Do not strip casts into or out of differing address spaces. */
11990 {
11995 }
11998 {
11999 /* We already know that outer_type is not a pointer with
12000 a non-generic address space. */
12002 }
12004 /* Use precision rather then machine mode when we can, which gives
12005 the correct answer even for submode (bit-field) types. */
12014 /* Otherwise fall back on comparing machine modes (e.g. for
12015 aggregate types, floats). */
12017 }
12019 /* Return true iff conversion in EXP generates no instruction. Mark
12020 it inline so that we fully inline into the stripping functions even
12021 though we have two uses of this function. */
12025 {
12040 }
12042 /* Return true iff conversion in EXP generates no instruction. Don't
12043 consider conversions changing the signedness. */
12045 static bool
12047 {
12058 }
12060 /* Strip conversions from EXP according to tree_nop_conversion and
12061 return the resulting expression. */
12063 tree
12065 {
12069 }
12071 /* Strip conversions from EXP according to tree_sign_nop_conversion
12072 and return the resulting expression. */
12074 tree
12076 {
12080 }
12082 /* Avoid any floating point extensions from EXP. */
12083 tree
12085 {
12088 /* For floating point constant look up the narrowest type that can hold
12089 it properly and handle it like (type)(narrowest_type)constant.
12090 This way we can optimize for instance a=a*2.0 where "a" is float
12091 but 2.0 is double constant. */
12093 {
12094 REAL_VALUE_TYPE orig;
12107 }
12126 }
12128 /* Strip out all handled components that produce invariant
12129 offsets. */
12131 const_tree
12133 {
12135 {
12137 {
12152 }
12154 }
12157 }
12159 /* Strip handled components with zero offset from OP. */
12161 tree
12163 {
12169 }
12173 /* Return the GCC personality function decl. */
12175 tree
12177 {
12181 }
12183 /* TARGET is a call target of GIMPLE call statement
12184 (obtained by gimple_call_fn). Return true if it is
12185 OBJ_TYPE_REF representing an virtual call of C++ method.
12186 (As opposed to OBJ_TYPE_REF representing objc calls
12187 through a cast where middle-end devirtualization machinery
12188 can't apply.) FOR_DUMP_P is true when being called from
12189 the dump routines. */
12191 bool
12193 {
12202 /* If we do not have BINFO associated, it means that type was built
12203 without devirtualization enabled. Do not consider this a virtual
12204 call. */
12208 }
12210 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12212 static tree
12214 {
12225 }
12227 /* Try to find a base info of BINFO that would have its field decl at offset
12228 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12229 found, return, otherwise return NULL_TREE. */
12231 tree
12233 {
12237 {
12239 tree fld;
12248 {
12256 }
12260 /* Offset 0 indicates the primary base, whose vtable contents are
12261 represented in the binfo for the derived class. */
12263 {
12265 /* Offsets in BINFO are in bytes relative to the whole structure
12266 while POS is in bits relative to the containing field. */
12273 {
12276 }
12279 else
12281 binfo_offset);
12282 }
12286 }
12287 }
12289 /* PR 84195: Replace control characters in "unescaped" with their
12290 escaped equivalents. Allow newlines if -fmessage-length has
12291 been set to a non-zero value. This is done here, rather than
12292 where the attribute is recorded as the message length can
12293 change between these two locations. */
12295 void
12297 {
12315 {
12319 {
12323 }
12326 {
12328 {
12329 /* We only allocate space for a new string if we
12330 actually encounter a control character that
12331 needs replacing. */
12335 }
12340 {
12349 }
12350 }
12353 }
12356 {
12360 }
12361 }
12363 /* Warn about a use of an identifier which was marked deprecated. Returns
12364 whether a warning was given. */
12366 bool
12368 {
12369 escaped_string msg;
12375 {
12379 {
12385 {
12388 }
12389 }
12390 }
12400 {
12401 auto_diagnostic_group d;
12405 else
12410 }
12412 {
12417 {
12423 }
12425 auto_diagnostic_group d;
12427 {
12431 else
12434 }
12435 else
12436 {
12440 else
12443 }
12447 }
12450 }
12452 /* Error out with an identifier which was marked 'unavailable'. */
12453 void
12455 {
12456 escaped_string msg;
12462 {
12466 {
12471 }
12472 }
12481 {
12482 auto_diagnostic_group d;
12485 else
12488 }
12490 {
12495 {
12501 }
12503 auto_diagnostic_group d;
12505 {
12508 else
12510 }
12511 else
12512 {
12515 else
12517 }
12521 }
12522 }
12524 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12525 somewhere in it. */
12527 bool
12529 {
12531 {
12536 }
12539 }
12541 /* Try to determine whether a TRY_CATCH expression can fall through.
12542 This is a subroutine of block_may_fallthru. */
12544 static bool
12546 {
12547 tree_stmt_iterator i;
12549 /* If the TRY block can fall through, the whole TRY_CATCH can
12550 fall through. */
12556 {
12558 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12559 catch expression and a body. The whole TRY_CATCH may fall
12560 through iff any of the catch bodies falls through. */
12562 {
12565 }
12569 /* The exception filter expression only matters if there is an
12570 exception. If the exception does not match EH_FILTER_TYPES,
12571 we will execute EH_FILTER_FAILURE, and we will fall through
12572 if that falls through. If the exception does match
12573 EH_FILTER_TYPES, the stack unwinder will continue up the
12574 stack, so we will not fall through. We don't know whether we
12575 will throw an exception which matches EH_FILTER_TYPES or not,
12576 so we just ignore EH_FILTER_TYPES and assume that we might
12577 throw an exception which doesn't match. */
12581 /* This case represents statements to be executed when an
12582 exception occurs. Those statements are implicitly followed
12583 by a RESX statement to resume execution after the exception.
12584 So in this case the TRY_CATCH never falls through. */
12586 }
12587 }
12589 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12590 need not be 100% accurate; simply be conservative and return true if we
12591 don't know. This is used only to avoid stupidly generating extra code.
12592 If we're wrong, we'll just delete the extra code later. */
12594 bool
12596 {
12597 /* This CONST_CAST is okay because expr_last returns its argument
12598 unmodified and we assign it to a const_tree. */
12602 {
12605 /* Easy cases. If the last statement of the block implies
12606 control transfer, then we can't fall through. */
12610 /* If there is a default: label or case labels cover all possible
12611 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12612 to some case label in all cases and all we care is whether the
12613 SWITCH_BODY falls through. */
12630 /* The finally clause is always executed after the try clause,
12631 so if it does not fall through, then the try-finally will not
12632 fall through. Otherwise, if the try clause does not fall
12633 through, then when the finally clause falls through it will
12634 resume execution wherever the try clause was going. So the
12635 whole try-finally will only fall through if both the try
12636 clause and the finally clause fall through. */
12646 else
12648 /* FALLTHRU */
12651 /* Functions that do not return do not fall through. */
12665 }
12666 }
12668 /* True if we are using EH to handle cleanups. */
12671 /* This routine is called from front ends to indicate eh should be used for
12672 cleanups. */
12673 void
12675 {
12677 }
12679 /* Query whether EH is used for cleanups. */
12680 bool
12682 {
12684 }
12686 /* Wrapper for tree_code_name to ensure that tree code is valid */
12689 {
12692 /* The tree_code enum promotes to signed, but we could be getting
12693 invalid values, so force an unsigned comparison. */
12695 {
12699 }
12702 }
12704 /* Drops the TREE_OVERFLOW flag from T. */
12706 tree
12708 {
12711 /* For tree codes with a sharing machinery re-build the result. */
12715 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12716 and canonicalize the result. */
12718 {
12719 tree_vector_builder builder;
12723 {
12728 }
12730 }
12732 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12733 and drop the flag. */
12737 /* For constants that contain nested constants, drop the flag
12738 from those as well. */
12740 {
12745 }
12748 }
12750 /* Given a memory reference expression T, return its base address.
12751 The base address of a memory reference expression is the main
12752 object being referenced. For instance, the base address for
12753 'array[i].fld[j]' is 'array'. You can think of this as stripping
12754 away the offset part from a memory address.
12756 This function calls handled_component_p to strip away all the inner
12757 parts of the memory reference until it reaches the base object. */
12759 tree
12761 {
12773 }
12775 /* Return a tree of sizetype representing the size, in bytes, of the element
12776 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12778 tree
12780 {
12785 /* If a size was specified in the ARRAY_REF, it's the size measured
12786 in alignment units of the element type. So multiply by that value. */
12788 {
12789 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12790 sizetype from another type of the same width and signedness. */
12795 }
12797 /* Otherwise, take the size from that of the element type. Substitute
12798 any PLACEHOLDER_EXPR that we have. */
12799 else
12801 }
12803 /* Return a tree representing the lower bound of the array mentioned in
12804 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12806 tree
12808 {
12811 /* If a lower bound is specified in EXP, use it. */
12815 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12816 substituting for a PLACEHOLDER_EXPR as needed. */
12820 /* Otherwise, return a zero of the appropriate type. */
12824 }
12826 /* Return a tree representing the upper bound of the array mentioned in
12827 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12829 tree
12831 {
12834 /* If there is a domain type and it has an upper bound, use it, substituting
12835 for a PLACEHOLDER_EXPR as needed. */
12839 /* Otherwise fail. */
12841 }
12843 /* Returns true if REF is an array reference, a component reference,
12844 or a memory reference to an array whose actual size might be larger
12845 than its upper bound implies, there are multiple cases:
12846 A. a ref to a flexible array member at the end of a structure;
12847 B. a ref to an array with a different type against the original decl;
12848 for example:
12850 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12851 (*((char(*)[16])&a[0]))[i+8]
12853 C. a ref to an array that was passed as a parameter;
12854 for example:
12856 int test (uint8_t *p, uint32_t t[1][1], int n) {
12857 for (int i = 0; i < 4; i++, p++)
12858 t[i][0] = ...;
12860 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12861 */
12863 bool
12865 {
12866 /* The TYPE for this array referece. */
12868 /* The FIELD_DECL for the array field in the containing structure. */
12870 /* Whether this array is the trailing array of a structure. */
12877 {
12880 }
12883 {
12886 }
12888 {
12894 {
12896 {
12903 }
12904 else
12906 }
12907 else
12909 }
12910 else
12918 {
12919 /* If the reference chain contains a component reference to a
12920 non-union type and there follows another field the reference
12921 is not at the end of a structure. */
12923 {
12925 {
12931 }
12932 }
12933 /* If we have a multi-dimensional array we do not consider
12934 a non-innermost dimension as flex array if the whole
12935 multi-dimensional array is at struct end.
12936 Same for an array of aggregates with a trailing array
12937 member. */
12941 ;
12942 /* If we view an underlying object as sth else then what we
12943 gathered up to now is what we have to rely on. */
12946 else
12950 }
12955 /* The array now is at struct end. Treat flexible array member as
12956 always subject to extend, even into just padding constrained by
12957 an underlying decl. */
12961 {
12964 }
12966 /* If the reference is based on a declared entity, the size of the array
12967 is constrained by its given domain. (Do not trust commons PR/69368). */
12971 && !(flag_unconstrained_commons
12975 {
12976 /* If the object itself is the array it is not at struct end. */
12980 /* Check whether the array domain covers all of the available
12981 padding. */
12982 poly_int64 offset;
12986 {
12987 *is_trailing_array
12990 }
12992 {
12993 *is_trailing_array
12996 }
12998 /* If at least one extra element fits it is a flexarray. */
13004 {
13005 *is_trailing_array
13008 }
13011 }
13015 }
13018 /* Return a tree representing the offset, in bytes, of the field referenced
13019 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13021 tree
13023 {
13028 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13029 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13030 value. */
13032 {
13033 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13034 sizetype from another type of the same width and signedness. */
13040 }
13042 /* Otherwise, take the offset from that of the field. Substitute
13043 any PLACEHOLDER_EXPR that we have. */
13044 else
13046 }
13048 /* Given the initializer INIT, return the initializer for the field
13049 DECL if it exists, otherwise null. Used to obtain the initializer
13050 for a flexible array member and determine its size. */
13052 static tree
13054 {
13060 {
13065 {
13069 }
13070 }
13073 }
13075 /* Determines the special array member type for the array reference REF. */
13076 special_array_member
13078 {
13084 {
13093 {
13094 /* If array element has zero size, verify if it is a flexible
13095 array member or zero length array. Clear zero_elts if
13096 it has one or more members or is a VLA member. */
13105 }
13107 /* MEMBER is an interior array with more than one element. */
13111 {
13114 else
13116 }
13124 {
13129 /* MEMBER is a trailing array with more than
13130 one elements. */
13135 }
13136 }
13139 }
13141 /* Determines the size of the member referenced by the COMPONENT_REF
13142 REF, using its initializer expression if necessary in order to
13143 determine the size of an initialized flexible array member.
13144 If non-null, set *SAM to the type of special array member.
13145 Returns the size as sizetype (which might be zero for an object
13146 with an uninitialized flexible array member) or null if the size
13147 cannot be determined. */
13149 tree
13151 {
13154 special_array_member sambuf;
13159 /* The object/argument referenced by the COMPONENT_REF and its type. */
13162 /* The referenced member. */
13167 {
13170 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13171 to the type of a class with a virtual base which doesn't
13172 reflect the size of the virtual's members (see pr97595).
13173 If that's the case fail for now and implement something
13174 more robust in the future. */
13178 /* 2-or-more elements arrays are treated as normal arrays by default. */
13185 /* If the trailing array is a not a flexible array member, treat it as
13186 a normal array. */
13194 /* For a reference to a flexible array member of a union
13195 use the size of the union instead of the size of the member. */
13198 }
13200 /* MEMBER is either a bona fide flexible array member, or a zero-elements
13201 array member, or an array of length one treated as such. */
13203 /* If the reference is to a declared object and the member a true
13204 flexible array, try to determine its size from its initializer. */
13208 {
13219 }
13221 /* BASE is the declared object of which MEMBER is either a member
13222 or that is cast to ARGTYPE (e.g., a char buffer used to store
13223 an ARGTYPE object). */
13226 /* Determine the base type of the referenced object. If it's
13227 the same as ARGTYPE and MEMBER has a known size, return it. */
13239 /* MEMBER is a true flexible array member. Compute its size from
13240 the initializer of the BASE object if it has one. */
13243 {
13246 {
13249 {
13250 /* Use the larger of the initializer size and the tail
13251 padding in the enclosing struct. */
13256 }
13259 }
13260 }
13263 {
13265 {
13270 /* The size of a flexible array member of an extern struct
13271 with no initializer cannot be determined (it's defined
13272 in another translation unit and can have an initializer
13273 with an arbitrary number of elements). */
13276 /* Use the size of the base struct or, for interior zero-length
13277 arrays, the size of the enclosing type. */
13279 }
13281 /* Use the size of the BASE object (possibly an array of some
13282 other type such as char used to store the struct). */
13284 else
13286 }
13288 /* If the flexible array member has a known size use the greater
13289 of it and the tail padding in the enclosing struct.
13290 Otherwise, when the size of the flexible array member is unknown
13291 and the referenced object is not a struct, use the size of its
13292 type when known. This detects sizes of array buffers when cast
13293 to struct types with flexible array members. */
13295 {
13300 {
13303 }
13305 }
13307 /* Return "don't know" for an external non-array object since its
13308 flexible array member can be initialized to have any number of
13309 elements. Otherwise, return zero because the flexible array
13310 member has no elements. */
13313 && (!typematch
13316 }
13318 /* Return the machine mode of T. For vectors, returns the mode of the
13319 inner type. The main use case is to feed the result to HONOR_NANS,
13320 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13322 machine_mode
13324 {
13330 }
13332 /* Vector types need to re-check the target flags each time we report
13333 the machine mode. We need to do this because attribute target can
13334 change the result of vector_mode_supported_p and have_regs_of_mode
13335 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13336 change on a per-function basis. */
13337 /* ??? Possibly a better solution is to run through all the types
13338 referenced by a function and re-compute the TYPE_MODE once, rather
13339 than make the TYPE_MODE macro call a function. */
13341 machine_mode
13343 {
13344 machine_mode mode;
13352 {
13353 scalar_int_mode innermode;
13355 /* For integers, try mapping it to a same-sized scalar mode. */
13357 {
13360 scalar_int_mode mode;
13364 }
13367 }
13370 }
13372 /* Return the size in bits of each element of vector type TYPE. */
13374 unsigned int
13376 {
13381 }
13383 /* Calculate the size in bits of each element of vector type TYPE
13384 and return the result as a tree of type bitsizetype. */
13386 tree
13388 {
13393 }
13395 /* Verify that basic properties of T match TV and thus T can be a variant of
13396 TV. TV should be the more specified variant (i.e. the main variant). */
13398 static bool
13400 {
13401 /* Type variant can differ by:
13403 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13404 ENCODE_QUAL_ADDR_SPACE.
13405 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13406 in this case some values may not be set in the variant types
13407 (see TYPE_COMPLETE_P checks).
13408 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13409 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13410 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13411 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13412 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13413 this is necessary to make it possible to merge types form different TUs
13414 - arrays, pointers and references may have TREE_TYPE that is a variant
13415 of TREE_TYPE of their main variants.
13416 - aggregates may have new TYPE_FIELDS list that list variants of
13417 the main variant TYPE_FIELDS.
13418 - vector types may differ by TYPE_VECTOR_OPAQUE
13419 */
13421 /* Convenience macro for matching individual fields. */
13422 #define verify_variant_match(flag) \
13423 do { \
13424 if (flag (tv) != flag (t)) \
13425 { \
13427 debug_tree (tv); \
13428 return false; \
13429 } \
13430 } while (false)
13432 /* tree_base checks. */
13435 /* FIXME: Ada builds non-artificial variants of artificial types. */
13436 #if 0
13439 #endif
13442 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13449 else
13451 /* FIXME: This check trigger during libstdc++ build. */
13452 #if 0
13455 #endif
13457 /* tree_type_common checks. */
13460 {
13468 {
13478 }
13480 }
13486 /* During LTO we merge variant lists from diferent translation units
13487 that may differ BY TYPE_CONTEXT that in turn may point
13488 to TRANSLATION_UNIT_DECL.
13489 Ada also builds variants of types with different TYPE_CONTEXT. */
13490 #if 0
13493 #endif
13499 {
13503 }
13505 /* tree_type_non_common checks. */
13507 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13508 and dangle the pointer from time to time. */
13512 {
13516 }
13523 {
13526 }
13533 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13534 or even type's main variant. This is needed to make bootstrap pass
13535 and the bug seems new in GCC 5.
13536 C++ FE should be updated to make this consistent and we should check
13537 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13538 is a match with main variant.
13540 Also disable the check for Java for now because of parser hack that builds
13541 first an dummy BINFO and then sometimes replace it by real BINFO in some
13542 of the copies. */
13545 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13546 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13547 at LTO time only. */
13549 {
13557 }
13559 /* Check various uses of TYPE_VALUES_RAW. */
13565 /* Permit incomplete variants of complete type. While FEs may complete
13566 all variants, this does not happen for C++ templates in all cases. */
13570 {
13573 /* Fortran builds qualified variants as new records with items of
13574 qualified type. Verify that they looks same. */
13581 /* FIXME: gfc_nonrestricted_type builds all types as variants
13582 with exception of pointer types. It deeply copies the type
13583 which means that we may end up with a variant type
13584 referring non-variant pointer. We may change it to
13585 produce types as variants, too, like
13586 objc_get_protocol_qualified_type does. */
13592 {
13600 }
13601 }
13604 /* For C++ the qualified variant of array type is really an array type
13605 of qualified TREE_TYPE.
13606 objc builds variants of pointer where pointer to type is a variant, too
13607 in objc_get_protocol_qualified_type. */
13613 {
13621 }
13624 {
13632 }
13634 #undef verify_variant_match
13635 }
13638 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13639 the middle-end types_compatible_p function. It needs to avoid
13640 claiming types are different for types that should be treated
13641 the same with respect to TBAA. Canonical types are also used
13642 for IL consistency checks via the useless_type_conversion_p
13643 predicate which does not handle all type kinds itself but falls
13644 back to pointer-comparison of TYPE_CANONICAL for aggregates
13645 for example. */
13647 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13648 type calculation because we need to allow inter-operability between signed
13649 and unsigned variants. */
13651 bool
13653 {
13654 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13655 signed char and unsigned char. Similarly fortran FE builds
13656 C_SIZE_T as signed type, while C defines it unsigned. */
13659 == INTEGER_TYPE
13662 }
13664 /* Return true iff T1 and T2 are structurally identical for what
13665 TBAA is concerned.
13666 This function is used both by lto.cc canonical type merging and by the
13667 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13668 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13669 only for LTO because only in these cases TYPE_CANONICAL equivalence
13670 correspond to one defined by gimple_canonical_types_compatible_p. */
13672 bool
13675 {
13676 /* Type variants should be same as the main variant. When not doing sanity
13677 checking to verify this fact, go to main variants and save some work. */
13679 {
13682 }
13684 /* Check first for the obvious case of pointer identity. */
13688 /* Check that we have two types to compare. */
13692 /* We consider complete types always compatible with incomplete type.
13693 This does not make sense for canonical type calculation and thus we
13694 need to ensure that we are never called on it.
13696 FIXME: For more correctness the function probably should have three modes
13697 1) mode assuming that types are complete mathcing their structure
13698 2) mode allowing incomplete types but producing equivalence classes
13699 and thus ignoring all info from complete types
13700 3) mode allowing incomplete types to match complete but checking
13701 compatibility between complete types.
13703 1 and 2 can be used for canonical type calculation. 3 is the real
13704 definition of type compatibility that can be used i.e. for warnings during
13705 declaration merging. */
13710 /* If the types have been previously registered and found equal
13711 they still are. */
13715 {
13716 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13717 they are always NULL, but they are set to non-NULL for types
13718 constructed by build_pointer_type and variants. In this case the
13719 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13720 all pointers are considered equal. Be sure to not return false
13721 negatives. */
13725 }
13727 /* For types where we do ODR based TBAA the canonical type is always
13728 set correctly, so we know that types are different if their
13729 canonical types does not match. */
13735 /* Can't be the same type if the types don't have the same code. */
13740 /* Qualifiers do not matter for canonical type comparison purposes. */
13742 /* Void types and nullptr types are always the same. */
13747 /* Can't be the same type if they have different mode. */
13751 /* Non-aggregate types can be handled cheaply. */
13759 {
13760 /* Can't be the same type if they have different precision. */
13764 /* In some cases the signed and unsigned types are required to be
13765 inter-operable. */
13770 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13771 interoperable with "signed char". Unless all frontends are revisited
13772 to agree on these types, we must ignore the flag completely. */
13774 /* Fortran standard define C_PTR type that is compatible with every
13775 C pointer. For this reason we need to glob all pointers into one.
13776 Still pointers in different address spaces are not compatible. */
13778 {
13782 }
13784 /* Tail-recurse to components. */
13789 trust_type_canonical);
13792 }
13794 /* Do type-specific comparisons. */
13796 {
13798 /* Array types are the same if the element types are the same and
13799 the number of elements are the same. */
13801 trust_type_canonical)
13806 else
13807 {
13811 /* For an incomplete external array, the type domain can be
13812 NULL_TREE. Check this condition also. */
13817 else
13818 {
13824 /* The minimum/maximum values have to be the same. */
13836 else
13838 }
13839 }
13843 /* Function types are the same if the return type and arguments types
13844 are the same. */
13846 trust_type_canonical))
13853 else
13854 {
13860 {
13863 trust_type_canonical))
13865 }
13871 }
13876 {
13879 /* Don't try to compare variants of an incomplete type, before
13880 TYPE_FIELDS has been copied around. */
13888 /* For aggregate types, all the fields must be the same. */
13892 {
13893 /* Skip non-fields and zero-sized fields. */
13904 /* The fields must have the same name, offset and type. */
13907 || !gimple_canonical_types_compatible_p
13909 trust_type_canonical))
13911 }
13913 /* If one aggregate has more fields than the other, they
13914 are not the same. */
13919 }
13922 /* Consider all types with language specific trees in them mutually
13923 compatible. This is executed only from verify_type and false
13924 positives can be tolerated. */
13927 }
13928 }
13930 /* For OPAQUE_TYPE T, it should have only size and alignment information
13931 and its mode should be of class MODE_OPAQUE. This function verifies
13932 these properties of T match TV which is the main variant of T and TC
13933 which is the canonical of T. */
13935 static void
13937 {
13942 /* For an opaque type T1, check if some of its properties match
13943 the corresponding ones of the other opaque type T2, emit some
13944 error messages for those inconsistent ones. */
13947 {
13949 {
13953 }
13955 {
13959 }
13961 {
13965 }
13969 {
13973 }
13975 {
13979 }
13981 {
13985 }
13986 };
13993 }
13995 /* Verify type T. */
13997 void
13999 {
14005 {
14008 }
14011 {
14014 }
14016 {
14020 }
14025 ;
14027 {
14031 }
14032 /* Method and function types cannot be used to address memory and thus
14033 TYPE_CANONICAL really matters only for determining useless conversions.
14035 FIXME: C++ FE produce declarations of builtin functions that are not
14036 compatible with main variants. */
14038 ;
14040 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14041 with variably sized arrays because their sizes possibly
14042 gimplified to different variables. */
14046 {
14050 }
14054 {
14058 }
14060 {
14065 }
14068 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14070 {
14071 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14072 and danagle the pointer from time to time. */
14076 {
14080 }
14081 }
14083 {
14086 {
14090 }
14091 }
14093 {
14096 {
14100 }
14101 }
14104 {
14105 /* FIXME: The following check should pass:
14106 useless_type_conversion_p (const_cast <tree> (t),
14107 TREE_TYPE (TYPE_MIN_VALUE (t))
14108 but does not for C sizetypes in LTO. */
14109 }
14111 /* Check various uses of TYPE_MAXVAL_RAW. */
14113 {
14115 ;
14117 {
14121 }
14123 {
14127 }
14128 }
14130 {
14134 {
14138 }
14139 }
14141 {
14145 {
14149 }
14150 }
14153 {
14154 /* FIXME: The following check should pass:
14155 useless_type_conversion_p (const_cast <tree> (t),
14156 TREE_TYPE (TYPE_MAX_VALUE (t))
14157 but does not for C sizetypes in LTO. */
14158 }
14160 {
14163 {
14167 }
14168 }
14170 {
14174 }
14177 {
14181 }
14183 /* Check various uses of TYPE_VALUES_RAW. */
14186 {
14190 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14191 CONST_DECL of ENUMERAL TYPE. */
14193 {
14198 }
14202 {
14208 }
14210 {
14215 }
14216 }
14218 {
14220 {
14224 }
14225 }
14227 {
14229 {
14232 }
14234 {
14235 /* TODO: verify properties of decls. */
14237 ;
14239 ;
14241 ;
14243 ;
14245 ;
14247 ;
14249 ;
14250 else
14251 {
14255 }
14256 }
14257 }
14265 {
14267 {
14272 }
14274 {
14278 }
14279 /* Verify just enough of cache to ensure that no one copied it to new type.
14280 All copying should go by copy_node that should clear it. */
14282 {
14287 {
14292 }
14293 }
14294 }
14297 {
14298 /* C++ FE uses TREE_PURPOSE to store initial values. */
14300 {
14304 }
14306 {
14310 }
14311 }
14313 {
14317 }
14326 {
14329 }
14331 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14332 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14333 of a type. */
14336 {
14339 }
14342 {
14345 }
14346 }
14349 /* Return 1 if ARG interpreted as signed in its precision is known to be
14350 always positive or 2 if ARG is known to be always negative, or 3 if
14351 ARG may be positive or negative. */
14353 int
14355 {
14362 {
14366 else
14368 }
14372 {
14374 /* Narrower value zero extended into wider type
14375 will always result in positive values. */
14382 }
14386 value_range r;
14389 {
14393 {
14397 {
14406 }
14407 }
14409 }
14411 {
14412 /* For unsigned values, the "positive" range comes
14413 below the "negative" range. */
14418 }
14419 else
14420 {
14425 }
14427 }
14432 /* Return true if ARG is marked with the nonnull attribute in the
14433 current function signature. */
14435 bool
14437 {
14445 /* The static chain decl is always non null. */
14449 /* THIS argument of method is always non-NULL. */
14455 /* Values passed by reference are always non-NULL. */
14462 {
14465 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14469 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14473 /* Get the position number for ARG in the function signature. */
14475 t;
14477 {
14480 }
14484 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14486 {
14489 }
14490 }
14493 }
14495 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14496 information. */
14498 location_t
14500 {
14505 discriminator);
14506 }
14508 location_t
14510 {
14511 source_range src_range;
14515 }
14517 location_t
14519 {
14527 src_range,
14529 discriminator);
14532 }
14534 /* Return EXPR, potentially wrapped with a node expression LOC,
14535 if !CAN_HAVE_LOCATION_P (expr).
14537 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14538 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14540 Wrapper nodes can be identified using location_wrapper_p. */
14542 tree
14544 {
14551 /* We should only be adding wrappers for constants and for decls,
14552 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14557 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14558 any impact of the wrapper nodes. */
14562 /* Compiler-generated temporary variables don't need a wrapper. */
14566 /* If any auto_suppress_location_wrappers are active, don't create
14567 wrappers. */
14571 tree_code code
14576 /* Mark this node as being a wrapper. */
14579 }
14583 /* Return the name of combined function FN, for debugging purposes. */
14587 {
14589 {
14592 }
14593 else
14595 }
14597 /* Return a bitmap with a bit set corresponding to each argument in
14598 a function call type FNTYPE declared with attribute nonnull,
14599 or null if none of the function's argument are nonnull. The caller
14600 must free the bitmap. */
14602 bitmap
14604 {
14610 {
14611 /* The this pointer in C++ non-static member functions is
14612 implicitly nonnull whether or not it's declared as such. */
14615 }
14621 /* A function declaration can specify multiple attribute nonnull,
14622 each with zero or more arguments. The loop below creates a bitmap
14623 representing a union of all the arguments. An empty (but non-null)
14624 bitmap means that all arguments have been declaraed nonnull. */
14626 {
14635 {
14636 /* Clear the bitmap in case a previous attribute nonnull
14637 set it and this one overrides it for all arguments. */
14640 }
14642 /* Iterate over the indices of the format arguments declared nonnull
14643 and set a bit for each. */
14645 {
14648 }
14649 }
14652 }
14654 /* Returns true if TYPE is a type where it and all of its subobjects
14655 (recursively) are of structure, union, or array type. */
14657 bool
14659 {
14661 {
14668 }
14674 }
14676 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14677 that shouldn't be passed via stack. */
14679 bool
14681 {
14692 }
14694 /* Determine whether TYPE is a structure with a flexible array member,
14695 or a union containing such a structure (possibly recursively). */
14697 bool
14699 {
14702 {
14718 {
14722 }
14726 }
14727 }
14729 /* Like int_size_in_bytes, but handle empty records specially. */
14731 HOST_WIDE_INT
14733 {
14735 }
14737 /* Like size_in_bytes, but handle empty records specially. */
14739 tree
14741 {
14743 }
14745 /* Return true if an expression with CODE has to have the same result type as
14746 its first operand. */
14748 bool
14750 {
14752 {
14786 }
14787 }
14789 /* Return a typenode for the "standard" C type with a given name. */
14790 tree
14792 {
14824 }
14826 /* List of pointer types used to declare builtins before we have seen their
14827 real declaration.
14829 Keep the size up to date in tree.h ! */
14831 {
14838 };
14840 /* Return the maximum object size. */
14842 tree
14844 {
14845 /* To do: Make this a configurable parameter. */
14847 }
14849 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14850 parameter default to false and that weeds out error_mark_node. */
14852 bool
14855 {
14862 }
14864 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14865 delete operators. Return false if they may or may not name such
14866 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14867 do not. */
14869 bool
14872 {
14882 /* The following failures are due to invalid names so they're not
14883 considered certain mismatches. */
14899 /* The following failures are due to names of user-defined operators
14900 so they're also not considered certain mismatches. */
14902 /* *_len is now just the length after initial underscores. */
14908 /* The following failures are certain mismatches. */
14911 /* _Znw must match _Zdl, _Zna must match _Zda. */
14915 /* 'j', 'm' and 'y' correspond to size_t. */
14922 {
14923 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14924 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14931 }
14935 {
14936 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14937 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14938 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14948 }
14950 /* The negative result is conservative. */
14953 }
14955 /* Return the zero-based number corresponding to the argument being
14956 deallocated if FNDECL is a deallocation function or an out-of-bounds
14957 value if it isn't. */
14959 unsigned
14961 {
14962 /* A call to operator delete isn't recognized as one to a built-in. */
14964 {
14968 /* Avoid placement delete that's not been inlined. */
14974 }
14976 /* TODO: Handle user-defined functions with attribute malloc? Handle
14977 known non-built-ins like fopen? */
14979 {
14981 {
14987 }
14989 }
14998 {
15009 }
15012 }
15014 /* If EXPR refers to a character array or pointer declared attribute
15015 nonstring, return a decl for that array or pointer and set *REF
15016 to the referenced enclosing object or pointer. Otherwise return
15017 null. */
15019 tree
15021 {
15025 {
15029 {
15035 }
15036 else
15038 }
15043 /* To simplify calling code, store the referenced DECL regardless of
15044 the attribute determined below, but avoid storing the SSA_NAME_VAR
15045 obtained above (it's not useful for dataflow purposes). */
15049 /* Use the SSA_NAME_VAR that was determined above to see if it's
15050 declared nonstring. Otherwise drill down into the referenced
15051 DECL. */
15066 }
15068 /* Return length of attribute names string,
15069 if arglist chain > 1, -1 otherwise. */
15071 int
15073 {
15074 tree arg;
15079 {
15084 argnum++;
15085 argnum++;
15086 }
15090 }
15092 void
15094 {
15097 }
15099 #if CHECKING_P
15103 /* Selftests for tree. */
15105 /* Verify that integer constants are sane. */
15107 static void
15109 {
15122 }
15124 /* Verify identifiers. */
15126 static void
15128 {
15132 }
15134 /* Verify LABEL_DECL. */
15136 static void
15138 {
15144 }
15146 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15147 are given by VALS. */
15149 static tree
15151 {
15156 }
15158 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15160 static void
15162 {
15168 }
15170 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15171 and that its elements match EXPECTED. */
15173 static void
15176 {
15183 }
15185 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15186 and NPATTERNS background elements, and that its elements match
15187 EXPECTED. */
15189 static void
15192 {
15199 }
15201 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15202 and that its elements match EXPECTED. */
15204 static void
15207 {
15214 }
15216 /* Test the creation of VECTOR_CSTs. */
15218 static void
15220 {
15226 /* Test a simple linear series with a base of 0 and a step of 1:
15227 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15233 /* Try the same with the first element replaced by 100:
15234 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15239 /* Try a series that wraps around.
15240 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15246 /* Try a downward series:
15247 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15253 /* Try two interleaved series with different bases and steps:
15254 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15257 {
15260 }
15264 /* Try a duplicated value:
15265 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15271 /* Try an interleaved duplicated value:
15272 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15279 /* Try a duplicated value with 2 exceptions
15280 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15286 /* Try with and without a step
15287 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15293 /* Try a fully-general constant:
15294 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15298 }
15300 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15301 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15302 modifying its argument in-place. */
15304 static void
15306 {
15309 }
15311 /* Verify location wrappers. */
15313 static void
15315 {
15320 /* Wrapping a constant. */
15330 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15333 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15338 /* Wrapping a STRING_CST. */
15350 /* Wrapping a variable. */
15353 integer_type_node);
15362 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15363 wrapper. */
15368 /* Verify that STRIP_NOPS removes wrappers. */
15372 }
15374 /* Test various tree predicates. Verify that location wrappers don't
15375 affect the results. */
15377 static void
15379 {
15380 /* Build various constants and wrappers around them. */
15408 /* TODO: vector constants. */
15410 /* Test integer_onep. */
15430 /* Test integer_zerop. */
15450 /* Test integer_all_onesp. */
15470 /* Test integer_minus_onep. */
15490 /* Test integer_each_onep. */
15510 /* Test integer_truep. */
15530 /* Test integer_nonzerop. */
15550 /* Test real_zerop. */
15570 /* Test real_onep. */
15590 /* Test real_minus_onep. */
15610 /* Test zerop. */
15630 /* Test tree_expr_nonnegative_p. */
15650 /* Test tree_expr_nonzero_p. */
15658 /* Test integer_valued_real_p. */
15665 /* Test integer_pow2p. */
15670 /* Test uniform_integer_cst_p. */
15689 }
15691 /* Check that string escaping works correctly. */
15693 static void
15695 {
15697 escaped_string msg;
15700 /* ASSERT_STREQ does not accept NULL as a valid test
15701 result, so we have to use ASSERT_EQ instead. */
15710 /* Ensure that we have -fmessage-length set to 0. */
15720 /* Now repeat the tests with -fmessage-length set to 5. */
15723 /* Note that the newline is not translated into an escape. */
15730 /* Restore the original message length setting. */
15732 }
15734 /* Run all of the selftests within this file. */
15736 void
15738 {
15746 }