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_ALIGN (t) = FUNCTION_BOUNDARY;
547 DECL_MODE (t) = FUNCTION_MODE;
551 /* We have not yet computed the alias set for this declaration. */
552 DECL_POINTER_ALIAS_SET (t) = -1;
554 DECL_SOURCE_LOCATION (t) = input_location;
555 DECL_UID (t) = next_decl_uid++;
560 TYPE_UID (t) = next_type_uid++;
561 TYPE_ALIGN (t) = BITS_PER_UNIT;
562 TYPE_USER_ALIGN (t) = 0;
563 TYPE_MAIN_VARIANT (t) = t;
565 /* Default to no attributes for type, but let target change that. */
566 TYPE_ATTRIBUTES (t) = NULL_TREE;
567 targetm.set_default_type_attributes (t);
569 /* We have not yet computed the alias set for this type. */
570 TYPE_ALIAS_SET (t) = -1;
574 TREE_CONSTANT (t) = 1;
575 TREE_INVARIANT (t) = 1;
584 case PREDECREMENT_EXPR:
585 case PREINCREMENT_EXPR:
586 case POSTDECREMENT_EXPR:
587 case POSTINCREMENT_EXPR:
588 /* All of these have side-effects, no matter what their
590 TREE_SIDE_EFFECTS (t) = 1;
599 /* Other classes need no special treatment. */
606 /* Return a new node with the same contents as NODE except that its
607 TREE_CHAIN is zero and it has a fresh uid. */
610 copy_node_stat (tree node MEM_STAT_DECL)
613 enum tree_code code = TREE_CODE (node);
616 gcc_assert (code != STATEMENT_LIST);
618 length = tree_size (node);
619 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
620 memcpy (t, node, length);
623 TREE_ASM_WRITTEN (t) = 0;
624 TREE_VISITED (t) = 0;
627 if (TREE_CODE_CLASS (code) == tcc_declaration)
629 DECL_UID (t) = next_decl_uid++;
630 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
631 && DECL_HAS_VALUE_EXPR_P (node))
633 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
634 DECL_HAS_VALUE_EXPR_P (t) = 1;
636 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
638 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
639 DECL_HAS_INIT_PRIORITY_P (t) = 1;
641 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
643 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
644 DECL_BASED_ON_RESTRICT_P (t) = 1;
647 else if (TREE_CODE_CLASS (code) == tcc_type)
649 TYPE_UID (t) = next_type_uid++;
650 /* The following is so that the debug code for
651 the copy is different from the original type.
652 The two statements usually duplicate each other
653 (because they clear fields of the same union),
654 but the optimizer should catch that. */
655 TYPE_SYMTAB_POINTER (t) = 0;
656 TYPE_SYMTAB_ADDRESS (t) = 0;
658 /* Do not copy the values cache. */
659 if (TYPE_CACHED_VALUES_P(t))
661 TYPE_CACHED_VALUES_P (t) = 0;
662 TYPE_CACHED_VALUES (t) = NULL_TREE;
669 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
670 For example, this can copy a list made of TREE_LIST nodes. */
673 copy_list (tree list)
681 head = prev = copy_node (list);
682 next = TREE_CHAIN (list);
685 TREE_CHAIN (prev) = copy_node (next);
686 prev = TREE_CHAIN (prev);
687 next = TREE_CHAIN (next);
693 /* Create an INT_CST node with a LOW value sign extended. */
696 build_int_cst (tree type, HOST_WIDE_INT low)
698 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
701 /* Create an INT_CST node with a LOW value zero extended. */
704 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
706 return build_int_cst_wide (type, low, 0);
709 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
710 if it is negative. This function is similar to build_int_cst, but
711 the extra bits outside of the type precision are cleared. Constants
712 with these extra bits may confuse the fold so that it detects overflows
713 even in cases when they do not occur, and in general should be avoided.
714 We cannot however make this a default behavior of build_int_cst without
715 more intrusive changes, since there are parts of gcc that rely on the extra
716 precision of the integer constants. */
719 build_int_cst_type (tree type, HOST_WIDE_INT low)
721 unsigned HOST_WIDE_INT val = (unsigned HOST_WIDE_INT) low;
722 unsigned HOST_WIDE_INT hi, mask;
728 type = integer_type_node;
730 bits = TYPE_PRECISION (type);
731 signed_p = !TYPE_UNSIGNED (type);
733 if (bits >= HOST_BITS_PER_WIDE_INT)
734 negative = (low < 0);
737 /* If the sign bit is inside precision of LOW, use it to determine
738 the sign of the constant. */
739 negative = ((val >> (bits - 1)) & 1) != 0;
741 /* Mask out the bits outside of the precision of the constant. */
742 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
744 if (signed_p && negative)
750 /* Determine the high bits. */
751 hi = (negative ? ~(unsigned HOST_WIDE_INT) 0 : 0);
753 /* For unsigned type we need to mask out the bits outside of the type
757 if (bits <= HOST_BITS_PER_WIDE_INT)
761 bits -= HOST_BITS_PER_WIDE_INT;
762 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
767 return build_int_cst_wide (type, val, hi);
770 /* These are the hash table functions for the hash table of INTEGER_CST
771 nodes of a sizetype. */
773 /* Return the hash code code X, an INTEGER_CST. */
776 int_cst_hash_hash (const void *x)
780 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
781 ^ htab_hash_pointer (TREE_TYPE (t)));
784 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
785 is the same as that given by *Y, which is the same. */
788 int_cst_hash_eq (const void *x, const void *y)
793 return (TREE_TYPE (xt) == TREE_TYPE (yt)
794 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
795 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
798 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
799 integer_type_node is used. The returned node is always shared.
800 For small integers we use a per-type vector cache, for larger ones
801 we use a single hash table. */
804 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
811 type = integer_type_node;
813 switch (TREE_CODE (type))
817 /* Cache NULL pointer. */
826 /* Cache false or true. */
834 if (TYPE_UNSIGNED (type))
837 limit = INTEGER_SHARE_LIMIT;
838 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
844 limit = INTEGER_SHARE_LIMIT + 1;
845 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
847 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
857 /* Look for it in the type's vector of small shared ints. */
858 if (!TYPE_CACHED_VALUES_P (type))
860 TYPE_CACHED_VALUES_P (type) = 1;
861 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
864 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
867 /* Make sure no one is clobbering the shared constant. */
868 gcc_assert (TREE_TYPE (t) == type);
869 gcc_assert (TREE_INT_CST_LOW (t) == low);
870 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
874 /* Create a new shared int. */
875 t = make_node (INTEGER_CST);
877 TREE_INT_CST_LOW (t) = low;
878 TREE_INT_CST_HIGH (t) = hi;
879 TREE_TYPE (t) = type;
881 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
886 /* Use the cache of larger shared ints. */
889 TREE_INT_CST_LOW (int_cst_node) = low;
890 TREE_INT_CST_HIGH (int_cst_node) = hi;
891 TREE_TYPE (int_cst_node) = type;
893 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
897 /* Insert this one into the hash table. */
900 /* Make a new node for next time round. */
901 int_cst_node = make_node (INTEGER_CST);
908 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
909 and the rest are zeros. */
912 build_low_bits_mask (tree type, unsigned bits)
914 unsigned HOST_WIDE_INT low;
916 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
918 gcc_assert (bits <= TYPE_PRECISION (type));
920 if (bits == TYPE_PRECISION (type)
921 && !TYPE_UNSIGNED (type))
923 /* Sign extended all-ones mask. */
927 else if (bits <= HOST_BITS_PER_WIDE_INT)
929 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
934 bits -= HOST_BITS_PER_WIDE_INT;
936 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
939 return build_int_cst_wide (type, low, high);
942 /* Checks that X is integer constant that can be expressed in (unsigned)
943 HOST_WIDE_INT without loss of precision. */
946 cst_and_fits_in_hwi (tree x)
948 if (TREE_CODE (x) != INTEGER_CST)
951 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
954 return (TREE_INT_CST_HIGH (x) == 0
955 || TREE_INT_CST_HIGH (x) == -1);
958 /* Return a new VECTOR_CST node whose type is TYPE and whose values
959 are in a list pointed to by VALS. */
962 build_vector (tree type, tree vals)
964 tree v = make_node (VECTOR_CST);
965 int over1 = 0, over2 = 0;
968 TREE_VECTOR_CST_ELTS (v) = vals;
969 TREE_TYPE (v) = type;
971 /* Iterate through elements and check for overflow. */
972 for (link = vals; link; link = TREE_CHAIN (link))
974 tree value = TREE_VALUE (link);
976 /* Don't crash if we get an address constant. */
977 if (!CONSTANT_CLASS_P (value))
980 over1 |= TREE_OVERFLOW (value);
981 over2 |= TREE_CONSTANT_OVERFLOW (value);
984 TREE_OVERFLOW (v) = over1;
985 TREE_CONSTANT_OVERFLOW (v) = over2;
990 /* Return a new VECTOR_CST node whose type is TYPE and whose values
991 are extracted from V, a vector of CONSTRUCTOR_ELT. */
994 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
996 tree list = NULL_TREE;
997 unsigned HOST_WIDE_INT idx;
1000 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1001 list = tree_cons (NULL_TREE, value, list);
1002 return build_vector (type, nreverse (list));
1005 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1006 are in the VEC pointed to by VALS. */
1008 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1010 tree c = make_node (CONSTRUCTOR);
1011 TREE_TYPE (c) = type;
1012 CONSTRUCTOR_ELTS (c) = vals;
1016 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1019 build_constructor_single (tree type, tree index, tree value)
1021 VEC(constructor_elt,gc) *v;
1022 constructor_elt *elt;
1025 v = VEC_alloc (constructor_elt, gc, 1);
1026 elt = VEC_quick_push (constructor_elt, v, NULL);
1030 t = build_constructor (type, v);
1031 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1036 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1037 are in a list pointed to by VALS. */
1039 build_constructor_from_list (tree type, tree vals)
1042 VEC(constructor_elt,gc) *v = NULL;
1043 bool constant_p = true;
1047 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1048 for (t = vals; t; t = TREE_CHAIN (t))
1050 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1051 val = TREE_VALUE (t);
1052 elt->index = TREE_PURPOSE (t);
1054 if (!TREE_CONSTANT (val))
1059 t = build_constructor (type, v);
1060 TREE_CONSTANT (t) = constant_p;
1065 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1068 build_real (tree type, REAL_VALUE_TYPE d)
1071 REAL_VALUE_TYPE *dp;
1074 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1075 Consider doing it via real_convert now. */
1077 v = make_node (REAL_CST);
1078 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1079 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1081 TREE_TYPE (v) = type;
1082 TREE_REAL_CST_PTR (v) = dp;
1083 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1087 /* Return a new REAL_CST node whose type is TYPE
1088 and whose value is the integer value of the INTEGER_CST node I. */
1091 real_value_from_int_cst (tree type, tree i)
1095 /* Clear all bits of the real value type so that we can later do
1096 bitwise comparisons to see if two values are the same. */
1097 memset (&d, 0, sizeof d);
1099 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1100 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1101 TYPE_UNSIGNED (TREE_TYPE (i)));
1105 /* Given a tree representing an integer constant I, return a tree
1106 representing the same value as a floating-point constant of type TYPE. */
1109 build_real_from_int_cst (tree type, tree i)
1112 int overflow = TREE_OVERFLOW (i);
1114 v = build_real (type, real_value_from_int_cst (type, i));
1116 TREE_OVERFLOW (v) |= overflow;
1117 TREE_CONSTANT_OVERFLOW (v) |= overflow;
1121 /* Return a newly constructed STRING_CST node whose value is
1122 the LEN characters at STR.
1123 The TREE_TYPE is not initialized. */
1126 build_string (int len, const char *str)
1131 /* Do not waste bytes provided by padding of struct tree_string. */
1132 length = len + offsetof (struct tree_string, str) + 1;
1134 #ifdef GATHER_STATISTICS
1135 tree_node_counts[(int) c_kind]++;
1136 tree_node_sizes[(int) c_kind] += length;
1139 s = ggc_alloc_tree (length);
1141 memset (s, 0, sizeof (struct tree_common));
1142 TREE_SET_CODE (s, STRING_CST);
1143 TREE_CONSTANT (s) = 1;
1144 TREE_INVARIANT (s) = 1;
1145 TREE_STRING_LENGTH (s) = len;
1146 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1147 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1152 /* Return a newly constructed COMPLEX_CST node whose value is
1153 specified by the real and imaginary parts REAL and IMAG.
1154 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1155 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1158 build_complex (tree type, tree real, tree imag)
1160 tree t = make_node (COMPLEX_CST);
1162 TREE_REALPART (t) = real;
1163 TREE_IMAGPART (t) = imag;
1164 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1165 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1166 TREE_CONSTANT_OVERFLOW (t)
1167 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1171 /* Return a constant of arithmetic type TYPE which is the
1172 multiplicative identity of the set TYPE. */
1175 build_one_cst (tree type)
1177 switch (TREE_CODE (type))
1179 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1180 case POINTER_TYPE: case REFERENCE_TYPE:
1182 return build_int_cst (type, 1);
1185 return build_real (type, dconst1);
1192 scalar = build_one_cst (TREE_TYPE (type));
1194 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1196 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1197 cst = tree_cons (NULL_TREE, scalar, cst);
1199 return build_vector (type, cst);
1203 return build_complex (type,
1204 build_one_cst (TREE_TYPE (type)),
1205 fold_convert (TREE_TYPE (type), integer_zero_node));
1212 /* Build a BINFO with LEN language slots. */
1215 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1218 size_t length = (offsetof (struct tree_binfo, base_binfos)
1219 + VEC_embedded_size (tree, base_binfos));
1221 #ifdef GATHER_STATISTICS
1222 tree_node_counts[(int) binfo_kind]++;
1223 tree_node_sizes[(int) binfo_kind] += length;
1226 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1228 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1230 TREE_SET_CODE (t, TREE_BINFO);
1232 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1238 /* Build a newly constructed TREE_VEC node of length LEN. */
1241 make_tree_vec_stat (int len MEM_STAT_DECL)
1244 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1246 #ifdef GATHER_STATISTICS
1247 tree_node_counts[(int) vec_kind]++;
1248 tree_node_sizes[(int) vec_kind] += length;
1251 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1253 memset (t, 0, length);
1255 TREE_SET_CODE (t, TREE_VEC);
1256 TREE_VEC_LENGTH (t) = len;
1261 /* Return 1 if EXPR is the integer constant zero or a complex constant
1265 integer_zerop (tree expr)
1269 return ((TREE_CODE (expr) == INTEGER_CST
1270 && TREE_INT_CST_LOW (expr) == 0
1271 && TREE_INT_CST_HIGH (expr) == 0)
1272 || (TREE_CODE (expr) == COMPLEX_CST
1273 && integer_zerop (TREE_REALPART (expr))
1274 && integer_zerop (TREE_IMAGPART (expr))));
1277 /* Return 1 if EXPR is the integer constant one or the corresponding
1278 complex constant. */
1281 integer_onep (tree expr)
1285 return ((TREE_CODE (expr) == INTEGER_CST
1286 && TREE_INT_CST_LOW (expr) == 1
1287 && TREE_INT_CST_HIGH (expr) == 0)
1288 || (TREE_CODE (expr) == COMPLEX_CST
1289 && integer_onep (TREE_REALPART (expr))
1290 && integer_zerop (TREE_IMAGPART (expr))));
1293 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1294 it contains. Likewise for the corresponding complex constant. */
1297 integer_all_onesp (tree expr)
1304 if (TREE_CODE (expr) == COMPLEX_CST
1305 && integer_all_onesp (TREE_REALPART (expr))
1306 && integer_zerop (TREE_IMAGPART (expr)))
1309 else if (TREE_CODE (expr) != INTEGER_CST)
1312 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1313 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1314 && TREE_INT_CST_HIGH (expr) == -1)
1319 /* Note that using TYPE_PRECISION here is wrong. We care about the
1320 actual bits, not the (arbitrary) range of the type. */
1321 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1322 if (prec >= HOST_BITS_PER_WIDE_INT)
1324 HOST_WIDE_INT high_value;
1327 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1329 /* Can not handle precisions greater than twice the host int size. */
1330 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1331 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1332 /* Shifting by the host word size is undefined according to the ANSI
1333 standard, so we must handle this as a special case. */
1336 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1338 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1339 && TREE_INT_CST_HIGH (expr) == high_value);
1342 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1345 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1349 integer_pow2p (tree expr)
1352 HOST_WIDE_INT high, low;
1356 if (TREE_CODE (expr) == COMPLEX_CST
1357 && integer_pow2p (TREE_REALPART (expr))
1358 && integer_zerop (TREE_IMAGPART (expr)))
1361 if (TREE_CODE (expr) != INTEGER_CST)
1364 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1365 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1366 high = TREE_INT_CST_HIGH (expr);
1367 low = TREE_INT_CST_LOW (expr);
1369 /* First clear all bits that are beyond the type's precision in case
1370 we've been sign extended. */
1372 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1374 else if (prec > HOST_BITS_PER_WIDE_INT)
1375 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1379 if (prec < HOST_BITS_PER_WIDE_INT)
1380 low &= ~((HOST_WIDE_INT) (-1) << prec);
1383 if (high == 0 && low == 0)
1386 return ((high == 0 && (low & (low - 1)) == 0)
1387 || (low == 0 && (high & (high - 1)) == 0));
1390 /* Return 1 if EXPR is an integer constant other than zero or a
1391 complex constant other than zero. */
1394 integer_nonzerop (tree expr)
1398 return ((TREE_CODE (expr) == INTEGER_CST
1399 && (TREE_INT_CST_LOW (expr) != 0
1400 || TREE_INT_CST_HIGH (expr) != 0))
1401 || (TREE_CODE (expr) == COMPLEX_CST
1402 && (integer_nonzerop (TREE_REALPART (expr))
1403 || integer_nonzerop (TREE_IMAGPART (expr)))));
1406 /* Return the power of two represented by a tree node known to be a
1410 tree_log2 (tree expr)
1413 HOST_WIDE_INT high, low;
1417 if (TREE_CODE (expr) == COMPLEX_CST)
1418 return tree_log2 (TREE_REALPART (expr));
1420 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1421 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1423 high = TREE_INT_CST_HIGH (expr);
1424 low = TREE_INT_CST_LOW (expr);
1426 /* First clear all bits that are beyond the type's precision in case
1427 we've been sign extended. */
1429 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1431 else if (prec > HOST_BITS_PER_WIDE_INT)
1432 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1436 if (prec < HOST_BITS_PER_WIDE_INT)
1437 low &= ~((HOST_WIDE_INT) (-1) << prec);
1440 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1441 : exact_log2 (low));
1444 /* Similar, but return the largest integer Y such that 2 ** Y is less
1445 than or equal to EXPR. */
1448 tree_floor_log2 (tree expr)
1451 HOST_WIDE_INT high, low;
1455 if (TREE_CODE (expr) == COMPLEX_CST)
1456 return tree_log2 (TREE_REALPART (expr));
1458 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1459 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1461 high = TREE_INT_CST_HIGH (expr);
1462 low = TREE_INT_CST_LOW (expr);
1464 /* First clear all bits that are beyond the type's precision in case
1465 we've been sign extended. Ignore if type's precision hasn't been set
1466 since what we are doing is setting it. */
1468 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1470 else if (prec > HOST_BITS_PER_WIDE_INT)
1471 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1475 if (prec < HOST_BITS_PER_WIDE_INT)
1476 low &= ~((HOST_WIDE_INT) (-1) << prec);
1479 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1480 : floor_log2 (low));
1483 /* Return 1 if EXPR is the real constant zero. */
1486 real_zerop (tree expr)
1490 return ((TREE_CODE (expr) == REAL_CST
1491 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1492 || (TREE_CODE (expr) == COMPLEX_CST
1493 && real_zerop (TREE_REALPART (expr))
1494 && real_zerop (TREE_IMAGPART (expr))));
1497 /* Return 1 if EXPR is the real constant one in real or complex form. */
1500 real_onep (tree expr)
1504 return ((TREE_CODE (expr) == REAL_CST
1505 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1506 || (TREE_CODE (expr) == COMPLEX_CST
1507 && real_onep (TREE_REALPART (expr))
1508 && real_zerop (TREE_IMAGPART (expr))));
1511 /* Return 1 if EXPR is the real constant two. */
1514 real_twop (tree expr)
1518 return ((TREE_CODE (expr) == REAL_CST
1519 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1520 || (TREE_CODE (expr) == COMPLEX_CST
1521 && real_twop (TREE_REALPART (expr))
1522 && real_zerop (TREE_IMAGPART (expr))));
1525 /* Return 1 if EXPR is the real constant minus one. */
1528 real_minus_onep (tree expr)
1532 return ((TREE_CODE (expr) == REAL_CST
1533 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1534 || (TREE_CODE (expr) == COMPLEX_CST
1535 && real_minus_onep (TREE_REALPART (expr))
1536 && real_zerop (TREE_IMAGPART (expr))));
1539 /* Nonzero if EXP is a constant or a cast of a constant. */
1542 really_constant_p (tree exp)
1544 /* This is not quite the same as STRIP_NOPS. It does more. */
1545 while (TREE_CODE (exp) == NOP_EXPR
1546 || TREE_CODE (exp) == CONVERT_EXPR
1547 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1548 exp = TREE_OPERAND (exp, 0);
1549 return TREE_CONSTANT (exp);
1552 /* Return first list element whose TREE_VALUE is ELEM.
1553 Return 0 if ELEM is not in LIST. */
1556 value_member (tree elem, tree list)
1560 if (elem == TREE_VALUE (list))
1562 list = TREE_CHAIN (list);
1567 /* Return first list element whose TREE_PURPOSE is ELEM.
1568 Return 0 if ELEM is not in LIST. */
1571 purpose_member (tree elem, tree list)
1575 if (elem == TREE_PURPOSE (list))
1577 list = TREE_CHAIN (list);
1582 /* Return nonzero if ELEM is part of the chain CHAIN. */
1585 chain_member (tree elem, tree chain)
1591 chain = TREE_CHAIN (chain);
1597 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1598 We expect a null pointer to mark the end of the chain.
1599 This is the Lisp primitive `length'. */
1602 list_length (tree t)
1605 #ifdef ENABLE_TREE_CHECKING
1613 #ifdef ENABLE_TREE_CHECKING
1616 gcc_assert (p != q);
1624 /* Returns the number of FIELD_DECLs in TYPE. */
1627 fields_length (tree type)
1629 tree t = TYPE_FIELDS (type);
1632 for (; t; t = TREE_CHAIN (t))
1633 if (TREE_CODE (t) == FIELD_DECL)
1639 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1640 by modifying the last node in chain 1 to point to chain 2.
1641 This is the Lisp primitive `nconc'. */
1644 chainon (tree op1, tree op2)
1653 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1655 TREE_CHAIN (t1) = op2;
1657 #ifdef ENABLE_TREE_CHECKING
1660 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1661 gcc_assert (t2 != t1);
1668 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1671 tree_last (tree chain)
1675 while ((next = TREE_CHAIN (chain)))
1680 /* Reverse the order of elements in the chain T,
1681 and return the new head of the chain (old last element). */
1686 tree prev = 0, decl, next;
1687 for (decl = t; decl; decl = next)
1689 next = TREE_CHAIN (decl);
1690 TREE_CHAIN (decl) = prev;
1696 /* Return a newly created TREE_LIST node whose
1697 purpose and value fields are PARM and VALUE. */
1700 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1702 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1703 TREE_PURPOSE (t) = parm;
1704 TREE_VALUE (t) = value;
1708 /* Return a newly created TREE_LIST node whose
1709 purpose and value fields are PURPOSE and VALUE
1710 and whose TREE_CHAIN is CHAIN. */
1713 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1717 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1719 memset (node, 0, sizeof (struct tree_common));
1721 #ifdef GATHER_STATISTICS
1722 tree_node_counts[(int) x_kind]++;
1723 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1726 TREE_SET_CODE (node, TREE_LIST);
1727 TREE_CHAIN (node) = chain;
1728 TREE_PURPOSE (node) = purpose;
1729 TREE_VALUE (node) = value;
1734 /* Return the size nominally occupied by an object of type TYPE
1735 when it resides in memory. The value is measured in units of bytes,
1736 and its data type is that normally used for type sizes
1737 (which is the first type created by make_signed_type or
1738 make_unsigned_type). */
1741 size_in_bytes (tree type)
1745 if (type == error_mark_node)
1746 return integer_zero_node;
1748 type = TYPE_MAIN_VARIANT (type);
1749 t = TYPE_SIZE_UNIT (type);
1753 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1754 return size_zero_node;
1757 if (TREE_CODE (t) == INTEGER_CST)
1758 t = force_fit_type (t, 0, false, false);
1763 /* Return the size of TYPE (in bytes) as a wide integer
1764 or return -1 if the size can vary or is larger than an integer. */
1767 int_size_in_bytes (tree type)
1771 if (type == error_mark_node)
1774 type = TYPE_MAIN_VARIANT (type);
1775 t = TYPE_SIZE_UNIT (type);
1777 || TREE_CODE (t) != INTEGER_CST
1778 || TREE_INT_CST_HIGH (t) != 0
1779 /* If the result would appear negative, it's too big to represent. */
1780 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1783 return TREE_INT_CST_LOW (t);
1786 /* Return the maximum size of TYPE (in bytes) as a wide integer
1787 or return -1 if the size can vary or is larger than an integer. */
1790 max_int_size_in_bytes (tree type)
1792 HOST_WIDE_INT size = -1;
1795 /* If this is an array type, check for a possible MAX_SIZE attached. */
1797 if (TREE_CODE (type) == ARRAY_TYPE)
1799 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1801 if (size_tree && host_integerp (size_tree, 1))
1802 size = tree_low_cst (size_tree, 1);
1805 /* If we still haven't been able to get a size, see if the language
1806 can compute a maximum size. */
1810 size_tree = lang_hooks.types.max_size (type);
1812 if (size_tree && host_integerp (size_tree, 1))
1813 size = tree_low_cst (size_tree, 1);
1819 /* Return the bit position of FIELD, in bits from the start of the record.
1820 This is a tree of type bitsizetype. */
1823 bit_position (tree field)
1825 return bit_from_pos (DECL_FIELD_OFFSET (field),
1826 DECL_FIELD_BIT_OFFSET (field));
1829 /* Likewise, but return as an integer. It must be representable in
1830 that way (since it could be a signed value, we don't have the
1831 option of returning -1 like int_size_in_byte can. */
1834 int_bit_position (tree field)
1836 return tree_low_cst (bit_position (field), 0);
1839 /* Return the byte position of FIELD, in bytes from the start of the record.
1840 This is a tree of type sizetype. */
1843 byte_position (tree field)
1845 return byte_from_pos (DECL_FIELD_OFFSET (field),
1846 DECL_FIELD_BIT_OFFSET (field));
1849 /* Likewise, but return as an integer. It must be representable in
1850 that way (since it could be a signed value, we don't have the
1851 option of returning -1 like int_size_in_byte can. */
1854 int_byte_position (tree field)
1856 return tree_low_cst (byte_position (field), 0);
1859 /* Return the strictest alignment, in bits, that T is known to have. */
1864 unsigned int align0, align1;
1866 switch (TREE_CODE (t))
1868 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1869 /* If we have conversions, we know that the alignment of the
1870 object must meet each of the alignments of the types. */
1871 align0 = expr_align (TREE_OPERAND (t, 0));
1872 align1 = TYPE_ALIGN (TREE_TYPE (t));
1873 return MAX (align0, align1);
1875 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1876 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1877 case CLEANUP_POINT_EXPR:
1878 /* These don't change the alignment of an object. */
1879 return expr_align (TREE_OPERAND (t, 0));
1882 /* The best we can do is say that the alignment is the least aligned
1884 align0 = expr_align (TREE_OPERAND (t, 1));
1885 align1 = expr_align (TREE_OPERAND (t, 2));
1886 return MIN (align0, align1);
1888 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
1889 meaningfully, it's always 1. */
1890 case LABEL_DECL: case CONST_DECL:
1891 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1893 gcc_assert (DECL_ALIGN (t) != 0);
1894 return DECL_ALIGN (t);
1900 /* Otherwise take the alignment from that of the type. */
1901 return TYPE_ALIGN (TREE_TYPE (t));
1904 /* Return, as a tree node, the number of elements for TYPE (which is an
1905 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1908 array_type_nelts (tree type)
1910 tree index_type, min, max;
1912 /* If they did it with unspecified bounds, then we should have already
1913 given an error about it before we got here. */
1914 if (! TYPE_DOMAIN (type))
1915 return error_mark_node;
1917 index_type = TYPE_DOMAIN (type);
1918 min = TYPE_MIN_VALUE (index_type);
1919 max = TYPE_MAX_VALUE (index_type);
1921 return (integer_zerop (min)
1923 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1926 /* If arg is static -- a reference to an object in static storage -- then
1927 return the object. This is not the same as the C meaning of `static'.
1928 If arg isn't static, return NULL. */
1933 switch (TREE_CODE (arg))
1936 /* Nested functions are static, even though taking their address will
1937 involve a trampoline as we unnest the nested function and create
1938 the trampoline on the tree level. */
1942 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1943 && ! DECL_THREAD_LOCAL_P (arg)
1944 && ! DECL_DLLIMPORT_P (arg)
1948 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1952 return TREE_STATIC (arg) ? arg : NULL;
1959 /* If the thing being referenced is not a field, then it is
1960 something language specific. */
1961 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1962 return (*lang_hooks.staticp) (arg);
1964 /* If we are referencing a bitfield, we can't evaluate an
1965 ADDR_EXPR at compile time and so it isn't a constant. */
1966 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1969 return staticp (TREE_OPERAND (arg, 0));
1974 case MISALIGNED_INDIRECT_REF:
1975 case ALIGN_INDIRECT_REF:
1977 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
1980 case ARRAY_RANGE_REF:
1981 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1982 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1983 return staticp (TREE_OPERAND (arg, 0));
1988 if ((unsigned int) TREE_CODE (arg)
1989 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1990 return lang_hooks.staticp (arg);
1996 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1997 Do this to any expression which may be used in more than one place,
1998 but must be evaluated only once.
2000 Normally, expand_expr would reevaluate the expression each time.
2001 Calling save_expr produces something that is evaluated and recorded
2002 the first time expand_expr is called on it. Subsequent calls to
2003 expand_expr just reuse the recorded value.
2005 The call to expand_expr that generates code that actually computes
2006 the value is the first call *at compile time*. Subsequent calls
2007 *at compile time* generate code to use the saved value.
2008 This produces correct result provided that *at run time* control
2009 always flows through the insns made by the first expand_expr
2010 before reaching the other places where the save_expr was evaluated.
2011 You, the caller of save_expr, must make sure this is so.
2013 Constants, and certain read-only nodes, are returned with no
2014 SAVE_EXPR because that is safe. Expressions containing placeholders
2015 are not touched; see tree.def for an explanation of what these
2019 save_expr (tree expr)
2021 tree t = fold (expr);
2024 /* If the tree evaluates to a constant, then we don't want to hide that
2025 fact (i.e. this allows further folding, and direct checks for constants).
2026 However, a read-only object that has side effects cannot be bypassed.
2027 Since it is no problem to reevaluate literals, we just return the
2029 inner = skip_simple_arithmetic (t);
2031 if (TREE_INVARIANT (inner)
2032 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2033 || TREE_CODE (inner) == SAVE_EXPR
2034 || TREE_CODE (inner) == ERROR_MARK)
2037 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2038 it means that the size or offset of some field of an object depends on
2039 the value within another field.
2041 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2042 and some variable since it would then need to be both evaluated once and
2043 evaluated more than once. Front-ends must assure this case cannot
2044 happen by surrounding any such subexpressions in their own SAVE_EXPR
2045 and forcing evaluation at the proper time. */
2046 if (contains_placeholder_p (inner))
2049 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2051 /* This expression might be placed ahead of a jump to ensure that the
2052 value was computed on both sides of the jump. So make sure it isn't
2053 eliminated as dead. */
2054 TREE_SIDE_EFFECTS (t) = 1;
2055 TREE_INVARIANT (t) = 1;
2059 /* Look inside EXPR and into any simple arithmetic operations. Return
2060 the innermost non-arithmetic node. */
2063 skip_simple_arithmetic (tree expr)
2067 /* We don't care about whether this can be used as an lvalue in this
2069 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2070 expr = TREE_OPERAND (expr, 0);
2072 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2073 a constant, it will be more efficient to not make another SAVE_EXPR since
2074 it will allow better simplification and GCSE will be able to merge the
2075 computations if they actually occur. */
2079 if (UNARY_CLASS_P (inner))
2080 inner = TREE_OPERAND (inner, 0);
2081 else if (BINARY_CLASS_P (inner))
2083 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2084 inner = TREE_OPERAND (inner, 0);
2085 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2086 inner = TREE_OPERAND (inner, 1);
2097 /* Return which tree structure is used by T. */
2099 enum tree_node_structure_enum
2100 tree_node_structure (tree t)
2102 enum tree_code code = TREE_CODE (t);
2104 switch (TREE_CODE_CLASS (code))
2106 case tcc_declaration:
2111 return TS_FIELD_DECL;
2113 return TS_PARM_DECL;
2117 return TS_LABEL_DECL;
2119 return TS_RESULT_DECL;
2121 return TS_CONST_DECL;
2123 return TS_TYPE_DECL;
2125 return TS_FUNCTION_DECL;
2126 case SYMBOL_MEMORY_TAG:
2127 case NAME_MEMORY_TAG:
2128 case STRUCT_FIELD_TAG:
2129 return TS_MEMORY_TAG;
2131 return TS_DECL_NON_COMMON;
2137 case tcc_comparison:
2140 case tcc_expression:
2143 default: /* tcc_constant and tcc_exceptional */
2148 /* tcc_constant cases. */
2149 case INTEGER_CST: return TS_INT_CST;
2150 case REAL_CST: return TS_REAL_CST;
2151 case COMPLEX_CST: return TS_COMPLEX;
2152 case VECTOR_CST: return TS_VECTOR;
2153 case STRING_CST: return TS_STRING;
2154 /* tcc_exceptional cases. */
2155 case ERROR_MARK: return TS_COMMON;
2156 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2157 case TREE_LIST: return TS_LIST;
2158 case TREE_VEC: return TS_VEC;
2159 case PHI_NODE: return TS_PHI_NODE;
2160 case SSA_NAME: return TS_SSA_NAME;
2161 case PLACEHOLDER_EXPR: return TS_COMMON;
2162 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2163 case BLOCK: return TS_BLOCK;
2164 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2165 case TREE_BINFO: return TS_BINFO;
2166 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2167 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2174 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2175 or offset that depends on a field within a record. */
2178 contains_placeholder_p (tree exp)
2180 enum tree_code code;
2185 code = TREE_CODE (exp);
2186 if (code == PLACEHOLDER_EXPR)
2189 switch (TREE_CODE_CLASS (code))
2192 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2193 position computations since they will be converted into a
2194 WITH_RECORD_EXPR involving the reference, which will assume
2195 here will be valid. */
2196 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2198 case tcc_exceptional:
2199 if (code == TREE_LIST)
2200 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2201 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2206 case tcc_comparison:
2207 case tcc_expression:
2211 /* Ignoring the first operand isn't quite right, but works best. */
2212 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2215 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2216 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2217 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2220 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2226 switch (TREE_CODE_LENGTH (code))
2229 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2231 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2232 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2243 /* Return true if any part of the computation of TYPE involves a
2244 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2245 (for QUAL_UNION_TYPE) and field positions. */
2248 type_contains_placeholder_1 (tree type)
2250 /* If the size contains a placeholder or the parent type (component type in
2251 the case of arrays) type involves a placeholder, this type does. */
2252 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2253 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2254 || (TREE_TYPE (type) != 0
2255 && type_contains_placeholder_p (TREE_TYPE (type))))
2258 /* Now do type-specific checks. Note that the last part of the check above
2259 greatly limits what we have to do below. */
2260 switch (TREE_CODE (type))
2268 case REFERENCE_TYPE:
2276 /* Here we just check the bounds. */
2277 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2278 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2281 /* We're already checked the component type (TREE_TYPE), so just check
2283 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2287 case QUAL_UNION_TYPE:
2291 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2292 if (TREE_CODE (field) == FIELD_DECL
2293 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2294 || (TREE_CODE (type) == QUAL_UNION_TYPE
2295 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2296 || type_contains_placeholder_p (TREE_TYPE (field))))
2308 type_contains_placeholder_p (tree type)
2312 /* If the contains_placeholder_bits field has been initialized,
2313 then we know the answer. */
2314 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2315 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2317 /* Indicate that we've seen this type node, and the answer is false.
2318 This is what we want to return if we run into recursion via fields. */
2319 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2321 /* Compute the real value. */
2322 result = type_contains_placeholder_1 (type);
2324 /* Store the real value. */
2325 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2330 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2331 return a tree with all occurrences of references to F in a
2332 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2333 contains only arithmetic expressions or a CALL_EXPR with a
2334 PLACEHOLDER_EXPR occurring only in its arglist. */
2337 substitute_in_expr (tree exp, tree f, tree r)
2339 enum tree_code code = TREE_CODE (exp);
2340 tree op0, op1, op2, op3;
2344 /* We handle TREE_LIST and COMPONENT_REF separately. */
2345 if (code == TREE_LIST)
2347 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2348 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2349 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2352 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2354 else if (code == COMPONENT_REF)
2356 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2357 and it is the right field, replace it with R. */
2358 for (inner = TREE_OPERAND (exp, 0);
2359 REFERENCE_CLASS_P (inner);
2360 inner = TREE_OPERAND (inner, 0))
2362 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2363 && TREE_OPERAND (exp, 1) == f)
2366 /* If this expression hasn't been completed let, leave it alone. */
2367 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2370 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2371 if (op0 == TREE_OPERAND (exp, 0))
2374 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2375 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2378 switch (TREE_CODE_CLASS (code))
2381 case tcc_declaration:
2384 case tcc_exceptional:
2387 case tcc_comparison:
2388 case tcc_expression:
2390 switch (TREE_CODE_LENGTH (code))
2396 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2397 if (op0 == TREE_OPERAND (exp, 0))
2400 new = fold_build1 (code, TREE_TYPE (exp), op0);
2404 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2405 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2407 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2410 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2414 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2415 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2416 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2418 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2419 && op2 == TREE_OPERAND (exp, 2))
2422 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2426 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2427 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2428 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2429 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2431 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2432 && op2 == TREE_OPERAND (exp, 2)
2433 && op3 == TREE_OPERAND (exp, 3))
2436 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2448 TREE_READONLY (new) = TREE_READONLY (exp);
2452 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2453 for it within OBJ, a tree that is an object or a chain of references. */
2456 substitute_placeholder_in_expr (tree exp, tree obj)
2458 enum tree_code code = TREE_CODE (exp);
2459 tree op0, op1, op2, op3;
2461 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2462 in the chain of OBJ. */
2463 if (code == PLACEHOLDER_EXPR)
2465 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2468 for (elt = obj; elt != 0;
2469 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2470 || TREE_CODE (elt) == COND_EXPR)
2471 ? TREE_OPERAND (elt, 1)
2472 : (REFERENCE_CLASS_P (elt)
2473 || UNARY_CLASS_P (elt)
2474 || BINARY_CLASS_P (elt)
2475 || EXPRESSION_CLASS_P (elt))
2476 ? TREE_OPERAND (elt, 0) : 0))
2477 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2480 for (elt = obj; elt != 0;
2481 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2482 || TREE_CODE (elt) == COND_EXPR)
2483 ? TREE_OPERAND (elt, 1)
2484 : (REFERENCE_CLASS_P (elt)
2485 || UNARY_CLASS_P (elt)
2486 || BINARY_CLASS_P (elt)
2487 || EXPRESSION_CLASS_P (elt))
2488 ? TREE_OPERAND (elt, 0) : 0))
2489 if (POINTER_TYPE_P (TREE_TYPE (elt))
2490 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2492 return fold_build1 (INDIRECT_REF, need_type, elt);
2494 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2495 survives until RTL generation, there will be an error. */
2499 /* TREE_LIST is special because we need to look at TREE_VALUE
2500 and TREE_CHAIN, not TREE_OPERANDS. */
2501 else if (code == TREE_LIST)
2503 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2504 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2505 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2508 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2511 switch (TREE_CODE_CLASS (code))
2514 case tcc_declaration:
2517 case tcc_exceptional:
2520 case tcc_comparison:
2521 case tcc_expression:
2524 switch (TREE_CODE_LENGTH (code))
2530 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2531 if (op0 == TREE_OPERAND (exp, 0))
2534 return fold_build1 (code, TREE_TYPE (exp), op0);
2537 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2538 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2540 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2543 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2546 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2547 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2548 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2550 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2551 && op2 == TREE_OPERAND (exp, 2))
2554 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2557 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2558 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2559 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2560 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2562 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2563 && op2 == TREE_OPERAND (exp, 2)
2564 && op3 == TREE_OPERAND (exp, 3))
2567 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2579 /* Stabilize a reference so that we can use it any number of times
2580 without causing its operands to be evaluated more than once.
2581 Returns the stabilized reference. This works by means of save_expr,
2582 so see the caveats in the comments about save_expr.
2584 Also allows conversion expressions whose operands are references.
2585 Any other kind of expression is returned unchanged. */
2588 stabilize_reference (tree ref)
2591 enum tree_code code = TREE_CODE (ref);
2598 /* No action is needed in this case. */
2604 case FIX_TRUNC_EXPR:
2605 case FIX_FLOOR_EXPR:
2606 case FIX_ROUND_EXPR:
2608 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2612 result = build_nt (INDIRECT_REF,
2613 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2617 result = build_nt (COMPONENT_REF,
2618 stabilize_reference (TREE_OPERAND (ref, 0)),
2619 TREE_OPERAND (ref, 1), NULL_TREE);
2623 result = build_nt (BIT_FIELD_REF,
2624 stabilize_reference (TREE_OPERAND (ref, 0)),
2625 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2626 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2630 result = build_nt (ARRAY_REF,
2631 stabilize_reference (TREE_OPERAND (ref, 0)),
2632 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2633 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2636 case ARRAY_RANGE_REF:
2637 result = build_nt (ARRAY_RANGE_REF,
2638 stabilize_reference (TREE_OPERAND (ref, 0)),
2639 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2640 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2644 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2645 it wouldn't be ignored. This matters when dealing with
2647 return stabilize_reference_1 (ref);
2649 /* If arg isn't a kind of lvalue we recognize, make no change.
2650 Caller should recognize the error for an invalid lvalue. */
2655 return error_mark_node;
2658 TREE_TYPE (result) = TREE_TYPE (ref);
2659 TREE_READONLY (result) = TREE_READONLY (ref);
2660 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2661 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2666 /* Subroutine of stabilize_reference; this is called for subtrees of
2667 references. Any expression with side-effects must be put in a SAVE_EXPR
2668 to ensure that it is only evaluated once.
2670 We don't put SAVE_EXPR nodes around everything, because assigning very
2671 simple expressions to temporaries causes us to miss good opportunities
2672 for optimizations. Among other things, the opportunity to fold in the
2673 addition of a constant into an addressing mode often gets lost, e.g.
2674 "y[i+1] += x;". In general, we take the approach that we should not make
2675 an assignment unless we are forced into it - i.e., that any non-side effect
2676 operator should be allowed, and that cse should take care of coalescing
2677 multiple utterances of the same expression should that prove fruitful. */
2680 stabilize_reference_1 (tree e)
2683 enum tree_code code = TREE_CODE (e);
2685 /* We cannot ignore const expressions because it might be a reference
2686 to a const array but whose index contains side-effects. But we can
2687 ignore things that are actual constant or that already have been
2688 handled by this function. */
2690 if (TREE_INVARIANT (e))
2693 switch (TREE_CODE_CLASS (code))
2695 case tcc_exceptional:
2697 case tcc_declaration:
2698 case tcc_comparison:
2700 case tcc_expression:
2702 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2703 so that it will only be evaluated once. */
2704 /* The reference (r) and comparison (<) classes could be handled as
2705 below, but it is generally faster to only evaluate them once. */
2706 if (TREE_SIDE_EFFECTS (e))
2707 return save_expr (e);
2711 /* Constants need no processing. In fact, we should never reach
2716 /* Division is slow and tends to be compiled with jumps,
2717 especially the division by powers of 2 that is often
2718 found inside of an array reference. So do it just once. */
2719 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2720 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2721 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2722 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2723 return save_expr (e);
2724 /* Recursively stabilize each operand. */
2725 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2726 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2730 /* Recursively stabilize each operand. */
2731 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2738 TREE_TYPE (result) = TREE_TYPE (e);
2739 TREE_READONLY (result) = TREE_READONLY (e);
2740 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2741 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2742 TREE_INVARIANT (result) = 1;
2747 /* Low-level constructors for expressions. */
2749 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2750 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2753 recompute_tree_invariant_for_addr_expr (tree t)
2756 bool tc = true, ti = true, se = false;
2758 /* We started out assuming this address is both invariant and constant, but
2759 does not have side effects. Now go down any handled components and see if
2760 any of them involve offsets that are either non-constant or non-invariant.
2761 Also check for side-effects.
2763 ??? Note that this code makes no attempt to deal with the case where
2764 taking the address of something causes a copy due to misalignment. */
2766 #define UPDATE_TITCSE(NODE) \
2767 do { tree _node = (NODE); \
2768 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2769 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2770 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2772 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2773 node = TREE_OPERAND (node, 0))
2775 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2776 array reference (probably made temporarily by the G++ front end),
2777 so ignore all the operands. */
2778 if ((TREE_CODE (node) == ARRAY_REF
2779 || TREE_CODE (node) == ARRAY_RANGE_REF)
2780 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2782 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2783 if (TREE_OPERAND (node, 2))
2784 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2785 if (TREE_OPERAND (node, 3))
2786 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2788 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2789 FIELD_DECL, apparently. The G++ front end can put something else
2790 there, at least temporarily. */
2791 else if (TREE_CODE (node) == COMPONENT_REF
2792 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2794 if (TREE_OPERAND (node, 2))
2795 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2797 else if (TREE_CODE (node) == BIT_FIELD_REF)
2798 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2801 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2803 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2804 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2805 invariant and constant if the decl is static. It's also invariant if it's
2806 a decl in the current function. Taking the address of a volatile variable
2807 is not volatile. If it's a constant, the address is both invariant and
2808 constant. Otherwise it's neither. */
2809 if (TREE_CODE (node) == INDIRECT_REF)
2810 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2811 else if (DECL_P (node))
2815 else if (decl_function_context (node) == current_function_decl
2816 /* Addresses of thread-local variables are invariant. */
2817 || (TREE_CODE (node) == VAR_DECL
2818 && DECL_THREAD_LOCAL_P (node)))
2823 else if (CONSTANT_CLASS_P (node))
2828 se |= TREE_SIDE_EFFECTS (node);
2831 TREE_CONSTANT (t) = tc;
2832 TREE_INVARIANT (t) = ti;
2833 TREE_SIDE_EFFECTS (t) = se;
2834 #undef UPDATE_TITCSE
2837 /* Build an expression of code CODE, data type TYPE, and operands as
2838 specified. Expressions and reference nodes can be created this way.
2839 Constants, decls, types and misc nodes cannot be.
2841 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2842 enough for all extant tree codes. */
2845 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2849 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2851 t = make_node_stat (code PASS_MEM_STAT);
2858 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2860 int length = sizeof (struct tree_exp);
2861 #ifdef GATHER_STATISTICS
2862 tree_node_kind kind;
2866 #ifdef GATHER_STATISTICS
2867 switch (TREE_CODE_CLASS (code))
2869 case tcc_statement: /* an expression with side effects */
2872 case tcc_reference: /* a reference */
2880 tree_node_counts[(int) kind]++;
2881 tree_node_sizes[(int) kind] += length;
2884 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2886 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2888 memset (t, 0, sizeof (struct tree_common));
2890 TREE_SET_CODE (t, code);
2892 TREE_TYPE (t) = type;
2893 #ifdef USE_MAPPED_LOCATION
2894 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2896 SET_EXPR_LOCUS (t, NULL);
2898 TREE_COMPLEXITY (t) = 0;
2899 TREE_OPERAND (t, 0) = node;
2900 TREE_BLOCK (t) = NULL_TREE;
2901 if (node && !TYPE_P (node))
2903 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2904 TREE_READONLY (t) = TREE_READONLY (node);
2907 if (TREE_CODE_CLASS (code) == tcc_statement)
2908 TREE_SIDE_EFFECTS (t) = 1;
2912 /* All of these have side-effects, no matter what their
2914 TREE_SIDE_EFFECTS (t) = 1;
2915 TREE_READONLY (t) = 0;
2918 case MISALIGNED_INDIRECT_REF:
2919 case ALIGN_INDIRECT_REF:
2921 /* Whether a dereference is readonly has nothing to do with whether
2922 its operand is readonly. */
2923 TREE_READONLY (t) = 0;
2928 recompute_tree_invariant_for_addr_expr (t);
2932 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2933 && node && !TYPE_P (node)
2934 && TREE_CONSTANT (node))
2935 TREE_CONSTANT (t) = 1;
2936 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2937 && node && TREE_INVARIANT (node))
2938 TREE_INVARIANT (t) = 1;
2939 if (TREE_CODE_CLASS (code) == tcc_reference
2940 && node && TREE_THIS_VOLATILE (node))
2941 TREE_THIS_VOLATILE (t) = 1;
2948 #define PROCESS_ARG(N) \
2950 TREE_OPERAND (t, N) = arg##N; \
2951 if (arg##N &&!TYPE_P (arg##N)) \
2953 if (TREE_SIDE_EFFECTS (arg##N)) \
2955 if (!TREE_READONLY (arg##N)) \
2957 if (!TREE_CONSTANT (arg##N)) \
2959 if (!TREE_INVARIANT (arg##N)) \
2965 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2967 bool constant, read_only, side_effects, invariant;
2970 gcc_assert (TREE_CODE_LENGTH (code) == 2);
2972 t = make_node_stat (code PASS_MEM_STAT);
2975 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2976 result based on those same flags for the arguments. But if the
2977 arguments aren't really even `tree' expressions, we shouldn't be trying
2980 /* Expressions without side effects may be constant if their
2981 arguments are as well. */
2982 constant = (TREE_CODE_CLASS (code) == tcc_comparison
2983 || TREE_CODE_CLASS (code) == tcc_binary);
2985 side_effects = TREE_SIDE_EFFECTS (t);
2986 invariant = constant;
2991 TREE_READONLY (t) = read_only;
2992 TREE_CONSTANT (t) = constant;
2993 TREE_INVARIANT (t) = invariant;
2994 TREE_SIDE_EFFECTS (t) = side_effects;
2995 TREE_THIS_VOLATILE (t)
2996 = (TREE_CODE_CLASS (code) == tcc_reference
2997 && arg0 && TREE_THIS_VOLATILE (arg0));
3003 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3004 tree arg2 MEM_STAT_DECL)
3006 bool constant, read_only, side_effects, invariant;
3009 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3011 t = make_node_stat (code PASS_MEM_STAT);
3014 side_effects = TREE_SIDE_EFFECTS (t);
3020 if (code == CALL_EXPR && !side_effects)
3025 /* Calls have side-effects, except those to const or
3027 i = call_expr_flags (t);
3028 if (!(i & (ECF_CONST | ECF_PURE)))
3031 /* And even those have side-effects if their arguments do. */
3032 else for (node = arg1; node; node = TREE_CHAIN (node))
3033 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
3040 TREE_SIDE_EFFECTS (t) = side_effects;
3041 TREE_THIS_VOLATILE (t)
3042 = (TREE_CODE_CLASS (code) == tcc_reference
3043 && arg0 && TREE_THIS_VOLATILE (arg0));
3049 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3050 tree arg2, tree arg3 MEM_STAT_DECL)
3052 bool constant, read_only, side_effects, invariant;
3055 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3057 t = make_node_stat (code PASS_MEM_STAT);
3060 side_effects = TREE_SIDE_EFFECTS (t);
3067 TREE_SIDE_EFFECTS (t) = side_effects;
3068 TREE_THIS_VOLATILE (t)
3069 = (TREE_CODE_CLASS (code) == tcc_reference
3070 && arg0 && TREE_THIS_VOLATILE (arg0));
3076 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3077 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3079 bool constant, read_only, side_effects, invariant;
3082 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3084 t = make_node_stat (code PASS_MEM_STAT);
3087 side_effects = TREE_SIDE_EFFECTS (t);
3095 TREE_SIDE_EFFECTS (t) = side_effects;
3096 TREE_THIS_VOLATILE (t)
3097 = (TREE_CODE_CLASS (code) == tcc_reference
3098 && arg0 && TREE_THIS_VOLATILE (arg0));
3104 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3105 tree arg2, tree arg3, tree arg4, tree arg5,
3106 tree arg6 MEM_STAT_DECL)
3108 bool constant, read_only, side_effects, invariant;
3111 gcc_assert (code == TARGET_MEM_REF);
3113 t = make_node_stat (code PASS_MEM_STAT);
3116 side_effects = TREE_SIDE_EFFECTS (t);
3126 TREE_SIDE_EFFECTS (t) = side_effects;
3127 TREE_THIS_VOLATILE (t) = 0;
3132 /* Similar except don't specify the TREE_TYPE
3133 and leave the TREE_SIDE_EFFECTS as 0.
3134 It is permissible for arguments to be null,
3135 or even garbage if their values do not matter. */
3138 build_nt (enum tree_code code, ...)
3147 t = make_node (code);
3148 length = TREE_CODE_LENGTH (code);
3150 for (i = 0; i < length; i++)
3151 TREE_OPERAND (t, i) = va_arg (p, tree);
3157 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3158 We do NOT enter this node in any sort of symbol table.
3160 layout_decl is used to set up the decl's storage layout.
3161 Other slots are initialized to 0 or null pointers. */
3164 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3168 t = make_node_stat (code PASS_MEM_STAT);
3170 /* if (type == error_mark_node)
3171 type = integer_type_node; */
3172 /* That is not done, deliberately, so that having error_mark_node
3173 as the type can suppress useless errors in the use of this variable. */
3175 DECL_NAME (t) = name;
3176 TREE_TYPE (t) = type;
3178 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3184 /* Builds and returns function declaration with NAME and TYPE. */
3187 build_fn_decl (const char *name, tree type)
3189 tree id = get_identifier (name);
3190 tree decl = build_decl (FUNCTION_DECL, id, type);
3192 DECL_EXTERNAL (decl) = 1;
3193 TREE_PUBLIC (decl) = 1;
3194 DECL_ARTIFICIAL (decl) = 1;
3195 TREE_NOTHROW (decl) = 1;
3201 /* BLOCK nodes are used to represent the structure of binding contours
3202 and declarations, once those contours have been exited and their contents
3203 compiled. This information is used for outputting debugging info. */
3206 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3208 tree block = make_node (BLOCK);
3210 BLOCK_VARS (block) = vars;
3211 BLOCK_SUBBLOCKS (block) = subblocks;
3212 BLOCK_SUPERCONTEXT (block) = supercontext;
3213 BLOCK_CHAIN (block) = chain;
3217 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3218 /* ??? gengtype doesn't handle conditionals */
3219 static GTY(()) source_locus last_annotated_node;
3222 #ifdef USE_MAPPED_LOCATION
3225 expand_location (source_location loc)
3227 expanded_location xloc;
3228 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
3231 const struct line_map *map = linemap_lookup (&line_table, loc);
3232 xloc.file = map->to_file;
3233 xloc.line = SOURCE_LINE (map, loc);
3234 xloc.column = SOURCE_COLUMN (map, loc);
3241 /* Record the exact location where an expression or an identifier were
3245 annotate_with_file_line (tree node, const char *file, int line)
3247 /* Roughly one percent of the calls to this function are to annotate
3248 a node with the same information already attached to that node!
3249 Just return instead of wasting memory. */
3250 if (EXPR_LOCUS (node)
3251 && EXPR_LINENO (node) == line
3252 && (EXPR_FILENAME (node) == file
3253 || !strcmp (EXPR_FILENAME (node), file)))
3255 last_annotated_node = EXPR_LOCUS (node);
3259 /* In heavily macroized code (such as GCC itself) this single
3260 entry cache can reduce the number of allocations by more
3262 if (last_annotated_node
3263 && last_annotated_node->line == line
3264 && (last_annotated_node->file == file
3265 || !strcmp (last_annotated_node->file, file)))
3267 SET_EXPR_LOCUS (node, last_annotated_node);
3271 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3272 EXPR_LINENO (node) = line;
3273 EXPR_FILENAME (node) = file;
3274 last_annotated_node = EXPR_LOCUS (node);
3278 annotate_with_locus (tree node, location_t locus)
3280 annotate_with_file_line (node, locus.file, locus.line);
3284 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3288 build_decl_attribute_variant (tree ddecl, tree attribute)
3290 DECL_ATTRIBUTES (ddecl) = attribute;
3294 /* Borrowed from hashtab.c iterative_hash implementation. */
3295 #define mix(a,b,c) \
3297 a -= b; a -= c; a ^= (c>>13); \
3298 b -= c; b -= a; b ^= (a<< 8); \
3299 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3300 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3301 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3302 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3303 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3304 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3305 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3309 /* Produce good hash value combining VAL and VAL2. */
3310 static inline hashval_t
3311 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3313 /* the golden ratio; an arbitrary value. */
3314 hashval_t a = 0x9e3779b9;
3320 /* Produce good hash value combining PTR and VAL2. */
3321 static inline hashval_t
3322 iterative_hash_pointer (void *ptr, hashval_t val2)
3324 if (sizeof (ptr) == sizeof (hashval_t))
3325 return iterative_hash_hashval_t ((size_t) ptr, val2);
3328 hashval_t a = (hashval_t) (size_t) ptr;
3329 /* Avoid warnings about shifting of more than the width of the type on
3330 hosts that won't execute this path. */
3332 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3338 /* Produce good hash value combining VAL and VAL2. */
3339 static inline hashval_t
3340 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3342 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3343 return iterative_hash_hashval_t (val, val2);
3346 hashval_t a = (hashval_t) val;
3347 /* Avoid warnings about shifting of more than the width of the type on
3348 hosts that won't execute this path. */
3350 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3352 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3354 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3355 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3362 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3363 is ATTRIBUTE and its qualifiers are QUALS.
3365 Record such modified types already made so we don't make duplicates. */
3368 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3370 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3372 hashval_t hashcode = 0;
3374 enum tree_code code = TREE_CODE (ttype);
3376 ntype = copy_node (ttype);
3378 TYPE_POINTER_TO (ntype) = 0;
3379 TYPE_REFERENCE_TO (ntype) = 0;
3380 TYPE_ATTRIBUTES (ntype) = attribute;
3382 /* Create a new main variant of TYPE. */
3383 TYPE_MAIN_VARIANT (ntype) = ntype;
3384 TYPE_NEXT_VARIANT (ntype) = 0;
3385 set_type_quals (ntype, TYPE_UNQUALIFIED);
3387 hashcode = iterative_hash_object (code, hashcode);
3388 if (TREE_TYPE (ntype))
3389 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3391 hashcode = attribute_hash_list (attribute, hashcode);
3393 switch (TREE_CODE (ntype))
3396 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3399 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3403 hashcode = iterative_hash_object
3404 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3405 hashcode = iterative_hash_object
3406 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3410 unsigned int precision = TYPE_PRECISION (ntype);
3411 hashcode = iterative_hash_object (precision, hashcode);
3418 ntype = type_hash_canon (hashcode, ntype);
3419 ttype = build_qualified_type (ntype, quals);
3426 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3429 Record such modified types already made so we don't make duplicates. */
3432 build_type_attribute_variant (tree ttype, tree attribute)
3434 return build_type_attribute_qual_variant (ttype, attribute,
3435 TYPE_QUALS (ttype));
3438 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3441 We try both `text' and `__text__', ATTR may be either one. */
3442 /* ??? It might be a reasonable simplification to require ATTR to be only
3443 `text'. One might then also require attribute lists to be stored in
3444 their canonicalized form. */
3447 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3452 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3455 p = IDENTIFIER_POINTER (ident);
3456 ident_len = IDENTIFIER_LENGTH (ident);
3458 if (ident_len == attr_len
3459 && strcmp (attr, p) == 0)
3462 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3465 gcc_assert (attr[1] == '_');
3466 gcc_assert (attr[attr_len - 2] == '_');
3467 gcc_assert (attr[attr_len - 1] == '_');
3468 if (ident_len == attr_len - 4
3469 && strncmp (attr + 2, p, attr_len - 4) == 0)
3474 if (ident_len == attr_len + 4
3475 && p[0] == '_' && p[1] == '_'
3476 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3477 && strncmp (attr, p + 2, attr_len) == 0)
3484 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3487 We try both `text' and `__text__', ATTR may be either one. */
3490 is_attribute_p (const char *attr, tree ident)
3492 return is_attribute_with_length_p (attr, strlen (attr), ident);
3495 /* Given an attribute name and a list of attributes, return a pointer to the
3496 attribute's list element if the attribute is part of the list, or NULL_TREE
3497 if not found. If the attribute appears more than once, this only
3498 returns the first occurrence; the TREE_CHAIN of the return value should
3499 be passed back in if further occurrences are wanted. */
3502 lookup_attribute (const char *attr_name, tree list)
3505 size_t attr_len = strlen (attr_name);
3507 for (l = list; l; l = TREE_CHAIN (l))
3509 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3510 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3517 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3521 remove_attribute (const char *attr_name, tree list)
3524 size_t attr_len = strlen (attr_name);
3526 for (p = &list; *p; )
3529 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3530 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3531 *p = TREE_CHAIN (l);
3533 p = &TREE_CHAIN (l);
3539 /* Return an attribute list that is the union of a1 and a2. */
3542 merge_attributes (tree a1, tree a2)
3546 /* Either one unset? Take the set one. */
3548 if ((attributes = a1) == 0)
3551 /* One that completely contains the other? Take it. */
3553 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3555 if (attribute_list_contained (a2, a1))
3559 /* Pick the longest list, and hang on the other list. */
3561 if (list_length (a1) < list_length (a2))
3562 attributes = a2, a2 = a1;
3564 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3567 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3570 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3573 if (TREE_VALUE (a) != NULL
3574 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3575 && TREE_VALUE (a2) != NULL
3576 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3578 if (simple_cst_list_equal (TREE_VALUE (a),
3579 TREE_VALUE (a2)) == 1)
3582 else if (simple_cst_equal (TREE_VALUE (a),
3583 TREE_VALUE (a2)) == 1)
3588 a1 = copy_node (a2);
3589 TREE_CHAIN (a1) = attributes;
3598 /* Given types T1 and T2, merge their attributes and return
3602 merge_type_attributes (tree t1, tree t2)
3604 return merge_attributes (TYPE_ATTRIBUTES (t1),
3605 TYPE_ATTRIBUTES (t2));
3608 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3612 merge_decl_attributes (tree olddecl, tree newdecl)
3614 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3615 DECL_ATTRIBUTES (newdecl));
3618 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3620 /* Specialization of merge_decl_attributes for various Windows targets.
3622 This handles the following situation:
3624 __declspec (dllimport) int foo;
3627 The second instance of `foo' nullifies the dllimport. */
3630 merge_dllimport_decl_attributes (tree old, tree new)
3633 int delete_dllimport_p = 1;
3635 /* What we need to do here is remove from `old' dllimport if it doesn't
3636 appear in `new'. dllimport behaves like extern: if a declaration is
3637 marked dllimport and a definition appears later, then the object
3638 is not dllimport'd. We also remove a `new' dllimport if the old list
3639 contains dllexport: dllexport always overrides dllimport, regardless
3640 of the order of declaration. */
3641 if (!VAR_OR_FUNCTION_DECL_P (new))
3642 delete_dllimport_p = 0;
3643 else if (DECL_DLLIMPORT_P (new)
3644 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3646 DECL_DLLIMPORT_P (new) = 0;
3647 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3648 "dllimport ignored", new);
3650 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3652 /* Warn about overriding a symbol that has already been used. eg:
3653 extern int __attribute__ ((dllimport)) foo;
3654 int* bar () {return &foo;}
3657 if (TREE_USED (old))
3659 warning (0, "%q+D redeclared without dllimport attribute "
3660 "after being referenced with dll linkage", new);
3661 /* If we have used a variable's address with dllimport linkage,
3662 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3663 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3665 We still remove the attribute so that assembler code refers
3666 to '&foo rather than '_imp__foo'. */
3667 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3668 DECL_DLLIMPORT_P (new) = 1;
3671 /* Let an inline definition silently override the external reference,
3672 but otherwise warn about attribute inconsistency. */
3673 else if (TREE_CODE (new) == VAR_DECL
3674 || !DECL_DECLARED_INLINE_P (new))
3675 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3676 "previous dllimport ignored", new);
3679 delete_dllimport_p = 0;
3681 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3683 if (delete_dllimport_p)
3686 const size_t attr_len = strlen ("dllimport");
3688 /* Scan the list for dllimport and delete it. */
3689 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3691 if (is_attribute_with_length_p ("dllimport", attr_len,
3694 if (prev == NULL_TREE)
3697 TREE_CHAIN (prev) = TREE_CHAIN (t);
3706 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3707 struct attribute_spec.handler. */
3710 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3715 /* These attributes may apply to structure and union types being created,
3716 but otherwise should pass to the declaration involved. */
3719 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3720 | (int) ATTR_FLAG_ARRAY_NEXT))
3722 *no_add_attrs = true;
3723 return tree_cons (name, args, NULL_TREE);
3725 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3727 warning (OPT_Wattributes, "%qs attribute ignored",
3728 IDENTIFIER_POINTER (name));
3729 *no_add_attrs = true;
3735 if (TREE_CODE (node) != FUNCTION_DECL
3736 && TREE_CODE (node) != VAR_DECL)
3738 *no_add_attrs = true;
3739 warning (OPT_Wattributes, "%qs attribute ignored",
3740 IDENTIFIER_POINTER (name));
3744 /* Report error on dllimport ambiguities seen now before they cause
3746 else if (is_attribute_p ("dllimport", name))
3748 /* Honor any target-specific overrides. */
3749 if (!targetm.valid_dllimport_attribute_p (node))
3750 *no_add_attrs = true;
3752 else if (TREE_CODE (node) == FUNCTION_DECL
3753 && DECL_DECLARED_INLINE_P (node))
3755 warning (OPT_Wattributes, "inline function %q+D declared as "
3756 " dllimport: attribute ignored", node);
3757 *no_add_attrs = true;
3759 /* Like MS, treat definition of dllimported variables and
3760 non-inlined functions on declaration as syntax errors. */
3761 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
3763 error ("function %q+D definition is marked dllimport", node);
3764 *no_add_attrs = true;
3767 else if (TREE_CODE (node) == VAR_DECL)
3769 if (DECL_INITIAL (node))
3771 error ("variable %q+D definition is marked dllimport",
3773 *no_add_attrs = true;
3776 /* `extern' needn't be specified with dllimport.
3777 Specify `extern' now and hope for the best. Sigh. */
3778 DECL_EXTERNAL (node) = 1;
3779 /* Also, implicitly give dllimport'd variables declared within
3780 a function global scope, unless declared static. */
3781 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3782 TREE_PUBLIC (node) = 1;
3785 if (*no_add_attrs == false)
3786 DECL_DLLIMPORT_P (node) = 1;
3789 /* Report error if symbol is not accessible at global scope. */
3790 if (!TREE_PUBLIC (node)
3791 && (TREE_CODE (node) == VAR_DECL
3792 || TREE_CODE (node) == FUNCTION_DECL))
3794 error ("external linkage required for symbol %q+D because of "
3795 "%qs attribute", node, IDENTIFIER_POINTER (name));
3796 *no_add_attrs = true;
3802 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3804 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3805 of the various TYPE_QUAL values. */
3808 set_type_quals (tree type, int type_quals)
3810 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3811 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3812 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3815 /* Returns true iff cand is equivalent to base with type_quals. */
3818 check_qualified_type (tree cand, tree base, int type_quals)
3820 return (TYPE_QUALS (cand) == type_quals
3821 && TYPE_NAME (cand) == TYPE_NAME (base)
3822 /* Apparently this is needed for Objective-C. */
3823 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3824 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3825 TYPE_ATTRIBUTES (base)));
3828 /* Return a version of the TYPE, qualified as indicated by the
3829 TYPE_QUALS, if one exists. If no qualified version exists yet,
3830 return NULL_TREE. */
3833 get_qualified_type (tree type, int type_quals)
3837 if (TYPE_QUALS (type) == type_quals)
3840 /* Search the chain of variants to see if there is already one there just
3841 like the one we need to have. If so, use that existing one. We must
3842 preserve the TYPE_NAME, since there is code that depends on this. */
3843 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3844 if (check_qualified_type (t, type, type_quals))
3850 /* Like get_qualified_type, but creates the type if it does not
3851 exist. This function never returns NULL_TREE. */
3854 build_qualified_type (tree type, int type_quals)
3858 /* See if we already have the appropriate qualified variant. */
3859 t = get_qualified_type (type, type_quals);
3861 /* If not, build it. */
3864 t = build_variant_type_copy (type);
3865 set_type_quals (t, type_quals);
3871 /* Create a new distinct copy of TYPE. The new type is made its own
3875 build_distinct_type_copy (tree type)
3877 tree t = copy_node (type);
3879 TYPE_POINTER_TO (t) = 0;
3880 TYPE_REFERENCE_TO (t) = 0;
3882 /* Make it its own variant. */
3883 TYPE_MAIN_VARIANT (t) = t;
3884 TYPE_NEXT_VARIANT (t) = 0;
3886 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
3887 whose TREE_TYPE is not t. This can also happen in the Ada
3888 frontend when using subtypes. */
3893 /* Create a new variant of TYPE, equivalent but distinct.
3894 This is so the caller can modify it. */
3897 build_variant_type_copy (tree type)
3899 tree t, m = TYPE_MAIN_VARIANT (type);
3901 t = build_distinct_type_copy (type);
3903 /* Add the new type to the chain of variants of TYPE. */
3904 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3905 TYPE_NEXT_VARIANT (m) = t;
3906 TYPE_MAIN_VARIANT (t) = m;
3911 /* Return true if the from tree in both tree maps are equal. */
3914 tree_map_eq (const void *va, const void *vb)
3916 const struct tree_map *a = va, *b = vb;
3917 return (a->from == b->from);
3920 /* Hash a from tree in a tree_map. */
3923 tree_map_hash (const void *item)
3925 return (((const struct tree_map *) item)->hash);
3928 /* Return true if this tree map structure is marked for garbage collection
3929 purposes. We simply return true if the from tree is marked, so that this
3930 structure goes away when the from tree goes away. */
3933 tree_map_marked_p (const void *p)
3935 tree from = ((struct tree_map *) p)->from;
3937 return ggc_marked_p (from);
3940 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
3943 tree_int_map_eq (const void *va, const void *vb)
3945 const struct tree_int_map *a = va, *b = vb;
3946 return (a->from == b->from);
3949 /* Hash a from tree in the tree_int_map * ITEM. */
3952 tree_int_map_hash (const void *item)
3954 return htab_hash_pointer (((const struct tree_int_map *)item)->from);
3957 /* Return true if this tree int map structure is marked for garbage collection
3958 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
3959 structure goes away when the from tree goes away. */
3962 tree_int_map_marked_p (const void *p)
3964 tree from = ((struct tree_int_map *) p)->from;
3966 return ggc_marked_p (from);
3968 /* Lookup an init priority for FROM, and return it if we find one. */
3971 decl_init_priority_lookup (tree from)
3973 struct tree_int_map *h, in;
3976 h = htab_find_with_hash (init_priority_for_decl,
3977 &in, htab_hash_pointer (from));
3983 /* Insert a mapping FROM->TO in the init priority hashtable. */
3986 decl_init_priority_insert (tree from, unsigned short to)
3988 struct tree_int_map *h;
3991 h = ggc_alloc (sizeof (struct tree_int_map));
3994 loc = htab_find_slot_with_hash (init_priority_for_decl, h,
3995 htab_hash_pointer (from), INSERT);
3996 *(struct tree_int_map **) loc = h;
3999 /* Look up a restrict qualified base decl for FROM. */
4002 decl_restrict_base_lookup (tree from)
4008 h = htab_find_with_hash (restrict_base_for_decl, &in,
4009 htab_hash_pointer (from));
4010 return h ? h->to : NULL_TREE;
4013 /* Record the restrict qualified base TO for FROM. */
4016 decl_restrict_base_insert (tree from, tree to)
4021 h = ggc_alloc (sizeof (struct tree_map));
4022 h->hash = htab_hash_pointer (from);
4025 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4026 *(struct tree_map **) loc = h;
4029 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4032 print_debug_expr_statistics (void)
4034 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4035 (long) htab_size (debug_expr_for_decl),
4036 (long) htab_elements (debug_expr_for_decl),
4037 htab_collisions (debug_expr_for_decl));
4040 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4043 print_value_expr_statistics (void)
4045 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4046 (long) htab_size (value_expr_for_decl),
4047 (long) htab_elements (value_expr_for_decl),
4048 htab_collisions (value_expr_for_decl));
4051 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4052 don't print anything if the table is empty. */
4055 print_restrict_base_statistics (void)
4057 if (htab_elements (restrict_base_for_decl) != 0)
4059 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4060 (long) htab_size (restrict_base_for_decl),
4061 (long) htab_elements (restrict_base_for_decl),
4062 htab_collisions (restrict_base_for_decl));
4065 /* Lookup a debug expression for FROM, and return it if we find one. */
4068 decl_debug_expr_lookup (tree from)
4070 struct tree_map *h, in;
4073 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4079 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4082 decl_debug_expr_insert (tree from, tree to)
4087 h = ggc_alloc (sizeof (struct tree_map));
4088 h->hash = htab_hash_pointer (from);
4091 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4092 *(struct tree_map **) loc = h;
4095 /* Lookup a value expression for FROM, and return it if we find one. */
4098 decl_value_expr_lookup (tree from)
4100 struct tree_map *h, in;
4103 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4109 /* Insert a mapping FROM->TO in the value expression hashtable. */
4112 decl_value_expr_insert (tree from, tree to)
4117 h = ggc_alloc (sizeof (struct tree_map));
4118 h->hash = htab_hash_pointer (from);
4121 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4122 *(struct tree_map **) loc = h;
4125 /* Hashing of types so that we don't make duplicates.
4126 The entry point is `type_hash_canon'. */
4128 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4129 with types in the TREE_VALUE slots), by adding the hash codes
4130 of the individual types. */
4133 type_hash_list (tree list, hashval_t hashcode)
4137 for (tail = list; tail; tail = TREE_CHAIN (tail))
4138 if (TREE_VALUE (tail) != error_mark_node)
4139 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4145 /* These are the Hashtable callback functions. */
4147 /* Returns true iff the types are equivalent. */
4150 type_hash_eq (const void *va, const void *vb)
4152 const struct type_hash *a = va, *b = vb;
4154 /* First test the things that are the same for all types. */
4155 if (a->hash != b->hash
4156 || TREE_CODE (a->type) != TREE_CODE (b->type)
4157 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4158 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4159 TYPE_ATTRIBUTES (b->type))
4160 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4161 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4164 switch (TREE_CODE (a->type))
4169 case REFERENCE_TYPE:
4173 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4176 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4177 && !(TYPE_VALUES (a->type)
4178 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4179 && TYPE_VALUES (b->type)
4180 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4181 && type_list_equal (TYPE_VALUES (a->type),
4182 TYPE_VALUES (b->type))))
4185 /* ... fall through ... */
4190 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4191 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4192 TYPE_MAX_VALUE (b->type)))
4193 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4194 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4195 TYPE_MIN_VALUE (b->type))));
4198 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4201 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4202 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4203 || (TYPE_ARG_TYPES (a->type)
4204 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4205 && TYPE_ARG_TYPES (b->type)
4206 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4207 && type_list_equal (TYPE_ARG_TYPES (a->type),
4208 TYPE_ARG_TYPES (b->type)))));
4211 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4215 case QUAL_UNION_TYPE:
4216 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4217 || (TYPE_FIELDS (a->type)
4218 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4219 && TYPE_FIELDS (b->type)
4220 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4221 && type_list_equal (TYPE_FIELDS (a->type),
4222 TYPE_FIELDS (b->type))));
4225 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4226 || (TYPE_ARG_TYPES (a->type)
4227 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4228 && TYPE_ARG_TYPES (b->type)
4229 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4230 && type_list_equal (TYPE_ARG_TYPES (a->type),
4231 TYPE_ARG_TYPES (b->type))));
4238 /* Return the cached hash value. */
4241 type_hash_hash (const void *item)
4243 return ((const struct type_hash *) item)->hash;
4246 /* Look in the type hash table for a type isomorphic to TYPE.
4247 If one is found, return it. Otherwise return 0. */
4250 type_hash_lookup (hashval_t hashcode, tree type)
4252 struct type_hash *h, in;
4254 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4255 must call that routine before comparing TYPE_ALIGNs. */
4261 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4267 /* Add an entry to the type-hash-table
4268 for a type TYPE whose hash code is HASHCODE. */
4271 type_hash_add (hashval_t hashcode, tree type)
4273 struct type_hash *h;
4276 h = ggc_alloc (sizeof (struct type_hash));
4279 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4280 *(struct type_hash **) loc = h;
4283 /* Given TYPE, and HASHCODE its hash code, return the canonical
4284 object for an identical type if one already exists.
4285 Otherwise, return TYPE, and record it as the canonical object.
4287 To use this function, first create a type of the sort you want.
4288 Then compute its hash code from the fields of the type that
4289 make it different from other similar types.
4290 Then call this function and use the value. */
4293 type_hash_canon (unsigned int hashcode, tree type)
4297 /* The hash table only contains main variants, so ensure that's what we're
4299 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4301 if (!lang_hooks.types.hash_types)
4304 /* See if the type is in the hash table already. If so, return it.
4305 Otherwise, add the type. */
4306 t1 = type_hash_lookup (hashcode, type);
4309 #ifdef GATHER_STATISTICS
4310 tree_node_counts[(int) t_kind]--;
4311 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4317 type_hash_add (hashcode, type);
4322 /* See if the data pointed to by the type hash table is marked. We consider
4323 it marked if the type is marked or if a debug type number or symbol
4324 table entry has been made for the type. This reduces the amount of
4325 debugging output and eliminates that dependency of the debug output on
4326 the number of garbage collections. */
4329 type_hash_marked_p (const void *p)
4331 tree type = ((struct type_hash *) p)->type;
4333 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4337 print_type_hash_statistics (void)
4339 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4340 (long) htab_size (type_hash_table),
4341 (long) htab_elements (type_hash_table),
4342 htab_collisions (type_hash_table));
4345 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4346 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4347 by adding the hash codes of the individual attributes. */
4350 attribute_hash_list (tree list, hashval_t hashcode)
4354 for (tail = list; tail; tail = TREE_CHAIN (tail))
4355 /* ??? Do we want to add in TREE_VALUE too? */
4356 hashcode = iterative_hash_object
4357 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4361 /* Given two lists of attributes, return true if list l2 is
4362 equivalent to l1. */
4365 attribute_list_equal (tree l1, tree l2)
4367 return attribute_list_contained (l1, l2)
4368 && attribute_list_contained (l2, l1);
4371 /* Given two lists of attributes, return true if list L2 is
4372 completely contained within L1. */
4373 /* ??? This would be faster if attribute names were stored in a canonicalized
4374 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4375 must be used to show these elements are equivalent (which they are). */
4376 /* ??? It's not clear that attributes with arguments will always be handled
4380 attribute_list_contained (tree l1, tree l2)
4384 /* First check the obvious, maybe the lists are identical. */
4388 /* Maybe the lists are similar. */
4389 for (t1 = l1, t2 = l2;
4391 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4392 && TREE_VALUE (t1) == TREE_VALUE (t2);
4393 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4395 /* Maybe the lists are equal. */
4396 if (t1 == 0 && t2 == 0)
4399 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4402 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4404 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4407 if (TREE_VALUE (t2) != NULL
4408 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4409 && TREE_VALUE (attr) != NULL
4410 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4412 if (simple_cst_list_equal (TREE_VALUE (t2),
4413 TREE_VALUE (attr)) == 1)
4416 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4427 /* Given two lists of types
4428 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4429 return 1 if the lists contain the same types in the same order.
4430 Also, the TREE_PURPOSEs must match. */
4433 type_list_equal (tree l1, tree l2)
4437 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4438 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4439 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4440 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4441 && (TREE_TYPE (TREE_PURPOSE (t1))
4442 == TREE_TYPE (TREE_PURPOSE (t2))))))
4448 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4449 given by TYPE. If the argument list accepts variable arguments,
4450 then this function counts only the ordinary arguments. */
4453 type_num_arguments (tree type)
4458 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4459 /* If the function does not take a variable number of arguments,
4460 the last element in the list will have type `void'. */
4461 if (VOID_TYPE_P (TREE_VALUE (t)))
4469 /* Nonzero if integer constants T1 and T2
4470 represent the same constant value. */
4473 tree_int_cst_equal (tree t1, tree t2)
4478 if (t1 == 0 || t2 == 0)
4481 if (TREE_CODE (t1) == INTEGER_CST
4482 && TREE_CODE (t2) == INTEGER_CST
4483 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4484 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4490 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4491 The precise way of comparison depends on their data type. */
4494 tree_int_cst_lt (tree t1, tree t2)
4499 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4501 int t1_sgn = tree_int_cst_sgn (t1);
4502 int t2_sgn = tree_int_cst_sgn (t2);
4504 if (t1_sgn < t2_sgn)
4506 else if (t1_sgn > t2_sgn)
4508 /* Otherwise, both are non-negative, so we compare them as
4509 unsigned just in case one of them would overflow a signed
4512 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4513 return INT_CST_LT (t1, t2);
4515 return INT_CST_LT_UNSIGNED (t1, t2);
4518 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4521 tree_int_cst_compare (tree t1, tree t2)
4523 if (tree_int_cst_lt (t1, t2))
4525 else if (tree_int_cst_lt (t2, t1))
4531 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4532 the host. If POS is zero, the value can be represented in a single
4533 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4534 be represented in a single unsigned HOST_WIDE_INT. */
4537 host_integerp (tree t, int pos)
4539 return (TREE_CODE (t) == INTEGER_CST
4540 && ((TREE_INT_CST_HIGH (t) == 0
4541 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4542 || (! pos && TREE_INT_CST_HIGH (t) == -1
4543 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4544 && (!TYPE_UNSIGNED (TREE_TYPE (t))
4545 || TYPE_IS_SIZETYPE (TREE_TYPE (t))))
4546 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4549 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4550 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4551 be non-negative. We must be able to satisfy the above conditions. */
4554 tree_low_cst (tree t, int pos)
4556 gcc_assert (host_integerp (t, pos));
4557 return TREE_INT_CST_LOW (t);
4560 /* Return the most significant bit of the integer constant T. */
4563 tree_int_cst_msb (tree t)
4567 unsigned HOST_WIDE_INT l;
4569 /* Note that using TYPE_PRECISION here is wrong. We care about the
4570 actual bits, not the (arbitrary) range of the type. */
4571 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4572 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4573 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4574 return (l & 1) == 1;
4577 /* Return an indication of the sign of the integer constant T.
4578 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4579 Note that -1 will never be returned if T's type is unsigned. */
4582 tree_int_cst_sgn (tree t)
4584 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4586 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4588 else if (TREE_INT_CST_HIGH (t) < 0)
4594 /* Compare two constructor-element-type constants. Return 1 if the lists
4595 are known to be equal; otherwise return 0. */
4598 simple_cst_list_equal (tree l1, tree l2)
4600 while (l1 != NULL_TREE && l2 != NULL_TREE)
4602 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4605 l1 = TREE_CHAIN (l1);
4606 l2 = TREE_CHAIN (l2);
4612 /* Return truthvalue of whether T1 is the same tree structure as T2.
4613 Return 1 if they are the same.
4614 Return 0 if they are understandably different.
4615 Return -1 if either contains tree structure not understood by
4619 simple_cst_equal (tree t1, tree t2)
4621 enum tree_code code1, code2;
4627 if (t1 == 0 || t2 == 0)
4630 code1 = TREE_CODE (t1);
4631 code2 = TREE_CODE (t2);
4633 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4635 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4636 || code2 == NON_LVALUE_EXPR)
4637 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4639 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4642 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4643 || code2 == NON_LVALUE_EXPR)
4644 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4652 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4653 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4656 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4659 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4660 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4661 TREE_STRING_LENGTH (t1)));
4665 unsigned HOST_WIDE_INT idx;
4666 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4667 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4669 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4672 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4673 /* ??? Should we handle also fields here? */
4674 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4675 VEC_index (constructor_elt, v2, idx)->value))
4681 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4684 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4688 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4691 /* Special case: if either target is an unallocated VAR_DECL,
4692 it means that it's going to be unified with whatever the
4693 TARGET_EXPR is really supposed to initialize, so treat it
4694 as being equivalent to anything. */
4695 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4696 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4697 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
4698 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4699 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4700 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
4703 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4708 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4710 case WITH_CLEANUP_EXPR:
4711 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4715 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
4718 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4719 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4733 /* This general rule works for most tree codes. All exceptions should be
4734 handled above. If this is a language-specific tree code, we can't
4735 trust what might be in the operand, so say we don't know
4737 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4740 switch (TREE_CODE_CLASS (code1))
4744 case tcc_comparison:
4745 case tcc_expression:
4749 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
4751 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4763 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4764 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4765 than U, respectively. */
4768 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
4770 if (tree_int_cst_sgn (t) < 0)
4772 else if (TREE_INT_CST_HIGH (t) != 0)
4774 else if (TREE_INT_CST_LOW (t) == u)
4776 else if (TREE_INT_CST_LOW (t) < u)
4782 /* Return true if CODE represents an associative tree code. Otherwise
4785 associative_tree_code (enum tree_code code)
4804 /* Return true if CODE represents a commutative tree code. Otherwise
4807 commutative_tree_code (enum tree_code code)
4820 case UNORDERED_EXPR:
4824 case TRUTH_AND_EXPR:
4825 case TRUTH_XOR_EXPR:
4835 /* Generate a hash value for an expression. This can be used iteratively
4836 by passing a previous result as the "val" argument.
4838 This function is intended to produce the same hash for expressions which
4839 would compare equal using operand_equal_p. */
4842 iterative_hash_expr (tree t, hashval_t val)
4845 enum tree_code code;
4849 return iterative_hash_pointer (t, val);
4851 code = TREE_CODE (t);
4855 /* Alas, constants aren't shared, so we can't rely on pointer
4858 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
4859 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
4862 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
4864 return iterative_hash_hashval_t (val2, val);
4867 return iterative_hash (TREE_STRING_POINTER (t),
4868 TREE_STRING_LENGTH (t), val);
4870 val = iterative_hash_expr (TREE_REALPART (t), val);
4871 return iterative_hash_expr (TREE_IMAGPART (t), val);
4873 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
4877 /* we can just compare by pointer. */
4878 return iterative_hash_pointer (t, val);
4881 /* A list of expressions, for a CALL_EXPR or as the elements of a
4883 for (; t; t = TREE_CHAIN (t))
4884 val = iterative_hash_expr (TREE_VALUE (t), val);
4888 unsigned HOST_WIDE_INT idx;
4890 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
4892 val = iterative_hash_expr (field, val);
4893 val = iterative_hash_expr (value, val);
4898 /* When referring to a built-in FUNCTION_DECL, use the
4899 __builtin__ form. Otherwise nodes that compare equal
4900 according to operand_equal_p might get different
4902 if (DECL_BUILT_IN (t))
4904 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
4908 /* else FALL THROUGH */
4910 class = TREE_CODE_CLASS (code);
4912 if (class == tcc_declaration)
4914 /* DECL's have a unique ID */
4915 val = iterative_hash_host_wide_int (DECL_UID (t), val);
4919 gcc_assert (IS_EXPR_CODE_CLASS (class));
4921 val = iterative_hash_object (code, val);
4923 /* Don't hash the type, that can lead to having nodes which
4924 compare equal according to operand_equal_p, but which
4925 have different hash codes. */
4926 if (code == NOP_EXPR
4927 || code == CONVERT_EXPR
4928 || code == NON_LVALUE_EXPR)
4930 /* Make sure to include signness in the hash computation. */
4931 val += TYPE_UNSIGNED (TREE_TYPE (t));
4932 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
4935 else if (commutative_tree_code (code))
4937 /* It's a commutative expression. We want to hash it the same
4938 however it appears. We do this by first hashing both operands
4939 and then rehashing based on the order of their independent
4941 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
4942 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
4946 t = one, one = two, two = t;
4948 val = iterative_hash_hashval_t (one, val);
4949 val = iterative_hash_hashval_t (two, val);
4952 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i)
4953 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
4960 /* Constructors for pointer, array and function types.
4961 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4962 constructed by language-dependent code, not here.) */
4964 /* Construct, lay out and return the type of pointers to TO_TYPE with
4965 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4966 reference all of memory. If such a type has already been
4967 constructed, reuse it. */
4970 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
4975 if (to_type == error_mark_node)
4976 return error_mark_node;
4978 /* In some cases, languages will have things that aren't a POINTER_TYPE
4979 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4980 In that case, return that type without regard to the rest of our
4983 ??? This is a kludge, but consistent with the way this function has
4984 always operated and there doesn't seem to be a good way to avoid this
4986 if (TYPE_POINTER_TO (to_type) != 0
4987 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4988 return TYPE_POINTER_TO (to_type);
4990 /* First, if we already have a type for pointers to TO_TYPE and it's
4991 the proper mode, use it. */
4992 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4993 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4996 t = make_node (POINTER_TYPE);
4998 TREE_TYPE (t) = to_type;
4999 TYPE_MODE (t) = mode;
5000 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5001 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5002 TYPE_POINTER_TO (to_type) = t;
5004 /* Lay out the type. This function has many callers that are concerned
5005 with expression-construction, and this simplifies them all. */
5011 /* By default build pointers in ptr_mode. */
5014 build_pointer_type (tree to_type)
5016 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5019 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5022 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5027 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5028 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5029 In that case, return that type without regard to the rest of our
5032 ??? This is a kludge, but consistent with the way this function has
5033 always operated and there doesn't seem to be a good way to avoid this
5035 if (TYPE_REFERENCE_TO (to_type) != 0
5036 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5037 return TYPE_REFERENCE_TO (to_type);
5039 /* First, if we already have a type for pointers to TO_TYPE and it's
5040 the proper mode, use it. */
5041 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5042 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5045 t = make_node (REFERENCE_TYPE);
5047 TREE_TYPE (t) = to_type;
5048 TYPE_MODE (t) = mode;
5049 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5050 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5051 TYPE_REFERENCE_TO (to_type) = t;
5059 /* Build the node for the type of references-to-TO_TYPE by default
5063 build_reference_type (tree to_type)
5065 return build_reference_type_for_mode (to_type, ptr_mode, false);
5068 /* Build a type that is compatible with t but has no cv quals anywhere
5071 const char *const *const * -> char ***. */
5074 build_type_no_quals (tree t)
5076 switch (TREE_CODE (t))
5079 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5081 TYPE_REF_CAN_ALIAS_ALL (t));
5082 case REFERENCE_TYPE:
5084 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5086 TYPE_REF_CAN_ALIAS_ALL (t));
5088 return TYPE_MAIN_VARIANT (t);
5092 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5093 MAXVAL should be the maximum value in the domain
5094 (one less than the length of the array).
5096 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5097 We don't enforce this limit, that is up to caller (e.g. language front end).
5098 The limit exists because the result is a signed type and we don't handle
5099 sizes that use more than one HOST_WIDE_INT. */
5102 build_index_type (tree maxval)
5104 tree itype = make_node (INTEGER_TYPE);
5106 TREE_TYPE (itype) = sizetype;
5107 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5108 TYPE_MIN_VALUE (itype) = size_zero_node;
5109 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5110 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5111 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5112 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5113 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5114 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5116 if (host_integerp (maxval, 1))
5117 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5122 /* Builds a signed or unsigned integer type of precision PRECISION.
5123 Used for C bitfields whose precision does not match that of
5124 built-in target types. */
5126 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5129 tree itype = make_node (INTEGER_TYPE);
5131 TYPE_PRECISION (itype) = precision;
5134 fixup_unsigned_type (itype);
5136 fixup_signed_type (itype);
5138 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5139 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5144 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5145 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5146 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5149 build_range_type (tree type, tree lowval, tree highval)
5151 tree itype = make_node (INTEGER_TYPE);
5153 TREE_TYPE (itype) = type;
5154 if (type == NULL_TREE)
5157 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5158 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5160 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5161 TYPE_MODE (itype) = TYPE_MODE (type);
5162 TYPE_SIZE (itype) = TYPE_SIZE (type);
5163 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5164 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5165 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5167 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5168 return type_hash_canon (tree_low_cst (highval, 0)
5169 - tree_low_cst (lowval, 0),
5175 /* Just like build_index_type, but takes lowval and highval instead
5176 of just highval (maxval). */
5179 build_index_2_type (tree lowval, tree highval)
5181 return build_range_type (sizetype, lowval, highval);
5184 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5185 and number of elements specified by the range of values of INDEX_TYPE.
5186 If such a type has already been constructed, reuse it. */
5189 build_array_type (tree elt_type, tree index_type)
5192 hashval_t hashcode = 0;
5194 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5196 error ("arrays of functions are not meaningful");
5197 elt_type = integer_type_node;
5200 t = make_node (ARRAY_TYPE);
5201 TREE_TYPE (t) = elt_type;
5202 TYPE_DOMAIN (t) = index_type;
5204 if (index_type == 0)
5207 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5208 t = type_hash_canon (hashcode, t);
5214 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5215 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5216 t = type_hash_canon (hashcode, t);
5218 if (!COMPLETE_TYPE_P (t))
5223 /* Return the TYPE of the elements comprising
5224 the innermost dimension of ARRAY. */
5227 get_inner_array_type (tree array)
5229 tree type = TREE_TYPE (array);
5231 while (TREE_CODE (type) == ARRAY_TYPE)
5232 type = TREE_TYPE (type);
5237 /* Construct, lay out and return
5238 the type of functions returning type VALUE_TYPE
5239 given arguments of types ARG_TYPES.
5240 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5241 are data type nodes for the arguments of the function.
5242 If such a type has already been constructed, reuse it. */
5245 build_function_type (tree value_type, tree arg_types)
5248 hashval_t hashcode = 0;
5250 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5252 error ("function return type cannot be function");
5253 value_type = integer_type_node;
5256 /* Make a node of the sort we want. */
5257 t = make_node (FUNCTION_TYPE);
5258 TREE_TYPE (t) = value_type;
5259 TYPE_ARG_TYPES (t) = arg_types;
5261 /* If we already have such a type, use the old one. */
5262 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5263 hashcode = type_hash_list (arg_types, hashcode);
5264 t = type_hash_canon (hashcode, t);
5266 if (!COMPLETE_TYPE_P (t))
5271 /* Build a function type. The RETURN_TYPE is the type returned by the
5272 function. If additional arguments are provided, they are
5273 additional argument types. The list of argument types must always
5274 be terminated by NULL_TREE. */
5277 build_function_type_list (tree return_type, ...)
5282 va_start (p, return_type);
5284 t = va_arg (p, tree);
5285 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5286 args = tree_cons (NULL_TREE, t, args);
5288 if (args == NULL_TREE)
5289 args = void_list_node;
5293 args = nreverse (args);
5294 TREE_CHAIN (last) = void_list_node;
5296 args = build_function_type (return_type, args);
5302 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5303 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5304 for the method. An implicit additional parameter (of type
5305 pointer-to-BASETYPE) is added to the ARGTYPES. */
5308 build_method_type_directly (tree basetype,
5316 /* Make a node of the sort we want. */
5317 t = make_node (METHOD_TYPE);
5319 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5320 TREE_TYPE (t) = rettype;
5321 ptype = build_pointer_type (basetype);
5323 /* The actual arglist for this function includes a "hidden" argument
5324 which is "this". Put it into the list of argument types. */
5325 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5326 TYPE_ARG_TYPES (t) = argtypes;
5328 /* If we already have such a type, use the old one. */
5329 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5330 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5331 hashcode = type_hash_list (argtypes, hashcode);
5332 t = type_hash_canon (hashcode, t);
5334 if (!COMPLETE_TYPE_P (t))
5340 /* Construct, lay out and return the type of methods belonging to class
5341 BASETYPE and whose arguments and values are described by TYPE.
5342 If that type exists already, reuse it.
5343 TYPE must be a FUNCTION_TYPE node. */
5346 build_method_type (tree basetype, tree type)
5348 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5350 return build_method_type_directly (basetype,
5352 TYPE_ARG_TYPES (type));
5355 /* Construct, lay out and return the type of offsets to a value
5356 of type TYPE, within an object of type BASETYPE.
5357 If a suitable offset type exists already, reuse it. */
5360 build_offset_type (tree basetype, tree type)
5363 hashval_t hashcode = 0;
5365 /* Make a node of the sort we want. */
5366 t = make_node (OFFSET_TYPE);
5368 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5369 TREE_TYPE (t) = type;
5371 /* If we already have such a type, use the old one. */
5372 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5373 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5374 t = type_hash_canon (hashcode, t);
5376 if (!COMPLETE_TYPE_P (t))
5382 /* Create a complex type whose components are COMPONENT_TYPE. */
5385 build_complex_type (tree component_type)
5390 /* Make a node of the sort we want. */
5391 t = make_node (COMPLEX_TYPE);
5393 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5395 /* If we already have such a type, use the old one. */
5396 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5397 t = type_hash_canon (hashcode, t);
5399 if (!COMPLETE_TYPE_P (t))
5402 /* If we are writing Dwarf2 output we need to create a name,
5403 since complex is a fundamental type. */
5404 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5408 if (component_type == char_type_node)
5409 name = "complex char";
5410 else if (component_type == signed_char_type_node)
5411 name = "complex signed char";
5412 else if (component_type == unsigned_char_type_node)
5413 name = "complex unsigned char";
5414 else if (component_type == short_integer_type_node)
5415 name = "complex short int";
5416 else if (component_type == short_unsigned_type_node)
5417 name = "complex short unsigned int";
5418 else if (component_type == integer_type_node)
5419 name = "complex int";
5420 else if (component_type == unsigned_type_node)
5421 name = "complex unsigned int";
5422 else if (component_type == long_integer_type_node)
5423 name = "complex long int";
5424 else if (component_type == long_unsigned_type_node)
5425 name = "complex long unsigned int";
5426 else if (component_type == long_long_integer_type_node)
5427 name = "complex long long int";
5428 else if (component_type == long_long_unsigned_type_node)
5429 name = "complex long long unsigned int";
5434 TYPE_NAME (t) = get_identifier (name);
5437 return build_qualified_type (t, TYPE_QUALS (component_type));
5440 /* Return OP, stripped of any conversions to wider types as much as is safe.
5441 Converting the value back to OP's type makes a value equivalent to OP.
5443 If FOR_TYPE is nonzero, we return a value which, if converted to
5444 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5446 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5447 narrowest type that can hold the value, even if they don't exactly fit.
5448 Otherwise, bit-field references are changed to a narrower type
5449 only if they can be fetched directly from memory in that type.
5451 OP must have integer, real or enumeral type. Pointers are not allowed!
5453 There are some cases where the obvious value we could return
5454 would regenerate to OP if converted to OP's type,
5455 but would not extend like OP to wider types.
5456 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5457 For example, if OP is (unsigned short)(signed char)-1,
5458 we avoid returning (signed char)-1 if FOR_TYPE is int,
5459 even though extending that to an unsigned short would regenerate OP,
5460 since the result of extending (signed char)-1 to (int)
5461 is different from (int) OP. */
5464 get_unwidened (tree op, tree for_type)
5466 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5467 tree type = TREE_TYPE (op);
5469 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5471 = (for_type != 0 && for_type != type
5472 && final_prec > TYPE_PRECISION (type)
5473 && TYPE_UNSIGNED (type));
5476 while (TREE_CODE (op) == NOP_EXPR
5477 || TREE_CODE (op) == CONVERT_EXPR)
5481 /* TYPE_PRECISION on vector types has different meaning
5482 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5483 so avoid them here. */
5484 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5487 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5488 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5490 /* Truncations are many-one so cannot be removed.
5491 Unless we are later going to truncate down even farther. */
5493 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5496 /* See what's inside this conversion. If we decide to strip it,
5498 op = TREE_OPERAND (op, 0);
5500 /* If we have not stripped any zero-extensions (uns is 0),
5501 we can strip any kind of extension.
5502 If we have previously stripped a zero-extension,
5503 only zero-extensions can safely be stripped.
5504 Any extension can be stripped if the bits it would produce
5505 are all going to be discarded later by truncating to FOR_TYPE. */
5509 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5511 /* TYPE_UNSIGNED says whether this is a zero-extension.
5512 Let's avoid computing it if it does not affect WIN
5513 and if UNS will not be needed again. */
5515 || TREE_CODE (op) == NOP_EXPR
5516 || TREE_CODE (op) == CONVERT_EXPR)
5517 && TYPE_UNSIGNED (TREE_TYPE (op)))
5525 if (TREE_CODE (op) == COMPONENT_REF
5526 /* Since type_for_size always gives an integer type. */
5527 && TREE_CODE (type) != REAL_TYPE
5528 /* Don't crash if field not laid out yet. */
5529 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5530 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5532 unsigned int innerprec
5533 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5534 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5535 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5536 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5538 /* We can get this structure field in the narrowest type it fits in.
5539 If FOR_TYPE is 0, do this only for a field that matches the
5540 narrower type exactly and is aligned for it
5541 The resulting extension to its nominal type (a fullword type)
5542 must fit the same conditions as for other extensions. */
5545 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5546 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5547 && (! uns || final_prec <= innerprec || unsignedp))
5549 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5550 TREE_OPERAND (op, 1), NULL_TREE);
5551 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5552 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5559 /* Return OP or a simpler expression for a narrower value
5560 which can be sign-extended or zero-extended to give back OP.
5561 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5562 or 0 if the value should be sign-extended. */
5565 get_narrower (tree op, int *unsignedp_ptr)
5570 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5572 while (TREE_CODE (op) == NOP_EXPR)
5575 = (TYPE_PRECISION (TREE_TYPE (op))
5576 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5578 /* Truncations are many-one so cannot be removed. */
5582 /* See what's inside this conversion. If we decide to strip it,
5587 op = TREE_OPERAND (op, 0);
5588 /* An extension: the outermost one can be stripped,
5589 but remember whether it is zero or sign extension. */
5591 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5592 /* Otherwise, if a sign extension has been stripped,
5593 only sign extensions can now be stripped;
5594 if a zero extension has been stripped, only zero-extensions. */
5595 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5599 else /* bitschange == 0 */
5601 /* A change in nominal type can always be stripped, but we must
5602 preserve the unsignedness. */
5604 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5606 op = TREE_OPERAND (op, 0);
5607 /* Keep trying to narrow, but don't assign op to win if it
5608 would turn an integral type into something else. */
5609 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
5616 if (TREE_CODE (op) == COMPONENT_REF
5617 /* Since type_for_size always gives an integer type. */
5618 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
5619 /* Ensure field is laid out already. */
5620 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5621 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5623 unsigned HOST_WIDE_INT innerprec
5624 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5625 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5626 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5627 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5629 /* We can get this structure field in a narrower type that fits it,
5630 but the resulting extension to its nominal type (a fullword type)
5631 must satisfy the same conditions as for other extensions.
5633 Do this only for fields that are aligned (not bit-fields),
5634 because when bit-field insns will be used there is no
5635 advantage in doing this. */
5637 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5638 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5639 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
5643 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
5644 win = fold_convert (type, op);
5648 *unsignedp_ptr = uns;
5652 /* Nonzero if integer constant C has a value that is permissible
5653 for type TYPE (an INTEGER_TYPE). */
5656 int_fits_type_p (tree c, tree type)
5658 tree type_low_bound = TYPE_MIN_VALUE (type);
5659 tree type_high_bound = TYPE_MAX_VALUE (type);
5660 bool ok_for_low_bound, ok_for_high_bound;
5663 /* If at least one bound of the type is a constant integer, we can check
5664 ourselves and maybe make a decision. If no such decision is possible, but
5665 this type is a subtype, try checking against that. Otherwise, use
5666 force_fit_type, which checks against the precision.
5668 Compute the status for each possibly constant bound, and return if we see
5669 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5670 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5671 for "constant known to fit". */
5673 /* Check if C >= type_low_bound. */
5674 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
5676 if (tree_int_cst_lt (c, type_low_bound))
5678 ok_for_low_bound = true;
5681 ok_for_low_bound = false;
5683 /* Check if c <= type_high_bound. */
5684 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
5686 if (tree_int_cst_lt (type_high_bound, c))
5688 ok_for_high_bound = true;
5691 ok_for_high_bound = false;
5693 /* If the constant fits both bounds, the result is known. */
5694 if (ok_for_low_bound && ok_for_high_bound)
5697 /* Perform some generic filtering which may allow making a decision
5698 even if the bounds are not constant. First, negative integers
5699 never fit in unsigned types, */
5700 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
5703 /* Second, narrower types always fit in wider ones. */
5704 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
5707 /* Third, unsigned integers with top bit set never fit signed types. */
5708 if (! TYPE_UNSIGNED (type)
5709 && TYPE_UNSIGNED (TREE_TYPE (c))
5710 && tree_int_cst_msb (c))
5713 /* If we haven't been able to decide at this point, there nothing more we
5714 can check ourselves here. Look at the base type if we have one and it
5715 has the same precision. */
5716 if (TREE_CODE (type) == INTEGER_TYPE
5717 && TREE_TYPE (type) != 0
5718 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
5719 return int_fits_type_p (c, TREE_TYPE (type));
5721 /* Or to force_fit_type, if nothing else. */
5722 tmp = copy_node (c);
5723 TREE_TYPE (tmp) = type;
5724 tmp = force_fit_type (tmp, -1, false, false);
5725 return TREE_INT_CST_HIGH (tmp) == TREE_INT_CST_HIGH (c)
5726 && TREE_INT_CST_LOW (tmp) == TREE_INT_CST_LOW (c);
5729 /* Subprogram of following function. Called by walk_tree.
5731 Return *TP if it is an automatic variable or parameter of the
5732 function passed in as DATA. */
5735 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
5737 tree fn = (tree) data;
5742 else if (DECL_P (*tp)
5743 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
5749 /* Returns true if T is, contains, or refers to a type with variable
5750 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
5751 arguments, but not the return type. If FN is nonzero, only return
5752 true if a modifier of the type or position of FN is a variable or
5753 parameter inside FN.
5755 This concept is more general than that of C99 'variably modified types':
5756 in C99, a struct type is never variably modified because a VLA may not
5757 appear as a structure member. However, in GNU C code like:
5759 struct S { int i[f()]; };
5761 is valid, and other languages may define similar constructs. */
5764 variably_modified_type_p (tree type, tree fn)
5768 /* Test if T is either variable (if FN is zero) or an expression containing
5769 a variable in FN. */
5770 #define RETURN_TRUE_IF_VAR(T) \
5771 do { tree _t = (T); \
5772 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5773 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5774 return true; } while (0)
5776 if (type == error_mark_node)
5779 /* If TYPE itself has variable size, it is variably modified. */
5780 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
5781 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
5783 switch (TREE_CODE (type))
5786 case REFERENCE_TYPE:
5788 if (variably_modified_type_p (TREE_TYPE (type), fn))
5794 /* If TYPE is a function type, it is variably modified if the
5795 return type is variably modified. */
5796 if (variably_modified_type_p (TREE_TYPE (type), fn))
5804 /* Scalar types are variably modified if their end points
5806 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
5807 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
5812 case QUAL_UNION_TYPE:
5813 /* We can't see if any of the fields are variably-modified by the
5814 definition we normally use, since that would produce infinite
5815 recursion via pointers. */
5816 /* This is variably modified if some field's type is. */
5817 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
5818 if (TREE_CODE (t) == FIELD_DECL)
5820 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
5821 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
5822 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
5824 if (TREE_CODE (type) == QUAL_UNION_TYPE)
5825 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
5830 /* Do not call ourselves to avoid infinite recursion. This is
5831 variably modified if the element type is. */
5832 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
5833 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
5840 /* The current language may have other cases to check, but in general,
5841 all other types are not variably modified. */
5842 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
5844 #undef RETURN_TRUE_IF_VAR
5847 /* Given a DECL or TYPE, return the scope in which it was declared, or
5848 NULL_TREE if there is no containing scope. */
5851 get_containing_scope (tree t)
5853 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
5856 /* Return the innermost context enclosing DECL that is
5857 a FUNCTION_DECL, or zero if none. */
5860 decl_function_context (tree decl)
5864 if (TREE_CODE (decl) == ERROR_MARK)
5867 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5868 where we look up the function at runtime. Such functions always take
5869 a first argument of type 'pointer to real context'.
5871 C++ should really be fixed to use DECL_CONTEXT for the real context,
5872 and use something else for the "virtual context". */
5873 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
5876 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
5878 context = DECL_CONTEXT (decl);
5880 while (context && TREE_CODE (context) != FUNCTION_DECL)
5882 if (TREE_CODE (context) == BLOCK)
5883 context = BLOCK_SUPERCONTEXT (context);
5885 context = get_containing_scope (context);
5891 /* Return the innermost context enclosing DECL that is
5892 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5893 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5896 decl_type_context (tree decl)
5898 tree context = DECL_CONTEXT (decl);
5901 switch (TREE_CODE (context))
5903 case NAMESPACE_DECL:
5904 case TRANSLATION_UNIT_DECL:
5909 case QUAL_UNION_TYPE:
5914 context = DECL_CONTEXT (context);
5918 context = BLOCK_SUPERCONTEXT (context);
5928 /* CALL is a CALL_EXPR. Return the declaration for the function
5929 called, or NULL_TREE if the called function cannot be
5933 get_callee_fndecl (tree call)
5937 if (call == error_mark_node)
5940 /* It's invalid to call this function with anything but a
5942 gcc_assert (TREE_CODE (call) == CALL_EXPR);
5944 /* The first operand to the CALL is the address of the function
5946 addr = TREE_OPERAND (call, 0);
5950 /* If this is a readonly function pointer, extract its initial value. */
5951 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5952 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5953 && DECL_INITIAL (addr))
5954 addr = DECL_INITIAL (addr);
5956 /* If the address is just `&f' for some function `f', then we know
5957 that `f' is being called. */
5958 if (TREE_CODE (addr) == ADDR_EXPR
5959 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5960 return TREE_OPERAND (addr, 0);
5962 /* We couldn't figure out what was being called. Maybe the front
5963 end has some idea. */
5964 return lang_hooks.lang_get_callee_fndecl (call);
5967 /* Print debugging information about tree nodes generated during the compile,
5968 and any language-specific information. */
5971 dump_tree_statistics (void)
5973 #ifdef GATHER_STATISTICS
5975 int total_nodes, total_bytes;
5978 fprintf (stderr, "\n??? tree nodes created\n\n");
5979 #ifdef GATHER_STATISTICS
5980 fprintf (stderr, "Kind Nodes Bytes\n");
5981 fprintf (stderr, "---------------------------------------\n");
5982 total_nodes = total_bytes = 0;
5983 for (i = 0; i < (int) all_kinds; i++)
5985 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
5986 tree_node_counts[i], tree_node_sizes[i]);
5987 total_nodes += tree_node_counts[i];
5988 total_bytes += tree_node_sizes[i];
5990 fprintf (stderr, "---------------------------------------\n");
5991 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
5992 fprintf (stderr, "---------------------------------------\n");
5993 ssanames_print_statistics ();
5994 phinodes_print_statistics ();
5996 fprintf (stderr, "(No per-node statistics)\n");
5998 print_type_hash_statistics ();
5999 print_debug_expr_statistics ();
6000 print_value_expr_statistics ();
6001 print_restrict_base_statistics ();
6002 lang_hooks.print_statistics ();
6005 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6007 /* Generate a crc32 of a string. */
6010 crc32_string (unsigned chksum, const char *string)
6014 unsigned value = *string << 24;
6017 for (ix = 8; ix--; value <<= 1)
6021 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6030 /* P is a string that will be used in a symbol. Mask out any characters
6031 that are not valid in that context. */
6034 clean_symbol_name (char *p)
6038 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6041 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6048 /* Generate a name for a function unique to this translation unit.
6049 TYPE is some string to identify the purpose of this function to the
6050 linker or collect2. */
6053 get_file_function_name_long (const char *type)
6059 if (first_global_object_name)
6061 p = first_global_object_name;
6063 /* For type 'F', the generated name must be unique not only to this
6064 translation unit but also to any given link. Since global names
6065 can be overloaded, we concatenate the first global object name
6066 with a string derived from the file name of this object. */
6067 if (!strcmp (type, "F"))
6069 const char *file = main_input_filename;
6072 file = input_filename;
6074 q = alloca (strlen (p) + 10);
6075 sprintf (q, "%s_%08X", p, crc32_string (0, file));
6082 /* We don't have anything that we know to be unique to this translation
6083 unit, so use what we do have and throw in some randomness. */
6085 const char *name = weak_global_object_name;
6086 const char *file = main_input_filename;
6091 file = input_filename;
6093 len = strlen (file);
6094 q = alloca (9 * 2 + len + 1);
6095 memcpy (q, file, len + 1);
6096 clean_symbol_name (q);
6098 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6099 crc32_string (0, flag_random_seed));
6104 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6106 /* Set up the name of the file-level functions we may need.
6107 Use a global object (which is already required to be unique over
6108 the program) rather than the file name (which imposes extra
6110 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6112 return get_identifier (buf);
6115 /* If KIND=='I', return a suitable global initializer (constructor) name.
6116 If KIND=='D', return a suitable global clean-up (destructor) name. */
6119 get_file_function_name (int kind)
6126 return get_file_function_name_long (p);
6129 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6131 /* Complain that the tree code of NODE does not match the expected 0
6132 terminated list of trailing codes. The trailing code list can be
6133 empty, for a more vague error message. FILE, LINE, and FUNCTION
6134 are of the caller. */
6137 tree_check_failed (const tree node, const char *file,
6138 int line, const char *function, ...)
6142 unsigned length = 0;
6145 va_start (args, function);
6146 while ((code = va_arg (args, int)))
6147 length += 4 + strlen (tree_code_name[code]);
6151 va_start (args, function);
6152 length += strlen ("expected ");
6153 buffer = alloca (length);
6155 while ((code = va_arg (args, int)))
6157 const char *prefix = length ? " or " : "expected ";
6159 strcpy (buffer + length, prefix);
6160 length += strlen (prefix);
6161 strcpy (buffer + length, tree_code_name[code]);
6162 length += strlen (tree_code_name[code]);
6167 buffer = (char *)"unexpected node";
6169 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6170 buffer, tree_code_name[TREE_CODE (node)],
6171 function, trim_filename (file), line);
6174 /* Complain that the tree code of NODE does match the expected 0
6175 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6179 tree_not_check_failed (const tree node, const char *file,
6180 int line, const char *function, ...)
6184 unsigned length = 0;
6187 va_start (args, function);
6188 while ((code = va_arg (args, int)))
6189 length += 4 + strlen (tree_code_name[code]);
6191 va_start (args, function);
6192 buffer = alloca (length);
6194 while ((code = va_arg (args, int)))
6198 strcpy (buffer + length, " or ");
6201 strcpy (buffer + length, tree_code_name[code]);
6202 length += strlen (tree_code_name[code]);
6206 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6207 buffer, tree_code_name[TREE_CODE (node)],
6208 function, trim_filename (file), line);
6211 /* Similar to tree_check_failed, except that we check for a class of tree
6212 code, given in CL. */
6215 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6216 const char *file, int line, const char *function)
6219 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6220 TREE_CODE_CLASS_STRING (cl),
6221 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6222 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6225 /* Similar to tree_check_failed, except that instead of specifying a
6226 dozen codes, use the knowledge that they're all sequential. */
6229 tree_range_check_failed (const tree node, const char *file, int line,
6230 const char *function, enum tree_code c1,
6234 unsigned length = 0;
6237 for (c = c1; c <= c2; ++c)
6238 length += 4 + strlen (tree_code_name[c]);
6240 length += strlen ("expected ");
6241 buffer = alloca (length);
6244 for (c = c1; c <= c2; ++c)
6246 const char *prefix = length ? " or " : "expected ";
6248 strcpy (buffer + length, prefix);
6249 length += strlen (prefix);
6250 strcpy (buffer + length, tree_code_name[c]);
6251 length += strlen (tree_code_name[c]);
6254 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6255 buffer, tree_code_name[TREE_CODE (node)],
6256 function, trim_filename (file), line);
6260 /* Similar to tree_check_failed, except that we check that a tree does
6261 not have the specified code, given in CL. */
6264 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6265 const char *file, int line, const char *function)
6268 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6269 TREE_CODE_CLASS_STRING (cl),
6270 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6271 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6275 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6278 omp_clause_check_failed (const tree node, const char *file, int line,
6279 const char *function, enum omp_clause_code code)
6281 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6282 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6283 function, trim_filename (file), line);
6287 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6290 omp_clause_range_check_failed (const tree node, const char *file, int line,
6291 const char *function, enum omp_clause_code c1,
6292 enum omp_clause_code c2)
6295 unsigned length = 0;
6296 enum omp_clause_code c;
6298 for (c = c1; c <= c2; ++c)
6299 length += 4 + strlen (omp_clause_code_name[c]);
6301 length += strlen ("expected ");
6302 buffer = alloca (length);
6305 for (c = c1; c <= c2; ++c)
6307 const char *prefix = length ? " or " : "expected ";
6309 strcpy (buffer + length, prefix);
6310 length += strlen (prefix);
6311 strcpy (buffer + length, omp_clause_code_name[c]);
6312 length += strlen (omp_clause_code_name[c]);
6315 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6316 buffer, omp_clause_code_name[TREE_CODE (node)],
6317 function, trim_filename (file), line);
6321 #undef DEFTREESTRUCT
6322 #define DEFTREESTRUCT(VAL, NAME) NAME,
6324 static const char *ts_enum_names[] = {
6325 #include "treestruct.def"
6327 #undef DEFTREESTRUCT
6329 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6331 /* Similar to tree_class_check_failed, except that we check for
6332 whether CODE contains the tree structure identified by EN. */
6335 tree_contains_struct_check_failed (const tree node,
6336 const enum tree_node_structure_enum en,
6337 const char *file, int line,
6338 const char *function)
6341 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6343 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6347 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6348 (dynamically sized) vector. */
6351 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6352 const char *function)
6355 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6356 idx + 1, len, function, trim_filename (file), line);
6359 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6360 (dynamically sized) vector. */
6363 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6364 const char *function)
6367 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6368 idx + 1, len, function, trim_filename (file), line);
6371 /* Similar to above, except that the check is for the bounds of the operand
6372 vector of an expression node. */
6375 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
6376 int line, const char *function)
6379 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6380 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
6381 function, trim_filename (file), line);
6384 /* Similar to above, except that the check is for the number of
6385 operands of an OMP_CLAUSE node. */
6388 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6389 int line, const char *function)
6392 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6393 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6394 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6395 trim_filename (file), line);
6397 #endif /* ENABLE_TREE_CHECKING */
6399 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6400 and mapped to the machine mode MODE. Initialize its fields and build
6401 the information necessary for debugging output. */
6404 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6407 hashval_t hashcode = 0;
6409 /* Build a main variant, based on the main variant of the inner type, then
6410 use it to build the variant we return. */
6411 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
6412 && TYPE_MAIN_VARIANT (innertype) != innertype)
6413 return build_type_attribute_qual_variant (
6414 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
6415 TYPE_ATTRIBUTES (innertype),
6416 TYPE_QUALS (innertype));
6418 t = make_node (VECTOR_TYPE);
6419 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6420 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6421 TYPE_MODE (t) = mode;
6422 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6423 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6428 tree index = build_int_cst (NULL_TREE, nunits - 1);
6429 tree array = build_array_type (innertype, build_index_type (index));
6430 tree rt = make_node (RECORD_TYPE);
6432 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6433 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6435 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6436 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6437 the representation type, and we want to find that die when looking up
6438 the vector type. This is most easily achieved by making the TYPE_UID
6440 TYPE_UID (rt) = TYPE_UID (t);
6443 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
6444 hashcode = iterative_hash_host_wide_int (mode, hashcode);
6445 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
6446 return type_hash_canon (hashcode, t);
6450 make_or_reuse_type (unsigned size, int unsignedp)
6452 if (size == INT_TYPE_SIZE)
6453 return unsignedp ? unsigned_type_node : integer_type_node;
6454 if (size == CHAR_TYPE_SIZE)
6455 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6456 if (size == SHORT_TYPE_SIZE)
6457 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6458 if (size == LONG_TYPE_SIZE)
6459 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6460 if (size == LONG_LONG_TYPE_SIZE)
6461 return (unsignedp ? long_long_unsigned_type_node
6462 : long_long_integer_type_node);
6465 return make_unsigned_type (size);
6467 return make_signed_type (size);
6470 /* Create nodes for all integer types (and error_mark_node) using the sizes
6471 of C datatypes. The caller should call set_sizetype soon after calling
6472 this function to select one of the types as sizetype. */
6475 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6477 error_mark_node = make_node (ERROR_MARK);
6478 TREE_TYPE (error_mark_node) = error_mark_node;
6480 initialize_sizetypes (signed_sizetype);
6482 /* Define both `signed char' and `unsigned char'. */
6483 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6484 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6485 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6486 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6488 /* Define `char', which is like either `signed char' or `unsigned char'
6489 but not the same as either. */
6492 ? make_signed_type (CHAR_TYPE_SIZE)
6493 : make_unsigned_type (CHAR_TYPE_SIZE));
6494 TYPE_STRING_FLAG (char_type_node) = 1;
6496 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6497 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6498 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6499 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6500 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6501 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6502 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6503 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6505 /* Define a boolean type. This type only represents boolean values but
6506 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6507 Front ends which want to override this size (i.e. Java) can redefine
6508 boolean_type_node before calling build_common_tree_nodes_2. */
6509 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6510 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6511 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6512 TYPE_PRECISION (boolean_type_node) = 1;
6514 /* Fill in the rest of the sized types. Reuse existing type nodes
6516 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6517 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6518 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6519 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6520 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6522 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6523 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6524 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6525 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6526 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6528 access_public_node = get_identifier ("public");
6529 access_protected_node = get_identifier ("protected");
6530 access_private_node = get_identifier ("private");
6533 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6534 It will create several other common tree nodes. */
6537 build_common_tree_nodes_2 (int short_double)
6539 /* Define these next since types below may used them. */
6540 integer_zero_node = build_int_cst (NULL_TREE, 0);
6541 integer_one_node = build_int_cst (NULL_TREE, 1);
6542 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6544 size_zero_node = size_int (0);
6545 size_one_node = size_int (1);
6546 bitsize_zero_node = bitsize_int (0);
6547 bitsize_one_node = bitsize_int (1);
6548 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6550 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6551 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6553 void_type_node = make_node (VOID_TYPE);
6554 layout_type (void_type_node);
6556 /* We are not going to have real types in C with less than byte alignment,
6557 so we might as well not have any types that claim to have it. */
6558 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6559 TYPE_USER_ALIGN (void_type_node) = 0;
6561 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6562 layout_type (TREE_TYPE (null_pointer_node));
6564 ptr_type_node = build_pointer_type (void_type_node);
6566 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6567 fileptr_type_node = ptr_type_node;
6569 float_type_node = make_node (REAL_TYPE);
6570 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6571 layout_type (float_type_node);
6573 double_type_node = make_node (REAL_TYPE);
6575 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6577 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6578 layout_type (double_type_node);
6580 long_double_type_node = make_node (REAL_TYPE);
6581 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6582 layout_type (long_double_type_node);
6584 float_ptr_type_node = build_pointer_type (float_type_node);
6585 double_ptr_type_node = build_pointer_type (double_type_node);
6586 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6587 integer_ptr_type_node = build_pointer_type (integer_type_node);
6589 /* Decimal float types. */
6590 dfloat32_type_node = make_node (REAL_TYPE);
6591 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
6592 layout_type (dfloat32_type_node);
6593 TYPE_MODE (dfloat32_type_node) = SDmode;
6594 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
6596 dfloat64_type_node = make_node (REAL_TYPE);
6597 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
6598 layout_type (dfloat64_type_node);
6599 TYPE_MODE (dfloat64_type_node) = DDmode;
6600 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
6602 dfloat128_type_node = make_node (REAL_TYPE);
6603 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
6604 layout_type (dfloat128_type_node);
6605 TYPE_MODE (dfloat128_type_node) = TDmode;
6606 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
6608 complex_integer_type_node = make_node (COMPLEX_TYPE);
6609 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6610 layout_type (complex_integer_type_node);
6612 complex_float_type_node = make_node (COMPLEX_TYPE);
6613 TREE_TYPE (complex_float_type_node) = float_type_node;
6614 layout_type (complex_float_type_node);
6616 complex_double_type_node = make_node (COMPLEX_TYPE);
6617 TREE_TYPE (complex_double_type_node) = double_type_node;
6618 layout_type (complex_double_type_node);
6620 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6621 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6622 layout_type (complex_long_double_type_node);
6625 tree t = targetm.build_builtin_va_list ();
6627 /* Many back-ends define record types without setting TYPE_NAME.
6628 If we copied the record type here, we'd keep the original
6629 record type without a name. This breaks name mangling. So,
6630 don't copy record types and let c_common_nodes_and_builtins()
6631 declare the type to be __builtin_va_list. */
6632 if (TREE_CODE (t) != RECORD_TYPE)
6633 t = build_variant_type_copy (t);
6635 va_list_type_node = t;
6639 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6642 local_define_builtin (const char *name, tree type, enum built_in_function code,
6643 const char *library_name, int ecf_flags)
6647 decl = lang_hooks.builtin_function (name, type, code, BUILT_IN_NORMAL,
6648 library_name, NULL_TREE);
6649 if (ecf_flags & ECF_CONST)
6650 TREE_READONLY (decl) = 1;
6651 if (ecf_flags & ECF_PURE)
6652 DECL_IS_PURE (decl) = 1;
6653 if (ecf_flags & ECF_NORETURN)
6654 TREE_THIS_VOLATILE (decl) = 1;
6655 if (ecf_flags & ECF_NOTHROW)
6656 TREE_NOTHROW (decl) = 1;
6657 if (ecf_flags & ECF_MALLOC)
6658 DECL_IS_MALLOC (decl) = 1;
6660 built_in_decls[code] = decl;
6661 implicit_built_in_decls[code] = decl;
6664 /* Call this function after instantiating all builtins that the language
6665 front end cares about. This will build the rest of the builtins that
6666 are relied upon by the tree optimizers and the middle-end. */
6669 build_common_builtin_nodes (void)
6673 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
6674 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6676 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6677 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6678 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6679 ftype = build_function_type (ptr_type_node, tmp);
6681 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
6682 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
6683 "memcpy", ECF_NOTHROW);
6684 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6685 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
6686 "memmove", ECF_NOTHROW);
6689 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
6691 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6692 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6693 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6694 ftype = build_function_type (integer_type_node, tmp);
6695 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
6696 "memcmp", ECF_PURE | ECF_NOTHROW);
6699 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
6701 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6702 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
6703 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6704 ftype = build_function_type (ptr_type_node, tmp);
6705 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
6706 "memset", ECF_NOTHROW);
6709 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
6711 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6712 ftype = build_function_type (ptr_type_node, tmp);
6713 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
6714 "alloca", ECF_NOTHROW | ECF_MALLOC);
6717 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6718 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6719 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6720 ftype = build_function_type (void_type_node, tmp);
6721 local_define_builtin ("__builtin_init_trampoline", ftype,
6722 BUILT_IN_INIT_TRAMPOLINE,
6723 "__builtin_init_trampoline", ECF_NOTHROW);
6725 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6726 ftype = build_function_type (ptr_type_node, tmp);
6727 local_define_builtin ("__builtin_adjust_trampoline", ftype,
6728 BUILT_IN_ADJUST_TRAMPOLINE,
6729 "__builtin_adjust_trampoline",
6730 ECF_CONST | ECF_NOTHROW);
6732 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6733 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6734 ftype = build_function_type (void_type_node, tmp);
6735 local_define_builtin ("__builtin_nonlocal_goto", ftype,
6736 BUILT_IN_NONLOCAL_GOTO,
6737 "__builtin_nonlocal_goto",
6738 ECF_NORETURN | ECF_NOTHROW);
6740 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6741 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6742 ftype = build_function_type (void_type_node, tmp);
6743 local_define_builtin ("__builtin_setjmp_setup", ftype,
6744 BUILT_IN_SETJMP_SETUP,
6745 "__builtin_setjmp_setup", ECF_NOTHROW);
6747 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6748 ftype = build_function_type (ptr_type_node, tmp);
6749 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
6750 BUILT_IN_SETJMP_DISPATCHER,
6751 "__builtin_setjmp_dispatcher",
6752 ECF_PURE | ECF_NOTHROW);
6754 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6755 ftype = build_function_type (void_type_node, tmp);
6756 local_define_builtin ("__builtin_setjmp_receiver", ftype,
6757 BUILT_IN_SETJMP_RECEIVER,
6758 "__builtin_setjmp_receiver", ECF_NOTHROW);
6760 ftype = build_function_type (ptr_type_node, void_list_node);
6761 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
6762 "__builtin_stack_save", ECF_NOTHROW);
6764 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6765 ftype = build_function_type (void_type_node, tmp);
6766 local_define_builtin ("__builtin_stack_restore", ftype,
6767 BUILT_IN_STACK_RESTORE,
6768 "__builtin_stack_restore", ECF_NOTHROW);
6770 ftype = build_function_type (void_type_node, void_list_node);
6771 local_define_builtin ("__builtin_profile_func_enter", ftype,
6772 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
6773 local_define_builtin ("__builtin_profile_func_exit", ftype,
6774 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
6776 /* Complex multiplication and division. These are handled as builtins
6777 rather than optabs because emit_library_call_value doesn't support
6778 complex. Further, we can do slightly better with folding these
6779 beasties if the real and complex parts of the arguments are separate. */
6781 enum machine_mode mode;
6783 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
6785 char mode_name_buf[4], *q;
6787 enum built_in_function mcode, dcode;
6788 tree type, inner_type;
6790 type = lang_hooks.types.type_for_mode (mode, 0);
6793 inner_type = TREE_TYPE (type);
6795 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
6796 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6797 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6798 tmp = tree_cons (NULL_TREE, inner_type, tmp);
6799 ftype = build_function_type (type, tmp);
6801 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6802 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
6804 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
6808 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
6809 local_define_builtin (built_in_names[mcode], ftype, mcode,
6810 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
6812 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
6813 local_define_builtin (built_in_names[dcode], ftype, dcode,
6814 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
6819 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6822 If we requested a pointer to a vector, build up the pointers that
6823 we stripped off while looking for the inner type. Similarly for
6824 return values from functions.
6826 The argument TYPE is the top of the chain, and BOTTOM is the
6827 new type which we will point to. */
6830 reconstruct_complex_type (tree type, tree bottom)
6834 if (POINTER_TYPE_P (type))
6836 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6837 outer = build_pointer_type (inner);
6839 else if (TREE_CODE (type) == ARRAY_TYPE)
6841 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6842 outer = build_array_type (inner, TYPE_DOMAIN (type));
6844 else if (TREE_CODE (type) == FUNCTION_TYPE)
6846 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6847 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
6849 else if (TREE_CODE (type) == METHOD_TYPE)
6852 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
6853 /* The build_method_type_directly() routine prepends 'this' to argument list,
6854 so we must compensate by getting rid of it. */
6855 argtypes = TYPE_ARG_TYPES (type);
6856 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
6858 TYPE_ARG_TYPES (type));
6859 TYPE_ARG_TYPES (outer) = argtypes;
6864 TYPE_READONLY (outer) = TYPE_READONLY (type);
6865 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
6870 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6873 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
6877 switch (GET_MODE_CLASS (mode))
6879 case MODE_VECTOR_INT:
6880 case MODE_VECTOR_FLOAT:
6881 nunits = GET_MODE_NUNITS (mode);
6885 /* Check that there are no leftover bits. */
6886 gcc_assert (GET_MODE_BITSIZE (mode)
6887 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
6889 nunits = GET_MODE_BITSIZE (mode)
6890 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
6897 return make_vector_type (innertype, nunits, mode);
6900 /* Similarly, but takes the inner type and number of units, which must be
6904 build_vector_type (tree innertype, int nunits)
6906 return make_vector_type (innertype, nunits, VOIDmode);
6910 /* Build RESX_EXPR with given REGION_NUMBER. */
6912 build_resx (int region_number)
6915 t = build1 (RESX_EXPR, void_type_node,
6916 build_int_cst (NULL_TREE, region_number));
6920 /* Given an initializer INIT, return TRUE if INIT is zero or some
6921 aggregate of zeros. Otherwise return FALSE. */
6923 initializer_zerop (tree init)
6929 switch (TREE_CODE (init))
6932 return integer_zerop (init);
6935 /* ??? Note that this is not correct for C4X float formats. There,
6936 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6937 negative exponent. */
6938 return real_zerop (init)
6939 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
6942 return integer_zerop (init)
6943 || (real_zerop (init)
6944 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
6945 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
6948 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
6949 if (!initializer_zerop (TREE_VALUE (elt)))
6955 unsigned HOST_WIDE_INT idx;
6957 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
6958 if (!initializer_zerop (elt))
6968 /* Build an empty statement. */
6971 build_empty_stmt (void)
6973 return build1 (NOP_EXPR, void_type_node, size_zero_node);
6977 /* Build an OpenMP clause with code CODE. */
6980 build_omp_clause (enum omp_clause_code code)
6985 length = omp_clause_num_ops[code];
6986 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
6988 t = ggc_alloc (size);
6989 memset (t, 0, size);
6990 TREE_SET_CODE (t, OMP_CLAUSE);
6991 OMP_CLAUSE_SET_CODE (t, code);
6993 #ifdef GATHER_STATISTICS
6994 tree_node_counts[(int) omp_clause_kind]++;
6995 tree_node_sizes[(int) omp_clause_kind] += size;
7002 /* Returns true if it is possible to prove that the index of
7003 an array access REF (an ARRAY_REF expression) falls into the
7007 in_array_bounds_p (tree ref)
7009 tree idx = TREE_OPERAND (ref, 1);
7012 if (TREE_CODE (idx) != INTEGER_CST)
7015 min = array_ref_low_bound (ref);
7016 max = array_ref_up_bound (ref);
7019 || TREE_CODE (min) != INTEGER_CST
7020 || TREE_CODE (max) != INTEGER_CST)
7023 if (tree_int_cst_lt (idx, min)
7024 || tree_int_cst_lt (max, idx))
7030 /* Returns true if it is possible to prove that the range of
7031 an array access REF (an ARRAY_RANGE_REF expression) falls
7032 into the array bounds. */
7035 range_in_array_bounds_p (tree ref)
7037 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7038 tree range_min, range_max, min, max;
7040 range_min = TYPE_MIN_VALUE (domain_type);
7041 range_max = TYPE_MAX_VALUE (domain_type);
7044 || TREE_CODE (range_min) != INTEGER_CST
7045 || TREE_CODE (range_max) != INTEGER_CST)
7048 min = array_ref_low_bound (ref);
7049 max = array_ref_up_bound (ref);
7052 || TREE_CODE (min) != INTEGER_CST
7053 || TREE_CODE (max) != INTEGER_CST)
7056 if (tree_int_cst_lt (range_min, min)
7057 || tree_int_cst_lt (max, range_max))
7063 /* Return true if T (assumed to be a DECL) is a global variable. */
7066 is_global_var (tree t)
7069 return (TREE_STATIC (t) || MTAG_GLOBAL (t));
7071 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
7074 /* Return true if T (assumed to be a DECL) must be assigned a memory
7078 needs_to_live_in_memory (tree t)
7080 return (TREE_ADDRESSABLE (t)
7081 || is_global_var (t)
7082 || (TREE_CODE (t) == RESULT_DECL
7083 && aggregate_value_p (t, current_function_decl)));
7086 /* There are situations in which a language considers record types
7087 compatible which have different field lists. Decide if two fields
7088 are compatible. It is assumed that the parent records are compatible. */
7091 fields_compatible_p (tree f1, tree f2)
7093 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7094 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7097 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7098 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7101 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7107 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7110 find_compatible_field (tree record, tree orig_field)
7114 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7115 if (TREE_CODE (f) == FIELD_DECL
7116 && fields_compatible_p (f, orig_field))
7119 /* ??? Why isn't this on the main fields list? */
7120 f = TYPE_VFIELD (record);
7121 if (f && TREE_CODE (f) == FIELD_DECL
7122 && fields_compatible_p (f, orig_field))
7125 /* ??? We should abort here, but Java appears to do Bad Things
7126 with inherited fields. */
7130 /* Return value of a constant X. */
7133 int_cst_value (tree x)
7135 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
7136 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
7137 bool negative = ((val >> (bits - 1)) & 1) != 0;
7139 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
7142 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
7144 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
7149 /* Returns the greatest common divisor of A and B, which must be
7153 tree_fold_gcd (tree a, tree b)
7156 tree type = TREE_TYPE (a);
7158 gcc_assert (TREE_CODE (a) == INTEGER_CST);
7159 gcc_assert (TREE_CODE (b) == INTEGER_CST);
7161 if (integer_zerop (a))
7164 if (integer_zerop (b))
7167 if (tree_int_cst_sgn (a) == -1)
7168 a = fold_build2 (MULT_EXPR, type, a,
7169 build_int_cst (type, -1));
7171 if (tree_int_cst_sgn (b) == -1)
7172 b = fold_build2 (MULT_EXPR, type, b,
7173 build_int_cst (type, -1));
7177 a_mod_b = fold_build2 (FLOOR_MOD_EXPR, type, a, b);
7179 if (!TREE_INT_CST_LOW (a_mod_b)
7180 && !TREE_INT_CST_HIGH (a_mod_b))
7188 /* Returns unsigned variant of TYPE. */
7191 unsigned_type_for (tree type)
7193 if (POINTER_TYPE_P (type))
7194 return lang_hooks.types.unsigned_type (size_type_node);
7195 return lang_hooks.types.unsigned_type (type);
7198 /* Returns signed variant of TYPE. */
7201 signed_type_for (tree type)
7203 if (POINTER_TYPE_P (type))
7204 return lang_hooks.types.signed_type (size_type_node);
7205 return lang_hooks.types.signed_type (type);
7208 /* Returns the largest value obtainable by casting something in INNER type to
7212 upper_bound_in_type (tree outer, tree inner)
7214 unsigned HOST_WIDE_INT lo, hi;
7215 unsigned int det = 0;
7216 unsigned oprec = TYPE_PRECISION (outer);
7217 unsigned iprec = TYPE_PRECISION (inner);
7220 /* Compute a unique number for every combination. */
7221 det |= (oprec > iprec) ? 4 : 0;
7222 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7223 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7225 /* Determine the exponent to use. */
7230 /* oprec <= iprec, outer: signed, inner: don't care. */
7235 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7239 /* oprec > iprec, outer: signed, inner: signed. */
7243 /* oprec > iprec, outer: signed, inner: unsigned. */
7247 /* oprec > iprec, outer: unsigned, inner: signed. */
7251 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7258 /* Compute 2^^prec - 1. */
7259 if (prec <= HOST_BITS_PER_WIDE_INT)
7262 lo = ((~(unsigned HOST_WIDE_INT) 0)
7263 >> (HOST_BITS_PER_WIDE_INT - prec));
7267 hi = ((~(unsigned HOST_WIDE_INT) 0)
7268 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7269 lo = ~(unsigned HOST_WIDE_INT) 0;
7272 return build_int_cst_wide (outer, lo, hi);
7275 /* Returns the smallest value obtainable by casting something in INNER type to
7279 lower_bound_in_type (tree outer, tree inner)
7281 unsigned HOST_WIDE_INT lo, hi;
7282 unsigned oprec = TYPE_PRECISION (outer);
7283 unsigned iprec = TYPE_PRECISION (inner);
7285 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7287 if (TYPE_UNSIGNED (outer)
7288 /* If we are widening something of an unsigned type, OUTER type
7289 contains all values of INNER type. In particular, both INNER
7290 and OUTER types have zero in common. */
7291 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7295 /* If we are widening a signed type to another signed type, we
7296 want to obtain -2^^(iprec-1). If we are keeping the
7297 precision or narrowing to a signed type, we want to obtain
7299 unsigned prec = oprec > iprec ? iprec : oprec;
7301 if (prec <= HOST_BITS_PER_WIDE_INT)
7303 hi = ~(unsigned HOST_WIDE_INT) 0;
7304 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7308 hi = ((~(unsigned HOST_WIDE_INT) 0)
7309 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7314 return build_int_cst_wide (outer, lo, hi);
7317 /* Return nonzero if two operands that are suitable for PHI nodes are
7318 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7319 SSA_NAME or invariant. Note that this is strictly an optimization.
7320 That is, callers of this function can directly call operand_equal_p
7321 and get the same result, only slower. */
7324 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7328 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7330 return operand_equal_p (arg0, arg1, 0);
7333 /* Returns number of zeros at the end of binary representation of X.
7335 ??? Use ffs if available? */
7338 num_ending_zeros (tree x)
7340 unsigned HOST_WIDE_INT fr, nfr;
7341 unsigned num, abits;
7342 tree type = TREE_TYPE (x);
7344 if (TREE_INT_CST_LOW (x) == 0)
7346 num = HOST_BITS_PER_WIDE_INT;
7347 fr = TREE_INT_CST_HIGH (x);
7352 fr = TREE_INT_CST_LOW (x);
7355 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7358 if (nfr << abits == fr)
7365 if (num > TYPE_PRECISION (type))
7366 num = TYPE_PRECISION (type);
7368 return build_int_cst_type (type, num);
7372 #define WALK_SUBTREE(NODE) \
7375 result = walk_tree (&(NODE), func, data, pset); \
7381 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7382 be walked whenever a type is seen in the tree. Rest of operands and return
7383 value are as for walk_tree. */
7386 walk_type_fields (tree type, walk_tree_fn func, void *data,
7387 struct pointer_set_t *pset)
7389 tree result = NULL_TREE;
7391 switch (TREE_CODE (type))
7394 case REFERENCE_TYPE:
7395 /* We have to worry about mutually recursive pointers. These can't
7396 be written in C. They can in Ada. It's pathological, but
7397 there's an ACATS test (c38102a) that checks it. Deal with this
7398 by checking if we're pointing to another pointer, that one
7399 points to another pointer, that one does too, and we have no htab.
7400 If so, get a hash table. We check three levels deep to avoid
7401 the cost of the hash table if we don't need one. */
7402 if (POINTER_TYPE_P (TREE_TYPE (type))
7403 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7404 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7407 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7415 /* ... fall through ... */
7418 WALK_SUBTREE (TREE_TYPE (type));
7422 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7427 WALK_SUBTREE (TREE_TYPE (type));
7431 /* We never want to walk into default arguments. */
7432 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7433 WALK_SUBTREE (TREE_VALUE (arg));
7438 /* Don't follow this nodes's type if a pointer for fear that
7439 we'll have infinite recursion. If we have a PSET, then we
7442 || (!POINTER_TYPE_P (TREE_TYPE (type))
7443 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
7444 WALK_SUBTREE (TREE_TYPE (type));
7445 WALK_SUBTREE (TYPE_DOMAIN (type));
7452 WALK_SUBTREE (TYPE_MIN_VALUE (type));
7453 WALK_SUBTREE (TYPE_MAX_VALUE (type));
7457 WALK_SUBTREE (TREE_TYPE (type));
7458 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7468 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7469 called with the DATA and the address of each sub-tree. If FUNC returns a
7470 non-NULL value, the traversal is stopped, and the value returned by FUNC
7471 is returned. If PSET is non-NULL it is used to record the nodes visited,
7472 and to avoid visiting a node more than once. */
7475 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7477 enum tree_code code;
7481 #define WALK_SUBTREE_TAIL(NODE) \
7485 goto tail_recurse; \
7490 /* Skip empty subtrees. */
7494 /* Don't walk the same tree twice, if the user has requested
7495 that we avoid doing so. */
7496 if (pset && pointer_set_insert (pset, *tp))
7499 /* Call the function. */
7501 result = (*func) (tp, &walk_subtrees, data);
7503 /* If we found something, return it. */
7507 code = TREE_CODE (*tp);
7509 /* Even if we didn't, FUNC may have decided that there was nothing
7510 interesting below this point in the tree. */
7513 /* But we still need to check our siblings. */
7514 if (code == TREE_LIST)
7515 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7516 else if (code == OMP_CLAUSE)
7517 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7522 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
7524 if (result || ! walk_subtrees)
7530 case IDENTIFIER_NODE:
7536 case PLACEHOLDER_EXPR:
7540 /* None of these have subtrees other than those already walked
7545 WALK_SUBTREE (TREE_VALUE (*tp));
7546 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7551 int len = TREE_VEC_LENGTH (*tp);
7556 /* Walk all elements but the first. */
7558 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
7560 /* Now walk the first one as a tail call. */
7561 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
7565 WALK_SUBTREE (TREE_REALPART (*tp));
7566 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
7570 unsigned HOST_WIDE_INT idx;
7571 constructor_elt *ce;
7574 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
7576 WALK_SUBTREE (ce->value);
7581 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
7586 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
7588 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7589 into declarations that are just mentioned, rather than
7590 declared; they don't really belong to this part of the tree.
7591 And, we can see cycles: the initializer for a declaration
7592 can refer to the declaration itself. */
7593 WALK_SUBTREE (DECL_INITIAL (decl));
7594 WALK_SUBTREE (DECL_SIZE (decl));
7595 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
7597 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
7600 case STATEMENT_LIST:
7602 tree_stmt_iterator i;
7603 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
7604 WALK_SUBTREE (*tsi_stmt_ptr (i));
7609 switch (OMP_CLAUSE_CODE (*tp))
7611 case OMP_CLAUSE_PRIVATE:
7612 case OMP_CLAUSE_SHARED:
7613 case OMP_CLAUSE_FIRSTPRIVATE:
7614 case OMP_CLAUSE_LASTPRIVATE:
7615 case OMP_CLAUSE_COPYIN:
7616 case OMP_CLAUSE_COPYPRIVATE:
7618 case OMP_CLAUSE_NUM_THREADS:
7619 case OMP_CLAUSE_SCHEDULE:
7620 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
7623 case OMP_CLAUSE_NOWAIT:
7624 case OMP_CLAUSE_ORDERED:
7625 case OMP_CLAUSE_DEFAULT:
7626 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7628 case OMP_CLAUSE_REDUCTION:
7631 for (i = 0; i < 4; i++)
7632 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
7633 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7645 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7646 But, we only want to walk once. */
7647 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
7648 for (i = 0; i < len; ++i)
7649 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7650 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
7654 /* Walk into various fields of the type that it's defining. We only
7655 want to walk into these fields of a type in this case. Note that
7656 decls get walked as part of the processing of a BIND_EXPR.
7658 ??? Precisely which fields of types that we are supposed to walk in
7659 this case vs. the normal case aren't well defined. */
7660 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL
7661 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp))) != ERROR_MARK)
7663 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
7665 /* Call the function for the type. See if it returns anything or
7666 doesn't want us to continue. If we are to continue, walk both
7667 the normal fields and those for the declaration case. */
7668 result = (*func) (type_p, &walk_subtrees, data);
7669 if (result || !walk_subtrees)
7672 result = walk_type_fields (*type_p, func, data, pset);
7676 /* If this is a record type, also walk the fields. */
7677 if (TREE_CODE (*type_p) == RECORD_TYPE
7678 || TREE_CODE (*type_p) == UNION_TYPE
7679 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7683 for (field = TYPE_FIELDS (*type_p); field;
7684 field = TREE_CHAIN (field))
7686 /* We'd like to look at the type of the field, but we can
7687 easily get infinite recursion. So assume it's pointed
7688 to elsewhere in the tree. Also, ignore things that
7690 if (TREE_CODE (field) != FIELD_DECL)
7693 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
7694 WALK_SUBTREE (DECL_SIZE (field));
7695 WALK_SUBTREE (DECL_SIZE_UNIT (field));
7696 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7697 WALK_SUBTREE (DECL_QUALIFIER (field));
7701 WALK_SUBTREE (TYPE_SIZE (*type_p));
7702 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
7707 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
7711 /* Walk over all the sub-trees of this operand. */
7712 len = TREE_CODE_LENGTH (code);
7714 /* Go through the subtrees. We need to do this in forward order so
7715 that the scope of a FOR_EXPR is handled properly. */
7718 for (i = 0; i < len - 1; ++i)
7719 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7720 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
7724 /* If this is a type, walk the needed fields in the type. */
7725 else if (TYPE_P (*tp))
7726 return walk_type_fields (*tp, func, data, pset);
7730 /* We didn't find what we were looking for. */
7733 #undef WALK_SUBTREE_TAIL
7737 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7740 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
7743 struct pointer_set_t *pset;
7745 pset = pointer_set_create ();
7746 result = walk_tree (tp, func, data, pset);
7747 pointer_set_destroy (pset);
7752 /* Return true if STMT is an empty statement or contains nothing but
7753 empty statements. */
7756 empty_body_p (tree stmt)
7758 tree_stmt_iterator i;
7761 if (IS_EMPTY_STMT (stmt))
7763 else if (TREE_CODE (stmt) == BIND_EXPR)
7764 body = BIND_EXPR_BODY (stmt);
7765 else if (TREE_CODE (stmt) == STATEMENT_LIST)
7770 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
7771 if (!empty_body_p (tsi_stmt (i)))
7777 #include "gt-tree.h"