| blob | 45aacadbe2dffef94ef8ac9a0eb3d0df0ef38459 |
1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2020 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. */
72 /* Tree code classes. */
74 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
75 #define END_OF_BASE_TREE_CODES tcc_exceptional,
79 };
81 #undef DEFTREECODE
82 #undef END_OF_BASE_TREE_CODES
84 /* Table indexed by tree code giving number of expression
85 operands beyond the fixed part of the node structure.
86 Not used for types or decls. */
88 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
89 #define END_OF_BASE_TREE_CODES 0,
93 };
95 #undef DEFTREECODE
96 #undef END_OF_BASE_TREE_CODES
98 /* Names of tree components.
99 Used for printing out the tree and error messages. */
100 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
105 };
107 #undef DEFTREECODE
108 #undef END_OF_BASE_TREE_CODES
110 /* Each tree code class has an associated string representation.
111 These must correspond to the tree_code_class entries. */
114 {
125 "expression"
126 };
128 /* obstack.[ch] explicitly declined to prototype this. */
131 /* Statistics-gathering stuff. */
137 /* Keep in sync with tree.h:enum tree_node_kind. */
155 };
157 /* Unique id for next decl created. */
159 /* Unique id for next type created. */
161 /* Unique id for next debug decl created. Use negative numbers,
162 to catch erroneous uses. */
165 /* Since we cannot rehash a type after it is in the table, we have to
166 keep the hash code. */
170 tree type;
171 };
173 /* Initial size of the hash table (rounded to next prime). */
174 #define TYPE_HASH_INITIAL_SIZE 1000
177 {
181 static int
183 {
185 }
186 };
188 /* Now here is the hash table. When recording a type, it is added to
189 the slot whose index is the hash code. Note that the hash table is
190 used for several kinds of types (function types, array types and
191 array index range types, for now). While all these live in the
192 same table, they are completely independent, and the hash code is
193 computed differently for each of these. */
197 /* Hash table and temporary node for larger integer const values. */
201 {
204 };
208 /* Class and variable for making sure that there is a single POLY_INT_CST
209 for a given value. */
211 {
215 };
219 /* Hash table for optimization flags and target option flags. Use the same
220 hash table for both sets of options. Nodes for building the current
221 optimization and target option nodes. The assumption is most of the time
222 the options created will already be in the hash table, so we avoid
223 allocating and freeing up a node repeatably. */
228 {
231 };
235 /* General tree->tree mapping structure for use in hash tables. */
245 {
248 static bool
250 {
252 }
254 static int
256 {
258 }
259 };
279 /* Number of operands for each OpenMP clause. */
281 {
362 };
365 {
446 };
449 /* Return the tree node structure used by tree code CODE. */
453 {
455 {
458 {
470 }
484 }
487 {
488 /* tcc_constant cases. */
498 /* tcc_exceptional cases. */
515 }
516 }
519 /* Initialize tree_contains_struct to describe the hierarchy of tree
520 nodes. */
522 static void
524 {
528 {
535 /* Mark the TS structure itself. */
538 /* Mark all the structures that TS is derived from. */
540 {
620 }
621 }
623 /* Basic consistency checks for attributes used in fold. */
664 }
667 /* Init tree.c. */
669 void
671 {
672 /* Initialize the hash table of types. */
673 type_hash_table
676 debug_expr_for_decl
679 value_expr_for_decl
693 /* Initialize the tree_contains_struct array. */
696 }
698 \f
699 /* The name of the object as the assembler will see it (but before any
700 translations made by ASM_OUTPUT_LABELREF). Often this is the same
701 as DECL_NAME. It is an IDENTIFIER_NODE. */
702 tree
704 {
708 }
710 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
711 (either of which may be NULL). Inform the FE, if this changes the
712 name. */
714 void
716 {
719 }
721 /* When the target supports COMDAT groups, this indicates which group the
722 DECL is associated with. This can be either an IDENTIFIER_NODE or a
723 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
724 tree
726 {
731 }
733 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
734 tree
736 {
741 }
743 /* When the target supports named section, return its name as IDENTIFIER_NODE
744 or NULL if it is in no section. */
747 {
752 }
754 /* Set section name of NODE to VALUE (that is expected to be
755 identifier node) */
756 void
758 {
762 {
766 }
769 else
772 }
774 /* Return TLS model of a variable NODE. */
775 enum tls_model
777 {
782 }
784 /* Set TLS model of variable NODE to MODEL. */
785 void
787 {
791 {
795 }
796 else
799 }
801 /* Compute the number of bytes occupied by a tree with code CODE.
802 This function cannot be used for nodes that have variable sizes,
803 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
804 size_t
806 {
808 {
811 {
828 }
832 {
855 }
868 {
880 }
884 {
905 }
909 }
910 }
912 /* Compute the number of bytes occupied by NODE. This routine only
913 looks at TREE_CODE, except for those nodes that have variable sizes. */
914 size_t
916 {
919 {
949 else
951 }
952 }
954 /* Return tree node kind based on tree CODE. */
956 static tree_node_kind
958 {
962 {
980 {
997 }
1003 }
1004 }
1006 /* Record interesting allocation statistics for a tree node with CODE
1007 and LENGTH. */
1009 static void
1011 {
1020 }
1022 /* Allocate and return a new UID from the DECL_UID namespace. */
1024 int
1026 {
1028 }
1030 /* Return a newly allocated node of code CODE. For decl and type
1031 nodes, some other fields are initialized. The rest of the node is
1032 initialized to zero. This function cannot be used for TREE_VEC,
1033 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1034 tree_code_size.
1036 Achoo! I got a code in the node. */
1038 tree
1040 {
1041 tree t;
1051 {
1059 {
1061 {
1064 }
1065 else
1067 }
1071 else
1072 {
1075 }
1088 /* Default to no attributes for type, but let target change that. */
1092 /* We have not yet computed the alias set for this type. */
1102 {
1110 /* All of these have side-effects, no matter what their
1111 operands are. */
1117 }
1122 {
1135 }
1139 /* Other classes need no special treatment. */
1141 }
1144 }
1146 /* Free tree node. */
1148 void
1150 {
1153 {
1163 }
1175 }
1176 \f
1177 /* Return a new node with the same contents as NODE except that its
1178 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1180 tree
1182 {
1183 tree t;
1200 {
1203 else
1204 {
1208 }
1211 {
1214 }
1215 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1217 {
1220 }
1222 {
1225 }
1227 {
1230 }
1231 }
1233 {
1235 /* The following is so that the debug code for
1236 the copy is different from the original type.
1237 The two statements usually duplicate each other
1238 (because they clear fields of the same union),
1239 but the optimizer should catch that. */
1243 /* Do not copy the values cache. */
1245 {
1248 }
1249 }
1251 {
1255 }
1257 {
1261 }
1264 }
1266 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1267 For example, this can copy a list made of TREE_LIST nodes. */
1269 tree
1271 {
1272 tree head;
1281 {
1285 }
1287 }
1289 \f
1290 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1291 INTEGER_CST with value CST and type TYPE. */
1293 static unsigned int
1295 {
1297 /* We need extra HWIs if CST is an unsigned integer with its
1298 upper bit set. */
1302 }
1304 /* Return a new INTEGER_CST with value CST and type TYPE. */
1306 static tree
1308 {
1314 {
1320 }
1323 {
1324 len--;
1328 }
1334 }
1336 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1338 static tree
1340 CXX_MEM_STAT_INFO)
1341 {
1353 }
1355 /* Create a constant tree that contains CST sign-extended to TYPE. */
1357 tree
1359 {
1360 /* Support legacy code. */
1365 }
1367 /* Create a constant tree that contains CST zero-extended to TYPE. */
1369 tree
1371 {
1373 }
1375 /* Create a constant tree that contains CST sign-extended to TYPE. */
1377 tree
1379 {
1382 }
1384 /* Constructs tree in type TYPE from with value given by CST. Signedness
1385 of CST is assumed to be the same as the signedness of TYPE. */
1387 tree
1389 {
1391 }
1393 /* We force the wide_int CST to the range of the type TYPE by sign or
1394 zero extending it. OVERFLOWABLE indicates if we are interested in
1395 overflow of the value, when >0 we are only interested in signed
1396 overflow, for <0 we are interested in any overflow. OVERFLOWED
1397 indicates whether overflow has already occurred. CONST_OVERFLOWED
1398 indicates whether constant overflow has already occurred. We force
1399 T's value to be within range of T's type (by setting to 0 or 1 all
1400 the bits outside the type's range). We set TREE_OVERFLOWED if,
1401 OVERFLOWED is nonzero,
1402 or OVERFLOWABLE is >0 and signed overflow occurs
1403 or OVERFLOWABLE is <0 and any overflow occurs
1404 We return a new tree node for the extended wide_int. The node
1405 is shared if no overflow flags are set. */
1408 tree
1411 {
1414 /* If we need to set overflow flags, return a new unshared node. */
1416 {
1420 {
1422 sign);
1423 tree t;
1426 else
1427 {
1430 {
1433 }
1435 }
1438 }
1439 }
1441 /* Else build a shared node. */
1443 }
1445 /* These are the hash table functions for the hash table of INTEGER_CST
1446 nodes of a sizetype. */
1448 /* Return the hash code X, an INTEGER_CST. */
1450 hashval_t
1452 {
1461 }
1463 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1464 is the same as that given by *Y, which is the same. */
1466 bool
1468 {
1482 }
1484 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1485 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1486 number of slots that can be cached for the type. */
1491 {
1493 /* Initialize cache. */
1495 {
1498 }
1501 {
1502 /* Create a new shared int. */
1505 }
1507 }
1509 /* Create an INT_CST node of TYPE and value CST.
1510 The returned node is always shared. For small integers we use a
1511 per-type vector cache, for larger ones we use a single hash table.
1512 The value is extended from its precision according to the sign of
1513 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1514 the upper bits and ensures that hashing and value equality based
1515 upon the underlying HOST_WIDE_INTs works without masking. */
1517 static tree
1519 {
1520 tree t;
1528 /* Verify that everything is canonical. */
1531 {
1536 }
1543 {
1544 /* Cache NULL pointer and zero bounds. */
1547 /* Cache upper bounds of pointers. */
1550 /* Cache 1 which is used for a non-zero range. */
1555 {
1557 /* Make sure no one is clobbering the shared constant. */
1561 }
1562 }
1564 {
1565 /* We just need to store a single HOST_WIDE_INT. */
1566 HOST_WIDE_INT hwi;
1569 else
1573 {
1576 /* Fallthru. */
1580 /* Ignore pointers, as they were already handled above. */
1584 /* Cache false or true. */
1593 {
1594 /* Cache [0, N). */
1598 }
1599 else
1600 {
1601 /* Cache [-1, N). */
1605 }
1613 }
1616 {
1618 /* Make sure no one is clobbering the shared constant. */
1625 }
1626 else
1627 {
1628 /* Use the cache of larger shared ints, using int_cst_node as
1629 a temporary. */
1637 {
1638 /* Insert this one into the hash table. */
1641 /* Make a new node for next time round. */
1643 }
1644 }
1645 }
1646 else
1647 {
1648 /* The value either hashes properly or we drop it on the floor
1649 for the gc to take care of. There will not be enough of them
1650 to worry about. */
1656 {
1657 /* Insert this one into the hash table. */
1660 }
1661 else
1663 }
1666 }
1668 hashval_t
1670 {
1678 }
1680 bool
1682 {
1689 }
1691 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1692 The elements must also have type TYPE. */
1694 tree
1696 {
1707 INSERT);
1709 {
1714 }
1716 }
1718 /* Create a constant tree with value VALUE in type TYPE. */
1720 tree
1722 {
1726 }
1728 void
1730 {
1739 {
1742 /* Fallthru. */
1746 /* Cache NULL pointer. */
1748 {
1751 }
1755 /* Cache false or true. */
1764 {
1765 /* Cache 0..N */
1768 /* This is a little hokie, but if the prec is smaller than
1769 what is necessary to hold param_integer_share_limit, then the
1770 obvious test will not get the correct answer. */
1772 {
1776 }
1779 }
1780 else
1781 {
1782 /* Cache -1..N */
1788 {
1790 {
1793 }
1796 }
1797 }
1801 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1802 members. */
1807 }
1810 {
1811 /* Look for it in the type's vector of small shared ints. */
1813 {
1816 }
1820 }
1821 else
1822 {
1823 /* Use the cache of larger shared ints. */
1825 /* If there is already an entry for the number verify it's the
1826 same. */
1829 else
1830 /* Otherwise insert this one into the hash table. */
1832 }
1833 }
1836 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1837 and the rest are zeros. */
1839 tree
1841 {
1846 }
1848 /* Checks that X is integer constant that can be expressed in (unsigned)
1849 HOST_WIDE_INT without loss of precision. */
1851 bool
1853 {
1856 }
1858 /* Build a newly constructed VECTOR_CST with the given values of
1859 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1861 tree
1864 {
1866 tree t;
1882 }
1884 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1885 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1887 tree
1889 {
1894 tree value;
1896 /* We can't construct a VECTOR_CST for a variable number of elements. */
1900 {
1902 {
1903 /* If NELTS is constant then this must be too. */
1907 }
1908 else
1910 }
1915 }
1917 /* Build a vector of type VECTYPE where all the elements are SCs. */
1918 tree
1920 {
1926 /* Verify that the vector type is suitable for SC. Note that there
1927 is some inconsistency in the type-system with respect to restrict
1928 qualifications of pointers. Vector types always have a main-variant
1929 element type and the qualification is applied to the vector-type.
1930 So TREE_TYPE (vector-type) does not return a properly qualified
1931 vector element-type. */
1936 {
1940 }
1943 else
1944 {
1950 }
1951 }
1953 /* If TYPE is not a vector type, just return SC, otherwise return
1954 build_vector_from_val (TYPE, SC). */
1956 tree
1958 {
1963 }
1965 /* Build a vector series of type TYPE in which element I has the value
1966 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1967 and a VEC_SERIES_EXPR otherwise. */
1969 tree
1971 {
1975 {
1985 }
1987 }
1989 /* Return a vector with the same number of units and number of bits
1990 as VEC_TYPE, but in which the elements are a linear series of unsigned
1991 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1993 tree
1995 {
2000 {
2001 index_elt_type = build_nonstandard_integer_type
2004 }
2010 }
2012 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2013 elements are A and the rest are B. */
2015 tree
2017 {
2020 /* Optimize the constant case. */
2027 }
2029 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2030 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2032 void
2034 {
2036 tree val;
2042 {
2043 /* Mostly ctors will have elts that don't have side-effects, so
2044 the usual case is to scan all the elements. Hence a single
2045 loop for both const and side effects, rather than one loop
2046 each (with early outs). */
2051 }
2055 }
2057 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2058 CONSTRUCTOR C. */
2060 void
2062 {
2064 tree val;
2070 {
2075 }
2076 }
2078 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2079 are in the vec pointed to by VALS. */
2080 tree
2082 {
2091 }
2093 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2094 INDEX and VALUE. */
2095 tree
2097 {
2105 }
2108 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2109 are in a list pointed to by VALS. */
2110 tree
2112 {
2113 tree t;
2117 {
2121 }
2124 }
2126 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2127 are in a vector pointed to by VALS. Note that the TREE_PURPOSE
2128 fields in the constructor remain null. */
2130 tree
2132 {
2139 }
2141 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2142 of elements, provided as index/value pairs. */
2144 tree
2146 {
2153 {
2157 }
2160 }
2162 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2164 tree
2166 {
2170 }
2172 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2174 tree
2176 {
2177 tree v;
2187 }
2189 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2191 tree
2193 {
2194 tree v;
2198 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2199 Consider doing it via real_convert now. */
2209 }
2211 /* Like build_real, but first truncate D to the type. */
2213 tree
2215 {
2217 }
2219 /* Return a new REAL_CST node whose type is TYPE
2220 and whose value is the integer value of the INTEGER_CST node I. */
2222 REAL_VALUE_TYPE
2224 {
2225 REAL_VALUE_TYPE d;
2227 /* Clear all bits of the real value type so that we can later do
2228 bitwise comparisons to see if two values are the same. */
2234 }
2236 /* Given a tree representing an integer constant I, return a tree
2237 representing the same value as a floating-point constant of type TYPE. */
2239 tree
2241 {
2242 tree v;
2249 }
2251 /* Return a newly constructed STRING_CST node whose value is the LEN
2252 characters at STR when STR is nonnull, or all zeros otherwise.
2253 Note that for a C string literal, LEN should include the trailing NUL.
2254 The TREE_TYPE is not initialized. */
2256 tree
2258 {
2259 /* Do not waste bytes provided by padding of struct tree_string. */
2272 else
2277 }
2279 /* Return a newly constructed COMPLEX_CST node whose value is
2280 specified by the real and imaginary parts REAL and IMAG.
2281 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2282 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2284 tree
2286 {
2297 }
2299 /* Build a complex (inf +- 0i), such as for the result of cproj.
2300 TYPE is the complex tree type of the result. If NEG is true, the
2301 imaginary zero is negative. */
2303 tree
2305 {
2312 }
2314 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2315 element is set to 1. In particular, this is 1 + i for complex types. */
2317 tree
2319 {
2321 {
2324 }
2325 else
2327 }
2329 /* Return a constant of arithmetic type TYPE which is the
2330 multiplicative identity of the set TYPE. */
2332 tree
2334 {
2336 {
2346 /* We can only generate 1 for accum types. */
2351 {
2355 }
2364 }
2365 }
2367 /* Return an integer of type TYPE containing all 1's in as much precision as
2368 it contains, or a complex or vector whose subparts are such integers. */
2370 tree
2372 {
2374 {
2377 }
2378 else
2380 }
2382 /* Return a constant of arithmetic type TYPE which is the
2383 opposite of the multiplicative identity of the set TYPE. */
2385 tree
2387 {
2389 {
2399 /* We can only generate 1 for accum types. */
2406 {
2410 }
2419 }
2420 }
2422 /* Build 0 constant of type TYPE. This is used by constructor folding
2423 and thus the constant should be represented in memory by
2424 zero(es). */
2426 tree
2428 {
2430 {
2443 {
2447 }
2450 {
2454 }
2460 }
2461 }
2464 /* Build a BINFO with LEN language slots. */
2466 tree
2468 {
2469 tree t;
2484 }
2486 /* Create a CASE_LABEL_EXPR tree node and return it. */
2488 tree
2490 {
2502 }
2504 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2505 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2506 The latter determines the length of the HOST_WIDE_INT vector. */
2508 tree
2510 {
2511 tree t;
2523 /* to_offset can only be applied to trees that are offset_int-sized
2524 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2525 must be exactly the precision of offset_int and so LEN is correct. */
2528 else
2534 }
2536 /* Build a newly constructed TREE_VEC node of length LEN. */
2538 tree
2540 {
2541 tree t;
2552 }
2554 /* Grow a TREE_VEC node to new length LEN. */
2556 tree
2558 {
2574 }
2575 \f
2576 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2577 fixed, and scalar, complex or vector. */
2579 bool
2581 {
2585 }
2587 /* Return 1 if EXPR is the integer constant zero or a complex constant
2588 of zero, or a location wrapper for such a constant. */
2590 bool
2592 {
2596 {
2608 }
2609 }
2611 /* Return 1 if EXPR is the integer constant one or the corresponding
2612 complex constant, or a location wrapper for such a constant. */
2614 bool
2616 {
2620 {
2632 }
2633 }
2635 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2636 return 1 if every piece is the integer constant one.
2637 Also return 1 for location wrappers for such a constant. */
2639 bool
2641 {
2647 else
2649 }
2651 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2652 it contains, or a complex or vector whose subparts are such integers,
2653 or a location wrapper for such a constant. */
2655 bool
2657 {
2675 }
2677 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2678 for such a constant. */
2680 bool
2682 {
2688 else
2690 }
2692 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2693 one bit on), or a location wrapper for such a constant. */
2695 bool
2697 {
2709 }
2711 /* Return 1 if EXPR is an integer constant other than zero or a
2712 complex constant other than zero, or a location wrapper for such a
2713 constant. */
2715 bool
2717 {
2725 }
2727 /* Return 1 if EXPR is the integer constant one. For vector,
2728 return 1 if every piece is the integer constant minus one
2729 (representing the value TRUE).
2730 Also return 1 for location wrappers for such a constant. */
2732 bool
2734 {
2740 }
2742 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2743 for such a constant. */
2745 bool
2747 {
2752 }
2754 /* Return the power of two represented by a tree node known to be a
2755 power of two. */
2757 int
2759 {
2764 }
2766 /* Similar, but return the largest integer Y such that 2 ** Y is less
2767 than or equal to EXPR. */
2769 int
2771 {
2776 }
2778 /* Return number of known trailing zero bits in EXPR, or, if the value of
2779 EXPR is known to be zero, the precision of it's type. */
2781 unsigned int
2783 {
2790 {
2811 /* Second operand is sizetype, which could be in theory
2812 wider than pointer's precision. Make sure we never
2813 return more than prec. */
2828 {
2831 }
2836 {
2841 }
2850 {
2853 {
2858 }
2859 }
2861 CASE_CONVERT:
2879 {
2882 }
2886 }
2887 }
2889 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2890 decimal float constants, so don't return 1 for them.
2891 Also return 1 for location wrappers around such a constant. */
2893 bool
2895 {
2899 {
2907 {
2908 /* Don't simply check for a duplicate because the predicate
2909 accepts both +0.0 and -0.0. */
2915 }
2918 }
2919 }
2921 /* Return 1 if EXPR is the real constant one in real or complex form.
2922 Trailing zeroes matter for decimal float constants, so don't return
2923 1 for them.
2924 Also return 1 for location wrappers around such a constant. */
2926 bool
2928 {
2932 {
2945 }
2946 }
2948 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2949 matter for decimal float constants, so don't return 1 for them.
2950 Also return 1 for location wrappers around such a constant. */
2952 bool
2954 {
2958 {
2971 }
2972 }
2974 /* Nonzero if EXP is a constant or a cast of a constant. */
2976 bool
2978 {
2979 /* This is not quite the same as STRIP_NOPS. It does more. */
2984 }
2986 /* Return true if T holds a polynomial pointer difference, storing it in
2987 *VALUE if so. A true return means that T's precision is no greater
2988 than 64 bits, which is the largest address space we support, so *VALUE
2989 never loses precision. However, the signedness of the result does
2990 not necessarily match the signedness of T: sometimes an unsigned type
2991 like sizetype is used to encode a value that is actually negative. */
2993 bool
2995 {
2999 {
3004 }
3006 {
3013 }
3015 }
3017 poly_int64
3019 {
3024 }
3026 poly_uint64
3028 {
3033 }
3034 \f
3035 /* Return first list element whose TREE_VALUE is ELEM.
3036 Return 0 if ELEM is not in LIST. */
3038 tree
3040 {
3042 {
3046 }
3048 }
3050 /* Return first list element whose TREE_PURPOSE is ELEM.
3051 Return 0 if ELEM is not in LIST. */
3053 tree
3055 {
3057 {
3061 }
3063 }
3065 /* Return true if ELEM is in V. */
3067 bool
3069 {
3071 tree t;
3076 }
3078 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3079 NULL_TREE. */
3081 tree
3083 {
3087 }
3089 /* Return nonzero if ELEM is part of the chain CHAIN. */
3091 bool
3093 {
3095 {
3099 }
3102 }
3104 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3105 We expect a null pointer to mark the end of the chain.
3106 This is the Lisp primitive `length'. */
3108 int
3110 {
3112 #ifdef ENABLE_TREE_CHECKING
3114 #endif
3118 {
3120 #ifdef ENABLE_TREE_CHECKING
3124 #endif
3125 len++;
3126 }
3129 }
3131 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3132 UNION_TYPE TYPE, or NULL_TREE if none. */
3134 tree
3136 {
3141 }
3143 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3144 UNION_TYPE TYPE, or NULL_TREE if none. */
3146 tree
3148 {
3152 {
3157 }
3160 }
3162 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3163 by modifying the last node in chain 1 to point to chain 2.
3164 This is the Lisp primitive `nconc'. */
3166 tree
3168 {
3169 tree t1;
3180 #ifdef ENABLE_TREE_CHECKING
3181 {
3182 tree t2;
3185 }
3186 #endif
3189 }
3191 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3193 tree
3195 {
3196 tree next;
3201 }
3203 /* Reverse the order of elements in the chain T,
3204 and return the new head of the chain (old last element). */
3206 tree
3208 {
3211 {
3212 /* We shouldn't be using this function to reverse BLOCK chains; we
3213 have blocks_nreverse for that. */
3218 }
3220 }
3221 \f
3222 /* Return a newly created TREE_LIST node whose
3223 purpose and value fields are PARM and VALUE. */
3225 tree
3227 {
3232 }
3234 /* Build a chain of TREE_LIST nodes from a vector. */
3236 tree
3238 {
3242 tree t;
3244 {
3247 }
3249 }
3251 /* Return a newly created TREE_LIST node whose
3252 purpose and value fields are PURPOSE and VALUE
3253 and whose TREE_CHAIN is CHAIN. */
3255 tree
3257 {
3258 tree node;
3270 }
3272 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3273 trees. */
3277 {
3281 tree val;
3287 }
3288 \f
3289 /* Return the size nominally occupied by an object of type TYPE
3290 when it resides in memory. The value is measured in units of bytes,
3291 and its data type is that normally used for type sizes
3292 (which is the first type created by make_signed_type or
3293 make_unsigned_type). */
3295 tree
3297 {
3298 tree t;
3307 {
3310 }
3313 }
3315 /* Return the size of TYPE (in bytes) as a wide integer
3316 or return -1 if the size can vary or is larger than an integer. */
3318 HOST_WIDE_INT
3320 {
3321 tree t;
3331 else
3333 }
3335 /* Return the maximum size of TYPE (in bytes) as a wide integer
3336 or return -1 if the size can vary or is larger than an integer. */
3338 HOST_WIDE_INT
3340 {
3342 tree size_tree;
3344 /* If this is an array type, check for a possible MAX_SIZE attached. */
3347 {
3352 }
3354 /* If we still haven't been able to get a size, see if the language
3355 can compute a maximum size. */
3358 {
3363 }
3366 }
3367 \f
3368 /* Return the bit position of FIELD, in bits from the start of the record.
3369 This is a tree of type bitsizetype. */
3371 tree
3373 {
3376 }
3377 \f
3378 /* Return the byte position of FIELD, in bytes from the start of the record.
3379 This is a tree of type sizetype. */
3381 tree
3383 {
3386 }
3388 /* Likewise, but return as an integer. It must be representable in
3389 that way (since it could be a signed value, we don't have the
3390 option of returning -1 like int_size_in_byte can. */
3392 HOST_WIDE_INT
3394 {
3396 }
3397 \f
3398 /* Return, as a tree node, the number of elements for TYPE (which is an
3399 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3401 tree
3403 {
3406 /* If they did it with unspecified bounds, then we should have already
3407 given an error about it before we got here. */
3415 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3420 ? max
3422 }
3423 \f
3424 /* If arg is static -- a reference to an object in static storage -- then
3425 return the object. This is not the same as the C meaning of `static'.
3426 If arg isn't static, return NULL. */
3428 tree
3430 {
3432 {
3434 /* Nested functions are static, even though taking their address will
3435 involve a trampoline as we unnest the nested function and create
3436 the trampoline on the tree level. */
3457 /* If the thing being referenced is not a field, then it is
3458 something language specific. */
3461 /* If we are referencing a bitfield, we can't evaluate an
3462 ADDR_EXPR at compile time and so it isn't a constant. */
3479 else
3487 }
3488 }
3490 \f
3493 /* Return whether OP is a DECL whose address is function-invariant. */
3495 bool
3497 {
3498 /* The conditions below are slightly less strict than the one in
3499 staticp. */
3502 {
3525 }
3528 }
3530 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3532 bool
3534 {
3535 /* The conditions below are slightly less strict than the one in
3536 staticp. */
3539 {
3559 }
3562 }
3565 /* Return true if T is function-invariant (internal function, does
3566 not handle arithmetic; that's handled in skip_simple_arithmetic and
3567 tree_invariant_p). */
3569 static bool
3571 {
3572 tree op;
3579 {
3586 {
3588 {
3603 }
3605 }
3611 }
3614 }
3616 /* Return true if T is function-invariant. */
3618 bool
3620 {
3623 }
3625 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3626 Do this to any expression which may be used in more than one place,
3627 but must be evaluated only once.
3629 Normally, expand_expr would reevaluate the expression each time.
3630 Calling save_expr produces something that is evaluated and recorded
3631 the first time expand_expr is called on it. Subsequent calls to
3632 expand_expr just reuse the recorded value.
3634 The call to expand_expr that generates code that actually computes
3635 the value is the first call *at compile time*. Subsequent calls
3636 *at compile time* generate code to use the saved value.
3637 This produces correct result provided that *at run time* control
3638 always flows through the insns made by the first expand_expr
3639 before reaching the other places where the save_expr was evaluated.
3640 You, the caller of save_expr, must make sure this is so.
3642 Constants, and certain read-only nodes, are returned with no
3643 SAVE_EXPR because that is safe. Expressions containing placeholders
3644 are not touched; see tree.def for an explanation of what these
3645 are used for. */
3647 tree
3649 {
3650 tree inner;
3652 /* If the tree evaluates to a constant, then we don't want to hide that
3653 fact (i.e. this allows further folding, and direct checks for constants).
3654 However, a read-only object that has side effects cannot be bypassed.
3655 Since it is no problem to reevaluate literals, we just return the
3656 literal node. */
3664 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3665 it means that the size or offset of some field of an object depends on
3666 the value within another field.
3668 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3669 and some variable since it would then need to be both evaluated once and
3670 evaluated more than once. Front-ends must assure this case cannot
3671 happen by surrounding any such subexpressions in their own SAVE_EXPR
3672 and forcing evaluation at the proper time. */
3678 /* This expression might be placed ahead of a jump to ensure that the
3679 value was computed on both sides of the jump. So make sure it isn't
3680 eliminated as dead. */
3683 }
3685 /* Look inside EXPR into any simple arithmetic operations. Return the
3686 outermost non-arithmetic or non-invariant node. */
3688 tree
3690 {
3691 /* We don't care about whether this can be used as an lvalue in this
3692 context. */
3696 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3697 a constant, it will be more efficient to not make another SAVE_EXPR since
3698 it will allow better simplification and GCSE will be able to merge the
3699 computations if they actually occur. */
3701 {
3705 {
3710 else
3712 }
3713 else
3715 }
3718 }
3720 /* Look inside EXPR into simple arithmetic operations involving constants.
3721 Return the outermost non-arithmetic or non-constant node. */
3723 tree
3725 {
3730 {
3734 {
3739 else
3741 }
3742 else
3744 }
3747 }
3749 /* Return which tree structure is used by T. */
3751 enum tree_node_structure_enum
3753 {
3756 }
3758 /* Set various status flags when building a CALL_EXPR object T. */
3760 static void
3762 {
3767 /* Calls have side-effects, except those to const or pure functions. */
3770 /* Propagate TREE_READONLY of arguments for const functions. */
3776 {
3782 }
3786 }
3787 \f
3788 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3789 size or offset that depends on a field within a record. */
3791 bool
3793 {
3804 {
3806 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3807 position computations since they will be converted into a
3808 WITH_RECORD_EXPR involving the reference, which will assume
3809 here will be valid. */
3823 {
3825 /* Ignoring the first operand isn't quite right, but works best. */
3834 /* The save_expr function never wraps anything containing
3835 a PLACEHOLDER_EXPR. */
3840 }
3843 {
3851 }
3855 {
3857 {
3858 const_tree arg;
3859 const_call_expr_arg_iterator iter;
3864 }
3867 }
3871 }
3873 }
3875 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3876 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3877 field positions. */
3879 static bool
3881 {
3882 /* If the size contains a placeholder or the parent type (component type in
3883 the case of arrays) type involves a placeholder, this type does. */
3891 /* Now do type-specific checks. Note that the last part of the check above
3892 greatly limits what we have to do below. */
3894 {
3911 /* Here we just check the bounds. */
3916 /* We have already checked the component type above, so just check
3917 the domain type. Flexible array members have a null domain. */
3924 {
3925 tree field;
3936 }
3940 }
3941 }
3943 /* Wrapper around above function used to cache its result. */
3945 bool
3947 {
3950 /* If the contains_placeholder_bits field has been initialized,
3951 then we know the answer. */
3955 /* Indicate that we've seen this type node, and the answer is false.
3956 This is what we want to return if we run into recursion via fields. */
3959 /* Compute the real value. */
3962 /* Store the real value. */
3966 }
3967 \f
3968 /* Push tree EXP onto vector QUEUE if it is not already present. */
3970 static void
3972 {
3974 tree iter;
3982 }
3984 /* Given a tree EXP, find all occurrences of references to fields
3985 in a PLACEHOLDER_EXPR and place them in vector REFS without
3986 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3987 we assume here that EXP contains only arithmetic expressions
3988 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3989 argument list. */
3991 void
3993 {
3995 tree inner;
3998 /* We handle TREE_LIST and COMPONENT_REF separately. */
4000 {
4003 }
4005 {
4009 ;
4013 else
4015 }
4016 else
4018 {
4023 /* Variables allocated to static storage can stay. */
4029 /* This is the pattern built in ada/make_aligning_type. */
4032 {
4035 }
4037 /* Fall through. */
4055 }
4056 }
4058 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4059 return a tree with all occurrences of references to F in a
4060 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4061 CONST_DECLs. Note that we assume here that EXP contains only
4062 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4063 occurring only in their argument list. */
4065 tree
4067 {
4070 tree new_tree;
4072 /* We handle TREE_LIST and COMPONENT_REF separately. */
4074 {
4081 }
4083 {
4084 tree inner;
4086 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4087 and it is the right field, replace it with R. */
4091 ;
4093 /* The field. */
4099 /* If this expression hasn't been completed let, leave it alone. */
4107 new_tree
4109 }
4110 else
4112 {
4119 else
4126 /* Fall through. */
4134 {
4179 new_tree
4185 }
4189 {
4194 /* If we are trying to replace F with a constant or with another
4195 instance of one of the arguments of the call, inline back
4196 functions which do nothing else than computing a value from
4197 the arguments they are passed. This makes it possible to
4198 fold partially or entirely the replacement expression. */
4200 {
4204 else
4207 {
4210 }
4212 {
4216 }
4217 }
4220 {
4224 {
4228 }
4229 }
4232 {
4236 }
4237 else
4239 }
4244 }
4252 }
4254 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4255 for it within OBJ, a tree that is an object or a chain of references. */
4257 tree
4259 {
4262 tree new_tree;
4264 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4265 in the chain of OBJ. */
4267 {
4269 tree elt;
4299 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4300 survives until RTL generation, there will be an error. */
4302 }
4304 /* TREE_LIST is special because we need to look at TREE_VALUE
4305 and TREE_CHAIN, not TREE_OPERANDS. */
4307 {
4314 }
4315 else
4317 {
4330 {
4375 new_tree
4381 }
4385 {
4391 {
4395 {
4399 }
4400 }
4403 {
4407 }
4408 else
4410 }
4415 }
4423 }
4424 \f
4426 /* Subroutine of stabilize_reference; this is called for subtrees of
4427 references. Any expression with side-effects must be put in a SAVE_EXPR
4428 to ensure that it is only evaluated once.
4430 We don't put SAVE_EXPR nodes around everything, because assigning very
4431 simple expressions to temporaries causes us to miss good opportunities
4432 for optimizations. Among other things, the opportunity to fold in the
4433 addition of a constant into an addressing mode often gets lost, e.g.
4434 "y[i+1] += x;". In general, we take the approach that we should not make
4435 an assignment unless we are forced into it - i.e., that any non-side effect
4436 operator should be allowed, and that cse should take care of coalescing
4437 multiple utterances of the same expression should that prove fruitful. */
4439 static tree
4441 {
4442 tree result;
4445 /* We cannot ignore const expressions because it might be a reference
4446 to a const array but whose index contains side-effects. But we can
4447 ignore things that are actual constant or that already have been
4448 handled by this function. */
4454 {
4456 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4457 have side-effects. */
4460 /* FALLTHRU */
4468 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4469 so that it will only be evaluated once. */
4470 /* The reference (r) and comparison (<) classes could be handled as
4471 below, but it is generally faster to only evaluate them once. */
4477 /* Constants need no processing. In fact, we should never reach
4478 here. */
4482 /* Division is slow and tends to be compiled with jumps,
4483 especially the division by powers of 2 that is often
4484 found inside of an array reference. So do it just once. */
4490 /* Recursively stabilize each operand. */
4496 /* Recursively stabilize each operand. */
4502 }
4510 }
4512 /* Stabilize a reference so that we can use it any number of times
4513 without causing its operands to be evaluated more than once.
4514 Returns the stabilized reference. This works by means of save_expr,
4515 so see the caveats in the comments about save_expr.
4517 Also allows conversion expressions whose operands are references.
4518 Any other kind of expression is returned unchanged. */
4520 tree
4522 {
4523 tree result;
4527 {
4531 /* No action is needed in this case. */
4534 CASE_CONVERT:
4573 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4574 it wouldn't be ignored. This matters when dealing with
4575 volatiles. */
4578 /* If arg isn't a kind of lvalue we recognize, make no change.
4579 Caller should recognize the error for an invalid lvalue. */
4585 }
4593 }
4594 \f
4595 /* Low-level constructors for expressions. */
4597 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4598 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4600 void
4602 {
4603 tree node;
4608 /* We started out assuming this address is both invariant and constant, but
4609 does not have side effects. Now go down any handled components and see if
4610 any of them involve offsets that are either non-constant or non-invariant.
4611 Also check for side-effects.
4613 ??? Note that this code makes no attempt to deal with the case where
4614 taking the address of something causes a copy due to misalignment. */
4616 #define UPDATE_FLAGS(NODE) \
4617 do { tree _node = (NODE); \
4618 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4619 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4623 {
4624 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4625 array reference (probably made temporarily by the G++ front end),
4626 so ignore all the operands. */
4630 {
4636 }
4637 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4638 FIELD_DECL, apparently. The G++ front end can put something else
4639 there, at least temporarily. */
4642 {
4645 }
4646 }
4650 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4651 the address, since &(*a)->b is a form of addition. If it's a constant, the
4652 address is constant too. If it's a decl, its address is constant if the
4653 decl is static. Everything else is not constant and, furthermore,
4654 taking the address of a volatile variable is not volatile. */
4659 ;
4662 else
4663 {
4666 }
4671 #undef UPDATE_FLAGS
4672 }
4674 /* Build an expression of code CODE, data type TYPE, and operands as
4675 specified. Expressions and reference nodes can be created this way.
4676 Constants, decls, types and misc nodes cannot be.
4678 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4679 enough for all extant tree codes. */
4681 tree
4683 {
4684 tree t;
4692 }
4694 tree
4696 {
4698 tree t;
4714 {
4717 }
4720 {
4723 }
4725 {
4727 /* All of these have side-effects, no matter what their
4728 operands are. */
4734 /* Whether a dereference is readonly has nothing to do with whether
4735 its operand is readonly. */
4753 }
4756 }
4758 #define PROCESS_ARG(N) \
4759 do { \
4760 TREE_OPERAND (t, N) = arg##N; \
4761 if (arg##N &&!TYPE_P (arg##N)) \
4762 { \
4763 if (TREE_SIDE_EFFECTS (arg##N)) \
4764 side_effects = 1; \
4765 if (!TREE_READONLY (arg##N) \
4766 && !CONSTANT_CLASS_P (arg##N)) \
4767 (void) (read_only = 0); \
4768 if (!TREE_CONSTANT (arg##N)) \
4769 (void) (constant = 0); \
4770 } \
4771 } while (0)
4773 tree
4775 {
4777 tree t;
4783 /* When sizetype precision doesn't match that of pointers
4784 we need to be able to build explicit extensions or truncations
4785 of the offset argument. */
4797 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4798 result based on those same flags for the arguments. But if the
4799 arguments aren't really even `tree' expressions, we shouldn't be trying
4800 to do this. */
4802 /* Expressions without side effects may be constant if their
4803 arguments are as well. */
4810 {
4824 }
4831 {
4833 {
4837 }
4838 }
4839 else
4840 {
4842 /* Don't mark X / 0 as constant. */
4847 }
4850 }
4853 tree
4855 tree arg2 MEM_STAT_DECL)
4856 {
4858 tree t;
4868 /* As a special exception, if COND_EXPR has NULL branches, we
4869 assume that it is a gimple statement and always consider
4870 it to have side effects. */
4876 else
4892 }
4894 tree
4897 {
4899 tree t;
4919 }
4921 tree
4924 {
4926 tree t;
4943 {
4945 {
4949 }
4950 }
4951 else
4957 }
4959 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4960 on the pointer PTR. */
4962 tree
4964 {
4967 tree tem;
4968 /* For convenience allow addresses that collapse to a simple base
4969 and offset. */
4973 {
4977 {
4980 }
4981 else
4984 }
4989 }
4991 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4993 poly_offset_int
4995 {
4997 SIGNED);
4998 }
5000 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5001 offsetted by OFFSET units. */
5003 tree
5005 {
5012 }
5014 /* Similar except don't specify the TREE_TYPE
5015 and leave the TREE_SIDE_EFFECTS as 0.
5016 It is permissible for arguments to be null,
5017 or even garbage if their values do not matter. */
5019 tree
5021 {
5022 tree t;
5039 }
5041 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5042 tree vec. */
5044 tree
5046 {
5056 }
5057 \f
5058 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5059 and data type TYPE.
5060 We do NOT enter this node in any sort of symbol table.
5062 LOC is the location of the decl.
5064 layout_decl is used to set up the decl's storage layout.
5065 Other slots are initialized to 0 or null pointers. */
5067 tree
5069 tree type MEM_STAT_DECL)
5070 {
5071 tree t;
5076 /* if (type == error_mark_node)
5077 type = integer_type_node; */
5078 /* That is not done, deliberately, so that having error_mark_node
5079 as the type can suppress useless errors in the use of this variable. */
5088 }
5090 /* Builds and returns function declaration with NAME and TYPE. */
5092 tree
5094 {
5104 }
5108 /* Builds a new translation-unit decl with name NAME, queues it in the
5109 global list of translation-unit decls and returns it. */
5111 tree
5113 {
5119 }
5121 \f
5122 /* BLOCK nodes are used to represent the structure of binding contours
5123 and declarations, once those contours have been exited and their contents
5124 compiled. This information is used for outputting debugging info. */
5126 tree
5128 {
5136 }
5138 \f
5139 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5141 LOC is the location to use in tree T. */
5143 void
5145 {
5149 {
5153 }
5154 }
5156 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5157 UNKNOWN_LOCATION. */
5159 void
5161 {
5165 }
5167 /* Data used when collecting DECLs and TYPEs for language data removal. */
5169 class free_lang_data_d
5170 {
5174 /* Worklist to avoid excessive recursion. */
5177 /* Set of traversed objects. Used to avoid duplicate visits. */
5180 /* Array of symbols to process with free_lang_data_in_decl. */
5183 /* Array of types to process with free_lang_data_in_type. */
5185 };
5188 /* Add type or decl T to one of the list of tree nodes that need their
5189 language data removed. The lists are held inside FLD. */
5191 static void
5193 {
5198 else
5200 }
5202 /* Push tree node T into FLD->WORKLIST. */
5206 {
5209 }
5212 \f
5213 /* Return simplified TYPE_NAME of TYPE. */
5215 static tree
5217 {
5220 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5221 TYPE_DECL if the type doesn't have linkage.
5222 this must match fld_ */
5230 }
5232 /* Do same comparsion as check_qualified_type skipping lang part of type
5233 and be more permissive about type names: we only care that names are
5234 same (for diagnostics) and that ODR names are the same.
5235 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5237 static bool
5239 {
5241 /* We want to match incomplete variants with complete types.
5242 In this case we need to ignore alignment. */
5253 }
5255 /* Find variant of FIRST that match T and create new one if necessary.
5256 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5258 static tree
5261 {
5276 /* Variants of incomplete types should have alignment
5277 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5279 {
5282 }
5289 }
5291 /* Map complete types to incomplete types. */
5295 /* Map types to simplified types. */
5299 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5300 use MAP to prevent duplicates. */
5302 static tree
5305 {
5310 {
5311 return fld_type_variant
5315 }
5318 tree &array
5321 {
5322 array
5328 }
5330 }
5332 /* Return CTX after removal of contexts that are not relevant */
5334 static tree
5336 {
5337 /* Variably modified types are needed for tree_is_indexable to decide
5338 whether the type needs to go to local or global section.
5339 This code is semi-broken but for now it is easiest to keep contexts
5340 as expected. */
5343 {
5346 }
5348 }
5350 /* For T being aggregate type try to turn it into a incomplete variant.
5351 Return T if no simplification is possible. */
5353 static tree
5355 {
5359 {
5362 {
5363 tree first;
5367 else
5375 }
5377 }
5386 {
5388 tree ©
5392 {
5395 /* It is possible that type was not seen by free_lang_data yet. */
5404 {
5412 }
5413 else
5414 {
5418 }
5420 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5421 This is needed for ODR violation warnings to come out right (we
5422 want duplicate TYPE_DECLs whenever the type is duplicated because
5423 of ODR violation. Because lang data in the TYPE_DECL may not
5424 have been freed yet, rebuild it from scratch and copy relevant
5425 fields. */
5430 {
5440 }
5441 }
5443 }
5446 }
5448 /* Simplify type T for scenarios where we do not need complete pointer
5449 types. */
5451 static tree
5453 {
5458 /* FIXME: This triggers verification error, see PR88140. */
5463 }
5465 /* Reset the expression *EXPR_P, a size or position.
5467 ??? We could reset all non-constant sizes or positions. But it's cheap
5468 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5470 We need to reset self-referential sizes or positions because they cannot
5471 be gimplified and thus can contain a CALL_EXPR after the gimplification
5472 is finished, which will run afoul of LTO streaming. And they need to be
5473 reset to something essentially dummy but not constant, so as to preserve
5474 the properties of the object they are attached to. */
5478 {
5482 }
5485 /* Reset all the fields in a binfo node BINFO. We only keep
5486 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5488 static void
5490 {
5492 tree t;
5505 }
5508 /* Reset all language specific information still present in TYPE. */
5510 static void
5512 {
5515 /* Give the FE a chance to remove its own data first. */
5528 /* Purge non-marked variants from the variants chain, so that they
5529 don't reappear in the IL after free_lang_data. */
5532 {
5535 /* Turn the removed types into distinct types. */
5538 }
5541 {
5543 /* Remove the const and volatile qualifiers from arguments. The
5544 C++ front end removes them, but the C front end does not,
5545 leading to false ODR violation errors when merging two
5546 instances of the same function signature compiled by
5547 different front ends. */
5549 {
5554 {
5556 & ~TYPE_QUAL_CONST
5561 }
5562 /* C++ FE uses TREE_PURPOSE to store initial values. */
5564 }
5565 }
5567 {
5570 {
5571 /* C++ FE uses TREE_PURPOSE to store initial values. */
5574 }
5575 }
5577 {
5578 /* Remove members that are not FIELD_DECLs from the field list
5579 of an aggregate. These occur in C++. */
5583 else
5589 {
5591 /* We need to preserve link to bases and virtual table for all
5592 polymorphic types to make devirtualization machinery working. */
5595 }
5596 }
5600 {
5602 {
5605 /* Type values are used only for C++ ODR checking. Drop them
5606 for all type variants and non-ODR types.
5607 For ODR types the data is freed in free_odr_warning_data. */
5609 ;
5614 else
5616 }
5619 }
5628 {
5630 do
5631 {
5633 }
5636 }
5640 }
5643 /* Return true if DECL may need an assembler name to be set. */
5647 {
5648 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5649 Rule merging. This makes type_odr_p to return true on those types during
5650 LTO and by comparing the mangled name, we can say what types are intended
5651 to be equivalent across compilation unit.
5653 We do not store names of type_in_anonymous_namespace_p.
5655 Record, union and enumeration type have linkage that allows use
5656 to check type_in_anonymous_namespace_p. We do not mangle compound types
5657 that always can be compared structurally.
5659 Similarly for builtin types, we compare properties of their main variant.
5660 A special case are integer types where mangling do make differences
5661 between char/signed char/unsigned char etc. Storing name for these makes
5662 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5663 See cp/mangle.c:write_builtin_type for details. */
5666 {
5679 }
5680 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5684 /* If DECL already has its assembler name set, it does not need a
5685 new one. */
5690 /* Abstract decls do not need an assembler name. */
5694 /* For VAR_DECLs, only static, public and external symbols need an
5695 assembler name. */
5703 {
5704 /* Do not set assembler name on builtins. Allow RTL expansion to
5705 decide whether to expand inline or via a regular call. */
5710 /* Functions represented in the callgraph need an assembler name. */
5714 /* Unused and not public functions don't need an assembler name. */
5717 }
5720 }
5723 /* Reset all language specific information still present in symbol
5724 DECL. */
5726 static void
5728 {
5731 /* Give the FE a chance to remove its own data first. */
5745 {
5750 }
5753 {
5755 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5756 the address may be taken in other unit, so this flag has no practical
5757 use for middle-end.
5759 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5760 for public objects that indeed cannot be adressed, but it is not
5761 the case. Set the flag to true so we do not get merge failures for
5762 i.e. virtual tables between units that take address of it and
5763 units that don't. */
5769 {
5772 else
5773 {
5778 }
5779 }
5781 {
5782 tree t;
5784 /* If DECL has a gimple body, then the context for its
5785 arguments must be DECL. Otherwise, it doesn't really
5786 matter, as we will not be emitting any code for DECL. In
5787 general, there may be other instances of DECL created by
5788 the front end and since PARM_DECLs are generally shared,
5789 their DECL_CONTEXT changes as the replicas of DECL are
5790 created. The only time where DECL_CONTEXT is important
5791 is for the FUNCTION_DECLs that have a gimple body (since
5792 the PARM_DECL will be used in the function's body). */
5801 }
5803 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5804 At this point, it is not needed anymore. */
5807 /* Clear the abstract origin if it refers to a method.
5808 Otherwise dwarf2out.c will ICE as we splice functions out of
5809 TYPE_FIELDS and thus the origin will not be output
5810 correctly. */
5813 && RECORD_OR_UNION_TYPE_P
5818 }
5820 {
5821 /* See comment above why we set the flag for functions. */
5828 }
5830 {
5841 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5842 }
5844 {
5847 }
5851 {
5852 /* Strip builtins from the translation-unit BLOCK. We still have targets
5853 without builtin_decl_explicit support and also builtins are shared
5854 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5857 {
5862 else
5864 }
5865 }
5866 /* We need to keep field decls associated with their trees. Otherwise tree
5867 merging may merge some fileds and keep others disjoint wich in turn will
5868 not do well with TREE_CHAIN pointers linking them.
5870 Also do not drop containing types for virtual methods and tables because
5871 these are needed by devirtualization.
5872 C++ destructors are special because C++ frontends sometimes produces
5873 virtual destructor as an alias of non-virtual destructor. In
5874 devirutalization code we always walk through aliases and we need
5875 context to be preserved too. See PR89335 */
5882 }
5885 /* Operand callback helper for free_lang_data_in_node. *TP is the
5886 subtree operand being considered. */
5888 static tree
5890 {
5897 /* Language specific nodes will be removed, so there is no need
5898 to gather anything under them. */
5900 {
5903 }
5906 {
5907 /* Note that walk_tree does not traverse every possible field in
5908 decls, so we have to do our own traversals here. */
5916 /* We are going to remove everything under DECL_INITIAL for
5917 TYPE_DECLs. No point walking them. */
5925 {
5928 }
5930 {
5935 }
5945 }
5947 {
5948 /* Note that walk_tree does not traverse every possible field in
5949 types, so we have to do our own traversals here. */
5960 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5961 lists, we may look types up in these lists and use them while
5962 optimizing the function body. Thus we need to free lang data
5963 in them. */
5970 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5974 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5975 do not and want not to reach unused variants this way. */
5977 {
5979 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5980 So push that instead. */
5984 }
5988 {
5990 tree tem;
5995 }
5997 {
5998 tree tem;
5999 /* Push all TYPE_FIELDS - there can be interleaving interesting
6000 and non-interesting things. */
6003 {
6007 }
6008 }
6014 }
6016 {
6018 {
6022 {
6026 }
6027 else
6028 {
6031 }
6032 }
6036 }
6043 }
6046 /* Find decls and types in T. */
6048 static void
6050 {
6052 {
6058 }
6059 }
6061 /* Translate all the types in LIST with the corresponding runtime
6062 types. */
6064 static tree
6066 {
6076 {
6081 }
6084 }
6087 /* Find decls and types referenced in EH region R and store them in
6088 FLD->DECLS and FLD->TYPES. */
6090 static void
6092 {
6094 {
6099 {
6100 eh_catch c;
6102 /* The types referenced in each catch must first be changed to the
6103 EH types used at runtime. This removes references to FE types
6104 in the region. */
6106 {
6109 }
6110 }
6123 }
6124 }
6127 /* Find decls and types referenced in cgraph node N and store them in
6128 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6129 look for *every* kind of DECL and TYPE node reachable from N,
6130 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6131 NAMESPACE_DECLs, etc). */
6133 static void
6135 {
6136 basic_block bb;
6139 tree t;
6150 /* Traverse locals. */
6154 /* Traverse EH regions in FN. */
6155 {
6156 eh_region r;
6159 }
6161 /* Traverse every statement in FN. */
6163 {
6164 gphi_iterator psi;
6165 gimple_stmt_iterator si;
6169 {
6173 {
6176 }
6177 }
6180 {
6187 {
6190 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6191 which we need for asm stmts. */
6197 }
6198 }
6199 }
6200 }
6203 /* Find decls and types referenced in varpool node N and store them in
6204 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6205 look for *every* kind of DECL and TYPE node reachable from N,
6206 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6207 NAMESPACE_DECLs, etc). */
6209 static void
6211 {
6213 }
6215 /* If T needs an assembler name, have one created for it. */
6217 void
6219 {
6221 {
6222 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6223 diagnostics that use input_location to show locus
6224 information. The problem here is that, at this point,
6225 input_location is generally anchored to the end of the file
6226 (since the parser is long gone), so we don't have a good
6227 position to pin it to.
6229 To alleviate this problem, this uses the location of T's
6230 declaration. Examples of this are
6231 testsuite/g++.dg/template/cond2.C and
6232 testsuite/g++.dg/template/pr35240.C. */
6239 }
6240 }
6243 /* Free language specific information for every operand and expression
6244 in every node of the call graph. This process operates in three stages:
6246 1- Every callgraph node and varpool node is traversed looking for
6247 decls and types embedded in them. This is a more exhaustive
6248 search than that done by find_referenced_vars, because it will
6249 also collect individual fields, decls embedded in types, etc.
6251 2- All the decls found are sent to free_lang_data_in_decl.
6253 3- All the types found are sent to free_lang_data_in_type.
6255 The ordering between decls and types is important because
6256 free_lang_data_in_decl sets assembler names, which includes
6257 mangling. So types cannot be freed up until assembler names have
6258 been set up. */
6260 static void
6262 {
6265 tree t;
6269 /* Find decls and types in the body of every function in the callgraph. */
6276 /* Find decls and types in every varpool symbol. */
6280 /* Set the assembler name on every decl found. We need to do this
6281 now because free_lang_data_in_decl will invalidate data needed
6282 for mangling. This breaks mangling on interdependent decls. */
6286 /* Traverse every decl found freeing its language data. */
6290 /* Traverse every type found freeing its language data. */
6293 }
6296 /* Free resources that are used by FE but are not needed once they are done. */
6298 static unsigned
6300 {
6304 /* If we are the LTO frontend we have freed lang-specific data already. */
6307 {
6308 /* Rebuild type inheritance graph even when not doing LTO to get
6309 consistent profile data. */
6312 }
6317 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6321 /* Allocate and assign alias sets to the standard integer types
6322 while the slots are still in the way the frontends generated them. */
6327 /* Traverse the IL resetting language specific information for
6328 operands, expressions, etc. */
6331 /* Create gimple variants for common types. */
6337 /* Reset some langhooks. Do not reset types_compatible_p, it may
6338 still be used indirectly via the get_alias_set langhook. */
6351 {
6353 tree t;
6357 }
6359 /* We do not want the default decl_assembler_name implementation,
6360 rather if we have fixed everything we want a wrapper around it
6361 asserting that all non-local symbols already got their assembler
6362 name and only produce assembler names for local symbols. Or rather
6363 make sure we never call decl_assembler_name on local symbols and
6364 devise a separate, middle-end private scheme for it. */
6366 /* Reset diagnostic machinery. */
6375 }
6381 {
6391 };
6394 {
6398 {}
6400 /* opt_pass methods: */
6407 simple_ipa_opt_pass *
6409 {
6411 }
6412 \f
6413 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6414 of the various TYPE_QUAL values. */
6416 static void
6418 {
6424 }
6426 /* Returns true iff CAND and BASE have equivalent language-specific
6427 qualifiers. */
6429 bool
6431 {
6434 /* type_hash_eq currently only applies to these types. */
6439 }
6441 /* This function checks to see if TYPE matches the size one of the built-in
6442 atomic types, and returns that core atomic type. */
6444 static tree
6446 {
6447 tree base_atomic_type;
6449 /* Only handle complete types. */
6454 {
6477 }
6480 }
6482 /* Returns true iff unqualified CAND and BASE are equivalent. */
6484 bool
6486 {
6488 /* Apparently this is needed for Objective-C. */
6493 /* Check alignment. */
6496 /* Atomic types increase minimal alignment. We must to do so as well
6497 or we get duplicated canonical types. See PR88686. */
6499 {
6500 /* See if this object can map to a basic atomic type. */
6504 }
6506 }
6508 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6510 bool
6512 {
6516 }
6518 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6520 static bool
6522 {
6525 /* Apparently this is needed for Objective-C. */
6527 /* Check alignment. */
6532 }
6534 /* Return a version of the TYPE, qualified as indicated by the
6535 TYPE_QUALS, if one exists. If no qualified version exists yet,
6536 return NULL_TREE. */
6538 tree
6540 {
6548 /* Search the chain of variants to see if there is already one there just
6549 like the one we need to have. If so, use that existing one. We must
6550 preserve the TYPE_NAME, since there is code that depends on this. */
6553 {
6554 /* Put the found variant at the head of the variant list so
6555 frequently searched variants get found faster. The C++ FE
6556 benefits greatly from this. */
6562 }
6565 }
6567 /* Like get_qualified_type, but creates the type if it does not
6568 exist. This function never returns NULL_TREE. */
6570 tree
6572 {
6573 tree t;
6575 /* See if we already have the appropriate qualified variant. */
6578 /* If not, build it. */
6580 {
6585 {
6586 /* See if this object can map to a basic atomic type. */
6589 {
6590 /* Ensure the alignment of this type is compatible with
6591 the required alignment of the atomic type. */
6594 }
6595 }
6598 /* Propagate structural equality. */
6601 /* Build the underlying canonical type, since it is different
6602 from TYPE. */
6603 {
6606 }
6607 else
6608 /* T is its own canonical type. */
6611 }
6614 }
6616 /* Create a variant of type T with alignment ALIGN. */
6618 tree
6620 {
6621 tree t;
6636 }
6638 /* Create a new distinct copy of TYPE. The new type is made its own
6639 MAIN_VARIANT. If TYPE requires structural equality checks, the
6640 resulting type requires structural equality checks; otherwise, its
6641 TYPE_CANONICAL points to itself. */
6643 tree
6645 {
6651 /* Set the canonical type either to a new equivalence class, or
6652 propagate the need for structural equality checks. */
6655 else
6658 /* Make it its own variant. */
6662 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6663 whose TREE_TYPE is not t. This can also happen in the Ada
6664 frontend when using subtypes. */
6667 }
6669 /* Create a new variant of TYPE, equivalent but distinct. This is so
6670 the caller can modify it. TYPE_CANONICAL for the return type will
6671 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6672 are considered equal by the language itself (or that both types
6673 require structural equality checks). */
6675 tree
6677 {
6682 /* Since we're building a variant, assume that it is a non-semantic
6683 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6685 /* Type variants have no alias set defined. */
6688 /* Add the new type to the chain of variants of TYPE. */
6694 }
6695 \f
6696 /* Return true if the from tree in both tree maps are equal. */
6698 int
6700 {
6704 }
6706 /* Hash a from tree in a tree_base_map. */
6708 unsigned int
6710 {
6712 }
6714 /* Return true if this tree map structure is marked for garbage collection
6715 purposes. We simply return true if the from tree is marked, so that this
6716 structure goes away when the from tree goes away. */
6718 int
6720 {
6722 }
6724 /* Hash a from tree in a tree_map. */
6726 unsigned int
6728 {
6730 }
6732 /* Hash a from tree in a tree_decl_map. */
6734 unsigned int
6736 {
6738 }
6740 /* Return the initialization priority for DECL. */
6742 priority_type
6744 {
6749 return
6751 }
6753 /* Return the finalization priority for DECL. */
6755 priority_type
6757 {
6762 return
6764 }
6766 /* Set the initialization priority for DECL to PRIORITY. */
6768 void
6770 {
6774 {
6778 }
6781 else
6784 }
6786 /* Set the finalization priority for DECL to PRIORITY. */
6788 void
6790 {
6794 {
6798 }
6799 else
6802 }
6804 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6806 static void
6808 {
6813 }
6815 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6817 static void
6819 {
6824 }
6826 /* Lookup a debug expression for FROM, and return it if we find one. */
6828 tree
6830 {
6838 }
6840 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6842 void
6844 {
6851 }
6853 /* Lookup a value expression for FROM, and return it if we find one. */
6855 tree
6857 {
6865 }
6867 /* Insert a mapping FROM->TO in the value expression hashtable. */
6869 void
6871 {
6878 }
6880 /* Lookup a vector of debug arguments for FROM, and return it if we
6881 find one. */
6885 {
6896 }
6898 /* Insert a mapping FROM->empty vector of debug arguments in the value
6899 expression hashtable. */
6903 {
6918 }
6920 /* Hashing of types so that we don't make duplicates.
6921 The entry point is `type_hash_canon'. */
6923 /* Generate the default hash code for TYPE. This is designed for
6924 speed, rather than maximum entropy. */
6926 hashval_t
6928 {
6937 /* Just the identifier is adequate to distinguish. */
6941 {
6944 /* FALLTHROUGH. */
6956 {
6960 {
6963 }
6964 }
6968 {
6975 }
6979 {
6983 }
6991 }
6994 }
6996 /* These are the Hashtable callback functions. */
6998 /* Returns true iff the types are equivalent. */
7000 bool
7002 {
7003 /* First test the things that are the same for all types. */
7013 /* Be careful about comparing arrays before and after the element type
7014 has been completed; don't compare TYPE_ALIGN unless both types are
7015 complete. */
7022 {
7044 /* fall through */
7076 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7077 where the flag should be inherited from the element type
7078 and can change after ARRAY_TYPEs are created; on non-aggregates
7079 compare it and hash it, scalars will never have that flag set
7080 and we need to differentiate between arrays created by different
7081 front-ends or middle-end created arrays. */
7111 }
7117 }
7119 /* Given TYPE, and HASHCODE its hash code, return the canonical
7120 object for an identical type if one already exists.
7121 Otherwise, return TYPE, and record it as the canonical object.
7123 To use this function, first create a type of the sort you want.
7124 Then compute its hash code from the fields of the type that
7125 make it different from other similar types.
7126 Then call this function and use the value. */
7128 tree
7130 {
7131 type_hash in;
7134 /* The hash table only contains main variants, so ensure that's what we're
7135 being passed. */
7138 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7139 must call that routine before comparing TYPE_ALIGNs. */
7147 {
7153 /* Free also min/max values and the cache for integer
7154 types. This can't be done in free_node, as LTO frees
7155 those on its own. */
7157 {
7160 {
7161 /* Zero is always in TYPE_CACHED_VALUES. */
7165 }
7168 {
7171 }
7174 }
7177 }
7178 else
7179 {
7188 }
7189 }
7191 static void
7193 {
7198 }
7200 /* Given two lists of types
7201 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7202 return 1 if the lists contain the same types in the same order.
7203 Also, the TREE_PURPOSEs must match. */
7205 bool
7207 {
7219 }
7221 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7222 given by TYPE. If the argument list accepts variable arguments,
7223 then this function counts only the ordinary arguments. */
7225 int
7227 {
7231 /* If the function does not take a variable number of arguments,
7232 the last element in the list will have type `void'. */
7235 else
7239 }
7241 /* Return the type of the function TYPE's argument ARGNO if known.
7242 For vararg function's where ARGNO refers to one of the variadic
7243 arguments return null. Otherwise, return a void_type_node for
7244 out-of-bounds ARGNO. */
7246 tree
7248 {
7249 /* Treat zero the same as an out-of-bounds argument number. */
7253 function_args_iterator iter;
7255 tree argtype;
7258 {
7259 /* A vararg function's argument list ends in a null. Otherwise,
7260 an ordinary function's argument list ends with void. Return
7261 null if ARGNO refers to a vararg argument, void_type_node if
7262 it's out of bounds, and the formal argument type otherwise. */
7270 }
7273 }
7275 /* Nonzero if integer constants T1 and T2
7276 represent the same constant value. */
7278 int
7280 {
7296 }
7298 /* Return true if T is an INTEGER_CST whose numerical value (extended
7299 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7301 bool
7303 {
7307 }
7309 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7310 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7312 bool
7314 {
7318 {
7323 }
7326 }
7328 /* Return true if T is an INTEGER_CST whose numerical value (extended
7329 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7331 bool
7333 {
7337 }
7339 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7340 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7342 bool
7344 {
7348 {
7353 }
7356 }
7358 /* T is an INTEGER_CST whose numerical value (extended according to
7359 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7360 HOST_WIDE_INT. */
7362 HOST_WIDE_INT
7364 {
7367 }
7369 /* T is an INTEGER_CST whose numerical value (extended according to
7370 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7371 HOST_WIDE_INT. */
7373 unsigned HOST_WIDE_INT
7375 {
7378 }
7380 /* Return the most significant (sign) bit of T. */
7382 int
7384 {
7388 }
7390 /* Return an indication of the sign of the integer constant T.
7391 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7392 Note that -1 will never be returned if T's type is unsigned. */
7394 int
7396 {
7403 else
7405 }
7407 /* Return the minimum number of bits needed to represent VALUE in a
7408 signed or unsigned type, UNSIGNEDP says which. */
7410 unsigned int
7412 {
7413 /* If the value is negative, compute its negative minus 1. The latter
7414 adjustment is because the absolute value of the largest negative value
7415 is one larger than the largest positive value. This is equivalent to
7416 a bit-wise negation, so use that operation instead. */
7421 /* Return the number of bits needed, taking into account the fact
7422 that we need one more bit for a signed than unsigned type.
7423 If value is 0 or -1, the minimum precision is 1 no matter
7424 whether unsignedp is true or false. */
7428 else
7430 }
7432 /* Return truthvalue of whether T1 is the same tree structure as T2.
7433 Return 1 if they are the same.
7434 Return 0 if they are understandably different.
7435 Return -1 if either contains tree structure not understood by
7436 this function. */
7438 int
7440 {
7450 /* For location wrappers to be the same, they must be at the same
7451 source location (and wrap the same thing). */
7453 {
7457 }
7463 {
7467 else
7469 }
7479 {
7495 {
7504 /* ??? Should we handle also fields here? */
7508 }
7519 {
7527 {
7531 }
7533 }
7536 /* Special case: if either target is an unallocated VAR_DECL,
7537 it means that it's going to be unified with whatever the
7538 TARGET_EXPR is really supposed to initialize, so treat it
7539 as being equivalent to anything. */
7547 else
7576 /* A false return means maybe_ne rather than known_ne. */
7582 }
7584 /* This general rule works for most tree codes. All exceptions should be
7585 handled above. If this is a language-specific tree code, we can't
7586 trust what might be in the operand, so say we don't know
7587 the situation. */
7592 {
7601 {
7605 }
7611 }
7612 }
7614 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7615 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7616 than U, respectively. */
7618 int
7620 {
7629 else
7631 }
7633 /* Return true if SIZE represents a constant size that is in bounds of
7634 what the middle-end and the backend accepts (covering not more than
7635 half of the address-space).
7636 When PERR is non-null, set *PERR on failure to the description of
7637 why SIZE is not valid. */
7639 bool
7641 {
7643 {
7650 }
7652 cst_size_error error;
7657 {
7660 }
7663 {
7666 }
7669 {
7672 }
7676 {
7679 }
7682 }
7684 /* Return the precision of the type, or for a complex or vector type the
7685 precision of the type of its elements. */
7687 unsigned int
7689 {
7697 }
7699 /* Return true if CODE represents an associative tree code. Otherwise
7700 return false. */
7701 bool
7703 {
7705 {
7717 }
7719 }
7721 /* Return true if CODE represents a commutative tree code. Otherwise
7722 return false. */
7723 bool
7725 {
7727 {
7754 }
7756 }
7758 /* Return true if CODE represents a ternary tree code for which the
7759 first two operands are commutative. Otherwise return false. */
7760 bool
7762 {
7764 {
7772 }
7774 }
7776 /* Returns true if CODE can overflow. */
7778 bool
7780 {
7782 {
7787 /* Can overflow in various ways. */
7793 /* For INT_MIN / -1. */
7797 /* For -INT_MIN. */
7800 /* These operators cannot overflow. */
7802 }
7803 }
7805 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7806 ftrapv doesn't generate trapping insns for CODE. */
7808 bool
7810 {
7813 /* We don't generate instructions that trap on overflow for complex or vector
7814 types. */
7822 {
7828 /* These operators can overflow, and -ftrapv generates trapping code for
7829 these. */
7836 /* These operators can overflow, but -ftrapv does not generate trapping
7837 code for these. */
7840 /* These operators cannot overflow. */
7842 }
7843 }
7845 /* Constructors for pointer, array and function types.
7846 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7847 constructed by language-dependent code, not here.) */
7849 /* Construct, lay out and return the type of pointers to TO_TYPE with
7850 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7851 reference all of memory. If such a type has already been
7852 constructed, reuse it. */
7854 tree
7857 {
7858 tree t;
7864 /* If the pointed-to type has the may_alias attribute set, force
7865 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7869 /* In some cases, languages will have things that aren't a POINTER_TYPE
7870 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7871 In that case, return that type without regard to the rest of our
7872 operands.
7874 ??? This is a kludge, but consistent with the way this function has
7875 always operated and there doesn't seem to be a good way to avoid this
7876 at the moment. */
7881 /* First, if we already have a type for pointers to TO_TYPE and it's
7882 the proper mode, use it. */
7895 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7903 /* Lay out the type. This function has many callers that are concerned
7904 with expression-construction, and this simplifies them all. */
7908 }
7910 /* By default build pointers in ptr_mode. */
7912 tree
7914 {
7919 }
7921 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7923 tree
7926 {
7927 tree t;
7933 /* If the pointed-to type has the may_alias attribute set, force
7934 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7938 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7939 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7940 In that case, return that type without regard to the rest of our
7941 operands.
7943 ??? This is a kludge, but consistent with the way this function has
7944 always operated and there doesn't seem to be a good way to avoid this
7945 at the moment. */
7950 /* First, if we already have a type for pointers to TO_TYPE and it's
7951 the proper mode, use it. */
7964 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7975 }
7978 /* Build the node for the type of references-to-TO_TYPE by default
7979 in ptr_mode. */
7981 tree
7983 {
7988 }
7990 #define MAX_INT_CACHED_PREC \
7991 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7994 /* Builds a signed or unsigned integer type of precision PRECISION.
7995 Used for C bitfields whose precision does not match that of
7996 built-in target types. */
7997 tree
8000 {
8007 {
8011 }
8018 else
8028 }
8030 #define MAX_BOOL_CACHED_PREC \
8031 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8034 /* Builds a boolean type of precision PRECISION.
8035 Used for boolean vectors to choose proper vector element size. */
8036 tree
8038 {
8039 tree type;
8042 {
8046 }
8056 }
8058 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8059 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8060 is true, reuse such a type that has already been constructed. */
8062 static tree
8064 {
8087 {
8088 /* Since we cannot reliably merge this type, we need to compare it using
8089 structural equality checks. */
8092 }
8098 }
8100 /* Wrapper around build_range_type_1 with SHARED set to true. */
8102 tree
8104 {
8106 }
8108 /* Wrapper around build_range_type_1 with SHARED set to false. */
8110 tree
8112 {
8114 }
8116 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8117 MAXVAL should be the maximum value in the domain
8118 (one less than the length of the array).
8120 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8121 We don't enforce this limit, that is up to caller (e.g. language front end).
8122 The limit exists because the result is a signed type and we don't handle
8123 sizes that use more than one HOST_WIDE_INT. */
8125 tree
8127 {
8129 }
8131 /* Return true if the debug information for TYPE, a subtype, should be emitted
8132 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8133 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8134 debug info and doesn't reflect the source code. */
8136 bool
8138 {
8141 /* Subrange types have a base type which is an integral type. */
8145 /* Get the real bounds of the subtype. */
8148 else
8149 {
8152 }
8154 /* If the type and its base type have the same representation and the same
8155 name, then the type is not a subrange but a copy of the base type. */
8169 }
8171 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8172 and number of elements specified by the range of values of INDEX_TYPE.
8173 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8174 If SHARED is true, reuse such a type that has already been constructed.
8175 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8177 static tree
8180 {
8181 tree t;
8184 {
8187 }
8197 {
8200 }
8203 {
8212 index_type
8215 }
8218 }
8220 /* Wrapper around build_array_type_1 with SHARED set to true. */
8222 tree
8224 {
8225 return
8227 }
8229 /* Wrapper around build_array_type_1 with SHARED set to false. */
8231 tree
8233 {
8235 }
8237 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8238 sizetype. */
8240 tree
8242 {
8244 }
8246 /* Recursively examines the array elements of TYPE, until a non-array
8247 element type is found. */
8249 tree
8251 {
8256 }
8258 /* Computes the canonical argument types from the argument type list
8259 ARGTYPES.
8261 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8262 on entry to this function, or if any of the ARGTYPES are
8263 structural.
8265 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8266 true on entry to this function, or if any of the ARGTYPES are
8267 non-canonical.
8269 Returns a canonical argument list, which may be ARGTYPES when the
8270 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8271 true) or would not differ from ARGTYPES. */
8273 static tree
8277 {
8278 tree arg;
8282 {
8284 /* Fail gracefully by stating that the type is structural. */
8290 /* If the argument has a default argument, we consider it
8291 non-canonical even though the type itself is canonical.
8292 That way, different variants of function and method types
8293 with default arguments will all point to the variant with
8294 no defaults as their canonical type. */
8296 }
8302 {
8303 /* Build the canonical list of argument types. */
8308 {
8311 else
8314 canon_argtypes);
8315 }
8321 /* There is a non-canonical type. */
8324 }
8326 /* The canonical argument types are the same as ARGTYPES. */
8328 }
8330 /* Construct, lay out and return
8331 the type of functions returning type VALUE_TYPE
8332 given arguments of types ARG_TYPES.
8333 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8334 are data type nodes for the arguments of the function.
8335 If such a type has already been constructed, reuse it. */
8337 tree
8339 {
8340 tree t;
8343 tree canon_argtypes;
8348 {
8351 }
8353 /* Make a node of the sort we want. */
8358 /* If we already have such a type, use the old one. */
8362 /* Set up the canonical type. */
8372 canon_argtypes);
8377 }
8379 /* Build a function type. The RETURN_TYPE is the type returned by the
8380 function. If VAARGS is set, no void_type_node is appended to the
8381 list. ARGP must be always be terminated be a NULL_TREE. */
8383 static tree
8385 {
8393 {
8398 }
8401 else
8402 {
8406 }
8410 }
8412 /* Build a function type. The RETURN_TYPE is the type returned by the
8413 function. If additional arguments are provided, they are
8414 additional argument types. The list of argument types must always
8415 be terminated by NULL_TREE. */
8417 tree
8419 {
8420 tree args;
8427 }
8429 /* Build a variable argument function type. The RETURN_TYPE is the
8430 type returned by the function. If additional arguments are provided,
8431 they are additional argument types. The list of argument types must
8432 always be terminated by NULL_TREE. */
8434 tree
8436 {
8437 tree args;
8445 }
8447 /* Build a function type. RETURN_TYPE is the type returned by the
8448 function; VAARGS indicates whether the function takes varargs. The
8449 function takes N named arguments, the types of which are provided in
8450 ARG_TYPES. */
8452 static tree
8455 {
8463 }
8465 /* Build a function type. RETURN_TYPE is the type returned by the
8466 function. The function takes N named arguments, the types of which
8467 are provided in ARG_TYPES. */
8469 tree
8471 {
8473 }
8475 /* Build a variable argument function type. RETURN_TYPE is the type
8476 returned by the function. The function takes N named arguments, the
8477 types of which are provided in ARG_TYPES. */
8479 tree
8481 {
8483 }
8485 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8486 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8487 for the method. An implicit additional parameter (of type
8488 pointer-to-BASETYPE) is added to the ARGTYPES. */
8490 tree
8492 tree rettype,
8493 tree argtypes)
8494 {
8495 tree t;
8496 tree ptype;
8498 tree canon_argtypes;
8500 /* Make a node of the sort we want. */
8507 /* The actual arglist for this function includes a "hidden" argument
8508 which is "this". Put it into the list of argument types. */
8512 /* If we already have such a type, use the old one. */
8516 /* Set up the canonical type. */
8517 any_structural_p
8520 any_noncanonical_p
8532 canon_argtypes);
8537 }
8539 /* Construct, lay out and return the type of methods belonging to class
8540 BASETYPE and whose arguments and values are described by TYPE.
8541 If that type exists already, reuse it.
8542 TYPE must be a FUNCTION_TYPE node. */
8544 tree
8546 {
8552 }
8554 /* Construct, lay out and return the type of offsets to a value
8555 of type TYPE, within an object of type BASETYPE.
8556 If a suitable offset type exists already, reuse it. */
8558 tree
8560 {
8561 tree t;
8563 /* Make a node of the sort we want. */
8569 /* If we already have such a type, use the old one. */
8577 {
8586 }
8589 }
8591 /* Create a complex type whose components are COMPONENT_TYPE.
8593 If NAMED is true, the type is given a TYPE_NAME. We do not always
8594 do so because this creates a DECL node and thus make the DECL_UIDs
8595 dependent on the type canonicalization hashtable, which is GC-ed,
8596 so the DECL_UIDs would not be stable wrt garbage collection. */
8598 tree
8600 {
8605 /* Make a node of the sort we want. */
8610 /* If we already have such a type, use the old one. */
8615 {
8616 /* We created a new type. The hash insertion will have laid
8617 out the type. We need to check the canonicalization and
8618 maybe set the name. */
8629 /* We need to create a name, since complex is a fundamental type. */
8631 {
8660 }
8661 }
8664 }
8666 /* If TYPE is a real or complex floating-point type and the target
8667 does not directly support arithmetic on TYPE then return the wider
8668 type to be used for arithmetic on TYPE. Otherwise, return
8669 NULL_TREE. */
8671 tree
8673 {
8674 /* The target can give two different responses to the question of
8675 which excess precision mode it would like depending on whether we
8676 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8678 enum excess_precision_type requested_type
8680 ? EXCESS_PRECISION_TYPE_FAST
8683 enum flt_eval_method target_flt_eval_method
8686 /* The target should not ask for unpredictable float evaluation (though
8687 it might advertise that implicitly the evaluation is unpredictable,
8688 but we don't care about that here, it will have been reported
8689 elsewhere). If it does ask for unpredictable evaluation, we have
8690 nothing to do here. */
8693 /* Nothing to do. The target has asked for all types we know about
8694 to be computed with their native precision and range. */
8698 /* The target will promote this type in a target-dependent way, so excess
8699 precision ought to leave it alone. */
8703 machine_mode float16_type_mode = (float16_type_node
8710 {
8712 {
8715 {
8733 }
8735 }
8737 {
8742 {
8760 }
8762 }
8765 }
8768 }
8769 \f
8770 /* Return OP, stripped of any conversions to wider types as much as is safe.
8771 Converting the value back to OP's type makes a value equivalent to OP.
8773 If FOR_TYPE is nonzero, we return a value which, if converted to
8774 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8776 OP must have integer, real or enumeral type. Pointers are not allowed!
8778 There are some cases where the obvious value we could return
8779 would regenerate to OP if converted to OP's type,
8780 but would not extend like OP to wider types.
8781 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8782 For example, if OP is (unsigned short)(signed char)-1,
8783 we avoid returning (signed char)-1 if FOR_TYPE is int,
8784 even though extending that to an unsigned short would regenerate OP,
8785 since the result of extending (signed char)-1 to (int)
8786 is different from (int) OP. */
8788 tree
8790 {
8791 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8793 unsigned final_prec
8795 int uns
8802 {
8805 /* TYPE_PRECISION on vector types has different meaning
8806 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8807 so avoid them here. */
8814 /* Truncations are many-one so cannot be removed.
8815 Unless we are later going to truncate down even farther. */
8820 /* See what's inside this conversion. If we decide to strip it,
8821 we will set WIN. */
8824 /* If we have not stripped any zero-extensions (uns is 0),
8825 we can strip any kind of extension.
8826 If we have previously stripped a zero-extension,
8827 only zero-extensions can safely be stripped.
8828 Any extension can be stripped if the bits it would produce
8829 are all going to be discarded later by truncating to FOR_TYPE. */
8832 {
8835 /* TYPE_UNSIGNED says whether this is a zero-extension.
8836 Let's avoid computing it if it does not affect WIN
8837 and if UNS will not be needed again. */
8841 {
8844 }
8845 }
8846 }
8848 /* If we finally reach a constant see if it fits in sth smaller and
8849 in that case convert it. */
8851 {
8857 {
8861 }
8862 }
8865 }
8866 \f
8867 /* Return OP or a simpler expression for a narrower value
8868 which can be sign-extended or zero-extended to give back OP.
8869 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8870 or 0 if the value should be sign-extended. */
8872 tree
8874 {
8881 {
8882 do
8896 ret);
8898 }
8900 {
8901 int bitschange
8905 /* Truncations are many-one so cannot be removed. */
8909 /* See what's inside this conversion. If we decide to strip it,
8910 we will set WIN. */
8913 {
8915 /* An extension: the outermost one can be stripped,
8916 but remember whether it is zero or sign extension. */
8919 /* Otherwise, if a sign extension has been stripped,
8920 only sign extensions can now be stripped;
8921 if a zero extension has been stripped, only zero-extensions. */
8925 }
8927 {
8928 /* A change in nominal type can always be stripped, but we must
8929 preserve the unsignedness. */
8934 /* Keep trying to narrow, but don't assign op to win if it
8935 would turn an integral type into something else. */
8938 }
8941 }
8944 /* Since type_for_size always gives an integer type. */
8947 /* Ensure field is laid out already. */
8950 {
8951 unsigned HOST_WIDE_INT innerprec
8957 /* We can get this structure field in a narrower type that fits it,
8958 but the resulting extension to its nominal type (a fullword type)
8959 must satisfy the same conditions as for other extensions.
8961 Do this only for fields that are aligned (not bit-fields),
8962 because when bit-field insns will be used there is no
8963 advantage in doing this. */
8969 {
8973 }
8974 }
8978 }
8979 \f
8980 /* Return true if integer constant C has a value that is permissible
8981 for TYPE, an integral type. */
8983 bool
8985 {
8990 /* Non-standard boolean types can have arbitrary precision but various
8991 transformations assume that they can only take values 0 and +/-1. */
8995 retry:
8999 /* If at least one bound of the type is a constant integer, we can check
9000 ourselves and maybe make a decision. If no such decision is possible, but
9001 this type is a subtype, try checking against that. Otherwise, use
9002 fits_to_tree_p, which checks against the precision.
9004 Compute the status for each possibly constant bound, and return if we see
9005 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9006 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9007 for "constant known to fit". */
9009 /* Check if c >= type_low_bound. */
9011 {
9015 }
9016 else
9019 /* Check if c <= type_high_bound. */
9021 {
9025 }
9026 else
9029 /* If the constant fits both bounds, the result is known. */
9033 /* Perform some generic filtering which may allow making a decision
9034 even if the bounds are not constant. First, negative integers
9035 never fit in unsigned types, */
9039 /* Second, narrower types always fit in wider ones. */
9043 /* Third, unsigned integers with top bit set never fit signed types. */
9045 {
9048 {
9049 /* When a tree_cst is converted to a wide-int, the precision
9050 is taken from the type. However, if the precision of the
9051 mode underneath the type is smaller than that, it is
9052 possible that the value will not fit. The test below
9053 fails if any bit is set between the sign bit of the
9054 underlying mode and the top bit of the type. */
9057 }
9060 }
9062 /* If we haven't been able to decide at this point, there nothing more we
9063 can check ourselves here. Look at the base type if we have one and it
9064 has the same precision. */
9068 {
9071 }
9073 /* Or to fits_to_tree_p, if nothing else. */
9075 }
9077 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9078 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9079 represented (assuming two's-complement arithmetic) within the bit
9080 precision of the type are returned instead. */
9082 void
9084 {
9088 else
9089 {
9092 else
9093 {
9096 }
9097 }
9102 else
9103 {
9106 }
9107 }
9109 /* Return true if VAR is an automatic variable. */
9111 bool
9113 {
9118 }
9120 /* Return true if VAR is an automatic variable defined in function FN. */
9122 bool
9124 {
9128 }
9130 /* Subprogram of following function. Called by walk_tree.
9132 Return *TP if it is an automatic variable or parameter of the
9133 function passed in as DATA. */
9135 static tree
9137 {
9148 }
9150 /* Returns true if T is, contains, or refers to a type with variable
9151 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9152 arguments, but not the return type. If FN is nonzero, only return
9153 true if a modifier of the type or position of FN is a variable or
9154 parameter inside FN.
9156 This concept is more general than that of C99 'variably modified types':
9157 in C99, a struct type is never variably modified because a VLA may not
9158 appear as a structure member. However, in GNU C code like:
9160 struct S { int i[f()]; };
9162 is valid, and other languages may define similar constructs. */
9164 bool
9166 {
9167 tree t;
9169 /* Test if T is either variable (if FN is zero) or an expression containing
9170 a variable in FN. If TYPE isn't gimplified, return true also if
9171 gimplify_one_sizepos would gimplify the expression into a local
9172 variable. */
9173 #define RETURN_TRUE_IF_VAR(T) \
9174 do { tree _t = (T); \
9175 if (_t != NULL_TREE \
9176 && _t != error_mark_node \
9177 && !CONSTANT_CLASS_P (_t) \
9178 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9179 && (!fn \
9180 || (!TYPE_SIZES_GIMPLIFIED (type) \
9181 && (TREE_CODE (_t) != VAR_DECL \
9182 && !CONTAINS_PLACEHOLDER_P (_t))) \
9183 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9184 return true; } while (0)
9189 /* If TYPE itself has variable size, it is variably modified. */
9194 {
9198 /* Ada can have pointer types refering to themselves indirectly. */
9203 {
9206 }
9212 /* If TYPE is a function type, it is variably modified if the
9213 return type is variably modified. */
9223 /* Scalar types are variably modified if their end points
9224 aren't constant. */
9232 /* We can't see if any of the fields are variably-modified by the
9233 definition we normally use, since that would produce infinite
9234 recursion via pointers. */
9235 /* This is variably modified if some field's type is. */
9238 {
9243 /* If the type is a qualified union, then the DECL_QUALIFIER
9244 of fields can also be an expression containing a variable. */
9248 /* If the field is a qualified union, then it's only a container
9249 for what's inside so we look into it. That's necessary in LTO
9250 mode because the sizes of the field tested above have been set
9251 to PLACEHOLDER_EXPRs by free_lang_data. */
9255 }
9259 /* Do not call ourselves to avoid infinite recursion. This is
9260 variably modified if the element type is. */
9267 }
9269 /* The current language may have other cases to check, but in general,
9270 all other types are not variably modified. */
9273 #undef RETURN_TRUE_IF_VAR
9274 }
9276 /* Given a DECL or TYPE, return the scope in which it was declared, or
9277 NULL_TREE if there is no containing scope. */
9279 tree
9281 {
9283 }
9285 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9287 const_tree
9289 {
9291 {
9294 else
9296 }
9298 }
9300 /* Return the innermost context enclosing DECL that is
9301 a FUNCTION_DECL, or zero if none. */
9303 tree
9305 {
9306 tree context;
9311 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9312 where we look up the function at runtime. Such functions always take
9313 a first argument of type 'pointer to real context'.
9315 C++ should really be fixed to use DECL_CONTEXT for the real context,
9316 and use something else for the "virtual context". */
9318 context
9319 = TYPE_MAIN_VARIANT
9321 else
9325 {
9328 else
9330 }
9333 }
9335 /* Return the innermost context enclosing DECL that is
9336 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9337 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9339 tree
9341 {
9346 {
9367 }
9370 }
9372 /* CALL is a CALL_EXPR. Return the declaration for the function
9373 called, or NULL_TREE if the called function cannot be
9374 determined. */
9376 tree
9378 {
9379 tree addr;
9384 /* It's invalid to call this function with anything but a
9385 CALL_EXPR. */
9388 /* The first operand to the CALL is the address of the function
9389 called. */
9392 /* If there is no function, return early. */
9398 /* If this is a readonly function pointer, extract its initial value. */
9404 /* If the address is just `&f' for some function `f', then we know
9405 that `f' is being called. */
9410 /* We couldn't figure out what was being called. */
9412 }
9414 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9415 return the associated function code, otherwise return CFN_LAST. */
9417 combined_fn
9419 {
9420 /* It's invalid to call this function with anything but a CALL_EXPR. */
9431 }
9433 /* Comparator of indices based on tree_node_counts. */
9435 static int
9437 {
9442 }
9444 /* Comparator of indices based on tree_code_counts. */
9446 static int
9448 {
9453 }
9455 #define TREE_MEM_USAGE_SPACES 40
9457 /* Print debugging information about tree nodes generated during the compile,
9458 and any language-specific information. */
9460 void
9462 {
9464 {
9470 {
9477 {
9484 }
9489 }
9491 {
9501 {
9506 }
9513 }
9514 }
9515 else
9522 }
9523 \f
9526 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9528 unsigned
9530 {
9531 /* This relies on the raw feedback's top 4 bits being zero. */
9532 #define FEEDBACK(X) ((X) * 0x04c11db7)
9533 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9534 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9536 {
9541 };
9542 #undef FEEDBACK
9543 #undef SYNDROME
9547 {
9551 }
9554 }
9556 /* Generate a crc32 of a string. */
9558 unsigned
9560 {
9561 do
9565 }
9567 /* P is a string that will be used in a symbol. Mask out any characters
9568 that are not valid in that context. */
9570 void
9572 {
9577 #endif
9580 #endif
9581 ))
9583 }
9587 /* Create a unique anonymous identifier. The identifier is still a
9588 valid assembly label. */
9590 tree
9592 {
9594 #if !defined (NO_DOT_IN_LABEL)
9595 "."
9596 #elif !defined (NO_DOLLAR_IN_LABEL)
9597 "$"
9598 #else
9599 "_"
9600 #endif
9611 }
9613 /* Generate a name for a special-purpose function.
9614 The generated name may need to be unique across the whole link.
9615 Changes to this function may also require corresponding changes to
9616 xstrdup_mask_random.
9617 TYPE is some string to identify the purpose of this function to the
9618 linker or collect2; it must start with an uppercase letter,
9619 one of:
9620 I - for constructors
9621 D - for destructors
9622 N - for C++ anonymous namespaces
9623 F - for DWARF unwind frame information. */
9625 tree
9627 {
9632 /* If we already have a name we know to be unique, just use that. */
9635 /* If the target is handling the constructors/destructors, they
9636 will be local to this file and the name is only necessary for
9637 debugging purposes.
9638 We also assign sub_I and sub_D sufixes to constructors called from
9639 the global static constructors. These are always local. */
9643 {
9647 /* Just use the file's basename, because the full pathname
9648 might be quite long. */
9650 }
9651 else
9652 {
9653 /* Otherwise, the name must be unique across the entire link.
9654 We don't have anything that we know to be unique to this translation
9655 unit, so use what we do have and throw in some randomness. */
9673 }
9679 /* Set up the name of the file-level functions we may need.
9680 Use a global object (which is already required to be unique over
9681 the program) rather than the file name (which imposes extra
9682 constraints). */
9686 }
9687 \f
9688 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9690 /* Complain that the tree code of NODE does not match the expected 0
9691 terminated list of trailing codes. The trailing code list can be
9692 empty, for a more vague error message. FILE, LINE, and FUNCTION
9693 are of the caller. */
9695 void
9698 {
9709 {
9716 {
9723 }
9725 }
9726 else
9732 }
9734 /* Complain that the tree code of NODE does match the expected 0
9735 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9736 the caller. */
9738 void
9741 {
9755 {
9757 {
9760 }
9763 }
9769 }
9771 /* Similar to tree_check_failed, except that we check for a class of tree
9772 code, given in CL. */
9774 void
9777 {
9778 internal_error
9783 }
9785 /* Similar to tree_check_failed, except that instead of specifying a
9786 dozen codes, use the knowledge that they're all sequential. */
9788 void
9792 {
9805 {
9812 }
9817 }
9820 /* Similar to tree_check_failed, except that we check that a tree does
9821 not have the specified code, given in CL. */
9823 void
9826 {
9827 internal_error
9832 }
9835 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9837 void
9840 {
9846 }
9849 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9851 void
9855 {
9868 {
9875 }
9880 }
9883 #undef DEFTREESTRUCT
9884 #define DEFTREESTRUCT(VAL, NAME) NAME,
9888 };
9889 #undef DEFTREESTRUCT
9891 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9893 /* Similar to tree_class_check_failed, except that we check for
9894 whether CODE contains the tree structure identified by EN. */
9896 void
9901 {
9902 internal_error
9906 }
9909 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9910 (dynamically sized) vector. */
9912 void
9915 {
9916 internal_error
9920 }
9922 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9923 (dynamically sized) vector. */
9925 void
9928 {
9929 internal_error
9932 }
9934 /* Similar to above, except that the check is for the bounds of the operand
9935 vector of an expression node EXP. */
9937 void
9940 {
9942 internal_error
9946 }
9948 /* Similar to above, except that the check is for the number of
9949 operands of an OMP_CLAUSE node. */
9951 void
9954 {
9955 internal_error
9960 }
9962 \f
9963 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9964 and mapped to the machine mode MODE. Initialize its fields and build
9965 the information necessary for debugging output. */
9967 static tree
9969 {
9970 tree t;
9991 /* We have built a main variant, based on the main variant of the
9992 inner type. Use it to build the variant we return. */
10000 }
10002 static tree
10004 {
10027 else
10029 }
10031 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10033 static tree
10035 {
10037 {
10049 }
10050 else
10051 {
10063 }
10066 }
10068 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10070 static tree
10072 {
10074 {
10086 }
10087 else
10088 {
10100 }
10103 }
10106 /* Create an atomic variant node for TYPE. This routine is called
10107 during initialization of data types to create the 5 basic atomic
10108 types. The generic build_variant_type function requires these to
10109 already be set up in order to function properly, so cannot be
10110 called from there. If ALIGN is non-zero, then ensure alignment is
10111 overridden to this value. */
10113 static tree
10115 {
10116 tree t;
10118 /* Make sure its not already registered. */
10129 }
10131 /* Information about the _FloatN and _FloatNx types. This must be in
10132 the same order as the corresponding TI_* enum values. */
10134 {
10142 };
10145 /* Create nodes for all integer types (and error_mark_node) using the sizes
10146 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10148 void
10150 {
10158 /* Define both `signed char' and `unsigned char'. */
10164 /* Define `char', which is like either `signed char' or `unsigned char'
10165 but not the same as either. */
10166 char_type_node
10167 = (signed_char
10182 {
10187 {
10190 }
10191 }
10193 /* Define a boolean type. This type only represents boolean values but
10194 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10200 /* Define what type to use for size_t. */
10209 else
10210 {
10216 {
10223 {
10225 }
10226 }
10229 }
10231 /* Define what type to use for ptrdiff_t. */
10240 else
10241 {
10245 {
10253 }
10256 }
10258 /* Fill in the rest of the sized types. Reuse existing type nodes
10259 when possible. */
10272 /* Don't call build_qualified type for atomics. That routine does
10273 special processing for atomics, and until they are initialized
10274 it's better not to make that call.
10276 Check to see if there is a target override for atomic types. */
10293 /* Define these next since types below may used them. */
10311 /* We are not going to have real types in C with less than byte alignment,
10312 so we might as well not have any types that claim to have it. */
10323 const_ptr_type_node
10345 {
10348 scalar_float_mode mode;
10352 /* Work around the rs6000 KFmode having precision 113 not
10353 128. */
10365 }
10372 /* Fixed size integer types. */
10379 /* Decimal float types. */
10381 {
10396 }
10405 {
10409 }
10411 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10412 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10413 sat_ ## KIND ## _type_node = \
10414 make_sat_signed_ ## KIND ## _type (SIZE); \
10415 sat_unsigned_ ## KIND ## _type_node = \
10416 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10417 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10418 unsigned_ ## KIND ## _type_node = \
10419 make_unsigned_ ## KIND ## _type (SIZE);
10421 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10422 sat_ ## WIDTH ## KIND ## _type_node = \
10423 make_sat_signed_ ## KIND ## _type (SIZE); \
10424 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10425 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10426 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10427 unsigned_ ## WIDTH ## KIND ## _type_node = \
10428 make_unsigned_ ## KIND ## _type (SIZE);
10430 /* Make fixed-point type nodes based on four different widths. */
10431 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10432 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10433 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10434 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10435 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10437 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10438 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10439 NAME ## _type_node = \
10440 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10441 u ## NAME ## _type_node = \
10442 make_or_reuse_unsigned_ ## KIND ## _type \
10443 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10444 sat_ ## NAME ## _type_node = \
10445 make_or_reuse_sat_signed_ ## KIND ## _type \
10446 (GET_MODE_BITSIZE (MODE ## mode)); \
10447 sat_u ## NAME ## _type_node = \
10448 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10449 (GET_MODE_BITSIZE (U ## MODE ## mode));
10451 /* Fixed-point type and mode nodes. */
10464 {
10467 /* Many back-ends define record types without setting TYPE_NAME.
10468 If we copied the record type here, we'd keep the original
10469 record type without a name. This breaks name mangling. So,
10470 don't copy record types and let c_common_nodes_and_builtins()
10471 declare the type to be __builtin_va_list. */
10476 }
10478 /* SCEV analyzer global shared trees. */
10483 }
10485 /* Modify DECL for given flags.
10486 TM_PURE attribute is set only on types, so the function will modify
10487 DECL's type when ECF_TM_PURE is used. */
10489 void
10491 {
10521 /* Looping const or pure is implied by noreturn.
10522 There is currently no way to declare looping const or looping pure alone. */
10525 }
10528 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10530 static void
10533 {
10534 tree decl;
10541 }
10543 /* Call this function after instantiating all builtins that the language
10544 front end cares about. This will build the rest of the builtins
10545 and internal functions that are relied upon by the tree optimizers and
10546 the middle-end. */
10548 void
10550 {
10556 {
10560 BUILT_IN_UNREACHABLE,
10568 }
10572 {
10583 }
10586 {
10589 NULL_TREE);
10592 }
10595 {
10601 }
10603 /* If we're checking the stack, `alloca' can throw. */
10604 const int alloca_flags
10608 {
10613 }
10618 BUILT_IN_ALLOCA_WITH_ALIGN,
10620 alloca_flags);
10625 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX,
10627 alloca_flags);
10633 BUILT_IN_INIT_TRAMPOLINE,
10636 BUILT_IN_INIT_HEAP_TRAMPOLINE,
10640 BUILT_IN_INIT_DESCRIPTOR,
10645 BUILT_IN_ADJUST_TRAMPOLINE,
10649 BUILT_IN_ADJUST_DESCRIPTOR,
10656 BUILT_IN_NONLOCAL_GOTO,
10663 BUILT_IN_SETJMP_SETUP,
10668 BUILT_IN_SETJMP_RECEIVER,
10677 BUILT_IN_STACK_RESTORE,
10682 NULL_TREE);
10695 /* If there's a possibility that we might use the ARM EABI, build the
10696 alternate __cxa_end_cleanup node used to resume from C++. */
10698 {
10701 BUILT_IN_CXA_END_CLEANUP,
10703 }
10707 BUILT_IN_UNWIND_RESUME,
10711 ECF_NORETURN);
10714 {
10716 NULL_TREE);
10718 BUILT_IN_RETURN_ADDRESS,
10720 ECF_NOTHROW);
10721 }
10725 {
10730 BUILT_IN_PROFILE_FUNC_ENTER,
10734 BUILT_IN_PROFILE_FUNC_EXIT,
10736 }
10738 /* The exception object and filter values from the runtime. The argument
10739 must be zero before exception lowering, i.e. from the front end. After
10740 exception lowering, it will be the region number for the exception
10741 landing pad. These functions are PURE instead of CONST to prevent
10742 them from being hoisted past the exception edge that will initialize
10743 its value in the landing pad. */
10747 /* Only use TM_PURE if we have TM language support. */
10760 NULL_TREE);
10762 BUILT_IN_EH_COPY_VALUES,
10765 /* Complex multiplication and division. These are handled as builtins
10766 rather than optabs because emit_library_call_value doesn't support
10767 complex. Further, we can do slightly better with folding these
10768 beasties if the real and complex parts of the arguments are separate. */
10769 {
10773 {
10800 /* For -ftrapping-math these should throw from a former
10801 -fnon-call-exception stmt. */
10803 NULL);
10809 NULL);
10813 }
10814 }
10817 }
10819 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10820 better way.
10822 If we requested a pointer to a vector, build up the pointers that
10823 we stripped off while looking for the inner type. Similarly for
10824 return values from functions.
10826 The argument TYPE is the top of the chain, and BOTTOM is the
10827 new type which we will point to. */
10829 tree
10831 {
10835 {
10839 }
10841 {
10845 }
10847 {
10850 }
10852 {
10855 }
10857 {
10859 /* The build_method_type_directly() routine prepends 'this' to argument list,
10860 so we must compensate by getting rid of it. */
10861 outer
10862 = build_method_type_directly
10864 inner,
10866 }
10868 {
10871 }
10872 else
10877 }
10879 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10880 the inner type. */
10881 tree
10883 {
10884 poly_int64 nunits;
10888 {
10900 /* Check that there are no leftover bits. */
10908 }
10911 }
10913 /* Similarly, but takes the inner type and number of units, which must be
10914 a power of two. */
10916 tree
10918 {
10920 }
10922 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10924 tree
10926 {
10934 }
10936 /* Build a vector type that holds one boolean result for each element of
10937 vector type VECTYPE. The public interface for this operation is
10938 truth_type_for. */
10940 static tree
10942 {
10946 machine_mode mask_mode;
10956 }
10958 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10959 set. */
10961 tree
10963 {
10965 tree cand;
10966 /* We always build the non-opaque variant before the opaque one,
10967 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10973 /* Othewise build a variant type and make sure to queue it after
10974 the non-opaque type. */
10982 }
10984 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10986 wide_int
10988 {
10989 /* First handle elements that are directly encoded. */
10994 /* Identify the pattern that contains element I and work out the index of
10995 the last encoded element for that pattern. */
11001 /* If there are no steps, the final encoded value is the right one. */
11005 /* Otherwise work out the value from the last two encoded elements. */
11010 }
11012 /* Return the value of element I of VECTOR_CST T. */
11014 tree
11016 {
11017 /* First handle elements that are directly encoded. */
11022 /* If there are no steps, the final encoded value is the right one. */
11024 {
11025 /* Identify the pattern that contains element I and work out the index of
11026 the last encoded element for that pattern. */
11031 }
11033 /* Otherwise work out the value from the last two encoded elements. */
11036 }
11038 /* Given an initializer INIT, return TRUE if INIT is zero or some
11039 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11040 null, set *NONZERO if and only if INIT is known not to be all
11041 zeros. The combination of return value of false and *NONZERO
11042 false implies that INIT may but need not be all zeros. Other
11043 combinations indicate definitive answers. */
11045 bool
11047 {
11052 /* Conservatively clear NONZERO and set it only if INIT is definitely
11053 not all zero. */
11061 {
11070 /* ??? Note that this is not correct for C4X float formats. There,
11071 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11072 negative exponent. */
11107 {
11112 tree elt;
11119 }
11122 {
11137 }
11138 /* Fall through. */
11141 {
11149 /* We need to loop through all elements to handle cases like
11150 "\0" and "\0foobar". */
11153 {
11156 }
11159 }
11163 }
11164 }
11166 /* Return true if EXPR is an initializer expression in which every element
11167 is a constant that is numerically equal to 0 or 1. The elements do not
11168 need to be equal to each other. */
11170 bool
11172 {
11176 {
11184 {
11191 {
11195 }
11198 }
11202 }
11203 }
11205 /* Check if vector VEC consists of all the equal elements and
11206 that the number of elements corresponds to the type of VEC.
11207 The function returns first element of the vector
11208 or NULL_TREE if the vector is not uniform. */
11209 tree
11211 {
11224 {
11228 }
11232 {
11236 {
11238 {
11241 }
11244 }
11249 }
11252 }
11254 /* If the argument is INTEGER_CST, return it. If the argument is vector
11255 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11256 return NULL_TREE.
11257 Look through location wrappers. */
11259 tree
11261 {
11268 {
11272 }
11275 }
11277 /* If VECTOR_CST T has a single nonzero element, return the index of that
11278 element, otherwise return -1. */
11280 int
11282 {
11288 {
11291 }
11292 else
11297 {
11300 {
11304 }
11305 }
11307 }
11309 /* Build an empty statement at location LOC. */
11311 tree
11313 {
11317 }
11320 /* Build an OpenMP clause with code CODE. LOC is the location of the
11321 clause. */
11323 tree
11325 {
11326 tree t;
11341 }
11343 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11344 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11345 Except for the CODE and operand count field, other storage for the
11346 object is initialized to zeros. */
11348 tree
11350 {
11351 tree t;
11363 /* Can't use TREE_OPERAND to store the length because if checking is
11364 enabled, it will try to check the length before we store it. :-P */
11368 }
11370 /* Helper function for build_call_* functions; build a CALL_EXPR with
11371 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11372 the argument slots. */
11374 static tree
11376 {
11377 tree t;
11385 }
11387 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11388 FN and a null static chain slot. NARGS is the number of call arguments
11389 which are specified as "..." arguments. */
11391 tree
11393 {
11394 tree ret;
11400 }
11402 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11403 FN and a null static chain slot. NARGS is the number of call arguments
11404 which are specified as a va_list ARGS. */
11406 tree
11408 {
11409 tree t;
11417 }
11419 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11420 FN and a null static chain slot. NARGS is the number of call arguments
11421 which are specified as a tree array ARGS. */
11423 tree
11426 {
11427 tree t;
11436 }
11438 /* Like build_call_array, but takes a vec. */
11440 tree
11442 {
11451 }
11453 /* Conveniently construct a function call expression. FNDECL names the
11454 function to be called and N arguments are passed in the array
11455 ARGARRAY. */
11457 tree
11459 {
11464 }
11466 /* Conveniently construct a function call expression. FNDECL names the
11467 function to be called and the arguments are passed in the vector
11468 VEC. */
11470 tree
11472 {
11475 }
11478 /* Conveniently construct a function call expression. FNDECL names the
11479 function to be called, N is the number of arguments, and the "..."
11480 parameters are the argument expressions. */
11482 tree
11484 {
11494 }
11496 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11497 varargs macros aren't supported by all bootstrap compilers. */
11499 tree
11501 {
11511 }
11513 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11514 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11515 It will get gimplified later into an ordinary internal function. */
11517 tree
11520 {
11528 }
11530 /* Build internal call expression. This is just like CALL_EXPR, except
11531 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11532 internal function. */
11534 tree
11537 {
11547 }
11549 /* Return a function call to FN, if the target is guaranteed to support it,
11550 or null otherwise.
11552 N is the number of arguments, passed in the "...", and TYPE is the
11553 type of the return value. */
11555 tree
11558 {
11568 {
11571 {
11574 OPTIMIZE_FOR_BOTH))
11576 }
11578 }
11579 else
11580 {
11585 }
11586 }
11588 /* Return a function call to the appropriate builtin alloca variant.
11590 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11591 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11592 bound for SIZE in case it is not a fixed value. */
11594 tree
11596 {
11598 {
11600 return
11602 }
11604 {
11607 }
11608 else
11609 {
11612 }
11613 }
11615 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11616 if SIZE == -1) and return a tree node representing char* pointer to
11617 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11618 the STRING_CST value is the LEN bytes at STR (the representation
11619 of the string, which may be wide). Otherwise it's all zeros. */
11621 tree
11625 {
11627 /* Set the maximum valid index based on the string length or SIZE. */
11628 unsigned HOST_WIDE_INT maxidx
11644 }
11648 /* Return true if T (assumed to be a DECL) must be assigned a memory
11649 location. */
11651 bool
11653 {
11659 }
11661 /* Return value of a constant X and sign-extend it. */
11663 HOST_WIDE_INT
11665 {
11669 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11673 {
11677 else
11679 }
11682 }
11684 /* If TYPE is an integral or pointer type, return an integer type with
11685 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11686 if TYPE is already an integer type of signedness UNSIGNEDP.
11687 If TYPE is a floating-point type, return an integer type with the same
11688 bitsize and with the signedness given by UNSIGNEDP; this is useful
11689 when doing bit-level operations on a floating-point value. */
11691 tree
11693 {
11698 {
11706 }
11709 {
11717 }
11726 else
11730 }
11732 /* If TYPE is an integral or pointer type, return an integer type with
11733 the same precision which is unsigned, or itself if TYPE is already an
11734 unsigned integer type. If TYPE is a floating-point type, return an
11735 unsigned integer type with the same bitsize as TYPE. */
11737 tree
11739 {
11741 }
11743 /* If TYPE is an integral or pointer type, return an integer type with
11744 the same precision which is signed, or itself if TYPE is already a
11745 signed integer type. If TYPE is a floating-point type, return a
11746 signed integer type with the same bitsize as TYPE. */
11748 tree
11750 {
11752 }
11754 /* If TYPE is a vector type, return a signed integer vector type with the
11755 same width and number of subparts. Otherwise return boolean_type_node. */
11757 tree
11759 {
11761 {
11765 }
11766 else
11768 }
11770 /* Returns the largest value obtainable by casting something in INNER type to
11771 OUTER type. */
11773 tree
11775 {
11781 /* Compute a unique number for every combination. */
11786 /* Determine the exponent to use. */
11788 {
11791 /* oprec <= iprec, outer: signed, inner: don't care. */
11796 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11800 /* oprec > iprec, outer: signed, inner: signed. */
11804 /* oprec > iprec, outer: signed, inner: unsigned. */
11808 /* oprec > iprec, outer: unsigned, inner: signed. */
11812 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11817 }
11821 }
11823 /* Returns the smallest value obtainable by casting something in INNER type to
11824 OUTER type. */
11826 tree
11828 {
11832 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11833 and obtain 0. */
11835 /* If we are widening something of an unsigned type, OUTER type
11836 contains all values of INNER type. In particular, both INNER
11837 and OUTER types have zero in common. */
11840 else
11841 {
11842 /* If we are widening a signed type to another signed type, we
11843 want to obtain -2^^(iprec-1). If we are keeping the
11844 precision or narrowing to a signed type, we want to obtain
11845 -2^(oprec-1). */
11850 }
11851 }
11853 /* Return nonzero if two operands that are suitable for PHI nodes are
11854 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11855 SSA_NAME or invariant. Note that this is strictly an optimization.
11856 That is, callers of this function can directly call operand_equal_p
11857 and get the same result, only slower. */
11859 int
11861 {
11867 }
11869 /* Returns number of zeros at the end of binary representation of X. */
11871 tree
11873 {
11875 }
11878 #define WALK_SUBTREE(NODE) \
11879 do \
11880 { \
11881 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11882 if (result) \
11883 return result; \
11884 } \
11885 while (0)
11887 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11888 be walked whenever a type is seen in the tree. Rest of operands and return
11889 value are as for walk_tree. */
11891 static tree
11894 {
11898 {
11902 /* We have to worry about mutually recursive pointers. These can't
11903 be written in C. They can in Ada. It's pathological, but
11904 there's an ACATS test (c38102a) that checks it. Deal with this
11905 by checking if we're pointing to another pointer, that one
11906 points to another pointer, that one does too, and we have no htab.
11907 If so, get a hash table. We check three levels deep to avoid
11908 the cost of the hash table if we don't need one. */
11913 {
11920 }
11922 /* fall through */
11931 /* Fall through. */
11935 {
11936 tree arg;
11938 /* We never want to walk into default arguments. */
11941 }
11945 /* Don't follow this nodes's type if a pointer for fear that
11946 we'll have infinite recursion. If we have a PSET, then we
11947 need not fear. */
11962 }
11965 }
11967 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11968 called with the DATA and the address of each sub-tree. If FUNC returns a
11969 non-NULL value, the traversal is stopped, and the value returned by FUNC
11970 is returned. If PSET is non-NULL it is used to record the nodes visited,
11971 and to avoid visiting a node more than once. */
11973 tree
11976 {
11979 tree result;
11981 #define WALK_SUBTREE_TAIL(NODE) \
11982 do \
11983 { \
11984 tp = & (NODE); \
11985 goto tail_recurse; \
11986 } \
11987 while (0)
11989 tail_recurse:
11990 /* Skip empty subtrees. */
11994 /* Don't walk the same tree twice, if the user has requested
11995 that we avoid doing so. */
11999 /* Call the function. */
12003 /* If we found something, return it. */
12009 /* Even if we didn't, FUNC may have decided that there was nothing
12010 interesting below this point in the tree. */
12012 {
12013 /* But we still need to check our siblings. */
12018 else
12020 }
12023 {
12027 }
12030 {
12043 /* None of these have subtrees other than those already walked
12044 above. */
12053 {
12059 /* Walk all elements but the first. */
12063 /* Now walk the first one as a tail call. */
12065 }
12072 {
12077 idx++)
12079 }
12086 {
12087 tree decl;
12089 {
12090 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12091 into declarations that are just mentioned, rather than
12092 declared; they don't really belong to this part of the tree.
12093 And, we can see cycles: the initializer for a declaration
12094 can refer to the declaration itself. */
12098 }
12100 }
12103 {
12104 tree_stmt_iterator i;
12107 }
12112 {
12115 /* FALLTHRU */
12160 /* FALLTHRU */
12195 {
12200 }
12220 {
12225 }
12229 }
12233 {
12236 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12237 But, we only want to walk once. */
12242 }
12245 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12246 defining. We only want to walk into these fields of a type in this
12247 case and not in the general case of a mere reference to the type.
12249 The criterion is as follows: if the field can be an expression, it
12250 must be walked only here. This should be in keeping with the fields
12251 that are directly gimplified in gimplify_type_sizes in order for the
12252 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12253 variable-sized types.
12255 Note that DECLs get walked as part of processing the BIND_EXPR. */
12257 {
12258 /* Call the function for the decl so e.g. copy_tree_body_r can
12259 replace it with the remapped one. */
12268 /* Call the function for the type. See if it returns anything or
12269 doesn't want us to continue. If we are to continue, walk both
12270 the normal fields and those for the declaration case. */
12275 /* But do not walk a pointed-to type since it may itself need to
12276 be walked in the declaration case if it isn't anonymous. */
12278 {
12282 }
12284 /* If this is a record type, also walk the fields. */
12286 {
12287 tree field;
12291 {
12292 /* We'd like to look at the type of the field, but we can
12293 easily get infinite recursion. So assume it's pointed
12294 to elsewhere in the tree. Also, ignore things that
12295 aren't fields. */
12304 }
12305 }
12307 /* Same for scalar types. */
12313 {
12316 }
12320 }
12321 /* FALLTHRU */
12325 {
12328 /* Walk over all the sub-trees of this operand. */
12331 /* Go through the subtrees. We need to do this in forward order so
12332 that the scope of a FOR_EXPR is handled properly. */
12334 {
12338 }
12339 }
12340 /* If this is a type, walk the needed fields in the type. */
12344 }
12346 /* We didn't find what we were looking for. */
12349 #undef WALK_SUBTREE_TAIL
12350 }
12351 #undef WALK_SUBTREE
12353 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12355 tree
12357 walk_tree_lh lh)
12358 {
12359 tree result;
12364 }
12367 tree
12369 {
12376 }
12378 void
12380 {
12384 {
12386 }
12387 else
12389 }
12391 /* Create a nameless artificial label and put it in the current
12392 function context. The label has a location of LOC. Returns the
12393 newly created label. */
12395 tree
12397 {
12405 }
12407 /* Given a tree, try to return a useful variable name that we can use
12408 to prefix a temporary that is being assigned the value of the tree.
12409 I.E. given <temp> = &A, return A. */
12413 {
12414 tree stripped_decl;
12421 {
12426 }
12427 else
12428 {
12430 {
12435 }
12436 }
12437 }
12439 /* Return true if TYPE has a variable argument list. */
12441 bool
12443 {
12444 function_args_iterator args_iter;
12451 {
12453 }
12456 }
12458 /* Return true if TYPE has a prototype. */
12460 bool
12462 {
12463 tree t;
12469 }
12471 /* If BLOCK is inlined from an __attribute__((__artificial__))
12472 routine, return pointer to location from where it has been
12473 called. */
12474 location_t *
12476 {
12481 {
12484 {
12485 /* If AO is an artificial inline, point RET to the
12486 call site locus at which it has been inlined and continue
12487 the loop, in case AO's caller is also an artificial
12488 inline. */
12492 else
12494 }
12499 }
12501 }
12504 /* If EXP is inlined from an __attribute__((__artificial__))
12505 function, return the location of the original call expression. */
12507 location_t
12509 {
12514 else
12516 }
12519 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12520 nodes. */
12522 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12524 hashval_t
12526 {
12534 {
12537 }
12542 else
12545 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12546 something else. */
12552 }
12554 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12555 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12556 same. */
12558 bool
12560 {
12573 else
12575 }
12577 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12579 tree
12581 {
12582 tree t;
12584 /* Use the cache of optimization nodes. */
12587 opts);
12592 {
12593 /* Insert this one into the hash table. */
12597 /* Make a new node for next time round. */
12599 }
12602 }
12604 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12606 tree
12608 {
12609 tree t;
12611 /* Use the cache of optimization nodes. */
12614 opts);
12619 {
12620 /* Insert this one into the hash table. */
12624 /* Make a new node for next time round. */
12626 }
12629 }
12631 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12632 so that they aren't saved during PCH writing. */
12634 void
12636 {
12641 }
12643 /* Determine the "ultimate origin" of a block. */
12645 tree
12647 {
12652 else
12653 {
12658 }
12659 }
12661 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12662 no instruction. */
12664 bool
12666 {
12667 /* Do not strip casts into or out of differing address spaces. */
12670 {
12675 }
12678 {
12679 /* We already know that outer_type is not a pointer with
12680 a non-generic address space. */
12682 }
12684 /* Use precision rather then machine mode when we can, which gives
12685 the correct answer even for submode (bit-field) types. */
12694 /* Otherwise fall back on comparing machine modes (e.g. for
12695 aggregate types, floats). */
12697 }
12699 /* Return true iff conversion in EXP generates no instruction. Mark
12700 it inline so that we fully inline into the stripping functions even
12701 though we have two uses of this function. */
12705 {
12720 }
12722 /* Return true iff conversion in EXP generates no instruction. Don't
12723 consider conversions changing the signedness. */
12725 static bool
12727 {
12738 }
12740 /* Strip conversions from EXP according to tree_nop_conversion and
12741 return the resulting expression. */
12743 tree
12745 {
12749 }
12751 /* Strip conversions from EXP according to tree_sign_nop_conversion
12752 and return the resulting expression. */
12754 tree
12756 {
12760 }
12762 /* Avoid any floating point extensions from EXP. */
12763 tree
12765 {
12768 /* For floating point constant look up the narrowest type that can hold
12769 it properly and handle it like (type)(narrowest_type)constant.
12770 This way we can optimize for instance a=a*2.0 where "a" is float
12771 but 2.0 is double constant. */
12773 {
12774 REAL_VALUE_TYPE orig;
12787 }
12806 }
12808 /* Strip out all handled components that produce invariant
12809 offsets. */
12811 const_tree
12813 {
12815 {
12817 {
12832 }
12834 }
12837 }
12841 /* Return the GCC personality function decl. */
12843 tree
12845 {
12849 }
12851 /* TARGET is a call target of GIMPLE call statement
12852 (obtained by gimple_call_fn). Return true if it is
12853 OBJ_TYPE_REF representing an virtual call of C++ method.
12854 (As opposed to OBJ_TYPE_REF representing objc calls
12855 through a cast where middle-end devirtualization machinery
12856 can't apply.) FOR_DUMP_P is true when being called from
12857 the dump routines. */
12859 bool
12861 {
12870 /* If we do not have BINFO associated, it means that type was built
12871 without devirtualization enabled. Do not consider this a virtual
12872 call. */
12876 }
12878 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12880 static tree
12882 {
12893 }
12895 /* Try to find a base info of BINFO that would have its field decl at offset
12896 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12897 found, return, otherwise return NULL_TREE. */
12899 tree
12901 {
12905 {
12907 tree fld;
12916 {
12924 }
12928 /* Offset 0 indicates the primary base, whose vtable contents are
12929 represented in the binfo for the derived class. */
12931 {
12933 /* Offsets in BINFO are in bytes relative to the whole structure
12934 while POS is in bits relative to the containing field. */
12941 {
12944 }
12947 else
12949 binfo_offset);
12950 }
12954 }
12955 }
12957 /* Returns true if X is a typedef decl. */
12959 bool
12961 {
12964 }
12966 /* Returns true iff TYPE is a type variant created for a typedef. */
12968 bool
12970 {
12972 }
12974 /* PR 84195: Replace control characters in "unescaped" with their
12975 escaped equivalents. Allow newlines if -fmessage-length has
12976 been set to a non-zero value. This is done here, rather than
12977 where the attribute is recorded as the message length can
12978 change between these two locations. */
12980 void
12982 {
13000 {
13004 {
13008 }
13011 {
13013 {
13014 /* We only allocate space for a new string if we
13015 actually encounter a control character that
13016 needs replacing. */
13020 }
13025 {
13034 }
13035 }
13038 }
13041 {
13045 }
13046 }
13048 /* Warn about a use of an identifier which was marked deprecated. Returns
13049 whether a warning was given. */
13051 bool
13053 {
13054 escaped_string msg;
13060 {
13064 {
13069 }
13070 }
13080 {
13081 auto_diagnostic_group d;
13085 else
13090 }
13092 {
13097 {
13103 }
13105 auto_diagnostic_group d;
13107 {
13111 else
13114 }
13115 else
13116 {
13120 else
13123 }
13127 }
13130 }
13132 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13133 somewhere in it. */
13135 bool
13137 {
13139 {
13144 }
13147 }
13149 /* Try to determine whether a TRY_CATCH expression can fall through.
13150 This is a subroutine of block_may_fallthru. */
13152 static bool
13154 {
13155 tree_stmt_iterator i;
13157 /* If the TRY block can fall through, the whole TRY_CATCH can
13158 fall through. */
13164 {
13166 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13167 catch expression and a body. The whole TRY_CATCH may fall
13168 through iff any of the catch bodies falls through. */
13170 {
13173 }
13177 /* The exception filter expression only matters if there is an
13178 exception. If the exception does not match EH_FILTER_TYPES,
13179 we will execute EH_FILTER_FAILURE, and we will fall through
13180 if that falls through. If the exception does match
13181 EH_FILTER_TYPES, the stack unwinder will continue up the
13182 stack, so we will not fall through. We don't know whether we
13183 will throw an exception which matches EH_FILTER_TYPES or not,
13184 so we just ignore EH_FILTER_TYPES and assume that we might
13185 throw an exception which doesn't match. */
13189 /* This case represents statements to be executed when an
13190 exception occurs. Those statements are implicitly followed
13191 by a RESX statement to resume execution after the exception.
13192 So in this case the TRY_CATCH never falls through. */
13194 }
13195 }
13197 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13198 need not be 100% accurate; simply be conservative and return true if we
13199 don't know. This is used only to avoid stupidly generating extra code.
13200 If we're wrong, we'll just delete the extra code later. */
13202 bool
13204 {
13205 /* This CONST_CAST is okay because expr_last returns its argument
13206 unmodified and we assign it to a const_tree. */
13210 {
13213 /* Easy cases. If the last statement of the block implies
13214 control transfer, then we can't fall through. */
13218 /* If there is a default: label or case labels cover all possible
13219 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13220 to some case label in all cases and all we care is whether the
13221 SWITCH_BODY falls through. */
13238 /* The finally clause is always executed after the try clause,
13239 so if it does not fall through, then the try-finally will not
13240 fall through. Otherwise, if the try clause does not fall
13241 through, then when the finally clause falls through it will
13242 resume execution wherever the try clause was going. So the
13243 whole try-finally will only fall through if both the try
13244 clause and the finally clause fall through. */
13254 else
13256 /* FALLTHRU */
13259 /* Functions that do not return do not fall through. */
13273 }
13274 }
13276 /* True if we are using EH to handle cleanups. */
13279 /* This routine is called from front ends to indicate eh should be used for
13280 cleanups. */
13281 void
13283 {
13285 }
13287 /* Query whether EH is used for cleanups. */
13288 bool
13290 {
13292 }
13294 /* Wrapper for tree_code_name to ensure that tree code is valid */
13297 {
13300 /* The tree_code enum promotes to signed, but we could be getting
13301 invalid values, so force an unsigned comparison. */
13303 {
13307 }
13310 }
13312 /* Drops the TREE_OVERFLOW flag from T. */
13314 tree
13316 {
13319 /* For tree codes with a sharing machinery re-build the result. */
13323 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13324 and canonicalize the result. */
13326 {
13327 tree_vector_builder builder;
13331 {
13336 }
13338 }
13340 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13341 and drop the flag. */
13345 /* For constants that contain nested constants, drop the flag
13346 from those as well. */
13348 {
13353 }
13356 }
13358 /* Given a memory reference expression T, return its base address.
13359 The base address of a memory reference expression is the main
13360 object being referenced. For instance, the base address for
13361 'array[i].fld[j]' is 'array'. You can think of this as stripping
13362 away the offset part from a memory address.
13364 This function calls handled_component_p to strip away all the inner
13365 parts of the memory reference until it reaches the base object. */
13367 tree
13369 {
13378 /* ??? Either the alias oracle or all callers need to properly deal
13379 with WITH_SIZE_EXPRs before we can look through those. */
13384 }
13386 /* Return a tree of sizetype representing the size, in bytes, of the element
13387 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13389 tree
13391 {
13396 /* If a size was specified in the ARRAY_REF, it's the size measured
13397 in alignment units of the element type. So multiply by that value. */
13399 {
13400 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13401 sizetype from another type of the same width and signedness. */
13406 }
13408 /* Otherwise, take the size from that of the element type. Substitute
13409 any PLACEHOLDER_EXPR that we have. */
13410 else
13412 }
13414 /* Return a tree representing the lower bound of the array mentioned in
13415 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13417 tree
13419 {
13422 /* If a lower bound is specified in EXP, use it. */
13426 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13427 substituting for a PLACEHOLDER_EXPR as needed. */
13431 /* Otherwise, return a zero of the appropriate type. */
13435 }
13437 /* Return a tree representing the upper bound of the array mentioned in
13438 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13440 tree
13442 {
13445 /* If there is a domain type and it has an upper bound, use it, substituting
13446 for a PLACEHOLDER_EXPR as needed. */
13450 /* Otherwise fail. */
13452 }
13454 /* Returns true if REF is an array reference, component reference,
13455 or memory reference to an array at the end of a structure.
13456 If this is the case, the array may be allocated larger
13457 than its upper bound implies. */
13459 bool
13461 {
13462 tree atype;
13466 {
13469 }
13474 {
13480 {
13482 {
13488 }
13489 else
13491 }
13492 else
13494 }
13495 else
13503 {
13504 /* If the reference chain contains a component reference to a
13505 non-union type and there follows another field the reference
13506 is not at the end of a structure. */
13508 {
13510 {
13516 }
13517 }
13518 /* If we have a multi-dimensional array we do not consider
13519 a non-innermost dimension as flex array if the whole
13520 multi-dimensional array is at struct end.
13521 Same for an array of aggregates with a trailing array
13522 member. */
13526 ;
13527 /* If we view an underlying object as sth else then what we
13528 gathered up to now is what we have to rely on. */
13531 else
13535 }
13537 /* The array now is at struct end. Treat flexible arrays as
13538 always subject to extend, even into just padding constrained by
13539 an underlying decl. */
13549 /* If the reference is based on a declared entity, the size of the array
13550 is constrained by its given domain. (Do not trust commons PR/69368). */
13552 && !(flag_unconstrained_commons
13556 {
13557 /* Check whether the array domain covers all of the available
13558 padding. */
13559 poly_int64 offset;
13567 /* If at least one extra element fits it is a flexarray. */
13576 }
13579 }
13581 /* Return a tree representing the offset, in bytes, of the field referenced
13582 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13584 tree
13586 {
13591 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13592 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13593 value. */
13595 {
13596 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13597 sizetype from another type of the same width and signedness. */
13603 }
13605 /* Otherwise, take the offset from that of the field. Substitute
13606 any PLACEHOLDER_EXPR that we have. */
13607 else
13609 }
13611 /* Given the initializer INIT, return the initializer for the field
13612 DECL if it exists, otherwise null. Used to obtain the initializer
13613 for a flexible array member and determine its size. */
13615 static tree
13617 {
13623 {
13628 {
13632 }
13633 }
13636 }
13638 /* Determines the size of the member referenced by the COMPONENT_REF
13639 REF, using its initializer expression if necessary in order to
13640 determine the size of an initialized flexible array member.
13641 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13642 an interior zero-length array.
13643 Returns the size as sizetype (which might be zero for an object
13644 with an uninitialized flexible array member) or null if the size
13645 cannot be determined. */
13647 tree
13649 {
13656 /* The object/argument referenced by the COMPONENT_REF and its type. */
13659 /* The referenced member. */
13664 {
13672 /* MEMBER is either an interior array or is an array with
13673 more than one element. */
13686 {
13690 /* MEMBER is an array with more than one element. */
13692 }
13694 /* For a refernce to a zero- or one-element array member of a union
13695 use the size of the union instead of the size of the member. */
13698 }
13700 /* MEMBER is either a bona fide flexible array member, or a zero-length
13701 array member, or an array of length one treated as such. */
13703 /* If the reference is to a declared object and the member a true
13704 flexible array, try to determine its size from its initializer. */
13708 {
13719 }
13721 /* BASE is the declared object of which MEMBER is either a member
13722 or that is cast to ARGTYPE (e.g., a char buffer used to store
13723 an ARGTYPE object). */
13726 /* Determine the base type of the referenced object. If it's
13727 the same as ARGTYPE and MEMBER has a known size, return it. */
13739 /* MEMBER is a true flexible array member. Compute its size from
13740 the initializer of the BASE object if it has one. */
13743 {
13746 {
13749 {
13750 /* Use the larger of the initializer size and the tail
13751 padding in the enclosing struct. */
13756 }
13759 }
13760 }
13763 {
13765 {
13770 /* The size of a flexible array member of an extern struct
13771 with no initializer cannot be determined (it's defined
13772 in another translation unit and can have an initializer
13773 with an arbitrary number of elements). */
13776 /* Use the size of the base struct or, for interior zero-length
13777 arrays, the size of the enclosing type. */
13779 }
13781 /* Use the size of the BASE object (possibly an array of some
13782 other type such as char used to store the struct). */
13784 else
13786 }
13788 /* If the flexible array member has a known size use the greater
13789 of it and the tail padding in the enclosing struct.
13790 Otherwise, when the size of the flexible array member is unknown
13791 and the referenced object is not a struct, use the size of its
13792 type when known. This detects sizes of array buffers when cast
13793 to struct types with flexible array members. */
13795 {
13798 {
13801 }
13803 }
13805 /* Return "don't know" for an external non-array object since its
13806 flexible array member can be initialized to have any number of
13807 elements. Otherwise, return zero because the flexible array
13808 member has no elements. */
13811 && (!typematch
13814 }
13816 /* Return the machine mode of T. For vectors, returns the mode of the
13817 inner type. The main use case is to feed the result to HONOR_NANS,
13818 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13820 machine_mode
13822 {
13828 }
13830 /* Vector types need to re-check the target flags each time we report
13831 the machine mode. We need to do this because attribute target can
13832 change the result of vector_mode_supported_p and have_regs_of_mode
13833 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13834 change on a per-function basis. */
13835 /* ??? Possibly a better solution is to run through all the types
13836 referenced by a function and re-compute the TYPE_MODE once, rather
13837 than make the TYPE_MODE macro call a function. */
13839 machine_mode
13841 {
13842 machine_mode mode;
13850 {
13851 scalar_int_mode innermode;
13853 /* For integers, try mapping it to a same-sized scalar mode. */
13855 {
13858 scalar_int_mode mode;
13862 }
13865 }
13868 }
13870 /* Return the size in bits of each element of vector type TYPE. */
13872 unsigned int
13874 {
13880 }
13882 /* Calculate the size in bits of each element of vector type TYPE
13883 and return the result as a tree of type bitsizetype. */
13885 tree
13887 {
13892 }
13894 /* Verify that basic properties of T match TV and thus T can be a variant of
13895 TV. TV should be the more specified variant (i.e. the main variant). */
13897 static bool
13899 {
13900 /* Type variant can differ by:
13902 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13903 ENCODE_QUAL_ADDR_SPACE.
13904 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13905 in this case some values may not be set in the variant types
13906 (see TYPE_COMPLETE_P checks).
13907 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13908 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13909 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13910 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13911 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13912 this is necessary to make it possible to merge types form different TUs
13913 - arrays, pointers and references may have TREE_TYPE that is a variant
13914 of TREE_TYPE of their main variants.
13915 - aggregates may have new TYPE_FIELDS list that list variants of
13916 the main variant TYPE_FIELDS.
13917 - vector types may differ by TYPE_VECTOR_OPAQUE
13918 */
13920 /* Convenience macro for matching individual fields. */
13921 #define verify_variant_match(flag) \
13922 do { \
13923 if (flag (tv) != flag (t)) \
13924 { \
13926 debug_tree (tv); \
13927 return false; \
13928 } \
13929 } while (false)
13931 /* tree_base checks. */
13934 /* FIXME: Ada builds non-artificial variants of artificial types. */
13939 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13946 else
13948 /* FIXME: This check trigger during libstdc++ build. */
13952 /* tree_type_common checks. */
13955 {
13963 {
13973 }
13975 }
13981 /* During LTO we merge variant lists from diferent translation units
13982 that may differ BY TYPE_CONTEXT that in turn may point
13983 to TRANSLATION_UNIT_DECL.
13984 Ada also builds variants of types with different TYPE_CONTEXT. */
13992 {
13996 }
13998 /* tree_type_non_common checks. */
14000 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14001 and dangle the pointer from time to time. */
14005 {
14009 }
14015 {
14018 }
14025 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14026 or even type's main variant. This is needed to make bootstrap pass
14027 and the bug seems new in GCC 5.
14028 C++ FE should be updated to make this consistent and we should check
14029 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14030 is a match with main variant.
14032 Also disable the check for Java for now because of parser hack that builds
14033 first an dummy BINFO and then sometimes replace it by real BINFO in some
14034 of the copies. */
14037 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14038 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14039 at LTO time only. */
14041 {
14049 }
14051 /* Check various uses of TYPE_VALUES_RAW. */
14057 /* Permit incomplete variants of complete type. While FEs may complete
14058 all variants, this does not happen for C++ templates in all cases. */
14062 {
14065 /* Fortran builds qualified variants as new records with items of
14066 qualified type. Verify that they looks same. */
14073 /* FIXME: gfc_nonrestricted_type builds all types as variants
14074 with exception of pointer types. It deeply copies the type
14075 which means that we may end up with a variant type
14076 referring non-variant pointer. We may change it to
14077 produce types as variants, too, like
14078 objc_get_protocol_qualified_type does. */
14084 {
14092 }
14093 }
14096 /* For C++ the qualified variant of array type is really an array type
14097 of qualified TREE_TYPE.
14098 objc builds variants of pointer where pointer to type is a variant, too
14099 in objc_get_protocol_qualified_type. */
14105 {
14113 }
14116 {
14124 }
14126 #undef verify_variant_match
14127 }
14130 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14131 the middle-end types_compatible_p function. It needs to avoid
14132 claiming types are different for types that should be treated
14133 the same with respect to TBAA. Canonical types are also used
14134 for IL consistency checks via the useless_type_conversion_p
14135 predicate which does not handle all type kinds itself but falls
14136 back to pointer-comparison of TYPE_CANONICAL for aggregates
14137 for example. */
14139 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14140 type calculation because we need to allow inter-operability between signed
14141 and unsigned variants. */
14143 bool
14145 {
14146 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14147 signed char and unsigned char. Similarly fortran FE builds
14148 C_SIZE_T as signed type, while C defines it unsigned. */
14151 == INTEGER_TYPE
14154 }
14156 /* Return true iff T1 and T2 are structurally identical for what
14157 TBAA is concerned.
14158 This function is used both by lto.c canonical type merging and by the
14159 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14160 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14161 only for LTO because only in these cases TYPE_CANONICAL equivalence
14162 correspond to one defined by gimple_canonical_types_compatible_p. */
14164 bool
14167 {
14168 /* Type variants should be same as the main variant. When not doing sanity
14169 checking to verify this fact, go to main variants and save some work. */
14171 {
14174 }
14176 /* Check first for the obvious case of pointer identity. */
14180 /* Check that we have two types to compare. */
14184 /* We consider complete types always compatible with incomplete type.
14185 This does not make sense for canonical type calculation and thus we
14186 need to ensure that we are never called on it.
14188 FIXME: For more correctness the function probably should have three modes
14189 1) mode assuming that types are complete mathcing their structure
14190 2) mode allowing incomplete types but producing equivalence classes
14191 and thus ignoring all info from complete types
14192 3) mode allowing incomplete types to match complete but checking
14193 compatibility between complete types.
14195 1 and 2 can be used for canonical type calculation. 3 is the real
14196 definition of type compatibility that can be used i.e. for warnings during
14197 declaration merging. */
14202 /* If the types have been previously registered and found equal
14203 they still are. */
14207 {
14208 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14209 they are always NULL, but they are set to non-NULL for types
14210 constructed by build_pointer_type and variants. In this case the
14211 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14212 all pointers are considered equal. Be sure to not return false
14213 negatives. */
14217 }
14219 /* For types where we do ODR based TBAA the canonical type is always
14220 set correctly, so we know that types are different if their
14221 canonical types does not match. */
14227 /* Can't be the same type if the types don't have the same code. */
14232 /* Qualifiers do not matter for canonical type comparison purposes. */
14234 /* Void types and nullptr types are always the same. */
14239 /* Can't be the same type if they have different mode. */
14243 /* Non-aggregate types can be handled cheaply. */
14251 {
14252 /* Can't be the same type if they have different recision. */
14256 /* In some cases the signed and unsigned types are required to be
14257 inter-operable. */
14262 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14263 interoperable with "signed char". Unless all frontends are revisited
14264 to agree on these types, we must ignore the flag completely. */
14266 /* Fortran standard define C_PTR type that is compatible with every
14267 C pointer. For this reason we need to glob all pointers into one.
14268 Still pointers in different address spaces are not compatible. */
14270 {
14274 }
14276 /* Tail-recurse to components. */
14281 trust_type_canonical);
14284 }
14286 /* Do type-specific comparisons. */
14288 {
14290 /* Array types are the same if the element types are the same and
14291 the number of elements are the same. */
14293 trust_type_canonical)
14298 else
14299 {
14303 /* For an incomplete external array, the type domain can be
14304 NULL_TREE. Check this condition also. */
14309 else
14310 {
14316 /* The minimum/maximum values have to be the same. */
14328 else
14330 }
14331 }
14335 /* Function types are the same if the return type and arguments types
14336 are the same. */
14338 trust_type_canonical))
14343 else
14344 {
14350 {
14353 trust_type_canonical))
14355 }
14361 }
14366 {
14369 /* Don't try to compare variants of an incomplete type, before
14370 TYPE_FIELDS has been copied around. */
14378 /* For aggregate types, all the fields must be the same. */
14382 {
14383 /* Skip non-fields and zero-sized fields. */
14394 /* The fields must have the same name, offset and type. */
14397 || !gimple_canonical_types_compatible_p
14399 trust_type_canonical))
14401 }
14403 /* If one aggregate has more fields than the other, they
14404 are not the same. */
14409 }
14412 /* Consider all types with language specific trees in them mutually
14413 compatible. This is executed only from verify_type and false
14414 positives can be tolerated. */
14417 }
14418 }
14420 /* Verify type T. */
14422 void
14424 {
14428 {
14431 }
14433 {
14437 }
14443 ;
14445 {
14449 }
14450 /* Method and function types cannot be used to address memory and thus
14451 TYPE_CANONICAL really matters only for determining useless conversions.
14453 FIXME: C++ FE produce declarations of builtin functions that are not
14454 compatible with main variants. */
14456 ;
14458 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14459 with variably sized arrays because their sizes possibly
14460 gimplified to different variables. */
14464 {
14468 }
14472 {
14476 }
14478 {
14483 }
14486 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14488 {
14489 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14490 and danagle the pointer from time to time. */
14494 {
14498 }
14499 }
14501 {
14504 {
14508 }
14509 }
14511 {
14514 {
14518 }
14519 }
14522 {
14523 /* FIXME: The following check should pass:
14524 useless_type_conversion_p (const_cast <tree> (t),
14525 TREE_TYPE (TYPE_MIN_VALUE (t))
14526 but does not for C sizetypes in LTO. */
14527 }
14529 /* Check various uses of TYPE_MAXVAL_RAW. */
14531 {
14533 ;
14535 {
14539 }
14541 {
14545 }
14546 }
14548 {
14552 {
14556 }
14557 }
14559 {
14563 {
14567 }
14568 }
14571 {
14572 /* FIXME: The following check should pass:
14573 useless_type_conversion_p (const_cast <tree> (t),
14574 TREE_TYPE (TYPE_MAX_VALUE (t))
14575 but does not for C sizetypes in LTO. */
14576 }
14578 {
14581 {
14585 }
14586 }
14588 {
14592 }
14595 {
14599 }
14601 /* Check various uses of TYPE_VALUES_RAW. */
14604 {
14608 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14609 CONST_DECL of ENUMERAL TYPE. */
14611 {
14616 }
14619 {
14625 }
14627 {
14632 }
14633 }
14635 {
14637 {
14641 }
14642 }
14644 {
14646 {
14649 }
14651 {
14652 /* TODO: verify properties of decls. */
14654 ;
14656 ;
14658 ;
14660 ;
14662 ;
14664 ;
14666 ;
14667 else
14668 {
14672 }
14673 }
14674 }
14681 {
14683 {
14688 }
14690 {
14694 }
14695 /* Verify just enough of cache to ensure that no one copied it to new type.
14696 All copying should go by copy_node that should clear it. */
14698 {
14703 {
14708 }
14709 }
14710 }
14713 {
14714 /* C++ FE uses TREE_PURPOSE to store initial values. */
14716 {
14720 }
14722 {
14726 }
14727 }
14729 {
14733 }
14741 {
14744 }
14746 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14747 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14748 of a type. */
14751 {
14754 }
14757 {
14760 }
14761 }
14764 /* Return 1 if ARG interpreted as signed in its precision is known to be
14765 always positive or 2 if ARG is known to be always negative, or 3 if
14766 ARG may be positive or negative. */
14768 int
14770 {
14777 {
14781 else
14783 }
14787 {
14789 /* Narrower value zero extended into wider type
14790 will always result in positive values. */
14797 }
14803 {
14807 {
14811 {
14820 }
14821 }
14823 }
14825 {
14826 /* For unsigned values, the "positive" range comes
14827 below the "negative" range. */
14832 }
14833 else
14834 {
14839 }
14841 }
14846 /* Return true if ARG is marked with the nonnull attribute in the
14847 current function signature. */
14849 bool
14851 {
14859 /* The static chain decl is always non null. */
14863 /* THIS argument of method is always non-NULL. */
14869 /* Values passed by reference are always non-NULL. */
14876 {
14879 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14883 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14887 /* Get the position number for ARG in the function signature. */
14889 t;
14891 {
14894 }
14898 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14900 {
14903 }
14904 }
14907 }
14909 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14910 information. */
14912 location_t
14914 {
14918 }
14920 location_t
14922 {
14923 source_range src_range;
14927 }
14929 location_t
14931 {
14937 pure_loc,
14938 src_range,
14939 NULL);
14942 }
14944 /* Return EXPR, potentially wrapped with a node expression LOC,
14945 if !CAN_HAVE_LOCATION_P (expr).
14947 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14948 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14950 Wrapper nodes can be identified using location_wrapper_p. */
14952 tree
14954 {
14961 /* We should only be adding wrappers for constants and for decls,
14962 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14967 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14968 any impact of the wrapper nodes. */
14972 /* If any auto_suppress_location_wrappers are active, don't create
14973 wrappers. */
14977 tree_code code
14982 /* Mark this node as being a wrapper. */
14985 }
14989 /* Return the name of combined function FN, for debugging purposes. */
14993 {
14995 {
14998 }
14999 else
15001 }
15003 /* Return a bitmap with a bit set corresponding to each argument in
15004 a function call type FNTYPE declared with attribute nonnull,
15005 or null if none of the function's argument are nonnull. The caller
15006 must free the bitmap. */
15008 bitmap
15010 {
15016 {
15017 /* The this pointer in C++ non-static member functions is
15018 implicitly nonnull whether or not it's declared as such. */
15021 }
15027 /* A function declaration can specify multiple attribute nonnull,
15028 each with zero or more arguments. The loop below creates a bitmap
15029 representing a union of all the arguments. An empty (but non-null)
15030 bitmap means that all arguments have been declaraed nonnull. */
15032 {
15041 {
15042 /* Clear the bitmap in case a previous attribute nonnull
15043 set it and this one overrides it for all arguments. */
15046 }
15048 /* Iterate over the indices of the format arguments declared nonnull
15049 and set a bit for each. */
15051 {
15054 }
15055 }
15058 }
15060 /* Returns true if TYPE is a type where it and all of its subobjects
15061 (recursively) are of structure, union, or array type. */
15063 static bool
15065 {
15067 {
15074 }
15080 }
15082 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15083 that shouldn't be passed via stack. */
15085 bool
15087 {
15098 }
15100 /* Determine whether TYPE is a structure with a flexible array member,
15101 or a union containing such a structure (possibly recursively). */
15103 bool
15105 {
15108 {
15124 {
15128 }
15132 }
15133 }
15135 /* Like int_size_in_bytes, but handle empty records specially. */
15137 HOST_WIDE_INT
15139 {
15141 }
15143 /* Like size_in_bytes, but handle empty records specially. */
15145 tree
15147 {
15149 }
15151 /* Return true if an expression with CODE has to have the same result type as
15152 its first operand. */
15154 bool
15156 {
15158 {
15192 }
15193 }
15195 /* Return a typenode for the "standard" C type with a given name. */
15196 tree
15198 {
15230 }
15232 /* List of pointer types used to declare builtins before we have seen their
15233 real declaration.
15235 Keep the size up to date in tree.h ! */
15237 {
15244 };
15246 /* Return the maximum object size. */
15248 tree
15250 {
15251 /* To do: Make this a configurable parameter. */
15253 }
15255 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15256 parameter default to false and that weeds out error_mark_node. */
15258 bool
15261 {
15268 }
15270 #if CHECKING_P
15274 /* Selftests for tree. */
15276 /* Verify that integer constants are sane. */
15278 static void
15280 {
15293 }
15295 /* Verify identifiers. */
15297 static void
15299 {
15303 }
15305 /* Verify LABEL_DECL. */
15307 static void
15309 {
15315 }
15317 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15318 are given by VALS. */
15320 static tree
15322 {
15327 }
15329 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15331 static void
15333 {
15339 }
15341 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15342 and that its elements match EXPECTED. */
15344 static void
15347 {
15354 }
15356 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15357 and NPATTERNS background elements, and that its elements match
15358 EXPECTED. */
15360 static void
15363 {
15370 }
15372 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15373 and that its elements match EXPECTED. */
15375 static void
15378 {
15385 }
15387 /* Test the creation of VECTOR_CSTs. */
15389 static void
15391 {
15397 /* Test a simple linear series with a base of 0 and a step of 1:
15398 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15404 /* Try the same with the first element replaced by 100:
15405 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15410 /* Try a series that wraps around.
15411 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15417 /* Try a downward series:
15418 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15424 /* Try two interleaved series with different bases and steps:
15425 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15428 {
15431 }
15435 /* Try a duplicated value:
15436 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15442 /* Try an interleaved duplicated value:
15443 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15450 /* Try a duplicated value with 2 exceptions
15451 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15457 /* Try with and without a step
15458 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15464 /* Try a fully-general constant:
15465 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15469 }
15471 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15472 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15473 modifying its argument in-place. */
15475 static void
15477 {
15480 }
15482 /* Verify location wrappers. */
15484 static void
15486 {
15491 /* Wrapping a constant. */
15501 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15504 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15509 /* Wrapping a STRING_CST. */
15521 /* Wrapping a variable. */
15524 integer_type_node);
15533 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15534 wrapper. */
15539 /* Verify that STRIP_NOPS removes wrappers. */
15543 }
15545 /* Test various tree predicates. Verify that location wrappers don't
15546 affect the results. */
15548 static void
15550 {
15551 /* Build various constants and wrappers around them. */
15579 /* TODO: vector constants. */
15581 /* Test integer_onep. */
15601 /* Test integer_zerop. */
15621 /* Test integer_all_onesp. */
15641 /* Test integer_minus_onep. */
15661 /* Test integer_each_onep. */
15681 /* Test integer_truep. */
15701 /* Test integer_nonzerop. */
15721 /* Test real_zerop. */
15741 /* Test real_onep. */
15761 /* Test real_minus_onep. */
15781 /* Test zerop. */
15801 /* Test tree_expr_nonnegative_p. */
15821 /* Test tree_expr_nonzero_p. */
15829 /* Test integer_valued_real_p. */
15836 /* Test integer_pow2p. */
15841 /* Test uniform_integer_cst_p. */
15860 }
15862 /* Check that string escaping works correctly. */
15864 static void
15866 {
15868 escaped_string msg;
15871 /* ASSERT_STREQ does not accept NULL as a valid test
15872 result, so we have to use ASSERT_EQ instead. */
15881 /* Ensure that we have -fmessage-length set to 0. */
15891 /* Now repeat the tests with -fmessage-length set to 5. */
15894 /* Note that the newline is not translated into an escape. */
15901 /* Restore the original message length setting. */
15903 }
15905 /* Run all of the selftests within this file. */
15907 void
15909 {
15917 }