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 int type_hash_marked_p (const void *);
169 static unsigned int type_hash_list (tree, hashval_t);
170 static unsigned int attribute_hash_list (tree, hashval_t);
172 tree global_trees[TI_MAX];
173 tree integer_types[itk_none];
175 unsigned char tree_contains_struct[256][64];
177 /* Number of operands for each OpenMP clause. */
178 unsigned const char omp_clause_num_ops[] =
180 0, /* OMP_CLAUSE_ERROR */
181 1, /* OMP_CLAUSE_PRIVATE */
182 1, /* OMP_CLAUSE_SHARED */
183 1, /* OMP_CLAUSE_FIRSTPRIVATE */
184 1, /* OMP_CLAUSE_LASTPRIVATE */
185 4, /* OMP_CLAUSE_REDUCTION */
186 1, /* OMP_CLAUSE_COPYIN */
187 1, /* OMP_CLAUSE_COPYPRIVATE */
188 1, /* OMP_CLAUSE_IF */
189 1, /* OMP_CLAUSE_NUM_THREADS */
190 1, /* OMP_CLAUSE_SCHEDULE */
191 0, /* OMP_CLAUSE_NOWAIT */
192 0, /* OMP_CLAUSE_ORDERED */
193 0 /* OMP_CLAUSE_DEFAULT */
196 const char * const omp_clause_code_name[] =
219 /* Initialize the hash table of types. */
220 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
223 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
226 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
228 init_priority_for_decl = htab_create_ggc (512, tree_int_map_hash,
230 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
233 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
234 int_cst_hash_eq, NULL);
236 int_cst_node = make_node (INTEGER_CST);
238 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
239 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
240 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
243 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
244 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
245 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
246 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
247 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
248 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
249 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
250 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
251 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
254 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
255 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
256 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
257 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
258 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
259 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
261 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
262 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
263 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
264 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
265 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
266 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
267 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
268 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
269 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
270 tree_contains_struct[STRUCT_FIELD_TAG][TS_DECL_MINIMAL] = 1;
271 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
272 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
274 tree_contains_struct[STRUCT_FIELD_TAG][TS_MEMORY_TAG] = 1;
275 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
276 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
278 tree_contains_struct[STRUCT_FIELD_TAG][TS_STRUCT_FIELD_TAG] = 1;
280 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
281 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
282 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
283 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
285 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
286 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
287 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
288 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
289 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
290 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
291 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
292 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
294 lang_hooks.init_ts ();
298 /* The name of the object as the assembler will see it (but before any
299 translations made by ASM_OUTPUT_LABELREF). Often this is the same
300 as DECL_NAME. It is an IDENTIFIER_NODE. */
302 decl_assembler_name (tree decl)
304 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
305 lang_hooks.set_decl_assembler_name (decl);
306 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
309 /* Compute the number of bytes occupied by a tree with code CODE.
310 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
311 codes, which are of variable length. */
313 tree_code_size (enum tree_code code)
315 switch (TREE_CODE_CLASS (code))
317 case tcc_declaration: /* A decl node */
322 return sizeof (struct tree_field_decl);
324 return sizeof (struct tree_parm_decl);
326 return sizeof (struct tree_var_decl);
328 return sizeof (struct tree_label_decl);
330 return sizeof (struct tree_result_decl);
332 return sizeof (struct tree_const_decl);
334 return sizeof (struct tree_type_decl);
336 return sizeof (struct tree_function_decl);
337 case NAME_MEMORY_TAG:
338 case SYMBOL_MEMORY_TAG:
339 return sizeof (struct tree_memory_tag);
340 case STRUCT_FIELD_TAG:
341 return sizeof (struct tree_struct_field_tag);
343 return sizeof (struct tree_decl_non_common);
347 case tcc_type: /* a type node */
348 return sizeof (struct tree_type);
350 case tcc_reference: /* a reference */
351 case tcc_expression: /* an expression */
352 case tcc_statement: /* an expression with side effects */
353 case tcc_comparison: /* a comparison expression */
354 case tcc_unary: /* a unary arithmetic expression */
355 case tcc_binary: /* a binary arithmetic expression */
356 return (sizeof (struct tree_exp)
357 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
359 case tcc_constant: /* a constant */
362 case INTEGER_CST: return sizeof (struct tree_int_cst);
363 case REAL_CST: return sizeof (struct tree_real_cst);
364 case COMPLEX_CST: return sizeof (struct tree_complex);
365 case VECTOR_CST: return sizeof (struct tree_vector);
366 case STRING_CST: gcc_unreachable ();
368 return lang_hooks.tree_size (code);
371 case tcc_exceptional: /* something random, like an identifier. */
374 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
375 case TREE_LIST: return sizeof (struct tree_list);
378 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
382 case PHI_NODE: gcc_unreachable ();
384 case SSA_NAME: return sizeof (struct tree_ssa_name);
386 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
387 case BLOCK: return sizeof (struct tree_block);
388 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
389 case CONSTRUCTOR: return sizeof (struct tree_constructor);
392 return lang_hooks.tree_size (code);
400 /* Compute the number of bytes occupied by NODE. This routine only
401 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
403 tree_size (tree node)
405 enum tree_code code = TREE_CODE (node);
409 return (sizeof (struct tree_phi_node)
410 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
413 return (offsetof (struct tree_binfo, base_binfos)
414 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
417 return (sizeof (struct tree_vec)
418 + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *));
421 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
424 return (sizeof (struct tree_omp_clause)
425 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
429 return tree_code_size (code);
433 /* Return a newly allocated node of code CODE. For decl and type
434 nodes, some other fields are initialized. The rest of the node is
435 initialized to zero. This function cannot be used for PHI_NODE,
436 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
439 Achoo! I got a code in the node. */
442 make_node_stat (enum tree_code code MEM_STAT_DECL)
445 enum tree_code_class type = TREE_CODE_CLASS (code);
446 size_t length = tree_code_size (code);
447 #ifdef GATHER_STATISTICS
452 case tcc_declaration: /* A decl node */
456 case tcc_type: /* a type node */
460 case tcc_statement: /* an expression with side effects */
464 case tcc_reference: /* a reference */
468 case tcc_expression: /* an expression */
469 case tcc_comparison: /* a comparison expression */
470 case tcc_unary: /* a unary arithmetic expression */
471 case tcc_binary: /* a binary arithmetic expression */
475 case tcc_constant: /* a constant */
479 case tcc_exceptional: /* something random, like an identifier. */
482 case IDENTIFIER_NODE:
499 kind = ssa_name_kind;
520 tree_node_counts[(int) kind]++;
521 tree_node_sizes[(int) kind] += length;
524 if (code == IDENTIFIER_NODE)
525 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
527 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
529 memset (t, 0, length);
531 TREE_SET_CODE (t, code);
536 TREE_SIDE_EFFECTS (t) = 1;
539 case tcc_declaration:
540 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
541 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
542 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
544 if (code != FUNCTION_DECL)
546 DECL_USER_ALIGN (t) = 0;
547 /* We have not yet computed the alias set for this declaration. */
548 DECL_POINTER_ALIAS_SET (t) = -1;
550 DECL_SOURCE_LOCATION (t) = input_location;
551 DECL_UID (t) = next_decl_uid++;
556 TYPE_UID (t) = next_type_uid++;
557 TYPE_ALIGN (t) = BITS_PER_UNIT;
558 TYPE_USER_ALIGN (t) = 0;
559 TYPE_MAIN_VARIANT (t) = t;
561 /* Default to no attributes for type, but let target change that. */
562 TYPE_ATTRIBUTES (t) = NULL_TREE;
563 targetm.set_default_type_attributes (t);
565 /* We have not yet computed the alias set for this type. */
566 TYPE_ALIAS_SET (t) = -1;
570 TREE_CONSTANT (t) = 1;
571 TREE_INVARIANT (t) = 1;
580 case PREDECREMENT_EXPR:
581 case PREINCREMENT_EXPR:
582 case POSTDECREMENT_EXPR:
583 case POSTINCREMENT_EXPR:
584 /* All of these have side-effects, no matter what their
586 TREE_SIDE_EFFECTS (t) = 1;
595 /* Other classes need no special treatment. */
602 /* Return a new node with the same contents as NODE except that its
603 TREE_CHAIN is zero and it has a fresh uid. */
606 copy_node_stat (tree node MEM_STAT_DECL)
609 enum tree_code code = TREE_CODE (node);
612 gcc_assert (code != STATEMENT_LIST);
614 length = tree_size (node);
615 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
616 memcpy (t, node, length);
619 TREE_ASM_WRITTEN (t) = 0;
620 TREE_VISITED (t) = 0;
623 if (TREE_CODE_CLASS (code) == tcc_declaration)
625 DECL_UID (t) = next_decl_uid++;
626 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
627 && DECL_HAS_VALUE_EXPR_P (node))
629 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
630 DECL_HAS_VALUE_EXPR_P (t) = 1;
632 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
634 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
635 DECL_HAS_INIT_PRIORITY_P (t) = 1;
637 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
639 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
640 DECL_BASED_ON_RESTRICT_P (t) = 1;
643 else if (TREE_CODE_CLASS (code) == tcc_type)
645 TYPE_UID (t) = next_type_uid++;
646 /* The following is so that the debug code for
647 the copy is different from the original type.
648 The two statements usually duplicate each other
649 (because they clear fields of the same union),
650 but the optimizer should catch that. */
651 TYPE_SYMTAB_POINTER (t) = 0;
652 TYPE_SYMTAB_ADDRESS (t) = 0;
654 /* Do not copy the values cache. */
655 if (TYPE_CACHED_VALUES_P(t))
657 TYPE_CACHED_VALUES_P (t) = 0;
658 TYPE_CACHED_VALUES (t) = NULL_TREE;
665 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
666 For example, this can copy a list made of TREE_LIST nodes. */
669 copy_list (tree list)
677 head = prev = copy_node (list);
678 next = TREE_CHAIN (list);
681 TREE_CHAIN (prev) = copy_node (next);
682 prev = TREE_CHAIN (prev);
683 next = TREE_CHAIN (next);
689 /* Create an INT_CST node with a LOW value sign extended. */
692 build_int_cst (tree type, HOST_WIDE_INT low)
694 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
697 /* Create an INT_CST node with a LOW value zero extended. */
700 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
702 return build_int_cst_wide (type, low, 0);
705 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
706 if it is negative. This function is similar to build_int_cst, but
707 the extra bits outside of the type precision are cleared. Constants
708 with these extra bits may confuse the fold so that it detects overflows
709 even in cases when they do not occur, and in general should be avoided.
710 We cannot however make this a default behavior of build_int_cst without
711 more intrusive changes, since there are parts of gcc that rely on the extra
712 precision of the integer constants. */
715 build_int_cst_type (tree type, HOST_WIDE_INT low)
717 unsigned HOST_WIDE_INT val = (unsigned HOST_WIDE_INT) low;
718 unsigned HOST_WIDE_INT hi, mask;
724 type = integer_type_node;
726 bits = TYPE_PRECISION (type);
727 signed_p = !TYPE_UNSIGNED (type);
729 if (bits >= HOST_BITS_PER_WIDE_INT)
730 negative = (low < 0);
733 /* If the sign bit is inside precision of LOW, use it to determine
734 the sign of the constant. */
735 negative = ((val >> (bits - 1)) & 1) != 0;
737 /* Mask out the bits outside of the precision of the constant. */
738 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
740 if (signed_p && negative)
746 /* Determine the high bits. */
747 hi = (negative ? ~(unsigned HOST_WIDE_INT) 0 : 0);
749 /* For unsigned type we need to mask out the bits outside of the type
753 if (bits <= HOST_BITS_PER_WIDE_INT)
757 bits -= HOST_BITS_PER_WIDE_INT;
758 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
763 return build_int_cst_wide (type, val, hi);
766 /* These are the hash table functions for the hash table of INTEGER_CST
767 nodes of a sizetype. */
769 /* Return the hash code code X, an INTEGER_CST. */
772 int_cst_hash_hash (const void *x)
776 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
777 ^ htab_hash_pointer (TREE_TYPE (t)));
780 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
781 is the same as that given by *Y, which is the same. */
784 int_cst_hash_eq (const void *x, const void *y)
789 return (TREE_TYPE (xt) == TREE_TYPE (yt)
790 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
791 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
794 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
795 integer_type_node is used. The returned node is always shared.
796 For small integers we use a per-type vector cache, for larger ones
797 we use a single hash table. */
800 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
807 type = integer_type_node;
809 switch (TREE_CODE (type))
813 /* Cache NULL pointer. */
822 /* Cache false or true. */
830 if (TYPE_UNSIGNED (type))
833 limit = INTEGER_SHARE_LIMIT;
834 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
840 limit = INTEGER_SHARE_LIMIT + 1;
841 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
843 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
853 /* Look for it in the type's vector of small shared ints. */
854 if (!TYPE_CACHED_VALUES_P (type))
856 TYPE_CACHED_VALUES_P (type) = 1;
857 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
860 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
863 /* Make sure no one is clobbering the shared constant. */
864 gcc_assert (TREE_TYPE (t) == type);
865 gcc_assert (TREE_INT_CST_LOW (t) == low);
866 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
870 /* Create a new shared int. */
871 t = make_node (INTEGER_CST);
873 TREE_INT_CST_LOW (t) = low;
874 TREE_INT_CST_HIGH (t) = hi;
875 TREE_TYPE (t) = type;
877 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
882 /* Use the cache of larger shared ints. */
885 TREE_INT_CST_LOW (int_cst_node) = low;
886 TREE_INT_CST_HIGH (int_cst_node) = hi;
887 TREE_TYPE (int_cst_node) = type;
889 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
893 /* Insert this one into the hash table. */
896 /* Make a new node for next time round. */
897 int_cst_node = make_node (INTEGER_CST);
904 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
905 and the rest are zeros. */
908 build_low_bits_mask (tree type, unsigned bits)
910 unsigned HOST_WIDE_INT low;
912 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
914 gcc_assert (bits <= TYPE_PRECISION (type));
916 if (bits == TYPE_PRECISION (type)
917 && !TYPE_UNSIGNED (type))
919 /* Sign extended all-ones mask. */
923 else if (bits <= HOST_BITS_PER_WIDE_INT)
925 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
930 bits -= HOST_BITS_PER_WIDE_INT;
932 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
935 return build_int_cst_wide (type, low, high);
938 /* Checks that X is integer constant that can be expressed in (unsigned)
939 HOST_WIDE_INT without loss of precision. */
942 cst_and_fits_in_hwi (tree x)
944 if (TREE_CODE (x) != INTEGER_CST)
947 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
950 return (TREE_INT_CST_HIGH (x) == 0
951 || TREE_INT_CST_HIGH (x) == -1);
954 /* Return a new VECTOR_CST node whose type is TYPE and whose values
955 are in a list pointed to by VALS. */
958 build_vector (tree type, tree vals)
960 tree v = make_node (VECTOR_CST);
961 int over1 = 0, over2 = 0;
964 TREE_VECTOR_CST_ELTS (v) = vals;
965 TREE_TYPE (v) = type;
967 /* Iterate through elements and check for overflow. */
968 for (link = vals; link; link = TREE_CHAIN (link))
970 tree value = TREE_VALUE (link);
972 /* Don't crash if we get an address constant. */
973 if (!CONSTANT_CLASS_P (value))
976 over1 |= TREE_OVERFLOW (value);
977 over2 |= TREE_CONSTANT_OVERFLOW (value);
980 TREE_OVERFLOW (v) = over1;
981 TREE_CONSTANT_OVERFLOW (v) = over2;
986 /* Return a new VECTOR_CST node whose type is TYPE and whose values
987 are extracted from V, a vector of CONSTRUCTOR_ELT. */
990 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
992 tree list = NULL_TREE;
993 unsigned HOST_WIDE_INT idx;
996 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
997 list = tree_cons (NULL_TREE, value, list);
998 return build_vector (type, nreverse (list));
1001 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1002 are in the VEC pointed to by VALS. */
1004 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1006 tree c = make_node (CONSTRUCTOR);
1007 TREE_TYPE (c) = type;
1008 CONSTRUCTOR_ELTS (c) = vals;
1012 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1015 build_constructor_single (tree type, tree index, tree value)
1017 VEC(constructor_elt,gc) *v;
1018 constructor_elt *elt;
1021 v = VEC_alloc (constructor_elt, gc, 1);
1022 elt = VEC_quick_push (constructor_elt, v, NULL);
1026 t = build_constructor (type, v);
1027 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1032 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1033 are in a list pointed to by VALS. */
1035 build_constructor_from_list (tree type, tree vals)
1038 VEC(constructor_elt,gc) *v = NULL;
1039 bool constant_p = true;
1043 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1044 for (t = vals; t; t = TREE_CHAIN (t))
1046 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1047 val = TREE_VALUE (t);
1048 elt->index = TREE_PURPOSE (t);
1050 if (!TREE_CONSTANT (val))
1055 t = build_constructor (type, v);
1056 TREE_CONSTANT (t) = constant_p;
1061 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1064 build_real (tree type, REAL_VALUE_TYPE d)
1067 REAL_VALUE_TYPE *dp;
1070 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1071 Consider doing it via real_convert now. */
1073 v = make_node (REAL_CST);
1074 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1075 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1077 TREE_TYPE (v) = type;
1078 TREE_REAL_CST_PTR (v) = dp;
1079 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1083 /* Return a new REAL_CST node whose type is TYPE
1084 and whose value is the integer value of the INTEGER_CST node I. */
1087 real_value_from_int_cst (tree type, tree i)
1091 /* Clear all bits of the real value type so that we can later do
1092 bitwise comparisons to see if two values are the same. */
1093 memset (&d, 0, sizeof d);
1095 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1096 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1097 TYPE_UNSIGNED (TREE_TYPE (i)));
1101 /* Given a tree representing an integer constant I, return a tree
1102 representing the same value as a floating-point constant of type TYPE. */
1105 build_real_from_int_cst (tree type, tree i)
1108 int overflow = TREE_OVERFLOW (i);
1110 v = build_real (type, real_value_from_int_cst (type, i));
1112 TREE_OVERFLOW (v) |= overflow;
1113 TREE_CONSTANT_OVERFLOW (v) |= overflow;
1117 /* Return a newly constructed STRING_CST node whose value is
1118 the LEN characters at STR.
1119 The TREE_TYPE is not initialized. */
1122 build_string (int len, const char *str)
1127 /* Do not waste bytes provided by padding of struct tree_string. */
1128 length = len + offsetof (struct tree_string, str) + 1;
1130 #ifdef GATHER_STATISTICS
1131 tree_node_counts[(int) c_kind]++;
1132 tree_node_sizes[(int) c_kind] += length;
1135 s = ggc_alloc_tree (length);
1137 memset (s, 0, sizeof (struct tree_common));
1138 TREE_SET_CODE (s, STRING_CST);
1139 TREE_CONSTANT (s) = 1;
1140 TREE_INVARIANT (s) = 1;
1141 TREE_STRING_LENGTH (s) = len;
1142 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1143 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1148 /* Return a newly constructed COMPLEX_CST node whose value is
1149 specified by the real and imaginary parts REAL and IMAG.
1150 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1151 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1154 build_complex (tree type, tree real, tree imag)
1156 tree t = make_node (COMPLEX_CST);
1158 TREE_REALPART (t) = real;
1159 TREE_IMAGPART (t) = imag;
1160 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1161 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1162 TREE_CONSTANT_OVERFLOW (t)
1163 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1167 /* Return a constant of arithmetic type TYPE which is the
1168 multiplicative identity of the set TYPE. */
1171 build_one_cst (tree type)
1173 switch (TREE_CODE (type))
1175 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1176 case POINTER_TYPE: case REFERENCE_TYPE:
1178 return build_int_cst (type, 1);
1181 return build_real (type, dconst1);
1188 scalar = build_one_cst (TREE_TYPE (type));
1190 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1192 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1193 cst = tree_cons (NULL_TREE, scalar, cst);
1195 return build_vector (type, cst);
1199 return build_complex (type,
1200 build_one_cst (TREE_TYPE (type)),
1201 fold_convert (TREE_TYPE (type), integer_zero_node));
1208 /* Build a BINFO with LEN language slots. */
1211 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1214 size_t length = (offsetof (struct tree_binfo, base_binfos)
1215 + VEC_embedded_size (tree, base_binfos));
1217 #ifdef GATHER_STATISTICS
1218 tree_node_counts[(int) binfo_kind]++;
1219 tree_node_sizes[(int) binfo_kind] += length;
1222 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1224 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1226 TREE_SET_CODE (t, TREE_BINFO);
1228 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1234 /* Build a newly constructed TREE_VEC node of length LEN. */
1237 make_tree_vec_stat (int len MEM_STAT_DECL)
1240 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1242 #ifdef GATHER_STATISTICS
1243 tree_node_counts[(int) vec_kind]++;
1244 tree_node_sizes[(int) vec_kind] += length;
1247 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1249 memset (t, 0, length);
1251 TREE_SET_CODE (t, TREE_VEC);
1252 TREE_VEC_LENGTH (t) = len;
1257 /* Return 1 if EXPR is the integer constant zero or a complex constant
1261 integer_zerop (tree expr)
1265 return ((TREE_CODE (expr) == INTEGER_CST
1266 && TREE_INT_CST_LOW (expr) == 0
1267 && TREE_INT_CST_HIGH (expr) == 0)
1268 || (TREE_CODE (expr) == COMPLEX_CST
1269 && integer_zerop (TREE_REALPART (expr))
1270 && integer_zerop (TREE_IMAGPART (expr))));
1273 /* Return 1 if EXPR is the integer constant one or the corresponding
1274 complex constant. */
1277 integer_onep (tree expr)
1281 return ((TREE_CODE (expr) == INTEGER_CST
1282 && TREE_INT_CST_LOW (expr) == 1
1283 && TREE_INT_CST_HIGH (expr) == 0)
1284 || (TREE_CODE (expr) == COMPLEX_CST
1285 && integer_onep (TREE_REALPART (expr))
1286 && integer_zerop (TREE_IMAGPART (expr))));
1289 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1290 it contains. Likewise for the corresponding complex constant. */
1293 integer_all_onesp (tree expr)
1300 if (TREE_CODE (expr) == COMPLEX_CST
1301 && integer_all_onesp (TREE_REALPART (expr))
1302 && integer_zerop (TREE_IMAGPART (expr)))
1305 else if (TREE_CODE (expr) != INTEGER_CST)
1308 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1309 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1310 && TREE_INT_CST_HIGH (expr) == -1)
1315 /* Note that using TYPE_PRECISION here is wrong. We care about the
1316 actual bits, not the (arbitrary) range of the type. */
1317 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1318 if (prec >= HOST_BITS_PER_WIDE_INT)
1320 HOST_WIDE_INT high_value;
1323 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1325 /* Can not handle precisions greater than twice the host int size. */
1326 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1327 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1328 /* Shifting by the host word size is undefined according to the ANSI
1329 standard, so we must handle this as a special case. */
1332 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1334 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1335 && TREE_INT_CST_HIGH (expr) == high_value);
1338 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1341 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1345 integer_pow2p (tree expr)
1348 HOST_WIDE_INT high, low;
1352 if (TREE_CODE (expr) == COMPLEX_CST
1353 && integer_pow2p (TREE_REALPART (expr))
1354 && integer_zerop (TREE_IMAGPART (expr)))
1357 if (TREE_CODE (expr) != INTEGER_CST)
1360 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1361 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1362 high = TREE_INT_CST_HIGH (expr);
1363 low = TREE_INT_CST_LOW (expr);
1365 /* First clear all bits that are beyond the type's precision in case
1366 we've been sign extended. */
1368 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1370 else if (prec > HOST_BITS_PER_WIDE_INT)
1371 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1375 if (prec < HOST_BITS_PER_WIDE_INT)
1376 low &= ~((HOST_WIDE_INT) (-1) << prec);
1379 if (high == 0 && low == 0)
1382 return ((high == 0 && (low & (low - 1)) == 0)
1383 || (low == 0 && (high & (high - 1)) == 0));
1386 /* Return 1 if EXPR is an integer constant other than zero or a
1387 complex constant other than zero. */
1390 integer_nonzerop (tree expr)
1394 return ((TREE_CODE (expr) == INTEGER_CST
1395 && (TREE_INT_CST_LOW (expr) != 0
1396 || TREE_INT_CST_HIGH (expr) != 0))
1397 || (TREE_CODE (expr) == COMPLEX_CST
1398 && (integer_nonzerop (TREE_REALPART (expr))
1399 || integer_nonzerop (TREE_IMAGPART (expr)))));
1402 /* Return the power of two represented by a tree node known to be a
1406 tree_log2 (tree expr)
1409 HOST_WIDE_INT high, low;
1413 if (TREE_CODE (expr) == COMPLEX_CST)
1414 return tree_log2 (TREE_REALPART (expr));
1416 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1417 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1419 high = TREE_INT_CST_HIGH (expr);
1420 low = TREE_INT_CST_LOW (expr);
1422 /* First clear all bits that are beyond the type's precision in case
1423 we've been sign extended. */
1425 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1427 else if (prec > HOST_BITS_PER_WIDE_INT)
1428 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1432 if (prec < HOST_BITS_PER_WIDE_INT)
1433 low &= ~((HOST_WIDE_INT) (-1) << prec);
1436 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1437 : exact_log2 (low));
1440 /* Similar, but return the largest integer Y such that 2 ** Y is less
1441 than or equal to EXPR. */
1444 tree_floor_log2 (tree expr)
1447 HOST_WIDE_INT high, low;
1451 if (TREE_CODE (expr) == COMPLEX_CST)
1452 return tree_log2 (TREE_REALPART (expr));
1454 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1455 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1457 high = TREE_INT_CST_HIGH (expr);
1458 low = TREE_INT_CST_LOW (expr);
1460 /* First clear all bits that are beyond the type's precision in case
1461 we've been sign extended. Ignore if type's precision hasn't been set
1462 since what we are doing is setting it. */
1464 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1466 else if (prec > HOST_BITS_PER_WIDE_INT)
1467 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1471 if (prec < HOST_BITS_PER_WIDE_INT)
1472 low &= ~((HOST_WIDE_INT) (-1) << prec);
1475 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1476 : floor_log2 (low));
1479 /* Return 1 if EXPR is the real constant zero. */
1482 real_zerop (tree expr)
1486 return ((TREE_CODE (expr) == REAL_CST
1487 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1488 || (TREE_CODE (expr) == COMPLEX_CST
1489 && real_zerop (TREE_REALPART (expr))
1490 && real_zerop (TREE_IMAGPART (expr))));
1493 /* Return 1 if EXPR is the real constant one in real or complex form. */
1496 real_onep (tree expr)
1500 return ((TREE_CODE (expr) == REAL_CST
1501 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1502 || (TREE_CODE (expr) == COMPLEX_CST
1503 && real_onep (TREE_REALPART (expr))
1504 && real_zerop (TREE_IMAGPART (expr))));
1507 /* Return 1 if EXPR is the real constant two. */
1510 real_twop (tree expr)
1514 return ((TREE_CODE (expr) == REAL_CST
1515 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1516 || (TREE_CODE (expr) == COMPLEX_CST
1517 && real_twop (TREE_REALPART (expr))
1518 && real_zerop (TREE_IMAGPART (expr))));
1521 /* Return 1 if EXPR is the real constant minus one. */
1524 real_minus_onep (tree expr)
1528 return ((TREE_CODE (expr) == REAL_CST
1529 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1530 || (TREE_CODE (expr) == COMPLEX_CST
1531 && real_minus_onep (TREE_REALPART (expr))
1532 && real_zerop (TREE_IMAGPART (expr))));
1535 /* Nonzero if EXP is a constant or a cast of a constant. */
1538 really_constant_p (tree exp)
1540 /* This is not quite the same as STRIP_NOPS. It does more. */
1541 while (TREE_CODE (exp) == NOP_EXPR
1542 || TREE_CODE (exp) == CONVERT_EXPR
1543 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1544 exp = TREE_OPERAND (exp, 0);
1545 return TREE_CONSTANT (exp);
1548 /* Return first list element whose TREE_VALUE is ELEM.
1549 Return 0 if ELEM is not in LIST. */
1552 value_member (tree elem, tree list)
1556 if (elem == TREE_VALUE (list))
1558 list = TREE_CHAIN (list);
1563 /* Return first list element whose TREE_PURPOSE is ELEM.
1564 Return 0 if ELEM is not in LIST. */
1567 purpose_member (tree elem, tree list)
1571 if (elem == TREE_PURPOSE (list))
1573 list = TREE_CHAIN (list);
1578 /* Return nonzero if ELEM is part of the chain CHAIN. */
1581 chain_member (tree elem, tree chain)
1587 chain = TREE_CHAIN (chain);
1593 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1594 We expect a null pointer to mark the end of the chain.
1595 This is the Lisp primitive `length'. */
1598 list_length (tree t)
1601 #ifdef ENABLE_TREE_CHECKING
1609 #ifdef ENABLE_TREE_CHECKING
1612 gcc_assert (p != q);
1620 /* Returns the number of FIELD_DECLs in TYPE. */
1623 fields_length (tree type)
1625 tree t = TYPE_FIELDS (type);
1628 for (; t; t = TREE_CHAIN (t))
1629 if (TREE_CODE (t) == FIELD_DECL)
1635 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1636 by modifying the last node in chain 1 to point to chain 2.
1637 This is the Lisp primitive `nconc'. */
1640 chainon (tree op1, tree op2)
1649 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1651 TREE_CHAIN (t1) = op2;
1653 #ifdef ENABLE_TREE_CHECKING
1656 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1657 gcc_assert (t2 != t1);
1664 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1667 tree_last (tree chain)
1671 while ((next = TREE_CHAIN (chain)))
1676 /* Reverse the order of elements in the chain T,
1677 and return the new head of the chain (old last element). */
1682 tree prev = 0, decl, next;
1683 for (decl = t; decl; decl = next)
1685 next = TREE_CHAIN (decl);
1686 TREE_CHAIN (decl) = prev;
1692 /* Return a newly created TREE_LIST node whose
1693 purpose and value fields are PARM and VALUE. */
1696 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1698 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1699 TREE_PURPOSE (t) = parm;
1700 TREE_VALUE (t) = value;
1704 /* Return a newly created TREE_LIST node whose
1705 purpose and value fields are PURPOSE and VALUE
1706 and whose TREE_CHAIN is CHAIN. */
1709 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1713 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1715 memset (node, 0, sizeof (struct tree_common));
1717 #ifdef GATHER_STATISTICS
1718 tree_node_counts[(int) x_kind]++;
1719 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1722 TREE_SET_CODE (node, TREE_LIST);
1723 TREE_CHAIN (node) = chain;
1724 TREE_PURPOSE (node) = purpose;
1725 TREE_VALUE (node) = value;
1730 /* Return the size nominally occupied by an object of type TYPE
1731 when it resides in memory. The value is measured in units of bytes,
1732 and its data type is that normally used for type sizes
1733 (which is the first type created by make_signed_type or
1734 make_unsigned_type). */
1737 size_in_bytes (tree type)
1741 if (type == error_mark_node)
1742 return integer_zero_node;
1744 type = TYPE_MAIN_VARIANT (type);
1745 t = TYPE_SIZE_UNIT (type);
1749 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1750 return size_zero_node;
1753 if (TREE_CODE (t) == INTEGER_CST)
1754 t = force_fit_type (t, 0, false, false);
1759 /* Return the size of TYPE (in bytes) as a wide integer
1760 or return -1 if the size can vary or is larger than an integer. */
1763 int_size_in_bytes (tree type)
1767 if (type == error_mark_node)
1770 type = TYPE_MAIN_VARIANT (type);
1771 t = TYPE_SIZE_UNIT (type);
1773 || TREE_CODE (t) != INTEGER_CST
1774 || TREE_INT_CST_HIGH (t) != 0
1775 /* If the result would appear negative, it's too big to represent. */
1776 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1779 return TREE_INT_CST_LOW (t);
1782 /* Return the maximum size of TYPE (in bytes) as a wide integer
1783 or return -1 if the size can vary or is larger than an integer. */
1786 max_int_size_in_bytes (tree type)
1788 HOST_WIDE_INT size = -1;
1791 /* If this is an array type, check for a possible MAX_SIZE attached. */
1793 if (TREE_CODE (type) == ARRAY_TYPE)
1795 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1797 if (size_tree && host_integerp (size_tree, 1))
1798 size = tree_low_cst (size_tree, 1);
1801 /* If we still haven't been able to get a size, see if the language
1802 can compute a maximum size. */
1806 size_tree = lang_hooks.types.max_size (type);
1808 if (size_tree && host_integerp (size_tree, 1))
1809 size = tree_low_cst (size_tree, 1);
1815 /* Return the bit position of FIELD, in bits from the start of the record.
1816 This is a tree of type bitsizetype. */
1819 bit_position (tree field)
1821 return bit_from_pos (DECL_FIELD_OFFSET (field),
1822 DECL_FIELD_BIT_OFFSET (field));
1825 /* Likewise, but return as an integer. It must be representable in
1826 that way (since it could be a signed value, we don't have the
1827 option of returning -1 like int_size_in_byte can. */
1830 int_bit_position (tree field)
1832 return tree_low_cst (bit_position (field), 0);
1835 /* Return the byte position of FIELD, in bytes from the start of the record.
1836 This is a tree of type sizetype. */
1839 byte_position (tree field)
1841 return byte_from_pos (DECL_FIELD_OFFSET (field),
1842 DECL_FIELD_BIT_OFFSET (field));
1845 /* Likewise, but return as an integer. It must be representable in
1846 that way (since it could be a signed value, we don't have the
1847 option of returning -1 like int_size_in_byte can. */
1850 int_byte_position (tree field)
1852 return tree_low_cst (byte_position (field), 0);
1855 /* Return the strictest alignment, in bits, that T is known to have. */
1860 unsigned int align0, align1;
1862 switch (TREE_CODE (t))
1864 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1865 /* If we have conversions, we know that the alignment of the
1866 object must meet each of the alignments of the types. */
1867 align0 = expr_align (TREE_OPERAND (t, 0));
1868 align1 = TYPE_ALIGN (TREE_TYPE (t));
1869 return MAX (align0, align1);
1871 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1872 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1873 case CLEANUP_POINT_EXPR:
1874 /* These don't change the alignment of an object. */
1875 return expr_align (TREE_OPERAND (t, 0));
1878 /* The best we can do is say that the alignment is the least aligned
1880 align0 = expr_align (TREE_OPERAND (t, 1));
1881 align1 = expr_align (TREE_OPERAND (t, 2));
1882 return MIN (align0, align1);
1884 case LABEL_DECL: case CONST_DECL:
1885 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1886 if (DECL_ALIGN (t) != 0)
1887 return DECL_ALIGN (t);
1891 return FUNCTION_BOUNDARY;
1897 /* Otherwise take the alignment from that of the type. */
1898 return TYPE_ALIGN (TREE_TYPE (t));
1901 /* Return, as a tree node, the number of elements for TYPE (which is an
1902 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1905 array_type_nelts (tree type)
1907 tree index_type, min, max;
1909 /* If they did it with unspecified bounds, then we should have already
1910 given an error about it before we got here. */
1911 if (! TYPE_DOMAIN (type))
1912 return error_mark_node;
1914 index_type = TYPE_DOMAIN (type);
1915 min = TYPE_MIN_VALUE (index_type);
1916 max = TYPE_MAX_VALUE (index_type);
1918 return (integer_zerop (min)
1920 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1923 /* If arg is static -- a reference to an object in static storage -- then
1924 return the object. This is not the same as the C meaning of `static'.
1925 If arg isn't static, return NULL. */
1930 switch (TREE_CODE (arg))
1933 /* Nested functions are static, even though taking their address will
1934 involve a trampoline as we unnest the nested function and create
1935 the trampoline on the tree level. */
1939 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1940 && ! DECL_THREAD_LOCAL_P (arg)
1941 && ! DECL_DLLIMPORT_P (arg)
1945 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1949 return TREE_STATIC (arg) ? arg : NULL;
1956 /* If the thing being referenced is not a field, then it is
1957 something language specific. */
1958 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1959 return (*lang_hooks.staticp) (arg);
1961 /* If we are referencing a bitfield, we can't evaluate an
1962 ADDR_EXPR at compile time and so it isn't a constant. */
1963 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1966 return staticp (TREE_OPERAND (arg, 0));
1971 case MISALIGNED_INDIRECT_REF:
1972 case ALIGN_INDIRECT_REF:
1974 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
1977 case ARRAY_RANGE_REF:
1978 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1979 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1980 return staticp (TREE_OPERAND (arg, 0));
1985 if ((unsigned int) TREE_CODE (arg)
1986 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1987 return lang_hooks.staticp (arg);
1993 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1994 Do this to any expression which may be used in more than one place,
1995 but must be evaluated only once.
1997 Normally, expand_expr would reevaluate the expression each time.
1998 Calling save_expr produces something that is evaluated and recorded
1999 the first time expand_expr is called on it. Subsequent calls to
2000 expand_expr just reuse the recorded value.
2002 The call to expand_expr that generates code that actually computes
2003 the value is the first call *at compile time*. Subsequent calls
2004 *at compile time* generate code to use the saved value.
2005 This produces correct result provided that *at run time* control
2006 always flows through the insns made by the first expand_expr
2007 before reaching the other places where the save_expr was evaluated.
2008 You, the caller of save_expr, must make sure this is so.
2010 Constants, and certain read-only nodes, are returned with no
2011 SAVE_EXPR because that is safe. Expressions containing placeholders
2012 are not touched; see tree.def for an explanation of what these
2016 save_expr (tree expr)
2018 tree t = fold (expr);
2021 /* If the tree evaluates to a constant, then we don't want to hide that
2022 fact (i.e. this allows further folding, and direct checks for constants).
2023 However, a read-only object that has side effects cannot be bypassed.
2024 Since it is no problem to reevaluate literals, we just return the
2026 inner = skip_simple_arithmetic (t);
2028 if (TREE_INVARIANT (inner)
2029 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2030 || TREE_CODE (inner) == SAVE_EXPR
2031 || TREE_CODE (inner) == ERROR_MARK)
2034 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2035 it means that the size or offset of some field of an object depends on
2036 the value within another field.
2038 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2039 and some variable since it would then need to be both evaluated once and
2040 evaluated more than once. Front-ends must assure this case cannot
2041 happen by surrounding any such subexpressions in their own SAVE_EXPR
2042 and forcing evaluation at the proper time. */
2043 if (contains_placeholder_p (inner))
2046 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2048 /* This expression might be placed ahead of a jump to ensure that the
2049 value was computed on both sides of the jump. So make sure it isn't
2050 eliminated as dead. */
2051 TREE_SIDE_EFFECTS (t) = 1;
2052 TREE_INVARIANT (t) = 1;
2056 /* Look inside EXPR and into any simple arithmetic operations. Return
2057 the innermost non-arithmetic node. */
2060 skip_simple_arithmetic (tree expr)
2064 /* We don't care about whether this can be used as an lvalue in this
2066 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2067 expr = TREE_OPERAND (expr, 0);
2069 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2070 a constant, it will be more efficient to not make another SAVE_EXPR since
2071 it will allow better simplification and GCSE will be able to merge the
2072 computations if they actually occur. */
2076 if (UNARY_CLASS_P (inner))
2077 inner = TREE_OPERAND (inner, 0);
2078 else if (BINARY_CLASS_P (inner))
2080 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2081 inner = TREE_OPERAND (inner, 0);
2082 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2083 inner = TREE_OPERAND (inner, 1);
2094 /* Return which tree structure is used by T. */
2096 enum tree_node_structure_enum
2097 tree_node_structure (tree t)
2099 enum tree_code code = TREE_CODE (t);
2101 switch (TREE_CODE_CLASS (code))
2103 case tcc_declaration:
2108 return TS_FIELD_DECL;
2110 return TS_PARM_DECL;
2114 return TS_LABEL_DECL;
2116 return TS_RESULT_DECL;
2118 return TS_CONST_DECL;
2120 return TS_TYPE_DECL;
2122 return TS_FUNCTION_DECL;
2123 case SYMBOL_MEMORY_TAG:
2124 case NAME_MEMORY_TAG:
2125 case STRUCT_FIELD_TAG:
2126 return TS_MEMORY_TAG;
2128 return TS_DECL_NON_COMMON;
2134 case tcc_comparison:
2137 case tcc_expression:
2140 default: /* tcc_constant and tcc_exceptional */
2145 /* tcc_constant cases. */
2146 case INTEGER_CST: return TS_INT_CST;
2147 case REAL_CST: return TS_REAL_CST;
2148 case COMPLEX_CST: return TS_COMPLEX;
2149 case VECTOR_CST: return TS_VECTOR;
2150 case STRING_CST: return TS_STRING;
2151 /* tcc_exceptional cases. */
2152 case ERROR_MARK: return TS_COMMON;
2153 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2154 case TREE_LIST: return TS_LIST;
2155 case TREE_VEC: return TS_VEC;
2156 case PHI_NODE: return TS_PHI_NODE;
2157 case SSA_NAME: return TS_SSA_NAME;
2158 case PLACEHOLDER_EXPR: return TS_COMMON;
2159 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2160 case BLOCK: return TS_BLOCK;
2161 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2162 case TREE_BINFO: return TS_BINFO;
2163 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2164 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2171 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2172 or offset that depends on a field within a record. */
2175 contains_placeholder_p (tree exp)
2177 enum tree_code code;
2182 code = TREE_CODE (exp);
2183 if (code == PLACEHOLDER_EXPR)
2186 switch (TREE_CODE_CLASS (code))
2189 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2190 position computations since they will be converted into a
2191 WITH_RECORD_EXPR involving the reference, which will assume
2192 here will be valid. */
2193 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2195 case tcc_exceptional:
2196 if (code == TREE_LIST)
2197 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2198 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2203 case tcc_comparison:
2204 case tcc_expression:
2208 /* Ignoring the first operand isn't quite right, but works best. */
2209 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2212 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2213 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2214 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2217 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2223 switch (TREE_CODE_LENGTH (code))
2226 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2228 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2229 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2240 /* Return true if any part of the computation of TYPE involves a
2241 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2242 (for QUAL_UNION_TYPE) and field positions. */
2245 type_contains_placeholder_1 (tree type)
2247 /* If the size contains a placeholder or the parent type (component type in
2248 the case of arrays) type involves a placeholder, this type does. */
2249 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2250 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2251 || (TREE_TYPE (type) != 0
2252 && type_contains_placeholder_p (TREE_TYPE (type))))
2255 /* Now do type-specific checks. Note that the last part of the check above
2256 greatly limits what we have to do below. */
2257 switch (TREE_CODE (type))
2265 case REFERENCE_TYPE:
2273 /* Here we just check the bounds. */
2274 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2275 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2278 /* We're already checked the component type (TREE_TYPE), so just check
2280 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2284 case QUAL_UNION_TYPE:
2288 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2289 if (TREE_CODE (field) == FIELD_DECL
2290 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2291 || (TREE_CODE (type) == QUAL_UNION_TYPE
2292 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2293 || type_contains_placeholder_p (TREE_TYPE (field))))
2305 type_contains_placeholder_p (tree type)
2309 /* If the contains_placeholder_bits field has been initialized,
2310 then we know the answer. */
2311 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2312 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2314 /* Indicate that we've seen this type node, and the answer is false.
2315 This is what we want to return if we run into recursion via fields. */
2316 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2318 /* Compute the real value. */
2319 result = type_contains_placeholder_1 (type);
2321 /* Store the real value. */
2322 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2327 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2328 return a tree with all occurrences of references to F in a
2329 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2330 contains only arithmetic expressions or a CALL_EXPR with a
2331 PLACEHOLDER_EXPR occurring only in its arglist. */
2334 substitute_in_expr (tree exp, tree f, tree r)
2336 enum tree_code code = TREE_CODE (exp);
2337 tree op0, op1, op2, op3;
2341 /* We handle TREE_LIST and COMPONENT_REF separately. */
2342 if (code == TREE_LIST)
2344 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2345 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2346 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2349 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2351 else if (code == COMPONENT_REF)
2353 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2354 and it is the right field, replace it with R. */
2355 for (inner = TREE_OPERAND (exp, 0);
2356 REFERENCE_CLASS_P (inner);
2357 inner = TREE_OPERAND (inner, 0))
2359 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2360 && TREE_OPERAND (exp, 1) == f)
2363 /* If this expression hasn't been completed let, leave it alone. */
2364 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2367 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2368 if (op0 == TREE_OPERAND (exp, 0))
2371 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2372 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2375 switch (TREE_CODE_CLASS (code))
2378 case tcc_declaration:
2381 case tcc_exceptional:
2384 case tcc_comparison:
2385 case tcc_expression:
2387 switch (TREE_CODE_LENGTH (code))
2393 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2394 if (op0 == TREE_OPERAND (exp, 0))
2397 new = fold_build1 (code, TREE_TYPE (exp), op0);
2401 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2402 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2404 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2407 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2411 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2412 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2413 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2415 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2416 && op2 == TREE_OPERAND (exp, 2))
2419 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2423 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2424 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2425 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2426 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2428 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2429 && op2 == TREE_OPERAND (exp, 2)
2430 && op3 == TREE_OPERAND (exp, 3))
2433 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2445 TREE_READONLY (new) = TREE_READONLY (exp);
2449 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2450 for it within OBJ, a tree that is an object or a chain of references. */
2453 substitute_placeholder_in_expr (tree exp, tree obj)
2455 enum tree_code code = TREE_CODE (exp);
2456 tree op0, op1, op2, op3;
2458 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2459 in the chain of OBJ. */
2460 if (code == PLACEHOLDER_EXPR)
2462 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2465 for (elt = obj; elt != 0;
2466 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2467 || TREE_CODE (elt) == COND_EXPR)
2468 ? TREE_OPERAND (elt, 1)
2469 : (REFERENCE_CLASS_P (elt)
2470 || UNARY_CLASS_P (elt)
2471 || BINARY_CLASS_P (elt)
2472 || EXPRESSION_CLASS_P (elt))
2473 ? TREE_OPERAND (elt, 0) : 0))
2474 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2477 for (elt = obj; elt != 0;
2478 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2479 || TREE_CODE (elt) == COND_EXPR)
2480 ? TREE_OPERAND (elt, 1)
2481 : (REFERENCE_CLASS_P (elt)
2482 || UNARY_CLASS_P (elt)
2483 || BINARY_CLASS_P (elt)
2484 || EXPRESSION_CLASS_P (elt))
2485 ? TREE_OPERAND (elt, 0) : 0))
2486 if (POINTER_TYPE_P (TREE_TYPE (elt))
2487 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2489 return fold_build1 (INDIRECT_REF, need_type, elt);
2491 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2492 survives until RTL generation, there will be an error. */
2496 /* TREE_LIST is special because we need to look at TREE_VALUE
2497 and TREE_CHAIN, not TREE_OPERANDS. */
2498 else if (code == TREE_LIST)
2500 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2501 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2502 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2505 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2508 switch (TREE_CODE_CLASS (code))
2511 case tcc_declaration:
2514 case tcc_exceptional:
2517 case tcc_comparison:
2518 case tcc_expression:
2521 switch (TREE_CODE_LENGTH (code))
2527 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2528 if (op0 == TREE_OPERAND (exp, 0))
2531 return fold_build1 (code, TREE_TYPE (exp), op0);
2534 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2535 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2537 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2540 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2543 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2544 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2545 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2547 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2548 && op2 == TREE_OPERAND (exp, 2))
2551 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2554 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2555 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2556 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2557 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2559 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2560 && op2 == TREE_OPERAND (exp, 2)
2561 && op3 == TREE_OPERAND (exp, 3))
2564 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2576 /* Stabilize a reference so that we can use it any number of times
2577 without causing its operands to be evaluated more than once.
2578 Returns the stabilized reference. This works by means of save_expr,
2579 so see the caveats in the comments about save_expr.
2581 Also allows conversion expressions whose operands are references.
2582 Any other kind of expression is returned unchanged. */
2585 stabilize_reference (tree ref)
2588 enum tree_code code = TREE_CODE (ref);
2595 /* No action is needed in this case. */
2601 case FIX_TRUNC_EXPR:
2602 case FIX_FLOOR_EXPR:
2603 case FIX_ROUND_EXPR:
2605 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2609 result = build_nt (INDIRECT_REF,
2610 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2614 result = build_nt (COMPONENT_REF,
2615 stabilize_reference (TREE_OPERAND (ref, 0)),
2616 TREE_OPERAND (ref, 1), NULL_TREE);
2620 result = build_nt (BIT_FIELD_REF,
2621 stabilize_reference (TREE_OPERAND (ref, 0)),
2622 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2623 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2627 result = build_nt (ARRAY_REF,
2628 stabilize_reference (TREE_OPERAND (ref, 0)),
2629 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2630 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2633 case ARRAY_RANGE_REF:
2634 result = build_nt (ARRAY_RANGE_REF,
2635 stabilize_reference (TREE_OPERAND (ref, 0)),
2636 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2637 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2641 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2642 it wouldn't be ignored. This matters when dealing with
2644 return stabilize_reference_1 (ref);
2646 /* If arg isn't a kind of lvalue we recognize, make no change.
2647 Caller should recognize the error for an invalid lvalue. */
2652 return error_mark_node;
2655 TREE_TYPE (result) = TREE_TYPE (ref);
2656 TREE_READONLY (result) = TREE_READONLY (ref);
2657 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2658 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2663 /* Subroutine of stabilize_reference; this is called for subtrees of
2664 references. Any expression with side-effects must be put in a SAVE_EXPR
2665 to ensure that it is only evaluated once.
2667 We don't put SAVE_EXPR nodes around everything, because assigning very
2668 simple expressions to temporaries causes us to miss good opportunities
2669 for optimizations. Among other things, the opportunity to fold in the
2670 addition of a constant into an addressing mode often gets lost, e.g.
2671 "y[i+1] += x;". In general, we take the approach that we should not make
2672 an assignment unless we are forced into it - i.e., that any non-side effect
2673 operator should be allowed, and that cse should take care of coalescing
2674 multiple utterances of the same expression should that prove fruitful. */
2677 stabilize_reference_1 (tree e)
2680 enum tree_code code = TREE_CODE (e);
2682 /* We cannot ignore const expressions because it might be a reference
2683 to a const array but whose index contains side-effects. But we can
2684 ignore things that are actual constant or that already have been
2685 handled by this function. */
2687 if (TREE_INVARIANT (e))
2690 switch (TREE_CODE_CLASS (code))
2692 case tcc_exceptional:
2694 case tcc_declaration:
2695 case tcc_comparison:
2697 case tcc_expression:
2699 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2700 so that it will only be evaluated once. */
2701 /* The reference (r) and comparison (<) classes could be handled as
2702 below, but it is generally faster to only evaluate them once. */
2703 if (TREE_SIDE_EFFECTS (e))
2704 return save_expr (e);
2708 /* Constants need no processing. In fact, we should never reach
2713 /* Division is slow and tends to be compiled with jumps,
2714 especially the division by powers of 2 that is often
2715 found inside of an array reference. So do it just once. */
2716 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2717 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2718 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2719 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2720 return save_expr (e);
2721 /* Recursively stabilize each operand. */
2722 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2723 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2727 /* Recursively stabilize each operand. */
2728 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2735 TREE_TYPE (result) = TREE_TYPE (e);
2736 TREE_READONLY (result) = TREE_READONLY (e);
2737 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2738 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2739 TREE_INVARIANT (result) = 1;
2744 /* Low-level constructors for expressions. */
2746 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2747 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2750 recompute_tree_invariant_for_addr_expr (tree t)
2753 bool tc = true, ti = true, se = false;
2755 /* We started out assuming this address is both invariant and constant, but
2756 does not have side effects. Now go down any handled components and see if
2757 any of them involve offsets that are either non-constant or non-invariant.
2758 Also check for side-effects.
2760 ??? Note that this code makes no attempt to deal with the case where
2761 taking the address of something causes a copy due to misalignment. */
2763 #define UPDATE_TITCSE(NODE) \
2764 do { tree _node = (NODE); \
2765 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2766 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2767 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2769 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2770 node = TREE_OPERAND (node, 0))
2772 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2773 array reference (probably made temporarily by the G++ front end),
2774 so ignore all the operands. */
2775 if ((TREE_CODE (node) == ARRAY_REF
2776 || TREE_CODE (node) == ARRAY_RANGE_REF)
2777 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2779 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2780 if (TREE_OPERAND (node, 2))
2781 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2782 if (TREE_OPERAND (node, 3))
2783 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2785 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2786 FIELD_DECL, apparently. The G++ front end can put something else
2787 there, at least temporarily. */
2788 else if (TREE_CODE (node) == COMPONENT_REF
2789 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2791 if (TREE_OPERAND (node, 2))
2792 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2794 else if (TREE_CODE (node) == BIT_FIELD_REF)
2795 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2798 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2800 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2801 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2802 invariant and constant if the decl is static. It's also invariant if it's
2803 a decl in the current function. Taking the address of a volatile variable
2804 is not volatile. If it's a constant, the address is both invariant and
2805 constant. Otherwise it's neither. */
2806 if (TREE_CODE (node) == INDIRECT_REF)
2807 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2808 else if (DECL_P (node))
2812 else if (decl_function_context (node) == current_function_decl
2813 /* Addresses of thread-local variables are invariant. */
2814 || (TREE_CODE (node) == VAR_DECL
2815 && DECL_THREAD_LOCAL_P (node)))
2820 else if (CONSTANT_CLASS_P (node))
2825 se |= TREE_SIDE_EFFECTS (node);
2828 TREE_CONSTANT (t) = tc;
2829 TREE_INVARIANT (t) = ti;
2830 TREE_SIDE_EFFECTS (t) = se;
2831 #undef UPDATE_TITCSE
2834 /* Build an expression of code CODE, data type TYPE, and operands as
2835 specified. Expressions and reference nodes can be created this way.
2836 Constants, decls, types and misc nodes cannot be.
2838 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2839 enough for all extant tree codes. */
2842 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2846 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2848 t = make_node_stat (code PASS_MEM_STAT);
2855 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2857 int length = sizeof (struct tree_exp);
2858 #ifdef GATHER_STATISTICS
2859 tree_node_kind kind;
2863 #ifdef GATHER_STATISTICS
2864 switch (TREE_CODE_CLASS (code))
2866 case tcc_statement: /* an expression with side effects */
2869 case tcc_reference: /* a reference */
2877 tree_node_counts[(int) kind]++;
2878 tree_node_sizes[(int) kind] += length;
2881 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2883 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2885 memset (t, 0, sizeof (struct tree_common));
2887 TREE_SET_CODE (t, code);
2889 TREE_TYPE (t) = type;
2890 #ifdef USE_MAPPED_LOCATION
2891 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2893 SET_EXPR_LOCUS (t, NULL);
2895 TREE_COMPLEXITY (t) = 0;
2896 TREE_OPERAND (t, 0) = node;
2897 TREE_BLOCK (t) = NULL_TREE;
2898 if (node && !TYPE_P (node))
2900 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2901 TREE_READONLY (t) = TREE_READONLY (node);
2904 if (TREE_CODE_CLASS (code) == tcc_statement)
2905 TREE_SIDE_EFFECTS (t) = 1;
2909 /* All of these have side-effects, no matter what their
2911 TREE_SIDE_EFFECTS (t) = 1;
2912 TREE_READONLY (t) = 0;
2915 case MISALIGNED_INDIRECT_REF:
2916 case ALIGN_INDIRECT_REF:
2918 /* Whether a dereference is readonly has nothing to do with whether
2919 its operand is readonly. */
2920 TREE_READONLY (t) = 0;
2925 recompute_tree_invariant_for_addr_expr (t);
2929 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2930 && node && !TYPE_P (node)
2931 && TREE_CONSTANT (node))
2932 TREE_CONSTANT (t) = 1;
2933 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2934 && node && TREE_INVARIANT (node))
2935 TREE_INVARIANT (t) = 1;
2936 if (TREE_CODE_CLASS (code) == tcc_reference
2937 && node && TREE_THIS_VOLATILE (node))
2938 TREE_THIS_VOLATILE (t) = 1;
2945 #define PROCESS_ARG(N) \
2947 TREE_OPERAND (t, N) = arg##N; \
2948 if (arg##N &&!TYPE_P (arg##N)) \
2950 if (TREE_SIDE_EFFECTS (arg##N)) \
2952 if (!TREE_READONLY (arg##N)) \
2954 if (!TREE_CONSTANT (arg##N)) \
2956 if (!TREE_INVARIANT (arg##N)) \
2962 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2964 bool constant, read_only, side_effects, invariant;
2967 gcc_assert (TREE_CODE_LENGTH (code) == 2);
2969 t = make_node_stat (code PASS_MEM_STAT);
2972 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2973 result based on those same flags for the arguments. But if the
2974 arguments aren't really even `tree' expressions, we shouldn't be trying
2977 /* Expressions without side effects may be constant if their
2978 arguments are as well. */
2979 constant = (TREE_CODE_CLASS (code) == tcc_comparison
2980 || TREE_CODE_CLASS (code) == tcc_binary);
2982 side_effects = TREE_SIDE_EFFECTS (t);
2983 invariant = constant;
2988 TREE_READONLY (t) = read_only;
2989 TREE_CONSTANT (t) = constant;
2990 TREE_INVARIANT (t) = invariant;
2991 TREE_SIDE_EFFECTS (t) = side_effects;
2992 TREE_THIS_VOLATILE (t)
2993 = (TREE_CODE_CLASS (code) == tcc_reference
2994 && arg0 && TREE_THIS_VOLATILE (arg0));
3000 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3001 tree arg2 MEM_STAT_DECL)
3003 bool constant, read_only, side_effects, invariant;
3006 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3008 t = make_node_stat (code PASS_MEM_STAT);
3011 side_effects = TREE_SIDE_EFFECTS (t);
3017 if (code == CALL_EXPR && !side_effects)
3022 /* Calls have side-effects, except those to const or
3024 i = call_expr_flags (t);
3025 if (!(i & (ECF_CONST | ECF_PURE)))
3028 /* And even those have side-effects if their arguments do. */
3029 else for (node = arg1; node; node = TREE_CHAIN (node))
3030 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
3037 TREE_SIDE_EFFECTS (t) = side_effects;
3038 TREE_THIS_VOLATILE (t)
3039 = (TREE_CODE_CLASS (code) == tcc_reference
3040 && arg0 && TREE_THIS_VOLATILE (arg0));
3046 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3047 tree arg2, tree arg3 MEM_STAT_DECL)
3049 bool constant, read_only, side_effects, invariant;
3052 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3054 t = make_node_stat (code PASS_MEM_STAT);
3057 side_effects = TREE_SIDE_EFFECTS (t);
3064 TREE_SIDE_EFFECTS (t) = side_effects;
3065 TREE_THIS_VOLATILE (t)
3066 = (TREE_CODE_CLASS (code) == tcc_reference
3067 && arg0 && TREE_THIS_VOLATILE (arg0));
3073 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3074 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3076 bool constant, read_only, side_effects, invariant;
3079 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3081 t = make_node_stat (code PASS_MEM_STAT);
3084 side_effects = TREE_SIDE_EFFECTS (t);
3092 TREE_SIDE_EFFECTS (t) = side_effects;
3093 TREE_THIS_VOLATILE (t)
3094 = (TREE_CODE_CLASS (code) == tcc_reference
3095 && arg0 && TREE_THIS_VOLATILE (arg0));
3101 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3102 tree arg2, tree arg3, tree arg4, tree arg5,
3103 tree arg6 MEM_STAT_DECL)
3105 bool constant, read_only, side_effects, invariant;
3108 gcc_assert (code == TARGET_MEM_REF);
3110 t = make_node_stat (code PASS_MEM_STAT);
3113 side_effects = TREE_SIDE_EFFECTS (t);
3123 TREE_SIDE_EFFECTS (t) = side_effects;
3124 TREE_THIS_VOLATILE (t) = 0;
3129 /* Similar except don't specify the TREE_TYPE
3130 and leave the TREE_SIDE_EFFECTS as 0.
3131 It is permissible for arguments to be null,
3132 or even garbage if their values do not matter. */
3135 build_nt (enum tree_code code, ...)
3144 t = make_node (code);
3145 length = TREE_CODE_LENGTH (code);
3147 for (i = 0; i < length; i++)
3148 TREE_OPERAND (t, i) = va_arg (p, tree);
3154 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3155 We do NOT enter this node in any sort of symbol table.
3157 layout_decl is used to set up the decl's storage layout.
3158 Other slots are initialized to 0 or null pointers. */
3161 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3165 t = make_node_stat (code PASS_MEM_STAT);
3167 /* if (type == error_mark_node)
3168 type = integer_type_node; */
3169 /* That is not done, deliberately, so that having error_mark_node
3170 as the type can suppress useless errors in the use of this variable. */
3172 DECL_NAME (t) = name;
3173 TREE_TYPE (t) = type;
3175 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3177 else if (code == FUNCTION_DECL)
3178 DECL_MODE (t) = FUNCTION_MODE;
3183 /* Builds and returns function declaration with NAME and TYPE. */
3186 build_fn_decl (const char *name, tree type)
3188 tree id = get_identifier (name);
3189 tree decl = build_decl (FUNCTION_DECL, id, type);
3191 DECL_EXTERNAL (decl) = 1;
3192 TREE_PUBLIC (decl) = 1;
3193 DECL_ARTIFICIAL (decl) = 1;
3194 TREE_NOTHROW (decl) = 1;
3200 /* BLOCK nodes are used to represent the structure of binding contours
3201 and declarations, once those contours have been exited and their contents
3202 compiled. This information is used for outputting debugging info. */
3205 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3207 tree block = make_node (BLOCK);
3209 BLOCK_VARS (block) = vars;
3210 BLOCK_SUBBLOCKS (block) = subblocks;
3211 BLOCK_SUPERCONTEXT (block) = supercontext;
3212 BLOCK_CHAIN (block) = chain;
3216 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3217 /* ??? gengtype doesn't handle conditionals */
3218 static GTY(()) source_locus last_annotated_node;
3221 #ifdef USE_MAPPED_LOCATION
3224 expand_location (source_location loc)
3226 expanded_location xloc;
3227 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
3230 const struct line_map *map = linemap_lookup (&line_table, loc);
3231 xloc.file = map->to_file;
3232 xloc.line = SOURCE_LINE (map, loc);
3233 xloc.column = SOURCE_COLUMN (map, loc);
3240 /* Record the exact location where an expression or an identifier were
3244 annotate_with_file_line (tree node, const char *file, int line)
3246 /* Roughly one percent of the calls to this function are to annotate
3247 a node with the same information already attached to that node!
3248 Just return instead of wasting memory. */
3249 if (EXPR_LOCUS (node)
3250 && EXPR_LINENO (node) == line
3251 && (EXPR_FILENAME (node) == file
3252 || !strcmp (EXPR_FILENAME (node), file)))
3254 last_annotated_node = EXPR_LOCUS (node);
3258 /* In heavily macroized code (such as GCC itself) this single
3259 entry cache can reduce the number of allocations by more
3261 if (last_annotated_node
3262 && last_annotated_node->line == line
3263 && (last_annotated_node->file == file
3264 || !strcmp (last_annotated_node->file, file)))
3266 SET_EXPR_LOCUS (node, last_annotated_node);
3270 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3271 EXPR_LINENO (node) = line;
3272 EXPR_FILENAME (node) = file;
3273 last_annotated_node = EXPR_LOCUS (node);
3277 annotate_with_locus (tree node, location_t locus)
3279 annotate_with_file_line (node, locus.file, locus.line);
3283 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3287 build_decl_attribute_variant (tree ddecl, tree attribute)
3289 DECL_ATTRIBUTES (ddecl) = attribute;
3293 /* Borrowed from hashtab.c iterative_hash implementation. */
3294 #define mix(a,b,c) \
3296 a -= b; a -= c; a ^= (c>>13); \
3297 b -= c; b -= a; b ^= (a<< 8); \
3298 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3299 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3300 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3301 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3302 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3303 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3304 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3308 /* Produce good hash value combining VAL and VAL2. */
3309 static inline hashval_t
3310 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3312 /* the golden ratio; an arbitrary value. */
3313 hashval_t a = 0x9e3779b9;
3319 /* Produce good hash value combining PTR and VAL2. */
3320 static inline hashval_t
3321 iterative_hash_pointer (void *ptr, hashval_t val2)
3323 if (sizeof (ptr) == sizeof (hashval_t))
3324 return iterative_hash_hashval_t ((size_t) ptr, val2);
3327 hashval_t a = (hashval_t) (size_t) ptr;
3328 /* Avoid warnings about shifting of more than the width of the type on
3329 hosts that won't execute this path. */
3331 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3337 /* Produce good hash value combining VAL and VAL2. */
3338 static inline hashval_t
3339 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3341 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3342 return iterative_hash_hashval_t (val, val2);
3345 hashval_t a = (hashval_t) val;
3346 /* Avoid warnings about shifting of more than the width of the type on
3347 hosts that won't execute this path. */
3349 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3351 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3353 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3354 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3361 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3362 is ATTRIBUTE and its qualifiers are QUALS.
3364 Record such modified types already made so we don't make duplicates. */
3367 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3369 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3371 hashval_t hashcode = 0;
3373 enum tree_code code = TREE_CODE (ttype);
3375 ntype = copy_node (ttype);
3377 TYPE_POINTER_TO (ntype) = 0;
3378 TYPE_REFERENCE_TO (ntype) = 0;
3379 TYPE_ATTRIBUTES (ntype) = attribute;
3381 /* Create a new main variant of TYPE. */
3382 TYPE_MAIN_VARIANT (ntype) = ntype;
3383 TYPE_NEXT_VARIANT (ntype) = 0;
3384 set_type_quals (ntype, TYPE_UNQUALIFIED);
3386 hashcode = iterative_hash_object (code, hashcode);
3387 if (TREE_TYPE (ntype))
3388 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3390 hashcode = attribute_hash_list (attribute, hashcode);
3392 switch (TREE_CODE (ntype))
3395 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3398 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3402 hashcode = iterative_hash_object
3403 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3404 hashcode = iterative_hash_object
3405 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3409 unsigned int precision = TYPE_PRECISION (ntype);
3410 hashcode = iterative_hash_object (precision, hashcode);
3417 ntype = type_hash_canon (hashcode, ntype);
3418 ttype = build_qualified_type (ntype, quals);
3425 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3428 Record such modified types already made so we don't make duplicates. */
3431 build_type_attribute_variant (tree ttype, tree attribute)
3433 return build_type_attribute_qual_variant (ttype, attribute,
3434 TYPE_QUALS (ttype));
3437 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3440 We try both `text' and `__text__', ATTR may be either one. */
3441 /* ??? It might be a reasonable simplification to require ATTR to be only
3442 `text'. One might then also require attribute lists to be stored in
3443 their canonicalized form. */
3446 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3451 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3454 p = IDENTIFIER_POINTER (ident);
3455 ident_len = IDENTIFIER_LENGTH (ident);
3457 if (ident_len == attr_len
3458 && strcmp (attr, p) == 0)
3461 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3464 gcc_assert (attr[1] == '_');
3465 gcc_assert (attr[attr_len - 2] == '_');
3466 gcc_assert (attr[attr_len - 1] == '_');
3467 if (ident_len == attr_len - 4
3468 && strncmp (attr + 2, p, attr_len - 4) == 0)
3473 if (ident_len == attr_len + 4
3474 && p[0] == '_' && p[1] == '_'
3475 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3476 && strncmp (attr, p + 2, attr_len) == 0)
3483 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3486 We try both `text' and `__text__', ATTR may be either one. */
3489 is_attribute_p (const char *attr, tree ident)
3491 return is_attribute_with_length_p (attr, strlen (attr), ident);
3494 /* Given an attribute name and a list of attributes, return a pointer to the
3495 attribute's list element if the attribute is part of the list, or NULL_TREE
3496 if not found. If the attribute appears more than once, this only
3497 returns the first occurrence; the TREE_CHAIN of the return value should
3498 be passed back in if further occurrences are wanted. */
3501 lookup_attribute (const char *attr_name, tree list)
3504 size_t attr_len = strlen (attr_name);
3506 for (l = list; l; l = TREE_CHAIN (l))
3508 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3509 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3516 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3520 remove_attribute (const char *attr_name, tree list)
3523 size_t attr_len = strlen (attr_name);
3525 for (p = &list; *p; )
3528 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3529 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3530 *p = TREE_CHAIN (l);
3532 p = &TREE_CHAIN (l);
3538 /* Return an attribute list that is the union of a1 and a2. */
3541 merge_attributes (tree a1, tree a2)
3545 /* Either one unset? Take the set one. */
3547 if ((attributes = a1) == 0)
3550 /* One that completely contains the other? Take it. */
3552 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3554 if (attribute_list_contained (a2, a1))
3558 /* Pick the longest list, and hang on the other list. */
3560 if (list_length (a1) < list_length (a2))
3561 attributes = a2, a2 = a1;
3563 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3566 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3569 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3572 if (TREE_VALUE (a) != NULL
3573 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3574 && TREE_VALUE (a2) != NULL
3575 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3577 if (simple_cst_list_equal (TREE_VALUE (a),
3578 TREE_VALUE (a2)) == 1)
3581 else if (simple_cst_equal (TREE_VALUE (a),
3582 TREE_VALUE (a2)) == 1)
3587 a1 = copy_node (a2);
3588 TREE_CHAIN (a1) = attributes;
3597 /* Given types T1 and T2, merge their attributes and return
3601 merge_type_attributes (tree t1, tree t2)
3603 return merge_attributes (TYPE_ATTRIBUTES (t1),
3604 TYPE_ATTRIBUTES (t2));
3607 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3611 merge_decl_attributes (tree olddecl, tree newdecl)
3613 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3614 DECL_ATTRIBUTES (newdecl));
3617 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3619 /* Specialization of merge_decl_attributes for various Windows targets.
3621 This handles the following situation:
3623 __declspec (dllimport) int foo;
3626 The second instance of `foo' nullifies the dllimport. */
3629 merge_dllimport_decl_attributes (tree old, tree new)
3632 int delete_dllimport_p = 1;
3634 /* What we need to do here is remove from `old' dllimport if it doesn't
3635 appear in `new'. dllimport behaves like extern: if a declaration is
3636 marked dllimport and a definition appears later, then the object
3637 is not dllimport'd. We also remove a `new' dllimport if the old list
3638 contains dllexport: dllexport always overrides dllimport, regardless
3639 of the order of declaration. */
3640 if (!VAR_OR_FUNCTION_DECL_P (new))
3641 delete_dllimport_p = 0;
3642 else if (DECL_DLLIMPORT_P (new)
3643 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3645 DECL_DLLIMPORT_P (new) = 0;
3646 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3647 "dllimport ignored", new);
3649 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3651 /* Warn about overriding a symbol that has already been used. eg:
3652 extern int __attribute__ ((dllimport)) foo;
3653 int* bar () {return &foo;}
3656 if (TREE_USED (old))
3658 warning (0, "%q+D redeclared without dllimport attribute "
3659 "after being referenced with dll linkage", new);
3660 /* If we have used a variable's address with dllimport linkage,
3661 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3662 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3664 We still remove the attribute so that assembler code refers
3665 to '&foo rather than '_imp__foo'. */
3666 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3667 DECL_DLLIMPORT_P (new) = 1;
3670 /* Let an inline definition silently override the external reference,
3671 but otherwise warn about attribute inconsistency. */
3672 else if (TREE_CODE (new) == VAR_DECL
3673 || !DECL_DECLARED_INLINE_P (new))
3674 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3675 "previous dllimport ignored", new);
3678 delete_dllimport_p = 0;
3680 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3682 if (delete_dllimport_p)
3685 const size_t attr_len = strlen ("dllimport");
3687 /* Scan the list for dllimport and delete it. */
3688 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3690 if (is_attribute_with_length_p ("dllimport", attr_len,
3693 if (prev == NULL_TREE)
3696 TREE_CHAIN (prev) = TREE_CHAIN (t);
3705 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3706 struct attribute_spec.handler. */
3709 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3714 /* These attributes may apply to structure and union types being created,
3715 but otherwise should pass to the declaration involved. */
3718 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3719 | (int) ATTR_FLAG_ARRAY_NEXT))
3721 *no_add_attrs = true;
3722 return tree_cons (name, args, NULL_TREE);
3724 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3726 warning (OPT_Wattributes, "%qs attribute ignored",
3727 IDENTIFIER_POINTER (name));
3728 *no_add_attrs = true;
3734 if (TREE_CODE (node) != FUNCTION_DECL
3735 && TREE_CODE (node) != VAR_DECL)
3737 *no_add_attrs = true;
3738 warning (OPT_Wattributes, "%qs attribute ignored",
3739 IDENTIFIER_POINTER (name));
3743 /* Report error on dllimport ambiguities seen now before they cause
3745 else if (is_attribute_p ("dllimport", name))
3747 /* Honor any target-specific overrides. */
3748 if (!targetm.valid_dllimport_attribute_p (node))
3749 *no_add_attrs = true;
3751 else if (TREE_CODE (node) == FUNCTION_DECL
3752 && DECL_DECLARED_INLINE_P (node))
3754 warning (OPT_Wattributes, "inline function %q+D declared as "
3755 " dllimport: attribute ignored", node);
3756 *no_add_attrs = true;
3758 /* Like MS, treat definition of dllimported variables and
3759 non-inlined functions on declaration as syntax errors. */
3760 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
3762 error ("function %q+D definition is marked dllimport", node);
3763 *no_add_attrs = true;
3766 else if (TREE_CODE (node) == VAR_DECL)
3768 if (DECL_INITIAL (node))
3770 error ("variable %q+D definition is marked dllimport",
3772 *no_add_attrs = true;
3775 /* `extern' needn't be specified with dllimport.
3776 Specify `extern' now and hope for the best. Sigh. */
3777 DECL_EXTERNAL (node) = 1;
3778 /* Also, implicitly give dllimport'd variables declared within
3779 a function global scope, unless declared static. */
3780 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3781 TREE_PUBLIC (node) = 1;
3784 if (*no_add_attrs == false)
3785 DECL_DLLIMPORT_P (node) = 1;
3788 /* Report error if symbol is not accessible at global scope. */
3789 if (!TREE_PUBLIC (node)
3790 && (TREE_CODE (node) == VAR_DECL
3791 || TREE_CODE (node) == FUNCTION_DECL))
3793 error ("external linkage required for symbol %q+D because of "
3794 "%qs attribute", node, IDENTIFIER_POINTER (name));
3795 *no_add_attrs = true;
3801 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3803 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3804 of the various TYPE_QUAL values. */
3807 set_type_quals (tree type, int type_quals)
3809 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3810 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3811 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3814 /* Returns true iff cand is equivalent to base with type_quals. */
3817 check_qualified_type (tree cand, tree base, int type_quals)
3819 return (TYPE_QUALS (cand) == type_quals
3820 && TYPE_NAME (cand) == TYPE_NAME (base)
3821 /* Apparently this is needed for Objective-C. */
3822 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3823 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3824 TYPE_ATTRIBUTES (base)));
3827 /* Return a version of the TYPE, qualified as indicated by the
3828 TYPE_QUALS, if one exists. If no qualified version exists yet,
3829 return NULL_TREE. */
3832 get_qualified_type (tree type, int type_quals)
3836 if (TYPE_QUALS (type) == type_quals)
3839 /* Search the chain of variants to see if there is already one there just
3840 like the one we need to have. If so, use that existing one. We must
3841 preserve the TYPE_NAME, since there is code that depends on this. */
3842 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3843 if (check_qualified_type (t, type, type_quals))
3849 /* Like get_qualified_type, but creates the type if it does not
3850 exist. This function never returns NULL_TREE. */
3853 build_qualified_type (tree type, int type_quals)
3857 /* See if we already have the appropriate qualified variant. */
3858 t = get_qualified_type (type, type_quals);
3860 /* If not, build it. */
3863 t = build_variant_type_copy (type);
3864 set_type_quals (t, type_quals);
3870 /* Create a new distinct copy of TYPE. The new type is made its own
3874 build_distinct_type_copy (tree type)
3876 tree t = copy_node (type);
3878 TYPE_POINTER_TO (t) = 0;
3879 TYPE_REFERENCE_TO (t) = 0;
3881 /* Make it its own variant. */
3882 TYPE_MAIN_VARIANT (t) = t;
3883 TYPE_NEXT_VARIANT (t) = 0;
3885 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
3886 whose TREE_TYPE is not t. This can also happen in the Ada
3887 frontend when using subtypes. */
3892 /* Create a new variant of TYPE, equivalent but distinct.
3893 This is so the caller can modify it. */
3896 build_variant_type_copy (tree type)
3898 tree t, m = TYPE_MAIN_VARIANT (type);
3900 t = build_distinct_type_copy (type);
3902 /* Add the new type to the chain of variants of TYPE. */
3903 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3904 TYPE_NEXT_VARIANT (m) = t;
3905 TYPE_MAIN_VARIANT (t) = m;
3910 /* Return true if the from tree in both tree maps are equal. */
3913 tree_map_eq (const void *va, const void *vb)
3915 const struct tree_map *a = va, *b = vb;
3916 return (a->from == b->from);
3919 /* Hash a from tree in a tree_map. */
3922 tree_map_hash (const void *item)
3924 return (((const struct tree_map *) item)->hash);
3927 /* Return true if this tree map structure is marked for garbage collection
3928 purposes. We simply return true if the from tree is marked, so that this
3929 structure goes away when the from tree goes away. */
3932 tree_map_marked_p (const void *p)
3934 tree from = ((struct tree_map *) p)->from;
3936 return ggc_marked_p (from);
3939 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
3942 tree_int_map_eq (const void *va, const void *vb)
3944 const struct tree_int_map *a = va, *b = vb;
3945 return (a->from == b->from);
3948 /* Hash a from tree in the tree_int_map * ITEM. */
3951 tree_int_map_hash (const void *item)
3953 return htab_hash_pointer (((const struct tree_int_map *)item)->from);
3956 /* Return true if this tree int map structure is marked for garbage collection
3957 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
3958 structure goes away when the from tree goes away. */
3961 tree_int_map_marked_p (const void *p)
3963 tree from = ((struct tree_int_map *) p)->from;
3965 return ggc_marked_p (from);
3967 /* Lookup an init priority for FROM, and return it if we find one. */
3970 decl_init_priority_lookup (tree from)
3972 struct tree_int_map *h, in;
3975 h = htab_find_with_hash (init_priority_for_decl,
3976 &in, htab_hash_pointer (from));
3982 /* Insert a mapping FROM->TO in the init priority hashtable. */
3985 decl_init_priority_insert (tree from, unsigned short to)
3987 struct tree_int_map *h;
3990 h = ggc_alloc (sizeof (struct tree_int_map));
3993 loc = htab_find_slot_with_hash (init_priority_for_decl, h,
3994 htab_hash_pointer (from), INSERT);
3995 *(struct tree_int_map **) loc = h;
3998 /* Look up a restrict qualified base decl for FROM. */
4001 decl_restrict_base_lookup (tree from)
4007 h = htab_find_with_hash (restrict_base_for_decl, &in,
4008 htab_hash_pointer (from));
4009 return h ? h->to : NULL_TREE;
4012 /* Record the restrict qualified base TO for FROM. */
4015 decl_restrict_base_insert (tree from, tree to)
4020 h = ggc_alloc (sizeof (struct tree_map));
4021 h->hash = htab_hash_pointer (from);
4024 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4025 *(struct tree_map **) loc = h;
4028 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4031 print_debug_expr_statistics (void)
4033 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4034 (long) htab_size (debug_expr_for_decl),
4035 (long) htab_elements (debug_expr_for_decl),
4036 htab_collisions (debug_expr_for_decl));
4039 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4042 print_value_expr_statistics (void)
4044 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4045 (long) htab_size (value_expr_for_decl),
4046 (long) htab_elements (value_expr_for_decl),
4047 htab_collisions (value_expr_for_decl));
4050 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4051 don't print anything if the table is empty. */
4054 print_restrict_base_statistics (void)
4056 if (htab_elements (restrict_base_for_decl) != 0)
4058 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4059 (long) htab_size (restrict_base_for_decl),
4060 (long) htab_elements (restrict_base_for_decl),
4061 htab_collisions (restrict_base_for_decl));
4064 /* Lookup a debug expression for FROM, and return it if we find one. */
4067 decl_debug_expr_lookup (tree from)
4069 struct tree_map *h, in;
4072 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4078 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4081 decl_debug_expr_insert (tree from, tree to)
4086 h = ggc_alloc (sizeof (struct tree_map));
4087 h->hash = htab_hash_pointer (from);
4090 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4091 *(struct tree_map **) loc = h;
4094 /* Lookup a value expression for FROM, and return it if we find one. */
4097 decl_value_expr_lookup (tree from)
4099 struct tree_map *h, in;
4102 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4108 /* Insert a mapping FROM->TO in the value expression hashtable. */
4111 decl_value_expr_insert (tree from, tree to)
4116 h = ggc_alloc (sizeof (struct tree_map));
4117 h->hash = htab_hash_pointer (from);
4120 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4121 *(struct tree_map **) loc = h;
4124 /* Hashing of types so that we don't make duplicates.
4125 The entry point is `type_hash_canon'. */
4127 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4128 with types in the TREE_VALUE slots), by adding the hash codes
4129 of the individual types. */
4132 type_hash_list (tree list, hashval_t hashcode)
4136 for (tail = list; tail; tail = TREE_CHAIN (tail))
4137 if (TREE_VALUE (tail) != error_mark_node)
4138 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4144 /* These are the Hashtable callback functions. */
4146 /* Returns true iff the types are equivalent. */
4149 type_hash_eq (const void *va, const void *vb)
4151 const struct type_hash *a = va, *b = vb;
4153 /* First test the things that are the same for all types. */
4154 if (a->hash != b->hash
4155 || TREE_CODE (a->type) != TREE_CODE (b->type)
4156 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4157 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4158 TYPE_ATTRIBUTES (b->type))
4159 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4160 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4163 switch (TREE_CODE (a->type))
4168 case REFERENCE_TYPE:
4172 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4175 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4176 && !(TYPE_VALUES (a->type)
4177 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4178 && TYPE_VALUES (b->type)
4179 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4180 && type_list_equal (TYPE_VALUES (a->type),
4181 TYPE_VALUES (b->type))))
4184 /* ... fall through ... */
4189 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4190 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4191 TYPE_MAX_VALUE (b->type)))
4192 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4193 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4194 TYPE_MIN_VALUE (b->type))));
4197 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4200 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4201 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4202 || (TYPE_ARG_TYPES (a->type)
4203 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4204 && TYPE_ARG_TYPES (b->type)
4205 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4206 && type_list_equal (TYPE_ARG_TYPES (a->type),
4207 TYPE_ARG_TYPES (b->type)))));
4210 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4214 case QUAL_UNION_TYPE:
4215 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4216 || (TYPE_FIELDS (a->type)
4217 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4218 && TYPE_FIELDS (b->type)
4219 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4220 && type_list_equal (TYPE_FIELDS (a->type),
4221 TYPE_FIELDS (b->type))));
4224 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4225 || (TYPE_ARG_TYPES (a->type)
4226 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4227 && TYPE_ARG_TYPES (b->type)
4228 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4229 && type_list_equal (TYPE_ARG_TYPES (a->type),
4230 TYPE_ARG_TYPES (b->type))));
4237 /* Return the cached hash value. */
4240 type_hash_hash (const void *item)
4242 return ((const struct type_hash *) item)->hash;
4245 /* Look in the type hash table for a type isomorphic to TYPE.
4246 If one is found, return it. Otherwise return 0. */
4249 type_hash_lookup (hashval_t hashcode, tree type)
4251 struct type_hash *h, in;
4253 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4254 must call that routine before comparing TYPE_ALIGNs. */
4260 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4266 /* Add an entry to the type-hash-table
4267 for a type TYPE whose hash code is HASHCODE. */
4270 type_hash_add (hashval_t hashcode, tree type)
4272 struct type_hash *h;
4275 h = ggc_alloc (sizeof (struct type_hash));
4278 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4279 *(struct type_hash **) loc = h;
4282 /* Given TYPE, and HASHCODE its hash code, return the canonical
4283 object for an identical type if one already exists.
4284 Otherwise, return TYPE, and record it as the canonical object.
4286 To use this function, first create a type of the sort you want.
4287 Then compute its hash code from the fields of the type that
4288 make it different from other similar types.
4289 Then call this function and use the value. */
4292 type_hash_canon (unsigned int hashcode, tree type)
4296 /* The hash table only contains main variants, so ensure that's what we're
4298 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4300 if (!lang_hooks.types.hash_types)
4303 /* See if the type is in the hash table already. If so, return it.
4304 Otherwise, add the type. */
4305 t1 = type_hash_lookup (hashcode, type);
4308 #ifdef GATHER_STATISTICS
4309 tree_node_counts[(int) t_kind]--;
4310 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4316 type_hash_add (hashcode, type);
4321 /* See if the data pointed to by the type hash table is marked. We consider
4322 it marked if the type is marked or if a debug type number or symbol
4323 table entry has been made for the type. This reduces the amount of
4324 debugging output and eliminates that dependency of the debug output on
4325 the number of garbage collections. */
4328 type_hash_marked_p (const void *p)
4330 tree type = ((struct type_hash *) p)->type;
4332 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4336 print_type_hash_statistics (void)
4338 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4339 (long) htab_size (type_hash_table),
4340 (long) htab_elements (type_hash_table),
4341 htab_collisions (type_hash_table));
4344 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4345 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4346 by adding the hash codes of the individual attributes. */
4349 attribute_hash_list (tree list, hashval_t hashcode)
4353 for (tail = list; tail; tail = TREE_CHAIN (tail))
4354 /* ??? Do we want to add in TREE_VALUE too? */
4355 hashcode = iterative_hash_object
4356 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4360 /* Given two lists of attributes, return true if list l2 is
4361 equivalent to l1. */
4364 attribute_list_equal (tree l1, tree l2)
4366 return attribute_list_contained (l1, l2)
4367 && attribute_list_contained (l2, l1);
4370 /* Given two lists of attributes, return true if list L2 is
4371 completely contained within L1. */
4372 /* ??? This would be faster if attribute names were stored in a canonicalized
4373 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4374 must be used to show these elements are equivalent (which they are). */
4375 /* ??? It's not clear that attributes with arguments will always be handled
4379 attribute_list_contained (tree l1, tree l2)
4383 /* First check the obvious, maybe the lists are identical. */
4387 /* Maybe the lists are similar. */
4388 for (t1 = l1, t2 = l2;
4390 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4391 && TREE_VALUE (t1) == TREE_VALUE (t2);
4392 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4394 /* Maybe the lists are equal. */
4395 if (t1 == 0 && t2 == 0)
4398 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4401 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4403 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4406 if (TREE_VALUE (t2) != NULL
4407 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4408 && TREE_VALUE (attr) != NULL
4409 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4411 if (simple_cst_list_equal (TREE_VALUE (t2),
4412 TREE_VALUE (attr)) == 1)
4415 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4426 /* Given two lists of types
4427 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4428 return 1 if the lists contain the same types in the same order.
4429 Also, the TREE_PURPOSEs must match. */
4432 type_list_equal (tree l1, tree l2)
4436 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4437 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4438 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4439 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4440 && (TREE_TYPE (TREE_PURPOSE (t1))
4441 == TREE_TYPE (TREE_PURPOSE (t2))))))
4447 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4448 given by TYPE. If the argument list accepts variable arguments,
4449 then this function counts only the ordinary arguments. */
4452 type_num_arguments (tree type)
4457 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4458 /* If the function does not take a variable number of arguments,
4459 the last element in the list will have type `void'. */
4460 if (VOID_TYPE_P (TREE_VALUE (t)))
4468 /* Nonzero if integer constants T1 and T2
4469 represent the same constant value. */
4472 tree_int_cst_equal (tree t1, tree t2)
4477 if (t1 == 0 || t2 == 0)
4480 if (TREE_CODE (t1) == INTEGER_CST
4481 && TREE_CODE (t2) == INTEGER_CST
4482 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4483 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4489 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4490 The precise way of comparison depends on their data type. */
4493 tree_int_cst_lt (tree t1, tree t2)
4498 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4500 int t1_sgn = tree_int_cst_sgn (t1);
4501 int t2_sgn = tree_int_cst_sgn (t2);
4503 if (t1_sgn < t2_sgn)
4505 else if (t1_sgn > t2_sgn)
4507 /* Otherwise, both are non-negative, so we compare them as
4508 unsigned just in case one of them would overflow a signed
4511 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4512 return INT_CST_LT (t1, t2);
4514 return INT_CST_LT_UNSIGNED (t1, t2);
4517 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4520 tree_int_cst_compare (tree t1, tree t2)
4522 if (tree_int_cst_lt (t1, t2))
4524 else if (tree_int_cst_lt (t2, t1))
4530 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4531 the host. If POS is zero, the value can be represented in a single
4532 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4533 be represented in a single unsigned HOST_WIDE_INT. */
4536 host_integerp (tree t, int pos)
4538 return (TREE_CODE (t) == INTEGER_CST
4539 && ((TREE_INT_CST_HIGH (t) == 0
4540 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4541 || (! pos && TREE_INT_CST_HIGH (t) == -1
4542 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4543 && (!TYPE_UNSIGNED (TREE_TYPE (t))
4544 || TYPE_IS_SIZETYPE (TREE_TYPE (t))))
4545 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4548 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4549 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4550 be non-negative. We must be able to satisfy the above conditions. */
4553 tree_low_cst (tree t, int pos)
4555 gcc_assert (host_integerp (t, pos));
4556 return TREE_INT_CST_LOW (t);
4559 /* Return the most significant bit of the integer constant T. */
4562 tree_int_cst_msb (tree t)
4566 unsigned HOST_WIDE_INT l;
4568 /* Note that using TYPE_PRECISION here is wrong. We care about the
4569 actual bits, not the (arbitrary) range of the type. */
4570 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4571 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4572 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4573 return (l & 1) == 1;
4576 /* Return an indication of the sign of the integer constant T.
4577 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4578 Note that -1 will never be returned if T's type is unsigned. */
4581 tree_int_cst_sgn (tree t)
4583 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4585 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4587 else if (TREE_INT_CST_HIGH (t) < 0)
4593 /* Compare two constructor-element-type constants. Return 1 if the lists
4594 are known to be equal; otherwise return 0. */
4597 simple_cst_list_equal (tree l1, tree l2)
4599 while (l1 != NULL_TREE && l2 != NULL_TREE)
4601 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4604 l1 = TREE_CHAIN (l1);
4605 l2 = TREE_CHAIN (l2);
4611 /* Return truthvalue of whether T1 is the same tree structure as T2.
4612 Return 1 if they are the same.
4613 Return 0 if they are understandably different.
4614 Return -1 if either contains tree structure not understood by
4618 simple_cst_equal (tree t1, tree t2)
4620 enum tree_code code1, code2;
4626 if (t1 == 0 || t2 == 0)
4629 code1 = TREE_CODE (t1);
4630 code2 = TREE_CODE (t2);
4632 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4634 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4635 || code2 == NON_LVALUE_EXPR)
4636 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4638 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4641 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4642 || code2 == NON_LVALUE_EXPR)
4643 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4651 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4652 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4655 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4658 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4659 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4660 TREE_STRING_LENGTH (t1)));
4664 unsigned HOST_WIDE_INT idx;
4665 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4666 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4668 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4671 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4672 /* ??? Should we handle also fields here? */
4673 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4674 VEC_index (constructor_elt, v2, idx)->value))
4680 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4683 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4687 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4690 /* Special case: if either target is an unallocated VAR_DECL,
4691 it means that it's going to be unified with whatever the
4692 TARGET_EXPR is really supposed to initialize, so treat it
4693 as being equivalent to anything. */
4694 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4695 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4696 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
4697 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4698 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4699 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
4702 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4707 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4709 case WITH_CLEANUP_EXPR:
4710 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4714 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
4717 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4718 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4732 /* This general rule works for most tree codes. All exceptions should be
4733 handled above. If this is a language-specific tree code, we can't
4734 trust what might be in the operand, so say we don't know
4736 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4739 switch (TREE_CODE_CLASS (code1))
4743 case tcc_comparison:
4744 case tcc_expression:
4748 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
4750 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4762 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4763 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4764 than U, respectively. */
4767 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
4769 if (tree_int_cst_sgn (t) < 0)
4771 else if (TREE_INT_CST_HIGH (t) != 0)
4773 else if (TREE_INT_CST_LOW (t) == u)
4775 else if (TREE_INT_CST_LOW (t) < u)
4781 /* Return true if CODE represents an associative tree code. Otherwise
4784 associative_tree_code (enum tree_code code)
4803 /* Return true if CODE represents a commutative tree code. Otherwise
4806 commutative_tree_code (enum tree_code code)
4819 case UNORDERED_EXPR:
4823 case TRUTH_AND_EXPR:
4824 case TRUTH_XOR_EXPR:
4834 /* Generate a hash value for an expression. This can be used iteratively
4835 by passing a previous result as the "val" argument.
4837 This function is intended to produce the same hash for expressions which
4838 would compare equal using operand_equal_p. */
4841 iterative_hash_expr (tree t, hashval_t val)
4844 enum tree_code code;
4848 return iterative_hash_pointer (t, val);
4850 code = TREE_CODE (t);
4854 /* Alas, constants aren't shared, so we can't rely on pointer
4857 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
4858 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
4861 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
4863 return iterative_hash_hashval_t (val2, val);
4866 return iterative_hash (TREE_STRING_POINTER (t),
4867 TREE_STRING_LENGTH (t), val);
4869 val = iterative_hash_expr (TREE_REALPART (t), val);
4870 return iterative_hash_expr (TREE_IMAGPART (t), val);
4872 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
4876 /* we can just compare by pointer. */
4877 return iterative_hash_pointer (t, val);
4880 /* A list of expressions, for a CALL_EXPR or as the elements of a
4882 for (; t; t = TREE_CHAIN (t))
4883 val = iterative_hash_expr (TREE_VALUE (t), val);
4887 unsigned HOST_WIDE_INT idx;
4889 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
4891 val = iterative_hash_expr (field, val);
4892 val = iterative_hash_expr (value, val);
4897 /* When referring to a built-in FUNCTION_DECL, use the
4898 __builtin__ form. Otherwise nodes that compare equal
4899 according to operand_equal_p might get different
4901 if (DECL_BUILT_IN (t))
4903 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
4907 /* else FALL THROUGH */
4909 class = TREE_CODE_CLASS (code);
4911 if (class == tcc_declaration)
4913 /* DECL's have a unique ID */
4914 val = iterative_hash_host_wide_int (DECL_UID (t), val);
4918 gcc_assert (IS_EXPR_CODE_CLASS (class));
4920 val = iterative_hash_object (code, val);
4922 /* Don't hash the type, that can lead to having nodes which
4923 compare equal according to operand_equal_p, but which
4924 have different hash codes. */
4925 if (code == NOP_EXPR
4926 || code == CONVERT_EXPR
4927 || code == NON_LVALUE_EXPR)
4929 /* Make sure to include signness in the hash computation. */
4930 val += TYPE_UNSIGNED (TREE_TYPE (t));
4931 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
4934 else if (commutative_tree_code (code))
4936 /* It's a commutative expression. We want to hash it the same
4937 however it appears. We do this by first hashing both operands
4938 and then rehashing based on the order of their independent
4940 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
4941 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
4945 t = one, one = two, two = t;
4947 val = iterative_hash_hashval_t (one, val);
4948 val = iterative_hash_hashval_t (two, val);
4951 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i)
4952 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
4959 /* Constructors for pointer, array and function types.
4960 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4961 constructed by language-dependent code, not here.) */
4963 /* Construct, lay out and return the type of pointers to TO_TYPE with
4964 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4965 reference all of memory. If such a type has already been
4966 constructed, reuse it. */
4969 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
4974 if (to_type == error_mark_node)
4975 return error_mark_node;
4977 /* In some cases, languages will have things that aren't a POINTER_TYPE
4978 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4979 In that case, return that type without regard to the rest of our
4982 ??? This is a kludge, but consistent with the way this function has
4983 always operated and there doesn't seem to be a good way to avoid this
4985 if (TYPE_POINTER_TO (to_type) != 0
4986 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4987 return TYPE_POINTER_TO (to_type);
4989 /* First, if we already have a type for pointers to TO_TYPE and it's
4990 the proper mode, use it. */
4991 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4992 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4995 t = make_node (POINTER_TYPE);
4997 TREE_TYPE (t) = to_type;
4998 TYPE_MODE (t) = mode;
4999 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5000 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5001 TYPE_POINTER_TO (to_type) = t;
5003 /* Lay out the type. This function has many callers that are concerned
5004 with expression-construction, and this simplifies them all. */
5010 /* By default build pointers in ptr_mode. */
5013 build_pointer_type (tree to_type)
5015 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5018 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5021 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5026 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5027 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5028 In that case, return that type without regard to the rest of our
5031 ??? This is a kludge, but consistent with the way this function has
5032 always operated and there doesn't seem to be a good way to avoid this
5034 if (TYPE_REFERENCE_TO (to_type) != 0
5035 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5036 return TYPE_REFERENCE_TO (to_type);
5038 /* First, if we already have a type for pointers to TO_TYPE and it's
5039 the proper mode, use it. */
5040 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5041 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5044 t = make_node (REFERENCE_TYPE);
5046 TREE_TYPE (t) = to_type;
5047 TYPE_MODE (t) = mode;
5048 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5049 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5050 TYPE_REFERENCE_TO (to_type) = t;
5058 /* Build the node for the type of references-to-TO_TYPE by default
5062 build_reference_type (tree to_type)
5064 return build_reference_type_for_mode (to_type, ptr_mode, false);
5067 /* Build a type that is compatible with t but has no cv quals anywhere
5070 const char *const *const * -> char ***. */
5073 build_type_no_quals (tree t)
5075 switch (TREE_CODE (t))
5078 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5080 TYPE_REF_CAN_ALIAS_ALL (t));
5081 case REFERENCE_TYPE:
5083 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5085 TYPE_REF_CAN_ALIAS_ALL (t));
5087 return TYPE_MAIN_VARIANT (t);
5091 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5092 MAXVAL should be the maximum value in the domain
5093 (one less than the length of the array).
5095 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5096 We don't enforce this limit, that is up to caller (e.g. language front end).
5097 The limit exists because the result is a signed type and we don't handle
5098 sizes that use more than one HOST_WIDE_INT. */
5101 build_index_type (tree maxval)
5103 tree itype = make_node (INTEGER_TYPE);
5105 TREE_TYPE (itype) = sizetype;
5106 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5107 TYPE_MIN_VALUE (itype) = size_zero_node;
5108 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5109 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5110 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5111 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5112 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5113 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5115 if (host_integerp (maxval, 1))
5116 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5121 /* Builds a signed or unsigned integer type of precision PRECISION.
5122 Used for C bitfields whose precision does not match that of
5123 built-in target types. */
5125 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5128 tree itype = make_node (INTEGER_TYPE);
5130 TYPE_PRECISION (itype) = precision;
5133 fixup_unsigned_type (itype);
5135 fixup_signed_type (itype);
5137 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5138 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5143 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5144 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5145 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5148 build_range_type (tree type, tree lowval, tree highval)
5150 tree itype = make_node (INTEGER_TYPE);
5152 TREE_TYPE (itype) = type;
5153 if (type == NULL_TREE)
5156 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5157 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5159 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5160 TYPE_MODE (itype) = TYPE_MODE (type);
5161 TYPE_SIZE (itype) = TYPE_SIZE (type);
5162 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5163 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5164 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5166 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5167 return type_hash_canon (tree_low_cst (highval, 0)
5168 - tree_low_cst (lowval, 0),
5174 /* Just like build_index_type, but takes lowval and highval instead
5175 of just highval (maxval). */
5178 build_index_2_type (tree lowval, tree highval)
5180 return build_range_type (sizetype, lowval, highval);
5183 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5184 and number of elements specified by the range of values of INDEX_TYPE.
5185 If such a type has already been constructed, reuse it. */
5188 build_array_type (tree elt_type, tree index_type)
5191 hashval_t hashcode = 0;
5193 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5195 error ("arrays of functions are not meaningful");
5196 elt_type = integer_type_node;
5199 t = make_node (ARRAY_TYPE);
5200 TREE_TYPE (t) = elt_type;
5201 TYPE_DOMAIN (t) = index_type;
5203 if (index_type == 0)
5206 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5207 t = type_hash_canon (hashcode, t);
5213 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5214 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5215 t = type_hash_canon (hashcode, t);
5217 if (!COMPLETE_TYPE_P (t))
5222 /* Return the TYPE of the elements comprising
5223 the innermost dimension of ARRAY. */
5226 get_inner_array_type (tree array)
5228 tree type = TREE_TYPE (array);
5230 while (TREE_CODE (type) == ARRAY_TYPE)
5231 type = TREE_TYPE (type);
5236 /* Construct, lay out and return
5237 the type of functions returning type VALUE_TYPE
5238 given arguments of types ARG_TYPES.
5239 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5240 are data type nodes for the arguments of the function.
5241 If such a type has already been constructed, reuse it. */
5244 build_function_type (tree value_type, tree arg_types)
5247 hashval_t hashcode = 0;
5249 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5251 error ("function return type cannot be function");
5252 value_type = integer_type_node;
5255 /* Make a node of the sort we want. */
5256 t = make_node (FUNCTION_TYPE);
5257 TREE_TYPE (t) = value_type;
5258 TYPE_ARG_TYPES (t) = arg_types;
5260 /* If we already have such a type, use the old one. */
5261 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5262 hashcode = type_hash_list (arg_types, hashcode);
5263 t = type_hash_canon (hashcode, t);
5265 if (!COMPLETE_TYPE_P (t))
5270 /* Build a function type. The RETURN_TYPE is the type returned by the
5271 function. If additional arguments are provided, they are
5272 additional argument types. The list of argument types must always
5273 be terminated by NULL_TREE. */
5276 build_function_type_list (tree return_type, ...)
5281 va_start (p, return_type);
5283 t = va_arg (p, tree);
5284 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5285 args = tree_cons (NULL_TREE, t, args);
5287 if (args == NULL_TREE)
5288 args = void_list_node;
5292 args = nreverse (args);
5293 TREE_CHAIN (last) = void_list_node;
5295 args = build_function_type (return_type, args);
5301 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5302 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5303 for the method. An implicit additional parameter (of type
5304 pointer-to-BASETYPE) is added to the ARGTYPES. */
5307 build_method_type_directly (tree basetype,
5315 /* Make a node of the sort we want. */
5316 t = make_node (METHOD_TYPE);
5318 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5319 TREE_TYPE (t) = rettype;
5320 ptype = build_pointer_type (basetype);
5322 /* The actual arglist for this function includes a "hidden" argument
5323 which is "this". Put it into the list of argument types. */
5324 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5325 TYPE_ARG_TYPES (t) = argtypes;
5327 /* If we already have such a type, use the old one. */
5328 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5329 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5330 hashcode = type_hash_list (argtypes, hashcode);
5331 t = type_hash_canon (hashcode, t);
5333 if (!COMPLETE_TYPE_P (t))
5339 /* Construct, lay out and return the type of methods belonging to class
5340 BASETYPE and whose arguments and values are described by TYPE.
5341 If that type exists already, reuse it.
5342 TYPE must be a FUNCTION_TYPE node. */
5345 build_method_type (tree basetype, tree type)
5347 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5349 return build_method_type_directly (basetype,
5351 TYPE_ARG_TYPES (type));
5354 /* Construct, lay out and return the type of offsets to a value
5355 of type TYPE, within an object of type BASETYPE.
5356 If a suitable offset type exists already, reuse it. */
5359 build_offset_type (tree basetype, tree type)
5362 hashval_t hashcode = 0;
5364 /* Make a node of the sort we want. */
5365 t = make_node (OFFSET_TYPE);
5367 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5368 TREE_TYPE (t) = type;
5370 /* If we already have such a type, use the old one. */
5371 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5372 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5373 t = type_hash_canon (hashcode, t);
5375 if (!COMPLETE_TYPE_P (t))
5381 /* Create a complex type whose components are COMPONENT_TYPE. */
5384 build_complex_type (tree component_type)
5389 /* Make a node of the sort we want. */
5390 t = make_node (COMPLEX_TYPE);
5392 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5394 /* If we already have such a type, use the old one. */
5395 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5396 t = type_hash_canon (hashcode, t);
5398 if (!COMPLETE_TYPE_P (t))
5401 /* If we are writing Dwarf2 output we need to create a name,
5402 since complex is a fundamental type. */
5403 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5407 if (component_type == char_type_node)
5408 name = "complex char";
5409 else if (component_type == signed_char_type_node)
5410 name = "complex signed char";
5411 else if (component_type == unsigned_char_type_node)
5412 name = "complex unsigned char";
5413 else if (component_type == short_integer_type_node)
5414 name = "complex short int";
5415 else if (component_type == short_unsigned_type_node)
5416 name = "complex short unsigned int";
5417 else if (component_type == integer_type_node)
5418 name = "complex int";
5419 else if (component_type == unsigned_type_node)
5420 name = "complex unsigned int";
5421 else if (component_type == long_integer_type_node)
5422 name = "complex long int";
5423 else if (component_type == long_unsigned_type_node)
5424 name = "complex long unsigned int";
5425 else if (component_type == long_long_integer_type_node)
5426 name = "complex long long int";
5427 else if (component_type == long_long_unsigned_type_node)
5428 name = "complex long long unsigned int";
5433 TYPE_NAME (t) = get_identifier (name);
5436 return build_qualified_type (t, TYPE_QUALS (component_type));
5439 /* Return OP, stripped of any conversions to wider types as much as is safe.
5440 Converting the value back to OP's type makes a value equivalent to OP.
5442 If FOR_TYPE is nonzero, we return a value which, if converted to
5443 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5445 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5446 narrowest type that can hold the value, even if they don't exactly fit.
5447 Otherwise, bit-field references are changed to a narrower type
5448 only if they can be fetched directly from memory in that type.
5450 OP must have integer, real or enumeral type. Pointers are not allowed!
5452 There are some cases where the obvious value we could return
5453 would regenerate to OP if converted to OP's type,
5454 but would not extend like OP to wider types.
5455 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5456 For example, if OP is (unsigned short)(signed char)-1,
5457 we avoid returning (signed char)-1 if FOR_TYPE is int,
5458 even though extending that to an unsigned short would regenerate OP,
5459 since the result of extending (signed char)-1 to (int)
5460 is different from (int) OP. */
5463 get_unwidened (tree op, tree for_type)
5465 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5466 tree type = TREE_TYPE (op);
5468 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5470 = (for_type != 0 && for_type != type
5471 && final_prec > TYPE_PRECISION (type)
5472 && TYPE_UNSIGNED (type));
5475 while (TREE_CODE (op) == NOP_EXPR
5476 || TREE_CODE (op) == CONVERT_EXPR)
5480 /* TYPE_PRECISION on vector types has different meaning
5481 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5482 so avoid them here. */
5483 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5486 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5487 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5489 /* Truncations are many-one so cannot be removed.
5490 Unless we are later going to truncate down even farther. */
5492 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5495 /* See what's inside this conversion. If we decide to strip it,
5497 op = TREE_OPERAND (op, 0);
5499 /* If we have not stripped any zero-extensions (uns is 0),
5500 we can strip any kind of extension.
5501 If we have previously stripped a zero-extension,
5502 only zero-extensions can safely be stripped.
5503 Any extension can be stripped if the bits it would produce
5504 are all going to be discarded later by truncating to FOR_TYPE. */
5508 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5510 /* TYPE_UNSIGNED says whether this is a zero-extension.
5511 Let's avoid computing it if it does not affect WIN
5512 and if UNS will not be needed again. */
5514 || TREE_CODE (op) == NOP_EXPR
5515 || TREE_CODE (op) == CONVERT_EXPR)
5516 && TYPE_UNSIGNED (TREE_TYPE (op)))
5524 if (TREE_CODE (op) == COMPONENT_REF
5525 /* Since type_for_size always gives an integer type. */
5526 && TREE_CODE (type) != REAL_TYPE
5527 /* Don't crash if field not laid out yet. */
5528 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5529 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5531 unsigned int innerprec
5532 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5533 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5534 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5535 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5537 /* We can get this structure field in the narrowest type it fits in.
5538 If FOR_TYPE is 0, do this only for a field that matches the
5539 narrower type exactly and is aligned for it
5540 The resulting extension to its nominal type (a fullword type)
5541 must fit the same conditions as for other extensions. */
5544 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5545 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5546 && (! uns || final_prec <= innerprec || unsignedp))
5548 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5549 TREE_OPERAND (op, 1), NULL_TREE);
5550 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5551 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5558 /* Return OP or a simpler expression for a narrower value
5559 which can be sign-extended or zero-extended to give back OP.
5560 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5561 or 0 if the value should be sign-extended. */
5564 get_narrower (tree op, int *unsignedp_ptr)
5569 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5571 while (TREE_CODE (op) == NOP_EXPR)
5574 = (TYPE_PRECISION (TREE_TYPE (op))
5575 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5577 /* Truncations are many-one so cannot be removed. */
5581 /* See what's inside this conversion. If we decide to strip it,
5586 op = TREE_OPERAND (op, 0);
5587 /* An extension: the outermost one can be stripped,
5588 but remember whether it is zero or sign extension. */
5590 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5591 /* Otherwise, if a sign extension has been stripped,
5592 only sign extensions can now be stripped;
5593 if a zero extension has been stripped, only zero-extensions. */
5594 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5598 else /* bitschange == 0 */
5600 /* A change in nominal type can always be stripped, but we must
5601 preserve the unsignedness. */
5603 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5605 op = TREE_OPERAND (op, 0);
5606 /* Keep trying to narrow, but don't assign op to win if it
5607 would turn an integral type into something else. */
5608 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
5615 if (TREE_CODE (op) == COMPONENT_REF
5616 /* Since type_for_size always gives an integer type. */
5617 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
5618 /* Ensure field is laid out already. */
5619 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5620 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5622 unsigned HOST_WIDE_INT innerprec
5623 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5624 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5625 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5626 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5628 /* We can get this structure field in a narrower type that fits it,
5629 but the resulting extension to its nominal type (a fullword type)
5630 must satisfy the same conditions as for other extensions.
5632 Do this only for fields that are aligned (not bit-fields),
5633 because when bit-field insns will be used there is no
5634 advantage in doing this. */
5636 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5637 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5638 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
5642 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
5643 win = fold_convert (type, op);
5647 *unsignedp_ptr = uns;
5651 /* Nonzero if integer constant C has a value that is permissible
5652 for type TYPE (an INTEGER_TYPE). */
5655 int_fits_type_p (tree c, tree type)
5657 tree type_low_bound = TYPE_MIN_VALUE (type);
5658 tree type_high_bound = TYPE_MAX_VALUE (type);
5659 bool ok_for_low_bound, ok_for_high_bound;
5662 /* If at least one bound of the type is a constant integer, we can check
5663 ourselves and maybe make a decision. If no such decision is possible, but
5664 this type is a subtype, try checking against that. Otherwise, use
5665 force_fit_type, which checks against the precision.
5667 Compute the status for each possibly constant bound, and return if we see
5668 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5669 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5670 for "constant known to fit". */
5672 /* Check if C >= type_low_bound. */
5673 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
5675 if (tree_int_cst_lt (c, type_low_bound))
5677 ok_for_low_bound = true;
5680 ok_for_low_bound = false;
5682 /* Check if c <= type_high_bound. */
5683 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
5685 if (tree_int_cst_lt (type_high_bound, c))
5687 ok_for_high_bound = true;
5690 ok_for_high_bound = false;
5692 /* If the constant fits both bounds, the result is known. */
5693 if (ok_for_low_bound && ok_for_high_bound)
5696 /* Perform some generic filtering which may allow making a decision
5697 even if the bounds are not constant. First, negative integers
5698 never fit in unsigned types, */
5699 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
5702 /* Second, narrower types always fit in wider ones. */
5703 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
5706 /* Third, unsigned integers with top bit set never fit signed types. */
5707 if (! TYPE_UNSIGNED (type)
5708 && TYPE_UNSIGNED (TREE_TYPE (c))
5709 && tree_int_cst_msb (c))
5712 /* If we haven't been able to decide at this point, there nothing more we
5713 can check ourselves here. Look at the base type if we have one and it
5714 has the same precision. */
5715 if (TREE_CODE (type) == INTEGER_TYPE
5716 && TREE_TYPE (type) != 0
5717 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
5718 return int_fits_type_p (c, TREE_TYPE (type));
5720 /* Or to force_fit_type, if nothing else. */
5721 tmp = copy_node (c);
5722 TREE_TYPE (tmp) = type;
5723 tmp = force_fit_type (tmp, -1, false, false);
5724 return TREE_INT_CST_HIGH (tmp) == TREE_INT_CST_HIGH (c)
5725 && TREE_INT_CST_LOW (tmp) == TREE_INT_CST_LOW (c);
5728 /* Subprogram of following function. Called by walk_tree.
5730 Return *TP if it is an automatic variable or parameter of the
5731 function passed in as DATA. */
5734 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
5736 tree fn = (tree) data;
5741 else if (DECL_P (*tp)
5742 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
5748 /* Returns true if T is, contains, or refers to a type with variable
5749 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
5750 arguments, but not the return type. If FN is nonzero, only return
5751 true if a modifier of the type or position of FN is a variable or
5752 parameter inside FN.
5754 This concept is more general than that of C99 'variably modified types':
5755 in C99, a struct type is never variably modified because a VLA may not
5756 appear as a structure member. However, in GNU C code like:
5758 struct S { int i[f()]; };
5760 is valid, and other languages may define similar constructs. */
5763 variably_modified_type_p (tree type, tree fn)
5767 /* Test if T is either variable (if FN is zero) or an expression containing
5768 a variable in FN. */
5769 #define RETURN_TRUE_IF_VAR(T) \
5770 do { tree _t = (T); \
5771 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5772 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5773 return true; } while (0)
5775 if (type == error_mark_node)
5778 /* If TYPE itself has variable size, it is variably modified. */
5779 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
5780 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
5782 switch (TREE_CODE (type))
5785 case REFERENCE_TYPE:
5787 if (variably_modified_type_p (TREE_TYPE (type), fn))
5793 /* If TYPE is a function type, it is variably modified if the
5794 return type is variably modified. */
5795 if (variably_modified_type_p (TREE_TYPE (type), fn))
5803 /* Scalar types are variably modified if their end points
5805 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
5806 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
5811 case QUAL_UNION_TYPE:
5812 /* We can't see if any of the fields are variably-modified by the
5813 definition we normally use, since that would produce infinite
5814 recursion via pointers. */
5815 /* This is variably modified if some field's type is. */
5816 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
5817 if (TREE_CODE (t) == FIELD_DECL)
5819 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
5820 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
5821 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
5823 if (TREE_CODE (type) == QUAL_UNION_TYPE)
5824 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
5829 /* Do not call ourselves to avoid infinite recursion. This is
5830 variably modified if the element type is. */
5831 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
5832 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
5839 /* The current language may have other cases to check, but in general,
5840 all other types are not variably modified. */
5841 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
5843 #undef RETURN_TRUE_IF_VAR
5846 /* Given a DECL or TYPE, return the scope in which it was declared, or
5847 NULL_TREE if there is no containing scope. */
5850 get_containing_scope (tree t)
5852 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
5855 /* Return the innermost context enclosing DECL that is
5856 a FUNCTION_DECL, or zero if none. */
5859 decl_function_context (tree decl)
5863 if (TREE_CODE (decl) == ERROR_MARK)
5866 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5867 where we look up the function at runtime. Such functions always take
5868 a first argument of type 'pointer to real context'.
5870 C++ should really be fixed to use DECL_CONTEXT for the real context,
5871 and use something else for the "virtual context". */
5872 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
5875 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
5877 context = DECL_CONTEXT (decl);
5879 while (context && TREE_CODE (context) != FUNCTION_DECL)
5881 if (TREE_CODE (context) == BLOCK)
5882 context = BLOCK_SUPERCONTEXT (context);
5884 context = get_containing_scope (context);
5890 /* Return the innermost context enclosing DECL that is
5891 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5892 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5895 decl_type_context (tree decl)
5897 tree context = DECL_CONTEXT (decl);
5900 switch (TREE_CODE (context))
5902 case NAMESPACE_DECL:
5903 case TRANSLATION_UNIT_DECL:
5908 case QUAL_UNION_TYPE:
5913 context = DECL_CONTEXT (context);
5917 context = BLOCK_SUPERCONTEXT (context);
5927 /* CALL is a CALL_EXPR. Return the declaration for the function
5928 called, or NULL_TREE if the called function cannot be
5932 get_callee_fndecl (tree call)
5936 if (call == error_mark_node)
5939 /* It's invalid to call this function with anything but a
5941 gcc_assert (TREE_CODE (call) == CALL_EXPR);
5943 /* The first operand to the CALL is the address of the function
5945 addr = TREE_OPERAND (call, 0);
5949 /* If this is a readonly function pointer, extract its initial value. */
5950 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5951 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5952 && DECL_INITIAL (addr))
5953 addr = DECL_INITIAL (addr);
5955 /* If the address is just `&f' for some function `f', then we know
5956 that `f' is being called. */
5957 if (TREE_CODE (addr) == ADDR_EXPR
5958 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5959 return TREE_OPERAND (addr, 0);
5961 /* We couldn't figure out what was being called. Maybe the front
5962 end has some idea. */
5963 return lang_hooks.lang_get_callee_fndecl (call);
5966 /* Print debugging information about tree nodes generated during the compile,
5967 and any language-specific information. */
5970 dump_tree_statistics (void)
5972 #ifdef GATHER_STATISTICS
5974 int total_nodes, total_bytes;
5977 fprintf (stderr, "\n??? tree nodes created\n\n");
5978 #ifdef GATHER_STATISTICS
5979 fprintf (stderr, "Kind Nodes Bytes\n");
5980 fprintf (stderr, "---------------------------------------\n");
5981 total_nodes = total_bytes = 0;
5982 for (i = 0; i < (int) all_kinds; i++)
5984 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
5985 tree_node_counts[i], tree_node_sizes[i]);
5986 total_nodes += tree_node_counts[i];
5987 total_bytes += tree_node_sizes[i];
5989 fprintf (stderr, "---------------------------------------\n");
5990 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
5991 fprintf (stderr, "---------------------------------------\n");
5992 ssanames_print_statistics ();
5993 phinodes_print_statistics ();
5995 fprintf (stderr, "(No per-node statistics)\n");
5997 print_type_hash_statistics ();
5998 print_debug_expr_statistics ();
5999 print_value_expr_statistics ();
6000 print_restrict_base_statistics ();
6001 lang_hooks.print_statistics ();
6004 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6006 /* Generate a crc32 of a string. */
6009 crc32_string (unsigned chksum, const char *string)
6013 unsigned value = *string << 24;
6016 for (ix = 8; ix--; value <<= 1)
6020 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6029 /* P is a string that will be used in a symbol. Mask out any characters
6030 that are not valid in that context. */
6033 clean_symbol_name (char *p)
6037 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6040 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6047 /* Generate a name for a function unique to this translation unit.
6048 TYPE is some string to identify the purpose of this function to the
6049 linker or collect2. */
6052 get_file_function_name_long (const char *type)
6058 if (first_global_object_name)
6060 p = first_global_object_name;
6062 /* For type 'F', the generated name must be unique not only to this
6063 translation unit but also to any given link. Since global names
6064 can be overloaded, we concatenate the first global object name
6065 with a string derived from the file name of this object. */
6066 if (!strcmp (type, "F"))
6068 const char *file = main_input_filename;
6071 file = input_filename;
6073 q = alloca (strlen (p) + 10);
6074 sprintf (q, "%s_%08X", p, crc32_string (0, file));
6081 /* We don't have anything that we know to be unique to this translation
6082 unit, so use what we do have and throw in some randomness. */
6084 const char *name = weak_global_object_name;
6085 const char *file = main_input_filename;
6090 file = input_filename;
6092 len = strlen (file);
6093 q = alloca (9 * 2 + len + 1);
6094 memcpy (q, file, len + 1);
6095 clean_symbol_name (q);
6097 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6098 crc32_string (0, flag_random_seed));
6103 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6105 /* Set up the name of the file-level functions we may need.
6106 Use a global object (which is already required to be unique over
6107 the program) rather than the file name (which imposes extra
6109 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6111 return get_identifier (buf);
6114 /* If KIND=='I', return a suitable global initializer (constructor) name.
6115 If KIND=='D', return a suitable global clean-up (destructor) name. */
6118 get_file_function_name (int kind)
6125 return get_file_function_name_long (p);
6128 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6130 /* Complain that the tree code of NODE does not match the expected 0
6131 terminated list of trailing codes. The trailing code list can be
6132 empty, for a more vague error message. FILE, LINE, and FUNCTION
6133 are of the caller. */
6136 tree_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]);
6150 va_start (args, function);
6151 length += strlen ("expected ");
6152 buffer = alloca (length);
6154 while ((code = va_arg (args, int)))
6156 const char *prefix = length ? " or " : "expected ";
6158 strcpy (buffer + length, prefix);
6159 length += strlen (prefix);
6160 strcpy (buffer + length, tree_code_name[code]);
6161 length += strlen (tree_code_name[code]);
6166 buffer = (char *)"unexpected node";
6168 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6169 buffer, tree_code_name[TREE_CODE (node)],
6170 function, trim_filename (file), line);
6173 /* Complain that the tree code of NODE does match the expected 0
6174 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6178 tree_not_check_failed (const tree node, const char *file,
6179 int line, const char *function, ...)
6183 unsigned length = 0;
6186 va_start (args, function);
6187 while ((code = va_arg (args, int)))
6188 length += 4 + strlen (tree_code_name[code]);
6190 va_start (args, function);
6191 buffer = alloca (length);
6193 while ((code = va_arg (args, int)))
6197 strcpy (buffer + length, " or ");
6200 strcpy (buffer + length, tree_code_name[code]);
6201 length += strlen (tree_code_name[code]);
6205 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6206 buffer, tree_code_name[TREE_CODE (node)],
6207 function, trim_filename (file), line);
6210 /* Similar to tree_check_failed, except that we check for a class of tree
6211 code, given in CL. */
6214 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6215 const char *file, int line, const char *function)
6218 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6219 TREE_CODE_CLASS_STRING (cl),
6220 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6221 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6224 /* Similar to tree_check_failed, except that instead of specifying a
6225 dozen codes, use the knowledge that they're all sequential. */
6228 tree_range_check_failed (const tree node, const char *file, int line,
6229 const char *function, enum tree_code c1,
6233 unsigned length = 0;
6236 for (c = c1; c <= c2; ++c)
6237 length += 4 + strlen (tree_code_name[c]);
6239 length += strlen ("expected ");
6240 buffer = alloca (length);
6243 for (c = c1; c <= c2; ++c)
6245 const char *prefix = length ? " or " : "expected ";
6247 strcpy (buffer + length, prefix);
6248 length += strlen (prefix);
6249 strcpy (buffer + length, tree_code_name[c]);
6250 length += strlen (tree_code_name[c]);
6253 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6254 buffer, tree_code_name[TREE_CODE (node)],
6255 function, trim_filename (file), line);
6259 /* Similar to tree_check_failed, except that we check that a tree does
6260 not have the specified code, given in CL. */
6263 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6264 const char *file, int line, const char *function)
6267 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6268 TREE_CODE_CLASS_STRING (cl),
6269 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6270 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6274 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6277 omp_clause_check_failed (const tree node, const char *file, int line,
6278 const char *function, enum omp_clause_code code)
6280 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6281 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6282 function, trim_filename (file), line);
6286 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6289 omp_clause_range_check_failed (const tree node, const char *file, int line,
6290 const char *function, enum omp_clause_code c1,
6291 enum omp_clause_code c2)
6294 unsigned length = 0;
6295 enum omp_clause_code c;
6297 for (c = c1; c <= c2; ++c)
6298 length += 4 + strlen (omp_clause_code_name[c]);
6300 length += strlen ("expected ");
6301 buffer = alloca (length);
6304 for (c = c1; c <= c2; ++c)
6306 const char *prefix = length ? " or " : "expected ";
6308 strcpy (buffer + length, prefix);
6309 length += strlen (prefix);
6310 strcpy (buffer + length, omp_clause_code_name[c]);
6311 length += strlen (omp_clause_code_name[c]);
6314 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6315 buffer, omp_clause_code_name[TREE_CODE (node)],
6316 function, trim_filename (file), line);
6320 #undef DEFTREESTRUCT
6321 #define DEFTREESTRUCT(VAL, NAME) NAME,
6323 static const char *ts_enum_names[] = {
6324 #include "treestruct.def"
6326 #undef DEFTREESTRUCT
6328 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6330 /* Similar to tree_class_check_failed, except that we check for
6331 whether CODE contains the tree structure identified by EN. */
6334 tree_contains_struct_check_failed (const tree node,
6335 const enum tree_node_structure_enum en,
6336 const char *file, int line,
6337 const char *function)
6340 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6342 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6346 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6347 (dynamically sized) vector. */
6350 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6351 const char *function)
6354 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6355 idx + 1, len, function, trim_filename (file), line);
6358 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6359 (dynamically sized) vector. */
6362 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6363 const char *function)
6366 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6367 idx + 1, len, function, trim_filename (file), line);
6370 /* Similar to above, except that the check is for the bounds of the operand
6371 vector of an expression node. */
6374 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
6375 int line, const char *function)
6378 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6379 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
6380 function, trim_filename (file), line);
6383 /* Similar to above, except that the check is for the number of
6384 operands of an OMP_CLAUSE node. */
6387 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6388 int line, const char *function)
6391 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6392 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6393 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6394 trim_filename (file), line);
6396 #endif /* ENABLE_TREE_CHECKING */
6398 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6399 and mapped to the machine mode MODE. Initialize its fields and build
6400 the information necessary for debugging output. */
6403 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6406 hashval_t hashcode = 0;
6408 /* Build a main variant, based on the main variant of the inner type, then
6409 use it to build the variant we return. */
6410 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
6411 && TYPE_MAIN_VARIANT (innertype) != innertype)
6412 return build_type_attribute_qual_variant (
6413 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
6414 TYPE_ATTRIBUTES (innertype),
6415 TYPE_QUALS (innertype));
6417 t = make_node (VECTOR_TYPE);
6418 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6419 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6420 TYPE_MODE (t) = mode;
6421 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6422 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6427 tree index = build_int_cst (NULL_TREE, nunits - 1);
6428 tree array = build_array_type (innertype, build_index_type (index));
6429 tree rt = make_node (RECORD_TYPE);
6431 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6432 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6434 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6435 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6436 the representation type, and we want to find that die when looking up
6437 the vector type. This is most easily achieved by making the TYPE_UID
6439 TYPE_UID (rt) = TYPE_UID (t);
6442 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
6443 hashcode = iterative_hash_host_wide_int (mode, hashcode);
6444 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
6445 return type_hash_canon (hashcode, t);
6449 make_or_reuse_type (unsigned size, int unsignedp)
6451 if (size == INT_TYPE_SIZE)
6452 return unsignedp ? unsigned_type_node : integer_type_node;
6453 if (size == CHAR_TYPE_SIZE)
6454 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6455 if (size == SHORT_TYPE_SIZE)
6456 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6457 if (size == LONG_TYPE_SIZE)
6458 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6459 if (size == LONG_LONG_TYPE_SIZE)
6460 return (unsignedp ? long_long_unsigned_type_node
6461 : long_long_integer_type_node);
6464 return make_unsigned_type (size);
6466 return make_signed_type (size);
6469 /* Create nodes for all integer types (and error_mark_node) using the sizes
6470 of C datatypes. The caller should call set_sizetype soon after calling
6471 this function to select one of the types as sizetype. */
6474 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6476 error_mark_node = make_node (ERROR_MARK);
6477 TREE_TYPE (error_mark_node) = error_mark_node;
6479 initialize_sizetypes (signed_sizetype);
6481 /* Define both `signed char' and `unsigned char'. */
6482 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6483 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6484 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6485 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6487 /* Define `char', which is like either `signed char' or `unsigned char'
6488 but not the same as either. */
6491 ? make_signed_type (CHAR_TYPE_SIZE)
6492 : make_unsigned_type (CHAR_TYPE_SIZE));
6493 TYPE_STRING_FLAG (char_type_node) = 1;
6495 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6496 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6497 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6498 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6499 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6500 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6501 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6502 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6504 /* Define a boolean type. This type only represents boolean values but
6505 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6506 Front ends which want to override this size (i.e. Java) can redefine
6507 boolean_type_node before calling build_common_tree_nodes_2. */
6508 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6509 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6510 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6511 TYPE_PRECISION (boolean_type_node) = 1;
6513 /* Fill in the rest of the sized types. Reuse existing type nodes
6515 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6516 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6517 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6518 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6519 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6521 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6522 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6523 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6524 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6525 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6527 access_public_node = get_identifier ("public");
6528 access_protected_node = get_identifier ("protected");
6529 access_private_node = get_identifier ("private");
6532 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6533 It will create several other common tree nodes. */
6536 build_common_tree_nodes_2 (int short_double)
6538 /* Define these next since types below may used them. */
6539 integer_zero_node = build_int_cst (NULL_TREE, 0);
6540 integer_one_node = build_int_cst (NULL_TREE, 1);
6541 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6543 size_zero_node = size_int (0);
6544 size_one_node = size_int (1);
6545 bitsize_zero_node = bitsize_int (0);
6546 bitsize_one_node = bitsize_int (1);
6547 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6549 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6550 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6552 void_type_node = make_node (VOID_TYPE);
6553 layout_type (void_type_node);
6555 /* We are not going to have real types in C with less than byte alignment,
6556 so we might as well not have any types that claim to have it. */
6557 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6558 TYPE_USER_ALIGN (void_type_node) = 0;
6560 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6561 layout_type (TREE_TYPE (null_pointer_node));
6563 ptr_type_node = build_pointer_type (void_type_node);
6565 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6566 fileptr_type_node = ptr_type_node;
6568 float_type_node = make_node (REAL_TYPE);
6569 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6570 layout_type (float_type_node);
6572 double_type_node = make_node (REAL_TYPE);
6574 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6576 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6577 layout_type (double_type_node);
6579 long_double_type_node = make_node (REAL_TYPE);
6580 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6581 layout_type (long_double_type_node);
6583 float_ptr_type_node = build_pointer_type (float_type_node);
6584 double_ptr_type_node = build_pointer_type (double_type_node);
6585 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6586 integer_ptr_type_node = build_pointer_type (integer_type_node);
6588 /* Decimal float types. */
6589 dfloat32_type_node = make_node (REAL_TYPE);
6590 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
6591 layout_type (dfloat32_type_node);
6592 TYPE_MODE (dfloat32_type_node) = SDmode;
6593 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
6595 dfloat64_type_node = make_node (REAL_TYPE);
6596 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
6597 layout_type (dfloat64_type_node);
6598 TYPE_MODE (dfloat64_type_node) = DDmode;
6599 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
6601 dfloat128_type_node = make_node (REAL_TYPE);
6602 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
6603 layout_type (dfloat128_type_node);
6604 TYPE_MODE (dfloat128_type_node) = TDmode;
6605 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
6607 complex_integer_type_node = make_node (COMPLEX_TYPE);
6608 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6609 layout_type (complex_integer_type_node);
6611 complex_float_type_node = make_node (COMPLEX_TYPE);
6612 TREE_TYPE (complex_float_type_node) = float_type_node;
6613 layout_type (complex_float_type_node);
6615 complex_double_type_node = make_node (COMPLEX_TYPE);
6616 TREE_TYPE (complex_double_type_node) = double_type_node;
6617 layout_type (complex_double_type_node);
6619 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6620 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6621 layout_type (complex_long_double_type_node);
6624 tree t = targetm.build_builtin_va_list ();
6626 /* Many back-ends define record types without setting TYPE_NAME.
6627 If we copied the record type here, we'd keep the original
6628 record type without a name. This breaks name mangling. So,
6629 don't copy record types and let c_common_nodes_and_builtins()
6630 declare the type to be __builtin_va_list. */
6631 if (TREE_CODE (t) != RECORD_TYPE)
6632 t = build_variant_type_copy (t);
6634 va_list_type_node = t;
6638 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6641 local_define_builtin (const char *name, tree type, enum built_in_function code,
6642 const char *library_name, int ecf_flags)
6646 decl = lang_hooks.builtin_function (name, type, code, BUILT_IN_NORMAL,
6647 library_name, NULL_TREE);
6648 if (ecf_flags & ECF_CONST)
6649 TREE_READONLY (decl) = 1;
6650 if (ecf_flags & ECF_PURE)
6651 DECL_IS_PURE (decl) = 1;
6652 if (ecf_flags & ECF_NORETURN)
6653 TREE_THIS_VOLATILE (decl) = 1;
6654 if (ecf_flags & ECF_NOTHROW)
6655 TREE_NOTHROW (decl) = 1;
6656 if (ecf_flags & ECF_MALLOC)
6657 DECL_IS_MALLOC (decl) = 1;
6659 built_in_decls[code] = decl;
6660 implicit_built_in_decls[code] = decl;
6663 /* Call this function after instantiating all builtins that the language
6664 front end cares about. This will build the rest of the builtins that
6665 are relied upon by the tree optimizers and the middle-end. */
6668 build_common_builtin_nodes (void)
6672 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
6673 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6675 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6676 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6677 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6678 ftype = build_function_type (ptr_type_node, tmp);
6680 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
6681 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
6682 "memcpy", ECF_NOTHROW);
6683 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6684 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
6685 "memmove", ECF_NOTHROW);
6688 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
6690 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6691 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6692 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6693 ftype = build_function_type (integer_type_node, tmp);
6694 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
6695 "memcmp", ECF_PURE | ECF_NOTHROW);
6698 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
6700 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6701 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
6702 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6703 ftype = build_function_type (ptr_type_node, tmp);
6704 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
6705 "memset", ECF_NOTHROW);
6708 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
6710 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6711 ftype = build_function_type (ptr_type_node, tmp);
6712 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
6713 "alloca", ECF_NOTHROW | ECF_MALLOC);
6716 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6717 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6718 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6719 ftype = build_function_type (void_type_node, tmp);
6720 local_define_builtin ("__builtin_init_trampoline", ftype,
6721 BUILT_IN_INIT_TRAMPOLINE,
6722 "__builtin_init_trampoline", ECF_NOTHROW);
6724 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6725 ftype = build_function_type (ptr_type_node, tmp);
6726 local_define_builtin ("__builtin_adjust_trampoline", ftype,
6727 BUILT_IN_ADJUST_TRAMPOLINE,
6728 "__builtin_adjust_trampoline",
6729 ECF_CONST | ECF_NOTHROW);
6731 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6732 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6733 ftype = build_function_type (void_type_node, tmp);
6734 local_define_builtin ("__builtin_nonlocal_goto", ftype,
6735 BUILT_IN_NONLOCAL_GOTO,
6736 "__builtin_nonlocal_goto",
6737 ECF_NORETURN | ECF_NOTHROW);
6739 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6740 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6741 ftype = build_function_type (void_type_node, tmp);
6742 local_define_builtin ("__builtin_setjmp_setup", ftype,
6743 BUILT_IN_SETJMP_SETUP,
6744 "__builtin_setjmp_setup", ECF_NOTHROW);
6746 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6747 ftype = build_function_type (ptr_type_node, tmp);
6748 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
6749 BUILT_IN_SETJMP_DISPATCHER,
6750 "__builtin_setjmp_dispatcher",
6751 ECF_PURE | ECF_NOTHROW);
6753 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6754 ftype = build_function_type (void_type_node, tmp);
6755 local_define_builtin ("__builtin_setjmp_receiver", ftype,
6756 BUILT_IN_SETJMP_RECEIVER,
6757 "__builtin_setjmp_receiver", ECF_NOTHROW);
6759 ftype = build_function_type (ptr_type_node, void_list_node);
6760 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
6761 "__builtin_stack_save", ECF_NOTHROW);
6763 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6764 ftype = build_function_type (void_type_node, tmp);
6765 local_define_builtin ("__builtin_stack_restore", ftype,
6766 BUILT_IN_STACK_RESTORE,
6767 "__builtin_stack_restore", ECF_NOTHROW);
6769 ftype = build_function_type (void_type_node, void_list_node);
6770 local_define_builtin ("__builtin_profile_func_enter", ftype,
6771 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
6772 local_define_builtin ("__builtin_profile_func_exit", ftype,
6773 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
6775 /* Complex multiplication and division. These are handled as builtins
6776 rather than optabs because emit_library_call_value doesn't support
6777 complex. Further, we can do slightly better with folding these
6778 beasties if the real and complex parts of the arguments are separate. */
6780 enum machine_mode mode;
6782 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
6784 char mode_name_buf[4], *q;
6786 enum built_in_function mcode, dcode;
6787 tree type, inner_type;
6789 type = lang_hooks.types.type_for_mode (mode, 0);
6792 inner_type = TREE_TYPE (type);
6794 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
6795 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6796 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6797 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6798 ftype = build_function_type (type, tmp);
6800 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6801 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6803 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
6807 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
6808 local_define_builtin (built_in_names[mcode], ftype, mcode,
6809 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
6811 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
6812 local_define_builtin (built_in_names[dcode], ftype, dcode,
6813 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
6818 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6821 If we requested a pointer to a vector, build up the pointers that
6822 we stripped off while looking for the inner type. Similarly for
6823 return values from functions.
6825 The argument TYPE is the top of the chain, and BOTTOM is the
6826 new type which we will point to. */
6829 reconstruct_complex_type (tree type, tree bottom)
6833 if (POINTER_TYPE_P (type))
6835 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6836 outer = build_pointer_type (inner);
6838 else if (TREE_CODE (type) == ARRAY_TYPE)
6840 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6841 outer = build_array_type (inner, TYPE_DOMAIN (type));
6843 else if (TREE_CODE (type) == FUNCTION_TYPE)
6845 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6846 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
6848 else if (TREE_CODE (type) == METHOD_TYPE)
6851 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6852 /* The build_method_type_directly() routine prepends 'this' to argument list,
6853 so we must compensate by getting rid of it. */
6854 argtypes = TYPE_ARG_TYPES (type);
6855 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
6857 TYPE_ARG_TYPES (type));
6858 TYPE_ARG_TYPES (outer) = argtypes;
6863 TYPE_READONLY (outer) = TYPE_READONLY (type);
6864 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
6869 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6872 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
6876 switch (GET_MODE_CLASS (mode))
6878 case MODE_VECTOR_INT:
6879 case MODE_VECTOR_FLOAT:
6880 nunits = GET_MODE_NUNITS (mode);
6884 /* Check that there are no leftover bits. */
6885 gcc_assert (GET_MODE_BITSIZE (mode)
6886 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
6888 nunits = GET_MODE_BITSIZE (mode)
6889 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
6896 return make_vector_type (innertype, nunits, mode);
6899 /* Similarly, but takes the inner type and number of units, which must be
6903 build_vector_type (tree innertype, int nunits)
6905 return make_vector_type (innertype, nunits, VOIDmode);
6909 /* Build RESX_EXPR with given REGION_NUMBER. */
6911 build_resx (int region_number)
6914 t = build1 (RESX_EXPR, void_type_node,
6915 build_int_cst (NULL_TREE, region_number));
6919 /* Given an initializer INIT, return TRUE if INIT is zero or some
6920 aggregate of zeros. Otherwise return FALSE. */
6922 initializer_zerop (tree init)
6928 switch (TREE_CODE (init))
6931 return integer_zerop (init);
6934 /* ??? Note that this is not correct for C4X float formats. There,
6935 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6936 negative exponent. */
6937 return real_zerop (init)
6938 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
6941 return integer_zerop (init)
6942 || (real_zerop (init)
6943 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
6944 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
6947 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
6948 if (!initializer_zerop (TREE_VALUE (elt)))
6954 unsigned HOST_WIDE_INT idx;
6956 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
6957 if (!initializer_zerop (elt))
6967 /* Build an empty statement. */
6970 build_empty_stmt (void)
6972 return build1 (NOP_EXPR, void_type_node, size_zero_node);
6976 /* Build an OpenMP clause with code CODE. */
6979 build_omp_clause (enum omp_clause_code code)
6984 length = omp_clause_num_ops[code];
6985 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
6987 t = ggc_alloc (size);
6988 memset (t, 0, size);
6989 TREE_SET_CODE (t, OMP_CLAUSE);
6990 OMP_CLAUSE_SET_CODE (t, code);
6992 #ifdef GATHER_STATISTICS
6993 tree_node_counts[(int) omp_clause_kind]++;
6994 tree_node_sizes[(int) omp_clause_kind] += size;
7001 /* Returns true if it is possible to prove that the index of
7002 an array access REF (an ARRAY_REF expression) falls into the
7006 in_array_bounds_p (tree ref)
7008 tree idx = TREE_OPERAND (ref, 1);
7011 if (TREE_CODE (idx) != INTEGER_CST)
7014 min = array_ref_low_bound (ref);
7015 max = array_ref_up_bound (ref);
7018 || TREE_CODE (min) != INTEGER_CST
7019 || TREE_CODE (max) != INTEGER_CST)
7022 if (tree_int_cst_lt (idx, min)
7023 || tree_int_cst_lt (max, idx))
7029 /* Returns true if it is possible to prove that the range of
7030 an array access REF (an ARRAY_RANGE_REF expression) falls
7031 into the array bounds. */
7034 range_in_array_bounds_p (tree ref)
7036 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7037 tree range_min, range_max, min, max;
7039 range_min = TYPE_MIN_VALUE (domain_type);
7040 range_max = TYPE_MAX_VALUE (domain_type);
7043 || TREE_CODE (range_min) != INTEGER_CST
7044 || TREE_CODE (range_max) != INTEGER_CST)
7047 min = array_ref_low_bound (ref);
7048 max = array_ref_up_bound (ref);
7051 || TREE_CODE (min) != INTEGER_CST
7052 || TREE_CODE (max) != INTEGER_CST)
7055 if (tree_int_cst_lt (range_min, min)
7056 || tree_int_cst_lt (max, range_max))
7062 /* Return true if T (assumed to be a DECL) is a global variable. */
7065 is_global_var (tree t)
7068 return (TREE_STATIC (t) || MTAG_GLOBAL (t));
7070 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
7073 /* Return true if T (assumed to be a DECL) must be assigned a memory
7077 needs_to_live_in_memory (tree t)
7079 return (TREE_ADDRESSABLE (t)
7080 || is_global_var (t)
7081 || (TREE_CODE (t) == RESULT_DECL
7082 && aggregate_value_p (t, current_function_decl)));
7085 /* There are situations in which a language considers record types
7086 compatible which have different field lists. Decide if two fields
7087 are compatible. It is assumed that the parent records are compatible. */
7090 fields_compatible_p (tree f1, tree f2)
7092 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7093 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7096 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7097 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7100 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7106 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7109 find_compatible_field (tree record, tree orig_field)
7113 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7114 if (TREE_CODE (f) == FIELD_DECL
7115 && fields_compatible_p (f, orig_field))
7118 /* ??? Why isn't this on the main fields list? */
7119 f = TYPE_VFIELD (record);
7120 if (f && TREE_CODE (f) == FIELD_DECL
7121 && fields_compatible_p (f, orig_field))
7124 /* ??? We should abort here, but Java appears to do Bad Things
7125 with inherited fields. */
7129 /* Return value of a constant X. */
7132 int_cst_value (tree x)
7134 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
7135 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
7136 bool negative = ((val >> (bits - 1)) & 1) != 0;
7138 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
7141 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
7143 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
7148 /* Returns the greatest common divisor of A and B, which must be
7152 tree_fold_gcd (tree a, tree b)
7155 tree type = TREE_TYPE (a);
7157 gcc_assert (TREE_CODE (a) == INTEGER_CST);
7158 gcc_assert (TREE_CODE (b) == INTEGER_CST);
7160 if (integer_zerop (a))
7163 if (integer_zerop (b))
7166 if (tree_int_cst_sgn (a) == -1)
7167 a = fold_build2 (MULT_EXPR, type, a,
7168 build_int_cst (type, -1));
7170 if (tree_int_cst_sgn (b) == -1)
7171 b = fold_build2 (MULT_EXPR, type, b,
7172 build_int_cst (type, -1));
7176 a_mod_b = fold_build2 (FLOOR_MOD_EXPR, type, a, b);
7178 if (!TREE_INT_CST_LOW (a_mod_b)
7179 && !TREE_INT_CST_HIGH (a_mod_b))
7187 /* Returns unsigned variant of TYPE. */
7190 unsigned_type_for (tree type)
7192 if (POINTER_TYPE_P (type))
7193 return lang_hooks.types.unsigned_type (size_type_node);
7194 return lang_hooks.types.unsigned_type (type);
7197 /* Returns signed variant of TYPE. */
7200 signed_type_for (tree type)
7202 if (POINTER_TYPE_P (type))
7203 return lang_hooks.types.signed_type (size_type_node);
7204 return lang_hooks.types.signed_type (type);
7207 /* Returns the largest value obtainable by casting something in INNER type to
7211 upper_bound_in_type (tree outer, tree inner)
7213 unsigned HOST_WIDE_INT lo, hi;
7214 unsigned int det = 0;
7215 unsigned oprec = TYPE_PRECISION (outer);
7216 unsigned iprec = TYPE_PRECISION (inner);
7219 /* Compute a unique number for every combination. */
7220 det |= (oprec > iprec) ? 4 : 0;
7221 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7222 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7224 /* Determine the exponent to use. */
7229 /* oprec <= iprec, outer: signed, inner: don't care. */
7234 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7238 /* oprec > iprec, outer: signed, inner: signed. */
7242 /* oprec > iprec, outer: signed, inner: unsigned. */
7246 /* oprec > iprec, outer: unsigned, inner: signed. */
7250 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7257 /* Compute 2^^prec - 1. */
7258 if (prec <= HOST_BITS_PER_WIDE_INT)
7261 lo = ((~(unsigned HOST_WIDE_INT) 0)
7262 >> (HOST_BITS_PER_WIDE_INT - prec));
7266 hi = ((~(unsigned HOST_WIDE_INT) 0)
7267 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7268 lo = ~(unsigned HOST_WIDE_INT) 0;
7271 return build_int_cst_wide (outer, lo, hi);
7274 /* Returns the smallest value obtainable by casting something in INNER type to
7278 lower_bound_in_type (tree outer, tree inner)
7280 unsigned HOST_WIDE_INT lo, hi;
7281 unsigned oprec = TYPE_PRECISION (outer);
7282 unsigned iprec = TYPE_PRECISION (inner);
7284 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7286 if (TYPE_UNSIGNED (outer)
7287 /* If we are widening something of an unsigned type, OUTER type
7288 contains all values of INNER type. In particular, both INNER
7289 and OUTER types have zero in common. */
7290 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7294 /* If we are widening a signed type to another signed type, we
7295 want to obtain -2^^(iprec-1). If we are keeping the
7296 precision or narrowing to a signed type, we want to obtain
7298 unsigned prec = oprec > iprec ? iprec : oprec;
7300 if (prec <= HOST_BITS_PER_WIDE_INT)
7302 hi = ~(unsigned HOST_WIDE_INT) 0;
7303 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7307 hi = ((~(unsigned HOST_WIDE_INT) 0)
7308 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7313 return build_int_cst_wide (outer, lo, hi);
7316 /* Return nonzero if two operands that are suitable for PHI nodes are
7317 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7318 SSA_NAME or invariant. Note that this is strictly an optimization.
7319 That is, callers of this function can directly call operand_equal_p
7320 and get the same result, only slower. */
7323 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7327 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7329 return operand_equal_p (arg0, arg1, 0);
7332 /* Returns number of zeros at the end of binary representation of X.
7334 ??? Use ffs if available? */
7337 num_ending_zeros (tree x)
7339 unsigned HOST_WIDE_INT fr, nfr;
7340 unsigned num, abits;
7341 tree type = TREE_TYPE (x);
7343 if (TREE_INT_CST_LOW (x) == 0)
7345 num = HOST_BITS_PER_WIDE_INT;
7346 fr = TREE_INT_CST_HIGH (x);
7351 fr = TREE_INT_CST_LOW (x);
7354 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7357 if (nfr << abits == fr)
7364 if (num > TYPE_PRECISION (type))
7365 num = TYPE_PRECISION (type);
7367 return build_int_cst_type (type, num);
7371 #define WALK_SUBTREE(NODE) \
7374 result = walk_tree (&(NODE), func, data, pset); \
7380 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7381 be walked whenever a type is seen in the tree. Rest of operands and return
7382 value are as for walk_tree. */
7385 walk_type_fields (tree type, walk_tree_fn func, void *data,
7386 struct pointer_set_t *pset)
7388 tree result = NULL_TREE;
7390 switch (TREE_CODE (type))
7393 case REFERENCE_TYPE:
7394 /* We have to worry about mutually recursive pointers. These can't
7395 be written in C. They can in Ada. It's pathological, but
7396 there's an ACATS test (c38102a) that checks it. Deal with this
7397 by checking if we're pointing to another pointer, that one
7398 points to another pointer, that one does too, and we have no htab.
7399 If so, get a hash table. We check three levels deep to avoid
7400 the cost of the hash table if we don't need one. */
7401 if (POINTER_TYPE_P (TREE_TYPE (type))
7402 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7403 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7406 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7414 /* ... fall through ... */
7417 WALK_SUBTREE (TREE_TYPE (type));
7421 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7426 WALK_SUBTREE (TREE_TYPE (type));
7430 /* We never want to walk into default arguments. */
7431 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7432 WALK_SUBTREE (TREE_VALUE (arg));
7437 /* Don't follow this nodes's type if a pointer for fear that
7438 we'll have infinite recursion. If we have a PSET, then we
7441 || (!POINTER_TYPE_P (TREE_TYPE (type))
7442 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
7443 WALK_SUBTREE (TREE_TYPE (type));
7444 WALK_SUBTREE (TYPE_DOMAIN (type));
7451 WALK_SUBTREE (TYPE_MIN_VALUE (type));
7452 WALK_SUBTREE (TYPE_MAX_VALUE (type));
7456 WALK_SUBTREE (TREE_TYPE (type));
7457 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7467 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7468 called with the DATA and the address of each sub-tree. If FUNC returns a
7469 non-NULL value, the traversal is stopped, and the value returned by FUNC
7470 is returned. If PSET is non-NULL it is used to record the nodes visited,
7471 and to avoid visiting a node more than once. */
7474 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7476 enum tree_code code;
7480 #define WALK_SUBTREE_TAIL(NODE) \
7484 goto tail_recurse; \
7489 /* Skip empty subtrees. */
7493 /* Don't walk the same tree twice, if the user has requested
7494 that we avoid doing so. */
7495 if (pset && pointer_set_insert (pset, *tp))
7498 /* Call the function. */
7500 result = (*func) (tp, &walk_subtrees, data);
7502 /* If we found something, return it. */
7506 code = TREE_CODE (*tp);
7508 /* Even if we didn't, FUNC may have decided that there was nothing
7509 interesting below this point in the tree. */
7512 /* But we still need to check our siblings. */
7513 if (code == TREE_LIST)
7514 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7515 else if (code == OMP_CLAUSE)
7516 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7521 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
7523 if (result || ! walk_subtrees)
7529 case IDENTIFIER_NODE:
7535 case PLACEHOLDER_EXPR:
7539 /* None of these have subtrees other than those already walked
7544 WALK_SUBTREE (TREE_VALUE (*tp));
7545 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7550 int len = TREE_VEC_LENGTH (*tp);
7555 /* Walk all elements but the first. */
7557 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
7559 /* Now walk the first one as a tail call. */
7560 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
7564 WALK_SUBTREE (TREE_REALPART (*tp));
7565 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
7569 unsigned HOST_WIDE_INT idx;
7570 constructor_elt *ce;
7573 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
7575 WALK_SUBTREE (ce->value);
7580 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
7585 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
7587 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7588 into declarations that are just mentioned, rather than
7589 declared; they don't really belong to this part of the tree.
7590 And, we can see cycles: the initializer for a declaration
7591 can refer to the declaration itself. */
7592 WALK_SUBTREE (DECL_INITIAL (decl));
7593 WALK_SUBTREE (DECL_SIZE (decl));
7594 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
7596 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
7599 case STATEMENT_LIST:
7601 tree_stmt_iterator i;
7602 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
7603 WALK_SUBTREE (*tsi_stmt_ptr (i));
7608 switch (OMP_CLAUSE_CODE (*tp))
7610 case OMP_CLAUSE_PRIVATE:
7611 case OMP_CLAUSE_SHARED:
7612 case OMP_CLAUSE_FIRSTPRIVATE:
7613 case OMP_CLAUSE_LASTPRIVATE:
7614 case OMP_CLAUSE_COPYIN:
7615 case OMP_CLAUSE_COPYPRIVATE:
7617 case OMP_CLAUSE_NUM_THREADS:
7618 case OMP_CLAUSE_SCHEDULE:
7619 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
7622 case OMP_CLAUSE_NOWAIT:
7623 case OMP_CLAUSE_ORDERED:
7624 case OMP_CLAUSE_DEFAULT:
7625 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7627 case OMP_CLAUSE_REDUCTION:
7630 for (i = 0; i < 4; i++)
7631 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
7632 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7644 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7645 But, we only want to walk once. */
7646 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
7647 for (i = 0; i < len; ++i)
7648 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7649 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
7653 /* Walk into various fields of the type that it's defining. We only
7654 want to walk into these fields of a type in this case. Note that
7655 decls get walked as part of the processing of a BIND_EXPR.
7657 ??? Precisely which fields of types that we are supposed to walk in
7658 this case vs. the normal case aren't well defined. */
7659 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL
7660 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp))) != ERROR_MARK)
7662 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
7664 /* Call the function for the type. See if it returns anything or
7665 doesn't want us to continue. If we are to continue, walk both
7666 the normal fields and those for the declaration case. */
7667 result = (*func) (type_p, &walk_subtrees, data);
7668 if (result || !walk_subtrees)
7671 result = walk_type_fields (*type_p, func, data, pset);
7675 /* If this is a record type, also walk the fields. */
7676 if (TREE_CODE (*type_p) == RECORD_TYPE
7677 || TREE_CODE (*type_p) == UNION_TYPE
7678 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7682 for (field = TYPE_FIELDS (*type_p); field;
7683 field = TREE_CHAIN (field))
7685 /* We'd like to look at the type of the field, but we can
7686 easily get infinite recursion. So assume it's pointed
7687 to elsewhere in the tree. Also, ignore things that
7689 if (TREE_CODE (field) != FIELD_DECL)
7692 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
7693 WALK_SUBTREE (DECL_SIZE (field));
7694 WALK_SUBTREE (DECL_SIZE_UNIT (field));
7695 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7696 WALK_SUBTREE (DECL_QUALIFIER (field));
7700 WALK_SUBTREE (TYPE_SIZE (*type_p));
7701 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
7706 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
7710 /* Walk over all the sub-trees of this operand. */
7711 len = TREE_CODE_LENGTH (code);
7713 /* Go through the subtrees. We need to do this in forward order so
7714 that the scope of a FOR_EXPR is handled properly. */
7717 for (i = 0; i < len - 1; ++i)
7718 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7719 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
7723 /* If this is a type, walk the needed fields in the type. */
7724 else if (TYPE_P (*tp))
7725 return walk_type_fields (*tp, func, data, pset);
7729 /* We didn't find what we were looking for. */
7732 #undef WALK_SUBTREE_TAIL
7736 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7739 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
7742 struct pointer_set_t *pset;
7744 pset = pointer_set_create ();
7745 result = walk_tree (tp, func, data, pset);
7746 pointer_set_destroy (pset);
7751 /* Return true if STMT is an empty statement or contains nothing but
7752 empty statements. */
7755 empty_body_p (tree stmt)
7757 tree_stmt_iterator i;
7760 if (IS_EMPTY_STMT (stmt))
7762 else if (TREE_CODE (stmt) == BIND_EXPR)
7763 body = BIND_EXPR_BODY (stmt);
7764 else if (TREE_CODE (stmt) == STATEMENT_LIST)
7769 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
7770 if (!empty_body_p (tsi_stmt (i)))
7776 #include "gt-tree.h"