| blob | 8a8d6d5091a403c0888e81f9c16204643b3c9a19 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2023 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
25 nodes of that code.
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
77 /* Names of tree components.
78 Used for printing out the tree and error messages. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
84 };
86 #undef DEFTREECODE
87 #undef END_OF_BASE_TREE_CODES
89 /* Each tree code class has an associated string representation.
90 These must correspond to the tree_code_class entries. */
93 {
104 "expression"
105 };
107 /* obstack.[ch] explicitly declined to prototype this. */
110 /* Statistics-gathering stuff. */
116 /* Keep in sync with tree.h:enum tree_node_kind. */
134 };
136 /* Unique id for next decl created. */
138 /* Unique id for next type created. */
140 /* Unique id for next debug decl created. Use negative numbers,
141 to catch erroneous uses. */
144 /* Since we cannot rehash a type after it is in the table, we have to
145 keep the hash code. */
149 tree type;
150 };
152 /* Initial size of the hash table (rounded to next prime). */
153 #define TYPE_HASH_INITIAL_SIZE 1000
156 {
160 static int
162 {
164 }
165 };
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
176 /* Hash table and temporary node for larger integer const values. */
180 {
183 };
187 /* Class and variable for making sure that there is a single POLY_INT_CST
188 for a given value. */
190 {
194 };
198 /* Hash table for optimization flags and target option flags. Use the same
199 hash table for both sets of options. Nodes for building the current
200 optimization and target option nodes. The assumption is most of the time
201 the options created will already be in the hash table, so we avoid
202 allocating and freeing up a node repeatably. */
207 {
210 };
214 /* General tree->tree mapping structure for use in hash tables. */
239 /* Number of operands for each OMP clause. */
241 {
329 };
332 {
420 };
422 /* Unless specific to OpenACC, we tend to internally maintain OpenMP-centric
423 clause names, but for use in diagnostics etc. would like to use the "user"
424 clause names. */
428 {
429 /* For OpenACC, the 'OMP_CLAUSE_MAP_KIND' of an 'OMP_CLAUSE_MAP' is used to
430 distinguish clauses as seen by the user. See also where front ends do
431 'build_omp_clause' with 'OMP_CLAUSE_MAP'. */
434 {
452 }
455 }
458 /* Return the tree node structure used by tree code CODE. */
462 {
464 {
467 {
479 }
493 }
496 {
497 /* tcc_constant cases. */
507 /* tcc_exceptional cases. */
524 }
525 }
528 /* Initialize tree_contains_struct to describe the hierarchy of tree
529 nodes. */
531 static void
533 {
537 {
544 /* Mark the TS structure itself. */
547 /* Mark all the structures that TS is derived from. */
549 {
629 }
630 }
632 /* Basic consistency checks for attributes used in fold. */
673 }
676 /* Init tree.cc. */
678 void
680 {
681 /* Initialize the hash table of types. */
682 type_hash_table
685 debug_expr_for_decl
688 value_expr_for_decl
702 /* Initialize the tree_contains_struct array. */
705 }
707 \f
708 /* The name of the object as the assembler will see it (but before any
709 translations made by ASM_OUTPUT_LABELREF). Often this is the same
710 as DECL_NAME. It is an IDENTIFIER_NODE. */
711 tree
713 {
717 }
719 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
720 (either of which may be NULL). Inform the FE, if this changes the
721 name. */
723 void
725 {
728 }
730 /* Return true if DECL may need an assembler name to be set. */
734 {
735 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
736 Rule merging. This makes type_odr_p to return true on those types during
737 LTO and by comparing the mangled name, we can say what types are intended
738 to be equivalent across compilation unit.
740 We do not store names of type_in_anonymous_namespace_p.
742 Record, union and enumeration type have linkage that allows use
743 to check type_in_anonymous_namespace_p. We do not mangle compound types
744 that always can be compared structurally.
746 Similarly for builtin types, we compare properties of their main variant.
747 A special case are integer types where mangling do make differences
748 between char/signed char/unsigned char etc. Storing name for these makes
749 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
750 See cp/mangle.cc:write_builtin_type for details. */
753 {
766 }
767 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
771 /* If DECL already has its assembler name set, it does not need a
772 new one. */
777 /* Abstract decls do not need an assembler name. */
781 /* For VAR_DECLs, only static, public and external symbols need an
782 assembler name. */
790 {
791 /* Do not set assembler name on builtins. Allow RTL expansion to
792 decide whether to expand inline or via a regular call. */
797 /* Functions represented in the callgraph need an assembler name. */
801 /* Unused and not public functions don't need an assembler name. */
804 }
807 }
809 /* If T needs an assembler name, have one created for it. */
811 void
813 {
815 {
816 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
817 diagnostics that use input_location to show locus
818 information. The problem here is that, at this point,
819 input_location is generally anchored to the end of the file
820 (since the parser is long gone), so we don't have a good
821 position to pin it to.
823 To alleviate this problem, this uses the location of T's
824 declaration. Examples of this are
825 testsuite/g++.dg/template/cond2.C and
826 testsuite/g++.dg/template/pr35240.C. */
833 }
834 }
836 /* When the target supports COMDAT groups, this indicates which group the
837 DECL is associated with. This can be either an IDENTIFIER_NODE or a
838 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
839 tree
841 {
846 }
848 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
849 tree
851 {
856 }
858 /* When the target supports named section, return its name as IDENTIFIER_NODE
859 or NULL if it is in no section. */
862 {
867 }
869 /* Set section name of NODE to VALUE (that is expected to be
870 identifier node) */
871 void
873 {
877 {
881 }
884 else
887 }
889 /* Set section name of NODE to match the section name of OTHER.
891 set_decl_section_name (decl, other) is equivalent to
892 set_decl_section_name (decl, DECL_SECTION_NAME (other)), but possibly more
893 efficient. */
894 void
896 {
899 {
903 else
906 }
907 else
908 {
913 }
914 }
916 /* Return TLS model of a variable NODE. */
917 enum tls_model
919 {
924 }
926 /* Set TLS model of variable NODE to MODEL. */
927 void
929 {
933 {
937 }
938 else
941 }
943 /* Compute the number of bytes occupied by a tree with code CODE.
944 This function cannot be used for nodes that have variable sizes,
945 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
946 size_t
948 {
950 {
953 {
970 }
974 {
999 }
1012 {
1024 }
1028 {
1049 }
1053 }
1054 }
1056 /* Compute the number of bytes occupied by NODE. This routine only
1057 looks at TREE_CODE, except for those nodes that have variable sizes. */
1058 size_t
1060 {
1063 {
1093 else
1095 }
1096 }
1098 /* Return tree node kind based on tree CODE. */
1100 static tree_node_kind
1102 {
1106 {
1124 {
1141 }
1147 }
1148 }
1150 /* Record interesting allocation statistics for a tree node with CODE
1151 and LENGTH. */
1153 static void
1155 {
1164 }
1166 /* Allocate and return a new UID from the DECL_UID namespace. */
1168 int
1170 {
1172 }
1174 /* Return a newly allocated node of code CODE. For decl and type
1175 nodes, some other fields are initialized. The rest of the node is
1176 initialized to zero. This function cannot be used for TREE_VEC,
1177 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1178 tree_code_size.
1180 Achoo! I got a code in the node. */
1182 tree
1184 {
1185 tree t;
1195 {
1203 {
1205 {
1208 }
1209 else
1211 }
1215 else
1216 {
1219 }
1232 /* Default to no attributes for type, but let target change that. */
1236 /* We have not yet computed the alias set for this type. */
1246 {
1254 /* All of these have side-effects, no matter what their
1255 operands are. */
1261 }
1266 {
1279 }
1283 /* Other classes need no special treatment. */
1285 }
1288 }
1290 /* Free tree node. */
1292 void
1294 {
1297 {
1307 }
1319 }
1320 \f
1321 /* Return a new node with the same contents as NODE except that its
1322 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1324 tree
1326 {
1327 tree t;
1344 {
1347 else
1348 {
1352 }
1355 {
1358 }
1359 /* DECL_DEBUG_EXPR is copied explicitly by callers. */
1361 {
1364 }
1366 {
1369 }
1371 {
1374 }
1375 }
1377 {
1379 /* The following is so that the debug code for
1380 the copy is different from the original type.
1381 The two statements usually duplicate each other
1382 (because they clear fields of the same union),
1383 but the optimizer should catch that. */
1387 /* Do not copy the values cache. */
1389 {
1392 }
1393 }
1395 {
1399 }
1401 {
1405 }
1408 }
1410 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1411 For example, this can copy a list made of TREE_LIST nodes. */
1413 tree
1415 {
1416 tree head;
1425 {
1429 }
1431 }
1433 \f
1434 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1435 INTEGER_CST with value CST and type TYPE. */
1437 static unsigned int
1439 {
1441 /* We need extra HWIs if CST is an unsigned integer with its
1442 upper bit set. */
1446 }
1448 /* Return a new INTEGER_CST with value CST and type TYPE. */
1450 static tree
1452 {
1458 {
1464 }
1467 {
1468 len--;
1472 }
1478 }
1480 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1482 static tree
1484 CXX_MEM_STAT_INFO)
1485 {
1497 }
1499 /* Create a constant tree that contains CST sign-extended to TYPE. */
1501 tree
1503 {
1504 /* Support legacy code. */
1509 }
1511 /* Create a constant tree that contains CST zero-extended to TYPE. */
1513 tree
1515 {
1517 }
1519 /* Create a constant tree that contains CST sign-extended to TYPE. */
1521 tree
1523 {
1526 }
1528 /* Constructs tree in type TYPE from with value given by CST. Signedness
1529 of CST is assumed to be the same as the signedness of TYPE. */
1531 tree
1533 {
1535 }
1537 /* We force the wide_int CST to the range of the type TYPE by sign or
1538 zero extending it. OVERFLOWABLE indicates if we are interested in
1539 overflow of the value, when >0 we are only interested in signed
1540 overflow, for <0 we are interested in any overflow. OVERFLOWED
1541 indicates whether overflow has already occurred. CONST_OVERFLOWED
1542 indicates whether constant overflow has already occurred. We force
1543 T's value to be within range of T's type (by setting to 0 or 1 all
1544 the bits outside the type's range). We set TREE_OVERFLOWED if,
1545 OVERFLOWED is nonzero,
1546 or OVERFLOWABLE is >0 and signed overflow occurs
1547 or OVERFLOWABLE is <0 and any overflow occurs
1548 We return a new tree node for the extended wide_int. The node
1549 is shared if no overflow flags are set. */
1552 tree
1555 {
1558 /* If we need to set overflow flags, return a new unshared node. */
1560 {
1564 {
1566 sign);
1567 tree t;
1570 else
1571 {
1574 {
1577 }
1579 }
1582 }
1583 }
1585 /* Else build a shared node. */
1587 }
1589 /* These are the hash table functions for the hash table of INTEGER_CST
1590 nodes of a sizetype. */
1592 /* Return the hash code X, an INTEGER_CST. */
1594 hashval_t
1596 {
1605 }
1607 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1608 is the same as that given by *Y, which is the same. */
1610 bool
1612 {
1626 }
1628 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1629 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1630 number of slots that can be cached for the type. */
1635 {
1637 /* Initialize cache. */
1639 {
1642 }
1645 {
1646 /* Create a new shared int. */
1649 }
1651 }
1653 /* Create an INT_CST node of TYPE and value CST.
1654 The returned node is always shared. For small integers we use a
1655 per-type vector cache, for larger ones we use a single hash table.
1656 The value is extended from its precision according to the sign of
1657 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1658 the upper bits and ensures that hashing and value equality based
1659 upon the underlying HOST_WIDE_INTs works without masking. */
1661 static tree
1663 {
1664 tree t;
1672 /* Verify that everything is canonical. */
1675 {
1680 }
1687 {
1688 /* Cache NULL pointer and zero bounds. */
1691 /* Cache upper bounds of pointers. */
1694 /* Cache 1 which is used for a non-zero range. */
1699 {
1701 /* Make sure no one is clobbering the shared constant. */
1705 }
1706 }
1708 {
1709 /* We just need to store a single HOST_WIDE_INT. */
1710 HOST_WIDE_INT hwi;
1713 else
1717 {
1720 /* Fallthru. */
1724 /* Ignore pointers, as they were already handled above. */
1728 /* Cache false or true. */
1738 {
1739 /* Cache [0, N). */
1743 }
1744 else
1745 {
1746 /* Cache [-1, N). */
1750 }
1758 }
1761 {
1763 /* Make sure no one is clobbering the shared constant. */
1770 }
1771 else
1772 {
1773 /* Use the cache of larger shared ints, using int_cst_node as
1774 a temporary. */
1782 {
1783 /* Insert this one into the hash table. */
1786 /* Make a new node for next time round. */
1788 }
1789 }
1790 }
1791 else
1792 {
1793 /* The value either hashes properly or we drop it on the floor
1794 for the gc to take care of. There will not be enough of them
1795 to worry about. */
1801 {
1802 /* Insert this one into the hash table. */
1805 }
1806 else
1808 }
1811 }
1813 hashval_t
1815 {
1823 }
1825 bool
1827 {
1834 }
1836 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1837 The elements must also have type TYPE. */
1839 tree
1841 {
1852 INSERT);
1854 {
1859 }
1861 }
1863 /* Create a constant tree with value VALUE in type TYPE. */
1865 tree
1867 {
1871 }
1873 /* Insert INTEGER_CST T into a cache of integer constants. And return
1874 the cached constant (which may or may not be T). If MIGHT_DUPLICATE
1875 is false, and T falls into the type's 'smaller values' range, there
1876 cannot be an existing entry. Otherwise, if MIGHT_DUPLICATE is true,
1877 or the value is large, should an existing entry exist, it is
1878 returned (rather than inserting T). */
1880 tree
1882 {
1890 /* The caching indices here must match those in
1891 wide_int_to_type_1. */
1893 {
1896 /* Fallthru. */
1900 {
1908 }
1912 /* Cache false or true. */
1922 {
1923 /* Cache 0..N */
1926 /* This is a little hokie, but if the prec is smaller than
1927 what is necessary to hold param_integer_share_limit, then the
1928 obvious test will not get the correct answer. */
1930 {
1934 }
1937 }
1938 else
1939 {
1940 /* Cache -1..N */
1946 {
1948 {
1951 }
1954 }
1955 }
1959 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1960 members. */
1965 }
1968 {
1969 /* Look for it in the type's vector of small shared ints. */
1971 {
1974 }
1977 {
1980 }
1981 else
1983 }
1984 else
1985 {
1986 /* Use the cache of larger shared ints. */
1989 {
1990 /* If there is already an entry for the number verify it's the
1991 same value. */
1993 /* And return the cached value. */
1995 }
1996 else
1997 /* Otherwise insert this one into the hash table. */
1999 }
2002 }
2005 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
2006 and the rest are zeros. */
2008 tree
2010 {
2015 }
2017 /* Checks that X is integer constant that can be expressed in (unsigned)
2018 HOST_WIDE_INT without loss of precision. */
2020 bool
2022 {
2025 }
2027 /* Build a newly constructed VECTOR_CST with the given values of
2028 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
2030 tree
2033 {
2035 tree t;
2051 }
2053 /* Return a new VECTOR_CST node whose type is TYPE and whose values
2054 are extracted from V, a vector of CONSTRUCTOR_ELT. */
2056 tree
2058 {
2063 tree value;
2065 /* We can't construct a VECTOR_CST for a variable number of elements. */
2069 {
2071 {
2072 /* If NELTS is constant then this must be too. */
2076 }
2077 else
2079 }
2084 }
2086 /* Build a vector of type VECTYPE where all the elements are SCs. */
2087 tree
2089 {
2095 /* Verify that the vector type is suitable for SC. Note that there
2096 is some inconsistency in the type-system with respect to restrict
2097 qualifications of pointers. Vector types always have a main-variant
2098 element type and the qualification is applied to the vector-type.
2099 So TREE_TYPE (vector-type) does not return a properly qualified
2100 vector element-type. */
2105 {
2109 }
2112 else
2113 {
2119 }
2120 }
2122 /* If TYPE is not a vector type, just return SC, otherwise return
2123 build_vector_from_val (TYPE, SC). */
2125 tree
2127 {
2132 }
2134 /* Build a vector series of type TYPE in which element I has the value
2135 BASE + I * STEP. The result is a constant if BASE and STEP are constant
2136 and a VEC_SERIES_EXPR otherwise. */
2138 tree
2140 {
2144 {
2154 }
2156 }
2158 /* Return a vector with the same number of units and number of bits
2159 as VEC_TYPE, but in which the elements are a linear series of unsigned
2160 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
2162 tree
2164 {
2169 {
2170 index_elt_type = build_nonstandard_integer_type
2173 }
2179 }
2181 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2182 elements are A and the rest are B. */
2184 tree
2186 {
2189 /* Optimize the constant case. */
2196 }
2198 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2199 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2201 void
2203 {
2205 tree val;
2211 {
2212 /* Mostly ctors will have elts that don't have side-effects, so
2213 the usual case is to scan all the elements. Hence a single
2214 loop for both const and side effects, rather than one loop
2215 each (with early outs). */
2220 }
2224 }
2226 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2227 CONSTRUCTOR C. */
2229 void
2231 {
2233 tree val;
2239 {
2244 }
2245 }
2247 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2248 are in the vec pointed to by VALS. */
2249 tree
2251 {
2260 }
2262 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2263 INDEX and VALUE. */
2264 tree
2266 {
2274 }
2277 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2278 are in a list pointed to by VALS. */
2279 tree
2281 {
2282 tree t;
2286 {
2290 }
2293 }
2295 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2296 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2297 fields in the constructor remain null. */
2299 tree
2301 {
2308 }
2310 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2311 of elements, provided as index/value pairs. */
2313 tree
2315 {
2322 {
2326 }
2329 }
2331 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2333 tree
2335 {
2340 }
2342 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2344 tree
2346 {
2347 tree v;
2357 }
2359 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2361 tree
2363 {
2364 tree v;
2367 /* dconst{0,1,2,m1,half} are used in various places in
2368 the middle-end and optimizers, allow them here
2369 even for decimal floating point types as an exception
2370 by converting them to decimal. */
2374 {
2384 {
2385 /* Make sure to give zero the minimum quantum exponent for
2386 the type (which corresponds to all bits zero). */
2391 }
2392 else
2394 }
2396 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2397 Consider doing it via real_convert now. */
2404 }
2406 /* Like build_real, but first truncate D to the type. */
2408 tree
2410 {
2412 }
2414 /* Return a new REAL_CST node whose type is TYPE
2415 and whose value is the integer value of the INTEGER_CST node I. */
2417 REAL_VALUE_TYPE
2419 {
2420 REAL_VALUE_TYPE d;
2422 /* Clear all bits of the real value type so that we can later do
2423 bitwise comparisons to see if two values are the same. */
2429 }
2431 /* Given a tree representing an integer constant I, return a tree
2432 representing the same value as a floating-point constant of type TYPE. */
2434 tree
2436 {
2437 tree v;
2444 }
2446 /* Return a new REAL_CST node whose type is TYPE
2447 and whose value is the integer value I which has sign SGN. */
2449 tree
2451 {
2452 REAL_VALUE_TYPE d;
2454 /* Clear all bits of the real value type so that we can later do
2455 bitwise comparisons to see if two values are the same. */
2460 }
2462 /* Return a newly constructed STRING_CST node whose value is the LEN
2463 characters at STR when STR is nonnull, or all zeros otherwise.
2464 Note that for a C string literal, LEN should include the trailing NUL.
2465 The TREE_TYPE is not initialized. */
2467 tree
2469 {
2470 /* Do not waste bytes provided by padding of struct tree_string. */
2483 else
2488 }
2490 /* Return a newly constructed COMPLEX_CST node whose value is
2491 specified by the real and imaginary parts REAL and IMAG.
2492 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2493 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2495 tree
2497 {
2508 }
2510 /* Build a complex (inf +- 0i), such as for the result of cproj.
2511 TYPE is the complex tree type of the result. If NEG is true, the
2512 imaginary zero is negative. */
2514 tree
2516 {
2522 }
2524 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2525 element is set to 1. In particular, this is 1 + i for complex types. */
2527 tree
2529 {
2531 {
2534 }
2535 else
2537 }
2539 /* Return a constant of arithmetic type TYPE which is the
2540 multiplicative identity of the set TYPE. */
2542 tree
2544 {
2546 {
2556 /* We can only generate 1 for accum types. */
2561 {
2565 }
2574 }
2575 }
2577 /* Return an integer of type TYPE containing all 1's in as much precision as
2578 it contains, or a complex or vector whose subparts are such integers. */
2580 tree
2582 {
2584 {
2587 }
2588 else
2590 }
2592 /* Return a constant of arithmetic type TYPE which is the
2593 opposite of the multiplicative identity of the set TYPE. */
2595 tree
2597 {
2599 {
2609 /* We can only generate 1 for accum types. */
2616 {
2620 }
2629 }
2630 }
2632 /* Build 0 constant of type TYPE. This is used by constructor folding
2633 and thus the constant should be represented in memory by
2634 zero(es). */
2636 tree
2638 {
2640 {
2653 {
2657 }
2660 {
2664 }
2670 }
2671 }
2673 /* Build a constant of integer type TYPE, made of VALUE's bits replicated
2674 every WIDTH bits to fit TYPE's precision. */
2676 tree
2678 {
2689 else
2690 {
2693 }
2699 return wide_int_to_tree
2701 }
2703 /* If floating-point type TYPE has an IEEE-style sign bit, return an
2704 unsigned constant in which only the sign bit is set. Return null
2705 otherwise. */
2707 tree
2709 {
2710 /* Avoid having to choose between a real-only sign and a pair of signs.
2711 This could be relaxed if the choice becomes obvious later. */
2726 {
2729 }
2731 }
2733 /* Build a BINFO with LEN language slots. */
2735 tree
2737 {
2738 tree t;
2753 }
2755 /* Create a CASE_LABEL_EXPR tree node and return it. */
2757 tree
2759 {
2771 }
2773 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2774 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2775 The latter determines the length of the HOST_WIDE_INT vector. */
2777 tree
2779 {
2780 tree t;
2792 /* to_offset can only be applied to trees that are offset_int-sized
2793 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2794 must be exactly the precision of offset_int and so LEN is correct. */
2797 else
2803 }
2805 /* Build a newly constructed TREE_VEC node of length LEN. */
2807 tree
2809 {
2810 tree t;
2821 }
2823 /* Grow a TREE_VEC node to new length LEN. */
2825 tree
2827 {
2843 }
2844 \f
2845 /* Return true if EXPR is the constant zero, whether it is integral, float or
2846 fixed, and scalar, complex or vector. */
2848 bool
2850 {
2854 }
2856 /* Return true if EXPR is the integer constant zero or a complex constant
2857 of zero, or a location wrapper for such a constant. */
2859 bool
2861 {
2865 {
2877 }
2878 }
2880 /* Return true if EXPR is the integer constant one or the corresponding
2881 complex constant, or a location wrapper for such a constant. */
2883 bool
2885 {
2889 {
2901 }
2902 }
2904 /* Return true if EXPR is the integer constant one. For complex and vector,
2905 return true if every piece is the integer constant one.
2906 Also return true for location wrappers for such a constant. */
2908 bool
2910 {
2916 else
2918 }
2920 /* Return true if EXPR is an integer containing all 1's in as much precision
2921 as it contains, or a complex or vector whose subparts are such integers,
2922 or a location wrapper for such a constant. */
2924 bool
2926 {
2944 }
2946 /* Return true if EXPR is the integer constant minus one, or a location
2947 wrapper for such a constant. */
2949 bool
2951 {
2957 else
2959 }
2961 /* Return true if EXPR is an integer constant that is a power of 2 (i.e., has
2962 only one bit on), or a location wrapper for such a constant. */
2964 bool
2966 {
2978 }
2980 /* Return true if EXPR is an integer constant other than zero or a
2981 complex constant other than zero, or a location wrapper for such a
2982 constant. */
2984 bool
2986 {
2994 }
2996 /* Return true if EXPR is the integer constant one. For vector,
2997 return true if every piece is the integer constant minus one
2998 (representing the value TRUE).
2999 Also return true for location wrappers for such a constant. */
3001 bool
3003 {
3009 }
3011 /* Return true if EXPR is the fixed-point constant zero, or a location wrapper
3012 for such a constant. */
3014 bool
3016 {
3021 }
3023 /* Return the power of two represented by a tree node known to be a
3024 power of two. */
3026 int
3028 {
3033 }
3035 /* Similar, but return the largest integer Y such that 2 ** Y is less
3036 than or equal to EXPR. */
3038 int
3040 {
3045 }
3047 /* Return number of known trailing zero bits in EXPR, or, if the value of
3048 EXPR is known to be zero, the precision of it's type. */
3050 unsigned int
3052 {
3059 {
3080 /* Second operand is sizetype, which could be in theory
3081 wider than pointer's precision. Make sure we never
3082 return more than prec. */
3097 {
3100 }
3105 {
3110 }
3119 {
3122 {
3127 }
3128 }
3130 CASE_CONVERT:
3148 {
3151 }
3155 }
3156 }
3158 /* Return true if EXPR is the real constant zero. Trailing zeroes matter for
3159 decimal float constants, so don't return true for them.
3160 Also return true for location wrappers around such a constant. */
3162 bool
3164 {
3168 {
3176 {
3177 /* Don't simply check for a duplicate because the predicate
3178 accepts both +0.0 and -0.0. */
3184 }
3187 }
3188 }
3190 /* Return true if EXPR is the real constant one in real or complex form.
3191 Trailing zeroes matter for decimal float constants, so don't return
3192 true for them.
3193 Also return true for location wrappers around such a constant. */
3195 bool
3197 {
3201 {
3214 }
3215 }
3217 /* Return true if EXPR is the real constant minus one. Trailing zeroes
3218 matter for decimal float constants, so don't return true for them.
3219 Also return true for location wrappers around such a constant. */
3221 bool
3223 {
3227 {
3240 }
3241 }
3243 /* Return true if T could be a floating point zero. */
3245 bool
3247 {
3249 {
3251 /* Can't use real_zerop here, as it always returns false for decimal
3252 floats. And can't use TREE_REAL_CST (expr).cl == rvc_zero
3253 either, as decimal zeros are rvc_normal. */
3259 {
3265 }
3267 /* Perhaps for SSA_NAMEs we could query frange. */
3269 }
3270 }
3272 /* True if EXP is a constant or a cast of a constant. */
3274 bool
3276 {
3277 /* This is not quite the same as STRIP_NOPS. It does more. */
3282 }
3284 /* Return true if T holds a polynomial pointer difference, storing it in
3285 *VALUE if so. A true return means that T's precision is no greater
3286 than 64 bits, which is the largest address space we support, so *VALUE
3287 never loses precision. However, the signedness of the result does
3288 not necessarily match the signedness of T: sometimes an unsigned type
3289 like sizetype is used to encode a value that is actually negative. */
3291 bool
3293 {
3297 {
3302 }
3304 {
3311 }
3313 }
3315 poly_int64
3317 {
3322 }
3324 poly_uint64
3326 {
3331 }
3332 \f
3333 /* Return first list element whose TREE_VALUE is ELEM.
3334 Return 0 if ELEM is not in LIST. */
3336 tree
3338 {
3340 {
3344 }
3346 }
3348 /* Return first list element whose TREE_PURPOSE is ELEM.
3349 Return 0 if ELEM is not in LIST. */
3351 tree
3353 {
3355 {
3359 }
3361 }
3363 /* Return true if ELEM is in V. */
3365 bool
3367 {
3369 tree t;
3374 }
3376 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3377 NULL_TREE. */
3379 tree
3381 {
3385 }
3387 /* Return true if ELEM is part of the chain CHAIN. */
3389 bool
3391 {
3393 {
3397 }
3400 }
3402 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3403 We expect a null pointer to mark the end of the chain.
3404 This is the Lisp primitive `length'. */
3406 int
3408 {
3410 #ifdef ENABLE_TREE_CHECKING
3412 #endif
3416 {
3418 #ifdef ENABLE_TREE_CHECKING
3422 #endif
3423 len++;
3424 }
3427 }
3429 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3430 UNION_TYPE TYPE, or NULL_TREE if none. */
3432 tree
3434 {
3439 }
3441 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3442 UNION_TYPE TYPE, or NULL_TREE if none. */
3444 tree
3446 {
3450 {
3455 }
3458 }
3460 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3461 by modifying the last node in chain 1 to point to chain 2.
3462 This is the Lisp primitive `nconc'. */
3464 tree
3466 {
3467 tree t1;
3478 #ifdef ENABLE_TREE_CHECKING
3479 {
3480 tree t2;
3483 }
3484 #endif
3487 }
3489 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3491 tree
3493 {
3494 tree next;
3499 }
3501 /* Reverse the order of elements in the chain T,
3502 and return the new head of the chain (old last element). */
3504 tree
3506 {
3509 {
3510 /* We shouldn't be using this function to reverse BLOCK chains; we
3511 have blocks_nreverse for that. */
3516 }
3518 }
3519 \f
3520 /* Return a newly created TREE_LIST node whose
3521 purpose and value fields are PARM and VALUE. */
3523 tree
3525 {
3530 }
3532 /* Build a chain of TREE_LIST nodes from a vector. */
3534 tree
3536 {
3540 tree t;
3542 {
3545 }
3547 }
3549 /* Return a newly created TREE_LIST node whose
3550 purpose and value fields are PURPOSE and VALUE
3551 and whose TREE_CHAIN is CHAIN. */
3553 tree
3555 {
3556 tree node;
3568 }
3570 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3571 trees. */
3575 {
3579 tree val;
3585 }
3586 \f
3587 /* Return the size nominally occupied by an object of type TYPE
3588 when it resides in memory. The value is measured in units of bytes,
3589 and its data type is that normally used for type sizes
3590 (which is the first type created by make_signed_type or
3591 make_unsigned_type). */
3593 tree
3595 {
3596 tree t;
3605 {
3608 }
3611 }
3613 /* Return the size of TYPE (in bytes) as a wide integer
3614 or return -1 if the size can vary or is larger than an integer. */
3616 HOST_WIDE_INT
3618 {
3619 tree t;
3629 else
3631 }
3633 /* Return the maximum size of TYPE (in bytes) as a wide integer
3634 or return -1 if the size can vary or is larger than an integer. */
3636 HOST_WIDE_INT
3638 {
3640 tree size_tree;
3642 /* If this is an array type, check for a possible MAX_SIZE attached. */
3645 {
3650 }
3652 /* If we still haven't been able to get a size, see if the language
3653 can compute a maximum size. */
3656 {
3661 }
3664 }
3665 \f
3666 /* Return the bit position of FIELD, in bits from the start of the record.
3667 This is a tree of type bitsizetype. */
3669 tree
3671 {
3674 }
3675 \f
3676 /* Return the byte position of FIELD, in bytes from the start of the record.
3677 This is a tree of type sizetype. */
3679 tree
3681 {
3684 }
3686 /* Likewise, but return as an integer. It must be representable in
3687 that way (since it could be a signed value, we don't have the
3688 option of returning -1 like int_size_in_byte can. */
3690 HOST_WIDE_INT
3692 {
3694 }
3695 \f
3696 /* Return, as a tree node, the number of elements for TYPE (which is an
3697 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3699 tree
3701 {
3704 /* If they did it with unspecified bounds, then we should have already
3705 given an error about it before we got here. */
3713 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3715 {
3716 /* zero sized arrays are represented from C FE as complete types with
3717 NULL TYPE_MAX_VALUE and zero TYPE_SIZE, while C++ FE represents
3718 them as min 0, max -1. */
3725 }
3728 ? max
3730 }
3731 \f
3732 /* If arg is static -- a reference to an object in static storage -- then
3733 return the object. This is not the same as the C meaning of `static'.
3734 If arg isn't static, return NULL. */
3736 tree
3738 {
3740 {
3742 /* Nested functions are static, even though taking their address will
3743 involve a trampoline as we unnest the nested function and create
3744 the trampoline on the tree level. */
3765 /* If the thing being referenced is not a field, then it is
3766 something language specific. */
3769 /* If we are referencing a bitfield, we can't evaluate an
3770 ADDR_EXPR at compile time and so it isn't a constant. */
3787 else
3795 }
3796 }
3798 \f
3801 /* Return whether OP is a DECL whose address is function-invariant. */
3803 bool
3805 {
3806 /* The conditions below are slightly less strict than the one in
3807 staticp. */
3810 {
3833 }
3836 }
3838 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3840 bool
3842 {
3843 /* The conditions below are slightly less strict than the one in
3844 staticp. */
3847 {
3867 }
3870 }
3873 /* Return true if T is function-invariant (internal function, does
3874 not handle arithmetic; that's handled in skip_simple_arithmetic and
3875 tree_invariant_p). */
3877 static bool
3879 {
3880 tree op;
3887 {
3894 {
3896 {
3911 }
3913 }
3919 }
3922 }
3924 /* Return true if T is function-invariant. */
3926 bool
3928 {
3931 }
3933 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3934 Do this to any expression which may be used in more than one place,
3935 but must be evaluated only once.
3937 Normally, expand_expr would reevaluate the expression each time.
3938 Calling save_expr produces something that is evaluated and recorded
3939 the first time expand_expr is called on it. Subsequent calls to
3940 expand_expr just reuse the recorded value.
3942 The call to expand_expr that generates code that actually computes
3943 the value is the first call *at compile time*. Subsequent calls
3944 *at compile time* generate code to use the saved value.
3945 This produces correct result provided that *at run time* control
3946 always flows through the insns made by the first expand_expr
3947 before reaching the other places where the save_expr was evaluated.
3948 You, the caller of save_expr, must make sure this is so.
3950 Constants, and certain read-only nodes, are returned with no
3951 SAVE_EXPR because that is safe. Expressions containing placeholders
3952 are not touched; see tree.def for an explanation of what these
3953 are used for. */
3955 tree
3957 {
3958 tree inner;
3960 /* If the tree evaluates to a constant, then we don't want to hide that
3961 fact (i.e. this allows further folding, and direct checks for constants).
3962 However, a read-only object that has side effects cannot be bypassed.
3963 Since it is no problem to reevaluate literals, we just return the
3964 literal node. */
3972 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3973 it means that the size or offset of some field of an object depends on
3974 the value within another field.
3976 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3977 and some variable since it would then need to be both evaluated once and
3978 evaluated more than once. Front-ends must assure this case cannot
3979 happen by surrounding any such subexpressions in their own SAVE_EXPR
3980 and forcing evaluation at the proper time. */
3986 /* This expression might be placed ahead of a jump to ensure that the
3987 value was computed on both sides of the jump. So make sure it isn't
3988 eliminated as dead. */
3991 }
3993 /* Look inside EXPR into any simple arithmetic operations. Return the
3994 outermost non-arithmetic or non-invariant node. */
3996 tree
3998 {
3999 /* We don't care about whether this can be used as an lvalue in this
4000 context. */
4004 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
4005 a constant, it will be more efficient to not make another SAVE_EXPR since
4006 it will allow better simplification and GCSE will be able to merge the
4007 computations if they actually occur. */
4009 {
4013 {
4018 else
4020 }
4021 else
4023 }
4026 }
4028 /* Look inside EXPR into simple arithmetic operations involving constants.
4029 Return the outermost non-arithmetic or non-constant node. */
4031 tree
4033 {
4038 {
4042 {
4047 else
4049 }
4050 else
4052 }
4055 }
4057 /* Return which tree structure is used by T. */
4059 enum tree_node_structure_enum
4061 {
4064 }
4066 /* Set various status flags when building a CALL_EXPR object T. */
4068 static void
4070 {
4075 /* Calls have side-effects, except those to const or pure functions. */
4078 /* Propagate TREE_READONLY of arguments for const functions. */
4084 {
4090 }
4094 }
4095 \f
4096 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
4097 size or offset that depends on a field within a record. */
4099 bool
4101 {
4112 {
4114 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
4115 position computations since they will be converted into a
4116 WITH_RECORD_EXPR involving the reference, which will assume
4117 here will be valid. */
4131 {
4133 /* Ignoring the first operand isn't quite right, but works best. */
4142 /* The save_expr function never wraps anything containing
4143 a PLACEHOLDER_EXPR. */
4148 }
4151 {
4159 }
4163 {
4165 {
4166 const_tree arg;
4167 const_call_expr_arg_iterator iter;
4172 }
4175 }
4179 }
4181 }
4183 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
4184 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
4185 field positions. */
4187 static bool
4189 {
4190 /* If the size contains a placeholder or the parent type (component type in
4191 the case of arrays) type involves a placeholder, this type does. */
4199 /* Now do type-specific checks. Note that the last part of the check above
4200 greatly limits what we have to do below. */
4202 {
4220 /* Here we just check the bounds. */
4225 /* We have already checked the component type above, so just check
4226 the domain type. Flexible array members have a null domain. */
4233 {
4234 tree field;
4245 }
4249 }
4250 }
4252 /* Wrapper around above function used to cache its result. */
4254 bool
4256 {
4259 /* If the contains_placeholder_bits field has been initialized,
4260 then we know the answer. */
4264 /* Indicate that we've seen this type node, and the answer is false.
4265 This is what we want to return if we run into recursion via fields. */
4268 /* Compute the real value. */
4271 /* Store the real value. */
4275 }
4276 \f
4277 /* Push tree EXP onto vector QUEUE if it is not already present. */
4279 static void
4281 {
4283 tree iter;
4291 }
4293 /* Given a tree EXP, find all occurrences of references to fields
4294 in a PLACEHOLDER_EXPR and place them in vector REFS without
4295 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
4296 we assume here that EXP contains only arithmetic expressions
4297 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
4298 argument list. */
4300 void
4302 {
4304 tree inner;
4307 /* We handle TREE_LIST and COMPONENT_REF separately. */
4309 {
4312 }
4314 {
4318 ;
4322 else
4324 }
4325 else
4327 {
4332 /* Variables allocated to static storage can stay. */
4338 /* This is the pattern built in ada/make_aligning_type. */
4341 {
4344 }
4346 /* Fall through. */
4364 }
4365 }
4367 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4368 return a tree with all occurrences of references to F in a
4369 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4370 CONST_DECLs. Note that we assume here that EXP contains only
4371 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4372 occurring only in their argument list. */
4374 tree
4376 {
4379 tree new_tree;
4381 /* We handle TREE_LIST and COMPONENT_REF separately. */
4383 {
4390 }
4392 {
4393 tree inner;
4395 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4396 and it is the right field, replace it with R. */
4400 ;
4402 /* The field. */
4408 /* If this expression hasn't been completed let, leave it alone. */
4416 new_tree
4418 }
4419 else
4421 {
4428 else
4435 /* Fall through. */
4443 {
4488 new_tree
4494 }
4498 {
4503 /* If we are trying to replace F with a constant or with another
4504 instance of one of the arguments of the call, inline back
4505 functions which do nothing else than computing a value from
4506 the arguments they are passed. This makes it possible to
4507 fold partially or entirely the replacement expression. */
4509 {
4513 else
4516 {
4519 }
4521 {
4525 }
4526 }
4529 {
4533 {
4537 }
4538 }
4541 {
4545 }
4546 else
4548 }
4553 }
4561 }
4563 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4564 for it within OBJ, a tree that is an object or a chain of references. */
4566 tree
4568 {
4571 tree new_tree;
4573 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4574 in the chain of OBJ. */
4576 {
4578 tree elt;
4608 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4609 survives until RTL generation, there will be an error. */
4611 }
4613 /* TREE_LIST is special because we need to look at TREE_VALUE
4614 and TREE_CHAIN, not TREE_OPERANDS. */
4616 {
4623 }
4624 else
4626 {
4639 {
4684 new_tree
4690 }
4694 {
4700 {
4704 {
4708 }
4709 }
4712 {
4716 }
4717 else
4719 }
4724 }
4732 }
4733 \f
4735 /* Subroutine of stabilize_reference; this is called for subtrees of
4736 references. Any expression with side-effects must be put in a SAVE_EXPR
4737 to ensure that it is only evaluated once.
4739 We don't put SAVE_EXPR nodes around everything, because assigning very
4740 simple expressions to temporaries causes us to miss good opportunities
4741 for optimizations. Among other things, the opportunity to fold in the
4742 addition of a constant into an addressing mode often gets lost, e.g.
4743 "y[i+1] += x;". In general, we take the approach that we should not make
4744 an assignment unless we are forced into it - i.e., that any non-side effect
4745 operator should be allowed, and that cse should take care of coalescing
4746 multiple utterances of the same expression should that prove fruitful. */
4748 static tree
4750 {
4751 tree result;
4754 /* We cannot ignore const expressions because it might be a reference
4755 to a const array but whose index contains side-effects. But we can
4756 ignore things that are actual constant or that already have been
4757 handled by this function. */
4763 {
4765 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4766 have side-effects. */
4769 /* FALLTHRU */
4777 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4778 so that it will only be evaluated once. */
4779 /* The reference (r) and comparison (<) classes could be handled as
4780 below, but it is generally faster to only evaluate them once. */
4786 /* Constants need no processing. In fact, we should never reach
4787 here. */
4791 /* Division is slow and tends to be compiled with jumps,
4792 especially the division by powers of 2 that is often
4793 found inside of an array reference. So do it just once. */
4799 /* Recursively stabilize each operand. */
4805 /* Recursively stabilize each operand. */
4811 }
4819 }
4821 /* Stabilize a reference so that we can use it any number of times
4822 without causing its operands to be evaluated more than once.
4823 Returns the stabilized reference. This works by means of save_expr,
4824 so see the caveats in the comments about save_expr.
4826 Also allows conversion expressions whose operands are references.
4827 Any other kind of expression is returned unchanged. */
4829 tree
4831 {
4832 tree result;
4836 {
4840 /* No action is needed in this case. */
4843 CASE_CONVERT:
4882 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4883 it wouldn't be ignored. This matters when dealing with
4884 volatiles. */
4887 /* If arg isn't a kind of lvalue we recognize, make no change.
4888 Caller should recognize the error for an invalid lvalue. */
4894 }
4903 }
4904 \f
4905 /* Low-level constructors for expressions. */
4907 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4908 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4910 void
4912 {
4913 tree node;
4918 /* We started out assuming this address is both invariant and constant, but
4919 does not have side effects. Now go down any handled components and see if
4920 any of them involve offsets that are either non-constant or non-invariant.
4921 Also check for side-effects.
4923 ??? Note that this code makes no attempt to deal with the case where
4924 taking the address of something causes a copy due to misalignment. */
4926 #define UPDATE_FLAGS(NODE) \
4927 do { tree _node = (NODE); \
4928 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4929 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4933 {
4934 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4935 array reference (probably made temporarily by the G++ front end),
4936 so ignore all the operands. */
4940 {
4946 }
4947 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4948 FIELD_DECL, apparently. The G++ front end can put something else
4949 there, at least temporarily. */
4952 {
4955 }
4956 }
4960 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4961 the address, since &(*a)->b is a form of addition. If it's a constant, the
4962 address is constant too. If it's a decl, its address is constant if the
4963 decl is static. Everything else is not constant and, furthermore,
4964 taking the address of a volatile variable is not volatile. */
4969 ;
4972 else
4973 {
4976 }
4981 #undef UPDATE_FLAGS
4982 }
4984 /* Build an expression of code CODE, data type TYPE, and operands as
4985 specified. Expressions and reference nodes can be created this way.
4986 Constants, decls, types and misc nodes cannot be.
4988 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4989 enough for all extant tree codes. */
4991 tree
4993 {
4994 tree t;
5002 }
5004 tree
5006 {
5008 tree t;
5024 {
5027 }
5030 {
5033 }
5035 {
5037 /* All of these have side-effects, no matter what their
5038 operands are. */
5044 /* Whether a dereference is readonly has nothing to do with whether
5045 its operand is readonly. */
5063 }
5066 }
5068 #define PROCESS_ARG(N) \
5069 do { \
5070 TREE_OPERAND (t, N) = arg##N; \
5071 if (arg##N &&!TYPE_P (arg##N)) \
5072 { \
5073 if (TREE_SIDE_EFFECTS (arg##N)) \
5074 side_effects = 1; \
5075 if (!TREE_READONLY (arg##N) \
5076 && !CONSTANT_CLASS_P (arg##N)) \
5077 (void) (read_only = 0); \
5078 if (!TREE_CONSTANT (arg##N)) \
5079 (void) (constant = 0); \
5080 } \
5081 } while (0)
5083 tree
5085 {
5087 tree t;
5093 /* When sizetype precision doesn't match that of pointers
5094 we need to be able to build explicit extensions or truncations
5095 of the offset argument. */
5107 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
5108 result based on those same flags for the arguments. But if the
5109 arguments aren't really even `tree' expressions, we shouldn't be trying
5110 to do this. */
5112 /* Expressions without side effects may be constant if their
5113 arguments are as well. */
5120 {
5134 }
5141 {
5143 {
5147 }
5148 }
5149 else
5150 {
5152 /* Don't mark X / 0 as constant. */
5157 }
5160 }
5163 tree
5165 tree arg2 MEM_STAT_DECL)
5166 {
5168 tree t;
5178 /* As a special exception, if COND_EXPR has NULL branches, we
5179 assume that it is a gimple statement and always consider
5180 it to have side effects. */
5186 else
5202 }
5204 tree
5207 {
5209 tree t;
5229 }
5231 tree
5234 {
5236 tree t;
5253 {
5255 {
5259 }
5260 }
5261 else
5267 }
5269 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
5270 on the pointer PTR. */
5272 tree
5274 {
5277 tree tem;
5278 /* For convenience allow addresses that collapse to a simple base
5279 and offset. */
5283 {
5287 {
5290 }
5291 else
5294 }
5299 }
5301 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
5303 poly_offset_int
5305 {
5307 SIGNED);
5308 }
5310 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5311 offsetted by OFFSET units. */
5313 tree
5315 {
5322 }
5324 /* Similar except don't specify the TREE_TYPE
5325 and leave the TREE_SIDE_EFFECTS as 0.
5326 It is permissible for arguments to be null,
5327 or even garbage if their values do not matter. */
5329 tree
5331 {
5332 tree t;
5349 }
5351 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5352 tree vec. */
5354 tree
5356 {
5366 }
5367 \f
5368 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5369 and data type TYPE.
5370 We do NOT enter this node in any sort of symbol table.
5372 LOC is the location of the decl.
5374 layout_decl is used to set up the decl's storage layout.
5375 Other slots are initialized to 0 or null pointers. */
5377 tree
5379 tree type MEM_STAT_DECL)
5380 {
5381 tree t;
5386 /* if (type == error_mark_node)
5387 type = integer_type_node; */
5388 /* That is not done, deliberately, so that having error_mark_node
5389 as the type can suppress useless errors in the use of this variable. */
5398 }
5400 /* Create and return a DEBUG_EXPR_DECL node of the given TYPE. */
5402 tree
5404 {
5410 }
5412 /* Builds and returns function declaration with NAME and TYPE. */
5414 tree
5416 {
5426 }
5430 /* Builds a new translation-unit decl with name NAME, queues it in the
5431 global list of translation-unit decls and returns it. */
5433 tree
5435 {
5441 }
5443 \f
5444 /* BLOCK nodes are used to represent the structure of binding contours
5445 and declarations, once those contours have been exited and their contents
5446 compiled. This information is used for outputting debugging info. */
5448 tree
5450 {
5458 }
5460 \f
5461 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5463 LOC is the location to use in tree T. */
5465 void
5467 {
5471 {
5475 }
5476 }
5478 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5479 UNKNOWN_LOCATION. */
5481 void
5483 {
5487 }
5488 \f
5489 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5490 of the various TYPE_QUAL values. */
5492 static void
5494 {
5500 }
5502 /* Returns true iff CAND and BASE have equivalent language-specific
5503 qualifiers. */
5505 bool
5507 {
5510 /* type_hash_eq currently only applies to these types. */
5515 }
5517 /* This function checks to see if TYPE matches the size one of the built-in
5518 atomic types, and returns that core atomic type. */
5520 static tree
5522 {
5523 tree base_atomic_type;
5525 /* Only handle complete types. */
5530 {
5553 }
5556 }
5558 /* Returns true iff unqualified CAND and BASE are equivalent. */
5560 bool
5562 {
5564 /* Apparently this is needed for Objective-C. */
5569 /* Check alignment. */
5573 /* Atomic types increase minimal alignment. We must to do so as well
5574 or we get duplicated canonical types. See PR88686. */
5576 {
5577 /* See if this object can map to a basic atomic type. */
5581 }
5583 }
5585 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5587 bool
5589 {
5593 }
5595 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5597 static bool
5599 {
5602 /* Apparently this is needed for Objective-C. */
5604 /* Check alignment. */
5606 /* Check this is a user-aligned type as build_aligned_type
5607 would create. */
5612 }
5614 /* Return a version of the TYPE, qualified as indicated by the
5615 TYPE_QUALS, if one exists. If no qualified version exists yet,
5616 return NULL_TREE. */
5618 tree
5620 {
5628 /* Search the chain of variants to see if there is already one there just
5629 like the one we need to have. If so, use that existing one. We must
5630 preserve the TYPE_NAME, since there is code that depends on this. */
5633 {
5634 /* Put the found variant at the head of the variant list so
5635 frequently searched variants get found faster. The C++ FE
5636 benefits greatly from this. */
5642 }
5645 }
5647 /* Like get_qualified_type, but creates the type if it does not
5648 exist. This function never returns NULL_TREE. */
5650 tree
5652 {
5653 tree t;
5655 /* See if we already have the appropriate qualified variant. */
5658 /* If not, build it. */
5660 {
5665 {
5666 /* See if this object can map to a basic atomic type. */
5669 {
5670 /* Ensure the alignment of this type is compatible with
5671 the required alignment of the atomic type. */
5674 }
5675 }
5678 /* Propagate structural equality. */
5681 /* Build the underlying canonical type, since it is different
5682 from TYPE. */
5683 {
5686 }
5687 else
5688 /* T is its own canonical type. */
5691 }
5694 }
5696 /* Create a variant of type T with alignment ALIGN. */
5698 tree
5700 {
5701 tree t;
5716 }
5718 /* Create a new distinct copy of TYPE. The new type is made its own
5719 MAIN_VARIANT. If TYPE requires structural equality checks, the
5720 resulting type requires structural equality checks; otherwise, its
5721 TYPE_CANONICAL points to itself. */
5723 tree
5725 {
5731 /* Set the canonical type either to a new equivalence class, or
5732 propagate the need for structural equality checks. */
5735 else
5738 /* Make it its own variant. */
5742 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5743 whose TREE_TYPE is not t. This can also happen in the Ada
5744 frontend when using subtypes. */
5747 }
5749 /* Create a new variant of TYPE, equivalent but distinct. This is so
5750 the caller can modify it. TYPE_CANONICAL for the return type will
5751 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5752 are considered equal by the language itself (or that both types
5753 require structural equality checks). */
5755 tree
5757 {
5762 /* Since we're building a variant, assume that it is a non-semantic
5763 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5765 /* Type variants have no alias set defined. */
5768 /* Add the new type to the chain of variants of TYPE. */
5774 }
5775 \f
5776 /* Return true if the from tree in both tree maps are equal. */
5778 int
5780 {
5784 }
5786 /* Hash a from tree in a tree_base_map. */
5788 unsigned int
5790 {
5792 }
5794 /* Return true if this tree map structure is marked for garbage collection
5795 purposes. We simply return true if the from tree is marked, so that this
5796 structure goes away when the from tree goes away. */
5798 bool
5800 {
5802 }
5804 /* Hash a from tree in a tree_map. */
5806 unsigned int
5808 {
5810 }
5812 /* Hash a from tree in a tree_decl_map. */
5814 unsigned int
5816 {
5818 }
5820 /* Return the initialization priority for DECL. */
5822 priority_type
5824 {
5829 return
5831 }
5833 /* Return the finalization priority for DECL. */
5835 priority_type
5837 {
5842 return
5844 }
5846 /* Set the initialization priority for DECL to PRIORITY. */
5848 void
5850 {
5854 {
5858 }
5861 else
5864 }
5866 /* Set the finalization priority for DECL to PRIORITY. */
5868 void
5870 {
5874 {
5878 }
5879 else
5882 }
5884 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5886 static void
5888 {
5893 }
5895 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5897 static void
5899 {
5904 }
5906 /* Lookup a debug expression for FROM, and return it if we find one. */
5908 tree
5910 {
5918 }
5920 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5922 void
5924 {
5931 }
5933 /* Lookup a value expression for FROM, and return it if we find one. */
5935 tree
5937 {
5945 }
5947 /* Insert a mapping FROM->TO in the value expression hashtable. */
5949 void
5951 {
5954 /* Uses of FROM shouldn't look like they happen at the location of TO. */
5961 }
5963 /* Lookup a vector of debug arguments for FROM, and return it if we
5964 find one. */
5968 {
5979 }
5981 /* Insert a mapping FROM->empty vector of debug arguments in the value
5982 expression hashtable. */
5986 {
6001 }
6003 /* Hashing of types so that we don't make duplicates.
6004 The entry point is `type_hash_canon'. */
6006 /* Generate the default hash code for TYPE. This is designed for
6007 speed, rather than maximum entropy. */
6009 hashval_t
6011 {
6020 /* Just the identifier is adequate to distinguish. */
6024 {
6027 /* FALLTHROUGH. */
6039 {
6043 {
6046 }
6047 }
6051 {
6058 }
6061 {
6067 }
6071 {
6075 }
6083 }
6086 }
6088 /* These are the Hashtable callback functions. */
6090 /* Returns true iff the types are equivalent. */
6092 bool
6094 {
6095 /* First test the things that are the same for all types. */
6105 /* Be careful about comparing arrays before and after the element type
6106 has been completed; don't compare TYPE_ALIGN unless both types are
6107 complete. */
6114 {
6137 /* fall through */
6174 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6175 where the flag should be inherited from the element type
6176 and can change after ARRAY_TYPEs are created; on non-aggregates
6177 compare it and hash it, scalars will never have that flag set
6178 and we need to differentiate between arrays created by different
6179 front-ends or middle-end created arrays. */
6211 }
6217 }
6219 /* Given TYPE, and HASHCODE its hash code, return the canonical
6220 object for an identical type if one already exists.
6221 Otherwise, return TYPE, and record it as the canonical object.
6223 To use this function, first create a type of the sort you want.
6224 Then compute its hash code from the fields of the type that
6225 make it different from other similar types.
6226 Then call this function and use the value. */
6228 tree
6230 {
6231 type_hash in;
6234 /* The hash table only contains main variants, so ensure that's what we're
6235 being passed. */
6238 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6239 must call that routine before comparing TYPE_ALIGNs. */
6247 {
6253 /* Free also min/max values and the cache for integer
6254 types. This can't be done in free_node, as LTO frees
6255 those on its own. */
6257 {
6260 {
6261 /* Zero is always in TYPE_CACHED_VALUES. */
6265 }
6268 {
6271 }
6274 }
6277 }
6278 else
6279 {
6288 }
6289 }
6291 static void
6293 {
6298 }
6300 /* Given two lists of types
6301 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6302 return 1 if the lists contain the same types in the same order.
6303 Also, the TREE_PURPOSEs must match. */
6305 bool
6307 {
6319 }
6321 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6322 given by TYPE. If the argument list accepts variable arguments,
6323 then this function counts only the ordinary arguments. */
6325 int
6327 {
6331 /* If the function does not take a variable number of arguments,
6332 the last element in the list will have type `void'. */
6335 else
6339 }
6341 /* Return the type of the function TYPE's argument ARGNO if known.
6342 For vararg function's where ARGNO refers to one of the variadic
6343 arguments return null. Otherwise, return a void_type_node for
6344 out-of-bounds ARGNO. */
6346 tree
6348 {
6349 /* Treat zero the same as an out-of-bounds argument number. */
6353 function_args_iterator iter;
6355 tree argtype;
6358 {
6359 /* A vararg function's argument list ends in a null. Otherwise,
6360 an ordinary function's argument list ends with void. Return
6361 null if ARGNO refers to a vararg argument, void_type_node if
6362 it's out of bounds, and the formal argument type otherwise. */
6370 }
6373 }
6375 /* True if integer constants T1 and T2
6376 represent the same constant value. */
6378 bool
6380 {
6396 }
6398 /* Return true if T is an INTEGER_CST whose numerical value (extended
6399 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6401 bool
6403 {
6407 }
6409 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6410 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6412 bool
6414 {
6418 {
6423 }
6426 }
6428 /* Return true if T is an INTEGER_CST whose numerical value (extended
6429 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6431 bool
6433 {
6437 }
6439 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6440 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6442 bool
6444 {
6448 {
6453 }
6456 }
6458 /* T is an INTEGER_CST whose numerical value (extended according to
6459 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6460 HOST_WIDE_INT. */
6462 HOST_WIDE_INT
6464 {
6467 }
6469 /* T is an INTEGER_CST whose numerical value (extended according to
6470 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6471 HOST_WIDE_INT. */
6473 unsigned HOST_WIDE_INT
6475 {
6478 }
6480 /* Return the most significant (sign) bit of T. */
6482 int
6484 {
6488 }
6490 /* Return an indication of the sign of the integer constant T.
6491 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6492 Note that -1 will never be returned if T's type is unsigned. */
6494 int
6496 {
6503 else
6505 }
6507 /* Return the minimum number of bits needed to represent VALUE in a
6508 signed or unsigned type, UNSIGNEDP says which. */
6510 unsigned int
6512 {
6513 /* If the value is negative, compute its negative minus 1. The latter
6514 adjustment is because the absolute value of the largest negative value
6515 is one larger than the largest positive value. This is equivalent to
6516 a bit-wise negation, so use that operation instead. */
6521 /* Return the number of bits needed, taking into account the fact
6522 that we need one more bit for a signed than unsigned type.
6523 If value is 0 or -1, the minimum precision is 1 no matter
6524 whether unsignedp is true or false. */
6528 else
6530 }
6532 /* Return truthvalue of whether T1 is the same tree structure as T2.
6533 Return 1 if they are the same.
6534 Return 0 if they are understandably different.
6535 Return -1 if either contains tree structure not understood by
6536 this function. */
6538 int
6540 {
6550 /* For location wrappers to be the same, they must be at the same
6551 source location (and wrap the same thing). */
6553 {
6557 }
6563 {
6567 else
6569 }
6579 {
6595 {
6604 /* ??? Should we handle also fields here? */
6608 }
6619 {
6627 {
6631 }
6633 }
6636 /* Special case: if either target is an unallocated VAR_DECL,
6637 it means that it's going to be unified with whatever the
6638 TARGET_EXPR is really supposed to initialize, so treat it
6639 as being equivalent to anything. */
6647 else
6676 /* A false return means maybe_ne rather than known_ne. */
6682 }
6684 /* This general rule works for most tree codes. All exceptions should be
6685 handled above. If this is a language-specific tree code, we can't
6686 trust what might be in the operand, so say we don't know
6687 the situation. */
6692 {
6701 {
6705 }
6711 }
6712 }
6714 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6715 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6716 than U, respectively. */
6718 int
6720 {
6729 else
6731 }
6733 /* Return true if SIZE represents a constant size that is in bounds of
6734 what the middle-end and the backend accepts (covering not more than
6735 half of the address-space).
6736 When PERR is non-null, set *PERR on failure to the description of
6737 why SIZE is not valid. */
6739 bool
6741 {
6743 {
6750 }
6752 cst_size_error error;
6757 {
6760 }
6763 {
6766 }
6769 {
6772 }
6776 {
6779 }
6782 }
6784 /* Return the precision of the type, or for a complex or vector type the
6785 precision of the type of its elements. */
6787 unsigned int
6789 {
6797 }
6799 /* Return true if CODE represents an associative tree code. Otherwise
6800 return false. */
6801 bool
6803 {
6805 {
6817 }
6819 }
6821 /* Return true if CODE represents a commutative tree code. Otherwise
6822 return false. */
6823 bool
6825 {
6827 {
6854 }
6856 }
6858 /* Return true if CODE represents a ternary tree code for which the
6859 first two operands are commutative. Otherwise return false. */
6860 bool
6862 {
6864 {
6872 }
6874 }
6876 /* Returns true if CODE can overflow. */
6878 bool
6880 {
6882 {
6887 /* Can overflow in various ways. */
6893 /* For INT_MIN / -1. */
6897 /* For -INT_MIN. */
6900 /* These operators cannot overflow. */
6902 }
6903 }
6905 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6906 ftrapv doesn't generate trapping insns for CODE. */
6908 bool
6910 {
6913 /* We don't generate instructions that trap on overflow for complex or vector
6914 types. */
6922 {
6928 /* These operators can overflow, and -ftrapv generates trapping code for
6929 these. */
6936 /* These operators can overflow, but -ftrapv does not generate trapping
6937 code for these. */
6940 /* These operators cannot overflow. */
6942 }
6943 }
6945 /* Constructors for pointer, array and function types.
6946 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6947 constructed by language-dependent code, not here.) */
6949 /* Construct, lay out and return the type of pointers to TO_TYPE with
6950 mode MODE. If MODE is VOIDmode, a pointer mode for the address
6951 space of TO_TYPE will be picked. If CAN_ALIAS_ALL is TRUE,
6952 indicate this type can reference all of memory. If such a type has
6953 already been constructed, reuse it. */
6955 tree
6958 {
6959 tree t;
6966 {
6969 }
6971 /* If the pointed-to type has the may_alias attribute set, force
6972 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6976 /* In some cases, languages will have things that aren't a POINTER_TYPE
6977 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6978 In that case, return that type without regard to the rest of our
6979 operands.
6981 ??? This is a kludge, but consistent with the way this function has
6982 always operated and there doesn't seem to be a good way to avoid this
6983 at the moment. */
6988 /* First, if we already have a type for pointers to TO_TYPE and it's
6989 the proper mode, use it. */
7002 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7010 /* Lay out the type. This function has many callers that are concerned
7011 with expression-construction, and this simplifies them all. */
7015 }
7017 /* By default build pointers in ptr_mode. */
7019 tree
7021 {
7023 }
7025 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7027 tree
7030 {
7031 tree t;
7038 {
7041 }
7043 /* If the pointed-to type has the may_alias attribute set, force
7044 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7048 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7049 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7050 In that case, return that type without regard to the rest of our
7051 operands.
7053 ??? This is a kludge, but consistent with the way this function has
7054 always operated and there doesn't seem to be a good way to avoid this
7055 at the moment. */
7060 /* First, if we already have a type for pointers to TO_TYPE and it's
7061 the proper mode, use it. */
7074 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7085 }
7088 /* Build the node for the type of references-to-TO_TYPE by default
7089 in ptr_mode. */
7091 tree
7093 {
7095 }
7097 #define MAX_INT_CACHED_PREC \
7098 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7101 static void
7103 {
7105 {
7107 }
7108 }
7110 /* Builds a signed or unsigned integer type of precision PRECISION.
7111 Used for C bitfields whose precision does not match that of
7112 built-in target types. */
7113 tree
7116 {
7123 {
7127 }
7134 else
7144 }
7146 #define MAX_BOOL_CACHED_PREC \
7147 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7150 /* Builds a boolean type of precision PRECISION.
7151 Used for boolean vectors to choose proper vector element size. */
7152 tree
7154 {
7155 tree type;
7158 {
7162 }
7172 }
7176 /* Builds a signed or unsigned _BitInt(PRECISION) type. */
7177 tree
7179 {
7191 {
7195 }
7202 else
7212 }
7214 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7215 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7216 is true, reuse such a type that has already been constructed. */
7218 static tree
7220 {
7243 {
7244 /* Since we cannot reliably merge this type, we need to compare it using
7245 structural equality checks. */
7248 }
7254 }
7256 /* Wrapper around build_range_type_1 with SHARED set to true. */
7258 tree
7260 {
7262 }
7264 /* Wrapper around build_range_type_1 with SHARED set to false. */
7266 tree
7268 {
7270 }
7272 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7273 MAXVAL should be the maximum value in the domain
7274 (one less than the length of the array).
7276 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7277 We don't enforce this limit, that is up to caller (e.g. language front end).
7278 The limit exists because the result is a signed type and we don't handle
7279 sizes that use more than one HOST_WIDE_INT. */
7281 tree
7283 {
7285 }
7287 /* Return true if the debug information for TYPE, a subtype, should be emitted
7288 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7289 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7290 debug info and doesn't reflect the source code. */
7292 bool
7294 {
7297 /* Subrange types have a base type which is an integral type. */
7301 /* Get the real bounds of the subtype. */
7304 else
7305 {
7308 }
7310 /* If the type and its base type have the same representation and the same
7311 name, then the type is not a subrange but a copy of the base type. */
7325 }
7327 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7328 and number of elements specified by the range of values of INDEX_TYPE.
7329 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7330 If SHARED is true, reuse such a type that has already been constructed.
7331 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
7333 tree
7336 {
7337 tree t;
7340 {
7343 }
7353 {
7356 }
7359 {
7368 index_type
7371 }
7374 }
7376 /* Wrapper around build_array_type_1 with SHARED set to true. */
7378 tree
7380 {
7381 return
7383 }
7385 /* Wrapper around build_array_type_1 with SHARED set to false. */
7387 tree
7389 {
7391 }
7393 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7394 sizetype. */
7396 tree
7398 {
7400 }
7402 /* Computes the canonical argument types from the argument type list
7403 ARGTYPES.
7405 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7406 on entry to this function, or if any of the ARGTYPES are
7407 structural.
7409 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7410 true on entry to this function, or if any of the ARGTYPES are
7411 non-canonical.
7413 Returns a canonical argument list, which may be ARGTYPES when the
7414 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7415 true) or would not differ from ARGTYPES. */
7417 static tree
7421 {
7422 tree arg;
7426 {
7428 /* Fail gracefully by stating that the type is structural. */
7434 /* If the argument has a default argument, we consider it
7435 non-canonical even though the type itself is canonical.
7436 That way, different variants of function and method types
7437 with default arguments will all point to the variant with
7438 no defaults as their canonical type. */
7440 }
7446 {
7447 /* Build the canonical list of argument types. */
7452 {
7455 else
7458 canon_argtypes);
7459 }
7465 /* There is a non-canonical type. */
7468 }
7470 /* The canonical argument types are the same as ARGTYPES. */
7472 }
7474 /* Construct, lay out and return
7475 the type of functions returning type VALUE_TYPE
7476 given arguments of types ARG_TYPES.
7477 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7478 are data type nodes for the arguments of the function.
7479 NO_NAMED_ARGS_STDARG_P is true if this is a prototyped
7480 variable-arguments function with (...) prototype (no named arguments).
7481 If such a type has already been constructed, reuse it. */
7483 tree
7486 {
7487 tree t;
7490 tree canon_argtypes;
7495 {
7498 }
7500 /* Make a node of the sort we want. */
7505 {
7508 }
7510 /* If we already have such a type, use the old one. */
7514 /* Set up the canonical type. */
7524 canon_argtypes);
7529 }
7531 /* Build a function type. The RETURN_TYPE is the type returned by the
7532 function. If VAARGS is set, no void_type_node is appended to the
7533 list. ARGP must be always be terminated be a NULL_TREE. */
7535 static tree
7537 {
7545 {
7550 }
7553 else
7554 {
7558 }
7562 }
7564 /* Build a function type. The RETURN_TYPE is the type returned by the
7565 function. If additional arguments are provided, they are
7566 additional argument types. The list of argument types must always
7567 be terminated by NULL_TREE. */
7569 tree
7571 {
7572 tree args;
7579 }
7581 /* Build a variable argument function type. The RETURN_TYPE is the
7582 type returned by the function. If additional arguments are provided,
7583 they are additional argument types. The list of argument types must
7584 always be terminated by NULL_TREE. */
7586 tree
7588 {
7589 tree args;
7597 }
7599 /* Build a function type. RETURN_TYPE is the type returned by the
7600 function; VAARGS indicates whether the function takes varargs. The
7601 function takes N named arguments, the types of which are provided in
7602 ARG_TYPES. */
7604 static tree
7607 {
7615 }
7617 /* Build a function type. RETURN_TYPE is the type returned by the
7618 function. The function takes N named arguments, the types of which
7619 are provided in ARG_TYPES. */
7621 tree
7623 {
7625 }
7627 /* Build a variable argument function type. RETURN_TYPE is the type
7628 returned by the function. The function takes N named arguments, the
7629 types of which are provided in ARG_TYPES. */
7631 tree
7633 {
7635 }
7637 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7638 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7639 for the method. An implicit additional parameter (of type
7640 pointer-to-BASETYPE) is added to the ARGTYPES. */
7642 tree
7644 tree rettype,
7645 tree argtypes)
7646 {
7647 tree t;
7648 tree ptype;
7650 tree canon_argtypes;
7652 /* Make a node of the sort we want. */
7659 /* The actual arglist for this function includes a "hidden" argument
7660 which is "this". Put it into the list of argument types. */
7664 /* If we already have such a type, use the old one. */
7668 /* Set up the canonical type. */
7669 any_structural_p
7672 any_noncanonical_p
7684 canon_argtypes);
7689 }
7691 /* Construct, lay out and return the type of methods belonging to class
7692 BASETYPE and whose arguments and values are described by TYPE.
7693 If that type exists already, reuse it.
7694 TYPE must be a FUNCTION_TYPE node. */
7696 tree
7698 {
7704 }
7706 /* Construct, lay out and return the type of offsets to a value
7707 of type TYPE, within an object of type BASETYPE.
7708 If a suitable offset type exists already, reuse it. */
7710 tree
7712 {
7713 tree t;
7715 /* Make a node of the sort we want. */
7721 /* If we already have such a type, use the old one. */
7729 {
7738 }
7741 }
7743 /* Create a complex type whose components are COMPONENT_TYPE.
7745 If NAMED is true, the type is given a TYPE_NAME. We do not always
7746 do so because this creates a DECL node and thus make the DECL_UIDs
7747 dependent on the type canonicalization hashtable, which is GC-ed,
7748 so the DECL_UIDs would not be stable wrt garbage collection. */
7750 tree
7752 {
7757 /* Make a node of the sort we want. */
7762 /* If we already have such a type, use the old one. */
7767 {
7768 /* We created a new type. The hash insertion will have laid
7769 out the type. We need to check the canonicalization and
7770 maybe set the name. */
7781 /* We need to create a name, since complex is a fundamental type. */
7783 {
7812 }
7813 }
7816 }
7818 /* If TYPE is a real or complex floating-point type and the target
7819 does not directly support arithmetic on TYPE then return the wider
7820 type to be used for arithmetic on TYPE. Otherwise, return
7821 NULL_TREE. */
7823 tree
7825 {
7826 /* The target can give two different responses to the question of
7827 which excess precision mode it would like depending on whether we
7828 are in -fexcess-precision=standard or -fexcess-precision=fast. */
7830 enum excess_precision_type requested_type
7832 ? EXCESS_PRECISION_TYPE_FAST
7836 enum flt_eval_method target_flt_eval_method
7839 /* The target should not ask for unpredictable float evaluation (though
7840 it might advertise that implicitly the evaluation is unpredictable,
7841 but we don't care about that here, it will have been reported
7842 elsewhere). If it does ask for unpredictable evaluation, we have
7843 nothing to do here. */
7846 /* Nothing to do. The target has asked for all types we know about
7847 to be computed with their native precision and range. */
7851 /* The target will promote this type in a target-dependent way, so excess
7852 precision ought to leave it alone. */
7856 machine_mode float16_type_mode = (float16_type_node
7859 machine_mode bfloat16_type_mode = (bfloat16_type_node
7866 {
7868 {
7871 {
7892 }
7894 }
7896 {
7901 {
7922 }
7924 }
7927 }
7930 }
7931 \f
7932 /* Return OP, stripped of any conversions to wider types as much as is safe.
7933 Converting the value back to OP's type makes a value equivalent to OP.
7935 If FOR_TYPE is nonzero, we return a value which, if converted to
7936 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7938 OP must have integer, real or enumeral type. Pointers are not allowed!
7940 There are some cases where the obvious value we could return
7941 would regenerate to OP if converted to OP's type,
7942 but would not extend like OP to wider types.
7943 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7944 For example, if OP is (unsigned short)(signed char)-1,
7945 we avoid returning (signed char)-1 if FOR_TYPE is int,
7946 even though extending that to an unsigned short would regenerate OP,
7947 since the result of extending (signed char)-1 to (int)
7948 is different from (int) OP. */
7950 tree
7952 {
7953 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7955 unsigned final_prec
7957 int uns
7964 {
7967 /* TYPE_PRECISION on vector types has different meaning
7968 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7969 so avoid them here. */
7976 /* Truncations are many-one so cannot be removed.
7977 Unless we are later going to truncate down even farther. */
7982 /* See what's inside this conversion. If we decide to strip it,
7983 we will set WIN. */
7986 /* If we have not stripped any zero-extensions (uns is 0),
7987 we can strip any kind of extension.
7988 If we have previously stripped a zero-extension,
7989 only zero-extensions can safely be stripped.
7990 Any extension can be stripped if the bits it would produce
7991 are all going to be discarded later by truncating to FOR_TYPE. */
7994 {
7997 /* TYPE_UNSIGNED says whether this is a zero-extension.
7998 Let's avoid computing it if it does not affect WIN
7999 and if UNS will not be needed again. */
8003 {
8006 }
8007 }
8008 }
8010 /* If we finally reach a constant see if it fits in sth smaller and
8011 in that case convert it. */
8013 {
8019 {
8023 }
8024 }
8027 }
8028 \f
8029 /* Return OP or a simpler expression for a narrower value
8030 which can be sign-extended or zero-extended to give back OP.
8031 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8032 or 0 if the value should be sign-extended. */
8034 tree
8036 {
8043 {
8044 do
8058 ret);
8060 }
8062 {
8063 int bitschange
8067 /* Truncations are many-one so cannot be removed. */
8071 /* See what's inside this conversion. If we decide to strip it,
8072 we will set WIN. */
8075 {
8077 /* An extension: the outermost one can be stripped,
8078 but remember whether it is zero or sign extension. */
8081 /* Otherwise, if a sign extension has been stripped,
8082 only sign extensions can now be stripped;
8083 if a zero extension has been stripped, only zero-extensions. */
8087 }
8089 {
8090 /* A change in nominal type can always be stripped, but we must
8091 preserve the unsignedness. */
8096 /* Keep trying to narrow, but don't assign op to win if it
8097 would turn an integral type into something else. */
8100 }
8103 }
8106 /* Since type_for_size always gives an integer type. */
8109 /* Ensure field is laid out already. */
8112 {
8113 unsigned HOST_WIDE_INT innerprec
8119 /* We can get this structure field in a narrower type that fits it,
8120 but the resulting extension to its nominal type (a fullword type)
8121 must satisfy the same conditions as for other extensions.
8123 Do this only for fields that are aligned (not bit-fields),
8124 because when bit-field insns will be used there is no
8125 advantage in doing this. */
8131 {
8135 }
8136 }
8140 }
8141 \f
8142 /* Return true if integer constant C has a value that is permissible
8143 for TYPE, an integral type. */
8145 bool
8147 {
8152 /* Non-standard boolean types can have arbitrary precision but various
8153 transformations assume that they can only take values 0 and +/-1. */
8157 retry:
8161 /* If at least one bound of the type is a constant integer, we can check
8162 ourselves and maybe make a decision. If no such decision is possible, but
8163 this type is a subtype, try checking against that. Otherwise, use
8164 fits_to_tree_p, which checks against the precision.
8166 Compute the status for each possibly constant bound, and return if we see
8167 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8168 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8169 for "constant known to fit". */
8171 /* Check if c >= type_low_bound. */
8173 {
8177 }
8178 else
8181 /* Check if c <= type_high_bound. */
8183 {
8187 }
8188 else
8191 /* If the constant fits both bounds, the result is known. */
8195 /* Perform some generic filtering which may allow making a decision
8196 even if the bounds are not constant. First, negative integers
8197 never fit in unsigned types, */
8201 /* Second, narrower types always fit in wider ones. */
8205 /* Third, unsigned integers with top bit set never fit signed types. */
8207 {
8210 {
8211 /* When a tree_cst is converted to a wide-int, the precision
8212 is taken from the type. However, if the precision of the
8213 mode underneath the type is smaller than that, it is
8214 possible that the value will not fit. The test below
8215 fails if any bit is set between the sign bit of the
8216 underlying mode and the top bit of the type. */
8219 }
8222 }
8224 /* If we haven't been able to decide at this point, there nothing more we
8225 can check ourselves here. Look at the base type if we have one and it
8226 has the same precision. */
8230 {
8233 }
8235 /* Or to fits_to_tree_p, if nothing else. */
8237 }
8239 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8240 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8241 represented (assuming two's-complement arithmetic) within the bit
8242 precision of the type are returned instead. */
8244 void
8246 {
8250 else
8251 {
8254 else
8255 {
8258 }
8259 }
8264 else
8265 {
8268 }
8269 }
8271 /* Return true if VAR is an automatic variable. */
8273 bool
8275 {
8280 }
8282 /* Return true if VAR is an automatic variable defined in function FN. */
8284 bool
8286 {
8290 }
8292 /* Subprogram of following function. Called by walk_tree.
8294 Return *TP if it is an automatic variable or parameter of the
8295 function passed in as DATA. */
8297 static tree
8299 {
8310 }
8312 /* Returns true if T is, contains, or refers to a type with variable
8313 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8314 arguments, but not the return type. If FN is nonzero, only return
8315 true if a modifier of the type or position of FN is a variable or
8316 parameter inside FN.
8318 This concept is more general than that of C99 'variably modified types':
8319 in C99, a struct type is never variably modified because a VLA may not
8320 appear as a structure member. However, in GNU C code like:
8322 struct S { int i[f()]; };
8324 is valid, and other languages may define similar constructs. */
8326 bool
8328 {
8329 tree t;
8331 /* Test if T is either variable (if FN is zero) or an expression containing
8332 a variable in FN. If TYPE isn't gimplified, return true also if
8333 gimplify_one_sizepos would gimplify the expression into a local
8334 variable. */
8335 #define RETURN_TRUE_IF_VAR(T) \
8336 do { tree _t = (T); \
8337 if (_t != NULL_TREE \
8338 && _t != error_mark_node \
8339 && !CONSTANT_CLASS_P (_t) \
8340 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8341 && (!fn \
8342 || (!TYPE_SIZES_GIMPLIFIED (type) \
8343 && (TREE_CODE (_t) != VAR_DECL \
8344 && !CONTAINS_PLACEHOLDER_P (_t))) \
8345 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8346 return true; } while (0)
8351 /* If TYPE itself has variable size, it is variably modified. */
8356 {
8360 /* Ada can have pointer types refering to themselves indirectly. */
8365 {
8368 }
8374 /* If TYPE is a function type, it is variably modified if the
8375 return type is variably modified. */
8385 /* Scalar types are variably modified if their end points
8386 aren't constant. */
8394 /* We can't see if any of the fields are variably-modified by the
8395 definition we normally use, since that would produce infinite
8396 recursion via pointers. */
8397 /* This is variably modified if some field's type is. */
8400 {
8405 /* If the type is a qualified union, then the DECL_QUALIFIER
8406 of fields can also be an expression containing a variable. */
8410 /* If the field is a qualified union, then it's only a container
8411 for what's inside so we look into it. That's necessary in LTO
8412 mode because the sizes of the field tested above have been set
8413 to PLACEHOLDER_EXPRs by free_lang_data. */
8417 }
8421 /* Do not call ourselves to avoid infinite recursion. This is
8422 variably modified if the element type is. */
8429 }
8431 /* The current language may have other cases to check, but in general,
8432 all other types are not variably modified. */
8435 #undef RETURN_TRUE_IF_VAR
8436 }
8438 /* Given a DECL or TYPE, return the scope in which it was declared, or
8439 NULL_TREE if there is no containing scope. */
8441 tree
8443 {
8445 }
8447 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8449 const_tree
8451 {
8453 {
8456 else
8458 }
8460 }
8462 /* Return the innermost context enclosing DECL that is
8463 a FUNCTION_DECL, or zero if none. */
8465 tree
8467 {
8468 tree context;
8473 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8474 where we look up the function at runtime. Such functions always take
8475 a first argument of type 'pointer to real context'.
8477 C++ should really be fixed to use DECL_CONTEXT for the real context,
8478 and use something else for the "virtual context". */
8480 context
8481 = TYPE_MAIN_VARIANT
8483 else
8487 {
8490 else
8492 }
8495 }
8497 /* Return the innermost context enclosing DECL that is
8498 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8499 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8501 tree
8503 {
8508 {
8529 }
8532 }
8534 /* CALL is a CALL_EXPR. Return the declaration for the function
8535 called, or NULL_TREE if the called function cannot be
8536 determined. */
8538 tree
8540 {
8541 tree addr;
8546 /* It's invalid to call this function with anything but a
8547 CALL_EXPR. */
8550 /* The first operand to the CALL is the address of the function
8551 called. */
8554 /* If there is no function, return early. */
8560 /* If this is a readonly function pointer, extract its initial value. */
8566 /* If the address is just `&f' for some function `f', then we know
8567 that `f' is being called. */
8572 /* We couldn't figure out what was being called. */
8574 }
8576 /* Return true when STMTs arguments and return value match those of FNDECL,
8577 a decl of a builtin function. */
8579 static bool
8581 {
8599 {
8600 /* Variadic args follow. */
8608 {
8609 /* For pointer arguments be more forgiving, e.g. due to
8610 FILE * vs. fileptr_type_node, or say char * vs. const char *
8611 differences etc. */
8617 /* char/short integral arguments are promoted to int
8618 by several frontends if targetm.calls.promote_prototypes
8619 is true. Allow such promotion too. */
8625 && (gimple_form
8632 }
8633 }
8637 }
8639 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8640 return the associated function code, otherwise return CFN_LAST. */
8642 combined_fn
8644 {
8645 /* It's invalid to call this function with anything but a CALL_EXPR. */
8658 }
8660 /* Comparator of indices based on tree_node_counts. */
8662 static int
8664 {
8669 }
8671 /* Comparator of indices based on tree_code_counts. */
8673 static int
8675 {
8680 }
8682 #define TREE_MEM_USAGE_SPACES 40
8684 /* Print debugging information about tree nodes generated during the compile,
8685 and any language-specific information. */
8687 void
8689 {
8691 {
8697 {
8704 {
8711 }
8716 }
8718 {
8728 {
8733 }
8740 }
8741 }
8742 else
8749 }
8750 \f
8753 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8755 unsigned
8757 {
8758 /* This relies on the raw feedback's top 4 bits being zero. */
8759 #define FEEDBACK(X) ((X) * 0x04c11db7)
8760 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8761 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8763 {
8768 };
8769 #undef FEEDBACK
8770 #undef SYNDROME
8774 {
8778 }
8781 }
8783 /* Generate a crc32 of a string. */
8785 unsigned
8787 {
8788 do
8792 }
8794 /* P is a string that will be used in a symbol. Mask out any characters
8795 that are not valid in that context. */
8797 void
8799 {
8804 #endif
8807 #endif
8808 ))
8810 }
8814 /* Create a unique anonymous identifier. The identifier is still a
8815 valid assembly label. */
8817 tree
8819 {
8821 #if !defined (NO_DOT_IN_LABEL)
8822 "."
8823 #elif !defined (NO_DOLLAR_IN_LABEL)
8824 "$"
8825 #else
8826 "_"
8827 #endif
8838 }
8840 /* Generate a name for a special-purpose function.
8841 The generated name may need to be unique across the whole link.
8842 Changes to this function may also require corresponding changes to
8843 xstrdup_mask_random.
8844 TYPE is some string to identify the purpose of this function to the
8845 linker or collect2; it must start with an uppercase letter,
8846 one of:
8847 I - for constructors
8848 D - for destructors
8849 N - for C++ anonymous namespaces
8850 F - for DWARF unwind frame information. */
8852 tree
8854 {
8859 /* If we already have a name we know to be unique, just use that. */
8862 /* If the target is handling the constructors/destructors, they
8863 will be local to this file and the name is only necessary for
8864 debugging purposes.
8865 We also assign sub_I and sub_D sufixes to constructors called from
8866 the global static constructors. These are always local. */
8870 {
8874 /* Just use the file's basename, because the full pathname
8875 might be quite long. */
8877 }
8878 else
8879 {
8880 /* Otherwise, the name must be unique across the entire link.
8881 We don't have anything that we know to be unique to this translation
8882 unit, so use what we do have and throw in some randomness. */
8900 }
8906 /* Set up the name of the file-level functions we may need.
8907 Use a global object (which is already required to be unique over
8908 the program) rather than the file name (which imposes extra
8909 constraints). */
8913 }
8914 \f
8915 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8917 /* Complain that the tree code of NODE does not match the expected 0
8918 terminated list of trailing codes. The trailing code list can be
8919 empty, for a more vague error message. FILE, LINE, and FUNCTION
8920 are of the caller. */
8922 void
8925 {
8936 {
8943 {
8950 }
8952 }
8953 else
8959 }
8961 /* Complain that the tree code of NODE does match the expected 0
8962 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8963 the caller. */
8965 void
8968 {
8982 {
8984 {
8987 }
8990 }
8996 }
8998 /* Similar to tree_check_failed, except that we check for a class of tree
8999 code, given in CL. */
9001 void
9004 {
9005 internal_error
9010 }
9012 /* Similar to tree_check_failed, except that instead of specifying a
9013 dozen codes, use the knowledge that they're all sequential. */
9015 void
9019 {
9032 {
9039 }
9044 }
9047 /* Similar to tree_check_failed, except that we check that a tree does
9048 not have the specified code, given in CL. */
9050 void
9053 {
9054 internal_error
9059 }
9062 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9064 void
9067 {
9073 }
9076 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9078 void
9082 {
9095 {
9102 }
9107 }
9110 #undef DEFTREESTRUCT
9111 #define DEFTREESTRUCT(VAL, NAME) NAME,
9115 };
9116 #undef DEFTREESTRUCT
9118 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9120 /* Similar to tree_class_check_failed, except that we check for
9121 whether CODE contains the tree structure identified by EN. */
9123 void
9128 {
9129 internal_error
9133 }
9136 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9137 (dynamically sized) vector. */
9139 void
9142 {
9143 internal_error
9147 }
9149 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9150 (dynamically sized) vector. */
9152 void
9155 {
9156 internal_error
9159 }
9161 /* Similar to above, except that the check is for the bounds of the operand
9162 vector of an expression node EXP. */
9164 void
9167 {
9169 internal_error
9173 }
9175 /* Similar to above, except that the check is for the number of
9176 operands of an OMP_CLAUSE node. */
9178 void
9181 {
9182 internal_error
9187 }
9189 \f
9190 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9191 and mapped to the machine mode MODE. Initialize its fields and build
9192 the information necessary for debugging output. */
9194 static tree
9196 {
9197 tree t;
9218 /* We have built a main variant, based on the main variant of the
9219 inner type. Use it to build the variant we return. */
9227 }
9229 static tree
9231 {
9254 else
9256 }
9258 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9260 static tree
9262 {
9264 {
9276 }
9277 else
9278 {
9290 }
9293 }
9295 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9297 static tree
9299 {
9301 {
9313 }
9314 else
9315 {
9327 }
9330 }
9333 /* Create an atomic variant node for TYPE. This routine is called
9334 during initialization of data types to create the 5 basic atomic
9335 types. The generic build_variant_type function requires these to
9336 already be set up in order to function properly, so cannot be
9337 called from there. If ALIGN is non-zero, then ensure alignment is
9338 overridden to this value. */
9340 static tree
9342 {
9343 tree t;
9345 /* Make sure its not already registered. */
9356 }
9358 /* Information about the _FloatN and _FloatNx types. This must be in
9359 the same order as the corresponding TI_* enum values. */
9361 {
9369 };
9372 /* Create nodes for all integer types (and error_mark_node) using the sizes
9373 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9375 void
9377 {
9385 /* Define both `signed char' and `unsigned char'. */
9391 /* Define `char', which is like either `signed char' or `unsigned char'
9392 but not the same as either. */
9393 char_type_node
9394 = (signed_char
9409 {
9414 {
9417 }
9418 }
9420 /* Define a boolean type. This type only represents boolean values but
9421 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9427 /* Define what type to use for size_t. */
9436 else
9437 {
9443 {
9450 {
9452 }
9453 }
9456 }
9458 /* Define what type to use for ptrdiff_t. */
9467 else
9468 {
9472 {
9480 }
9483 }
9485 /* Fill in the rest of the sized types. Reuse existing type nodes
9486 when possible. */
9499 /* Don't call build_qualified type for atomics. That routine does
9500 special processing for atomics, and until they are initialized
9501 it's better not to make that call.
9503 Check to see if there is a target override for atomic types. */
9520 /* Define these next since types below may used them. */
9538 /* We are not going to have real types in C with less than byte alignment,
9539 so we might as well not have any types that claim to have it. */
9552 const_ptr_type_node
9572 {
9575 scalar_float_mode mode;
9579 /* Work around the rs6000 KFmode having precision 113 not
9580 128. */
9592 }
9594 #ifdef HAVE_BFmode
9598 {
9603 }
9604 #endif
9611 /* Fixed size integer types. */
9618 /* Decimal float types. */
9620 {
9635 }
9644 {
9648 }
9650 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9651 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9652 sat_ ## KIND ## _type_node = \
9653 make_sat_signed_ ## KIND ## _type (SIZE); \
9654 sat_unsigned_ ## KIND ## _type_node = \
9655 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9656 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9657 unsigned_ ## KIND ## _type_node = \
9658 make_unsigned_ ## KIND ## _type (SIZE);
9660 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9661 sat_ ## WIDTH ## KIND ## _type_node = \
9662 make_sat_signed_ ## KIND ## _type (SIZE); \
9663 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9664 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9665 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9666 unsigned_ ## WIDTH ## KIND ## _type_node = \
9667 make_unsigned_ ## KIND ## _type (SIZE);
9669 /* Make fixed-point type nodes based on four different widths. */
9670 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9671 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9672 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9673 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9674 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9676 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9677 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9678 NAME ## _type_node = \
9679 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9680 u ## NAME ## _type_node = \
9681 make_or_reuse_unsigned_ ## KIND ## _type \
9682 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9683 sat_ ## NAME ## _type_node = \
9684 make_or_reuse_sat_signed_ ## KIND ## _type \
9685 (GET_MODE_BITSIZE (MODE ## mode)); \
9686 sat_u ## NAME ## _type_node = \
9687 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9688 (GET_MODE_BITSIZE (U ## MODE ## mode));
9690 /* Fixed-point type and mode nodes. */
9703 {
9706 /* Many back-ends define record types without setting TYPE_NAME.
9707 If we copied the record type here, we'd keep the original
9708 record type without a name. This breaks name mangling. So,
9709 don't copy record types and let c_common_nodes_and_builtins()
9710 declare the type to be __builtin_va_list. */
9715 }
9717 /* SCEV analyzer global shared trees. */
9722 }
9724 /* Modify DECL for given flags.
9725 TM_PURE attribute is set only on types, so the function will modify
9726 DECL's type when ECF_TM_PURE is used. */
9728 void
9730 {
9760 /* Looping const or pure is implied by noreturn.
9761 There is currently no way to declare looping const or looping pure alone. */
9764 }
9767 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9769 static void
9772 {
9773 tree decl;
9780 }
9782 /* Call this function after instantiating all builtins that the language
9783 front end cares about. This will build the rest of the builtins
9784 and internal functions that are relied upon by the tree optimizers and
9785 the middle-end. */
9787 void
9789 {
9794 {
9796 ptr_type_node,
9797 ptr_type_node,
9798 integer_type_node,
9799 NULL_TREE);
9801 BUILT_IN_CLEAR_PADDING,
9804 }
9810 {
9814 BUILT_IN_UNREACHABLE,
9820 BUILT_IN_UNREACHABLE_TRAP,
9832 }
9836 {
9847 }
9850 {
9853 NULL_TREE);
9856 }
9859 {
9865 }
9867 /* If we're checking the stack, `alloca' can throw. */
9868 const int alloca_flags
9872 {
9877 }
9882 BUILT_IN_ALLOCA_WITH_ALIGN,
9884 alloca_flags);
9889 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
9891 alloca_flags);
9897 BUILT_IN_INIT_TRAMPOLINE,
9900 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9904 BUILT_IN_INIT_DESCRIPTOR,
9909 BUILT_IN_ADJUST_TRAMPOLINE,
9913 BUILT_IN_ADJUST_DESCRIPTOR,
9921 BUILT_IN_CLEAR_CACHE,
9923 ECF_NOTHROW);
9926 BUILT_IN_NONLOCAL_GOTO,
9933 BUILT_IN_SETJMP_SETUP,
9938 BUILT_IN_SETJMP_RECEIVER,
9947 BUILT_IN_STACK_RESTORE,
9952 NULL_TREE);
9965 /* If there's a possibility that we might use the ARM EABI, build the
9966 alternate __cxa_end_cleanup node used to resume from C++. */
9968 {
9971 BUILT_IN_CXA_END_CLEANUP,
9973 }
9977 BUILT_IN_UNWIND_RESUME,
9981 ECF_NORETURN);
9984 {
9986 NULL_TREE);
9988 BUILT_IN_RETURN_ADDRESS,
9990 ECF_NOTHROW);
9991 }
9995 {
10000 BUILT_IN_PROFILE_FUNC_ENTER,
10004 BUILT_IN_PROFILE_FUNC_EXIT,
10006 }
10008 /* The exception object and filter values from the runtime. The argument
10009 must be zero before exception lowering, i.e. from the front end. After
10010 exception lowering, it will be the region number for the exception
10011 landing pad. These functions are PURE instead of CONST to prevent
10012 them from being hoisted past the exception edge that will initialize
10013 its value in the landing pad. */
10017 /* Only use TM_PURE if we have TM language support. */
10030 NULL_TREE);
10032 BUILT_IN_EH_COPY_VALUES,
10035 /* Complex multiplication and division. These are handled as builtins
10036 rather than optabs because emit_library_call_value doesn't support
10037 complex. Further, we can do slightly better with folding these
10038 beasties if the real and complex parts of the arguments are separate. */
10039 {
10043 {
10070 /* For -ftrapping-math these should throw from a former
10071 -fnon-call-exception stmt. */
10073 NULL);
10079 NULL);
10083 }
10084 }
10087 }
10089 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10090 better way.
10092 If we requested a pointer to a vector, build up the pointers that
10093 we stripped off while looking for the inner type. Similarly for
10094 return values from functions.
10096 The argument TYPE is the top of the chain, and BOTTOM is the
10097 new type which we will point to. */
10099 tree
10101 {
10105 {
10109 }
10111 {
10115 }
10117 {
10120 }
10122 {
10126 }
10128 {
10130 /* The build_method_type_directly() routine prepends 'this' to argument list,
10131 so we must compensate by getting rid of it. */
10132 outer
10133 = build_method_type_directly
10135 inner,
10137 }
10139 {
10142 }
10143 else
10148 }
10150 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10151 the inner type. */
10152 tree
10154 {
10155 poly_int64 nunits;
10159 {
10171 /* Check that there are no leftover bits. */
10179 }
10182 }
10184 /* Similarly, but takes the inner type and number of units, which must be
10185 a power of two. */
10187 tree
10189 {
10191 }
10193 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10195 tree
10197 {
10202 {
10205 }
10206 else
10212 }
10214 /* Build a vector type that holds one boolean result for each element of
10215 vector type VECTYPE. The public interface for this operation is
10216 truth_type_for. */
10218 static tree
10220 {
10224 machine_mode mask_mode;
10234 }
10236 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10237 set. */
10239 tree
10241 {
10243 tree cand;
10244 /* We always build the non-opaque variant before the opaque one,
10245 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10251 /* Othewise build a variant type and make sure to queue it after
10252 the non-opaque type. */
10260 }
10262 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10264 static poly_wide_int
10266 {
10267 /* First handle elements that are directly encoded. */
10272 /* Identify the pattern that contains element I and work out the index of
10273 the last encoded element for that pattern. */
10279 /* If there are no steps, the final encoded value is the right one. */
10283 /* Otherwise work out the value from the last two encoded elements. */
10288 }
10290 /* Return the value of element I of VECTOR_CST T. */
10292 tree
10294 {
10295 /* First handle elements that are directly encoded. */
10300 /* If there are no steps, the final encoded value is the right one. */
10302 {
10303 /* Identify the pattern that contains element I and work out the index of
10304 the last encoded element for that pattern. */
10309 }
10311 /* Otherwise work out the value from the last two encoded elements. */
10314 }
10316 /* Given an initializer INIT, return TRUE if INIT is zero or some
10317 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10318 null, set *NONZERO if and only if INIT is known not to be all
10319 zeros. The combination of return value of false and *NONZERO
10320 false implies that INIT may but need not be all zeros. Other
10321 combinations indicate definitive answers. */
10323 bool
10325 {
10330 /* Conservatively clear NONZERO and set it only if INIT is definitely
10331 not all zero. */
10339 {
10348 /* ??? Note that this is not correct for C4X float formats. There,
10349 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10350 negative exponent. */
10385 {
10390 tree elt;
10397 }
10400 {
10415 }
10416 /* Fall through. */
10419 {
10427 /* We need to loop through all elements to handle cases like
10428 "\0" and "\0foobar". */
10431 {
10434 }
10437 }
10441 }
10442 }
10444 /* Return true if EXPR is an initializer expression in which every element
10445 is a constant that is numerically equal to 0 or 1. The elements do not
10446 need to be equal to each other. */
10448 bool
10450 {
10454 {
10462 {
10469 {
10473 }
10476 }
10480 }
10481 }
10483 /* Check if vector VEC consists of all the equal elements and
10484 that the number of elements corresponds to the type of VEC.
10485 The function returns first element of the vector
10486 or NULL_TREE if the vector is not uniform. */
10487 tree
10489 {
10502 {
10506 }
10510 {
10514 {
10516 {
10519 }
10522 }
10529 }
10532 }
10534 /* If the argument is INTEGER_CST, return it. If the argument is vector
10535 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
10536 return NULL_TREE.
10537 Look through location wrappers. */
10539 tree
10541 {
10548 {
10552 }
10555 }
10557 /* Checks to see if T is a constant or a constant vector and if each element E
10558 adheres to ~E + 1 == pow2 then return ~E otherwise NULL_TREE. */
10560 tree
10562 {
10572 tree cst;
10576 tree_vector_builder builder;
10579 else
10580 {
10586 }
10590 do
10591 {
10606 }
10610 }
10612 /* If VECTOR_CST T has a single nonzero element, return the index of that
10613 element, otherwise return -1. */
10615 int
10617 {
10623 {
10626 }
10627 else
10632 {
10635 {
10639 }
10640 }
10642 }
10644 /* Build an empty statement at location LOC. */
10646 tree
10648 {
10652 }
10655 /* Build an OMP clause with code CODE. LOC is the location of the
10656 clause. */
10658 tree
10660 {
10661 tree t;
10676 }
10678 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10679 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10680 Except for the CODE and operand count field, other storage for the
10681 object is initialized to zeros. */
10683 tree
10685 {
10686 tree t;
10698 /* Can't use TREE_OPERAND to store the length because if checking is
10699 enabled, it will try to check the length before we store it. :-P */
10703 }
10705 /* Helper function for build_call_* functions; build a CALL_EXPR with
10706 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10707 the argument slots. */
10709 static tree
10711 {
10712 tree t;
10720 }
10722 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10723 FN and a null static chain slot. NARGS is the number of call arguments
10724 which are specified as "..." arguments. */
10726 tree
10728 {
10729 tree ret;
10735 }
10737 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10738 FN and a null static chain slot. NARGS is the number of call arguments
10739 which are specified as a va_list ARGS. */
10741 tree
10743 {
10744 tree t;
10752 }
10754 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10755 FN and a null static chain slot. NARGS is the number of call arguments
10756 which are specified as a tree array ARGS. */
10758 tree
10761 {
10762 tree t;
10771 }
10773 /* Like build_call_array, but takes a vec. */
10775 tree
10777 {
10786 }
10788 /* Conveniently construct a function call expression. FNDECL names the
10789 function to be called and N arguments are passed in the array
10790 ARGARRAY. */
10792 tree
10794 {
10799 }
10801 /* Conveniently construct a function call expression. FNDECL names the
10802 function to be called and the arguments are passed in the vector
10803 VEC. */
10805 tree
10807 {
10810 }
10813 /* Conveniently construct a function call expression. FNDECL names the
10814 function to be called, N is the number of arguments, and the "..."
10815 parameters are the argument expressions. */
10817 tree
10819 {
10829 }
10831 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10832 varargs macros aren't supported by all bootstrap compilers. */
10834 tree
10836 {
10846 }
10848 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10849 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10850 It will get gimplified later into an ordinary internal function. */
10852 tree
10855 {
10863 }
10865 /* Build internal call expression. This is just like CALL_EXPR, except
10866 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10867 internal function. */
10869 tree
10872 {
10882 }
10884 /* Return a function call to FN, if the target is guaranteed to support it,
10885 or null otherwise.
10887 N is the number of arguments, passed in the "...", and TYPE is the
10888 type of the return value. */
10890 tree
10893 {
10903 {
10906 {
10909 OPTIMIZE_FOR_BOTH))
10911 }
10913 }
10914 else
10915 {
10920 }
10921 }
10923 /* Return a function call to the appropriate builtin alloca variant.
10925 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10926 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10927 bound for SIZE in case it is not a fixed value. */
10929 tree
10931 {
10933 {
10935 return
10937 }
10939 {
10942 }
10943 else
10944 {
10947 }
10948 }
10950 /* The built-in decl to use to mark code points believed to be unreachable.
10951 Typically __builtin_unreachable, but __builtin_trap if
10952 -fsanitize=unreachable -fsanitize-trap=unreachable. If only
10953 -fsanitize=unreachable, we rely on sanopt to replace calls with the
10954 appropriate ubsan function. When building a call directly, use
10955 {gimple_},build_builtin_unreachable instead. */
10957 tree
10959 {
10966 /* For non-trapping sanitize, we will rewrite __builtin_unreachable () later,
10967 in the sanopt pass. */
10970 }
10972 /* Build a call to __builtin_unreachable, possibly rewritten by
10973 -fsanitize=unreachable. Use this rather than the above when practical. */
10975 tree
10977 {
10981 }
10983 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
10984 if SIZE == -1) and return a tree node representing char* pointer to
10985 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
10986 the STRING_CST value is the LEN bytes at STR (the representation
10987 of the string, which may be wide). Otherwise it's all zeros. */
10989 tree
10993 {
10995 /* Set the maximum valid index based on the string length or SIZE. */
10996 unsigned HOST_WIDE_INT maxidx
11012 }
11016 /* Return true if T (assumed to be a DECL) must be assigned a memory
11017 location. */
11019 bool
11021 {
11027 }
11029 /* Return value of a constant X and sign-extend it. */
11031 HOST_WIDE_INT
11033 {
11037 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11041 {
11045 else
11047 }
11050 }
11052 /* If TYPE is an integral or pointer type, return an integer type with
11053 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11054 if TYPE is already an integer type of signedness UNSIGNEDP.
11055 If TYPE is a floating-point type, return an integer type with the same
11056 bitsize and with the signedness given by UNSIGNEDP; this is useful
11057 when doing bit-level operations on a floating-point value. */
11059 tree
11061 {
11066 {
11073 machine_mode new_mode;
11078 }
11081 {
11089 }
11098 else
11104 }
11106 /* If TYPE is an integral or pointer type, return an integer type with
11107 the same precision which is unsigned, or itself if TYPE is already an
11108 unsigned integer type. If TYPE is a floating-point type, return an
11109 unsigned integer type with the same bitsize as TYPE. */
11111 tree
11113 {
11115 }
11117 /* If TYPE is an integral or pointer type, return an integer type with
11118 the same precision which is signed, or itself if TYPE is already a
11119 signed integer type. If TYPE is a floating-point type, return a
11120 signed integer type with the same bitsize as TYPE. */
11122 tree
11124 {
11126 }
11128 /* - For VECTOR_TYPEs:
11129 - The truth type must be a VECTOR_BOOLEAN_TYPE.
11130 - The number of elements must match (known_eq).
11131 - targetm.vectorize.get_mask_mode exists, and exactly
11132 the same mode as the truth type.
11133 - Otherwise, the truth type must be a BOOLEAN_TYPE
11134 or useless_type_conversion_p to BOOLEAN_TYPE. */
11135 bool
11137 {
11140 machine_mode tmask_mode;
11143 {
11152 }
11155 }
11157 /* If TYPE is a vector type, return a signed integer vector type with the
11158 same width and number of subparts. Otherwise return boolean_type_node. */
11160 tree
11162 {
11164 {
11168 }
11169 else
11171 }
11173 /* Returns the largest value obtainable by casting something in INNER type to
11174 OUTER type. */
11176 tree
11178 {
11184 /* Compute a unique number for every combination. */
11189 /* Determine the exponent to use. */
11191 {
11194 /* oprec <= iprec, outer: signed, inner: don't care. */
11199 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11203 /* oprec > iprec, outer: signed, inner: signed. */
11207 /* oprec > iprec, outer: signed, inner: unsigned. */
11211 /* oprec > iprec, outer: unsigned, inner: signed. */
11215 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11220 }
11224 }
11226 /* Returns the smallest value obtainable by casting something in INNER type to
11227 OUTER type. */
11229 tree
11231 {
11235 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11236 and obtain 0. */
11238 /* If we are widening something of an unsigned type, OUTER type
11239 contains all values of INNER type. In particular, both INNER
11240 and OUTER types have zero in common. */
11243 else
11244 {
11245 /* If we are widening a signed type to another signed type, we
11246 want to obtain -2^^(iprec-1). If we are keeping the
11247 precision or narrowing to a signed type, we want to obtain
11248 -2^(oprec-1). */
11253 }
11254 }
11256 /* Return true if two operands that are suitable for PHI nodes are
11257 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11258 SSA_NAME or invariant. Note that this is strictly an optimization.
11259 That is, callers of this function can directly call operand_equal_p
11260 and get the same result, only slower. */
11262 bool
11264 {
11270 }
11272 /* Returns number of zeros at the end of binary representation of X. */
11274 tree
11276 {
11278 }
11281 #define WALK_SUBTREE(NODE) \
11282 do \
11283 { \
11284 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11285 if (result) \
11286 return result; \
11287 } \
11288 while (0)
11290 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11291 be walked whenever a type is seen in the tree. Rest of operands and return
11292 value are as for walk_tree. */
11294 static tree
11297 {
11301 {
11305 /* We have to worry about mutually recursive pointers. These can't
11306 be written in C. They can in Ada. It's pathological, but
11307 there's an ACATS test (c38102a) that checks it. Deal with this
11308 by checking if we're pointing to another pointer, that one
11309 points to another pointer, that one does too, and we have no htab.
11310 If so, get a hash table. We check three levels deep to avoid
11311 the cost of the hash table if we don't need one. */
11316 {
11323 }
11325 /* fall through */
11334 /* Fall through. */
11338 {
11339 tree arg;
11341 /* We never want to walk into default arguments. */
11344 }
11348 /* Don't follow this nodes's type if a pointer for fear that
11349 we'll have infinite recursion. If we have a PSET, then we
11350 need not fear. */
11365 }
11368 }
11370 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11371 called with the DATA and the address of each sub-tree. If FUNC returns a
11372 non-NULL value, the traversal is stopped, and the value returned by FUNC
11373 is returned. If PSET is non-NULL it is used to record the nodes visited,
11374 and to avoid visiting a node more than once. */
11376 tree
11379 {
11380 #define WALK_SUBTREE_TAIL(NODE) \
11381 do \
11382 { \
11383 tp = & (NODE); \
11384 goto tail_recurse; \
11385 } \
11386 while (0)
11388 tail_recurse:
11389 /* Skip empty subtrees. */
11393 /* Don't walk the same tree twice, if the user has requested
11394 that we avoid doing so. */
11398 /* Call the function. */
11402 /* If we found something, return it. */
11409 /* Even if we didn't, FUNC may have decided that there was nothing
11410 interesting below this point in the tree. */
11412 {
11413 /* But we still need to check our siblings. */
11418 else
11420 }
11423 {
11427 }
11430 {
11442 /* None of these have subtrees other than those already walked
11443 above. */
11451 {
11457 /* Walk all elements but the last. */
11461 /* Now walk the last one as a tail call. */
11463 }
11466 {
11470 /* Walk all elements but the last. */
11473 /* Now walk the last one as a tail call. */
11475 }
11482 {
11487 idx++)
11489 }
11496 {
11497 tree decl;
11499 {
11500 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11501 into declarations that are just mentioned, rather than
11502 declared; they don't really belong to this part of the tree.
11503 And, we can see cycles: the initializer for a declaration
11504 can refer to the declaration itself. */
11508 }
11510 }
11513 {
11514 tree_stmt_iterator i;
11517 }
11521 {
11526 }
11529 {
11532 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11533 But, we only want to walk once. */
11538 }
11541 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11542 defining. We only want to walk into these fields of a type in this
11543 case and not in the general case of a mere reference to the type.
11545 The criterion is as follows: if the field can be an expression, it
11546 must be walked only here. This should be in keeping with the fields
11547 that are directly gimplified in gimplify_type_sizes in order for the
11548 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11549 variable-sized types.
11551 Note that DECLs get walked as part of processing the BIND_EXPR. */
11553 {
11554 /* Call the function for the decl so e.g. copy_tree_body_r can
11555 replace it with the remapped one. */
11564 /* Call the function for the type. See if it returns anything or
11565 doesn't want us to continue. If we are to continue, walk both
11566 the normal fields and those for the declaration case. */
11573 /* But do not walk a pointed-to type since it may itself need to
11574 be walked in the declaration case if it isn't anonymous. */
11576 {
11580 }
11582 /* If this is a record type, also walk the fields. */
11584 {
11585 tree field;
11589 {
11590 /* We'd like to look at the type of the field, but we can
11591 easily get infinite recursion. So assume it's pointed
11592 to elsewhere in the tree. Also, ignore things that
11593 aren't fields. */
11602 }
11603 }
11605 /* Same for scalar types. */
11611 {
11614 }
11618 }
11619 /* FALLTHRU */
11623 {
11626 /* Walk over all the sub-trees of this operand. */
11629 /* Go through the subtrees. We need to do this in forward order so
11630 that the scope of a FOR_EXPR is handled properly. */
11632 {
11636 }
11637 }
11638 /* If this is a type, walk the needed fields in the type. */
11642 }
11644 /* We didn't find what we were looking for. */
11647 #undef WALK_SUBTREE_TAIL
11648 }
11649 #undef WALK_SUBTREE
11651 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11653 tree
11655 walk_tree_lh lh)
11656 {
11657 tree result;
11662 }
11665 tree
11667 {
11674 }
11676 void
11678 {
11682 {
11684 }
11685 else
11687 }
11689 /* Create a nameless artificial label and put it in the current
11690 function context. The label has a location of LOC. Returns the
11691 newly created label. */
11693 tree
11695 {
11703 }
11705 /* Given a tree, try to return a useful variable name that we can use
11706 to prefix a temporary that is being assigned the value of the tree.
11707 I.E. given <temp> = &A, return A. */
11711 {
11712 tree stripped_decl;
11719 {
11724 }
11725 else
11726 {
11728 {
11733 }
11734 }
11735 }
11737 /* Return true if TYPE has a variable argument list. */
11739 bool
11741 {
11742 function_args_iterator args_iter;
11752 {
11754 }
11757 }
11759 /* Return true if TYPE has a prototype. */
11761 bool
11763 {
11764 tree t;
11773 }
11775 /* If BLOCK is inlined from an __attribute__((__artificial__))
11776 routine, return pointer to location from where it has been
11777 called. */
11778 location_t *
11780 {
11785 {
11788 {
11789 /* If AO is an artificial inline, point RET to the
11790 call site locus at which it has been inlined and continue
11791 the loop, in case AO's caller is also an artificial
11792 inline. */
11796 else
11798 }
11803 }
11805 }
11808 /* If EXP is inlined from an __attribute__((__artificial__))
11809 function, return the location of the original call expression. */
11811 location_t
11813 {
11818 else
11820 }
11822 /* Return the location into which EXP has been inlined. Analogous
11823 to tree_nonartificial_location() above but not limited to artificial
11824 functions declared inline. If SYSTEM_HEADER is true, return
11825 the macro expansion point of the location if it's in a system header */
11827 location_t
11829 {
11836 {
11844 }
11847 {
11850 /* Only consider macro expansion when the block traversal failed
11851 to find a location. Otherwise it's not relevant. */
11853 }
11856 }
11858 /* These are the hash table functions for the hash table of OPTIMIZATION_NODE
11859 nodes. */
11861 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11863 hashval_t
11865 {
11872 else
11874 }
11876 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11877 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11878 same. */
11880 bool
11882 {
11895 else
11897 }
11899 /* Build an OPTIMIZATION_NODE based on the options in OPTS and OPTS_SET. */
11901 tree
11904 {
11905 tree t;
11907 /* Use the cache of optimization nodes. */
11915 {
11916 /* Insert this one into the hash table. */
11920 /* Make a new node for next time round. */
11922 }
11925 }
11927 /* Build a TARGET_OPTION_NODE based on the options in OPTS and OPTS_SET. */
11929 tree
11932 {
11933 tree t;
11935 /* Use the cache of optimization nodes. */
11943 {
11944 /* Insert this one into the hash table. */
11948 /* Make a new node for next time round. */
11950 }
11953 }
11955 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11956 so that they aren't saved during PCH writing. */
11958 void
11960 {
11965 }
11967 /* Determine the "ultimate origin" of a block. */
11969 tree
11971 {
11976 else
11977 {
11982 }
11983 }
11985 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11986 no instruction. */
11988 bool
11990 {
11991 /* Do not strip casts into or out of differing address spaces. */
11994 {
11999 }
12002 {
12003 /* We already know that outer_type is not a pointer with
12004 a non-generic address space. */
12006 }
12008 /* Use precision rather then machine mode when we can, which gives
12009 the correct answer even for submode (bit-field) types. */
12018 /* Otherwise fall back on comparing machine modes (e.g. for
12019 aggregate types, floats). */
12021 }
12023 /* Return true iff conversion in EXP generates no instruction. Mark
12024 it inline so that we fully inline into the stripping functions even
12025 though we have two uses of this function. */
12029 {
12044 }
12046 /* Return true iff conversion in EXP generates no instruction. Don't
12047 consider conversions changing the signedness. */
12049 static bool
12051 {
12062 }
12064 /* Strip conversions from EXP according to tree_nop_conversion and
12065 return the resulting expression. */
12067 tree
12069 {
12073 }
12075 /* Strip conversions from EXP according to tree_sign_nop_conversion
12076 and return the resulting expression. */
12078 tree
12080 {
12084 }
12086 /* Avoid any floating point extensions from EXP. */
12087 tree
12089 {
12092 /* For floating point constant look up the narrowest type that can hold
12093 it properly and handle it like (type)(narrowest_type)constant.
12094 This way we can optimize for instance a=a*2.0 where "a" is float
12095 but 2.0 is double constant. */
12097 {
12098 REAL_VALUE_TYPE orig;
12111 }
12130 }
12132 /* Strip out all handled components that produce invariant
12133 offsets. */
12135 const_tree
12137 {
12139 {
12141 {
12156 }
12158 }
12161 }
12163 /* Strip handled components with zero offset from OP. */
12165 tree
12167 {
12173 }
12177 /* Return the GCC personality function decl. */
12179 tree
12181 {
12185 }
12187 /* TARGET is a call target of GIMPLE call statement
12188 (obtained by gimple_call_fn). Return true if it is
12189 OBJ_TYPE_REF representing an virtual call of C++ method.
12190 (As opposed to OBJ_TYPE_REF representing objc calls
12191 through a cast where middle-end devirtualization machinery
12192 can't apply.) FOR_DUMP_P is true when being called from
12193 the dump routines. */
12195 bool
12197 {
12206 /* If we do not have BINFO associated, it means that type was built
12207 without devirtualization enabled. Do not consider this a virtual
12208 call. */
12212 }
12214 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12216 static tree
12218 {
12229 }
12231 /* Try to find a base info of BINFO that would have its field decl at offset
12232 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12233 found, return, otherwise return NULL_TREE. */
12235 tree
12237 {
12241 {
12243 tree fld;
12252 {
12260 }
12264 /* Offset 0 indicates the primary base, whose vtable contents are
12265 represented in the binfo for the derived class. */
12267 {
12269 /* Offsets in BINFO are in bytes relative to the whole structure
12270 while POS is in bits relative to the containing field. */
12277 {
12280 }
12283 else
12285 binfo_offset);
12286 }
12290 }
12291 }
12293 /* PR 84195: Replace control characters in "unescaped" with their
12294 escaped equivalents. Allow newlines if -fmessage-length has
12295 been set to a non-zero value. This is done here, rather than
12296 where the attribute is recorded as the message length can
12297 change between these two locations. */
12299 void
12301 {
12319 {
12323 {
12327 }
12330 {
12332 {
12333 /* We only allocate space for a new string if we
12334 actually encounter a control character that
12335 needs replacing. */
12339 }
12344 {
12353 }
12354 }
12357 }
12360 {
12364 }
12365 }
12367 /* Warn about a use of an identifier which was marked deprecated. Returns
12368 whether a warning was given. */
12370 bool
12372 {
12373 escaped_string msg;
12379 {
12383 {
12389 {
12392 }
12393 }
12394 }
12404 {
12405 auto_diagnostic_group d;
12409 else
12414 }
12416 {
12421 {
12427 }
12429 auto_diagnostic_group d;
12431 {
12435 else
12438 }
12439 else
12440 {
12444 else
12447 }
12451 }
12454 }
12456 /* Error out with an identifier which was marked 'unavailable'. */
12457 void
12459 {
12460 escaped_string msg;
12466 {
12470 {
12475 }
12476 }
12485 {
12486 auto_diagnostic_group d;
12489 else
12492 }
12494 {
12499 {
12505 }
12507 auto_diagnostic_group d;
12509 {
12512 else
12514 }
12515 else
12516 {
12519 else
12521 }
12525 }
12526 }
12528 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12529 somewhere in it. */
12531 bool
12533 {
12535 {
12540 }
12543 }
12545 /* Try to determine whether a TRY_CATCH expression can fall through.
12546 This is a subroutine of block_may_fallthru. */
12548 static bool
12550 {
12551 tree_stmt_iterator i;
12553 /* If the TRY block can fall through, the whole TRY_CATCH can
12554 fall through. */
12560 {
12562 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12563 catch expression and a body. The whole TRY_CATCH may fall
12564 through iff any of the catch bodies falls through. */
12566 {
12569 }
12573 /* The exception filter expression only matters if there is an
12574 exception. If the exception does not match EH_FILTER_TYPES,
12575 we will execute EH_FILTER_FAILURE, and we will fall through
12576 if that falls through. If the exception does match
12577 EH_FILTER_TYPES, the stack unwinder will continue up the
12578 stack, so we will not fall through. We don't know whether we
12579 will throw an exception which matches EH_FILTER_TYPES or not,
12580 so we just ignore EH_FILTER_TYPES and assume that we might
12581 throw an exception which doesn't match. */
12585 /* This case represents statements to be executed when an
12586 exception occurs. Those statements are implicitly followed
12587 by a RESX statement to resume execution after the exception.
12588 So in this case the TRY_CATCH never falls through. */
12590 }
12591 }
12593 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12594 need not be 100% accurate; simply be conservative and return true if we
12595 don't know. This is used only to avoid stupidly generating extra code.
12596 If we're wrong, we'll just delete the extra code later. */
12598 bool
12600 {
12601 /* This CONST_CAST is okay because expr_last returns its argument
12602 unmodified and we assign it to a const_tree. */
12606 {
12609 /* Easy cases. If the last statement of the block implies
12610 control transfer, then we can't fall through. */
12614 /* If there is a default: label or case labels cover all possible
12615 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12616 to some case label in all cases and all we care is whether the
12617 SWITCH_BODY falls through. */
12634 /* The finally clause is always executed after the try clause,
12635 so if it does not fall through, then the try-finally will not
12636 fall through. Otherwise, if the try clause does not fall
12637 through, then when the finally clause falls through it will
12638 resume execution wherever the try clause was going. So the
12639 whole try-finally will only fall through if both the try
12640 clause and the finally clause fall through. */
12650 else
12652 /* FALLTHRU */
12655 /* Functions that do not return do not fall through. */
12669 }
12670 }
12672 /* True if we are using EH to handle cleanups. */
12675 /* This routine is called from front ends to indicate eh should be used for
12676 cleanups. */
12677 void
12679 {
12681 }
12683 /* Query whether EH is used for cleanups. */
12684 bool
12686 {
12688 }
12690 /* Wrapper for tree_code_name to ensure that tree code is valid */
12693 {
12696 /* The tree_code enum promotes to signed, but we could be getting
12697 invalid values, so force an unsigned comparison. */
12699 {
12703 }
12706 }
12708 /* Drops the TREE_OVERFLOW flag from T. */
12710 tree
12712 {
12715 /* For tree codes with a sharing machinery re-build the result. */
12719 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12720 and canonicalize the result. */
12722 {
12723 tree_vector_builder builder;
12727 {
12732 }
12734 }
12736 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12737 and drop the flag. */
12741 /* For constants that contain nested constants, drop the flag
12742 from those as well. */
12744 {
12749 }
12752 }
12754 /* Given a memory reference expression T, return its base address.
12755 The base address of a memory reference expression is the main
12756 object being referenced. For instance, the base address for
12757 'array[i].fld[j]' is 'array'. You can think of this as stripping
12758 away the offset part from a memory address.
12760 This function calls handled_component_p to strip away all the inner
12761 parts of the memory reference until it reaches the base object. */
12763 tree
12765 {
12777 }
12779 /* Return a tree of sizetype representing the size, in bytes, of the element
12780 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12782 tree
12784 {
12789 /* If a size was specified in the ARRAY_REF, it's the size measured
12790 in alignment units of the element type. So multiply by that value. */
12792 {
12793 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12794 sizetype from another type of the same width and signedness. */
12799 }
12801 /* Otherwise, take the size from that of the element type. Substitute
12802 any PLACEHOLDER_EXPR that we have. */
12803 else
12805 }
12807 /* Return a tree representing the lower bound of the array mentioned in
12808 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12810 tree
12812 {
12815 /* If a lower bound is specified in EXP, use it. */
12819 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12820 substituting for a PLACEHOLDER_EXPR as needed. */
12824 /* Otherwise, return a zero of the appropriate type. */
12828 }
12830 /* Return a tree representing the upper bound of the array mentioned in
12831 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12833 tree
12835 {
12838 /* If there is a domain type and it has an upper bound, use it, substituting
12839 for a PLACEHOLDER_EXPR as needed. */
12843 /* Otherwise fail. */
12845 }
12847 /* Returns true if REF is an array reference, a component reference,
12848 or a memory reference to an array whose actual size might be larger
12849 than its upper bound implies, there are multiple cases:
12850 A. a ref to a flexible array member at the end of a structure;
12851 B. a ref to an array with a different type against the original decl;
12852 for example:
12854 short a[16] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 };
12855 (*((char(*)[16])&a[0]))[i+8]
12857 C. a ref to an array that was passed as a parameter;
12858 for example:
12860 int test (uint8_t *p, uint32_t t[1][1], int n) {
12861 for (int i = 0; i < 4; i++, p++)
12862 t[i][0] = ...;
12864 If non-null, set IS_TRAILING_ARRAY to true if the ref is the above case A.
12865 */
12867 bool
12869 {
12870 /* The TYPE for this array referece. */
12872 /* The FIELD_DECL for the array field in the containing structure. */
12874 /* Whether this array is the trailing array of a structure. */
12881 {
12884 }
12887 {
12890 }
12892 {
12898 {
12900 {
12907 }
12908 else
12910 }
12911 else
12913 }
12914 else
12922 {
12923 /* If the reference chain contains a component reference to a
12924 non-union type and there follows another field the reference
12925 is not at the end of a structure. */
12927 {
12929 {
12935 }
12936 }
12937 /* If we have a multi-dimensional array we do not consider
12938 a non-innermost dimension as flex array if the whole
12939 multi-dimensional array is at struct end.
12940 Same for an array of aggregates with a trailing array
12941 member. */
12945 ;
12946 /* If we view an underlying object as sth else then what we
12947 gathered up to now is what we have to rely on. */
12950 else
12954 }
12959 /* The array now is at struct end. Treat flexible array member as
12960 always subject to extend, even into just padding constrained by
12961 an underlying decl. */
12965 {
12968 }
12970 /* If the reference is based on a declared entity, the size of the array
12971 is constrained by its given domain. (Do not trust commons PR/69368). */
12975 && !(flag_unconstrained_commons
12979 {
12980 /* If the object itself is the array it is not at struct end. */
12984 /* Check whether the array domain covers all of the available
12985 padding. */
12986 poly_int64 offset;
12990 {
12991 *is_trailing_array
12994 }
12996 {
12997 *is_trailing_array
13000 }
13002 /* If at least one extra element fits it is a flexarray. */
13008 {
13009 *is_trailing_array
13012 }
13015 }
13019 }
13022 /* Return a tree representing the offset, in bytes, of the field referenced
13023 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13025 tree
13027 {
13032 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13033 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13034 value. */
13036 {
13037 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13038 sizetype from another type of the same width and signedness. */
13044 }
13046 /* Otherwise, take the offset from that of the field. Substitute
13047 any PLACEHOLDER_EXPR that we have. */
13048 else
13050 }
13052 /* Given the initializer INIT, return the initializer for the field
13053 DECL if it exists, otherwise null. Used to obtain the initializer
13054 for a flexible array member and determine its size. */
13056 static tree
13058 {
13064 {
13069 {
13073 }
13074 }
13077 }
13079 /* Determines the special array member type for the array reference REF. */
13080 special_array_member
13082 {
13088 {
13097 {
13098 /* If array element has zero size, verify if it is a flexible
13099 array member or zero length array. Clear zero_elts if
13100 it has one or more members or is a VLA member. */
13109 }
13111 /* MEMBER is an interior array with more than one element. */
13115 {
13118 else
13120 }
13128 {
13133 /* MEMBER is a trailing array with more than
13134 one elements. */
13139 }
13140 }
13143 }
13145 /* Determines the size of the member referenced by the COMPONENT_REF
13146 REF, using its initializer expression if necessary in order to
13147 determine the size of an initialized flexible array member.
13148 If non-null, set *SAM to the type of special array member.
13149 Returns the size as sizetype (which might be zero for an object
13150 with an uninitialized flexible array member) or null if the size
13151 cannot be determined. */
13153 tree
13155 {
13158 special_array_member sambuf;
13163 /* The object/argument referenced by the COMPONENT_REF and its type. */
13166 /* The referenced member. */
13171 {
13174 /* DECL_SIZE may be less than TYPE_SIZE in C++ when referring
13175 to the type of a class with a virtual base which doesn't
13176 reflect the size of the virtual's members (see pr97595).
13177 If that's the case fail for now and implement something
13178 more robust in the future. */
13182 /* 2-or-more elements arrays are treated as normal arrays by default. */
13189 /* If the trailing array is a not a flexible array member, treat it as
13190 a normal array. */
13198 /* For a reference to a flexible array member of a union
13199 use the size of the union instead of the size of the member. */
13202 }
13204 /* MEMBER is either a bona fide flexible array member, or a zero-elements
13205 array member, or an array of length one treated as such. */
13207 /* If the reference is to a declared object and the member a true
13208 flexible array, try to determine its size from its initializer. */
13212 {
13223 }
13225 /* BASE is the declared object of which MEMBER is either a member
13226 or that is cast to ARGTYPE (e.g., a char buffer used to store
13227 an ARGTYPE object). */
13230 /* Determine the base type of the referenced object. If it's
13231 the same as ARGTYPE and MEMBER has a known size, return it. */
13243 /* MEMBER is a true flexible array member. Compute its size from
13244 the initializer of the BASE object if it has one. */
13247 {
13250 {
13253 {
13254 /* Use the larger of the initializer size and the tail
13255 padding in the enclosing struct. */
13260 }
13263 }
13264 }
13267 {
13269 {
13274 /* The size of a flexible array member of an extern struct
13275 with no initializer cannot be determined (it's defined
13276 in another translation unit and can have an initializer
13277 with an arbitrary number of elements). */
13280 /* Use the size of the base struct or, for interior zero-length
13281 arrays, the size of the enclosing type. */
13283 }
13285 /* Use the size of the BASE object (possibly an array of some
13286 other type such as char used to store the struct). */
13288 else
13290 }
13292 /* If the flexible array member has a known size use the greater
13293 of it and the tail padding in the enclosing struct.
13294 Otherwise, when the size of the flexible array member is unknown
13295 and the referenced object is not a struct, use the size of its
13296 type when known. This detects sizes of array buffers when cast
13297 to struct types with flexible array members. */
13299 {
13304 {
13307 }
13309 }
13311 /* Return "don't know" for an external non-array object since its
13312 flexible array member can be initialized to have any number of
13313 elements. Otherwise, return zero because the flexible array
13314 member has no elements. */
13317 && (!typematch
13320 }
13322 /* Return the machine mode of T. For vectors, returns the mode of the
13323 inner type. The main use case is to feed the result to HONOR_NANS,
13324 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13326 machine_mode
13328 {
13334 }
13336 /* Vector types need to re-check the target flags each time we report
13337 the machine mode. We need to do this because attribute target can
13338 change the result of vector_mode_supported_p and have_regs_of_mode
13339 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13340 change on a per-function basis. */
13341 /* ??? Possibly a better solution is to run through all the types
13342 referenced by a function and re-compute the TYPE_MODE once, rather
13343 than make the TYPE_MODE macro call a function. */
13345 machine_mode
13347 {
13348 machine_mode mode;
13356 {
13357 scalar_int_mode innermode;
13359 /* For integers, try mapping it to a same-sized scalar mode. */
13361 {
13364 scalar_int_mode mode;
13368 }
13371 }
13374 }
13376 /* Return the size in bits of each element of vector type TYPE. */
13378 unsigned int
13380 {
13385 }
13387 /* Calculate the size in bits of each element of vector type TYPE
13388 and return the result as a tree of type bitsizetype. */
13390 tree
13392 {
13397 }
13399 /* Verify that basic properties of T match TV and thus T can be a variant of
13400 TV. TV should be the more specified variant (i.e. the main variant). */
13402 static bool
13404 {
13405 /* Type variant can differ by:
13407 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13408 ENCODE_QUAL_ADDR_SPACE.
13409 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13410 in this case some values may not be set in the variant types
13411 (see TYPE_COMPLETE_P checks).
13412 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13413 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13414 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13415 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13416 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13417 this is necessary to make it possible to merge types form different TUs
13418 - arrays, pointers and references may have TREE_TYPE that is a variant
13419 of TREE_TYPE of their main variants.
13420 - aggregates may have new TYPE_FIELDS list that list variants of
13421 the main variant TYPE_FIELDS.
13422 - vector types may differ by TYPE_VECTOR_OPAQUE
13423 */
13425 /* Convenience macro for matching individual fields. */
13426 #define verify_variant_match(flag) \
13427 do { \
13428 if (flag (tv) != flag (t)) \
13429 { \
13431 debug_tree (tv); \
13432 return false; \
13433 } \
13434 } while (false)
13436 /* tree_base checks. */
13439 /* FIXME: Ada builds non-artificial variants of artificial types. */
13440 #if 0
13443 #endif
13446 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13453 else
13455 /* FIXME: This check trigger during libstdc++ build. */
13456 #if 0
13459 #endif
13461 /* tree_type_common checks. */
13464 {
13472 {
13482 }
13484 }
13490 /* During LTO we merge variant lists from diferent translation units
13491 that may differ BY TYPE_CONTEXT that in turn may point
13492 to TRANSLATION_UNIT_DECL.
13493 Ada also builds variants of types with different TYPE_CONTEXT. */
13494 #if 0
13497 #endif
13503 {
13507 }
13509 /* tree_type_non_common checks. */
13511 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13512 and dangle the pointer from time to time. */
13516 {
13520 }
13527 {
13530 }
13537 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13538 or even type's main variant. This is needed to make bootstrap pass
13539 and the bug seems new in GCC 5.
13540 C++ FE should be updated to make this consistent and we should check
13541 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13542 is a match with main variant.
13544 Also disable the check for Java for now because of parser hack that builds
13545 first an dummy BINFO and then sometimes replace it by real BINFO in some
13546 of the copies. */
13549 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13550 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13551 at LTO time only. */
13553 {
13561 }
13563 /* Check various uses of TYPE_VALUES_RAW. */
13569 /* Permit incomplete variants of complete type. While FEs may complete
13570 all variants, this does not happen for C++ templates in all cases. */
13574 {
13577 /* Fortran builds qualified variants as new records with items of
13578 qualified type. Verify that they looks same. */
13585 /* FIXME: gfc_nonrestricted_type builds all types as variants
13586 with exception of pointer types. It deeply copies the type
13587 which means that we may end up with a variant type
13588 referring non-variant pointer. We may change it to
13589 produce types as variants, too, like
13590 objc_get_protocol_qualified_type does. */
13596 {
13604 }
13605 }
13608 /* For C++ the qualified variant of array type is really an array type
13609 of qualified TREE_TYPE.
13610 objc builds variants of pointer where pointer to type is a variant, too
13611 in objc_get_protocol_qualified_type. */
13617 {
13625 }
13628 {
13636 }
13638 #undef verify_variant_match
13639 }
13642 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13643 the middle-end types_compatible_p function. It needs to avoid
13644 claiming types are different for types that should be treated
13645 the same with respect to TBAA. Canonical types are also used
13646 for IL consistency checks via the useless_type_conversion_p
13647 predicate which does not handle all type kinds itself but falls
13648 back to pointer-comparison of TYPE_CANONICAL for aggregates
13649 for example. */
13651 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13652 type calculation because we need to allow inter-operability between signed
13653 and unsigned variants. */
13655 bool
13657 {
13658 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13659 signed char and unsigned char. Similarly fortran FE builds
13660 C_SIZE_T as signed type, while C defines it unsigned. */
13663 == INTEGER_TYPE
13666 }
13668 /* Return true iff T1 and T2 are structurally identical for what
13669 TBAA is concerned.
13670 This function is used both by lto.cc canonical type merging and by the
13671 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13672 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13673 only for LTO because only in these cases TYPE_CANONICAL equivalence
13674 correspond to one defined by gimple_canonical_types_compatible_p. */
13676 bool
13679 {
13680 /* Type variants should be same as the main variant. When not doing sanity
13681 checking to verify this fact, go to main variants and save some work. */
13683 {
13686 }
13688 /* Check first for the obvious case of pointer identity. */
13692 /* Check that we have two types to compare. */
13696 /* We consider complete types always compatible with incomplete type.
13697 This does not make sense for canonical type calculation and thus we
13698 need to ensure that we are never called on it.
13700 FIXME: For more correctness the function probably should have three modes
13701 1) mode assuming that types are complete mathcing their structure
13702 2) mode allowing incomplete types but producing equivalence classes
13703 and thus ignoring all info from complete types
13704 3) mode allowing incomplete types to match complete but checking
13705 compatibility between complete types.
13707 1 and 2 can be used for canonical type calculation. 3 is the real
13708 definition of type compatibility that can be used i.e. for warnings during
13709 declaration merging. */
13714 /* If the types have been previously registered and found equal
13715 they still are. */
13719 {
13720 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13721 they are always NULL, but they are set to non-NULL for types
13722 constructed by build_pointer_type and variants. In this case the
13723 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13724 all pointers are considered equal. Be sure to not return false
13725 negatives. */
13729 }
13731 /* For types where we do ODR based TBAA the canonical type is always
13732 set correctly, so we know that types are different if their
13733 canonical types does not match. */
13739 /* Can't be the same type if the types don't have the same code. */
13744 /* Qualifiers do not matter for canonical type comparison purposes. */
13746 /* Void types and nullptr types are always the same. */
13751 /* Can't be the same type if they have different mode. */
13755 /* Non-aggregate types can be handled cheaply. */
13763 {
13764 /* Can't be the same type if they have different precision. */
13768 /* In some cases the signed and unsigned types are required to be
13769 inter-operable. */
13774 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13775 interoperable with "signed char". Unless all frontends are revisited
13776 to agree on these types, we must ignore the flag completely. */
13778 /* Fortran standard define C_PTR type that is compatible with every
13779 C pointer. For this reason we need to glob all pointers into one.
13780 Still pointers in different address spaces are not compatible. */
13782 {
13786 }
13788 /* Tail-recurse to components. */
13793 trust_type_canonical);
13796 }
13798 /* Do type-specific comparisons. */
13800 {
13802 /* Array types are the same if the element types are the same and
13803 the number of elements are the same. */
13805 trust_type_canonical)
13810 else
13811 {
13815 /* For an incomplete external array, the type domain can be
13816 NULL_TREE. Check this condition also. */
13821 else
13822 {
13828 /* The minimum/maximum values have to be the same. */
13840 else
13842 }
13843 }
13847 /* Function types are the same if the return type and arguments types
13848 are the same. */
13850 trust_type_canonical))
13857 else
13858 {
13864 {
13867 trust_type_canonical))
13869 }
13875 }
13880 {
13883 /* Don't try to compare variants of an incomplete type, before
13884 TYPE_FIELDS has been copied around. */
13892 /* For aggregate types, all the fields must be the same. */
13896 {
13897 /* Skip non-fields and zero-sized fields. */
13908 /* The fields must have the same name, offset and type. */
13911 || !gimple_canonical_types_compatible_p
13913 trust_type_canonical))
13915 }
13917 /* If one aggregate has more fields than the other, they
13918 are not the same. */
13923 }
13926 /* Consider all types with language specific trees in them mutually
13927 compatible. This is executed only from verify_type and false
13928 positives can be tolerated. */
13931 }
13932 }
13934 /* For OPAQUE_TYPE T, it should have only size and alignment information
13935 and its mode should be of class MODE_OPAQUE. This function verifies
13936 these properties of T match TV which is the main variant of T and TC
13937 which is the canonical of T. */
13939 static void
13941 {
13946 /* For an opaque type T1, check if some of its properties match
13947 the corresponding ones of the other opaque type T2, emit some
13948 error messages for those inconsistent ones. */
13951 {
13953 {
13957 }
13959 {
13963 }
13965 {
13969 }
13973 {
13977 }
13979 {
13983 }
13985 {
13989 }
13990 };
13997 }
13999 /* Verify type T. */
14001 void
14003 {
14009 {
14012 }
14015 {
14018 }
14020 {
14024 }
14029 ;
14031 {
14035 }
14036 /* Method and function types cannot be used to address memory and thus
14037 TYPE_CANONICAL really matters only for determining useless conversions.
14039 FIXME: C++ FE produce declarations of builtin functions that are not
14040 compatible with main variants. */
14042 ;
14044 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14045 with variably sized arrays because their sizes possibly
14046 gimplified to different variables. */
14050 {
14054 }
14058 {
14062 }
14064 {
14069 }
14072 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14074 {
14075 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14076 and danagle the pointer from time to time. */
14080 {
14084 }
14085 }
14087 {
14090 {
14094 }
14095 }
14097 {
14100 {
14104 }
14105 }
14108 {
14109 /* FIXME: The following check should pass:
14110 useless_type_conversion_p (const_cast <tree> (t),
14111 TREE_TYPE (TYPE_MIN_VALUE (t))
14112 but does not for C sizetypes in LTO. */
14113 }
14115 /* Check various uses of TYPE_MAXVAL_RAW. */
14117 {
14119 ;
14121 {
14125 }
14127 {
14131 }
14132 }
14134 {
14138 {
14142 }
14143 }
14145 {
14149 {
14153 }
14154 }
14157 {
14158 /* FIXME: The following check should pass:
14159 useless_type_conversion_p (const_cast <tree> (t),
14160 TREE_TYPE (TYPE_MAX_VALUE (t))
14161 but does not for C sizetypes in LTO. */
14162 }
14164 {
14167 {
14171 }
14172 }
14174 {
14178 }
14181 {
14185 }
14187 /* Check various uses of TYPE_VALUES_RAW. */
14190 {
14194 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14195 CONST_DECL of ENUMERAL TYPE. */
14197 {
14202 }
14206 {
14212 }
14214 {
14219 }
14220 }
14222 {
14224 {
14228 }
14229 }
14231 {
14233 {
14236 }
14238 {
14239 /* TODO: verify properties of decls. */
14241 ;
14243 ;
14245 ;
14247 ;
14249 ;
14251 ;
14253 ;
14254 else
14255 {
14259 }
14260 }
14261 }
14269 {
14271 {
14276 }
14278 {
14282 }
14283 /* Verify just enough of cache to ensure that no one copied it to new type.
14284 All copying should go by copy_node that should clear it. */
14286 {
14291 {
14296 }
14297 }
14298 }
14301 {
14302 /* C++ FE uses TREE_PURPOSE to store initial values. */
14304 {
14308 }
14310 {
14314 }
14315 }
14317 {
14321 }
14330 {
14333 }
14335 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14336 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14337 of a type. */
14340 {
14343 }
14346 {
14349 }
14350 }
14353 /* Return 1 if ARG interpreted as signed in its precision is known to be
14354 always positive or 2 if ARG is known to be always negative, or 3 if
14355 ARG may be positive or negative. */
14357 int
14359 {
14366 {
14370 else
14372 }
14376 {
14378 /* Narrower value zero extended into wider type
14379 will always result in positive values. */
14386 }
14390 value_range r;
14393 {
14397 {
14401 {
14410 }
14411 }
14413 }
14415 {
14416 /* For unsigned values, the "positive" range comes
14417 below the "negative" range. */
14422 }
14423 else
14424 {
14429 }
14431 }
14436 /* Return true if ARG is marked with the nonnull attribute in the
14437 current function signature. */
14439 bool
14441 {
14449 /* The static chain decl is always non null. */
14453 /* THIS argument of method is always non-NULL. */
14459 /* Values passed by reference are always non-NULL. */
14466 {
14469 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14473 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14477 /* Get the position number for ARG in the function signature. */
14479 t;
14481 {
14484 }
14488 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14490 {
14493 }
14494 }
14497 }
14499 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14500 information. */
14502 location_t
14504 {
14509 }
14511 location_t
14513 {
14514 source_range src_range;
14518 }
14520 location_t
14522 {
14530 pure_loc,
14531 src_range,
14532 NULL,
14533 discriminator);
14536 }
14538 /* Return EXPR, potentially wrapped with a node expression LOC,
14539 if !CAN_HAVE_LOCATION_P (expr).
14541 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14542 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14544 Wrapper nodes can be identified using location_wrapper_p. */
14546 tree
14548 {
14555 /* We should only be adding wrappers for constants and for decls,
14556 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14561 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14562 any impact of the wrapper nodes. */
14566 /* Compiler-generated temporary variables don't need a wrapper. */
14570 /* If any auto_suppress_location_wrappers are active, don't create
14571 wrappers. */
14575 tree_code code
14580 /* Mark this node as being a wrapper. */
14583 }
14587 /* Return the name of combined function FN, for debugging purposes. */
14591 {
14593 {
14596 }
14597 else
14599 }
14601 /* Return a bitmap with a bit set corresponding to each argument in
14602 a function call type FNTYPE declared with attribute nonnull,
14603 or null if none of the function's argument are nonnull. The caller
14604 must free the bitmap. */
14606 bitmap
14608 {
14614 {
14615 /* The this pointer in C++ non-static member functions is
14616 implicitly nonnull whether or not it's declared as such. */
14619 }
14625 /* A function declaration can specify multiple attribute nonnull,
14626 each with zero or more arguments. The loop below creates a bitmap
14627 representing a union of all the arguments. An empty (but non-null)
14628 bitmap means that all arguments have been declaraed nonnull. */
14630 {
14639 {
14640 /* Clear the bitmap in case a previous attribute nonnull
14641 set it and this one overrides it for all arguments. */
14644 }
14646 /* Iterate over the indices of the format arguments declared nonnull
14647 and set a bit for each. */
14649 {
14652 }
14653 }
14656 }
14658 /* Returns true if TYPE is a type where it and all of its subobjects
14659 (recursively) are of structure, union, or array type. */
14661 bool
14663 {
14665 {
14672 }
14678 }
14680 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14681 that shouldn't be passed via stack. */
14683 bool
14685 {
14696 }
14698 /* Determine whether TYPE is a structure with a flexible array member,
14699 or a union containing such a structure (possibly recursively). */
14701 bool
14703 {
14706 {
14722 {
14726 }
14730 }
14731 }
14733 /* Like int_size_in_bytes, but handle empty records specially. */
14735 HOST_WIDE_INT
14737 {
14739 }
14741 /* Like size_in_bytes, but handle empty records specially. */
14743 tree
14745 {
14747 }
14749 /* Return true if an expression with CODE has to have the same result type as
14750 its first operand. */
14752 bool
14754 {
14756 {
14790 }
14791 }
14793 /* Return a typenode for the "standard" C type with a given name. */
14794 tree
14796 {
14828 }
14830 /* List of pointer types used to declare builtins before we have seen their
14831 real declaration.
14833 Keep the size up to date in tree.h ! */
14835 {
14842 };
14844 /* Return the maximum object size. */
14846 tree
14848 {
14849 /* To do: Make this a configurable parameter. */
14851 }
14853 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
14854 parameter default to false and that weeds out error_mark_node. */
14856 bool
14859 {
14866 }
14868 /* Return true if NEW_ASM and DELETE_ASM name a valid pair of new and
14869 delete operators. Return false if they may or may not name such
14870 a pair and, when nonnull, set *PCERTAIN to true if they certainly
14871 do not. */
14873 bool
14876 {
14886 /* The following failures are due to invalid names so they're not
14887 considered certain mismatches. */
14903 /* The following failures are due to names of user-defined operators
14904 so they're also not considered certain mismatches. */
14906 /* *_len is now just the length after initial underscores. */
14912 /* The following failures are certain mismatches. */
14915 /* _Znw must match _Zdl, _Zna must match _Zda. */
14919 /* 'j', 'm' and 'y' correspond to size_t. */
14926 {
14927 /* _ZnXY or _ZnXYRKSt9nothrow_t matches
14928 _ZdXPv, _ZdXPvY and _ZdXPvRKSt9nothrow_t. */
14935 }
14939 {
14940 /* _ZnXYSt11align_val_t or _ZnXYSt11align_val_tRKSt9nothrow_t matches
14941 _ZdXPvSt11align_val_t or _ZdXPvYSt11align_val_t or or
14942 _ZdXPvSt11align_val_tRKSt9nothrow_t. */
14952 }
14954 /* The negative result is conservative. */
14957 }
14959 /* Return the zero-based number corresponding to the argument being
14960 deallocated if FNDECL is a deallocation function or an out-of-bounds
14961 value if it isn't. */
14963 unsigned
14965 {
14966 /* A call to operator delete isn't recognized as one to a built-in. */
14968 {
14972 /* Avoid placement delete that's not been inlined. */
14978 }
14980 /* TODO: Handle user-defined functions with attribute malloc? Handle
14981 known non-built-ins like fopen? */
14983 {
14985 {
14991 }
14993 }
15002 {
15013 }
15016 }
15018 /* If EXPR refers to a character array or pointer declared attribute
15019 nonstring, return a decl for that array or pointer and set *REF
15020 to the referenced enclosing object or pointer. Otherwise return
15021 null. */
15023 tree
15025 {
15029 {
15033 {
15039 }
15040 else
15042 }
15047 /* To simplify calling code, store the referenced DECL regardless of
15048 the attribute determined below, but avoid storing the SSA_NAME_VAR
15049 obtained above (it's not useful for dataflow purposes). */
15053 /* Use the SSA_NAME_VAR that was determined above to see if it's
15054 declared nonstring. Otherwise drill down into the referenced
15055 DECL. */
15070 }
15072 /* Return length of attribute names string,
15073 if arglist chain > 1, -1 otherwise. */
15075 int
15077 {
15078 tree arg;
15083 {
15088 argnum++;
15089 argnum++;
15090 }
15094 }
15096 void
15098 {
15101 }
15103 #if CHECKING_P
15107 /* Selftests for tree. */
15109 /* Verify that integer constants are sane. */
15111 static void
15113 {
15126 }
15128 /* Verify identifiers. */
15130 static void
15132 {
15136 }
15138 /* Verify LABEL_DECL. */
15140 static void
15142 {
15148 }
15150 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15151 are given by VALS. */
15153 static tree
15155 {
15160 }
15162 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15164 static void
15166 {
15172 }
15174 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15175 and that its elements match EXPECTED. */
15177 static void
15180 {
15187 }
15189 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15190 and NPATTERNS background elements, and that its elements match
15191 EXPECTED. */
15193 static void
15196 {
15203 }
15205 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15206 and that its elements match EXPECTED. */
15208 static void
15211 {
15218 }
15220 /* Test the creation of VECTOR_CSTs. */
15222 static void
15224 {
15230 /* Test a simple linear series with a base of 0 and a step of 1:
15231 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15237 /* Try the same with the first element replaced by 100:
15238 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15243 /* Try a series that wraps around.
15244 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15250 /* Try a downward series:
15251 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15257 /* Try two interleaved series with different bases and steps:
15258 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15261 {
15264 }
15268 /* Try a duplicated value:
15269 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15275 /* Try an interleaved duplicated value:
15276 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15283 /* Try a duplicated value with 2 exceptions
15284 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15290 /* Try with and without a step
15291 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15297 /* Try a fully-general constant:
15298 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15302 }
15304 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15305 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15306 modifying its argument in-place. */
15308 static void
15310 {
15313 }
15315 /* Verify location wrappers. */
15317 static void
15319 {
15324 /* Wrapping a constant. */
15334 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15337 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15342 /* Wrapping a STRING_CST. */
15354 /* Wrapping a variable. */
15357 integer_type_node);
15366 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15367 wrapper. */
15372 /* Verify that STRIP_NOPS removes wrappers. */
15376 }
15378 /* Test various tree predicates. Verify that location wrappers don't
15379 affect the results. */
15381 static void
15383 {
15384 /* Build various constants and wrappers around them. */
15412 /* TODO: vector constants. */
15414 /* Test integer_onep. */
15434 /* Test integer_zerop. */
15454 /* Test integer_all_onesp. */
15474 /* Test integer_minus_onep. */
15494 /* Test integer_each_onep. */
15514 /* Test integer_truep. */
15534 /* Test integer_nonzerop. */
15554 /* Test real_zerop. */
15574 /* Test real_onep. */
15594 /* Test real_minus_onep. */
15614 /* Test zerop. */
15634 /* Test tree_expr_nonnegative_p. */
15654 /* Test tree_expr_nonzero_p. */
15662 /* Test integer_valued_real_p. */
15669 /* Test integer_pow2p. */
15674 /* Test uniform_integer_cst_p. */
15693 }
15695 /* Check that string escaping works correctly. */
15697 static void
15699 {
15701 escaped_string msg;
15704 /* ASSERT_STREQ does not accept NULL as a valid test
15705 result, so we have to use ASSERT_EQ instead. */
15714 /* Ensure that we have -fmessage-length set to 0. */
15724 /* Now repeat the tests with -fmessage-length set to 5. */
15727 /* Note that the newline is not translated into an escape. */
15734 /* Restore the original message length setting. */
15736 }
15738 /* Run all of the selftests within this file. */
15740 void
15742 {
15750 }