| blob | 8ca72110526cf7d71fbd9069494393867cf12489 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2019 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. */
71 /* Tree code classes. */
73 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
74 #define END_OF_BASE_TREE_CODES tcc_exceptional,
78 };
80 #undef DEFTREECODE
81 #undef END_OF_BASE_TREE_CODES
83 /* Table indexed by tree code giving number of expression
84 operands beyond the fixed part of the node structure.
85 Not used for types or decls. */
87 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
88 #define END_OF_BASE_TREE_CODES 0,
92 };
94 #undef DEFTREECODE
95 #undef END_OF_BASE_TREE_CODES
97 /* Names of tree components.
98 Used for printing out the tree and error messages. */
99 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
104 };
106 #undef DEFTREECODE
107 #undef END_OF_BASE_TREE_CODES
109 /* Each tree code class has an associated string representation.
110 These must correspond to the tree_code_class entries. */
113 {
124 "expression"
125 };
127 /* obstack.[ch] explicitly declined to prototype this. */
130 /* Statistics-gathering stuff. */
136 /* Keep in sync with tree.h:enum tree_node_kind. */
154 };
156 /* Unique id for next decl created. */
158 /* Unique id for next type created. */
160 /* Unique id for next debug decl created. Use negative numbers,
161 to catch erroneous uses. */
164 /* Since we cannot rehash a type after it is in the table, we have to
165 keep the hash code. */
169 tree type;
170 };
172 /* Initial size of the hash table (rounded to next prime). */
173 #define TYPE_HASH_INITIAL_SIZE 1000
176 {
180 static int
182 {
184 }
185 };
187 /* Now here is the hash table. When recording a type, it is added to
188 the slot whose index is the hash code. Note that the hash table is
189 used for several kinds of types (function types, array types and
190 array index range types, for now). While all these live in the
191 same table, they are completely independent, and the hash code is
192 computed differently for each of these. */
196 /* Hash table and temporary node for larger integer const values. */
200 {
203 };
207 /* Class and variable for making sure that there is a single POLY_INT_CST
208 for a given value. */
210 {
214 };
218 /* Hash table for optimization flags and target option flags. Use the same
219 hash table for both sets of options. Nodes for building the current
220 optimization and target option nodes. The assumption is most of the time
221 the options created will already be in the hash table, so we avoid
222 allocating and freeing up a node repeatably. */
227 {
230 };
234 /* General tree->tree mapping structure for use in hash tables. */
244 {
247 static bool
249 {
251 }
253 static int
255 {
257 }
258 };
278 /* Number of operands for each OpenMP clause. */
280 {
355 };
358 {
433 };
436 /* Return the tree node structure used by tree code CODE. */
440 {
442 {
444 {
446 {
469 }
470 }
483 }
485 {
486 /* tcc_constant cases. */
495 /* tcc_exceptional cases. */
512 }
513 }
516 /* Initialize tree_contains_struct to describe the hierarchy of tree
517 nodes. */
519 static void
521 {
525 {
532 /* Mark the TS structure itself. */
535 /* Mark all the structures that TS is derived from. */
537 {
617 }
618 }
620 /* Basic consistency checks for attributes used in fold. */
661 }
664 /* Init tree.c. */
666 void
668 {
669 /* Initialize the hash table of types. */
670 type_hash_table
673 debug_expr_for_decl
676 value_expr_for_decl
690 /* Initialize the tree_contains_struct array. */
693 }
695 \f
696 /* The name of the object as the assembler will see it (but before any
697 translations made by ASM_OUTPUT_LABELREF). Often this is the same
698 as DECL_NAME. It is an IDENTIFIER_NODE. */
699 tree
701 {
705 }
707 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
708 (either of which may be NULL). Inform the FE, if this changes the
709 name. */
711 void
713 {
716 }
718 /* When the target supports COMDAT groups, this indicates which group the
719 DECL is associated with. This can be either an IDENTIFIER_NODE or a
720 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
721 tree
723 {
728 }
730 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
731 tree
733 {
738 }
740 /* When the target supports named section, return its name as IDENTIFIER_NODE
741 or NULL if it is in no section. */
744 {
749 }
751 /* Set section name of NODE to VALUE (that is expected to be
752 identifier node) */
753 void
755 {
759 {
763 }
766 else
769 }
771 /* Return TLS model of a variable NODE. */
772 enum tls_model
774 {
779 }
781 /* Set TLS model of variable NODE to MODEL. */
782 void
784 {
788 {
792 }
793 else
796 }
798 /* Compute the number of bytes occupied by a tree with code CODE.
799 This function cannot be used for nodes that have variable sizes,
800 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
801 size_t
803 {
805 {
808 {
825 }
829 {
852 }
865 {
877 }
881 {
902 }
906 }
907 }
909 /* Compute the number of bytes occupied by NODE. This routine only
910 looks at TREE_CODE, except for those nodes that have variable sizes. */
911 size_t
913 {
916 {
946 else
948 }
949 }
951 /* Return tree node kind based on tree CODE. */
953 static tree_node_kind
955 {
959 {
977 {
994 }
1000 }
1001 }
1003 /* Record interesting allocation statistics for a tree node with CODE
1004 and LENGTH. */
1006 static void
1008 {
1017 }
1019 /* Allocate and return a new UID from the DECL_UID namespace. */
1021 int
1023 {
1025 }
1027 /* Return a newly allocated node of code CODE. For decl and type
1028 nodes, some other fields are initialized. The rest of the node is
1029 initialized to zero. This function cannot be used for TREE_VEC,
1030 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1031 tree_code_size.
1033 Achoo! I got a code in the node. */
1035 tree
1037 {
1038 tree t;
1048 {
1056 {
1058 {
1061 }
1062 else
1064 }
1068 else
1069 {
1072 }
1085 /* Default to no attributes for type, but let target change that. */
1089 /* We have not yet computed the alias set for this type. */
1099 {
1107 /* All of these have side-effects, no matter what their
1108 operands are. */
1114 }
1119 {
1132 }
1136 /* Other classes need no special treatment. */
1138 }
1141 }
1143 /* Free tree node. */
1145 void
1147 {
1150 {
1160 }
1168 }
1169 \f
1170 /* Return a new node with the same contents as NODE except that its
1171 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1173 tree
1175 {
1176 tree t;
1193 {
1196 else
1197 {
1201 }
1204 {
1207 }
1208 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1210 {
1213 }
1215 {
1218 }
1220 {
1223 }
1224 }
1226 {
1228 /* The following is so that the debug code for
1229 the copy is different from the original type.
1230 The two statements usually duplicate each other
1231 (because they clear fields of the same union),
1232 but the optimizer should catch that. */
1236 /* Do not copy the values cache. */
1238 {
1241 }
1242 }
1244 {
1248 }
1250 {
1254 }
1257 }
1259 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1260 For example, this can copy a list made of TREE_LIST nodes. */
1262 tree
1264 {
1265 tree head;
1274 {
1278 }
1280 }
1282 \f
1283 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1284 INTEGER_CST with value CST and type TYPE. */
1286 static unsigned int
1288 {
1290 /* We need extra HWIs if CST is an unsigned integer with its
1291 upper bit set. */
1295 }
1297 /* Return a new INTEGER_CST with value CST and type TYPE. */
1299 static tree
1301 {
1307 {
1313 }
1316 {
1317 len--;
1321 }
1327 }
1329 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1331 static tree
1333 CXX_MEM_STAT_INFO)
1334 {
1346 }
1348 /* Create a constant tree that contains CST sign-extended to TYPE. */
1350 tree
1352 {
1353 /* Support legacy code. */
1358 }
1360 /* Create a constant tree that contains CST zero-extended to TYPE. */
1362 tree
1364 {
1366 }
1368 /* Create a constant tree that contains CST sign-extended to TYPE. */
1370 tree
1372 {
1375 }
1377 /* Constructs tree in type TYPE from with value given by CST. Signedness
1378 of CST is assumed to be the same as the signedness of TYPE. */
1380 tree
1382 {
1384 }
1386 /* We force the wide_int CST to the range of the type TYPE by sign or
1387 zero extending it. OVERFLOWABLE indicates if we are interested in
1388 overflow of the value, when >0 we are only interested in signed
1389 overflow, for <0 we are interested in any overflow. OVERFLOWED
1390 indicates whether overflow has already occurred. CONST_OVERFLOWED
1391 indicates whether constant overflow has already occurred. We force
1392 T's value to be within range of T's type (by setting to 0 or 1 all
1393 the bits outside the type's range). We set TREE_OVERFLOWED if,
1394 OVERFLOWED is nonzero,
1395 or OVERFLOWABLE is >0 and signed overflow occurs
1396 or OVERFLOWABLE is <0 and any overflow occurs
1397 We return a new tree node for the extended wide_int. The node
1398 is shared if no overflow flags are set. */
1401 tree
1404 {
1407 /* If we need to set overflow flags, return a new unshared node. */
1409 {
1413 {
1415 sign);
1416 tree t;
1419 else
1420 {
1423 {
1426 }
1428 }
1431 }
1432 }
1434 /* Else build a shared node. */
1436 }
1438 /* These are the hash table functions for the hash table of INTEGER_CST
1439 nodes of a sizetype. */
1441 /* Return the hash code X, an INTEGER_CST. */
1443 hashval_t
1445 {
1454 }
1456 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1457 is the same as that given by *Y, which is the same. */
1459 bool
1461 {
1475 }
1477 /* Create an INT_CST node of TYPE and value CST.
1478 The returned node is always shared. For small integers we use a
1479 per-type vector cache, for larger ones we use a single hash table.
1480 The value is extended from its precision according to the sign of
1481 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1482 the upper bits and ensures that hashing and value equality based
1483 upon the underlying HOST_WIDE_INTs works without masking. */
1485 static tree
1487 {
1488 tree t;
1496 /* Verify that everything is canonical. */
1499 {
1504 }
1510 {
1511 /* We just need to store a single HOST_WIDE_INT. */
1512 HOST_WIDE_INT hwi;
1515 else
1519 {
1522 /* Fallthru. */
1526 /* Cache NULL pointer and zero bounds. */
1528 {
1531 }
1535 /* Cache false or true. */
1544 {
1545 /* Cache [0, N). */
1549 }
1550 else
1551 {
1552 /* Cache [-1, N). */
1556 }
1564 }
1567 {
1568 /* Look for it in the type's vector of small shared ints. */
1570 {
1573 }
1577 /* Make sure no one is clobbering the shared constant. */
1583 else
1584 {
1585 /* Create a new shared int. */
1588 }
1589 }
1590 else
1591 {
1592 /* Use the cache of larger shared ints, using int_cst_node as
1593 a temporary. */
1601 {
1602 /* Insert this one into the hash table. */
1605 /* Make a new node for next time round. */
1607 }
1608 }
1609 }
1610 else
1611 {
1612 /* The value either hashes properly or we drop it on the floor
1613 for the gc to take care of. There will not be enough of them
1614 to worry about. */
1620 {
1621 /* Insert this one into the hash table. */
1624 }
1625 else
1627 }
1630 }
1632 hashval_t
1634 {
1642 }
1644 bool
1646 {
1653 }
1655 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1656 The elements must also have type TYPE. */
1658 tree
1660 {
1671 INSERT);
1673 {
1678 }
1680 }
1682 /* Create a constant tree with value VALUE in type TYPE. */
1684 tree
1686 {
1690 }
1692 void
1694 {
1703 {
1706 /* Fallthru. */
1710 /* Cache NULL pointer. */
1712 {
1715 }
1719 /* Cache false or true. */
1728 {
1729 /* Cache 0..N */
1732 /* This is a little hokie, but if the prec is smaller than
1733 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1734 obvious test will not get the correct answer. */
1736 {
1739 }
1742 }
1743 else
1744 {
1745 /* Cache -1..N */
1751 {
1753 {
1756 }
1759 }
1760 }
1768 }
1771 {
1772 /* Look for it in the type's vector of small shared ints. */
1774 {
1777 }
1781 }
1782 else
1783 {
1784 /* Use the cache of larger shared ints. */
1786 /* If there is already an entry for the number verify it's the
1787 same. */
1790 else
1791 /* Otherwise insert this one into the hash table. */
1793 }
1794 }
1797 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1798 and the rest are zeros. */
1800 tree
1802 {
1807 }
1809 /* Checks that X is integer constant that can be expressed in (unsigned)
1810 HOST_WIDE_INT without loss of precision. */
1812 bool
1814 {
1817 }
1819 /* Build a newly constructed VECTOR_CST with the given values of
1820 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1822 tree
1825 {
1827 tree t;
1843 }
1845 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1846 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1848 tree
1850 {
1852 tree value;
1854 /* We can't construct a VECTOR_CST for a variable number of elements. */
1858 {
1860 {
1861 /* If NELTS is constant then this must be too. */
1865 }
1866 else
1868 }
1873 }
1875 /* Build a vector of type VECTYPE where all the elements are SCs. */
1876 tree
1878 {
1884 /* Verify that the vector type is suitable for SC. Note that there
1885 is some inconsistency in the type-system with respect to restrict
1886 qualifications of pointers. Vector types always have a main-variant
1887 element type and the qualification is applied to the vector-type.
1888 So TREE_TYPE (vector-type) does not return a properly qualified
1889 vector element-type. */
1894 {
1898 }
1901 else
1902 {
1908 }
1909 }
1911 /* If TYPE is not a vector type, just return SC, otherwise return
1912 build_vector_from_val (TYPE, SC). */
1914 tree
1916 {
1921 }
1923 /* Build a vector series of type TYPE in which element I has the value
1924 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1925 and a VEC_SERIES_EXPR otherwise. */
1927 tree
1929 {
1933 {
1943 }
1945 }
1947 /* Return a vector with the same number of units and number of bits
1948 as VEC_TYPE, but in which the elements are a linear series of unsigned
1949 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1951 tree
1953 {
1958 {
1959 index_elt_type = build_nonstandard_integer_type
1962 }
1968 }
1970 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1971 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1973 void
1975 {
1977 tree val;
1983 {
1984 /* Mostly ctors will have elts that don't have side-effects, so
1985 the usual case is to scan all the elements. Hence a single
1986 loop for both const and side effects, rather than one loop
1987 each (with early outs). */
1992 }
1996 }
1998 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1999 CONSTRUCTOR C. */
2001 void
2003 {
2005 tree val;
2011 {
2016 }
2017 }
2019 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2020 are in the vec pointed to by VALS. */
2021 tree
2023 {
2032 }
2034 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2035 INDEX and VALUE. */
2036 tree
2038 {
2046 }
2049 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2050 are in a list pointed to by VALS. */
2051 tree
2053 {
2054 tree t;
2058 {
2062 }
2065 }
2067 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2068 of elements, provided as index/value pairs. */
2070 tree
2072 {
2079 {
2083 }
2086 }
2088 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2090 tree
2092 {
2096 }
2098 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2100 tree
2102 {
2103 tree v;
2113 }
2115 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2117 tree
2119 {
2120 tree v;
2124 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2125 Consider doing it via real_convert now. */
2135 }
2137 /* Like build_real, but first truncate D to the type. */
2139 tree
2141 {
2143 }
2145 /* Return a new REAL_CST node whose type is TYPE
2146 and whose value is the integer value of the INTEGER_CST node I. */
2148 REAL_VALUE_TYPE
2150 {
2151 REAL_VALUE_TYPE d;
2153 /* Clear all bits of the real value type so that we can later do
2154 bitwise comparisons to see if two values are the same. */
2160 }
2162 /* Given a tree representing an integer constant I, return a tree
2163 representing the same value as a floating-point constant of type TYPE. */
2165 tree
2167 {
2168 tree v;
2175 }
2177 /* Return a newly constructed STRING_CST node whose value is
2178 the LEN characters at STR.
2179 Note that for a C string literal, LEN should include the trailing NUL.
2180 The TREE_TYPE is not initialized. */
2182 tree
2184 {
2185 tree s;
2188 /* Do not waste bytes provided by padding of struct tree_string. */
2203 }
2205 /* Return a newly constructed COMPLEX_CST node whose value is
2206 specified by the real and imaginary parts REAL and IMAG.
2207 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2208 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2210 tree
2212 {
2223 }
2225 /* Build a complex (inf +- 0i), such as for the result of cproj.
2226 TYPE is the complex tree type of the result. If NEG is true, the
2227 imaginary zero is negative. */
2229 tree
2231 {
2238 }
2240 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2241 element is set to 1. In particular, this is 1 + i for complex types. */
2243 tree
2245 {
2247 {
2250 }
2251 else
2253 }
2255 /* Return a constant of arithmetic type TYPE which is the
2256 multiplicative identity of the set TYPE. */
2258 tree
2260 {
2262 {
2272 /* We can only generate 1 for accum types. */
2277 {
2281 }
2290 }
2291 }
2293 /* Return an integer of type TYPE containing all 1's in as much precision as
2294 it contains, or a complex or vector whose subparts are such integers. */
2296 tree
2298 {
2300 {
2303 }
2304 else
2306 }
2308 /* Return a constant of arithmetic type TYPE which is the
2309 opposite of the multiplicative identity of the set TYPE. */
2311 tree
2313 {
2315 {
2325 /* We can only generate 1 for accum types. */
2332 {
2336 }
2345 }
2346 }
2348 /* Build 0 constant of type TYPE. This is used by constructor folding
2349 and thus the constant should be represented in memory by
2350 zero(es). */
2352 tree
2354 {
2356 {
2369 {
2373 }
2376 {
2380 }
2386 }
2387 }
2390 /* Build a BINFO with LEN language slots. */
2392 tree
2394 {
2395 tree t;
2410 }
2412 /* Create a CASE_LABEL_EXPR tree node and return it. */
2414 tree
2416 {
2428 }
2430 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2431 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2432 The latter determines the length of the HOST_WIDE_INT vector. */
2434 tree
2436 {
2437 tree t;
2449 /* to_offset can only be applied to trees that are offset_int-sized
2450 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2451 must be exactly the precision of offset_int and so LEN is correct. */
2454 else
2460 }
2462 /* Build a newly constructed TREE_VEC node of length LEN. */
2464 tree
2466 {
2467 tree t;
2478 }
2480 /* Grow a TREE_VEC node to new length LEN. */
2482 tree
2484 {
2500 }
2501 \f
2502 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2503 fixed, and scalar, complex or vector. */
2505 bool
2507 {
2511 }
2513 /* Return 1 if EXPR is the integer constant zero or a complex constant
2514 of zero, or a location wrapper for such a constant. */
2516 bool
2518 {
2522 {
2534 }
2535 }
2537 /* Return 1 if EXPR is the integer constant one or the corresponding
2538 complex constant, or a location wrapper for such a constant. */
2540 bool
2542 {
2546 {
2558 }
2559 }
2561 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2562 return 1 if every piece is the integer constant one.
2563 Also return 1 for location wrappers for such a constant. */
2565 bool
2567 {
2573 else
2575 }
2577 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2578 it contains, or a complex or vector whose subparts are such integers,
2579 or a location wrapper for such a constant. */
2581 bool
2583 {
2601 }
2603 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2604 for such a constant. */
2606 bool
2608 {
2614 else
2616 }
2618 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2619 one bit on), or a location wrapper for such a constant. */
2621 bool
2623 {
2635 }
2637 /* Return 1 if EXPR is an integer constant other than zero or a
2638 complex constant other than zero, or a location wrapper for such a
2639 constant. */
2641 bool
2643 {
2651 }
2653 /* Return 1 if EXPR is the integer constant one. For vector,
2654 return 1 if every piece is the integer constant minus one
2655 (representing the value TRUE).
2656 Also return 1 for location wrappers for such a constant. */
2658 bool
2660 {
2666 }
2668 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2669 for such a constant. */
2671 bool
2673 {
2678 }
2680 /* Return the power of two represented by a tree node known to be a
2681 power of two. */
2683 int
2685 {
2690 }
2692 /* Similar, but return the largest integer Y such that 2 ** Y is less
2693 than or equal to EXPR. */
2695 int
2697 {
2702 }
2704 /* Return number of known trailing zero bits in EXPR, or, if the value of
2705 EXPR is known to be zero, the precision of it's type. */
2707 unsigned int
2709 {
2716 {
2737 /* Second operand is sizetype, which could be in theory
2738 wider than pointer's precision. Make sure we never
2739 return more than prec. */
2754 {
2757 }
2762 {
2767 }
2776 {
2779 {
2784 }
2785 }
2787 CASE_CONVERT:
2805 {
2808 }
2812 }
2813 }
2815 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2816 decimal float constants, so don't return 1 for them.
2817 Also return 1 for location wrappers around such a constant. */
2819 bool
2821 {
2825 {
2833 {
2834 /* Don't simply check for a duplicate because the predicate
2835 accepts both +0.0 and -0.0. */
2841 }
2844 }
2845 }
2847 /* Return 1 if EXPR is the real constant one in real or complex form.
2848 Trailing zeroes matter for decimal float constants, so don't return
2849 1 for them.
2850 Also return 1 for location wrappers around such a constant. */
2852 bool
2854 {
2858 {
2871 }
2872 }
2874 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2875 matter for decimal float constants, so don't return 1 for them.
2876 Also return 1 for location wrappers around such a constant. */
2878 bool
2880 {
2884 {
2897 }
2898 }
2900 /* Nonzero if EXP is a constant or a cast of a constant. */
2902 bool
2904 {
2905 /* This is not quite the same as STRIP_NOPS. It does more. */
2910 }
2912 /* Return true if T holds a polynomial pointer difference, storing it in
2913 *VALUE if so. A true return means that T's precision is no greater
2914 than 64 bits, which is the largest address space we support, so *VALUE
2915 never loses precision. However, the signedness of the result does
2916 not necessarily match the signedness of T: sometimes an unsigned type
2917 like sizetype is used to encode a value that is actually negative. */
2919 bool
2921 {
2925 {
2930 }
2932 {
2939 }
2941 }
2943 poly_int64
2945 {
2950 }
2952 poly_uint64
2954 {
2959 }
2960 \f
2961 /* Return first list element whose TREE_VALUE is ELEM.
2962 Return 0 if ELEM is not in LIST. */
2964 tree
2966 {
2968 {
2972 }
2974 }
2976 /* Return first list element whose TREE_PURPOSE is ELEM.
2977 Return 0 if ELEM is not in LIST. */
2979 tree
2981 {
2983 {
2987 }
2989 }
2991 /* Return true if ELEM is in V. */
2993 bool
2995 {
2997 tree t;
3002 }
3004 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3005 NULL_TREE. */
3007 tree
3009 {
3013 }
3015 /* Return nonzero if ELEM is part of the chain CHAIN. */
3017 bool
3019 {
3021 {
3025 }
3028 }
3030 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3031 We expect a null pointer to mark the end of the chain.
3032 This is the Lisp primitive `length'. */
3034 int
3036 {
3038 #ifdef ENABLE_TREE_CHECKING
3040 #endif
3044 {
3046 #ifdef ENABLE_TREE_CHECKING
3050 #endif
3051 len++;
3052 }
3055 }
3057 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3058 UNION_TYPE TYPE, or NULL_TREE if none. */
3060 tree
3062 {
3067 }
3069 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3070 by modifying the last node in chain 1 to point to chain 2.
3071 This is the Lisp primitive `nconc'. */
3073 tree
3075 {
3076 tree t1;
3087 #ifdef ENABLE_TREE_CHECKING
3088 {
3089 tree t2;
3092 }
3093 #endif
3096 }
3098 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3100 tree
3102 {
3103 tree next;
3108 }
3110 /* Reverse the order of elements in the chain T,
3111 and return the new head of the chain (old last element). */
3113 tree
3115 {
3118 {
3119 /* We shouldn't be using this function to reverse BLOCK chains; we
3120 have blocks_nreverse for that. */
3125 }
3127 }
3128 \f
3129 /* Return a newly created TREE_LIST node whose
3130 purpose and value fields are PARM and VALUE. */
3132 tree
3134 {
3139 }
3141 /* Build a chain of TREE_LIST nodes from a vector. */
3143 tree
3145 {
3149 tree t;
3151 {
3154 }
3156 }
3158 /* Return a newly created TREE_LIST node whose
3159 purpose and value fields are PURPOSE and VALUE
3160 and whose TREE_CHAIN is CHAIN. */
3162 tree
3164 {
3165 tree node;
3177 }
3179 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3180 trees. */
3184 {
3188 tree val;
3194 }
3195 \f
3196 /* Return the size nominally occupied by an object of type TYPE
3197 when it resides in memory. The value is measured in units of bytes,
3198 and its data type is that normally used for type sizes
3199 (which is the first type created by make_signed_type or
3200 make_unsigned_type). */
3202 tree
3204 {
3205 tree t;
3214 {
3217 }
3220 }
3222 /* Return the size of TYPE (in bytes) as a wide integer
3223 or return -1 if the size can vary or is larger than an integer. */
3225 HOST_WIDE_INT
3227 {
3228 tree t;
3238 else
3240 }
3242 /* Return the maximum size of TYPE (in bytes) as a wide integer
3243 or return -1 if the size can vary or is larger than an integer. */
3245 HOST_WIDE_INT
3247 {
3249 tree size_tree;
3251 /* If this is an array type, check for a possible MAX_SIZE attached. */
3254 {
3259 }
3261 /* If we still haven't been able to get a size, see if the language
3262 can compute a maximum size. */
3265 {
3270 }
3273 }
3274 \f
3275 /* Return the bit position of FIELD, in bits from the start of the record.
3276 This is a tree of type bitsizetype. */
3278 tree
3280 {
3283 }
3284 \f
3285 /* Return the byte position of FIELD, in bytes from the start of the record.
3286 This is a tree of type sizetype. */
3288 tree
3290 {
3293 }
3295 /* Likewise, but return as an integer. It must be representable in
3296 that way (since it could be a signed value, we don't have the
3297 option of returning -1 like int_size_in_byte can. */
3299 HOST_WIDE_INT
3301 {
3303 }
3304 \f
3305 /* Return the strictest alignment, in bits, that T is known to have. */
3307 unsigned int
3309 {
3313 {
3315 /* If we have conversions, we know that the alignment of the
3316 object must meet each of the alignments of the types. */
3324 /* These don't change the alignment of an object. */
3328 /* The best we can do is say that the alignment is the least aligned
3329 of the two arms. */
3334 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3335 meaningfully, it's always 1. */
3344 }
3346 /* Otherwise take the alignment from that of the type. */
3348 }
3349 \f
3350 /* Return, as a tree node, the number of elements for TYPE (which is an
3351 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3353 tree
3355 {
3358 /* If they did it with unspecified bounds, then we should have already
3359 given an error about it before we got here. */
3367 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3372 ? max
3374 }
3375 \f
3376 /* If arg is static -- a reference to an object in static storage -- then
3377 return the object. This is not the same as the C meaning of `static'.
3378 If arg isn't static, return NULL. */
3380 tree
3382 {
3384 {
3386 /* Nested functions are static, even though taking their address will
3387 involve a trampoline as we unnest the nested function and create
3388 the trampoline on the tree level. */
3409 /* If the thing being referenced is not a field, then it is
3410 something language specific. */
3413 /* If we are referencing a bitfield, we can't evaluate an
3414 ADDR_EXPR at compile time and so it isn't a constant. */
3431 else
3439 }
3440 }
3442 \f
3445 /* Return whether OP is a DECL whose address is function-invariant. */
3447 bool
3449 {
3450 /* The conditions below are slightly less strict than the one in
3451 staticp. */
3454 {
3477 }
3480 }
3482 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3484 bool
3486 {
3487 /* The conditions below are slightly less strict than the one in
3488 staticp. */
3491 {
3511 }
3514 }
3517 /* Return true if T is function-invariant (internal function, does
3518 not handle arithmetic; that's handled in skip_simple_arithmetic and
3519 tree_invariant_p). */
3521 static bool
3523 {
3524 tree op;
3531 {
3538 {
3540 {
3555 }
3557 }
3563 }
3566 }
3568 /* Return true if T is function-invariant. */
3570 bool
3572 {
3575 }
3577 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3578 Do this to any expression which may be used in more than one place,
3579 but must be evaluated only once.
3581 Normally, expand_expr would reevaluate the expression each time.
3582 Calling save_expr produces something that is evaluated and recorded
3583 the first time expand_expr is called on it. Subsequent calls to
3584 expand_expr just reuse the recorded value.
3586 The call to expand_expr that generates code that actually computes
3587 the value is the first call *at compile time*. Subsequent calls
3588 *at compile time* generate code to use the saved value.
3589 This produces correct result provided that *at run time* control
3590 always flows through the insns made by the first expand_expr
3591 before reaching the other places where the save_expr was evaluated.
3592 You, the caller of save_expr, must make sure this is so.
3594 Constants, and certain read-only nodes, are returned with no
3595 SAVE_EXPR because that is safe. Expressions containing placeholders
3596 are not touched; see tree.def for an explanation of what these
3597 are used for. */
3599 tree
3601 {
3602 tree inner;
3604 /* If the tree evaluates to a constant, then we don't want to hide that
3605 fact (i.e. this allows further folding, and direct checks for constants).
3606 However, a read-only object that has side effects cannot be bypassed.
3607 Since it is no problem to reevaluate literals, we just return the
3608 literal node. */
3616 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3617 it means that the size or offset of some field of an object depends on
3618 the value within another field.
3620 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3621 and some variable since it would then need to be both evaluated once and
3622 evaluated more than once. Front-ends must assure this case cannot
3623 happen by surrounding any such subexpressions in their own SAVE_EXPR
3624 and forcing evaluation at the proper time. */
3630 /* This expression might be placed ahead of a jump to ensure that the
3631 value was computed on both sides of the jump. So make sure it isn't
3632 eliminated as dead. */
3635 }
3637 /* Look inside EXPR into any simple arithmetic operations. Return the
3638 outermost non-arithmetic or non-invariant node. */
3640 tree
3642 {
3643 /* We don't care about whether this can be used as an lvalue in this
3644 context. */
3648 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3649 a constant, it will be more efficient to not make another SAVE_EXPR since
3650 it will allow better simplification and GCSE will be able to merge the
3651 computations if they actually occur. */
3653 {
3657 {
3662 else
3664 }
3665 else
3667 }
3670 }
3672 /* Look inside EXPR into simple arithmetic operations involving constants.
3673 Return the outermost non-arithmetic or non-constant node. */
3675 tree
3677 {
3682 {
3686 {
3691 else
3693 }
3694 else
3696 }
3699 }
3701 /* Return which tree structure is used by T. */
3703 enum tree_node_structure_enum
3705 {
3708 }
3710 /* Set various status flags when building a CALL_EXPR object T. */
3712 static void
3714 {
3719 /* Calls have side-effects, except those to const or pure functions. */
3722 /* Propagate TREE_READONLY of arguments for const functions. */
3728 {
3734 }
3738 }
3739 \f
3740 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3741 size or offset that depends on a field within a record. */
3743 bool
3745 {
3756 {
3758 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3759 position computations since they will be converted into a
3760 WITH_RECORD_EXPR involving the reference, which will assume
3761 here will be valid. */
3775 {
3777 /* Ignoring the first operand isn't quite right, but works best. */
3786 /* The save_expr function never wraps anything containing
3787 a PLACEHOLDER_EXPR. */
3792 }
3795 {
3803 }
3807 {
3809 {
3810 const_tree arg;
3811 const_call_expr_arg_iterator iter;
3816 }
3819 }
3823 }
3825 }
3827 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3828 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3829 field positions. */
3831 static bool
3833 {
3834 /* If the size contains a placeholder or the parent type (component type in
3835 the case of arrays) type involves a placeholder, this type does. */
3843 /* Now do type-specific checks. Note that the last part of the check above
3844 greatly limits what we have to do below. */
3846 {
3863 /* Here we just check the bounds. */
3868 /* We have already checked the component type above, so just check
3869 the domain type. Flexible array members have a null domain. */
3876 {
3877 tree field;
3888 }
3892 }
3893 }
3895 /* Wrapper around above function used to cache its result. */
3897 bool
3899 {
3902 /* If the contains_placeholder_bits field has been initialized,
3903 then we know the answer. */
3907 /* Indicate that we've seen this type node, and the answer is false.
3908 This is what we want to return if we run into recursion via fields. */
3911 /* Compute the real value. */
3914 /* Store the real value. */
3918 }
3919 \f
3920 /* Push tree EXP onto vector QUEUE if it is not already present. */
3922 static void
3924 {
3926 tree iter;
3934 }
3936 /* Given a tree EXP, find all occurrences of references to fields
3937 in a PLACEHOLDER_EXPR and place them in vector REFS without
3938 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3939 we assume here that EXP contains only arithmetic expressions
3940 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3941 argument list. */
3943 void
3945 {
3947 tree inner;
3950 /* We handle TREE_LIST and COMPONENT_REF separately. */
3952 {
3955 }
3957 {
3961 ;
3965 else
3967 }
3968 else
3970 {
3975 /* Variables allocated to static storage can stay. */
3981 /* This is the pattern built in ada/make_aligning_type. */
3984 {
3987 }
3989 /* Fall through. */
4007 }
4008 }
4010 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4011 return a tree with all occurrences of references to F in a
4012 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4013 CONST_DECLs. Note that we assume here that EXP contains only
4014 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4015 occurring only in their argument list. */
4017 tree
4019 {
4022 tree new_tree;
4024 /* We handle TREE_LIST and COMPONENT_REF separately. */
4026 {
4033 }
4035 {
4036 tree inner;
4038 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4039 and it is the right field, replace it with R. */
4043 ;
4045 /* The field. */
4051 /* If this expression hasn't been completed let, leave it alone. */
4059 new_tree
4061 }
4062 else
4064 {
4071 else
4078 /* Fall through. */
4086 {
4131 new_tree
4137 }
4141 {
4146 /* If we are trying to replace F with a constant or with another
4147 instance of one of the arguments of the call, inline back
4148 functions which do nothing else than computing a value from
4149 the arguments they are passed. This makes it possible to
4150 fold partially or entirely the replacement expression. */
4152 {
4156 else
4159 {
4162 }
4164 {
4168 }
4169 }
4172 {
4176 {
4180 }
4181 }
4184 {
4188 }
4189 else
4191 }
4196 }
4204 }
4206 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4207 for it within OBJ, a tree that is an object or a chain of references. */
4209 tree
4211 {
4214 tree new_tree;
4216 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4217 in the chain of OBJ. */
4219 {
4221 tree elt;
4251 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4252 survives until RTL generation, there will be an error. */
4254 }
4256 /* TREE_LIST is special because we need to look at TREE_VALUE
4257 and TREE_CHAIN, not TREE_OPERANDS. */
4259 {
4266 }
4267 else
4269 {
4282 {
4327 new_tree
4333 }
4337 {
4343 {
4347 {
4351 }
4352 }
4355 {
4359 }
4360 else
4362 }
4367 }
4375 }
4376 \f
4378 /* Subroutine of stabilize_reference; this is called for subtrees of
4379 references. Any expression with side-effects must be put in a SAVE_EXPR
4380 to ensure that it is only evaluated once.
4382 We don't put SAVE_EXPR nodes around everything, because assigning very
4383 simple expressions to temporaries causes us to miss good opportunities
4384 for optimizations. Among other things, the opportunity to fold in the
4385 addition of a constant into an addressing mode often gets lost, e.g.
4386 "y[i+1] += x;". In general, we take the approach that we should not make
4387 an assignment unless we are forced into it - i.e., that any non-side effect
4388 operator should be allowed, and that cse should take care of coalescing
4389 multiple utterances of the same expression should that prove fruitful. */
4391 static tree
4393 {
4394 tree result;
4397 /* We cannot ignore const expressions because it might be a reference
4398 to a const array but whose index contains side-effects. But we can
4399 ignore things that are actual constant or that already have been
4400 handled by this function. */
4406 {
4408 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4409 have side-effects. */
4412 /* FALLTHRU */
4420 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4421 so that it will only be evaluated once. */
4422 /* The reference (r) and comparison (<) classes could be handled as
4423 below, but it is generally faster to only evaluate them once. */
4429 /* Constants need no processing. In fact, we should never reach
4430 here. */
4434 /* Division is slow and tends to be compiled with jumps,
4435 especially the division by powers of 2 that is often
4436 found inside of an array reference. So do it just once. */
4442 /* Recursively stabilize each operand. */
4448 /* Recursively stabilize each operand. */
4454 }
4462 }
4464 /* Stabilize a reference so that we can use it any number of times
4465 without causing its operands to be evaluated more than once.
4466 Returns the stabilized reference. This works by means of save_expr,
4467 so see the caveats in the comments about save_expr.
4469 Also allows conversion expressions whose operands are references.
4470 Any other kind of expression is returned unchanged. */
4472 tree
4474 {
4475 tree result;
4479 {
4483 /* No action is needed in this case. */
4486 CASE_CONVERT:
4525 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4526 it wouldn't be ignored. This matters when dealing with
4527 volatiles. */
4530 /* If arg isn't a kind of lvalue we recognize, make no change.
4531 Caller should recognize the error for an invalid lvalue. */
4537 }
4545 }
4546 \f
4547 /* Low-level constructors for expressions. */
4549 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4550 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4552 void
4554 {
4555 tree node;
4560 /* We started out assuming this address is both invariant and constant, but
4561 does not have side effects. Now go down any handled components and see if
4562 any of them involve offsets that are either non-constant or non-invariant.
4563 Also check for side-effects.
4565 ??? Note that this code makes no attempt to deal with the case where
4566 taking the address of something causes a copy due to misalignment. */
4568 #define UPDATE_FLAGS(NODE) \
4569 do { tree _node = (NODE); \
4570 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4571 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4575 {
4576 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4577 array reference (probably made temporarily by the G++ front end),
4578 so ignore all the operands. */
4582 {
4588 }
4589 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4590 FIELD_DECL, apparently. The G++ front end can put something else
4591 there, at least temporarily. */
4594 {
4597 }
4598 }
4602 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4603 the address, since &(*a)->b is a form of addition. If it's a constant, the
4604 address is constant too. If it's a decl, its address is constant if the
4605 decl is static. Everything else is not constant and, furthermore,
4606 taking the address of a volatile variable is not volatile. */
4611 ;
4614 else
4615 {
4618 }
4623 #undef UPDATE_FLAGS
4624 }
4626 /* Build an expression of code CODE, data type TYPE, and operands as
4627 specified. Expressions and reference nodes can be created this way.
4628 Constants, decls, types and misc nodes cannot be.
4630 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4631 enough for all extant tree codes. */
4633 tree
4635 {
4636 tree t;
4644 }
4646 tree
4648 {
4650 tree t;
4666 {
4669 }
4672 {
4675 }
4677 {
4679 /* All of these have side-effects, no matter what their
4680 operands are. */
4686 /* Whether a dereference is readonly has nothing to do with whether
4687 its operand is readonly. */
4705 }
4708 }
4710 #define PROCESS_ARG(N) \
4711 do { \
4712 TREE_OPERAND (t, N) = arg##N; \
4713 if (arg##N &&!TYPE_P (arg##N)) \
4714 { \
4715 if (TREE_SIDE_EFFECTS (arg##N)) \
4716 side_effects = 1; \
4717 if (!TREE_READONLY (arg##N) \
4718 && !CONSTANT_CLASS_P (arg##N)) \
4719 (void) (read_only = 0); \
4720 if (!TREE_CONSTANT (arg##N)) \
4721 (void) (constant = 0); \
4722 } \
4723 } while (0)
4725 tree
4727 {
4729 tree t;
4735 /* When sizetype precision doesn't match that of pointers
4736 we need to be able to build explicit extensions or truncations
4737 of the offset argument. */
4749 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4750 result based on those same flags for the arguments. But if the
4751 arguments aren't really even `tree' expressions, we shouldn't be trying
4752 to do this. */
4754 /* Expressions without side effects may be constant if their
4755 arguments are as well. */
4762 {
4776 }
4783 {
4785 {
4789 }
4790 }
4791 else
4792 {
4794 /* Don't mark X / 0 as constant. */
4799 }
4802 }
4805 tree
4807 tree arg2 MEM_STAT_DECL)
4808 {
4810 tree t;
4820 /* As a special exception, if COND_EXPR has NULL branches, we
4821 assume that it is a gimple statement and always consider
4822 it to have side effects. */
4828 else
4844 }
4846 tree
4849 {
4851 tree t;
4871 }
4873 tree
4876 {
4878 tree t;
4895 {
4897 {
4901 }
4902 }
4903 else
4909 }
4911 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4912 on the pointer PTR. */
4914 tree
4916 {
4919 tree tem;
4920 /* For convenience allow addresses that collapse to a simple base
4921 and offset. */
4925 {
4929 {
4932 }
4933 else
4936 }
4941 }
4943 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4945 poly_offset_int
4947 {
4949 SIGNED);
4950 }
4952 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4953 offsetted by OFFSET units. */
4955 tree
4957 {
4964 }
4966 /* Similar except don't specify the TREE_TYPE
4967 and leave the TREE_SIDE_EFFECTS as 0.
4968 It is permissible for arguments to be null,
4969 or even garbage if their values do not matter. */
4971 tree
4973 {
4974 tree t;
4991 }
4993 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4994 tree vec. */
4996 tree
4998 {
5008 }
5009 \f
5010 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5011 and data type TYPE.
5012 We do NOT enter this node in any sort of symbol table.
5014 LOC is the location of the decl.
5016 layout_decl is used to set up the decl's storage layout.
5017 Other slots are initialized to 0 or null pointers. */
5019 tree
5021 tree type MEM_STAT_DECL)
5022 {
5023 tree t;
5028 /* if (type == error_mark_node)
5029 type = integer_type_node; */
5030 /* That is not done, deliberately, so that having error_mark_node
5031 as the type can suppress useless errors in the use of this variable. */
5040 }
5042 /* Builds and returns function declaration with NAME and TYPE. */
5044 tree
5046 {
5056 }
5060 /* Builds a new translation-unit decl with name NAME, queues it in the
5061 global list of translation-unit decls and returns it. */
5063 tree
5065 {
5071 }
5073 \f
5074 /* BLOCK nodes are used to represent the structure of binding contours
5075 and declarations, once those contours have been exited and their contents
5076 compiled. This information is used for outputting debugging info. */
5078 tree
5080 {
5088 }
5090 \f
5091 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5093 LOC is the location to use in tree T. */
5095 void
5097 {
5100 }
5102 /* Data used when collecting DECLs and TYPEs for language data removal. */
5104 struct free_lang_data_d
5105 {
5108 /* Worklist to avoid excessive recursion. */
5111 /* Set of traversed objects. Used to avoid duplicate visits. */
5114 /* Array of symbols to process with free_lang_data_in_decl. */
5117 /* Array of types to process with free_lang_data_in_type. */
5119 };
5122 /* Add type or decl T to one of the list of tree nodes that need their
5123 language data removed. The lists are held inside FLD. */
5125 static void
5127 {
5132 else
5134 }
5136 /* Push tree node T into FLD->WORKLIST. */
5140 {
5143 }
5146 \f
5147 /* Return simplified TYPE_NAME of TYPE. */
5149 static tree
5151 {
5154 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5155 TYPE_DECL if the type doesn't have linkage.
5156 this must match fld_ */
5164 }
5166 /* Do same comparsion as check_qualified_type skipping lang part of type
5167 and be more permissive about type names: we only care that names are
5168 same (for diagnostics) and that ODR names are the same.
5169 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5171 static bool
5173 {
5175 /* We want to match incomplete variants with complete types.
5176 In this case we need to ignore alignment. */
5187 }
5189 /* Find variant of FIRST that match T and create new one if necessary.
5190 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5192 static tree
5195 {
5210 /* Variants of incomplete types should have alignment
5211 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5213 {
5216 }
5223 }
5225 /* Map complete types to incomplete types. */
5229 /* Map types to simplified types. */
5233 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5234 use MAP to prevent duplicates. */
5236 static tree
5239 {
5244 {
5245 return fld_type_variant
5249 }
5252 tree &array
5255 {
5261 }
5263 }
5265 /* Return CTX after removal of contexts that are not relevant */
5267 static tree
5269 {
5270 /* Variably modified types are needed for tree_is_indexable to decide
5271 whether the type needs to go to local or global section.
5272 This code is semi-broken but for now it is easiest to keep contexts
5273 as expected. */
5276 {
5279 }
5281 }
5283 /* For T being aggregate type try to turn it into a incomplete variant.
5284 Return T if no simplification is possible. */
5286 static tree
5288 {
5292 {
5295 {
5296 tree first;
5300 else
5308 }
5310 }
5319 {
5321 tree ©
5325 {
5328 /* It is possible that type was not seen by free_lang_data yet. */
5337 {
5343 }
5344 else
5347 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5348 This is needed for ODR violation warnings to come out right (we
5349 want duplicate TYPE_DECLs whenever the type is duplicated because
5350 of ODR violation. Because lang data in the TYPE_DECL may not
5351 have been freed yet, rebuild it from scratch and copy relevant
5352 fields. */
5357 {
5367 }
5368 }
5370 }
5373 }
5375 /* Simplify type T for scenarios where we do not need complete pointer
5376 types. */
5378 static tree
5380 {
5385 /* FIXME: This triggers verification error, see PR88140. */
5390 }
5392 /* Reset the expression *EXPR_P, a size or position.
5394 ??? We could reset all non-constant sizes or positions. But it's cheap
5395 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5397 We need to reset self-referential sizes or positions because they cannot
5398 be gimplified and thus can contain a CALL_EXPR after the gimplification
5399 is finished, which will run afoul of LTO streaming. And they need to be
5400 reset to something essentially dummy but not constant, so as to preserve
5401 the properties of the object they are attached to. */
5405 {
5409 }
5412 /* Reset all the fields in a binfo node BINFO. We only keep
5413 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5415 static void
5417 {
5419 tree t;
5431 }
5434 /* Reset all language specific information still present in TYPE. */
5436 static void
5438 {
5441 /* Give the FE a chance to remove its own data first. */
5454 /* Purge non-marked variants from the variants chain, so that they
5455 don't reappear in the IL after free_lang_data. */
5458 {
5461 /* Turn the removed types into distinct types. */
5464 }
5467 {
5469 /* Remove the const and volatile qualifiers from arguments. The
5470 C++ front end removes them, but the C front end does not,
5471 leading to false ODR violation errors when merging two
5472 instances of the same function signature compiled by
5473 different front ends. */
5475 {
5480 {
5482 & ~TYPE_QUAL_CONST
5487 }
5488 /* C++ FE uses TREE_PURPOSE to store initial values. */
5490 }
5491 }
5493 {
5496 {
5497 /* C++ FE uses TREE_PURPOSE to store initial values. */
5500 }
5501 }
5503 {
5504 /* Remove members that are not FIELD_DECLs from the field list
5505 of an aggregate. These occur in C++. */
5509 else
5515 {
5517 /* We need to preserve link to bases and virtual table for all
5518 polymorphic types to make devirtualization machinery working. */
5522 }
5523 }
5527 {
5529 {
5530 /* Type values are used only for C++ ODR checking. Drop them
5531 for all type variants and non-ODR types.
5532 For ODR types the data is freed in free_odr_warning_data. */
5536 else
5537 /* Simplify representation by recording only values rather
5538 than const decls. */
5542 }
5545 }
5554 {
5556 do
5557 {
5559 }
5562 }
5566 }
5569 /* Return true if DECL may need an assembler name to be set. */
5573 {
5574 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5575 Rule merging. This makes type_odr_p to return true on those types during
5576 LTO and by comparing the mangled name, we can say what types are intended
5577 to be equivalent across compilation unit.
5579 We do not store names of type_in_anonymous_namespace_p.
5581 Record, union and enumeration type have linkage that allows use
5582 to check type_in_anonymous_namespace_p. We do not mangle compound types
5583 that always can be compared structurally.
5585 Similarly for builtin types, we compare properties of their main variant.
5586 A special case are integer types where mangling do make differences
5587 between char/signed char/unsigned char etc. Storing name for these makes
5588 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5589 See cp/mangle.c:write_builtin_type for details. */
5592 {
5603 }
5604 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5608 /* If DECL already has its assembler name set, it does not need a
5609 new one. */
5614 /* Abstract decls do not need an assembler name. */
5618 /* For VAR_DECLs, only static, public and external symbols need an
5619 assembler name. */
5627 {
5628 /* Do not set assembler name on builtins. Allow RTL expansion to
5629 decide whether to expand inline or via a regular call. */
5634 /* Functions represented in the callgraph need an assembler name. */
5638 /* Unused and not public functions don't need an assembler name. */
5641 }
5644 }
5647 /* Reset all language specific information still present in symbol
5648 DECL. */
5650 static void
5652 {
5655 /* Give the FE a chance to remove its own data first. */
5669 {
5674 }
5677 {
5679 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5680 the address may be taken in other unit, so this flag has no practical
5681 use for middle-end.
5683 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5684 for public objects that indeed cannot be adressed, but it is not
5685 the case. Set the flag to true so we do not get merge failures for
5686 i.e. virtual tables between units that take address of it and
5687 units that don't. */
5693 {
5696 else
5697 {
5702 }
5703 }
5705 {
5706 tree t;
5708 /* If DECL has a gimple body, then the context for its
5709 arguments must be DECL. Otherwise, it doesn't really
5710 matter, as we will not be emitting any code for DECL. In
5711 general, there may be other instances of DECL created by
5712 the front end and since PARM_DECLs are generally shared,
5713 their DECL_CONTEXT changes as the replicas of DECL are
5714 created. The only time where DECL_CONTEXT is important
5715 is for the FUNCTION_DECLs that have a gimple body (since
5716 the PARM_DECL will be used in the function's body). */
5725 }
5727 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5728 At this point, it is not needed anymore. */
5731 /* Clear the abstract origin if it refers to a method.
5732 Otherwise dwarf2out.c will ICE as we splice functions out of
5733 TYPE_FIELDS and thus the origin will not be output
5734 correctly. */
5737 && RECORD_OR_UNION_TYPE_P
5742 }
5744 {
5745 /* See comment above why we set the flag for functoins. */
5752 }
5754 {
5765 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5766 }
5768 {
5771 }
5775 {
5776 /* Strip builtins from the translation-unit BLOCK. We still have targets
5777 without builtin_decl_explicit support and also builtins are shared
5778 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5781 {
5785 else
5787 }
5788 }
5789 /* We need to keep field decls associated with their trees. Otherwise tree
5790 merging may merge some fileds and keep others disjoint wich in turn will
5791 not do well with TREE_CHAIN pointers linking them.
5793 Also do not drop containing types for virtual methods and tables because
5794 these are needed by devirtualization.
5795 C++ destructors are special because C++ frontends sometimes produces
5796 virtual destructor as an alias of non-virtual destructor. In
5797 devirutalization code we always walk through aliases and we need
5798 context to be preserved too. See PR89335 */
5805 }
5808 /* Operand callback helper for free_lang_data_in_node. *TP is the
5809 subtree operand being considered. */
5811 static tree
5813 {
5820 /* Language specific nodes will be removed, so there is no need
5821 to gather anything under them. */
5823 {
5826 }
5829 {
5830 /* Note that walk_tree does not traverse every possible field in
5831 decls, so we have to do our own traversals here. */
5839 /* We are going to remove everything under DECL_INITIAL for
5840 TYPE_DECLs. No point walking them. */
5848 {
5851 }
5853 {
5858 }
5868 }
5870 {
5871 /* Note that walk_tree does not traverse every possible field in
5872 types, so we have to do our own traversals here. */
5883 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5884 lists, we may look types up in these lists and use them while
5885 optimizing the function body. Thus we need to free lang data
5886 in them. */
5893 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5897 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5898 do not and want not to reach unused variants this way. */
5900 {
5902 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5903 So push that instead. */
5907 }
5911 {
5913 tree tem;
5918 }
5920 {
5921 tree tem;
5922 /* Push all TYPE_FIELDS - there can be interleaving interesting
5923 and non-interesting things. */
5926 {
5930 }
5931 }
5937 }
5939 {
5941 {
5944 {
5948 }
5949 else
5950 {
5953 }
5954 }
5958 }
5965 }
5968 /* Find decls and types in T. */
5970 static void
5972 {
5974 {
5980 }
5981 }
5983 /* Translate all the types in LIST with the corresponding runtime
5984 types. */
5986 static tree
5988 {
5998 {
6003 }
6006 }
6009 /* Find decls and types referenced in EH region R and store them in
6010 FLD->DECLS and FLD->TYPES. */
6012 static void
6014 {
6016 {
6021 {
6022 eh_catch c;
6024 /* The types referenced in each catch must first be changed to the
6025 EH types used at runtime. This removes references to FE types
6026 in the region. */
6028 {
6031 }
6032 }
6045 }
6046 }
6049 /* Find decls and types referenced in cgraph node N and store them in
6050 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6051 look for *every* kind of DECL and TYPE node reachable from N,
6052 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6053 NAMESPACE_DECLs, etc). */
6055 static void
6057 {
6058 basic_block bb;
6061 tree t;
6072 /* Traverse locals. */
6076 /* Traverse EH regions in FN. */
6077 {
6078 eh_region r;
6081 }
6083 /* Traverse every statement in FN. */
6085 {
6086 gphi_iterator psi;
6087 gimple_stmt_iterator si;
6091 {
6095 {
6098 }
6099 }
6102 {
6109 {
6112 }
6113 }
6114 }
6115 }
6118 /* Find decls and types referenced in varpool node N and store them in
6119 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6120 look for *every* kind of DECL and TYPE node reachable from N,
6121 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6122 NAMESPACE_DECLs, etc). */
6124 static void
6126 {
6128 }
6130 /* If T needs an assembler name, have one created for it. */
6132 void
6134 {
6136 {
6137 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6138 diagnostics that use input_location to show locus
6139 information. The problem here is that, at this point,
6140 input_location is generally anchored to the end of the file
6141 (since the parser is long gone), so we don't have a good
6142 position to pin it to.
6144 To alleviate this problem, this uses the location of T's
6145 declaration. Examples of this are
6146 testsuite/g++.dg/template/cond2.C and
6147 testsuite/g++.dg/template/pr35240.C. */
6154 }
6155 }
6158 /* Free language specific information for every operand and expression
6159 in every node of the call graph. This process operates in three stages:
6161 1- Every callgraph node and varpool node is traversed looking for
6162 decls and types embedded in them. This is a more exhaustive
6163 search than that done by find_referenced_vars, because it will
6164 also collect individual fields, decls embedded in types, etc.
6166 2- All the decls found are sent to free_lang_data_in_decl.
6168 3- All the types found are sent to free_lang_data_in_type.
6170 The ordering between decls and types is important because
6171 free_lang_data_in_decl sets assembler names, which includes
6172 mangling. So types cannot be freed up until assembler names have
6173 been set up. */
6175 static void
6177 {
6180 tree t;
6184 /* Find decls and types in the body of every function in the callgraph. */
6191 /* Find decls and types in every varpool symbol. */
6195 /* Set the assembler name on every decl found. We need to do this
6196 now because free_lang_data_in_decl will invalidate data needed
6197 for mangling. This breaks mangling on interdependent decls. */
6201 /* Traverse every decl found freeing its language data. */
6205 /* Traverse every type found freeing its language data. */
6208 }
6211 /* Free resources that are used by FE but are not needed once they are done. */
6213 static unsigned
6215 {
6219 /* If we are the LTO frontend we have freed lang-specific data already. */
6222 {
6223 /* Rebuild type inheritance graph even when not doing LTO to get
6224 consistent profile data. */
6227 }
6232 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6236 /* Allocate and assign alias sets to the standard integer types
6237 while the slots are still in the way the frontends generated them. */
6242 /* Traverse the IL resetting language specific information for
6243 operands, expressions, etc. */
6246 /* Create gimple variants for common types. */
6252 /* Reset some langhooks. Do not reset types_compatible_p, it may
6253 still be used indirectly via the get_alias_set langhook. */
6266 {
6268 tree t;
6272 }
6274 /* We do not want the default decl_assembler_name implementation,
6275 rather if we have fixed everything we want a wrapper around it
6276 asserting that all non-local symbols already got their assembler
6277 name and only produce assembler names for local symbols. Or rather
6278 make sure we never call decl_assembler_name on local symbols and
6279 devise a separate, middle-end private scheme for it. */
6281 /* Reset diagnostic machinery. */
6290 }
6296 {
6306 };
6309 {
6313 {}
6315 /* opt_pass methods: */
6322 simple_ipa_opt_pass *
6324 {
6326 }
6327 \f
6328 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6329 of the various TYPE_QUAL values. */
6331 static void
6333 {
6339 }
6341 /* Returns true iff CAND and BASE have equivalent language-specific
6342 qualifiers. */
6344 bool
6346 {
6349 /* type_hash_eq currently only applies to these types. */
6354 }
6356 /* This function checks to see if TYPE matches the size one of the built-in
6357 atomic types, and returns that core atomic type. */
6359 static tree
6361 {
6362 tree base_atomic_type;
6364 /* Only handle complete types. */
6369 {
6392 }
6395 }
6397 /* Returns true iff unqualified CAND and BASE are equivalent. */
6399 bool
6401 {
6403 /* Apparently this is needed for Objective-C. */
6408 /* Check alignment. */
6411 /* Atomic types increase minimal alignment. We must to do so as well
6412 or we get duplicated canonical types. See PR88686. */
6414 {
6415 /* See if this object can map to a basic atomic type. */
6419 }
6421 }
6423 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6425 bool
6427 {
6431 }
6433 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6435 static bool
6437 {
6440 /* Apparently this is needed for Objective-C. */
6442 /* Check alignment. */
6447 }
6449 /* Return a version of the TYPE, qualified as indicated by the
6450 TYPE_QUALS, if one exists. If no qualified version exists yet,
6451 return NULL_TREE. */
6453 tree
6455 {
6463 /* Search the chain of variants to see if there is already one there just
6464 like the one we need to have. If so, use that existing one. We must
6465 preserve the TYPE_NAME, since there is code that depends on this. */
6468 {
6469 /* Put the found variant at the head of the variant list so
6470 frequently searched variants get found faster. The C++ FE
6471 benefits greatly from this. */
6477 }
6480 }
6482 /* Like get_qualified_type, but creates the type if it does not
6483 exist. This function never returns NULL_TREE. */
6485 tree
6487 {
6488 tree t;
6490 /* See if we already have the appropriate qualified variant. */
6493 /* If not, build it. */
6495 {
6500 {
6501 /* See if this object can map to a basic atomic type. */
6504 {
6505 /* Ensure the alignment of this type is compatible with
6506 the required alignment of the atomic type. */
6509 }
6510 }
6513 /* Propagate structural equality. */
6516 /* Build the underlying canonical type, since it is different
6517 from TYPE. */
6518 {
6521 }
6522 else
6523 /* T is its own canonical type. */
6526 }
6529 }
6531 /* Create a variant of type T with alignment ALIGN. */
6533 tree
6535 {
6536 tree t;
6551 }
6553 /* Create a new distinct copy of TYPE. The new type is made its own
6554 MAIN_VARIANT. If TYPE requires structural equality checks, the
6555 resulting type requires structural equality checks; otherwise, its
6556 TYPE_CANONICAL points to itself. */
6558 tree
6560 {
6566 /* Set the canonical type either to a new equivalence class, or
6567 propagate the need for structural equality checks. */
6570 else
6573 /* Make it its own variant. */
6577 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6578 whose TREE_TYPE is not t. This can also happen in the Ada
6579 frontend when using subtypes. */
6582 }
6584 /* Create a new variant of TYPE, equivalent but distinct. This is so
6585 the caller can modify it. TYPE_CANONICAL for the return type will
6586 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6587 are considered equal by the language itself (or that both types
6588 require structural equality checks). */
6590 tree
6592 {
6597 /* Since we're building a variant, assume that it is a non-semantic
6598 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6600 /* Type variants have no alias set defined. */
6603 /* Add the new type to the chain of variants of TYPE. */
6609 }
6610 \f
6611 /* Return true if the from tree in both tree maps are equal. */
6613 int
6615 {
6619 }
6621 /* Hash a from tree in a tree_base_map. */
6623 unsigned int
6625 {
6627 }
6629 /* Return true if this tree map structure is marked for garbage collection
6630 purposes. We simply return true if the from tree is marked, so that this
6631 structure goes away when the from tree goes away. */
6633 int
6635 {
6637 }
6639 /* Hash a from tree in a tree_map. */
6641 unsigned int
6643 {
6645 }
6647 /* Hash a from tree in a tree_decl_map. */
6649 unsigned int
6651 {
6653 }
6655 /* Return the initialization priority for DECL. */
6657 priority_type
6659 {
6664 return
6666 }
6668 /* Return the finalization priority for DECL. */
6670 priority_type
6672 {
6677 return
6679 }
6681 /* Set the initialization priority for DECL to PRIORITY. */
6683 void
6685 {
6689 {
6693 }
6696 else
6699 }
6701 /* Set the finalization priority for DECL to PRIORITY. */
6703 void
6705 {
6709 {
6713 }
6714 else
6717 }
6719 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6721 static void
6723 {
6728 }
6730 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6732 static void
6734 {
6739 }
6741 /* Lookup a debug expression for FROM, and return it if we find one. */
6743 tree
6745 {
6753 }
6755 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6757 void
6759 {
6766 }
6768 /* Lookup a value expression for FROM, and return it if we find one. */
6770 tree
6772 {
6780 }
6782 /* Insert a mapping FROM->TO in the value expression hashtable. */
6784 void
6786 {
6793 }
6795 /* Lookup a vector of debug arguments for FROM, and return it if we
6796 find one. */
6800 {
6811 }
6813 /* Insert a mapping FROM->empty vector of debug arguments in the value
6814 expression hashtable. */
6818 {
6833 }
6835 /* Hashing of types so that we don't make duplicates.
6836 The entry point is `type_hash_canon'. */
6838 /* Generate the default hash code for TYPE. This is designed for
6839 speed, rather than maximum entropy. */
6841 hashval_t
6843 {
6852 /* Just the identifier is adequate to distinguish. */
6856 {
6859 /* FALLTHROUGH. */
6871 {
6875 {
6878 }
6879 }
6883 {
6890 }
6894 {
6898 }
6906 }
6909 }
6911 /* These are the Hashtable callback functions. */
6913 /* Returns true iff the types are equivalent. */
6915 bool
6917 {
6918 /* First test the things that are the same for all types. */
6928 /* Be careful about comparing arrays before and after the element type
6929 has been completed; don't compare TYPE_ALIGN unless both types are
6930 complete. */
6937 {
6959 /* fall through */
6991 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6992 where the flag should be inherited from the element type
6993 and can change after ARRAY_TYPEs are created; on non-aggregates
6994 compare it and hash it, scalars will never have that flag set
6995 and we need to differentiate between arrays created by different
6996 front-ends or middle-end created arrays. */
7026 }
7032 }
7034 /* Given TYPE, and HASHCODE its hash code, return the canonical
7035 object for an identical type if one already exists.
7036 Otherwise, return TYPE, and record it as the canonical object.
7038 To use this function, first create a type of the sort you want.
7039 Then compute its hash code from the fields of the type that
7040 make it different from other similar types.
7041 Then call this function and use the value. */
7043 tree
7045 {
7046 type_hash in;
7049 /* The hash table only contains main variants, so ensure that's what we're
7050 being passed. */
7053 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7054 must call that routine before comparing TYPE_ALIGNs. */
7062 {
7068 /* Free also min/max values and the cache for integer
7069 types. This can't be done in free_node, as LTO frees
7070 those on its own. */
7072 {
7075 {
7076 /* Zero is always in TYPE_CACHED_VALUES. */
7080 }
7083 {
7086 }
7089 }
7092 }
7093 else
7094 {
7103 }
7104 }
7106 static void
7108 {
7113 }
7115 /* Given two lists of types
7116 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7117 return 1 if the lists contain the same types in the same order.
7118 Also, the TREE_PURPOSEs must match. */
7120 bool
7122 {
7134 }
7136 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7137 given by TYPE. If the argument list accepts variable arguments,
7138 then this function counts only the ordinary arguments. */
7140 int
7142 {
7146 /* If the function does not take a variable number of arguments,
7147 the last element in the list will have type `void'. */
7150 else
7154 }
7156 /* Return the type of the function TYPE's argument ARGNO if known.
7157 For vararg function's where ARGNO refers to one of the variadic
7158 arguments return null. Otherwise, return a void_type_node for
7159 out-of-bounds ARGNO. */
7161 tree
7163 {
7164 /* Treat zero the same as an out-of-bounds argument number. */
7168 function_args_iterator iter;
7170 tree argtype;
7173 {
7174 /* A vararg function's argument list ends in a null. Otherwise,
7175 an ordinary function's argument list ends with void. Return
7176 null if ARGNO refers to a vararg argument, void_type_node if
7177 it's out of bounds, and the formal argument type otherwise. */
7185 }
7188 }
7190 /* Nonzero if integer constants T1 and T2
7191 represent the same constant value. */
7193 int
7195 {
7211 }
7213 /* Return true if T is an INTEGER_CST whose numerical value (extended
7214 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7216 bool
7218 {
7222 }
7224 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7225 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7227 bool
7229 {
7233 {
7238 }
7241 }
7243 /* Return true if T is an INTEGER_CST whose numerical value (extended
7244 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7246 bool
7248 {
7252 }
7254 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7255 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7257 bool
7259 {
7263 {
7268 }
7271 }
7273 /* T is an INTEGER_CST whose numerical value (extended according to
7274 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7275 HOST_WIDE_INT. */
7277 HOST_WIDE_INT
7279 {
7282 }
7284 /* T is an INTEGER_CST whose numerical value (extended according to
7285 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7286 HOST_WIDE_INT. */
7288 unsigned HOST_WIDE_INT
7290 {
7293 }
7295 /* Return the most significant (sign) bit of T. */
7297 int
7299 {
7303 }
7305 /* Return an indication of the sign of the integer constant T.
7306 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7307 Note that -1 will never be returned if T's type is unsigned. */
7309 int
7311 {
7318 else
7320 }
7322 /* Return the minimum number of bits needed to represent VALUE in a
7323 signed or unsigned type, UNSIGNEDP says which. */
7325 unsigned int
7327 {
7328 /* If the value is negative, compute its negative minus 1. The latter
7329 adjustment is because the absolute value of the largest negative value
7330 is one larger than the largest positive value. This is equivalent to
7331 a bit-wise negation, so use that operation instead. */
7336 /* Return the number of bits needed, taking into account the fact
7337 that we need one more bit for a signed than unsigned type.
7338 If value is 0 or -1, the minimum precision is 1 no matter
7339 whether unsignedp is true or false. */
7343 else
7345 }
7347 /* Return truthvalue of whether T1 is the same tree structure as T2.
7348 Return 1 if they are the same.
7349 Return 0 if they are understandably different.
7350 Return -1 if either contains tree structure not understood by
7351 this function. */
7353 int
7355 {
7365 /* For location wrappers to be the same, they must be at the same
7366 source location (and wrap the same thing). */
7368 {
7372 }
7378 {
7382 else
7384 }
7394 {
7410 {
7419 /* ??? Should we handle also fields here? */
7423 }
7434 {
7442 {
7446 }
7448 }
7451 /* Special case: if either target is an unallocated VAR_DECL,
7452 it means that it's going to be unified with whatever the
7453 TARGET_EXPR is really supposed to initialize, so treat it
7454 as being equivalent to anything. */
7462 else
7491 /* A false return means maybe_ne rather than known_ne. */
7497 }
7499 /* This general rule works for most tree codes. All exceptions should be
7500 handled above. If this is a language-specific tree code, we can't
7501 trust what might be in the operand, so say we don't know
7502 the situation. */
7507 {
7516 {
7520 }
7526 }
7527 }
7529 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7530 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7531 than U, respectively. */
7533 int
7535 {
7544 else
7546 }
7548 /* Return true if SIZE represents a constant size that is in bounds of
7549 what the middle-end and the backend accepts (covering not more than
7550 half of the address-space).
7551 When PERR is non-null, set *PERR on failure to the description of
7552 why SIZE is not valid. */
7554 bool
7556 {
7558 {
7565 }
7567 cst_size_error error;
7572 {
7575 }
7578 {
7581 }
7584 {
7587 }
7591 {
7594 }
7597 }
7599 /* Return the precision of the type, or for a complex or vector type the
7600 precision of the type of its elements. */
7602 unsigned int
7604 {
7612 }
7614 /* Return true if CODE represents an associative tree code. Otherwise
7615 return false. */
7616 bool
7618 {
7620 {
7632 }
7634 }
7636 /* Return true if CODE represents a commutative tree code. Otherwise
7637 return false. */
7638 bool
7640 {
7642 {
7669 }
7671 }
7673 /* Return true if CODE represents a ternary tree code for which the
7674 first two operands are commutative. Otherwise return false. */
7675 bool
7677 {
7679 {
7687 }
7689 }
7691 /* Returns true if CODE can overflow. */
7693 bool
7695 {
7697 {
7702 /* Can overflow in various ways. */
7708 /* For INT_MIN / -1. */
7712 /* For -INT_MIN. */
7715 /* These operators cannot overflow. */
7717 }
7718 }
7720 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7721 ftrapv doesn't generate trapping insns for CODE. */
7723 bool
7725 {
7728 /* We don't generate instructions that trap on overflow for complex or vector
7729 types. */
7737 {
7743 /* These operators can overflow, and -ftrapv generates trapping code for
7744 these. */
7751 /* These operators can overflow, but -ftrapv does not generate trapping
7752 code for these. */
7755 /* These operators cannot overflow. */
7757 }
7758 }
7760 namespace inchash
7761 {
7763 /* Generate a hash value for an expression. This can be used iteratively
7764 by passing a previous result as the HSTATE argument.
7766 This function is intended to produce the same hash for expressions which
7767 would compare equal using operand_equal_p. */
7768 void
7770 {
7776 {
7779 }
7789 {
7790 /* Alas, constants aren't shared, so we can't rely on pointer
7791 identity. */
7801 {
7805 else
7809 }
7811 {
7815 }
7825 {
7832 }
7834 /* We can just compare by pointer. */
7838 /* The node itself doesn't matter. */
7842 /* Ignore. */
7845 /* A list of expressions, for a CALL_EXPR or as the elements of a
7846 VECTOR_CST. */
7851 {
7856 {
7859 }
7861 }
7863 {
7864 tree_stmt_iterator i;
7869 }
7878 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7879 Otherwise nodes that compare equal according to operand_equal_p might
7880 get different hash codes. However, don't do this for machine specific
7881 or front end builtins, since the function code is overloaded in those
7882 cases. */
7885 {
7888 }
7889 /* FALL THROUGH */
7892 {
7896 }
7900 {
7901 /* DECL's have a unique ID */
7903 }
7905 {
7906 /* For comparisons that can be swapped, use the lower
7907 tree code. */
7914 }
7916 {
7917 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7918 operand_equal_p. */
7922 /* Don't hash the type, that can lead to having nodes which
7923 compare equal according to operand_equal_p, but which
7924 have different hash codes. Make sure to include signedness
7925 in the hash computation. */
7928 }
7929 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7937 /* Don't ICE on FE specific trees, or their arguments etc.
7938 during operand_equal_p hash verification. */
7941 else
7942 {
7948 {
7975 {
7976 /* The multiplication operands are commutative. */
7983 }
7991 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7992 Usually different TARGET_EXPRs just should use
7993 different temporaries in their slots. */
7999 }
8001 /* Don't hash the type, that can lead to having nodes which
8002 compare equal according to operand_equal_p, but which
8003 have different hash codes. */
8005 {
8006 /* Make sure to include signness in the hash computation. */
8009 }
8012 {
8013 /* It's a commutative expression. We want to hash it the same
8014 however it appears. We do this by first hashing both operands
8015 and then rehashing based on the order of their independent
8016 hashes. */
8021 }
8022 else
8026 }
8028 }
8029 }
8031 }
8033 /* Constructors for pointer, array and function types.
8034 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8035 constructed by language-dependent code, not here.) */
8037 /* Construct, lay out and return the type of pointers to TO_TYPE with
8038 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8039 reference all of memory. If such a type has already been
8040 constructed, reuse it. */
8042 tree
8045 {
8046 tree t;
8052 /* If the pointed-to type has the may_alias attribute set, force
8053 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8057 /* In some cases, languages will have things that aren't a POINTER_TYPE
8058 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8059 In that case, return that type without regard to the rest of our
8060 operands.
8062 ??? This is a kludge, but consistent with the way this function has
8063 always operated and there doesn't seem to be a good way to avoid this
8064 at the moment. */
8069 /* First, if we already have a type for pointers to TO_TYPE and it's
8070 the proper mode, use it. */
8083 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8091 /* Lay out the type. This function has many callers that are concerned
8092 with expression-construction, and this simplifies them all. */
8096 }
8098 /* By default build pointers in ptr_mode. */
8100 tree
8102 {
8107 }
8109 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8111 tree
8114 {
8115 tree t;
8121 /* If the pointed-to type has the may_alias attribute set, force
8122 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8126 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8127 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8128 In that case, return that type without regard to the rest of our
8129 operands.
8131 ??? This is a kludge, but consistent with the way this function has
8132 always operated and there doesn't seem to be a good way to avoid this
8133 at the moment. */
8138 /* First, if we already have a type for pointers to TO_TYPE and it's
8139 the proper mode, use it. */
8152 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8163 }
8166 /* Build the node for the type of references-to-TO_TYPE by default
8167 in ptr_mode. */
8169 tree
8171 {
8176 }
8178 #define MAX_INT_CACHED_PREC \
8179 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8182 /* Builds a signed or unsigned integer type of precision PRECISION.
8183 Used for C bitfields whose precision does not match that of
8184 built-in target types. */
8185 tree
8188 {
8195 {
8199 }
8206 else
8218 }
8220 #define MAX_BOOL_CACHED_PREC \
8221 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8224 /* Builds a boolean type of precision PRECISION.
8225 Used for boolean vectors to choose proper vector element size. */
8226 tree
8228 {
8229 tree type;
8232 {
8236 }
8246 }
8248 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8249 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8250 is true, reuse such a type that has already been constructed. */
8252 static tree
8254 {
8277 {
8278 /* Since we cannot reliably merge this type, we need to compare it using
8279 structural equality checks. */
8282 }
8288 }
8290 /* Wrapper around build_range_type_1 with SHARED set to true. */
8292 tree
8294 {
8296 }
8298 /* Wrapper around build_range_type_1 with SHARED set to false. */
8300 tree
8302 {
8304 }
8306 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8307 MAXVAL should be the maximum value in the domain
8308 (one less than the length of the array).
8310 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8311 We don't enforce this limit, that is up to caller (e.g. language front end).
8312 The limit exists because the result is a signed type and we don't handle
8313 sizes that use more than one HOST_WIDE_INT. */
8315 tree
8317 {
8319 }
8321 /* Return true if the debug information for TYPE, a subtype, should be emitted
8322 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8323 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8324 debug info and doesn't reflect the source code. */
8326 bool
8328 {
8331 /* Subrange types have a base type which is an integral type. */
8335 /* Get the real bounds of the subtype. */
8338 else
8339 {
8342 }
8344 /* If the type and its base type have the same representation and the same
8345 name, then the type is not a subrange but a copy of the base type. */
8359 }
8361 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8362 and number of elements specified by the range of values of INDEX_TYPE.
8363 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8364 If SHARED is true, reuse such a type that has already been constructed. */
8366 static tree
8369 {
8370 tree t;
8373 {
8376 }
8385 /* If the element type is incomplete at this point we get marked for
8386 structural equality. Do not record these types in the canonical
8387 type hashtable. */
8392 {
8395 }
8398 {
8407 index_type
8410 }
8413 }
8415 /* Wrapper around build_array_type_1 with SHARED set to true. */
8417 tree
8419 {
8421 }
8423 /* Wrapper around build_array_type_1 with SHARED set to false. */
8425 tree
8427 {
8429 }
8431 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8432 sizetype. */
8434 tree
8436 {
8438 }
8440 /* Recursively examines the array elements of TYPE, until a non-array
8441 element type is found. */
8443 tree
8445 {
8450 }
8452 /* Computes the canonical argument types from the argument type list
8453 ARGTYPES.
8455 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8456 on entry to this function, or if any of the ARGTYPES are
8457 structural.
8459 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8460 true on entry to this function, or if any of the ARGTYPES are
8461 non-canonical.
8463 Returns a canonical argument list, which may be ARGTYPES when the
8464 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8465 true) or would not differ from ARGTYPES. */
8467 static tree
8471 {
8472 tree arg;
8476 {
8478 /* Fail gracefully by stating that the type is structural. */
8484 /* If the argument has a default argument, we consider it
8485 non-canonical even though the type itself is canonical.
8486 That way, different variants of function and method types
8487 with default arguments will all point to the variant with
8488 no defaults as their canonical type. */
8490 }
8496 {
8497 /* Build the canonical list of argument types. */
8502 {
8505 else
8508 canon_argtypes);
8509 }
8515 /* There is a non-canonical type. */
8518 }
8520 /* The canonical argument types are the same as ARGTYPES. */
8522 }
8524 /* Construct, lay out and return
8525 the type of functions returning type VALUE_TYPE
8526 given arguments of types ARG_TYPES.
8527 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8528 are data type nodes for the arguments of the function.
8529 If such a type has already been constructed, reuse it. */
8531 tree
8533 {
8534 tree t;
8537 tree canon_argtypes;
8542 {
8545 }
8547 /* Make a node of the sort we want. */
8552 /* If we already have such a type, use the old one. */
8556 /* Set up the canonical type. */
8566 canon_argtypes);
8571 }
8573 /* Build a function type. The RETURN_TYPE is the type returned by the
8574 function. If VAARGS is set, no void_type_node is appended to the
8575 list. ARGP must be always be terminated be a NULL_TREE. */
8577 static tree
8579 {
8587 {
8592 }
8595 else
8596 {
8600 }
8604 }
8606 /* Build a function type. The RETURN_TYPE is the type returned by the
8607 function. If additional arguments are provided, they are
8608 additional argument types. The list of argument types must always
8609 be terminated by NULL_TREE. */
8611 tree
8613 {
8614 tree args;
8621 }
8623 /* Build a variable argument function type. The RETURN_TYPE is the
8624 type returned by the function. If additional arguments are provided,
8625 they are additional argument types. The list of argument types must
8626 always be terminated by NULL_TREE. */
8628 tree
8630 {
8631 tree args;
8639 }
8641 /* Build a function type. RETURN_TYPE is the type returned by the
8642 function; VAARGS indicates whether the function takes varargs. The
8643 function takes N named arguments, the types of which are provided in
8644 ARG_TYPES. */
8646 static tree
8649 {
8657 }
8659 /* Build a function type. RETURN_TYPE is the type returned by the
8660 function. The function takes N named arguments, the types of which
8661 are provided in ARG_TYPES. */
8663 tree
8665 {
8667 }
8669 /* Build a variable argument function type. RETURN_TYPE is the type
8670 returned by the function. The function takes N named arguments, the
8671 types of which are provided in ARG_TYPES. */
8673 tree
8675 {
8677 }
8679 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8680 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8681 for the method. An implicit additional parameter (of type
8682 pointer-to-BASETYPE) is added to the ARGTYPES. */
8684 tree
8686 tree rettype,
8687 tree argtypes)
8688 {
8689 tree t;
8690 tree ptype;
8692 tree canon_argtypes;
8694 /* Make a node of the sort we want. */
8701 /* The actual arglist for this function includes a "hidden" argument
8702 which is "this". Put it into the list of argument types. */
8706 /* If we already have such a type, use the old one. */
8710 /* Set up the canonical type. */
8711 any_structural_p
8714 any_noncanonical_p
8726 canon_argtypes);
8731 }
8733 /* Construct, lay out and return the type of methods belonging to class
8734 BASETYPE and whose arguments and values are described by TYPE.
8735 If that type exists already, reuse it.
8736 TYPE must be a FUNCTION_TYPE node. */
8738 tree
8740 {
8746 }
8748 /* Construct, lay out and return the type of offsets to a value
8749 of type TYPE, within an object of type BASETYPE.
8750 If a suitable offset type exists already, reuse it. */
8752 tree
8754 {
8755 tree t;
8757 /* Make a node of the sort we want. */
8763 /* If we already have such a type, use the old one. */
8771 {
8780 }
8783 }
8785 /* Create a complex type whose components are COMPONENT_TYPE.
8787 If NAMED is true, the type is given a TYPE_NAME. We do not always
8788 do so because this creates a DECL node and thus make the DECL_UIDs
8789 dependent on the type canonicalization hashtable, which is GC-ed,
8790 so the DECL_UIDs would not be stable wrt garbage collection. */
8792 tree
8794 {
8799 /* Make a node of the sort we want. */
8804 /* If we already have such a type, use the old one. */
8809 {
8810 /* We created a new type. The hash insertion will have laid
8811 out the type. We need to check the canonicalization and
8812 maybe set the name. */
8823 /* We need to create a name, since complex is a fundamental type. */
8825 {
8854 }
8855 }
8858 }
8860 /* If TYPE is a real or complex floating-point type and the target
8861 does not directly support arithmetic on TYPE then return the wider
8862 type to be used for arithmetic on TYPE. Otherwise, return
8863 NULL_TREE. */
8865 tree
8867 {
8868 /* The target can give two different responses to the question of
8869 which excess precision mode it would like depending on whether we
8870 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8872 enum excess_precision_type requested_type
8874 ? EXCESS_PRECISION_TYPE_FAST
8877 enum flt_eval_method target_flt_eval_method
8880 /* The target should not ask for unpredictable float evaluation (though
8881 it might advertise that implicitly the evaluation is unpredictable,
8882 but we don't care about that here, it will have been reported
8883 elsewhere). If it does ask for unpredictable evaluation, we have
8884 nothing to do here. */
8887 /* Nothing to do. The target has asked for all types we know about
8888 to be computed with their native precision and range. */
8892 /* The target will promote this type in a target-dependent way, so excess
8893 precision ought to leave it alone. */
8897 machine_mode float16_type_mode = (float16_type_node
8904 {
8906 {
8909 {
8927 }
8929 }
8931 {
8936 {
8954 }
8956 }
8959 }
8962 }
8963 \f
8964 /* Return OP, stripped of any conversions to wider types as much as is safe.
8965 Converting the value back to OP's type makes a value equivalent to OP.
8967 If FOR_TYPE is nonzero, we return a value which, if converted to
8968 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8970 OP must have integer, real or enumeral type. Pointers are not allowed!
8972 There are some cases where the obvious value we could return
8973 would regenerate to OP if converted to OP's type,
8974 but would not extend like OP to wider types.
8975 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8976 For example, if OP is (unsigned short)(signed char)-1,
8977 we avoid returning (signed char)-1 if FOR_TYPE is int,
8978 even though extending that to an unsigned short would regenerate OP,
8979 since the result of extending (signed char)-1 to (int)
8980 is different from (int) OP. */
8982 tree
8984 {
8985 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8987 unsigned final_prec
8989 int uns
8996 {
8999 /* TYPE_PRECISION on vector types has different meaning
9000 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
9001 so avoid them here. */
9008 /* Truncations are many-one so cannot be removed.
9009 Unless we are later going to truncate down even farther. */
9014 /* See what's inside this conversion. If we decide to strip it,
9015 we will set WIN. */
9018 /* If we have not stripped any zero-extensions (uns is 0),
9019 we can strip any kind of extension.
9020 If we have previously stripped a zero-extension,
9021 only zero-extensions can safely be stripped.
9022 Any extension can be stripped if the bits it would produce
9023 are all going to be discarded later by truncating to FOR_TYPE. */
9026 {
9029 /* TYPE_UNSIGNED says whether this is a zero-extension.
9030 Let's avoid computing it if it does not affect WIN
9031 and if UNS will not be needed again. */
9035 {
9038 }
9039 }
9040 }
9042 /* If we finally reach a constant see if it fits in sth smaller and
9043 in that case convert it. */
9045 {
9051 {
9055 }
9056 }
9059 }
9060 \f
9061 /* Return OP or a simpler expression for a narrower value
9062 which can be sign-extended or zero-extended to give back OP.
9063 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
9064 or 0 if the value should be sign-extended. */
9066 tree
9068 {
9075 {
9076 int bitschange
9080 /* Truncations are many-one so cannot be removed. */
9084 /* See what's inside this conversion. If we decide to strip it,
9085 we will set WIN. */
9088 {
9090 /* An extension: the outermost one can be stripped,
9091 but remember whether it is zero or sign extension. */
9094 /* Otherwise, if a sign extension has been stripped,
9095 only sign extensions can now be stripped;
9096 if a zero extension has been stripped, only zero-extensions. */
9100 }
9102 {
9103 /* A change in nominal type can always be stripped, but we must
9104 preserve the unsignedness. */
9109 /* Keep trying to narrow, but don't assign op to win if it
9110 would turn an integral type into something else. */
9113 }
9116 }
9119 /* Since type_for_size always gives an integer type. */
9122 /* Ensure field is laid out already. */
9125 {
9126 unsigned HOST_WIDE_INT innerprec
9132 /* We can get this structure field in a narrower type that fits it,
9133 but the resulting extension to its nominal type (a fullword type)
9134 must satisfy the same conditions as for other extensions.
9136 Do this only for fields that are aligned (not bit-fields),
9137 because when bit-field insns will be used there is no
9138 advantage in doing this. */
9144 {
9148 }
9149 }
9153 }
9154 \f
9155 /* Return true if integer constant C has a value that is permissible
9156 for TYPE, an integral type. */
9158 bool
9160 {
9165 /* Non-standard boolean types can have arbitrary precision but various
9166 transformations assume that they can only take values 0 and +/-1. */
9170 retry:
9174 /* If at least one bound of the type is a constant integer, we can check
9175 ourselves and maybe make a decision. If no such decision is possible, but
9176 this type is a subtype, try checking against that. Otherwise, use
9177 fits_to_tree_p, which checks against the precision.
9179 Compute the status for each possibly constant bound, and return if we see
9180 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9181 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9182 for "constant known to fit". */
9184 /* Check if c >= type_low_bound. */
9186 {
9190 }
9191 else
9194 /* Check if c <= type_high_bound. */
9196 {
9200 }
9201 else
9204 /* If the constant fits both bounds, the result is known. */
9208 /* Perform some generic filtering which may allow making a decision
9209 even if the bounds are not constant. First, negative integers
9210 never fit in unsigned types, */
9214 /* Second, narrower types always fit in wider ones. */
9218 /* Third, unsigned integers with top bit set never fit signed types. */
9220 {
9223 {
9224 /* When a tree_cst is converted to a wide-int, the precision
9225 is taken from the type. However, if the precision of the
9226 mode underneath the type is smaller than that, it is
9227 possible that the value will not fit. The test below
9228 fails if any bit is set between the sign bit of the
9229 underlying mode and the top bit of the type. */
9232 }
9235 }
9237 /* If we haven't been able to decide at this point, there nothing more we
9238 can check ourselves here. Look at the base type if we have one and it
9239 has the same precision. */
9243 {
9246 }
9248 /* Or to fits_to_tree_p, if nothing else. */
9250 }
9252 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9253 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9254 represented (assuming two's-complement arithmetic) within the bit
9255 precision of the type are returned instead. */
9257 void
9259 {
9263 else
9264 {
9267 else
9268 {
9271 }
9272 }
9277 else
9278 {
9281 }
9282 }
9284 /* Return true if VAR is an automatic variable. */
9286 bool
9288 {
9293 }
9295 /* Return true if VAR is an automatic variable defined in function FN. */
9297 bool
9299 {
9303 }
9305 /* Subprogram of following function. Called by walk_tree.
9307 Return *TP if it is an automatic variable or parameter of the
9308 function passed in as DATA. */
9310 static tree
9312 {
9323 }
9325 /* Returns true if T is, contains, or refers to a type with variable
9326 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9327 arguments, but not the return type. If FN is nonzero, only return
9328 true if a modifier of the type or position of FN is a variable or
9329 parameter inside FN.
9331 This concept is more general than that of C99 'variably modified types':
9332 in C99, a struct type is never variably modified because a VLA may not
9333 appear as a structure member. However, in GNU C code like:
9335 struct S { int i[f()]; };
9337 is valid, and other languages may define similar constructs. */
9339 bool
9341 {
9342 tree t;
9344 /* Test if T is either variable (if FN is zero) or an expression containing
9345 a variable in FN. If TYPE isn't gimplified, return true also if
9346 gimplify_one_sizepos would gimplify the expression into a local
9347 variable. */
9348 #define RETURN_TRUE_IF_VAR(T) \
9349 do { tree _t = (T); \
9350 if (_t != NULL_TREE \
9351 && _t != error_mark_node \
9352 && !CONSTANT_CLASS_P (_t) \
9353 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9354 && (!fn \
9355 || (!TYPE_SIZES_GIMPLIFIED (type) \
9356 && (TREE_CODE (_t) != VAR_DECL \
9357 && !CONTAINS_PLACEHOLDER_P (_t))) \
9358 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9359 return true; } while (0)
9364 /* If TYPE itself has variable size, it is variably modified. */
9369 {
9373 /* Ada can have pointer types refering to themselves indirectly. */
9378 {
9381 }
9387 /* If TYPE is a function type, it is variably modified if the
9388 return type is variably modified. */
9398 /* Scalar types are variably modified if their end points
9399 aren't constant. */
9407 /* We can't see if any of the fields are variably-modified by the
9408 definition we normally use, since that would produce infinite
9409 recursion via pointers. */
9410 /* This is variably modified if some field's type is. */
9413 {
9420 }
9424 /* Do not call ourselves to avoid infinite recursion. This is
9425 variably modified if the element type is. */
9432 }
9434 /* The current language may have other cases to check, but in general,
9435 all other types are not variably modified. */
9438 #undef RETURN_TRUE_IF_VAR
9439 }
9441 /* Given a DECL or TYPE, return the scope in which it was declared, or
9442 NULL_TREE if there is no containing scope. */
9444 tree
9446 {
9448 }
9450 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9452 const_tree
9454 {
9456 {
9459 else
9461 }
9463 }
9465 /* Return the innermost context enclosing DECL that is
9466 a FUNCTION_DECL, or zero if none. */
9468 tree
9470 {
9471 tree context;
9476 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9477 where we look up the function at runtime. Such functions always take
9478 a first argument of type 'pointer to real context'.
9480 C++ should really be fixed to use DECL_CONTEXT for the real context,
9481 and use something else for the "virtual context". */
9483 context
9484 = TYPE_MAIN_VARIANT
9486 else
9490 {
9493 else
9495 }
9498 }
9500 /* Return the innermost context enclosing DECL that is
9501 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9502 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9504 tree
9506 {
9511 {
9532 }
9535 }
9537 /* CALL is a CALL_EXPR. Return the declaration for the function
9538 called, or NULL_TREE if the called function cannot be
9539 determined. */
9541 tree
9543 {
9544 tree addr;
9549 /* It's invalid to call this function with anything but a
9550 CALL_EXPR. */
9553 /* The first operand to the CALL is the address of the function
9554 called. */
9557 /* If there is no function, return early. */
9563 /* If this is a readonly function pointer, extract its initial value. */
9569 /* If the address is just `&f' for some function `f', then we know
9570 that `f' is being called. */
9575 /* We couldn't figure out what was being called. */
9577 }
9579 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9580 return the associated function code, otherwise return CFN_LAST. */
9582 combined_fn
9584 {
9585 /* It's invalid to call this function with anything but a CALL_EXPR. */
9596 }
9598 /* Comparator of indices based on tree_node_counts. */
9600 static int
9602 {
9607 }
9609 /* Comparator of indices based on tree_code_counts. */
9611 static int
9613 {
9618 }
9620 #define TREE_MEM_USAGE_SPACES 40
9622 /* Print debugging information about tree nodes generated during the compile,
9623 and any language-specific information. */
9625 void
9627 {
9629 {
9635 {
9642 {
9649 }
9654 }
9656 {
9666 {
9671 }
9678 }
9679 }
9680 else
9687 }
9688 \f
9691 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9693 unsigned
9695 {
9696 /* This relies on the raw feedback's top 4 bits being zero. */
9697 #define FEEDBACK(X) ((X) * 0x04c11db7)
9698 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9699 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9701 {
9706 };
9707 #undef FEEDBACK
9708 #undef SYNDROME
9712 {
9716 }
9719 }
9721 /* Generate a crc32 of a string. */
9723 unsigned
9725 {
9726 do
9730 }
9732 /* P is a string that will be used in a symbol. Mask out any characters
9733 that are not valid in that context. */
9735 void
9737 {
9742 #endif
9745 #endif
9746 ))
9748 }
9752 /* Create a unique anonymous identifier. The identifier is still a
9753 valid assembly label. */
9755 tree
9757 {
9759 #if !defined (NO_DOT_IN_LABEL)
9760 "."
9761 #elif !defined (NO_DOLLAR_IN_LABEL)
9762 "$"
9763 #else
9764 "_"
9765 #endif
9776 }
9778 /* Generate a name for a special-purpose function.
9779 The generated name may need to be unique across the whole link.
9780 Changes to this function may also require corresponding changes to
9781 xstrdup_mask_random.
9782 TYPE is some string to identify the purpose of this function to the
9783 linker or collect2; it must start with an uppercase letter,
9784 one of:
9785 I - for constructors
9786 D - for destructors
9787 N - for C++ anonymous namespaces
9788 F - for DWARF unwind frame information. */
9790 tree
9792 {
9797 /* If we already have a name we know to be unique, just use that. */
9800 /* If the target is handling the constructors/destructors, they
9801 will be local to this file and the name is only necessary for
9802 debugging purposes.
9803 We also assign sub_I and sub_D sufixes to constructors called from
9804 the global static constructors. These are always local. */
9808 {
9812 /* Just use the file's basename, because the full pathname
9813 might be quite long. */
9815 }
9816 else
9817 {
9818 /* Otherwise, the name must be unique across the entire link.
9819 We don't have anything that we know to be unique to this translation
9820 unit, so use what we do have and throw in some randomness. */
9838 }
9844 /* Set up the name of the file-level functions we may need.
9845 Use a global object (which is already required to be unique over
9846 the program) rather than the file name (which imposes extra
9847 constraints). */
9851 }
9852 \f
9853 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9855 /* Complain that the tree code of NODE does not match the expected 0
9856 terminated list of trailing codes. The trailing code list can be
9857 empty, for a more vague error message. FILE, LINE, and FUNCTION
9858 are of the caller. */
9860 void
9863 {
9874 {
9881 {
9888 }
9890 }
9891 else
9897 }
9899 /* Complain that the tree code of NODE does match the expected 0
9900 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9901 the caller. */
9903 void
9906 {
9920 {
9922 {
9925 }
9928 }
9934 }
9936 /* Similar to tree_check_failed, except that we check for a class of tree
9937 code, given in CL. */
9939 void
9942 {
9943 internal_error
9948 }
9950 /* Similar to tree_check_failed, except that instead of specifying a
9951 dozen codes, use the knowledge that they're all sequential. */
9953 void
9957 {
9970 {
9977 }
9982 }
9985 /* Similar to tree_check_failed, except that we check that a tree does
9986 not have the specified code, given in CL. */
9988 void
9991 {
9992 internal_error
9997 }
10000 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
10002 void
10005 {
10011 }
10014 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
10016 void
10020 {
10033 {
10040 }
10045 }
10048 #undef DEFTREESTRUCT
10049 #define DEFTREESTRUCT(VAL, NAME) NAME,
10053 };
10054 #undef DEFTREESTRUCT
10056 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
10058 /* Similar to tree_class_check_failed, except that we check for
10059 whether CODE contains the tree structure identified by EN. */
10061 void
10066 {
10067 internal_error
10071 }
10074 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10075 (dynamically sized) vector. */
10077 void
10080 {
10081 internal_error
10085 }
10087 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10088 (dynamically sized) vector. */
10090 void
10093 {
10094 internal_error
10097 }
10099 /* Similar to above, except that the check is for the bounds of the operand
10100 vector of an expression node EXP. */
10102 void
10105 {
10107 internal_error
10111 }
10113 /* Similar to above, except that the check is for the number of
10114 operands of an OMP_CLAUSE node. */
10116 void
10119 {
10120 internal_error
10125 }
10127 \f
10128 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10129 and mapped to the machine mode MODE. Initialize its fields and build
10130 the information necessary for debugging output. */
10132 static tree
10134 {
10135 tree t;
10156 /* We have built a main variant, based on the main variant of the
10157 inner type. Use it to build the variant we return. */
10165 }
10167 static tree
10169 {
10192 else
10194 }
10196 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10198 static tree
10200 {
10202 {
10214 }
10215 else
10216 {
10228 }
10231 }
10233 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10235 static tree
10237 {
10239 {
10251 }
10252 else
10253 {
10265 }
10268 }
10271 /* Create an atomic variant node for TYPE. This routine is called
10272 during initialization of data types to create the 5 basic atomic
10273 types. The generic build_variant_type function requires these to
10274 already be set up in order to function properly, so cannot be
10275 called from there. If ALIGN is non-zero, then ensure alignment is
10276 overridden to this value. */
10278 static tree
10280 {
10281 tree t;
10283 /* Make sure its not already registered. */
10294 }
10296 /* Information about the _FloatN and _FloatNx types. This must be in
10297 the same order as the corresponding TI_* enum values. */
10299 {
10307 };
10310 /* Create nodes for all integer types (and error_mark_node) using the sizes
10311 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10313 void
10315 {
10323 /* Define both `signed char' and `unsigned char'. */
10329 /* Define `char', which is like either `signed char' or `unsigned char'
10330 but not the same as either. */
10331 char_type_node
10332 = (signed_char
10347 {
10352 {
10355 }
10356 }
10358 /* Define a boolean type. This type only represents boolean values but
10359 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10365 /* Define what type to use for size_t. */
10374 else
10375 {
10381 {
10386 {
10388 }
10389 }
10392 }
10394 /* Define what type to use for ptrdiff_t. */
10403 else
10404 {
10408 {
10413 }
10416 }
10418 /* Fill in the rest of the sized types. Reuse existing type nodes
10419 when possible. */
10432 /* Don't call build_qualified type for atomics. That routine does
10433 special processing for atomics, and until they are initialized
10434 it's better not to make that call.
10436 Check to see if there is a target override for atomic types. */
10453 /* Define these next since types below may used them. */
10471 /* We are not going to have real types in C with less than byte alignment,
10472 so we might as well not have any types that claim to have it. */
10483 const_ptr_type_node
10505 {
10508 scalar_float_mode mode;
10512 /* Work around the rs6000 KFmode having precision 113 not
10513 128. */
10525 }
10532 /* Fixed size integer types. */
10537 /* Decimal float types. */
10563 {
10567 }
10569 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10570 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10571 sat_ ## KIND ## _type_node = \
10572 make_sat_signed_ ## KIND ## _type (SIZE); \
10573 sat_unsigned_ ## KIND ## _type_node = \
10574 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10575 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10576 unsigned_ ## KIND ## _type_node = \
10577 make_unsigned_ ## KIND ## _type (SIZE);
10579 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10580 sat_ ## WIDTH ## KIND ## _type_node = \
10581 make_sat_signed_ ## KIND ## _type (SIZE); \
10582 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10583 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10584 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10585 unsigned_ ## WIDTH ## KIND ## _type_node = \
10586 make_unsigned_ ## KIND ## _type (SIZE);
10588 /* Make fixed-point type nodes based on four different widths. */
10589 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10590 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10591 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10592 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10593 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10595 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10596 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10597 NAME ## _type_node = \
10598 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10599 u ## NAME ## _type_node = \
10600 make_or_reuse_unsigned_ ## KIND ## _type \
10601 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10602 sat_ ## NAME ## _type_node = \
10603 make_or_reuse_sat_signed_ ## KIND ## _type \
10604 (GET_MODE_BITSIZE (MODE ## mode)); \
10605 sat_u ## NAME ## _type_node = \
10606 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10607 (GET_MODE_BITSIZE (U ## MODE ## mode));
10609 /* Fixed-point type and mode nodes. */
10622 {
10625 /* Many back-ends define record types without setting TYPE_NAME.
10626 If we copied the record type here, we'd keep the original
10627 record type without a name. This breaks name mangling. So,
10628 don't copy record types and let c_common_nodes_and_builtins()
10629 declare the type to be __builtin_va_list. */
10634 }
10635 }
10637 /* Modify DECL for given flags.
10638 TM_PURE attribute is set only on types, so the function will modify
10639 DECL's type when ECF_TM_PURE is used. */
10641 void
10643 {
10673 /* Looping const or pure is implied by noreturn.
10674 There is currently no way to declare looping const or looping pure alone. */
10677 }
10680 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10682 static void
10685 {
10686 tree decl;
10693 }
10695 /* Call this function after instantiating all builtins that the language
10696 front end cares about. This will build the rest of the builtins
10697 and internal functions that are relied upon by the tree optimizers and
10698 the middle-end. */
10700 void
10702 {
10708 {
10712 BUILT_IN_UNREACHABLE,
10720 }
10724 {
10735 }
10738 {
10741 NULL_TREE);
10744 }
10747 {
10753 }
10755 /* If we're checking the stack, `alloca' can throw. */
10756 const int alloca_flags
10760 {
10765 }
10770 BUILT_IN_ALLOCA_WITH_ALIGN,
10772 alloca_flags);
10777 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10779 alloca_flags);
10785 BUILT_IN_INIT_TRAMPOLINE,
10788 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10792 BUILT_IN_INIT_DESCRIPTOR,
10797 BUILT_IN_ADJUST_TRAMPOLINE,
10801 BUILT_IN_ADJUST_DESCRIPTOR,
10808 BUILT_IN_NONLOCAL_GOTO,
10815 BUILT_IN_SETJMP_SETUP,
10820 BUILT_IN_SETJMP_RECEIVER,
10829 BUILT_IN_STACK_RESTORE,
10834 NULL_TREE);
10847 /* If there's a possibility that we might use the ARM EABI, build the
10848 alternate __cxa_end_cleanup node used to resume from C++. */
10850 {
10853 BUILT_IN_CXA_END_CLEANUP,
10855 }
10859 BUILT_IN_UNWIND_RESUME,
10863 ECF_NORETURN);
10866 {
10868 NULL_TREE);
10870 BUILT_IN_RETURN_ADDRESS,
10872 ECF_NOTHROW);
10873 }
10877 {
10882 BUILT_IN_PROFILE_FUNC_ENTER,
10886 BUILT_IN_PROFILE_FUNC_EXIT,
10888 }
10890 /* The exception object and filter values from the runtime. The argument
10891 must be zero before exception lowering, i.e. from the front end. After
10892 exception lowering, it will be the region number for the exception
10893 landing pad. These functions are PURE instead of CONST to prevent
10894 them from being hoisted past the exception edge that will initialize
10895 its value in the landing pad. */
10899 /* Only use TM_PURE if we have TM language support. */
10912 NULL_TREE);
10914 BUILT_IN_EH_COPY_VALUES,
10917 /* Complex multiplication and division. These are handled as builtins
10918 rather than optabs because emit_library_call_value doesn't support
10919 complex. Further, we can do slightly better with folding these
10920 beasties if the real and complex parts of the arguments are separate. */
10921 {
10925 {
10952 /* For -ftrapping-math these should throw from a former
10953 -fnon-call-exception stmt. */
10955 NULL);
10961 NULL);
10965 }
10966 }
10969 }
10971 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10972 better way.
10974 If we requested a pointer to a vector, build up the pointers that
10975 we stripped off while looking for the inner type. Similarly for
10976 return values from functions.
10978 The argument TYPE is the top of the chain, and BOTTOM is the
10979 new type which we will point to. */
10981 tree
10983 {
10987 {
10991 }
10993 {
10997 }
10999 {
11002 }
11004 {
11007 }
11009 {
11011 /* The build_method_type_directly() routine prepends 'this' to argument list,
11012 so we must compensate by getting rid of it. */
11013 outer
11014 = build_method_type_directly
11016 inner,
11018 }
11020 {
11023 }
11024 else
11029 }
11031 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
11032 the inner type. */
11033 tree
11035 {
11036 poly_int64 nunits;
11040 {
11052 /* Check that there are no leftover bits. */
11060 }
11063 }
11065 /* Similarly, but takes the inner type and number of units, which must be
11066 a power of two. */
11068 tree
11070 {
11072 }
11074 /* Build truth vector with specified length and number of units. */
11076 tree
11078 {
11079 machine_mode mask_mode
11082 poly_uint64 vsize;
11085 else
11093 }
11095 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11097 tree
11099 {
11109 }
11111 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11113 tree
11115 {
11117 tree cand;
11118 /* We always build the non-opaque variant before the opaque one,
11119 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11125 /* Othewise build a variant type and make sure to queue it after
11126 the non-opaque type. */
11134 }
11136 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11138 wide_int
11140 {
11141 /* First handle elements that are directly encoded. */
11146 /* Identify the pattern that contains element I and work out the index of
11147 the last encoded element for that pattern. */
11153 /* If there are no steps, the final encoded value is the right one. */
11157 /* Otherwise work out the value from the last two encoded elements. */
11162 }
11164 /* Return the value of element I of VECTOR_CST T. */
11166 tree
11168 {
11169 /* First handle elements that are directly encoded. */
11174 /* If there are no steps, the final encoded value is the right one. */
11176 {
11177 /* Identify the pattern that contains element I and work out the index of
11178 the last encoded element for that pattern. */
11183 }
11185 /* Otherwise work out the value from the last two encoded elements. */
11188 }
11190 /* Given an initializer INIT, return TRUE if INIT is zero or some
11191 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11192 null, set *NONZERO if and only if INIT is known not to be all
11193 zeros. The combination of return value of false and *NONZERO
11194 false implies that INIT may but need not be all zeros. Other
11195 combinations indicate definitive answers. */
11197 bool
11199 {
11204 /* Conservatively clear NONZERO and set it only if INIT is definitely
11205 not all zero. */
11213 {
11222 /* ??? Note that this is not correct for C4X float formats. There,
11223 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11224 negative exponent. */
11259 {
11264 tree elt;
11271 }
11274 {
11289 }
11290 /* Fall through. */
11293 {
11301 /* We need to loop through all elements to handle cases like
11302 "\0" and "\0foobar". */
11305 {
11308 }
11311 }
11315 }
11316 }
11318 /* Return true if EXPR is an initializer expression in which every element
11319 is a constant that is numerically equal to 0 or 1. The elements do not
11320 need to be equal to each other. */
11322 bool
11324 {
11328 {
11336 {
11343 {
11347 }
11350 }
11354 }
11355 }
11357 /* Check if vector VEC consists of all the equal elements and
11358 that the number of elements corresponds to the type of VEC.
11359 The function returns first element of the vector
11360 or NULL_TREE if the vector is not uniform. */
11361 tree
11363 {
11376 {
11380 }
11384 {
11388 {
11390 {
11393 }
11396 }
11401 }
11404 }
11406 /* If the argument is INTEGER_CST, return it. If the argument is vector
11407 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11408 return NULL_TREE.
11409 Look through location wrappers. */
11411 tree
11413 {
11420 {
11424 }
11427 }
11429 /* If VECTOR_CST T has a single nonzero element, return the index of that
11430 element, otherwise return -1. */
11432 int
11434 {
11440 {
11443 }
11444 else
11449 {
11452 {
11456 }
11457 }
11459 }
11461 /* Build an empty statement at location LOC. */
11463 tree
11465 {
11469 }
11472 /* Build an OpenMP clause with code CODE. LOC is the location of the
11473 clause. */
11475 tree
11477 {
11478 tree t;
11493 }
11495 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11496 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11497 Except for the CODE and operand count field, other storage for the
11498 object is initialized to zeros. */
11500 tree
11502 {
11503 tree t;
11515 /* Can't use TREE_OPERAND to store the length because if checking is
11516 enabled, it will try to check the length before we store it. :-P */
11520 }
11522 /* Helper function for build_call_* functions; build a CALL_EXPR with
11523 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11524 the argument slots. */
11526 static tree
11528 {
11529 tree t;
11537 }
11539 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11540 FN and a null static chain slot. NARGS is the number of call arguments
11541 which are specified as "..." arguments. */
11543 tree
11545 {
11546 tree ret;
11552 }
11554 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11555 FN and a null static chain slot. NARGS is the number of call arguments
11556 which are specified as a va_list ARGS. */
11558 tree
11560 {
11561 tree t;
11569 }
11571 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11572 FN and a null static chain slot. NARGS is the number of call arguments
11573 which are specified as a tree array ARGS. */
11575 tree
11578 {
11579 tree t;
11588 }
11590 /* Like build_call_array, but takes a vec. */
11592 tree
11594 {
11603 }
11605 /* Conveniently construct a function call expression. FNDECL names the
11606 function to be called and N arguments are passed in the array
11607 ARGARRAY. */
11609 tree
11611 {
11616 }
11618 /* Conveniently construct a function call expression. FNDECL names the
11619 function to be called and the arguments are passed in the vector
11620 VEC. */
11622 tree
11624 {
11627 }
11630 /* Conveniently construct a function call expression. FNDECL names the
11631 function to be called, N is the number of arguments, and the "..."
11632 parameters are the argument expressions. */
11634 tree
11636 {
11646 }
11648 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11649 varargs macros aren't supported by all bootstrap compilers. */
11651 tree
11653 {
11663 }
11665 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11666 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11667 It will get gimplified later into an ordinary internal function. */
11669 tree
11672 {
11679 }
11681 /* Build internal call expression. This is just like CALL_EXPR, except
11682 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11683 internal function. */
11685 tree
11688 {
11698 }
11700 /* Return a function call to FN, if the target is guaranteed to support it,
11701 or null otherwise.
11703 N is the number of arguments, passed in the "...", and TYPE is the
11704 type of the return value. */
11706 tree
11709 {
11719 {
11722 {
11725 OPTIMIZE_FOR_BOTH))
11727 }
11729 }
11730 else
11731 {
11736 }
11737 }
11739 /* Return a function call to the appropriate builtin alloca variant.
11741 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11742 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11743 bound for SIZE in case it is not a fixed value. */
11745 tree
11747 {
11749 {
11751 return
11753 }
11755 {
11758 }
11759 else
11760 {
11763 }
11764 }
11766 /* Create a new constant string literal consisting of elements of type
11767 ELTYPE and return a tree node representing char* pointer to it as
11768 an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value is
11769 the LEN bytes at STR (the representation of the string, which may
11770 be wide). */
11772 tree
11775 {
11790 }
11794 /* Return true if T (assumed to be a DECL) must be assigned a memory
11795 location. */
11797 bool
11799 {
11805 }
11807 /* Return value of a constant X and sign-extend it. */
11809 HOST_WIDE_INT
11811 {
11815 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11819 {
11823 else
11825 }
11828 }
11830 /* If TYPE is an integral or pointer type, return an integer type with
11831 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11832 if TYPE is already an integer type of signedness UNSIGNEDP.
11833 If TYPE is a floating-point type, return an integer type with the same
11834 bitsize and with the signedness given by UNSIGNEDP; this is useful
11835 when doing bit-level operations on a floating-point value. */
11837 tree
11839 {
11844 {
11852 }
11855 {
11863 }
11872 else
11876 }
11878 /* If TYPE is an integral or pointer type, return an integer type with
11879 the same precision which is unsigned, or itself if TYPE is already an
11880 unsigned integer type. If TYPE is a floating-point type, return an
11881 unsigned integer type with the same bitsize as TYPE. */
11883 tree
11885 {
11887 }
11889 /* If TYPE is an integral or pointer type, return an integer type with
11890 the same precision which is signed, or itself if TYPE is already a
11891 signed integer type. If TYPE is a floating-point type, return a
11892 signed integer type with the same bitsize as TYPE. */
11894 tree
11896 {
11898 }
11900 /* If TYPE is a vector type, return a signed integer vector type with the
11901 same width and number of subparts. Otherwise return boolean_type_node. */
11903 tree
11905 {
11907 {
11912 }
11913 else
11915 }
11917 /* Returns the largest value obtainable by casting something in INNER type to
11918 OUTER type. */
11920 tree
11922 {
11928 /* Compute a unique number for every combination. */
11933 /* Determine the exponent to use. */
11935 {
11938 /* oprec <= iprec, outer: signed, inner: don't care. */
11943 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11947 /* oprec > iprec, outer: signed, inner: signed. */
11951 /* oprec > iprec, outer: signed, inner: unsigned. */
11955 /* oprec > iprec, outer: unsigned, inner: signed. */
11959 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11964 }
11968 }
11970 /* Returns the smallest value obtainable by casting something in INNER type to
11971 OUTER type. */
11973 tree
11975 {
11979 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11980 and obtain 0. */
11982 /* If we are widening something of an unsigned type, OUTER type
11983 contains all values of INNER type. In particular, both INNER
11984 and OUTER types have zero in common. */
11987 else
11988 {
11989 /* If we are widening a signed type to another signed type, we
11990 want to obtain -2^^(iprec-1). If we are keeping the
11991 precision or narrowing to a signed type, we want to obtain
11992 -2^(oprec-1). */
11997 }
11998 }
12000 /* Return nonzero if two operands that are suitable for PHI nodes are
12001 necessarily equal. Specifically, both ARG0 and ARG1 must be either
12002 SSA_NAME or invariant. Note that this is strictly an optimization.
12003 That is, callers of this function can directly call operand_equal_p
12004 and get the same result, only slower. */
12006 int
12008 {
12014 }
12016 /* Returns number of zeros at the end of binary representation of X. */
12018 tree
12020 {
12022 }
12025 #define WALK_SUBTREE(NODE) \
12026 do \
12027 { \
12028 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
12029 if (result) \
12030 return result; \
12031 } \
12032 while (0)
12034 /* This is a subroutine of walk_tree that walks field of TYPE that are to
12035 be walked whenever a type is seen in the tree. Rest of operands and return
12036 value are as for walk_tree. */
12038 static tree
12041 {
12045 {
12049 /* We have to worry about mutually recursive pointers. These can't
12050 be written in C. They can in Ada. It's pathological, but
12051 there's an ACATS test (c38102a) that checks it. Deal with this
12052 by checking if we're pointing to another pointer, that one
12053 points to another pointer, that one does too, and we have no htab.
12054 If so, get a hash table. We check three levels deep to avoid
12055 the cost of the hash table if we don't need one. */
12060 {
12067 }
12069 /* fall through */
12078 /* Fall through. */
12082 {
12083 tree arg;
12085 /* We never want to walk into default arguments. */
12088 }
12092 /* Don't follow this nodes's type if a pointer for fear that
12093 we'll have infinite recursion. If we have a PSET, then we
12094 need not fear. */
12109 }
12112 }
12114 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12115 called with the DATA and the address of each sub-tree. If FUNC returns a
12116 non-NULL value, the traversal is stopped, and the value returned by FUNC
12117 is returned. If PSET is non-NULL it is used to record the nodes visited,
12118 and to avoid visiting a node more than once. */
12120 tree
12123 {
12126 tree result;
12128 #define WALK_SUBTREE_TAIL(NODE) \
12129 do \
12130 { \
12131 tp = & (NODE); \
12132 goto tail_recurse; \
12133 } \
12134 while (0)
12136 tail_recurse:
12137 /* Skip empty subtrees. */
12141 /* Don't walk the same tree twice, if the user has requested
12142 that we avoid doing so. */
12146 /* Call the function. */
12150 /* If we found something, return it. */
12156 /* Even if we didn't, FUNC may have decided that there was nothing
12157 interesting below this point in the tree. */
12159 {
12160 /* But we still need to check our siblings. */
12165 else
12167 }
12170 {
12174 }
12177 {
12190 /* None of these have subtrees other than those already walked
12191 above. */
12200 {
12206 /* Walk all elements but the first. */
12210 /* Now walk the first one as a tail call. */
12212 }
12219 {
12224 idx++)
12226 }
12233 {
12234 tree decl;
12236 {
12237 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12238 into declarations that are just mentioned, rather than
12239 declared; they don't really belong to this part of the tree.
12240 And, we can see cycles: the initializer for a declaration
12241 can refer to the declaration itself. */
12245 }
12247 }
12250 {
12251 tree_stmt_iterator i;
12254 }
12259 {
12263 /* FALLTHRU */
12304 /* FALLTHRU */
12336 {
12341 }
12361 {
12366 }
12370 }
12374 {
12377 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12378 But, we only want to walk once. */
12383 }
12386 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12387 defining. We only want to walk into these fields of a type in this
12388 case and not in the general case of a mere reference to the type.
12390 The criterion is as follows: if the field can be an expression, it
12391 must be walked only here. This should be in keeping with the fields
12392 that are directly gimplified in gimplify_type_sizes in order for the
12393 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12394 variable-sized types.
12396 Note that DECLs get walked as part of processing the BIND_EXPR. */
12398 {
12403 /* Call the function for the type. See if it returns anything or
12404 doesn't want us to continue. If we are to continue, walk both
12405 the normal fields and those for the declaration case. */
12410 /* But do not walk a pointed-to type since it may itself need to
12411 be walked in the declaration case if it isn't anonymous. */
12413 {
12417 }
12419 /* If this is a record type, also walk the fields. */
12421 {
12422 tree field;
12426 {
12427 /* We'd like to look at the type of the field, but we can
12428 easily get infinite recursion. So assume it's pointed
12429 to elsewhere in the tree. Also, ignore things that
12430 aren't fields. */
12439 }
12440 }
12442 /* Same for scalar types. */
12448 {
12451 }
12455 }
12456 /* FALLTHRU */
12460 {
12463 /* Walk over all the sub-trees of this operand. */
12466 /* Go through the subtrees. We need to do this in forward order so
12467 that the scope of a FOR_EXPR is handled properly. */
12469 {
12473 }
12474 }
12475 /* If this is a type, walk the needed fields in the type. */
12479 }
12481 /* We didn't find what we were looking for. */
12484 #undef WALK_SUBTREE_TAIL
12485 }
12486 #undef WALK_SUBTREE
12488 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12490 tree
12492 walk_tree_lh lh)
12493 {
12494 tree result;
12499 }
12502 tree
12504 {
12511 }
12513 void
12515 {
12519 {
12521 }
12522 else
12524 }
12526 /* Create a nameless artificial label and put it in the current
12527 function context. The label has a location of LOC. Returns the
12528 newly created label. */
12530 tree
12532 {
12540 }
12542 /* Given a tree, try to return a useful variable name that we can use
12543 to prefix a temporary that is being assigned the value of the tree.
12544 I.E. given <temp> = &A, return A. */
12548 {
12549 tree stripped_decl;
12556 {
12561 }
12562 else
12563 {
12565 {
12570 }
12571 }
12572 }
12574 /* Return true if TYPE has a variable argument list. */
12576 bool
12578 {
12579 function_args_iterator args_iter;
12586 {
12588 }
12591 }
12593 /* Return true if TYPE has a prototype. */
12595 bool
12597 {
12598 tree t;
12604 }
12606 /* If BLOCK is inlined from an __attribute__((__artificial__))
12607 routine, return pointer to location from where it has been
12608 called. */
12609 location_t *
12611 {
12616 {
12619 {
12620 /* If AO is an artificial inline, point RET to the
12621 call site locus at which it has been inlined and continue
12622 the loop, in case AO's caller is also an artificial
12623 inline. */
12627 else
12629 }
12634 }
12636 }
12639 /* If EXP is inlined from an __attribute__((__artificial__))
12640 function, return the location of the original call expression. */
12642 location_t
12644 {
12649 else
12651 }
12654 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12655 nodes. */
12657 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12659 hashval_t
12661 {
12669 {
12672 }
12677 else
12680 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12681 something else. */
12687 }
12689 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12690 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12691 same. */
12693 bool
12695 {
12708 else
12710 }
12712 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12714 tree
12716 {
12717 tree t;
12719 /* Use the cache of optimization nodes. */
12722 opts);
12727 {
12728 /* Insert this one into the hash table. */
12732 /* Make a new node for next time round. */
12734 }
12737 }
12739 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12741 tree
12743 {
12744 tree t;
12746 /* Use the cache of optimization nodes. */
12749 opts);
12754 {
12755 /* Insert this one into the hash table. */
12759 /* Make a new node for next time round. */
12761 }
12764 }
12766 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12767 so that they aren't saved during PCH writing. */
12769 void
12771 {
12776 }
12778 /* Determine the "ultimate origin" of a block. */
12780 tree
12782 {
12787 else
12788 {
12793 }
12794 }
12796 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12797 no instruction. */
12799 bool
12801 {
12802 /* Do not strip casts into or out of differing address spaces. */
12805 {
12810 }
12813 {
12814 /* We already know that outer_type is not a pointer with
12815 a non-generic address space. */
12817 }
12819 /* Use precision rather then machine mode when we can, which gives
12820 the correct answer even for submode (bit-field) types. */
12829 /* Otherwise fall back on comparing machine modes (e.g. for
12830 aggregate types, floats). */
12832 }
12834 /* Return true iff conversion in EXP generates no instruction. Mark
12835 it inline so that we fully inline into the stripping functions even
12836 though we have two uses of this function. */
12840 {
12855 }
12857 /* Return true iff conversion in EXP generates no instruction. Don't
12858 consider conversions changing the signedness. */
12860 static bool
12862 {
12873 }
12875 /* Strip conversions from EXP according to tree_nop_conversion and
12876 return the resulting expression. */
12878 tree
12880 {
12884 }
12886 /* Strip conversions from EXP according to tree_sign_nop_conversion
12887 and return the resulting expression. */
12889 tree
12891 {
12895 }
12897 /* Avoid any floating point extensions from EXP. */
12898 tree
12900 {
12903 /* For floating point constant look up the narrowest type that can hold
12904 it properly and handle it like (type)(narrowest_type)constant.
12905 This way we can optimize for instance a=a*2.0 where "a" is float
12906 but 2.0 is double constant. */
12908 {
12909 REAL_VALUE_TYPE orig;
12922 }
12941 }
12943 /* Strip out all handled components that produce invariant
12944 offsets. */
12946 const_tree
12948 {
12950 {
12952 {
12967 }
12969 }
12972 }
12976 /* Return the GCC personality function decl. */
12978 tree
12980 {
12984 }
12986 /* TARGET is a call target of GIMPLE call statement
12987 (obtained by gimple_call_fn). Return true if it is
12988 OBJ_TYPE_REF representing an virtual call of C++ method.
12989 (As opposed to OBJ_TYPE_REF representing objc calls
12990 through a cast where middle-end devirtualization machinery
12991 can't apply.) */
12993 bool
12995 {
13004 /* If we do not have BINFO associated, it means that type was built
13005 without devirtualization enabled. Do not consider this a virtual
13006 call. */
13010 }
13012 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
13014 static tree
13016 {
13027 }
13029 /* Try to find a base info of BINFO that would have its field decl at offset
13030 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
13031 found, return, otherwise return NULL_TREE. */
13033 tree
13035 {
13039 {
13041 tree fld;
13050 {
13058 }
13062 /* Offset 0 indicates the primary base, whose vtable contents are
13063 represented in the binfo for the derived class. */
13065 {
13067 /* Offsets in BINFO are in bytes relative to the whole structure
13068 while POS is in bits relative to the containing field. */
13075 {
13078 }
13081 else
13083 binfo_offset);
13084 }
13088 }
13089 }
13091 /* Returns true if X is a typedef decl. */
13093 bool
13095 {
13098 }
13100 /* Returns true iff TYPE is a type variant created for a typedef. */
13102 bool
13104 {
13106 }
13108 /* A class to handle converting a string that might contain
13109 control characters, (eg newline, form-feed, etc), into one
13110 in which contains escape sequences instead. */
13112 class escaped_string
13113 {
13122 };
13124 /* PR 84195: Replace control characters in "unescaped" with their
13125 escaped equivalents. Allow newlines if -fmessage-length has
13126 been set to a non-zero value. This is done here, rather than
13127 where the attribute is recorded as the message length can
13128 change between these two locations. */
13130 void
13132 {
13150 {
13154 {
13158 }
13161 {
13163 {
13164 /* We only allocate space for a new string if we
13165 actually encounter a control character that
13166 needs replacing. */
13170 }
13175 {
13184 }
13185 }
13188 }
13191 {
13195 }
13196 }
13198 /* Warn about a use of an identifier which was marked deprecated. Returns
13199 whether a warning was given. */
13201 bool
13203 {
13204 escaped_string msg;
13210 {
13214 {
13219 }
13220 }
13230 {
13231 auto_diagnostic_group d;
13235 else
13240 }
13242 {
13247 {
13253 }
13255 auto_diagnostic_group d;
13257 {
13261 else
13264 }
13265 else
13266 {
13270 else
13273 }
13277 }
13280 }
13282 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13283 somewhere in it. */
13285 bool
13287 {
13289 {
13294 }
13297 }
13299 /* Try to determine whether a TRY_CATCH expression can fall through.
13300 This is a subroutine of block_may_fallthru. */
13302 static bool
13304 {
13305 tree_stmt_iterator i;
13307 /* If the TRY block can fall through, the whole TRY_CATCH can
13308 fall through. */
13314 {
13316 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13317 catch expression and a body. The whole TRY_CATCH may fall
13318 through iff any of the catch bodies falls through. */
13320 {
13323 }
13327 /* The exception filter expression only matters if there is an
13328 exception. If the exception does not match EH_FILTER_TYPES,
13329 we will execute EH_FILTER_FAILURE, and we will fall through
13330 if that falls through. If the exception does match
13331 EH_FILTER_TYPES, the stack unwinder will continue up the
13332 stack, so we will not fall through. We don't know whether we
13333 will throw an exception which matches EH_FILTER_TYPES or not,
13334 so we just ignore EH_FILTER_TYPES and assume that we might
13335 throw an exception which doesn't match. */
13339 /* This case represents statements to be executed when an
13340 exception occurs. Those statements are implicitly followed
13341 by a RESX statement to resume execution after the exception.
13342 So in this case the TRY_CATCH never falls through. */
13344 }
13345 }
13347 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13348 need not be 100% accurate; simply be conservative and return true if we
13349 don't know. This is used only to avoid stupidly generating extra code.
13350 If we're wrong, we'll just delete the extra code later. */
13352 bool
13354 {
13355 /* This CONST_CAST is okay because expr_last returns its argument
13356 unmodified and we assign it to a const_tree. */
13360 {
13363 /* Easy cases. If the last statement of the block implies
13364 control transfer, then we can't fall through. */
13368 /* If there is a default: label or case labels cover all possible
13369 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13370 to some case label in all cases and all we care is whether the
13371 SWITCH_BODY falls through. */
13388 /* The finally clause is always executed after the try clause,
13389 so if it does not fall through, then the try-finally will not
13390 fall through. Otherwise, if the try clause does not fall
13391 through, then when the finally clause falls through it will
13392 resume execution wherever the try clause was going. So the
13393 whole try-finally will only fall through if both the try
13394 clause and the finally clause fall through. */
13401 else
13403 /* FALLTHRU */
13406 /* Functions that do not return do not fall through. */
13420 }
13421 }
13423 /* True if we are using EH to handle cleanups. */
13426 /* This routine is called from front ends to indicate eh should be used for
13427 cleanups. */
13428 void
13430 {
13432 }
13434 /* Query whether EH is used for cleanups. */
13435 bool
13437 {
13439 }
13441 /* Wrapper for tree_code_name to ensure that tree code is valid */
13444 {
13451 }
13453 /* Drops the TREE_OVERFLOW flag from T. */
13455 tree
13457 {
13460 /* For tree codes with a sharing machinery re-build the result. */
13464 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13465 and canonicalize the result. */
13467 {
13468 tree_vector_builder builder;
13472 {
13477 }
13479 }
13481 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13482 and drop the flag. */
13486 /* For constants that contain nested constants, drop the flag
13487 from those as well. */
13489 {
13494 }
13497 }
13499 /* Given a memory reference expression T, return its base address.
13500 The base address of a memory reference expression is the main
13501 object being referenced. For instance, the base address for
13502 'array[i].fld[j]' is 'array'. You can think of this as stripping
13503 away the offset part from a memory address.
13505 This function calls handled_component_p to strip away all the inner
13506 parts of the memory reference until it reaches the base object. */
13508 tree
13510 {
13519 /* ??? Either the alias oracle or all callers need to properly deal
13520 with WITH_SIZE_EXPRs before we can look through those. */
13525 }
13527 /* Return a tree of sizetype representing the size, in bytes, of the element
13528 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13530 tree
13532 {
13537 /* If a size was specified in the ARRAY_REF, it's the size measured
13538 in alignment units of the element type. So multiply by that value. */
13540 {
13541 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13542 sizetype from another type of the same width and signedness. */
13547 }
13549 /* Otherwise, take the size from that of the element type. Substitute
13550 any PLACEHOLDER_EXPR that we have. */
13551 else
13553 }
13555 /* Return a tree representing the lower bound of the array mentioned in
13556 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13558 tree
13560 {
13563 /* If a lower bound is specified in EXP, use it. */
13567 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13568 substituting for a PLACEHOLDER_EXPR as needed. */
13572 /* Otherwise, return a zero of the appropriate type. */
13574 }
13576 /* Return a tree representing the upper bound of the array mentioned in
13577 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13579 tree
13581 {
13584 /* If there is a domain type and it has an upper bound, use it, substituting
13585 for a PLACEHOLDER_EXPR as needed. */
13589 /* Otherwise fail. */
13591 }
13593 /* Returns true if REF is an array reference or a component reference
13594 to an array at the end of a structure.
13595 If this is the case, the array may be allocated larger
13596 than its upper bound implies. */
13598 bool
13600 {
13601 tree atype;
13605 {
13608 }
13612 else
13620 {
13621 /* If the reference chain contains a component reference to a
13622 non-union type and there follows another field the reference
13623 is not at the end of a structure. */
13625 {
13627 {
13633 }
13634 }
13635 /* If we have a multi-dimensional array we do not consider
13636 a non-innermost dimension as flex array if the whole
13637 multi-dimensional array is at struct end.
13638 Same for an array of aggregates with a trailing array
13639 member. */
13643 ;
13644 /* If we view an underlying object as sth else then what we
13645 gathered up to now is what we have to rely on. */
13648 else
13652 }
13654 /* The array now is at struct end. Treat flexible arrays as
13655 always subject to extend, even into just padding constrained by
13656 an underlying decl. */
13666 /* If the reference is based on a declared entity, the size of the array
13667 is constrained by its given domain. (Do not trust commons PR/69368). */
13669 && !(flag_unconstrained_commons
13673 {
13674 /* Check whether the array domain covers all of the available
13675 padding. */
13676 poly_int64 offset;
13684 /* If at least one extra element fits it is a flexarray. */
13693 }
13696 }
13698 /* Return a tree representing the offset, in bytes, of the field referenced
13699 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13701 tree
13703 {
13708 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13709 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13710 value. */
13712 {
13713 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13714 sizetype from another type of the same width and signedness. */
13720 }
13722 /* Otherwise, take the offset from that of the field. Substitute
13723 any PLACEHOLDER_EXPR that we have. */
13724 else
13726 }
13728 /* Return the machine mode of T. For vectors, returns the mode of the
13729 inner type. The main use case is to feed the result to HONOR_NANS,
13730 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13732 machine_mode
13734 {
13740 }
13742 /* Vector types need to re-check the target flags each time we report
13743 the machine mode. We need to do this because attribute target can
13744 change the result of vector_mode_supported_p and have_regs_of_mode
13745 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13746 change on a per-function basis. */
13747 /* ??? Possibly a better solution is to run through all the types
13748 referenced by a function and re-compute the TYPE_MODE once, rather
13749 than make the TYPE_MODE macro call a function. */
13751 machine_mode
13753 {
13754 machine_mode mode;
13762 {
13763 scalar_int_mode innermode;
13765 /* For integers, try mapping it to a same-sized scalar mode. */
13767 {
13770 scalar_int_mode mode;
13774 }
13777 }
13780 }
13782 /* Verify that basic properties of T match TV and thus T can be a variant of
13783 TV. TV should be the more specified variant (i.e. the main variant). */
13785 static bool
13787 {
13788 /* Type variant can differ by:
13790 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13791 ENCODE_QUAL_ADDR_SPACE.
13792 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13793 in this case some values may not be set in the variant types
13794 (see TYPE_COMPLETE_P checks).
13795 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13796 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13797 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13798 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13799 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13800 this is necessary to make it possible to merge types form different TUs
13801 - arrays, pointers and references may have TREE_TYPE that is a variant
13802 of TREE_TYPE of their main variants.
13803 - aggregates may have new TYPE_FIELDS list that list variants of
13804 the main variant TYPE_FIELDS.
13805 - vector types may differ by TYPE_VECTOR_OPAQUE
13806 */
13808 /* Convenience macro for matching individual fields. */
13809 #define verify_variant_match(flag) \
13810 do { \
13811 if (flag (tv) != flag (t)) \
13812 { \
13814 debug_tree (tv); \
13815 return false; \
13816 } \
13817 } while (false)
13819 /* tree_base checks. */
13822 /* FIXME: Ada builds non-artificial variants of artificial types. */
13827 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13834 else
13836 /* FIXME: This check trigger during libstdc++ build. */
13840 /* tree_type_common checks. */
13843 {
13851 {
13861 }
13862 }
13869 /* During LTO we merge variant lists from diferent translation units
13870 that may differ BY TYPE_CONTEXT that in turn may point
13871 to TRANSLATION_UNIT_DECL.
13872 Ada also builds variants of types with different TYPE_CONTEXT. */
13877 {
13881 }
13883 /* tree_type_non_common checks. */
13885 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13886 and dangle the pointer from time to time. */
13890 {
13894 }
13900 {
13903 }
13910 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13911 or even type's main variant. This is needed to make bootstrap pass
13912 and the bug seems new in GCC 5.
13913 C++ FE should be updated to make this consistent and we should check
13914 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13915 is a match with main variant.
13917 Also disable the check for Java for now because of parser hack that builds
13918 first an dummy BINFO and then sometimes replace it by real BINFO in some
13919 of the copies. */
13922 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13923 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13924 at LTO time only. */
13926 {
13934 }
13936 /* Check various uses of TYPE_VALUES_RAW. */
13942 /* Permit incomplete variants of complete type. While FEs may complete
13943 all variants, this does not happen for C++ templates in all cases. */
13947 {
13950 /* Fortran builds qualified variants as new records with items of
13951 qualified type. Verify that they looks same. */
13958 /* FIXME: gfc_nonrestricted_type builds all types as variants
13959 with exception of pointer types. It deeply copies the type
13960 which means that we may end up with a variant type
13961 referring non-variant pointer. We may change it to
13962 produce types as variants, too, like
13963 objc_get_protocol_qualified_type does. */
13969 {
13977 }
13978 }
13981 /* For C++ the qualified variant of array type is really an array type
13982 of qualified TREE_TYPE.
13983 objc builds variants of pointer where pointer to type is a variant, too
13984 in objc_get_protocol_qualified_type. */
13990 {
13998 }
14001 {
14009 }
14011 #undef verify_variant_match
14012 }
14015 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14016 the middle-end types_compatible_p function. It needs to avoid
14017 claiming types are different for types that should be treated
14018 the same with respect to TBAA. Canonical types are also used
14019 for IL consistency checks via the useless_type_conversion_p
14020 predicate which does not handle all type kinds itself but falls
14021 back to pointer-comparison of TYPE_CANONICAL for aggregates
14022 for example. */
14024 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14025 type calculation because we need to allow inter-operability between signed
14026 and unsigned variants. */
14028 bool
14030 {
14031 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14032 signed char and unsigned char. Similarly fortran FE builds
14033 C_SIZE_T as signed type, while C defines it unsigned. */
14036 == INTEGER_TYPE
14039 }
14041 /* Return true iff T1 and T2 are structurally identical for what
14042 TBAA is concerned.
14043 This function is used both by lto.c canonical type merging and by the
14044 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14045 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14046 only for LTO because only in these cases TYPE_CANONICAL equivalence
14047 correspond to one defined by gimple_canonical_types_compatible_p. */
14049 bool
14052 {
14053 /* Type variants should be same as the main variant. When not doing sanity
14054 checking to verify this fact, go to main variants and save some work. */
14056 {
14059 }
14061 /* Check first for the obvious case of pointer identity. */
14065 /* Check that we have two types to compare. */
14069 /* We consider complete types always compatible with incomplete type.
14070 This does not make sense for canonical type calculation and thus we
14071 need to ensure that we are never called on it.
14073 FIXME: For more correctness the function probably should have three modes
14074 1) mode assuming that types are complete mathcing their structure
14075 2) mode allowing incomplete types but producing equivalence classes
14076 and thus ignoring all info from complete types
14077 3) mode allowing incomplete types to match complete but checking
14078 compatibility between complete types.
14080 1 and 2 can be used for canonical type calculation. 3 is the real
14081 definition of type compatibility that can be used i.e. for warnings during
14082 declaration merging. */
14086 /* If the types have been previously registered and found equal
14087 they still are. */
14091 {
14092 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14093 they are always NULL, but they are set to non-NULL for types
14094 constructed by build_pointer_type and variants. In this case the
14095 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14096 all pointers are considered equal. Be sure to not return false
14097 negatives. */
14101 }
14103 /* Can't be the same type if the types don't have the same code. */
14108 /* Qualifiers do not matter for canonical type comparison purposes. */
14110 /* Void types and nullptr types are always the same. */
14115 /* Can't be the same type if they have different mode. */
14119 /* Non-aggregate types can be handled cheaply. */
14127 {
14128 /* Can't be the same type if they have different recision. */
14132 /* In some cases the signed and unsigned types are required to be
14133 inter-operable. */
14138 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14139 interoperable with "signed char". Unless all frontends are revisited
14140 to agree on these types, we must ignore the flag completely. */
14142 /* Fortran standard define C_PTR type that is compatible with every
14143 C pointer. For this reason we need to glob all pointers into one.
14144 Still pointers in different address spaces are not compatible. */
14146 {
14150 }
14152 /* Tail-recurse to components. */
14157 trust_type_canonical);
14160 }
14162 /* Do type-specific comparisons. */
14164 {
14166 /* Array types are the same if the element types are the same and
14167 the number of elements are the same. */
14169 trust_type_canonical)
14174 else
14175 {
14179 /* For an incomplete external array, the type domain can be
14180 NULL_TREE. Check this condition also. */
14185 else
14186 {
14192 /* The minimum/maximum values have to be the same. */
14204 else
14206 }
14207 }
14211 /* Function types are the same if the return type and arguments types
14212 are the same. */
14214 trust_type_canonical))
14219 else
14220 {
14226 {
14229 trust_type_canonical))
14231 }
14237 }
14242 {
14245 /* Don't try to compare variants of an incomplete type, before
14246 TYPE_FIELDS has been copied around. */
14254 /* For aggregate types, all the fields must be the same. */
14258 {
14259 /* Skip non-fields and zero-sized fields. */
14270 /* The fields must have the same name, offset and type. */
14273 || !gimple_canonical_types_compatible_p
14275 trust_type_canonical))
14277 }
14279 /* If one aggregate has more fields than the other, they
14280 are not the same. */
14285 }
14288 /* Consider all types with language specific trees in them mutually
14289 compatible. This is executed only from verify_type and false
14290 positives can be tolerated. */
14293 }
14294 }
14296 /* Verify type T. */
14298 void
14300 {
14304 {
14307 }
14309 {
14313 }
14319 ;
14321 {
14325 }
14326 /* Method and function types cannot be used to address memory and thus
14327 TYPE_CANONICAL really matters only for determining useless conversions.
14329 FIXME: C++ FE produce declarations of builtin functions that are not
14330 compatible with main variants. */
14332 ;
14334 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14335 with variably sized arrays because their sizes possibly
14336 gimplified to different variables. */
14340 {
14344 }
14348 {
14352 }
14354 {
14359 }
14362 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14364 {
14365 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14366 and danagle the pointer from time to time. */
14370 {
14374 }
14375 }
14377 {
14380 {
14384 }
14385 }
14387 {
14390 {
14394 }
14395 }
14398 {
14399 /* FIXME: The following check should pass:
14400 useless_type_conversion_p (const_cast <tree> (t),
14401 TREE_TYPE (TYPE_MIN_VALUE (t))
14402 but does not for C sizetypes in LTO. */
14403 }
14405 /* Check various uses of TYPE_MAXVAL_RAW. */
14407 {
14409 ;
14411 {
14415 }
14417 {
14421 }
14422 }
14424 {
14428 {
14432 }
14433 }
14435 {
14439 {
14443 }
14444 }
14447 {
14448 /* FIXME: The following check should pass:
14449 useless_type_conversion_p (const_cast <tree> (t),
14450 TREE_TYPE (TYPE_MAX_VALUE (t))
14451 but does not for C sizetypes in LTO. */
14452 }
14454 {
14457 {
14461 }
14462 }
14464 {
14468 }
14471 {
14475 }
14477 /* Check various uses of TYPE_VALUES_RAW. */
14480 {
14484 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14485 CONST_DECL of ENUMERAL TYPE. */
14487 {
14492 }
14495 {
14501 }
14503 {
14508 }
14509 }
14511 {
14513 {
14517 }
14518 }
14520 {
14522 {
14525 }
14527 {
14528 /* TODO: verify properties of decls. */
14530 ;
14532 ;
14534 ;
14536 ;
14538 ;
14540 ;
14542 ;
14543 else
14544 {
14548 }
14549 }
14550 }
14557 {
14559 {
14564 }
14566 {
14570 }
14571 /* Verify just enough of cache to ensure that no one copied it to new type.
14572 All copying should go by copy_node that should clear it. */
14574 {
14579 {
14584 }
14585 }
14586 }
14589 {
14590 /* C++ FE uses TREE_PURPOSE to store initial values. */
14592 {
14596 }
14598 {
14602 }
14603 }
14605 {
14609 }
14617 {
14620 }
14623 {
14626 }
14628 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14629 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14630 of a type. */
14633 {
14636 }
14639 {
14642 }
14643 }
14646 /* Return 1 if ARG interpreted as signed in its precision is known to be
14647 always positive or 2 if ARG is known to be always negative, or 3 if
14648 ARG may be positive or negative. */
14650 int
14652 {
14659 {
14663 else
14665 }
14669 {
14671 /* Narrower value zero extended into wider type
14672 will always result in positive values. */
14679 }
14685 {
14689 {
14693 {
14702 }
14703 }
14705 }
14707 {
14708 /* For unsigned values, the "positive" range comes
14709 below the "negative" range. */
14714 }
14715 else
14716 {
14721 }
14723 }
14728 /* Return true if ARG is marked with the nonnull attribute in the
14729 current function signature. */
14731 bool
14733 {
14741 /* The static chain decl is always non null. */
14745 /* THIS argument of method is always non-NULL. */
14751 /* Values passed by reference are always non-NULL. */
14758 {
14761 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14765 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14769 /* Get the position number for ARG in the function signature. */
14771 t;
14773 {
14776 }
14780 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14782 {
14785 }
14786 }
14789 }
14791 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14792 information. */
14794 location_t
14796 {
14800 }
14802 location_t
14804 {
14805 source_range src_range;
14809 }
14811 location_t
14813 {
14819 pure_loc,
14820 src_range,
14821 NULL);
14824 }
14826 /* Return EXPR, potentially wrapped with a node expression LOC,
14827 if !CAN_HAVE_LOCATION_P (expr).
14829 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14830 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14832 Wrapper nodes can be identified using location_wrapper_p. */
14834 tree
14836 {
14843 /* We should only be adding wrappers for constants and for decls,
14844 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14849 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14850 any impact of the wrapper nodes. */
14854 /* If any auto_suppress_location_wrappers are active, don't create
14855 wrappers. */
14859 tree_code code
14864 /* Mark this node as being a wrapper. */
14867 }
14871 /* Return the name of combined function FN, for debugging purposes. */
14875 {
14877 {
14880 }
14881 else
14883 }
14885 /* Return a bitmap with a bit set corresponding to each argument in
14886 a function call type FNTYPE declared with attribute nonnull,
14887 or null if none of the function's argument are nonnull. The caller
14888 must free the bitmap. */
14890 bitmap
14892 {
14902 /* A function declaration can specify multiple attribute nonnull,
14903 each with zero or more arguments. The loop below creates a bitmap
14904 representing a union of all the arguments. An empty (but non-null)
14905 bitmap means that all arguments have been declaraed nonnull. */
14907 {
14916 {
14917 /* Clear the bitmap in case a previous attribute nonnull
14918 set it and this one overrides it for all arguments. */
14921 }
14923 /* Iterate over the indices of the format arguments declared nonnull
14924 and set a bit for each. */
14926 {
14929 }
14930 }
14933 }
14935 /* Returns true if TYPE is a type where it and all of its subobjects
14936 (recursively) are of structure, union, or array type. */
14938 static bool
14940 {
14942 {
14949 }
14955 }
14957 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14958 that shouldn't be passed via stack. */
14960 bool
14962 {
14973 }
14975 /* Like int_size_in_bytes, but handle empty records specially. */
14977 HOST_WIDE_INT
14979 {
14981 }
14983 /* Like size_in_bytes, but handle empty records specially. */
14985 tree
14987 {
14989 }
14991 /* Return true if an expression with CODE has to have the same result type as
14992 its first operand. */
14994 bool
14996 {
14998 {
15032 }
15033 }
15035 /* Return a typenode for the "standard" C type with a given name. */
15036 tree
15038 {
15070 }
15072 /* List of pointer types used to declare builtins before we have seen their
15073 real declaration.
15075 Keep the size up to date in tree.h ! */
15077 {
15084 };
15086 /* Return the maximum object size. */
15088 tree
15090 {
15091 /* To do: Make this a configurable parameter. */
15093 }
15095 #if CHECKING_P
15099 /* Selftests for tree. */
15101 /* Verify that integer constants are sane. */
15103 static void
15105 {
15118 }
15120 /* Verify identifiers. */
15122 static void
15124 {
15128 }
15130 /* Verify LABEL_DECL. */
15132 static void
15134 {
15140 }
15142 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15143 are given by VALS. */
15145 static tree
15147 {
15152 }
15154 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15156 static void
15158 {
15164 }
15166 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15167 and that its elements match EXPECTED. */
15169 static void
15172 {
15179 }
15181 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15182 and NPATTERNS background elements, and that its elements match
15183 EXPECTED. */
15185 static void
15188 {
15195 }
15197 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15198 and that its elements match EXPECTED. */
15200 static void
15203 {
15210 }
15212 /* Test the creation of VECTOR_CSTs. */
15214 static void
15216 {
15222 /* Test a simple linear series with a base of 0 and a step of 1:
15223 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15229 /* Try the same with the first element replaced by 100:
15230 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15235 /* Try a series that wraps around.
15236 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15242 /* Try a downward series:
15243 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15249 /* Try two interleaved series with different bases and steps:
15250 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15253 {
15256 }
15260 /* Try a duplicated value:
15261 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15267 /* Try an interleaved duplicated value:
15268 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15275 /* Try a duplicated value with 2 exceptions
15276 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15282 /* Try with and without a step
15283 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15289 /* Try a fully-general constant:
15290 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15294 }
15296 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15297 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15298 modifying its argument in-place. */
15300 static void
15302 {
15305 }
15307 /* Verify location wrappers. */
15309 static void
15311 {
15316 /* Wrapping a constant. */
15326 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15329 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15334 /* Wrapping a STRING_CST. */
15346 /* Wrapping a variable. */
15349 integer_type_node);
15358 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15359 wrapper. */
15364 /* Verify that STRIP_NOPS removes wrappers. */
15368 }
15370 /* Test various tree predicates. Verify that location wrappers don't
15371 affect the results. */
15373 static void
15375 {
15376 /* Build various constants and wrappers around them. */
15404 /* TODO: vector constants. */
15406 /* Test integer_onep. */
15426 /* Test integer_zerop. */
15446 /* Test integer_all_onesp. */
15466 /* Test integer_minus_onep. */
15486 /* Test integer_each_onep. */
15506 /* Test integer_truep. */
15526 /* Test integer_nonzerop. */
15546 /* Test real_zerop. */
15566 /* Test real_onep. */
15586 /* Test real_minus_onep. */
15606 /* Test zerop. */
15626 /* Test tree_expr_nonnegative_p. */
15646 /* Test tree_expr_nonzero_p. */
15654 /* Test integer_valued_real_p. */
15661 /* Test integer_pow2p. */
15666 /* Test uniform_integer_cst_p. */
15685 }
15687 /* Check that string escaping works correctly. */
15689 static void
15691 {
15693 escaped_string msg;
15696 /* ASSERT_STREQ does not accept NULL as a valid test
15697 result, so we have to use ASSERT_EQ instead. */
15706 /* Ensure that we have -fmessage-length set to 0. */
15716 /* Now repeat the tests with -fmessage-length set to 5. */
15719 /* Note that the newline is not translated into an escape. */
15726 /* Restore the original message length setting. */
15728 }
15730 /* Run all of the selftests within this file. */
15732 void
15734 {
15742 }