1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
54 /* Each tree code class has an associated string representation.
55 These must correspond to the tree_code_class entries. */
57 const char *const tree_code_class_strings[] =
71 /* obstack.[ch] explicitly declined to prototype this. */
72 extern int _obstack_allocated_p (struct obstack *h, void *obj);
74 #ifdef GATHER_STATISTICS
75 /* Statistics-gathering stuff. */
77 int tree_node_counts[(int) all_kinds];
78 int tree_node_sizes[(int) all_kinds];
80 /* Keep in sync with tree.h:enum tree_node_kind. */
81 static const char * const tree_node_kind_names[] = {
101 #endif /* GATHER_STATISTICS */
103 /* Unique id for next decl created. */
104 static GTY(()) int next_decl_uid;
105 /* Unique id for next type created. */
106 static GTY(()) int next_type_uid = 1;
108 /* Since we cannot rehash a type after it is in the table, we have to
109 keep the hash code. */
111 struct type_hash GTY(())
117 /* Initial size of the hash table (rounded to next prime). */
118 #define TYPE_HASH_INITIAL_SIZE 1000
120 /* Now here is the hash table. When recording a type, it is added to
121 the slot whose index is the hash code. Note that the hash table is
122 used for several kinds of types (function types, array types and
123 array index range types, for now). While all these live in the
124 same table, they are completely independent, and the hash code is
125 computed differently for each of these. */
127 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
128 htab_t type_hash_table;
130 /* Hash table and temporary node for larger integer const values. */
131 static GTY (()) tree int_cst_node;
132 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
133 htab_t int_cst_hash_table;
135 /* General tree->tree mapping structure for use in hash tables. */
138 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
139 htab_t debug_expr_for_decl;
141 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
142 htab_t value_expr_for_decl;
144 static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map)))
145 htab_t init_priority_for_decl;
147 struct tree_int_map GTY(())
152 static unsigned int tree_int_map_hash (const void *);
153 static int tree_int_map_eq (const void *, const void *);
154 static int tree_int_map_marked_p (const void *);
155 static void set_type_quals (tree, int);
156 static int type_hash_eq (const void *, const void *);
157 static hashval_t type_hash_hash (const void *);
158 static hashval_t int_cst_hash_hash (const void *);
159 static int int_cst_hash_eq (const void *, const void *);
160 static void print_type_hash_statistics (void);
161 static void print_debug_expr_statistics (void);
162 static void print_value_expr_statistics (void);
163 static tree make_vector_type (tree, int, enum machine_mode);
164 static int type_hash_marked_p (const void *);
165 static unsigned int type_hash_list (tree, hashval_t);
166 static unsigned int attribute_hash_list (tree, hashval_t);
168 tree global_trees[TI_MAX];
169 tree integer_types[itk_none];
171 unsigned char tree_contains_struct[256][64];
179 /* Initialize the hash table of types. */
180 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
183 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
186 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
188 init_priority_for_decl = htab_create_ggc (512, tree_int_map_hash,
191 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
192 int_cst_hash_eq, NULL);
194 int_cst_node = make_node (INTEGER_CST);
196 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
197 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
198 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
201 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
202 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
203 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
204 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
205 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
206 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
207 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
208 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
209 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
212 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
213 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
214 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
215 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
216 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
217 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
219 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
220 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
221 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
222 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
223 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
224 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
225 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
226 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
227 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
229 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
230 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
231 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
232 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
234 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
235 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
236 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
237 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
238 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
239 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
240 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
241 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
243 lang_hooks.init_ts ();
247 /* The name of the object as the assembler will see it (but before any
248 translations made by ASM_OUTPUT_LABELREF). Often this is the same
249 as DECL_NAME. It is an IDENTIFIER_NODE. */
251 decl_assembler_name (tree decl)
253 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
254 lang_hooks.set_decl_assembler_name (decl);
255 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
258 /* Compute the number of bytes occupied by a tree with code CODE.
259 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
260 codes, which are of variable length. */
262 tree_code_size (enum tree_code code)
264 switch (TREE_CODE_CLASS (code))
266 case tcc_declaration: /* A decl node */
271 return sizeof (struct tree_field_decl);
273 return sizeof (struct tree_parm_decl);
275 return sizeof (struct tree_var_decl);
277 return sizeof (struct tree_label_decl);
279 return sizeof (struct tree_result_decl);
281 return sizeof (struct tree_const_decl);
283 return sizeof (struct tree_type_decl);
285 return sizeof (struct tree_function_decl);
287 return sizeof (struct tree_decl_non_common);
291 case tcc_type: /* a type node */
292 return sizeof (struct tree_type);
294 case tcc_reference: /* a reference */
295 case tcc_expression: /* an expression */
296 case tcc_statement: /* an expression with side effects */
297 case tcc_comparison: /* a comparison expression */
298 case tcc_unary: /* a unary arithmetic expression */
299 case tcc_binary: /* a binary arithmetic expression */
300 return (sizeof (struct tree_exp)
301 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
303 case tcc_constant: /* a constant */
306 case INTEGER_CST: return sizeof (struct tree_int_cst);
307 case REAL_CST: return sizeof (struct tree_real_cst);
308 case COMPLEX_CST: return sizeof (struct tree_complex);
309 case VECTOR_CST: return sizeof (struct tree_vector);
310 case STRING_CST: gcc_unreachable ();
312 return lang_hooks.tree_size (code);
315 case tcc_exceptional: /* something random, like an identifier. */
318 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
319 case TREE_LIST: return sizeof (struct tree_list);
322 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
325 case PHI_NODE: gcc_unreachable ();
327 case SSA_NAME: return sizeof (struct tree_ssa_name);
329 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
330 case BLOCK: return sizeof (struct tree_block);
331 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
332 case CONSTRUCTOR: return sizeof (struct tree_constructor);
335 return lang_hooks.tree_size (code);
343 /* Compute the number of bytes occupied by NODE. This routine only
344 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
346 tree_size (tree node)
348 enum tree_code code = TREE_CODE (node);
352 return (sizeof (struct tree_phi_node)
353 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
356 return (offsetof (struct tree_binfo, base_binfos)
357 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
360 return (sizeof (struct tree_vec)
361 + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *));
364 return sizeof (struct tree_string) + TREE_STRING_LENGTH (node) - 1;
367 return tree_code_size (code);
371 /* Return a newly allocated node of code CODE. For decl and type
372 nodes, some other fields are initialized. The rest of the node is
373 initialized to zero. This function cannot be used for PHI_NODE or
374 TREE_VEC nodes, which is enforced by asserts in tree_code_size.
376 Achoo! I got a code in the node. */
379 make_node_stat (enum tree_code code MEM_STAT_DECL)
382 enum tree_code_class type = TREE_CODE_CLASS (code);
383 size_t length = tree_code_size (code);
384 #ifdef GATHER_STATISTICS
389 case tcc_declaration: /* A decl node */
393 case tcc_type: /* a type node */
397 case tcc_statement: /* an expression with side effects */
401 case tcc_reference: /* a reference */
405 case tcc_expression: /* an expression */
406 case tcc_comparison: /* a comparison expression */
407 case tcc_unary: /* a unary arithmetic expression */
408 case tcc_binary: /* a binary arithmetic expression */
412 case tcc_constant: /* a constant */
416 case tcc_exceptional: /* something random, like an identifier. */
419 case IDENTIFIER_NODE:
436 kind = ssa_name_kind;
457 tree_node_counts[(int) kind]++;
458 tree_node_sizes[(int) kind] += length;
461 if (code == IDENTIFIER_NODE)
462 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
464 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
466 memset (t, 0, length);
468 TREE_SET_CODE (t, code);
473 TREE_SIDE_EFFECTS (t) = 1;
476 case tcc_declaration:
477 if (code != FUNCTION_DECL)
479 DECL_USER_ALIGN (t) = 0;
480 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
481 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
482 /* We have not yet computed the alias set for this declaration. */
483 DECL_POINTER_ALIAS_SET (t) = -1;
484 DECL_SOURCE_LOCATION (t) = input_location;
485 DECL_UID (t) = next_decl_uid++;
490 TYPE_UID (t) = next_type_uid++;
491 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
492 TYPE_USER_ALIGN (t) = 0;
493 TYPE_MAIN_VARIANT (t) = t;
495 /* Default to no attributes for type, but let target change that. */
496 TYPE_ATTRIBUTES (t) = NULL_TREE;
497 targetm.set_default_type_attributes (t);
499 /* We have not yet computed the alias set for this type. */
500 TYPE_ALIAS_SET (t) = -1;
504 TREE_CONSTANT (t) = 1;
505 TREE_INVARIANT (t) = 1;
514 case PREDECREMENT_EXPR:
515 case PREINCREMENT_EXPR:
516 case POSTDECREMENT_EXPR:
517 case POSTINCREMENT_EXPR:
518 /* All of these have side-effects, no matter what their
520 TREE_SIDE_EFFECTS (t) = 1;
529 /* Other classes need no special treatment. */
536 /* Return a new node with the same contents as NODE except that its
537 TREE_CHAIN is zero and it has a fresh uid. */
540 copy_node_stat (tree node MEM_STAT_DECL)
543 enum tree_code code = TREE_CODE (node);
546 gcc_assert (code != STATEMENT_LIST);
548 length = tree_size (node);
549 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
550 memcpy (t, node, length);
553 TREE_ASM_WRITTEN (t) = 0;
554 TREE_VISITED (t) = 0;
557 if (TREE_CODE_CLASS (code) == tcc_declaration)
559 DECL_UID (t) = next_decl_uid++;
560 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
561 && DECL_HAS_VALUE_EXPR_P (node))
563 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
564 DECL_HAS_VALUE_EXPR_P (t) = 1;
566 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
568 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
569 DECL_HAS_INIT_PRIORITY_P (t) = 1;
573 else if (TREE_CODE_CLASS (code) == tcc_type)
575 TYPE_UID (t) = next_type_uid++;
576 /* The following is so that the debug code for
577 the copy is different from the original type.
578 The two statements usually duplicate each other
579 (because they clear fields of the same union),
580 but the optimizer should catch that. */
581 TYPE_SYMTAB_POINTER (t) = 0;
582 TYPE_SYMTAB_ADDRESS (t) = 0;
584 /* Do not copy the values cache. */
585 if (TYPE_CACHED_VALUES_P(t))
587 TYPE_CACHED_VALUES_P (t) = 0;
588 TYPE_CACHED_VALUES (t) = NULL_TREE;
595 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
596 For example, this can copy a list made of TREE_LIST nodes. */
599 copy_list (tree list)
607 head = prev = copy_node (list);
608 next = TREE_CHAIN (list);
611 TREE_CHAIN (prev) = copy_node (next);
612 prev = TREE_CHAIN (prev);
613 next = TREE_CHAIN (next);
619 /* Create an INT_CST node with a LOW value sign extended. */
622 build_int_cst (tree type, HOST_WIDE_INT low)
624 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
627 /* Create an INT_CST node with a LOW value zero extended. */
630 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
632 return build_int_cst_wide (type, low, 0);
635 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
636 if it is negative. This function is similar to build_int_cst, but
637 the extra bits outside of the type precision are cleared. Constants
638 with these extra bits may confuse the fold so that it detects overflows
639 even in cases when they do not occur, and in general should be avoided.
640 We cannot however make this a default behavior of build_int_cst without
641 more intrusive changes, since there are parts of gcc that rely on the extra
642 precision of the integer constants. */
645 build_int_cst_type (tree type, HOST_WIDE_INT low)
647 unsigned HOST_WIDE_INT val = (unsigned HOST_WIDE_INT) low;
648 unsigned HOST_WIDE_INT hi, mask;
654 type = integer_type_node;
656 bits = TYPE_PRECISION (type);
657 signed_p = !TYPE_UNSIGNED (type);
659 if (bits >= HOST_BITS_PER_WIDE_INT)
660 negative = (low < 0);
663 /* If the sign bit is inside precision of LOW, use it to determine
664 the sign of the constant. */
665 negative = ((val >> (bits - 1)) & 1) != 0;
667 /* Mask out the bits outside of the precision of the constant. */
668 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
670 if (signed_p && negative)
676 /* Determine the high bits. */
677 hi = (negative ? ~(unsigned HOST_WIDE_INT) 0 : 0);
679 /* For unsigned type we need to mask out the bits outside of the type
683 if (bits <= HOST_BITS_PER_WIDE_INT)
687 bits -= HOST_BITS_PER_WIDE_INT;
688 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
693 return build_int_cst_wide (type, val, hi);
696 /* These are the hash table functions for the hash table of INTEGER_CST
697 nodes of a sizetype. */
699 /* Return the hash code code X, an INTEGER_CST. */
702 int_cst_hash_hash (const void *x)
706 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
707 ^ htab_hash_pointer (TREE_TYPE (t)));
710 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
711 is the same as that given by *Y, which is the same. */
714 int_cst_hash_eq (const void *x, const void *y)
719 return (TREE_TYPE (xt) == TREE_TYPE (yt)
720 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
721 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
724 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
725 integer_type_node is used. The returned node is always shared.
726 For small integers we use a per-type vector cache, for larger ones
727 we use a single hash table. */
730 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
737 type = integer_type_node;
739 switch (TREE_CODE (type))
743 /* Cache NULL pointer. */
752 /* Cache false or true. */
761 if (TYPE_UNSIGNED (type))
764 limit = INTEGER_SHARE_LIMIT;
765 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
771 limit = INTEGER_SHARE_LIMIT + 1;
772 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
774 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
784 /* Look for it in the type's vector of small shared ints. */
785 if (!TYPE_CACHED_VALUES_P (type))
787 TYPE_CACHED_VALUES_P (type) = 1;
788 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
791 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
794 /* Make sure no one is clobbering the shared constant. */
795 gcc_assert (TREE_TYPE (t) == type);
796 gcc_assert (TREE_INT_CST_LOW (t) == low);
797 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
801 /* Create a new shared int. */
802 t = make_node (INTEGER_CST);
804 TREE_INT_CST_LOW (t) = low;
805 TREE_INT_CST_HIGH (t) = hi;
806 TREE_TYPE (t) = type;
808 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
813 /* Use the cache of larger shared ints. */
816 TREE_INT_CST_LOW (int_cst_node) = low;
817 TREE_INT_CST_HIGH (int_cst_node) = hi;
818 TREE_TYPE (int_cst_node) = type;
820 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
824 /* Insert this one into the hash table. */
827 /* Make a new node for next time round. */
828 int_cst_node = make_node (INTEGER_CST);
835 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
836 and the rest are zeros. */
839 build_low_bits_mask (tree type, unsigned bits)
841 unsigned HOST_WIDE_INT low;
843 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
845 gcc_assert (bits <= TYPE_PRECISION (type));
847 if (bits == TYPE_PRECISION (type)
848 && !TYPE_UNSIGNED (type))
850 /* Sign extended all-ones mask. */
854 else if (bits <= HOST_BITS_PER_WIDE_INT)
856 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
861 bits -= HOST_BITS_PER_WIDE_INT;
863 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
866 return build_int_cst_wide (type, low, high);
869 /* Checks that X is integer constant that can be expressed in (unsigned)
870 HOST_WIDE_INT without loss of precision. */
873 cst_and_fits_in_hwi (tree x)
875 if (TREE_CODE (x) != INTEGER_CST)
878 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
881 return (TREE_INT_CST_HIGH (x) == 0
882 || TREE_INT_CST_HIGH (x) == -1);
885 /* Return a new VECTOR_CST node whose type is TYPE and whose values
886 are in a list pointed to by VALS. */
889 build_vector (tree type, tree vals)
891 tree v = make_node (VECTOR_CST);
892 int over1 = 0, over2 = 0;
895 TREE_VECTOR_CST_ELTS (v) = vals;
896 TREE_TYPE (v) = type;
898 /* Iterate through elements and check for overflow. */
899 for (link = vals; link; link = TREE_CHAIN (link))
901 tree value = TREE_VALUE (link);
903 over1 |= TREE_OVERFLOW (value);
904 over2 |= TREE_CONSTANT_OVERFLOW (value);
907 TREE_OVERFLOW (v) = over1;
908 TREE_CONSTANT_OVERFLOW (v) = over2;
913 /* Return a new VECTOR_CST node whose type is TYPE and whose values
914 are extracted from V, a vector of CONSTRUCTOR_ELT. */
917 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
919 tree list = NULL_TREE;
920 unsigned HOST_WIDE_INT idx;
923 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
924 list = tree_cons (NULL_TREE, value, list);
925 return build_vector (type, nreverse (list));
928 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
929 are in the VEC pointed to by VALS. */
931 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
933 tree c = make_node (CONSTRUCTOR);
934 TREE_TYPE (c) = type;
935 CONSTRUCTOR_ELTS (c) = vals;
939 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
942 build_constructor_single (tree type, tree index, tree value)
944 VEC(constructor_elt,gc) *v;
945 constructor_elt *elt;
947 v = VEC_alloc (constructor_elt, gc, 1);
948 elt = VEC_quick_push (constructor_elt, v, NULL);
952 return build_constructor (type, v);
956 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
957 are in a list pointed to by VALS. */
959 build_constructor_from_list (tree type, tree vals)
962 VEC(constructor_elt,gc) *v = NULL;
966 v = VEC_alloc (constructor_elt, gc, list_length (vals));
967 for (t = vals; t; t = TREE_CHAIN (t))
969 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
970 elt->index = TREE_PURPOSE (t);
971 elt->value = TREE_VALUE (t);
975 return build_constructor (type, v);
979 /* Return a new REAL_CST node whose type is TYPE and value is D. */
982 build_real (tree type, REAL_VALUE_TYPE d)
988 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
989 Consider doing it via real_convert now. */
991 v = make_node (REAL_CST);
992 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
993 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
995 TREE_TYPE (v) = type;
996 TREE_REAL_CST_PTR (v) = dp;
997 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1001 /* Return a new REAL_CST node whose type is TYPE
1002 and whose value is the integer value of the INTEGER_CST node I. */
1005 real_value_from_int_cst (tree type, tree i)
1009 /* Clear all bits of the real value type so that we can later do
1010 bitwise comparisons to see if two values are the same. */
1011 memset (&d, 0, sizeof d);
1013 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1014 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1015 TYPE_UNSIGNED (TREE_TYPE (i)));
1019 /* Given a tree representing an integer constant I, return a tree
1020 representing the same value as a floating-point constant of type TYPE. */
1023 build_real_from_int_cst (tree type, tree i)
1026 int overflow = TREE_OVERFLOW (i);
1028 v = build_real (type, real_value_from_int_cst (type, i));
1030 TREE_OVERFLOW (v) |= overflow;
1031 TREE_CONSTANT_OVERFLOW (v) |= overflow;
1035 /* Return a newly constructed STRING_CST node whose value is
1036 the LEN characters at STR.
1037 The TREE_TYPE is not initialized. */
1040 build_string (int len, const char *str)
1045 length = len + sizeof (struct tree_string);
1047 #ifdef GATHER_STATISTICS
1048 tree_node_counts[(int) c_kind]++;
1049 tree_node_sizes[(int) c_kind] += length;
1052 s = ggc_alloc_tree (length);
1054 memset (s, 0, sizeof (struct tree_common));
1055 TREE_SET_CODE (s, STRING_CST);
1056 TREE_STRING_LENGTH (s) = len;
1057 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1058 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1063 /* Return a newly constructed COMPLEX_CST node whose value is
1064 specified by the real and imaginary parts REAL and IMAG.
1065 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1066 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1069 build_complex (tree type, tree real, tree imag)
1071 tree t = make_node (COMPLEX_CST);
1073 TREE_REALPART (t) = real;
1074 TREE_IMAGPART (t) = imag;
1075 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1076 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1077 TREE_CONSTANT_OVERFLOW (t)
1078 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1082 /* Build a BINFO with LEN language slots. */
1085 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1088 size_t length = (offsetof (struct tree_binfo, base_binfos)
1089 + VEC_embedded_size (tree, base_binfos));
1091 #ifdef GATHER_STATISTICS
1092 tree_node_counts[(int) binfo_kind]++;
1093 tree_node_sizes[(int) binfo_kind] += length;
1096 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1098 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1100 TREE_SET_CODE (t, TREE_BINFO);
1102 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1108 /* Build a newly constructed TREE_VEC node of length LEN. */
1111 make_tree_vec_stat (int len MEM_STAT_DECL)
1114 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1116 #ifdef GATHER_STATISTICS
1117 tree_node_counts[(int) vec_kind]++;
1118 tree_node_sizes[(int) vec_kind] += length;
1121 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1123 memset (t, 0, length);
1125 TREE_SET_CODE (t, TREE_VEC);
1126 TREE_VEC_LENGTH (t) = len;
1131 /* Return 1 if EXPR is the integer constant zero or a complex constant
1135 integer_zerop (tree expr)
1139 return ((TREE_CODE (expr) == INTEGER_CST
1140 && ! TREE_CONSTANT_OVERFLOW (expr)
1141 && TREE_INT_CST_LOW (expr) == 0
1142 && TREE_INT_CST_HIGH (expr) == 0)
1143 || (TREE_CODE (expr) == COMPLEX_CST
1144 && integer_zerop (TREE_REALPART (expr))
1145 && integer_zerop (TREE_IMAGPART (expr))));
1148 /* Return 1 if EXPR is the integer constant one or the corresponding
1149 complex constant. */
1152 integer_onep (tree expr)
1156 return ((TREE_CODE (expr) == INTEGER_CST
1157 && ! TREE_CONSTANT_OVERFLOW (expr)
1158 && TREE_INT_CST_LOW (expr) == 1
1159 && TREE_INT_CST_HIGH (expr) == 0)
1160 || (TREE_CODE (expr) == COMPLEX_CST
1161 && integer_onep (TREE_REALPART (expr))
1162 && integer_zerop (TREE_IMAGPART (expr))));
1165 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1166 it contains. Likewise for the corresponding complex constant. */
1169 integer_all_onesp (tree expr)
1176 if (TREE_CODE (expr) == COMPLEX_CST
1177 && integer_all_onesp (TREE_REALPART (expr))
1178 && integer_zerop (TREE_IMAGPART (expr)))
1181 else if (TREE_CODE (expr) != INTEGER_CST
1182 || TREE_CONSTANT_OVERFLOW (expr))
1185 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1187 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1188 && TREE_INT_CST_HIGH (expr) == -1);
1190 /* Note that using TYPE_PRECISION here is wrong. We care about the
1191 actual bits, not the (arbitrary) range of the type. */
1192 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1193 if (prec >= HOST_BITS_PER_WIDE_INT)
1195 HOST_WIDE_INT high_value;
1198 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1200 /* Can not handle precisions greater than twice the host int size. */
1201 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1202 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1203 /* Shifting by the host word size is undefined according to the ANSI
1204 standard, so we must handle this as a special case. */
1207 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1209 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1210 && TREE_INT_CST_HIGH (expr) == high_value);
1213 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1216 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1220 integer_pow2p (tree expr)
1223 HOST_WIDE_INT high, low;
1227 if (TREE_CODE (expr) == COMPLEX_CST
1228 && integer_pow2p (TREE_REALPART (expr))
1229 && integer_zerop (TREE_IMAGPART (expr)))
1232 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
1235 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1236 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1237 high = TREE_INT_CST_HIGH (expr);
1238 low = TREE_INT_CST_LOW (expr);
1240 /* First clear all bits that are beyond the type's precision in case
1241 we've been sign extended. */
1243 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1245 else if (prec > HOST_BITS_PER_WIDE_INT)
1246 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1250 if (prec < HOST_BITS_PER_WIDE_INT)
1251 low &= ~((HOST_WIDE_INT) (-1) << prec);
1254 if (high == 0 && low == 0)
1257 return ((high == 0 && (low & (low - 1)) == 0)
1258 || (low == 0 && (high & (high - 1)) == 0));
1261 /* Return 1 if EXPR is an integer constant other than zero or a
1262 complex constant other than zero. */
1265 integer_nonzerop (tree expr)
1269 return ((TREE_CODE (expr) == INTEGER_CST
1270 && ! TREE_CONSTANT_OVERFLOW (expr)
1271 && (TREE_INT_CST_LOW (expr) != 0
1272 || TREE_INT_CST_HIGH (expr) != 0))
1273 || (TREE_CODE (expr) == COMPLEX_CST
1274 && (integer_nonzerop (TREE_REALPART (expr))
1275 || integer_nonzerop (TREE_IMAGPART (expr)))));
1278 /* Return the power of two represented by a tree node known to be a
1282 tree_log2 (tree expr)
1285 HOST_WIDE_INT high, low;
1289 if (TREE_CODE (expr) == COMPLEX_CST)
1290 return tree_log2 (TREE_REALPART (expr));
1292 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1293 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1295 high = TREE_INT_CST_HIGH (expr);
1296 low = TREE_INT_CST_LOW (expr);
1298 /* First clear all bits that are beyond the type's precision in case
1299 we've been sign extended. */
1301 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1303 else if (prec > HOST_BITS_PER_WIDE_INT)
1304 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1308 if (prec < HOST_BITS_PER_WIDE_INT)
1309 low &= ~((HOST_WIDE_INT) (-1) << prec);
1312 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1313 : exact_log2 (low));
1316 /* Similar, but return the largest integer Y such that 2 ** Y is less
1317 than or equal to EXPR. */
1320 tree_floor_log2 (tree expr)
1323 HOST_WIDE_INT high, low;
1327 if (TREE_CODE (expr) == COMPLEX_CST)
1328 return tree_log2 (TREE_REALPART (expr));
1330 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1331 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1333 high = TREE_INT_CST_HIGH (expr);
1334 low = TREE_INT_CST_LOW (expr);
1336 /* First clear all bits that are beyond the type's precision in case
1337 we've been sign extended. Ignore if type's precision hasn't been set
1338 since what we are doing is setting it. */
1340 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1342 else if (prec > HOST_BITS_PER_WIDE_INT)
1343 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1347 if (prec < HOST_BITS_PER_WIDE_INT)
1348 low &= ~((HOST_WIDE_INT) (-1) << prec);
1351 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1352 : floor_log2 (low));
1355 /* Return 1 if EXPR is the real constant zero. */
1358 real_zerop (tree expr)
1362 return ((TREE_CODE (expr) == REAL_CST
1363 && ! TREE_CONSTANT_OVERFLOW (expr)
1364 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1365 || (TREE_CODE (expr) == COMPLEX_CST
1366 && real_zerop (TREE_REALPART (expr))
1367 && real_zerop (TREE_IMAGPART (expr))));
1370 /* Return 1 if EXPR is the real constant one in real or complex form. */
1373 real_onep (tree expr)
1377 return ((TREE_CODE (expr) == REAL_CST
1378 && ! TREE_CONSTANT_OVERFLOW (expr)
1379 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1380 || (TREE_CODE (expr) == COMPLEX_CST
1381 && real_onep (TREE_REALPART (expr))
1382 && real_zerop (TREE_IMAGPART (expr))));
1385 /* Return 1 if EXPR is the real constant two. */
1388 real_twop (tree expr)
1392 return ((TREE_CODE (expr) == REAL_CST
1393 && ! TREE_CONSTANT_OVERFLOW (expr)
1394 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1395 || (TREE_CODE (expr) == COMPLEX_CST
1396 && real_twop (TREE_REALPART (expr))
1397 && real_zerop (TREE_IMAGPART (expr))));
1400 /* Return 1 if EXPR is the real constant minus one. */
1403 real_minus_onep (tree expr)
1407 return ((TREE_CODE (expr) == REAL_CST
1408 && ! TREE_CONSTANT_OVERFLOW (expr)
1409 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1410 || (TREE_CODE (expr) == COMPLEX_CST
1411 && real_minus_onep (TREE_REALPART (expr))
1412 && real_zerop (TREE_IMAGPART (expr))));
1415 /* Nonzero if EXP is a constant or a cast of a constant. */
1418 really_constant_p (tree exp)
1420 /* This is not quite the same as STRIP_NOPS. It does more. */
1421 while (TREE_CODE (exp) == NOP_EXPR
1422 || TREE_CODE (exp) == CONVERT_EXPR
1423 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1424 exp = TREE_OPERAND (exp, 0);
1425 return TREE_CONSTANT (exp);
1428 /* Return first list element whose TREE_VALUE is ELEM.
1429 Return 0 if ELEM is not in LIST. */
1432 value_member (tree elem, tree list)
1436 if (elem == TREE_VALUE (list))
1438 list = TREE_CHAIN (list);
1443 /* Return first list element whose TREE_PURPOSE is ELEM.
1444 Return 0 if ELEM is not in LIST. */
1447 purpose_member (tree elem, tree list)
1451 if (elem == TREE_PURPOSE (list))
1453 list = TREE_CHAIN (list);
1458 /* Return nonzero if ELEM is part of the chain CHAIN. */
1461 chain_member (tree elem, tree chain)
1467 chain = TREE_CHAIN (chain);
1473 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1474 We expect a null pointer to mark the end of the chain.
1475 This is the Lisp primitive `length'. */
1478 list_length (tree t)
1481 #ifdef ENABLE_TREE_CHECKING
1489 #ifdef ENABLE_TREE_CHECKING
1492 gcc_assert (p != q);
1500 /* Returns the number of FIELD_DECLs in TYPE. */
1503 fields_length (tree type)
1505 tree t = TYPE_FIELDS (type);
1508 for (; t; t = TREE_CHAIN (t))
1509 if (TREE_CODE (t) == FIELD_DECL)
1515 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1516 by modifying the last node in chain 1 to point to chain 2.
1517 This is the Lisp primitive `nconc'. */
1520 chainon (tree op1, tree op2)
1529 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1531 TREE_CHAIN (t1) = op2;
1533 #ifdef ENABLE_TREE_CHECKING
1536 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1537 gcc_assert (t2 != t1);
1544 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1547 tree_last (tree chain)
1551 while ((next = TREE_CHAIN (chain)))
1556 /* Reverse the order of elements in the chain T,
1557 and return the new head of the chain (old last element). */
1562 tree prev = 0, decl, next;
1563 for (decl = t; decl; decl = next)
1565 next = TREE_CHAIN (decl);
1566 TREE_CHAIN (decl) = prev;
1572 /* Return a newly created TREE_LIST node whose
1573 purpose and value fields are PARM and VALUE. */
1576 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1578 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1579 TREE_PURPOSE (t) = parm;
1580 TREE_VALUE (t) = value;
1584 /* Return a newly created TREE_LIST node whose
1585 purpose and value fields are PURPOSE and VALUE
1586 and whose TREE_CHAIN is CHAIN. */
1589 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1593 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1595 memset (node, 0, sizeof (struct tree_common));
1597 #ifdef GATHER_STATISTICS
1598 tree_node_counts[(int) x_kind]++;
1599 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1602 TREE_SET_CODE (node, TREE_LIST);
1603 TREE_CHAIN (node) = chain;
1604 TREE_PURPOSE (node) = purpose;
1605 TREE_VALUE (node) = value;
1610 /* Return the size nominally occupied by an object of type TYPE
1611 when it resides in memory. The value is measured in units of bytes,
1612 and its data type is that normally used for type sizes
1613 (which is the first type created by make_signed_type or
1614 make_unsigned_type). */
1617 size_in_bytes (tree type)
1621 if (type == error_mark_node)
1622 return integer_zero_node;
1624 type = TYPE_MAIN_VARIANT (type);
1625 t = TYPE_SIZE_UNIT (type);
1629 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1630 return size_zero_node;
1633 if (TREE_CODE (t) == INTEGER_CST)
1634 t = force_fit_type (t, 0, false, false);
1639 /* Return the size of TYPE (in bytes) as a wide integer
1640 or return -1 if the size can vary or is larger than an integer. */
1643 int_size_in_bytes (tree type)
1647 if (type == error_mark_node)
1650 type = TYPE_MAIN_VARIANT (type);
1651 t = TYPE_SIZE_UNIT (type);
1653 || TREE_CODE (t) != INTEGER_CST
1654 || TREE_OVERFLOW (t)
1655 || TREE_INT_CST_HIGH (t) != 0
1656 /* If the result would appear negative, it's too big to represent. */
1657 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1660 return TREE_INT_CST_LOW (t);
1663 /* Return the bit position of FIELD, in bits from the start of the record.
1664 This is a tree of type bitsizetype. */
1667 bit_position (tree field)
1669 return bit_from_pos (DECL_FIELD_OFFSET (field),
1670 DECL_FIELD_BIT_OFFSET (field));
1673 /* Likewise, but return as an integer. It must be representable in
1674 that way (since it could be a signed value, we don't have the
1675 option of returning -1 like int_size_in_byte can. */
1678 int_bit_position (tree field)
1680 return tree_low_cst (bit_position (field), 0);
1683 /* Return the byte position of FIELD, in bytes from the start of the record.
1684 This is a tree of type sizetype. */
1687 byte_position (tree field)
1689 return byte_from_pos (DECL_FIELD_OFFSET (field),
1690 DECL_FIELD_BIT_OFFSET (field));
1693 /* Likewise, but return as an integer. It must be representable in
1694 that way (since it could be a signed value, we don't have the
1695 option of returning -1 like int_size_in_byte can. */
1698 int_byte_position (tree field)
1700 return tree_low_cst (byte_position (field), 0);
1703 /* Return the strictest alignment, in bits, that T is known to have. */
1708 unsigned int align0, align1;
1710 switch (TREE_CODE (t))
1712 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1713 /* If we have conversions, we know that the alignment of the
1714 object must meet each of the alignments of the types. */
1715 align0 = expr_align (TREE_OPERAND (t, 0));
1716 align1 = TYPE_ALIGN (TREE_TYPE (t));
1717 return MAX (align0, align1);
1719 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1720 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1721 case CLEANUP_POINT_EXPR:
1722 /* These don't change the alignment of an object. */
1723 return expr_align (TREE_OPERAND (t, 0));
1726 /* The best we can do is say that the alignment is the least aligned
1728 align0 = expr_align (TREE_OPERAND (t, 1));
1729 align1 = expr_align (TREE_OPERAND (t, 2));
1730 return MIN (align0, align1);
1732 case LABEL_DECL: case CONST_DECL:
1733 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1734 if (DECL_ALIGN (t) != 0)
1735 return DECL_ALIGN (t);
1739 return FUNCTION_BOUNDARY;
1745 /* Otherwise take the alignment from that of the type. */
1746 return TYPE_ALIGN (TREE_TYPE (t));
1749 /* Return, as a tree node, the number of elements for TYPE (which is an
1750 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1753 array_type_nelts (tree type)
1755 tree index_type, min, max;
1757 /* If they did it with unspecified bounds, then we should have already
1758 given an error about it before we got here. */
1759 if (! TYPE_DOMAIN (type))
1760 return error_mark_node;
1762 index_type = TYPE_DOMAIN (type);
1763 min = TYPE_MIN_VALUE (index_type);
1764 max = TYPE_MAX_VALUE (index_type);
1766 return (integer_zerop (min)
1768 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1771 /* If arg is static -- a reference to an object in static storage -- then
1772 return the object. This is not the same as the C meaning of `static'.
1773 If arg isn't static, return NULL. */
1778 switch (TREE_CODE (arg))
1781 /* Nested functions are static, even though taking their address will
1782 involve a trampoline as we unnest the nested function and create
1783 the trampoline on the tree level. */
1787 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1788 && ! DECL_THREAD_LOCAL_P (arg)
1789 && ! DECL_NON_ADDR_CONST_P (arg)
1793 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1797 return TREE_STATIC (arg) ? arg : NULL;
1804 /* If the thing being referenced is not a field, then it is
1805 something language specific. */
1806 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1807 return (*lang_hooks.staticp) (arg);
1809 /* If we are referencing a bitfield, we can't evaluate an
1810 ADDR_EXPR at compile time and so it isn't a constant. */
1811 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1814 return staticp (TREE_OPERAND (arg, 0));
1819 case MISALIGNED_INDIRECT_REF:
1820 case ALIGN_INDIRECT_REF:
1822 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
1825 case ARRAY_RANGE_REF:
1826 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1827 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1828 return staticp (TREE_OPERAND (arg, 0));
1833 if ((unsigned int) TREE_CODE (arg)
1834 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1835 return lang_hooks.staticp (arg);
1841 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1842 Do this to any expression which may be used in more than one place,
1843 but must be evaluated only once.
1845 Normally, expand_expr would reevaluate the expression each time.
1846 Calling save_expr produces something that is evaluated and recorded
1847 the first time expand_expr is called on it. Subsequent calls to
1848 expand_expr just reuse the recorded value.
1850 The call to expand_expr that generates code that actually computes
1851 the value is the first call *at compile time*. Subsequent calls
1852 *at compile time* generate code to use the saved value.
1853 This produces correct result provided that *at run time* control
1854 always flows through the insns made by the first expand_expr
1855 before reaching the other places where the save_expr was evaluated.
1856 You, the caller of save_expr, must make sure this is so.
1858 Constants, and certain read-only nodes, are returned with no
1859 SAVE_EXPR because that is safe. Expressions containing placeholders
1860 are not touched; see tree.def for an explanation of what these
1864 save_expr (tree expr)
1866 tree t = fold (expr);
1869 /* If the tree evaluates to a constant, then we don't want to hide that
1870 fact (i.e. this allows further folding, and direct checks for constants).
1871 However, a read-only object that has side effects cannot be bypassed.
1872 Since it is no problem to reevaluate literals, we just return the
1874 inner = skip_simple_arithmetic (t);
1876 if (TREE_INVARIANT (inner)
1877 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1878 || TREE_CODE (inner) == SAVE_EXPR
1879 || TREE_CODE (inner) == ERROR_MARK)
1882 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1883 it means that the size or offset of some field of an object depends on
1884 the value within another field.
1886 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1887 and some variable since it would then need to be both evaluated once and
1888 evaluated more than once. Front-ends must assure this case cannot
1889 happen by surrounding any such subexpressions in their own SAVE_EXPR
1890 and forcing evaluation at the proper time. */
1891 if (contains_placeholder_p (inner))
1894 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
1896 /* This expression might be placed ahead of a jump to ensure that the
1897 value was computed on both sides of the jump. So make sure it isn't
1898 eliminated as dead. */
1899 TREE_SIDE_EFFECTS (t) = 1;
1900 TREE_INVARIANT (t) = 1;
1904 /* Look inside EXPR and into any simple arithmetic operations. Return
1905 the innermost non-arithmetic node. */
1908 skip_simple_arithmetic (tree expr)
1912 /* We don't care about whether this can be used as an lvalue in this
1914 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1915 expr = TREE_OPERAND (expr, 0);
1917 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1918 a constant, it will be more efficient to not make another SAVE_EXPR since
1919 it will allow better simplification and GCSE will be able to merge the
1920 computations if they actually occur. */
1924 if (UNARY_CLASS_P (inner))
1925 inner = TREE_OPERAND (inner, 0);
1926 else if (BINARY_CLASS_P (inner))
1928 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1929 inner = TREE_OPERAND (inner, 0);
1930 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1931 inner = TREE_OPERAND (inner, 1);
1942 /* Return which tree structure is used by T. */
1944 enum tree_node_structure_enum
1945 tree_node_structure (tree t)
1947 enum tree_code code = TREE_CODE (t);
1949 switch (TREE_CODE_CLASS (code))
1951 case tcc_declaration:
1956 return TS_FIELD_DECL;
1958 return TS_PARM_DECL;
1962 return TS_LABEL_DECL;
1964 return TS_RESULT_DECL;
1966 return TS_CONST_DECL;
1968 return TS_TYPE_DECL;
1970 return TS_FUNCTION_DECL;
1972 return TS_DECL_NON_COMMON;
1978 case tcc_comparison:
1981 case tcc_expression:
1984 default: /* tcc_constant and tcc_exceptional */
1989 /* tcc_constant cases. */
1990 case INTEGER_CST: return TS_INT_CST;
1991 case REAL_CST: return TS_REAL_CST;
1992 case COMPLEX_CST: return TS_COMPLEX;
1993 case VECTOR_CST: return TS_VECTOR;
1994 case STRING_CST: return TS_STRING;
1995 /* tcc_exceptional cases. */
1996 case ERROR_MARK: return TS_COMMON;
1997 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1998 case TREE_LIST: return TS_LIST;
1999 case TREE_VEC: return TS_VEC;
2000 case PHI_NODE: return TS_PHI_NODE;
2001 case SSA_NAME: return TS_SSA_NAME;
2002 case PLACEHOLDER_EXPR: return TS_COMMON;
2003 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2004 case BLOCK: return TS_BLOCK;
2005 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2006 case TREE_BINFO: return TS_BINFO;
2007 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2014 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2015 or offset that depends on a field within a record. */
2018 contains_placeholder_p (tree exp)
2020 enum tree_code code;
2025 code = TREE_CODE (exp);
2026 if (code == PLACEHOLDER_EXPR)
2029 switch (TREE_CODE_CLASS (code))
2032 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2033 position computations since they will be converted into a
2034 WITH_RECORD_EXPR involving the reference, which will assume
2035 here will be valid. */
2036 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2038 case tcc_exceptional:
2039 if (code == TREE_LIST)
2040 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2041 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2046 case tcc_comparison:
2047 case tcc_expression:
2051 /* Ignoring the first operand isn't quite right, but works best. */
2052 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2055 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2056 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2057 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2063 switch (TREE_CODE_LENGTH (code))
2066 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2068 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2069 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2080 /* Return true if any part of the computation of TYPE involves a
2081 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2082 (for QUAL_UNION_TYPE) and field positions. */
2085 type_contains_placeholder_1 (tree type)
2087 /* If the size contains a placeholder or the parent type (component type in
2088 the case of arrays) type involves a placeholder, this type does. */
2089 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2090 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2091 || (TREE_TYPE (type) != 0
2092 && type_contains_placeholder_p (TREE_TYPE (type))))
2095 /* Now do type-specific checks. Note that the last part of the check above
2096 greatly limits what we have to do below. */
2097 switch (TREE_CODE (type))
2106 case REFERENCE_TYPE:
2114 /* Here we just check the bounds. */
2115 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2116 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2119 /* We're already checked the component type (TREE_TYPE), so just check
2121 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2125 case QUAL_UNION_TYPE:
2129 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2130 if (TREE_CODE (field) == FIELD_DECL
2131 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2132 || (TREE_CODE (type) == QUAL_UNION_TYPE
2133 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2134 || type_contains_placeholder_p (TREE_TYPE (field))))
2146 type_contains_placeholder_p (tree type)
2150 /* If the contains_placeholder_bits field has been initialized,
2151 then we know the answer. */
2152 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2153 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2155 /* Indicate that we've seen this type node, and the answer is false.
2156 This is what we want to return if we run into recursion via fields. */
2157 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2159 /* Compute the real value. */
2160 result = type_contains_placeholder_1 (type);
2162 /* Store the real value. */
2163 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2168 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2169 return a tree with all occurrences of references to F in a
2170 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2171 contains only arithmetic expressions or a CALL_EXPR with a
2172 PLACEHOLDER_EXPR occurring only in its arglist. */
2175 substitute_in_expr (tree exp, tree f, tree r)
2177 enum tree_code code = TREE_CODE (exp);
2182 /* We handle TREE_LIST and COMPONENT_REF separately. */
2183 if (code == TREE_LIST)
2185 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2186 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2187 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2190 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2192 else if (code == COMPONENT_REF)
2194 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2195 and it is the right field, replace it with R. */
2196 for (inner = TREE_OPERAND (exp, 0);
2197 REFERENCE_CLASS_P (inner);
2198 inner = TREE_OPERAND (inner, 0))
2200 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2201 && TREE_OPERAND (exp, 1) == f)
2204 /* If this expression hasn't been completed let, leave it alone. */
2205 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2208 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2209 if (op0 == TREE_OPERAND (exp, 0))
2212 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2213 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2216 switch (TREE_CODE_CLASS (code))
2219 case tcc_declaration:
2222 case tcc_exceptional:
2225 case tcc_comparison:
2226 case tcc_expression:
2228 switch (TREE_CODE_LENGTH (code))
2234 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2235 if (op0 == TREE_OPERAND (exp, 0))
2238 new = fold_build1 (code, TREE_TYPE (exp), op0);
2242 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2243 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2245 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2248 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2252 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2253 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2254 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2256 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2257 && op2 == TREE_OPERAND (exp, 2))
2260 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2272 TREE_READONLY (new) = TREE_READONLY (exp);
2276 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2277 for it within OBJ, a tree that is an object or a chain of references. */
2280 substitute_placeholder_in_expr (tree exp, tree obj)
2282 enum tree_code code = TREE_CODE (exp);
2283 tree op0, op1, op2, op3;
2285 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2286 in the chain of OBJ. */
2287 if (code == PLACEHOLDER_EXPR)
2289 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2292 for (elt = obj; elt != 0;
2293 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2294 || TREE_CODE (elt) == COND_EXPR)
2295 ? TREE_OPERAND (elt, 1)
2296 : (REFERENCE_CLASS_P (elt)
2297 || UNARY_CLASS_P (elt)
2298 || BINARY_CLASS_P (elt)
2299 || EXPRESSION_CLASS_P (elt))
2300 ? TREE_OPERAND (elt, 0) : 0))
2301 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2304 for (elt = obj; elt != 0;
2305 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2306 || TREE_CODE (elt) == COND_EXPR)
2307 ? TREE_OPERAND (elt, 1)
2308 : (REFERENCE_CLASS_P (elt)
2309 || UNARY_CLASS_P (elt)
2310 || BINARY_CLASS_P (elt)
2311 || EXPRESSION_CLASS_P (elt))
2312 ? TREE_OPERAND (elt, 0) : 0))
2313 if (POINTER_TYPE_P (TREE_TYPE (elt))
2314 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2316 return fold_build1 (INDIRECT_REF, need_type, elt);
2318 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2319 survives until RTL generation, there will be an error. */
2323 /* TREE_LIST is special because we need to look at TREE_VALUE
2324 and TREE_CHAIN, not TREE_OPERANDS. */
2325 else if (code == TREE_LIST)
2327 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2328 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2329 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2332 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2335 switch (TREE_CODE_CLASS (code))
2338 case tcc_declaration:
2341 case tcc_exceptional:
2344 case tcc_comparison:
2345 case tcc_expression:
2348 switch (TREE_CODE_LENGTH (code))
2354 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2355 if (op0 == TREE_OPERAND (exp, 0))
2358 return fold_build1 (code, TREE_TYPE (exp), op0);
2361 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2362 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2364 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2367 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2370 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2371 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2372 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2374 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2375 && op2 == TREE_OPERAND (exp, 2))
2378 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2381 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2382 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2383 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2384 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2386 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2387 && op2 == TREE_OPERAND (exp, 2)
2388 && op3 == TREE_OPERAND (exp, 3))
2391 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2403 /* Stabilize a reference so that we can use it any number of times
2404 without causing its operands to be evaluated more than once.
2405 Returns the stabilized reference. This works by means of save_expr,
2406 so see the caveats in the comments about save_expr.
2408 Also allows conversion expressions whose operands are references.
2409 Any other kind of expression is returned unchanged. */
2412 stabilize_reference (tree ref)
2415 enum tree_code code = TREE_CODE (ref);
2422 /* No action is needed in this case. */
2428 case FIX_TRUNC_EXPR:
2429 case FIX_FLOOR_EXPR:
2430 case FIX_ROUND_EXPR:
2432 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2436 result = build_nt (INDIRECT_REF,
2437 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2441 result = build_nt (COMPONENT_REF,
2442 stabilize_reference (TREE_OPERAND (ref, 0)),
2443 TREE_OPERAND (ref, 1), NULL_TREE);
2447 result = build_nt (BIT_FIELD_REF,
2448 stabilize_reference (TREE_OPERAND (ref, 0)),
2449 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2450 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2454 result = build_nt (ARRAY_REF,
2455 stabilize_reference (TREE_OPERAND (ref, 0)),
2456 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2457 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2460 case ARRAY_RANGE_REF:
2461 result = build_nt (ARRAY_RANGE_REF,
2462 stabilize_reference (TREE_OPERAND (ref, 0)),
2463 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2464 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2468 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2469 it wouldn't be ignored. This matters when dealing with
2471 return stabilize_reference_1 (ref);
2473 /* If arg isn't a kind of lvalue we recognize, make no change.
2474 Caller should recognize the error for an invalid lvalue. */
2479 return error_mark_node;
2482 TREE_TYPE (result) = TREE_TYPE (ref);
2483 TREE_READONLY (result) = TREE_READONLY (ref);
2484 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2485 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2490 /* Subroutine of stabilize_reference; this is called for subtrees of
2491 references. Any expression with side-effects must be put in a SAVE_EXPR
2492 to ensure that it is only evaluated once.
2494 We don't put SAVE_EXPR nodes around everything, because assigning very
2495 simple expressions to temporaries causes us to miss good opportunities
2496 for optimizations. Among other things, the opportunity to fold in the
2497 addition of a constant into an addressing mode often gets lost, e.g.
2498 "y[i+1] += x;". In general, we take the approach that we should not make
2499 an assignment unless we are forced into it - i.e., that any non-side effect
2500 operator should be allowed, and that cse should take care of coalescing
2501 multiple utterances of the same expression should that prove fruitful. */
2504 stabilize_reference_1 (tree e)
2507 enum tree_code code = TREE_CODE (e);
2509 /* We cannot ignore const expressions because it might be a reference
2510 to a const array but whose index contains side-effects. But we can
2511 ignore things that are actual constant or that already have been
2512 handled by this function. */
2514 if (TREE_INVARIANT (e))
2517 switch (TREE_CODE_CLASS (code))
2519 case tcc_exceptional:
2521 case tcc_declaration:
2522 case tcc_comparison:
2524 case tcc_expression:
2526 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2527 so that it will only be evaluated once. */
2528 /* The reference (r) and comparison (<) classes could be handled as
2529 below, but it is generally faster to only evaluate them once. */
2530 if (TREE_SIDE_EFFECTS (e))
2531 return save_expr (e);
2535 /* Constants need no processing. In fact, we should never reach
2540 /* Division is slow and tends to be compiled with jumps,
2541 especially the division by powers of 2 that is often
2542 found inside of an array reference. So do it just once. */
2543 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2544 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2545 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2546 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2547 return save_expr (e);
2548 /* Recursively stabilize each operand. */
2549 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2550 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2554 /* Recursively stabilize each operand. */
2555 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2562 TREE_TYPE (result) = TREE_TYPE (e);
2563 TREE_READONLY (result) = TREE_READONLY (e);
2564 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2565 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2566 TREE_INVARIANT (result) = 1;
2571 /* Low-level constructors for expressions. */
2573 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2574 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2577 recompute_tree_invarant_for_addr_expr (tree t)
2580 bool tc = true, ti = true, se = false;
2582 /* We started out assuming this address is both invariant and constant, but
2583 does not have side effects. Now go down any handled components and see if
2584 any of them involve offsets that are either non-constant or non-invariant.
2585 Also check for side-effects.
2587 ??? Note that this code makes no attempt to deal with the case where
2588 taking the address of something causes a copy due to misalignment. */
2590 #define UPDATE_TITCSE(NODE) \
2591 do { tree _node = (NODE); \
2592 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2593 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2594 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2596 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2597 node = TREE_OPERAND (node, 0))
2599 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2600 array reference (probably made temporarily by the G++ front end),
2601 so ignore all the operands. */
2602 if ((TREE_CODE (node) == ARRAY_REF
2603 || TREE_CODE (node) == ARRAY_RANGE_REF)
2604 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2606 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2607 if (TREE_OPERAND (node, 2))
2608 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2609 if (TREE_OPERAND (node, 3))
2610 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2612 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2613 FIELD_DECL, apparently. The G++ front end can put something else
2614 there, at least temporarily. */
2615 else if (TREE_CODE (node) == COMPONENT_REF
2616 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2618 if (TREE_OPERAND (node, 2))
2619 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2621 else if (TREE_CODE (node) == BIT_FIELD_REF)
2622 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2625 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2627 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2628 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2629 invariant and constant if the decl is static. It's also invariant if it's
2630 a decl in the current function. Taking the address of a volatile variable
2631 is not volatile. If it's a constant, the address is both invariant and
2632 constant. Otherwise it's neither. */
2633 if (TREE_CODE (node) == INDIRECT_REF)
2634 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2635 else if (DECL_P (node))
2639 else if (decl_function_context (node) == current_function_decl
2640 /* Addresses of thread-local variables are invariant. */
2641 || (TREE_CODE (node) == VAR_DECL
2642 && DECL_THREAD_LOCAL_P (node)))
2647 else if (CONSTANT_CLASS_P (node))
2652 se |= TREE_SIDE_EFFECTS (node);
2655 TREE_CONSTANT (t) = tc;
2656 TREE_INVARIANT (t) = ti;
2657 TREE_SIDE_EFFECTS (t) = se;
2658 #undef UPDATE_TITCSE
2661 /* Build an expression of code CODE, data type TYPE, and operands as
2662 specified. Expressions and reference nodes can be created this way.
2663 Constants, decls, types and misc nodes cannot be.
2665 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2666 enough for all extant tree codes. These functions can be called
2667 directly (preferably!), but can also be obtained via GCC preprocessor
2668 magic within the build macro. */
2671 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2675 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2677 t = make_node_stat (code PASS_MEM_STAT);
2684 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2686 int length = sizeof (struct tree_exp);
2687 #ifdef GATHER_STATISTICS
2688 tree_node_kind kind;
2692 #ifdef GATHER_STATISTICS
2693 switch (TREE_CODE_CLASS (code))
2695 case tcc_statement: /* an expression with side effects */
2698 case tcc_reference: /* a reference */
2706 tree_node_counts[(int) kind]++;
2707 tree_node_sizes[(int) kind] += length;
2710 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2712 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2714 memset (t, 0, sizeof (struct tree_common));
2716 TREE_SET_CODE (t, code);
2718 TREE_TYPE (t) = type;
2719 #ifdef USE_MAPPED_LOCATION
2720 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2722 SET_EXPR_LOCUS (t, NULL);
2724 TREE_COMPLEXITY (t) = 0;
2725 TREE_OPERAND (t, 0) = node;
2726 TREE_BLOCK (t) = NULL_TREE;
2727 if (node && !TYPE_P (node))
2729 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2730 TREE_READONLY (t) = TREE_READONLY (node);
2733 if (TREE_CODE_CLASS (code) == tcc_statement)
2734 TREE_SIDE_EFFECTS (t) = 1;
2738 /* All of these have side-effects, no matter what their
2740 TREE_SIDE_EFFECTS (t) = 1;
2741 TREE_READONLY (t) = 0;
2744 case MISALIGNED_INDIRECT_REF:
2745 case ALIGN_INDIRECT_REF:
2747 /* Whether a dereference is readonly has nothing to do with whether
2748 its operand is readonly. */
2749 TREE_READONLY (t) = 0;
2754 recompute_tree_invarant_for_addr_expr (t);
2758 if (TREE_CODE_CLASS (code) == tcc_unary
2759 && node && !TYPE_P (node)
2760 && TREE_CONSTANT (node))
2761 TREE_CONSTANT (t) = 1;
2762 if (TREE_CODE_CLASS (code) == tcc_unary
2763 && node && TREE_INVARIANT (node))
2764 TREE_INVARIANT (t) = 1;
2765 if (TREE_CODE_CLASS (code) == tcc_reference
2766 && node && TREE_THIS_VOLATILE (node))
2767 TREE_THIS_VOLATILE (t) = 1;
2774 #define PROCESS_ARG(N) \
2776 TREE_OPERAND (t, N) = arg##N; \
2777 if (arg##N &&!TYPE_P (arg##N)) \
2779 if (TREE_SIDE_EFFECTS (arg##N)) \
2781 if (!TREE_READONLY (arg##N)) \
2783 if (!TREE_CONSTANT (arg##N)) \
2785 if (!TREE_INVARIANT (arg##N)) \
2791 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2793 bool constant, read_only, side_effects, invariant;
2796 gcc_assert (TREE_CODE_LENGTH (code) == 2);
2798 t = make_node_stat (code PASS_MEM_STAT);
2801 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2802 result based on those same flags for the arguments. But if the
2803 arguments aren't really even `tree' expressions, we shouldn't be trying
2806 /* Expressions without side effects may be constant if their
2807 arguments are as well. */
2808 constant = (TREE_CODE_CLASS (code) == tcc_comparison
2809 || TREE_CODE_CLASS (code) == tcc_binary);
2811 side_effects = TREE_SIDE_EFFECTS (t);
2812 invariant = constant;
2817 TREE_READONLY (t) = read_only;
2818 TREE_CONSTANT (t) = constant;
2819 TREE_INVARIANT (t) = invariant;
2820 TREE_SIDE_EFFECTS (t) = side_effects;
2821 TREE_THIS_VOLATILE (t)
2822 = (TREE_CODE_CLASS (code) == tcc_reference
2823 && arg0 && TREE_THIS_VOLATILE (arg0));
2829 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2830 tree arg2 MEM_STAT_DECL)
2832 bool constant, read_only, side_effects, invariant;
2835 gcc_assert (TREE_CODE_LENGTH (code) == 3);
2837 t = make_node_stat (code PASS_MEM_STAT);
2840 side_effects = TREE_SIDE_EFFECTS (t);
2846 if (code == CALL_EXPR && !side_effects)
2851 /* Calls have side-effects, except those to const or
2853 i = call_expr_flags (t);
2854 if (!(i & (ECF_CONST | ECF_PURE)))
2857 /* And even those have side-effects if their arguments do. */
2858 else for (node = arg1; node; node = TREE_CHAIN (node))
2859 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2866 TREE_SIDE_EFFECTS (t) = side_effects;
2867 TREE_THIS_VOLATILE (t)
2868 = (TREE_CODE_CLASS (code) == tcc_reference
2869 && arg0 && TREE_THIS_VOLATILE (arg0));
2875 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2876 tree arg2, tree arg3 MEM_STAT_DECL)
2878 bool constant, read_only, side_effects, invariant;
2881 gcc_assert (TREE_CODE_LENGTH (code) == 4);
2883 t = make_node_stat (code PASS_MEM_STAT);
2886 side_effects = TREE_SIDE_EFFECTS (t);
2893 TREE_SIDE_EFFECTS (t) = side_effects;
2894 TREE_THIS_VOLATILE (t)
2895 = (TREE_CODE_CLASS (code) == tcc_reference
2896 && arg0 && TREE_THIS_VOLATILE (arg0));
2902 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2903 tree arg2, tree arg3, tree arg4, tree arg5,
2904 tree arg6 MEM_STAT_DECL)
2906 bool constant, read_only, side_effects, invariant;
2909 gcc_assert (code == TARGET_MEM_REF);
2911 t = make_node_stat (code PASS_MEM_STAT);
2914 side_effects = TREE_SIDE_EFFECTS (t);
2924 TREE_SIDE_EFFECTS (t) = side_effects;
2925 TREE_THIS_VOLATILE (t) = 0;
2930 /* Backup definition for non-gcc build compilers. */
2933 (build) (enum tree_code code, tree tt, ...)
2935 tree t, arg0, arg1, arg2, arg3, arg4, arg5, arg6;
2936 int length = TREE_CODE_LENGTH (code);
2943 t = build0 (code, tt);
2946 arg0 = va_arg (p, tree);
2947 t = build1 (code, tt, arg0);
2950 arg0 = va_arg (p, tree);
2951 arg1 = va_arg (p, tree);
2952 t = build2 (code, tt, arg0, arg1);
2955 arg0 = va_arg (p, tree);
2956 arg1 = va_arg (p, tree);
2957 arg2 = va_arg (p, tree);
2958 t = build3 (code, tt, arg0, arg1, arg2);
2961 arg0 = va_arg (p, tree);
2962 arg1 = va_arg (p, tree);
2963 arg2 = va_arg (p, tree);
2964 arg3 = va_arg (p, tree);
2965 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2968 arg0 = va_arg (p, tree);
2969 arg1 = va_arg (p, tree);
2970 arg2 = va_arg (p, tree);
2971 arg3 = va_arg (p, tree);
2972 arg4 = va_arg (p, tree);
2973 arg5 = va_arg (p, tree);
2974 arg6 = va_arg (p, tree);
2975 t = build7 (code, tt, arg0, arg1, arg2, arg3, arg4, arg5, arg6);
2985 /* Similar except don't specify the TREE_TYPE
2986 and leave the TREE_SIDE_EFFECTS as 0.
2987 It is permissible for arguments to be null,
2988 or even garbage if their values do not matter. */
2991 build_nt (enum tree_code code, ...)
3000 t = make_node (code);
3001 length = TREE_CODE_LENGTH (code);
3003 for (i = 0; i < length; i++)
3004 TREE_OPERAND (t, i) = va_arg (p, tree);
3010 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3011 We do NOT enter this node in any sort of symbol table.
3013 layout_decl is used to set up the decl's storage layout.
3014 Other slots are initialized to 0 or null pointers. */
3017 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3021 t = make_node_stat (code PASS_MEM_STAT);
3023 /* if (type == error_mark_node)
3024 type = integer_type_node; */
3025 /* That is not done, deliberately, so that having error_mark_node
3026 as the type can suppress useless errors in the use of this variable. */
3028 DECL_NAME (t) = name;
3029 TREE_TYPE (t) = type;
3031 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3033 else if (code == FUNCTION_DECL)
3034 DECL_MODE (t) = FUNCTION_MODE;
3036 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
3038 /* Set default visibility to whatever the user supplied with
3039 visibility_specified depending on #pragma GCC visibility. */
3040 DECL_VISIBILITY (t) = default_visibility;
3041 DECL_VISIBILITY_SPECIFIED (t) = visibility_options.inpragma;
3047 /* Builds and returns function declaration with NAME and TYPE. */
3050 build_fn_decl (const char *name, tree type)
3052 tree id = get_identifier (name);
3053 tree decl = build_decl (FUNCTION_DECL, id, type);
3055 DECL_EXTERNAL (decl) = 1;
3056 TREE_PUBLIC (decl) = 1;
3057 DECL_ARTIFICIAL (decl) = 1;
3058 TREE_NOTHROW (decl) = 1;
3064 /* BLOCK nodes are used to represent the structure of binding contours
3065 and declarations, once those contours have been exited and their contents
3066 compiled. This information is used for outputting debugging info. */
3069 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3071 tree block = make_node (BLOCK);
3073 BLOCK_VARS (block) = vars;
3074 BLOCK_SUBBLOCKS (block) = subblocks;
3075 BLOCK_SUPERCONTEXT (block) = supercontext;
3076 BLOCK_CHAIN (block) = chain;
3080 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3081 /* ??? gengtype doesn't handle conditionals */
3082 static GTY(()) tree last_annotated_node;
3085 #ifdef USE_MAPPED_LOCATION
3088 expand_location (source_location loc)
3090 expanded_location xloc;
3091 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
3094 const struct line_map *map = linemap_lookup (&line_table, loc);
3095 xloc.file = map->to_file;
3096 xloc.line = SOURCE_LINE (map, loc);
3097 xloc.column = SOURCE_COLUMN (map, loc);
3104 /* Record the exact location where an expression or an identifier were
3108 annotate_with_file_line (tree node, const char *file, int line)
3110 /* Roughly one percent of the calls to this function are to annotate
3111 a node with the same information already attached to that node!
3112 Just return instead of wasting memory. */
3113 if (EXPR_LOCUS (node)
3114 && (EXPR_FILENAME (node) == file
3115 || ! strcmp (EXPR_FILENAME (node), file))
3116 && EXPR_LINENO (node) == line)
3118 last_annotated_node = node;
3122 /* In heavily macroized code (such as GCC itself) this single
3123 entry cache can reduce the number of allocations by more
3125 if (last_annotated_node
3126 && EXPR_LOCUS (last_annotated_node)
3127 && (EXPR_FILENAME (last_annotated_node) == file
3128 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
3129 && EXPR_LINENO (last_annotated_node) == line)
3131 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
3135 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3136 EXPR_LINENO (node) = line;
3137 EXPR_FILENAME (node) = file;
3138 last_annotated_node = node;
3142 annotate_with_locus (tree node, location_t locus)
3144 annotate_with_file_line (node, locus.file, locus.line);
3148 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3152 build_decl_attribute_variant (tree ddecl, tree attribute)
3154 DECL_ATTRIBUTES (ddecl) = attribute;
3158 /* Borrowed from hashtab.c iterative_hash implementation. */
3159 #define mix(a,b,c) \
3161 a -= b; a -= c; a ^= (c>>13); \
3162 b -= c; b -= a; b ^= (a<< 8); \
3163 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3164 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3165 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3166 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3167 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3168 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3169 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3173 /* Produce good hash value combining VAL and VAL2. */
3174 static inline hashval_t
3175 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3177 /* the golden ratio; an arbitrary value. */
3178 hashval_t a = 0x9e3779b9;
3184 /* Produce good hash value combining PTR and VAL2. */
3185 static inline hashval_t
3186 iterative_hash_pointer (void *ptr, hashval_t val2)
3188 if (sizeof (ptr) == sizeof (hashval_t))
3189 return iterative_hash_hashval_t ((size_t) ptr, val2);
3192 hashval_t a = (hashval_t) (size_t) ptr;
3193 /* Avoid warnings about shifting of more than the width of the type on
3194 hosts that won't execute this path. */
3196 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3202 /* Produce good hash value combining VAL and VAL2. */
3203 static inline hashval_t
3204 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3206 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3207 return iterative_hash_hashval_t (val, val2);
3210 hashval_t a = (hashval_t) val;
3211 /* Avoid warnings about shifting of more than the width of the type on
3212 hosts that won't execute this path. */
3214 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3216 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3218 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3219 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3226 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3229 Record such modified types already made so we don't make duplicates. */
3232 build_type_attribute_variant (tree ttype, tree attribute)
3234 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3236 hashval_t hashcode = 0;
3238 enum tree_code code = TREE_CODE (ttype);
3240 ntype = copy_node (ttype);
3242 TYPE_POINTER_TO (ntype) = 0;
3243 TYPE_REFERENCE_TO (ntype) = 0;
3244 TYPE_ATTRIBUTES (ntype) = attribute;
3246 /* Create a new main variant of TYPE. */
3247 TYPE_MAIN_VARIANT (ntype) = ntype;
3248 TYPE_NEXT_VARIANT (ntype) = 0;
3249 set_type_quals (ntype, TYPE_UNQUALIFIED);
3251 hashcode = iterative_hash_object (code, hashcode);
3252 if (TREE_TYPE (ntype))
3253 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3255 hashcode = attribute_hash_list (attribute, hashcode);
3257 switch (TREE_CODE (ntype))
3260 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3263 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3267 hashcode = iterative_hash_object
3268 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3269 hashcode = iterative_hash_object
3270 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3274 unsigned int precision = TYPE_PRECISION (ntype);
3275 hashcode = iterative_hash_object (precision, hashcode);
3282 ntype = type_hash_canon (hashcode, ntype);
3283 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
3290 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3293 We try both `text' and `__text__', ATTR may be either one. */
3294 /* ??? It might be a reasonable simplification to require ATTR to be only
3295 `text'. One might then also require attribute lists to be stored in
3296 their canonicalized form. */
3299 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3304 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3307 p = IDENTIFIER_POINTER (ident);
3308 ident_len = IDENTIFIER_LENGTH (ident);
3310 if (ident_len == attr_len
3311 && strcmp (attr, p) == 0)
3314 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3317 gcc_assert (attr[1] == '_');
3318 gcc_assert (attr[attr_len - 2] == '_');
3319 gcc_assert (attr[attr_len - 1] == '_');
3320 gcc_assert (attr[1] == '_');
3321 if (ident_len == attr_len - 4
3322 && strncmp (attr + 2, p, attr_len - 4) == 0)
3327 if (ident_len == attr_len + 4
3328 && p[0] == '_' && p[1] == '_'
3329 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3330 && strncmp (attr, p + 2, attr_len) == 0)
3337 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3340 We try both `text' and `__text__', ATTR may be either one. */
3343 is_attribute_p (const char *attr, tree ident)
3345 return is_attribute_with_length_p (attr, strlen (attr), ident);
3348 /* Given an attribute name and a list of attributes, return a pointer to the
3349 attribute's list element if the attribute is part of the list, or NULL_TREE
3350 if not found. If the attribute appears more than once, this only
3351 returns the first occurrence; the TREE_CHAIN of the return value should
3352 be passed back in if further occurrences are wanted. */
3355 lookup_attribute (const char *attr_name, tree list)
3358 size_t attr_len = strlen (attr_name);
3360 for (l = list; l; l = TREE_CHAIN (l))
3362 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3363 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3370 /* Return an attribute list that is the union of a1 and a2. */
3373 merge_attributes (tree a1, tree a2)
3377 /* Either one unset? Take the set one. */
3379 if ((attributes = a1) == 0)
3382 /* One that completely contains the other? Take it. */
3384 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3386 if (attribute_list_contained (a2, a1))
3390 /* Pick the longest list, and hang on the other list. */
3392 if (list_length (a1) < list_length (a2))
3393 attributes = a2, a2 = a1;
3395 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3398 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3401 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3404 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
3409 a1 = copy_node (a2);
3410 TREE_CHAIN (a1) = attributes;
3419 /* Given types T1 and T2, merge their attributes and return
3423 merge_type_attributes (tree t1, tree t2)
3425 return merge_attributes (TYPE_ATTRIBUTES (t1),
3426 TYPE_ATTRIBUTES (t2));
3429 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3433 merge_decl_attributes (tree olddecl, tree newdecl)
3435 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3436 DECL_ATTRIBUTES (newdecl));
3439 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3441 /* Specialization of merge_decl_attributes for various Windows targets.
3443 This handles the following situation:
3445 __declspec (dllimport) int foo;
3448 The second instance of `foo' nullifies the dllimport. */
3451 merge_dllimport_decl_attributes (tree old, tree new)
3454 int delete_dllimport_p;
3456 old = DECL_ATTRIBUTES (old);
3457 new = DECL_ATTRIBUTES (new);
3459 /* What we need to do here is remove from `old' dllimport if it doesn't
3460 appear in `new'. dllimport behaves like extern: if a declaration is
3461 marked dllimport and a definition appears later, then the object
3462 is not dllimport'd. */
3463 if (lookup_attribute ("dllimport", old) != NULL_TREE
3464 && lookup_attribute ("dllimport", new) == NULL_TREE)
3465 delete_dllimport_p = 1;
3467 delete_dllimport_p = 0;
3469 a = merge_attributes (old, new);
3471 if (delete_dllimport_p)
3475 /* Scan the list for dllimport and delete it. */
3476 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3478 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3480 if (prev == NULL_TREE)
3483 TREE_CHAIN (prev) = TREE_CHAIN (t);
3492 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3493 struct attribute_spec.handler. */
3496 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3501 /* These attributes may apply to structure and union types being created,
3502 but otherwise should pass to the declaration involved. */
3505 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3506 | (int) ATTR_FLAG_ARRAY_NEXT))
3508 *no_add_attrs = true;
3509 return tree_cons (name, args, NULL_TREE);
3511 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3513 warning (OPT_Wattributes, "%qs attribute ignored",
3514 IDENTIFIER_POINTER (name));
3515 *no_add_attrs = true;
3521 /* Report error on dllimport ambiguities seen now before they cause
3523 if (is_attribute_p ("dllimport", name))
3525 /* Like MS, treat definition of dllimported variables and
3526 non-inlined functions on declaration as syntax errors. We
3527 allow the attribute for function definitions if declared
3529 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node)
3530 && !DECL_DECLARED_INLINE_P (node))
3532 error ("function %q+D definition is marked dllimport", node);
3533 *no_add_attrs = true;
3536 else if (TREE_CODE (node) == VAR_DECL)
3538 if (DECL_INITIAL (node))
3540 error ("variable %q+D definition is marked dllimport",
3542 *no_add_attrs = true;
3545 /* `extern' needn't be specified with dllimport.
3546 Specify `extern' now and hope for the best. Sigh. */
3547 DECL_EXTERNAL (node) = 1;
3548 /* Also, implicitly give dllimport'd variables declared within
3549 a function global scope, unless declared static. */
3550 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3551 TREE_PUBLIC (node) = 1;
3555 /* Report error if symbol is not accessible at global scope. */
3556 if (!TREE_PUBLIC (node)
3557 && (TREE_CODE (node) == VAR_DECL
3558 || TREE_CODE (node) == FUNCTION_DECL))
3560 error ("external linkage required for symbol %q+D because of "
3561 "%qs attribute", node, IDENTIFIER_POINTER (name));
3562 *no_add_attrs = true;
3568 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3570 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3571 of the various TYPE_QUAL values. */
3574 set_type_quals (tree type, int type_quals)
3576 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3577 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3578 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3581 /* Returns true iff cand is equivalent to base with type_quals. */
3584 check_qualified_type (tree cand, tree base, int type_quals)
3586 return (TYPE_QUALS (cand) == type_quals
3587 && TYPE_NAME (cand) == TYPE_NAME (base)
3588 /* Apparently this is needed for Objective-C. */
3589 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3590 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3591 TYPE_ATTRIBUTES (base)));
3594 /* Return a version of the TYPE, qualified as indicated by the
3595 TYPE_QUALS, if one exists. If no qualified version exists yet,
3596 return NULL_TREE. */
3599 get_qualified_type (tree type, int type_quals)
3603 if (TYPE_QUALS (type) == type_quals)
3606 /* Search the chain of variants to see if there is already one there just
3607 like the one we need to have. If so, use that existing one. We must
3608 preserve the TYPE_NAME, since there is code that depends on this. */
3609 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3610 if (check_qualified_type (t, type, type_quals))
3616 /* Like get_qualified_type, but creates the type if it does not
3617 exist. This function never returns NULL_TREE. */
3620 build_qualified_type (tree type, int type_quals)
3624 /* See if we already have the appropriate qualified variant. */
3625 t = get_qualified_type (type, type_quals);
3627 /* If not, build it. */
3630 t = build_variant_type_copy (type);
3631 set_type_quals (t, type_quals);
3637 /* Create a new distinct copy of TYPE. The new type is made its own
3641 build_distinct_type_copy (tree type)
3643 tree t = copy_node (type);
3645 TYPE_POINTER_TO (t) = 0;
3646 TYPE_REFERENCE_TO (t) = 0;
3648 /* Make it its own variant. */
3649 TYPE_MAIN_VARIANT (t) = t;
3650 TYPE_NEXT_VARIANT (t) = 0;
3655 /* Create a new variant of TYPE, equivalent but distinct.
3656 This is so the caller can modify it. */
3659 build_variant_type_copy (tree type)
3661 tree t, m = TYPE_MAIN_VARIANT (type);
3663 t = build_distinct_type_copy (type);
3665 /* Add the new type to the chain of variants of TYPE. */
3666 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3667 TYPE_NEXT_VARIANT (m) = t;
3668 TYPE_MAIN_VARIANT (t) = m;
3673 /* Return true if the from tree in both tree maps are equal. */
3676 tree_map_eq (const void *va, const void *vb)
3678 const struct tree_map *a = va, *b = vb;
3679 return (a->from == b->from);
3682 /* Hash a from tree in a tree_map. */
3685 tree_map_hash (const void *item)
3687 return (((const struct tree_map *) item)->hash);
3690 /* Return true if this tree map structure is marked for garbage collection
3691 purposes. We simply return true if the from tree is marked, so that this
3692 structure goes away when the from tree goes away. */
3695 tree_map_marked_p (const void *p)
3697 tree from = ((struct tree_map *) p)->from;
3699 return ggc_marked_p (from);
3702 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
3705 tree_int_map_eq (const void *va, const void *vb)
3707 const struct tree_int_map *a = va, *b = vb;
3708 return (a->from == b->from);
3711 /* Hash a from tree in the tree_int_map * ITEM. */
3714 tree_int_map_hash (const void *item)
3716 return htab_hash_pointer (((const struct tree_int_map *)item)->from);
3719 /* Return true if this tree int map structure is marked for garbage collection
3720 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
3721 structure goes away when the from tree goes away. */
3724 tree_int_map_marked_p (const void *p)
3726 tree from = ((struct tree_int_map *) p)->from;
3728 return ggc_marked_p (from);
3730 /* Lookup an init priority for FROM, and return it if we find one. */
3733 decl_init_priority_lookup (tree from)
3735 struct tree_int_map *h, in;
3738 h = htab_find_with_hash (init_priority_for_decl,
3739 &in, htab_hash_pointer (from));
3745 /* Insert a mapping FROM->TO in the init priority hashtable. */
3748 decl_init_priority_insert (tree from, unsigned short to)
3750 struct tree_int_map *h;
3753 h = ggc_alloc (sizeof (struct tree_int_map));
3756 loc = htab_find_slot_with_hash (init_priority_for_decl, h,
3757 htab_hash_pointer (from), INSERT);
3758 *(struct tree_int_map **) loc = h;
3761 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
3764 print_debug_expr_statistics (void)
3766 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
3767 (long) htab_size (debug_expr_for_decl),
3768 (long) htab_elements (debug_expr_for_decl),
3769 htab_collisions (debug_expr_for_decl));
3772 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
3775 print_value_expr_statistics (void)
3777 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
3778 (long) htab_size (value_expr_for_decl),
3779 (long) htab_elements (value_expr_for_decl),
3780 htab_collisions (value_expr_for_decl));
3782 /* Lookup a debug expression for FROM, and return it if we find one. */
3785 decl_debug_expr_lookup (tree from)
3787 struct tree_map *h, in;
3790 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
3796 /* Insert a mapping FROM->TO in the debug expression hashtable. */
3799 decl_debug_expr_insert (tree from, tree to)
3804 h = ggc_alloc (sizeof (struct tree_map));
3805 h->hash = htab_hash_pointer (from);
3808 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
3809 *(struct tree_map **) loc = h;
3812 /* Lookup a value expression for FROM, and return it if we find one. */
3815 decl_value_expr_lookup (tree from)
3817 struct tree_map *h, in;
3820 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
3826 /* Insert a mapping FROM->TO in the value expression hashtable. */
3829 decl_value_expr_insert (tree from, tree to)
3834 h = ggc_alloc (sizeof (struct tree_map));
3835 h->hash = htab_hash_pointer (from);
3838 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
3839 *(struct tree_map **) loc = h;
3842 /* Hashing of types so that we don't make duplicates.
3843 The entry point is `type_hash_canon'. */
3845 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3846 with types in the TREE_VALUE slots), by adding the hash codes
3847 of the individual types. */
3850 type_hash_list (tree list, hashval_t hashcode)
3854 for (tail = list; tail; tail = TREE_CHAIN (tail))
3855 if (TREE_VALUE (tail) != error_mark_node)
3856 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3862 /* These are the Hashtable callback functions. */
3864 /* Returns true iff the types are equivalent. */
3867 type_hash_eq (const void *va, const void *vb)
3869 const struct type_hash *a = va, *b = vb;
3871 /* First test the things that are the same for all types. */
3872 if (a->hash != b->hash
3873 || TREE_CODE (a->type) != TREE_CODE (b->type)
3874 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3875 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3876 TYPE_ATTRIBUTES (b->type))
3877 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3878 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3881 switch (TREE_CODE (a->type))
3886 case REFERENCE_TYPE:
3890 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
3893 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3894 && !(TYPE_VALUES (a->type)
3895 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3896 && TYPE_VALUES (b->type)
3897 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3898 && type_list_equal (TYPE_VALUES (a->type),
3899 TYPE_VALUES (b->type))))
3902 /* ... fall through ... */
3908 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3909 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3910 TYPE_MAX_VALUE (b->type)))
3911 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3912 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3913 TYPE_MIN_VALUE (b->type))));
3916 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3919 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3920 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3921 || (TYPE_ARG_TYPES (a->type)
3922 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3923 && TYPE_ARG_TYPES (b->type)
3924 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3925 && type_list_equal (TYPE_ARG_TYPES (a->type),
3926 TYPE_ARG_TYPES (b->type)))));
3929 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3933 case QUAL_UNION_TYPE:
3934 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3935 || (TYPE_FIELDS (a->type)
3936 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3937 && TYPE_FIELDS (b->type)
3938 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3939 && type_list_equal (TYPE_FIELDS (a->type),
3940 TYPE_FIELDS (b->type))));
3943 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3944 || (TYPE_ARG_TYPES (a->type)
3945 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3946 && TYPE_ARG_TYPES (b->type)
3947 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3948 && type_list_equal (TYPE_ARG_TYPES (a->type),
3949 TYPE_ARG_TYPES (b->type))));
3956 /* Return the cached hash value. */
3959 type_hash_hash (const void *item)
3961 return ((const struct type_hash *) item)->hash;
3964 /* Look in the type hash table for a type isomorphic to TYPE.
3965 If one is found, return it. Otherwise return 0. */
3968 type_hash_lookup (hashval_t hashcode, tree type)
3970 struct type_hash *h, in;
3972 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3973 must call that routine before comparing TYPE_ALIGNs. */
3979 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3985 /* Add an entry to the type-hash-table
3986 for a type TYPE whose hash code is HASHCODE. */
3989 type_hash_add (hashval_t hashcode, tree type)
3991 struct type_hash *h;
3994 h = ggc_alloc (sizeof (struct type_hash));
3997 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3998 *(struct type_hash **) loc = h;
4001 /* Given TYPE, and HASHCODE its hash code, return the canonical
4002 object for an identical type if one already exists.
4003 Otherwise, return TYPE, and record it as the canonical object.
4005 To use this function, first create a type of the sort you want.
4006 Then compute its hash code from the fields of the type that
4007 make it different from other similar types.
4008 Then call this function and use the value. */
4011 type_hash_canon (unsigned int hashcode, tree type)
4015 /* The hash table only contains main variants, so ensure that's what we're
4017 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4019 if (!lang_hooks.types.hash_types)
4022 /* See if the type is in the hash table already. If so, return it.
4023 Otherwise, add the type. */
4024 t1 = type_hash_lookup (hashcode, type);
4027 #ifdef GATHER_STATISTICS
4028 tree_node_counts[(int) t_kind]--;
4029 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4035 type_hash_add (hashcode, type);
4040 /* See if the data pointed to by the type hash table is marked. We consider
4041 it marked if the type is marked or if a debug type number or symbol
4042 table entry has been made for the type. This reduces the amount of
4043 debugging output and eliminates that dependency of the debug output on
4044 the number of garbage collections. */
4047 type_hash_marked_p (const void *p)
4049 tree type = ((struct type_hash *) p)->type;
4051 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4055 print_type_hash_statistics (void)
4057 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4058 (long) htab_size (type_hash_table),
4059 (long) htab_elements (type_hash_table),
4060 htab_collisions (type_hash_table));
4063 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4064 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4065 by adding the hash codes of the individual attributes. */
4068 attribute_hash_list (tree list, hashval_t hashcode)
4072 for (tail = list; tail; tail = TREE_CHAIN (tail))
4073 /* ??? Do we want to add in TREE_VALUE too? */
4074 hashcode = iterative_hash_object
4075 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4079 /* Given two lists of attributes, return true if list l2 is
4080 equivalent to l1. */
4083 attribute_list_equal (tree l1, tree l2)
4085 return attribute_list_contained (l1, l2)
4086 && attribute_list_contained (l2, l1);
4089 /* Given two lists of attributes, return true if list L2 is
4090 completely contained within L1. */
4091 /* ??? This would be faster if attribute names were stored in a canonicalized
4092 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4093 must be used to show these elements are equivalent (which they are). */
4094 /* ??? It's not clear that attributes with arguments will always be handled
4098 attribute_list_contained (tree l1, tree l2)
4102 /* First check the obvious, maybe the lists are identical. */
4106 /* Maybe the lists are similar. */
4107 for (t1 = l1, t2 = l2;
4109 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4110 && TREE_VALUE (t1) == TREE_VALUE (t2);
4111 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4113 /* Maybe the lists are equal. */
4114 if (t1 == 0 && t2 == 0)
4117 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4120 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4122 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4125 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4132 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
4139 /* Given two lists of types
4140 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4141 return 1 if the lists contain the same types in the same order.
4142 Also, the TREE_PURPOSEs must match. */
4145 type_list_equal (tree l1, tree l2)
4149 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4150 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4151 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4152 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4153 && (TREE_TYPE (TREE_PURPOSE (t1))
4154 == TREE_TYPE (TREE_PURPOSE (t2))))))
4160 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4161 given by TYPE. If the argument list accepts variable arguments,
4162 then this function counts only the ordinary arguments. */
4165 type_num_arguments (tree type)
4170 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4171 /* If the function does not take a variable number of arguments,
4172 the last element in the list will have type `void'. */
4173 if (VOID_TYPE_P (TREE_VALUE (t)))
4181 /* Nonzero if integer constants T1 and T2
4182 represent the same constant value. */
4185 tree_int_cst_equal (tree t1, tree t2)
4190 if (t1 == 0 || t2 == 0)
4193 if (TREE_CODE (t1) == INTEGER_CST
4194 && TREE_CODE (t2) == INTEGER_CST
4195 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4196 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4202 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4203 The precise way of comparison depends on their data type. */
4206 tree_int_cst_lt (tree t1, tree t2)
4211 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4213 int t1_sgn = tree_int_cst_sgn (t1);
4214 int t2_sgn = tree_int_cst_sgn (t2);
4216 if (t1_sgn < t2_sgn)
4218 else if (t1_sgn > t2_sgn)
4220 /* Otherwise, both are non-negative, so we compare them as
4221 unsigned just in case one of them would overflow a signed
4224 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4225 return INT_CST_LT (t1, t2);
4227 return INT_CST_LT_UNSIGNED (t1, t2);
4230 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4233 tree_int_cst_compare (tree t1, tree t2)
4235 if (tree_int_cst_lt (t1, t2))
4237 else if (tree_int_cst_lt (t2, t1))
4243 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4244 the host. If POS is zero, the value can be represented in a single
4245 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
4246 be represented in a single unsigned HOST_WIDE_INT. */
4249 host_integerp (tree t, int pos)
4251 return (TREE_CODE (t) == INTEGER_CST
4252 && ! TREE_OVERFLOW (t)
4253 && ((TREE_INT_CST_HIGH (t) == 0
4254 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4255 || (! pos && TREE_INT_CST_HIGH (t) == -1
4256 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4257 && !TYPE_UNSIGNED (TREE_TYPE (t)))
4258 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4261 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4262 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4263 be positive. We must be able to satisfy the above conditions. */
4266 tree_low_cst (tree t, int pos)
4268 gcc_assert (host_integerp (t, pos));
4269 return TREE_INT_CST_LOW (t);
4272 /* Return the most significant bit of the integer constant T. */
4275 tree_int_cst_msb (tree t)
4279 unsigned HOST_WIDE_INT l;
4281 /* Note that using TYPE_PRECISION here is wrong. We care about the
4282 actual bits, not the (arbitrary) range of the type. */
4283 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4284 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4285 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4286 return (l & 1) == 1;
4289 /* Return an indication of the sign of the integer constant T.
4290 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4291 Note that -1 will never be returned it T's type is unsigned. */
4294 tree_int_cst_sgn (tree t)
4296 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4298 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4300 else if (TREE_INT_CST_HIGH (t) < 0)
4306 /* Compare two constructor-element-type constants. Return 1 if the lists
4307 are known to be equal; otherwise return 0. */
4310 simple_cst_list_equal (tree l1, tree l2)
4312 while (l1 != NULL_TREE && l2 != NULL_TREE)
4314 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4317 l1 = TREE_CHAIN (l1);
4318 l2 = TREE_CHAIN (l2);
4324 /* Return truthvalue of whether T1 is the same tree structure as T2.
4325 Return 1 if they are the same.
4326 Return 0 if they are understandably different.
4327 Return -1 if either contains tree structure not understood by
4331 simple_cst_equal (tree t1, tree t2)
4333 enum tree_code code1, code2;
4339 if (t1 == 0 || t2 == 0)
4342 code1 = TREE_CODE (t1);
4343 code2 = TREE_CODE (t2);
4345 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4347 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4348 || code2 == NON_LVALUE_EXPR)
4349 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4351 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4354 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4355 || code2 == NON_LVALUE_EXPR)
4356 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4364 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4365 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4368 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4371 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4372 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4373 TREE_STRING_LENGTH (t1)));
4377 unsigned HOST_WIDE_INT idx;
4378 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4379 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4381 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4384 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4385 /* ??? Should we handle also fields here? */
4386 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4387 VEC_index (constructor_elt, v2, idx)->value))
4393 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4396 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4400 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4403 /* Special case: if either target is an unallocated VAR_DECL,
4404 it means that it's going to be unified with whatever the
4405 TARGET_EXPR is really supposed to initialize, so treat it
4406 as being equivalent to anything. */
4407 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4408 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4409 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
4410 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4411 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4412 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
4415 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4420 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4422 case WITH_CLEANUP_EXPR:
4423 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4427 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
4430 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4431 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4445 /* This general rule works for most tree codes. All exceptions should be
4446 handled above. If this is a language-specific tree code, we can't
4447 trust what might be in the operand, so say we don't know
4449 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4452 switch (TREE_CODE_CLASS (code1))
4456 case tcc_comparison:
4457 case tcc_expression:
4461 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
4463 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4475 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4476 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4477 than U, respectively. */
4480 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
4482 if (tree_int_cst_sgn (t) < 0)
4484 else if (TREE_INT_CST_HIGH (t) != 0)
4486 else if (TREE_INT_CST_LOW (t) == u)
4488 else if (TREE_INT_CST_LOW (t) < u)
4494 /* Return true if CODE represents an associative tree code. Otherwise
4497 associative_tree_code (enum tree_code code)
4516 /* Return true if CODE represents a commutative tree code. Otherwise
4519 commutative_tree_code (enum tree_code code)
4532 case UNORDERED_EXPR:
4536 case TRUTH_AND_EXPR:
4537 case TRUTH_XOR_EXPR:
4547 /* Generate a hash value for an expression. This can be used iteratively
4548 by passing a previous result as the "val" argument.
4550 This function is intended to produce the same hash for expressions which
4551 would compare equal using operand_equal_p. */
4554 iterative_hash_expr (tree t, hashval_t val)
4557 enum tree_code code;
4561 return iterative_hash_pointer (t, val);
4563 code = TREE_CODE (t);
4567 /* Alas, constants aren't shared, so we can't rely on pointer
4570 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
4571 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
4574 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
4576 return iterative_hash_hashval_t (val2, val);
4579 return iterative_hash (TREE_STRING_POINTER (t),
4580 TREE_STRING_LENGTH (t), val);
4582 val = iterative_hash_expr (TREE_REALPART (t), val);
4583 return iterative_hash_expr (TREE_IMAGPART (t), val);
4585 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
4589 /* we can just compare by pointer. */
4590 return iterative_hash_pointer (t, val);
4593 /* A list of expressions, for a CALL_EXPR or as the elements of a
4595 for (; t; t = TREE_CHAIN (t))
4596 val = iterative_hash_expr (TREE_VALUE (t), val);
4600 unsigned HOST_WIDE_INT idx;
4602 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
4604 val = iterative_hash_expr (field, val);
4605 val = iterative_hash_expr (value, val);
4610 /* When referring to a built-in FUNCTION_DECL, use the
4611 __builtin__ form. Otherwise nodes that compare equal
4612 according to operand_equal_p might get different
4614 if (DECL_BUILT_IN (t))
4616 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
4620 /* else FALL THROUGH */
4622 class = TREE_CODE_CLASS (code);
4624 if (class == tcc_declaration)
4626 /* Otherwise, we can just compare decls by pointer. */
4627 val = iterative_hash_pointer (t, val);
4631 gcc_assert (IS_EXPR_CODE_CLASS (class));
4633 val = iterative_hash_object (code, val);
4635 /* Don't hash the type, that can lead to having nodes which
4636 compare equal according to operand_equal_p, but which
4637 have different hash codes. */
4638 if (code == NOP_EXPR
4639 || code == CONVERT_EXPR
4640 || code == NON_LVALUE_EXPR)
4642 /* Make sure to include signness in the hash computation. */
4643 val += TYPE_UNSIGNED (TREE_TYPE (t));
4644 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
4647 else if (commutative_tree_code (code))
4649 /* It's a commutative expression. We want to hash it the same
4650 however it appears. We do this by first hashing both operands
4651 and then rehashing based on the order of their independent
4653 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
4654 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
4658 t = one, one = two, two = t;
4660 val = iterative_hash_hashval_t (one, val);
4661 val = iterative_hash_hashval_t (two, val);
4664 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i)
4665 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
4672 /* Constructors for pointer, array and function types.
4673 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4674 constructed by language-dependent code, not here.) */
4676 /* Construct, lay out and return the type of pointers to TO_TYPE with
4677 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4678 reference all of memory. If such a type has already been
4679 constructed, reuse it. */
4682 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
4687 if (to_type == error_mark_node)
4688 return error_mark_node;
4690 /* In some cases, languages will have things that aren't a POINTER_TYPE
4691 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4692 In that case, return that type without regard to the rest of our
4695 ??? This is a kludge, but consistent with the way this function has
4696 always operated and there doesn't seem to be a good way to avoid this
4698 if (TYPE_POINTER_TO (to_type) != 0
4699 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4700 return TYPE_POINTER_TO (to_type);
4702 /* First, if we already have a type for pointers to TO_TYPE and it's
4703 the proper mode, use it. */
4704 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4705 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4708 t = make_node (POINTER_TYPE);
4710 TREE_TYPE (t) = to_type;
4711 TYPE_MODE (t) = mode;
4712 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4713 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
4714 TYPE_POINTER_TO (to_type) = t;
4716 /* Lay out the type. This function has many callers that are concerned
4717 with expression-construction, and this simplifies them all. */
4723 /* By default build pointers in ptr_mode. */
4726 build_pointer_type (tree to_type)
4728 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4731 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4734 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4739 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4740 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4741 In that case, return that type without regard to the rest of our
4744 ??? This is a kludge, but consistent with the way this function has
4745 always operated and there doesn't seem to be a good way to avoid this
4747 if (TYPE_REFERENCE_TO (to_type) != 0
4748 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4749 return TYPE_REFERENCE_TO (to_type);
4751 /* First, if we already have a type for pointers to TO_TYPE and it's
4752 the proper mode, use it. */
4753 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4754 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4757 t = make_node (REFERENCE_TYPE);
4759 TREE_TYPE (t) = to_type;
4760 TYPE_MODE (t) = mode;
4761 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4762 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4763 TYPE_REFERENCE_TO (to_type) = t;
4771 /* Build the node for the type of references-to-TO_TYPE by default
4775 build_reference_type (tree to_type)
4777 return build_reference_type_for_mode (to_type, ptr_mode, false);
4780 /* Build a type that is compatible with t but has no cv quals anywhere
4783 const char *const *const * -> char ***. */
4786 build_type_no_quals (tree t)
4788 switch (TREE_CODE (t))
4791 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4793 TYPE_REF_CAN_ALIAS_ALL (t));
4794 case REFERENCE_TYPE:
4796 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4798 TYPE_REF_CAN_ALIAS_ALL (t));
4800 return TYPE_MAIN_VARIANT (t);
4804 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4805 MAXVAL should be the maximum value in the domain
4806 (one less than the length of the array).
4808 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4809 We don't enforce this limit, that is up to caller (e.g. language front end).
4810 The limit exists because the result is a signed type and we don't handle
4811 sizes that use more than one HOST_WIDE_INT. */
4814 build_index_type (tree maxval)
4816 tree itype = make_node (INTEGER_TYPE);
4818 TREE_TYPE (itype) = sizetype;
4819 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4820 TYPE_MIN_VALUE (itype) = size_zero_node;
4821 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
4822 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4823 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4824 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4825 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4826 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4828 if (host_integerp (maxval, 1))
4829 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4834 /* Builds a signed or unsigned integer type of precision PRECISION.
4835 Used for C bitfields whose precision does not match that of
4836 built-in target types. */
4838 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
4841 tree itype = make_node (INTEGER_TYPE);
4843 TYPE_PRECISION (itype) = precision;
4846 fixup_unsigned_type (itype);
4848 fixup_signed_type (itype);
4850 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
4851 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
4856 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4857 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4858 low bound LOWVAL and high bound HIGHVAL.
4859 if TYPE==NULL_TREE, sizetype is used. */
4862 build_range_type (tree type, tree lowval, tree highval)
4864 tree itype = make_node (INTEGER_TYPE);
4866 TREE_TYPE (itype) = type;
4867 if (type == NULL_TREE)
4870 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4871 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4873 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4874 TYPE_MODE (itype) = TYPE_MODE (type);
4875 TYPE_SIZE (itype) = TYPE_SIZE (type);
4876 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4877 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4878 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4880 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4881 return type_hash_canon (tree_low_cst (highval, 0)
4882 - tree_low_cst (lowval, 0),
4888 /* Just like build_index_type, but takes lowval and highval instead
4889 of just highval (maxval). */
4892 build_index_2_type (tree lowval, tree highval)
4894 return build_range_type (sizetype, lowval, highval);
4897 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4898 and number of elements specified by the range of values of INDEX_TYPE.
4899 If such a type has already been constructed, reuse it. */
4902 build_array_type (tree elt_type, tree index_type)
4905 hashval_t hashcode = 0;
4907 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4909 error ("arrays of functions are not meaningful");
4910 elt_type = integer_type_node;
4913 t = make_node (ARRAY_TYPE);
4914 TREE_TYPE (t) = elt_type;
4915 TYPE_DOMAIN (t) = index_type;
4917 if (index_type == 0)
4923 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4924 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4925 t = type_hash_canon (hashcode, t);
4927 if (!COMPLETE_TYPE_P (t))
4932 /* Return the TYPE of the elements comprising
4933 the innermost dimension of ARRAY. */
4936 get_inner_array_type (tree array)
4938 tree type = TREE_TYPE (array);
4940 while (TREE_CODE (type) == ARRAY_TYPE)
4941 type = TREE_TYPE (type);
4946 /* Construct, lay out and return
4947 the type of functions returning type VALUE_TYPE
4948 given arguments of types ARG_TYPES.
4949 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4950 are data type nodes for the arguments of the function.
4951 If such a type has already been constructed, reuse it. */
4954 build_function_type (tree value_type, tree arg_types)
4957 hashval_t hashcode = 0;
4959 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4961 error ("function return type cannot be function");
4962 value_type = integer_type_node;
4965 /* Make a node of the sort we want. */
4966 t = make_node (FUNCTION_TYPE);
4967 TREE_TYPE (t) = value_type;
4968 TYPE_ARG_TYPES (t) = arg_types;
4970 /* If we already have such a type, use the old one. */
4971 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4972 hashcode = type_hash_list (arg_types, hashcode);
4973 t = type_hash_canon (hashcode, t);
4975 if (!COMPLETE_TYPE_P (t))
4980 /* Build a function type. The RETURN_TYPE is the type returned by the
4981 function. If additional arguments are provided, they are
4982 additional argument types. The list of argument types must always
4983 be terminated by NULL_TREE. */
4986 build_function_type_list (tree return_type, ...)
4991 va_start (p, return_type);
4993 t = va_arg (p, tree);
4994 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4995 args = tree_cons (NULL_TREE, t, args);
4997 if (args == NULL_TREE)
4998 args = void_list_node;
5002 args = nreverse (args);
5003 TREE_CHAIN (last) = void_list_node;
5005 args = build_function_type (return_type, args);
5011 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5012 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5013 for the method. An implicit additional parameter (of type
5014 pointer-to-BASETYPE) is added to the ARGTYPES. */
5017 build_method_type_directly (tree basetype,
5025 /* Make a node of the sort we want. */
5026 t = make_node (METHOD_TYPE);
5028 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5029 TREE_TYPE (t) = rettype;
5030 ptype = build_pointer_type (basetype);
5032 /* The actual arglist for this function includes a "hidden" argument
5033 which is "this". Put it into the list of argument types. */
5034 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5035 TYPE_ARG_TYPES (t) = argtypes;
5037 /* If we already have such a type, use the old one. */
5038 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5039 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5040 hashcode = type_hash_list (argtypes, hashcode);
5041 t = type_hash_canon (hashcode, t);
5043 if (!COMPLETE_TYPE_P (t))
5049 /* Construct, lay out and return the type of methods belonging to class
5050 BASETYPE and whose arguments and values are described by TYPE.
5051 If that type exists already, reuse it.
5052 TYPE must be a FUNCTION_TYPE node. */
5055 build_method_type (tree basetype, tree type)
5057 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5059 return build_method_type_directly (basetype,
5061 TYPE_ARG_TYPES (type));
5064 /* Construct, lay out and return the type of offsets to a value
5065 of type TYPE, within an object of type BASETYPE.
5066 If a suitable offset type exists already, reuse it. */
5069 build_offset_type (tree basetype, tree type)
5072 hashval_t hashcode = 0;
5074 /* Make a node of the sort we want. */
5075 t = make_node (OFFSET_TYPE);
5077 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5078 TREE_TYPE (t) = type;
5080 /* If we already have such a type, use the old one. */
5081 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5082 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5083 t = type_hash_canon (hashcode, t);
5085 if (!COMPLETE_TYPE_P (t))
5091 /* Create a complex type whose components are COMPONENT_TYPE. */
5094 build_complex_type (tree component_type)
5099 /* Make a node of the sort we want. */
5100 t = make_node (COMPLEX_TYPE);
5102 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5104 /* If we already have such a type, use the old one. */
5105 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5106 t = type_hash_canon (hashcode, t);
5108 if (!COMPLETE_TYPE_P (t))
5111 /* If we are writing Dwarf2 output we need to create a name,
5112 since complex is a fundamental type. */
5113 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5117 if (component_type == char_type_node)
5118 name = "complex char";
5119 else if (component_type == signed_char_type_node)
5120 name = "complex signed char";
5121 else if (component_type == unsigned_char_type_node)
5122 name = "complex unsigned char";
5123 else if (component_type == short_integer_type_node)
5124 name = "complex short int";
5125 else if (component_type == short_unsigned_type_node)
5126 name = "complex short unsigned int";
5127 else if (component_type == integer_type_node)
5128 name = "complex int";
5129 else if (component_type == unsigned_type_node)
5130 name = "complex unsigned int";
5131 else if (component_type == long_integer_type_node)
5132 name = "complex long int";
5133 else if (component_type == long_unsigned_type_node)
5134 name = "complex long unsigned int";
5135 else if (component_type == long_long_integer_type_node)
5136 name = "complex long long int";
5137 else if (component_type == long_long_unsigned_type_node)
5138 name = "complex long long unsigned int";
5143 TYPE_NAME (t) = get_identifier (name);
5146 return build_qualified_type (t, TYPE_QUALS (component_type));
5149 /* Return OP, stripped of any conversions to wider types as much as is safe.
5150 Converting the value back to OP's type makes a value equivalent to OP.
5152 If FOR_TYPE is nonzero, we return a value which, if converted to
5153 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5155 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5156 narrowest type that can hold the value, even if they don't exactly fit.
5157 Otherwise, bit-field references are changed to a narrower type
5158 only if they can be fetched directly from memory in that type.
5160 OP must have integer, real or enumeral type. Pointers are not allowed!
5162 There are some cases where the obvious value we could return
5163 would regenerate to OP if converted to OP's type,
5164 but would not extend like OP to wider types.
5165 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5166 For example, if OP is (unsigned short)(signed char)-1,
5167 we avoid returning (signed char)-1 if FOR_TYPE is int,
5168 even though extending that to an unsigned short would regenerate OP,
5169 since the result of extending (signed char)-1 to (int)
5170 is different from (int) OP. */
5173 get_unwidened (tree op, tree for_type)
5175 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5176 tree type = TREE_TYPE (op);
5178 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5180 = (for_type != 0 && for_type != type
5181 && final_prec > TYPE_PRECISION (type)
5182 && TYPE_UNSIGNED (type));
5185 while (TREE_CODE (op) == NOP_EXPR
5186 || TREE_CODE (op) == CONVERT_EXPR)
5190 /* TYPE_PRECISION on vector types has different meaning
5191 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5192 so avoid them here. */
5193 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5196 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5197 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5199 /* Truncations are many-one so cannot be removed.
5200 Unless we are later going to truncate down even farther. */
5202 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5205 /* See what's inside this conversion. If we decide to strip it,
5207 op = TREE_OPERAND (op, 0);
5209 /* If we have not stripped any zero-extensions (uns is 0),
5210 we can strip any kind of extension.
5211 If we have previously stripped a zero-extension,
5212 only zero-extensions can safely be stripped.
5213 Any extension can be stripped if the bits it would produce
5214 are all going to be discarded later by truncating to FOR_TYPE. */
5218 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5220 /* TYPE_UNSIGNED says whether this is a zero-extension.
5221 Let's avoid computing it if it does not affect WIN
5222 and if UNS will not be needed again. */
5224 || TREE_CODE (op) == NOP_EXPR
5225 || TREE_CODE (op) == CONVERT_EXPR)
5226 && TYPE_UNSIGNED (TREE_TYPE (op)))
5234 if (TREE_CODE (op) == COMPONENT_REF
5235 /* Since type_for_size always gives an integer type. */
5236 && TREE_CODE (type) != REAL_TYPE
5237 /* Don't crash if field not laid out yet. */
5238 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5239 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5241 unsigned int innerprec
5242 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5243 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5244 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5245 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5247 /* We can get this structure field in the narrowest type it fits in.
5248 If FOR_TYPE is 0, do this only for a field that matches the
5249 narrower type exactly and is aligned for it
5250 The resulting extension to its nominal type (a fullword type)
5251 must fit the same conditions as for other extensions. */
5254 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5255 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5256 && (! uns || final_prec <= innerprec || unsignedp))
5258 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5259 TREE_OPERAND (op, 1), NULL_TREE);
5260 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5261 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5268 /* Return OP or a simpler expression for a narrower value
5269 which can be sign-extended or zero-extended to give back OP.
5270 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5271 or 0 if the value should be sign-extended. */
5274 get_narrower (tree op, int *unsignedp_ptr)
5279 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5281 while (TREE_CODE (op) == NOP_EXPR)
5284 = (TYPE_PRECISION (TREE_TYPE (op))
5285 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5287 /* Truncations are many-one so cannot be removed. */
5291 /* See what's inside this conversion. If we decide to strip it,
5296 op = TREE_OPERAND (op, 0);
5297 /* An extension: the outermost one can be stripped,
5298 but remember whether it is zero or sign extension. */
5300 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5301 /* Otherwise, if a sign extension has been stripped,
5302 only sign extensions can now be stripped;
5303 if a zero extension has been stripped, only zero-extensions. */
5304 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5308 else /* bitschange == 0 */
5310 /* A change in nominal type can always be stripped, but we must
5311 preserve the unsignedness. */
5313 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5315 op = TREE_OPERAND (op, 0);
5316 /* Keep trying to narrow, but don't assign op to win if it
5317 would turn an integral type into something else. */
5318 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
5325 if (TREE_CODE (op) == COMPONENT_REF
5326 /* Since type_for_size always gives an integer type. */
5327 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
5328 /* Ensure field is laid out already. */
5329 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5330 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5332 unsigned HOST_WIDE_INT innerprec
5333 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5334 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5335 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5336 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5338 /* We can get this structure field in a narrower type that fits it,
5339 but the resulting extension to its nominal type (a fullword type)
5340 must satisfy the same conditions as for other extensions.
5342 Do this only for fields that are aligned (not bit-fields),
5343 because when bit-field insns will be used there is no
5344 advantage in doing this. */
5346 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5347 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5348 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
5352 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
5353 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5354 TREE_OPERAND (op, 1), NULL_TREE);
5355 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5356 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5359 *unsignedp_ptr = uns;
5363 /* Nonzero if integer constant C has a value that is permissible
5364 for type TYPE (an INTEGER_TYPE). */
5367 int_fits_type_p (tree c, tree type)
5369 tree type_low_bound = TYPE_MIN_VALUE (type);
5370 tree type_high_bound = TYPE_MAX_VALUE (type);
5371 bool ok_for_low_bound, ok_for_high_bound;
5374 /* If at least one bound of the type is a constant integer, we can check
5375 ourselves and maybe make a decision. If no such decision is possible, but
5376 this type is a subtype, try checking against that. Otherwise, use
5377 force_fit_type, which checks against the precision.
5379 Compute the status for each possibly constant bound, and return if we see
5380 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5381 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5382 for "constant known to fit". */
5384 /* Check if C >= type_low_bound. */
5385 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
5387 if (tree_int_cst_lt (c, type_low_bound))
5389 ok_for_low_bound = true;
5392 ok_for_low_bound = false;
5394 /* Check if c <= type_high_bound. */
5395 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
5397 if (tree_int_cst_lt (type_high_bound, c))
5399 ok_for_high_bound = true;
5402 ok_for_high_bound = false;
5404 /* If the constant fits both bounds, the result is known. */
5405 if (ok_for_low_bound && ok_for_high_bound)
5408 /* Perform some generic filtering which may allow making a decision
5409 even if the bounds are not constant. First, negative integers
5410 never fit in unsigned types, */
5411 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
5414 /* Second, narrower types always fit in wider ones. */
5415 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
5418 /* Third, unsigned integers with top bit set never fit signed types. */
5419 if (! TYPE_UNSIGNED (type)
5420 && TYPE_UNSIGNED (TREE_TYPE (c))
5421 && tree_int_cst_msb (c))
5424 /* If we haven't been able to decide at this point, there nothing more we
5425 can check ourselves here. Look at the base type if we have one. */
5426 if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
5427 return int_fits_type_p (c, TREE_TYPE (type));
5429 /* Or to force_fit_type, if nothing else. */
5430 tmp = copy_node (c);
5431 TREE_TYPE (tmp) = type;
5432 tmp = force_fit_type (tmp, -1, false, false);
5433 return TREE_INT_CST_HIGH (tmp) == TREE_INT_CST_HIGH (c)
5434 && TREE_INT_CST_LOW (tmp) == TREE_INT_CST_LOW (c);
5437 /* Subprogram of following function. Called by walk_tree.
5439 Return *TP if it is an automatic variable or parameter of the
5440 function passed in as DATA. */
5443 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
5445 tree fn = (tree) data;
5450 else if (DECL_P (*tp)
5451 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
5457 /* Returns true if T is, contains, or refers to a type with variable
5458 size. If FN is nonzero, only return true if a modifier of the type
5459 or position of FN is a variable or parameter inside FN.
5461 This concept is more general than that of C99 'variably modified types':
5462 in C99, a struct type is never variably modified because a VLA may not
5463 appear as a structure member. However, in GNU C code like:
5465 struct S { int i[f()]; };
5467 is valid, and other languages may define similar constructs. */
5470 variably_modified_type_p (tree type, tree fn)
5474 /* Test if T is either variable (if FN is zero) or an expression containing
5475 a variable in FN. */
5476 #define RETURN_TRUE_IF_VAR(T) \
5477 do { tree _t = (T); \
5478 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5479 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5480 return true; } while (0)
5482 if (type == error_mark_node)
5485 /* If TYPE itself has variable size, it is variably modified.
5487 We do not yet have a representation of the C99 '[*]' syntax.
5488 When a representation is chosen, this function should be modified
5489 to test for that case as well. */
5490 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
5491 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type));
5493 switch (TREE_CODE (type))
5496 case REFERENCE_TYPE:
5499 if (variably_modified_type_p (TREE_TYPE (type), fn))
5505 /* If TYPE is a function type, it is variably modified if any of the
5506 parameters or the return type are variably modified. */
5507 if (variably_modified_type_p (TREE_TYPE (type), fn))
5510 for (t = TYPE_ARG_TYPES (type);
5511 t && t != void_list_node;
5513 if (variably_modified_type_p (TREE_VALUE (t), fn))
5522 /* Scalar types are variably modified if their end points
5524 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
5525 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
5530 case QUAL_UNION_TYPE:
5531 /* We can't see if any of the field are variably-modified by the
5532 definition we normally use, since that would produce infinite
5533 recursion via pointers. */
5534 /* This is variably modified if some field's type is. */
5535 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
5536 if (TREE_CODE (t) == FIELD_DECL)
5538 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
5539 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
5540 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
5542 if (TREE_CODE (type) == QUAL_UNION_TYPE)
5543 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
5551 /* The current language may have other cases to check, but in general,
5552 all other types are not variably modified. */
5553 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
5555 #undef RETURN_TRUE_IF_VAR
5558 /* Given a DECL or TYPE, return the scope in which it was declared, or
5559 NULL_TREE if there is no containing scope. */
5562 get_containing_scope (tree t)
5564 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
5567 /* Return the innermost context enclosing DECL that is
5568 a FUNCTION_DECL, or zero if none. */
5571 decl_function_context (tree decl)
5575 if (TREE_CODE (decl) == ERROR_MARK)
5578 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5579 where we look up the function at runtime. Such functions always take
5580 a first argument of type 'pointer to real context'.
5582 C++ should really be fixed to use DECL_CONTEXT for the real context,
5583 and use something else for the "virtual context". */
5584 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
5587 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
5589 context = DECL_CONTEXT (decl);
5591 while (context && TREE_CODE (context) != FUNCTION_DECL)
5593 if (TREE_CODE (context) == BLOCK)
5594 context = BLOCK_SUPERCONTEXT (context);
5596 context = get_containing_scope (context);
5602 /* Return the innermost context enclosing DECL that is
5603 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5604 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5607 decl_type_context (tree decl)
5609 tree context = DECL_CONTEXT (decl);
5612 switch (TREE_CODE (context))
5614 case NAMESPACE_DECL:
5615 case TRANSLATION_UNIT_DECL:
5620 case QUAL_UNION_TYPE:
5625 context = DECL_CONTEXT (context);
5629 context = BLOCK_SUPERCONTEXT (context);
5639 /* CALL is a CALL_EXPR. Return the declaration for the function
5640 called, or NULL_TREE if the called function cannot be
5644 get_callee_fndecl (tree call)
5648 /* It's invalid to call this function with anything but a
5650 gcc_assert (TREE_CODE (call) == CALL_EXPR);
5652 /* The first operand to the CALL is the address of the function
5654 addr = TREE_OPERAND (call, 0);
5658 /* If this is a readonly function pointer, extract its initial value. */
5659 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5660 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5661 && DECL_INITIAL (addr))
5662 addr = DECL_INITIAL (addr);
5664 /* If the address is just `&f' for some function `f', then we know
5665 that `f' is being called. */
5666 if (TREE_CODE (addr) == ADDR_EXPR
5667 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5668 return TREE_OPERAND (addr, 0);
5670 /* We couldn't figure out what was being called. Maybe the front
5671 end has some idea. */
5672 return lang_hooks.lang_get_callee_fndecl (call);
5675 /* Print debugging information about tree nodes generated during the compile,
5676 and any language-specific information. */
5679 dump_tree_statistics (void)
5681 #ifdef GATHER_STATISTICS
5683 int total_nodes, total_bytes;
5686 fprintf (stderr, "\n??? tree nodes created\n\n");
5687 #ifdef GATHER_STATISTICS
5688 fprintf (stderr, "Kind Nodes Bytes\n");
5689 fprintf (stderr, "---------------------------------------\n");
5690 total_nodes = total_bytes = 0;
5691 for (i = 0; i < (int) all_kinds; i++)
5693 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
5694 tree_node_counts[i], tree_node_sizes[i]);
5695 total_nodes += tree_node_counts[i];
5696 total_bytes += tree_node_sizes[i];
5698 fprintf (stderr, "---------------------------------------\n");
5699 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
5700 fprintf (stderr, "---------------------------------------\n");
5701 ssanames_print_statistics ();
5702 phinodes_print_statistics ();
5704 fprintf (stderr, "(No per-node statistics)\n");
5706 print_type_hash_statistics ();
5707 print_debug_expr_statistics ();
5708 print_value_expr_statistics ();
5709 lang_hooks.print_statistics ();
5712 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5714 /* Generate a crc32 of a string. */
5717 crc32_string (unsigned chksum, const char *string)
5721 unsigned value = *string << 24;
5724 for (ix = 8; ix--; value <<= 1)
5728 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
5737 /* P is a string that will be used in a symbol. Mask out any characters
5738 that are not valid in that context. */
5741 clean_symbol_name (char *p)
5745 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5748 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5755 /* Generate a name for a function unique to this translation unit.
5756 TYPE is some string to identify the purpose of this function to the
5757 linker or collect2. */
5760 get_file_function_name_long (const char *type)
5766 if (first_global_object_name)
5767 p = first_global_object_name;
5770 /* We don't have anything that we know to be unique to this translation
5771 unit, so use what we do have and throw in some randomness. */
5773 const char *name = weak_global_object_name;
5774 const char *file = main_input_filename;
5779 file = input_filename;
5781 len = strlen (file);
5782 q = alloca (9 * 2 + len + 1);
5783 memcpy (q, file, len + 1);
5784 clean_symbol_name (q);
5786 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
5787 crc32_string (0, flag_random_seed));
5792 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
5794 /* Set up the name of the file-level functions we may need.
5795 Use a global object (which is already required to be unique over
5796 the program) rather than the file name (which imposes extra
5798 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5800 return get_identifier (buf);
5803 /* If KIND=='I', return a suitable global initializer (constructor) name.
5804 If KIND=='D', return a suitable global clean-up (destructor) name. */
5807 get_file_function_name (int kind)
5814 return get_file_function_name_long (p);
5817 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5819 /* Complain that the tree code of NODE does not match the expected 0
5820 terminated list of trailing codes. The trailing code list can be
5821 empty, for a more vague error message. FILE, LINE, and FUNCTION
5822 are of the caller. */
5825 tree_check_failed (const tree node, const char *file,
5826 int line, const char *function, ...)
5830 unsigned length = 0;
5833 va_start (args, function);
5834 while ((code = va_arg (args, int)))
5835 length += 4 + strlen (tree_code_name[code]);
5839 va_start (args, function);
5840 length += strlen ("expected ");
5841 buffer = alloca (length);
5843 while ((code = va_arg (args, int)))
5845 const char *prefix = length ? " or " : "expected ";
5847 strcpy (buffer + length, prefix);
5848 length += strlen (prefix);
5849 strcpy (buffer + length, tree_code_name[code]);
5850 length += strlen (tree_code_name[code]);
5855 buffer = (char *)"unexpected node";
5857 internal_error ("tree check: %s, have %s in %s, at %s:%d",
5858 buffer, tree_code_name[TREE_CODE (node)],
5859 function, trim_filename (file), line);
5862 /* Complain that the tree code of NODE does match the expected 0
5863 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5867 tree_not_check_failed (const tree node, const char *file,
5868 int line, const char *function, ...)
5872 unsigned length = 0;
5875 va_start (args, function);
5876 while ((code = va_arg (args, int)))
5877 length += 4 + strlen (tree_code_name[code]);
5879 va_start (args, function);
5880 buffer = alloca (length);
5882 while ((code = va_arg (args, int)))
5886 strcpy (buffer + length, " or ");
5889 strcpy (buffer + length, tree_code_name[code]);
5890 length += strlen (tree_code_name[code]);
5894 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5895 buffer, tree_code_name[TREE_CODE (node)],
5896 function, trim_filename (file), line);
5899 /* Similar to tree_check_failed, except that we check for a class of tree
5900 code, given in CL. */
5903 tree_class_check_failed (const tree node, const enum tree_code_class cl,
5904 const char *file, int line, const char *function)
5907 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
5908 TREE_CODE_CLASS_STRING (cl),
5909 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
5910 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5912 #undef DEFTREESTRUCT
5913 #define DEFTREESTRUCT(VAL, NAME) NAME,
5915 static const char *ts_enum_names[] = {
5916 #include "treestruct.def"
5918 #undef DEFTREESTRUCT
5920 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
5922 /* Similar to tree_class_check_failed, except that we check for
5923 whether CODE contains the tree structure identified by EN. */
5926 tree_contains_struct_check_failed (const tree node,
5927 const enum tree_node_structure_enum en,
5928 const char *file, int line,
5929 const char *function)
5932 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
5934 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5938 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5939 (dynamically sized) vector. */
5942 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5943 const char *function)
5946 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5947 idx + 1, len, function, trim_filename (file), line);
5950 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5951 (dynamically sized) vector. */
5954 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5955 const char *function)
5958 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5959 idx + 1, len, function, trim_filename (file), line);
5962 /* Similar to above, except that the check is for the bounds of the operand
5963 vector of an expression node. */
5966 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5967 int line, const char *function)
5970 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5971 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5972 function, trim_filename (file), line);
5974 #endif /* ENABLE_TREE_CHECKING */
5976 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5977 and mapped to the machine mode MODE. Initialize its fields and build
5978 the information necessary for debugging output. */
5981 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
5983 tree t = make_node (VECTOR_TYPE);
5985 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
5986 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
5987 TYPE_MODE (t) = mode;
5988 TYPE_READONLY (t) = TYPE_READONLY (innertype);
5989 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
5994 tree index = build_int_cst (NULL_TREE, nunits - 1);
5995 tree array = build_array_type (innertype, build_index_type (index));
5996 tree rt = make_node (RECORD_TYPE);
5998 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5999 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6001 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6002 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6003 the representation type, and we want to find that die when looking up
6004 the vector type. This is most easily achieved by making the TYPE_UID
6006 TYPE_UID (rt) = TYPE_UID (t);
6009 /* Build our main variant, based on the main variant of the inner type. */
6010 if (TYPE_MAIN_VARIANT (innertype) != innertype)
6012 tree innertype_main_variant = TYPE_MAIN_VARIANT (innertype);
6013 unsigned int hash = TYPE_HASH (innertype_main_variant);
6014 TYPE_MAIN_VARIANT (t)
6015 = type_hash_canon (hash, make_vector_type (innertype_main_variant,
6023 make_or_reuse_type (unsigned size, int unsignedp)
6025 if (size == INT_TYPE_SIZE)
6026 return unsignedp ? unsigned_type_node : integer_type_node;
6027 if (size == CHAR_TYPE_SIZE)
6028 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6029 if (size == SHORT_TYPE_SIZE)
6030 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6031 if (size == LONG_TYPE_SIZE)
6032 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6033 if (size == LONG_LONG_TYPE_SIZE)
6034 return (unsignedp ? long_long_unsigned_type_node
6035 : long_long_integer_type_node);
6038 return make_unsigned_type (size);
6040 return make_signed_type (size);
6043 /* Create nodes for all integer types (and error_mark_node) using the sizes
6044 of C datatypes. The caller should call set_sizetype soon after calling
6045 this function to select one of the types as sizetype. */
6048 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6050 error_mark_node = make_node (ERROR_MARK);
6051 TREE_TYPE (error_mark_node) = error_mark_node;
6053 initialize_sizetypes (signed_sizetype);
6055 /* Define both `signed char' and `unsigned char'. */
6056 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6057 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6059 /* Define `char', which is like either `signed char' or `unsigned char'
6060 but not the same as either. */
6063 ? make_signed_type (CHAR_TYPE_SIZE)
6064 : make_unsigned_type (CHAR_TYPE_SIZE));
6066 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6067 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6068 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6069 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6070 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6071 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6072 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6073 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6075 /* Define a boolean type. This type only represents boolean values but
6076 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6077 Front ends which want to override this size (i.e. Java) can redefine
6078 boolean_type_node before calling build_common_tree_nodes_2. */
6079 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6080 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6081 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6082 TYPE_PRECISION (boolean_type_node) = 1;
6084 /* Fill in the rest of the sized types. Reuse existing type nodes
6086 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6087 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6088 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6089 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6090 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6092 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6093 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6094 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6095 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6096 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6098 access_public_node = get_identifier ("public");
6099 access_protected_node = get_identifier ("protected");
6100 access_private_node = get_identifier ("private");
6103 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6104 It will create several other common tree nodes. */
6107 build_common_tree_nodes_2 (int short_double)
6109 /* Define these next since types below may used them. */
6110 integer_zero_node = build_int_cst (NULL_TREE, 0);
6111 integer_one_node = build_int_cst (NULL_TREE, 1);
6112 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6114 size_zero_node = size_int (0);
6115 size_one_node = size_int (1);
6116 bitsize_zero_node = bitsize_int (0);
6117 bitsize_one_node = bitsize_int (1);
6118 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6120 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6121 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6123 void_type_node = make_node (VOID_TYPE);
6124 layout_type (void_type_node);
6126 /* We are not going to have real types in C with less than byte alignment,
6127 so we might as well not have any types that claim to have it. */
6128 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6129 TYPE_USER_ALIGN (void_type_node) = 0;
6131 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6132 layout_type (TREE_TYPE (null_pointer_node));
6134 ptr_type_node = build_pointer_type (void_type_node);
6136 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6137 fileptr_type_node = ptr_type_node;
6139 float_type_node = make_node (REAL_TYPE);
6140 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6141 layout_type (float_type_node);
6143 double_type_node = make_node (REAL_TYPE);
6145 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6147 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6148 layout_type (double_type_node);
6150 long_double_type_node = make_node (REAL_TYPE);
6151 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6152 layout_type (long_double_type_node);
6154 float_ptr_type_node = build_pointer_type (float_type_node);
6155 double_ptr_type_node = build_pointer_type (double_type_node);
6156 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6157 integer_ptr_type_node = build_pointer_type (integer_type_node);
6159 complex_integer_type_node = make_node (COMPLEX_TYPE);
6160 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6161 layout_type (complex_integer_type_node);
6163 complex_float_type_node = make_node (COMPLEX_TYPE);
6164 TREE_TYPE (complex_float_type_node) = float_type_node;
6165 layout_type (complex_float_type_node);
6167 complex_double_type_node = make_node (COMPLEX_TYPE);
6168 TREE_TYPE (complex_double_type_node) = double_type_node;
6169 layout_type (complex_double_type_node);
6171 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6172 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6173 layout_type (complex_long_double_type_node);
6176 tree t = targetm.build_builtin_va_list ();
6178 /* Many back-ends define record types without setting TYPE_NAME.
6179 If we copied the record type here, we'd keep the original
6180 record type without a name. This breaks name mangling. So,
6181 don't copy record types and let c_common_nodes_and_builtins()
6182 declare the type to be __builtin_va_list. */
6183 if (TREE_CODE (t) != RECORD_TYPE)
6184 t = build_variant_type_copy (t);
6186 va_list_type_node = t;
6190 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6193 local_define_builtin (const char *name, tree type, enum built_in_function code,
6194 const char *library_name, int ecf_flags)
6198 decl = lang_hooks.builtin_function (name, type, code, BUILT_IN_NORMAL,
6199 library_name, NULL_TREE);
6200 if (ecf_flags & ECF_CONST)
6201 TREE_READONLY (decl) = 1;
6202 if (ecf_flags & ECF_PURE)
6203 DECL_IS_PURE (decl) = 1;
6204 if (ecf_flags & ECF_NORETURN)
6205 TREE_THIS_VOLATILE (decl) = 1;
6206 if (ecf_flags & ECF_NOTHROW)
6207 TREE_NOTHROW (decl) = 1;
6208 if (ecf_flags & ECF_MALLOC)
6209 DECL_IS_MALLOC (decl) = 1;
6211 built_in_decls[code] = decl;
6212 implicit_built_in_decls[code] = decl;
6215 /* Call this function after instantiating all builtins that the language
6216 front end cares about. This will build the rest of the builtins that
6217 are relied upon by the tree optimizers and the middle-end. */
6220 build_common_builtin_nodes (void)
6224 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
6225 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6227 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6228 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6229 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6230 ftype = build_function_type (ptr_type_node, tmp);
6232 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
6233 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
6234 "memcpy", ECF_NOTHROW);
6235 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6236 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
6237 "memmove", ECF_NOTHROW);
6240 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
6242 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6243 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6244 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6245 ftype = build_function_type (integer_type_node, tmp);
6246 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
6247 "memcmp", ECF_PURE | ECF_NOTHROW);
6250 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
6252 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6253 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
6254 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6255 ftype = build_function_type (ptr_type_node, tmp);
6256 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
6257 "memset", ECF_NOTHROW);
6260 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
6262 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6263 ftype = build_function_type (ptr_type_node, tmp);
6264 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
6265 "alloca", ECF_NOTHROW | ECF_MALLOC);
6268 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6269 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6270 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6271 ftype = build_function_type (void_type_node, tmp);
6272 local_define_builtin ("__builtin_init_trampoline", ftype,
6273 BUILT_IN_INIT_TRAMPOLINE,
6274 "__builtin_init_trampoline", ECF_NOTHROW);
6276 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6277 ftype = build_function_type (ptr_type_node, tmp);
6278 local_define_builtin ("__builtin_adjust_trampoline", ftype,
6279 BUILT_IN_ADJUST_TRAMPOLINE,
6280 "__builtin_adjust_trampoline",
6281 ECF_CONST | ECF_NOTHROW);
6283 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6284 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6285 ftype = build_function_type (void_type_node, tmp);
6286 local_define_builtin ("__builtin_nonlocal_goto", ftype,
6287 BUILT_IN_NONLOCAL_GOTO,
6288 "__builtin_nonlocal_goto",
6289 ECF_NORETURN | ECF_NOTHROW);
6291 ftype = build_function_type (ptr_type_node, void_list_node);
6292 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
6293 "__builtin_stack_save", ECF_NOTHROW);
6295 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6296 ftype = build_function_type (void_type_node, tmp);
6297 local_define_builtin ("__builtin_stack_restore", ftype,
6298 BUILT_IN_STACK_RESTORE,
6299 "__builtin_stack_restore", ECF_NOTHROW);
6301 ftype = build_function_type (void_type_node, void_list_node);
6302 local_define_builtin ("__builtin_profile_func_enter", ftype,
6303 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
6304 local_define_builtin ("__builtin_profile_func_exit", ftype,
6305 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
6307 /* Complex multiplication and division. These are handled as builtins
6308 rather than optabs because emit_library_call_value doesn't support
6309 complex. Further, we can do slightly better with folding these
6310 beasties if the real and complex parts of the arguments are separate. */
6312 enum machine_mode mode;
6314 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
6316 char mode_name_buf[4], *q;
6318 enum built_in_function mcode, dcode;
6319 tree type, inner_type;
6321 type = lang_hooks.types.type_for_mode (mode, 0);
6324 inner_type = TREE_TYPE (type);
6326 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
6327 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6328 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6329 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6330 ftype = build_function_type (type, tmp);
6332 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6333 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6335 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
6339 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
6340 local_define_builtin (built_in_names[mcode], ftype, mcode,
6341 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
6343 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
6344 local_define_builtin (built_in_names[dcode], ftype, dcode,
6345 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
6350 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6353 If we requested a pointer to a vector, build up the pointers that
6354 we stripped off while looking for the inner type. Similarly for
6355 return values from functions.
6357 The argument TYPE is the top of the chain, and BOTTOM is the
6358 new type which we will point to. */
6361 reconstruct_complex_type (tree type, tree bottom)
6365 if (POINTER_TYPE_P (type))
6367 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6368 outer = build_pointer_type (inner);
6370 else if (TREE_CODE (type) == ARRAY_TYPE)
6372 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6373 outer = build_array_type (inner, TYPE_DOMAIN (type));
6375 else if (TREE_CODE (type) == FUNCTION_TYPE)
6377 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6378 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
6380 else if (TREE_CODE (type) == METHOD_TYPE)
6383 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6384 /* The build_method_type_directly() routine prepends 'this' to argument list,
6385 so we must compensate by getting rid of it. */
6386 argtypes = TYPE_ARG_TYPES (type);
6387 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
6389 TYPE_ARG_TYPES (type));
6390 TYPE_ARG_TYPES (outer) = argtypes;
6395 TYPE_READONLY (outer) = TYPE_READONLY (type);
6396 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
6401 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6404 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
6408 switch (GET_MODE_CLASS (mode))
6410 case MODE_VECTOR_INT:
6411 case MODE_VECTOR_FLOAT:
6412 nunits = GET_MODE_NUNITS (mode);
6416 /* Check that there are no leftover bits. */
6417 gcc_assert (GET_MODE_BITSIZE (mode)
6418 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
6420 nunits = GET_MODE_BITSIZE (mode)
6421 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
6428 return make_vector_type (innertype, nunits, mode);
6431 /* Similarly, but takes the inner type and number of units, which must be
6435 build_vector_type (tree innertype, int nunits)
6437 return make_vector_type (innertype, nunits, VOIDmode);
6440 /* Build RESX_EXPR with given REGION_NUMBER. */
6442 build_resx (int region_number)
6445 t = build1 (RESX_EXPR, void_type_node,
6446 build_int_cst (NULL_TREE, region_number));
6450 /* Given an initializer INIT, return TRUE if INIT is zero or some
6451 aggregate of zeros. Otherwise return FALSE. */
6453 initializer_zerop (tree init)
6459 switch (TREE_CODE (init))
6462 return integer_zerop (init);
6465 /* ??? Note that this is not correct for C4X float formats. There,
6466 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6467 negative exponent. */
6468 return real_zerop (init)
6469 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
6472 return integer_zerop (init)
6473 || (real_zerop (init)
6474 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
6475 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
6478 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
6479 if (!initializer_zerop (TREE_VALUE (elt)))
6485 unsigned HOST_WIDE_INT idx;
6487 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
6488 if (!initializer_zerop (elt))
6499 add_var_to_bind_expr (tree bind_expr, tree var)
6501 BIND_EXPR_VARS (bind_expr)
6502 = chainon (BIND_EXPR_VARS (bind_expr), var);
6503 if (BIND_EXPR_BLOCK (bind_expr))
6504 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
6505 = BIND_EXPR_VARS (bind_expr);
6508 /* Build an empty statement. */
6511 build_empty_stmt (void)
6513 return build1 (NOP_EXPR, void_type_node, size_zero_node);
6517 /* Returns true if it is possible to prove that the index of
6518 an array access REF (an ARRAY_REF expression) falls into the
6522 in_array_bounds_p (tree ref)
6524 tree idx = TREE_OPERAND (ref, 1);
6527 if (TREE_CODE (idx) != INTEGER_CST)
6530 min = array_ref_low_bound (ref);
6531 max = array_ref_up_bound (ref);
6534 || TREE_CODE (min) != INTEGER_CST
6535 || TREE_CODE (max) != INTEGER_CST)
6538 if (tree_int_cst_lt (idx, min)
6539 || tree_int_cst_lt (max, idx))
6545 /* Return true if T (assumed to be a DECL) is a global variable. */
6548 is_global_var (tree t)
6550 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
6553 /* Return true if T (assumed to be a DECL) must be assigned a memory
6557 needs_to_live_in_memory (tree t)
6559 return (TREE_ADDRESSABLE (t)
6560 || is_global_var (t)
6561 || (TREE_CODE (t) == RESULT_DECL
6562 && aggregate_value_p (t, current_function_decl)));
6565 /* There are situations in which a language considers record types
6566 compatible which have different field lists. Decide if two fields
6567 are compatible. It is assumed that the parent records are compatible. */
6570 fields_compatible_p (tree f1, tree f2)
6572 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
6573 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
6576 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
6577 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
6580 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
6586 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
6589 find_compatible_field (tree record, tree orig_field)
6593 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
6594 if (TREE_CODE (f) == FIELD_DECL
6595 && fields_compatible_p (f, orig_field))
6598 /* ??? Why isn't this on the main fields list? */
6599 f = TYPE_VFIELD (record);
6600 if (f && TREE_CODE (f) == FIELD_DECL
6601 && fields_compatible_p (f, orig_field))
6604 /* ??? We should abort here, but Java appears to do Bad Things
6605 with inherited fields. */
6609 /* Return value of a constant X. */
6612 int_cst_value (tree x)
6614 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
6615 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
6616 bool negative = ((val >> (bits - 1)) & 1) != 0;
6618 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
6621 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
6623 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
6628 /* Returns the greatest common divisor of A and B, which must be
6632 tree_fold_gcd (tree a, tree b)
6635 tree type = TREE_TYPE (a);
6637 gcc_assert (TREE_CODE (a) == INTEGER_CST);
6638 gcc_assert (TREE_CODE (b) == INTEGER_CST);
6640 if (integer_zerop (a))
6643 if (integer_zerop (b))
6646 if (tree_int_cst_sgn (a) == -1)
6647 a = fold_build2 (MULT_EXPR, type, a,
6648 convert (type, integer_minus_one_node));
6650 if (tree_int_cst_sgn (b) == -1)
6651 b = fold_build2 (MULT_EXPR, type, b,
6652 convert (type, integer_minus_one_node));
6656 a_mod_b = fold_build2 (FLOOR_MOD_EXPR, type, a, b);
6658 if (!TREE_INT_CST_LOW (a_mod_b)
6659 && !TREE_INT_CST_HIGH (a_mod_b))
6667 /* Returns unsigned variant of TYPE. */
6670 unsigned_type_for (tree type)
6672 return lang_hooks.types.unsigned_type (type);
6675 /* Returns signed variant of TYPE. */
6678 signed_type_for (tree type)
6680 return lang_hooks.types.signed_type (type);
6683 /* Returns the largest value obtainable by casting something in INNER type to
6687 upper_bound_in_type (tree outer, tree inner)
6689 unsigned HOST_WIDE_INT lo, hi;
6690 unsigned int det = 0;
6691 unsigned oprec = TYPE_PRECISION (outer);
6692 unsigned iprec = TYPE_PRECISION (inner);
6695 /* Compute a unique number for every combination. */
6696 det |= (oprec > iprec) ? 4 : 0;
6697 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
6698 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
6700 /* Determine the exponent to use. */
6705 /* oprec <= iprec, outer: signed, inner: don't care. */
6710 /* oprec <= iprec, outer: unsigned, inner: don't care. */
6714 /* oprec > iprec, outer: signed, inner: signed. */
6718 /* oprec > iprec, outer: signed, inner: unsigned. */
6722 /* oprec > iprec, outer: unsigned, inner: signed. */
6726 /* oprec > iprec, outer: unsigned, inner: unsigned. */
6733 /* Compute 2^^prec - 1. */
6734 if (prec <= HOST_BITS_PER_WIDE_INT)
6737 lo = ((~(unsigned HOST_WIDE_INT) 0)
6738 >> (HOST_BITS_PER_WIDE_INT - prec));
6742 hi = ((~(unsigned HOST_WIDE_INT) 0)
6743 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
6744 lo = ~(unsigned HOST_WIDE_INT) 0;
6747 return build_int_cst_wide (outer, lo, hi);
6750 /* Returns the smallest value obtainable by casting something in INNER type to
6754 lower_bound_in_type (tree outer, tree inner)
6756 unsigned HOST_WIDE_INT lo, hi;
6757 unsigned oprec = TYPE_PRECISION (outer);
6758 unsigned iprec = TYPE_PRECISION (inner);
6760 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
6762 if (TYPE_UNSIGNED (outer)
6763 /* If we are widening something of an unsigned type, OUTER type
6764 contains all values of INNER type. In particular, both INNER
6765 and OUTER types have zero in common. */
6766 || (oprec > iprec && TYPE_UNSIGNED (inner)))
6770 /* If we are widening a signed type to another signed type, we
6771 want to obtain -2^^(iprec-1). If we are keeping the
6772 precision or narrowing to a signed type, we want to obtain
6774 unsigned prec = oprec > iprec ? iprec : oprec;
6776 if (prec <= HOST_BITS_PER_WIDE_INT)
6778 hi = ~(unsigned HOST_WIDE_INT) 0;
6779 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
6783 hi = ((~(unsigned HOST_WIDE_INT) 0)
6784 << (prec - HOST_BITS_PER_WIDE_INT - 1));
6789 return build_int_cst_wide (outer, lo, hi);
6792 /* Return nonzero if two operands that are suitable for PHI nodes are
6793 necessarily equal. Specifically, both ARG0 and ARG1 must be either
6794 SSA_NAME or invariant. Note that this is strictly an optimization.
6795 That is, callers of this function can directly call operand_equal_p
6796 and get the same result, only slower. */
6799 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
6803 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
6805 return operand_equal_p (arg0, arg1, 0);
6808 /* Returns number of zeros at the end of binary representation of X.
6810 ??? Use ffs if available? */
6813 num_ending_zeros (tree x)
6815 unsigned HOST_WIDE_INT fr, nfr;
6816 unsigned num, abits;
6817 tree type = TREE_TYPE (x);
6819 if (TREE_INT_CST_LOW (x) == 0)
6821 num = HOST_BITS_PER_WIDE_INT;
6822 fr = TREE_INT_CST_HIGH (x);
6827 fr = TREE_INT_CST_LOW (x);
6830 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
6833 if (nfr << abits == fr)
6840 if (num > TYPE_PRECISION (type))
6841 num = TYPE_PRECISION (type);
6843 return build_int_cst_type (type, num);
6847 #define WALK_SUBTREE(NODE) \
6850 result = walk_tree (&(NODE), func, data, pset); \
6856 /* This is a subroutine of walk_tree that walks field of TYPE that are to
6857 be walked whenever a type is seen in the tree. Rest of operands and return
6858 value are as for walk_tree. */
6861 walk_type_fields (tree type, walk_tree_fn func, void *data,
6862 struct pointer_set_t *pset)
6864 tree result = NULL_TREE;
6866 switch (TREE_CODE (type))
6869 case REFERENCE_TYPE:
6870 /* We have to worry about mutually recursive pointers. These can't
6871 be written in C. They can in Ada. It's pathological, but
6872 there's an ACATS test (c38102a) that checks it. Deal with this
6873 by checking if we're pointing to another pointer, that one
6874 points to another pointer, that one does too, and we have no htab.
6875 If so, get a hash table. We check three levels deep to avoid
6876 the cost of the hash table if we don't need one. */
6877 if (POINTER_TYPE_P (TREE_TYPE (type))
6878 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
6879 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
6882 result = walk_tree_without_duplicates (&TREE_TYPE (type),
6890 /* ... fall through ... */
6893 WALK_SUBTREE (TREE_TYPE (type));
6897 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
6902 WALK_SUBTREE (TREE_TYPE (type));
6906 /* We never want to walk into default arguments. */
6907 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
6908 WALK_SUBTREE (TREE_VALUE (arg));
6913 /* Don't follow this nodes's type if a pointer for fear that we'll
6914 have infinite recursion. Those types are uninteresting anyway. */
6915 if (!POINTER_TYPE_P (TREE_TYPE (type))
6916 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE)
6917 WALK_SUBTREE (TREE_TYPE (type));
6918 WALK_SUBTREE (TYPE_DOMAIN (type));
6926 WALK_SUBTREE (TYPE_MIN_VALUE (type));
6927 WALK_SUBTREE (TYPE_MAX_VALUE (type));
6931 WALK_SUBTREE (TREE_TYPE (type));
6932 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
6942 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
6943 called with the DATA and the address of each sub-tree. If FUNC returns a
6944 non-NULL value, the traversal is stopped, and the value returned by FUNC
6945 is returned. If PSET is non-NULL it is used to record the nodes visited,
6946 and to avoid visiting a node more than once. */
6949 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
6951 enum tree_code code;
6955 #define WALK_SUBTREE_TAIL(NODE) \
6959 goto tail_recurse; \
6964 /* Skip empty subtrees. */
6968 /* Don't walk the same tree twice, if the user has requested
6969 that we avoid doing so. */
6970 if (pset && pointer_set_insert (pset, *tp))
6973 /* Call the function. */
6975 result = (*func) (tp, &walk_subtrees, data);
6977 /* If we found something, return it. */
6981 code = TREE_CODE (*tp);
6983 /* Even if we didn't, FUNC may have decided that there was nothing
6984 interesting below this point in the tree. */
6987 if (code == TREE_LIST)
6988 /* But we still need to check our siblings. */
6989 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
6994 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
6996 if (result || ! walk_subtrees)
6999 /* If this is a DECL_EXPR, walk into various fields of the type that it's
7000 defining. We only want to walk into these fields of a type in this
7001 case. Note that decls get walked as part of the processing of a
7004 ??? Precisely which fields of types that we are supposed to walk in
7005 this case vs. the normal case aren't well defined. */
7006 if (code == DECL_EXPR
7007 && TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL
7008 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp))) != ERROR_MARK)
7010 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
7012 /* Call the function for the type. See if it returns anything or
7013 doesn't want us to continue. If we are to continue, walk both
7014 the normal fields and those for the declaration case. */
7015 result = (*func) (type_p, &walk_subtrees, data);
7016 if (result || !walk_subtrees)
7019 result = walk_type_fields (*type_p, func, data, pset);
7023 WALK_SUBTREE (TYPE_SIZE (*type_p));
7024 WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p));
7026 /* If this is a record type, also walk the fields. */
7027 if (TREE_CODE (*type_p) == RECORD_TYPE
7028 || TREE_CODE (*type_p) == UNION_TYPE
7029 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7033 for (field = TYPE_FIELDS (*type_p); field;
7034 field = TREE_CHAIN (field))
7036 /* We'd like to look at the type of the field, but we can easily
7037 get infinite recursion. So assume it's pointed to elsewhere
7038 in the tree. Also, ignore things that aren't fields. */
7039 if (TREE_CODE (field) != FIELD_DECL)
7042 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
7043 WALK_SUBTREE (DECL_SIZE (field));
7044 WALK_SUBTREE (DECL_SIZE_UNIT (field));
7045 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7046 WALK_SUBTREE (DECL_QUALIFIER (field));
7051 else if (code != SAVE_EXPR
7052 && code != BIND_EXPR
7053 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
7057 /* Walk over all the sub-trees of this operand. */
7058 len = TREE_CODE_LENGTH (code);
7059 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7060 But, we only want to walk once. */
7061 if (code == TARGET_EXPR
7062 && TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1))
7065 /* Go through the subtrees. We need to do this in forward order so
7066 that the scope of a FOR_EXPR is handled properly. */
7067 #ifdef DEBUG_WALK_TREE
7068 for (i = 0; i < len; ++i)
7069 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7071 for (i = 0; i < len - 1; ++i)
7072 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7076 /* The common case is that we may tail recurse here. */
7077 if (code != BIND_EXPR
7078 && !TREE_CHAIN (*tp))
7079 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
7081 WALK_SUBTREE (TREE_OPERAND (*tp, len - 1));
7086 /* If this is a type, walk the needed fields in the type. */
7087 else if (TYPE_P (*tp))
7089 result = walk_type_fields (*tp, func, data, pset);
7095 /* Not one of the easy cases. We must explicitly go through the
7100 case IDENTIFIER_NODE:
7106 case PLACEHOLDER_EXPR:
7110 /* None of these have subtrees other than those already walked
7115 WALK_SUBTREE (TREE_VALUE (*tp));
7116 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7121 int len = TREE_VEC_LENGTH (*tp);
7126 /* Walk all elements but the first. */
7128 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
7130 /* Now walk the first one as a tail call. */
7131 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
7135 WALK_SUBTREE (TREE_REALPART (*tp));
7136 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
7140 unsigned HOST_WIDE_INT idx;
7141 constructor_elt *ce;
7144 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
7146 WALK_SUBTREE (ce->value);
7151 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
7156 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
7158 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7159 into declarations that are just mentioned, rather than
7160 declared; they don't really belong to this part of the tree.
7161 And, we can see cycles: the initializer for a declaration
7162 can refer to the declaration itself. */
7163 WALK_SUBTREE (DECL_INITIAL (decl));
7164 WALK_SUBTREE (DECL_SIZE (decl));
7165 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
7167 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
7170 case STATEMENT_LIST:
7172 tree_stmt_iterator i;
7173 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
7174 WALK_SUBTREE (*tsi_stmt_ptr (i));
7179 /* ??? This could be a language-defined node. We really should make
7180 a hook for it, but right now just ignore it. */
7185 /* We didn't find what we were looking for. */
7188 #undef WALK_SUBTREE_TAIL
7192 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7195 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
7198 struct pointer_set_t *pset;
7200 pset = pointer_set_create ();
7201 result = walk_tree (tp, func, data, pset);
7202 pointer_set_destroy (pset);
7206 #include "gt-tree.h"