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 TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 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;
1018 v = VEC_alloc (constructor_elt, gc, 1);
1019 elt = VEC_quick_push (constructor_elt, v, NULL);
1023 t = build_constructor (type, v);
1024 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1029 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1030 are in a list pointed to by VALS. */
1032 build_constructor_from_list (tree type, tree vals)
1035 VEC(constructor_elt,gc) *v = NULL;
1036 bool constant_p = true;
1040 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1041 for (t = vals; t; t = TREE_CHAIN (t))
1043 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1044 val = TREE_VALUE (t);
1045 elt->index = TREE_PURPOSE (t);
1047 if (!TREE_CONSTANT (val))
1052 t = build_constructor (type, v);
1053 TREE_CONSTANT (t) = constant_p;
1058 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1061 build_real (tree type, REAL_VALUE_TYPE d)
1064 REAL_VALUE_TYPE *dp;
1067 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1068 Consider doing it via real_convert now. */
1070 v = make_node (REAL_CST);
1071 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1072 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1074 TREE_TYPE (v) = type;
1075 TREE_REAL_CST_PTR (v) = dp;
1076 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1080 /* Return a new REAL_CST node whose type is TYPE
1081 and whose value is the integer value of the INTEGER_CST node I. */
1084 real_value_from_int_cst (tree type, tree i)
1088 /* Clear all bits of the real value type so that we can later do
1089 bitwise comparisons to see if two values are the same. */
1090 memset (&d, 0, sizeof d);
1092 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1093 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1094 TYPE_UNSIGNED (TREE_TYPE (i)));
1098 /* Given a tree representing an integer constant I, return a tree
1099 representing the same value as a floating-point constant of type TYPE. */
1102 build_real_from_int_cst (tree type, tree i)
1105 int overflow = TREE_OVERFLOW (i);
1107 v = build_real (type, real_value_from_int_cst (type, i));
1109 TREE_OVERFLOW (v) |= overflow;
1110 TREE_CONSTANT_OVERFLOW (v) |= overflow;
1114 /* Return a newly constructed STRING_CST node whose value is
1115 the LEN characters at STR.
1116 The TREE_TYPE is not initialized. */
1119 build_string (int len, const char *str)
1124 /* Do not waste bytes provided by padding of struct tree_string. */
1125 length = len + offsetof (struct tree_string, str) + 1;
1127 #ifdef GATHER_STATISTICS
1128 tree_node_counts[(int) c_kind]++;
1129 tree_node_sizes[(int) c_kind] += length;
1132 s = ggc_alloc_tree (length);
1134 memset (s, 0, sizeof (struct tree_common));
1135 TREE_SET_CODE (s, STRING_CST);
1136 TREE_CONSTANT (s) = 1;
1137 TREE_INVARIANT (s) = 1;
1138 TREE_STRING_LENGTH (s) = len;
1139 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1140 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1145 /* Return a newly constructed COMPLEX_CST node whose value is
1146 specified by the real and imaginary parts REAL and IMAG.
1147 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1148 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1151 build_complex (tree type, tree real, tree imag)
1153 tree t = make_node (COMPLEX_CST);
1155 TREE_REALPART (t) = real;
1156 TREE_IMAGPART (t) = imag;
1157 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1158 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1159 TREE_CONSTANT_OVERFLOW (t)
1160 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1164 /* Return a constant of arithmetic type TYPE which is the
1165 multiplicative identity of the set TYPE. */
1168 build_one_cst (tree type)
1170 switch (TREE_CODE (type))
1172 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1173 case POINTER_TYPE: case REFERENCE_TYPE:
1175 return build_int_cst (type, 1);
1178 return build_real (type, dconst1);
1185 scalar = build_one_cst (TREE_TYPE (type));
1187 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1189 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1190 cst = tree_cons (NULL_TREE, scalar, cst);
1192 return build_vector (type, cst);
1196 return build_complex (type,
1197 build_one_cst (TREE_TYPE (type)),
1198 fold_convert (TREE_TYPE (type), integer_zero_node));
1205 /* Build a BINFO with LEN language slots. */
1208 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1211 size_t length = (offsetof (struct tree_binfo, base_binfos)
1212 + VEC_embedded_size (tree, base_binfos));
1214 #ifdef GATHER_STATISTICS
1215 tree_node_counts[(int) binfo_kind]++;
1216 tree_node_sizes[(int) binfo_kind] += length;
1219 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1221 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1223 TREE_SET_CODE (t, TREE_BINFO);
1225 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1231 /* Build a newly constructed TREE_VEC node of length LEN. */
1234 make_tree_vec_stat (int len MEM_STAT_DECL)
1237 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1239 #ifdef GATHER_STATISTICS
1240 tree_node_counts[(int) vec_kind]++;
1241 tree_node_sizes[(int) vec_kind] += length;
1244 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1246 memset (t, 0, length);
1248 TREE_SET_CODE (t, TREE_VEC);
1249 TREE_VEC_LENGTH (t) = len;
1254 /* Return 1 if EXPR is the integer constant zero or a complex constant
1258 integer_zerop (tree expr)
1262 return ((TREE_CODE (expr) == INTEGER_CST
1263 && TREE_INT_CST_LOW (expr) == 0
1264 && TREE_INT_CST_HIGH (expr) == 0)
1265 || (TREE_CODE (expr) == COMPLEX_CST
1266 && integer_zerop (TREE_REALPART (expr))
1267 && integer_zerop (TREE_IMAGPART (expr))));
1270 /* Return 1 if EXPR is the integer constant one or the corresponding
1271 complex constant. */
1274 integer_onep (tree expr)
1278 return ((TREE_CODE (expr) == INTEGER_CST
1279 && TREE_INT_CST_LOW (expr) == 1
1280 && TREE_INT_CST_HIGH (expr) == 0)
1281 || (TREE_CODE (expr) == COMPLEX_CST
1282 && integer_onep (TREE_REALPART (expr))
1283 && integer_zerop (TREE_IMAGPART (expr))));
1286 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1287 it contains. Likewise for the corresponding complex constant. */
1290 integer_all_onesp (tree expr)
1297 if (TREE_CODE (expr) == COMPLEX_CST
1298 && integer_all_onesp (TREE_REALPART (expr))
1299 && integer_zerop (TREE_IMAGPART (expr)))
1302 else if (TREE_CODE (expr) != INTEGER_CST)
1305 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1306 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1307 && TREE_INT_CST_HIGH (expr) == -1)
1312 /* Note that using TYPE_PRECISION here is wrong. We care about the
1313 actual bits, not the (arbitrary) range of the type. */
1314 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1315 if (prec >= HOST_BITS_PER_WIDE_INT)
1317 HOST_WIDE_INT high_value;
1320 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1322 /* Can not handle precisions greater than twice the host int size. */
1323 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1324 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1325 /* Shifting by the host word size is undefined according to the ANSI
1326 standard, so we must handle this as a special case. */
1329 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1331 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1332 && TREE_INT_CST_HIGH (expr) == high_value);
1335 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1338 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1342 integer_pow2p (tree expr)
1345 HOST_WIDE_INT high, low;
1349 if (TREE_CODE (expr) == COMPLEX_CST
1350 && integer_pow2p (TREE_REALPART (expr))
1351 && integer_zerop (TREE_IMAGPART (expr)))
1354 if (TREE_CODE (expr) != INTEGER_CST)
1357 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1358 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1359 high = TREE_INT_CST_HIGH (expr);
1360 low = TREE_INT_CST_LOW (expr);
1362 /* First clear all bits that are beyond the type's precision in case
1363 we've been sign extended. */
1365 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1367 else if (prec > HOST_BITS_PER_WIDE_INT)
1368 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1372 if (prec < HOST_BITS_PER_WIDE_INT)
1373 low &= ~((HOST_WIDE_INT) (-1) << prec);
1376 if (high == 0 && low == 0)
1379 return ((high == 0 && (low & (low - 1)) == 0)
1380 || (low == 0 && (high & (high - 1)) == 0));
1383 /* Return 1 if EXPR is an integer constant other than zero or a
1384 complex constant other than zero. */
1387 integer_nonzerop (tree expr)
1391 return ((TREE_CODE (expr) == INTEGER_CST
1392 && (TREE_INT_CST_LOW (expr) != 0
1393 || TREE_INT_CST_HIGH (expr) != 0))
1394 || (TREE_CODE (expr) == COMPLEX_CST
1395 && (integer_nonzerop (TREE_REALPART (expr))
1396 || integer_nonzerop (TREE_IMAGPART (expr)))));
1399 /* Return the power of two represented by a tree node known to be a
1403 tree_log2 (tree expr)
1406 HOST_WIDE_INT high, low;
1410 if (TREE_CODE (expr) == COMPLEX_CST)
1411 return tree_log2 (TREE_REALPART (expr));
1413 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1414 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1416 high = TREE_INT_CST_HIGH (expr);
1417 low = TREE_INT_CST_LOW (expr);
1419 /* First clear all bits that are beyond the type's precision in case
1420 we've been sign extended. */
1422 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1424 else if (prec > HOST_BITS_PER_WIDE_INT)
1425 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1429 if (prec < HOST_BITS_PER_WIDE_INT)
1430 low &= ~((HOST_WIDE_INT) (-1) << prec);
1433 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1434 : exact_log2 (low));
1437 /* Similar, but return the largest integer Y such that 2 ** Y is less
1438 than or equal to EXPR. */
1441 tree_floor_log2 (tree expr)
1444 HOST_WIDE_INT high, low;
1448 if (TREE_CODE (expr) == COMPLEX_CST)
1449 return tree_log2 (TREE_REALPART (expr));
1451 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1452 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1454 high = TREE_INT_CST_HIGH (expr);
1455 low = TREE_INT_CST_LOW (expr);
1457 /* First clear all bits that are beyond the type's precision in case
1458 we've been sign extended. Ignore if type's precision hasn't been set
1459 since what we are doing is setting it. */
1461 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1463 else if (prec > HOST_BITS_PER_WIDE_INT)
1464 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1468 if (prec < HOST_BITS_PER_WIDE_INT)
1469 low &= ~((HOST_WIDE_INT) (-1) << prec);
1472 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1473 : floor_log2 (low));
1476 /* Return 1 if EXPR is the real constant zero. */
1479 real_zerop (tree expr)
1483 return ((TREE_CODE (expr) == REAL_CST
1484 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1485 || (TREE_CODE (expr) == COMPLEX_CST
1486 && real_zerop (TREE_REALPART (expr))
1487 && real_zerop (TREE_IMAGPART (expr))));
1490 /* Return 1 if EXPR is the real constant one in real or complex form. */
1493 real_onep (tree expr)
1497 return ((TREE_CODE (expr) == REAL_CST
1498 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1499 || (TREE_CODE (expr) == COMPLEX_CST
1500 && real_onep (TREE_REALPART (expr))
1501 && real_zerop (TREE_IMAGPART (expr))));
1504 /* Return 1 if EXPR is the real constant two. */
1507 real_twop (tree expr)
1511 return ((TREE_CODE (expr) == REAL_CST
1512 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1513 || (TREE_CODE (expr) == COMPLEX_CST
1514 && real_twop (TREE_REALPART (expr))
1515 && real_zerop (TREE_IMAGPART (expr))));
1518 /* Return 1 if EXPR is the real constant minus one. */
1521 real_minus_onep (tree expr)
1525 return ((TREE_CODE (expr) == REAL_CST
1526 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1527 || (TREE_CODE (expr) == COMPLEX_CST
1528 && real_minus_onep (TREE_REALPART (expr))
1529 && real_zerop (TREE_IMAGPART (expr))));
1532 /* Nonzero if EXP is a constant or a cast of a constant. */
1535 really_constant_p (tree exp)
1537 /* This is not quite the same as STRIP_NOPS. It does more. */
1538 while (TREE_CODE (exp) == NOP_EXPR
1539 || TREE_CODE (exp) == CONVERT_EXPR
1540 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1541 exp = TREE_OPERAND (exp, 0);
1542 return TREE_CONSTANT (exp);
1545 /* Return first list element whose TREE_VALUE is ELEM.
1546 Return 0 if ELEM is not in LIST. */
1549 value_member (tree elem, tree list)
1553 if (elem == TREE_VALUE (list))
1555 list = TREE_CHAIN (list);
1560 /* Return first list element whose TREE_PURPOSE is ELEM.
1561 Return 0 if ELEM is not in LIST. */
1564 purpose_member (tree elem, tree list)
1568 if (elem == TREE_PURPOSE (list))
1570 list = TREE_CHAIN (list);
1575 /* Return nonzero if ELEM is part of the chain CHAIN. */
1578 chain_member (tree elem, tree chain)
1584 chain = TREE_CHAIN (chain);
1590 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1591 We expect a null pointer to mark the end of the chain.
1592 This is the Lisp primitive `length'. */
1595 list_length (tree t)
1598 #ifdef ENABLE_TREE_CHECKING
1606 #ifdef ENABLE_TREE_CHECKING
1609 gcc_assert (p != q);
1617 /* Returns the number of FIELD_DECLs in TYPE. */
1620 fields_length (tree type)
1622 tree t = TYPE_FIELDS (type);
1625 for (; t; t = TREE_CHAIN (t))
1626 if (TREE_CODE (t) == FIELD_DECL)
1632 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1633 by modifying the last node in chain 1 to point to chain 2.
1634 This is the Lisp primitive `nconc'. */
1637 chainon (tree op1, tree op2)
1646 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1648 TREE_CHAIN (t1) = op2;
1650 #ifdef ENABLE_TREE_CHECKING
1653 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1654 gcc_assert (t2 != t1);
1661 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1664 tree_last (tree chain)
1668 while ((next = TREE_CHAIN (chain)))
1673 /* Reverse the order of elements in the chain T,
1674 and return the new head of the chain (old last element). */
1679 tree prev = 0, decl, next;
1680 for (decl = t; decl; decl = next)
1682 next = TREE_CHAIN (decl);
1683 TREE_CHAIN (decl) = prev;
1689 /* Return a newly created TREE_LIST node whose
1690 purpose and value fields are PARM and VALUE. */
1693 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1695 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1696 TREE_PURPOSE (t) = parm;
1697 TREE_VALUE (t) = value;
1701 /* Return a newly created TREE_LIST node whose
1702 purpose and value fields are PURPOSE and VALUE
1703 and whose TREE_CHAIN is CHAIN. */
1706 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1710 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1712 memset (node, 0, sizeof (struct tree_common));
1714 #ifdef GATHER_STATISTICS
1715 tree_node_counts[(int) x_kind]++;
1716 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1719 TREE_SET_CODE (node, TREE_LIST);
1720 TREE_CHAIN (node) = chain;
1721 TREE_PURPOSE (node) = purpose;
1722 TREE_VALUE (node) = value;
1727 /* Return the size nominally occupied by an object of type TYPE
1728 when it resides in memory. The value is measured in units of bytes,
1729 and its data type is that normally used for type sizes
1730 (which is the first type created by make_signed_type or
1731 make_unsigned_type). */
1734 size_in_bytes (tree type)
1738 if (type == error_mark_node)
1739 return integer_zero_node;
1741 type = TYPE_MAIN_VARIANT (type);
1742 t = TYPE_SIZE_UNIT (type);
1746 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1747 return size_zero_node;
1750 if (TREE_CODE (t) == INTEGER_CST)
1751 t = force_fit_type (t, 0, false, false);
1756 /* Return the size of TYPE (in bytes) as a wide integer
1757 or return -1 if the size can vary or is larger than an integer. */
1760 int_size_in_bytes (tree type)
1764 if (type == error_mark_node)
1767 type = TYPE_MAIN_VARIANT (type);
1768 t = TYPE_SIZE_UNIT (type);
1770 || TREE_CODE (t) != INTEGER_CST
1771 || TREE_INT_CST_HIGH (t) != 0
1772 /* If the result would appear negative, it's too big to represent. */
1773 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1776 return TREE_INT_CST_LOW (t);
1779 /* Return the maximum size of TYPE (in bytes) as a wide integer
1780 or return -1 if the size can vary or is larger than an integer. */
1783 max_int_size_in_bytes (tree type)
1785 HOST_WIDE_INT size = -1;
1788 /* If this is an array type, check for a possible MAX_SIZE attached. */
1790 if (TREE_CODE (type) == ARRAY_TYPE)
1792 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1794 if (size_tree && host_integerp (size_tree, 1))
1795 size = tree_low_cst (size_tree, 1);
1798 /* If we still haven't been able to get a size, see if the language
1799 can compute a maximum size. */
1803 size_tree = lang_hooks.types.max_size (type);
1805 if (size_tree && host_integerp (size_tree, 1))
1806 size = tree_low_cst (size_tree, 1);
1812 /* Return the bit position of FIELD, in bits from the start of the record.
1813 This is a tree of type bitsizetype. */
1816 bit_position (tree field)
1818 return bit_from_pos (DECL_FIELD_OFFSET (field),
1819 DECL_FIELD_BIT_OFFSET (field));
1822 /* Likewise, but return as an integer. It must be representable in
1823 that way (since it could be a signed value, we don't have the
1824 option of returning -1 like int_size_in_byte can. */
1827 int_bit_position (tree field)
1829 return tree_low_cst (bit_position (field), 0);
1832 /* Return the byte position of FIELD, in bytes from the start of the record.
1833 This is a tree of type sizetype. */
1836 byte_position (tree field)
1838 return byte_from_pos (DECL_FIELD_OFFSET (field),
1839 DECL_FIELD_BIT_OFFSET (field));
1842 /* Likewise, but return as an integer. It must be representable in
1843 that way (since it could be a signed value, we don't have the
1844 option of returning -1 like int_size_in_byte can. */
1847 int_byte_position (tree field)
1849 return tree_low_cst (byte_position (field), 0);
1852 /* Return the strictest alignment, in bits, that T is known to have. */
1857 unsigned int align0, align1;
1859 switch (TREE_CODE (t))
1861 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1862 /* If we have conversions, we know that the alignment of the
1863 object must meet each of the alignments of the types. */
1864 align0 = expr_align (TREE_OPERAND (t, 0));
1865 align1 = TYPE_ALIGN (TREE_TYPE (t));
1866 return MAX (align0, align1);
1868 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1869 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1870 case CLEANUP_POINT_EXPR:
1871 /* These don't change the alignment of an object. */
1872 return expr_align (TREE_OPERAND (t, 0));
1875 /* The best we can do is say that the alignment is the least aligned
1877 align0 = expr_align (TREE_OPERAND (t, 1));
1878 align1 = expr_align (TREE_OPERAND (t, 2));
1879 return MIN (align0, align1);
1881 case LABEL_DECL: case CONST_DECL:
1882 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1883 if (DECL_ALIGN (t) != 0)
1884 return DECL_ALIGN (t);
1888 return FUNCTION_BOUNDARY;
1894 /* Otherwise take the alignment from that of the type. */
1895 return TYPE_ALIGN (TREE_TYPE (t));
1898 /* Return, as a tree node, the number of elements for TYPE (which is an
1899 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1902 array_type_nelts (tree type)
1904 tree index_type, min, max;
1906 /* If they did it with unspecified bounds, then we should have already
1907 given an error about it before we got here. */
1908 if (! TYPE_DOMAIN (type))
1909 return error_mark_node;
1911 index_type = TYPE_DOMAIN (type);
1912 min = TYPE_MIN_VALUE (index_type);
1913 max = TYPE_MAX_VALUE (index_type);
1915 return (integer_zerop (min)
1917 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1920 /* If arg is static -- a reference to an object in static storage -- then
1921 return the object. This is not the same as the C meaning of `static'.
1922 If arg isn't static, return NULL. */
1927 switch (TREE_CODE (arg))
1930 /* Nested functions are static, even though taking their address will
1931 involve a trampoline as we unnest the nested function and create
1932 the trampoline on the tree level. */
1936 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1937 && ! DECL_THREAD_LOCAL_P (arg)
1938 && ! DECL_DLLIMPORT_P (arg)
1942 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1946 return TREE_STATIC (arg) ? arg : NULL;
1953 /* If the thing being referenced is not a field, then it is
1954 something language specific. */
1955 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1956 return (*lang_hooks.staticp) (arg);
1958 /* If we are referencing a bitfield, we can't evaluate an
1959 ADDR_EXPR at compile time and so it isn't a constant. */
1960 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1963 return staticp (TREE_OPERAND (arg, 0));
1968 case MISALIGNED_INDIRECT_REF:
1969 case ALIGN_INDIRECT_REF:
1971 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
1974 case ARRAY_RANGE_REF:
1975 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1976 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1977 return staticp (TREE_OPERAND (arg, 0));
1982 if ((unsigned int) TREE_CODE (arg)
1983 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1984 return lang_hooks.staticp (arg);
1990 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1991 Do this to any expression which may be used in more than one place,
1992 but must be evaluated only once.
1994 Normally, expand_expr would reevaluate the expression each time.
1995 Calling save_expr produces something that is evaluated and recorded
1996 the first time expand_expr is called on it. Subsequent calls to
1997 expand_expr just reuse the recorded value.
1999 The call to expand_expr that generates code that actually computes
2000 the value is the first call *at compile time*. Subsequent calls
2001 *at compile time* generate code to use the saved value.
2002 This produces correct result provided that *at run time* control
2003 always flows through the insns made by the first expand_expr
2004 before reaching the other places where the save_expr was evaluated.
2005 You, the caller of save_expr, must make sure this is so.
2007 Constants, and certain read-only nodes, are returned with no
2008 SAVE_EXPR because that is safe. Expressions containing placeholders
2009 are not touched; see tree.def for an explanation of what these
2013 save_expr (tree expr)
2015 tree t = fold (expr);
2018 /* If the tree evaluates to a constant, then we don't want to hide that
2019 fact (i.e. this allows further folding, and direct checks for constants).
2020 However, a read-only object that has side effects cannot be bypassed.
2021 Since it is no problem to reevaluate literals, we just return the
2023 inner = skip_simple_arithmetic (t);
2025 if (TREE_INVARIANT (inner)
2026 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2027 || TREE_CODE (inner) == SAVE_EXPR
2028 || TREE_CODE (inner) == ERROR_MARK)
2031 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2032 it means that the size or offset of some field of an object depends on
2033 the value within another field.
2035 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2036 and some variable since it would then need to be both evaluated once and
2037 evaluated more than once. Front-ends must assure this case cannot
2038 happen by surrounding any such subexpressions in their own SAVE_EXPR
2039 and forcing evaluation at the proper time. */
2040 if (contains_placeholder_p (inner))
2043 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2045 /* This expression might be placed ahead of a jump to ensure that the
2046 value was computed on both sides of the jump. So make sure it isn't
2047 eliminated as dead. */
2048 TREE_SIDE_EFFECTS (t) = 1;
2049 TREE_INVARIANT (t) = 1;
2053 /* Look inside EXPR and into any simple arithmetic operations. Return
2054 the innermost non-arithmetic node. */
2057 skip_simple_arithmetic (tree expr)
2061 /* We don't care about whether this can be used as an lvalue in this
2063 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2064 expr = TREE_OPERAND (expr, 0);
2066 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2067 a constant, it will be more efficient to not make another SAVE_EXPR since
2068 it will allow better simplification and GCSE will be able to merge the
2069 computations if they actually occur. */
2073 if (UNARY_CLASS_P (inner))
2074 inner = TREE_OPERAND (inner, 0);
2075 else if (BINARY_CLASS_P (inner))
2077 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2078 inner = TREE_OPERAND (inner, 0);
2079 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2080 inner = TREE_OPERAND (inner, 1);
2091 /* Return which tree structure is used by T. */
2093 enum tree_node_structure_enum
2094 tree_node_structure (tree t)
2096 enum tree_code code = TREE_CODE (t);
2098 switch (TREE_CODE_CLASS (code))
2100 case tcc_declaration:
2105 return TS_FIELD_DECL;
2107 return TS_PARM_DECL;
2111 return TS_LABEL_DECL;
2113 return TS_RESULT_DECL;
2115 return TS_CONST_DECL;
2117 return TS_TYPE_DECL;
2119 return TS_FUNCTION_DECL;
2120 case SYMBOL_MEMORY_TAG:
2121 case NAME_MEMORY_TAG:
2122 case STRUCT_FIELD_TAG:
2123 return TS_MEMORY_TAG;
2125 return TS_DECL_NON_COMMON;
2131 case tcc_comparison:
2134 case tcc_expression:
2137 default: /* tcc_constant and tcc_exceptional */
2142 /* tcc_constant cases. */
2143 case INTEGER_CST: return TS_INT_CST;
2144 case REAL_CST: return TS_REAL_CST;
2145 case COMPLEX_CST: return TS_COMPLEX;
2146 case VECTOR_CST: return TS_VECTOR;
2147 case STRING_CST: return TS_STRING;
2148 /* tcc_exceptional cases. */
2149 case ERROR_MARK: return TS_COMMON;
2150 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2151 case TREE_LIST: return TS_LIST;
2152 case TREE_VEC: return TS_VEC;
2153 case PHI_NODE: return TS_PHI_NODE;
2154 case SSA_NAME: return TS_SSA_NAME;
2155 case PLACEHOLDER_EXPR: return TS_COMMON;
2156 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2157 case BLOCK: return TS_BLOCK;
2158 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2159 case TREE_BINFO: return TS_BINFO;
2160 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2161 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2168 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2169 or offset that depends on a field within a record. */
2172 contains_placeholder_p (tree exp)
2174 enum tree_code code;
2179 code = TREE_CODE (exp);
2180 if (code == PLACEHOLDER_EXPR)
2183 switch (TREE_CODE_CLASS (code))
2186 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2187 position computations since they will be converted into a
2188 WITH_RECORD_EXPR involving the reference, which will assume
2189 here will be valid. */
2190 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2192 case tcc_exceptional:
2193 if (code == TREE_LIST)
2194 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2195 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2200 case tcc_comparison:
2201 case tcc_expression:
2205 /* Ignoring the first operand isn't quite right, but works best. */
2206 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2209 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2210 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2211 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2214 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2220 switch (TREE_CODE_LENGTH (code))
2223 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2225 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2226 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2237 /* Return true if any part of the computation of TYPE involves a
2238 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2239 (for QUAL_UNION_TYPE) and field positions. */
2242 type_contains_placeholder_1 (tree type)
2244 /* If the size contains a placeholder or the parent type (component type in
2245 the case of arrays) type involves a placeholder, this type does. */
2246 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2247 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2248 || (TREE_TYPE (type) != 0
2249 && type_contains_placeholder_p (TREE_TYPE (type))))
2252 /* Now do type-specific checks. Note that the last part of the check above
2253 greatly limits what we have to do below. */
2254 switch (TREE_CODE (type))
2262 case REFERENCE_TYPE:
2270 /* Here we just check the bounds. */
2271 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2272 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2275 /* We're already checked the component type (TREE_TYPE), so just check
2277 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2281 case QUAL_UNION_TYPE:
2285 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2286 if (TREE_CODE (field) == FIELD_DECL
2287 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2288 || (TREE_CODE (type) == QUAL_UNION_TYPE
2289 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2290 || type_contains_placeholder_p (TREE_TYPE (field))))
2302 type_contains_placeholder_p (tree type)
2306 /* If the contains_placeholder_bits field has been initialized,
2307 then we know the answer. */
2308 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2309 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2311 /* Indicate that we've seen this type node, and the answer is false.
2312 This is what we want to return if we run into recursion via fields. */
2313 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2315 /* Compute the real value. */
2316 result = type_contains_placeholder_1 (type);
2318 /* Store the real value. */
2319 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2324 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2325 return a tree with all occurrences of references to F in a
2326 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2327 contains only arithmetic expressions or a CALL_EXPR with a
2328 PLACEHOLDER_EXPR occurring only in its arglist. */
2331 substitute_in_expr (tree exp, tree f, tree r)
2333 enum tree_code code = TREE_CODE (exp);
2334 tree op0, op1, op2, op3;
2338 /* We handle TREE_LIST and COMPONENT_REF separately. */
2339 if (code == TREE_LIST)
2341 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2342 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2343 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2346 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2348 else if (code == COMPONENT_REF)
2350 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2351 and it is the right field, replace it with R. */
2352 for (inner = TREE_OPERAND (exp, 0);
2353 REFERENCE_CLASS_P (inner);
2354 inner = TREE_OPERAND (inner, 0))
2356 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2357 && TREE_OPERAND (exp, 1) == f)
2360 /* If this expression hasn't been completed let, leave it alone. */
2361 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2364 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2365 if (op0 == TREE_OPERAND (exp, 0))
2368 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2369 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2372 switch (TREE_CODE_CLASS (code))
2375 case tcc_declaration:
2378 case tcc_exceptional:
2381 case tcc_comparison:
2382 case tcc_expression:
2384 switch (TREE_CODE_LENGTH (code))
2390 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2391 if (op0 == TREE_OPERAND (exp, 0))
2394 new = fold_build1 (code, TREE_TYPE (exp), op0);
2398 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2399 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2401 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2404 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2408 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2409 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2410 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2412 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2413 && op2 == TREE_OPERAND (exp, 2))
2416 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2420 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2421 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2422 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2423 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2425 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2426 && op2 == TREE_OPERAND (exp, 2)
2427 && op3 == TREE_OPERAND (exp, 3))
2430 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2442 TREE_READONLY (new) = TREE_READONLY (exp);
2446 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2447 for it within OBJ, a tree that is an object or a chain of references. */
2450 substitute_placeholder_in_expr (tree exp, tree obj)
2452 enum tree_code code = TREE_CODE (exp);
2453 tree op0, op1, op2, op3;
2455 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2456 in the chain of OBJ. */
2457 if (code == PLACEHOLDER_EXPR)
2459 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2462 for (elt = obj; elt != 0;
2463 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2464 || TREE_CODE (elt) == COND_EXPR)
2465 ? TREE_OPERAND (elt, 1)
2466 : (REFERENCE_CLASS_P (elt)
2467 || UNARY_CLASS_P (elt)
2468 || BINARY_CLASS_P (elt)
2469 || EXPRESSION_CLASS_P (elt))
2470 ? TREE_OPERAND (elt, 0) : 0))
2471 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2474 for (elt = obj; elt != 0;
2475 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2476 || TREE_CODE (elt) == COND_EXPR)
2477 ? TREE_OPERAND (elt, 1)
2478 : (REFERENCE_CLASS_P (elt)
2479 || UNARY_CLASS_P (elt)
2480 || BINARY_CLASS_P (elt)
2481 || EXPRESSION_CLASS_P (elt))
2482 ? TREE_OPERAND (elt, 0) : 0))
2483 if (POINTER_TYPE_P (TREE_TYPE (elt))
2484 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2486 return fold_build1 (INDIRECT_REF, need_type, elt);
2488 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2489 survives until RTL generation, there will be an error. */
2493 /* TREE_LIST is special because we need to look at TREE_VALUE
2494 and TREE_CHAIN, not TREE_OPERANDS. */
2495 else if (code == TREE_LIST)
2497 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2498 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2499 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2502 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2505 switch (TREE_CODE_CLASS (code))
2508 case tcc_declaration:
2511 case tcc_exceptional:
2514 case tcc_comparison:
2515 case tcc_expression:
2518 switch (TREE_CODE_LENGTH (code))
2524 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2525 if (op0 == TREE_OPERAND (exp, 0))
2528 return fold_build1 (code, TREE_TYPE (exp), op0);
2531 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2532 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2534 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2537 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2540 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2541 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2542 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2544 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2545 && op2 == TREE_OPERAND (exp, 2))
2548 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2551 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2552 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2553 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2554 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2556 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2557 && op2 == TREE_OPERAND (exp, 2)
2558 && op3 == TREE_OPERAND (exp, 3))
2561 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2573 /* Stabilize a reference so that we can use it any number of times
2574 without causing its operands to be evaluated more than once.
2575 Returns the stabilized reference. This works by means of save_expr,
2576 so see the caveats in the comments about save_expr.
2578 Also allows conversion expressions whose operands are references.
2579 Any other kind of expression is returned unchanged. */
2582 stabilize_reference (tree ref)
2585 enum tree_code code = TREE_CODE (ref);
2592 /* No action is needed in this case. */
2598 case FIX_TRUNC_EXPR:
2599 case FIX_FLOOR_EXPR:
2600 case FIX_ROUND_EXPR:
2602 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2606 result = build_nt (INDIRECT_REF,
2607 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2611 result = build_nt (COMPONENT_REF,
2612 stabilize_reference (TREE_OPERAND (ref, 0)),
2613 TREE_OPERAND (ref, 1), NULL_TREE);
2617 result = build_nt (BIT_FIELD_REF,
2618 stabilize_reference (TREE_OPERAND (ref, 0)),
2619 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2620 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2624 result = build_nt (ARRAY_REF,
2625 stabilize_reference (TREE_OPERAND (ref, 0)),
2626 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2627 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2630 case ARRAY_RANGE_REF:
2631 result = build_nt (ARRAY_RANGE_REF,
2632 stabilize_reference (TREE_OPERAND (ref, 0)),
2633 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2634 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2638 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2639 it wouldn't be ignored. This matters when dealing with
2641 return stabilize_reference_1 (ref);
2643 /* If arg isn't a kind of lvalue we recognize, make no change.
2644 Caller should recognize the error for an invalid lvalue. */
2649 return error_mark_node;
2652 TREE_TYPE (result) = TREE_TYPE (ref);
2653 TREE_READONLY (result) = TREE_READONLY (ref);
2654 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2655 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2660 /* Subroutine of stabilize_reference; this is called for subtrees of
2661 references. Any expression with side-effects must be put in a SAVE_EXPR
2662 to ensure that it is only evaluated once.
2664 We don't put SAVE_EXPR nodes around everything, because assigning very
2665 simple expressions to temporaries causes us to miss good opportunities
2666 for optimizations. Among other things, the opportunity to fold in the
2667 addition of a constant into an addressing mode often gets lost, e.g.
2668 "y[i+1] += x;". In general, we take the approach that we should not make
2669 an assignment unless we are forced into it - i.e., that any non-side effect
2670 operator should be allowed, and that cse should take care of coalescing
2671 multiple utterances of the same expression should that prove fruitful. */
2674 stabilize_reference_1 (tree e)
2677 enum tree_code code = TREE_CODE (e);
2679 /* We cannot ignore const expressions because it might be a reference
2680 to a const array but whose index contains side-effects. But we can
2681 ignore things that are actual constant or that already have been
2682 handled by this function. */
2684 if (TREE_INVARIANT (e))
2687 switch (TREE_CODE_CLASS (code))
2689 case tcc_exceptional:
2691 case tcc_declaration:
2692 case tcc_comparison:
2694 case tcc_expression:
2696 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2697 so that it will only be evaluated once. */
2698 /* The reference (r) and comparison (<) classes could be handled as
2699 below, but it is generally faster to only evaluate them once. */
2700 if (TREE_SIDE_EFFECTS (e))
2701 return save_expr (e);
2705 /* Constants need no processing. In fact, we should never reach
2710 /* Division is slow and tends to be compiled with jumps,
2711 especially the division by powers of 2 that is often
2712 found inside of an array reference. So do it just once. */
2713 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2714 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2715 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2716 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2717 return save_expr (e);
2718 /* Recursively stabilize each operand. */
2719 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2720 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2724 /* Recursively stabilize each operand. */
2725 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2732 TREE_TYPE (result) = TREE_TYPE (e);
2733 TREE_READONLY (result) = TREE_READONLY (e);
2734 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2735 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2736 TREE_INVARIANT (result) = 1;
2741 /* Low-level constructors for expressions. */
2743 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2744 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2747 recompute_tree_invariant_for_addr_expr (tree t)
2750 bool tc = true, ti = true, se = false;
2752 /* We started out assuming this address is both invariant and constant, but
2753 does not have side effects. Now go down any handled components and see if
2754 any of them involve offsets that are either non-constant or non-invariant.
2755 Also check for side-effects.
2757 ??? Note that this code makes no attempt to deal with the case where
2758 taking the address of something causes a copy due to misalignment. */
2760 #define UPDATE_TITCSE(NODE) \
2761 do { tree _node = (NODE); \
2762 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2763 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2764 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2766 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2767 node = TREE_OPERAND (node, 0))
2769 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2770 array reference (probably made temporarily by the G++ front end),
2771 so ignore all the operands. */
2772 if ((TREE_CODE (node) == ARRAY_REF
2773 || TREE_CODE (node) == ARRAY_RANGE_REF)
2774 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2776 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2777 if (TREE_OPERAND (node, 2))
2778 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2779 if (TREE_OPERAND (node, 3))
2780 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2782 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2783 FIELD_DECL, apparently. The G++ front end can put something else
2784 there, at least temporarily. */
2785 else if (TREE_CODE (node) == COMPONENT_REF
2786 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2788 if (TREE_OPERAND (node, 2))
2789 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2791 else if (TREE_CODE (node) == BIT_FIELD_REF)
2792 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2795 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2797 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2798 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2799 invariant and constant if the decl is static. It's also invariant if it's
2800 a decl in the current function. Taking the address of a volatile variable
2801 is not volatile. If it's a constant, the address is both invariant and
2802 constant. Otherwise it's neither. */
2803 if (TREE_CODE (node) == INDIRECT_REF)
2804 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2805 else if (DECL_P (node))
2809 else if (decl_function_context (node) == current_function_decl
2810 /* Addresses of thread-local variables are invariant. */
2811 || (TREE_CODE (node) == VAR_DECL
2812 && DECL_THREAD_LOCAL_P (node)))
2817 else if (CONSTANT_CLASS_P (node))
2822 se |= TREE_SIDE_EFFECTS (node);
2825 TREE_CONSTANT (t) = tc;
2826 TREE_INVARIANT (t) = ti;
2827 TREE_SIDE_EFFECTS (t) = se;
2828 #undef UPDATE_TITCSE
2831 /* Build an expression of code CODE, data type TYPE, and operands as
2832 specified. Expressions and reference nodes can be created this way.
2833 Constants, decls, types and misc nodes cannot be.
2835 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2836 enough for all extant tree codes. */
2839 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2843 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2845 t = make_node_stat (code PASS_MEM_STAT);
2852 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2854 int length = sizeof (struct tree_exp);
2855 #ifdef GATHER_STATISTICS
2856 tree_node_kind kind;
2860 #ifdef GATHER_STATISTICS
2861 switch (TREE_CODE_CLASS (code))
2863 case tcc_statement: /* an expression with side effects */
2866 case tcc_reference: /* a reference */
2874 tree_node_counts[(int) kind]++;
2875 tree_node_sizes[(int) kind] += length;
2878 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2880 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2882 memset (t, 0, sizeof (struct tree_common));
2884 TREE_SET_CODE (t, code);
2886 TREE_TYPE (t) = type;
2887 #ifdef USE_MAPPED_LOCATION
2888 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2890 SET_EXPR_LOCUS (t, NULL);
2892 TREE_COMPLEXITY (t) = 0;
2893 TREE_OPERAND (t, 0) = node;
2894 TREE_BLOCK (t) = NULL_TREE;
2895 if (node && !TYPE_P (node))
2897 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2898 TREE_READONLY (t) = TREE_READONLY (node);
2901 if (TREE_CODE_CLASS (code) == tcc_statement)
2902 TREE_SIDE_EFFECTS (t) = 1;
2906 /* All of these have side-effects, no matter what their
2908 TREE_SIDE_EFFECTS (t) = 1;
2909 TREE_READONLY (t) = 0;
2912 case MISALIGNED_INDIRECT_REF:
2913 case ALIGN_INDIRECT_REF:
2915 /* Whether a dereference is readonly has nothing to do with whether
2916 its operand is readonly. */
2917 TREE_READONLY (t) = 0;
2922 recompute_tree_invariant_for_addr_expr (t);
2926 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2927 && node && !TYPE_P (node)
2928 && TREE_CONSTANT (node))
2929 TREE_CONSTANT (t) = 1;
2930 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2931 && node && TREE_INVARIANT (node))
2932 TREE_INVARIANT (t) = 1;
2933 if (TREE_CODE_CLASS (code) == tcc_reference
2934 && node && TREE_THIS_VOLATILE (node))
2935 TREE_THIS_VOLATILE (t) = 1;
2942 #define PROCESS_ARG(N) \
2944 TREE_OPERAND (t, N) = arg##N; \
2945 if (arg##N &&!TYPE_P (arg##N)) \
2947 if (TREE_SIDE_EFFECTS (arg##N)) \
2949 if (!TREE_READONLY (arg##N)) \
2951 if (!TREE_CONSTANT (arg##N)) \
2953 if (!TREE_INVARIANT (arg##N)) \
2959 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2961 bool constant, read_only, side_effects, invariant;
2964 gcc_assert (TREE_CODE_LENGTH (code) == 2);
2966 t = make_node_stat (code PASS_MEM_STAT);
2969 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2970 result based on those same flags for the arguments. But if the
2971 arguments aren't really even `tree' expressions, we shouldn't be trying
2974 /* Expressions without side effects may be constant if their
2975 arguments are as well. */
2976 constant = (TREE_CODE_CLASS (code) == tcc_comparison
2977 || TREE_CODE_CLASS (code) == tcc_binary);
2979 side_effects = TREE_SIDE_EFFECTS (t);
2980 invariant = constant;
2985 TREE_READONLY (t) = read_only;
2986 TREE_CONSTANT (t) = constant;
2987 TREE_INVARIANT (t) = invariant;
2988 TREE_SIDE_EFFECTS (t) = side_effects;
2989 TREE_THIS_VOLATILE (t)
2990 = (TREE_CODE_CLASS (code) == tcc_reference
2991 && arg0 && TREE_THIS_VOLATILE (arg0));
2997 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2998 tree arg2 MEM_STAT_DECL)
3000 bool constant, read_only, side_effects, invariant;
3003 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3005 t = make_node_stat (code PASS_MEM_STAT);
3008 side_effects = TREE_SIDE_EFFECTS (t);
3014 if (code == CALL_EXPR && !side_effects)
3019 /* Calls have side-effects, except those to const or
3021 i = call_expr_flags (t);
3022 if (!(i & (ECF_CONST | ECF_PURE)))
3025 /* And even those have side-effects if their arguments do. */
3026 else for (node = arg1; node; node = TREE_CHAIN (node))
3027 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
3034 TREE_SIDE_EFFECTS (t) = side_effects;
3035 TREE_THIS_VOLATILE (t)
3036 = (TREE_CODE_CLASS (code) == tcc_reference
3037 && arg0 && TREE_THIS_VOLATILE (arg0));
3043 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3044 tree arg2, tree arg3 MEM_STAT_DECL)
3046 bool constant, read_only, side_effects, invariant;
3049 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3051 t = make_node_stat (code PASS_MEM_STAT);
3054 side_effects = TREE_SIDE_EFFECTS (t);
3061 TREE_SIDE_EFFECTS (t) = side_effects;
3062 TREE_THIS_VOLATILE (t)
3063 = (TREE_CODE_CLASS (code) == tcc_reference
3064 && arg0 && TREE_THIS_VOLATILE (arg0));
3070 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3071 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3073 bool constant, read_only, side_effects, invariant;
3076 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3078 t = make_node_stat (code PASS_MEM_STAT);
3081 side_effects = TREE_SIDE_EFFECTS (t);
3089 TREE_SIDE_EFFECTS (t) = side_effects;
3090 TREE_THIS_VOLATILE (t)
3091 = (TREE_CODE_CLASS (code) == tcc_reference
3092 && arg0 && TREE_THIS_VOLATILE (arg0));
3098 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3099 tree arg2, tree arg3, tree arg4, tree arg5,
3100 tree arg6 MEM_STAT_DECL)
3102 bool constant, read_only, side_effects, invariant;
3105 gcc_assert (code == TARGET_MEM_REF);
3107 t = make_node_stat (code PASS_MEM_STAT);
3110 side_effects = TREE_SIDE_EFFECTS (t);
3120 TREE_SIDE_EFFECTS (t) = side_effects;
3121 TREE_THIS_VOLATILE (t) = 0;
3126 /* Similar except don't specify the TREE_TYPE
3127 and leave the TREE_SIDE_EFFECTS as 0.
3128 It is permissible for arguments to be null,
3129 or even garbage if their values do not matter. */
3132 build_nt (enum tree_code code, ...)
3141 t = make_node (code);
3142 length = TREE_CODE_LENGTH (code);
3144 for (i = 0; i < length; i++)
3145 TREE_OPERAND (t, i) = va_arg (p, tree);
3151 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3152 We do NOT enter this node in any sort of symbol table.
3154 layout_decl is used to set up the decl's storage layout.
3155 Other slots are initialized to 0 or null pointers. */
3158 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3162 t = make_node_stat (code PASS_MEM_STAT);
3164 /* if (type == error_mark_node)
3165 type = integer_type_node; */
3166 /* That is not done, deliberately, so that having error_mark_node
3167 as the type can suppress useless errors in the use of this variable. */
3169 DECL_NAME (t) = name;
3170 TREE_TYPE (t) = type;
3172 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3174 else if (code == FUNCTION_DECL)
3175 DECL_MODE (t) = FUNCTION_MODE;
3180 /* Builds and returns function declaration with NAME and TYPE. */
3183 build_fn_decl (const char *name, tree type)
3185 tree id = get_identifier (name);
3186 tree decl = build_decl (FUNCTION_DECL, id, type);
3188 DECL_EXTERNAL (decl) = 1;
3189 TREE_PUBLIC (decl) = 1;
3190 DECL_ARTIFICIAL (decl) = 1;
3191 TREE_NOTHROW (decl) = 1;
3197 /* BLOCK nodes are used to represent the structure of binding contours
3198 and declarations, once those contours have been exited and their contents
3199 compiled. This information is used for outputting debugging info. */
3202 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3204 tree block = make_node (BLOCK);
3206 BLOCK_VARS (block) = vars;
3207 BLOCK_SUBBLOCKS (block) = subblocks;
3208 BLOCK_SUPERCONTEXT (block) = supercontext;
3209 BLOCK_CHAIN (block) = chain;
3213 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3214 /* ??? gengtype doesn't handle conditionals */
3215 static GTY(()) source_locus last_annotated_node;
3218 #ifdef USE_MAPPED_LOCATION
3221 expand_location (source_location loc)
3223 expanded_location xloc;
3224 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
3227 const struct line_map *map = linemap_lookup (&line_table, loc);
3228 xloc.file = map->to_file;
3229 xloc.line = SOURCE_LINE (map, loc);
3230 xloc.column = SOURCE_COLUMN (map, loc);
3237 /* Record the exact location where an expression or an identifier were
3241 annotate_with_file_line (tree node, const char *file, int line)
3243 /* Roughly one percent of the calls to this function are to annotate
3244 a node with the same information already attached to that node!
3245 Just return instead of wasting memory. */
3246 if (EXPR_LOCUS (node)
3247 && EXPR_LINENO (node) == line
3248 && (EXPR_FILENAME (node) == file
3249 || !strcmp (EXPR_FILENAME (node), file)))
3251 last_annotated_node = EXPR_LOCUS (node);
3255 /* In heavily macroized code (such as GCC itself) this single
3256 entry cache can reduce the number of allocations by more
3258 if (last_annotated_node
3259 && last_annotated_node->line == line
3260 && (last_annotated_node->file == file
3261 || !strcmp (last_annotated_node->file, file)))
3263 SET_EXPR_LOCUS (node, last_annotated_node);
3267 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3268 EXPR_LINENO (node) = line;
3269 EXPR_FILENAME (node) = file;
3270 last_annotated_node = EXPR_LOCUS (node);
3274 annotate_with_locus (tree node, location_t locus)
3276 annotate_with_file_line (node, locus.file, locus.line);
3280 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3284 build_decl_attribute_variant (tree ddecl, tree attribute)
3286 DECL_ATTRIBUTES (ddecl) = attribute;
3290 /* Borrowed from hashtab.c iterative_hash implementation. */
3291 #define mix(a,b,c) \
3293 a -= b; a -= c; a ^= (c>>13); \
3294 b -= c; b -= a; b ^= (a<< 8); \
3295 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3296 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3297 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3298 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3299 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3300 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3301 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3305 /* Produce good hash value combining VAL and VAL2. */
3306 static inline hashval_t
3307 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3309 /* the golden ratio; an arbitrary value. */
3310 hashval_t a = 0x9e3779b9;
3316 /* Produce good hash value combining PTR and VAL2. */
3317 static inline hashval_t
3318 iterative_hash_pointer (void *ptr, hashval_t val2)
3320 if (sizeof (ptr) == sizeof (hashval_t))
3321 return iterative_hash_hashval_t ((size_t) ptr, val2);
3324 hashval_t a = (hashval_t) (size_t) ptr;
3325 /* Avoid warnings about shifting of more than the width of the type on
3326 hosts that won't execute this path. */
3328 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3334 /* Produce good hash value combining VAL and VAL2. */
3335 static inline hashval_t
3336 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3338 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3339 return iterative_hash_hashval_t (val, val2);
3342 hashval_t a = (hashval_t) val;
3343 /* Avoid warnings about shifting of more than the width of the type on
3344 hosts that won't execute this path. */
3346 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3348 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3350 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3351 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3358 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3361 Record such modified types already made so we don't make duplicates. */
3364 build_type_attribute_variant (tree ttype, tree attribute)
3366 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3368 hashval_t hashcode = 0;
3370 enum tree_code code = TREE_CODE (ttype);
3372 ntype = copy_node (ttype);
3374 TYPE_POINTER_TO (ntype) = 0;
3375 TYPE_REFERENCE_TO (ntype) = 0;
3376 TYPE_ATTRIBUTES (ntype) = attribute;
3378 /* Create a new main variant of TYPE. */
3379 TYPE_MAIN_VARIANT (ntype) = ntype;
3380 TYPE_NEXT_VARIANT (ntype) = 0;
3381 set_type_quals (ntype, TYPE_UNQUALIFIED);
3383 hashcode = iterative_hash_object (code, hashcode);
3384 if (TREE_TYPE (ntype))
3385 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3387 hashcode = attribute_hash_list (attribute, hashcode);
3389 switch (TREE_CODE (ntype))
3392 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3395 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3399 hashcode = iterative_hash_object
3400 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3401 hashcode = iterative_hash_object
3402 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3406 unsigned int precision = TYPE_PRECISION (ntype);
3407 hashcode = iterative_hash_object (precision, hashcode);
3414 ntype = type_hash_canon (hashcode, ntype);
3415 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
3422 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3425 We try both `text' and `__text__', ATTR may be either one. */
3426 /* ??? It might be a reasonable simplification to require ATTR to be only
3427 `text'. One might then also require attribute lists to be stored in
3428 their canonicalized form. */
3431 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3436 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3439 p = IDENTIFIER_POINTER (ident);
3440 ident_len = IDENTIFIER_LENGTH (ident);
3442 if (ident_len == attr_len
3443 && strcmp (attr, p) == 0)
3446 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3449 gcc_assert (attr[1] == '_');
3450 gcc_assert (attr[attr_len - 2] == '_');
3451 gcc_assert (attr[attr_len - 1] == '_');
3452 gcc_assert (attr[1] == '_');
3453 if (ident_len == attr_len - 4
3454 && strncmp (attr + 2, p, attr_len - 4) == 0)
3459 if (ident_len == attr_len + 4
3460 && p[0] == '_' && p[1] == '_'
3461 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3462 && strncmp (attr, p + 2, attr_len) == 0)
3469 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3472 We try both `text' and `__text__', ATTR may be either one. */
3475 is_attribute_p (const char *attr, tree ident)
3477 return is_attribute_with_length_p (attr, strlen (attr), ident);
3480 /* Given an attribute name and a list of attributes, return a pointer to the
3481 attribute's list element if the attribute is part of the list, or NULL_TREE
3482 if not found. If the attribute appears more than once, this only
3483 returns the first occurrence; the TREE_CHAIN of the return value should
3484 be passed back in if further occurrences are wanted. */
3487 lookup_attribute (const char *attr_name, tree list)
3490 size_t attr_len = strlen (attr_name);
3492 for (l = list; l; l = TREE_CHAIN (l))
3494 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3495 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3502 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3506 remove_attribute (const char *attr_name, tree list)
3509 size_t attr_len = strlen (attr_name);
3511 for (p = &list; *p; )
3514 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3515 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3516 *p = TREE_CHAIN (l);
3518 p = &TREE_CHAIN (l);
3524 /* Return an attribute list that is the union of a1 and a2. */
3527 merge_attributes (tree a1, tree a2)
3531 /* Either one unset? Take the set one. */
3533 if ((attributes = a1) == 0)
3536 /* One that completely contains the other? Take it. */
3538 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3540 if (attribute_list_contained (a2, a1))
3544 /* Pick the longest list, and hang on the other list. */
3546 if (list_length (a1) < list_length (a2))
3547 attributes = a2, a2 = a1;
3549 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3552 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3555 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3558 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
3563 a1 = copy_node (a2);
3564 TREE_CHAIN (a1) = attributes;
3573 /* Given types T1 and T2, merge their attributes and return
3577 merge_type_attributes (tree t1, tree t2)
3579 return merge_attributes (TYPE_ATTRIBUTES (t1),
3580 TYPE_ATTRIBUTES (t2));
3583 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3587 merge_decl_attributes (tree olddecl, tree newdecl)
3589 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3590 DECL_ATTRIBUTES (newdecl));
3593 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3595 /* Specialization of merge_decl_attributes for various Windows targets.
3597 This handles the following situation:
3599 __declspec (dllimport) int foo;
3602 The second instance of `foo' nullifies the dllimport. */
3605 merge_dllimport_decl_attributes (tree old, tree new)
3608 int delete_dllimport_p = 1;
3610 /* What we need to do here is remove from `old' dllimport if it doesn't
3611 appear in `new'. dllimport behaves like extern: if a declaration is
3612 marked dllimport and a definition appears later, then the object
3613 is not dllimport'd. We also remove a `new' dllimport if the old list
3614 contains dllexport: dllexport always overrides dllimport, regardless
3615 of the order of declaration. */
3616 if (!VAR_OR_FUNCTION_DECL_P (new))
3617 delete_dllimport_p = 0;
3618 else if (DECL_DLLIMPORT_P (new)
3619 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3621 DECL_DLLIMPORT_P (new) = 0;
3622 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3623 "dllimport ignored", new);
3625 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3627 /* Warn about overriding a symbol that has already been used. eg:
3628 extern int __attribute__ ((dllimport)) foo;
3629 int* bar () {return &foo;}
3632 if (TREE_USED (old))
3634 warning (0, "%q+D redeclared without dllimport attribute "
3635 "after being referenced with dll linkage", new);
3636 /* If we have used a variable's address with dllimport linkage,
3637 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3638 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3640 We still remove the attribute so that assembler code refers
3641 to '&foo rather than '_imp__foo'. */
3642 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3643 DECL_DLLIMPORT_P (new) = 1;
3646 /* Let an inline definition silently override the external reference,
3647 but otherwise warn about attribute inconsistency. */
3648 else if (TREE_CODE (new) == VAR_DECL
3649 || !DECL_DECLARED_INLINE_P (new))
3650 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3651 "previous dllimport ignored", new);
3654 delete_dllimport_p = 0;
3656 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3658 if (delete_dllimport_p)
3661 const size_t attr_len = strlen ("dllimport");
3663 /* Scan the list for dllimport and delete it. */
3664 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3666 if (is_attribute_with_length_p ("dllimport", attr_len,
3669 if (prev == NULL_TREE)
3672 TREE_CHAIN (prev) = TREE_CHAIN (t);
3681 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3682 struct attribute_spec.handler. */
3685 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3690 /* These attributes may apply to structure and union types being created,
3691 but otherwise should pass to the declaration involved. */
3694 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3695 | (int) ATTR_FLAG_ARRAY_NEXT))
3697 *no_add_attrs = true;
3698 return tree_cons (name, args, NULL_TREE);
3700 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3702 warning (OPT_Wattributes, "%qs attribute ignored",
3703 IDENTIFIER_POINTER (name));
3704 *no_add_attrs = true;
3710 /* Report error on dllimport ambiguities seen now before they cause
3712 if (is_attribute_p ("dllimport", name))
3714 /* Honor any target-specific overrides. */
3715 if (!targetm.valid_dllimport_attribute_p (node))
3716 *no_add_attrs = true;
3718 else if (TREE_CODE (node) == FUNCTION_DECL
3719 && DECL_DECLARED_INLINE_P (node))
3721 warning (OPT_Wattributes, "inline function %q+D declared as "
3722 " dllimport: attribute ignored", node);
3723 *no_add_attrs = true;
3725 /* Like MS, treat definition of dllimported variables and
3726 non-inlined functions on declaration as syntax errors. */
3727 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
3729 error ("function %q+D definition is marked dllimport", node);
3730 *no_add_attrs = true;
3733 else if (TREE_CODE (node) == VAR_DECL)
3735 if (DECL_INITIAL (node))
3737 error ("variable %q+D definition is marked dllimport",
3739 *no_add_attrs = true;
3742 /* `extern' needn't be specified with dllimport.
3743 Specify `extern' now and hope for the best. Sigh. */
3744 DECL_EXTERNAL (node) = 1;
3745 /* Also, implicitly give dllimport'd variables declared within
3746 a function global scope, unless declared static. */
3747 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3748 TREE_PUBLIC (node) = 1;
3751 if (*no_add_attrs == false)
3752 DECL_DLLIMPORT_P (node) = 1;
3755 /* Report error if symbol is not accessible at global scope. */
3756 if (!TREE_PUBLIC (node)
3757 && (TREE_CODE (node) == VAR_DECL
3758 || TREE_CODE (node) == FUNCTION_DECL))
3760 error ("external linkage required for symbol %q+D because of "
3761 "%qs attribute", node, IDENTIFIER_POINTER (name));
3762 *no_add_attrs = true;
3768 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3770 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3771 of the various TYPE_QUAL values. */
3774 set_type_quals (tree type, int type_quals)
3776 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3777 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3778 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3781 /* Returns true iff cand is equivalent to base with type_quals. */
3784 check_qualified_type (tree cand, tree base, int type_quals)
3786 return (TYPE_QUALS (cand) == type_quals
3787 && TYPE_NAME (cand) == TYPE_NAME (base)
3788 /* Apparently this is needed for Objective-C. */
3789 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3790 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3791 TYPE_ATTRIBUTES (base)));
3794 /* Return a version of the TYPE, qualified as indicated by the
3795 TYPE_QUALS, if one exists. If no qualified version exists yet,
3796 return NULL_TREE. */
3799 get_qualified_type (tree type, int type_quals)
3803 if (TYPE_QUALS (type) == type_quals)
3806 /* Search the chain of variants to see if there is already one there just
3807 like the one we need to have. If so, use that existing one. We must
3808 preserve the TYPE_NAME, since there is code that depends on this. */
3809 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3810 if (check_qualified_type (t, type, type_quals))
3816 /* Like get_qualified_type, but creates the type if it does not
3817 exist. This function never returns NULL_TREE. */
3820 build_qualified_type (tree type, int type_quals)
3824 /* See if we already have the appropriate qualified variant. */
3825 t = get_qualified_type (type, type_quals);
3827 /* If not, build it. */
3830 t = build_variant_type_copy (type);
3831 set_type_quals (t, type_quals);
3837 /* Create a new distinct copy of TYPE. The new type is made its own
3841 build_distinct_type_copy (tree type)
3843 tree t = copy_node (type);
3845 TYPE_POINTER_TO (t) = 0;
3846 TYPE_REFERENCE_TO (t) = 0;
3848 /* Make it its own variant. */
3849 TYPE_MAIN_VARIANT (t) = t;
3850 TYPE_NEXT_VARIANT (t) = 0;
3855 /* Create a new variant of TYPE, equivalent but distinct.
3856 This is so the caller can modify it. */
3859 build_variant_type_copy (tree type)
3861 tree t, m = TYPE_MAIN_VARIANT (type);
3863 t = build_distinct_type_copy (type);
3865 /* Add the new type to the chain of variants of TYPE. */
3866 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3867 TYPE_NEXT_VARIANT (m) = t;
3868 TYPE_MAIN_VARIANT (t) = m;
3873 /* Return true if the from tree in both tree maps are equal. */
3876 tree_map_eq (const void *va, const void *vb)
3878 const struct tree_map *a = va, *b = vb;
3879 return (a->from == b->from);
3882 /* Hash a from tree in a tree_map. */
3885 tree_map_hash (const void *item)
3887 return (((const struct tree_map *) item)->hash);
3890 /* Return true if this tree map structure is marked for garbage collection
3891 purposes. We simply return true if the from tree is marked, so that this
3892 structure goes away when the from tree goes away. */
3895 tree_map_marked_p (const void *p)
3897 tree from = ((struct tree_map *) p)->from;
3899 return ggc_marked_p (from);
3902 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
3905 tree_int_map_eq (const void *va, const void *vb)
3907 const struct tree_int_map *a = va, *b = vb;
3908 return (a->from == b->from);
3911 /* Hash a from tree in the tree_int_map * ITEM. */
3914 tree_int_map_hash (const void *item)
3916 return htab_hash_pointer (((const struct tree_int_map *)item)->from);
3919 /* Return true if this tree int map structure is marked for garbage collection
3920 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
3921 structure goes away when the from tree goes away. */
3924 tree_int_map_marked_p (const void *p)
3926 tree from = ((struct tree_int_map *) p)->from;
3928 return ggc_marked_p (from);
3930 /* Lookup an init priority for FROM, and return it if we find one. */
3933 decl_init_priority_lookup (tree from)
3935 struct tree_int_map *h, in;
3938 h = htab_find_with_hash (init_priority_for_decl,
3939 &in, htab_hash_pointer (from));
3945 /* Insert a mapping FROM->TO in the init priority hashtable. */
3948 decl_init_priority_insert (tree from, unsigned short to)
3950 struct tree_int_map *h;
3953 h = ggc_alloc (sizeof (struct tree_int_map));
3956 loc = htab_find_slot_with_hash (init_priority_for_decl, h,
3957 htab_hash_pointer (from), INSERT);
3958 *(struct tree_int_map **) loc = h;
3961 /* Look up a restrict qualified base decl for FROM. */
3964 decl_restrict_base_lookup (tree from)
3970 h = htab_find_with_hash (restrict_base_for_decl, &in,
3971 htab_hash_pointer (from));
3972 return h ? h->to : NULL_TREE;
3975 /* Record the restrict qualified base TO for FROM. */
3978 decl_restrict_base_insert (tree from, tree to)
3983 h = ggc_alloc (sizeof (struct tree_map));
3984 h->hash = htab_hash_pointer (from);
3987 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
3988 *(struct tree_map **) loc = h;
3991 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
3994 print_debug_expr_statistics (void)
3996 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
3997 (long) htab_size (debug_expr_for_decl),
3998 (long) htab_elements (debug_expr_for_decl),
3999 htab_collisions (debug_expr_for_decl));
4002 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4005 print_value_expr_statistics (void)
4007 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4008 (long) htab_size (value_expr_for_decl),
4009 (long) htab_elements (value_expr_for_decl),
4010 htab_collisions (value_expr_for_decl));
4013 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4014 don't print anything if the table is empty. */
4017 print_restrict_base_statistics (void)
4019 if (htab_elements (restrict_base_for_decl) != 0)
4021 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4022 (long) htab_size (restrict_base_for_decl),
4023 (long) htab_elements (restrict_base_for_decl),
4024 htab_collisions (restrict_base_for_decl));
4027 /* Lookup a debug expression for FROM, and return it if we find one. */
4030 decl_debug_expr_lookup (tree from)
4032 struct tree_map *h, in;
4035 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4041 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4044 decl_debug_expr_insert (tree from, tree to)
4049 h = ggc_alloc (sizeof (struct tree_map));
4050 h->hash = htab_hash_pointer (from);
4053 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4054 *(struct tree_map **) loc = h;
4057 /* Lookup a value expression for FROM, and return it if we find one. */
4060 decl_value_expr_lookup (tree from)
4062 struct tree_map *h, in;
4065 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4071 /* Insert a mapping FROM->TO in the value expression hashtable. */
4074 decl_value_expr_insert (tree from, tree to)
4079 h = ggc_alloc (sizeof (struct tree_map));
4080 h->hash = htab_hash_pointer (from);
4083 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4084 *(struct tree_map **) loc = h;
4087 /* Hashing of types so that we don't make duplicates.
4088 The entry point is `type_hash_canon'. */
4090 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4091 with types in the TREE_VALUE slots), by adding the hash codes
4092 of the individual types. */
4095 type_hash_list (tree list, hashval_t hashcode)
4099 for (tail = list; tail; tail = TREE_CHAIN (tail))
4100 if (TREE_VALUE (tail) != error_mark_node)
4101 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4107 /* These are the Hashtable callback functions. */
4109 /* Returns true iff the types are equivalent. */
4112 type_hash_eq (const void *va, const void *vb)
4114 const struct type_hash *a = va, *b = vb;
4116 /* First test the things that are the same for all types. */
4117 if (a->hash != b->hash
4118 || TREE_CODE (a->type) != TREE_CODE (b->type)
4119 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4120 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4121 TYPE_ATTRIBUTES (b->type))
4122 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4123 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4126 switch (TREE_CODE (a->type))
4131 case REFERENCE_TYPE:
4135 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4138 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4139 && !(TYPE_VALUES (a->type)
4140 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4141 && TYPE_VALUES (b->type)
4142 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4143 && type_list_equal (TYPE_VALUES (a->type),
4144 TYPE_VALUES (b->type))))
4147 /* ... fall through ... */
4152 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4153 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4154 TYPE_MAX_VALUE (b->type)))
4155 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4156 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4157 TYPE_MIN_VALUE (b->type))));
4160 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4163 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4164 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4165 || (TYPE_ARG_TYPES (a->type)
4166 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4167 && TYPE_ARG_TYPES (b->type)
4168 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4169 && type_list_equal (TYPE_ARG_TYPES (a->type),
4170 TYPE_ARG_TYPES (b->type)))));
4173 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4177 case QUAL_UNION_TYPE:
4178 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4179 || (TYPE_FIELDS (a->type)
4180 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4181 && TYPE_FIELDS (b->type)
4182 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4183 && type_list_equal (TYPE_FIELDS (a->type),
4184 TYPE_FIELDS (b->type))));
4187 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4188 || (TYPE_ARG_TYPES (a->type)
4189 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4190 && TYPE_ARG_TYPES (b->type)
4191 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4192 && type_list_equal (TYPE_ARG_TYPES (a->type),
4193 TYPE_ARG_TYPES (b->type))));
4200 /* Return the cached hash value. */
4203 type_hash_hash (const void *item)
4205 return ((const struct type_hash *) item)->hash;
4208 /* Look in the type hash table for a type isomorphic to TYPE.
4209 If one is found, return it. Otherwise return 0. */
4212 type_hash_lookup (hashval_t hashcode, tree type)
4214 struct type_hash *h, in;
4216 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4217 must call that routine before comparing TYPE_ALIGNs. */
4223 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4229 /* Add an entry to the type-hash-table
4230 for a type TYPE whose hash code is HASHCODE. */
4233 type_hash_add (hashval_t hashcode, tree type)
4235 struct type_hash *h;
4238 h = ggc_alloc (sizeof (struct type_hash));
4241 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4242 *(struct type_hash **) loc = h;
4245 /* Given TYPE, and HASHCODE its hash code, return the canonical
4246 object for an identical type if one already exists.
4247 Otherwise, return TYPE, and record it as the canonical object.
4249 To use this function, first create a type of the sort you want.
4250 Then compute its hash code from the fields of the type that
4251 make it different from other similar types.
4252 Then call this function and use the value. */
4255 type_hash_canon (unsigned int hashcode, tree type)
4259 /* The hash table only contains main variants, so ensure that's what we're
4261 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4263 if (!lang_hooks.types.hash_types)
4266 /* See if the type is in the hash table already. If so, return it.
4267 Otherwise, add the type. */
4268 t1 = type_hash_lookup (hashcode, type);
4271 #ifdef GATHER_STATISTICS
4272 tree_node_counts[(int) t_kind]--;
4273 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4279 type_hash_add (hashcode, type);
4284 /* See if the data pointed to by the type hash table is marked. We consider
4285 it marked if the type is marked or if a debug type number or symbol
4286 table entry has been made for the type. This reduces the amount of
4287 debugging output and eliminates that dependency of the debug output on
4288 the number of garbage collections. */
4291 type_hash_marked_p (const void *p)
4293 tree type = ((struct type_hash *) p)->type;
4295 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4299 print_type_hash_statistics (void)
4301 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4302 (long) htab_size (type_hash_table),
4303 (long) htab_elements (type_hash_table),
4304 htab_collisions (type_hash_table));
4307 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4308 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4309 by adding the hash codes of the individual attributes. */
4312 attribute_hash_list (tree list, hashval_t hashcode)
4316 for (tail = list; tail; tail = TREE_CHAIN (tail))
4317 /* ??? Do we want to add in TREE_VALUE too? */
4318 hashcode = iterative_hash_object
4319 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4323 /* Given two lists of attributes, return true if list l2 is
4324 equivalent to l1. */
4327 attribute_list_equal (tree l1, tree l2)
4329 return attribute_list_contained (l1, l2)
4330 && attribute_list_contained (l2, l1);
4333 /* Given two lists of attributes, return true if list L2 is
4334 completely contained within L1. */
4335 /* ??? This would be faster if attribute names were stored in a canonicalized
4336 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4337 must be used to show these elements are equivalent (which they are). */
4338 /* ??? It's not clear that attributes with arguments will always be handled
4342 attribute_list_contained (tree l1, tree l2)
4346 /* First check the obvious, maybe the lists are identical. */
4350 /* Maybe the lists are similar. */
4351 for (t1 = l1, t2 = l2;
4353 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4354 && TREE_VALUE (t1) == TREE_VALUE (t2);
4355 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4357 /* Maybe the lists are equal. */
4358 if (t1 == 0 && t2 == 0)
4361 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4364 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4366 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4369 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4376 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
4383 /* Given two lists of types
4384 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4385 return 1 if the lists contain the same types in the same order.
4386 Also, the TREE_PURPOSEs must match. */
4389 type_list_equal (tree l1, tree l2)
4393 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4394 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4395 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4396 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4397 && (TREE_TYPE (TREE_PURPOSE (t1))
4398 == TREE_TYPE (TREE_PURPOSE (t2))))))
4404 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4405 given by TYPE. If the argument list accepts variable arguments,
4406 then this function counts only the ordinary arguments. */
4409 type_num_arguments (tree type)
4414 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4415 /* If the function does not take a variable number of arguments,
4416 the last element in the list will have type `void'. */
4417 if (VOID_TYPE_P (TREE_VALUE (t)))
4425 /* Nonzero if integer constants T1 and T2
4426 represent the same constant value. */
4429 tree_int_cst_equal (tree t1, tree t2)
4434 if (t1 == 0 || t2 == 0)
4437 if (TREE_CODE (t1) == INTEGER_CST
4438 && TREE_CODE (t2) == INTEGER_CST
4439 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4440 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4446 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4447 The precise way of comparison depends on their data type. */
4450 tree_int_cst_lt (tree t1, tree t2)
4455 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4457 int t1_sgn = tree_int_cst_sgn (t1);
4458 int t2_sgn = tree_int_cst_sgn (t2);
4460 if (t1_sgn < t2_sgn)
4462 else if (t1_sgn > t2_sgn)
4464 /* Otherwise, both are non-negative, so we compare them as
4465 unsigned just in case one of them would overflow a signed
4468 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4469 return INT_CST_LT (t1, t2);
4471 return INT_CST_LT_UNSIGNED (t1, t2);
4474 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4477 tree_int_cst_compare (tree t1, tree t2)
4479 if (tree_int_cst_lt (t1, t2))
4481 else if (tree_int_cst_lt (t2, t1))
4487 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4488 the host. If POS is zero, the value can be represented in a single
4489 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4490 be represented in a single unsigned HOST_WIDE_INT. */
4493 host_integerp (tree t, int pos)
4495 return (TREE_CODE (t) == INTEGER_CST
4496 && ((TREE_INT_CST_HIGH (t) == 0
4497 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4498 || (! pos && TREE_INT_CST_HIGH (t) == -1
4499 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4500 && !TYPE_UNSIGNED (TREE_TYPE (t)))
4501 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4504 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4505 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4506 be non-negative. We must be able to satisfy the above conditions. */
4509 tree_low_cst (tree t, int pos)
4511 gcc_assert (host_integerp (t, pos));
4512 return TREE_INT_CST_LOW (t);
4515 /* Return the most significant bit of the integer constant T. */
4518 tree_int_cst_msb (tree t)
4522 unsigned HOST_WIDE_INT l;
4524 /* Note that using TYPE_PRECISION here is wrong. We care about the
4525 actual bits, not the (arbitrary) range of the type. */
4526 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4527 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4528 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4529 return (l & 1) == 1;
4532 /* Return an indication of the sign of the integer constant T.
4533 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4534 Note that -1 will never be returned if T's type is unsigned. */
4537 tree_int_cst_sgn (tree t)
4539 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4541 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4543 else if (TREE_INT_CST_HIGH (t) < 0)
4549 /* Compare two constructor-element-type constants. Return 1 if the lists
4550 are known to be equal; otherwise return 0. */
4553 simple_cst_list_equal (tree l1, tree l2)
4555 while (l1 != NULL_TREE && l2 != NULL_TREE)
4557 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4560 l1 = TREE_CHAIN (l1);
4561 l2 = TREE_CHAIN (l2);
4567 /* Return truthvalue of whether T1 is the same tree structure as T2.
4568 Return 1 if they are the same.
4569 Return 0 if they are understandably different.
4570 Return -1 if either contains tree structure not understood by
4574 simple_cst_equal (tree t1, tree t2)
4576 enum tree_code code1, code2;
4582 if (t1 == 0 || t2 == 0)
4585 code1 = TREE_CODE (t1);
4586 code2 = TREE_CODE (t2);
4588 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4590 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4591 || code2 == NON_LVALUE_EXPR)
4592 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4594 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4597 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4598 || code2 == NON_LVALUE_EXPR)
4599 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4607 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4608 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4611 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4614 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4615 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4616 TREE_STRING_LENGTH (t1)));
4620 unsigned HOST_WIDE_INT idx;
4621 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4622 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4624 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4627 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4628 /* ??? Should we handle also fields here? */
4629 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4630 VEC_index (constructor_elt, v2, idx)->value))
4636 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4639 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4643 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4646 /* Special case: if either target is an unallocated VAR_DECL,
4647 it means that it's going to be unified with whatever the
4648 TARGET_EXPR is really supposed to initialize, so treat it
4649 as being equivalent to anything. */
4650 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4651 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4652 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
4653 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4654 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4655 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
4658 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4663 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4665 case WITH_CLEANUP_EXPR:
4666 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4670 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
4673 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4674 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4688 /* This general rule works for most tree codes. All exceptions should be
4689 handled above. If this is a language-specific tree code, we can't
4690 trust what might be in the operand, so say we don't know
4692 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4695 switch (TREE_CODE_CLASS (code1))
4699 case tcc_comparison:
4700 case tcc_expression:
4704 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
4706 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4718 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4719 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4720 than U, respectively. */
4723 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
4725 if (tree_int_cst_sgn (t) < 0)
4727 else if (TREE_INT_CST_HIGH (t) != 0)
4729 else if (TREE_INT_CST_LOW (t) == u)
4731 else if (TREE_INT_CST_LOW (t) < u)
4737 /* Return true if CODE represents an associative tree code. Otherwise
4740 associative_tree_code (enum tree_code code)
4759 /* Return true if CODE represents a commutative tree code. Otherwise
4762 commutative_tree_code (enum tree_code code)
4775 case UNORDERED_EXPR:
4779 case TRUTH_AND_EXPR:
4780 case TRUTH_XOR_EXPR:
4790 /* Generate a hash value for an expression. This can be used iteratively
4791 by passing a previous result as the "val" argument.
4793 This function is intended to produce the same hash for expressions which
4794 would compare equal using operand_equal_p. */
4797 iterative_hash_expr (tree t, hashval_t val)
4800 enum tree_code code;
4804 return iterative_hash_pointer (t, val);
4806 code = TREE_CODE (t);
4810 /* Alas, constants aren't shared, so we can't rely on pointer
4813 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
4814 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
4817 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
4819 return iterative_hash_hashval_t (val2, val);
4822 return iterative_hash (TREE_STRING_POINTER (t),
4823 TREE_STRING_LENGTH (t), val);
4825 val = iterative_hash_expr (TREE_REALPART (t), val);
4826 return iterative_hash_expr (TREE_IMAGPART (t), val);
4828 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
4832 /* we can just compare by pointer. */
4833 return iterative_hash_pointer (t, val);
4836 /* A list of expressions, for a CALL_EXPR or as the elements of a
4838 for (; t; t = TREE_CHAIN (t))
4839 val = iterative_hash_expr (TREE_VALUE (t), val);
4843 unsigned HOST_WIDE_INT idx;
4845 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
4847 val = iterative_hash_expr (field, val);
4848 val = iterative_hash_expr (value, val);
4853 /* When referring to a built-in FUNCTION_DECL, use the
4854 __builtin__ form. Otherwise nodes that compare equal
4855 according to operand_equal_p might get different
4857 if (DECL_BUILT_IN (t))
4859 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
4863 /* else FALL THROUGH */
4865 class = TREE_CODE_CLASS (code);
4867 if (class == tcc_declaration)
4869 /* DECL's have a unique ID */
4870 val = iterative_hash_host_wide_int (DECL_UID (t), val);
4874 gcc_assert (IS_EXPR_CODE_CLASS (class));
4876 val = iterative_hash_object (code, val);
4878 /* Don't hash the type, that can lead to having nodes which
4879 compare equal according to operand_equal_p, but which
4880 have different hash codes. */
4881 if (code == NOP_EXPR
4882 || code == CONVERT_EXPR
4883 || code == NON_LVALUE_EXPR)
4885 /* Make sure to include signness in the hash computation. */
4886 val += TYPE_UNSIGNED (TREE_TYPE (t));
4887 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
4890 else if (commutative_tree_code (code))
4892 /* It's a commutative expression. We want to hash it the same
4893 however it appears. We do this by first hashing both operands
4894 and then rehashing based on the order of their independent
4896 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
4897 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
4901 t = one, one = two, two = t;
4903 val = iterative_hash_hashval_t (one, val);
4904 val = iterative_hash_hashval_t (two, val);
4907 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i)
4908 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
4915 /* Constructors for pointer, array and function types.
4916 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4917 constructed by language-dependent code, not here.) */
4919 /* Construct, lay out and return the type of pointers to TO_TYPE with
4920 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4921 reference all of memory. If such a type has already been
4922 constructed, reuse it. */
4925 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
4930 if (to_type == error_mark_node)
4931 return error_mark_node;
4933 /* In some cases, languages will have things that aren't a POINTER_TYPE
4934 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4935 In that case, return that type without regard to the rest of our
4938 ??? This is a kludge, but consistent with the way this function has
4939 always operated and there doesn't seem to be a good way to avoid this
4941 if (TYPE_POINTER_TO (to_type) != 0
4942 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4943 return TYPE_POINTER_TO (to_type);
4945 /* First, if we already have a type for pointers to TO_TYPE and it's
4946 the proper mode, use it. */
4947 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4948 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4951 t = make_node (POINTER_TYPE);
4953 TREE_TYPE (t) = to_type;
4954 TYPE_MODE (t) = mode;
4955 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4956 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
4957 TYPE_POINTER_TO (to_type) = t;
4959 /* Lay out the type. This function has many callers that are concerned
4960 with expression-construction, and this simplifies them all. */
4966 /* By default build pointers in ptr_mode. */
4969 build_pointer_type (tree to_type)
4971 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4974 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4977 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4982 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4983 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4984 In that case, return that type without regard to the rest of our
4987 ??? This is a kludge, but consistent with the way this function has
4988 always operated and there doesn't seem to be a good way to avoid this
4990 if (TYPE_REFERENCE_TO (to_type) != 0
4991 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4992 return TYPE_REFERENCE_TO (to_type);
4994 /* First, if we already have a type for pointers to TO_TYPE and it's
4995 the proper mode, use it. */
4996 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4997 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5000 t = make_node (REFERENCE_TYPE);
5002 TREE_TYPE (t) = to_type;
5003 TYPE_MODE (t) = mode;
5004 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5005 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5006 TYPE_REFERENCE_TO (to_type) = t;
5014 /* Build the node for the type of references-to-TO_TYPE by default
5018 build_reference_type (tree to_type)
5020 return build_reference_type_for_mode (to_type, ptr_mode, false);
5023 /* Build a type that is compatible with t but has no cv quals anywhere
5026 const char *const *const * -> char ***. */
5029 build_type_no_quals (tree t)
5031 switch (TREE_CODE (t))
5034 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5036 TYPE_REF_CAN_ALIAS_ALL (t));
5037 case REFERENCE_TYPE:
5039 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5041 TYPE_REF_CAN_ALIAS_ALL (t));
5043 return TYPE_MAIN_VARIANT (t);
5047 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5048 MAXVAL should be the maximum value in the domain
5049 (one less than the length of the array).
5051 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5052 We don't enforce this limit, that is up to caller (e.g. language front end).
5053 The limit exists because the result is a signed type and we don't handle
5054 sizes that use more than one HOST_WIDE_INT. */
5057 build_index_type (tree maxval)
5059 tree itype = make_node (INTEGER_TYPE);
5061 TREE_TYPE (itype) = sizetype;
5062 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5063 TYPE_MIN_VALUE (itype) = size_zero_node;
5064 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5065 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5066 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5067 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5068 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5069 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5071 if (host_integerp (maxval, 1))
5072 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5077 /* Builds a signed or unsigned integer type of precision PRECISION.
5078 Used for C bitfields whose precision does not match that of
5079 built-in target types. */
5081 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5084 tree itype = make_node (INTEGER_TYPE);
5086 TYPE_PRECISION (itype) = precision;
5089 fixup_unsigned_type (itype);
5091 fixup_signed_type (itype);
5093 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5094 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5099 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5100 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5101 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5104 build_range_type (tree type, tree lowval, tree highval)
5106 tree itype = make_node (INTEGER_TYPE);
5108 TREE_TYPE (itype) = type;
5109 if (type == NULL_TREE)
5112 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5113 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5115 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5116 TYPE_MODE (itype) = TYPE_MODE (type);
5117 TYPE_SIZE (itype) = TYPE_SIZE (type);
5118 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5119 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5120 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5122 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5123 return type_hash_canon (tree_low_cst (highval, 0)
5124 - tree_low_cst (lowval, 0),
5130 /* Just like build_index_type, but takes lowval and highval instead
5131 of just highval (maxval). */
5134 build_index_2_type (tree lowval, tree highval)
5136 return build_range_type (sizetype, lowval, highval);
5139 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5140 and number of elements specified by the range of values of INDEX_TYPE.
5141 If such a type has already been constructed, reuse it. */
5144 build_array_type (tree elt_type, tree index_type)
5147 hashval_t hashcode = 0;
5149 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5151 error ("arrays of functions are not meaningful");
5152 elt_type = integer_type_node;
5155 t = make_node (ARRAY_TYPE);
5156 TREE_TYPE (t) = elt_type;
5157 TYPE_DOMAIN (t) = index_type;
5159 if (index_type == 0)
5162 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5163 t = type_hash_canon (hashcode, t);
5169 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5170 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5171 t = type_hash_canon (hashcode, t);
5173 if (!COMPLETE_TYPE_P (t))
5178 /* Return the TYPE of the elements comprising
5179 the innermost dimension of ARRAY. */
5182 get_inner_array_type (tree array)
5184 tree type = TREE_TYPE (array);
5186 while (TREE_CODE (type) == ARRAY_TYPE)
5187 type = TREE_TYPE (type);
5192 /* Construct, lay out and return
5193 the type of functions returning type VALUE_TYPE
5194 given arguments of types ARG_TYPES.
5195 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5196 are data type nodes for the arguments of the function.
5197 If such a type has already been constructed, reuse it. */
5200 build_function_type (tree value_type, tree arg_types)
5203 hashval_t hashcode = 0;
5205 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5207 error ("function return type cannot be function");
5208 value_type = integer_type_node;
5211 /* Make a node of the sort we want. */
5212 t = make_node (FUNCTION_TYPE);
5213 TREE_TYPE (t) = value_type;
5214 TYPE_ARG_TYPES (t) = arg_types;
5216 /* If we already have such a type, use the old one. */
5217 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5218 hashcode = type_hash_list (arg_types, hashcode);
5219 t = type_hash_canon (hashcode, t);
5221 if (!COMPLETE_TYPE_P (t))
5226 /* Build a function type. The RETURN_TYPE is the type returned by the
5227 function. If additional arguments are provided, they are
5228 additional argument types. The list of argument types must always
5229 be terminated by NULL_TREE. */
5232 build_function_type_list (tree return_type, ...)
5237 va_start (p, return_type);
5239 t = va_arg (p, tree);
5240 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5241 args = tree_cons (NULL_TREE, t, args);
5243 if (args == NULL_TREE)
5244 args = void_list_node;
5248 args = nreverse (args);
5249 TREE_CHAIN (last) = void_list_node;
5251 args = build_function_type (return_type, args);
5257 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5258 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5259 for the method. An implicit additional parameter (of type
5260 pointer-to-BASETYPE) is added to the ARGTYPES. */
5263 build_method_type_directly (tree basetype,
5271 /* Make a node of the sort we want. */
5272 t = make_node (METHOD_TYPE);
5274 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5275 TREE_TYPE (t) = rettype;
5276 ptype = build_pointer_type (basetype);
5278 /* The actual arglist for this function includes a "hidden" argument
5279 which is "this". Put it into the list of argument types. */
5280 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5281 TYPE_ARG_TYPES (t) = argtypes;
5283 /* If we already have such a type, use the old one. */
5284 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5285 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5286 hashcode = type_hash_list (argtypes, hashcode);
5287 t = type_hash_canon (hashcode, t);
5289 if (!COMPLETE_TYPE_P (t))
5295 /* Construct, lay out and return the type of methods belonging to class
5296 BASETYPE and whose arguments and values are described by TYPE.
5297 If that type exists already, reuse it.
5298 TYPE must be a FUNCTION_TYPE node. */
5301 build_method_type (tree basetype, tree type)
5303 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5305 return build_method_type_directly (basetype,
5307 TYPE_ARG_TYPES (type));
5310 /* Construct, lay out and return the type of offsets to a value
5311 of type TYPE, within an object of type BASETYPE.
5312 If a suitable offset type exists already, reuse it. */
5315 build_offset_type (tree basetype, tree type)
5318 hashval_t hashcode = 0;
5320 /* Make a node of the sort we want. */
5321 t = make_node (OFFSET_TYPE);
5323 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5324 TREE_TYPE (t) = type;
5326 /* If we already have such a type, use the old one. */
5327 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5328 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5329 t = type_hash_canon (hashcode, t);
5331 if (!COMPLETE_TYPE_P (t))
5337 /* Create a complex type whose components are COMPONENT_TYPE. */
5340 build_complex_type (tree component_type)
5345 /* Make a node of the sort we want. */
5346 t = make_node (COMPLEX_TYPE);
5348 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5350 /* If we already have such a type, use the old one. */
5351 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5352 t = type_hash_canon (hashcode, t);
5354 if (!COMPLETE_TYPE_P (t))
5357 /* If we are writing Dwarf2 output we need to create a name,
5358 since complex is a fundamental type. */
5359 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5363 if (component_type == char_type_node)
5364 name = "complex char";
5365 else if (component_type == signed_char_type_node)
5366 name = "complex signed char";
5367 else if (component_type == unsigned_char_type_node)
5368 name = "complex unsigned char";
5369 else if (component_type == short_integer_type_node)
5370 name = "complex short int";
5371 else if (component_type == short_unsigned_type_node)
5372 name = "complex short unsigned int";
5373 else if (component_type == integer_type_node)
5374 name = "complex int";
5375 else if (component_type == unsigned_type_node)
5376 name = "complex unsigned int";
5377 else if (component_type == long_integer_type_node)
5378 name = "complex long int";
5379 else if (component_type == long_unsigned_type_node)
5380 name = "complex long unsigned int";
5381 else if (component_type == long_long_integer_type_node)
5382 name = "complex long long int";
5383 else if (component_type == long_long_unsigned_type_node)
5384 name = "complex long long unsigned int";
5389 TYPE_NAME (t) = get_identifier (name);
5392 return build_qualified_type (t, TYPE_QUALS (component_type));
5395 /* Return OP, stripped of any conversions to wider types as much as is safe.
5396 Converting the value back to OP's type makes a value equivalent to OP.
5398 If FOR_TYPE is nonzero, we return a value which, if converted to
5399 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5401 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5402 narrowest type that can hold the value, even if they don't exactly fit.
5403 Otherwise, bit-field references are changed to a narrower type
5404 only if they can be fetched directly from memory in that type.
5406 OP must have integer, real or enumeral type. Pointers are not allowed!
5408 There are some cases where the obvious value we could return
5409 would regenerate to OP if converted to OP's type,
5410 but would not extend like OP to wider types.
5411 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5412 For example, if OP is (unsigned short)(signed char)-1,
5413 we avoid returning (signed char)-1 if FOR_TYPE is int,
5414 even though extending that to an unsigned short would regenerate OP,
5415 since the result of extending (signed char)-1 to (int)
5416 is different from (int) OP. */
5419 get_unwidened (tree op, tree for_type)
5421 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5422 tree type = TREE_TYPE (op);
5424 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5426 = (for_type != 0 && for_type != type
5427 && final_prec > TYPE_PRECISION (type)
5428 && TYPE_UNSIGNED (type));
5431 while (TREE_CODE (op) == NOP_EXPR
5432 || TREE_CODE (op) == CONVERT_EXPR)
5436 /* TYPE_PRECISION on vector types has different meaning
5437 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5438 so avoid them here. */
5439 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5442 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5443 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5445 /* Truncations are many-one so cannot be removed.
5446 Unless we are later going to truncate down even farther. */
5448 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5451 /* See what's inside this conversion. If we decide to strip it,
5453 op = TREE_OPERAND (op, 0);
5455 /* If we have not stripped any zero-extensions (uns is 0),
5456 we can strip any kind of extension.
5457 If we have previously stripped a zero-extension,
5458 only zero-extensions can safely be stripped.
5459 Any extension can be stripped if the bits it would produce
5460 are all going to be discarded later by truncating to FOR_TYPE. */
5464 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5466 /* TYPE_UNSIGNED says whether this is a zero-extension.
5467 Let's avoid computing it if it does not affect WIN
5468 and if UNS will not be needed again. */
5470 || TREE_CODE (op) == NOP_EXPR
5471 || TREE_CODE (op) == CONVERT_EXPR)
5472 && TYPE_UNSIGNED (TREE_TYPE (op)))
5480 if (TREE_CODE (op) == COMPONENT_REF
5481 /* Since type_for_size always gives an integer type. */
5482 && TREE_CODE (type) != REAL_TYPE
5483 /* Don't crash if field not laid out yet. */
5484 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5485 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5487 unsigned int innerprec
5488 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5489 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5490 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5491 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5493 /* We can get this structure field in the narrowest type it fits in.
5494 If FOR_TYPE is 0, do this only for a field that matches the
5495 narrower type exactly and is aligned for it
5496 The resulting extension to its nominal type (a fullword type)
5497 must fit the same conditions as for other extensions. */
5500 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5501 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5502 && (! uns || final_prec <= innerprec || unsignedp))
5504 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5505 TREE_OPERAND (op, 1), NULL_TREE);
5506 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5507 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5514 /* Return OP or a simpler expression for a narrower value
5515 which can be sign-extended or zero-extended to give back OP.
5516 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5517 or 0 if the value should be sign-extended. */
5520 get_narrower (tree op, int *unsignedp_ptr)
5525 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5527 while (TREE_CODE (op) == NOP_EXPR)
5530 = (TYPE_PRECISION (TREE_TYPE (op))
5531 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5533 /* Truncations are many-one so cannot be removed. */
5537 /* See what's inside this conversion. If we decide to strip it,
5542 op = TREE_OPERAND (op, 0);
5543 /* An extension: the outermost one can be stripped,
5544 but remember whether it is zero or sign extension. */
5546 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5547 /* Otherwise, if a sign extension has been stripped,
5548 only sign extensions can now be stripped;
5549 if a zero extension has been stripped, only zero-extensions. */
5550 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5554 else /* bitschange == 0 */
5556 /* A change in nominal type can always be stripped, but we must
5557 preserve the unsignedness. */
5559 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5561 op = TREE_OPERAND (op, 0);
5562 /* Keep trying to narrow, but don't assign op to win if it
5563 would turn an integral type into something else. */
5564 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
5571 if (TREE_CODE (op) == COMPONENT_REF
5572 /* Since type_for_size always gives an integer type. */
5573 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
5574 /* Ensure field is laid out already. */
5575 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5576 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5578 unsigned HOST_WIDE_INT innerprec
5579 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5580 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5581 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5582 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5584 /* We can get this structure field in a narrower type that fits it,
5585 but the resulting extension to its nominal type (a fullword type)
5586 must satisfy the same conditions as for other extensions.
5588 Do this only for fields that are aligned (not bit-fields),
5589 because when bit-field insns will be used there is no
5590 advantage in doing this. */
5592 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5593 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5594 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
5598 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
5599 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5600 TREE_OPERAND (op, 1), NULL_TREE);
5601 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5602 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5605 *unsignedp_ptr = uns;
5609 /* Nonzero if integer constant C has a value that is permissible
5610 for type TYPE (an INTEGER_TYPE). */
5613 int_fits_type_p (tree c, tree type)
5615 tree type_low_bound = TYPE_MIN_VALUE (type);
5616 tree type_high_bound = TYPE_MAX_VALUE (type);
5617 bool ok_for_low_bound, ok_for_high_bound;
5620 /* If at least one bound of the type is a constant integer, we can check
5621 ourselves and maybe make a decision. If no such decision is possible, but
5622 this type is a subtype, try checking against that. Otherwise, use
5623 force_fit_type, which checks against the precision.
5625 Compute the status for each possibly constant bound, and return if we see
5626 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5627 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5628 for "constant known to fit". */
5630 /* Check if C >= type_low_bound. */
5631 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
5633 if (tree_int_cst_lt (c, type_low_bound))
5635 ok_for_low_bound = true;
5638 ok_for_low_bound = false;
5640 /* Check if c <= type_high_bound. */
5641 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
5643 if (tree_int_cst_lt (type_high_bound, c))
5645 ok_for_high_bound = true;
5648 ok_for_high_bound = false;
5650 /* If the constant fits both bounds, the result is known. */
5651 if (ok_for_low_bound && ok_for_high_bound)
5654 /* Perform some generic filtering which may allow making a decision
5655 even if the bounds are not constant. First, negative integers
5656 never fit in unsigned types, */
5657 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
5660 /* Second, narrower types always fit in wider ones. */
5661 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
5664 /* Third, unsigned integers with top bit set never fit signed types. */
5665 if (! TYPE_UNSIGNED (type)
5666 && TYPE_UNSIGNED (TREE_TYPE (c))
5667 && tree_int_cst_msb (c))
5670 /* If we haven't been able to decide at this point, there nothing more we
5671 can check ourselves here. Look at the base type if we have one and it
5672 has the same precision. */
5673 if (TREE_CODE (type) == INTEGER_TYPE
5674 && TREE_TYPE (type) != 0
5675 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
5676 return int_fits_type_p (c, TREE_TYPE (type));
5678 /* Or to force_fit_type, if nothing else. */
5679 tmp = copy_node (c);
5680 TREE_TYPE (tmp) = type;
5681 tmp = force_fit_type (tmp, -1, false, false);
5682 return TREE_INT_CST_HIGH (tmp) == TREE_INT_CST_HIGH (c)
5683 && TREE_INT_CST_LOW (tmp) == TREE_INT_CST_LOW (c);
5686 /* Subprogram of following function. Called by walk_tree.
5688 Return *TP if it is an automatic variable or parameter of the
5689 function passed in as DATA. */
5692 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
5694 tree fn = (tree) data;
5699 else if (DECL_P (*tp)
5700 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
5706 /* Returns true if T is, contains, or refers to a type with variable
5707 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
5708 arguments, but not the return type. If FN is nonzero, only return
5709 true if a modifier of the type or position of FN is a variable or
5710 parameter inside FN.
5712 This concept is more general than that of C99 'variably modified types':
5713 in C99, a struct type is never variably modified because a VLA may not
5714 appear as a structure member. However, in GNU C code like:
5716 struct S { int i[f()]; };
5718 is valid, and other languages may define similar constructs. */
5721 variably_modified_type_p (tree type, tree fn)
5725 /* Test if T is either variable (if FN is zero) or an expression containing
5726 a variable in FN. */
5727 #define RETURN_TRUE_IF_VAR(T) \
5728 do { tree _t = (T); \
5729 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5730 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5731 return true; } while (0)
5733 if (type == error_mark_node)
5736 /* If TYPE itself has variable size, it is variably modified. */
5737 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
5738 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
5740 switch (TREE_CODE (type))
5743 case REFERENCE_TYPE:
5745 if (variably_modified_type_p (TREE_TYPE (type), fn))
5751 /* If TYPE is a function type, it is variably modified if the
5752 return type is variably modified. */
5753 if (variably_modified_type_p (TREE_TYPE (type), fn))
5761 /* Scalar types are variably modified if their end points
5763 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
5764 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
5769 case QUAL_UNION_TYPE:
5770 /* We can't see if any of the fields are variably-modified by the
5771 definition we normally use, since that would produce infinite
5772 recursion via pointers. */
5773 /* This is variably modified if some field's type is. */
5774 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
5775 if (TREE_CODE (t) == FIELD_DECL)
5777 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
5778 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
5779 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
5781 if (TREE_CODE (type) == QUAL_UNION_TYPE)
5782 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
5787 /* Do not call ourselves to avoid infinite recursion. This is
5788 variably modified if the element type is. */
5789 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
5790 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
5797 /* The current language may have other cases to check, but in general,
5798 all other types are not variably modified. */
5799 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
5801 #undef RETURN_TRUE_IF_VAR
5804 /* Given a DECL or TYPE, return the scope in which it was declared, or
5805 NULL_TREE if there is no containing scope. */
5808 get_containing_scope (tree t)
5810 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
5813 /* Return the innermost context enclosing DECL that is
5814 a FUNCTION_DECL, or zero if none. */
5817 decl_function_context (tree decl)
5821 if (TREE_CODE (decl) == ERROR_MARK)
5824 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5825 where we look up the function at runtime. Such functions always take
5826 a first argument of type 'pointer to real context'.
5828 C++ should really be fixed to use DECL_CONTEXT for the real context,
5829 and use something else for the "virtual context". */
5830 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
5833 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
5835 context = DECL_CONTEXT (decl);
5837 while (context && TREE_CODE (context) != FUNCTION_DECL)
5839 if (TREE_CODE (context) == BLOCK)
5840 context = BLOCK_SUPERCONTEXT (context);
5842 context = get_containing_scope (context);
5848 /* Return the innermost context enclosing DECL that is
5849 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5850 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5853 decl_type_context (tree decl)
5855 tree context = DECL_CONTEXT (decl);
5858 switch (TREE_CODE (context))
5860 case NAMESPACE_DECL:
5861 case TRANSLATION_UNIT_DECL:
5866 case QUAL_UNION_TYPE:
5871 context = DECL_CONTEXT (context);
5875 context = BLOCK_SUPERCONTEXT (context);
5885 /* CALL is a CALL_EXPR. Return the declaration for the function
5886 called, or NULL_TREE if the called function cannot be
5890 get_callee_fndecl (tree call)
5894 if (call == error_mark_node)
5897 /* It's invalid to call this function with anything but a
5899 gcc_assert (TREE_CODE (call) == CALL_EXPR);
5901 /* The first operand to the CALL is the address of the function
5903 addr = TREE_OPERAND (call, 0);
5907 /* If this is a readonly function pointer, extract its initial value. */
5908 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5909 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5910 && DECL_INITIAL (addr))
5911 addr = DECL_INITIAL (addr);
5913 /* If the address is just `&f' for some function `f', then we know
5914 that `f' is being called. */
5915 if (TREE_CODE (addr) == ADDR_EXPR
5916 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5917 return TREE_OPERAND (addr, 0);
5919 /* We couldn't figure out what was being called. Maybe the front
5920 end has some idea. */
5921 return lang_hooks.lang_get_callee_fndecl (call);
5924 /* Print debugging information about tree nodes generated during the compile,
5925 and any language-specific information. */
5928 dump_tree_statistics (void)
5930 #ifdef GATHER_STATISTICS
5932 int total_nodes, total_bytes;
5935 fprintf (stderr, "\n??? tree nodes created\n\n");
5936 #ifdef GATHER_STATISTICS
5937 fprintf (stderr, "Kind Nodes Bytes\n");
5938 fprintf (stderr, "---------------------------------------\n");
5939 total_nodes = total_bytes = 0;
5940 for (i = 0; i < (int) all_kinds; i++)
5942 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
5943 tree_node_counts[i], tree_node_sizes[i]);
5944 total_nodes += tree_node_counts[i];
5945 total_bytes += tree_node_sizes[i];
5947 fprintf (stderr, "---------------------------------------\n");
5948 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
5949 fprintf (stderr, "---------------------------------------\n");
5950 ssanames_print_statistics ();
5951 phinodes_print_statistics ();
5953 fprintf (stderr, "(No per-node statistics)\n");
5955 print_type_hash_statistics ();
5956 print_debug_expr_statistics ();
5957 print_value_expr_statistics ();
5958 print_restrict_base_statistics ();
5959 lang_hooks.print_statistics ();
5962 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5964 /* Generate a crc32 of a string. */
5967 crc32_string (unsigned chksum, const char *string)
5971 unsigned value = *string << 24;
5974 for (ix = 8; ix--; value <<= 1)
5978 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
5987 /* P is a string that will be used in a symbol. Mask out any characters
5988 that are not valid in that context. */
5991 clean_symbol_name (char *p)
5995 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5998 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6005 /* Generate a name for a function unique to this translation unit.
6006 TYPE is some string to identify the purpose of this function to the
6007 linker or collect2. */
6010 get_file_function_name_long (const char *type)
6016 if (first_global_object_name)
6018 p = first_global_object_name;
6020 /* For type 'F', the generated name must be unique not only to this
6021 translation unit but also to any given link. Since global names
6022 can be overloaded, we concatenate the first global object name
6023 with a string derived from the file name of this object. */
6024 if (!strcmp (type, "F"))
6026 const char *file = main_input_filename;
6029 file = input_filename;
6031 q = alloca (strlen (p) + 10);
6032 sprintf (q, "%s_%08X", p, crc32_string (0, file));
6039 /* We don't have anything that we know to be unique to this translation
6040 unit, so use what we do have and throw in some randomness. */
6042 const char *name = weak_global_object_name;
6043 const char *file = main_input_filename;
6048 file = input_filename;
6050 len = strlen (file);
6051 q = alloca (9 * 2 + len + 1);
6052 memcpy (q, file, len + 1);
6053 clean_symbol_name (q);
6055 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6056 crc32_string (0, flag_random_seed));
6061 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6063 /* Set up the name of the file-level functions we may need.
6064 Use a global object (which is already required to be unique over
6065 the program) rather than the file name (which imposes extra
6067 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6069 return get_identifier (buf);
6072 /* If KIND=='I', return a suitable global initializer (constructor) name.
6073 If KIND=='D', return a suitable global clean-up (destructor) name. */
6076 get_file_function_name (int kind)
6083 return get_file_function_name_long (p);
6086 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6088 /* Complain that the tree code of NODE does not match the expected 0
6089 terminated list of trailing codes. The trailing code list can be
6090 empty, for a more vague error message. FILE, LINE, and FUNCTION
6091 are of the caller. */
6094 tree_check_failed (const tree node, const char *file,
6095 int line, const char *function, ...)
6099 unsigned length = 0;
6102 va_start (args, function);
6103 while ((code = va_arg (args, int)))
6104 length += 4 + strlen (tree_code_name[code]);
6108 va_start (args, function);
6109 length += strlen ("expected ");
6110 buffer = alloca (length);
6112 while ((code = va_arg (args, int)))
6114 const char *prefix = length ? " or " : "expected ";
6116 strcpy (buffer + length, prefix);
6117 length += strlen (prefix);
6118 strcpy (buffer + length, tree_code_name[code]);
6119 length += strlen (tree_code_name[code]);
6124 buffer = (char *)"unexpected node";
6126 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6127 buffer, tree_code_name[TREE_CODE (node)],
6128 function, trim_filename (file), line);
6131 /* Complain that the tree code of NODE does match the expected 0
6132 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6136 tree_not_check_failed (const tree node, const char *file,
6137 int line, const char *function, ...)
6141 unsigned length = 0;
6144 va_start (args, function);
6145 while ((code = va_arg (args, int)))
6146 length += 4 + strlen (tree_code_name[code]);
6148 va_start (args, function);
6149 buffer = alloca (length);
6151 while ((code = va_arg (args, int)))
6155 strcpy (buffer + length, " or ");
6158 strcpy (buffer + length, tree_code_name[code]);
6159 length += strlen (tree_code_name[code]);
6163 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6164 buffer, tree_code_name[TREE_CODE (node)],
6165 function, trim_filename (file), line);
6168 /* Similar to tree_check_failed, except that we check for a class of tree
6169 code, given in CL. */
6172 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6173 const char *file, int line, const char *function)
6176 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6177 TREE_CODE_CLASS_STRING (cl),
6178 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6179 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6182 /* Similar to tree_check_failed, except that instead of specifying a
6183 dozen codes, use the knowledge that they're all sequential. */
6186 tree_range_check_failed (const tree node, const char *file, int line,
6187 const char *function, enum tree_code c1,
6191 unsigned length = 0;
6194 for (c = c1; c <= c2; ++c)
6195 length += 4 + strlen (tree_code_name[c]);
6197 length += strlen ("expected ");
6198 buffer = alloca (length);
6201 for (c = c1; c <= c2; ++c)
6203 const char *prefix = length ? " or " : "expected ";
6205 strcpy (buffer + length, prefix);
6206 length += strlen (prefix);
6207 strcpy (buffer + length, tree_code_name[c]);
6208 length += strlen (tree_code_name[c]);
6211 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6212 buffer, tree_code_name[TREE_CODE (node)],
6213 function, trim_filename (file), line);
6217 /* Similar to tree_check_failed, except that we check that a tree does
6218 not have the specified code, given in CL. */
6221 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6222 const char *file, int line, const char *function)
6225 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6226 TREE_CODE_CLASS_STRING (cl),
6227 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6228 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6232 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6235 omp_clause_check_failed (const tree node, const char *file, int line,
6236 const char *function, enum omp_clause_code code)
6238 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6239 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6240 function, trim_filename (file), line);
6244 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6247 omp_clause_range_check_failed (const tree node, const char *file, int line,
6248 const char *function, enum omp_clause_code c1,
6249 enum omp_clause_code c2)
6252 unsigned length = 0;
6253 enum omp_clause_code c;
6255 for (c = c1; c <= c2; ++c)
6256 length += 4 + strlen (omp_clause_code_name[c]);
6258 length += strlen ("expected ");
6259 buffer = alloca (length);
6262 for (c = c1; c <= c2; ++c)
6264 const char *prefix = length ? " or " : "expected ";
6266 strcpy (buffer + length, prefix);
6267 length += strlen (prefix);
6268 strcpy (buffer + length, omp_clause_code_name[c]);
6269 length += strlen (omp_clause_code_name[c]);
6272 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6273 buffer, omp_clause_code_name[TREE_CODE (node)],
6274 function, trim_filename (file), line);
6278 #undef DEFTREESTRUCT
6279 #define DEFTREESTRUCT(VAL, NAME) NAME,
6281 static const char *ts_enum_names[] = {
6282 #include "treestruct.def"
6284 #undef DEFTREESTRUCT
6286 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6288 /* Similar to tree_class_check_failed, except that we check for
6289 whether CODE contains the tree structure identified by EN. */
6292 tree_contains_struct_check_failed (const tree node,
6293 const enum tree_node_structure_enum en,
6294 const char *file, int line,
6295 const char *function)
6298 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6300 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6304 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6305 (dynamically sized) vector. */
6308 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6309 const char *function)
6312 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6313 idx + 1, len, function, trim_filename (file), line);
6316 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6317 (dynamically sized) vector. */
6320 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6321 const char *function)
6324 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6325 idx + 1, len, function, trim_filename (file), line);
6328 /* Similar to above, except that the check is for the bounds of the operand
6329 vector of an expression node. */
6332 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
6333 int line, const char *function)
6336 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6337 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
6338 function, trim_filename (file), line);
6341 /* Similar to above, except that the check is for the number of
6342 operands of an OMP_CLAUSE node. */
6345 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6346 int line, const char *function)
6349 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6350 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6351 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6352 trim_filename (file), line);
6354 #endif /* ENABLE_TREE_CHECKING */
6356 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6357 and mapped to the machine mode MODE. Initialize its fields and build
6358 the information necessary for debugging output. */
6361 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6363 tree t = make_node (VECTOR_TYPE);
6365 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6366 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6367 TYPE_MODE (t) = mode;
6368 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6369 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6374 tree index = build_int_cst (NULL_TREE, nunits - 1);
6375 tree array = build_array_type (innertype, build_index_type (index));
6376 tree rt = make_node (RECORD_TYPE);
6378 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6379 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6381 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6382 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6383 the representation type, and we want to find that die when looking up
6384 the vector type. This is most easily achieved by making the TYPE_UID
6386 TYPE_UID (rt) = TYPE_UID (t);
6389 /* Build our main variant, based on the main variant of the inner type. */
6390 if (TYPE_MAIN_VARIANT (innertype) != innertype)
6392 tree innertype_main_variant = TYPE_MAIN_VARIANT (innertype);
6393 unsigned int hash = TYPE_HASH (innertype_main_variant);
6394 TYPE_MAIN_VARIANT (t)
6395 = type_hash_canon (hash, make_vector_type (innertype_main_variant,
6403 make_or_reuse_type (unsigned size, int unsignedp)
6405 if (size == INT_TYPE_SIZE)
6406 return unsignedp ? unsigned_type_node : integer_type_node;
6407 if (size == CHAR_TYPE_SIZE)
6408 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6409 if (size == SHORT_TYPE_SIZE)
6410 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6411 if (size == LONG_TYPE_SIZE)
6412 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6413 if (size == LONG_LONG_TYPE_SIZE)
6414 return (unsignedp ? long_long_unsigned_type_node
6415 : long_long_integer_type_node);
6418 return make_unsigned_type (size);
6420 return make_signed_type (size);
6423 /* Create nodes for all integer types (and error_mark_node) using the sizes
6424 of C datatypes. The caller should call set_sizetype soon after calling
6425 this function to select one of the types as sizetype. */
6428 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6430 error_mark_node = make_node (ERROR_MARK);
6431 TREE_TYPE (error_mark_node) = error_mark_node;
6433 initialize_sizetypes (signed_sizetype);
6435 /* Define both `signed char' and `unsigned char'. */
6436 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6437 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6438 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6439 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6441 /* Define `char', which is like either `signed char' or `unsigned char'
6442 but not the same as either. */
6445 ? make_signed_type (CHAR_TYPE_SIZE)
6446 : make_unsigned_type (CHAR_TYPE_SIZE));
6447 TYPE_STRING_FLAG (char_type_node) = 1;
6449 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6450 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6451 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6452 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6453 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6454 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6455 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6456 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6458 /* Define a boolean type. This type only represents boolean values but
6459 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6460 Front ends which want to override this size (i.e. Java) can redefine
6461 boolean_type_node before calling build_common_tree_nodes_2. */
6462 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6463 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6464 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6465 TYPE_PRECISION (boolean_type_node) = 1;
6467 /* Fill in the rest of the sized types. Reuse existing type nodes
6469 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6470 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6471 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6472 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6473 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6475 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6476 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6477 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6478 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6479 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6481 access_public_node = get_identifier ("public");
6482 access_protected_node = get_identifier ("protected");
6483 access_private_node = get_identifier ("private");
6486 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6487 It will create several other common tree nodes. */
6490 build_common_tree_nodes_2 (int short_double)
6492 /* Define these next since types below may used them. */
6493 integer_zero_node = build_int_cst (NULL_TREE, 0);
6494 integer_one_node = build_int_cst (NULL_TREE, 1);
6495 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6497 size_zero_node = size_int (0);
6498 size_one_node = size_int (1);
6499 bitsize_zero_node = bitsize_int (0);
6500 bitsize_one_node = bitsize_int (1);
6501 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6503 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6504 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6506 void_type_node = make_node (VOID_TYPE);
6507 layout_type (void_type_node);
6509 /* We are not going to have real types in C with less than byte alignment,
6510 so we might as well not have any types that claim to have it. */
6511 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6512 TYPE_USER_ALIGN (void_type_node) = 0;
6514 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6515 layout_type (TREE_TYPE (null_pointer_node));
6517 ptr_type_node = build_pointer_type (void_type_node);
6519 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6520 fileptr_type_node = ptr_type_node;
6522 float_type_node = make_node (REAL_TYPE);
6523 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6524 layout_type (float_type_node);
6526 double_type_node = make_node (REAL_TYPE);
6528 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6530 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6531 layout_type (double_type_node);
6533 long_double_type_node = make_node (REAL_TYPE);
6534 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6535 layout_type (long_double_type_node);
6537 float_ptr_type_node = build_pointer_type (float_type_node);
6538 double_ptr_type_node = build_pointer_type (double_type_node);
6539 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6540 integer_ptr_type_node = build_pointer_type (integer_type_node);
6542 /* Decimal float types. */
6543 dfloat32_type_node = make_node (REAL_TYPE);
6544 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
6545 layout_type (dfloat32_type_node);
6546 TYPE_MODE (dfloat32_type_node) = SDmode;
6547 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
6549 dfloat64_type_node = make_node (REAL_TYPE);
6550 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
6551 layout_type (dfloat64_type_node);
6552 TYPE_MODE (dfloat64_type_node) = DDmode;
6553 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
6555 dfloat128_type_node = make_node (REAL_TYPE);
6556 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
6557 layout_type (dfloat128_type_node);
6558 TYPE_MODE (dfloat128_type_node) = TDmode;
6559 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
6561 complex_integer_type_node = make_node (COMPLEX_TYPE);
6562 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6563 layout_type (complex_integer_type_node);
6565 complex_float_type_node = make_node (COMPLEX_TYPE);
6566 TREE_TYPE (complex_float_type_node) = float_type_node;
6567 layout_type (complex_float_type_node);
6569 complex_double_type_node = make_node (COMPLEX_TYPE);
6570 TREE_TYPE (complex_double_type_node) = double_type_node;
6571 layout_type (complex_double_type_node);
6573 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6574 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6575 layout_type (complex_long_double_type_node);
6578 tree t = targetm.build_builtin_va_list ();
6580 /* Many back-ends define record types without setting TYPE_NAME.
6581 If we copied the record type here, we'd keep the original
6582 record type without a name. This breaks name mangling. So,
6583 don't copy record types and let c_common_nodes_and_builtins()
6584 declare the type to be __builtin_va_list. */
6585 if (TREE_CODE (t) != RECORD_TYPE)
6586 t = build_variant_type_copy (t);
6588 va_list_type_node = t;
6592 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6595 local_define_builtin (const char *name, tree type, enum built_in_function code,
6596 const char *library_name, int ecf_flags)
6600 decl = lang_hooks.builtin_function (name, type, code, BUILT_IN_NORMAL,
6601 library_name, NULL_TREE);
6602 if (ecf_flags & ECF_CONST)
6603 TREE_READONLY (decl) = 1;
6604 if (ecf_flags & ECF_PURE)
6605 DECL_IS_PURE (decl) = 1;
6606 if (ecf_flags & ECF_NORETURN)
6607 TREE_THIS_VOLATILE (decl) = 1;
6608 if (ecf_flags & ECF_NOTHROW)
6609 TREE_NOTHROW (decl) = 1;
6610 if (ecf_flags & ECF_MALLOC)
6611 DECL_IS_MALLOC (decl) = 1;
6613 built_in_decls[code] = decl;
6614 implicit_built_in_decls[code] = decl;
6617 /* Call this function after instantiating all builtins that the language
6618 front end cares about. This will build the rest of the builtins that
6619 are relied upon by the tree optimizers and the middle-end. */
6622 build_common_builtin_nodes (void)
6626 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
6627 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6629 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6630 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6631 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6632 ftype = build_function_type (ptr_type_node, tmp);
6634 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
6635 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
6636 "memcpy", ECF_NOTHROW);
6637 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6638 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
6639 "memmove", ECF_NOTHROW);
6642 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
6644 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6645 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6646 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6647 ftype = build_function_type (integer_type_node, tmp);
6648 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
6649 "memcmp", ECF_PURE | ECF_NOTHROW);
6652 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
6654 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6655 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
6656 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6657 ftype = build_function_type (ptr_type_node, tmp);
6658 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
6659 "memset", ECF_NOTHROW);
6662 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
6664 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6665 ftype = build_function_type (ptr_type_node, tmp);
6666 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
6667 "alloca", ECF_NOTHROW | ECF_MALLOC);
6670 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6671 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6672 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6673 ftype = build_function_type (void_type_node, tmp);
6674 local_define_builtin ("__builtin_init_trampoline", ftype,
6675 BUILT_IN_INIT_TRAMPOLINE,
6676 "__builtin_init_trampoline", ECF_NOTHROW);
6678 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6679 ftype = build_function_type (ptr_type_node, tmp);
6680 local_define_builtin ("__builtin_adjust_trampoline", ftype,
6681 BUILT_IN_ADJUST_TRAMPOLINE,
6682 "__builtin_adjust_trampoline",
6683 ECF_CONST | ECF_NOTHROW);
6685 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6686 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6687 ftype = build_function_type (void_type_node, tmp);
6688 local_define_builtin ("__builtin_nonlocal_goto", ftype,
6689 BUILT_IN_NONLOCAL_GOTO,
6690 "__builtin_nonlocal_goto",
6691 ECF_NORETURN | ECF_NOTHROW);
6693 ftype = build_function_type (ptr_type_node, void_list_node);
6694 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
6695 "__builtin_stack_save", ECF_NOTHROW);
6697 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6698 ftype = build_function_type (void_type_node, tmp);
6699 local_define_builtin ("__builtin_stack_restore", ftype,
6700 BUILT_IN_STACK_RESTORE,
6701 "__builtin_stack_restore", ECF_NOTHROW);
6703 ftype = build_function_type (void_type_node, void_list_node);
6704 local_define_builtin ("__builtin_profile_func_enter", ftype,
6705 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
6706 local_define_builtin ("__builtin_profile_func_exit", ftype,
6707 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
6709 /* Complex multiplication and division. These are handled as builtins
6710 rather than optabs because emit_library_call_value doesn't support
6711 complex. Further, we can do slightly better with folding these
6712 beasties if the real and complex parts of the arguments are separate. */
6714 enum machine_mode mode;
6716 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
6718 char mode_name_buf[4], *q;
6720 enum built_in_function mcode, dcode;
6721 tree type, inner_type;
6723 type = lang_hooks.types.type_for_mode (mode, 0);
6726 inner_type = TREE_TYPE (type);
6728 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
6729 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6730 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6731 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6732 ftype = build_function_type (type, tmp);
6734 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6735 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6737 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
6741 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
6742 local_define_builtin (built_in_names[mcode], ftype, mcode,
6743 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
6745 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
6746 local_define_builtin (built_in_names[dcode], ftype, dcode,
6747 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
6752 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6755 If we requested a pointer to a vector, build up the pointers that
6756 we stripped off while looking for the inner type. Similarly for
6757 return values from functions.
6759 The argument TYPE is the top of the chain, and BOTTOM is the
6760 new type which we will point to. */
6763 reconstruct_complex_type (tree type, tree bottom)
6767 if (POINTER_TYPE_P (type))
6769 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6770 outer = build_pointer_type (inner);
6772 else if (TREE_CODE (type) == ARRAY_TYPE)
6774 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6775 outer = build_array_type (inner, TYPE_DOMAIN (type));
6777 else if (TREE_CODE (type) == FUNCTION_TYPE)
6779 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6780 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
6782 else if (TREE_CODE (type) == METHOD_TYPE)
6785 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6786 /* The build_method_type_directly() routine prepends 'this' to argument list,
6787 so we must compensate by getting rid of it. */
6788 argtypes = TYPE_ARG_TYPES (type);
6789 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
6791 TYPE_ARG_TYPES (type));
6792 TYPE_ARG_TYPES (outer) = argtypes;
6797 TYPE_READONLY (outer) = TYPE_READONLY (type);
6798 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
6803 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6806 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
6810 switch (GET_MODE_CLASS (mode))
6812 case MODE_VECTOR_INT:
6813 case MODE_VECTOR_FLOAT:
6814 nunits = GET_MODE_NUNITS (mode);
6818 /* Check that there are no leftover bits. */
6819 gcc_assert (GET_MODE_BITSIZE (mode)
6820 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
6822 nunits = GET_MODE_BITSIZE (mode)
6823 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
6830 return make_vector_type (innertype, nunits, mode);
6833 /* Similarly, but takes the inner type and number of units, which must be
6837 build_vector_type (tree innertype, int nunits)
6839 return make_vector_type (innertype, nunits, VOIDmode);
6842 /* Build RESX_EXPR with given REGION_NUMBER. */
6844 build_resx (int region_number)
6847 t = build1 (RESX_EXPR, void_type_node,
6848 build_int_cst (NULL_TREE, region_number));
6852 /* Given an initializer INIT, return TRUE if INIT is zero or some
6853 aggregate of zeros. Otherwise return FALSE. */
6855 initializer_zerop (tree init)
6861 switch (TREE_CODE (init))
6864 return integer_zerop (init);
6867 /* ??? Note that this is not correct for C4X float formats. There,
6868 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6869 negative exponent. */
6870 return real_zerop (init)
6871 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
6874 return integer_zerop (init)
6875 || (real_zerop (init)
6876 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
6877 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
6880 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
6881 if (!initializer_zerop (TREE_VALUE (elt)))
6887 unsigned HOST_WIDE_INT idx;
6889 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
6890 if (!initializer_zerop (elt))
6900 /* Build an empty statement. */
6903 build_empty_stmt (void)
6905 return build1 (NOP_EXPR, void_type_node, size_zero_node);
6909 /* Build an OpenMP clause with code CODE. */
6912 build_omp_clause (enum omp_clause_code code)
6917 length = omp_clause_num_ops[code];
6918 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
6920 t = ggc_alloc (size);
6921 memset (t, 0, size);
6922 TREE_SET_CODE (t, OMP_CLAUSE);
6923 OMP_CLAUSE_SET_CODE (t, code);
6925 #ifdef GATHER_STATISTICS
6926 tree_node_counts[(int) omp_clause_kind]++;
6927 tree_node_sizes[(int) omp_clause_kind] += size;
6934 /* Returns true if it is possible to prove that the index of
6935 an array access REF (an ARRAY_REF expression) falls into the
6939 in_array_bounds_p (tree ref)
6941 tree idx = TREE_OPERAND (ref, 1);
6944 if (TREE_CODE (idx) != INTEGER_CST)
6947 min = array_ref_low_bound (ref);
6948 max = array_ref_up_bound (ref);
6951 || TREE_CODE (min) != INTEGER_CST
6952 || TREE_CODE (max) != INTEGER_CST)
6955 if (tree_int_cst_lt (idx, min)
6956 || tree_int_cst_lt (max, idx))
6962 /* Returns true if it is possible to prove that the range of
6963 an array access REF (an ARRAY_RANGE_REF expression) falls
6964 into the array bounds. */
6967 range_in_array_bounds_p (tree ref)
6969 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
6970 tree range_min, range_max, min, max;
6972 range_min = TYPE_MIN_VALUE (domain_type);
6973 range_max = TYPE_MAX_VALUE (domain_type);
6976 || TREE_CODE (range_min) != INTEGER_CST
6977 || TREE_CODE (range_max) != INTEGER_CST)
6980 min = array_ref_low_bound (ref);
6981 max = array_ref_up_bound (ref);
6984 || TREE_CODE (min) != INTEGER_CST
6985 || TREE_CODE (max) != INTEGER_CST)
6988 if (tree_int_cst_lt (range_min, min)
6989 || tree_int_cst_lt (max, range_max))
6995 /* Return true if T (assumed to be a DECL) is a global variable. */
6998 is_global_var (tree t)
7001 return (TREE_STATIC (t) || MTAG_GLOBAL (t));
7003 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
7006 /* Return true if T (assumed to be a DECL) must be assigned a memory
7010 needs_to_live_in_memory (tree t)
7012 return (TREE_ADDRESSABLE (t)
7013 || is_global_var (t)
7014 || (TREE_CODE (t) == RESULT_DECL
7015 && aggregate_value_p (t, current_function_decl)));
7018 /* There are situations in which a language considers record types
7019 compatible which have different field lists. Decide if two fields
7020 are compatible. It is assumed that the parent records are compatible. */
7023 fields_compatible_p (tree f1, tree f2)
7025 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7026 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7029 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7030 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7033 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7039 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7042 find_compatible_field (tree record, tree orig_field)
7046 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7047 if (TREE_CODE (f) == FIELD_DECL
7048 && fields_compatible_p (f, orig_field))
7051 /* ??? Why isn't this on the main fields list? */
7052 f = TYPE_VFIELD (record);
7053 if (f && TREE_CODE (f) == FIELD_DECL
7054 && fields_compatible_p (f, orig_field))
7057 /* ??? We should abort here, but Java appears to do Bad Things
7058 with inherited fields. */
7062 /* Return value of a constant X. */
7065 int_cst_value (tree x)
7067 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
7068 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
7069 bool negative = ((val >> (bits - 1)) & 1) != 0;
7071 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
7074 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
7076 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
7081 /* Returns the greatest common divisor of A and B, which must be
7085 tree_fold_gcd (tree a, tree b)
7088 tree type = TREE_TYPE (a);
7090 gcc_assert (TREE_CODE (a) == INTEGER_CST);
7091 gcc_assert (TREE_CODE (b) == INTEGER_CST);
7093 if (integer_zerop (a))
7096 if (integer_zerop (b))
7099 if (tree_int_cst_sgn (a) == -1)
7100 a = fold_build2 (MULT_EXPR, type, a,
7101 build_int_cst (type, -1));
7103 if (tree_int_cst_sgn (b) == -1)
7104 b = fold_build2 (MULT_EXPR, type, b,
7105 build_int_cst (type, -1));
7109 a_mod_b = fold_build2 (FLOOR_MOD_EXPR, type, a, b);
7111 if (!TREE_INT_CST_LOW (a_mod_b)
7112 && !TREE_INT_CST_HIGH (a_mod_b))
7120 /* Returns unsigned variant of TYPE. */
7123 unsigned_type_for (tree type)
7125 if (POINTER_TYPE_P (type))
7126 return lang_hooks.types.unsigned_type (size_type_node);
7127 return lang_hooks.types.unsigned_type (type);
7130 /* Returns signed variant of TYPE. */
7133 signed_type_for (tree type)
7135 if (POINTER_TYPE_P (type))
7136 return lang_hooks.types.signed_type (size_type_node);
7137 return lang_hooks.types.signed_type (type);
7140 /* Returns the largest value obtainable by casting something in INNER type to
7144 upper_bound_in_type (tree outer, tree inner)
7146 unsigned HOST_WIDE_INT lo, hi;
7147 unsigned int det = 0;
7148 unsigned oprec = TYPE_PRECISION (outer);
7149 unsigned iprec = TYPE_PRECISION (inner);
7152 /* Compute a unique number for every combination. */
7153 det |= (oprec > iprec) ? 4 : 0;
7154 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7155 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7157 /* Determine the exponent to use. */
7162 /* oprec <= iprec, outer: signed, inner: don't care. */
7167 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7171 /* oprec > iprec, outer: signed, inner: signed. */
7175 /* oprec > iprec, outer: signed, inner: unsigned. */
7179 /* oprec > iprec, outer: unsigned, inner: signed. */
7183 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7190 /* Compute 2^^prec - 1. */
7191 if (prec <= HOST_BITS_PER_WIDE_INT)
7194 lo = ((~(unsigned HOST_WIDE_INT) 0)
7195 >> (HOST_BITS_PER_WIDE_INT - prec));
7199 hi = ((~(unsigned HOST_WIDE_INT) 0)
7200 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7201 lo = ~(unsigned HOST_WIDE_INT) 0;
7204 return build_int_cst_wide (outer, lo, hi);
7207 /* Returns the smallest value obtainable by casting something in INNER type to
7211 lower_bound_in_type (tree outer, tree inner)
7213 unsigned HOST_WIDE_INT lo, hi;
7214 unsigned oprec = TYPE_PRECISION (outer);
7215 unsigned iprec = TYPE_PRECISION (inner);
7217 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7219 if (TYPE_UNSIGNED (outer)
7220 /* If we are widening something of an unsigned type, OUTER type
7221 contains all values of INNER type. In particular, both INNER
7222 and OUTER types have zero in common. */
7223 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7227 /* If we are widening a signed type to another signed type, we
7228 want to obtain -2^^(iprec-1). If we are keeping the
7229 precision or narrowing to a signed type, we want to obtain
7231 unsigned prec = oprec > iprec ? iprec : oprec;
7233 if (prec <= HOST_BITS_PER_WIDE_INT)
7235 hi = ~(unsigned HOST_WIDE_INT) 0;
7236 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7240 hi = ((~(unsigned HOST_WIDE_INT) 0)
7241 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7246 return build_int_cst_wide (outer, lo, hi);
7249 /* Return nonzero if two operands that are suitable for PHI nodes are
7250 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7251 SSA_NAME or invariant. Note that this is strictly an optimization.
7252 That is, callers of this function can directly call operand_equal_p
7253 and get the same result, only slower. */
7256 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7260 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7262 return operand_equal_p (arg0, arg1, 0);
7265 /* Returns number of zeros at the end of binary representation of X.
7267 ??? Use ffs if available? */
7270 num_ending_zeros (tree x)
7272 unsigned HOST_WIDE_INT fr, nfr;
7273 unsigned num, abits;
7274 tree type = TREE_TYPE (x);
7276 if (TREE_INT_CST_LOW (x) == 0)
7278 num = HOST_BITS_PER_WIDE_INT;
7279 fr = TREE_INT_CST_HIGH (x);
7284 fr = TREE_INT_CST_LOW (x);
7287 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7290 if (nfr << abits == fr)
7297 if (num > TYPE_PRECISION (type))
7298 num = TYPE_PRECISION (type);
7300 return build_int_cst_type (type, num);
7304 #define WALK_SUBTREE(NODE) \
7307 result = walk_tree (&(NODE), func, data, pset); \
7313 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7314 be walked whenever a type is seen in the tree. Rest of operands and return
7315 value are as for walk_tree. */
7318 walk_type_fields (tree type, walk_tree_fn func, void *data,
7319 struct pointer_set_t *pset)
7321 tree result = NULL_TREE;
7323 switch (TREE_CODE (type))
7326 case REFERENCE_TYPE:
7327 /* We have to worry about mutually recursive pointers. These can't
7328 be written in C. They can in Ada. It's pathological, but
7329 there's an ACATS test (c38102a) that checks it. Deal with this
7330 by checking if we're pointing to another pointer, that one
7331 points to another pointer, that one does too, and we have no htab.
7332 If so, get a hash table. We check three levels deep to avoid
7333 the cost of the hash table if we don't need one. */
7334 if (POINTER_TYPE_P (TREE_TYPE (type))
7335 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7336 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7339 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7347 /* ... fall through ... */
7350 WALK_SUBTREE (TREE_TYPE (type));
7354 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7359 WALK_SUBTREE (TREE_TYPE (type));
7363 /* We never want to walk into default arguments. */
7364 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7365 WALK_SUBTREE (TREE_VALUE (arg));
7370 /* Don't follow this nodes's type if a pointer for fear that we'll
7371 have infinite recursion. Those types are uninteresting anyway. */
7372 if (!POINTER_TYPE_P (TREE_TYPE (type))
7373 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE)
7374 WALK_SUBTREE (TREE_TYPE (type));
7375 WALK_SUBTREE (TYPE_DOMAIN (type));
7382 WALK_SUBTREE (TYPE_MIN_VALUE (type));
7383 WALK_SUBTREE (TYPE_MAX_VALUE (type));
7387 WALK_SUBTREE (TREE_TYPE (type));
7388 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7398 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7399 called with the DATA and the address of each sub-tree. If FUNC returns a
7400 non-NULL value, the traversal is stopped, and the value returned by FUNC
7401 is returned. If PSET is non-NULL it is used to record the nodes visited,
7402 and to avoid visiting a node more than once. */
7405 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7407 enum tree_code code;
7411 #define WALK_SUBTREE_TAIL(NODE) \
7415 goto tail_recurse; \
7420 /* Skip empty subtrees. */
7424 /* Don't walk the same tree twice, if the user has requested
7425 that we avoid doing so. */
7426 if (pset && pointer_set_insert (pset, *tp))
7429 /* Call the function. */
7431 result = (*func) (tp, &walk_subtrees, data);
7433 /* If we found something, return it. */
7437 code = TREE_CODE (*tp);
7439 /* Even if we didn't, FUNC may have decided that there was nothing
7440 interesting below this point in the tree. */
7443 /* But we still need to check our siblings. */
7444 if (code == TREE_LIST)
7445 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7446 else if (code == OMP_CLAUSE)
7447 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7452 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
7454 if (result || ! walk_subtrees)
7460 case IDENTIFIER_NODE:
7466 case PLACEHOLDER_EXPR:
7470 /* None of these have subtrees other than those already walked
7475 WALK_SUBTREE (TREE_VALUE (*tp));
7476 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7481 int len = TREE_VEC_LENGTH (*tp);
7486 /* Walk all elements but the first. */
7488 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
7490 /* Now walk the first one as a tail call. */
7491 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
7495 WALK_SUBTREE (TREE_REALPART (*tp));
7496 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
7500 unsigned HOST_WIDE_INT idx;
7501 constructor_elt *ce;
7504 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
7506 WALK_SUBTREE (ce->value);
7511 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
7516 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
7518 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7519 into declarations that are just mentioned, rather than
7520 declared; they don't really belong to this part of the tree.
7521 And, we can see cycles: the initializer for a declaration
7522 can refer to the declaration itself. */
7523 WALK_SUBTREE (DECL_INITIAL (decl));
7524 WALK_SUBTREE (DECL_SIZE (decl));
7525 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
7527 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
7530 case STATEMENT_LIST:
7532 tree_stmt_iterator i;
7533 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
7534 WALK_SUBTREE (*tsi_stmt_ptr (i));
7539 switch (OMP_CLAUSE_CODE (*tp))
7541 case OMP_CLAUSE_PRIVATE:
7542 case OMP_CLAUSE_SHARED:
7543 case OMP_CLAUSE_FIRSTPRIVATE:
7544 case OMP_CLAUSE_LASTPRIVATE:
7545 case OMP_CLAUSE_COPYIN:
7546 case OMP_CLAUSE_COPYPRIVATE:
7548 case OMP_CLAUSE_NUM_THREADS:
7549 case OMP_CLAUSE_SCHEDULE:
7550 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
7553 case OMP_CLAUSE_NOWAIT:
7554 case OMP_CLAUSE_ORDERED:
7555 case OMP_CLAUSE_DEFAULT:
7556 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7558 case OMP_CLAUSE_REDUCTION:
7561 for (i = 0; i < 4; i++)
7562 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
7563 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7575 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7576 But, we only want to walk once. */
7577 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
7578 for (i = 0; i < len; ++i)
7579 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7580 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
7584 /* Walk into various fields of the type that it's defining. We only
7585 want to walk into these fields of a type in this case. Note that
7586 decls get walked as part of the processing of a BIND_EXPR.
7588 ??? Precisely which fields of types that we are supposed to walk in
7589 this case vs. the normal case aren't well defined. */
7590 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL
7591 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp))) != ERROR_MARK)
7593 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
7595 /* Call the function for the type. See if it returns anything or
7596 doesn't want us to continue. If we are to continue, walk both
7597 the normal fields and those for the declaration case. */
7598 result = (*func) (type_p, &walk_subtrees, data);
7599 if (result || !walk_subtrees)
7602 result = walk_type_fields (*type_p, func, data, pset);
7606 /* If this is a record type, also walk the fields. */
7607 if (TREE_CODE (*type_p) == RECORD_TYPE
7608 || TREE_CODE (*type_p) == UNION_TYPE
7609 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7613 for (field = TYPE_FIELDS (*type_p); field;
7614 field = TREE_CHAIN (field))
7616 /* We'd like to look at the type of the field, but we can
7617 easily get infinite recursion. So assume it's pointed
7618 to elsewhere in the tree. Also, ignore things that
7620 if (TREE_CODE (field) != FIELD_DECL)
7623 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
7624 WALK_SUBTREE (DECL_SIZE (field));
7625 WALK_SUBTREE (DECL_SIZE_UNIT (field));
7626 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7627 WALK_SUBTREE (DECL_QUALIFIER (field));
7631 WALK_SUBTREE (TYPE_SIZE (*type_p));
7632 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
7637 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
7641 /* Walk over all the sub-trees of this operand. */
7642 len = TREE_CODE_LENGTH (code);
7644 /* Go through the subtrees. We need to do this in forward order so
7645 that the scope of a FOR_EXPR is handled properly. */
7648 for (i = 0; i < len - 1; ++i)
7649 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7650 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
7654 /* If this is a type, walk the needed fields in the type. */
7655 else if (TYPE_P (*tp))
7656 return walk_type_fields (*tp, func, data, pset);
7660 /* We didn't find what we were looking for. */
7663 #undef WALK_SUBTREE_TAIL
7667 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7670 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
7673 struct pointer_set_t *pset;
7675 pset = pointer_set_create ();
7676 result = walk_tree (tp, func, data, pset);
7677 pointer_set_destroy (pset);
7682 /* Return true if STMT is an empty statement or contains nothing but
7683 empty statements. */
7686 empty_body_p (tree stmt)
7688 tree_stmt_iterator i;
7691 if (IS_EMPTY_STMT (stmt))
7693 else if (TREE_CODE (stmt) == BIND_EXPR)
7694 body = BIND_EXPR_BODY (stmt);
7695 else if (TREE_CODE (stmt) == STATEMENT_LIST)
7700 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
7701 if (!empty_body_p (tsi_stmt (i)))
7707 #include "gt-tree.h"