| blob | 41ccbf3b3cbffddc4c79cb79eee560b392602d09 |
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 #if __cpp_inline_variables < 201606L
78 /* Tree code classes. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
81 #define END_OF_BASE_TREE_CODES tcc_exceptional,
85 };
87 #undef DEFTREECODE
88 #undef END_OF_BASE_TREE_CODES
90 /* Table indexed by tree code giving number of expression
91 operands beyond the fixed part of the node structure.
92 Not used for types or decls. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
95 #define END_OF_BASE_TREE_CODES 0,
99 };
101 #undef DEFTREECODE
102 #undef END_OF_BASE_TREE_CODES
103 #endif
105 /* Names of tree components.
106 Used for printing out the tree and error messages. */
107 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
112 };
114 #undef DEFTREECODE
115 #undef END_OF_BASE_TREE_CODES
117 /* Each tree code class has an associated string representation.
118 These must correspond to the tree_code_class entries. */
121 {
132 "expression"
133 };
135 /* obstack.[ch] explicitly declined to prototype this. */
138 /* Statistics-gathering stuff. */
144 /* Keep in sync with tree.h:enum tree_node_kind. */
162 };
164 /* Unique id for next decl created. */
166 /* Unique id for next type created. */
168 /* Unique id for next debug decl created. Use negative numbers,
169 to catch erroneous uses. */
172 /* Since we cannot rehash a type after it is in the table, we have to
173 keep the hash code. */
177 tree type;
178 };
180 /* Initial size of the hash table (rounded to next prime). */
181 #define TYPE_HASH_INITIAL_SIZE 1000
184 {
188 static int
190 {
192 }
193 };
195 /* Now here is the hash table. When recording a type, it is added to
196 the slot whose index is the hash code. Note that the hash table is
197 used for several kinds of types (function types, array types and
198 array index range types, for now). While all these live in the
199 same table, they are completely independent, and the hash code is
200 computed differently for each of these. */
204 /* Hash table and temporary node for larger integer const values. */
208 {
211 };
215 /* Class and variable for making sure that there is a single POLY_INT_CST
216 for a given value. */
218 {
222 };
226 /* Hash table for optimization flags and target option flags. Use the same
227 hash table for both sets of options. Nodes for building the current
228 optimization and target option nodes. The assumption is most of the time
229 the options created will already be in the hash table, so we avoid
230 allocating and freeing up a node repeatably. */
235 {
238 };
242 /* General tree->tree mapping structure for use in hash tables. */
267 /* Number of operands for each OMP clause. */
269 {
357 };
360 {
448 };
450 /* Unless specific to OpenACC, we tend to internally maintain OpenMP-centric
451 clause names, but for use in diagnostics etc. would like to use the "user"
452 clause names. */
456 {
457 /* For OpenACC, the 'OMP_CLAUSE_MAP_KIND' of an 'OMP_CLAUSE_MAP' is used to
458 distinguish clauses as seen by the user. See also where front ends do
459 'build_omp_clause' with 'OMP_CLAUSE_MAP'. */
462 {
480 }
483 }
486 /* Return the tree node structure used by tree code CODE. */
490 {
492 {
495 {
507 }
521 }
524 {
525 /* tcc_constant cases. */
535 /* tcc_exceptional cases. */
552 }
553 }
556 /* Initialize tree_contains_struct to describe the hierarchy of tree
557 nodes. */
559 static void
561 {
565 {
572 /* Mark the TS structure itself. */
575 /* Mark all the structures that TS is derived from. */
577 {
657 }
658 }
660 /* Basic consistency checks for attributes used in fold. */
701 }
704 /* Init tree.cc. */
706 void
708 {
709 /* Initialize the hash table of types. */
710 type_hash_table
713 debug_expr_for_decl
716 value_expr_for_decl
730 /* Initialize the tree_contains_struct array. */
733 }
735 \f
736 /* The name of the object as the assembler will see it (but before any
737 translations made by ASM_OUTPUT_LABELREF). Often this is the same
738 as DECL_NAME. It is an IDENTIFIER_NODE. */
739 tree
741 {
745 }
747 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
748 (either of which may be NULL). Inform the FE, if this changes the
749 name. */
751 void
753 {
756 }
758 /* Return true if DECL may need an assembler name to be set. */
762 {
763 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
764 Rule merging. This makes type_odr_p to return true on those types during
765 LTO and by comparing the mangled name, we can say what types are intended
766 to be equivalent across compilation unit.
768 We do not store names of type_in_anonymous_namespace_p.
770 Record, union and enumeration type have linkage that allows use
771 to check type_in_anonymous_namespace_p. We do not mangle compound types
772 that always can be compared structurally.
774 Similarly for builtin types, we compare properties of their main variant.
775 A special case are integer types where mangling do make differences
776 between char/signed char/unsigned char etc. Storing name for these makes
777 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
778 See cp/mangle.cc:write_builtin_type for details. */
781 {
794 }
795 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
799 /* If DECL already has its assembler name set, it does not need a
800 new one. */
805 /* Abstract decls do not need an assembler name. */
809 /* For VAR_DECLs, only static, public and external symbols need an
810 assembler name. */
818 {
819 /* Do not set assembler name on builtins. Allow RTL expansion to
820 decide whether to expand inline or via a regular call. */
825 /* Functions represented in the callgraph need an assembler name. */
829 /* Unused and not public functions don't need an assembler name. */
832 }
835 }
837 /* If T needs an assembler name, have one created for it. */
839 void
841 {
843 {
844 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
845 diagnostics that use input_location to show locus
846 information. The problem here is that, at this point,
847 input_location is generally anchored to the end of the file
848 (since the parser is long gone), so we don't have a good
849 position to pin it to.
851 To alleviate this problem, this uses the location of T's
852 declaration. Examples of this are
853 testsuite/g++.dg/template/cond2.C and
854 testsuite/g++.dg/template/pr35240.C. */
861 }
862 }
864 /* When the target supports COMDAT groups, this indicates which group the
865 DECL is associated with. This can be either an IDENTIFIER_NODE or a
866 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
867 tree
869 {
874 }
876 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
877 tree
879 {
884 }
886 /* When the target supports named section, return its name as IDENTIFIER_NODE
887 or NULL if it is in no section. */
890 {
895 }
897 /* Set section name of NODE to VALUE (that is expected to be
898 identifier node) */
899 void
901 {
905 {
909 }
912 else
915 }
917 /* Set section name of NODE to match the section name of OTHER.
919 set_decl_section_name (decl, other) is equivalent to
920 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
921 efficient. */
922 void
924 {
927 {
931 else
934 }
935 else
936 {
941 }
942 }
944 /* Return TLS model of a variable NODE. */
945 enum tls_model
947 {
952 }
954 /* Set TLS model of variable NODE to MODEL. */
955 void
957 {
961 {
965 }
966 else
969 }
971 /* Compute the number of bytes occupied by a tree with code CODE.
972 This function cannot be used for nodes that have variable sizes,
973 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
974 size_t
976 {
978 {
981 {
998 }
1002 {
1026 }
1039 {
1051 }
1055 {
1076 }
1080 }
1081 }
1083 /* Compute the number of bytes occupied by NODE. This routine only
1084 looks at TREE_CODE, except for those nodes that have variable sizes. */
1085 size_t
1087 {
1090 {
1120 else
1122 }
1123 }
1125 /* Return tree node kind based on tree CODE. */
1127 static tree_node_kind
1129 {
1133 {
1151 {
1168 }
1174 }
1175 }
1177 /* Record interesting allocation statistics for a tree node with CODE
1178 and LENGTH. */
1180 static void
1182 {
1191 }
1193 /* Allocate and return a new UID from the DECL_UID namespace. */
1195 int
1197 {
1199 }
1201 /* Return a newly allocated node of code CODE. For decl and type
1202 nodes, some other fields are initialized. The rest of the node is
1203 initialized to zero. This function cannot be used for TREE_VEC,
1204 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1205 tree_code_size.
1207 Achoo! I got a code in the node. */
1209 tree
1211 {
1212 tree t;
1222 {
1230 {
1232 {
1235 }
1236 else
1238 }
1242 else
1243 {
1246 }
1259 /* Default to no attributes for type, but let target change that. */
1263 /* We have not yet computed the alias set for this type. */
1273 {
1281 /* All of these have side-effects, no matter what their
1282 operands are. */
1288 }
1293 {
1306 }
1310 /* Other classes need no special treatment. */
1312 }
1315 }
1317 /* Free tree node. */
1319 void
1321 {
1324 {
1334 }
1346 }
1347 \f
1348 /* Return a new node with the same contents as NODE except that its
1349 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1351 tree
1353 {
1354 tree t;
1371 {
1374 else
1375 {
1379 }
1382 {
1385 }
1386 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1388 {
1391 }
1393 {
1396 }
1398 {
1401 }
1402 }
1404 {
1406 /* The following is so that the debug code for
1407 the copy is different from the original type.
1408 The two statements usually duplicate each other
1409 (because they clear fields of the same union),
1410 but the optimizer should catch that. */
1414 /* Do not copy the values cache. */
1416 {
1419 }
1420 }
1422 {
1426 }
1428 {
1432 }
1435 }
1437 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1438 For example, this can copy a list made of TREE_LIST nodes. */
1440 tree
1442 {
1443 tree head;
1452 {
1456 }
1458 }
1460 \f
1461 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1462 INTEGER_CST with value CST and type TYPE. */
1464 static unsigned int
1466 {
1468 /* We need extra HWIs if CST is an unsigned integer with its
1469 upper bit set. */
1473 }
1475 /* Return a new INTEGER_CST with value CST and type TYPE. */
1477 static tree
1479 {
1485 {
1491 }
1494 {
1495 len--;
1499 }
1505 }
1507 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1509 static tree
1511 CXX_MEM_STAT_INFO)
1512 {
1524 }
1526 /* Create a constant tree that contains CST sign-extended to TYPE. */
1528 tree
1530 {
1531 /* Support legacy code. */
1536 }
1538 /* Create a constant tree that contains CST zero-extended to TYPE. */
1540 tree
1542 {
1544 }
1546 /* Create a constant tree that contains CST sign-extended to TYPE. */
1548 tree
1550 {
1553 }
1555 /* Constructs tree in type TYPE from with value given by CST. Signedness
1556 of CST is assumed to be the same as the signedness of TYPE. */
1558 tree
1560 {
1562 }
1564 /* We force the wide_int CST to the range of the type TYPE by sign or
1565 zero extending it. OVERFLOWABLE indicates if we are interested in
1566 overflow of the value, when >0 we are only interested in signed
1567 overflow, for <0 we are interested in any overflow. OVERFLOWED
1568 indicates whether overflow has already occurred. CONST_OVERFLOWED
1569 indicates whether constant overflow has already occurred. We force
1570 T's value to be within range of T's type (by setting to 0 or 1 all
1571 the bits outside the type's range). We set TREE_OVERFLOWED if,
1572 OVERFLOWED is nonzero,
1573 or OVERFLOWABLE is >0 and signed overflow occurs
1574 or OVERFLOWABLE is <0 and any overflow occurs
1575 We return a new tree node for the extended wide_int. The node
1576 is shared if no overflow flags are set. */
1579 tree
1582 {
1585 /* If we need to set overflow flags, return a new unshared node. */
1587 {
1591 {
1593 sign);
1594 tree t;
1597 else
1598 {
1601 {
1604 }
1606 }
1609 }
1610 }
1612 /* Else build a shared node. */
1614 }
1616 /* These are the hash table functions for the hash table of INTEGER_CST
1617 nodes of a sizetype. */
1619 /* Return the hash code X, an INTEGER_CST. */
1621 hashval_t
1623 {
1632 }
1634 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1635 is the same as that given by *Y, which is the same. */
1637 bool
1639 {
1653 }
1655 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1656 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1657 number of slots that can be cached for the type. */
1662 {
1664 /* Initialize cache. */
1666 {
1669 }
1672 {
1673 /* Create a new shared int. */
1676 }
1678 }
1680 /* Create an INT_CST node of TYPE and value CST.
1681 The returned node is always shared. For small integers we use a
1682 per-type vector cache, for larger ones we use a single hash table.
1683 The value is extended from its precision according to the sign of
1684 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1685 the upper bits and ensures that hashing and value equality based
1686 upon the underlying HOST_WIDE_INTs works without masking. */
1688 static tree
1690 {
1691 tree t;
1699 /* Verify that everything is canonical. */
1702 {
1707 }
1714 {
1715 /* Cache NULL pointer and zero bounds. */
1718 /* Cache upper bounds of pointers. */
1721 /* Cache 1 which is used for a non-zero range. */
1726 {
1728 /* Make sure no one is clobbering the shared constant. */
1732 }
1733 }
1735 {
1736 /* We just need to store a single HOST_WIDE_INT. */
1737 HOST_WIDE_INT hwi;
1740 else
1744 {
1747 /* Fallthru. */
1751 /* Ignore pointers, as they were already handled above. */
1755 /* Cache false or true. */
1764 {
1765 /* Cache [0, N). */
1769 }
1770 else
1771 {
1772 /* Cache [-1, N). */
1776 }
1784 }
1787 {
1789 /* Make sure no one is clobbering the shared constant. */
1796 }
1797 else
1798 {
1799 /* Use the cache of larger shared ints, using int_cst_node as
1800 a temporary. */
1808 {
1809 /* Insert this one into the hash table. */
1812 /* Make a new node for next time round. */
1814 }
1815 }
1816 }
1817 else
1818 {
1819 /* The value either hashes properly or we drop it on the floor
1820 for the gc to take care of. There will not be enough of them
1821 to worry about. */
1827 {
1828 /* Insert this one into the hash table. */
1831 }
1832 else
1834 }
1837 }
1839 hashval_t
1841 {
1849 }
1851 bool
1853 {
1860 }
1862 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1863 The elements must also have type TYPE. */
1865 tree
1867 {
1878 INSERT);
1880 {
1885 }
1887 }
1889 /* Create a constant tree with value VALUE in type TYPE. */
1891 tree
1893 {
1897 }
1899 /* Insert INTEGER_CST T into a cache of integer constants. And return
1900 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1901 is false, and T falls into the type's 'smaller values' range, there
1902 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1903 or the value is large, should an existing entry exist, it is
1904 returned (rather than inserting T). */
1906 tree
1908 {
1916 /* The caching indices here must match those in
1917 wide_int_to_type_1. */
1919 {
1922 /* Fallthru. */
1926 {
1934 }
1938 /* Cache false or true. */
1947 {
1948 /* Cache 0..N */
1951 /* This is a little hokie, but if the prec is smaller than
1952 what is necessary to hold param_integer_share_limit, then the
1953 obvious test will not get the correct answer. */
1955 {
1959 }
1962 }
1963 else
1964 {
1965 /* Cache -1..N */
1971 {
1973 {
1976 }
1979 }
1980 }
1984 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1985 members. */
1990 }
1993 {
1994 /* Look for it in the type's vector of small shared ints. */
1996 {
1999 }
2002 {
2005 }
2006 else
2008 }
2009 else
2010 {
2011 /* Use the cache of larger shared ints. */
2014 {
2015 /* If there is already an entry for the number verify it's the
2016 same value. */
2018 /* And return the cached value. */
2020 }
2021 else
2022 /* Otherwise insert this one into the hash table. */
2024 }
2027 }
2030 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2031 and the rest are zeros. */
2033 tree
2035 {
2040 }
2042 /* Checks that X is integer constant that can be expressed in (unsigned)
2043 HOST_WIDE_INT without loss of precision. */
2045 bool
2047 {
2050 }
2052 /* Build a newly constructed VECTOR_CST with the given values of
2053 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2055 tree
2058 {
2060 tree t;
2076 }
2078 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2079 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2081 tree
2083 {
2088 tree value;
2090 /* We can't construct a VECTOR_CST for a variable number of elements. */
2094 {
2096 {
2097 /* If NELTS is constant then this must be too. */
2101 }
2102 else
2104 }
2109 }
2111 /* Build a vector of type VECTYPE where all the elements are SCs. */
2112 tree
2114 {
2120 /* Verify that the vector type is suitable for SC. Note that there
2121 is some inconsistency in the type-system with respect to restrict
2122 qualifications of pointers. Vector types always have a main-variant
2123 element type and the qualification is applied to the vector-type.
2124 So TREE_TYPE (vector-type) does not return a properly qualified
2125 vector element-type. */
2130 {
2134 }
2137 else
2138 {
2144 }
2145 }
2147 /* If TYPE is not a vector type, just return SC, otherwise return
2148 build_vector_from_val (TYPE, SC). */
2150 tree
2152 {
2157 }
2159 /* Build a vector series of type TYPE in which element I has the value
2160 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2161 and a VEC_SERIES_EXPR otherwise. */
2163 tree
2165 {
2169 {
2179 }
2181 }
2183 /* Return a vector with the same number of units and number of bits
2184 as VEC_TYPE, but in which the elements are a linear series of unsigned
2185 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2187 tree
2189 {
2194 {
2195 index_elt_type = build_nonstandard_integer_type
2198 }
2204 }
2206 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2207 elements are A and the rest are B. */
2209 tree
2211 {
2214 /* Optimize the constant case. */
2221 }
2223 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2224 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2226 void
2228 {
2230 tree val;
2236 {
2237 /* Mostly ctors will have elts that don't have side-effects, so
2238 the usual case is to scan all the elements. Hence a single
2239 loop for both const and side effects, rather than one loop
2240 each (with early outs). */
2245 }
2249 }
2251 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2252 CONSTRUCTOR C. */
2254 void
2256 {
2258 tree val;
2264 {
2269 }
2270 }
2272 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2273 are in the vec pointed to by VALS. */
2274 tree
2276 {
2285 }
2287 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2288 INDEX and VALUE. */
2289 tree
2291 {
2299 }
2302 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2303 are in a list pointed to by VALS. */
2304 tree
2306 {
2307 tree t;
2311 {
2315 }
2318 }
2320 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2321 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2322 fields in the constructor remain null. */
2324 tree
2326 {
2333 }
2335 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2336 of elements, provided as index/value pairs. */
2338 tree
2340 {
2347 {
2351 }
2354 }
2356 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2358 tree
2360 {
2365 }
2367 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2369 tree
2371 {
2372 tree v;
2382 }
2384 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2386 tree
2388 {
2389 tree v;
2392 /* dconst{0,1,2,m1,half} are used in various places in
2393 the middle-end and optimizers, allow them here
2394 even for decimal floating point types as an exception
2395 by converting them to decimal. */
2399 {
2409 {
2410 /* Make sure to give zero the minimum quantum exponent for
2411 the type (which corresponds to all bits zero). */
2416 }
2417 else
2419 }
2421 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2422 Consider doing it via real_convert now. */
2429 }
2431 /* Like build_real, but first truncate D to the type. */
2433 tree
2435 {
2437 }
2439 /* Return a new REAL_CST node whose type is TYPE
2440 and whose value is the integer value of the INTEGER_CST node I. */
2442 REAL_VALUE_TYPE
2444 {
2445 REAL_VALUE_TYPE d;
2447 /* Clear all bits of the real value type so that we can later do
2448 bitwise comparisons to see if two values are the same. */
2454 }
2456 /* Given a tree representing an integer constant I, return a tree
2457 representing the same value as a floating-point constant of type TYPE. */
2459 tree
2461 {
2462 tree v;
2469 }
2471 /* Return a new REAL_CST node whose type is TYPE
2472 and whose value is the integer value I which has sign SGN. */
2474 tree
2476 {
2477 REAL_VALUE_TYPE d;
2479 /* Clear all bits of the real value type so that we can later do
2480 bitwise comparisons to see if two values are the same. */
2485 }
2487 /* Return a newly constructed STRING_CST node whose value is the LEN
2488 characters at STR when STR is nonnull, or all zeros otherwise.
2489 Note that for a C string literal, LEN should include the trailing NUL.
2490 The TREE_TYPE is not initialized. */
2492 tree
2494 {
2495 /* Do not waste bytes provided by padding of struct tree_string. */
2508 else
2513 }
2515 /* Return a newly constructed COMPLEX_CST node whose value is
2516 specified by the real and imaginary parts REAL and IMAG.
2517 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2518 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2520 tree
2522 {
2533 }
2535 /* Build a complex (inf +- 0i), such as for the result of cproj.
2536 TYPE is the complex tree type of the result. If NEG is true, the
2537 imaginary zero is negative. */
2539 tree
2541 {
2547 }
2549 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2550 element is set to 1. In particular, this is 1 + i for complex types. */
2552 tree
2554 {
2556 {
2559 }
2560 else
2562 }
2564 /* Return a constant of arithmetic type TYPE which is the
2565 multiplicative identity of the set TYPE. */
2567 tree
2569 {
2571 {
2581 /* We can only generate 1 for accum types. */
2586 {
2590 }
2599 }
2600 }
2602 /* Return an integer of type TYPE containing all 1's in as much precision as
2603 it contains, or a complex or vector whose subparts are such integers. */
2605 tree
2607 {
2609 {
2612 }
2613 else
2615 }
2617 /* Return a constant of arithmetic type TYPE which is the
2618 opposite of the multiplicative identity of the set TYPE. */
2620 tree
2622 {
2624 {
2634 /* We can only generate 1 for accum types. */
2641 {
2645 }
2654 }
2655 }
2657 /* Build 0 constant of type TYPE. This is used by constructor folding
2658 and thus the constant should be represented in memory by
2659 zero(es). */
2661 tree
2663 {
2665 {
2678 {
2682 }
2685 {
2689 }
2695 }
2696 }
2698 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2699 unsigned constant in which only the sign bit is set. Return null
2700 otherwise. */
2702 tree
2704 {
2705 /* Avoid having to choose between a real-only sign and a pair of signs.
2706 This could be relaxed if the choice becomes obvious later. */
2721 {
2724 }
2726 }
2728 /* Build a BINFO with LEN language slots. */
2730 tree
2732 {
2733 tree t;
2748 }
2750 /* Create a CASE_LABEL_EXPR tree node and return it. */
2752 tree
2754 {
2766 }
2768 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2769 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2770 The latter determines the length of the HOST_WIDE_INT vector. */
2772 tree
2774 {
2775 tree t;
2787 /* to_offset can only be applied to trees that are offset_int-sized
2788 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2789 must be exactly the precision of offset_int and so LEN is correct. */
2792 else
2798 }
2800 /* Build a newly constructed TREE_VEC node of length LEN. */
2802 tree
2804 {
2805 tree t;
2816 }
2818 /* Grow a TREE_VEC node to new length LEN. */
2820 tree
2822 {
2838 }
2839 \f
2840 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2841 fixed, and scalar, complex or vector. */
2843 bool
2845 {
2849 }
2851 /* Return 1 if EXPR is the integer constant zero or a complex constant
2852 of zero, or a location wrapper for such a constant. */
2854 bool
2856 {
2860 {
2872 }
2873 }
2875 /* Return 1 if EXPR is the integer constant one or the corresponding
2876 complex constant, or a location wrapper for such a constant. */
2878 bool
2880 {
2884 {
2896 }
2897 }
2899 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2900 return 1 if every piece is the integer constant one.
2901 Also return 1 for location wrappers for such a constant. */
2903 bool
2905 {
2911 else
2913 }
2915 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2916 it contains, or a complex or vector whose subparts are such integers,
2917 or a location wrapper for such a constant. */
2919 bool
2921 {
2939 }
2941 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2942 for such a constant. */
2944 bool
2946 {
2952 else
2954 }
2956 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2957 one bit on), or a location wrapper for such a constant. */
2959 bool
2961 {
2973 }
2975 /* Return 1 if EXPR is an integer constant other than zero or a
2976 complex constant other than zero, or a location wrapper for such a
2977 constant. */
2979 bool
2981 {
2989 }
2991 /* Return 1 if EXPR is the integer constant one. For vector,
2992 return 1 if every piece is the integer constant minus one
2993 (representing the value TRUE).
2994 Also return 1 for location wrappers for such a constant. */
2996 bool
2998 {
3004 }
3006 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
3007 for such a constant. */
3009 bool
3011 {
3016 }
3018 /* Return the power of two represented by a tree node known to be a
3019 power of two. */
3021 int
3023 {
3028 }
3030 /* Similar, but return the largest integer Y such that 2 ** Y is less
3031 than or equal to EXPR. */
3033 int
3035 {
3040 }
3042 /* Return number of known trailing zero bits in EXPR, or, if the value of
3043 EXPR is known to be zero, the precision of it's type. */
3045 unsigned int
3047 {
3054 {
3075 /* Second operand is sizetype, which could be in theory
3076 wider than pointer's precision. Make sure we never
3077 return more than prec. */
3092 {
3095 }
3100 {
3105 }
3114 {
3117 {
3122 }
3123 }
3125 CASE_CONVERT:
3143 {
3146 }
3150 }
3151 }
3153 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
3154 decimal float constants, so don't return 1 for them.
3155 Also return 1 for location wrappers around such a constant. */
3157 bool
3159 {
3163 {
3171 {
3172 /* Don't simply check for a duplicate because the predicate
3173 accepts both +0.0 and -0.0. */
3179 }
3182 }
3183 }
3185 /* Return 1 if EXPR is the real constant one in real or complex form.
3186 Trailing zeroes matter for decimal float constants, so don't return
3187 1 for them.
3188 Also return 1 for location wrappers around such a constant. */
3190 bool
3192 {
3196 {
3209 }
3210 }
3212 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
3213 matter for decimal float constants, so don't return 1 for them.
3214 Also return 1 for location wrappers around such a constant. */
3216 bool
3218 {
3222 {
3235 }
3236 }
3238 /* Return true if T could be a floating point zero. */
3240 bool
3242 {
3244 {
3246 /* Can't use real_zerop here, as it always returns false for decimal
3247 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3248 either, as decimal zeros are rvc_normal. */
3254 {
3260 }
3262 /* Perhaps for SSA_NAMEs we could query frange. */
3264 }
3265 }
3267 /* Nonzero if EXP is a constant or a cast of a constant. */
3269 bool
3271 {
3272 /* This is not quite the same as STRIP_NOPS. It does more. */
3277 }
3279 /* Return true if T holds a polynomial pointer difference, storing it in
3280 *VALUE if so. A true return means that T's precision is no greater
3281 than 64 bits, which is the largest address space we support, so *VALUE
3282 never loses precision. However, the signedness of the result does
3283 not necessarily match the signedness of T: sometimes an unsigned type
3284 like sizetype is used to encode a value that is actually negative. */
3286 bool
3288 {
3292 {
3297 }
3299 {
3306 }
3308 }
3310 poly_int64
3312 {
3317 }
3319 poly_uint64
3321 {
3326 }
3327 \f
3328 /* Return first list element whose TREE_VALUE is ELEM.
3329 Return 0 if ELEM is not in LIST. */
3331 tree
3333 {
3335 {
3339 }
3341 }
3343 /* Return first list element whose TREE_PURPOSE is ELEM.
3344 Return 0 if ELEM is not in LIST. */
3346 tree
3348 {
3350 {
3354 }
3356 }
3358 /* Return true if ELEM is in V. */
3360 bool
3362 {
3364 tree t;
3369 }
3371 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3372 NULL_TREE. */
3374 tree
3376 {
3380 }
3382 /* Return nonzero if ELEM is part of the chain CHAIN. */
3384 bool
3386 {
3388 {
3392 }
3395 }
3397 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3398 We expect a null pointer to mark the end of the chain.
3399 This is the Lisp primitive `length'. */
3401 int
3403 {
3405 #ifdef ENABLE_TREE_CHECKING
3407 #endif
3411 {
3413 #ifdef ENABLE_TREE_CHECKING
3417 #endif
3418 len++;
3419 }
3422 }
3424 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3425 UNION_TYPE TYPE, or NULL_TREE if none. */
3427 tree
3429 {
3434 }
3436 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3437 UNION_TYPE TYPE, or NULL_TREE if none. */
3439 tree
3441 {
3445 {
3450 }
3453 }
3455 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3456 by modifying the last node in chain 1 to point to chain 2.
3457 This is the Lisp primitive `nconc'. */
3459 tree
3461 {
3462 tree t1;
3473 #ifdef ENABLE_TREE_CHECKING
3474 {
3475 tree t2;
3478 }
3479 #endif
3482 }
3484 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3486 tree
3488 {
3489 tree next;
3494 }
3496 /* Reverse the order of elements in the chain T,
3497 and return the new head of the chain (old last element). */
3499 tree
3501 {
3504 {
3505 /* We shouldn't be using this function to reverse BLOCK chains; we
3506 have blocks_nreverse for that. */
3511 }
3513 }
3514 \f
3515 /* Return a newly created TREE_LIST node whose
3516 purpose and value fields are PARM and VALUE. */
3518 tree
3520 {
3525 }
3527 /* Build a chain of TREE_LIST nodes from a vector. */
3529 tree
3531 {
3535 tree t;
3537 {
3540 }
3542 }
3544 /* Return a newly created TREE_LIST node whose
3545 purpose and value fields are PURPOSE and VALUE
3546 and whose TREE_CHAIN is CHAIN. */
3548 tree
3550 {
3551 tree node;
3563 }
3565 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3566 trees. */
3570 {
3574 tree val;
3580 }
3581 \f
3582 /* Return the size nominally occupied by an object of type TYPE
3583 when it resides in memory. The value is measured in units of bytes,
3584 and its data type is that normally used for type sizes
3585 (which is the first type created by make_signed_type or
3586 make_unsigned_type). */
3588 tree
3590 {
3591 tree t;
3600 {
3603 }
3606 }
3608 /* Return the size of TYPE (in bytes) as a wide integer
3609 or return -1 if the size can vary or is larger than an integer. */
3611 HOST_WIDE_INT
3613 {
3614 tree t;
3624 else
3626 }
3628 /* Return the maximum size of TYPE (in bytes) as a wide integer
3629 or return -1 if the size can vary or is larger than an integer. */
3631 HOST_WIDE_INT
3633 {
3635 tree size_tree;
3637 /* If this is an array type, check for a possible MAX_SIZE attached. */
3640 {
3645 }
3647 /* If we still haven't been able to get a size, see if the language
3648 can compute a maximum size. */
3651 {
3656 }
3659 }
3660 \f
3661 /* Return the bit position of FIELD, in bits from the start of the record.
3662 This is a tree of type bitsizetype. */
3664 tree
3666 {
3669 }
3670 \f
3671 /* Return the byte position of FIELD, in bytes from the start of the record.
3672 This is a tree of type sizetype. */
3674 tree
3676 {
3679 }
3681 /* Likewise, but return as an integer. It must be representable in
3682 that way (since it could be a signed value, we don't have the
3683 option of returning -1 like int_size_in_byte can. */
3685 HOST_WIDE_INT
3687 {
3689 }
3690 \f
3691 /* Return, as a tree node, the number of elements for TYPE (which is an
3692 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3694 tree
3696 {
3699 /* If they did it with unspecified bounds, then we should have already
3700 given an error about it before we got here. */
3708 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3710 {
3711 /* zero sized arrays are represented from C FE as complete types with
3712 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3713 them as min 0, max -1. */
3720 }
3723 ? max
3725 }
3726 \f
3727 /* If arg is static -- a reference to an object in static storage -- then
3728 return the object. This is not the same as the C meaning of `static'.
3729 If arg isn't static, return NULL. */
3731 tree
3733 {
3735 {
3737 /* Nested functions are static, even though taking their address will
3738 involve a trampoline as we unnest the nested function and create
3739 the trampoline on the tree level. */
3760 /* If the thing being referenced is not a field, then it is
3761 something language specific. */
3764 /* If we are referencing a bitfield, we can't evaluate an
3765 ADDR_EXPR at compile time and so it isn't a constant. */
3782 else
3790 }
3791 }
3793 \f
3796 /* Return whether OP is a DECL whose address is function-invariant. */
3798 bool
3800 {
3801 /* The conditions below are slightly less strict than the one in
3802 staticp. */
3805 {
3828 }
3831 }
3833 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3835 bool
3837 {
3838 /* The conditions below are slightly less strict than the one in
3839 staticp. */
3842 {
3862 }
3865 }
3868 /* Return true if T is function-invariant (internal function, does
3869 not handle arithmetic; that's handled in skip_simple_arithmetic and
3870 tree_invariant_p). */
3872 static bool
3874 {
3875 tree op;
3882 {
3889 {
3891 {
3906 }
3908 }
3914 }
3917 }
3919 /* Return true if T is function-invariant. */
3921 bool
3923 {
3926 }
3928 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3929 Do this to any expression which may be used in more than one place,
3930 but must be evaluated only once.
3932 Normally, expand_expr would reevaluate the expression each time.
3933 Calling save_expr produces something that is evaluated and recorded
3934 the first time expand_expr is called on it. Subsequent calls to
3935 expand_expr just reuse the recorded value.
3937 The call to expand_expr that generates code that actually computes
3938 the value is the first call *at compile time*. Subsequent calls
3939 *at compile time* generate code to use the saved value.
3940 This produces correct result provided that *at run time* control
3941 always flows through the insns made by the first expand_expr
3942 before reaching the other places where the save_expr was evaluated.
3943 You, the caller of save_expr, must make sure this is so.
3945 Constants, and certain read-only nodes, are returned with no
3946 SAVE_EXPR because that is safe. Expressions containing placeholders
3947 are not touched; see tree.def for an explanation of what these
3948 are used for. */
3950 tree
3952 {
3953 tree inner;
3955 /* If the tree evaluates to a constant, then we don't want to hide that
3956 fact (i.e. this allows further folding, and direct checks for constants).
3957 However, a read-only object that has side effects cannot be bypassed.
3958 Since it is no problem to reevaluate literals, we just return the
3959 literal node. */
3967 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3968 it means that the size or offset of some field of an object depends on
3969 the value within another field.
3971 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3972 and some variable since it would then need to be both evaluated once and
3973 evaluated more than once. Front-ends must assure this case cannot
3974 happen by surrounding any such subexpressions in their own SAVE_EXPR
3975 and forcing evaluation at the proper time. */
3981 /* This expression might be placed ahead of a jump to ensure that the
3982 value was computed on both sides of the jump. So make sure it isn't
3983 eliminated as dead. */
3986 }
3988 /* Look inside EXPR into any simple arithmetic operations. Return the
3989 outermost non-arithmetic or non-invariant node. */
3991 tree
3993 {
3994 /* We don't care about whether this can be used as an lvalue in this
3995 context. */
3999 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
4000 a constant, it will be more efficient to not make another SAVE_EXPR since
4001 it will allow better simplification and GCSE will be able to merge the
4002 computations if they actually occur. */
4004 {
4008 {
4013 else
4015 }
4016 else
4018 }
4021 }
4023 /* Look inside EXPR into simple arithmetic operations involving constants.
4024 Return the outermost non-arithmetic or non-constant node. */
4026 tree
4028 {
4033 {
4037 {
4042 else
4044 }
4045 else
4047 }
4050 }
4052 /* Return which tree structure is used by T. */
4054 enum tree_node_structure_enum
4056 {
4059 }
4061 /* Set various status flags when building a CALL_EXPR object T. */
4063 static void
4065 {
4070 /* Calls have side-effects, except those to const or pure functions. */
4073 /* Propagate TREE_READONLY of arguments for const functions. */
4079 {
4085 }
4089 }
4090 \f
4091 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4092 size or offset that depends on a field within a record. */
4094 bool
4096 {
4107 {
4109 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4110 position computations since they will be converted into a
4111 WITH_RECORD_EXPR involving the reference, which will assume
4112 here will be valid. */
4126 {
4128 /* Ignoring the first operand isn't quite right, but works best. */
4137 /* The save_expr function never wraps anything containing
4138 a PLACEHOLDER_EXPR. */
4143 }
4146 {
4154 }
4158 {
4160 {
4161 const_tree arg;
4162 const_call_expr_arg_iterator iter;
4167 }
4170 }
4174 }
4176 }
4178 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4179 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4180 field positions. */
4182 static bool
4184 {
4185 /* If the size contains a placeholder or the parent type (component type in
4186 the case of arrays) type involves a placeholder, this type does. */
4194 /* Now do type-specific checks. Note that the last part of the check above
4195 greatly limits what we have to do below. */
4197 {
4215 /* Here we just check the bounds. */
4220 /* We have already checked the component type above, so just check
4221 the domain type. Flexible array members have a null domain. */
4228 {
4229 tree field;
4240 }
4244 }
4245 }
4247 /* Wrapper around above function used to cache its result. */
4249 bool
4251 {
4254 /* If the contains_placeholder_bits field has been initialized,
4255 then we know the answer. */
4259 /* Indicate that we've seen this type node, and the answer is false.
4260 This is what we want to return if we run into recursion via fields. */
4263 /* Compute the real value. */
4266 /* Store the real value. */
4270 }
4271 \f
4272 /* Push tree EXP onto vector QUEUE if it is not already present. */
4274 static void
4276 {
4278 tree iter;
4286 }
4288 /* Given a tree EXP, find all occurrences of references to fields
4289 in a PLACEHOLDER_EXPR and place them in vector REFS without
4290 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4291 we assume here that EXP contains only arithmetic expressions
4292 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4293 argument list. */
4295 void
4297 {
4299 tree inner;
4302 /* We handle TREE_LIST and COMPONENT_REF separately. */
4304 {
4307 }
4309 {
4313 ;
4317 else
4319 }
4320 else
4322 {
4327 /* Variables allocated to static storage can stay. */
4333 /* This is the pattern built in ada/make_aligning_type. */
4336 {
4339 }
4341 /* Fall through. */
4359 }
4360 }
4362 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4363 return a tree with all occurrences of references to F in a
4364 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4365 CONST_DECLs. Note that we assume here that EXP contains only
4366 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4367 occurring only in their argument list. */
4369 tree
4371 {
4374 tree new_tree;
4376 /* We handle TREE_LIST and COMPONENT_REF separately. */
4378 {
4385 }
4387 {
4388 tree inner;
4390 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4391 and it is the right field, replace it with R. */
4395 ;
4397 /* The field. */
4403 /* If this expression hasn't been completed let, leave it alone. */
4411 new_tree
4413 }
4414 else
4416 {
4423 else
4430 /* Fall through. */
4438 {
4483 new_tree
4489 }
4493 {
4498 /* If we are trying to replace F with a constant or with another
4499 instance of one of the arguments of the call, inline back
4500 functions which do nothing else than computing a value from
4501 the arguments they are passed. This makes it possible to
4502 fold partially or entirely the replacement expression. */
4504 {
4508 else
4511 {
4514 }
4516 {
4520 }
4521 }
4524 {
4528 {
4532 }
4533 }
4536 {
4540 }
4541 else
4543 }
4548 }
4556 }
4558 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4559 for it within OBJ, a tree that is an object or a chain of references. */
4561 tree
4563 {
4566 tree new_tree;
4568 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4569 in the chain of OBJ. */
4571 {
4573 tree elt;
4603 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4604 survives until RTL generation, there will be an error. */
4606 }
4608 /* TREE_LIST is special because we need to look at TREE_VALUE
4609 and TREE_CHAIN, not TREE_OPERANDS. */
4611 {
4618 }
4619 else
4621 {
4634 {
4679 new_tree
4685 }
4689 {
4695 {
4699 {
4703 }
4704 }
4707 {
4711 }
4712 else
4714 }
4719 }
4727 }
4728 \f
4730 /* Subroutine of stabilize_reference; this is called for subtrees of
4731 references. Any expression with side-effects must be put in a SAVE_EXPR
4732 to ensure that it is only evaluated once.
4734 We don't put SAVE_EXPR nodes around everything, because assigning very
4735 simple expressions to temporaries causes us to miss good opportunities
4736 for optimizations. Among other things, the opportunity to fold in the
4737 addition of a constant into an addressing mode often gets lost, e.g.
4738 "y[i+1] += x;". In general, we take the approach that we should not make
4739 an assignment unless we are forced into it - i.e., that any non-side effect
4740 operator should be allowed, and that cse should take care of coalescing
4741 multiple utterances of the same expression should that prove fruitful. */
4743 static tree
4745 {
4746 tree result;
4749 /* We cannot ignore const expressions because it might be a reference
4750 to a const array but whose index contains side-effects. But we can
4751 ignore things that are actual constant or that already have been
4752 handled by this function. */
4758 {
4760 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4761 have side-effects. */
4764 /* FALLTHRU */
4772 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4773 so that it will only be evaluated once. */
4774 /* The reference (r) and comparison (<) classes could be handled as
4775 below, but it is generally faster to only evaluate them once. */
4781 /* Constants need no processing. In fact, we should never reach
4782 here. */
4786 /* Division is slow and tends to be compiled with jumps,
4787 especially the division by powers of 2 that is often
4788 found inside of an array reference. So do it just once. */
4794 /* Recursively stabilize each operand. */
4800 /* Recursively stabilize each operand. */
4806 }
4814 }
4816 /* Stabilize a reference so that we can use it any number of times
4817 without causing its operands to be evaluated more than once.
4818 Returns the stabilized reference. This works by means of save_expr,
4819 so see the caveats in the comments about save_expr.
4821 Also allows conversion expressions whose operands are references.
4822 Any other kind of expression is returned unchanged. */
4824 tree
4826 {
4827 tree result;
4831 {
4835 /* No action is needed in this case. */
4838 CASE_CONVERT:
4877 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4878 it wouldn't be ignored. This matters when dealing with
4879 volatiles. */
4882 /* If arg isn't a kind of lvalue we recognize, make no change.
4883 Caller should recognize the error for an invalid lvalue. */
4889 }
4898 }
4899 \f
4900 /* Low-level constructors for expressions. */
4902 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4903 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4905 void
4907 {
4908 tree node;
4913 /* We started out assuming this address is both invariant and constant, but
4914 does not have side effects. Now go down any handled components and see if
4915 any of them involve offsets that are either non-constant or non-invariant.
4916 Also check for side-effects.
4918 ??? Note that this code makes no attempt to deal with the case where
4919 taking the address of something causes a copy due to misalignment. */
4921 #define UPDATE_FLAGS(NODE) \
4922 do { tree _node = (NODE); \
4923 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4924 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4928 {
4929 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4930 array reference (probably made temporarily by the G++ front end),
4931 so ignore all the operands. */
4935 {
4941 }
4942 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4943 FIELD_DECL, apparently. The G++ front end can put something else
4944 there, at least temporarily. */
4947 {
4950 }
4951 }
4955 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4956 the address, since &(*a)->b is a form of addition. If it's a constant, the
4957 address is constant too. If it's a decl, its address is constant if the
4958 decl is static. Everything else is not constant and, furthermore,
4959 taking the address of a volatile variable is not volatile. */
4964 ;
4967 else
4968 {
4971 }
4976 #undef UPDATE_FLAGS
4977 }
4979 /* Build an expression of code CODE, data type TYPE, and operands as
4980 specified. Expressions and reference nodes can be created this way.
4981 Constants, decls, types and misc nodes cannot be.
4983 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4984 enough for all extant tree codes. */
4986 tree
4988 {
4989 tree t;
4997 }
4999 tree
5001 {
5003 tree t;
5019 {
5022 }
5025 {
5028 }
5030 {
5032 /* All of these have side-effects, no matter what their
5033 operands are. */
5039 /* Whether a dereference is readonly has nothing to do with whether
5040 its operand is readonly. */
5058 }
5061 }
5063 #define PROCESS_ARG(N) \
5064 do { \
5065 TREE_OPERAND (t, N) = arg##N; \
5066 if (arg##N &&!TYPE_P (arg##N)) \
5067 { \
5068 if (TREE_SIDE_EFFECTS (arg##N)) \
5069 side_effects = 1; \
5070 if (!TREE_READONLY (arg##N) \
5071 && !CONSTANT_CLASS_P (arg##N)) \
5072 (void) (read_only = 0); \
5073 if (!TREE_CONSTANT (arg##N)) \
5074 (void) (constant = 0); \
5075 } \
5076 } while (0)
5078 tree
5080 {
5082 tree t;
5088 /* When sizetype precision doesn't match that of pointers
5089 we need to be able to build explicit extensions or truncations
5090 of the offset argument. */
5102 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5103 result based on those same flags for the arguments. But if the
5104 arguments aren't really even `tree' expressions, we shouldn't be trying
5105 to do this. */
5107 /* Expressions without side effects may be constant if their
5108 arguments are as well. */
5115 {
5129 }
5136 {
5138 {
5142 }
5143 }
5144 else
5145 {
5147 /* Don't mark X / 0 as constant. */
5152 }
5155 }
5158 tree
5160 tree arg2 MEM_STAT_DECL)
5161 {
5163 tree t;
5173 /* As a special exception, if COND_EXPR has NULL branches, we
5174 assume that it is a gimple statement and always consider
5175 it to have side effects. */
5181 else
5197 }
5199 tree
5202 {
5204 tree t;
5224 }
5226 tree
5229 {
5231 tree t;
5248 {
5250 {
5254 }
5255 }
5256 else
5262 }
5264 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5265 on the pointer PTR. */
5267 tree
5269 {
5272 tree tem;
5273 /* For convenience allow addresses that collapse to a simple base
5274 and offset. */
5278 {
5282 {
5285 }
5286 else
5289 }
5294 }
5296 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5298 poly_offset_int
5300 {
5302 SIGNED);
5303 }
5305 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5306 offsetted by OFFSET units. */
5308 tree
5310 {
5317 }
5319 /* Similar except don't specify the TREE_TYPE
5320 and leave the TREE_SIDE_EFFECTS as 0.
5321 It is permissible for arguments to be null,
5322 or even garbage if their values do not matter. */
5324 tree
5326 {
5327 tree t;
5344 }
5346 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5347 tree vec. */
5349 tree
5351 {
5361 }
5362 \f
5363 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5364 and data type TYPE.
5365 We do NOT enter this node in any sort of symbol table.
5367 LOC is the location of the decl.
5369 layout_decl is used to set up the decl's storage layout.
5370 Other slots are initialized to 0 or null pointers. */
5372 tree
5374 tree type MEM_STAT_DECL)
5375 {
5376 tree t;
5381 /* if (type == error_mark_node)
5382 type = integer_type_node; */
5383 /* That is not done, deliberately, so that having error_mark_node
5384 as the type can suppress useless errors in the use of this variable. */
5393 }
5395 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5397 tree
5399 {
5405 }
5407 /* Builds and returns function declaration with NAME and TYPE. */
5409 tree
5411 {
5421 }
5425 /* Builds a new translation-unit decl with name NAME, queues it in the
5426 global list of translation-unit decls and returns it. */
5428 tree
5430 {
5436 }
5438 \f
5439 /* BLOCK nodes are used to represent the structure of binding contours
5440 and declarations, once those contours have been exited and their contents
5441 compiled. This information is used for outputting debugging info. */
5443 tree
5445 {
5453 }
5455 \f
5456 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5458 LOC is the location to use in tree T. */
5460 void
5462 {
5466 {
5470 }
5471 }
5473 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5474 UNKNOWN_LOCATION. */
5476 void
5478 {
5482 }
5483 \f
5484 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5485 of the various TYPE_QUAL values. */
5487 static void
5489 {
5495 }
5497 /* Returns true iff CAND and BASE have equivalent language-specific
5498 qualifiers. */
5500 bool
5502 {
5505 /* type_hash_eq currently only applies to these types. */
5510 }
5512 /* This function checks to see if TYPE matches the size one of the built-in
5513 atomic types, and returns that core atomic type. */
5515 static tree
5517 {
5518 tree base_atomic_type;
5520 /* Only handle complete types. */
5525 {
5548 }
5551 }
5553 /* Returns true iff unqualified CAND and BASE are equivalent. */
5555 bool
5557 {
5559 /* Apparently this is needed for Objective-C. */
5564 /* Check alignment. */
5568 /* Atomic types increase minimal alignment. We must to do so as well
5569 or we get duplicated canonical types. See PR88686. */
5571 {
5572 /* See if this object can map to a basic atomic type. */
5576 }
5578 }
5580 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5582 bool
5584 {
5588 }
5590 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5592 static bool
5594 {
5597 /* Apparently this is needed for Objective-C. */
5599 /* Check alignment. */
5601 /* Check this is a user-aligned type as build_aligned_type
5602 would create. */
5607 }
5609 /* Return a version of the TYPE, qualified as indicated by the
5610 TYPE_QUALS, if one exists. If no qualified version exists yet,
5611 return NULL_TREE. */
5613 tree
5615 {
5623 /* Search the chain of variants to see if there is already one there just
5624 like the one we need to have. If so, use that existing one. We must
5625 preserve the TYPE_NAME, since there is code that depends on this. */
5628 {
5629 /* Put the found variant at the head of the variant list so
5630 frequently searched variants get found faster. The C++ FE
5631 benefits greatly from this. */
5637 }
5640 }
5642 /* Like get_qualified_type, but creates the type if it does not
5643 exist. This function never returns NULL_TREE. */
5645 tree
5647 {
5648 tree t;
5650 /* See if we already have the appropriate qualified variant. */
5653 /* If not, build it. */
5655 {
5660 {
5661 /* See if this object can map to a basic atomic type. */
5664 {
5665 /* Ensure the alignment of this type is compatible with
5666 the required alignment of the atomic type. */
5669 }
5670 }
5673 /* Propagate structural equality. */
5676 /* Build the underlying canonical type, since it is different
5677 from TYPE. */
5678 {
5681 }
5682 else
5683 /* T is its own canonical type. */
5686 }
5689 }
5691 /* Create a variant of type T with alignment ALIGN. */
5693 tree
5695 {
5696 tree t;
5711 }
5713 /* Create a new distinct copy of TYPE. The new type is made its own
5714 MAIN_VARIANT. If TYPE requires structural equality checks, the
5715 resulting type requires structural equality checks; otherwise, its
5716 TYPE_CANONICAL points to itself. */
5718 tree
5720 {
5726 /* Set the canonical type either to a new equivalence class, or
5727 propagate the need for structural equality checks. */
5730 else
5733 /* Make it its own variant. */
5737 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5738 whose TREE_TYPE is not t. This can also happen in the Ada
5739 frontend when using subtypes. */
5742 }
5744 /* Create a new variant of TYPE, equivalent but distinct. This is so
5745 the caller can modify it. TYPE_CANONICAL for the return type will
5746 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5747 are considered equal by the language itself (or that both types
5748 require structural equality checks). */
5750 tree
5752 {
5757 /* Since we're building a variant, assume that it is a non-semantic
5758 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5760 /* Type variants have no alias set defined. */
5763 /* Add the new type to the chain of variants of TYPE. */
5769 }
5770 \f
5771 /* Return true if the from tree in both tree maps are equal. */
5773 int
5775 {
5779 }
5781 /* Hash a from tree in a tree_base_map. */
5783 unsigned int
5785 {
5787 }
5789 /* Return true if this tree map structure is marked for garbage collection
5790 purposes. We simply return true if the from tree is marked, so that this
5791 structure goes away when the from tree goes away. */
5793 int
5795 {
5797 }
5799 /* Hash a from tree in a tree_map. */
5801 unsigned int
5803 {
5805 }
5807 /* Hash a from tree in a tree_decl_map. */
5809 unsigned int
5811 {
5813 }
5815 /* Return the initialization priority for DECL. */
5817 priority_type
5819 {
5824 return
5826 }
5828 /* Return the finalization priority for DECL. */
5830 priority_type
5832 {
5837 return
5839 }
5841 /* Set the initialization priority for DECL to PRIORITY. */
5843 void
5845 {
5849 {
5853 }
5856 else
5859 }
5861 /* Set the finalization priority for DECL to PRIORITY. */
5863 void
5865 {
5869 {
5873 }
5874 else
5877 }
5879 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5881 static void
5883 {
5888 }
5890 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5892 static void
5894 {
5899 }
5901 /* Lookup a debug expression for FROM, and return it if we find one. */
5903 tree
5905 {
5913 }
5915 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5917 void
5919 {
5926 }
5928 /* Lookup a value expression for FROM, and return it if we find one. */
5930 tree
5932 {
5940 }
5942 /* Insert a mapping FROM->TO in the value expression hashtable. */
5944 void
5946 {
5949 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5956 }
5958 /* Lookup a vector of debug arguments for FROM, and return it if we
5959 find one. */
5963 {
5974 }
5976 /* Insert a mapping FROM->empty vector of debug arguments in the value
5977 expression hashtable. */
5981 {
5996 }
5998 /* Hashing of types so that we don't make duplicates.
5999 The entry point is `type_hash_canon'. */
6001 /* Generate the default hash code for TYPE. This is designed for
6002 speed, rather than maximum entropy. */
6004 hashval_t
6006 {
6015 /* Just the identifier is adequate to distinguish. */
6019 {
6022 /* FALLTHROUGH. */
6034 {
6038 {
6041 }
6042 }
6046 {
6053 }
6057 {
6061 }
6069 }
6072 }
6074 /* These are the Hashtable callback functions. */
6076 /* Returns true iff the types are equivalent. */
6078 bool
6080 {
6081 /* First test the things that are the same for all types. */
6091 /* Be careful about comparing arrays before and after the element type
6092 has been completed; don't compare TYPE_ALIGN unless both types are
6093 complete. */
6100 {
6123 /* fall through */
6155 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6156 where the flag should be inherited from the element type
6157 and can change after ARRAY_TYPEs are created; on non-aggregates
6158 compare it and hash it, scalars will never have that flag set
6159 and we need to differentiate between arrays created by different
6160 front-ends or middle-end created arrays. */
6192 }
6198 }
6200 /* Given TYPE, and HASHCODE its hash code, return the canonical
6201 object for an identical type if one already exists.
6202 Otherwise, return TYPE, and record it as the canonical object.
6204 To use this function, first create a type of the sort you want.
6205 Then compute its hash code from the fields of the type that
6206 make it different from other similar types.
6207 Then call this function and use the value. */
6209 tree
6211 {
6212 type_hash in;
6215 /* The hash table only contains main variants, so ensure that's what we're
6216 being passed. */
6219 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6220 must call that routine before comparing TYPE_ALIGNs. */
6228 {
6234 /* Free also min/max values and the cache for integer
6235 types. This can't be done in free_node, as LTO frees
6236 those on its own. */
6238 {
6241 {
6242 /* Zero is always in TYPE_CACHED_VALUES. */
6246 }
6249 {
6252 }
6255 }
6258 }
6259 else
6260 {
6269 }
6270 }
6272 static void
6274 {
6279 }
6281 /* Given two lists of types
6282 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6283 return 1 if the lists contain the same types in the same order.
6284 Also, the TREE_PURPOSEs must match. */
6286 bool
6288 {
6300 }
6302 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6303 given by TYPE. If the argument list accepts variable arguments,
6304 then this function counts only the ordinary arguments. */
6306 int
6308 {
6312 /* If the function does not take a variable number of arguments,
6313 the last element in the list will have type `void'. */
6316 else
6320 }
6322 /* Return the type of the function TYPE's argument ARGNO if known.
6323 For vararg function's where ARGNO refers to one of the variadic
6324 arguments return null. Otherwise, return a void_type_node for
6325 out-of-bounds ARGNO. */
6327 tree
6329 {
6330 /* Treat zero the same as an out-of-bounds argument number. */
6334 function_args_iterator iter;
6336 tree argtype;
6339 {
6340 /* A vararg function's argument list ends in a null. Otherwise,
6341 an ordinary function's argument list ends with void. Return
6342 null if ARGNO refers to a vararg argument, void_type_node if
6343 it's out of bounds, and the formal argument type otherwise. */
6351 }
6354 }
6356 /* Nonzero if integer constants T1 and T2
6357 represent the same constant value. */
6359 int
6361 {
6377 }
6379 /* Return true if T is an INTEGER_CST whose numerical value (extended
6380 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6382 bool
6384 {
6388 }
6390 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6391 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6393 bool
6395 {
6399 {
6404 }
6407 }
6409 /* Return true if T is an INTEGER_CST whose numerical value (extended
6410 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6412 bool
6414 {
6418 }
6420 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6421 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6423 bool
6425 {
6429 {
6434 }
6437 }
6439 /* T is an INTEGER_CST whose numerical value (extended according to
6440 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6441 HOST_WIDE_INT. */
6443 HOST_WIDE_INT
6445 {
6448 }
6450 /* T is an INTEGER_CST whose numerical value (extended according to
6451 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6452 HOST_WIDE_INT. */
6454 unsigned HOST_WIDE_INT
6456 {
6459 }
6461 /* Return the most significant (sign) bit of T. */
6463 int
6465 {
6469 }
6471 /* Return an indication of the sign of the integer constant T.
6472 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6473 Note that -1 will never be returned if T's type is unsigned. */
6475 int
6477 {
6484 else
6486 }
6488 /* Return the minimum number of bits needed to represent VALUE in a
6489 signed or unsigned type, UNSIGNEDP says which. */
6491 unsigned int
6493 {
6494 /* If the value is negative, compute its negative minus 1. The latter
6495 adjustment is because the absolute value of the largest negative value
6496 is one larger than the largest positive value. This is equivalent to
6497 a bit-wise negation, so use that operation instead. */
6502 /* Return the number of bits needed, taking into account the fact
6503 that we need one more bit for a signed than unsigned type.
6504 If value is 0 or -1, the minimum precision is 1 no matter
6505 whether unsignedp is true or false. */
6509 else
6511 }
6513 /* Return truthvalue of whether T1 is the same tree structure as T2.
6514 Return 1 if they are the same.
6515 Return 0 if they are understandably different.
6516 Return -1 if either contains tree structure not understood by
6517 this function. */
6519 int
6521 {
6531 /* For location wrappers to be the same, they must be at the same
6532 source location (and wrap the same thing). */
6534 {
6538 }
6544 {
6548 else
6550 }
6560 {
6576 {
6585 /* ??? Should we handle also fields here? */
6589 }
6600 {
6608 {
6612 }
6614 }
6617 /* Special case: if either target is an unallocated VAR_DECL,
6618 it means that it's going to be unified with whatever the
6619 TARGET_EXPR is really supposed to initialize, so treat it
6620 as being equivalent to anything. */
6628 else
6657 /* A false return means maybe_ne rather than known_ne. */
6663 }
6665 /* This general rule works for most tree codes. All exceptions should be
6666 handled above. If this is a language-specific tree code, we can't
6667 trust what might be in the operand, so say we don't know
6668 the situation. */
6673 {
6682 {
6686 }
6692 }
6693 }
6695 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6696 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6697 than U, respectively. */
6699 int
6701 {
6710 else
6712 }
6714 /* Return true if SIZE represents a constant size that is in bounds of
6715 what the middle-end and the backend accepts (covering not more than
6716 half of the address-space).
6717 When PERR is non-null, set *PERR on failure to the description of
6718 why SIZE is not valid. */
6720 bool
6722 {
6724 {
6731 }
6733 cst_size_error error;
6738 {
6741 }
6744 {
6747 }
6750 {
6753 }
6757 {
6760 }
6763 }
6765 /* Return the precision of the type, or for a complex or vector type the
6766 precision of the type of its elements. */
6768 unsigned int
6770 {
6778 }
6780 /* Return true if CODE represents an associative tree code. Otherwise
6781 return false. */
6782 bool
6784 {
6786 {
6798 }
6800 }
6802 /* Return true if CODE represents a commutative tree code. Otherwise
6803 return false. */
6804 bool
6806 {
6808 {
6835 }
6837 }
6839 /* Return true if CODE represents a ternary tree code for which the
6840 first two operands are commutative. Otherwise return false. */
6841 bool
6843 {
6845 {
6853 }
6855 }
6857 /* Returns true if CODE can overflow. */
6859 bool
6861 {
6863 {
6868 /* Can overflow in various ways. */
6874 /* For INT_MIN / -1. */
6878 /* For -INT_MIN. */
6881 /* These operators cannot overflow. */
6883 }
6884 }
6886 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6887 ftrapv doesn't generate trapping insns for CODE. */
6889 bool
6891 {
6894 /* We don't generate instructions that trap on overflow for complex or vector
6895 types. */
6903 {
6909 /* These operators can overflow, and -ftrapv generates trapping code for
6910 these. */
6917 /* These operators can overflow, but -ftrapv does not generate trapping
6918 code for these. */
6921 /* These operators cannot overflow. */
6923 }
6924 }
6926 /* Constructors for pointer, array and function types.
6927 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6928 constructed by language-dependent code, not here.) */
6930 /* Construct, lay out and return the type of pointers to TO_TYPE with
6931 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6932 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6933 indicate this type can reference all of memory. If such a type has
6934 already been constructed, reuse it. */
6936 tree
6939 {
6940 tree t;
6947 {
6950 }
6952 /* If the pointed-to type has the may_alias attribute set, force
6953 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6957 /* In some cases, languages will have things that aren't a POINTER_TYPE
6958 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6959 In that case, return that type without regard to the rest of our
6960 operands.
6962 ??? This is a kludge, but consistent with the way this function has
6963 always operated and there doesn't seem to be a good way to avoid this
6964 at the moment. */
6969 /* First, if we already have a type for pointers to TO_TYPE and it's
6970 the proper mode, use it. */
6983 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
6991 /* Lay out the type. This function has many callers that are concerned
6992 with expression-construction, and this simplifies them all. */
6996 }
6998 /* By default build pointers in ptr_mode. */
7000 tree
7002 {
7004 }
7006 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7008 tree
7011 {
7012 tree t;
7019 {
7022 }
7024 /* If the pointed-to type has the may_alias attribute set, force
7025 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7029 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7030 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7031 In that case, return that type without regard to the rest of our
7032 operands.
7034 ??? This is a kludge, but consistent with the way this function has
7035 always operated and there doesn't seem to be a good way to avoid this
7036 at the moment. */
7041 /* First, if we already have a type for pointers to TO_TYPE and it's
7042 the proper mode, use it. */
7055 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7066 }
7069 /* Build the node for the type of references-to-TO_TYPE by default
7070 in ptr_mode. */
7072 tree
7074 {
7076 }
7078 #define MAX_INT_CACHED_PREC \
7079 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7082 static void
7084 {
7086 {
7088 }
7089 }
7091 /* Builds a signed or unsigned integer type of precision PRECISION.
7092 Used for C bitfields whose precision does not match that of
7093 built-in target types. */
7094 tree
7097 {
7104 {
7108 }
7115 else
7125 }
7127 #define MAX_BOOL_CACHED_PREC \
7128 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7131 /* Builds a boolean type of precision PRECISION.
7132 Used for boolean vectors to choose proper vector element size. */
7133 tree
7135 {
7136 tree type;
7139 {
7143 }
7153 }
7155 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7156 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7157 is true, reuse such a type that has already been constructed. */
7159 static tree
7161 {
7184 {
7185 /* Since we cannot reliably merge this type, we need to compare it using
7186 structural equality checks. */
7189 }
7195 }
7197 /* Wrapper around build_range_type_1 with SHARED set to true. */
7199 tree
7201 {
7203 }
7205 /* Wrapper around build_range_type_1 with SHARED set to false. */
7207 tree
7209 {
7211 }
7213 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7214 MAXVAL should be the maximum value in the domain
7215 (one less than the length of the array).
7217 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7218 We don't enforce this limit, that is up to caller (e.g. language front end).
7219 The limit exists because the result is a signed type and we don't handle
7220 sizes that use more than one HOST_WIDE_INT. */
7222 tree
7224 {
7226 }
7228 /* Return true if the debug information for TYPE, a subtype, should be emitted
7229 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7230 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7231 debug info and doesn't reflect the source code. */
7233 bool
7235 {
7238 /* Subrange types have a base type which is an integral type. */
7242 /* Get the real bounds of the subtype. */
7245 else
7246 {
7249 }
7251 /* If the type and its base type have the same representation and the same
7252 name, then the type is not a subrange but a copy of the base type. */
7266 }
7268 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7269 and number of elements specified by the range of values of INDEX_TYPE.
7270 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7271 If SHARED is true, reuse such a type that has already been constructed.
7272 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7274 tree
7277 {
7278 tree t;
7281 {
7284 }
7294 {
7297 }
7300 {
7309 index_type
7312 }
7315 }
7317 /* Wrapper around build_array_type_1 with SHARED set to true. */
7319 tree
7321 {
7322 return
7324 }
7326 /* Wrapper around build_array_type_1 with SHARED set to false. */
7328 tree
7330 {
7332 }
7334 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7335 sizetype. */
7337 tree
7339 {
7341 }
7343 /* Recursively examines the array elements of TYPE, until a non-array
7344 element type is found. */
7346 tree
7348 {
7353 }
7355 /* Computes the canonical argument types from the argument type list
7356 ARGTYPES.
7358 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7359 on entry to this function, or if any of the ARGTYPES are
7360 structural.
7362 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7363 true on entry to this function, or if any of the ARGTYPES are
7364 non-canonical.
7366 Returns a canonical argument list, which may be ARGTYPES when the
7367 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7368 true) or would not differ from ARGTYPES. */
7370 static tree
7374 {
7375 tree arg;
7379 {
7381 /* Fail gracefully by stating that the type is structural. */
7387 /* If the argument has a default argument, we consider it
7388 non-canonical even though the type itself is canonical.
7389 That way, different variants of function and method types
7390 with default arguments will all point to the variant with
7391 no defaults as their canonical type. */
7393 }
7399 {
7400 /* Build the canonical list of argument types. */
7405 {
7408 else
7411 canon_argtypes);
7412 }
7418 /* There is a non-canonical type. */
7421 }
7423 /* The canonical argument types are the same as ARGTYPES. */
7425 }
7427 /* Construct, lay out and return
7428 the type of functions returning type VALUE_TYPE
7429 given arguments of types ARG_TYPES.
7430 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7431 are data type nodes for the arguments of the function.
7432 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7433 variable-arguments function with (...) prototype (no named arguments).
7434 If such a type has already been constructed, reuse it. */
7436 tree
7439 {
7440 tree t;
7443 tree canon_argtypes;
7448 {
7451 }
7453 /* Make a node of the sort we want. */
7458 {
7461 }
7463 /* If we already have such a type, use the old one. */
7467 /* Set up the canonical type. */
7477 canon_argtypes);
7482 }
7484 /* Build a function type. The RETURN_TYPE is the type returned by the
7485 function. If VAARGS is set, no void_type_node is appended to the
7486 list. ARGP must be always be terminated be a NULL_TREE. */
7488 static tree
7490 {
7498 {
7503 }
7506 else
7507 {
7511 }
7515 }
7517 /* Build a function type. The RETURN_TYPE is the type returned by the
7518 function. If additional arguments are provided, they are
7519 additional argument types. The list of argument types must always
7520 be terminated by NULL_TREE. */
7522 tree
7524 {
7525 tree args;
7532 }
7534 /* Build a variable argument function type. The RETURN_TYPE is the
7535 type returned by the function. If additional arguments are provided,
7536 they are additional argument types. The list of argument types must
7537 always be terminated by NULL_TREE. */
7539 tree
7541 {
7542 tree args;
7550 }
7552 /* Build a function type. RETURN_TYPE is the type returned by the
7553 function; VAARGS indicates whether the function takes varargs. The
7554 function takes N named arguments, the types of which are provided in
7555 ARG_TYPES. */
7557 static tree
7560 {
7568 }
7570 /* Build a function type. RETURN_TYPE is the type returned by the
7571 function. The function takes N named arguments, the types of which
7572 are provided in ARG_TYPES. */
7574 tree
7576 {
7578 }
7580 /* Build a variable argument function type. RETURN_TYPE is the type
7581 returned by the function. The function takes N named arguments, the
7582 types of which are provided in ARG_TYPES. */
7584 tree
7586 {
7588 }
7590 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7591 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7592 for the method. An implicit additional parameter (of type
7593 pointer-to-BASETYPE) is added to the ARGTYPES. */
7595 tree
7597 tree rettype,
7598 tree argtypes)
7599 {
7600 tree t;
7601 tree ptype;
7603 tree canon_argtypes;
7605 /* Make a node of the sort we want. */
7612 /* The actual arglist for this function includes a "hidden" argument
7613 which is "this". Put it into the list of argument types. */
7617 /* If we already have such a type, use the old one. */
7621 /* Set up the canonical type. */
7622 any_structural_p
7625 any_noncanonical_p
7637 canon_argtypes);
7642 }
7644 /* Construct, lay out and return the type of methods belonging to class
7645 BASETYPE and whose arguments and values are described by TYPE.
7646 If that type exists already, reuse it.
7647 TYPE must be a FUNCTION_TYPE node. */
7649 tree
7651 {
7657 }
7659 /* Construct, lay out and return the type of offsets to a value
7660 of type TYPE, within an object of type BASETYPE.
7661 If a suitable offset type exists already, reuse it. */
7663 tree
7665 {
7666 tree t;
7668 /* Make a node of the sort we want. */
7674 /* If we already have such a type, use the old one. */
7682 {
7691 }
7694 }
7696 /* Create a complex type whose components are COMPONENT_TYPE.
7698 If NAMED is true, the type is given a TYPE_NAME. We do not always
7699 do so because this creates a DECL node and thus make the DECL_UIDs
7700 dependent on the type canonicalization hashtable, which is GC-ed,
7701 so the DECL_UIDs would not be stable wrt garbage collection. */
7703 tree
7705 {
7710 /* Make a node of the sort we want. */
7715 /* If we already have such a type, use the old one. */
7720 {
7721 /* We created a new type. The hash insertion will have laid
7722 out the type. We need to check the canonicalization and
7723 maybe set the name. */
7734 /* We need to create a name, since complex is a fundamental type. */
7736 {
7765 }
7766 }
7769 }
7771 /* If TYPE is a real or complex floating-point type and the target
7772 does not directly support arithmetic on TYPE then return the wider
7773 type to be used for arithmetic on TYPE. Otherwise, return
7774 NULL_TREE. */
7776 tree
7778 {
7779 /* The target can give two different responses to the question of
7780 which excess precision mode it would like depending on whether we
7781 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7783 enum excess_precision_type requested_type
7785 ? EXCESS_PRECISION_TYPE_FAST
7789 enum flt_eval_method target_flt_eval_method
7792 /* The target should not ask for unpredictable float evaluation (though
7793 it might advertise that implicitly the evaluation is unpredictable,
7794 but we don't care about that here, it will have been reported
7795 elsewhere). If it does ask for unpredictable evaluation, we have
7796 nothing to do here. */
7799 /* Nothing to do. The target has asked for all types we know about
7800 to be computed with their native precision and range. */
7804 /* The target will promote this type in a target-dependent way, so excess
7805 precision ought to leave it alone. */
7809 machine_mode float16_type_mode = (float16_type_node
7812 machine_mode bfloat16_type_mode = (bfloat16_type_node
7819 {
7821 {
7824 {
7845 }
7847 }
7849 {
7854 {
7875 }
7877 }
7880 }
7883 }
7884 \f
7885 /* Return OP, stripped of any conversions to wider types as much as is safe.
7886 Converting the value back to OP's type makes a value equivalent to OP.
7888 If FOR_TYPE is nonzero, we return a value which, if converted to
7889 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7891 OP must have integer, real or enumeral type. Pointers are not allowed!
7893 There are some cases where the obvious value we could return
7894 would regenerate to OP if converted to OP's type,
7895 but would not extend like OP to wider types.
7896 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7897 For example, if OP is (unsigned short)(signed char)-1,
7898 we avoid returning (signed char)-1 if FOR_TYPE is int,
7899 even though extending that to an unsigned short would regenerate OP,
7900 since the result of extending (signed char)-1 to (int)
7901 is different from (int) OP. */
7903 tree
7905 {
7906 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7908 unsigned final_prec
7910 int uns
7917 {
7920 /* TYPE_PRECISION on vector types has different meaning
7921 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7922 so avoid them here. */
7929 /* Truncations are many-one so cannot be removed.
7930 Unless we are later going to truncate down even farther. */
7935 /* See what's inside this conversion. If we decide to strip it,
7936 we will set WIN. */
7939 /* If we have not stripped any zero-extensions (uns is 0),
7940 we can strip any kind of extension.
7941 If we have previously stripped a zero-extension,
7942 only zero-extensions can safely be stripped.
7943 Any extension can be stripped if the bits it would produce
7944 are all going to be discarded later by truncating to FOR_TYPE. */
7947 {
7950 /* TYPE_UNSIGNED says whether this is a zero-extension.
7951 Let's avoid computing it if it does not affect WIN
7952 and if UNS will not be needed again. */
7956 {
7959 }
7960 }
7961 }
7963 /* If we finally reach a constant see if it fits in sth smaller and
7964 in that case convert it. */
7966 {
7972 {
7976 }
7977 }
7980 }
7981 \f
7982 /* Return OP or a simpler expression for a narrower value
7983 which can be sign-extended or zero-extended to give back OP.
7984 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7985 or 0 if the value should be sign-extended. */
7987 tree
7989 {
7996 {
7997 do
8011 ret);
8013 }
8015 {
8016 int bitschange
8020 /* Truncations are many-one so cannot be removed. */
8024 /* See what's inside this conversion. If we decide to strip it,
8025 we will set WIN. */
8028 {
8030 /* An extension: the outermost one can be stripped,
8031 but remember whether it is zero or sign extension. */
8034 /* Otherwise, if a sign extension has been stripped,
8035 only sign extensions can now be stripped;
8036 if a zero extension has been stripped, only zero-extensions. */
8040 }
8042 {
8043 /* A change in nominal type can always be stripped, but we must
8044 preserve the unsignedness. */
8049 /* Keep trying to narrow, but don't assign op to win if it
8050 would turn an integral type into something else. */
8053 }
8056 }
8059 /* Since type_for_size always gives an integer type. */
8062 /* Ensure field is laid out already. */
8065 {
8066 unsigned HOST_WIDE_INT innerprec
8072 /* We can get this structure field in a narrower type that fits it,
8073 but the resulting extension to its nominal type (a fullword type)
8074 must satisfy the same conditions as for other extensions.
8076 Do this only for fields that are aligned (not bit-fields),
8077 because when bit-field insns will be used there is no
8078 advantage in doing this. */
8084 {
8088 }
8089 }
8093 }
8094 \f
8095 /* Return true if integer constant C has a value that is permissible
8096 for TYPE, an integral type. */
8098 bool
8100 {
8105 /* Non-standard boolean types can have arbitrary precision but various
8106 transformations assume that they can only take values 0 and +/-1. */
8110 retry:
8114 /* If at least one bound of the type is a constant integer, we can check
8115 ourselves and maybe make a decision. If no such decision is possible, but
8116 this type is a subtype, try checking against that. Otherwise, use
8117 fits_to_tree_p, which checks against the precision.
8119 Compute the status for each possibly constant bound, and return if we see
8120 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8121 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8122 for "constant known to fit". */
8124 /* Check if c >= type_low_bound. */
8126 {
8130 }
8131 else
8134 /* Check if c <= type_high_bound. */
8136 {
8140 }
8141 else
8144 /* If the constant fits both bounds, the result is known. */
8148 /* Perform some generic filtering which may allow making a decision
8149 even if the bounds are not constant. First, negative integers
8150 never fit in unsigned types, */
8154 /* Second, narrower types always fit in wider ones. */
8158 /* Third, unsigned integers with top bit set never fit signed types. */
8160 {
8163 {
8164 /* When a tree_cst is converted to a wide-int, the precision
8165 is taken from the type. However, if the precision of the
8166 mode underneath the type is smaller than that, it is
8167 possible that the value will not fit. The test below
8168 fails if any bit is set between the sign bit of the
8169 underlying mode and the top bit of the type. */
8172 }
8175 }
8177 /* If we haven't been able to decide at this point, there nothing more we
8178 can check ourselves here. Look at the base type if we have one and it
8179 has the same precision. */
8183 {
8186 }
8188 /* Or to fits_to_tree_p, if nothing else. */
8190 }
8192 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8193 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8194 represented (assuming two's-complement arithmetic) within the bit
8195 precision of the type are returned instead. */
8197 void
8199 {
8203 else
8204 {
8207 else
8208 {
8211 }
8212 }
8217 else
8218 {
8221 }
8222 }
8224 /* Return true if VAR is an automatic variable. */
8226 bool
8228 {
8233 }
8235 /* Return true if VAR is an automatic variable defined in function FN. */
8237 bool
8239 {
8243 }
8245 /* Subprogram of following function. Called by walk_tree.
8247 Return *TP if it is an automatic variable or parameter of the
8248 function passed in as DATA. */
8250 static tree
8252 {
8263 }
8265 /* Returns true if T is, contains, or refers to a type with variable
8266 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8267 arguments, but not the return type. If FN is nonzero, only return
8268 true if a modifier of the type or position of FN is a variable or
8269 parameter inside FN.
8271 This concept is more general than that of C99 'variably modified types':
8272 in C99, a struct type is never variably modified because a VLA may not
8273 appear as a structure member. However, in GNU C code like:
8275 struct S { int i[f()]; };
8277 is valid, and other languages may define similar constructs. */
8279 bool
8281 {
8282 tree t;
8284 /* Test if T is either variable (if FN is zero) or an expression containing
8285 a variable in FN. If TYPE isn't gimplified, return true also if
8286 gimplify_one_sizepos would gimplify the expression into a local
8287 variable. */
8288 #define RETURN_TRUE_IF_VAR(T) \
8289 do { tree _t = (T); \
8290 if (_t != NULL_TREE \
8291 && _t != error_mark_node \
8292 && !CONSTANT_CLASS_P (_t) \
8293 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8294 && (!fn \
8295 || (!TYPE_SIZES_GIMPLIFIED (type) \
8296 && (TREE_CODE (_t) != VAR_DECL \
8297 && !CONTAINS_PLACEHOLDER_P (_t))) \
8298 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8299 return true; } while (0)
8304 /* If TYPE itself has variable size, it is variably modified. */
8309 {
8313 /* Ada can have pointer types refering to themselves indirectly. */
8318 {
8321 }
8327 /* If TYPE is a function type, it is variably modified if the
8328 return type is variably modified. */
8338 /* Scalar types are variably modified if their end points
8339 aren't constant. */
8347 /* We can't see if any of the fields are variably-modified by the
8348 definition we normally use, since that would produce infinite
8349 recursion via pointers. */
8350 /* This is variably modified if some field's type is. */
8353 {
8358 /* If the type is a qualified union, then the DECL_QUALIFIER
8359 of fields can also be an expression containing a variable. */
8363 /* If the field is a qualified union, then it's only a container
8364 for what's inside so we look into it. That's necessary in LTO
8365 mode because the sizes of the field tested above have been set
8366 to PLACEHOLDER_EXPRs by free_lang_data. */
8370 }
8374 /* Do not call ourselves to avoid infinite recursion. This is
8375 variably modified if the element type is. */
8382 }
8384 /* The current language may have other cases to check, but in general,
8385 all other types are not variably modified. */
8388 #undef RETURN_TRUE_IF_VAR
8389 }
8391 /* Given a DECL or TYPE, return the scope in which it was declared, or
8392 NULL_TREE if there is no containing scope. */
8394 tree
8396 {
8398 }
8400 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8402 const_tree
8404 {
8406 {
8409 else
8411 }
8413 }
8415 /* Return the innermost context enclosing DECL that is
8416 a FUNCTION_DECL, or zero if none. */
8418 tree
8420 {
8421 tree context;
8426 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8427 where we look up the function at runtime. Such functions always take
8428 a first argument of type 'pointer to real context'.
8430 C++ should really be fixed to use DECL_CONTEXT for the real context,
8431 and use something else for the "virtual context". */
8433 context
8434 = TYPE_MAIN_VARIANT
8436 else
8440 {
8443 else
8445 }
8448 }
8450 /* Return the innermost context enclosing DECL that is
8451 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8452 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8454 tree
8456 {
8461 {
8482 }
8485 }
8487 /* CALL is a CALL_EXPR. Return the declaration for the function
8488 called, or NULL_TREE if the called function cannot be
8489 determined. */
8491 tree
8493 {
8494 tree addr;
8499 /* It's invalid to call this function with anything but a
8500 CALL_EXPR. */
8503 /* The first operand to the CALL is the address of the function
8504 called. */
8507 /* If there is no function, return early. */
8513 /* If this is a readonly function pointer, extract its initial value. */
8519 /* If the address is just `&f' for some function `f', then we know
8520 that `f' is being called. */
8525 /* We couldn't figure out what was being called. */
8527 }
8529 /* Return true when STMTs arguments and return value match those of FNDECL,
8530 a decl of a builtin function. */
8532 static bool
8534 {
8552 {
8553 /* Variadic args follow. */
8561 {
8562 /* For pointer arguments be more forgiving, e.g. due to
8563 FILE * vs. fileptr_type_node, or say char * vs. const char *
8564 differences etc. */
8570 /* char/short integral arguments are promoted to int
8571 by several frontends if targetm.calls.promote_prototypes
8572 is true. Allow such promotion too. */
8578 && (gimple_form
8585 }
8586 }
8590 }
8592 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8593 return the associated function code, otherwise return CFN_LAST. */
8595 combined_fn
8597 {
8598 /* It's invalid to call this function with anything but a CALL_EXPR. */
8611 }
8613 /* Comparator of indices based on tree_node_counts. */
8615 static int
8617 {
8622 }
8624 /* Comparator of indices based on tree_code_counts. */
8626 static int
8628 {
8633 }
8635 #define TREE_MEM_USAGE_SPACES 40
8637 /* Print debugging information about tree nodes generated during the compile,
8638 and any language-specific information. */
8640 void
8642 {
8644 {
8650 {
8657 {
8664 }
8669 }
8671 {
8681 {
8686 }
8693 }
8694 }
8695 else
8702 }
8703 \f
8706 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8708 unsigned
8710 {
8711 /* This relies on the raw feedback's top 4 bits being zero. */
8712 #define FEEDBACK(X) ((X) * 0x04c11db7)
8713 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8714 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8716 {
8721 };
8722 #undef FEEDBACK
8723 #undef SYNDROME
8727 {
8731 }
8734 }
8736 /* Generate a crc32 of a string. */
8738 unsigned
8740 {
8741 do
8745 }
8747 /* P is a string that will be used in a symbol. Mask out any characters
8748 that are not valid in that context. */
8750 void
8752 {
8757 #endif
8760 #endif
8761 ))
8763 }
8767 /* Create a unique anonymous identifier. The identifier is still a
8768 valid assembly label. */
8770 tree
8772 {
8774 #if !defined (NO_DOT_IN_LABEL)
8775 "."
8776 #elif !defined (NO_DOLLAR_IN_LABEL)
8777 "$"
8778 #else
8779 "_"
8780 #endif
8791 }
8793 /* Generate a name for a special-purpose function.
8794 The generated name may need to be unique across the whole link.
8795 Changes to this function may also require corresponding changes to
8796 xstrdup_mask_random.
8797 TYPE is some string to identify the purpose of this function to the
8798 linker or collect2; it must start with an uppercase letter,
8799 one of:
8800 I - for constructors
8801 D - for destructors
8802 N - for C++ anonymous namespaces
8803 F - for DWARF unwind frame information. */
8805 tree
8807 {
8812 /* If we already have a name we know to be unique, just use that. */
8815 /* If the target is handling the constructors/destructors, they
8816 will be local to this file and the name is only necessary for
8817 debugging purposes.
8818 We also assign sub_I and sub_D sufixes to constructors called from
8819 the global static constructors. These are always local. */
8823 {
8827 /* Just use the file's basename, because the full pathname
8828 might be quite long. */
8830 }
8831 else
8832 {
8833 /* Otherwise, the name must be unique across the entire link.
8834 We don't have anything that we know to be unique to this translation
8835 unit, so use what we do have and throw in some randomness. */
8853 }
8859 /* Set up the name of the file-level functions we may need.
8860 Use a global object (which is already required to be unique over
8861 the program) rather than the file name (which imposes extra
8862 constraints). */
8866 }
8867 \f
8868 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8870 /* Complain that the tree code of NODE does not match the expected 0
8871 terminated list of trailing codes. The trailing code list can be
8872 empty, for a more vague error message. FILE, LINE, and FUNCTION
8873 are of the caller. */
8875 void
8878 {
8889 {
8896 {
8903 }
8905 }
8906 else
8912 }
8914 /* Complain that the tree code of NODE does match the expected 0
8915 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8916 the caller. */
8918 void
8921 {
8935 {
8937 {
8940 }
8943 }
8949 }
8951 /* Similar to tree_check_failed, except that we check for a class of tree
8952 code, given in CL. */
8954 void
8957 {
8958 internal_error
8963 }
8965 /* Similar to tree_check_failed, except that instead of specifying a
8966 dozen codes, use the knowledge that they're all sequential. */
8968 void
8972 {
8985 {
8992 }
8997 }
9000 /* Similar to tree_check_failed, except that we check that a tree does
9001 not have the specified code, given in CL. */
9003 void
9006 {
9007 internal_error
9012 }
9015 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9017 void
9020 {
9026 }
9029 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9031 void
9035 {
9048 {
9055 }
9060 }
9063 #undef DEFTREESTRUCT
9064 #define DEFTREESTRUCT(VAL, NAME) NAME,
9068 };
9069 #undef DEFTREESTRUCT
9071 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9073 /* Similar to tree_class_check_failed, except that we check for
9074 whether CODE contains the tree structure identified by EN. */
9076 void
9081 {
9082 internal_error
9086 }
9089 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9090 (dynamically sized) vector. */
9092 void
9095 {
9096 internal_error
9100 }
9102 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9103 (dynamically sized) vector. */
9105 void
9108 {
9109 internal_error
9112 }
9114 /* Similar to above, except that the check is for the bounds of the operand
9115 vector of an expression node EXP. */
9117 void
9120 {
9122 internal_error
9126 }
9128 /* Similar to above, except that the check is for the number of
9129 operands of an OMP_CLAUSE node. */
9131 void
9134 {
9135 internal_error
9140 }
9142 \f
9143 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9144 and mapped to the machine mode MODE. Initialize its fields and build
9145 the information necessary for debugging output. */
9147 static tree
9149 {
9150 tree t;
9171 /* We have built a main variant, based on the main variant of the
9172 inner type. Use it to build the variant we return. */
9180 }
9182 static tree
9184 {
9207 else
9209 }
9211 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9213 static tree
9215 {
9217 {
9229 }
9230 else
9231 {
9243 }
9246 }
9248 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9250 static tree
9252 {
9254 {
9266 }
9267 else
9268 {
9280 }
9283 }
9286 /* Create an atomic variant node for TYPE. This routine is called
9287 during initialization of data types to create the 5 basic atomic
9288 types. The generic build_variant_type function requires these to
9289 already be set up in order to function properly, so cannot be
9290 called from there. If ALIGN is non-zero, then ensure alignment is
9291 overridden to this value. */
9293 static tree
9295 {
9296 tree t;
9298 /* Make sure its not already registered. */
9309 }
9311 /* Information about the _FloatN and _FloatNx types. This must be in
9312 the same order as the corresponding TI_* enum values. */
9314 {
9322 };
9325 /* Create nodes for all integer types (and error_mark_node) using the sizes
9326 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9328 void
9330 {
9338 /* Define both `signed char' and `unsigned char'. */
9344 /* Define `char', which is like either `signed char' or `unsigned char'
9345 but not the same as either. */
9346 char_type_node
9347 = (signed_char
9362 {
9367 {
9370 }
9371 }
9373 /* Define a boolean type. This type only represents boolean values but
9374 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9380 /* Define what type to use for size_t. */
9389 else
9390 {
9396 {
9403 {
9405 }
9406 }
9409 }
9411 /* Define what type to use for ptrdiff_t. */
9420 else
9421 {
9425 {
9433 }
9436 }
9438 /* Fill in the rest of the sized types. Reuse existing type nodes
9439 when possible. */
9452 /* Don't call build_qualified type for atomics. That routine does
9453 special processing for atomics, and until they are initialized
9454 it's better not to make that call.
9456 Check to see if there is a target override for atomic types. */
9473 /* Define these next since types below may used them. */
9491 /* We are not going to have real types in C with less than byte alignment,
9492 so we might as well not have any types that claim to have it. */
9505 const_ptr_type_node
9525 {
9528 scalar_float_mode mode;
9532 /* Work around the rs6000 KFmode having precision 113 not
9533 128. */
9545 }
9547 #ifdef HAVE_BFmode
9551 {
9556 }
9557 #endif
9564 /* Fixed size integer types. */
9571 /* Decimal float types. */
9573 {
9588 }
9597 {
9601 }
9603 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9604 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9605 sat_ ## KIND ## _type_node = \
9606 make_sat_signed_ ## KIND ## _type (SIZE); \
9607 sat_unsigned_ ## KIND ## _type_node = \
9608 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9609 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9610 unsigned_ ## KIND ## _type_node = \
9611 make_unsigned_ ## KIND ## _type (SIZE);
9613 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9614 sat_ ## WIDTH ## KIND ## _type_node = \
9615 make_sat_signed_ ## KIND ## _type (SIZE); \
9616 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9617 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9618 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9619 unsigned_ ## WIDTH ## KIND ## _type_node = \
9620 make_unsigned_ ## KIND ## _type (SIZE);
9622 /* Make fixed-point type nodes based on four different widths. */
9623 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9624 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9625 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9626 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9627 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9629 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9630 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9631 NAME ## _type_node = \
9632 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9633 u ## NAME ## _type_node = \
9634 make_or_reuse_unsigned_ ## KIND ## _type \
9635 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9636 sat_ ## NAME ## _type_node = \
9637 make_or_reuse_sat_signed_ ## KIND ## _type \
9638 (GET_MODE_BITSIZE (MODE ## mode)); \
9639 sat_u ## NAME ## _type_node = \
9640 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9641 (GET_MODE_BITSIZE (U ## MODE ## mode));
9643 /* Fixed-point type and mode nodes. */
9656 {
9659 /* Many back-ends define record types without setting TYPE_NAME.
9660 If we copied the record type here, we'd keep the original
9661 record type without a name. This breaks name mangling. So,
9662 don't copy record types and let c_common_nodes_and_builtins()
9663 declare the type to be __builtin_va_list. */
9668 }
9670 /* SCEV analyzer global shared trees. */
9675 }
9677 /* Modify DECL for given flags.
9678 TM_PURE attribute is set only on types, so the function will modify
9679 DECL's type when ECF_TM_PURE is used. */
9681 void
9683 {
9713 /* Looping const or pure is implied by noreturn.
9714 There is currently no way to declare looping const or looping pure alone. */
9717 }
9720 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9722 static void
9725 {
9726 tree decl;
9733 }
9735 /* Call this function after instantiating all builtins that the language
9736 front end cares about. This will build the rest of the builtins
9737 and internal functions that are relied upon by the tree optimizers and
9738 the middle-end. */
9740 void
9742 {
9747 {
9749 ptr_type_node,
9750 ptr_type_node,
9751 integer_type_node,
9752 NULL_TREE);
9754 BUILT_IN_CLEAR_PADDING,
9757 }
9763 {
9767 BUILT_IN_UNREACHABLE,
9773 BUILT_IN_UNREACHABLE_TRAP,
9785 }
9789 {
9800 }
9803 {
9806 NULL_TREE);
9809 }
9812 {
9818 }
9820 /* If we're checking the stack, `alloca' can throw. */
9821 const int alloca_flags
9825 {
9830 }
9835 BUILT_IN_ALLOCA_WITH_ALIGN,
9837 alloca_flags);
9842 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9844 alloca_flags);
9850 BUILT_IN_INIT_TRAMPOLINE,
9853 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9857 BUILT_IN_INIT_DESCRIPTOR,
9862 BUILT_IN_ADJUST_TRAMPOLINE,
9866 BUILT_IN_ADJUST_DESCRIPTOR,
9874 BUILT_IN_CLEAR_CACHE,
9876 ECF_NOTHROW);
9879 BUILT_IN_NONLOCAL_GOTO,
9886 BUILT_IN_SETJMP_SETUP,
9891 BUILT_IN_SETJMP_RECEIVER,
9900 BUILT_IN_STACK_RESTORE,
9905 NULL_TREE);
9918 /* If there's a possibility that we might use the ARM EABI, build the
9919 alternate __cxa_end_cleanup node used to resume from C++. */
9921 {
9924 BUILT_IN_CXA_END_CLEANUP,
9926 }
9930 BUILT_IN_UNWIND_RESUME,
9934 ECF_NORETURN);
9937 {
9939 NULL_TREE);
9941 BUILT_IN_RETURN_ADDRESS,
9943 ECF_NOTHROW);
9944 }
9948 {
9953 BUILT_IN_PROFILE_FUNC_ENTER,
9957 BUILT_IN_PROFILE_FUNC_EXIT,
9959 }
9961 /* The exception object and filter values from the runtime. The argument
9962 must be zero before exception lowering, i.e. from the front end. After
9963 exception lowering, it will be the region number for the exception
9964 landing pad. These functions are PURE instead of CONST to prevent
9965 them from being hoisted past the exception edge that will initialize
9966 its value in the landing pad. */
9970 /* Only use TM_PURE if we have TM language support. */
9983 NULL_TREE);
9985 BUILT_IN_EH_COPY_VALUES,
9988 /* Complex multiplication and division. These are handled as builtins
9989 rather than optabs because emit_library_call_value doesn't support
9990 complex. Further, we can do slightly better with folding these
9991 beasties if the real and complex parts of the arguments are separate. */
9992 {
9996 {
10023 /* For -ftrapping-math these should throw from a former
10024 -fnon-call-exception stmt. */
10026 NULL);
10032 NULL);
10036 }
10037 }
10040 }
10042 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10043 better way.
10045 If we requested a pointer to a vector, build up the pointers that
10046 we stripped off while looking for the inner type. Similarly for
10047 return values from functions.
10049 The argument TYPE is the top of the chain, and BOTTOM is the
10050 new type which we will point to. */
10052 tree
10054 {
10058 {
10062 }
10064 {
10068 }
10070 {
10073 }
10075 {
10079 }
10081 {
10083 /* The build_method_type_directly() routine prepends 'this' to argument list,
10084 so we must compensate by getting rid of it. */
10085 outer
10086 = build_method_type_directly
10088 inner,
10090 }
10092 {
10095 }
10096 else
10101 }
10103 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10104 the inner type. */
10105 tree
10107 {
10108 poly_int64 nunits;
10112 {
10124 /* Check that there are no leftover bits. */
10132 }
10135 }
10137 /* Similarly, but takes the inner type and number of units, which must be
10138 a power of two. */
10140 tree
10142 {
10144 }
10146 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10148 tree
10150 {
10155 {
10158 }
10159 else
10165 }
10167 /* Build a vector type that holds one boolean result for each element of
10168 vector type VECTYPE. The public interface for this operation is
10169 truth_type_for. */
10171 static tree
10173 {
10177 machine_mode mask_mode;
10187 }
10189 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10190 set. */
10192 tree
10194 {
10196 tree cand;
10197 /* We always build the non-opaque variant before the opaque one,
10198 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10204 /* Othewise build a variant type and make sure to queue it after
10205 the non-opaque type. */
10213 }
10215 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10217 static poly_wide_int
10219 {
10220 /* First handle elements that are directly encoded. */
10225 /* Identify the pattern that contains element I and work out the index of
10226 the last encoded element for that pattern. */
10232 /* If there are no steps, the final encoded value is the right one. */
10236 /* Otherwise work out the value from the last two encoded elements. */
10241 }
10243 /* Return the value of element I of VECTOR_CST T. */
10245 tree
10247 {
10248 /* First handle elements that are directly encoded. */
10253 /* If there are no steps, the final encoded value is the right one. */
10255 {
10256 /* Identify the pattern that contains element I and work out the index of
10257 the last encoded element for that pattern. */
10262 }
10264 /* Otherwise work out the value from the last two encoded elements. */
10267 }
10269 /* Given an initializer INIT, return TRUE if INIT is zero or some
10270 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10271 null, set *NONZERO if and only if INIT is known not to be all
10272 zeros. The combination of return value of false and *NONZERO
10273 false implies that INIT may but need not be all zeros. Other
10274 combinations indicate definitive answers. */
10276 bool
10278 {
10283 /* Conservatively clear NONZERO and set it only if INIT is definitely
10284 not all zero. */
10292 {
10301 /* ??? Note that this is not correct for C4X float formats. There,
10302 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10303 negative exponent. */
10338 {
10343 tree elt;
10350 }
10353 {
10368 }
10369 /* Fall through. */
10372 {
10380 /* We need to loop through all elements to handle cases like
10381 "\0" and "\0foobar". */
10384 {
10387 }
10390 }
10394 }
10395 }
10397 /* Return true if EXPR is an initializer expression in which every element
10398 is a constant that is numerically equal to 0 or 1. The elements do not
10399 need to be equal to each other. */
10401 bool
10403 {
10407 {
10415 {
10422 {
10426 }
10429 }
10433 }
10434 }
10436 /* Check if vector VEC consists of all the equal elements and
10437 that the number of elements corresponds to the type of VEC.
10438 The function returns first element of the vector
10439 or NULL_TREE if the vector is not uniform. */
10440 tree
10442 {
10455 {
10459 }
10463 {
10467 {
10469 {
10472 }
10475 }
10482 }
10485 }
10487 /* If the argument is INTEGER_CST, return it. If the argument is vector
10488 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10489 return NULL_TREE.
10490 Look through location wrappers. */
10492 tree
10494 {
10501 {
10505 }
10508 }
10510 /* Checks to see if T is a constant or a constant vector and if each element E
10511 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10513 tree
10515 {
10525 tree cst;
10529 tree_vector_builder builder;
10532 else
10533 {
10539 }
10543 do
10544 {
10559 }
10563 }
10565 /* If VECTOR_CST T has a single nonzero element, return the index of that
10566 element, otherwise return -1. */
10568 int
10570 {
10576 {
10579 }
10580 else
10585 {
10588 {
10592 }
10593 }
10595 }
10597 /* Build an empty statement at location LOC. */
10599 tree
10601 {
10605 }
10608 /* Build an OMP clause with code CODE. LOC is the location of the
10609 clause. */
10611 tree
10613 {
10614 tree t;
10629 }
10631 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10632 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10633 Except for the CODE and operand count field, other storage for the
10634 object is initialized to zeros. */
10636 tree
10638 {
10639 tree t;
10651 /* Can't use TREE_OPERAND to store the length because if checking is
10652 enabled, it will try to check the length before we store it. :-P */
10656 }
10658 /* Helper function for build_call_* functions; build a CALL_EXPR with
10659 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10660 the argument slots. */
10662 static tree
10664 {
10665 tree t;
10673 }
10675 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10676 FN and a null static chain slot. NARGS is the number of call arguments
10677 which are specified as "..." arguments. */
10679 tree
10681 {
10682 tree ret;
10688 }
10690 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10691 FN and a null static chain slot. NARGS is the number of call arguments
10692 which are specified as a va_list ARGS. */
10694 tree
10696 {
10697 tree t;
10705 }
10707 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10708 FN and a null static chain slot. NARGS is the number of call arguments
10709 which are specified as a tree array ARGS. */
10711 tree
10714 {
10715 tree t;
10724 }
10726 /* Like build_call_array, but takes a vec. */
10728 tree
10730 {
10739 }
10741 /* Conveniently construct a function call expression. FNDECL names the
10742 function to be called and N arguments are passed in the array
10743 ARGARRAY. */
10745 tree
10747 {
10752 }
10754 /* Conveniently construct a function call expression. FNDECL names the
10755 function to be called and the arguments are passed in the vector
10756 VEC. */
10758 tree
10760 {
10763 }
10766 /* Conveniently construct a function call expression. FNDECL names the
10767 function to be called, N is the number of arguments, and the "..."
10768 parameters are the argument expressions. */
10770 tree
10772 {
10782 }
10784 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10785 varargs macros aren't supported by all bootstrap compilers. */
10787 tree
10789 {
10799 }
10801 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10802 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10803 It will get gimplified later into an ordinary internal function. */
10805 tree
10808 {
10816 }
10818 /* Build internal call expression. This is just like CALL_EXPR, except
10819 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10820 internal function. */
10822 tree
10825 {
10835 }
10837 /* Return a function call to FN, if the target is guaranteed to support it,
10838 or null otherwise.
10840 N is the number of arguments, passed in the "...", and TYPE is the
10841 type of the return value. */
10843 tree
10846 {
10856 {
10859 {
10862 OPTIMIZE_FOR_BOTH))
10864 }
10866 }
10867 else
10868 {
10873 }
10874 }
10876 /* Return a function call to the appropriate builtin alloca variant.
10878 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10879 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10880 bound for SIZE in case it is not a fixed value. */
10882 tree
10884 {
10886 {
10888 return
10890 }
10892 {
10895 }
10896 else
10897 {
10900 }
10901 }
10903 /* The built-in decl to use to mark code points believed to be unreachable.
10904 Typically __builtin_unreachable, but __builtin_trap if
10905 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10906 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10907 appropriate ubsan function. When building a call directly, use
10908 {gimple_},build_builtin_unreachable instead. */
10910 tree
10912 {
10919 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10920 in the sanopt pass. */
10923 }
10925 /* Build a call to __builtin_unreachable, possibly rewritten by
10926 -fsanitize=unreachable. Use this rather than the above when practical. */
10928 tree
10930 {
10934 }
10936 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10937 if SIZE == -1) and return a tree node representing char* pointer to
10938 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10939 the STRING_CST value is the LEN bytes at STR (the representation
10940 of the string, which may be wide). Otherwise it's all zeros. */
10942 tree
10946 {
10948 /* Set the maximum valid index based on the string length or SIZE. */
10949 unsigned HOST_WIDE_INT maxidx
10965 }
10969 /* Return true if T (assumed to be a DECL) must be assigned a memory
10970 location. */
10972 bool
10974 {
10980 }
10982 /* Return value of a constant X and sign-extend it. */
10984 HOST_WIDE_INT
10986 {
10990 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10994 {
10998 else
11000 }
11003 }
11005 /* If TYPE is an integral or pointer type, return an integer type with
11006 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11007 if TYPE is already an integer type of signedness UNSIGNEDP.
11008 If TYPE is a floating-point type, return an integer type with the same
11009 bitsize and with the signedness given by UNSIGNEDP; this is useful
11010 when doing bit-level operations on a floating-point value. */
11012 tree
11014 {
11019 {
11026 machine_mode new_mode;
11031 }
11034 {
11042 }
11051 else
11055 }
11057 /* If TYPE is an integral or pointer type, return an integer type with
11058 the same precision which is unsigned, or itself if TYPE is already an
11059 unsigned integer type. If TYPE is a floating-point type, return an
11060 unsigned integer type with the same bitsize as TYPE. */
11062 tree
11064 {
11066 }
11068 /* If TYPE is an integral or pointer type, return an integer type with
11069 the same precision which is signed, or itself if TYPE is already a
11070 signed integer type. If TYPE is a floating-point type, return a
11071 signed integer type with the same bitsize as TYPE. */
11073 tree
11075 {
11077 }
11079 /* - For VECTOR_TYPEs:
11080 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11081 - The number of elements must match (known_eq).
11082 - targetm.vectorize.get_mask_mode exists, and exactly
11083 the same mode as the truth type.
11084 - Otherwise, the truth type must be a BOOLEAN_TYPE
11085 or useless_type_conversion_p to BOOLEAN_TYPE. */
11086 bool
11088 {
11091 machine_mode tmask_mode;
11094 {
11103 }
11106 }
11108 /* If TYPE is a vector type, return a signed integer vector type with the
11109 same width and number of subparts. Otherwise return boolean_type_node. */
11111 tree
11113 {
11115 {
11119 }
11120 else
11122 }
11124 /* Returns the largest value obtainable by casting something in INNER type to
11125 OUTER type. */
11127 tree
11129 {
11135 /* Compute a unique number for every combination. */
11140 /* Determine the exponent to use. */
11142 {
11145 /* oprec <= iprec, outer: signed, inner: don't care. */
11150 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11154 /* oprec > iprec, outer: signed, inner: signed. */
11158 /* oprec > iprec, outer: signed, inner: unsigned. */
11162 /* oprec > iprec, outer: unsigned, inner: signed. */
11166 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11171 }
11175 }
11177 /* Returns the smallest value obtainable by casting something in INNER type to
11178 OUTER type. */
11180 tree
11182 {
11186 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11187 and obtain 0. */
11189 /* If we are widening something of an unsigned type, OUTER type
11190 contains all values of INNER type. In particular, both INNER
11191 and OUTER types have zero in common. */
11194 else
11195 {
11196 /* If we are widening a signed type to another signed type, we
11197 want to obtain -2^^(iprec-1). If we are keeping the
11198 precision or narrowing to a signed type, we want to obtain
11199 -2^(oprec-1). */
11204 }
11205 }
11207 /* Return nonzero if two operands that are suitable for PHI nodes are
11208 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11209 SSA_NAME or invariant. Note that this is strictly an optimization.
11210 That is, callers of this function can directly call operand_equal_p
11211 and get the same result, only slower. */
11213 int
11215 {
11221 }
11223 /* Returns number of zeros at the end of binary representation of X. */
11225 tree
11227 {
11229 }
11232 #define WALK_SUBTREE(NODE) \
11233 do \
11234 { \
11235 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11236 if (result) \
11237 return result; \
11238 } \
11239 while (0)
11241 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11242 be walked whenever a type is seen in the tree. Rest of operands and return
11243 value are as for walk_tree. */
11245 static tree
11248 {
11252 {
11256 /* We have to worry about mutually recursive pointers. These can't
11257 be written in C. They can in Ada. It's pathological, but
11258 there's an ACATS test (c38102a) that checks it. Deal with this
11259 by checking if we're pointing to another pointer, that one
11260 points to another pointer, that one does too, and we have no htab.
11261 If so, get a hash table. We check three levels deep to avoid
11262 the cost of the hash table if we don't need one. */
11267 {
11274 }
11276 /* fall through */
11285 /* Fall through. */
11289 {
11290 tree arg;
11292 /* We never want to walk into default arguments. */
11295 }
11299 /* Don't follow this nodes's type if a pointer for fear that
11300 we'll have infinite recursion. If we have a PSET, then we
11301 need not fear. */
11316 }
11319 }
11321 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11322 called with the DATA and the address of each sub-tree. If FUNC returns a
11323 non-NULL value, the traversal is stopped, and the value returned by FUNC
11324 is returned. If PSET is non-NULL it is used to record the nodes visited,
11325 and to avoid visiting a node more than once. */
11327 tree
11330 {
11333 tree result;
11335 #define WALK_SUBTREE_TAIL(NODE) \
11336 do \
11337 { \
11338 tp = & (NODE); \
11339 goto tail_recurse; \
11340 } \
11341 while (0)
11343 tail_recurse:
11344 /* Skip empty subtrees. */
11348 /* Don't walk the same tree twice, if the user has requested
11349 that we avoid doing so. */
11353 /* Call the function. */
11357 /* If we found something, return it. */
11363 /* Even if we didn't, FUNC may have decided that there was nothing
11364 interesting below this point in the tree. */
11366 {
11367 /* But we still need to check our siblings. */
11372 else
11374 }
11377 {
11381 }
11384 {
11396 /* None of these have subtrees other than those already walked
11397 above. */
11405 {
11411 /* Walk all elements but the last. */
11415 /* Now walk the last one as a tail call. */
11417 }
11420 {
11424 /* Walk all elements but the last. */
11427 /* Now walk the last one as a tail call. */
11429 }
11436 {
11441 idx++)
11443 }
11450 {
11451 tree decl;
11453 {
11454 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11455 into declarations that are just mentioned, rather than
11456 declared; they don't really belong to this part of the tree.
11457 And, we can see cycles: the initializer for a declaration
11458 can refer to the declaration itself. */
11462 }
11464 }
11467 {
11468 tree_stmt_iterator i;
11471 }
11475 {
11480 }
11483 {
11486 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11487 But, we only want to walk once. */
11492 }
11495 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11496 defining. We only want to walk into these fields of a type in this
11497 case and not in the general case of a mere reference to the type.
11499 The criterion is as follows: if the field can be an expression, it
11500 must be walked only here. This should be in keeping with the fields
11501 that are directly gimplified in gimplify_type_sizes in order for the
11502 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11503 variable-sized types.
11505 Note that DECLs get walked as part of processing the BIND_EXPR. */
11507 {
11508 /* Call the function for the decl so e.g. copy_tree_body_r can
11509 replace it with the remapped one. */
11518 /* Call the function for the type. See if it returns anything or
11519 doesn't want us to continue. If we are to continue, walk both
11520 the normal fields and those for the declaration case. */
11525 /* But do not walk a pointed-to type since it may itself need to
11526 be walked in the declaration case if it isn't anonymous. */
11528 {
11532 }
11534 /* If this is a record type, also walk the fields. */
11536 {
11537 tree field;
11541 {
11542 /* We'd like to look at the type of the field, but we can
11543 easily get infinite recursion. So assume it's pointed
11544 to elsewhere in the tree. Also, ignore things that
11545 aren't fields. */
11554 }
11555 }
11557 /* Same for scalar types. */
11563 {
11566 }
11570 }
11571 /* FALLTHRU */
11575 {
11578 /* Walk over all the sub-trees of this operand. */
11581 /* Go through the subtrees. We need to do this in forward order so
11582 that the scope of a FOR_EXPR is handled properly. */
11584 {
11588 }
11589 }
11590 /* If this is a type, walk the needed fields in the type. */
11594 }
11596 /* We didn't find what we were looking for. */
11599 #undef WALK_SUBTREE_TAIL
11600 }
11601 #undef WALK_SUBTREE
11603 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11605 tree
11607 walk_tree_lh lh)
11608 {
11609 tree result;
11614 }
11617 tree
11619 {
11626 }
11628 void
11630 {
11634 {
11636 }
11637 else
11639 }
11641 /* Create a nameless artificial label and put it in the current
11642 function context. The label has a location of LOC. Returns the
11643 newly created label. */
11645 tree
11647 {
11655 }
11657 /* Given a tree, try to return a useful variable name that we can use
11658 to prefix a temporary that is being assigned the value of the tree.
11659 I.E. given <temp> = &A, return A. */
11663 {
11664 tree stripped_decl;
11671 {
11676 }
11677 else
11678 {
11680 {
11685 }
11686 }
11687 }
11689 /* Return true if TYPE has a variable argument list. */
11691 bool
11693 {
11694 function_args_iterator args_iter;
11704 {
11706 }
11709 }
11711 /* Return true if TYPE has a prototype. */
11713 bool
11715 {
11716 tree t;
11725 }
11727 /* If BLOCK is inlined from an __attribute__((__artificial__))
11728 routine, return pointer to location from where it has been
11729 called. */
11730 location_t *
11732 {
11737 {
11740 {
11741 /* If AO is an artificial inline, point RET to the
11742 call site locus at which it has been inlined and continue
11743 the loop, in case AO's caller is also an artificial
11744 inline. */
11748 else
11750 }
11755 }
11757 }
11760 /* If EXP is inlined from an __attribute__((__artificial__))
11761 function, return the location of the original call expression. */
11763 location_t
11765 {
11770 else
11772 }
11774 /* Return the location into which EXP has been inlined. Analogous
11775 to tree_nonartificial_location() above but not limited to artificial
11776 functions declared inline. If SYSTEM_HEADER is true, return
11777 the macro expansion point of the location if it's in a system header */
11779 location_t
11781 {
11788 {
11796 }
11799 {
11802 /* Only consider macro expansion when the block traversal failed
11803 to find a location. Otherwise it's not relevant. */
11805 }
11808 }
11810 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11811 nodes. */
11813 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11815 hashval_t
11817 {
11824 else
11826 }
11828 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11829 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11830 same. */
11832 bool
11834 {
11847 else
11849 }
11851 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11853 tree
11856 {
11857 tree t;
11859 /* Use the cache of optimization nodes. */
11867 {
11868 /* Insert this one into the hash table. */
11872 /* Make a new node for next time round. */
11874 }
11877 }
11879 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11881 tree
11884 {
11885 tree t;
11887 /* Use the cache of optimization nodes. */
11895 {
11896 /* Insert this one into the hash table. */
11900 /* Make a new node for next time round. */
11902 }
11905 }
11907 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11908 so that they aren't saved during PCH writing. */
11910 void
11912 {
11917 }
11919 /* Determine the "ultimate origin" of a block. */
11921 tree
11923 {
11928 else
11929 {
11934 }
11935 }
11937 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11938 no instruction. */
11940 bool
11942 {
11943 /* Do not strip casts into or out of differing address spaces. */
11946 {
11951 }
11954 {
11955 /* We already know that outer_type is not a pointer with
11956 a non-generic address space. */
11958 }
11960 /* Use precision rather then machine mode when we can, which gives
11961 the correct answer even for submode (bit-field) types. */
11970 /* Otherwise fall back on comparing machine modes (e.g. for
11971 aggregate types, floats). */
11973 }
11975 /* Return true iff conversion in EXP generates no instruction. Mark
11976 it inline so that we fully inline into the stripping functions even
11977 though we have two uses of this function. */
11981 {
11996 }
11998 /* Return true iff conversion in EXP generates no instruction. Don't
11999 consider conversions changing the signedness. */
12001 static bool
12003 {
12014 }
12016 /* Strip conversions from EXP according to tree_nop_conversion and
12017 return the resulting expression. */
12019 tree
12021 {
12025 }
12027 /* Strip conversions from EXP according to tree_sign_nop_conversion
12028 and return the resulting expression. */
12030 tree
12032 {
12036 }
12038 /* Avoid any floating point extensions from EXP. */
12039 tree
12041 {
12044 /* For floating point constant look up the narrowest type that can hold
12045 it properly and handle it like (type)(narrowest_type)constant.
12046 This way we can optimize for instance a=a*2.0 where "a" is float
12047 but 2.0 is double constant. */
12049 {
12050 REAL_VALUE_TYPE orig;
12063 }
12082 }
12084 /* Strip out all handled components that produce invariant
12085 offsets. */
12087 const_tree
12089 {
12091 {
12093 {
12108 }
12110 }
12113 }
12115 /* Strip handled components with zero offset from OP. */
12117 tree
12119 {
12125 }
12129 /* Return the GCC personality function decl. */
12131 tree
12133 {
12137 }
12139 /* TARGET is a call target of GIMPLE call statement
12140 (obtained by gimple_call_fn). Return true if it is
12141 OBJ_TYPE_REF representing an virtual call of C++ method.
12142 (As opposed to OBJ_TYPE_REF representing objc calls
12143 through a cast where middle-end devirtualization machinery
12144 can't apply.) FOR_DUMP_P is true when being called from
12145 the dump routines. */
12147 bool
12149 {
12158 /* If we do not have BINFO associated, it means that type was built
12159 without devirtualization enabled. Do not consider this a virtual
12160 call. */
12164 }
12166 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12168 static tree
12170 {
12181 }
12183 /* Try to find a base info of BINFO that would have its field decl at offset
12184 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12185 found, return, otherwise return NULL_TREE. */
12187 tree
12189 {
12193 {
12195 tree fld;
12204 {
12212 }
12216 /* Offset 0 indicates the primary base, whose vtable contents are
12217 represented in the binfo for the derived class. */
12219 {
12221 /* Offsets in BINFO are in bytes relative to the whole structure
12222 while POS is in bits relative to the containing field. */
12229 {
12232 }
12235 else
12237 binfo_offset);
12238 }
12242 }
12243 }
12245 /* Returns true if X is a typedef decl. */
12247 bool
12249 {
12252 }
12254 /* Returns true iff TYPE is a type variant created for a typedef. */
12256 bool
12258 {
12260 }
12262 /* PR 84195: Replace control characters in "unescaped" with their
12263 escaped equivalents. Allow newlines if -fmessage-length has
12264 been set to a non-zero value. This is done here, rather than
12265 where the attribute is recorded as the message length can
12266 change between these two locations. */
12268 void
12270 {
12288 {
12292 {
12296 }
12299 {
12301 {
12302 /* We only allocate space for a new string if we
12303 actually encounter a control character that
12304 needs replacing. */
12308 }
12313 {
12322 }
12323 }
12326 }
12329 {
12333 }
12334 }
12336 /* Warn about a use of an identifier which was marked deprecated. Returns
12337 whether a warning was given. */
12339 bool
12341 {
12342 escaped_string msg;
12348 {
12352 {
12358 {
12361 }
12362 }
12363 }
12373 {
12374 auto_diagnostic_group d;
12378 else
12383 }
12385 {
12390 {
12396 }
12398 auto_diagnostic_group d;
12400 {
12404 else
12407 }
12408 else
12409 {
12413 else
12416 }
12420 }
12423 }
12425 /* Error out with an identifier which was marked 'unavailable'. */
12426 void
12428 {
12429 escaped_string msg;
12435 {
12439 {
12444 }
12445 }
12454 {
12455 auto_diagnostic_group d;
12458 else
12461 }
12463 {
12468 {
12474 }
12476 auto_diagnostic_group d;
12478 {
12481 else
12483 }
12484 else
12485 {
12488 else
12490 }
12494 }
12495 }
12497 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12498 somewhere in it. */
12500 bool
12502 {
12504 {
12509 }
12512 }
12514 /* Try to determine whether a TRY_CATCH expression can fall through.
12515 This is a subroutine of block_may_fallthru. */
12517 static bool
12519 {
12520 tree_stmt_iterator i;
12522 /* If the TRY block can fall through, the whole TRY_CATCH can
12523 fall through. */
12529 {
12531 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12532 catch expression and a body. The whole TRY_CATCH may fall
12533 through iff any of the catch bodies falls through. */
12535 {
12538 }
12542 /* The exception filter expression only matters if there is an
12543 exception. If the exception does not match EH_FILTER_TYPES,
12544 we will execute EH_FILTER_FAILURE, and we will fall through
12545 if that falls through. If the exception does match
12546 EH_FILTER_TYPES, the stack unwinder will continue up the
12547 stack, so we will not fall through. We don't know whether we
12548 will throw an exception which matches EH_FILTER_TYPES or not,
12549 so we just ignore EH_FILTER_TYPES and assume that we might
12550 throw an exception which doesn't match. */
12554 /* This case represents statements to be executed when an
12555 exception occurs. Those statements are implicitly followed
12556 by a RESX statement to resume execution after the exception.
12557 So in this case the TRY_CATCH never falls through. */
12559 }
12560 }
12562 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12563 need not be 100% accurate; simply be conservative and return true if we
12564 don't know. This is used only to avoid stupidly generating extra code.
12565 If we're wrong, we'll just delete the extra code later. */
12567 bool
12569 {
12570 /* This CONST_CAST is okay because expr_last returns its argument
12571 unmodified and we assign it to a const_tree. */
12575 {
12578 /* Easy cases. If the last statement of the block implies
12579 control transfer, then we can't fall through. */
12583 /* If there is a default: label or case labels cover all possible
12584 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12585 to some case label in all cases and all we care is whether the
12586 SWITCH_BODY falls through. */
12603 /* The finally clause is always executed after the try clause,
12604 so if it does not fall through, then the try-finally will not
12605 fall through. Otherwise, if the try clause does not fall
12606 through, then when the finally clause falls through it will
12607 resume execution wherever the try clause was going. So the
12608 whole try-finally will only fall through if both the try
12609 clause and the finally clause fall through. */
12619 else
12621 /* FALLTHRU */
12624 /* Functions that do not return do not fall through. */
12638 }
12639 }
12641 /* True if we are using EH to handle cleanups. */
12644 /* This routine is called from front ends to indicate eh should be used for
12645 cleanups. */
12646 void
12648 {
12650 }
12652 /* Query whether EH is used for cleanups. */
12653 bool
12655 {
12657 }
12659 /* Wrapper for tree_code_name to ensure that tree code is valid */
12662 {
12665 /* The tree_code enum promotes to signed, but we could be getting
12666 invalid values, so force an unsigned comparison. */
12668 {
12672 }
12675 }
12677 /* Drops the TREE_OVERFLOW flag from T. */
12679 tree
12681 {
12684 /* For tree codes with a sharing machinery re-build the result. */
12688 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12689 and canonicalize the result. */
12691 {
12692 tree_vector_builder builder;
12696 {
12701 }
12703 }
12705 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12706 and drop the flag. */
12710 /* For constants that contain nested constants, drop the flag
12711 from those as well. */
12713 {
12718 }
12721 }
12723 /* Given a memory reference expression T, return its base address.
12724 The base address of a memory reference expression is the main
12725 object being referenced. For instance, the base address for
12726 'array[i].fld[j]' is 'array'. You can think of this as stripping
12727 away the offset part from a memory address.
12729 This function calls handled_component_p to strip away all the inner
12730 parts of the memory reference until it reaches the base object. */
12732 tree
12734 {
12746 }
12748 /* Return a tree of sizetype representing the size, in bytes, of the element
12749 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12751 tree
12753 {
12758 /* If a size was specified in the ARRAY_REF, it's the size measured
12759 in alignment units of the element type. So multiply by that value. */
12761 {
12762 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12763 sizetype from another type of the same width and signedness. */
12768 }
12770 /* Otherwise, take the size from that of the element type. Substitute
12771 any PLACEHOLDER_EXPR that we have. */
12772 else
12774 }
12776 /* Return a tree representing the lower bound of the array mentioned in
12777 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12779 tree
12781 {
12784 /* If a lower bound is specified in EXP, use it. */
12788 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12789 substituting for a PLACEHOLDER_EXPR as needed. */
12793 /* Otherwise, return a zero of the appropriate type. */
12797 }
12799 /* Return a tree representing the upper bound of the array mentioned in
12800 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12802 tree
12804 {
12807 /* If there is a domain type and it has an upper bound, use it, substituting
12808 for a PLACEHOLDER_EXPR as needed. */
12812 /* Otherwise fail. */
12814 }
12816 /* Returns true if REF is an array reference, a component reference,
12817 or a memory reference to an array whose actual size might be larger
12818 than its upper bound implies, there are multiple cases:
12819 A. a ref to a flexible array member at the end of a structure;
12820 B. a ref to an array with a different type against the original decl;
12821 for example:
12823 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12824 (*((char(*)[16])&a[0]))[i+8]
12826 C. a ref to an array that was passed as a parameter;
12827 for example:
12829 int test (uint8_t *p, uint32_t t[1][1], int n) {
12830 for (int i = 0; i < 4; i++, p++)
12831 t[i][0] = ...;
12833 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12834 */
12836 bool
12838 {
12839 /* The TYPE for this array referece. */
12841 /* The FIELD_DECL for the array field in the containing structure. */
12843 /* Whether this array is the trailing array of a structure. */
12850 {
12853 }
12856 {
12859 }
12861 {
12867 {
12869 {
12876 }
12877 else
12879 }
12880 else
12882 }
12883 else
12891 {
12892 /* If the reference chain contains a component reference to a
12893 non-union type and there follows another field the reference
12894 is not at the end of a structure. */
12896 {
12898 {
12904 }
12905 }
12906 /* If we have a multi-dimensional array we do not consider
12907 a non-innermost dimension as flex array if the whole
12908 multi-dimensional array is at struct end.
12909 Same for an array of aggregates with a trailing array
12910 member. */
12914 ;
12915 /* If we view an underlying object as sth else then what we
12916 gathered up to now is what we have to rely on. */
12919 else
12923 }
12928 /* The array now is at struct end. Treat flexible array member as
12929 always subject to extend, even into just padding constrained by
12930 an underlying decl. */
12934 {
12937 }
12939 /* If the reference is based on a declared entity, the size of the array
12940 is constrained by its given domain. (Do not trust commons PR/69368). */
12944 && !(flag_unconstrained_commons
12948 {
12949 /* If the object itself is the array it is not at struct end. */
12953 /* Check whether the array domain covers all of the available
12954 padding. */
12955 poly_int64 offset;
12959 {
12960 *is_trailing_array
12963 }
12965 {
12966 *is_trailing_array
12969 }
12971 /* If at least one extra element fits it is a flexarray. */
12977 {
12978 *is_trailing_array
12981 }
12984 }
12988 }
12991 /* Return a tree representing the offset, in bytes, of the field referenced
12992 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12994 tree
12996 {
13001 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13002 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13003 value. */
13005 {
13006 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13007 sizetype from another type of the same width and signedness. */
13013 }
13015 /* Otherwise, take the offset from that of the field. Substitute
13016 any PLACEHOLDER_EXPR that we have. */
13017 else
13019 }
13021 /* Given the initializer INIT, return the initializer for the field
13022 DECL if it exists, otherwise null. Used to obtain the initializer
13023 for a flexible array member and determine its size. */
13025 static tree
13027 {
13033 {
13038 {
13042 }
13043 }
13046 }
13048 /* Determines the special array member type for the array reference REF. */
13049 special_array_member
13051 {
13057 {
13066 /* MEMBER is an interior array with
13067 more than one element. */
13071 {
13074 else
13076 }
13084 {
13089 /* MEMBER is a trailing array with more than
13090 one elements. */
13095 }
13096 }
13099 }
13101 /* Determines the size of the member referenced by the COMPONENT_REF
13102 REF, using its initializer expression if necessary in order to
13103 determine the size of an initialized flexible array member.
13104 If non-null, set *SAM to the type of special array member.
13105 Returns the size as sizetype (which might be zero for an object
13106 with an uninitialized flexible array member) or null if the size
13107 cannot be determined. */
13109 tree
13111 {
13114 special_array_member sambuf;
13119 /* The object/argument referenced by the COMPONENT_REF and its type. */
13122 /* The referenced member. */
13127 {
13130 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13131 to the type of a class with a virtual base which doesn't
13132 reflect the size of the virtual's members (see pr97595).
13133 If that's the case fail for now and implement something
13134 more robust in the future. */
13138 /* 2-or-more elements arrays are treated as normal arrays by default. */
13145 /* if the trailing array is a not a flexible array member, treat it as
13146 a normal array. */
13154 /* For a reference to a flexible array member of a union
13155 use the size of the union instead of the size of the member. */
13158 }
13160 /* MEMBER is either a bona fide flexible array member, or a zero-length
13161 array member, or an array of length one treated as such. */
13163 /* If the reference is to a declared object and the member a true
13164 flexible array, try to determine its size from its initializer. */
13168 {
13179 }
13181 /* BASE is the declared object of which MEMBER is either a member
13182 or that is cast to ARGTYPE (e.g., a char buffer used to store
13183 an ARGTYPE object). */
13186 /* Determine the base type of the referenced object. If it's
13187 the same as ARGTYPE and MEMBER has a known size, return it. */
13199 /* MEMBER is a true flexible array member. Compute its size from
13200 the initializer of the BASE object if it has one. */
13203 {
13206 {
13209 {
13210 /* Use the larger of the initializer size and the tail
13211 padding in the enclosing struct. */
13216 }
13219 }
13220 }
13223 {
13225 {
13230 /* The size of a flexible array member of an extern struct
13231 with no initializer cannot be determined (it's defined
13232 in another translation unit and can have an initializer
13233 with an arbitrary number of elements). */
13236 /* Use the size of the base struct or, for interior zero-length
13237 arrays, the size of the enclosing type. */
13239 }
13241 /* Use the size of the BASE object (possibly an array of some
13242 other type such as char used to store the struct). */
13244 else
13246 }
13248 /* If the flexible array member has a known size use the greater
13249 of it and the tail padding in the enclosing struct.
13250 Otherwise, when the size of the flexible array member is unknown
13251 and the referenced object is not a struct, use the size of its
13252 type when known. This detects sizes of array buffers when cast
13253 to struct types with flexible array members. */
13255 {
13260 {
13263 }
13265 }
13267 /* Return "don't know" for an external non-array object since its
13268 flexible array member can be initialized to have any number of
13269 elements. Otherwise, return zero because the flexible array
13270 member has no elements. */
13273 && (!typematch
13276 }
13278 /* Return the machine mode of T. For vectors, returns the mode of the
13279 inner type. The main use case is to feed the result to HONOR_NANS,
13280 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13282 machine_mode
13284 {
13290 }
13292 /* Vector types need to re-check the target flags each time we report
13293 the machine mode. We need to do this because attribute target can
13294 change the result of vector_mode_supported_p and have_regs_of_mode
13295 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13296 change on a per-function basis. */
13297 /* ??? Possibly a better solution is to run through all the types
13298 referenced by a function and re-compute the TYPE_MODE once, rather
13299 than make the TYPE_MODE macro call a function. */
13301 machine_mode
13303 {
13304 machine_mode mode;
13312 {
13313 scalar_int_mode innermode;
13315 /* For integers, try mapping it to a same-sized scalar mode. */
13317 {
13320 scalar_int_mode mode;
13324 }
13327 }
13330 }
13332 /* Return the size in bits of each element of vector type TYPE. */
13334 unsigned int
13336 {
13341 }
13343 /* Calculate the size in bits of each element of vector type TYPE
13344 and return the result as a tree of type bitsizetype. */
13346 tree
13348 {
13353 }
13355 /* Verify that basic properties of T match TV and thus T can be a variant of
13356 TV. TV should be the more specified variant (i.e. the main variant). */
13358 static bool
13360 {
13361 /* Type variant can differ by:
13363 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13364 ENCODE_QUAL_ADDR_SPACE.
13365 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13366 in this case some values may not be set in the variant types
13367 (see TYPE_COMPLETE_P checks).
13368 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13369 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13370 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13371 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13372 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13373 this is necessary to make it possible to merge types form different TUs
13374 - arrays, pointers and references may have TREE_TYPE that is a variant
13375 of TREE_TYPE of their main variants.
13376 - aggregates may have new TYPE_FIELDS list that list variants of
13377 the main variant TYPE_FIELDS.
13378 - vector types may differ by TYPE_VECTOR_OPAQUE
13379 */
13381 /* Convenience macro for matching individual fields. */
13382 #define verify_variant_match(flag) \
13383 do { \
13384 if (flag (tv) != flag (t)) \
13385 { \
13387 debug_tree (tv); \
13388 return false; \
13389 } \
13390 } while (false)
13392 /* tree_base checks. */
13395 /* FIXME: Ada builds non-artificial variants of artificial types. */
13396 #if 0
13399 #endif
13402 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13409 else
13411 /* FIXME: This check trigger during libstdc++ build. */
13412 #if 0
13415 #endif
13417 /* tree_type_common checks. */
13420 {
13428 {
13438 }
13440 }
13446 /* During LTO we merge variant lists from diferent translation units
13447 that may differ BY TYPE_CONTEXT that in turn may point
13448 to TRANSLATION_UNIT_DECL.
13449 Ada also builds variants of types with different TYPE_CONTEXT. */
13450 #if 0
13453 #endif
13459 {
13463 }
13465 /* tree_type_non_common checks. */
13467 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13468 and dangle the pointer from time to time. */
13472 {
13476 }
13482 {
13485 }
13492 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13493 or even type's main variant. This is needed to make bootstrap pass
13494 and the bug seems new in GCC 5.
13495 C++ FE should be updated to make this consistent and we should check
13496 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13497 is a match with main variant.
13499 Also disable the check for Java for now because of parser hack that builds
13500 first an dummy BINFO and then sometimes replace it by real BINFO in some
13501 of the copies. */
13504 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13505 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13506 at LTO time only. */
13508 {
13516 }
13518 /* Check various uses of TYPE_VALUES_RAW. */
13524 /* Permit incomplete variants of complete type. While FEs may complete
13525 all variants, this does not happen for C++ templates in all cases. */
13529 {
13532 /* Fortran builds qualified variants as new records with items of
13533 qualified type. Verify that they looks same. */
13540 /* FIXME: gfc_nonrestricted_type builds all types as variants
13541 with exception of pointer types. It deeply copies the type
13542 which means that we may end up with a variant type
13543 referring non-variant pointer. We may change it to
13544 produce types as variants, too, like
13545 objc_get_protocol_qualified_type does. */
13551 {
13559 }
13560 }
13563 /* For C++ the qualified variant of array type is really an array type
13564 of qualified TREE_TYPE.
13565 objc builds variants of pointer where pointer to type is a variant, too
13566 in objc_get_protocol_qualified_type. */
13572 {
13580 }
13583 {
13591 }
13593 #undef verify_variant_match
13594 }
13597 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13598 the middle-end types_compatible_p function. It needs to avoid
13599 claiming types are different for types that should be treated
13600 the same with respect to TBAA. Canonical types are also used
13601 for IL consistency checks via the useless_type_conversion_p
13602 predicate which does not handle all type kinds itself but falls
13603 back to pointer-comparison of TYPE_CANONICAL for aggregates
13604 for example. */
13606 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13607 type calculation because we need to allow inter-operability between signed
13608 and unsigned variants. */
13610 bool
13612 {
13613 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13614 signed char and unsigned char. Similarly fortran FE builds
13615 C_SIZE_T as signed type, while C defines it unsigned. */
13618 == INTEGER_TYPE
13621 }
13623 /* Return true iff T1 and T2 are structurally identical for what
13624 TBAA is concerned.
13625 This function is used both by lto.cc canonical type merging and by the
13626 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13627 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13628 only for LTO because only in these cases TYPE_CANONICAL equivalence
13629 correspond to one defined by gimple_canonical_types_compatible_p. */
13631 bool
13634 {
13635 /* Type variants should be same as the main variant. When not doing sanity
13636 checking to verify this fact, go to main variants and save some work. */
13638 {
13641 }
13643 /* Check first for the obvious case of pointer identity. */
13647 /* Check that we have two types to compare. */
13651 /* We consider complete types always compatible with incomplete type.
13652 This does not make sense for canonical type calculation and thus we
13653 need to ensure that we are never called on it.
13655 FIXME: For more correctness the function probably should have three modes
13656 1) mode assuming that types are complete mathcing their structure
13657 2) mode allowing incomplete types but producing equivalence classes
13658 and thus ignoring all info from complete types
13659 3) mode allowing incomplete types to match complete but checking
13660 compatibility between complete types.
13662 1 and 2 can be used for canonical type calculation. 3 is the real
13663 definition of type compatibility that can be used i.e. for warnings during
13664 declaration merging. */
13669 /* If the types have been previously registered and found equal
13670 they still are. */
13674 {
13675 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13676 they are always NULL, but they are set to non-NULL for types
13677 constructed by build_pointer_type and variants. In this case the
13678 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13679 all pointers are considered equal. Be sure to not return false
13680 negatives. */
13684 }
13686 /* For types where we do ODR based TBAA the canonical type is always
13687 set correctly, so we know that types are different if their
13688 canonical types does not match. */
13694 /* Can't be the same type if the types don't have the same code. */
13699 /* Qualifiers do not matter for canonical type comparison purposes. */
13701 /* Void types and nullptr types are always the same. */
13706 /* Can't be the same type if they have different mode. */
13710 /* Non-aggregate types can be handled cheaply. */
13718 {
13719 /* Can't be the same type if they have different recision. */
13723 /* In some cases the signed and unsigned types are required to be
13724 inter-operable. */
13729 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13730 interoperable with "signed char". Unless all frontends are revisited
13731 to agree on these types, we must ignore the flag completely. */
13733 /* Fortran standard define C_PTR type that is compatible with every
13734 C pointer. For this reason we need to glob all pointers into one.
13735 Still pointers in different address spaces are not compatible. */
13737 {
13741 }
13743 /* Tail-recurse to components. */
13748 trust_type_canonical);
13751 }
13753 /* Do type-specific comparisons. */
13755 {
13757 /* Array types are the same if the element types are the same and
13758 the number of elements are the same. */
13760 trust_type_canonical)
13765 else
13766 {
13770 /* For an incomplete external array, the type domain can be
13771 NULL_TREE. Check this condition also. */
13776 else
13777 {
13783 /* The minimum/maximum values have to be the same. */
13795 else
13797 }
13798 }
13802 /* Function types are the same if the return type and arguments types
13803 are the same. */
13805 trust_type_canonical))
13812 else
13813 {
13819 {
13822 trust_type_canonical))
13824 }
13830 }
13835 {
13838 /* Don't try to compare variants of an incomplete type, before
13839 TYPE_FIELDS has been copied around. */
13847 /* For aggregate types, all the fields must be the same. */
13851 {
13852 /* Skip non-fields and zero-sized fields. */
13863 /* The fields must have the same name, offset and type. */
13866 || !gimple_canonical_types_compatible_p
13868 trust_type_canonical))
13870 }
13872 /* If one aggregate has more fields than the other, they
13873 are not the same. */
13878 }
13881 /* Consider all types with language specific trees in them mutually
13882 compatible. This is executed only from verify_type and false
13883 positives can be tolerated. */
13886 }
13887 }
13889 /* For OPAQUE_TYPE T, it should have only size and alignment information
13890 and its mode should be of class MODE_OPAQUE. This function verifies
13891 these properties of T match TV which is the main variant of T and TC
13892 which is the canonical of T. */
13894 static void
13896 {
13901 /* For an opaque type T1, check if some of its properties match
13902 the corresponding ones of the other opaque type T2, emit some
13903 error messages for those inconsistent ones. */
13906 {
13908 {
13912 }
13914 {
13918 }
13920 {
13924 }
13928 {
13932 }
13934 {
13938 }
13940 {
13944 }
13945 };
13952 }
13954 /* Verify type T. */
13956 void
13958 {
13964 {
13967 }
13970 {
13973 }
13975 {
13979 }
13984 ;
13986 {
13990 }
13991 /* Method and function types cannot be used to address memory and thus
13992 TYPE_CANONICAL really matters only for determining useless conversions.
13994 FIXME: C++ FE produce declarations of builtin functions that are not
13995 compatible with main variants. */
13997 ;
13999 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14000 with variably sized arrays because their sizes possibly
14001 gimplified to different variables. */
14005 {
14009 }
14013 {
14017 }
14019 {
14024 }
14027 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14029 {
14030 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14031 and danagle the pointer from time to time. */
14035 {
14039 }
14040 }
14042 {
14045 {
14049 }
14050 }
14052 {
14055 {
14059 }
14060 }
14063 {
14064 /* FIXME: The following check should pass:
14065 useless_type_conversion_p (const_cast <tree> (t),
14066 TREE_TYPE (TYPE_MIN_VALUE (t))
14067 but does not for C sizetypes in LTO. */
14068 }
14070 /* Check various uses of TYPE_MAXVAL_RAW. */
14072 {
14074 ;
14076 {
14080 }
14082 {
14086 }
14087 }
14089 {
14093 {
14097 }
14098 }
14100 {
14104 {
14108 }
14109 }
14112 {
14113 /* FIXME: The following check should pass:
14114 useless_type_conversion_p (const_cast <tree> (t),
14115 TREE_TYPE (TYPE_MAX_VALUE (t))
14116 but does not for C sizetypes in LTO. */
14117 }
14119 {
14122 {
14126 }
14127 }
14129 {
14133 }
14136 {
14140 }
14142 /* Check various uses of TYPE_VALUES_RAW. */
14145 {
14149 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14150 CONST_DECL of ENUMERAL TYPE. */
14152 {
14157 }
14161 {
14167 }
14169 {
14174 }
14175 }
14177 {
14179 {
14183 }
14184 }
14186 {
14188 {
14191 }
14193 {
14194 /* TODO: verify properties of decls. */
14196 ;
14198 ;
14200 ;
14202 ;
14204 ;
14206 ;
14208 ;
14209 else
14210 {
14214 }
14215 }
14216 }
14223 {
14225 {
14230 }
14232 {
14236 }
14237 /* Verify just enough of cache to ensure that no one copied it to new type.
14238 All copying should go by copy_node that should clear it. */
14240 {
14245 {
14250 }
14251 }
14252 }
14255 {
14256 /* C++ FE uses TREE_PURPOSE to store initial values. */
14258 {
14262 }
14264 {
14268 }
14269 }
14271 {
14275 }
14283 {
14286 }
14288 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14289 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14290 of a type. */
14293 {
14296 }
14299 {
14302 }
14303 }
14306 /* Return 1 if ARG interpreted as signed in its precision is known to be
14307 always positive or 2 if ARG is known to be always negative, or 3 if
14308 ARG may be positive or negative. */
14310 int
14312 {
14319 {
14323 else
14325 }
14329 {
14331 /* Narrower value zero extended into wider type
14332 will always result in positive values. */
14339 }
14343 value_range r;
14345 {
14349 {
14353 {
14362 }
14363 }
14365 }
14367 {
14368 /* For unsigned values, the "positive" range comes
14369 below the "negative" range. */
14374 }
14375 else
14376 {
14381 }
14383 }
14388 /* Return true if ARG is marked with the nonnull attribute in the
14389 current function signature. */
14391 bool
14393 {
14401 /* The static chain decl is always non null. */
14405 /* THIS argument of method is always non-NULL. */
14411 /* Values passed by reference are always non-NULL. */
14418 {
14421 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14425 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14429 /* Get the position number for ARG in the function signature. */
14431 t;
14433 {
14436 }
14440 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14442 {
14445 }
14446 }
14449 }
14451 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14452 information. */
14454 location_t
14456 {
14461 }
14463 location_t
14465 {
14466 source_range src_range;
14470 }
14472 location_t
14474 {
14482 pure_loc,
14483 src_range,
14484 NULL,
14485 discriminator);
14488 }
14490 /* Return EXPR, potentially wrapped with a node expression LOC,
14491 if !CAN_HAVE_LOCATION_P (expr).
14493 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14494 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14496 Wrapper nodes can be identified using location_wrapper_p. */
14498 tree
14500 {
14507 /* We should only be adding wrappers for constants and for decls,
14508 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14513 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14514 any impact of the wrapper nodes. */
14518 /* Compiler-generated temporary variables don't need a wrapper. */
14522 /* If any auto_suppress_location_wrappers are active, don't create
14523 wrappers. */
14527 tree_code code
14532 /* Mark this node as being a wrapper. */
14535 }
14539 /* Return the name of combined function FN, for debugging purposes. */
14543 {
14545 {
14548 }
14549 else
14551 }
14553 /* Return a bitmap with a bit set corresponding to each argument in
14554 a function call type FNTYPE declared with attribute nonnull,
14555 or null if none of the function's argument are nonnull. The caller
14556 must free the bitmap. */
14558 bitmap
14560 {
14566 {
14567 /* The this pointer in C++ non-static member functions is
14568 implicitly nonnull whether or not it's declared as such. */
14571 }
14577 /* A function declaration can specify multiple attribute nonnull,
14578 each with zero or more arguments. The loop below creates a bitmap
14579 representing a union of all the arguments. An empty (but non-null)
14580 bitmap means that all arguments have been declaraed nonnull. */
14582 {
14591 {
14592 /* Clear the bitmap in case a previous attribute nonnull
14593 set it and this one overrides it for all arguments. */
14596 }
14598 /* Iterate over the indices of the format arguments declared nonnull
14599 and set a bit for each. */
14601 {
14604 }
14605 }
14608 }
14610 /* Returns true if TYPE is a type where it and all of its subobjects
14611 (recursively) are of structure, union, or array type. */
14613 bool
14615 {
14617 {
14624 }
14630 }
14632 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14633 that shouldn't be passed via stack. */
14635 bool
14637 {
14648 }
14650 /* Determine whether TYPE is a structure with a flexible array member,
14651 or a union containing such a structure (possibly recursively). */
14653 bool
14655 {
14658 {
14674 {
14678 }
14682 }
14683 }
14685 /* Like int_size_in_bytes, but handle empty records specially. */
14687 HOST_WIDE_INT
14689 {
14691 }
14693 /* Like size_in_bytes, but handle empty records specially. */
14695 tree
14697 {
14699 }
14701 /* Return true if an expression with CODE has to have the same result type as
14702 its first operand. */
14704 bool
14706 {
14708 {
14742 }
14743 }
14745 /* Return a typenode for the "standard" C type with a given name. */
14746 tree
14748 {
14780 }
14782 /* List of pointer types used to declare builtins before we have seen their
14783 real declaration.
14785 Keep the size up to date in tree.h ! */
14787 {
14794 };
14796 /* Return the maximum object size. */
14798 tree
14800 {
14801 /* To do: Make this a configurable parameter. */
14803 }
14805 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14806 parameter default to false and that weeds out error_mark_node. */
14808 bool
14811 {
14818 }
14820 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14821 delete operators. Return false if they may or may not name such
14822 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14823 do not. */
14825 bool
14828 {
14838 /* The following failures are due to invalid names so they're not
14839 considered certain mismatches. */
14855 /* The following failures are due to names of user-defined operators
14856 so they're also not considered certain mismatches. */
14858 /* *_len is now just the length after initial underscores. */
14864 /* The following failures are certain mismatches. */
14867 /* _Znw must match _Zdl, _Zna must match _Zda. */
14871 /* 'j', 'm' and 'y' correspond to size_t. */
14878 {
14879 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14880 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14887 }
14891 {
14892 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14893 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14894 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14904 }
14906 /* The negative result is conservative. */
14909 }
14911 /* Return the zero-based number corresponding to the argument being
14912 deallocated if FNDECL is a deallocation function or an out-of-bounds
14913 value if it isn't. */
14915 unsigned
14917 {
14918 /* A call to operator delete isn't recognized as one to a built-in. */
14920 {
14924 /* Avoid placement delete that's not been inlined. */
14930 }
14932 /* TODO: Handle user-defined functions with attribute malloc? Handle
14933 known non-built-ins like fopen? */
14935 {
14937 {
14943 }
14945 }
14954 {
14965 }
14968 }
14970 /* If EXPR refers to a character array or pointer declared attribute
14971 nonstring, return a decl for that array or pointer and set *REF
14972 to the referenced enclosing object or pointer. Otherwise return
14973 null. */
14975 tree
14977 {
14981 {
14985 {
14991 }
14992 else
14994 }
14999 /* To simplify calling code, store the referenced DECL regardless of
15000 the attribute determined below, but avoid storing the SSA_NAME_VAR
15001 obtained above (it's not useful for dataflow purposes). */
15005 /* Use the SSA_NAME_VAR that was determined above to see if it's
15006 declared nonstring. Otherwise drill down into the referenced
15007 DECL. */
15022 }
15024 /* Return length of attribute names string,
15025 if arglist chain > 1, -1 otherwise. */
15027 int
15029 {
15030 tree arg;
15035 {
15040 argnum++;
15041 argnum++;
15042 }
15046 }
15048 void
15050 {
15052 }
15054 #if CHECKING_P
15058 /* Selftests for tree. */
15060 /* Verify that integer constants are sane. */
15062 static void
15064 {
15077 }
15079 /* Verify identifiers. */
15081 static void
15083 {
15087 }
15089 /* Verify LABEL_DECL. */
15091 static void
15093 {
15099 }
15101 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15102 are given by VALS. */
15104 static tree
15106 {
15111 }
15113 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15115 static void
15117 {
15123 }
15125 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15126 and that its elements match EXPECTED. */
15128 static void
15131 {
15138 }
15140 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15141 and NPATTERNS background elements, and that its elements match
15142 EXPECTED. */
15144 static void
15147 {
15154 }
15156 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15157 and that its elements match EXPECTED. */
15159 static void
15162 {
15169 }
15171 /* Test the creation of VECTOR_CSTs. */
15173 static void
15175 {
15181 /* Test a simple linear series with a base of 0 and a step of 1:
15182 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15188 /* Try the same with the first element replaced by 100:
15189 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15194 /* Try a series that wraps around.
15195 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15201 /* Try a downward series:
15202 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15208 /* Try two interleaved series with different bases and steps:
15209 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15212 {
15215 }
15219 /* Try a duplicated value:
15220 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15226 /* Try an interleaved duplicated value:
15227 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15234 /* Try a duplicated value with 2 exceptions
15235 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15241 /* Try with and without a step
15242 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15248 /* Try a fully-general constant:
15249 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15253 }
15255 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15256 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15257 modifying its argument in-place. */
15259 static void
15261 {
15264 }
15266 /* Verify location wrappers. */
15268 static void
15270 {
15275 /* Wrapping a constant. */
15285 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15288 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15293 /* Wrapping a STRING_CST. */
15305 /* Wrapping a variable. */
15308 integer_type_node);
15317 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15318 wrapper. */
15323 /* Verify that STRIP_NOPS removes wrappers. */
15327 }
15329 /* Test various tree predicates. Verify that location wrappers don't
15330 affect the results. */
15332 static void
15334 {
15335 /* Build various constants and wrappers around them. */
15363 /* TODO: vector constants. */
15365 /* Test integer_onep. */
15385 /* Test integer_zerop. */
15405 /* Test integer_all_onesp. */
15425 /* Test integer_minus_onep. */
15445 /* Test integer_each_onep. */
15465 /* Test integer_truep. */
15485 /* Test integer_nonzerop. */
15505 /* Test real_zerop. */
15525 /* Test real_onep. */
15545 /* Test real_minus_onep. */
15565 /* Test zerop. */
15585 /* Test tree_expr_nonnegative_p. */
15605 /* Test tree_expr_nonzero_p. */
15613 /* Test integer_valued_real_p. */
15620 /* Test integer_pow2p. */
15625 /* Test uniform_integer_cst_p. */
15644 }
15646 /* Check that string escaping works correctly. */
15648 static void
15650 {
15652 escaped_string msg;
15655 /* ASSERT_STREQ does not accept NULL as a valid test
15656 result, so we have to use ASSERT_EQ instead. */
15665 /* Ensure that we have -fmessage-length set to 0. */
15675 /* Now repeat the tests with -fmessage-length set to 5. */
15678 /* Note that the newline is not translated into an escape. */
15685 /* Restore the original message length setting. */
15687 }
15689 /* Run all of the selftests within this file. */
15691 void
15693 {
15701 }