| blob | 154ef3ac38ff4901aa4d67a6eda6ed6b399fe6d5 |
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 {
362 };
365 {
447 };
450 /* Return the tree node structure used by tree code CODE. */
454 {
456 {
458 {
460 {
483 }
484 }
497 }
499 {
500 /* tcc_constant cases. */
509 /* tcc_exceptional cases. */
526 }
527 }
530 /* Initialize tree_contains_struct to describe the hierarchy of tree
531 nodes. */
533 static void
535 {
539 {
546 /* Mark the TS structure itself. */
549 /* Mark all the structures that TS is derived from. */
551 {
631 }
632 }
634 /* Basic consistency checks for attributes used in fold. */
675 }
678 /* Init tree.c. */
680 void
682 {
683 /* Initialize the hash table of types. */
684 type_hash_table
687 debug_expr_for_decl
690 value_expr_for_decl
704 /* Initialize the tree_contains_struct array. */
707 }
709 \f
710 /* The name of the object as the assembler will see it (but before any
711 translations made by ASM_OUTPUT_LABELREF). Often this is the same
712 as DECL_NAME. It is an IDENTIFIER_NODE. */
713 tree
715 {
719 }
721 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
722 (either of which may be NULL). Inform the FE, if this changes the
723 name. */
725 void
727 {
730 }
732 /* When the target supports COMDAT groups, this indicates which group the
733 DECL is associated with. This can be either an IDENTIFIER_NODE or a
734 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
735 tree
737 {
742 }
744 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
745 tree
747 {
752 }
754 /* When the target supports named section, return its name as IDENTIFIER_NODE
755 or NULL if it is in no section. */
758 {
763 }
765 /* Set section name of NODE to VALUE (that is expected to be
766 identifier node) */
767 void
769 {
773 {
777 }
780 else
783 }
785 /* Return TLS model of a variable NODE. */
786 enum tls_model
788 {
793 }
795 /* Set TLS model of variable NODE to MODEL. */
796 void
798 {
802 {
806 }
807 else
810 }
812 /* Compute the number of bytes occupied by a tree with code CODE.
813 This function cannot be used for nodes that have variable sizes,
814 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
815 size_t
817 {
819 {
822 {
839 }
843 {
866 }
879 {
891 }
895 {
916 }
920 }
921 }
923 /* Compute the number of bytes occupied by NODE. This routine only
924 looks at TREE_CODE, except for those nodes that have variable sizes. */
925 size_t
927 {
930 {
960 else
962 }
963 }
965 /* Return tree node kind based on tree CODE. */
967 static tree_node_kind
969 {
973 {
991 {
1008 }
1014 }
1015 }
1017 /* Record interesting allocation statistics for a tree node with CODE
1018 and LENGTH. */
1020 static void
1022 {
1031 }
1033 /* Allocate and return a new UID from the DECL_UID namespace. */
1035 int
1037 {
1039 }
1041 /* Return a newly allocated node of code CODE. For decl and type
1042 nodes, some other fields are initialized. The rest of the node is
1043 initialized to zero. This function cannot be used for TREE_VEC,
1044 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1045 tree_code_size.
1047 Achoo! I got a code in the node. */
1049 tree
1051 {
1052 tree t;
1062 {
1070 {
1072 {
1075 }
1076 else
1078 }
1082 else
1083 {
1086 }
1099 /* Default to no attributes for type, but let target change that. */
1103 /* We have not yet computed the alias set for this type. */
1113 {
1121 /* All of these have side-effects, no matter what their
1122 operands are. */
1128 }
1133 {
1146 }
1150 /* Other classes need no special treatment. */
1152 }
1155 }
1157 /* Free tree node. */
1159 void
1161 {
1164 {
1174 }
1182 }
1183 \f
1184 /* Return a new node with the same contents as NODE except that its
1185 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1187 tree
1189 {
1190 tree t;
1207 {
1210 else
1211 {
1215 }
1218 {
1221 }
1222 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1224 {
1227 }
1229 {
1232 }
1234 {
1237 }
1238 }
1240 {
1242 /* The following is so that the debug code for
1243 the copy is different from the original type.
1244 The two statements usually duplicate each other
1245 (because they clear fields of the same union),
1246 but the optimizer should catch that. */
1250 /* Do not copy the values cache. */
1252 {
1255 }
1256 }
1258 {
1262 }
1264 {
1268 }
1271 }
1273 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1274 For example, this can copy a list made of TREE_LIST nodes. */
1276 tree
1278 {
1279 tree head;
1288 {
1292 }
1294 }
1296 \f
1297 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1298 INTEGER_CST with value CST and type TYPE. */
1300 static unsigned int
1302 {
1304 /* We need extra HWIs if CST is an unsigned integer with its
1305 upper bit set. */
1309 }
1311 /* Return a new INTEGER_CST with value CST and type TYPE. */
1313 static tree
1315 {
1321 {
1327 }
1330 {
1331 len--;
1335 }
1341 }
1343 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1345 static tree
1347 CXX_MEM_STAT_INFO)
1348 {
1360 }
1362 /* Create a constant tree that contains CST sign-extended to TYPE. */
1364 tree
1366 {
1367 /* Support legacy code. */
1372 }
1374 /* Create a constant tree that contains CST zero-extended to TYPE. */
1376 tree
1378 {
1380 }
1382 /* Create a constant tree that contains CST sign-extended to TYPE. */
1384 tree
1386 {
1389 }
1391 /* Constructs tree in type TYPE from with value given by CST. Signedness
1392 of CST is assumed to be the same as the signedness of TYPE. */
1394 tree
1396 {
1398 }
1400 /* We force the wide_int CST to the range of the type TYPE by sign or
1401 zero extending it. OVERFLOWABLE indicates if we are interested in
1402 overflow of the value, when >0 we are only interested in signed
1403 overflow, for <0 we are interested in any overflow. OVERFLOWED
1404 indicates whether overflow has already occurred. CONST_OVERFLOWED
1405 indicates whether constant overflow has already occurred. We force
1406 T's value to be within range of T's type (by setting to 0 or 1 all
1407 the bits outside the type's range). We set TREE_OVERFLOWED if,
1408 OVERFLOWED is nonzero,
1409 or OVERFLOWABLE is >0 and signed overflow occurs
1410 or OVERFLOWABLE is <0 and any overflow occurs
1411 We return a new tree node for the extended wide_int. The node
1412 is shared if no overflow flags are set. */
1415 tree
1418 {
1421 /* If we need to set overflow flags, return a new unshared node. */
1423 {
1427 {
1429 sign);
1430 tree t;
1433 else
1434 {
1437 {
1440 }
1442 }
1445 }
1446 }
1448 /* Else build a shared node. */
1450 }
1452 /* These are the hash table functions for the hash table of INTEGER_CST
1453 nodes of a sizetype. */
1455 /* Return the hash code X, an INTEGER_CST. */
1457 hashval_t
1459 {
1468 }
1470 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1471 is the same as that given by *Y, which is the same. */
1473 bool
1475 {
1489 }
1491 /* Create an INT_CST node of TYPE and value CST.
1492 The returned node is always shared. For small integers we use a
1493 per-type vector cache, for larger ones we use a single hash table.
1494 The value is extended from its precision according to the sign of
1495 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1496 the upper bits and ensures that hashing and value equality based
1497 upon the underlying HOST_WIDE_INTs works without masking. */
1499 static tree
1501 {
1502 tree t;
1510 /* Verify that everything is canonical. */
1513 {
1518 }
1524 {
1525 /* We just need to store a single HOST_WIDE_INT. */
1526 HOST_WIDE_INT hwi;
1529 else
1533 {
1536 /* Fallthru. */
1540 /* Cache NULL pointer and zero bounds. */
1542 {
1545 }
1549 /* Cache false or true. */
1558 {
1559 /* Cache [0, N). */
1563 }
1564 else
1565 {
1566 /* Cache [-1, N). */
1570 }
1578 }
1581 {
1582 /* Look for it in the type's vector of small shared ints. */
1584 {
1587 }
1591 /* Make sure no one is clobbering the shared constant. */
1597 else
1598 {
1599 /* Create a new shared int. */
1602 }
1603 }
1604 else
1605 {
1606 /* Use the cache of larger shared ints, using int_cst_node as
1607 a temporary. */
1615 {
1616 /* Insert this one into the hash table. */
1619 /* Make a new node for next time round. */
1621 }
1622 }
1623 }
1624 else
1625 {
1626 /* The value either hashes properly or we drop it on the floor
1627 for the gc to take care of. There will not be enough of them
1628 to worry about. */
1634 {
1635 /* Insert this one into the hash table. */
1638 }
1639 else
1641 }
1644 }
1646 hashval_t
1648 {
1656 }
1658 bool
1660 {
1667 }
1669 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1670 The elements must also have type TYPE. */
1672 tree
1674 {
1685 INSERT);
1687 {
1692 }
1694 }
1696 /* Create a constant tree with value VALUE in type TYPE. */
1698 tree
1700 {
1704 }
1706 void
1708 {
1717 {
1720 /* Fallthru. */
1724 /* Cache NULL pointer. */
1726 {
1729 }
1733 /* Cache false or true. */
1742 {
1743 /* Cache 0..N */
1746 /* This is a little hokie, but if the prec is smaller than
1747 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1748 obvious test will not get the correct answer. */
1750 {
1753 }
1756 }
1757 else
1758 {
1759 /* Cache -1..N */
1765 {
1767 {
1770 }
1773 }
1774 }
1782 }
1785 {
1786 /* Look for it in the type's vector of small shared ints. */
1788 {
1791 }
1795 }
1796 else
1797 {
1798 /* Use the cache of larger shared ints. */
1800 /* If there is already an entry for the number verify it's the
1801 same. */
1804 else
1805 /* Otherwise insert this one into the hash table. */
1807 }
1808 }
1811 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1812 and the rest are zeros. */
1814 tree
1816 {
1821 }
1823 /* Checks that X is integer constant that can be expressed in (unsigned)
1824 HOST_WIDE_INT without loss of precision. */
1826 bool
1828 {
1831 }
1833 /* Build a newly constructed VECTOR_CST with the given values of
1834 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1836 tree
1839 {
1841 tree t;
1857 }
1859 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1860 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1862 tree
1864 {
1866 tree value;
1868 /* We can't construct a VECTOR_CST for a variable number of elements. */
1872 {
1874 {
1875 /* If NELTS is constant then this must be too. */
1879 }
1880 else
1882 }
1887 }
1889 /* Build a vector of type VECTYPE where all the elements are SCs. */
1890 tree
1892 {
1898 /* Verify that the vector type is suitable for SC. Note that there
1899 is some inconsistency in the type-system with respect to restrict
1900 qualifications of pointers. Vector types always have a main-variant
1901 element type and the qualification is applied to the vector-type.
1902 So TREE_TYPE (vector-type) does not return a properly qualified
1903 vector element-type. */
1908 {
1912 }
1915 else
1916 {
1922 }
1923 }
1925 /* If TYPE is not a vector type, just return SC, otherwise return
1926 build_vector_from_val (TYPE, SC). */
1928 tree
1930 {
1935 }
1937 /* Build a vector series of type TYPE in which element I has the value
1938 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1939 and a VEC_SERIES_EXPR otherwise. */
1941 tree
1943 {
1947 {
1957 }
1959 }
1961 /* Return a vector with the same number of units and number of bits
1962 as VEC_TYPE, but in which the elements are a linear series of unsigned
1963 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1965 tree
1967 {
1972 {
1973 index_elt_type = build_nonstandard_integer_type
1976 }
1982 }
1984 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1985 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1987 void
1989 {
1991 tree val;
1997 {
1998 /* Mostly ctors will have elts that don't have side-effects, so
1999 the usual case is to scan all the elements. Hence a single
2000 loop for both const and side effects, rather than one loop
2001 each (with early outs). */
2006 }
2010 }
2012 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2013 CONSTRUCTOR C. */
2015 void
2017 {
2019 tree val;
2025 {
2030 }
2031 }
2033 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2034 are in the vec pointed to by VALS. */
2035 tree
2037 {
2046 }
2048 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2049 INDEX and VALUE. */
2050 tree
2052 {
2060 }
2063 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2064 are in a list pointed to by VALS. */
2065 tree
2067 {
2068 tree t;
2072 {
2076 }
2079 }
2081 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2082 of elements, provided as index/value pairs. */
2084 tree
2086 {
2093 {
2097 }
2100 }
2102 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2104 tree
2106 {
2110 }
2112 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2114 tree
2116 {
2117 tree v;
2127 }
2129 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2131 tree
2133 {
2134 tree v;
2138 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2139 Consider doing it via real_convert now. */
2149 }
2151 /* Like build_real, but first truncate D to the type. */
2153 tree
2155 {
2157 }
2159 /* Return a new REAL_CST node whose type is TYPE
2160 and whose value is the integer value of the INTEGER_CST node I. */
2162 REAL_VALUE_TYPE
2164 {
2165 REAL_VALUE_TYPE d;
2167 /* Clear all bits of the real value type so that we can later do
2168 bitwise comparisons to see if two values are the same. */
2174 }
2176 /* Given a tree representing an integer constant I, return a tree
2177 representing the same value as a floating-point constant of type TYPE. */
2179 tree
2181 {
2182 tree v;
2189 }
2191 /* Return a newly constructed STRING_CST node whose value is
2192 the LEN characters at STR.
2193 Note that for a C string literal, LEN should include the trailing NUL.
2194 The TREE_TYPE is not initialized. */
2196 tree
2198 {
2199 tree s;
2202 /* Do not waste bytes provided by padding of struct tree_string. */
2217 }
2219 /* Return a newly constructed COMPLEX_CST node whose value is
2220 specified by the real and imaginary parts REAL and IMAG.
2221 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2222 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2224 tree
2226 {
2237 }
2239 /* Build a complex (inf +- 0i), such as for the result of cproj.
2240 TYPE is the complex tree type of the result. If NEG is true, the
2241 imaginary zero is negative. */
2243 tree
2245 {
2252 }
2254 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2255 element is set to 1. In particular, this is 1 + i for complex types. */
2257 tree
2259 {
2261 {
2264 }
2265 else
2267 }
2269 /* Return a constant of arithmetic type TYPE which is the
2270 multiplicative identity of the set TYPE. */
2272 tree
2274 {
2276 {
2286 /* We can only generate 1 for accum types. */
2291 {
2295 }
2304 }
2305 }
2307 /* Return an integer of type TYPE containing all 1's in as much precision as
2308 it contains, or a complex or vector whose subparts are such integers. */
2310 tree
2312 {
2314 {
2317 }
2318 else
2320 }
2322 /* Return a constant of arithmetic type TYPE which is the
2323 opposite of the multiplicative identity of the set TYPE. */
2325 tree
2327 {
2329 {
2339 /* We can only generate 1 for accum types. */
2346 {
2350 }
2359 }
2360 }
2362 /* Build 0 constant of type TYPE. This is used by constructor folding
2363 and thus the constant should be represented in memory by
2364 zero(es). */
2366 tree
2368 {
2370 {
2383 {
2387 }
2390 {
2394 }
2400 }
2401 }
2404 /* Build a BINFO with LEN language slots. */
2406 tree
2408 {
2409 tree t;
2424 }
2426 /* Create a CASE_LABEL_EXPR tree node and return it. */
2428 tree
2430 {
2442 }
2444 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2445 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2446 The latter determines the length of the HOST_WIDE_INT vector. */
2448 tree
2450 {
2451 tree t;
2463 /* to_offset can only be applied to trees that are offset_int-sized
2464 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2465 must be exactly the precision of offset_int and so LEN is correct. */
2468 else
2474 }
2476 /* Build a newly constructed TREE_VEC node of length LEN. */
2478 tree
2480 {
2481 tree t;
2492 }
2494 /* Grow a TREE_VEC node to new length LEN. */
2496 tree
2498 {
2514 }
2515 \f
2516 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2517 fixed, and scalar, complex or vector. */
2519 bool
2521 {
2525 }
2527 /* Return 1 if EXPR is the integer constant zero or a complex constant
2528 of zero, or a location wrapper for such a constant. */
2530 bool
2532 {
2536 {
2548 }
2549 }
2551 /* Return 1 if EXPR is the integer constant one or the corresponding
2552 complex constant, or a location wrapper for such a constant. */
2554 bool
2556 {
2560 {
2572 }
2573 }
2575 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2576 return 1 if every piece is the integer constant one.
2577 Also return 1 for location wrappers for such a constant. */
2579 bool
2581 {
2587 else
2589 }
2591 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2592 it contains, or a complex or vector whose subparts are such integers,
2593 or a location wrapper for such a constant. */
2595 bool
2597 {
2615 }
2617 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2618 for such a constant. */
2620 bool
2622 {
2628 else
2630 }
2632 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2633 one bit on), or a location wrapper for such a constant. */
2635 bool
2637 {
2649 }
2651 /* Return 1 if EXPR is an integer constant other than zero or a
2652 complex constant other than zero, or a location wrapper for such a
2653 constant. */
2655 bool
2657 {
2665 }
2667 /* Return 1 if EXPR is the integer constant one. For vector,
2668 return 1 if every piece is the integer constant minus one
2669 (representing the value TRUE).
2670 Also return 1 for location wrappers for such a constant. */
2672 bool
2674 {
2680 }
2682 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2683 for such a constant. */
2685 bool
2687 {
2692 }
2694 /* Return the power of two represented by a tree node known to be a
2695 power of two. */
2697 int
2699 {
2704 }
2706 /* Similar, but return the largest integer Y such that 2 ** Y is less
2707 than or equal to EXPR. */
2709 int
2711 {
2716 }
2718 /* Return number of known trailing zero bits in EXPR, or, if the value of
2719 EXPR is known to be zero, the precision of it's type. */
2721 unsigned int
2723 {
2730 {
2751 /* Second operand is sizetype, which could be in theory
2752 wider than pointer's precision. Make sure we never
2753 return more than prec. */
2768 {
2771 }
2776 {
2781 }
2790 {
2793 {
2798 }
2799 }
2801 CASE_CONVERT:
2819 {
2822 }
2826 }
2827 }
2829 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2830 decimal float constants, so don't return 1 for them.
2831 Also return 1 for location wrappers around such a constant. */
2833 bool
2835 {
2839 {
2847 {
2848 /* Don't simply check for a duplicate because the predicate
2849 accepts both +0.0 and -0.0. */
2855 }
2858 }
2859 }
2861 /* Return 1 if EXPR is the real constant one in real or complex form.
2862 Trailing zeroes matter for decimal float constants, so don't return
2863 1 for them.
2864 Also return 1 for location wrappers around such a constant. */
2866 bool
2868 {
2872 {
2885 }
2886 }
2888 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2889 matter for decimal float constants, so don't return 1 for them.
2890 Also return 1 for location wrappers around such a constant. */
2892 bool
2894 {
2898 {
2911 }
2912 }
2914 /* Nonzero if EXP is a constant or a cast of a constant. */
2916 bool
2918 {
2919 /* This is not quite the same as STRIP_NOPS. It does more. */
2924 }
2926 /* Return true if T holds a polynomial pointer difference, storing it in
2927 *VALUE if so. A true return means that T's precision is no greater
2928 than 64 bits, which is the largest address space we support, so *VALUE
2929 never loses precision. However, the signedness of the result does
2930 not necessarily match the signedness of T: sometimes an unsigned type
2931 like sizetype is used to encode a value that is actually negative. */
2933 bool
2935 {
2939 {
2944 }
2946 {
2953 }
2955 }
2957 poly_int64
2959 {
2964 }
2966 poly_uint64
2968 {
2973 }
2974 \f
2975 /* Return first list element whose TREE_VALUE is ELEM.
2976 Return 0 if ELEM is not in LIST. */
2978 tree
2980 {
2982 {
2986 }
2988 }
2990 /* Return first list element whose TREE_PURPOSE is ELEM.
2991 Return 0 if ELEM is not in LIST. */
2993 tree
2995 {
2997 {
3001 }
3003 }
3005 /* Return true if ELEM is in V. */
3007 bool
3009 {
3011 tree t;
3016 }
3018 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3019 NULL_TREE. */
3021 tree
3023 {
3027 }
3029 /* Return nonzero if ELEM is part of the chain CHAIN. */
3031 bool
3033 {
3035 {
3039 }
3042 }
3044 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3045 We expect a null pointer to mark the end of the chain.
3046 This is the Lisp primitive `length'. */
3048 int
3050 {
3052 #ifdef ENABLE_TREE_CHECKING
3054 #endif
3058 {
3060 #ifdef ENABLE_TREE_CHECKING
3064 #endif
3065 len++;
3066 }
3069 }
3071 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3072 UNION_TYPE TYPE, or NULL_TREE if none. */
3074 tree
3076 {
3081 }
3083 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3084 by modifying the last node in chain 1 to point to chain 2.
3085 This is the Lisp primitive `nconc'. */
3087 tree
3089 {
3090 tree t1;
3101 #ifdef ENABLE_TREE_CHECKING
3102 {
3103 tree t2;
3106 }
3107 #endif
3110 }
3112 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3114 tree
3116 {
3117 tree next;
3122 }
3124 /* Reverse the order of elements in the chain T,
3125 and return the new head of the chain (old last element). */
3127 tree
3129 {
3132 {
3133 /* We shouldn't be using this function to reverse BLOCK chains; we
3134 have blocks_nreverse for that. */
3139 }
3141 }
3142 \f
3143 /* Return a newly created TREE_LIST node whose
3144 purpose and value fields are PARM and VALUE. */
3146 tree
3148 {
3153 }
3155 /* Build a chain of TREE_LIST nodes from a vector. */
3157 tree
3159 {
3163 tree t;
3165 {
3168 }
3170 }
3172 /* Return a newly created TREE_LIST node whose
3173 purpose and value fields are PURPOSE and VALUE
3174 and whose TREE_CHAIN is CHAIN. */
3176 tree
3178 {
3179 tree node;
3191 }
3193 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3194 trees. */
3198 {
3202 tree val;
3208 }
3209 \f
3210 /* Return the size nominally occupied by an object of type TYPE
3211 when it resides in memory. The value is measured in units of bytes,
3212 and its data type is that normally used for type sizes
3213 (which is the first type created by make_signed_type or
3214 make_unsigned_type). */
3216 tree
3218 {
3219 tree t;
3228 {
3231 }
3234 }
3236 /* Return the size of TYPE (in bytes) as a wide integer
3237 or return -1 if the size can vary or is larger than an integer. */
3239 HOST_WIDE_INT
3241 {
3242 tree t;
3252 else
3254 }
3256 /* Return the maximum size of TYPE (in bytes) as a wide integer
3257 or return -1 if the size can vary or is larger than an integer. */
3259 HOST_WIDE_INT
3261 {
3263 tree size_tree;
3265 /* If this is an array type, check for a possible MAX_SIZE attached. */
3268 {
3273 }
3275 /* If we still haven't been able to get a size, see if the language
3276 can compute a maximum size. */
3279 {
3284 }
3287 }
3288 \f
3289 /* Return the bit position of FIELD, in bits from the start of the record.
3290 This is a tree of type bitsizetype. */
3292 tree
3294 {
3297 }
3298 \f
3299 /* Return the byte position of FIELD, in bytes from the start of the record.
3300 This is a tree of type sizetype. */
3302 tree
3304 {
3307 }
3309 /* Likewise, but return as an integer. It must be representable in
3310 that way (since it could be a signed value, we don't have the
3311 option of returning -1 like int_size_in_byte can. */
3313 HOST_WIDE_INT
3315 {
3317 }
3318 \f
3319 /* Return the strictest alignment, in bits, that T is known to have. */
3321 unsigned int
3323 {
3327 {
3329 /* If we have conversions, we know that the alignment of the
3330 object must meet each of the alignments of the types. */
3338 /* These don't change the alignment of an object. */
3342 /* The best we can do is say that the alignment is the least aligned
3343 of the two arms. */
3348 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3349 meaningfully, it's always 1. */
3358 }
3360 /* Otherwise take the alignment from that of the type. */
3362 }
3363 \f
3364 /* Return, as a tree node, the number of elements for TYPE (which is an
3365 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3367 tree
3369 {
3372 /* If they did it with unspecified bounds, then we should have already
3373 given an error about it before we got here. */
3381 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3386 ? max
3388 }
3389 \f
3390 /* If arg is static -- a reference to an object in static storage -- then
3391 return the object. This is not the same as the C meaning of `static'.
3392 If arg isn't static, return NULL. */
3394 tree
3396 {
3398 {
3400 /* Nested functions are static, even though taking their address will
3401 involve a trampoline as we unnest the nested function and create
3402 the trampoline on the tree level. */
3423 /* If the thing being referenced is not a field, then it is
3424 something language specific. */
3427 /* If we are referencing a bitfield, we can't evaluate an
3428 ADDR_EXPR at compile time and so it isn't a constant. */
3445 else
3453 }
3454 }
3456 \f
3459 /* Return whether OP is a DECL whose address is function-invariant. */
3461 bool
3463 {
3464 /* The conditions below are slightly less strict than the one in
3465 staticp. */
3468 {
3491 }
3494 }
3496 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3498 bool
3500 {
3501 /* The conditions below are slightly less strict than the one in
3502 staticp. */
3505 {
3525 }
3528 }
3531 /* Return true if T is function-invariant (internal function, does
3532 not handle arithmetic; that's handled in skip_simple_arithmetic and
3533 tree_invariant_p). */
3535 static bool
3537 {
3538 tree op;
3545 {
3552 {
3554 {
3569 }
3571 }
3577 }
3580 }
3582 /* Return true if T is function-invariant. */
3584 bool
3586 {
3589 }
3591 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3592 Do this to any expression which may be used in more than one place,
3593 but must be evaluated only once.
3595 Normally, expand_expr would reevaluate the expression each time.
3596 Calling save_expr produces something that is evaluated and recorded
3597 the first time expand_expr is called on it. Subsequent calls to
3598 expand_expr just reuse the recorded value.
3600 The call to expand_expr that generates code that actually computes
3601 the value is the first call *at compile time*. Subsequent calls
3602 *at compile time* generate code to use the saved value.
3603 This produces correct result provided that *at run time* control
3604 always flows through the insns made by the first expand_expr
3605 before reaching the other places where the save_expr was evaluated.
3606 You, the caller of save_expr, must make sure this is so.
3608 Constants, and certain read-only nodes, are returned with no
3609 SAVE_EXPR because that is safe. Expressions containing placeholders
3610 are not touched; see tree.def for an explanation of what these
3611 are used for. */
3613 tree
3615 {
3616 tree inner;
3618 /* If the tree evaluates to a constant, then we don't want to hide that
3619 fact (i.e. this allows further folding, and direct checks for constants).
3620 However, a read-only object that has side effects cannot be bypassed.
3621 Since it is no problem to reevaluate literals, we just return the
3622 literal node. */
3630 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3631 it means that the size or offset of some field of an object depends on
3632 the value within another field.
3634 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3635 and some variable since it would then need to be both evaluated once and
3636 evaluated more than once. Front-ends must assure this case cannot
3637 happen by surrounding any such subexpressions in their own SAVE_EXPR
3638 and forcing evaluation at the proper time. */
3644 /* This expression might be placed ahead of a jump to ensure that the
3645 value was computed on both sides of the jump. So make sure it isn't
3646 eliminated as dead. */
3649 }
3651 /* Look inside EXPR into any simple arithmetic operations. Return the
3652 outermost non-arithmetic or non-invariant node. */
3654 tree
3656 {
3657 /* We don't care about whether this can be used as an lvalue in this
3658 context. */
3662 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3663 a constant, it will be more efficient to not make another SAVE_EXPR since
3664 it will allow better simplification and GCSE will be able to merge the
3665 computations if they actually occur. */
3667 {
3671 {
3676 else
3678 }
3679 else
3681 }
3684 }
3686 /* Look inside EXPR into simple arithmetic operations involving constants.
3687 Return the outermost non-arithmetic or non-constant node. */
3689 tree
3691 {
3696 {
3700 {
3705 else
3707 }
3708 else
3710 }
3713 }
3715 /* Return which tree structure is used by T. */
3717 enum tree_node_structure_enum
3719 {
3722 }
3724 /* Set various status flags when building a CALL_EXPR object T. */
3726 static void
3728 {
3733 /* Calls have side-effects, except those to const or pure functions. */
3736 /* Propagate TREE_READONLY of arguments for const functions. */
3742 {
3748 }
3752 }
3753 \f
3754 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3755 size or offset that depends on a field within a record. */
3757 bool
3759 {
3770 {
3772 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3773 position computations since they will be converted into a
3774 WITH_RECORD_EXPR involving the reference, which will assume
3775 here will be valid. */
3789 {
3791 /* Ignoring the first operand isn't quite right, but works best. */
3800 /* The save_expr function never wraps anything containing
3801 a PLACEHOLDER_EXPR. */
3806 }
3809 {
3817 }
3821 {
3823 {
3824 const_tree arg;
3825 const_call_expr_arg_iterator iter;
3830 }
3833 }
3837 }
3839 }
3841 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3842 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3843 field positions. */
3845 static bool
3847 {
3848 /* If the size contains a placeholder or the parent type (component type in
3849 the case of arrays) type involves a placeholder, this type does. */
3857 /* Now do type-specific checks. Note that the last part of the check above
3858 greatly limits what we have to do below. */
3860 {
3877 /* Here we just check the bounds. */
3882 /* We have already checked the component type above, so just check
3883 the domain type. Flexible array members have a null domain. */
3890 {
3891 tree field;
3902 }
3906 }
3907 }
3909 /* Wrapper around above function used to cache its result. */
3911 bool
3913 {
3916 /* If the contains_placeholder_bits field has been initialized,
3917 then we know the answer. */
3921 /* Indicate that we've seen this type node, and the answer is false.
3922 This is what we want to return if we run into recursion via fields. */
3925 /* Compute the real value. */
3928 /* Store the real value. */
3932 }
3933 \f
3934 /* Push tree EXP onto vector QUEUE if it is not already present. */
3936 static void
3938 {
3940 tree iter;
3948 }
3950 /* Given a tree EXP, find all occurrences of references to fields
3951 in a PLACEHOLDER_EXPR and place them in vector REFS without
3952 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3953 we assume here that EXP contains only arithmetic expressions
3954 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3955 argument list. */
3957 void
3959 {
3961 tree inner;
3964 /* We handle TREE_LIST and COMPONENT_REF separately. */
3966 {
3969 }
3971 {
3975 ;
3979 else
3981 }
3982 else
3984 {
3989 /* Variables allocated to static storage can stay. */
3995 /* This is the pattern built in ada/make_aligning_type. */
3998 {
4001 }
4003 /* Fall through. */
4021 }
4022 }
4024 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4025 return a tree with all occurrences of references to F in a
4026 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4027 CONST_DECLs. Note that we assume here that EXP contains only
4028 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4029 occurring only in their argument list. */
4031 tree
4033 {
4036 tree new_tree;
4038 /* We handle TREE_LIST and COMPONENT_REF separately. */
4040 {
4047 }
4049 {
4050 tree inner;
4052 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4053 and it is the right field, replace it with R. */
4057 ;
4059 /* The field. */
4065 /* If this expression hasn't been completed let, leave it alone. */
4073 new_tree
4075 }
4076 else
4078 {
4085 else
4092 /* Fall through. */
4100 {
4145 new_tree
4151 }
4155 {
4160 /* If we are trying to replace F with a constant or with another
4161 instance of one of the arguments of the call, inline back
4162 functions which do nothing else than computing a value from
4163 the arguments they are passed. This makes it possible to
4164 fold partially or entirely the replacement expression. */
4166 {
4170 else
4173 {
4176 }
4178 {
4182 }
4183 }
4186 {
4190 {
4194 }
4195 }
4198 {
4202 }
4203 else
4205 }
4210 }
4218 }
4220 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4221 for it within OBJ, a tree that is an object or a chain of references. */
4223 tree
4225 {
4228 tree new_tree;
4230 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4231 in the chain of OBJ. */
4233 {
4235 tree elt;
4265 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4266 survives until RTL generation, there will be an error. */
4268 }
4270 /* TREE_LIST is special because we need to look at TREE_VALUE
4271 and TREE_CHAIN, not TREE_OPERANDS. */
4273 {
4280 }
4281 else
4283 {
4296 {
4341 new_tree
4347 }
4351 {
4357 {
4361 {
4365 }
4366 }
4369 {
4373 }
4374 else
4376 }
4381 }
4389 }
4390 \f
4392 /* Subroutine of stabilize_reference; this is called for subtrees of
4393 references. Any expression with side-effects must be put in a SAVE_EXPR
4394 to ensure that it is only evaluated once.
4396 We don't put SAVE_EXPR nodes around everything, because assigning very
4397 simple expressions to temporaries causes us to miss good opportunities
4398 for optimizations. Among other things, the opportunity to fold in the
4399 addition of a constant into an addressing mode often gets lost, e.g.
4400 "y[i+1] += x;". In general, we take the approach that we should not make
4401 an assignment unless we are forced into it - i.e., that any non-side effect
4402 operator should be allowed, and that cse should take care of coalescing
4403 multiple utterances of the same expression should that prove fruitful. */
4405 static tree
4407 {
4408 tree result;
4411 /* We cannot ignore const expressions because it might be a reference
4412 to a const array but whose index contains side-effects. But we can
4413 ignore things that are actual constant or that already have been
4414 handled by this function. */
4420 {
4422 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4423 have side-effects. */
4426 /* FALLTHRU */
4434 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4435 so that it will only be evaluated once. */
4436 /* The reference (r) and comparison (<) classes could be handled as
4437 below, but it is generally faster to only evaluate them once. */
4443 /* Constants need no processing. In fact, we should never reach
4444 here. */
4448 /* Division is slow and tends to be compiled with jumps,
4449 especially the division by powers of 2 that is often
4450 found inside of an array reference. So do it just once. */
4456 /* Recursively stabilize each operand. */
4462 /* Recursively stabilize each operand. */
4468 }
4476 }
4478 /* Stabilize a reference so that we can use it any number of times
4479 without causing its operands to be evaluated more than once.
4480 Returns the stabilized reference. This works by means of save_expr,
4481 so see the caveats in the comments about save_expr.
4483 Also allows conversion expressions whose operands are references.
4484 Any other kind of expression is returned unchanged. */
4486 tree
4488 {
4489 tree result;
4493 {
4497 /* No action is needed in this case. */
4500 CASE_CONVERT:
4539 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4540 it wouldn't be ignored. This matters when dealing with
4541 volatiles. */
4544 /* If arg isn't a kind of lvalue we recognize, make no change.
4545 Caller should recognize the error for an invalid lvalue. */
4551 }
4559 }
4560 \f
4561 /* Low-level constructors for expressions. */
4563 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4564 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4566 void
4568 {
4569 tree node;
4574 /* We started out assuming this address is both invariant and constant, but
4575 does not have side effects. Now go down any handled components and see if
4576 any of them involve offsets that are either non-constant or non-invariant.
4577 Also check for side-effects.
4579 ??? Note that this code makes no attempt to deal with the case where
4580 taking the address of something causes a copy due to misalignment. */
4582 #define UPDATE_FLAGS(NODE) \
4583 do { tree _node = (NODE); \
4584 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4585 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4589 {
4590 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4591 array reference (probably made temporarily by the G++ front end),
4592 so ignore all the operands. */
4596 {
4602 }
4603 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4604 FIELD_DECL, apparently. The G++ front end can put something else
4605 there, at least temporarily. */
4608 {
4611 }
4612 }
4616 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4617 the address, since &(*a)->b is a form of addition. If it's a constant, the
4618 address is constant too. If it's a decl, its address is constant if the
4619 decl is static. Everything else is not constant and, furthermore,
4620 taking the address of a volatile variable is not volatile. */
4625 ;
4628 else
4629 {
4632 }
4637 #undef UPDATE_FLAGS
4638 }
4640 /* Build an expression of code CODE, data type TYPE, and operands as
4641 specified. Expressions and reference nodes can be created this way.
4642 Constants, decls, types and misc nodes cannot be.
4644 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4645 enough for all extant tree codes. */
4647 tree
4649 {
4650 tree t;
4658 }
4660 tree
4662 {
4664 tree t;
4680 {
4683 }
4686 {
4689 }
4691 {
4693 /* All of these have side-effects, no matter what their
4694 operands are. */
4700 /* Whether a dereference is readonly has nothing to do with whether
4701 its operand is readonly. */
4719 }
4722 }
4724 #define PROCESS_ARG(N) \
4725 do { \
4726 TREE_OPERAND (t, N) = arg##N; \
4727 if (arg##N &&!TYPE_P (arg##N)) \
4728 { \
4729 if (TREE_SIDE_EFFECTS (arg##N)) \
4730 side_effects = 1; \
4731 if (!TREE_READONLY (arg##N) \
4732 && !CONSTANT_CLASS_P (arg##N)) \
4733 (void) (read_only = 0); \
4734 if (!TREE_CONSTANT (arg##N)) \
4735 (void) (constant = 0); \
4736 } \
4737 } while (0)
4739 tree
4741 {
4743 tree t;
4749 /* When sizetype precision doesn't match that of pointers
4750 we need to be able to build explicit extensions or truncations
4751 of the offset argument. */
4763 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4764 result based on those same flags for the arguments. But if the
4765 arguments aren't really even `tree' expressions, we shouldn't be trying
4766 to do this. */
4768 /* Expressions without side effects may be constant if their
4769 arguments are as well. */
4776 {
4790 }
4797 {
4799 {
4803 }
4804 }
4805 else
4806 {
4808 /* Don't mark X / 0 as constant. */
4813 }
4816 }
4819 tree
4821 tree arg2 MEM_STAT_DECL)
4822 {
4824 tree t;
4834 /* As a special exception, if COND_EXPR has NULL branches, we
4835 assume that it is a gimple statement and always consider
4836 it to have side effects. */
4842 else
4858 }
4860 tree
4863 {
4865 tree t;
4885 }
4887 tree
4890 {
4892 tree t;
4909 {
4911 {
4915 }
4916 }
4917 else
4923 }
4925 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4926 on the pointer PTR. */
4928 tree
4930 {
4933 tree tem;
4934 /* For convenience allow addresses that collapse to a simple base
4935 and offset. */
4939 {
4943 {
4946 }
4947 else
4950 }
4955 }
4957 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4959 poly_offset_int
4961 {
4963 SIGNED);
4964 }
4966 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4967 offsetted by OFFSET units. */
4969 tree
4971 {
4978 }
4980 /* Similar except don't specify the TREE_TYPE
4981 and leave the TREE_SIDE_EFFECTS as 0.
4982 It is permissible for arguments to be null,
4983 or even garbage if their values do not matter. */
4985 tree
4987 {
4988 tree t;
5005 }
5007 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5008 tree vec. */
5010 tree
5012 {
5022 }
5023 \f
5024 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5025 and data type TYPE.
5026 We do NOT enter this node in any sort of symbol table.
5028 LOC is the location of the decl.
5030 layout_decl is used to set up the decl's storage layout.
5031 Other slots are initialized to 0 or null pointers. */
5033 tree
5035 tree type MEM_STAT_DECL)
5036 {
5037 tree t;
5042 /* if (type == error_mark_node)
5043 type = integer_type_node; */
5044 /* That is not done, deliberately, so that having error_mark_node
5045 as the type can suppress useless errors in the use of this variable. */
5054 }
5056 /* Builds and returns function declaration with NAME and TYPE. */
5058 tree
5060 {
5070 }
5074 /* Builds a new translation-unit decl with name NAME, queues it in the
5075 global list of translation-unit decls and returns it. */
5077 tree
5079 {
5085 }
5087 \f
5088 /* BLOCK nodes are used to represent the structure of binding contours
5089 and declarations, once those contours have been exited and their contents
5090 compiled. This information is used for outputting debugging info. */
5092 tree
5094 {
5102 }
5104 \f
5105 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5107 LOC is the location to use in tree T. */
5109 void
5111 {
5114 }
5116 /* Data used when collecting DECLs and TYPEs for language data removal. */
5118 class free_lang_data_d
5119 {
5123 /* Worklist to avoid excessive recursion. */
5126 /* Set of traversed objects. Used to avoid duplicate visits. */
5129 /* Array of symbols to process with free_lang_data_in_decl. */
5132 /* Array of types to process with free_lang_data_in_type. */
5134 };
5137 /* Add type or decl T to one of the list of tree nodes that need their
5138 language data removed. The lists are held inside FLD. */
5140 static void
5142 {
5147 else
5149 }
5151 /* Push tree node T into FLD->WORKLIST. */
5155 {
5158 }
5161 \f
5162 /* Return simplified TYPE_NAME of TYPE. */
5164 static tree
5166 {
5169 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5170 TYPE_DECL if the type doesn't have linkage.
5171 this must match fld_ */
5179 }
5181 /* Do same comparsion as check_qualified_type skipping lang part of type
5182 and be more permissive about type names: we only care that names are
5183 same (for diagnostics) and that ODR names are the same.
5184 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5186 static bool
5188 {
5190 /* We want to match incomplete variants with complete types.
5191 In this case we need to ignore alignment. */
5202 }
5204 /* Find variant of FIRST that match T and create new one if necessary.
5205 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5207 static tree
5210 {
5225 /* Variants of incomplete types should have alignment
5226 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5228 {
5231 }
5238 }
5240 /* Map complete types to incomplete types. */
5244 /* Map types to simplified types. */
5248 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5249 use MAP to prevent duplicates. */
5251 static tree
5254 {
5259 {
5260 return fld_type_variant
5264 }
5267 tree &array
5270 {
5276 }
5278 }
5280 /* Return CTX after removal of contexts that are not relevant */
5282 static tree
5284 {
5285 /* Variably modified types are needed for tree_is_indexable to decide
5286 whether the type needs to go to local or global section.
5287 This code is semi-broken but for now it is easiest to keep contexts
5288 as expected. */
5291 {
5294 }
5296 }
5298 /* For T being aggregate type try to turn it into a incomplete variant.
5299 Return T if no simplification is possible. */
5301 static tree
5303 {
5307 {
5310 {
5311 tree first;
5315 else
5323 }
5325 }
5334 {
5336 tree ©
5340 {
5343 /* It is possible that type was not seen by free_lang_data yet. */
5352 {
5358 }
5359 else
5362 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5363 This is needed for ODR violation warnings to come out right (we
5364 want duplicate TYPE_DECLs whenever the type is duplicated because
5365 of ODR violation. Because lang data in the TYPE_DECL may not
5366 have been freed yet, rebuild it from scratch and copy relevant
5367 fields. */
5372 {
5382 }
5383 }
5385 }
5388 }
5390 /* Simplify type T for scenarios where we do not need complete pointer
5391 types. */
5393 static tree
5395 {
5400 /* FIXME: This triggers verification error, see PR88140. */
5405 }
5407 /* Reset the expression *EXPR_P, a size or position.
5409 ??? We could reset all non-constant sizes or positions. But it's cheap
5410 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5412 We need to reset self-referential sizes or positions because they cannot
5413 be gimplified and thus can contain a CALL_EXPR after the gimplification
5414 is finished, which will run afoul of LTO streaming. And they need to be
5415 reset to something essentially dummy but not constant, so as to preserve
5416 the properties of the object they are attached to. */
5420 {
5424 }
5427 /* Reset all the fields in a binfo node BINFO. We only keep
5428 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5430 static void
5432 {
5434 tree t;
5446 }
5449 /* Reset all language specific information still present in TYPE. */
5451 static void
5453 {
5456 /* Give the FE a chance to remove its own data first. */
5469 /* Purge non-marked variants from the variants chain, so that they
5470 don't reappear in the IL after free_lang_data. */
5473 {
5476 /* Turn the removed types into distinct types. */
5479 }
5482 {
5484 /* Remove the const and volatile qualifiers from arguments. The
5485 C++ front end removes them, but the C front end does not,
5486 leading to false ODR violation errors when merging two
5487 instances of the same function signature compiled by
5488 different front ends. */
5490 {
5495 {
5497 & ~TYPE_QUAL_CONST
5502 }
5503 /* C++ FE uses TREE_PURPOSE to store initial values. */
5505 }
5506 }
5508 {
5511 {
5512 /* C++ FE uses TREE_PURPOSE to store initial values. */
5515 }
5516 }
5518 {
5519 /* Remove members that are not FIELD_DECLs from the field list
5520 of an aggregate. These occur in C++. */
5524 else
5530 {
5532 /* We need to preserve link to bases and virtual table for all
5533 polymorphic types to make devirtualization machinery working. */
5537 }
5538 }
5542 {
5544 {
5545 /* Type values are used only for C++ ODR checking. Drop them
5546 for all type variants and non-ODR types.
5547 For ODR types the data is freed in free_odr_warning_data. */
5551 else
5552 /* Simplify representation by recording only values rather
5553 than const decls. */
5557 }
5560 }
5569 {
5571 do
5572 {
5574 }
5577 }
5581 }
5584 /* Return true if DECL may need an assembler name to be set. */
5588 {
5589 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5590 Rule merging. This makes type_odr_p to return true on those types during
5591 LTO and by comparing the mangled name, we can say what types are intended
5592 to be equivalent across compilation unit.
5594 We do not store names of type_in_anonymous_namespace_p.
5596 Record, union and enumeration type have linkage that allows use
5597 to check type_in_anonymous_namespace_p. We do not mangle compound types
5598 that always can be compared structurally.
5600 Similarly for builtin types, we compare properties of their main variant.
5601 A special case are integer types where mangling do make differences
5602 between char/signed char/unsigned char etc. Storing name for these makes
5603 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5604 See cp/mangle.c:write_builtin_type for details. */
5607 {
5620 }
5621 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5625 /* If DECL already has its assembler name set, it does not need a
5626 new one. */
5631 /* Abstract decls do not need an assembler name. */
5635 /* For VAR_DECLs, only static, public and external symbols need an
5636 assembler name. */
5644 {
5645 /* Do not set assembler name on builtins. Allow RTL expansion to
5646 decide whether to expand inline or via a regular call. */
5651 /* Functions represented in the callgraph need an assembler name. */
5655 /* Unused and not public functions don't need an assembler name. */
5658 }
5661 }
5664 /* Reset all language specific information still present in symbol
5665 DECL. */
5667 static void
5669 {
5672 /* Give the FE a chance to remove its own data first. */
5686 {
5691 }
5694 {
5696 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5697 the address may be taken in other unit, so this flag has no practical
5698 use for middle-end.
5700 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5701 for public objects that indeed cannot be adressed, but it is not
5702 the case. Set the flag to true so we do not get merge failures for
5703 i.e. virtual tables between units that take address of it and
5704 units that don't. */
5710 {
5713 else
5714 {
5719 }
5720 }
5722 {
5723 tree t;
5725 /* If DECL has a gimple body, then the context for its
5726 arguments must be DECL. Otherwise, it doesn't really
5727 matter, as we will not be emitting any code for DECL. In
5728 general, there may be other instances of DECL created by
5729 the front end and since PARM_DECLs are generally shared,
5730 their DECL_CONTEXT changes as the replicas of DECL are
5731 created. The only time where DECL_CONTEXT is important
5732 is for the FUNCTION_DECLs that have a gimple body (since
5733 the PARM_DECL will be used in the function's body). */
5742 }
5744 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5745 At this point, it is not needed anymore. */
5748 /* Clear the abstract origin if it refers to a method.
5749 Otherwise dwarf2out.c will ICE as we splice functions out of
5750 TYPE_FIELDS and thus the origin will not be output
5751 correctly. */
5754 && RECORD_OR_UNION_TYPE_P
5759 }
5761 {
5762 /* See comment above why we set the flag for functoins. */
5769 }
5771 {
5782 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5783 }
5785 {
5788 }
5792 {
5793 /* Strip builtins from the translation-unit BLOCK. We still have targets
5794 without builtin_decl_explicit support and also builtins are shared
5795 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5798 {
5802 else
5804 }
5805 }
5806 /* We need to keep field decls associated with their trees. Otherwise tree
5807 merging may merge some fileds and keep others disjoint wich in turn will
5808 not do well with TREE_CHAIN pointers linking them.
5810 Also do not drop containing types for virtual methods and tables because
5811 these are needed by devirtualization.
5812 C++ destructors are special because C++ frontends sometimes produces
5813 virtual destructor as an alias of non-virtual destructor. In
5814 devirutalization code we always walk through aliases and we need
5815 context to be preserved too. See PR89335 */
5822 }
5825 /* Operand callback helper for free_lang_data_in_node. *TP is the
5826 subtree operand being considered. */
5828 static tree
5830 {
5837 /* Language specific nodes will be removed, so there is no need
5838 to gather anything under them. */
5840 {
5843 }
5846 {
5847 /* Note that walk_tree does not traverse every possible field in
5848 decls, so we have to do our own traversals here. */
5856 /* We are going to remove everything under DECL_INITIAL for
5857 TYPE_DECLs. No point walking them. */
5865 {
5868 }
5870 {
5875 }
5885 }
5887 {
5888 /* Note that walk_tree does not traverse every possible field in
5889 types, so we have to do our own traversals here. */
5900 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5901 lists, we may look types up in these lists and use them while
5902 optimizing the function body. Thus we need to free lang data
5903 in them. */
5910 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5914 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5915 do not and want not to reach unused variants this way. */
5917 {
5919 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5920 So push that instead. */
5924 }
5928 {
5930 tree tem;
5935 }
5937 {
5938 tree tem;
5939 /* Push all TYPE_FIELDS - there can be interleaving interesting
5940 and non-interesting things. */
5943 {
5947 }
5948 }
5954 }
5956 {
5958 {
5961 {
5965 }
5966 else
5967 {
5970 }
5971 }
5975 }
5982 }
5985 /* Find decls and types in T. */
5987 static void
5989 {
5991 {
5997 }
5998 }
6000 /* Translate all the types in LIST with the corresponding runtime
6001 types. */
6003 static tree
6005 {
6015 {
6020 }
6023 }
6026 /* Find decls and types referenced in EH region R and store them in
6027 FLD->DECLS and FLD->TYPES. */
6029 static void
6031 {
6033 {
6038 {
6039 eh_catch c;
6041 /* The types referenced in each catch must first be changed to the
6042 EH types used at runtime. This removes references to FE types
6043 in the region. */
6045 {
6048 }
6049 }
6062 }
6063 }
6066 /* Find decls and types referenced in cgraph node N and store them in
6067 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6068 look for *every* kind of DECL and TYPE node reachable from N,
6069 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6070 NAMESPACE_DECLs, etc). */
6072 static void
6074 {
6075 basic_block bb;
6078 tree t;
6089 /* Traverse locals. */
6093 /* Traverse EH regions in FN. */
6094 {
6095 eh_region r;
6098 }
6100 /* Traverse every statement in FN. */
6102 {
6103 gphi_iterator psi;
6104 gimple_stmt_iterator si;
6108 {
6112 {
6115 }
6116 }
6119 {
6126 {
6129 }
6130 }
6131 }
6132 }
6135 /* Find decls and types referenced in varpool node N and store them in
6136 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6137 look for *every* kind of DECL and TYPE node reachable from N,
6138 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6139 NAMESPACE_DECLs, etc). */
6141 static void
6143 {
6145 }
6147 /* If T needs an assembler name, have one created for it. */
6149 void
6151 {
6153 {
6154 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6155 diagnostics that use input_location to show locus
6156 information. The problem here is that, at this point,
6157 input_location is generally anchored to the end of the file
6158 (since the parser is long gone), so we don't have a good
6159 position to pin it to.
6161 To alleviate this problem, this uses the location of T's
6162 declaration. Examples of this are
6163 testsuite/g++.dg/template/cond2.C and
6164 testsuite/g++.dg/template/pr35240.C. */
6171 }
6172 }
6175 /* Free language specific information for every operand and expression
6176 in every node of the call graph. This process operates in three stages:
6178 1- Every callgraph node and varpool node is traversed looking for
6179 decls and types embedded in them. This is a more exhaustive
6180 search than that done by find_referenced_vars, because it will
6181 also collect individual fields, decls embedded in types, etc.
6183 2- All the decls found are sent to free_lang_data_in_decl.
6185 3- All the types found are sent to free_lang_data_in_type.
6187 The ordering between decls and types is important because
6188 free_lang_data_in_decl sets assembler names, which includes
6189 mangling. So types cannot be freed up until assembler names have
6190 been set up. */
6192 static void
6194 {
6197 tree t;
6201 /* Find decls and types in the body of every function in the callgraph. */
6208 /* Find decls and types in every varpool symbol. */
6212 /* Set the assembler name on every decl found. We need to do this
6213 now because free_lang_data_in_decl will invalidate data needed
6214 for mangling. This breaks mangling on interdependent decls. */
6218 /* Traverse every decl found freeing its language data. */
6222 /* Traverse every type found freeing its language data. */
6225 }
6228 /* Free resources that are used by FE but are not needed once they are done. */
6230 static unsigned
6232 {
6236 /* If we are the LTO frontend we have freed lang-specific data already. */
6239 {
6240 /* Rebuild type inheritance graph even when not doing LTO to get
6241 consistent profile data. */
6244 }
6249 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6253 /* Allocate and assign alias sets to the standard integer types
6254 while the slots are still in the way the frontends generated them. */
6259 /* Traverse the IL resetting language specific information for
6260 operands, expressions, etc. */
6263 /* Create gimple variants for common types. */
6269 /* Reset some langhooks. Do not reset types_compatible_p, it may
6270 still be used indirectly via the get_alias_set langhook. */
6283 {
6285 tree t;
6289 }
6291 /* We do not want the default decl_assembler_name implementation,
6292 rather if we have fixed everything we want a wrapper around it
6293 asserting that all non-local symbols already got their assembler
6294 name and only produce assembler names for local symbols. Or rather
6295 make sure we never call decl_assembler_name on local symbols and
6296 devise a separate, middle-end private scheme for it. */
6298 /* Reset diagnostic machinery. */
6307 }
6313 {
6323 };
6326 {
6330 {}
6332 /* opt_pass methods: */
6339 simple_ipa_opt_pass *
6341 {
6343 }
6344 \f
6345 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6346 of the various TYPE_QUAL values. */
6348 static void
6350 {
6356 }
6358 /* Returns true iff CAND and BASE have equivalent language-specific
6359 qualifiers. */
6361 bool
6363 {
6366 /* type_hash_eq currently only applies to these types. */
6371 }
6373 /* This function checks to see if TYPE matches the size one of the built-in
6374 atomic types, and returns that core atomic type. */
6376 static tree
6378 {
6379 tree base_atomic_type;
6381 /* Only handle complete types. */
6386 {
6409 }
6412 }
6414 /* Returns true iff unqualified CAND and BASE are equivalent. */
6416 bool
6418 {
6420 /* Apparently this is needed for Objective-C. */
6425 /* Check alignment. */
6428 /* Atomic types increase minimal alignment. We must to do so as well
6429 or we get duplicated canonical types. See PR88686. */
6431 {
6432 /* See if this object can map to a basic atomic type. */
6436 }
6438 }
6440 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6442 bool
6444 {
6448 }
6450 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6452 static bool
6454 {
6457 /* Apparently this is needed for Objective-C. */
6459 /* Check alignment. */
6464 }
6466 /* Return a version of the TYPE, qualified as indicated by the
6467 TYPE_QUALS, if one exists. If no qualified version exists yet,
6468 return NULL_TREE. */
6470 tree
6472 {
6480 /* Search the chain of variants to see if there is already one there just
6481 like the one we need to have. If so, use that existing one. We must
6482 preserve the TYPE_NAME, since there is code that depends on this. */
6485 {
6486 /* Put the found variant at the head of the variant list so
6487 frequently searched variants get found faster. The C++ FE
6488 benefits greatly from this. */
6494 }
6497 }
6499 /* Like get_qualified_type, but creates the type if it does not
6500 exist. This function never returns NULL_TREE. */
6502 tree
6504 {
6505 tree t;
6507 /* See if we already have the appropriate qualified variant. */
6510 /* If not, build it. */
6512 {
6517 {
6518 /* See if this object can map to a basic atomic type. */
6521 {
6522 /* Ensure the alignment of this type is compatible with
6523 the required alignment of the atomic type. */
6526 }
6527 }
6530 /* Propagate structural equality. */
6533 /* Build the underlying canonical type, since it is different
6534 from TYPE. */
6535 {
6538 }
6539 else
6540 /* T is its own canonical type. */
6543 }
6546 }
6548 /* Create a variant of type T with alignment ALIGN. */
6550 tree
6552 {
6553 tree t;
6568 }
6570 /* Create a new distinct copy of TYPE. The new type is made its own
6571 MAIN_VARIANT. If TYPE requires structural equality checks, the
6572 resulting type requires structural equality checks; otherwise, its
6573 TYPE_CANONICAL points to itself. */
6575 tree
6577 {
6583 /* Set the canonical type either to a new equivalence class, or
6584 propagate the need for structural equality checks. */
6587 else
6590 /* Make it its own variant. */
6594 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6595 whose TREE_TYPE is not t. This can also happen in the Ada
6596 frontend when using subtypes. */
6599 }
6601 /* Create a new variant of TYPE, equivalent but distinct. This is so
6602 the caller can modify it. TYPE_CANONICAL for the return type will
6603 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6604 are considered equal by the language itself (or that both types
6605 require structural equality checks). */
6607 tree
6609 {
6614 /* Since we're building a variant, assume that it is a non-semantic
6615 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6617 /* Type variants have no alias set defined. */
6620 /* Add the new type to the chain of variants of TYPE. */
6626 }
6627 \f
6628 /* Return true if the from tree in both tree maps are equal. */
6630 int
6632 {
6636 }
6638 /* Hash a from tree in a tree_base_map. */
6640 unsigned int
6642 {
6644 }
6646 /* Return true if this tree map structure is marked for garbage collection
6647 purposes. We simply return true if the from tree is marked, so that this
6648 structure goes away when the from tree goes away. */
6650 int
6652 {
6654 }
6656 /* Hash a from tree in a tree_map. */
6658 unsigned int
6660 {
6662 }
6664 /* Hash a from tree in a tree_decl_map. */
6666 unsigned int
6668 {
6670 }
6672 /* Return the initialization priority for DECL. */
6674 priority_type
6676 {
6681 return
6683 }
6685 /* Return the finalization priority for DECL. */
6687 priority_type
6689 {
6694 return
6696 }
6698 /* Set the initialization priority for DECL to PRIORITY. */
6700 void
6702 {
6706 {
6710 }
6713 else
6716 }
6718 /* Set the finalization priority for DECL to PRIORITY. */
6720 void
6722 {
6726 {
6730 }
6731 else
6734 }
6736 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6738 static void
6740 {
6745 }
6747 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6749 static void
6751 {
6756 }
6758 /* Lookup a debug expression for FROM, and return it if we find one. */
6760 tree
6762 {
6770 }
6772 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6774 void
6776 {
6783 }
6785 /* Lookup a value expression for FROM, and return it if we find one. */
6787 tree
6789 {
6797 }
6799 /* Insert a mapping FROM->TO in the value expression hashtable. */
6801 void
6803 {
6810 }
6812 /* Lookup a vector of debug arguments for FROM, and return it if we
6813 find one. */
6817 {
6828 }
6830 /* Insert a mapping FROM->empty vector of debug arguments in the value
6831 expression hashtable. */
6835 {
6850 }
6852 /* Hashing of types so that we don't make duplicates.
6853 The entry point is `type_hash_canon'. */
6855 /* Generate the default hash code for TYPE. This is designed for
6856 speed, rather than maximum entropy. */
6858 hashval_t
6860 {
6869 /* Just the identifier is adequate to distinguish. */
6873 {
6876 /* FALLTHROUGH. */
6888 {
6892 {
6895 }
6896 }
6900 {
6907 }
6911 {
6915 }
6923 }
6926 }
6928 /* These are the Hashtable callback functions. */
6930 /* Returns true iff the types are equivalent. */
6932 bool
6934 {
6935 /* First test the things that are the same for all types. */
6945 /* Be careful about comparing arrays before and after the element type
6946 has been completed; don't compare TYPE_ALIGN unless both types are
6947 complete. */
6954 {
6976 /* fall through */
7008 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7009 where the flag should be inherited from the element type
7010 and can change after ARRAY_TYPEs are created; on non-aggregates
7011 compare it and hash it, scalars will never have that flag set
7012 and we need to differentiate between arrays created by different
7013 front-ends or middle-end created arrays. */
7043 }
7049 }
7051 /* Given TYPE, and HASHCODE its hash code, return the canonical
7052 object for an identical type if one already exists.
7053 Otherwise, return TYPE, and record it as the canonical object.
7055 To use this function, first create a type of the sort you want.
7056 Then compute its hash code from the fields of the type that
7057 make it different from other similar types.
7058 Then call this function and use the value. */
7060 tree
7062 {
7063 type_hash in;
7066 /* The hash table only contains main variants, so ensure that's what we're
7067 being passed. */
7070 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7071 must call that routine before comparing TYPE_ALIGNs. */
7079 {
7085 /* Free also min/max values and the cache for integer
7086 types. This can't be done in free_node, as LTO frees
7087 those on its own. */
7089 {
7092 {
7093 /* Zero is always in TYPE_CACHED_VALUES. */
7097 }
7100 {
7103 }
7106 }
7109 }
7110 else
7111 {
7120 }
7121 }
7123 static void
7125 {
7130 }
7132 /* Given two lists of types
7133 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7134 return 1 if the lists contain the same types in the same order.
7135 Also, the TREE_PURPOSEs must match. */
7137 bool
7139 {
7151 }
7153 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7154 given by TYPE. If the argument list accepts variable arguments,
7155 then this function counts only the ordinary arguments. */
7157 int
7159 {
7163 /* If the function does not take a variable number of arguments,
7164 the last element in the list will have type `void'. */
7167 else
7171 }
7173 /* Return the type of the function TYPE's argument ARGNO if known.
7174 For vararg function's where ARGNO refers to one of the variadic
7175 arguments return null. Otherwise, return a void_type_node for
7176 out-of-bounds ARGNO. */
7178 tree
7180 {
7181 /* Treat zero the same as an out-of-bounds argument number. */
7185 function_args_iterator iter;
7187 tree argtype;
7190 {
7191 /* A vararg function's argument list ends in a null. Otherwise,
7192 an ordinary function's argument list ends with void. Return
7193 null if ARGNO refers to a vararg argument, void_type_node if
7194 it's out of bounds, and the formal argument type otherwise. */
7202 }
7205 }
7207 /* Nonzero if integer constants T1 and T2
7208 represent the same constant value. */
7210 int
7212 {
7228 }
7230 /* Return true if T is an INTEGER_CST whose numerical value (extended
7231 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7233 bool
7235 {
7239 }
7241 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7242 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7244 bool
7246 {
7250 {
7255 }
7258 }
7260 /* Return true if T is an INTEGER_CST whose numerical value (extended
7261 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7263 bool
7265 {
7269 }
7271 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7272 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7274 bool
7276 {
7280 {
7285 }
7288 }
7290 /* T is an INTEGER_CST whose numerical value (extended according to
7291 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7292 HOST_WIDE_INT. */
7294 HOST_WIDE_INT
7296 {
7299 }
7301 /* T is an INTEGER_CST whose numerical value (extended according to
7302 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7303 HOST_WIDE_INT. */
7305 unsigned HOST_WIDE_INT
7307 {
7310 }
7312 /* Return the most significant (sign) bit of T. */
7314 int
7316 {
7320 }
7322 /* Return an indication of the sign of the integer constant T.
7323 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7324 Note that -1 will never be returned if T's type is unsigned. */
7326 int
7328 {
7335 else
7337 }
7339 /* Return the minimum number of bits needed to represent VALUE in a
7340 signed or unsigned type, UNSIGNEDP says which. */
7342 unsigned int
7344 {
7345 /* If the value is negative, compute its negative minus 1. The latter
7346 adjustment is because the absolute value of the largest negative value
7347 is one larger than the largest positive value. This is equivalent to
7348 a bit-wise negation, so use that operation instead. */
7353 /* Return the number of bits needed, taking into account the fact
7354 that we need one more bit for a signed than unsigned type.
7355 If value is 0 or -1, the minimum precision is 1 no matter
7356 whether unsignedp is true or false. */
7360 else
7362 }
7364 /* Return truthvalue of whether T1 is the same tree structure as T2.
7365 Return 1 if they are the same.
7366 Return 0 if they are understandably different.
7367 Return -1 if either contains tree structure not understood by
7368 this function. */
7370 int
7372 {
7382 /* For location wrappers to be the same, they must be at the same
7383 source location (and wrap the same thing). */
7385 {
7389 }
7395 {
7399 else
7401 }
7411 {
7427 {
7436 /* ??? Should we handle also fields here? */
7440 }
7451 {
7459 {
7463 }
7465 }
7468 /* Special case: if either target is an unallocated VAR_DECL,
7469 it means that it's going to be unified with whatever the
7470 TARGET_EXPR is really supposed to initialize, so treat it
7471 as being equivalent to anything. */
7479 else
7508 /* A false return means maybe_ne rather than known_ne. */
7514 }
7516 /* This general rule works for most tree codes. All exceptions should be
7517 handled above. If this is a language-specific tree code, we can't
7518 trust what might be in the operand, so say we don't know
7519 the situation. */
7524 {
7533 {
7537 }
7543 }
7544 }
7546 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7547 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7548 than U, respectively. */
7550 int
7552 {
7561 else
7563 }
7565 /* Return true if SIZE represents a constant size that is in bounds of
7566 what the middle-end and the backend accepts (covering not more than
7567 half of the address-space).
7568 When PERR is non-null, set *PERR on failure to the description of
7569 why SIZE is not valid. */
7571 bool
7573 {
7575 {
7582 }
7584 cst_size_error error;
7589 {
7592 }
7595 {
7598 }
7601 {
7604 }
7608 {
7611 }
7614 }
7616 /* Return the precision of the type, or for a complex or vector type the
7617 precision of the type of its elements. */
7619 unsigned int
7621 {
7629 }
7631 /* Return true if CODE represents an associative tree code. Otherwise
7632 return false. */
7633 bool
7635 {
7637 {
7649 }
7651 }
7653 /* Return true if CODE represents a commutative tree code. Otherwise
7654 return false. */
7655 bool
7657 {
7659 {
7686 }
7688 }
7690 /* Return true if CODE represents a ternary tree code for which the
7691 first two operands are commutative. Otherwise return false. */
7692 bool
7694 {
7696 {
7704 }
7706 }
7708 /* Returns true if CODE can overflow. */
7710 bool
7712 {
7714 {
7719 /* Can overflow in various ways. */
7725 /* For INT_MIN / -1. */
7729 /* For -INT_MIN. */
7732 /* These operators cannot overflow. */
7734 }
7735 }
7737 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7738 ftrapv doesn't generate trapping insns for CODE. */
7740 bool
7742 {
7745 /* We don't generate instructions that trap on overflow for complex or vector
7746 types. */
7754 {
7760 /* These operators can overflow, and -ftrapv generates trapping code for
7761 these. */
7768 /* These operators can overflow, but -ftrapv does not generate trapping
7769 code for these. */
7772 /* These operators cannot overflow. */
7774 }
7775 }
7777 namespace inchash
7778 {
7780 /* Generate a hash value for an expression. This can be used iteratively
7781 by passing a previous result as the HSTATE argument.
7783 This function is intended to produce the same hash for expressions which
7784 would compare equal using operand_equal_p. */
7785 void
7787 {
7793 {
7796 }
7806 {
7807 /* Alas, constants aren't shared, so we can't rely on pointer
7808 identity. */
7818 {
7822 else
7826 }
7828 {
7832 }
7842 {
7849 }
7851 /* We can just compare by pointer. */
7855 /* The node itself doesn't matter. */
7859 /* Ignore. */
7862 /* A list of expressions, for a CALL_EXPR or as the elements of a
7863 VECTOR_CST. */
7868 {
7873 {
7876 }
7878 }
7880 {
7881 tree_stmt_iterator i;
7886 }
7895 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7896 Otherwise nodes that compare equal according to operand_equal_p might
7897 get different hash codes. However, don't do this for machine specific
7898 or front end builtins, since the function code is overloaded in those
7899 cases. */
7902 {
7905 }
7906 /* FALL THROUGH */
7909 {
7913 }
7917 {
7918 /* DECL's have a unique ID */
7920 }
7922 {
7923 /* For comparisons that can be swapped, use the lower
7924 tree code. */
7931 }
7933 {
7934 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7935 operand_equal_p. */
7939 /* Don't hash the type, that can lead to having nodes which
7940 compare equal according to operand_equal_p, but which
7941 have different hash codes. Make sure to include signedness
7942 in the hash computation. */
7945 }
7946 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7954 /* Don't ICE on FE specific trees, or their arguments etc.
7955 during operand_equal_p hash verification. */
7958 else
7959 {
7965 {
7992 {
7993 /* The multiplication operands are commutative. */
8000 }
8008 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
8009 Usually different TARGET_EXPRs just should use
8010 different temporaries in their slots. */
8016 }
8018 /* Don't hash the type, that can lead to having nodes which
8019 compare equal according to operand_equal_p, but which
8020 have different hash codes. */
8022 {
8023 /* Make sure to include signness in the hash computation. */
8026 }
8029 {
8030 /* It's a commutative expression. We want to hash it the same
8031 however it appears. We do this by first hashing both operands
8032 and then rehashing based on the order of their independent
8033 hashes. */
8038 }
8039 else
8043 }
8045 }
8046 }
8048 }
8050 /* Constructors for pointer, array and function types.
8051 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8052 constructed by language-dependent code, not here.) */
8054 /* Construct, lay out and return the type of pointers to TO_TYPE with
8055 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8056 reference all of memory. If such a type has already been
8057 constructed, reuse it. */
8059 tree
8062 {
8063 tree t;
8069 /* If the pointed-to type has the may_alias attribute set, force
8070 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8074 /* In some cases, languages will have things that aren't a POINTER_TYPE
8075 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8076 In that case, return that type without regard to the rest of our
8077 operands.
8079 ??? This is a kludge, but consistent with the way this function has
8080 always operated and there doesn't seem to be a good way to avoid this
8081 at the moment. */
8086 /* First, if we already have a type for pointers to TO_TYPE and it's
8087 the proper mode, use it. */
8100 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8108 /* Lay out the type. This function has many callers that are concerned
8109 with expression-construction, and this simplifies them all. */
8113 }
8115 /* By default build pointers in ptr_mode. */
8117 tree
8119 {
8124 }
8126 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8128 tree
8131 {
8132 tree t;
8138 /* If the pointed-to type has the may_alias attribute set, force
8139 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8143 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8144 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8145 In that case, return that type without regard to the rest of our
8146 operands.
8148 ??? This is a kludge, but consistent with the way this function has
8149 always operated and there doesn't seem to be a good way to avoid this
8150 at the moment. */
8155 /* First, if we already have a type for pointers to TO_TYPE and it's
8156 the proper mode, use it. */
8169 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8180 }
8183 /* Build the node for the type of references-to-TO_TYPE by default
8184 in ptr_mode. */
8186 tree
8188 {
8193 }
8195 #define MAX_INT_CACHED_PREC \
8196 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8199 /* Builds a signed or unsigned integer type of precision PRECISION.
8200 Used for C bitfields whose precision does not match that of
8201 built-in target types. */
8202 tree
8205 {
8212 {
8216 }
8223 else
8233 }
8235 #define MAX_BOOL_CACHED_PREC \
8236 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8239 /* Builds a boolean type of precision PRECISION.
8240 Used for boolean vectors to choose proper vector element size. */
8241 tree
8243 {
8244 tree type;
8247 {
8251 }
8261 }
8263 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8264 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8265 is true, reuse such a type that has already been constructed. */
8267 static tree
8269 {
8292 {
8293 /* Since we cannot reliably merge this type, we need to compare it using
8294 structural equality checks. */
8297 }
8303 }
8305 /* Wrapper around build_range_type_1 with SHARED set to true. */
8307 tree
8309 {
8311 }
8313 /* Wrapper around build_range_type_1 with SHARED set to false. */
8315 tree
8317 {
8319 }
8321 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8322 MAXVAL should be the maximum value in the domain
8323 (one less than the length of the array).
8325 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8326 We don't enforce this limit, that is up to caller (e.g. language front end).
8327 The limit exists because the result is a signed type and we don't handle
8328 sizes that use more than one HOST_WIDE_INT. */
8330 tree
8332 {
8334 }
8336 /* Return true if the debug information for TYPE, a subtype, should be emitted
8337 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8338 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8339 debug info and doesn't reflect the source code. */
8341 bool
8343 {
8346 /* Subrange types have a base type which is an integral type. */
8350 /* Get the real bounds of the subtype. */
8353 else
8354 {
8357 }
8359 /* If the type and its base type have the same representation and the same
8360 name, then the type is not a subrange but a copy of the base type. */
8374 }
8376 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8377 and number of elements specified by the range of values of INDEX_TYPE.
8378 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8379 If SHARED is true, reuse such a type that has already been constructed. */
8381 static tree
8384 {
8385 tree t;
8388 {
8391 }
8400 /* If the element type is incomplete at this point we get marked for
8401 structural equality. Do not record these types in the canonical
8402 type hashtable. */
8407 {
8410 }
8413 {
8422 index_type
8425 }
8428 }
8430 /* Wrapper around build_array_type_1 with SHARED set to true. */
8432 tree
8434 {
8436 }
8438 /* Wrapper around build_array_type_1 with SHARED set to false. */
8440 tree
8442 {
8444 }
8446 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8447 sizetype. */
8449 tree
8451 {
8453 }
8455 /* Recursively examines the array elements of TYPE, until a non-array
8456 element type is found. */
8458 tree
8460 {
8465 }
8467 /* Computes the canonical argument types from the argument type list
8468 ARGTYPES.
8470 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8471 on entry to this function, or if any of the ARGTYPES are
8472 structural.
8474 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8475 true on entry to this function, or if any of the ARGTYPES are
8476 non-canonical.
8478 Returns a canonical argument list, which may be ARGTYPES when the
8479 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8480 true) or would not differ from ARGTYPES. */
8482 static tree
8486 {
8487 tree arg;
8491 {
8493 /* Fail gracefully by stating that the type is structural. */
8499 /* If the argument has a default argument, we consider it
8500 non-canonical even though the type itself is canonical.
8501 That way, different variants of function and method types
8502 with default arguments will all point to the variant with
8503 no defaults as their canonical type. */
8505 }
8511 {
8512 /* Build the canonical list of argument types. */
8517 {
8520 else
8523 canon_argtypes);
8524 }
8530 /* There is a non-canonical type. */
8533 }
8535 /* The canonical argument types are the same as ARGTYPES. */
8537 }
8539 /* Construct, lay out and return
8540 the type of functions returning type VALUE_TYPE
8541 given arguments of types ARG_TYPES.
8542 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8543 are data type nodes for the arguments of the function.
8544 If such a type has already been constructed, reuse it. */
8546 tree
8548 {
8549 tree t;
8552 tree canon_argtypes;
8557 {
8560 }
8562 /* Make a node of the sort we want. */
8567 /* If we already have such a type, use the old one. */
8571 /* Set up the canonical type. */
8581 canon_argtypes);
8586 }
8588 /* Build a function type. The RETURN_TYPE is the type returned by the
8589 function. If VAARGS is set, no void_type_node is appended to the
8590 list. ARGP must be always be terminated be a NULL_TREE. */
8592 static tree
8594 {
8602 {
8607 }
8610 else
8611 {
8615 }
8619 }
8621 /* Build a function type. The RETURN_TYPE is the type returned by the
8622 function. If additional arguments are provided, they are
8623 additional argument types. The list of argument types must always
8624 be terminated by NULL_TREE. */
8626 tree
8628 {
8629 tree args;
8636 }
8638 /* Build a variable argument function type. The RETURN_TYPE is the
8639 type returned by the function. If additional arguments are provided,
8640 they are additional argument types. The list of argument types must
8641 always be terminated by NULL_TREE. */
8643 tree
8645 {
8646 tree args;
8654 }
8656 /* Build a function type. RETURN_TYPE is the type returned by the
8657 function; VAARGS indicates whether the function takes varargs. The
8658 function takes N named arguments, the types of which are provided in
8659 ARG_TYPES. */
8661 static tree
8664 {
8672 }
8674 /* Build a function type. RETURN_TYPE is the type returned by the
8675 function. The function takes N named arguments, the types of which
8676 are provided in ARG_TYPES. */
8678 tree
8680 {
8682 }
8684 /* Build a variable argument function type. RETURN_TYPE is the type
8685 returned by the function. The function takes N named arguments, the
8686 types of which are provided in ARG_TYPES. */
8688 tree
8690 {
8692 }
8694 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8695 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8696 for the method. An implicit additional parameter (of type
8697 pointer-to-BASETYPE) is added to the ARGTYPES. */
8699 tree
8701 tree rettype,
8702 tree argtypes)
8703 {
8704 tree t;
8705 tree ptype;
8707 tree canon_argtypes;
8709 /* Make a node of the sort we want. */
8716 /* The actual arglist for this function includes a "hidden" argument
8717 which is "this". Put it into the list of argument types. */
8721 /* If we already have such a type, use the old one. */
8725 /* Set up the canonical type. */
8726 any_structural_p
8729 any_noncanonical_p
8741 canon_argtypes);
8746 }
8748 /* Construct, lay out and return the type of methods belonging to class
8749 BASETYPE and whose arguments and values are described by TYPE.
8750 If that type exists already, reuse it.
8751 TYPE must be a FUNCTION_TYPE node. */
8753 tree
8755 {
8761 }
8763 /* Construct, lay out and return the type of offsets to a value
8764 of type TYPE, within an object of type BASETYPE.
8765 If a suitable offset type exists already, reuse it. */
8767 tree
8769 {
8770 tree t;
8772 /* Make a node of the sort we want. */
8778 /* If we already have such a type, use the old one. */
8786 {
8795 }
8798 }
8800 /* Create a complex type whose components are COMPONENT_TYPE.
8802 If NAMED is true, the type is given a TYPE_NAME. We do not always
8803 do so because this creates a DECL node and thus make the DECL_UIDs
8804 dependent on the type canonicalization hashtable, which is GC-ed,
8805 so the DECL_UIDs would not be stable wrt garbage collection. */
8807 tree
8809 {
8814 /* Make a node of the sort we want. */
8819 /* If we already have such a type, use the old one. */
8824 {
8825 /* We created a new type. The hash insertion will have laid
8826 out the type. We need to check the canonicalization and
8827 maybe set the name. */
8838 /* We need to create a name, since complex is a fundamental type. */
8840 {
8869 }
8870 }
8873 }
8875 /* If TYPE is a real or complex floating-point type and the target
8876 does not directly support arithmetic on TYPE then return the wider
8877 type to be used for arithmetic on TYPE. Otherwise, return
8878 NULL_TREE. */
8880 tree
8882 {
8883 /* The target can give two different responses to the question of
8884 which excess precision mode it would like depending on whether we
8885 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8887 enum excess_precision_type requested_type
8889 ? EXCESS_PRECISION_TYPE_FAST
8892 enum flt_eval_method target_flt_eval_method
8895 /* The target should not ask for unpredictable float evaluation (though
8896 it might advertise that implicitly the evaluation is unpredictable,
8897 but we don't care about that here, it will have been reported
8898 elsewhere). If it does ask for unpredictable evaluation, we have
8899 nothing to do here. */
8902 /* Nothing to do. The target has asked for all types we know about
8903 to be computed with their native precision and range. */
8907 /* The target will promote this type in a target-dependent way, so excess
8908 precision ought to leave it alone. */
8912 machine_mode float16_type_mode = (float16_type_node
8919 {
8921 {
8924 {
8942 }
8944 }
8946 {
8951 {
8969 }
8971 }
8974 }
8977 }
8978 \f
8979 /* Return OP, stripped of any conversions to wider types as much as is safe.
8980 Converting the value back to OP's type makes a value equivalent to OP.
8982 If FOR_TYPE is nonzero, we return a value which, if converted to
8983 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8985 OP must have integer, real or enumeral type. Pointers are not allowed!
8987 There are some cases where the obvious value we could return
8988 would regenerate to OP if converted to OP's type,
8989 but would not extend like OP to wider types.
8990 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8991 For example, if OP is (unsigned short)(signed char)-1,
8992 we avoid returning (signed char)-1 if FOR_TYPE is int,
8993 even though extending that to an unsigned short would regenerate OP,
8994 since the result of extending (signed char)-1 to (int)
8995 is different from (int) OP. */
8997 tree
8999 {
9000 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
9002 unsigned final_prec
9004 int uns
9011 {
9014 /* TYPE_PRECISION on vector types has different meaning
9015 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
9016 so avoid them here. */
9023 /* Truncations are many-one so cannot be removed.
9024 Unless we are later going to truncate down even farther. */
9029 /* See what's inside this conversion. If we decide to strip it,
9030 we will set WIN. */
9033 /* If we have not stripped any zero-extensions (uns is 0),
9034 we can strip any kind of extension.
9035 If we have previously stripped a zero-extension,
9036 only zero-extensions can safely be stripped.
9037 Any extension can be stripped if the bits it would produce
9038 are all going to be discarded later by truncating to FOR_TYPE. */
9041 {
9044 /* TYPE_UNSIGNED says whether this is a zero-extension.
9045 Let's avoid computing it if it does not affect WIN
9046 and if UNS will not be needed again. */
9050 {
9053 }
9054 }
9055 }
9057 /* If we finally reach a constant see if it fits in sth smaller and
9058 in that case convert it. */
9060 {
9066 {
9070 }
9071 }
9074 }
9075 \f
9076 /* Return OP or a simpler expression for a narrower value
9077 which can be sign-extended or zero-extended to give back OP.
9078 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
9079 or 0 if the value should be sign-extended. */
9081 tree
9083 {
9090 {
9091 int bitschange
9095 /* Truncations are many-one so cannot be removed. */
9099 /* See what's inside this conversion. If we decide to strip it,
9100 we will set WIN. */
9103 {
9105 /* An extension: the outermost one can be stripped,
9106 but remember whether it is zero or sign extension. */
9109 /* Otherwise, if a sign extension has been stripped,
9110 only sign extensions can now be stripped;
9111 if a zero extension has been stripped, only zero-extensions. */
9115 }
9117 {
9118 /* A change in nominal type can always be stripped, but we must
9119 preserve the unsignedness. */
9124 /* Keep trying to narrow, but don't assign op to win if it
9125 would turn an integral type into something else. */
9128 }
9131 }
9134 /* Since type_for_size always gives an integer type. */
9137 /* Ensure field is laid out already. */
9140 {
9141 unsigned HOST_WIDE_INT innerprec
9147 /* We can get this structure field in a narrower type that fits it,
9148 but the resulting extension to its nominal type (a fullword type)
9149 must satisfy the same conditions as for other extensions.
9151 Do this only for fields that are aligned (not bit-fields),
9152 because when bit-field insns will be used there is no
9153 advantage in doing this. */
9159 {
9163 }
9164 }
9168 }
9169 \f
9170 /* Return true if integer constant C has a value that is permissible
9171 for TYPE, an integral type. */
9173 bool
9175 {
9180 /* Non-standard boolean types can have arbitrary precision but various
9181 transformations assume that they can only take values 0 and +/-1. */
9185 retry:
9189 /* If at least one bound of the type is a constant integer, we can check
9190 ourselves and maybe make a decision. If no such decision is possible, but
9191 this type is a subtype, try checking against that. Otherwise, use
9192 fits_to_tree_p, which checks against the precision.
9194 Compute the status for each possibly constant bound, and return if we see
9195 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9196 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9197 for "constant known to fit". */
9199 /* Check if c >= type_low_bound. */
9201 {
9205 }
9206 else
9209 /* Check if c <= type_high_bound. */
9211 {
9215 }
9216 else
9219 /* If the constant fits both bounds, the result is known. */
9223 /* Perform some generic filtering which may allow making a decision
9224 even if the bounds are not constant. First, negative integers
9225 never fit in unsigned types, */
9229 /* Second, narrower types always fit in wider ones. */
9233 /* Third, unsigned integers with top bit set never fit signed types. */
9235 {
9238 {
9239 /* When a tree_cst is converted to a wide-int, the precision
9240 is taken from the type. However, if the precision of the
9241 mode underneath the type is smaller than that, it is
9242 possible that the value will not fit. The test below
9243 fails if any bit is set between the sign bit of the
9244 underlying mode and the top bit of the type. */
9247 }
9250 }
9252 /* If we haven't been able to decide at this point, there nothing more we
9253 can check ourselves here. Look at the base type if we have one and it
9254 has the same precision. */
9258 {
9261 }
9263 /* Or to fits_to_tree_p, if nothing else. */
9265 }
9267 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9268 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9269 represented (assuming two's-complement arithmetic) within the bit
9270 precision of the type are returned instead. */
9272 void
9274 {
9278 else
9279 {
9282 else
9283 {
9286 }
9287 }
9292 else
9293 {
9296 }
9297 }
9299 /* Return true if VAR is an automatic variable. */
9301 bool
9303 {
9308 }
9310 /* Return true if VAR is an automatic variable defined in function FN. */
9312 bool
9314 {
9318 }
9320 /* Subprogram of following function. Called by walk_tree.
9322 Return *TP if it is an automatic variable or parameter of the
9323 function passed in as DATA. */
9325 static tree
9327 {
9338 }
9340 /* Returns true if T is, contains, or refers to a type with variable
9341 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9342 arguments, but not the return type. If FN is nonzero, only return
9343 true if a modifier of the type or position of FN is a variable or
9344 parameter inside FN.
9346 This concept is more general than that of C99 'variably modified types':
9347 in C99, a struct type is never variably modified because a VLA may not
9348 appear as a structure member. However, in GNU C code like:
9350 struct S { int i[f()]; };
9352 is valid, and other languages may define similar constructs. */
9354 bool
9356 {
9357 tree t;
9359 /* Test if T is either variable (if FN is zero) or an expression containing
9360 a variable in FN. If TYPE isn't gimplified, return true also if
9361 gimplify_one_sizepos would gimplify the expression into a local
9362 variable. */
9363 #define RETURN_TRUE_IF_VAR(T) \
9364 do { tree _t = (T); \
9365 if (_t != NULL_TREE \
9366 && _t != error_mark_node \
9367 && !CONSTANT_CLASS_P (_t) \
9368 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9369 && (!fn \
9370 || (!TYPE_SIZES_GIMPLIFIED (type) \
9371 && (TREE_CODE (_t) != VAR_DECL \
9372 && !CONTAINS_PLACEHOLDER_P (_t))) \
9373 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9374 return true; } while (0)
9379 /* If TYPE itself has variable size, it is variably modified. */
9384 {
9388 /* Ada can have pointer types refering to themselves indirectly. */
9393 {
9396 }
9402 /* If TYPE is a function type, it is variably modified if the
9403 return type is variably modified. */
9413 /* Scalar types are variably modified if their end points
9414 aren't constant. */
9422 /* We can't see if any of the fields are variably-modified by the
9423 definition we normally use, since that would produce infinite
9424 recursion via pointers. */
9425 /* This is variably modified if some field's type is. */
9428 {
9435 }
9439 /* Do not call ourselves to avoid infinite recursion. This is
9440 variably modified if the element type is. */
9447 }
9449 /* The current language may have other cases to check, but in general,
9450 all other types are not variably modified. */
9453 #undef RETURN_TRUE_IF_VAR
9454 }
9456 /* Given a DECL or TYPE, return the scope in which it was declared, or
9457 NULL_TREE if there is no containing scope. */
9459 tree
9461 {
9463 }
9465 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9467 const_tree
9469 {
9471 {
9474 else
9476 }
9478 }
9480 /* Return the innermost context enclosing DECL that is
9481 a FUNCTION_DECL, or zero if none. */
9483 tree
9485 {
9486 tree context;
9491 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9492 where we look up the function at runtime. Such functions always take
9493 a first argument of type 'pointer to real context'.
9495 C++ should really be fixed to use DECL_CONTEXT for the real context,
9496 and use something else for the "virtual context". */
9498 context
9499 = TYPE_MAIN_VARIANT
9501 else
9505 {
9508 else
9510 }
9513 }
9515 /* Return the innermost context enclosing DECL that is
9516 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9517 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9519 tree
9521 {
9526 {
9547 }
9550 }
9552 /* CALL is a CALL_EXPR. Return the declaration for the function
9553 called, or NULL_TREE if the called function cannot be
9554 determined. */
9556 tree
9558 {
9559 tree addr;
9564 /* It's invalid to call this function with anything but a
9565 CALL_EXPR. */
9568 /* The first operand to the CALL is the address of the function
9569 called. */
9572 /* If there is no function, return early. */
9578 /* If this is a readonly function pointer, extract its initial value. */
9584 /* If the address is just `&f' for some function `f', then we know
9585 that `f' is being called. */
9590 /* We couldn't figure out what was being called. */
9592 }
9594 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9595 return the associated function code, otherwise return CFN_LAST. */
9597 combined_fn
9599 {
9600 /* It's invalid to call this function with anything but a CALL_EXPR. */
9611 }
9613 /* Comparator of indices based on tree_node_counts. */
9615 static int
9617 {
9622 }
9624 /* Comparator of indices based on tree_code_counts. */
9626 static int
9628 {
9633 }
9635 #define TREE_MEM_USAGE_SPACES 40
9637 /* Print debugging information about tree nodes generated during the compile,
9638 and any language-specific information. */
9640 void
9642 {
9644 {
9650 {
9657 {
9664 }
9669 }
9671 {
9681 {
9686 }
9693 }
9694 }
9695 else
9702 }
9703 \f
9706 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9708 unsigned
9710 {
9711 /* This relies on the raw feedback's top 4 bits being zero. */
9712 #define FEEDBACK(X) ((X) * 0x04c11db7)
9713 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9714 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9716 {
9721 };
9722 #undef FEEDBACK
9723 #undef SYNDROME
9727 {
9731 }
9734 }
9736 /* Generate a crc32 of a string. */
9738 unsigned
9740 {
9741 do
9745 }
9747 /* P is a string that will be used in a symbol. Mask out any characters
9748 that are not valid in that context. */
9750 void
9752 {
9757 #endif
9760 #endif
9761 ))
9763 }
9767 /* Create a unique anonymous identifier. The identifier is still a
9768 valid assembly label. */
9770 tree
9772 {
9774 #if !defined (NO_DOT_IN_LABEL)
9775 "."
9776 #elif !defined (NO_DOLLAR_IN_LABEL)
9777 "$"
9778 #else
9779 "_"
9780 #endif
9791 }
9793 /* Generate a name for a special-purpose function.
9794 The generated name may need to be unique across the whole link.
9795 Changes to this function may also require corresponding changes to
9796 xstrdup_mask_random.
9797 TYPE is some string to identify the purpose of this function to the
9798 linker or collect2; it must start with an uppercase letter,
9799 one of:
9800 I - for constructors
9801 D - for destructors
9802 N - for C++ anonymous namespaces
9803 F - for DWARF unwind frame information. */
9805 tree
9807 {
9812 /* If we already have a name we know to be unique, just use that. */
9815 /* If the target is handling the constructors/destructors, they
9816 will be local to this file and the name is only necessary for
9817 debugging purposes.
9818 We also assign sub_I and sub_D sufixes to constructors called from
9819 the global static constructors. These are always local. */
9823 {
9827 /* Just use the file's basename, because the full pathname
9828 might be quite long. */
9830 }
9831 else
9832 {
9833 /* Otherwise, the name must be unique across the entire link.
9834 We don't have anything that we know to be unique to this translation
9835 unit, so use what we do have and throw in some randomness. */
9853 }
9859 /* Set up the name of the file-level functions we may need.
9860 Use a global object (which is already required to be unique over
9861 the program) rather than the file name (which imposes extra
9862 constraints). */
9866 }
9867 \f
9868 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9870 /* Complain that the tree code of NODE does not match the expected 0
9871 terminated list of trailing codes. The trailing code list can be
9872 empty, for a more vague error message. FILE, LINE, and FUNCTION
9873 are of the caller. */
9875 void
9878 {
9889 {
9896 {
9903 }
9905 }
9906 else
9912 }
9914 /* Complain that the tree code of NODE does match the expected 0
9915 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9916 the caller. */
9918 void
9921 {
9935 {
9937 {
9940 }
9943 }
9949 }
9951 /* Similar to tree_check_failed, except that we check for a class of tree
9952 code, given in CL. */
9954 void
9957 {
9958 internal_error
9963 }
9965 /* Similar to tree_check_failed, except that instead of specifying a
9966 dozen codes, use the knowledge that they're all sequential. */
9968 void
9972 {
9985 {
9992 }
9997 }
10000 /* Similar to tree_check_failed, except that we check that a tree does
10001 not have the specified code, given in CL. */
10003 void
10006 {
10007 internal_error
10012 }
10015 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
10017 void
10020 {
10026 }
10029 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
10031 void
10035 {
10048 {
10055 }
10060 }
10063 #undef DEFTREESTRUCT
10064 #define DEFTREESTRUCT(VAL, NAME) NAME,
10068 };
10069 #undef DEFTREESTRUCT
10071 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
10073 /* Similar to tree_class_check_failed, except that we check for
10074 whether CODE contains the tree structure identified by EN. */
10076 void
10081 {
10082 internal_error
10086 }
10089 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10090 (dynamically sized) vector. */
10092 void
10095 {
10096 internal_error
10100 }
10102 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10103 (dynamically sized) vector. */
10105 void
10108 {
10109 internal_error
10112 }
10114 /* Similar to above, except that the check is for the bounds of the operand
10115 vector of an expression node EXP. */
10117 void
10120 {
10122 internal_error
10126 }
10128 /* Similar to above, except that the check is for the number of
10129 operands of an OMP_CLAUSE node. */
10131 void
10134 {
10135 internal_error
10140 }
10142 \f
10143 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10144 and mapped to the machine mode MODE. Initialize its fields and build
10145 the information necessary for debugging output. */
10147 static tree
10149 {
10150 tree t;
10171 /* We have built a main variant, based on the main variant of the
10172 inner type. Use it to build the variant we return. */
10180 }
10182 static tree
10184 {
10207 else
10209 }
10211 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10213 static tree
10215 {
10217 {
10229 }
10230 else
10231 {
10243 }
10246 }
10248 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10250 static tree
10252 {
10254 {
10266 }
10267 else
10268 {
10280 }
10283 }
10286 /* Create an atomic variant node for TYPE. This routine is called
10287 during initialization of data types to create the 5 basic atomic
10288 types. The generic build_variant_type function requires these to
10289 already be set up in order to function properly, so cannot be
10290 called from there. If ALIGN is non-zero, then ensure alignment is
10291 overridden to this value. */
10293 static tree
10295 {
10296 tree t;
10298 /* Make sure its not already registered. */
10309 }
10311 /* Information about the _FloatN and _FloatNx types. This must be in
10312 the same order as the corresponding TI_* enum values. */
10314 {
10322 };
10325 /* Create nodes for all integer types (and error_mark_node) using the sizes
10326 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10328 void
10330 {
10338 /* Define both `signed char' and `unsigned char'. */
10344 /* Define `char', which is like either `signed char' or `unsigned char'
10345 but not the same as either. */
10346 char_type_node
10347 = (signed_char
10362 {
10367 {
10370 }
10371 }
10373 /* Define a boolean type. This type only represents boolean values but
10374 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10380 /* Define what type to use for size_t. */
10389 else
10390 {
10396 {
10403 {
10405 }
10406 }
10409 }
10411 /* Define what type to use for ptrdiff_t. */
10420 else
10421 {
10425 {
10433 }
10436 }
10438 /* Fill in the rest of the sized types. Reuse existing type nodes
10439 when possible. */
10452 /* Don't call build_qualified type for atomics. That routine does
10453 special processing for atomics, and until they are initialized
10454 it's better not to make that call.
10456 Check to see if there is a target override for atomic types. */
10473 /* Define these next since types below may used them. */
10491 /* We are not going to have real types in C with less than byte alignment,
10492 so we might as well not have any types that claim to have it. */
10503 const_ptr_type_node
10525 {
10528 scalar_float_mode mode;
10532 /* Work around the rs6000 KFmode having precision 113 not
10533 128. */
10545 }
10552 /* Fixed size integer types. */
10557 /* Decimal float types. */
10583 {
10587 }
10589 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10590 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10591 sat_ ## KIND ## _type_node = \
10592 make_sat_signed_ ## KIND ## _type (SIZE); \
10593 sat_unsigned_ ## KIND ## _type_node = \
10594 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10595 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10596 unsigned_ ## KIND ## _type_node = \
10597 make_unsigned_ ## KIND ## _type (SIZE);
10599 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10600 sat_ ## WIDTH ## KIND ## _type_node = \
10601 make_sat_signed_ ## KIND ## _type (SIZE); \
10602 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10603 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10604 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10605 unsigned_ ## WIDTH ## KIND ## _type_node = \
10606 make_unsigned_ ## KIND ## _type (SIZE);
10608 /* Make fixed-point type nodes based on four different widths. */
10609 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10610 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10611 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10612 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10613 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10615 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10616 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10617 NAME ## _type_node = \
10618 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10619 u ## NAME ## _type_node = \
10620 make_or_reuse_unsigned_ ## KIND ## _type \
10621 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10622 sat_ ## NAME ## _type_node = \
10623 make_or_reuse_sat_signed_ ## KIND ## _type \
10624 (GET_MODE_BITSIZE (MODE ## mode)); \
10625 sat_u ## NAME ## _type_node = \
10626 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10627 (GET_MODE_BITSIZE (U ## MODE ## mode));
10629 /* Fixed-point type and mode nodes. */
10642 {
10645 /* Many back-ends define record types without setting TYPE_NAME.
10646 If we copied the record type here, we'd keep the original
10647 record type without a name. This breaks name mangling. So,
10648 don't copy record types and let c_common_nodes_and_builtins()
10649 declare the type to be __builtin_va_list. */
10654 }
10656 /* SCEV analyzer global shared trees. */
10661 }
10663 /* Modify DECL for given flags.
10664 TM_PURE attribute is set only on types, so the function will modify
10665 DECL's type when ECF_TM_PURE is used. */
10667 void
10669 {
10699 /* Looping const or pure is implied by noreturn.
10700 There is currently no way to declare looping const or looping pure alone. */
10703 }
10706 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10708 static void
10711 {
10712 tree decl;
10719 }
10721 /* Call this function after instantiating all builtins that the language
10722 front end cares about. This will build the rest of the builtins
10723 and internal functions that are relied upon by the tree optimizers and
10724 the middle-end. */
10726 void
10728 {
10734 {
10738 BUILT_IN_UNREACHABLE,
10746 }
10750 {
10761 }
10764 {
10767 NULL_TREE);
10770 }
10773 {
10779 }
10781 /* If we're checking the stack, `alloca' can throw. */
10782 const int alloca_flags
10786 {
10791 }
10796 BUILT_IN_ALLOCA_WITH_ALIGN,
10798 alloca_flags);
10803 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10805 alloca_flags);
10811 BUILT_IN_INIT_TRAMPOLINE,
10814 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10818 BUILT_IN_INIT_DESCRIPTOR,
10823 BUILT_IN_ADJUST_TRAMPOLINE,
10827 BUILT_IN_ADJUST_DESCRIPTOR,
10834 BUILT_IN_NONLOCAL_GOTO,
10841 BUILT_IN_SETJMP_SETUP,
10846 BUILT_IN_SETJMP_RECEIVER,
10855 BUILT_IN_STACK_RESTORE,
10860 NULL_TREE);
10873 /* If there's a possibility that we might use the ARM EABI, build the
10874 alternate __cxa_end_cleanup node used to resume from C++. */
10876 {
10879 BUILT_IN_CXA_END_CLEANUP,
10881 }
10885 BUILT_IN_UNWIND_RESUME,
10889 ECF_NORETURN);
10892 {
10894 NULL_TREE);
10896 BUILT_IN_RETURN_ADDRESS,
10898 ECF_NOTHROW);
10899 }
10903 {
10908 BUILT_IN_PROFILE_FUNC_ENTER,
10912 BUILT_IN_PROFILE_FUNC_EXIT,
10914 }
10916 /* The exception object and filter values from the runtime. The argument
10917 must be zero before exception lowering, i.e. from the front end. After
10918 exception lowering, it will be the region number for the exception
10919 landing pad. These functions are PURE instead of CONST to prevent
10920 them from being hoisted past the exception edge that will initialize
10921 its value in the landing pad. */
10925 /* Only use TM_PURE if we have TM language support. */
10938 NULL_TREE);
10940 BUILT_IN_EH_COPY_VALUES,
10943 /* Complex multiplication and division. These are handled as builtins
10944 rather than optabs because emit_library_call_value doesn't support
10945 complex. Further, we can do slightly better with folding these
10946 beasties if the real and complex parts of the arguments are separate. */
10947 {
10951 {
10978 /* For -ftrapping-math these should throw from a former
10979 -fnon-call-exception stmt. */
10981 NULL);
10987 NULL);
10991 }
10992 }
10995 }
10997 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10998 better way.
11000 If we requested a pointer to a vector, build up the pointers that
11001 we stripped off while looking for the inner type. Similarly for
11002 return values from functions.
11004 The argument TYPE is the top of the chain, and BOTTOM is the
11005 new type which we will point to. */
11007 tree
11009 {
11013 {
11017 }
11019 {
11023 }
11025 {
11028 }
11030 {
11033 }
11035 {
11037 /* The build_method_type_directly() routine prepends 'this' to argument list,
11038 so we must compensate by getting rid of it. */
11039 outer
11040 = build_method_type_directly
11042 inner,
11044 }
11046 {
11049 }
11050 else
11055 }
11057 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
11058 the inner type. */
11059 tree
11061 {
11062 poly_int64 nunits;
11066 {
11078 /* Check that there are no leftover bits. */
11086 }
11089 }
11091 /* Similarly, but takes the inner type and number of units, which must be
11092 a power of two. */
11094 tree
11096 {
11098 }
11100 /* Build truth vector with specified length and number of units. */
11102 tree
11104 {
11105 machine_mode mask_mode
11108 poly_uint64 vsize;
11111 else
11119 }
11121 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11123 tree
11125 {
11135 }
11137 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11139 tree
11141 {
11143 tree cand;
11144 /* We always build the non-opaque variant before the opaque one,
11145 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11151 /* Othewise build a variant type and make sure to queue it after
11152 the non-opaque type. */
11160 }
11162 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11164 wide_int
11166 {
11167 /* First handle elements that are directly encoded. */
11172 /* Identify the pattern that contains element I and work out the index of
11173 the last encoded element for that pattern. */
11179 /* If there are no steps, the final encoded value is the right one. */
11183 /* Otherwise work out the value from the last two encoded elements. */
11188 }
11190 /* Return the value of element I of VECTOR_CST T. */
11192 tree
11194 {
11195 /* First handle elements that are directly encoded. */
11200 /* If there are no steps, the final encoded value is the right one. */
11202 {
11203 /* Identify the pattern that contains element I and work out the index of
11204 the last encoded element for that pattern. */
11209 }
11211 /* Otherwise work out the value from the last two encoded elements. */
11214 }
11216 /* Given an initializer INIT, return TRUE if INIT is zero or some
11217 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11218 null, set *NONZERO if and only if INIT is known not to be all
11219 zeros. The combination of return value of false and *NONZERO
11220 false implies that INIT may but need not be all zeros. Other
11221 combinations indicate definitive answers. */
11223 bool
11225 {
11230 /* Conservatively clear NONZERO and set it only if INIT is definitely
11231 not all zero. */
11239 {
11248 /* ??? Note that this is not correct for C4X float formats. There,
11249 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11250 negative exponent. */
11285 {
11290 tree elt;
11297 }
11300 {
11315 }
11316 /* Fall through. */
11319 {
11327 /* We need to loop through all elements to handle cases like
11328 "\0" and "\0foobar". */
11331 {
11334 }
11337 }
11341 }
11342 }
11344 /* Return true if EXPR is an initializer expression in which every element
11345 is a constant that is numerically equal to 0 or 1. The elements do not
11346 need to be equal to each other. */
11348 bool
11350 {
11354 {
11362 {
11369 {
11373 }
11376 }
11380 }
11381 }
11383 /* Given an initializer INIT for a TYPE, return true if INIT is zero
11384 so that it can be replaced by value initialization. This function
11385 distinguishes betwen empty strings as initializers for arrays and
11386 for pointers (which make it return false). */
11388 bool
11390 {
11403 {
11409 tree elt_init;
11415 }
11422 tree fld_init;
11425 {
11426 /* Advance to the next member, skipping over everything that
11427 canot be initialized (including unnamed bit-fields). */
11431 {
11436 }
11445 }
11448 }
11450 /* Check if vector VEC consists of all the equal elements and
11451 that the number of elements corresponds to the type of VEC.
11452 The function returns first element of the vector
11453 or NULL_TREE if the vector is not uniform. */
11454 tree
11456 {
11469 {
11473 }
11477 {
11481 {
11483 {
11486 }
11489 }
11494 }
11497 }
11499 /* If the argument is INTEGER_CST, return it. If the argument is vector
11500 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11501 return NULL_TREE.
11502 Look through location wrappers. */
11504 tree
11506 {
11513 {
11517 }
11520 }
11522 /* If VECTOR_CST T has a single nonzero element, return the index of that
11523 element, otherwise return -1. */
11525 int
11527 {
11533 {
11536 }
11537 else
11542 {
11545 {
11549 }
11550 }
11552 }
11554 /* Build an empty statement at location LOC. */
11556 tree
11558 {
11562 }
11565 /* Build an OpenMP clause with code CODE. LOC is the location of the
11566 clause. */
11568 tree
11570 {
11571 tree t;
11586 }
11588 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11589 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11590 Except for the CODE and operand count field, other storage for the
11591 object is initialized to zeros. */
11593 tree
11595 {
11596 tree t;
11608 /* Can't use TREE_OPERAND to store the length because if checking is
11609 enabled, it will try to check the length before we store it. :-P */
11613 }
11615 /* Helper function for build_call_* functions; build a CALL_EXPR with
11616 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11617 the argument slots. */
11619 static tree
11621 {
11622 tree t;
11630 }
11632 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11633 FN and a null static chain slot. NARGS is the number of call arguments
11634 which are specified as "..." arguments. */
11636 tree
11638 {
11639 tree ret;
11645 }
11647 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11648 FN and a null static chain slot. NARGS is the number of call arguments
11649 which are specified as a va_list ARGS. */
11651 tree
11653 {
11654 tree t;
11662 }
11664 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11665 FN and a null static chain slot. NARGS is the number of call arguments
11666 which are specified as a tree array ARGS. */
11668 tree
11671 {
11672 tree t;
11681 }
11683 /* Like build_call_array, but takes a vec. */
11685 tree
11687 {
11696 }
11698 /* Conveniently construct a function call expression. FNDECL names the
11699 function to be called and N arguments are passed in the array
11700 ARGARRAY. */
11702 tree
11704 {
11709 }
11711 /* Conveniently construct a function call expression. FNDECL names the
11712 function to be called and the arguments are passed in the vector
11713 VEC. */
11715 tree
11717 {
11720 }
11723 /* Conveniently construct a function call expression. FNDECL names the
11724 function to be called, N is the number of arguments, and the "..."
11725 parameters are the argument expressions. */
11727 tree
11729 {
11739 }
11741 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11742 varargs macros aren't supported by all bootstrap compilers. */
11744 tree
11746 {
11756 }
11758 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11759 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11760 It will get gimplified later into an ordinary internal function. */
11762 tree
11765 {
11772 }
11774 /* Build internal call expression. This is just like CALL_EXPR, except
11775 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11776 internal function. */
11778 tree
11781 {
11791 }
11793 /* Return a function call to FN, if the target is guaranteed to support it,
11794 or null otherwise.
11796 N is the number of arguments, passed in the "...", and TYPE is the
11797 type of the return value. */
11799 tree
11802 {
11812 {
11815 {
11818 OPTIMIZE_FOR_BOTH))
11820 }
11822 }
11823 else
11824 {
11829 }
11830 }
11832 /* Return a function call to the appropriate builtin alloca variant.
11834 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11835 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11836 bound for SIZE in case it is not a fixed value. */
11838 tree
11840 {
11842 {
11844 return
11846 }
11848 {
11851 }
11852 else
11853 {
11856 }
11857 }
11859 /* Create a new constant string literal consisting of elements of type
11860 ELTYPE and return a tree node representing char* pointer to it as
11861 an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value is
11862 the LEN bytes at STR (the representation of the string, which may
11863 be wide). */
11865 tree
11868 {
11883 }
11887 /* Return true if T (assumed to be a DECL) must be assigned a memory
11888 location. */
11890 bool
11892 {
11898 }
11900 /* Return value of a constant X and sign-extend it. */
11902 HOST_WIDE_INT
11904 {
11908 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11912 {
11916 else
11918 }
11921 }
11923 /* If TYPE is an integral or pointer type, return an integer type with
11924 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11925 if TYPE is already an integer type of signedness UNSIGNEDP.
11926 If TYPE is a floating-point type, return an integer type with the same
11927 bitsize and with the signedness given by UNSIGNEDP; this is useful
11928 when doing bit-level operations on a floating-point value. */
11930 tree
11932 {
11937 {
11945 }
11948 {
11956 }
11965 else
11969 }
11971 /* If TYPE is an integral or pointer type, return an integer type with
11972 the same precision which is unsigned, or itself if TYPE is already an
11973 unsigned integer type. If TYPE is a floating-point type, return an
11974 unsigned integer type with the same bitsize as TYPE. */
11976 tree
11978 {
11980 }
11982 /* If TYPE is an integral or pointer type, return an integer type with
11983 the same precision which is signed, or itself if TYPE is already a
11984 signed integer type. If TYPE is a floating-point type, return a
11985 signed integer type with the same bitsize as TYPE. */
11987 tree
11989 {
11991 }
11993 /* If TYPE is a vector type, return a signed integer vector type with the
11994 same width and number of subparts. Otherwise return boolean_type_node. */
11996 tree
11998 {
12000 {
12005 }
12006 else
12008 }
12010 /* Returns the largest value obtainable by casting something in INNER type to
12011 OUTER type. */
12013 tree
12015 {
12021 /* Compute a unique number for every combination. */
12026 /* Determine the exponent to use. */
12028 {
12031 /* oprec <= iprec, outer: signed, inner: don't care. */
12036 /* oprec <= iprec, outer: unsigned, inner: don't care. */
12040 /* oprec > iprec, outer: signed, inner: signed. */
12044 /* oprec > iprec, outer: signed, inner: unsigned. */
12048 /* oprec > iprec, outer: unsigned, inner: signed. */
12052 /* oprec > iprec, outer: unsigned, inner: unsigned. */
12057 }
12061 }
12063 /* Returns the smallest value obtainable by casting something in INNER type to
12064 OUTER type. */
12066 tree
12068 {
12072 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
12073 and obtain 0. */
12075 /* If we are widening something of an unsigned type, OUTER type
12076 contains all values of INNER type. In particular, both INNER
12077 and OUTER types have zero in common. */
12080 else
12081 {
12082 /* If we are widening a signed type to another signed type, we
12083 want to obtain -2^^(iprec-1). If we are keeping the
12084 precision or narrowing to a signed type, we want to obtain
12085 -2^(oprec-1). */
12090 }
12091 }
12093 /* Return nonzero if two operands that are suitable for PHI nodes are
12094 necessarily equal. Specifically, both ARG0 and ARG1 must be either
12095 SSA_NAME or invariant. Note that this is strictly an optimization.
12096 That is, callers of this function can directly call operand_equal_p
12097 and get the same result, only slower. */
12099 int
12101 {
12107 }
12109 /* Returns number of zeros at the end of binary representation of X. */
12111 tree
12113 {
12115 }
12118 #define WALK_SUBTREE(NODE) \
12119 do \
12120 { \
12121 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
12122 if (result) \
12123 return result; \
12124 } \
12125 while (0)
12127 /* This is a subroutine of walk_tree that walks field of TYPE that are to
12128 be walked whenever a type is seen in the tree. Rest of operands and return
12129 value are as for walk_tree. */
12131 static tree
12134 {
12138 {
12142 /* We have to worry about mutually recursive pointers. These can't
12143 be written in C. They can in Ada. It's pathological, but
12144 there's an ACATS test (c38102a) that checks it. Deal with this
12145 by checking if we're pointing to another pointer, that one
12146 points to another pointer, that one does too, and we have no htab.
12147 If so, get a hash table. We check three levels deep to avoid
12148 the cost of the hash table if we don't need one. */
12153 {
12160 }
12162 /* fall through */
12171 /* Fall through. */
12175 {
12176 tree arg;
12178 /* We never want to walk into default arguments. */
12181 }
12185 /* Don't follow this nodes's type if a pointer for fear that
12186 we'll have infinite recursion. If we have a PSET, then we
12187 need not fear. */
12202 }
12205 }
12207 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12208 called with the DATA and the address of each sub-tree. If FUNC returns a
12209 non-NULL value, the traversal is stopped, and the value returned by FUNC
12210 is returned. If PSET is non-NULL it is used to record the nodes visited,
12211 and to avoid visiting a node more than once. */
12213 tree
12216 {
12219 tree result;
12221 #define WALK_SUBTREE_TAIL(NODE) \
12222 do \
12223 { \
12224 tp = & (NODE); \
12225 goto tail_recurse; \
12226 } \
12227 while (0)
12229 tail_recurse:
12230 /* Skip empty subtrees. */
12234 /* Don't walk the same tree twice, if the user has requested
12235 that we avoid doing so. */
12239 /* Call the function. */
12243 /* If we found something, return it. */
12249 /* Even if we didn't, FUNC may have decided that there was nothing
12250 interesting below this point in the tree. */
12252 {
12253 /* But we still need to check our siblings. */
12258 else
12260 }
12263 {
12267 }
12270 {
12283 /* None of these have subtrees other than those already walked
12284 above. */
12293 {
12299 /* Walk all elements but the first. */
12303 /* Now walk the first one as a tail call. */
12305 }
12312 {
12317 idx++)
12319 }
12326 {
12327 tree decl;
12329 {
12330 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12331 into declarations that are just mentioned, rather than
12332 declared; they don't really belong to this part of the tree.
12333 And, we can see cycles: the initializer for a declaration
12334 can refer to the declaration itself. */
12338 }
12340 }
12343 {
12344 tree_stmt_iterator i;
12347 }
12352 {
12356 /* FALLTHRU */
12401 /* FALLTHRU */
12436 {
12441 }
12461 {
12466 }
12470 }
12474 {
12477 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12478 But, we only want to walk once. */
12483 }
12486 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12487 defining. We only want to walk into these fields of a type in this
12488 case and not in the general case of a mere reference to the type.
12490 The criterion is as follows: if the field can be an expression, it
12491 must be walked only here. This should be in keeping with the fields
12492 that are directly gimplified in gimplify_type_sizes in order for the
12493 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12494 variable-sized types.
12496 Note that DECLs get walked as part of processing the BIND_EXPR. */
12498 {
12503 /* Call the function for the type. See if it returns anything or
12504 doesn't want us to continue. If we are to continue, walk both
12505 the normal fields and those for the declaration case. */
12510 /* But do not walk a pointed-to type since it may itself need to
12511 be walked in the declaration case if it isn't anonymous. */
12513 {
12517 }
12519 /* If this is a record type, also walk the fields. */
12521 {
12522 tree field;
12526 {
12527 /* We'd like to look at the type of the field, but we can
12528 easily get infinite recursion. So assume it's pointed
12529 to elsewhere in the tree. Also, ignore things that
12530 aren't fields. */
12539 }
12540 }
12542 /* Same for scalar types. */
12548 {
12551 }
12555 }
12556 /* FALLTHRU */
12560 {
12563 /* Walk over all the sub-trees of this operand. */
12566 /* Go through the subtrees. We need to do this in forward order so
12567 that the scope of a FOR_EXPR is handled properly. */
12569 {
12573 }
12574 }
12575 /* If this is a type, walk the needed fields in the type. */
12579 }
12581 /* We didn't find what we were looking for. */
12584 #undef WALK_SUBTREE_TAIL
12585 }
12586 #undef WALK_SUBTREE
12588 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12590 tree
12592 walk_tree_lh lh)
12593 {
12594 tree result;
12599 }
12602 tree
12604 {
12611 }
12613 void
12615 {
12619 {
12621 }
12622 else
12624 }
12626 /* Create a nameless artificial label and put it in the current
12627 function context. The label has a location of LOC. Returns the
12628 newly created label. */
12630 tree
12632 {
12640 }
12642 /* Given a tree, try to return a useful variable name that we can use
12643 to prefix a temporary that is being assigned the value of the tree.
12644 I.E. given <temp> = &A, return A. */
12648 {
12649 tree stripped_decl;
12656 {
12661 }
12662 else
12663 {
12665 {
12670 }
12671 }
12672 }
12674 /* Return true if TYPE has a variable argument list. */
12676 bool
12678 {
12679 function_args_iterator args_iter;
12686 {
12688 }
12691 }
12693 /* Return true if TYPE has a prototype. */
12695 bool
12697 {
12698 tree t;
12704 }
12706 /* If BLOCK is inlined from an __attribute__((__artificial__))
12707 routine, return pointer to location from where it has been
12708 called. */
12709 location_t *
12711 {
12716 {
12719 {
12720 /* If AO is an artificial inline, point RET to the
12721 call site locus at which it has been inlined and continue
12722 the loop, in case AO's caller is also an artificial
12723 inline. */
12727 else
12729 }
12734 }
12736 }
12739 /* If EXP is inlined from an __attribute__((__artificial__))
12740 function, return the location of the original call expression. */
12742 location_t
12744 {
12749 else
12751 }
12754 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12755 nodes. */
12757 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12759 hashval_t
12761 {
12769 {
12772 }
12777 else
12780 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12781 something else. */
12787 }
12789 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12790 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12791 same. */
12793 bool
12795 {
12808 else
12810 }
12812 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12814 tree
12816 {
12817 tree t;
12819 /* Use the cache of optimization nodes. */
12822 opts);
12827 {
12828 /* Insert this one into the hash table. */
12832 /* Make a new node for next time round. */
12834 }
12837 }
12839 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12841 tree
12843 {
12844 tree t;
12846 /* Use the cache of optimization nodes. */
12849 opts);
12854 {
12855 /* Insert this one into the hash table. */
12859 /* Make a new node for next time round. */
12861 }
12864 }
12866 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12867 so that they aren't saved during PCH writing. */
12869 void
12871 {
12876 }
12878 /* Determine the "ultimate origin" of a block. */
12880 tree
12882 {
12887 else
12888 {
12893 }
12894 }
12896 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12897 no instruction. */
12899 bool
12901 {
12902 /* Do not strip casts into or out of differing address spaces. */
12905 {
12910 }
12913 {
12914 /* We already know that outer_type is not a pointer with
12915 a non-generic address space. */
12917 }
12919 /* Use precision rather then machine mode when we can, which gives
12920 the correct answer even for submode (bit-field) types. */
12929 /* Otherwise fall back on comparing machine modes (e.g. for
12930 aggregate types, floats). */
12932 }
12934 /* Return true iff conversion in EXP generates no instruction. Mark
12935 it inline so that we fully inline into the stripping functions even
12936 though we have two uses of this function. */
12940 {
12955 }
12957 /* Return true iff conversion in EXP generates no instruction. Don't
12958 consider conversions changing the signedness. */
12960 static bool
12962 {
12973 }
12975 /* Strip conversions from EXP according to tree_nop_conversion and
12976 return the resulting expression. */
12978 tree
12980 {
12984 }
12986 /* Strip conversions from EXP according to tree_sign_nop_conversion
12987 and return the resulting expression. */
12989 tree
12991 {
12995 }
12997 /* Avoid any floating point extensions from EXP. */
12998 tree
13000 {
13003 /* For floating point constant look up the narrowest type that can hold
13004 it properly and handle it like (type)(narrowest_type)constant.
13005 This way we can optimize for instance a=a*2.0 where "a" is float
13006 but 2.0 is double constant. */
13008 {
13009 REAL_VALUE_TYPE orig;
13022 }
13041 }
13043 /* Strip out all handled components that produce invariant
13044 offsets. */
13046 const_tree
13048 {
13050 {
13052 {
13067 }
13069 }
13072 }
13076 /* Return the GCC personality function decl. */
13078 tree
13080 {
13084 }
13086 /* TARGET is a call target of GIMPLE call statement
13087 (obtained by gimple_call_fn). Return true if it is
13088 OBJ_TYPE_REF representing an virtual call of C++ method.
13089 (As opposed to OBJ_TYPE_REF representing objc calls
13090 through a cast where middle-end devirtualization machinery
13091 can't apply.) */
13093 bool
13095 {
13104 /* If we do not have BINFO associated, it means that type was built
13105 without devirtualization enabled. Do not consider this a virtual
13106 call. */
13110 }
13112 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
13114 static tree
13116 {
13127 }
13129 /* Try to find a base info of BINFO that would have its field decl at offset
13130 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
13131 found, return, otherwise return NULL_TREE. */
13133 tree
13135 {
13139 {
13141 tree fld;
13150 {
13158 }
13162 /* Offset 0 indicates the primary base, whose vtable contents are
13163 represented in the binfo for the derived class. */
13165 {
13167 /* Offsets in BINFO are in bytes relative to the whole structure
13168 while POS is in bits relative to the containing field. */
13175 {
13178 }
13181 else
13183 binfo_offset);
13184 }
13188 }
13189 }
13191 /* Returns true if X is a typedef decl. */
13193 bool
13195 {
13198 }
13200 /* Returns true iff TYPE is a type variant created for a typedef. */
13202 bool
13204 {
13206 }
13208 /* A class to handle converting a string that might contain
13209 control characters, (eg newline, form-feed, etc), into one
13210 in which contains escape sequences instead. */
13212 class escaped_string
13213 {
13222 };
13224 /* PR 84195: Replace control characters in "unescaped" with their
13225 escaped equivalents. Allow newlines if -fmessage-length has
13226 been set to a non-zero value. This is done here, rather than
13227 where the attribute is recorded as the message length can
13228 change between these two locations. */
13230 void
13232 {
13250 {
13254 {
13258 }
13261 {
13263 {
13264 /* We only allocate space for a new string if we
13265 actually encounter a control character that
13266 needs replacing. */
13270 }
13275 {
13284 }
13285 }
13288 }
13291 {
13295 }
13296 }
13298 /* Warn about a use of an identifier which was marked deprecated. Returns
13299 whether a warning was given. */
13301 bool
13303 {
13304 escaped_string msg;
13310 {
13314 {
13319 }
13320 }
13330 {
13331 auto_diagnostic_group d;
13335 else
13340 }
13342 {
13347 {
13353 }
13355 auto_diagnostic_group d;
13357 {
13361 else
13364 }
13365 else
13366 {
13370 else
13373 }
13377 }
13380 }
13382 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13383 somewhere in it. */
13385 bool
13387 {
13389 {
13394 }
13397 }
13399 /* Try to determine whether a TRY_CATCH expression can fall through.
13400 This is a subroutine of block_may_fallthru. */
13402 static bool
13404 {
13405 tree_stmt_iterator i;
13407 /* If the TRY block can fall through, the whole TRY_CATCH can
13408 fall through. */
13414 {
13416 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13417 catch expression and a body. The whole TRY_CATCH may fall
13418 through iff any of the catch bodies falls through. */
13420 {
13423 }
13427 /* The exception filter expression only matters if there is an
13428 exception. If the exception does not match EH_FILTER_TYPES,
13429 we will execute EH_FILTER_FAILURE, and we will fall through
13430 if that falls through. If the exception does match
13431 EH_FILTER_TYPES, the stack unwinder will continue up the
13432 stack, so we will not fall through. We don't know whether we
13433 will throw an exception which matches EH_FILTER_TYPES or not,
13434 so we just ignore EH_FILTER_TYPES and assume that we might
13435 throw an exception which doesn't match. */
13439 /* This case represents statements to be executed when an
13440 exception occurs. Those statements are implicitly followed
13441 by a RESX statement to resume execution after the exception.
13442 So in this case the TRY_CATCH never falls through. */
13444 }
13445 }
13447 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13448 need not be 100% accurate; simply be conservative and return true if we
13449 don't know. This is used only to avoid stupidly generating extra code.
13450 If we're wrong, we'll just delete the extra code later. */
13452 bool
13454 {
13455 /* This CONST_CAST is okay because expr_last returns its argument
13456 unmodified and we assign it to a const_tree. */
13460 {
13463 /* Easy cases. If the last statement of the block implies
13464 control transfer, then we can't fall through. */
13468 /* If there is a default: label or case labels cover all possible
13469 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13470 to some case label in all cases and all we care is whether the
13471 SWITCH_BODY falls through. */
13488 /* The finally clause is always executed after the try clause,
13489 so if it does not fall through, then the try-finally will not
13490 fall through. Otherwise, if the try clause does not fall
13491 through, then when the finally clause falls through it will
13492 resume execution wherever the try clause was going. So the
13493 whole try-finally will only fall through if both the try
13494 clause and the finally clause fall through. */
13504 else
13506 /* FALLTHRU */
13509 /* Functions that do not return do not fall through. */
13523 }
13524 }
13526 /* True if we are using EH to handle cleanups. */
13529 /* This routine is called from front ends to indicate eh should be used for
13530 cleanups. */
13531 void
13533 {
13535 }
13537 /* Query whether EH is used for cleanups. */
13538 bool
13540 {
13542 }
13544 /* Wrapper for tree_code_name to ensure that tree code is valid */
13547 {
13551 {
13555 }
13558 }
13560 /* Drops the TREE_OVERFLOW flag from T. */
13562 tree
13564 {
13567 /* For tree codes with a sharing machinery re-build the result. */
13571 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13572 and canonicalize the result. */
13574 {
13575 tree_vector_builder builder;
13579 {
13584 }
13586 }
13588 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13589 and drop the flag. */
13593 /* For constants that contain nested constants, drop the flag
13594 from those as well. */
13596 {
13601 }
13604 }
13606 /* Given a memory reference expression T, return its base address.
13607 The base address of a memory reference expression is the main
13608 object being referenced. For instance, the base address for
13609 'array[i].fld[j]' is 'array'. You can think of this as stripping
13610 away the offset part from a memory address.
13612 This function calls handled_component_p to strip away all the inner
13613 parts of the memory reference until it reaches the base object. */
13615 tree
13617 {
13626 /* ??? Either the alias oracle or all callers need to properly deal
13627 with WITH_SIZE_EXPRs before we can look through those. */
13632 }
13634 /* Return a tree of sizetype representing the size, in bytes, of the element
13635 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13637 tree
13639 {
13644 /* If a size was specified in the ARRAY_REF, it's the size measured
13645 in alignment units of the element type. So multiply by that value. */
13647 {
13648 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13649 sizetype from another type of the same width and signedness. */
13654 }
13656 /* Otherwise, take the size from that of the element type. Substitute
13657 any PLACEHOLDER_EXPR that we have. */
13658 else
13660 }
13662 /* Return a tree representing the lower bound of the array mentioned in
13663 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13665 tree
13667 {
13670 /* If a lower bound is specified in EXP, use it. */
13674 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13675 substituting for a PLACEHOLDER_EXPR as needed. */
13679 /* Otherwise, return a zero of the appropriate type. */
13681 }
13683 /* Return a tree representing the upper bound of the array mentioned in
13684 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13686 tree
13688 {
13691 /* If there is a domain type and it has an upper bound, use it, substituting
13692 for a PLACEHOLDER_EXPR as needed. */
13696 /* Otherwise fail. */
13698 }
13700 /* Returns true if REF is an array reference or a component reference
13701 to an array at the end of a structure.
13702 If this is the case, the array may be allocated larger
13703 than its upper bound implies. */
13705 bool
13707 {
13708 tree atype;
13712 {
13715 }
13719 else
13727 {
13728 /* If the reference chain contains a component reference to a
13729 non-union type and there follows another field the reference
13730 is not at the end of a structure. */
13732 {
13734 {
13740 }
13741 }
13742 /* If we have a multi-dimensional array we do not consider
13743 a non-innermost dimension as flex array if the whole
13744 multi-dimensional array is at struct end.
13745 Same for an array of aggregates with a trailing array
13746 member. */
13750 ;
13751 /* If we view an underlying object as sth else then what we
13752 gathered up to now is what we have to rely on. */
13755 else
13759 }
13761 /* The array now is at struct end. Treat flexible arrays as
13762 always subject to extend, even into just padding constrained by
13763 an underlying decl. */
13773 /* If the reference is based on a declared entity, the size of the array
13774 is constrained by its given domain. (Do not trust commons PR/69368). */
13776 && !(flag_unconstrained_commons
13780 {
13781 /* Check whether the array domain covers all of the available
13782 padding. */
13783 poly_int64 offset;
13791 /* If at least one extra element fits it is a flexarray. */
13800 }
13803 }
13805 /* Return a tree representing the offset, in bytes, of the field referenced
13806 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13808 tree
13810 {
13815 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13816 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13817 value. */
13819 {
13820 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13821 sizetype from another type of the same width and signedness. */
13827 }
13829 /* Otherwise, take the offset from that of the field. Substitute
13830 any PLACEHOLDER_EXPR that we have. */
13831 else
13833 }
13835 /* Return the machine mode of T. For vectors, returns the mode of the
13836 inner type. The main use case is to feed the result to HONOR_NANS,
13837 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13839 machine_mode
13841 {
13847 }
13849 /* Vector types need to re-check the target flags each time we report
13850 the machine mode. We need to do this because attribute target can
13851 change the result of vector_mode_supported_p and have_regs_of_mode
13852 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13853 change on a per-function basis. */
13854 /* ??? Possibly a better solution is to run through all the types
13855 referenced by a function and re-compute the TYPE_MODE once, rather
13856 than make the TYPE_MODE macro call a function. */
13858 machine_mode
13860 {
13861 machine_mode mode;
13869 {
13870 scalar_int_mode innermode;
13872 /* For integers, try mapping it to a same-sized scalar mode. */
13874 {
13877 scalar_int_mode mode;
13881 }
13884 }
13887 }
13889 /* Verify that basic properties of T match TV and thus T can be a variant of
13890 TV. TV should be the more specified variant (i.e. the main variant). */
13892 static bool
13894 {
13895 /* Type variant can differ by:
13897 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13898 ENCODE_QUAL_ADDR_SPACE.
13899 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13900 in this case some values may not be set in the variant types
13901 (see TYPE_COMPLETE_P checks).
13902 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13903 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13904 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13905 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13906 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13907 this is necessary to make it possible to merge types form different TUs
13908 - arrays, pointers and references may have TREE_TYPE that is a variant
13909 of TREE_TYPE of their main variants.
13910 - aggregates may have new TYPE_FIELDS list that list variants of
13911 the main variant TYPE_FIELDS.
13912 - vector types may differ by TYPE_VECTOR_OPAQUE
13913 */
13915 /* Convenience macro for matching individual fields. */
13916 #define verify_variant_match(flag) \
13917 do { \
13918 if (flag (tv) != flag (t)) \
13919 { \
13921 debug_tree (tv); \
13922 return false; \
13923 } \
13924 } while (false)
13926 /* tree_base checks. */
13929 /* FIXME: Ada builds non-artificial variants of artificial types. */
13934 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13941 else
13943 /* FIXME: This check trigger during libstdc++ build. */
13947 /* tree_type_common checks. */
13950 {
13958 {
13968 }
13969 }
13976 /* During LTO we merge variant lists from diferent translation units
13977 that may differ BY TYPE_CONTEXT that in turn may point
13978 to TRANSLATION_UNIT_DECL.
13979 Ada also builds variants of types with different TYPE_CONTEXT. */
13987 {
13991 }
13993 /* tree_type_non_common checks. */
13995 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13996 and dangle the pointer from time to time. */
14000 {
14004 }
14010 {
14013 }
14020 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14021 or even type's main variant. This is needed to make bootstrap pass
14022 and the bug seems new in GCC 5.
14023 C++ FE should be updated to make this consistent and we should check
14024 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14025 is a match with main variant.
14027 Also disable the check for Java for now because of parser hack that builds
14028 first an dummy BINFO and then sometimes replace it by real BINFO in some
14029 of the copies. */
14032 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14033 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14034 at LTO time only. */
14036 {
14044 }
14046 /* Check various uses of TYPE_VALUES_RAW. */
14052 /* Permit incomplete variants of complete type. While FEs may complete
14053 all variants, this does not happen for C++ templates in all cases. */
14057 {
14060 /* Fortran builds qualified variants as new records with items of
14061 qualified type. Verify that they looks same. */
14068 /* FIXME: gfc_nonrestricted_type builds all types as variants
14069 with exception of pointer types. It deeply copies the type
14070 which means that we may end up with a variant type
14071 referring non-variant pointer. We may change it to
14072 produce types as variants, too, like
14073 objc_get_protocol_qualified_type does. */
14079 {
14087 }
14088 }
14091 /* For C++ the qualified variant of array type is really an array type
14092 of qualified TREE_TYPE.
14093 objc builds variants of pointer where pointer to type is a variant, too
14094 in objc_get_protocol_qualified_type. */
14100 {
14108 }
14111 {
14119 }
14121 #undef verify_variant_match
14122 }
14125 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14126 the middle-end types_compatible_p function. It needs to avoid
14127 claiming types are different for types that should be treated
14128 the same with respect to TBAA. Canonical types are also used
14129 for IL consistency checks via the useless_type_conversion_p
14130 predicate which does not handle all type kinds itself but falls
14131 back to pointer-comparison of TYPE_CANONICAL for aggregates
14132 for example. */
14134 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14135 type calculation because we need to allow inter-operability between signed
14136 and unsigned variants. */
14138 bool
14140 {
14141 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14142 signed char and unsigned char. Similarly fortran FE builds
14143 C_SIZE_T as signed type, while C defines it unsigned. */
14146 == INTEGER_TYPE
14149 }
14151 /* Return true iff T1 and T2 are structurally identical for what
14152 TBAA is concerned.
14153 This function is used both by lto.c canonical type merging and by the
14154 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14155 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14156 only for LTO because only in these cases TYPE_CANONICAL equivalence
14157 correspond to one defined by gimple_canonical_types_compatible_p. */
14159 bool
14162 {
14163 /* Type variants should be same as the main variant. When not doing sanity
14164 checking to verify this fact, go to main variants and save some work. */
14166 {
14169 }
14171 /* Check first for the obvious case of pointer identity. */
14175 /* Check that we have two types to compare. */
14179 /* We consider complete types always compatible with incomplete type.
14180 This does not make sense for canonical type calculation and thus we
14181 need to ensure that we are never called on it.
14183 FIXME: For more correctness the function probably should have three modes
14184 1) mode assuming that types are complete mathcing their structure
14185 2) mode allowing incomplete types but producing equivalence classes
14186 and thus ignoring all info from complete types
14187 3) mode allowing incomplete types to match complete but checking
14188 compatibility between complete types.
14190 1 and 2 can be used for canonical type calculation. 3 is the real
14191 definition of type compatibility that can be used i.e. for warnings during
14192 declaration merging. */
14197 /* If the types have been previously registered and found equal
14198 they still are. */
14202 {
14203 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14204 they are always NULL, but they are set to non-NULL for types
14205 constructed by build_pointer_type and variants. In this case the
14206 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14207 all pointers are considered equal. Be sure to not return false
14208 negatives. */
14212 }
14214 /* For types where we do ODR based TBAA the canonical type is always
14215 set correctly, so we know that types are different if their
14216 canonical types does not match. */
14222 /* Can't be the same type if the types don't have the same code. */
14227 /* Qualifiers do not matter for canonical type comparison purposes. */
14229 /* Void types and nullptr types are always the same. */
14234 /* Can't be the same type if they have different mode. */
14238 /* Non-aggregate types can be handled cheaply. */
14246 {
14247 /* Can't be the same type if they have different recision. */
14251 /* In some cases the signed and unsigned types are required to be
14252 inter-operable. */
14257 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14258 interoperable with "signed char". Unless all frontends are revisited
14259 to agree on these types, we must ignore the flag completely. */
14261 /* Fortran standard define C_PTR type that is compatible with every
14262 C pointer. For this reason we need to glob all pointers into one.
14263 Still pointers in different address spaces are not compatible. */
14265 {
14269 }
14271 /* Tail-recurse to components. */
14276 trust_type_canonical);
14279 }
14281 /* Do type-specific comparisons. */
14283 {
14285 /* Array types are the same if the element types are the same and
14286 the number of elements are the same. */
14288 trust_type_canonical)
14293 else
14294 {
14298 /* For an incomplete external array, the type domain can be
14299 NULL_TREE. Check this condition also. */
14304 else
14305 {
14311 /* The minimum/maximum values have to be the same. */
14323 else
14325 }
14326 }
14330 /* Function types are the same if the return type and arguments types
14331 are the same. */
14333 trust_type_canonical))
14338 else
14339 {
14345 {
14348 trust_type_canonical))
14350 }
14356 }
14361 {
14364 /* Don't try to compare variants of an incomplete type, before
14365 TYPE_FIELDS has been copied around. */
14373 /* For aggregate types, all the fields must be the same. */
14377 {
14378 /* Skip non-fields and zero-sized fields. */
14389 /* The fields must have the same name, offset and type. */
14392 || !gimple_canonical_types_compatible_p
14394 trust_type_canonical))
14396 }
14398 /* If one aggregate has more fields than the other, they
14399 are not the same. */
14404 }
14407 /* Consider all types with language specific trees in them mutually
14408 compatible. This is executed only from verify_type and false
14409 positives can be tolerated. */
14412 }
14413 }
14415 /* Verify type T. */
14417 void
14419 {
14423 {
14426 }
14428 {
14432 }
14438 ;
14440 {
14444 }
14445 /* Method and function types cannot be used to address memory and thus
14446 TYPE_CANONICAL really matters only for determining useless conversions.
14448 FIXME: C++ FE produce declarations of builtin functions that are not
14449 compatible with main variants. */
14451 ;
14453 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14454 with variably sized arrays because their sizes possibly
14455 gimplified to different variables. */
14459 {
14463 }
14467 {
14471 }
14473 {
14478 }
14481 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14483 {
14484 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14485 and danagle the pointer from time to time. */
14489 {
14493 }
14494 }
14496 {
14499 {
14503 }
14504 }
14506 {
14509 {
14513 }
14514 }
14517 {
14518 /* FIXME: The following check should pass:
14519 useless_type_conversion_p (const_cast <tree> (t),
14520 TREE_TYPE (TYPE_MIN_VALUE (t))
14521 but does not for C sizetypes in LTO. */
14522 }
14524 /* Check various uses of TYPE_MAXVAL_RAW. */
14526 {
14528 ;
14530 {
14534 }
14536 {
14540 }
14541 }
14543 {
14547 {
14551 }
14552 }
14554 {
14558 {
14562 }
14563 }
14566 {
14567 /* FIXME: The following check should pass:
14568 useless_type_conversion_p (const_cast <tree> (t),
14569 TREE_TYPE (TYPE_MAX_VALUE (t))
14570 but does not for C sizetypes in LTO. */
14571 }
14573 {
14576 {
14580 }
14581 }
14583 {
14587 }
14590 {
14594 }
14596 /* Check various uses of TYPE_VALUES_RAW. */
14599 {
14603 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14604 CONST_DECL of ENUMERAL TYPE. */
14606 {
14611 }
14614 {
14620 }
14622 {
14627 }
14628 }
14630 {
14632 {
14636 }
14637 }
14639 {
14641 {
14644 }
14646 {
14647 /* TODO: verify properties of decls. */
14649 ;
14651 ;
14653 ;
14655 ;
14657 ;
14659 ;
14661 ;
14662 else
14663 {
14667 }
14668 }
14669 }
14676 {
14678 {
14683 }
14685 {
14689 }
14690 /* Verify just enough of cache to ensure that no one copied it to new type.
14691 All copying should go by copy_node that should clear it. */
14693 {
14698 {
14703 }
14704 }
14705 }
14708 {
14709 /* C++ FE uses TREE_PURPOSE to store initial values. */
14711 {
14715 }
14717 {
14721 }
14722 }
14724 {
14728 }
14736 {
14739 }
14741 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14742 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14743 of a type. */
14746 {
14749 }
14752 {
14755 }
14756 }
14759 /* Return 1 if ARG interpreted as signed in its precision is known to be
14760 always positive or 2 if ARG is known to be always negative, or 3 if
14761 ARG may be positive or negative. */
14763 int
14765 {
14772 {
14776 else
14778 }
14782 {
14784 /* Narrower value zero extended into wider type
14785 will always result in positive values. */
14792 }
14798 {
14802 {
14806 {
14815 }
14816 }
14818 }
14820 {
14821 /* For unsigned values, the "positive" range comes
14822 below the "negative" range. */
14827 }
14828 else
14829 {
14834 }
14836 }
14841 /* Return true if ARG is marked with the nonnull attribute in the
14842 current function signature. */
14844 bool
14846 {
14854 /* The static chain decl is always non null. */
14858 /* THIS argument of method is always non-NULL. */
14864 /* Values passed by reference are always non-NULL. */
14871 {
14874 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14878 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14882 /* Get the position number for ARG in the function signature. */
14884 t;
14886 {
14889 }
14893 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14895 {
14898 }
14899 }
14902 }
14904 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14905 information. */
14907 location_t
14909 {
14913 }
14915 location_t
14917 {
14918 source_range src_range;
14922 }
14924 location_t
14926 {
14932 pure_loc,
14933 src_range,
14934 NULL);
14937 }
14939 /* Return EXPR, potentially wrapped with a node expression LOC,
14940 if !CAN_HAVE_LOCATION_P (expr).
14942 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14943 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14945 Wrapper nodes can be identified using location_wrapper_p. */
14947 tree
14949 {
14956 /* We should only be adding wrappers for constants and for decls,
14957 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14962 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14963 any impact of the wrapper nodes. */
14967 /* If any auto_suppress_location_wrappers are active, don't create
14968 wrappers. */
14972 tree_code code
14977 /* Mark this node as being a wrapper. */
14980 }
14984 /* Return the name of combined function FN, for debugging purposes. */
14988 {
14990 {
14993 }
14994 else
14996 }
14998 /* Return a bitmap with a bit set corresponding to each argument in
14999 a function call type FNTYPE declared with attribute nonnull,
15000 or null if none of the function's argument are nonnull. The caller
15001 must free the bitmap. */
15003 bitmap
15005 {
15015 /* A function declaration can specify multiple attribute nonnull,
15016 each with zero or more arguments. The loop below creates a bitmap
15017 representing a union of all the arguments. An empty (but non-null)
15018 bitmap means that all arguments have been declaraed nonnull. */
15020 {
15029 {
15030 /* Clear the bitmap in case a previous attribute nonnull
15031 set it and this one overrides it for all arguments. */
15034 }
15036 /* Iterate over the indices of the format arguments declared nonnull
15037 and set a bit for each. */
15039 {
15042 }
15043 }
15046 }
15048 /* Returns true if TYPE is a type where it and all of its subobjects
15049 (recursively) are of structure, union, or array type. */
15051 static bool
15053 {
15055 {
15062 }
15068 }
15070 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15071 that shouldn't be passed via stack. */
15073 bool
15075 {
15086 }
15088 /* Like int_size_in_bytes, but handle empty records specially. */
15090 HOST_WIDE_INT
15092 {
15094 }
15096 /* Like size_in_bytes, but handle empty records specially. */
15098 tree
15100 {
15102 }
15104 /* Return true if an expression with CODE has to have the same result type as
15105 its first operand. */
15107 bool
15109 {
15111 {
15145 }
15146 }
15148 /* Return a typenode for the "standard" C type with a given name. */
15149 tree
15151 {
15183 }
15185 /* List of pointer types used to declare builtins before we have seen their
15186 real declaration.
15188 Keep the size up to date in tree.h ! */
15190 {
15197 };
15199 /* Return the maximum object size. */
15201 tree
15203 {
15204 /* To do: Make this a configurable parameter. */
15206 }
15208 #if CHECKING_P
15212 /* Selftests for tree. */
15214 /* Verify that integer constants are sane. */
15216 static void
15218 {
15231 }
15233 /* Verify identifiers. */
15235 static void
15237 {
15241 }
15243 /* Verify LABEL_DECL. */
15245 static void
15247 {
15253 }
15255 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15256 are given by VALS. */
15258 static tree
15260 {
15265 }
15267 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15269 static void
15271 {
15277 }
15279 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15280 and that its elements match EXPECTED. */
15282 static void
15285 {
15292 }
15294 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15295 and NPATTERNS background elements, and that its elements match
15296 EXPECTED. */
15298 static void
15301 {
15308 }
15310 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15311 and that its elements match EXPECTED. */
15313 static void
15316 {
15323 }
15325 /* Test the creation of VECTOR_CSTs. */
15327 static void
15329 {
15335 /* Test a simple linear series with a base of 0 and a step of 1:
15336 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15342 /* Try the same with the first element replaced by 100:
15343 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15348 /* Try a series that wraps around.
15349 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15355 /* Try a downward series:
15356 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15362 /* Try two interleaved series with different bases and steps:
15363 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15366 {
15369 }
15373 /* Try a duplicated value:
15374 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15380 /* Try an interleaved duplicated value:
15381 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15388 /* Try a duplicated value with 2 exceptions
15389 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15395 /* Try with and without a step
15396 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15402 /* Try a fully-general constant:
15403 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15407 }
15409 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15410 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15411 modifying its argument in-place. */
15413 static void
15415 {
15418 }
15420 /* Verify location wrappers. */
15422 static void
15424 {
15429 /* Wrapping a constant. */
15439 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15442 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15447 /* Wrapping a STRING_CST. */
15459 /* Wrapping a variable. */
15462 integer_type_node);
15471 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15472 wrapper. */
15477 /* Verify that STRIP_NOPS removes wrappers. */
15481 }
15483 /* Test various tree predicates. Verify that location wrappers don't
15484 affect the results. */
15486 static void
15488 {
15489 /* Build various constants and wrappers around them. */
15517 /* TODO: vector constants. */
15519 /* Test integer_onep. */
15539 /* Test integer_zerop. */
15559 /* Test integer_all_onesp. */
15579 /* Test integer_minus_onep. */
15599 /* Test integer_each_onep. */
15619 /* Test integer_truep. */
15639 /* Test integer_nonzerop. */
15659 /* Test real_zerop. */
15679 /* Test real_onep. */
15699 /* Test real_minus_onep. */
15719 /* Test zerop. */
15739 /* Test tree_expr_nonnegative_p. */
15759 /* Test tree_expr_nonzero_p. */
15767 /* Test integer_valued_real_p. */
15774 /* Test integer_pow2p. */
15779 /* Test uniform_integer_cst_p. */
15798 }
15800 /* Check that string escaping works correctly. */
15802 static void
15804 {
15806 escaped_string msg;
15809 /* ASSERT_STREQ does not accept NULL as a valid test
15810 result, so we have to use ASSERT_EQ instead. */
15819 /* Ensure that we have -fmessage-length set to 0. */
15829 /* Now repeat the tests with -fmessage-length set to 5. */
15832 /* Note that the newline is not translated into an escape. */
15839 /* Restore the original message length setting. */
15841 }
15843 /* Run all of the selftests within this file. */
15845 void
15847 {
15855 }