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, 2006
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This file contains the low level primitives for operating on tree nodes,
24 including allocation, list operations, interning of identifiers,
25 construction of data type nodes and statement nodes,
26 and construction of type conversion nodes. It also contains
27 tables index by tree code that describe how to take apart
30 It is intended to be language-independent, but occasionally
31 calls language-dependent routines defined (for C) in typecheck.c. */
35 #include "coretypes.h"
48 #include "langhooks.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
55 /* Each tree code class has an associated string representation.
56 These must correspond to the tree_code_class entries. */
58 const char *const tree_code_class_strings[] =
72 /* obstack.[ch] explicitly declined to prototype this. */
73 extern int _obstack_allocated_p (struct obstack *h, void *obj);
75 #ifdef GATHER_STATISTICS
76 /* Statistics-gathering stuff. */
78 int tree_node_counts[(int) all_kinds];
79 int tree_node_sizes[(int) all_kinds];
81 /* Keep in sync with tree.h:enum tree_node_kind. */
82 static const char * const tree_node_kind_names[] = {
103 #endif /* GATHER_STATISTICS */
105 /* Unique id for next decl created. */
106 static GTY(()) int next_decl_uid;
107 /* Unique id for next type created. */
108 static GTY(()) int next_type_uid = 1;
110 /* Since we cannot rehash a type after it is in the table, we have to
111 keep the hash code. */
113 struct type_hash GTY(())
119 /* Initial size of the hash table (rounded to next prime). */
120 #define TYPE_HASH_INITIAL_SIZE 1000
122 /* Now here is the hash table. When recording a type, it is added to
123 the slot whose index is the hash code. Note that the hash table is
124 used for several kinds of types (function types, array types and
125 array index range types, for now). While all these live in the
126 same table, they are completely independent, and the hash code is
127 computed differently for each of these. */
129 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
130 htab_t type_hash_table;
132 /* Hash table and temporary node for larger integer const values. */
133 static GTY (()) tree int_cst_node;
134 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
135 htab_t int_cst_hash_table;
137 /* General tree->tree mapping structure for use in hash tables. */
140 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
141 htab_t debug_expr_for_decl;
143 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
144 htab_t value_expr_for_decl;
146 static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map)))
147 htab_t init_priority_for_decl;
149 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
150 htab_t restrict_base_for_decl;
152 struct tree_int_map GTY(())
157 static unsigned int tree_int_map_hash (const void *);
158 static int tree_int_map_eq (const void *, const void *);
159 static int tree_int_map_marked_p (const void *);
160 static void set_type_quals (tree, int);
161 static int type_hash_eq (const void *, const void *);
162 static hashval_t type_hash_hash (const void *);
163 static hashval_t int_cst_hash_hash (const void *);
164 static int int_cst_hash_eq (const void *, const void *);
165 static void print_type_hash_statistics (void);
166 static void print_debug_expr_statistics (void);
167 static void print_value_expr_statistics (void);
168 static tree make_vector_type (tree, int, enum machine_mode);
169 static int type_hash_marked_p (const void *);
170 static unsigned int type_hash_list (tree, hashval_t);
171 static unsigned int attribute_hash_list (tree, hashval_t);
173 tree global_trees[TI_MAX];
174 tree integer_types[itk_none];
176 unsigned char tree_contains_struct[256][64];
178 /* Number of operands for each OpenMP clause. */
179 unsigned const char omp_clause_num_ops[] =
181 0, /* OMP_CLAUSE_ERROR */
182 1, /* OMP_CLAUSE_PRIVATE */
183 1, /* OMP_CLAUSE_SHARED */
184 1, /* OMP_CLAUSE_FIRSTPRIVATE */
185 1, /* OMP_CLAUSE_LASTPRIVATE */
186 4, /* OMP_CLAUSE_REDUCTION */
187 1, /* OMP_CLAUSE_COPYIN */
188 1, /* OMP_CLAUSE_COPYPRIVATE */
189 1, /* OMP_CLAUSE_IF */
190 1, /* OMP_CLAUSE_NUM_THREADS */
191 1, /* OMP_CLAUSE_SCHEDULE */
192 0, /* OMP_CLAUSE_NOWAIT */
193 0, /* OMP_CLAUSE_ORDERED */
194 0 /* OMP_CLAUSE_DEFAULT */
197 const char * const omp_clause_code_name[] =
220 /* Initialize the hash table of types. */
221 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
224 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
227 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
229 init_priority_for_decl = htab_create_ggc (512, tree_int_map_hash,
231 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
234 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
235 int_cst_hash_eq, NULL);
237 int_cst_node = make_node (INTEGER_CST);
239 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
240 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
241 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
244 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
245 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
246 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
247 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
248 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
249 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
250 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
251 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
252 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
255 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
256 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
257 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
258 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
259 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
260 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
262 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
263 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
264 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
265 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
266 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
267 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
268 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
269 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
270 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
271 tree_contains_struct[STRUCT_FIELD_TAG][TS_DECL_MINIMAL] = 1;
272 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
273 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
275 tree_contains_struct[STRUCT_FIELD_TAG][TS_MEMORY_TAG] = 1;
276 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
277 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
279 tree_contains_struct[STRUCT_FIELD_TAG][TS_STRUCT_FIELD_TAG] = 1;
281 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
282 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
283 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
284 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
286 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
287 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
288 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
289 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
290 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
291 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
292 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
293 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
295 lang_hooks.init_ts ();
299 /* The name of the object as the assembler will see it (but before any
300 translations made by ASM_OUTPUT_LABELREF). Often this is the same
301 as DECL_NAME. It is an IDENTIFIER_NODE. */
303 decl_assembler_name (tree decl)
305 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
306 lang_hooks.set_decl_assembler_name (decl);
307 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
310 /* Compute the number of bytes occupied by a tree with code CODE.
311 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
312 codes, which are of variable length. */
314 tree_code_size (enum tree_code code)
316 switch (TREE_CODE_CLASS (code))
318 case tcc_declaration: /* A decl node */
323 return sizeof (struct tree_field_decl);
325 return sizeof (struct tree_parm_decl);
327 return sizeof (struct tree_var_decl);
329 return sizeof (struct tree_label_decl);
331 return sizeof (struct tree_result_decl);
333 return sizeof (struct tree_const_decl);
335 return sizeof (struct tree_type_decl);
337 return sizeof (struct tree_function_decl);
338 case NAME_MEMORY_TAG:
339 case SYMBOL_MEMORY_TAG:
340 return sizeof (struct tree_memory_tag);
341 case STRUCT_FIELD_TAG:
342 return sizeof (struct tree_struct_field_tag);
344 return sizeof (struct tree_decl_non_common);
348 case tcc_type: /* a type node */
349 return sizeof (struct tree_type);
351 case tcc_reference: /* a reference */
352 case tcc_expression: /* an expression */
353 case tcc_statement: /* an expression with side effects */
354 case tcc_comparison: /* a comparison expression */
355 case tcc_unary: /* a unary arithmetic expression */
356 case tcc_binary: /* a binary arithmetic expression */
357 return (sizeof (struct tree_exp)
358 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
360 case tcc_constant: /* a constant */
363 case INTEGER_CST: return sizeof (struct tree_int_cst);
364 case REAL_CST: return sizeof (struct tree_real_cst);
365 case COMPLEX_CST: return sizeof (struct tree_complex);
366 case VECTOR_CST: return sizeof (struct tree_vector);
367 case STRING_CST: gcc_unreachable ();
369 return lang_hooks.tree_size (code);
372 case tcc_exceptional: /* something random, like an identifier. */
375 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
376 case TREE_LIST: return sizeof (struct tree_list);
379 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
383 case PHI_NODE: gcc_unreachable ();
385 case SSA_NAME: return sizeof (struct tree_ssa_name);
387 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
388 case BLOCK: return sizeof (struct tree_block);
389 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
390 case CONSTRUCTOR: return sizeof (struct tree_constructor);
393 return lang_hooks.tree_size (code);
401 /* Compute the number of bytes occupied by NODE. This routine only
402 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
404 tree_size (tree node)
406 enum tree_code code = TREE_CODE (node);
410 return (sizeof (struct tree_phi_node)
411 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
414 return (offsetof (struct tree_binfo, base_binfos)
415 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
418 return (sizeof (struct tree_vec)
419 + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *));
422 return sizeof (struct tree_string) + TREE_STRING_LENGTH (node) - 1;
425 return (sizeof (struct tree_omp_clause)
426 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
430 return tree_code_size (code);
434 /* Return a newly allocated node of code CODE. For decl and type
435 nodes, some other fields are initialized. The rest of the node is
436 initialized to zero. This function cannot be used for PHI_NODE,
437 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
440 Achoo! I got a code in the node. */
443 make_node_stat (enum tree_code code MEM_STAT_DECL)
446 enum tree_code_class type = TREE_CODE_CLASS (code);
447 size_t length = tree_code_size (code);
448 #ifdef GATHER_STATISTICS
453 case tcc_declaration: /* A decl node */
457 case tcc_type: /* a type node */
461 case tcc_statement: /* an expression with side effects */
465 case tcc_reference: /* a reference */
469 case tcc_expression: /* an expression */
470 case tcc_comparison: /* a comparison expression */
471 case tcc_unary: /* a unary arithmetic expression */
472 case tcc_binary: /* a binary arithmetic expression */
476 case tcc_constant: /* a constant */
480 case tcc_exceptional: /* something random, like an identifier. */
483 case IDENTIFIER_NODE:
500 kind = ssa_name_kind;
521 tree_node_counts[(int) kind]++;
522 tree_node_sizes[(int) kind] += length;
525 if (code == IDENTIFIER_NODE)
526 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
528 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
530 memset (t, 0, length);
532 TREE_SET_CODE (t, code);
537 TREE_SIDE_EFFECTS (t) = 1;
540 case tcc_declaration:
541 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
542 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
543 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
545 if (code != FUNCTION_DECL)
547 DECL_USER_ALIGN (t) = 0;
548 /* We have not yet computed the alias set for this declaration. */
549 DECL_POINTER_ALIAS_SET (t) = -1;
551 DECL_SOURCE_LOCATION (t) = input_location;
552 DECL_UID (t) = next_decl_uid++;
557 TYPE_UID (t) = next_type_uid++;
558 TYPE_ALIGN (t) = BITS_PER_UNIT;
559 TYPE_USER_ALIGN (t) = 0;
560 TYPE_MAIN_VARIANT (t) = t;
562 /* Default to no attributes for type, but let target change that. */
563 TYPE_ATTRIBUTES (t) = NULL_TREE;
564 targetm.set_default_type_attributes (t);
566 /* We have not yet computed the alias set for this type. */
567 TYPE_ALIAS_SET (t) = -1;
571 TREE_CONSTANT (t) = 1;
572 TREE_INVARIANT (t) = 1;
581 case PREDECREMENT_EXPR:
582 case PREINCREMENT_EXPR:
583 case POSTDECREMENT_EXPR:
584 case POSTINCREMENT_EXPR:
585 /* All of these have side-effects, no matter what their
587 TREE_SIDE_EFFECTS (t) = 1;
596 /* Other classes need no special treatment. */
603 /* Return a new node with the same contents as NODE except that its
604 TREE_CHAIN is zero and it has a fresh uid. */
607 copy_node_stat (tree node MEM_STAT_DECL)
610 enum tree_code code = TREE_CODE (node);
613 gcc_assert (code != STATEMENT_LIST);
615 length = tree_size (node);
616 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
617 memcpy (t, node, length);
620 TREE_ASM_WRITTEN (t) = 0;
621 TREE_VISITED (t) = 0;
624 if (TREE_CODE_CLASS (code) == tcc_declaration)
626 DECL_UID (t) = next_decl_uid++;
627 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
628 && DECL_HAS_VALUE_EXPR_P (node))
630 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
631 DECL_HAS_VALUE_EXPR_P (t) = 1;
633 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
635 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
636 DECL_HAS_INIT_PRIORITY_P (t) = 1;
638 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
640 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
641 DECL_BASED_ON_RESTRICT_P (t) = 1;
644 else if (TREE_CODE_CLASS (code) == tcc_type)
646 TYPE_UID (t) = next_type_uid++;
647 /* The following is so that the debug code for
648 the copy is different from the original type.
649 The two statements usually duplicate each other
650 (because they clear fields of the same union),
651 but the optimizer should catch that. */
652 TYPE_SYMTAB_POINTER (t) = 0;
653 TYPE_SYMTAB_ADDRESS (t) = 0;
655 /* Do not copy the values cache. */
656 if (TYPE_CACHED_VALUES_P(t))
658 TYPE_CACHED_VALUES_P (t) = 0;
659 TYPE_CACHED_VALUES (t) = NULL_TREE;
666 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
667 For example, this can copy a list made of TREE_LIST nodes. */
670 copy_list (tree list)
678 head = prev = copy_node (list);
679 next = TREE_CHAIN (list);
682 TREE_CHAIN (prev) = copy_node (next);
683 prev = TREE_CHAIN (prev);
684 next = TREE_CHAIN (next);
690 /* Create an INT_CST node with a LOW value sign extended. */
693 build_int_cst (tree type, HOST_WIDE_INT low)
695 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
698 /* Create an INT_CST node with a LOW value zero extended. */
701 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
703 return build_int_cst_wide (type, low, 0);
706 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
707 if it is negative. This function is similar to build_int_cst, but
708 the extra bits outside of the type precision are cleared. Constants
709 with these extra bits may confuse the fold so that it detects overflows
710 even in cases when they do not occur, and in general should be avoided.
711 We cannot however make this a default behavior of build_int_cst without
712 more intrusive changes, since there are parts of gcc that rely on the extra
713 precision of the integer constants. */
716 build_int_cst_type (tree type, HOST_WIDE_INT low)
718 unsigned HOST_WIDE_INT val = (unsigned HOST_WIDE_INT) low;
719 unsigned HOST_WIDE_INT hi, mask;
725 type = integer_type_node;
727 bits = TYPE_PRECISION (type);
728 signed_p = !TYPE_UNSIGNED (type);
730 if (bits >= HOST_BITS_PER_WIDE_INT)
731 negative = (low < 0);
734 /* If the sign bit is inside precision of LOW, use it to determine
735 the sign of the constant. */
736 negative = ((val >> (bits - 1)) & 1) != 0;
738 /* Mask out the bits outside of the precision of the constant. */
739 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
741 if (signed_p && negative)
747 /* Determine the high bits. */
748 hi = (negative ? ~(unsigned HOST_WIDE_INT) 0 : 0);
750 /* For unsigned type we need to mask out the bits outside of the type
754 if (bits <= HOST_BITS_PER_WIDE_INT)
758 bits -= HOST_BITS_PER_WIDE_INT;
759 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
764 return build_int_cst_wide (type, val, hi);
767 /* These are the hash table functions for the hash table of INTEGER_CST
768 nodes of a sizetype. */
770 /* Return the hash code code X, an INTEGER_CST. */
773 int_cst_hash_hash (const void *x)
777 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
778 ^ htab_hash_pointer (TREE_TYPE (t)));
781 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
782 is the same as that given by *Y, which is the same. */
785 int_cst_hash_eq (const void *x, const void *y)
790 return (TREE_TYPE (xt) == TREE_TYPE (yt)
791 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
792 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
795 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
796 integer_type_node is used. The returned node is always shared.
797 For small integers we use a per-type vector cache, for larger ones
798 we use a single hash table. */
801 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
808 type = integer_type_node;
810 switch (TREE_CODE (type))
814 /* Cache NULL pointer. */
823 /* Cache false or true. */
831 if (TYPE_UNSIGNED (type))
834 limit = INTEGER_SHARE_LIMIT;
835 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
841 limit = INTEGER_SHARE_LIMIT + 1;
842 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
844 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
854 /* Look for it in the type's vector of small shared ints. */
855 if (!TYPE_CACHED_VALUES_P (type))
857 TYPE_CACHED_VALUES_P (type) = 1;
858 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
861 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
864 /* Make sure no one is clobbering the shared constant. */
865 gcc_assert (TREE_TYPE (t) == type);
866 gcc_assert (TREE_INT_CST_LOW (t) == low);
867 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
871 /* Create a new shared int. */
872 t = make_node (INTEGER_CST);
874 TREE_INT_CST_LOW (t) = low;
875 TREE_INT_CST_HIGH (t) = hi;
876 TREE_TYPE (t) = type;
878 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
883 /* Use the cache of larger shared ints. */
886 TREE_INT_CST_LOW (int_cst_node) = low;
887 TREE_INT_CST_HIGH (int_cst_node) = hi;
888 TREE_TYPE (int_cst_node) = type;
890 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
894 /* Insert this one into the hash table. */
897 /* Make a new node for next time round. */
898 int_cst_node = make_node (INTEGER_CST);
905 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
906 and the rest are zeros. */
909 build_low_bits_mask (tree type, unsigned bits)
911 unsigned HOST_WIDE_INT low;
913 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
915 gcc_assert (bits <= TYPE_PRECISION (type));
917 if (bits == TYPE_PRECISION (type)
918 && !TYPE_UNSIGNED (type))
920 /* Sign extended all-ones mask. */
924 else if (bits <= HOST_BITS_PER_WIDE_INT)
926 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
931 bits -= HOST_BITS_PER_WIDE_INT;
933 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
936 return build_int_cst_wide (type, low, high);
939 /* Checks that X is integer constant that can be expressed in (unsigned)
940 HOST_WIDE_INT without loss of precision. */
943 cst_and_fits_in_hwi (tree x)
945 if (TREE_CODE (x) != INTEGER_CST)
948 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
951 return (TREE_INT_CST_HIGH (x) == 0
952 || TREE_INT_CST_HIGH (x) == -1);
955 /* Return a new VECTOR_CST node whose type is TYPE and whose values
956 are in a list pointed to by VALS. */
959 build_vector (tree type, tree vals)
961 tree v = make_node (VECTOR_CST);
962 int over1 = 0, over2 = 0;
965 TREE_VECTOR_CST_ELTS (v) = vals;
966 TREE_TYPE (v) = type;
968 /* Iterate through elements and check for overflow. */
969 for (link = vals; link; link = TREE_CHAIN (link))
971 tree value = TREE_VALUE (link);
973 over1 |= TREE_OVERFLOW (value);
974 over2 |= TREE_CONSTANT_OVERFLOW (value);
977 TREE_OVERFLOW (v) = over1;
978 TREE_CONSTANT_OVERFLOW (v) = over2;
983 /* Return a new VECTOR_CST node whose type is TYPE and whose values
984 are extracted from V, a vector of CONSTRUCTOR_ELT. */
987 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
989 tree list = NULL_TREE;
990 unsigned HOST_WIDE_INT idx;
993 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
994 list = tree_cons (NULL_TREE, value, list);
995 return build_vector (type, nreverse (list));
998 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
999 are in the VEC pointed to by VALS. */
1001 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1003 tree c = make_node (CONSTRUCTOR);
1004 TREE_TYPE (c) = type;
1005 CONSTRUCTOR_ELTS (c) = vals;
1009 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1012 build_constructor_single (tree type, tree index, tree value)
1014 VEC(constructor_elt,gc) *v;
1015 constructor_elt *elt;
1017 v = VEC_alloc (constructor_elt, gc, 1);
1018 elt = VEC_quick_push (constructor_elt, v, NULL);
1022 return build_constructor (type, v);
1026 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1027 are in a list pointed to by VALS. */
1029 build_constructor_from_list (tree type, tree vals)
1032 VEC(constructor_elt,gc) *v = NULL;
1036 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1037 for (t = vals; t; t = TREE_CHAIN (t))
1039 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1040 elt->index = TREE_PURPOSE (t);
1041 elt->value = TREE_VALUE (t);
1045 return build_constructor (type, v);
1049 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1052 build_real (tree type, REAL_VALUE_TYPE d)
1055 REAL_VALUE_TYPE *dp;
1058 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1059 Consider doing it via real_convert now. */
1061 v = make_node (REAL_CST);
1062 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1063 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1065 TREE_TYPE (v) = type;
1066 TREE_REAL_CST_PTR (v) = dp;
1067 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1071 /* Return a new REAL_CST node whose type is TYPE
1072 and whose value is the integer value of the INTEGER_CST node I. */
1075 real_value_from_int_cst (tree type, tree i)
1079 /* Clear all bits of the real value type so that we can later do
1080 bitwise comparisons to see if two values are the same. */
1081 memset (&d, 0, sizeof d);
1083 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1084 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1085 TYPE_UNSIGNED (TREE_TYPE (i)));
1089 /* Given a tree representing an integer constant I, return a tree
1090 representing the same value as a floating-point constant of type TYPE. */
1093 build_real_from_int_cst (tree type, tree i)
1096 int overflow = TREE_OVERFLOW (i);
1098 v = build_real (type, real_value_from_int_cst (type, i));
1100 TREE_OVERFLOW (v) |= overflow;
1101 TREE_CONSTANT_OVERFLOW (v) |= overflow;
1105 /* Return a newly constructed STRING_CST node whose value is
1106 the LEN characters at STR.
1107 The TREE_TYPE is not initialized. */
1110 build_string (int len, const char *str)
1115 length = len + sizeof (struct tree_string);
1117 #ifdef GATHER_STATISTICS
1118 tree_node_counts[(int) c_kind]++;
1119 tree_node_sizes[(int) c_kind] += length;
1122 s = ggc_alloc_tree (length);
1124 memset (s, 0, sizeof (struct tree_common));
1125 TREE_SET_CODE (s, STRING_CST);
1126 TREE_CONSTANT (s) = 1;
1127 TREE_INVARIANT (s) = 1;
1128 TREE_STRING_LENGTH (s) = len;
1129 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1130 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1135 /* Return a newly constructed COMPLEX_CST node whose value is
1136 specified by the real and imaginary parts REAL and IMAG.
1137 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1138 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1141 build_complex (tree type, tree real, tree imag)
1143 tree t = make_node (COMPLEX_CST);
1145 TREE_REALPART (t) = real;
1146 TREE_IMAGPART (t) = imag;
1147 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1148 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1149 TREE_CONSTANT_OVERFLOW (t)
1150 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1154 /* Build a BINFO with LEN language slots. */
1157 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1160 size_t length = (offsetof (struct tree_binfo, base_binfos)
1161 + VEC_embedded_size (tree, base_binfos));
1163 #ifdef GATHER_STATISTICS
1164 tree_node_counts[(int) binfo_kind]++;
1165 tree_node_sizes[(int) binfo_kind] += length;
1168 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1170 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1172 TREE_SET_CODE (t, TREE_BINFO);
1174 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1180 /* Build a newly constructed TREE_VEC node of length LEN. */
1183 make_tree_vec_stat (int len MEM_STAT_DECL)
1186 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1188 #ifdef GATHER_STATISTICS
1189 tree_node_counts[(int) vec_kind]++;
1190 tree_node_sizes[(int) vec_kind] += length;
1193 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1195 memset (t, 0, length);
1197 TREE_SET_CODE (t, TREE_VEC);
1198 TREE_VEC_LENGTH (t) = len;
1203 /* Return 1 if EXPR is the integer constant zero or a complex constant
1207 integer_zerop (tree expr)
1211 return ((TREE_CODE (expr) == INTEGER_CST
1212 && TREE_INT_CST_LOW (expr) == 0
1213 && TREE_INT_CST_HIGH (expr) == 0)
1214 || (TREE_CODE (expr) == COMPLEX_CST
1215 && integer_zerop (TREE_REALPART (expr))
1216 && integer_zerop (TREE_IMAGPART (expr))));
1219 /* Return 1 if EXPR is the integer constant one or the corresponding
1220 complex constant. */
1223 integer_onep (tree expr)
1227 return ((TREE_CODE (expr) == INTEGER_CST
1228 && TREE_INT_CST_LOW (expr) == 1
1229 && TREE_INT_CST_HIGH (expr) == 0)
1230 || (TREE_CODE (expr) == COMPLEX_CST
1231 && integer_onep (TREE_REALPART (expr))
1232 && integer_zerop (TREE_IMAGPART (expr))));
1235 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1236 it contains. Likewise for the corresponding complex constant. */
1239 integer_all_onesp (tree expr)
1246 if (TREE_CODE (expr) == COMPLEX_CST
1247 && integer_all_onesp (TREE_REALPART (expr))
1248 && integer_zerop (TREE_IMAGPART (expr)))
1251 else if (TREE_CODE (expr) != INTEGER_CST)
1254 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1255 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1256 && TREE_INT_CST_HIGH (expr) == -1)
1261 /* Note that using TYPE_PRECISION here is wrong. We care about the
1262 actual bits, not the (arbitrary) range of the type. */
1263 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1264 if (prec >= HOST_BITS_PER_WIDE_INT)
1266 HOST_WIDE_INT high_value;
1269 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1271 /* Can not handle precisions greater than twice the host int size. */
1272 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1273 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1274 /* Shifting by the host word size is undefined according to the ANSI
1275 standard, so we must handle this as a special case. */
1278 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1280 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1281 && TREE_INT_CST_HIGH (expr) == high_value);
1284 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1287 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1291 integer_pow2p (tree expr)
1294 HOST_WIDE_INT high, low;
1298 if (TREE_CODE (expr) == COMPLEX_CST
1299 && integer_pow2p (TREE_REALPART (expr))
1300 && integer_zerop (TREE_IMAGPART (expr)))
1303 if (TREE_CODE (expr) != INTEGER_CST)
1306 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1307 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1308 high = TREE_INT_CST_HIGH (expr);
1309 low = TREE_INT_CST_LOW (expr);
1311 /* First clear all bits that are beyond the type's precision in case
1312 we've been sign extended. */
1314 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1316 else if (prec > HOST_BITS_PER_WIDE_INT)
1317 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1321 if (prec < HOST_BITS_PER_WIDE_INT)
1322 low &= ~((HOST_WIDE_INT) (-1) << prec);
1325 if (high == 0 && low == 0)
1328 return ((high == 0 && (low & (low - 1)) == 0)
1329 || (low == 0 && (high & (high - 1)) == 0));
1332 /* Return 1 if EXPR is an integer constant other than zero or a
1333 complex constant other than zero. */
1336 integer_nonzerop (tree expr)
1340 return ((TREE_CODE (expr) == INTEGER_CST
1341 && (TREE_INT_CST_LOW (expr) != 0
1342 || TREE_INT_CST_HIGH (expr) != 0))
1343 || (TREE_CODE (expr) == COMPLEX_CST
1344 && (integer_nonzerop (TREE_REALPART (expr))
1345 || integer_nonzerop (TREE_IMAGPART (expr)))));
1348 /* Return the power of two represented by a tree node known to be a
1352 tree_log2 (tree expr)
1355 HOST_WIDE_INT high, low;
1359 if (TREE_CODE (expr) == COMPLEX_CST)
1360 return tree_log2 (TREE_REALPART (expr));
1362 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1363 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1365 high = TREE_INT_CST_HIGH (expr);
1366 low = TREE_INT_CST_LOW (expr);
1368 /* First clear all bits that are beyond the type's precision in case
1369 we've been sign extended. */
1371 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1373 else if (prec > HOST_BITS_PER_WIDE_INT)
1374 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1378 if (prec < HOST_BITS_PER_WIDE_INT)
1379 low &= ~((HOST_WIDE_INT) (-1) << prec);
1382 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1383 : exact_log2 (low));
1386 /* Similar, but return the largest integer Y such that 2 ** Y is less
1387 than or equal to EXPR. */
1390 tree_floor_log2 (tree expr)
1393 HOST_WIDE_INT high, low;
1397 if (TREE_CODE (expr) == COMPLEX_CST)
1398 return tree_log2 (TREE_REALPART (expr));
1400 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1401 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1403 high = TREE_INT_CST_HIGH (expr);
1404 low = TREE_INT_CST_LOW (expr);
1406 /* First clear all bits that are beyond the type's precision in case
1407 we've been sign extended. Ignore if type's precision hasn't been set
1408 since what we are doing is setting it. */
1410 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1412 else if (prec > HOST_BITS_PER_WIDE_INT)
1413 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1417 if (prec < HOST_BITS_PER_WIDE_INT)
1418 low &= ~((HOST_WIDE_INT) (-1) << prec);
1421 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1422 : floor_log2 (low));
1425 /* Return 1 if EXPR is the real constant zero. */
1428 real_zerop (tree expr)
1432 return ((TREE_CODE (expr) == REAL_CST
1433 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1434 || (TREE_CODE (expr) == COMPLEX_CST
1435 && real_zerop (TREE_REALPART (expr))
1436 && real_zerop (TREE_IMAGPART (expr))));
1439 /* Return 1 if EXPR is the real constant one in real or complex form. */
1442 real_onep (tree expr)
1446 return ((TREE_CODE (expr) == REAL_CST
1447 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1448 || (TREE_CODE (expr) == COMPLEX_CST
1449 && real_onep (TREE_REALPART (expr))
1450 && real_zerop (TREE_IMAGPART (expr))));
1453 /* Return 1 if EXPR is the real constant two. */
1456 real_twop (tree expr)
1460 return ((TREE_CODE (expr) == REAL_CST
1461 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1462 || (TREE_CODE (expr) == COMPLEX_CST
1463 && real_twop (TREE_REALPART (expr))
1464 && real_zerop (TREE_IMAGPART (expr))));
1467 /* Return 1 if EXPR is the real constant minus one. */
1470 real_minus_onep (tree expr)
1474 return ((TREE_CODE (expr) == REAL_CST
1475 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1476 || (TREE_CODE (expr) == COMPLEX_CST
1477 && real_minus_onep (TREE_REALPART (expr))
1478 && real_zerop (TREE_IMAGPART (expr))));
1481 /* Nonzero if EXP is a constant or a cast of a constant. */
1484 really_constant_p (tree exp)
1486 /* This is not quite the same as STRIP_NOPS. It does more. */
1487 while (TREE_CODE (exp) == NOP_EXPR
1488 || TREE_CODE (exp) == CONVERT_EXPR
1489 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1490 exp = TREE_OPERAND (exp, 0);
1491 return TREE_CONSTANT (exp);
1494 /* Return first list element whose TREE_VALUE is ELEM.
1495 Return 0 if ELEM is not in LIST. */
1498 value_member (tree elem, tree list)
1502 if (elem == TREE_VALUE (list))
1504 list = TREE_CHAIN (list);
1509 /* Return first list element whose TREE_PURPOSE is ELEM.
1510 Return 0 if ELEM is not in LIST. */
1513 purpose_member (tree elem, tree list)
1517 if (elem == TREE_PURPOSE (list))
1519 list = TREE_CHAIN (list);
1524 /* Return nonzero if ELEM is part of the chain CHAIN. */
1527 chain_member (tree elem, tree chain)
1533 chain = TREE_CHAIN (chain);
1539 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1540 We expect a null pointer to mark the end of the chain.
1541 This is the Lisp primitive `length'. */
1544 list_length (tree t)
1547 #ifdef ENABLE_TREE_CHECKING
1555 #ifdef ENABLE_TREE_CHECKING
1558 gcc_assert (p != q);
1566 /* Returns the number of FIELD_DECLs in TYPE. */
1569 fields_length (tree type)
1571 tree t = TYPE_FIELDS (type);
1574 for (; t; t = TREE_CHAIN (t))
1575 if (TREE_CODE (t) == FIELD_DECL)
1581 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1582 by modifying the last node in chain 1 to point to chain 2.
1583 This is the Lisp primitive `nconc'. */
1586 chainon (tree op1, tree op2)
1595 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1597 TREE_CHAIN (t1) = op2;
1599 #ifdef ENABLE_TREE_CHECKING
1602 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1603 gcc_assert (t2 != t1);
1610 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1613 tree_last (tree chain)
1617 while ((next = TREE_CHAIN (chain)))
1622 /* Reverse the order of elements in the chain T,
1623 and return the new head of the chain (old last element). */
1628 tree prev = 0, decl, next;
1629 for (decl = t; decl; decl = next)
1631 next = TREE_CHAIN (decl);
1632 TREE_CHAIN (decl) = prev;
1638 /* Return a newly created TREE_LIST node whose
1639 purpose and value fields are PARM and VALUE. */
1642 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1644 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1645 TREE_PURPOSE (t) = parm;
1646 TREE_VALUE (t) = value;
1650 /* Return a newly created TREE_LIST node whose
1651 purpose and value fields are PURPOSE and VALUE
1652 and whose TREE_CHAIN is CHAIN. */
1655 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1659 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1661 memset (node, 0, sizeof (struct tree_common));
1663 #ifdef GATHER_STATISTICS
1664 tree_node_counts[(int) x_kind]++;
1665 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1668 TREE_SET_CODE (node, TREE_LIST);
1669 TREE_CHAIN (node) = chain;
1670 TREE_PURPOSE (node) = purpose;
1671 TREE_VALUE (node) = value;
1676 /* Return the size nominally occupied by an object of type TYPE
1677 when it resides in memory. The value is measured in units of bytes,
1678 and its data type is that normally used for type sizes
1679 (which is the first type created by make_signed_type or
1680 make_unsigned_type). */
1683 size_in_bytes (tree type)
1687 if (type == error_mark_node)
1688 return integer_zero_node;
1690 type = TYPE_MAIN_VARIANT (type);
1691 t = TYPE_SIZE_UNIT (type);
1695 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1696 return size_zero_node;
1699 if (TREE_CODE (t) == INTEGER_CST)
1700 t = force_fit_type (t, 0, false, false);
1705 /* Return the size of TYPE (in bytes) as a wide integer
1706 or return -1 if the size can vary or is larger than an integer. */
1709 int_size_in_bytes (tree type)
1713 if (type == error_mark_node)
1716 type = TYPE_MAIN_VARIANT (type);
1717 t = TYPE_SIZE_UNIT (type);
1719 || TREE_CODE (t) != INTEGER_CST
1720 || TREE_INT_CST_HIGH (t) != 0
1721 /* If the result would appear negative, it's too big to represent. */
1722 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1725 return TREE_INT_CST_LOW (t);
1728 /* Return the bit position of FIELD, in bits from the start of the record.
1729 This is a tree of type bitsizetype. */
1732 bit_position (tree field)
1734 return bit_from_pos (DECL_FIELD_OFFSET (field),
1735 DECL_FIELD_BIT_OFFSET (field));
1738 /* Likewise, but return as an integer. It must be representable in
1739 that way (since it could be a signed value, we don't have the
1740 option of returning -1 like int_size_in_byte can. */
1743 int_bit_position (tree field)
1745 return tree_low_cst (bit_position (field), 0);
1748 /* Return the byte position of FIELD, in bytes from the start of the record.
1749 This is a tree of type sizetype. */
1752 byte_position (tree field)
1754 return byte_from_pos (DECL_FIELD_OFFSET (field),
1755 DECL_FIELD_BIT_OFFSET (field));
1758 /* Likewise, but return as an integer. It must be representable in
1759 that way (since it could be a signed value, we don't have the
1760 option of returning -1 like int_size_in_byte can. */
1763 int_byte_position (tree field)
1765 return tree_low_cst (byte_position (field), 0);
1768 /* Return the strictest alignment, in bits, that T is known to have. */
1773 unsigned int align0, align1;
1775 switch (TREE_CODE (t))
1777 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1778 /* If we have conversions, we know that the alignment of the
1779 object must meet each of the alignments of the types. */
1780 align0 = expr_align (TREE_OPERAND (t, 0));
1781 align1 = TYPE_ALIGN (TREE_TYPE (t));
1782 return MAX (align0, align1);
1784 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1785 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1786 case CLEANUP_POINT_EXPR:
1787 /* These don't change the alignment of an object. */
1788 return expr_align (TREE_OPERAND (t, 0));
1791 /* The best we can do is say that the alignment is the least aligned
1793 align0 = expr_align (TREE_OPERAND (t, 1));
1794 align1 = expr_align (TREE_OPERAND (t, 2));
1795 return MIN (align0, align1);
1797 case LABEL_DECL: case CONST_DECL:
1798 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1799 if (DECL_ALIGN (t) != 0)
1800 return DECL_ALIGN (t);
1804 return FUNCTION_BOUNDARY;
1810 /* Otherwise take the alignment from that of the type. */
1811 return TYPE_ALIGN (TREE_TYPE (t));
1814 /* Return, as a tree node, the number of elements for TYPE (which is an
1815 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1818 array_type_nelts (tree type)
1820 tree index_type, min, max;
1822 /* If they did it with unspecified bounds, then we should have already
1823 given an error about it before we got here. */
1824 if (! TYPE_DOMAIN (type))
1825 return error_mark_node;
1827 index_type = TYPE_DOMAIN (type);
1828 min = TYPE_MIN_VALUE (index_type);
1829 max = TYPE_MAX_VALUE (index_type);
1831 return (integer_zerop (min)
1833 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1836 /* If arg is static -- a reference to an object in static storage -- then
1837 return the object. This is not the same as the C meaning of `static'.
1838 If arg isn't static, return NULL. */
1843 switch (TREE_CODE (arg))
1846 /* Nested functions are static, even though taking their address will
1847 involve a trampoline as we unnest the nested function and create
1848 the trampoline on the tree level. */
1852 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1853 && ! DECL_THREAD_LOCAL_P (arg)
1854 && ! DECL_DLLIMPORT_P (arg)
1858 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1862 return TREE_STATIC (arg) ? arg : NULL;
1869 /* If the thing being referenced is not a field, then it is
1870 something language specific. */
1871 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1872 return (*lang_hooks.staticp) (arg);
1874 /* If we are referencing a bitfield, we can't evaluate an
1875 ADDR_EXPR at compile time and so it isn't a constant. */
1876 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1879 return staticp (TREE_OPERAND (arg, 0));
1884 case MISALIGNED_INDIRECT_REF:
1885 case ALIGN_INDIRECT_REF:
1887 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
1890 case ARRAY_RANGE_REF:
1891 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1892 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1893 return staticp (TREE_OPERAND (arg, 0));
1898 if ((unsigned int) TREE_CODE (arg)
1899 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1900 return lang_hooks.staticp (arg);
1906 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1907 Do this to any expression which may be used in more than one place,
1908 but must be evaluated only once.
1910 Normally, expand_expr would reevaluate the expression each time.
1911 Calling save_expr produces something that is evaluated and recorded
1912 the first time expand_expr is called on it. Subsequent calls to
1913 expand_expr just reuse the recorded value.
1915 The call to expand_expr that generates code that actually computes
1916 the value is the first call *at compile time*. Subsequent calls
1917 *at compile time* generate code to use the saved value.
1918 This produces correct result provided that *at run time* control
1919 always flows through the insns made by the first expand_expr
1920 before reaching the other places where the save_expr was evaluated.
1921 You, the caller of save_expr, must make sure this is so.
1923 Constants, and certain read-only nodes, are returned with no
1924 SAVE_EXPR because that is safe. Expressions containing placeholders
1925 are not touched; see tree.def for an explanation of what these
1929 save_expr (tree expr)
1931 tree t = fold (expr);
1934 /* If the tree evaluates to a constant, then we don't want to hide that
1935 fact (i.e. this allows further folding, and direct checks for constants).
1936 However, a read-only object that has side effects cannot be bypassed.
1937 Since it is no problem to reevaluate literals, we just return the
1939 inner = skip_simple_arithmetic (t);
1941 if (TREE_INVARIANT (inner)
1942 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1943 || TREE_CODE (inner) == SAVE_EXPR
1944 || TREE_CODE (inner) == ERROR_MARK)
1947 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1948 it means that the size or offset of some field of an object depends on
1949 the value within another field.
1951 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1952 and some variable since it would then need to be both evaluated once and
1953 evaluated more than once. Front-ends must assure this case cannot
1954 happen by surrounding any such subexpressions in their own SAVE_EXPR
1955 and forcing evaluation at the proper time. */
1956 if (contains_placeholder_p (inner))
1959 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
1961 /* This expression might be placed ahead of a jump to ensure that the
1962 value was computed on both sides of the jump. So make sure it isn't
1963 eliminated as dead. */
1964 TREE_SIDE_EFFECTS (t) = 1;
1965 TREE_INVARIANT (t) = 1;
1969 /* Look inside EXPR and into any simple arithmetic operations. Return
1970 the innermost non-arithmetic node. */
1973 skip_simple_arithmetic (tree expr)
1977 /* We don't care about whether this can be used as an lvalue in this
1979 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1980 expr = TREE_OPERAND (expr, 0);
1982 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1983 a constant, it will be more efficient to not make another SAVE_EXPR since
1984 it will allow better simplification and GCSE will be able to merge the
1985 computations if they actually occur. */
1989 if (UNARY_CLASS_P (inner))
1990 inner = TREE_OPERAND (inner, 0);
1991 else if (BINARY_CLASS_P (inner))
1993 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1994 inner = TREE_OPERAND (inner, 0);
1995 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1996 inner = TREE_OPERAND (inner, 1);
2007 /* Return which tree structure is used by T. */
2009 enum tree_node_structure_enum
2010 tree_node_structure (tree t)
2012 enum tree_code code = TREE_CODE (t);
2014 switch (TREE_CODE_CLASS (code))
2016 case tcc_declaration:
2021 return TS_FIELD_DECL;
2023 return TS_PARM_DECL;
2027 return TS_LABEL_DECL;
2029 return TS_RESULT_DECL;
2031 return TS_CONST_DECL;
2033 return TS_TYPE_DECL;
2035 return TS_FUNCTION_DECL;
2036 case SYMBOL_MEMORY_TAG:
2037 case NAME_MEMORY_TAG:
2038 case STRUCT_FIELD_TAG:
2039 return TS_MEMORY_TAG;
2041 return TS_DECL_NON_COMMON;
2047 case tcc_comparison:
2050 case tcc_expression:
2053 default: /* tcc_constant and tcc_exceptional */
2058 /* tcc_constant cases. */
2059 case INTEGER_CST: return TS_INT_CST;
2060 case REAL_CST: return TS_REAL_CST;
2061 case COMPLEX_CST: return TS_COMPLEX;
2062 case VECTOR_CST: return TS_VECTOR;
2063 case STRING_CST: return TS_STRING;
2064 /* tcc_exceptional cases. */
2065 case ERROR_MARK: return TS_COMMON;
2066 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2067 case TREE_LIST: return TS_LIST;
2068 case TREE_VEC: return TS_VEC;
2069 case PHI_NODE: return TS_PHI_NODE;
2070 case SSA_NAME: return TS_SSA_NAME;
2071 case PLACEHOLDER_EXPR: return TS_COMMON;
2072 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2073 case BLOCK: return TS_BLOCK;
2074 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2075 case TREE_BINFO: return TS_BINFO;
2076 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2077 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2084 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2085 or offset that depends on a field within a record. */
2088 contains_placeholder_p (tree exp)
2090 enum tree_code code;
2095 code = TREE_CODE (exp);
2096 if (code == PLACEHOLDER_EXPR)
2099 switch (TREE_CODE_CLASS (code))
2102 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2103 position computations since they will be converted into a
2104 WITH_RECORD_EXPR involving the reference, which will assume
2105 here will be valid. */
2106 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2108 case tcc_exceptional:
2109 if (code == TREE_LIST)
2110 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2111 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2116 case tcc_comparison:
2117 case tcc_expression:
2121 /* Ignoring the first operand isn't quite right, but works best. */
2122 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2125 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2126 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2127 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2130 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2136 switch (TREE_CODE_LENGTH (code))
2139 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2141 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2142 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2153 /* Return true if any part of the computation of TYPE involves a
2154 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2155 (for QUAL_UNION_TYPE) and field positions. */
2158 type_contains_placeholder_1 (tree type)
2160 /* If the size contains a placeholder or the parent type (component type in
2161 the case of arrays) type involves a placeholder, this type does. */
2162 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2163 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2164 || (TREE_TYPE (type) != 0
2165 && type_contains_placeholder_p (TREE_TYPE (type))))
2168 /* Now do type-specific checks. Note that the last part of the check above
2169 greatly limits what we have to do below. */
2170 switch (TREE_CODE (type))
2178 case REFERENCE_TYPE:
2186 /* Here we just check the bounds. */
2187 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2188 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2191 /* We're already checked the component type (TREE_TYPE), so just check
2193 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2197 case QUAL_UNION_TYPE:
2201 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2202 if (TREE_CODE (field) == FIELD_DECL
2203 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2204 || (TREE_CODE (type) == QUAL_UNION_TYPE
2205 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2206 || type_contains_placeholder_p (TREE_TYPE (field))))
2218 type_contains_placeholder_p (tree type)
2222 /* If the contains_placeholder_bits field has been initialized,
2223 then we know the answer. */
2224 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2225 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2227 /* Indicate that we've seen this type node, and the answer is false.
2228 This is what we want to return if we run into recursion via fields. */
2229 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2231 /* Compute the real value. */
2232 result = type_contains_placeholder_1 (type);
2234 /* Store the real value. */
2235 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2240 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2241 return a tree with all occurrences of references to F in a
2242 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2243 contains only arithmetic expressions or a CALL_EXPR with a
2244 PLACEHOLDER_EXPR occurring only in its arglist. */
2247 substitute_in_expr (tree exp, tree f, tree r)
2249 enum tree_code code = TREE_CODE (exp);
2250 tree op0, op1, op2, op3;
2254 /* We handle TREE_LIST and COMPONENT_REF separately. */
2255 if (code == TREE_LIST)
2257 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2258 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2259 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2262 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2264 else if (code == COMPONENT_REF)
2266 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2267 and it is the right field, replace it with R. */
2268 for (inner = TREE_OPERAND (exp, 0);
2269 REFERENCE_CLASS_P (inner);
2270 inner = TREE_OPERAND (inner, 0))
2272 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2273 && TREE_OPERAND (exp, 1) == f)
2276 /* If this expression hasn't been completed let, leave it alone. */
2277 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2280 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2281 if (op0 == TREE_OPERAND (exp, 0))
2284 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2285 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2288 switch (TREE_CODE_CLASS (code))
2291 case tcc_declaration:
2294 case tcc_exceptional:
2297 case tcc_comparison:
2298 case tcc_expression:
2300 switch (TREE_CODE_LENGTH (code))
2306 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2307 if (op0 == TREE_OPERAND (exp, 0))
2310 new = fold_build1 (code, TREE_TYPE (exp), op0);
2314 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2315 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2317 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2320 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2324 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2325 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2326 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2328 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2329 && op2 == TREE_OPERAND (exp, 2))
2332 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2336 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2337 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2338 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2339 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2341 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2342 && op2 == TREE_OPERAND (exp, 2)
2343 && op3 == TREE_OPERAND (exp, 3))
2346 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2358 TREE_READONLY (new) = TREE_READONLY (exp);
2362 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2363 for it within OBJ, a tree that is an object or a chain of references. */
2366 substitute_placeholder_in_expr (tree exp, tree obj)
2368 enum tree_code code = TREE_CODE (exp);
2369 tree op0, op1, op2, op3;
2371 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2372 in the chain of OBJ. */
2373 if (code == PLACEHOLDER_EXPR)
2375 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2378 for (elt = obj; elt != 0;
2379 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2380 || TREE_CODE (elt) == COND_EXPR)
2381 ? TREE_OPERAND (elt, 1)
2382 : (REFERENCE_CLASS_P (elt)
2383 || UNARY_CLASS_P (elt)
2384 || BINARY_CLASS_P (elt)
2385 || EXPRESSION_CLASS_P (elt))
2386 ? TREE_OPERAND (elt, 0) : 0))
2387 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2390 for (elt = obj; elt != 0;
2391 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2392 || TREE_CODE (elt) == COND_EXPR)
2393 ? TREE_OPERAND (elt, 1)
2394 : (REFERENCE_CLASS_P (elt)
2395 || UNARY_CLASS_P (elt)
2396 || BINARY_CLASS_P (elt)
2397 || EXPRESSION_CLASS_P (elt))
2398 ? TREE_OPERAND (elt, 0) : 0))
2399 if (POINTER_TYPE_P (TREE_TYPE (elt))
2400 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2402 return fold_build1 (INDIRECT_REF, need_type, elt);
2404 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2405 survives until RTL generation, there will be an error. */
2409 /* TREE_LIST is special because we need to look at TREE_VALUE
2410 and TREE_CHAIN, not TREE_OPERANDS. */
2411 else if (code == TREE_LIST)
2413 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2414 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2415 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2418 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2421 switch (TREE_CODE_CLASS (code))
2424 case tcc_declaration:
2427 case tcc_exceptional:
2430 case tcc_comparison:
2431 case tcc_expression:
2434 switch (TREE_CODE_LENGTH (code))
2440 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2441 if (op0 == TREE_OPERAND (exp, 0))
2444 return fold_build1 (code, TREE_TYPE (exp), op0);
2447 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2448 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2450 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2453 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2456 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2457 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2458 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2460 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2461 && op2 == TREE_OPERAND (exp, 2))
2464 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2467 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2468 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2469 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2470 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2472 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2473 && op2 == TREE_OPERAND (exp, 2)
2474 && op3 == TREE_OPERAND (exp, 3))
2477 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2489 /* Stabilize a reference so that we can use it any number of times
2490 without causing its operands to be evaluated more than once.
2491 Returns the stabilized reference. This works by means of save_expr,
2492 so see the caveats in the comments about save_expr.
2494 Also allows conversion expressions whose operands are references.
2495 Any other kind of expression is returned unchanged. */
2498 stabilize_reference (tree ref)
2501 enum tree_code code = TREE_CODE (ref);
2508 /* No action is needed in this case. */
2514 case FIX_TRUNC_EXPR:
2515 case FIX_FLOOR_EXPR:
2516 case FIX_ROUND_EXPR:
2518 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2522 result = build_nt (INDIRECT_REF,
2523 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2527 result = build_nt (COMPONENT_REF,
2528 stabilize_reference (TREE_OPERAND (ref, 0)),
2529 TREE_OPERAND (ref, 1), NULL_TREE);
2533 result = build_nt (BIT_FIELD_REF,
2534 stabilize_reference (TREE_OPERAND (ref, 0)),
2535 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2536 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2540 result = build_nt (ARRAY_REF,
2541 stabilize_reference (TREE_OPERAND (ref, 0)),
2542 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2543 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2546 case ARRAY_RANGE_REF:
2547 result = build_nt (ARRAY_RANGE_REF,
2548 stabilize_reference (TREE_OPERAND (ref, 0)),
2549 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2550 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2554 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2555 it wouldn't be ignored. This matters when dealing with
2557 return stabilize_reference_1 (ref);
2559 /* If arg isn't a kind of lvalue we recognize, make no change.
2560 Caller should recognize the error for an invalid lvalue. */
2565 return error_mark_node;
2568 TREE_TYPE (result) = TREE_TYPE (ref);
2569 TREE_READONLY (result) = TREE_READONLY (ref);
2570 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2571 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2576 /* Subroutine of stabilize_reference; this is called for subtrees of
2577 references. Any expression with side-effects must be put in a SAVE_EXPR
2578 to ensure that it is only evaluated once.
2580 We don't put SAVE_EXPR nodes around everything, because assigning very
2581 simple expressions to temporaries causes us to miss good opportunities
2582 for optimizations. Among other things, the opportunity to fold in the
2583 addition of a constant into an addressing mode often gets lost, e.g.
2584 "y[i+1] += x;". In general, we take the approach that we should not make
2585 an assignment unless we are forced into it - i.e., that any non-side effect
2586 operator should be allowed, and that cse should take care of coalescing
2587 multiple utterances of the same expression should that prove fruitful. */
2590 stabilize_reference_1 (tree e)
2593 enum tree_code code = TREE_CODE (e);
2595 /* We cannot ignore const expressions because it might be a reference
2596 to a const array but whose index contains side-effects. But we can
2597 ignore things that are actual constant or that already have been
2598 handled by this function. */
2600 if (TREE_INVARIANT (e))
2603 switch (TREE_CODE_CLASS (code))
2605 case tcc_exceptional:
2607 case tcc_declaration:
2608 case tcc_comparison:
2610 case tcc_expression:
2612 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2613 so that it will only be evaluated once. */
2614 /* The reference (r) and comparison (<) classes could be handled as
2615 below, but it is generally faster to only evaluate them once. */
2616 if (TREE_SIDE_EFFECTS (e))
2617 return save_expr (e);
2621 /* Constants need no processing. In fact, we should never reach
2626 /* Division is slow and tends to be compiled with jumps,
2627 especially the division by powers of 2 that is often
2628 found inside of an array reference. So do it just once. */
2629 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2630 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2631 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2632 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2633 return save_expr (e);
2634 /* Recursively stabilize each operand. */
2635 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2636 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2640 /* Recursively stabilize each operand. */
2641 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2648 TREE_TYPE (result) = TREE_TYPE (e);
2649 TREE_READONLY (result) = TREE_READONLY (e);
2650 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2651 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2652 TREE_INVARIANT (result) = 1;
2657 /* Low-level constructors for expressions. */
2659 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2660 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2663 recompute_tree_invariant_for_addr_expr (tree t)
2666 bool tc = true, ti = true, se = false;
2668 /* We started out assuming this address is both invariant and constant, but
2669 does not have side effects. Now go down any handled components and see if
2670 any of them involve offsets that are either non-constant or non-invariant.
2671 Also check for side-effects.
2673 ??? Note that this code makes no attempt to deal with the case where
2674 taking the address of something causes a copy due to misalignment. */
2676 #define UPDATE_TITCSE(NODE) \
2677 do { tree _node = (NODE); \
2678 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2679 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2680 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2682 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2683 node = TREE_OPERAND (node, 0))
2685 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2686 array reference (probably made temporarily by the G++ front end),
2687 so ignore all the operands. */
2688 if ((TREE_CODE (node) == ARRAY_REF
2689 || TREE_CODE (node) == ARRAY_RANGE_REF)
2690 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2692 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2693 if (TREE_OPERAND (node, 2))
2694 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2695 if (TREE_OPERAND (node, 3))
2696 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2698 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2699 FIELD_DECL, apparently. The G++ front end can put something else
2700 there, at least temporarily. */
2701 else if (TREE_CODE (node) == COMPONENT_REF
2702 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2704 if (TREE_OPERAND (node, 2))
2705 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2707 else if (TREE_CODE (node) == BIT_FIELD_REF)
2708 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2711 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2713 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2714 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2715 invariant and constant if the decl is static. It's also invariant if it's
2716 a decl in the current function. Taking the address of a volatile variable
2717 is not volatile. If it's a constant, the address is both invariant and
2718 constant. Otherwise it's neither. */
2719 if (TREE_CODE (node) == INDIRECT_REF)
2720 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2721 else if (DECL_P (node))
2725 else if (decl_function_context (node) == current_function_decl
2726 /* Addresses of thread-local variables are invariant. */
2727 || (TREE_CODE (node) == VAR_DECL
2728 && DECL_THREAD_LOCAL_P (node)))
2733 else if (CONSTANT_CLASS_P (node))
2738 se |= TREE_SIDE_EFFECTS (node);
2741 TREE_CONSTANT (t) = tc;
2742 TREE_INVARIANT (t) = ti;
2743 TREE_SIDE_EFFECTS (t) = se;
2744 #undef UPDATE_TITCSE
2747 /* Build an expression of code CODE, data type TYPE, and operands as
2748 specified. Expressions and reference nodes can be created this way.
2749 Constants, decls, types and misc nodes cannot be.
2751 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2752 enough for all extant tree codes. */
2755 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2759 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2761 t = make_node_stat (code PASS_MEM_STAT);
2768 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2770 int length = sizeof (struct tree_exp);
2771 #ifdef GATHER_STATISTICS
2772 tree_node_kind kind;
2776 #ifdef GATHER_STATISTICS
2777 switch (TREE_CODE_CLASS (code))
2779 case tcc_statement: /* an expression with side effects */
2782 case tcc_reference: /* a reference */
2790 tree_node_counts[(int) kind]++;
2791 tree_node_sizes[(int) kind] += length;
2794 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2796 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2798 memset (t, 0, sizeof (struct tree_common));
2800 TREE_SET_CODE (t, code);
2802 TREE_TYPE (t) = type;
2803 #ifdef USE_MAPPED_LOCATION
2804 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2806 SET_EXPR_LOCUS (t, NULL);
2808 TREE_COMPLEXITY (t) = 0;
2809 TREE_OPERAND (t, 0) = node;
2810 TREE_BLOCK (t) = NULL_TREE;
2811 if (node && !TYPE_P (node))
2813 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2814 TREE_READONLY (t) = TREE_READONLY (node);
2817 if (TREE_CODE_CLASS (code) == tcc_statement)
2818 TREE_SIDE_EFFECTS (t) = 1;
2822 /* All of these have side-effects, no matter what their
2824 TREE_SIDE_EFFECTS (t) = 1;
2825 TREE_READONLY (t) = 0;
2828 case MISALIGNED_INDIRECT_REF:
2829 case ALIGN_INDIRECT_REF:
2831 /* Whether a dereference is readonly has nothing to do with whether
2832 its operand is readonly. */
2833 TREE_READONLY (t) = 0;
2838 recompute_tree_invariant_for_addr_expr (t);
2842 if (TREE_CODE_CLASS (code) == tcc_unary
2843 && node && !TYPE_P (node)
2844 && TREE_CONSTANT (node))
2845 TREE_CONSTANT (t) = 1;
2846 if (TREE_CODE_CLASS (code) == tcc_unary
2847 && node && TREE_INVARIANT (node))
2848 TREE_INVARIANT (t) = 1;
2849 if (TREE_CODE_CLASS (code) == tcc_reference
2850 && node && TREE_THIS_VOLATILE (node))
2851 TREE_THIS_VOLATILE (t) = 1;
2858 #define PROCESS_ARG(N) \
2860 TREE_OPERAND (t, N) = arg##N; \
2861 if (arg##N &&!TYPE_P (arg##N)) \
2863 if (TREE_SIDE_EFFECTS (arg##N)) \
2865 if (!TREE_READONLY (arg##N)) \
2867 if (!TREE_CONSTANT (arg##N)) \
2869 if (!TREE_INVARIANT (arg##N)) \
2875 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2877 bool constant, read_only, side_effects, invariant;
2880 gcc_assert (TREE_CODE_LENGTH (code) == 2);
2882 t = make_node_stat (code PASS_MEM_STAT);
2885 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2886 result based on those same flags for the arguments. But if the
2887 arguments aren't really even `tree' expressions, we shouldn't be trying
2890 /* Expressions without side effects may be constant if their
2891 arguments are as well. */
2892 constant = (TREE_CODE_CLASS (code) == tcc_comparison
2893 || TREE_CODE_CLASS (code) == tcc_binary);
2895 side_effects = TREE_SIDE_EFFECTS (t);
2896 invariant = constant;
2901 TREE_READONLY (t) = read_only;
2902 TREE_CONSTANT (t) = constant;
2903 TREE_INVARIANT (t) = invariant;
2904 TREE_SIDE_EFFECTS (t) = side_effects;
2905 TREE_THIS_VOLATILE (t)
2906 = (TREE_CODE_CLASS (code) == tcc_reference
2907 && arg0 && TREE_THIS_VOLATILE (arg0));
2913 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2914 tree arg2 MEM_STAT_DECL)
2916 bool constant, read_only, side_effects, invariant;
2919 gcc_assert (TREE_CODE_LENGTH (code) == 3);
2921 t = make_node_stat (code PASS_MEM_STAT);
2924 side_effects = TREE_SIDE_EFFECTS (t);
2930 if (code == CALL_EXPR && !side_effects)
2935 /* Calls have side-effects, except those to const or
2937 i = call_expr_flags (t);
2938 if (!(i & (ECF_CONST | ECF_PURE)))
2941 /* And even those have side-effects if their arguments do. */
2942 else for (node = arg1; node; node = TREE_CHAIN (node))
2943 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2950 TREE_SIDE_EFFECTS (t) = side_effects;
2951 TREE_THIS_VOLATILE (t)
2952 = (TREE_CODE_CLASS (code) == tcc_reference
2953 && arg0 && TREE_THIS_VOLATILE (arg0));
2959 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2960 tree arg2, tree arg3 MEM_STAT_DECL)
2962 bool constant, read_only, side_effects, invariant;
2965 gcc_assert (TREE_CODE_LENGTH (code) == 4);
2967 t = make_node_stat (code PASS_MEM_STAT);
2970 side_effects = TREE_SIDE_EFFECTS (t);
2977 TREE_SIDE_EFFECTS (t) = side_effects;
2978 TREE_THIS_VOLATILE (t)
2979 = (TREE_CODE_CLASS (code) == tcc_reference
2980 && arg0 && TREE_THIS_VOLATILE (arg0));
2986 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2987 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
2989 bool constant, read_only, side_effects, invariant;
2992 gcc_assert (TREE_CODE_LENGTH (code) == 5);
2994 t = make_node_stat (code PASS_MEM_STAT);
2997 side_effects = TREE_SIDE_EFFECTS (t);
3005 TREE_SIDE_EFFECTS (t) = side_effects;
3006 TREE_THIS_VOLATILE (t)
3007 = (TREE_CODE_CLASS (code) == tcc_reference
3008 && arg0 && TREE_THIS_VOLATILE (arg0));
3014 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3015 tree arg2, tree arg3, tree arg4, tree arg5,
3016 tree arg6 MEM_STAT_DECL)
3018 bool constant, read_only, side_effects, invariant;
3021 gcc_assert (code == TARGET_MEM_REF);
3023 t = make_node_stat (code PASS_MEM_STAT);
3026 side_effects = TREE_SIDE_EFFECTS (t);
3036 TREE_SIDE_EFFECTS (t) = side_effects;
3037 TREE_THIS_VOLATILE (t) = 0;
3042 /* Similar except don't specify the TREE_TYPE
3043 and leave the TREE_SIDE_EFFECTS as 0.
3044 It is permissible for arguments to be null,
3045 or even garbage if their values do not matter. */
3048 build_nt (enum tree_code code, ...)
3057 t = make_node (code);
3058 length = TREE_CODE_LENGTH (code);
3060 for (i = 0; i < length; i++)
3061 TREE_OPERAND (t, i) = va_arg (p, tree);
3067 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3068 We do NOT enter this node in any sort of symbol table.
3070 layout_decl is used to set up the decl's storage layout.
3071 Other slots are initialized to 0 or null pointers. */
3074 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3078 t = make_node_stat (code PASS_MEM_STAT);
3080 /* if (type == error_mark_node)
3081 type = integer_type_node; */
3082 /* That is not done, deliberately, so that having error_mark_node
3083 as the type can suppress useless errors in the use of this variable. */
3085 DECL_NAME (t) = name;
3086 TREE_TYPE (t) = type;
3088 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3090 else if (code == FUNCTION_DECL)
3091 DECL_MODE (t) = FUNCTION_MODE;
3093 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
3095 /* Set default visibility to whatever the user supplied with
3096 visibility_specified depending on #pragma GCC visibility. */
3097 DECL_VISIBILITY (t) = default_visibility;
3098 DECL_VISIBILITY_SPECIFIED (t) = visibility_options.inpragma;
3104 /* Builds and returns function declaration with NAME and TYPE. */
3107 build_fn_decl (const char *name, tree type)
3109 tree id = get_identifier (name);
3110 tree decl = build_decl (FUNCTION_DECL, id, type);
3112 DECL_EXTERNAL (decl) = 1;
3113 TREE_PUBLIC (decl) = 1;
3114 DECL_ARTIFICIAL (decl) = 1;
3115 TREE_NOTHROW (decl) = 1;
3121 /* BLOCK nodes are used to represent the structure of binding contours
3122 and declarations, once those contours have been exited and their contents
3123 compiled. This information is used for outputting debugging info. */
3126 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3128 tree block = make_node (BLOCK);
3130 BLOCK_VARS (block) = vars;
3131 BLOCK_SUBBLOCKS (block) = subblocks;
3132 BLOCK_SUPERCONTEXT (block) = supercontext;
3133 BLOCK_CHAIN (block) = chain;
3137 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3138 /* ??? gengtype doesn't handle conditionals */
3139 static GTY(()) location_t *last_annotated_node;
3142 #ifdef USE_MAPPED_LOCATION
3145 expand_location (source_location loc)
3147 expanded_location xloc;
3148 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
3151 const struct line_map *map = linemap_lookup (&line_table, loc);
3152 xloc.file = map->to_file;
3153 xloc.line = SOURCE_LINE (map, loc);
3154 xloc.column = SOURCE_COLUMN (map, loc);
3161 /* Record the exact location where an expression or an identifier were
3165 annotate_with_file_line (tree node, const char *file, int line)
3167 /* Roughly one percent of the calls to this function are to annotate
3168 a node with the same information already attached to that node!
3169 Just return instead of wasting memory. */
3170 if (EXPR_LOCUS (node)
3171 && EXPR_LINENO (node) == line
3172 && (EXPR_FILENAME (node) == file
3173 || !strcmp (EXPR_FILENAME (node), file)))
3175 last_annotated_node = EXPR_LOCUS (node);
3179 /* In heavily macroized code (such as GCC itself) this single
3180 entry cache can reduce the number of allocations by more
3182 if (last_annotated_node
3183 && last_annotated_node->line == line
3184 && (last_annotated_node->file == file
3185 || !strcmp (last_annotated_node->file, file)))
3187 SET_EXPR_LOCUS (node, last_annotated_node);
3191 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3192 EXPR_LINENO (node) = line;
3193 EXPR_FILENAME (node) = file;
3194 last_annotated_node = EXPR_LOCUS (node);
3198 annotate_with_locus (tree node, location_t locus)
3200 annotate_with_file_line (node, locus.file, locus.line);
3204 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3208 build_decl_attribute_variant (tree ddecl, tree attribute)
3210 DECL_ATTRIBUTES (ddecl) = attribute;
3214 /* Borrowed from hashtab.c iterative_hash implementation. */
3215 #define mix(a,b,c) \
3217 a -= b; a -= c; a ^= (c>>13); \
3218 b -= c; b -= a; b ^= (a<< 8); \
3219 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3220 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3221 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3222 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3223 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3224 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3225 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3229 /* Produce good hash value combining VAL and VAL2. */
3230 static inline hashval_t
3231 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3233 /* the golden ratio; an arbitrary value. */
3234 hashval_t a = 0x9e3779b9;
3240 /* Produce good hash value combining PTR and VAL2. */
3241 static inline hashval_t
3242 iterative_hash_pointer (void *ptr, hashval_t val2)
3244 if (sizeof (ptr) == sizeof (hashval_t))
3245 return iterative_hash_hashval_t ((size_t) ptr, val2);
3248 hashval_t a = (hashval_t) (size_t) ptr;
3249 /* Avoid warnings about shifting of more than the width of the type on
3250 hosts that won't execute this path. */
3252 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3258 /* Produce good hash value combining VAL and VAL2. */
3259 static inline hashval_t
3260 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3262 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3263 return iterative_hash_hashval_t (val, val2);
3266 hashval_t a = (hashval_t) val;
3267 /* Avoid warnings about shifting of more than the width of the type on
3268 hosts that won't execute this path. */
3270 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3272 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3274 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3275 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3282 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3285 Record such modified types already made so we don't make duplicates. */
3288 build_type_attribute_variant (tree ttype, tree attribute)
3290 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3292 hashval_t hashcode = 0;
3294 enum tree_code code = TREE_CODE (ttype);
3296 ntype = copy_node (ttype);
3298 TYPE_POINTER_TO (ntype) = 0;
3299 TYPE_REFERENCE_TO (ntype) = 0;
3300 TYPE_ATTRIBUTES (ntype) = attribute;
3302 /* Create a new main variant of TYPE. */
3303 TYPE_MAIN_VARIANT (ntype) = ntype;
3304 TYPE_NEXT_VARIANT (ntype) = 0;
3305 set_type_quals (ntype, TYPE_UNQUALIFIED);
3307 hashcode = iterative_hash_object (code, hashcode);
3308 if (TREE_TYPE (ntype))
3309 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3311 hashcode = attribute_hash_list (attribute, hashcode);
3313 switch (TREE_CODE (ntype))
3316 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3319 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3323 hashcode = iterative_hash_object
3324 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3325 hashcode = iterative_hash_object
3326 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3330 unsigned int precision = TYPE_PRECISION (ntype);
3331 hashcode = iterative_hash_object (precision, hashcode);
3338 ntype = type_hash_canon (hashcode, ntype);
3339 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
3346 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3349 We try both `text' and `__text__', ATTR may be either one. */
3350 /* ??? It might be a reasonable simplification to require ATTR to be only
3351 `text'. One might then also require attribute lists to be stored in
3352 their canonicalized form. */
3355 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3360 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3363 p = IDENTIFIER_POINTER (ident);
3364 ident_len = IDENTIFIER_LENGTH (ident);
3366 if (ident_len == attr_len
3367 && strcmp (attr, p) == 0)
3370 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3373 gcc_assert (attr[1] == '_');
3374 gcc_assert (attr[attr_len - 2] == '_');
3375 gcc_assert (attr[attr_len - 1] == '_');
3376 gcc_assert (attr[1] == '_');
3377 if (ident_len == attr_len - 4
3378 && strncmp (attr + 2, p, attr_len - 4) == 0)
3383 if (ident_len == attr_len + 4
3384 && p[0] == '_' && p[1] == '_'
3385 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3386 && strncmp (attr, p + 2, attr_len) == 0)
3393 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3396 We try both `text' and `__text__', ATTR may be either one. */
3399 is_attribute_p (const char *attr, tree ident)
3401 return is_attribute_with_length_p (attr, strlen (attr), ident);
3404 /* Given an attribute name and a list of attributes, return a pointer to the
3405 attribute's list element if the attribute is part of the list, or NULL_TREE
3406 if not found. If the attribute appears more than once, this only
3407 returns the first occurrence; the TREE_CHAIN of the return value should
3408 be passed back in if further occurrences are wanted. */
3411 lookup_attribute (const char *attr_name, tree list)
3414 size_t attr_len = strlen (attr_name);
3416 for (l = list; l; l = TREE_CHAIN (l))
3418 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3419 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3426 /* Return an attribute list that is the union of a1 and a2. */
3429 merge_attributes (tree a1, tree a2)
3433 /* Either one unset? Take the set one. */
3435 if ((attributes = a1) == 0)
3438 /* One that completely contains the other? Take it. */
3440 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3442 if (attribute_list_contained (a2, a1))
3446 /* Pick the longest list, and hang on the other list. */
3448 if (list_length (a1) < list_length (a2))
3449 attributes = a2, a2 = a1;
3451 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3454 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3457 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3460 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
3465 a1 = copy_node (a2);
3466 TREE_CHAIN (a1) = attributes;
3475 /* Given types T1 and T2, merge their attributes and return
3479 merge_type_attributes (tree t1, tree t2)
3481 return merge_attributes (TYPE_ATTRIBUTES (t1),
3482 TYPE_ATTRIBUTES (t2));
3485 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3489 merge_decl_attributes (tree olddecl, tree newdecl)
3491 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3492 DECL_ATTRIBUTES (newdecl));
3495 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3497 /* Specialization of merge_decl_attributes for various Windows targets.
3499 This handles the following situation:
3501 __declspec (dllimport) int foo;
3504 The second instance of `foo' nullifies the dllimport. */
3507 merge_dllimport_decl_attributes (tree old, tree new)
3510 int delete_dllimport_p = 1;
3512 /* What we need to do here is remove from `old' dllimport if it doesn't
3513 appear in `new'. dllimport behaves like extern: if a declaration is
3514 marked dllimport and a definition appears later, then the object
3515 is not dllimport'd. We also remove a `new' dllimport if the old list
3516 contains dllexport: dllexport always overrides dllimport, regardless
3517 of the order of declaration. */
3518 if (!VAR_OR_FUNCTION_DECL_P (new))
3519 delete_dllimport_p = 0;
3520 else if (DECL_DLLIMPORT_P (new)
3521 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3523 DECL_DLLIMPORT_P (new) = 0;
3524 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3525 "dllimport ignored", new);
3527 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3529 /* Warn about overriding a symbol that has already been used. eg:
3530 extern int __attribute__ ((dllimport)) foo;
3531 int* bar () {return &foo;}
3534 if (TREE_USED (old))
3536 warning (0, "%q+D redeclared without dllimport attribute "
3537 "after being referenced with dll linkage", new);
3538 /* If we have used a variable's address with dllimport linkage,
3539 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3540 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3542 We still remove the attribute so that assembler code refers
3543 to '&foo rather than '_imp__foo'. */
3544 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3545 DECL_DLLIMPORT_P (new) = 1;
3548 /* Let an inline definition silently override the external reference,
3549 but otherwise warn about attribute inconsistency. */
3550 else if (TREE_CODE (new) == VAR_DECL
3551 || !DECL_DECLARED_INLINE_P (new))
3552 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3553 "previous dllimport ignored", new);
3556 delete_dllimport_p = 0;
3558 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3560 if (delete_dllimport_p)
3563 const size_t attr_len = strlen ("dllimport");
3565 /* Scan the list for dllimport and delete it. */
3566 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3568 if (is_attribute_with_length_p ("dllimport", attr_len,
3571 if (prev == NULL_TREE)
3574 TREE_CHAIN (prev) = TREE_CHAIN (t);
3583 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3584 struct attribute_spec.handler. */
3587 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3592 /* These attributes may apply to structure and union types being created,
3593 but otherwise should pass to the declaration involved. */
3596 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3597 | (int) ATTR_FLAG_ARRAY_NEXT))
3599 *no_add_attrs = true;
3600 return tree_cons (name, args, NULL_TREE);
3602 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3604 warning (OPT_Wattributes, "%qs attribute ignored",
3605 IDENTIFIER_POINTER (name));
3606 *no_add_attrs = true;
3612 /* Report error on dllimport ambiguities seen now before they cause
3614 if (is_attribute_p ("dllimport", name))
3616 /* Honor any target-specific overrides. */
3617 if (!targetm.valid_dllimport_attribute_p (node))
3618 *no_add_attrs = true;
3620 else if (TREE_CODE (node) == FUNCTION_DECL
3621 && DECL_DECLARED_INLINE_P (node))
3623 warning (OPT_Wattributes, "inline function %q+D declared as "
3624 " dllimport: attribute ignored", node);
3625 *no_add_attrs = true;
3627 /* Like MS, treat definition of dllimported variables and
3628 non-inlined functions on declaration as syntax errors. */
3629 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
3631 error ("function %q+D definition is marked dllimport", node);
3632 *no_add_attrs = true;
3635 else if (TREE_CODE (node) == VAR_DECL)
3637 if (DECL_INITIAL (node))
3639 error ("variable %q+D definition is marked dllimport",
3641 *no_add_attrs = true;
3644 /* `extern' needn't be specified with dllimport.
3645 Specify `extern' now and hope for the best. Sigh. */
3646 DECL_EXTERNAL (node) = 1;
3647 /* Also, implicitly give dllimport'd variables declared within
3648 a function global scope, unless declared static. */
3649 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3650 TREE_PUBLIC (node) = 1;
3653 if (*no_add_attrs == false)
3654 DECL_DLLIMPORT_P (node) = 1;
3657 /* Report error if symbol is not accessible at global scope. */
3658 if (!TREE_PUBLIC (node)
3659 && (TREE_CODE (node) == VAR_DECL
3660 || TREE_CODE (node) == FUNCTION_DECL))
3662 error ("external linkage required for symbol %q+D because of "
3663 "%qs attribute", node, IDENTIFIER_POINTER (name));
3664 *no_add_attrs = true;
3670 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3672 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3673 of the various TYPE_QUAL values. */
3676 set_type_quals (tree type, int type_quals)
3678 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3679 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3680 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3683 /* Returns true iff cand is equivalent to base with type_quals. */
3686 check_qualified_type (tree cand, tree base, int type_quals)
3688 return (TYPE_QUALS (cand) == type_quals
3689 && TYPE_NAME (cand) == TYPE_NAME (base)
3690 /* Apparently this is needed for Objective-C. */
3691 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3692 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3693 TYPE_ATTRIBUTES (base)));
3696 /* Return a version of the TYPE, qualified as indicated by the
3697 TYPE_QUALS, if one exists. If no qualified version exists yet,
3698 return NULL_TREE. */
3701 get_qualified_type (tree type, int type_quals)
3705 if (TYPE_QUALS (type) == type_quals)
3708 /* Search the chain of variants to see if there is already one there just
3709 like the one we need to have. If so, use that existing one. We must
3710 preserve the TYPE_NAME, since there is code that depends on this. */
3711 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3712 if (check_qualified_type (t, type, type_quals))
3718 /* Like get_qualified_type, but creates the type if it does not
3719 exist. This function never returns NULL_TREE. */
3722 build_qualified_type (tree type, int type_quals)
3726 /* See if we already have the appropriate qualified variant. */
3727 t = get_qualified_type (type, type_quals);
3729 /* If not, build it. */
3732 t = build_variant_type_copy (type);
3733 set_type_quals (t, type_quals);
3739 /* Create a new distinct copy of TYPE. The new type is made its own
3743 build_distinct_type_copy (tree type)
3745 tree t = copy_node (type);
3747 TYPE_POINTER_TO (t) = 0;
3748 TYPE_REFERENCE_TO (t) = 0;
3750 /* Make it its own variant. */
3751 TYPE_MAIN_VARIANT (t) = t;
3752 TYPE_NEXT_VARIANT (t) = 0;
3757 /* Create a new variant of TYPE, equivalent but distinct.
3758 This is so the caller can modify it. */
3761 build_variant_type_copy (tree type)
3763 tree t, m = TYPE_MAIN_VARIANT (type);
3765 t = build_distinct_type_copy (type);
3767 /* Add the new type to the chain of variants of TYPE. */
3768 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3769 TYPE_NEXT_VARIANT (m) = t;
3770 TYPE_MAIN_VARIANT (t) = m;
3775 /* Return true if the from tree in both tree maps are equal. */
3778 tree_map_eq (const void *va, const void *vb)
3780 const struct tree_map *a = va, *b = vb;
3781 return (a->from == b->from);
3784 /* Hash a from tree in a tree_map. */
3787 tree_map_hash (const void *item)
3789 return (((const struct tree_map *) item)->hash);
3792 /* Return true if this tree map structure is marked for garbage collection
3793 purposes. We simply return true if the from tree is marked, so that this
3794 structure goes away when the from tree goes away. */
3797 tree_map_marked_p (const void *p)
3799 tree from = ((struct tree_map *) p)->from;
3801 return ggc_marked_p (from);
3804 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
3807 tree_int_map_eq (const void *va, const void *vb)
3809 const struct tree_int_map *a = va, *b = vb;
3810 return (a->from == b->from);
3813 /* Hash a from tree in the tree_int_map * ITEM. */
3816 tree_int_map_hash (const void *item)
3818 return htab_hash_pointer (((const struct tree_int_map *)item)->from);
3821 /* Return true if this tree int map structure is marked for garbage collection
3822 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
3823 structure goes away when the from tree goes away. */
3826 tree_int_map_marked_p (const void *p)
3828 tree from = ((struct tree_int_map *) p)->from;
3830 return ggc_marked_p (from);
3832 /* Lookup an init priority for FROM, and return it if we find one. */
3835 decl_init_priority_lookup (tree from)
3837 struct tree_int_map *h, in;
3840 h = htab_find_with_hash (init_priority_for_decl,
3841 &in, htab_hash_pointer (from));
3847 /* Insert a mapping FROM->TO in the init priority hashtable. */
3850 decl_init_priority_insert (tree from, unsigned short to)
3852 struct tree_int_map *h;
3855 h = ggc_alloc (sizeof (struct tree_int_map));
3858 loc = htab_find_slot_with_hash (init_priority_for_decl, h,
3859 htab_hash_pointer (from), INSERT);
3860 *(struct tree_int_map **) loc = h;
3863 /* Look up a restrict qualified base decl for FROM. */
3866 decl_restrict_base_lookup (tree from)
3872 h = htab_find_with_hash (restrict_base_for_decl, &in,
3873 htab_hash_pointer (from));
3874 return h ? h->to : NULL_TREE;
3877 /* Record the restrict qualified base TO for FROM. */
3880 decl_restrict_base_insert (tree from, tree to)
3885 h = ggc_alloc (sizeof (struct tree_map));
3886 h->hash = htab_hash_pointer (from);
3889 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
3890 *(struct tree_map **) loc = h;
3893 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
3896 print_debug_expr_statistics (void)
3898 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
3899 (long) htab_size (debug_expr_for_decl),
3900 (long) htab_elements (debug_expr_for_decl),
3901 htab_collisions (debug_expr_for_decl));
3904 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
3907 print_value_expr_statistics (void)
3909 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
3910 (long) htab_size (value_expr_for_decl),
3911 (long) htab_elements (value_expr_for_decl),
3912 htab_collisions (value_expr_for_decl));
3915 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
3916 don't print anything if the table is empty. */
3919 print_restrict_base_statistics (void)
3921 if (htab_elements (restrict_base_for_decl) != 0)
3923 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
3924 (long) htab_size (restrict_base_for_decl),
3925 (long) htab_elements (restrict_base_for_decl),
3926 htab_collisions (restrict_base_for_decl));
3929 /* Lookup a debug expression for FROM, and return it if we find one. */
3932 decl_debug_expr_lookup (tree from)
3934 struct tree_map *h, in;
3937 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
3943 /* Insert a mapping FROM->TO in the debug expression hashtable. */
3946 decl_debug_expr_insert (tree from, tree to)
3951 h = ggc_alloc (sizeof (struct tree_map));
3952 h->hash = htab_hash_pointer (from);
3955 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
3956 *(struct tree_map **) loc = h;
3959 /* Lookup a value expression for FROM, and return it if we find one. */
3962 decl_value_expr_lookup (tree from)
3964 struct tree_map *h, in;
3967 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
3973 /* Insert a mapping FROM->TO in the value expression hashtable. */
3976 decl_value_expr_insert (tree from, tree to)
3981 h = ggc_alloc (sizeof (struct tree_map));
3982 h->hash = htab_hash_pointer (from);
3985 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
3986 *(struct tree_map **) loc = h;
3989 /* Hashing of types so that we don't make duplicates.
3990 The entry point is `type_hash_canon'. */
3992 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3993 with types in the TREE_VALUE slots), by adding the hash codes
3994 of the individual types. */
3997 type_hash_list (tree list, hashval_t hashcode)
4001 for (tail = list; tail; tail = TREE_CHAIN (tail))
4002 if (TREE_VALUE (tail) != error_mark_node)
4003 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4009 /* These are the Hashtable callback functions. */
4011 /* Returns true iff the types are equivalent. */
4014 type_hash_eq (const void *va, const void *vb)
4016 const struct type_hash *a = va, *b = vb;
4018 /* First test the things that are the same for all types. */
4019 if (a->hash != b->hash
4020 || TREE_CODE (a->type) != TREE_CODE (b->type)
4021 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4022 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4023 TYPE_ATTRIBUTES (b->type))
4024 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4025 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4028 switch (TREE_CODE (a->type))
4033 case REFERENCE_TYPE:
4037 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4040 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4041 && !(TYPE_VALUES (a->type)
4042 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4043 && TYPE_VALUES (b->type)
4044 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4045 && type_list_equal (TYPE_VALUES (a->type),
4046 TYPE_VALUES (b->type))))
4049 /* ... fall through ... */
4054 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4055 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4056 TYPE_MAX_VALUE (b->type)))
4057 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4058 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4059 TYPE_MIN_VALUE (b->type))));
4062 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4065 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4066 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4067 || (TYPE_ARG_TYPES (a->type)
4068 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4069 && TYPE_ARG_TYPES (b->type)
4070 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4071 && type_list_equal (TYPE_ARG_TYPES (a->type),
4072 TYPE_ARG_TYPES (b->type)))));
4075 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4079 case QUAL_UNION_TYPE:
4080 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4081 || (TYPE_FIELDS (a->type)
4082 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4083 && TYPE_FIELDS (b->type)
4084 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4085 && type_list_equal (TYPE_FIELDS (a->type),
4086 TYPE_FIELDS (b->type))));
4089 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4090 || (TYPE_ARG_TYPES (a->type)
4091 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4092 && TYPE_ARG_TYPES (b->type)
4093 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4094 && type_list_equal (TYPE_ARG_TYPES (a->type),
4095 TYPE_ARG_TYPES (b->type))));
4102 /* Return the cached hash value. */
4105 type_hash_hash (const void *item)
4107 return ((const struct type_hash *) item)->hash;
4110 /* Look in the type hash table for a type isomorphic to TYPE.
4111 If one is found, return it. Otherwise return 0. */
4114 type_hash_lookup (hashval_t hashcode, tree type)
4116 struct type_hash *h, in;
4118 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4119 must call that routine before comparing TYPE_ALIGNs. */
4125 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4131 /* Add an entry to the type-hash-table
4132 for a type TYPE whose hash code is HASHCODE. */
4135 type_hash_add (hashval_t hashcode, tree type)
4137 struct type_hash *h;
4140 h = ggc_alloc (sizeof (struct type_hash));
4143 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4144 *(struct type_hash **) loc = h;
4147 /* Given TYPE, and HASHCODE its hash code, return the canonical
4148 object for an identical type if one already exists.
4149 Otherwise, return TYPE, and record it as the canonical object.
4151 To use this function, first create a type of the sort you want.
4152 Then compute its hash code from the fields of the type that
4153 make it different from other similar types.
4154 Then call this function and use the value. */
4157 type_hash_canon (unsigned int hashcode, tree type)
4161 /* The hash table only contains main variants, so ensure that's what we're
4163 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4165 if (!lang_hooks.types.hash_types)
4168 /* See if the type is in the hash table already. If so, return it.
4169 Otherwise, add the type. */
4170 t1 = type_hash_lookup (hashcode, type);
4173 #ifdef GATHER_STATISTICS
4174 tree_node_counts[(int) t_kind]--;
4175 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4181 type_hash_add (hashcode, type);
4186 /* See if the data pointed to by the type hash table is marked. We consider
4187 it marked if the type is marked or if a debug type number or symbol
4188 table entry has been made for the type. This reduces the amount of
4189 debugging output and eliminates that dependency of the debug output on
4190 the number of garbage collections. */
4193 type_hash_marked_p (const void *p)
4195 tree type = ((struct type_hash *) p)->type;
4197 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4201 print_type_hash_statistics (void)
4203 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4204 (long) htab_size (type_hash_table),
4205 (long) htab_elements (type_hash_table),
4206 htab_collisions (type_hash_table));
4209 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4210 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4211 by adding the hash codes of the individual attributes. */
4214 attribute_hash_list (tree list, hashval_t hashcode)
4218 for (tail = list; tail; tail = TREE_CHAIN (tail))
4219 /* ??? Do we want to add in TREE_VALUE too? */
4220 hashcode = iterative_hash_object
4221 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4225 /* Given two lists of attributes, return true if list l2 is
4226 equivalent to l1. */
4229 attribute_list_equal (tree l1, tree l2)
4231 return attribute_list_contained (l1, l2)
4232 && attribute_list_contained (l2, l1);
4235 /* Given two lists of attributes, return true if list L2 is
4236 completely contained within L1. */
4237 /* ??? This would be faster if attribute names were stored in a canonicalized
4238 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4239 must be used to show these elements are equivalent (which they are). */
4240 /* ??? It's not clear that attributes with arguments will always be handled
4244 attribute_list_contained (tree l1, tree l2)
4248 /* First check the obvious, maybe the lists are identical. */
4252 /* Maybe the lists are similar. */
4253 for (t1 = l1, t2 = l2;
4255 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4256 && TREE_VALUE (t1) == TREE_VALUE (t2);
4257 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4259 /* Maybe the lists are equal. */
4260 if (t1 == 0 && t2 == 0)
4263 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4266 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4268 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4271 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4278 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
4285 /* Given two lists of types
4286 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4287 return 1 if the lists contain the same types in the same order.
4288 Also, the TREE_PURPOSEs must match. */
4291 type_list_equal (tree l1, tree l2)
4295 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4296 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4297 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4298 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4299 && (TREE_TYPE (TREE_PURPOSE (t1))
4300 == TREE_TYPE (TREE_PURPOSE (t2))))))
4306 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4307 given by TYPE. If the argument list accepts variable arguments,
4308 then this function counts only the ordinary arguments. */
4311 type_num_arguments (tree type)
4316 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4317 /* If the function does not take a variable number of arguments,
4318 the last element in the list will have type `void'. */
4319 if (VOID_TYPE_P (TREE_VALUE (t)))
4327 /* Nonzero if integer constants T1 and T2
4328 represent the same constant value. */
4331 tree_int_cst_equal (tree t1, tree t2)
4336 if (t1 == 0 || t2 == 0)
4339 if (TREE_CODE (t1) == INTEGER_CST
4340 && TREE_CODE (t2) == INTEGER_CST
4341 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4342 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4348 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4349 The precise way of comparison depends on their data type. */
4352 tree_int_cst_lt (tree t1, tree t2)
4357 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4359 int t1_sgn = tree_int_cst_sgn (t1);
4360 int t2_sgn = tree_int_cst_sgn (t2);
4362 if (t1_sgn < t2_sgn)
4364 else if (t1_sgn > t2_sgn)
4366 /* Otherwise, both are non-negative, so we compare them as
4367 unsigned just in case one of them would overflow a signed
4370 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4371 return INT_CST_LT (t1, t2);
4373 return INT_CST_LT_UNSIGNED (t1, t2);
4376 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4379 tree_int_cst_compare (tree t1, tree t2)
4381 if (tree_int_cst_lt (t1, t2))
4383 else if (tree_int_cst_lt (t2, t1))
4389 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4390 the host. If POS is zero, the value can be represented in a single
4391 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4392 be represented in a single unsigned HOST_WIDE_INT. */
4395 host_integerp (tree t, int pos)
4397 return (TREE_CODE (t) == INTEGER_CST
4398 && ((TREE_INT_CST_HIGH (t) == 0
4399 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4400 || (! pos && TREE_INT_CST_HIGH (t) == -1
4401 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4402 && !TYPE_UNSIGNED (TREE_TYPE (t)))
4403 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4406 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4407 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4408 be non-negative. We must be able to satisfy the above conditions. */
4411 tree_low_cst (tree t, int pos)
4413 gcc_assert (host_integerp (t, pos));
4414 return TREE_INT_CST_LOW (t);
4417 /* Return the most significant bit of the integer constant T. */
4420 tree_int_cst_msb (tree t)
4424 unsigned HOST_WIDE_INT l;
4426 /* Note that using TYPE_PRECISION here is wrong. We care about the
4427 actual bits, not the (arbitrary) range of the type. */
4428 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4429 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4430 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4431 return (l & 1) == 1;
4434 /* Return an indication of the sign of the integer constant T.
4435 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4436 Note that -1 will never be returned if T's type is unsigned. */
4439 tree_int_cst_sgn (tree t)
4441 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4443 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4445 else if (TREE_INT_CST_HIGH (t) < 0)
4451 /* Compare two constructor-element-type constants. Return 1 if the lists
4452 are known to be equal; otherwise return 0. */
4455 simple_cst_list_equal (tree l1, tree l2)
4457 while (l1 != NULL_TREE && l2 != NULL_TREE)
4459 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4462 l1 = TREE_CHAIN (l1);
4463 l2 = TREE_CHAIN (l2);
4469 /* Return truthvalue of whether T1 is the same tree structure as T2.
4470 Return 1 if they are the same.
4471 Return 0 if they are understandably different.
4472 Return -1 if either contains tree structure not understood by
4476 simple_cst_equal (tree t1, tree t2)
4478 enum tree_code code1, code2;
4484 if (t1 == 0 || t2 == 0)
4487 code1 = TREE_CODE (t1);
4488 code2 = TREE_CODE (t2);
4490 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4492 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4493 || code2 == NON_LVALUE_EXPR)
4494 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4496 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4499 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4500 || code2 == NON_LVALUE_EXPR)
4501 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4509 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4510 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4513 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4516 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4517 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4518 TREE_STRING_LENGTH (t1)));
4522 unsigned HOST_WIDE_INT idx;
4523 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4524 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4526 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4529 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4530 /* ??? Should we handle also fields here? */
4531 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4532 VEC_index (constructor_elt, v2, idx)->value))
4538 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4541 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4545 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4548 /* Special case: if either target is an unallocated VAR_DECL,
4549 it means that it's going to be unified with whatever the
4550 TARGET_EXPR is really supposed to initialize, so treat it
4551 as being equivalent to anything. */
4552 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4553 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4554 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
4555 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4556 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4557 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
4560 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4565 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4567 case WITH_CLEANUP_EXPR:
4568 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4572 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
4575 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4576 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4590 /* This general rule works for most tree codes. All exceptions should be
4591 handled above. If this is a language-specific tree code, we can't
4592 trust what might be in the operand, so say we don't know
4594 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4597 switch (TREE_CODE_CLASS (code1))
4601 case tcc_comparison:
4602 case tcc_expression:
4606 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
4608 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4620 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4621 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4622 than U, respectively. */
4625 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
4627 if (tree_int_cst_sgn (t) < 0)
4629 else if (TREE_INT_CST_HIGH (t) != 0)
4631 else if (TREE_INT_CST_LOW (t) == u)
4633 else if (TREE_INT_CST_LOW (t) < u)
4639 /* Return true if CODE represents an associative tree code. Otherwise
4642 associative_tree_code (enum tree_code code)
4661 /* Return true if CODE represents a commutative tree code. Otherwise
4664 commutative_tree_code (enum tree_code code)
4677 case UNORDERED_EXPR:
4681 case TRUTH_AND_EXPR:
4682 case TRUTH_XOR_EXPR:
4692 /* Generate a hash value for an expression. This can be used iteratively
4693 by passing a previous result as the "val" argument.
4695 This function is intended to produce the same hash for expressions which
4696 would compare equal using operand_equal_p. */
4699 iterative_hash_expr (tree t, hashval_t val)
4702 enum tree_code code;
4706 return iterative_hash_pointer (t, val);
4708 code = TREE_CODE (t);
4712 /* Alas, constants aren't shared, so we can't rely on pointer
4715 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
4716 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
4719 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
4721 return iterative_hash_hashval_t (val2, val);
4724 return iterative_hash (TREE_STRING_POINTER (t),
4725 TREE_STRING_LENGTH (t), val);
4727 val = iterative_hash_expr (TREE_REALPART (t), val);
4728 return iterative_hash_expr (TREE_IMAGPART (t), val);
4730 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
4734 /* we can just compare by pointer. */
4735 return iterative_hash_pointer (t, val);
4738 /* A list of expressions, for a CALL_EXPR or as the elements of a
4740 for (; t; t = TREE_CHAIN (t))
4741 val = iterative_hash_expr (TREE_VALUE (t), val);
4745 unsigned HOST_WIDE_INT idx;
4747 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
4749 val = iterative_hash_expr (field, val);
4750 val = iterative_hash_expr (value, val);
4755 /* When referring to a built-in FUNCTION_DECL, use the
4756 __builtin__ form. Otherwise nodes that compare equal
4757 according to operand_equal_p might get different
4759 if (DECL_BUILT_IN (t))
4761 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
4765 /* else FALL THROUGH */
4767 class = TREE_CODE_CLASS (code);
4769 if (class == tcc_declaration)
4771 /* DECL's have a unique ID */
4772 val = iterative_hash_host_wide_int (DECL_UID (t), val);
4776 gcc_assert (IS_EXPR_CODE_CLASS (class));
4778 val = iterative_hash_object (code, val);
4780 /* Don't hash the type, that can lead to having nodes which
4781 compare equal according to operand_equal_p, but which
4782 have different hash codes. */
4783 if (code == NOP_EXPR
4784 || code == CONVERT_EXPR
4785 || code == NON_LVALUE_EXPR)
4787 /* Make sure to include signness in the hash computation. */
4788 val += TYPE_UNSIGNED (TREE_TYPE (t));
4789 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
4792 else if (commutative_tree_code (code))
4794 /* It's a commutative expression. We want to hash it the same
4795 however it appears. We do this by first hashing both operands
4796 and then rehashing based on the order of their independent
4798 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
4799 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
4803 t = one, one = two, two = t;
4805 val = iterative_hash_hashval_t (one, val);
4806 val = iterative_hash_hashval_t (two, val);
4809 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i)
4810 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
4817 /* Constructors for pointer, array and function types.
4818 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4819 constructed by language-dependent code, not here.) */
4821 /* Construct, lay out and return the type of pointers to TO_TYPE with
4822 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4823 reference all of memory. If such a type has already been
4824 constructed, reuse it. */
4827 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
4832 if (to_type == error_mark_node)
4833 return error_mark_node;
4835 /* In some cases, languages will have things that aren't a POINTER_TYPE
4836 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4837 In that case, return that type without regard to the rest of our
4840 ??? This is a kludge, but consistent with the way this function has
4841 always operated and there doesn't seem to be a good way to avoid this
4843 if (TYPE_POINTER_TO (to_type) != 0
4844 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4845 return TYPE_POINTER_TO (to_type);
4847 /* First, if we already have a type for pointers to TO_TYPE and it's
4848 the proper mode, use it. */
4849 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4850 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4853 t = make_node (POINTER_TYPE);
4855 TREE_TYPE (t) = to_type;
4856 TYPE_MODE (t) = mode;
4857 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4858 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
4859 TYPE_POINTER_TO (to_type) = t;
4861 /* Lay out the type. This function has many callers that are concerned
4862 with expression-construction, and this simplifies them all. */
4868 /* By default build pointers in ptr_mode. */
4871 build_pointer_type (tree to_type)
4873 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4876 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4879 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4884 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4885 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4886 In that case, return that type without regard to the rest of our
4889 ??? This is a kludge, but consistent with the way this function has
4890 always operated and there doesn't seem to be a good way to avoid this
4892 if (TYPE_REFERENCE_TO (to_type) != 0
4893 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4894 return TYPE_REFERENCE_TO (to_type);
4896 /* First, if we already have a type for pointers to TO_TYPE and it's
4897 the proper mode, use it. */
4898 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4899 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4902 t = make_node (REFERENCE_TYPE);
4904 TREE_TYPE (t) = to_type;
4905 TYPE_MODE (t) = mode;
4906 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4907 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4908 TYPE_REFERENCE_TO (to_type) = t;
4916 /* Build the node for the type of references-to-TO_TYPE by default
4920 build_reference_type (tree to_type)
4922 return build_reference_type_for_mode (to_type, ptr_mode, false);
4925 /* Build a type that is compatible with t but has no cv quals anywhere
4928 const char *const *const * -> char ***. */
4931 build_type_no_quals (tree t)
4933 switch (TREE_CODE (t))
4936 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4938 TYPE_REF_CAN_ALIAS_ALL (t));
4939 case REFERENCE_TYPE:
4941 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4943 TYPE_REF_CAN_ALIAS_ALL (t));
4945 return TYPE_MAIN_VARIANT (t);
4949 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4950 MAXVAL should be the maximum value in the domain
4951 (one less than the length of the array).
4953 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4954 We don't enforce this limit, that is up to caller (e.g. language front end).
4955 The limit exists because the result is a signed type and we don't handle
4956 sizes that use more than one HOST_WIDE_INT. */
4959 build_index_type (tree maxval)
4961 tree itype = make_node (INTEGER_TYPE);
4963 TREE_TYPE (itype) = sizetype;
4964 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4965 TYPE_MIN_VALUE (itype) = size_zero_node;
4966 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
4967 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4968 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4969 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4970 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4971 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4973 if (host_integerp (maxval, 1))
4974 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4979 /* Builds a signed or unsigned integer type of precision PRECISION.
4980 Used for C bitfields whose precision does not match that of
4981 built-in target types. */
4983 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
4986 tree itype = make_node (INTEGER_TYPE);
4988 TYPE_PRECISION (itype) = precision;
4991 fixup_unsigned_type (itype);
4993 fixup_signed_type (itype);
4995 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
4996 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5001 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5002 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5003 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5006 build_range_type (tree type, tree lowval, tree highval)
5008 tree itype = make_node (INTEGER_TYPE);
5010 TREE_TYPE (itype) = type;
5011 if (type == NULL_TREE)
5014 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5015 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5017 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5018 TYPE_MODE (itype) = TYPE_MODE (type);
5019 TYPE_SIZE (itype) = TYPE_SIZE (type);
5020 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5021 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5022 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5024 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5025 return type_hash_canon (tree_low_cst (highval, 0)
5026 - tree_low_cst (lowval, 0),
5032 /* Just like build_index_type, but takes lowval and highval instead
5033 of just highval (maxval). */
5036 build_index_2_type (tree lowval, tree highval)
5038 return build_range_type (sizetype, lowval, highval);
5041 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5042 and number of elements specified by the range of values of INDEX_TYPE.
5043 If such a type has already been constructed, reuse it. */
5046 build_array_type (tree elt_type, tree index_type)
5049 hashval_t hashcode = 0;
5051 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5053 error ("arrays of functions are not meaningful");
5054 elt_type = integer_type_node;
5057 t = make_node (ARRAY_TYPE);
5058 TREE_TYPE (t) = elt_type;
5059 TYPE_DOMAIN (t) = index_type;
5061 if (index_type == 0)
5067 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5068 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5069 t = type_hash_canon (hashcode, t);
5071 if (!COMPLETE_TYPE_P (t))
5076 /* Return the TYPE of the elements comprising
5077 the innermost dimension of ARRAY. */
5080 get_inner_array_type (tree array)
5082 tree type = TREE_TYPE (array);
5084 while (TREE_CODE (type) == ARRAY_TYPE)
5085 type = TREE_TYPE (type);
5090 /* Construct, lay out and return
5091 the type of functions returning type VALUE_TYPE
5092 given arguments of types ARG_TYPES.
5093 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5094 are data type nodes for the arguments of the function.
5095 If such a type has already been constructed, reuse it. */
5098 build_function_type (tree value_type, tree arg_types)
5101 hashval_t hashcode = 0;
5103 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5105 error ("function return type cannot be function");
5106 value_type = integer_type_node;
5109 /* Make a node of the sort we want. */
5110 t = make_node (FUNCTION_TYPE);
5111 TREE_TYPE (t) = value_type;
5112 TYPE_ARG_TYPES (t) = arg_types;
5114 /* If we already have such a type, use the old one. */
5115 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5116 hashcode = type_hash_list (arg_types, hashcode);
5117 t = type_hash_canon (hashcode, t);
5119 if (!COMPLETE_TYPE_P (t))
5124 /* Build a function type. The RETURN_TYPE is the type returned by the
5125 function. If additional arguments are provided, they are
5126 additional argument types. The list of argument types must always
5127 be terminated by NULL_TREE. */
5130 build_function_type_list (tree return_type, ...)
5135 va_start (p, return_type);
5137 t = va_arg (p, tree);
5138 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5139 args = tree_cons (NULL_TREE, t, args);
5141 if (args == NULL_TREE)
5142 args = void_list_node;
5146 args = nreverse (args);
5147 TREE_CHAIN (last) = void_list_node;
5149 args = build_function_type (return_type, args);
5155 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5156 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5157 for the method. An implicit additional parameter (of type
5158 pointer-to-BASETYPE) is added to the ARGTYPES. */
5161 build_method_type_directly (tree basetype,
5169 /* Make a node of the sort we want. */
5170 t = make_node (METHOD_TYPE);
5172 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5173 TREE_TYPE (t) = rettype;
5174 ptype = build_pointer_type (basetype);
5176 /* The actual arglist for this function includes a "hidden" argument
5177 which is "this". Put it into the list of argument types. */
5178 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5179 TYPE_ARG_TYPES (t) = argtypes;
5181 /* If we already have such a type, use the old one. */
5182 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5183 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5184 hashcode = type_hash_list (argtypes, hashcode);
5185 t = type_hash_canon (hashcode, t);
5187 if (!COMPLETE_TYPE_P (t))
5193 /* Construct, lay out and return the type of methods belonging to class
5194 BASETYPE and whose arguments and values are described by TYPE.
5195 If that type exists already, reuse it.
5196 TYPE must be a FUNCTION_TYPE node. */
5199 build_method_type (tree basetype, tree type)
5201 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5203 return build_method_type_directly (basetype,
5205 TYPE_ARG_TYPES (type));
5208 /* Construct, lay out and return the type of offsets to a value
5209 of type TYPE, within an object of type BASETYPE.
5210 If a suitable offset type exists already, reuse it. */
5213 build_offset_type (tree basetype, tree type)
5216 hashval_t hashcode = 0;
5218 /* Make a node of the sort we want. */
5219 t = make_node (OFFSET_TYPE);
5221 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5222 TREE_TYPE (t) = type;
5224 /* If we already have such a type, use the old one. */
5225 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5226 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5227 t = type_hash_canon (hashcode, t);
5229 if (!COMPLETE_TYPE_P (t))
5235 /* Create a complex type whose components are COMPONENT_TYPE. */
5238 build_complex_type (tree component_type)
5243 /* Make a node of the sort we want. */
5244 t = make_node (COMPLEX_TYPE);
5246 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5248 /* If we already have such a type, use the old one. */
5249 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5250 t = type_hash_canon (hashcode, t);
5252 if (!COMPLETE_TYPE_P (t))
5255 /* If we are writing Dwarf2 output we need to create a name,
5256 since complex is a fundamental type. */
5257 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5261 if (component_type == char_type_node)
5262 name = "complex char";
5263 else if (component_type == signed_char_type_node)
5264 name = "complex signed char";
5265 else if (component_type == unsigned_char_type_node)
5266 name = "complex unsigned char";
5267 else if (component_type == short_integer_type_node)
5268 name = "complex short int";
5269 else if (component_type == short_unsigned_type_node)
5270 name = "complex short unsigned int";
5271 else if (component_type == integer_type_node)
5272 name = "complex int";
5273 else if (component_type == unsigned_type_node)
5274 name = "complex unsigned int";
5275 else if (component_type == long_integer_type_node)
5276 name = "complex long int";
5277 else if (component_type == long_unsigned_type_node)
5278 name = "complex long unsigned int";
5279 else if (component_type == long_long_integer_type_node)
5280 name = "complex long long int";
5281 else if (component_type == long_long_unsigned_type_node)
5282 name = "complex long long unsigned int";
5287 TYPE_NAME (t) = get_identifier (name);
5290 return build_qualified_type (t, TYPE_QUALS (component_type));
5293 /* Return OP, stripped of any conversions to wider types as much as is safe.
5294 Converting the value back to OP's type makes a value equivalent to OP.
5296 If FOR_TYPE is nonzero, we return a value which, if converted to
5297 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5299 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5300 narrowest type that can hold the value, even if they don't exactly fit.
5301 Otherwise, bit-field references are changed to a narrower type
5302 only if they can be fetched directly from memory in that type.
5304 OP must have integer, real or enumeral type. Pointers are not allowed!
5306 There are some cases where the obvious value we could return
5307 would regenerate to OP if converted to OP's type,
5308 but would not extend like OP to wider types.
5309 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5310 For example, if OP is (unsigned short)(signed char)-1,
5311 we avoid returning (signed char)-1 if FOR_TYPE is int,
5312 even though extending that to an unsigned short would regenerate OP,
5313 since the result of extending (signed char)-1 to (int)
5314 is different from (int) OP. */
5317 get_unwidened (tree op, tree for_type)
5319 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5320 tree type = TREE_TYPE (op);
5322 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5324 = (for_type != 0 && for_type != type
5325 && final_prec > TYPE_PRECISION (type)
5326 && TYPE_UNSIGNED (type));
5329 while (TREE_CODE (op) == NOP_EXPR
5330 || TREE_CODE (op) == CONVERT_EXPR)
5334 /* TYPE_PRECISION on vector types has different meaning
5335 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5336 so avoid them here. */
5337 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5340 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5341 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5343 /* Truncations are many-one so cannot be removed.
5344 Unless we are later going to truncate down even farther. */
5346 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5349 /* See what's inside this conversion. If we decide to strip it,
5351 op = TREE_OPERAND (op, 0);
5353 /* If we have not stripped any zero-extensions (uns is 0),
5354 we can strip any kind of extension.
5355 If we have previously stripped a zero-extension,
5356 only zero-extensions can safely be stripped.
5357 Any extension can be stripped if the bits it would produce
5358 are all going to be discarded later by truncating to FOR_TYPE. */
5362 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5364 /* TYPE_UNSIGNED says whether this is a zero-extension.
5365 Let's avoid computing it if it does not affect WIN
5366 and if UNS will not be needed again. */
5368 || TREE_CODE (op) == NOP_EXPR
5369 || TREE_CODE (op) == CONVERT_EXPR)
5370 && TYPE_UNSIGNED (TREE_TYPE (op)))
5378 if (TREE_CODE (op) == COMPONENT_REF
5379 /* Since type_for_size always gives an integer type. */
5380 && TREE_CODE (type) != REAL_TYPE
5381 /* Don't crash if field not laid out yet. */
5382 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5383 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5385 unsigned int innerprec
5386 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5387 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5388 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5389 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5391 /* We can get this structure field in the narrowest type it fits in.
5392 If FOR_TYPE is 0, do this only for a field that matches the
5393 narrower type exactly and is aligned for it
5394 The resulting extension to its nominal type (a fullword type)
5395 must fit the same conditions as for other extensions. */
5398 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5399 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5400 && (! uns || final_prec <= innerprec || unsignedp))
5402 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5403 TREE_OPERAND (op, 1), NULL_TREE);
5404 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5405 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5412 /* Return OP or a simpler expression for a narrower value
5413 which can be sign-extended or zero-extended to give back OP.
5414 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5415 or 0 if the value should be sign-extended. */
5418 get_narrower (tree op, int *unsignedp_ptr)
5423 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5425 while (TREE_CODE (op) == NOP_EXPR)
5428 = (TYPE_PRECISION (TREE_TYPE (op))
5429 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5431 /* Truncations are many-one so cannot be removed. */
5435 /* See what's inside this conversion. If we decide to strip it,
5440 op = TREE_OPERAND (op, 0);
5441 /* An extension: the outermost one can be stripped,
5442 but remember whether it is zero or sign extension. */
5444 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5445 /* Otherwise, if a sign extension has been stripped,
5446 only sign extensions can now be stripped;
5447 if a zero extension has been stripped, only zero-extensions. */
5448 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5452 else /* bitschange == 0 */
5454 /* A change in nominal type can always be stripped, but we must
5455 preserve the unsignedness. */
5457 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5459 op = TREE_OPERAND (op, 0);
5460 /* Keep trying to narrow, but don't assign op to win if it
5461 would turn an integral type into something else. */
5462 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
5469 if (TREE_CODE (op) == COMPONENT_REF
5470 /* Since type_for_size always gives an integer type. */
5471 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
5472 /* Ensure field is laid out already. */
5473 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5474 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5476 unsigned HOST_WIDE_INT innerprec
5477 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5478 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5479 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5480 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5482 /* We can get this structure field in a narrower type that fits it,
5483 but the resulting extension to its nominal type (a fullword type)
5484 must satisfy the same conditions as for other extensions.
5486 Do this only for fields that are aligned (not bit-fields),
5487 because when bit-field insns will be used there is no
5488 advantage in doing this. */
5490 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5491 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5492 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
5496 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
5497 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5498 TREE_OPERAND (op, 1), NULL_TREE);
5499 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5500 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5503 *unsignedp_ptr = uns;
5507 /* Nonzero if integer constant C has a value that is permissible
5508 for type TYPE (an INTEGER_TYPE). */
5511 int_fits_type_p (tree c, tree type)
5513 tree type_low_bound = TYPE_MIN_VALUE (type);
5514 tree type_high_bound = TYPE_MAX_VALUE (type);
5515 bool ok_for_low_bound, ok_for_high_bound;
5518 /* If at least one bound of the type is a constant integer, we can check
5519 ourselves and maybe make a decision. If no such decision is possible, but
5520 this type is a subtype, try checking against that. Otherwise, use
5521 force_fit_type, which checks against the precision.
5523 Compute the status for each possibly constant bound, and return if we see
5524 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5525 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5526 for "constant known to fit". */
5528 /* Check if C >= type_low_bound. */
5529 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
5531 if (tree_int_cst_lt (c, type_low_bound))
5533 ok_for_low_bound = true;
5536 ok_for_low_bound = false;
5538 /* Check if c <= type_high_bound. */
5539 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
5541 if (tree_int_cst_lt (type_high_bound, c))
5543 ok_for_high_bound = true;
5546 ok_for_high_bound = false;
5548 /* If the constant fits both bounds, the result is known. */
5549 if (ok_for_low_bound && ok_for_high_bound)
5552 /* Perform some generic filtering which may allow making a decision
5553 even if the bounds are not constant. First, negative integers
5554 never fit in unsigned types, */
5555 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
5558 /* Second, narrower types always fit in wider ones. */
5559 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
5562 /* Third, unsigned integers with top bit set never fit signed types. */
5563 if (! TYPE_UNSIGNED (type)
5564 && TYPE_UNSIGNED (TREE_TYPE (c))
5565 && tree_int_cst_msb (c))
5568 /* If we haven't been able to decide at this point, there nothing more we
5569 can check ourselves here. Look at the base type if we have one and it
5570 has the same precision. */
5571 if (TREE_CODE (type) == INTEGER_TYPE
5572 && TREE_TYPE (type) != 0
5573 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
5574 return int_fits_type_p (c, TREE_TYPE (type));
5576 /* Or to force_fit_type, if nothing else. */
5577 tmp = copy_node (c);
5578 TREE_TYPE (tmp) = type;
5579 tmp = force_fit_type (tmp, -1, false, false);
5580 return TREE_INT_CST_HIGH (tmp) == TREE_INT_CST_HIGH (c)
5581 && TREE_INT_CST_LOW (tmp) == TREE_INT_CST_LOW (c);
5584 /* Subprogram of following function. Called by walk_tree.
5586 Return *TP if it is an automatic variable or parameter of the
5587 function passed in as DATA. */
5590 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
5592 tree fn = (tree) data;
5597 else if (DECL_P (*tp)
5598 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
5604 /* Returns true if T is, contains, or refers to a type with variable
5605 size. If FN is nonzero, only return true if a modifier of the type
5606 or position of FN is a variable or parameter inside FN.
5608 This concept is more general than that of C99 'variably modified types':
5609 in C99, a struct type is never variably modified because a VLA may not
5610 appear as a structure member. However, in GNU C code like:
5612 struct S { int i[f()]; };
5614 is valid, and other languages may define similar constructs. */
5617 variably_modified_type_p (tree type, tree fn)
5621 /* Test if T is either variable (if FN is zero) or an expression containing
5622 a variable in FN. */
5623 #define RETURN_TRUE_IF_VAR(T) \
5624 do { tree _t = (T); \
5625 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5626 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5627 return true; } while (0)
5629 if (type == error_mark_node)
5632 /* If TYPE itself has variable size, it is variably modified.
5634 We do not yet have a representation of the C99 '[*]' syntax.
5635 When a representation is chosen, this function should be modified
5636 to test for that case as well. */
5637 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
5638 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type));
5640 switch (TREE_CODE (type))
5643 case REFERENCE_TYPE:
5646 if (variably_modified_type_p (TREE_TYPE (type), fn))
5652 /* If TYPE is a function type, it is variably modified if any of the
5653 parameters or the return type are variably modified. */
5654 if (variably_modified_type_p (TREE_TYPE (type), fn))
5657 for (t = TYPE_ARG_TYPES (type);
5658 t && t != void_list_node;
5660 if (variably_modified_type_p (TREE_VALUE (t), fn))
5668 /* Scalar types are variably modified if their end points
5670 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
5671 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
5676 case QUAL_UNION_TYPE:
5677 /* We can't see if any of the field are variably-modified by the
5678 definition we normally use, since that would produce infinite
5679 recursion via pointers. */
5680 /* This is variably modified if some field's type is. */
5681 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
5682 if (TREE_CODE (t) == FIELD_DECL)
5684 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
5685 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
5686 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
5688 if (TREE_CODE (type) == QUAL_UNION_TYPE)
5689 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
5697 /* The current language may have other cases to check, but in general,
5698 all other types are not variably modified. */
5699 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
5701 #undef RETURN_TRUE_IF_VAR
5704 /* Given a DECL or TYPE, return the scope in which it was declared, or
5705 NULL_TREE if there is no containing scope. */
5708 get_containing_scope (tree t)
5710 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
5713 /* Return the innermost context enclosing DECL that is
5714 a FUNCTION_DECL, or zero if none. */
5717 decl_function_context (tree decl)
5721 if (TREE_CODE (decl) == ERROR_MARK)
5724 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5725 where we look up the function at runtime. Such functions always take
5726 a first argument of type 'pointer to real context'.
5728 C++ should really be fixed to use DECL_CONTEXT for the real context,
5729 and use something else for the "virtual context". */
5730 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
5733 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
5735 context = DECL_CONTEXT (decl);
5737 while (context && TREE_CODE (context) != FUNCTION_DECL)
5739 if (TREE_CODE (context) == BLOCK)
5740 context = BLOCK_SUPERCONTEXT (context);
5742 context = get_containing_scope (context);
5748 /* Return the innermost context enclosing DECL that is
5749 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5750 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5753 decl_type_context (tree decl)
5755 tree context = DECL_CONTEXT (decl);
5758 switch (TREE_CODE (context))
5760 case NAMESPACE_DECL:
5761 case TRANSLATION_UNIT_DECL:
5766 case QUAL_UNION_TYPE:
5771 context = DECL_CONTEXT (context);
5775 context = BLOCK_SUPERCONTEXT (context);
5785 /* CALL is a CALL_EXPR. Return the declaration for the function
5786 called, or NULL_TREE if the called function cannot be
5790 get_callee_fndecl (tree call)
5794 if (call == error_mark_node)
5797 /* It's invalid to call this function with anything but a
5799 gcc_assert (TREE_CODE (call) == CALL_EXPR);
5801 /* The first operand to the CALL is the address of the function
5803 addr = TREE_OPERAND (call, 0);
5807 /* If this is a readonly function pointer, extract its initial value. */
5808 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5809 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5810 && DECL_INITIAL (addr))
5811 addr = DECL_INITIAL (addr);
5813 /* If the address is just `&f' for some function `f', then we know
5814 that `f' is being called. */
5815 if (TREE_CODE (addr) == ADDR_EXPR
5816 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5817 return TREE_OPERAND (addr, 0);
5819 /* We couldn't figure out what was being called. Maybe the front
5820 end has some idea. */
5821 return lang_hooks.lang_get_callee_fndecl (call);
5824 /* Print debugging information about tree nodes generated during the compile,
5825 and any language-specific information. */
5828 dump_tree_statistics (void)
5830 #ifdef GATHER_STATISTICS
5832 int total_nodes, total_bytes;
5835 fprintf (stderr, "\n??? tree nodes created\n\n");
5836 #ifdef GATHER_STATISTICS
5837 fprintf (stderr, "Kind Nodes Bytes\n");
5838 fprintf (stderr, "---------------------------------------\n");
5839 total_nodes = total_bytes = 0;
5840 for (i = 0; i < (int) all_kinds; i++)
5842 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
5843 tree_node_counts[i], tree_node_sizes[i]);
5844 total_nodes += tree_node_counts[i];
5845 total_bytes += tree_node_sizes[i];
5847 fprintf (stderr, "---------------------------------------\n");
5848 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
5849 fprintf (stderr, "---------------------------------------\n");
5850 ssanames_print_statistics ();
5851 phinodes_print_statistics ();
5853 fprintf (stderr, "(No per-node statistics)\n");
5855 print_type_hash_statistics ();
5856 print_debug_expr_statistics ();
5857 print_value_expr_statistics ();
5858 print_restrict_base_statistics ();
5859 lang_hooks.print_statistics ();
5862 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5864 /* Generate a crc32 of a string. */
5867 crc32_string (unsigned chksum, const char *string)
5871 unsigned value = *string << 24;
5874 for (ix = 8; ix--; value <<= 1)
5878 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
5887 /* P is a string that will be used in a symbol. Mask out any characters
5888 that are not valid in that context. */
5891 clean_symbol_name (char *p)
5895 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5898 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5905 /* Generate a name for a function unique to this translation unit.
5906 TYPE is some string to identify the purpose of this function to the
5907 linker or collect2. */
5910 get_file_function_name_long (const char *type)
5916 if (first_global_object_name)
5918 p = first_global_object_name;
5920 /* For type 'F', the generated name must be unique not only to this
5921 translation unit but also to any given link. Since global names
5922 can be overloaded, we concatenate the first global object name
5923 with a string derived from the file name of this object. */
5924 if (!strcmp (type, "F"))
5926 const char *file = main_input_filename;
5929 file = input_filename;
5931 q = alloca (strlen (p) + 10);
5932 sprintf (q, "%s_%08X", p, crc32_string (0, file));
5939 /* We don't have anything that we know to be unique to this translation
5940 unit, so use what we do have and throw in some randomness. */
5942 const char *name = weak_global_object_name;
5943 const char *file = main_input_filename;
5948 file = input_filename;
5950 len = strlen (file);
5951 q = alloca (9 * 2 + len + 1);
5952 memcpy (q, file, len + 1);
5953 clean_symbol_name (q);
5955 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
5956 crc32_string (0, flag_random_seed));
5961 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
5963 /* Set up the name of the file-level functions we may need.
5964 Use a global object (which is already required to be unique over
5965 the program) rather than the file name (which imposes extra
5967 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5969 return get_identifier (buf);
5972 /* If KIND=='I', return a suitable global initializer (constructor) name.
5973 If KIND=='D', return a suitable global clean-up (destructor) name. */
5976 get_file_function_name (int kind)
5983 return get_file_function_name_long (p);
5986 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5988 /* Complain that the tree code of NODE does not match the expected 0
5989 terminated list of trailing codes. The trailing code list can be
5990 empty, for a more vague error message. FILE, LINE, and FUNCTION
5991 are of the caller. */
5994 tree_check_failed (const tree node, const char *file,
5995 int line, const char *function, ...)
5999 unsigned length = 0;
6002 va_start (args, function);
6003 while ((code = va_arg (args, int)))
6004 length += 4 + strlen (tree_code_name[code]);
6008 va_start (args, function);
6009 length += strlen ("expected ");
6010 buffer = alloca (length);
6012 while ((code = va_arg (args, int)))
6014 const char *prefix = length ? " or " : "expected ";
6016 strcpy (buffer + length, prefix);
6017 length += strlen (prefix);
6018 strcpy (buffer + length, tree_code_name[code]);
6019 length += strlen (tree_code_name[code]);
6024 buffer = (char *)"unexpected node";
6026 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6027 buffer, tree_code_name[TREE_CODE (node)],
6028 function, trim_filename (file), line);
6031 /* Complain that the tree code of NODE does match the expected 0
6032 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6036 tree_not_check_failed (const tree node, const char *file,
6037 int line, const char *function, ...)
6041 unsigned length = 0;
6044 va_start (args, function);
6045 while ((code = va_arg (args, int)))
6046 length += 4 + strlen (tree_code_name[code]);
6048 va_start (args, function);
6049 buffer = alloca (length);
6051 while ((code = va_arg (args, int)))
6055 strcpy (buffer + length, " or ");
6058 strcpy (buffer + length, tree_code_name[code]);
6059 length += strlen (tree_code_name[code]);
6063 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6064 buffer, tree_code_name[TREE_CODE (node)],
6065 function, trim_filename (file), line);
6068 /* Similar to tree_check_failed, except that we check for a class of tree
6069 code, given in CL. */
6072 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6073 const char *file, int line, const char *function)
6076 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6077 TREE_CODE_CLASS_STRING (cl),
6078 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6079 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6082 /* Similar to tree_check_failed, except that instead of specifying a
6083 dozen codes, use the knowledge that they're all sequential. */
6086 tree_range_check_failed (const tree node, const char *file, int line,
6087 const char *function, enum tree_code c1,
6091 unsigned length = 0;
6094 for (c = c1; c <= c2; ++c)
6095 length += 4 + strlen (tree_code_name[c]);
6097 length += strlen ("expected ");
6098 buffer = alloca (length);
6101 for (c = c1; c <= c2; ++c)
6103 const char *prefix = length ? " or " : "expected ";
6105 strcpy (buffer + length, prefix);
6106 length += strlen (prefix);
6107 strcpy (buffer + length, tree_code_name[c]);
6108 length += strlen (tree_code_name[c]);
6111 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6112 buffer, tree_code_name[TREE_CODE (node)],
6113 function, trim_filename (file), line);
6117 /* Similar to tree_check_failed, except that we check that a tree does
6118 not have the specified code, given in CL. */
6121 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6122 const char *file, int line, const char *function)
6125 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6126 TREE_CODE_CLASS_STRING (cl),
6127 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6128 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6132 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6135 omp_clause_check_failed (const tree node, const char *file, int line,
6136 const char *function, enum omp_clause_code code)
6138 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6139 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6140 function, trim_filename (file), line);
6144 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6147 omp_clause_range_check_failed (const tree node, const char *file, int line,
6148 const char *function, enum omp_clause_code c1,
6149 enum omp_clause_code c2)
6152 unsigned length = 0;
6153 enum omp_clause_code c;
6155 for (c = c1; c <= c2; ++c)
6156 length += 4 + strlen (omp_clause_code_name[c]);
6158 length += strlen ("expected ");
6159 buffer = alloca (length);
6162 for (c = c1; c <= c2; ++c)
6164 const char *prefix = length ? " or " : "expected ";
6166 strcpy (buffer + length, prefix);
6167 length += strlen (prefix);
6168 strcpy (buffer + length, omp_clause_code_name[c]);
6169 length += strlen (omp_clause_code_name[c]);
6172 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6173 buffer, omp_clause_code_name[TREE_CODE (node)],
6174 function, trim_filename (file), line);
6178 #undef DEFTREESTRUCT
6179 #define DEFTREESTRUCT(VAL, NAME) NAME,
6181 static const char *ts_enum_names[] = {
6182 #include "treestruct.def"
6184 #undef DEFTREESTRUCT
6186 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6188 /* Similar to tree_class_check_failed, except that we check for
6189 whether CODE contains the tree structure identified by EN. */
6192 tree_contains_struct_check_failed (const tree node,
6193 const enum tree_node_structure_enum en,
6194 const char *file, int line,
6195 const char *function)
6198 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6200 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6204 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6205 (dynamically sized) vector. */
6208 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6209 const char *function)
6212 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6213 idx + 1, len, function, trim_filename (file), line);
6216 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6217 (dynamically sized) vector. */
6220 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6221 const char *function)
6224 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6225 idx + 1, len, function, trim_filename (file), line);
6228 /* Similar to above, except that the check is for the bounds of the operand
6229 vector of an expression node. */
6232 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
6233 int line, const char *function)
6236 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6237 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
6238 function, trim_filename (file), line);
6241 /* Similar to above, except that the check is for the number of
6242 operands of an OMP_CLAUSE node. */
6245 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6246 int line, const char *function)
6249 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6250 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6251 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6252 trim_filename (file), line);
6254 #endif /* ENABLE_TREE_CHECKING */
6256 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6257 and mapped to the machine mode MODE. Initialize its fields and build
6258 the information necessary for debugging output. */
6261 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6263 tree t = make_node (VECTOR_TYPE);
6265 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6266 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6267 TYPE_MODE (t) = mode;
6268 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6269 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6274 tree index = build_int_cst (NULL_TREE, nunits - 1);
6275 tree array = build_array_type (innertype, build_index_type (index));
6276 tree rt = make_node (RECORD_TYPE);
6278 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6279 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6281 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6282 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6283 the representation type, and we want to find that die when looking up
6284 the vector type. This is most easily achieved by making the TYPE_UID
6286 TYPE_UID (rt) = TYPE_UID (t);
6289 /* Build our main variant, based on the main variant of the inner type. */
6290 if (TYPE_MAIN_VARIANT (innertype) != innertype)
6292 tree innertype_main_variant = TYPE_MAIN_VARIANT (innertype);
6293 unsigned int hash = TYPE_HASH (innertype_main_variant);
6294 TYPE_MAIN_VARIANT (t)
6295 = type_hash_canon (hash, make_vector_type (innertype_main_variant,
6303 make_or_reuse_type (unsigned size, int unsignedp)
6305 if (size == INT_TYPE_SIZE)
6306 return unsignedp ? unsigned_type_node : integer_type_node;
6307 if (size == CHAR_TYPE_SIZE)
6308 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6309 if (size == SHORT_TYPE_SIZE)
6310 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6311 if (size == LONG_TYPE_SIZE)
6312 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6313 if (size == LONG_LONG_TYPE_SIZE)
6314 return (unsignedp ? long_long_unsigned_type_node
6315 : long_long_integer_type_node);
6318 return make_unsigned_type (size);
6320 return make_signed_type (size);
6323 /* Create nodes for all integer types (and error_mark_node) using the sizes
6324 of C datatypes. The caller should call set_sizetype soon after calling
6325 this function to select one of the types as sizetype. */
6328 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6330 error_mark_node = make_node (ERROR_MARK);
6331 TREE_TYPE (error_mark_node) = error_mark_node;
6333 initialize_sizetypes (signed_sizetype);
6335 /* Define both `signed char' and `unsigned char'. */
6336 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6337 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6338 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6339 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6341 /* Define `char', which is like either `signed char' or `unsigned char'
6342 but not the same as either. */
6345 ? make_signed_type (CHAR_TYPE_SIZE)
6346 : make_unsigned_type (CHAR_TYPE_SIZE));
6347 TYPE_STRING_FLAG (char_type_node) = 1;
6349 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6350 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6351 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6352 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6353 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6354 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6355 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6356 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6358 /* Define a boolean type. This type only represents boolean values but
6359 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6360 Front ends which want to override this size (i.e. Java) can redefine
6361 boolean_type_node before calling build_common_tree_nodes_2. */
6362 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6363 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6364 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6365 TYPE_PRECISION (boolean_type_node) = 1;
6367 /* Fill in the rest of the sized types. Reuse existing type nodes
6369 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6370 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6371 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6372 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6373 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6375 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6376 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6377 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6378 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6379 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6381 access_public_node = get_identifier ("public");
6382 access_protected_node = get_identifier ("protected");
6383 access_private_node = get_identifier ("private");
6386 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6387 It will create several other common tree nodes. */
6390 build_common_tree_nodes_2 (int short_double)
6392 /* Define these next since types below may used them. */
6393 integer_zero_node = build_int_cst (NULL_TREE, 0);
6394 integer_one_node = build_int_cst (NULL_TREE, 1);
6395 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6397 size_zero_node = size_int (0);
6398 size_one_node = size_int (1);
6399 bitsize_zero_node = bitsize_int (0);
6400 bitsize_one_node = bitsize_int (1);
6401 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6403 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6404 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6406 void_type_node = make_node (VOID_TYPE);
6407 layout_type (void_type_node);
6409 /* We are not going to have real types in C with less than byte alignment,
6410 so we might as well not have any types that claim to have it. */
6411 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6412 TYPE_USER_ALIGN (void_type_node) = 0;
6414 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6415 layout_type (TREE_TYPE (null_pointer_node));
6417 ptr_type_node = build_pointer_type (void_type_node);
6419 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6420 fileptr_type_node = ptr_type_node;
6422 float_type_node = make_node (REAL_TYPE);
6423 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6424 layout_type (float_type_node);
6426 double_type_node = make_node (REAL_TYPE);
6428 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6430 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6431 layout_type (double_type_node);
6433 long_double_type_node = make_node (REAL_TYPE);
6434 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6435 layout_type (long_double_type_node);
6437 float_ptr_type_node = build_pointer_type (float_type_node);
6438 double_ptr_type_node = build_pointer_type (double_type_node);
6439 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6440 integer_ptr_type_node = build_pointer_type (integer_type_node);
6442 /* Decimal float types. */
6443 dfloat32_type_node = make_node (REAL_TYPE);
6444 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
6445 layout_type (dfloat32_type_node);
6446 TYPE_MODE (dfloat32_type_node) = SDmode;
6447 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
6449 dfloat64_type_node = make_node (REAL_TYPE);
6450 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
6451 layout_type (dfloat64_type_node);
6452 TYPE_MODE (dfloat64_type_node) = DDmode;
6453 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
6455 dfloat128_type_node = make_node (REAL_TYPE);
6456 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
6457 layout_type (dfloat128_type_node);
6458 TYPE_MODE (dfloat128_type_node) = TDmode;
6459 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
6461 complex_integer_type_node = make_node (COMPLEX_TYPE);
6462 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6463 layout_type (complex_integer_type_node);
6465 complex_float_type_node = make_node (COMPLEX_TYPE);
6466 TREE_TYPE (complex_float_type_node) = float_type_node;
6467 layout_type (complex_float_type_node);
6469 complex_double_type_node = make_node (COMPLEX_TYPE);
6470 TREE_TYPE (complex_double_type_node) = double_type_node;
6471 layout_type (complex_double_type_node);
6473 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6474 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6475 layout_type (complex_long_double_type_node);
6478 tree t = targetm.build_builtin_va_list ();
6480 /* Many back-ends define record types without setting TYPE_NAME.
6481 If we copied the record type here, we'd keep the original
6482 record type without a name. This breaks name mangling. So,
6483 don't copy record types and let c_common_nodes_and_builtins()
6484 declare the type to be __builtin_va_list. */
6485 if (TREE_CODE (t) != RECORD_TYPE)
6486 t = build_variant_type_copy (t);
6488 va_list_type_node = t;
6492 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6495 local_define_builtin (const char *name, tree type, enum built_in_function code,
6496 const char *library_name, int ecf_flags)
6500 decl = lang_hooks.builtin_function (name, type, code, BUILT_IN_NORMAL,
6501 library_name, NULL_TREE);
6502 if (ecf_flags & ECF_CONST)
6503 TREE_READONLY (decl) = 1;
6504 if (ecf_flags & ECF_PURE)
6505 DECL_IS_PURE (decl) = 1;
6506 if (ecf_flags & ECF_NORETURN)
6507 TREE_THIS_VOLATILE (decl) = 1;
6508 if (ecf_flags & ECF_NOTHROW)
6509 TREE_NOTHROW (decl) = 1;
6510 if (ecf_flags & ECF_MALLOC)
6511 DECL_IS_MALLOC (decl) = 1;
6513 built_in_decls[code] = decl;
6514 implicit_built_in_decls[code] = decl;
6517 /* Call this function after instantiating all builtins that the language
6518 front end cares about. This will build the rest of the builtins that
6519 are relied upon by the tree optimizers and the middle-end. */
6522 build_common_builtin_nodes (void)
6526 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
6527 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6529 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6530 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6531 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6532 ftype = build_function_type (ptr_type_node, tmp);
6534 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
6535 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
6536 "memcpy", ECF_NOTHROW);
6537 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6538 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
6539 "memmove", ECF_NOTHROW);
6542 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
6544 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6545 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6546 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6547 ftype = build_function_type (integer_type_node, tmp);
6548 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
6549 "memcmp", ECF_PURE | ECF_NOTHROW);
6552 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
6554 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6555 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
6556 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6557 ftype = build_function_type (ptr_type_node, tmp);
6558 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
6559 "memset", ECF_NOTHROW);
6562 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
6564 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6565 ftype = build_function_type (ptr_type_node, tmp);
6566 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
6567 "alloca", ECF_NOTHROW | ECF_MALLOC);
6570 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6571 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6572 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6573 ftype = build_function_type (void_type_node, tmp);
6574 local_define_builtin ("__builtin_init_trampoline", ftype,
6575 BUILT_IN_INIT_TRAMPOLINE,
6576 "__builtin_init_trampoline", ECF_NOTHROW);
6578 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6579 ftype = build_function_type (ptr_type_node, tmp);
6580 local_define_builtin ("__builtin_adjust_trampoline", ftype,
6581 BUILT_IN_ADJUST_TRAMPOLINE,
6582 "__builtin_adjust_trampoline",
6583 ECF_CONST | ECF_NOTHROW);
6585 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6586 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6587 ftype = build_function_type (void_type_node, tmp);
6588 local_define_builtin ("__builtin_nonlocal_goto", ftype,
6589 BUILT_IN_NONLOCAL_GOTO,
6590 "__builtin_nonlocal_goto",
6591 ECF_NORETURN | ECF_NOTHROW);
6593 ftype = build_function_type (ptr_type_node, void_list_node);
6594 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
6595 "__builtin_stack_save", ECF_NOTHROW);
6597 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6598 ftype = build_function_type (void_type_node, tmp);
6599 local_define_builtin ("__builtin_stack_restore", ftype,
6600 BUILT_IN_STACK_RESTORE,
6601 "__builtin_stack_restore", ECF_NOTHROW);
6603 ftype = build_function_type (void_type_node, void_list_node);
6604 local_define_builtin ("__builtin_profile_func_enter", ftype,
6605 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
6606 local_define_builtin ("__builtin_profile_func_exit", ftype,
6607 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
6609 /* Complex multiplication and division. These are handled as builtins
6610 rather than optabs because emit_library_call_value doesn't support
6611 complex. Further, we can do slightly better with folding these
6612 beasties if the real and complex parts of the arguments are separate. */
6614 enum machine_mode mode;
6616 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
6618 char mode_name_buf[4], *q;
6620 enum built_in_function mcode, dcode;
6621 tree type, inner_type;
6623 type = lang_hooks.types.type_for_mode (mode, 0);
6626 inner_type = TREE_TYPE (type);
6628 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
6629 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6630 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6631 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6632 ftype = build_function_type (type, tmp);
6634 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6635 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6637 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
6641 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
6642 local_define_builtin (built_in_names[mcode], ftype, mcode,
6643 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
6645 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
6646 local_define_builtin (built_in_names[dcode], ftype, dcode,
6647 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
6652 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6655 If we requested a pointer to a vector, build up the pointers that
6656 we stripped off while looking for the inner type. Similarly for
6657 return values from functions.
6659 The argument TYPE is the top of the chain, and BOTTOM is the
6660 new type which we will point to. */
6663 reconstruct_complex_type (tree type, tree bottom)
6667 if (POINTER_TYPE_P (type))
6669 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6670 outer = build_pointer_type (inner);
6672 else if (TREE_CODE (type) == ARRAY_TYPE)
6674 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6675 outer = build_array_type (inner, TYPE_DOMAIN (type));
6677 else if (TREE_CODE (type) == FUNCTION_TYPE)
6679 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6680 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
6682 else if (TREE_CODE (type) == METHOD_TYPE)
6685 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6686 /* The build_method_type_directly() routine prepends 'this' to argument list,
6687 so we must compensate by getting rid of it. */
6688 argtypes = TYPE_ARG_TYPES (type);
6689 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
6691 TYPE_ARG_TYPES (type));
6692 TYPE_ARG_TYPES (outer) = argtypes;
6697 TYPE_READONLY (outer) = TYPE_READONLY (type);
6698 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
6703 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6706 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
6710 switch (GET_MODE_CLASS (mode))
6712 case MODE_VECTOR_INT:
6713 case MODE_VECTOR_FLOAT:
6714 nunits = GET_MODE_NUNITS (mode);
6718 /* Check that there are no leftover bits. */
6719 gcc_assert (GET_MODE_BITSIZE (mode)
6720 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
6722 nunits = GET_MODE_BITSIZE (mode)
6723 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
6730 return make_vector_type (innertype, nunits, mode);
6733 /* Similarly, but takes the inner type and number of units, which must be
6737 build_vector_type (tree innertype, int nunits)
6739 return make_vector_type (innertype, nunits, VOIDmode);
6742 /* Build RESX_EXPR with given REGION_NUMBER. */
6744 build_resx (int region_number)
6747 t = build1 (RESX_EXPR, void_type_node,
6748 build_int_cst (NULL_TREE, region_number));
6752 /* Given an initializer INIT, return TRUE if INIT is zero or some
6753 aggregate of zeros. Otherwise return FALSE. */
6755 initializer_zerop (tree init)
6761 switch (TREE_CODE (init))
6764 return integer_zerop (init);
6767 /* ??? Note that this is not correct for C4X float formats. There,
6768 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6769 negative exponent. */
6770 return real_zerop (init)
6771 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
6774 return integer_zerop (init)
6775 || (real_zerop (init)
6776 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
6777 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
6780 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
6781 if (!initializer_zerop (TREE_VALUE (elt)))
6787 unsigned HOST_WIDE_INT idx;
6789 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
6790 if (!initializer_zerop (elt))
6800 /* Build an empty statement. */
6803 build_empty_stmt (void)
6805 return build1 (NOP_EXPR, void_type_node, size_zero_node);
6809 /* Build an OpenMP clause with code CODE. */
6812 build_omp_clause (enum omp_clause_code code)
6817 length = omp_clause_num_ops[code];
6818 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
6820 t = ggc_alloc (size);
6821 memset (t, 0, size);
6822 TREE_SET_CODE (t, OMP_CLAUSE);
6823 OMP_CLAUSE_SET_CODE (t, code);
6825 #ifdef GATHER_STATISTICS
6826 tree_node_counts[(int) omp_clause_kind]++;
6827 tree_node_sizes[(int) omp_clause_kind] += size;
6834 /* Returns true if it is possible to prove that the index of
6835 an array access REF (an ARRAY_REF expression) falls into the
6839 in_array_bounds_p (tree ref)
6841 tree idx = TREE_OPERAND (ref, 1);
6844 if (TREE_CODE (idx) != INTEGER_CST)
6847 min = array_ref_low_bound (ref);
6848 max = array_ref_up_bound (ref);
6851 || TREE_CODE (min) != INTEGER_CST
6852 || TREE_CODE (max) != INTEGER_CST)
6855 if (tree_int_cst_lt (idx, min)
6856 || tree_int_cst_lt (max, idx))
6862 /* Return true if T (assumed to be a DECL) is a global variable. */
6865 is_global_var (tree t)
6868 return (TREE_STATIC (t) || MTAG_GLOBAL (t));
6870 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
6873 /* Return true if T (assumed to be a DECL) must be assigned a memory
6877 needs_to_live_in_memory (tree t)
6879 return (TREE_ADDRESSABLE (t)
6880 || is_global_var (t)
6881 || (TREE_CODE (t) == RESULT_DECL
6882 && aggregate_value_p (t, current_function_decl)));
6885 /* There are situations in which a language considers record types
6886 compatible which have different field lists. Decide if two fields
6887 are compatible. It is assumed that the parent records are compatible. */
6890 fields_compatible_p (tree f1, tree f2)
6892 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
6893 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
6896 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
6897 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
6900 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
6906 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
6909 find_compatible_field (tree record, tree orig_field)
6913 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
6914 if (TREE_CODE (f) == FIELD_DECL
6915 && fields_compatible_p (f, orig_field))
6918 /* ??? Why isn't this on the main fields list? */
6919 f = TYPE_VFIELD (record);
6920 if (f && TREE_CODE (f) == FIELD_DECL
6921 && fields_compatible_p (f, orig_field))
6924 /* ??? We should abort here, but Java appears to do Bad Things
6925 with inherited fields. */
6929 /* Return value of a constant X. */
6932 int_cst_value (tree x)
6934 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
6935 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
6936 bool negative = ((val >> (bits - 1)) & 1) != 0;
6938 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
6941 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
6943 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
6948 /* Returns the greatest common divisor of A and B, which must be
6952 tree_fold_gcd (tree a, tree b)
6955 tree type = TREE_TYPE (a);
6957 gcc_assert (TREE_CODE (a) == INTEGER_CST);
6958 gcc_assert (TREE_CODE (b) == INTEGER_CST);
6960 if (integer_zerop (a))
6963 if (integer_zerop (b))
6966 if (tree_int_cst_sgn (a) == -1)
6967 a = fold_build2 (MULT_EXPR, type, a,
6968 build_int_cst (type, -1));
6970 if (tree_int_cst_sgn (b) == -1)
6971 b = fold_build2 (MULT_EXPR, type, b,
6972 build_int_cst (type, -1));
6976 a_mod_b = fold_build2 (FLOOR_MOD_EXPR, type, a, b);
6978 if (!TREE_INT_CST_LOW (a_mod_b)
6979 && !TREE_INT_CST_HIGH (a_mod_b))
6987 /* Returns unsigned variant of TYPE. */
6990 unsigned_type_for (tree type)
6992 if (POINTER_TYPE_P (type))
6993 return lang_hooks.types.unsigned_type (size_type_node);
6994 return lang_hooks.types.unsigned_type (type);
6997 /* Returns signed variant of TYPE. */
7000 signed_type_for (tree type)
7002 if (POINTER_TYPE_P (type))
7003 return lang_hooks.types.signed_type (size_type_node);
7004 return lang_hooks.types.signed_type (type);
7007 /* Returns the largest value obtainable by casting something in INNER type to
7011 upper_bound_in_type (tree outer, tree inner)
7013 unsigned HOST_WIDE_INT lo, hi;
7014 unsigned int det = 0;
7015 unsigned oprec = TYPE_PRECISION (outer);
7016 unsigned iprec = TYPE_PRECISION (inner);
7019 /* Compute a unique number for every combination. */
7020 det |= (oprec > iprec) ? 4 : 0;
7021 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7022 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7024 /* Determine the exponent to use. */
7029 /* oprec <= iprec, outer: signed, inner: don't care. */
7034 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7038 /* oprec > iprec, outer: signed, inner: signed. */
7042 /* oprec > iprec, outer: signed, inner: unsigned. */
7046 /* oprec > iprec, outer: unsigned, inner: signed. */
7050 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7057 /* Compute 2^^prec - 1. */
7058 if (prec <= HOST_BITS_PER_WIDE_INT)
7061 lo = ((~(unsigned HOST_WIDE_INT) 0)
7062 >> (HOST_BITS_PER_WIDE_INT - prec));
7066 hi = ((~(unsigned HOST_WIDE_INT) 0)
7067 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7068 lo = ~(unsigned HOST_WIDE_INT) 0;
7071 return build_int_cst_wide (outer, lo, hi);
7074 /* Returns the smallest value obtainable by casting something in INNER type to
7078 lower_bound_in_type (tree outer, tree inner)
7080 unsigned HOST_WIDE_INT lo, hi;
7081 unsigned oprec = TYPE_PRECISION (outer);
7082 unsigned iprec = TYPE_PRECISION (inner);
7084 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7086 if (TYPE_UNSIGNED (outer)
7087 /* If we are widening something of an unsigned type, OUTER type
7088 contains all values of INNER type. In particular, both INNER
7089 and OUTER types have zero in common. */
7090 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7094 /* If we are widening a signed type to another signed type, we
7095 want to obtain -2^^(iprec-1). If we are keeping the
7096 precision or narrowing to a signed type, we want to obtain
7098 unsigned prec = oprec > iprec ? iprec : oprec;
7100 if (prec <= HOST_BITS_PER_WIDE_INT)
7102 hi = ~(unsigned HOST_WIDE_INT) 0;
7103 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7107 hi = ((~(unsigned HOST_WIDE_INT) 0)
7108 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7113 return build_int_cst_wide (outer, lo, hi);
7116 /* Return nonzero if two operands that are suitable for PHI nodes are
7117 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7118 SSA_NAME or invariant. Note that this is strictly an optimization.
7119 That is, callers of this function can directly call operand_equal_p
7120 and get the same result, only slower. */
7123 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7127 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7129 return operand_equal_p (arg0, arg1, 0);
7132 /* Returns number of zeros at the end of binary representation of X.
7134 ??? Use ffs if available? */
7137 num_ending_zeros (tree x)
7139 unsigned HOST_WIDE_INT fr, nfr;
7140 unsigned num, abits;
7141 tree type = TREE_TYPE (x);
7143 if (TREE_INT_CST_LOW (x) == 0)
7145 num = HOST_BITS_PER_WIDE_INT;
7146 fr = TREE_INT_CST_HIGH (x);
7151 fr = TREE_INT_CST_LOW (x);
7154 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7157 if (nfr << abits == fr)
7164 if (num > TYPE_PRECISION (type))
7165 num = TYPE_PRECISION (type);
7167 return build_int_cst_type (type, num);
7171 #define WALK_SUBTREE(NODE) \
7174 result = walk_tree (&(NODE), func, data, pset); \
7180 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7181 be walked whenever a type is seen in the tree. Rest of operands and return
7182 value are as for walk_tree. */
7185 walk_type_fields (tree type, walk_tree_fn func, void *data,
7186 struct pointer_set_t *pset)
7188 tree result = NULL_TREE;
7190 switch (TREE_CODE (type))
7193 case REFERENCE_TYPE:
7194 /* We have to worry about mutually recursive pointers. These can't
7195 be written in C. They can in Ada. It's pathological, but
7196 there's an ACATS test (c38102a) that checks it. Deal with this
7197 by checking if we're pointing to another pointer, that one
7198 points to another pointer, that one does too, and we have no htab.
7199 If so, get a hash table. We check three levels deep to avoid
7200 the cost of the hash table if we don't need one. */
7201 if (POINTER_TYPE_P (TREE_TYPE (type))
7202 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7203 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7206 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7214 /* ... fall through ... */
7217 WALK_SUBTREE (TREE_TYPE (type));
7221 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7226 WALK_SUBTREE (TREE_TYPE (type));
7230 /* We never want to walk into default arguments. */
7231 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7232 WALK_SUBTREE (TREE_VALUE (arg));
7237 /* Don't follow this nodes's type if a pointer for fear that we'll
7238 have infinite recursion. Those types are uninteresting anyway. */
7239 if (!POINTER_TYPE_P (TREE_TYPE (type))
7240 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE)
7241 WALK_SUBTREE (TREE_TYPE (type));
7242 WALK_SUBTREE (TYPE_DOMAIN (type));
7249 WALK_SUBTREE (TYPE_MIN_VALUE (type));
7250 WALK_SUBTREE (TYPE_MAX_VALUE (type));
7254 WALK_SUBTREE (TREE_TYPE (type));
7255 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7265 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7266 called with the DATA and the address of each sub-tree. If FUNC returns a
7267 non-NULL value, the traversal is stopped, and the value returned by FUNC
7268 is returned. If PSET is non-NULL it is used to record the nodes visited,
7269 and to avoid visiting a node more than once. */
7272 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7274 enum tree_code code;
7278 #define WALK_SUBTREE_TAIL(NODE) \
7282 goto tail_recurse; \
7287 /* Skip empty subtrees. */
7291 /* Don't walk the same tree twice, if the user has requested
7292 that we avoid doing so. */
7293 if (pset && pointer_set_insert (pset, *tp))
7296 /* Call the function. */
7298 result = (*func) (tp, &walk_subtrees, data);
7300 /* If we found something, return it. */
7304 code = TREE_CODE (*tp);
7306 /* Even if we didn't, FUNC may have decided that there was nothing
7307 interesting below this point in the tree. */
7310 /* But we still need to check our siblings. */
7311 if (code == TREE_LIST)
7312 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7313 else if (code == OMP_CLAUSE)
7314 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7319 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
7321 if (result || ! walk_subtrees)
7327 case IDENTIFIER_NODE:
7333 case PLACEHOLDER_EXPR:
7337 /* None of these have subtrees other than those already walked
7342 WALK_SUBTREE (TREE_VALUE (*tp));
7343 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7348 int len = TREE_VEC_LENGTH (*tp);
7353 /* Walk all elements but the first. */
7355 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
7357 /* Now walk the first one as a tail call. */
7358 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
7362 WALK_SUBTREE (TREE_REALPART (*tp));
7363 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
7367 unsigned HOST_WIDE_INT idx;
7368 constructor_elt *ce;
7371 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
7373 WALK_SUBTREE (ce->value);
7378 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
7383 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
7385 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7386 into declarations that are just mentioned, rather than
7387 declared; they don't really belong to this part of the tree.
7388 And, we can see cycles: the initializer for a declaration
7389 can refer to the declaration itself. */
7390 WALK_SUBTREE (DECL_INITIAL (decl));
7391 WALK_SUBTREE (DECL_SIZE (decl));
7392 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
7394 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
7397 case STATEMENT_LIST:
7399 tree_stmt_iterator i;
7400 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
7401 WALK_SUBTREE (*tsi_stmt_ptr (i));
7406 switch (OMP_CLAUSE_CODE (*tp))
7408 case OMP_CLAUSE_PRIVATE:
7409 case OMP_CLAUSE_SHARED:
7410 case OMP_CLAUSE_FIRSTPRIVATE:
7411 case OMP_CLAUSE_LASTPRIVATE:
7412 case OMP_CLAUSE_COPYIN:
7413 case OMP_CLAUSE_COPYPRIVATE:
7415 case OMP_CLAUSE_NUM_THREADS:
7416 case OMP_CLAUSE_SCHEDULE:
7417 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
7420 case OMP_CLAUSE_NOWAIT:
7421 case OMP_CLAUSE_ORDERED:
7422 case OMP_CLAUSE_DEFAULT:
7423 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7425 case OMP_CLAUSE_REDUCTION:
7428 for (i = 0; i < 4; i++)
7429 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
7430 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7442 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7443 But, we only want to walk once. */
7444 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
7445 for (i = 0; i < len; ++i)
7446 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7447 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
7451 /* Walk into various fields of the type that it's defining. We only
7452 want to walk into these fields of a type in this case. Note that
7453 decls get walked as part of the processing of a BIND_EXPR.
7455 ??? Precisely which fields of types that we are supposed to walk in
7456 this case vs. the normal case aren't well defined. */
7457 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL
7458 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp))) != ERROR_MARK)
7460 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
7462 /* Call the function for the type. See if it returns anything or
7463 doesn't want us to continue. If we are to continue, walk both
7464 the normal fields and those for the declaration case. */
7465 result = (*func) (type_p, &walk_subtrees, data);
7466 if (result || !walk_subtrees)
7469 result = walk_type_fields (*type_p, func, data, pset);
7473 /* If this is a record type, also walk the fields. */
7474 if (TREE_CODE (*type_p) == RECORD_TYPE
7475 || TREE_CODE (*type_p) == UNION_TYPE
7476 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7480 for (field = TYPE_FIELDS (*type_p); field;
7481 field = TREE_CHAIN (field))
7483 /* We'd like to look at the type of the field, but we can
7484 easily get infinite recursion. So assume it's pointed
7485 to elsewhere in the tree. Also, ignore things that
7487 if (TREE_CODE (field) != FIELD_DECL)
7490 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
7491 WALK_SUBTREE (DECL_SIZE (field));
7492 WALK_SUBTREE (DECL_SIZE_UNIT (field));
7493 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7494 WALK_SUBTREE (DECL_QUALIFIER (field));
7498 WALK_SUBTREE (TYPE_SIZE (*type_p));
7499 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
7504 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
7508 /* Walk over all the sub-trees of this operand. */
7509 len = TREE_CODE_LENGTH (code);
7511 /* Go through the subtrees. We need to do this in forward order so
7512 that the scope of a FOR_EXPR is handled properly. */
7515 for (i = 0; i < len - 1; ++i)
7516 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7517 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
7521 /* If this is a type, walk the needed fields in the type. */
7522 else if (TYPE_P (*tp))
7523 return walk_type_fields (*tp, func, data, pset);
7527 /* We didn't find what we were looking for. */
7530 #undef WALK_SUBTREE_TAIL
7534 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7537 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
7540 struct pointer_set_t *pset;
7542 pset = pointer_set_create ();
7543 result = walk_tree (tp, func, data, pset);
7544 pointer_set_destroy (pset);
7549 /* Return true if STMT is an empty statement or contains nothing but
7550 empty statements. */
7553 empty_body_p (tree stmt)
7555 tree_stmt_iterator i;
7558 if (IS_EMPTY_STMT (stmt))
7560 else if (TREE_CODE (stmt) == BIND_EXPR)
7561 body = BIND_EXPR_BODY (stmt);
7562 else if (TREE_CODE (stmt) == STATEMENT_LIST)
7567 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
7568 if (!empty_body_p (tsi_stmt (i)))
7574 #include "gt-tree.h"