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, 2007
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[] =
74 /* obstack.[ch] explicitly declined to prototype this. */
75 extern int _obstack_allocated_p (struct obstack *h, void *obj);
77 #ifdef GATHER_STATISTICS
78 /* Statistics-gathering stuff. */
80 int tree_node_counts[(int) all_kinds];
81 int tree_node_sizes[(int) all_kinds];
83 /* Keep in sync with tree.h:enum tree_node_kind. */
84 static const char * const tree_node_kind_names[] = {
106 #endif /* GATHER_STATISTICS */
108 /* Unique id for next decl created. */
109 static GTY(()) int next_decl_uid;
110 /* Unique id for next type created. */
111 static GTY(()) int next_type_uid = 1;
113 /* Since we cannot rehash a type after it is in the table, we have to
114 keep the hash code. */
116 struct type_hash GTY(())
122 /* Initial size of the hash table (rounded to next prime). */
123 #define TYPE_HASH_INITIAL_SIZE 1000
125 /* Now here is the hash table. When recording a type, it is added to
126 the slot whose index is the hash code. Note that the hash table is
127 used for several kinds of types (function types, array types and
128 array index range types, for now). While all these live in the
129 same table, they are completely independent, and the hash code is
130 computed differently for each of these. */
132 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
133 htab_t type_hash_table;
135 /* Hash table and temporary node for larger integer const values. */
136 static GTY (()) tree int_cst_node;
137 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
138 htab_t int_cst_hash_table;
140 /* General tree->tree mapping structure for use in hash tables. */
143 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
144 htab_t debug_expr_for_decl;
146 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
147 htab_t value_expr_for_decl;
149 static GTY ((if_marked ("tree_priority_map_marked_p"),
150 param_is (struct tree_priority_map)))
151 htab_t init_priority_for_decl;
153 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
154 htab_t restrict_base_for_decl;
156 static void set_type_quals (tree, int);
157 static int type_hash_eq (const void *, const void *);
158 static hashval_t type_hash_hash (const void *);
159 static hashval_t int_cst_hash_hash (const void *);
160 static int int_cst_hash_eq (const void *, const void *);
161 static void print_type_hash_statistics (void);
162 static void print_debug_expr_statistics (void);
163 static void print_value_expr_statistics (void);
164 static int type_hash_marked_p (const void *);
165 static unsigned int type_hash_list (tree, hashval_t);
166 static unsigned int attribute_hash_list (tree, hashval_t);
168 tree global_trees[TI_MAX];
169 tree integer_types[itk_none];
171 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
173 /* Number of operands for each OpenMP clause. */
174 unsigned const char omp_clause_num_ops[] =
176 0, /* OMP_CLAUSE_ERROR */
177 1, /* OMP_CLAUSE_PRIVATE */
178 1, /* OMP_CLAUSE_SHARED */
179 1, /* OMP_CLAUSE_FIRSTPRIVATE */
180 1, /* OMP_CLAUSE_LASTPRIVATE */
181 4, /* OMP_CLAUSE_REDUCTION */
182 1, /* OMP_CLAUSE_COPYIN */
183 1, /* OMP_CLAUSE_COPYPRIVATE */
184 1, /* OMP_CLAUSE_IF */
185 1, /* OMP_CLAUSE_NUM_THREADS */
186 1, /* OMP_CLAUSE_SCHEDULE */
187 0, /* OMP_CLAUSE_NOWAIT */
188 0, /* OMP_CLAUSE_ORDERED */
189 0 /* OMP_CLAUSE_DEFAULT */
192 const char * const omp_clause_code_name[] =
215 /* Initialize the hash table of types. */
216 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
219 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
222 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
224 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
225 tree_priority_map_eq, 0);
226 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
229 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
230 int_cst_hash_eq, NULL);
232 int_cst_node = make_node (INTEGER_CST);
234 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
235 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
236 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
239 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
240 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
241 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
242 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
243 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
244 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
245 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
246 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
247 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
250 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
251 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
252 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
253 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
254 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
255 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
257 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
258 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
259 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
260 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
261 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
262 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
263 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
264 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
265 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
266 tree_contains_struct[STRUCT_FIELD_TAG][TS_DECL_MINIMAL] = 1;
267 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
268 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
269 tree_contains_struct[MEMORY_PARTITION_TAG][TS_DECL_MINIMAL] = 1;
271 tree_contains_struct[STRUCT_FIELD_TAG][TS_MEMORY_TAG] = 1;
272 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
273 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
274 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_TAG] = 1;
276 tree_contains_struct[STRUCT_FIELD_TAG][TS_STRUCT_FIELD_TAG] = 1;
277 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_PARTITION_TAG] = 1;
279 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
280 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
281 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
282 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
284 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
285 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
286 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
287 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
288 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
289 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
290 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
291 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
293 lang_hooks.init_ts ();
297 /* The name of the object as the assembler will see it (but before any
298 translations made by ASM_OUTPUT_LABELREF). Often this is the same
299 as DECL_NAME. It is an IDENTIFIER_NODE. */
301 decl_assembler_name (tree decl)
303 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
304 lang_hooks.set_decl_assembler_name (decl);
305 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
308 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
311 decl_assembler_name_equal (tree decl, tree asmname)
313 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
315 if (decl_asmname == asmname)
318 /* If the target assembler name was set by the user, things are trickier.
319 We have a leading '*' to begin with. After that, it's arguable what
320 is the correct thing to do with -fleading-underscore. Arguably, we've
321 historically been doing the wrong thing in assemble_alias by always
322 printing the leading underscore. Since we're not changing that, make
323 sure user_label_prefix follows the '*' before matching. */
324 if (IDENTIFIER_POINTER (decl_asmname)[0] == '*')
326 const char *decl_str = IDENTIFIER_POINTER (decl_asmname) + 1;
327 size_t ulp_len = strlen (user_label_prefix);
331 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
336 return strcmp (decl_str, IDENTIFIER_POINTER (asmname)) == 0;
342 /* Compute the number of bytes occupied by a tree with code CODE.
343 This function cannot be used for nodes that have variable sizes,
344 including TREE_VEC, PHI_NODE, STRING_CST, and CALL_EXPR. */
346 tree_code_size (enum tree_code code)
348 switch (TREE_CODE_CLASS (code))
350 case tcc_declaration: /* A decl node */
355 return sizeof (struct tree_field_decl);
357 return sizeof (struct tree_parm_decl);
359 return sizeof (struct tree_var_decl);
361 return sizeof (struct tree_label_decl);
363 return sizeof (struct tree_result_decl);
365 return sizeof (struct tree_const_decl);
367 return sizeof (struct tree_type_decl);
369 return sizeof (struct tree_function_decl);
370 case NAME_MEMORY_TAG:
371 case SYMBOL_MEMORY_TAG:
372 return sizeof (struct tree_memory_tag);
373 case STRUCT_FIELD_TAG:
374 return sizeof (struct tree_struct_field_tag);
375 case MEMORY_PARTITION_TAG:
376 return sizeof (struct tree_memory_partition_tag);
378 return sizeof (struct tree_decl_non_common);
382 case tcc_type: /* a type node */
383 return sizeof (struct tree_type);
385 case tcc_reference: /* a reference */
386 case tcc_expression: /* an expression */
387 case tcc_statement: /* an expression with side effects */
388 case tcc_comparison: /* a comparison expression */
389 case tcc_unary: /* a unary arithmetic expression */
390 case tcc_binary: /* a binary arithmetic expression */
391 return (sizeof (struct tree_exp)
392 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
394 case tcc_gimple_stmt:
395 return (sizeof (struct gimple_stmt)
396 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
398 case tcc_constant: /* a constant */
401 case INTEGER_CST: return sizeof (struct tree_int_cst);
402 case REAL_CST: return sizeof (struct tree_real_cst);
403 case COMPLEX_CST: return sizeof (struct tree_complex);
404 case VECTOR_CST: return sizeof (struct tree_vector);
405 case STRING_CST: gcc_unreachable ();
407 return lang_hooks.tree_size (code);
410 case tcc_exceptional: /* something random, like an identifier. */
413 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
414 case TREE_LIST: return sizeof (struct tree_list);
417 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
421 case PHI_NODE: gcc_unreachable ();
423 case SSA_NAME: return sizeof (struct tree_ssa_name);
425 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
426 case BLOCK: return sizeof (struct tree_block);
427 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
428 case CONSTRUCTOR: return sizeof (struct tree_constructor);
431 return lang_hooks.tree_size (code);
439 /* Compute the number of bytes occupied by NODE. This routine only
440 looks at TREE_CODE, except for those nodes that have variable sizes. */
442 tree_size (tree node)
444 enum tree_code code = TREE_CODE (node);
448 return (sizeof (struct tree_phi_node)
449 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
452 return (offsetof (struct tree_binfo, base_binfos)
453 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
456 return (sizeof (struct tree_vec)
457 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
460 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
463 return (sizeof (struct tree_omp_clause)
464 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
468 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
469 return (sizeof (struct tree_exp)
470 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
472 return tree_code_size (code);
476 /* Return a newly allocated node of code CODE. For decl and type
477 nodes, some other fields are initialized. The rest of the node is
478 initialized to zero. This function cannot be used for PHI_NODE,
479 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
482 Achoo! I got a code in the node. */
485 make_node_stat (enum tree_code code MEM_STAT_DECL)
488 enum tree_code_class type = TREE_CODE_CLASS (code);
489 size_t length = tree_code_size (code);
490 #ifdef GATHER_STATISTICS
495 case tcc_declaration: /* A decl node */
499 case tcc_type: /* a type node */
503 case tcc_statement: /* an expression with side effects */
507 case tcc_reference: /* a reference */
511 case tcc_expression: /* an expression */
512 case tcc_comparison: /* a comparison expression */
513 case tcc_unary: /* a unary arithmetic expression */
514 case tcc_binary: /* a binary arithmetic expression */
518 case tcc_constant: /* a constant */
522 case tcc_gimple_stmt:
523 kind = gimple_stmt_kind;
526 case tcc_exceptional: /* something random, like an identifier. */
529 case IDENTIFIER_NODE:
546 kind = ssa_name_kind;
567 tree_node_counts[(int) kind]++;
568 tree_node_sizes[(int) kind] += length;
571 if (code == IDENTIFIER_NODE)
572 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
574 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
576 memset (t, 0, length);
578 TREE_SET_CODE (t, code);
583 TREE_SIDE_EFFECTS (t) = 1;
586 case tcc_declaration:
587 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
588 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
589 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
591 if (code != FUNCTION_DECL)
593 DECL_USER_ALIGN (t) = 0;
594 /* We have not yet computed the alias set for this declaration. */
595 DECL_POINTER_ALIAS_SET (t) = -1;
597 DECL_SOURCE_LOCATION (t) = input_location;
598 DECL_UID (t) = next_decl_uid++;
603 TYPE_UID (t) = next_type_uid++;
604 TYPE_ALIGN (t) = BITS_PER_UNIT;
605 TYPE_USER_ALIGN (t) = 0;
606 TYPE_MAIN_VARIANT (t) = t;
607 TYPE_CANONICAL (t) = t;
609 /* Default to no attributes for type, but let target change that. */
610 TYPE_ATTRIBUTES (t) = NULL_TREE;
611 targetm.set_default_type_attributes (t);
613 /* We have not yet computed the alias set for this type. */
614 TYPE_ALIAS_SET (t) = -1;
618 TREE_CONSTANT (t) = 1;
619 TREE_INVARIANT (t) = 1;
628 case PREDECREMENT_EXPR:
629 case PREINCREMENT_EXPR:
630 case POSTDECREMENT_EXPR:
631 case POSTINCREMENT_EXPR:
632 /* All of these have side-effects, no matter what their
634 TREE_SIDE_EFFECTS (t) = 1;
642 case tcc_gimple_stmt:
645 case GIMPLE_MODIFY_STMT:
646 TREE_SIDE_EFFECTS (t) = 1;
654 /* Other classes need no special treatment. */
661 /* Return a new node with the same contents as NODE except that its
662 TREE_CHAIN is zero and it has a fresh uid. */
665 copy_node_stat (tree node MEM_STAT_DECL)
668 enum tree_code code = TREE_CODE (node);
671 gcc_assert (code != STATEMENT_LIST);
673 length = tree_size (node);
674 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
675 memcpy (t, node, length);
677 if (!GIMPLE_TUPLE_P (node))
679 TREE_ASM_WRITTEN (t) = 0;
680 TREE_VISITED (t) = 0;
683 if (TREE_CODE_CLASS (code) == tcc_declaration)
685 DECL_UID (t) = next_decl_uid++;
686 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
687 && DECL_HAS_VALUE_EXPR_P (node))
689 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
690 DECL_HAS_VALUE_EXPR_P (t) = 1;
692 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
694 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
695 DECL_HAS_INIT_PRIORITY_P (t) = 1;
697 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
699 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
700 DECL_BASED_ON_RESTRICT_P (t) = 1;
703 else if (TREE_CODE_CLASS (code) == tcc_type)
705 TYPE_UID (t) = next_type_uid++;
706 /* The following is so that the debug code for
707 the copy is different from the original type.
708 The two statements usually duplicate each other
709 (because they clear fields of the same union),
710 but the optimizer should catch that. */
711 TYPE_SYMTAB_POINTER (t) = 0;
712 TYPE_SYMTAB_ADDRESS (t) = 0;
714 /* Do not copy the values cache. */
715 if (TYPE_CACHED_VALUES_P(t))
717 TYPE_CACHED_VALUES_P (t) = 0;
718 TYPE_CACHED_VALUES (t) = NULL_TREE;
725 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
726 For example, this can copy a list made of TREE_LIST nodes. */
729 copy_list (tree list)
737 head = prev = copy_node (list);
738 next = TREE_CHAIN (list);
741 TREE_CHAIN (prev) = copy_node (next);
742 prev = TREE_CHAIN (prev);
743 next = TREE_CHAIN (next);
749 /* Create an INT_CST node with a LOW value sign extended. */
752 build_int_cst (tree type, HOST_WIDE_INT low)
754 /* Support legacy code. */
756 type = integer_type_node;
758 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
761 /* Create an INT_CST node with a LOW value zero extended. */
764 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
766 return build_int_cst_wide (type, low, 0);
769 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
770 if it is negative. This function is similar to build_int_cst, but
771 the extra bits outside of the type precision are cleared. Constants
772 with these extra bits may confuse the fold so that it detects overflows
773 even in cases when they do not occur, and in general should be avoided.
774 We cannot however make this a default behavior of build_int_cst without
775 more intrusive changes, since there are parts of gcc that rely on the extra
776 precision of the integer constants. */
779 build_int_cst_type (tree type, HOST_WIDE_INT low)
781 unsigned HOST_WIDE_INT low1;
786 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
788 return build_int_cst_wide (type, low1, hi);
791 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
792 and sign extended according to the value range of TYPE. */
795 build_int_cst_wide_type (tree type,
796 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
798 fit_double_type (low, high, &low, &high, type);
799 return build_int_cst_wide (type, low, high);
802 /* These are the hash table functions for the hash table of INTEGER_CST
803 nodes of a sizetype. */
805 /* Return the hash code code X, an INTEGER_CST. */
808 int_cst_hash_hash (const void *x)
812 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
813 ^ htab_hash_pointer (TREE_TYPE (t)));
816 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
817 is the same as that given by *Y, which is the same. */
820 int_cst_hash_eq (const void *x, const void *y)
825 return (TREE_TYPE (xt) == TREE_TYPE (yt)
826 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
827 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
830 /* Create an INT_CST node of TYPE and value HI:LOW.
831 The returned node is always shared. For small integers we use a
832 per-type vector cache, for larger ones we use a single hash table. */
835 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
843 switch (TREE_CODE (type))
847 /* Cache NULL pointer. */
856 /* Cache false or true. */
864 if (TYPE_UNSIGNED (type))
867 limit = INTEGER_SHARE_LIMIT;
868 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
874 limit = INTEGER_SHARE_LIMIT + 1;
875 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
877 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
891 /* Look for it in the type's vector of small shared ints. */
892 if (!TYPE_CACHED_VALUES_P (type))
894 TYPE_CACHED_VALUES_P (type) = 1;
895 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
898 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
901 /* Make sure no one is clobbering the shared constant. */
902 gcc_assert (TREE_TYPE (t) == type);
903 gcc_assert (TREE_INT_CST_LOW (t) == low);
904 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
908 /* Create a new shared int. */
909 t = make_node (INTEGER_CST);
911 TREE_INT_CST_LOW (t) = low;
912 TREE_INT_CST_HIGH (t) = hi;
913 TREE_TYPE (t) = type;
915 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
920 /* Use the cache of larger shared ints. */
923 TREE_INT_CST_LOW (int_cst_node) = low;
924 TREE_INT_CST_HIGH (int_cst_node) = hi;
925 TREE_TYPE (int_cst_node) = type;
927 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
931 /* Insert this one into the hash table. */
934 /* Make a new node for next time round. */
935 int_cst_node = make_node (INTEGER_CST);
942 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
943 and the rest are zeros. */
946 build_low_bits_mask (tree type, unsigned bits)
948 unsigned HOST_WIDE_INT low;
950 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
952 gcc_assert (bits <= TYPE_PRECISION (type));
954 if (bits == TYPE_PRECISION (type)
955 && !TYPE_UNSIGNED (type))
957 /* Sign extended all-ones mask. */
961 else if (bits <= HOST_BITS_PER_WIDE_INT)
963 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
968 bits -= HOST_BITS_PER_WIDE_INT;
970 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
973 return build_int_cst_wide (type, low, high);
976 /* Checks that X is integer constant that can be expressed in (unsigned)
977 HOST_WIDE_INT without loss of precision. */
980 cst_and_fits_in_hwi (tree x)
982 if (TREE_CODE (x) != INTEGER_CST)
985 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
988 return (TREE_INT_CST_HIGH (x) == 0
989 || TREE_INT_CST_HIGH (x) == -1);
992 /* Return a new VECTOR_CST node whose type is TYPE and whose values
993 are in a list pointed to by VALS. */
996 build_vector (tree type, tree vals)
998 tree v = make_node (VECTOR_CST);
1002 TREE_VECTOR_CST_ELTS (v) = vals;
1003 TREE_TYPE (v) = type;
1005 /* Iterate through elements and check for overflow. */
1006 for (link = vals; link; link = TREE_CHAIN (link))
1008 tree value = TREE_VALUE (link);
1010 /* Don't crash if we get an address constant. */
1011 if (!CONSTANT_CLASS_P (value))
1014 over |= TREE_OVERFLOW (value);
1017 TREE_OVERFLOW (v) = over;
1021 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1022 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1025 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1027 tree list = NULL_TREE;
1028 unsigned HOST_WIDE_INT idx;
1031 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1032 list = tree_cons (NULL_TREE, value, list);
1033 return build_vector (type, nreverse (list));
1036 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1037 are in the VEC pointed to by VALS. */
1039 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1041 tree c = make_node (CONSTRUCTOR);
1042 TREE_TYPE (c) = type;
1043 CONSTRUCTOR_ELTS (c) = vals;
1047 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1050 build_constructor_single (tree type, tree index, tree value)
1052 VEC(constructor_elt,gc) *v;
1053 constructor_elt *elt;
1056 v = VEC_alloc (constructor_elt, gc, 1);
1057 elt = VEC_quick_push (constructor_elt, v, NULL);
1061 t = build_constructor (type, v);
1062 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1067 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1068 are in a list pointed to by VALS. */
1070 build_constructor_from_list (tree type, tree vals)
1073 VEC(constructor_elt,gc) *v = NULL;
1074 bool constant_p = true;
1078 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1079 for (t = vals; t; t = TREE_CHAIN (t))
1081 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1082 val = TREE_VALUE (t);
1083 elt->index = TREE_PURPOSE (t);
1085 if (!TREE_CONSTANT (val))
1090 t = build_constructor (type, v);
1091 TREE_CONSTANT (t) = constant_p;
1096 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1099 build_real (tree type, REAL_VALUE_TYPE d)
1102 REAL_VALUE_TYPE *dp;
1105 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1106 Consider doing it via real_convert now. */
1108 v = make_node (REAL_CST);
1109 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1110 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1112 TREE_TYPE (v) = type;
1113 TREE_REAL_CST_PTR (v) = dp;
1114 TREE_OVERFLOW (v) = overflow;
1118 /* Return a new REAL_CST node whose type is TYPE
1119 and whose value is the integer value of the INTEGER_CST node I. */
1122 real_value_from_int_cst (tree type, tree i)
1126 /* Clear all bits of the real value type so that we can later do
1127 bitwise comparisons to see if two values are the same. */
1128 memset (&d, 0, sizeof d);
1130 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1131 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1132 TYPE_UNSIGNED (TREE_TYPE (i)));
1136 /* Given a tree representing an integer constant I, return a tree
1137 representing the same value as a floating-point constant of type TYPE. */
1140 build_real_from_int_cst (tree type, tree i)
1143 int overflow = TREE_OVERFLOW (i);
1145 v = build_real (type, real_value_from_int_cst (type, i));
1147 TREE_OVERFLOW (v) |= overflow;
1151 /* Return a newly constructed STRING_CST node whose value is
1152 the LEN characters at STR.
1153 The TREE_TYPE is not initialized. */
1156 build_string (int len, const char *str)
1161 /* Do not waste bytes provided by padding of struct tree_string. */
1162 length = len + offsetof (struct tree_string, str) + 1;
1164 #ifdef GATHER_STATISTICS
1165 tree_node_counts[(int) c_kind]++;
1166 tree_node_sizes[(int) c_kind] += length;
1169 s = ggc_alloc_tree (length);
1171 memset (s, 0, sizeof (struct tree_common));
1172 TREE_SET_CODE (s, STRING_CST);
1173 TREE_CONSTANT (s) = 1;
1174 TREE_INVARIANT (s) = 1;
1175 TREE_STRING_LENGTH (s) = len;
1176 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1177 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1182 /* Return a newly constructed COMPLEX_CST node whose value is
1183 specified by the real and imaginary parts REAL and IMAG.
1184 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1185 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1188 build_complex (tree type, tree real, tree imag)
1190 tree t = make_node (COMPLEX_CST);
1192 TREE_REALPART (t) = real;
1193 TREE_IMAGPART (t) = imag;
1194 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1195 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1199 /* Return a constant of arithmetic type TYPE which is the
1200 multiplicative identity of the set TYPE. */
1203 build_one_cst (tree type)
1205 switch (TREE_CODE (type))
1207 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1208 case POINTER_TYPE: case REFERENCE_TYPE:
1210 return build_int_cst (type, 1);
1213 return build_real (type, dconst1);
1220 scalar = build_one_cst (TREE_TYPE (type));
1222 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1224 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1225 cst = tree_cons (NULL_TREE, scalar, cst);
1227 return build_vector (type, cst);
1231 return build_complex (type,
1232 build_one_cst (TREE_TYPE (type)),
1233 fold_convert (TREE_TYPE (type), integer_zero_node));
1240 /* Build a BINFO with LEN language slots. */
1243 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1246 size_t length = (offsetof (struct tree_binfo, base_binfos)
1247 + VEC_embedded_size (tree, base_binfos));
1249 #ifdef GATHER_STATISTICS
1250 tree_node_counts[(int) binfo_kind]++;
1251 tree_node_sizes[(int) binfo_kind] += length;
1254 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1256 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1258 TREE_SET_CODE (t, TREE_BINFO);
1260 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1266 /* Build a newly constructed TREE_VEC node of length LEN. */
1269 make_tree_vec_stat (int len MEM_STAT_DECL)
1272 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1274 #ifdef GATHER_STATISTICS
1275 tree_node_counts[(int) vec_kind]++;
1276 tree_node_sizes[(int) vec_kind] += length;
1279 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1281 memset (t, 0, length);
1283 TREE_SET_CODE (t, TREE_VEC);
1284 TREE_VEC_LENGTH (t) = len;
1289 /* Return 1 if EXPR is the integer constant zero or a complex constant
1293 integer_zerop (tree expr)
1297 return ((TREE_CODE (expr) == INTEGER_CST
1298 && TREE_INT_CST_LOW (expr) == 0
1299 && TREE_INT_CST_HIGH (expr) == 0)
1300 || (TREE_CODE (expr) == COMPLEX_CST
1301 && integer_zerop (TREE_REALPART (expr))
1302 && integer_zerop (TREE_IMAGPART (expr))));
1305 /* Return 1 if EXPR is the integer constant one or the corresponding
1306 complex constant. */
1309 integer_onep (tree expr)
1313 return ((TREE_CODE (expr) == INTEGER_CST
1314 && TREE_INT_CST_LOW (expr) == 1
1315 && TREE_INT_CST_HIGH (expr) == 0)
1316 || (TREE_CODE (expr) == COMPLEX_CST
1317 && integer_onep (TREE_REALPART (expr))
1318 && integer_zerop (TREE_IMAGPART (expr))));
1321 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1322 it contains. Likewise for the corresponding complex constant. */
1325 integer_all_onesp (tree expr)
1332 if (TREE_CODE (expr) == COMPLEX_CST
1333 && integer_all_onesp (TREE_REALPART (expr))
1334 && integer_zerop (TREE_IMAGPART (expr)))
1337 else if (TREE_CODE (expr) != INTEGER_CST)
1340 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1341 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1342 && TREE_INT_CST_HIGH (expr) == -1)
1347 /* Note that using TYPE_PRECISION here is wrong. We care about the
1348 actual bits, not the (arbitrary) range of the type. */
1349 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1350 if (prec >= HOST_BITS_PER_WIDE_INT)
1352 HOST_WIDE_INT high_value;
1355 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1357 /* Can not handle precisions greater than twice the host int size. */
1358 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1359 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1360 /* Shifting by the host word size is undefined according to the ANSI
1361 standard, so we must handle this as a special case. */
1364 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1366 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1367 && TREE_INT_CST_HIGH (expr) == high_value);
1370 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1373 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1377 integer_pow2p (tree expr)
1380 HOST_WIDE_INT high, low;
1384 if (TREE_CODE (expr) == COMPLEX_CST
1385 && integer_pow2p (TREE_REALPART (expr))
1386 && integer_zerop (TREE_IMAGPART (expr)))
1389 if (TREE_CODE (expr) != INTEGER_CST)
1392 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1393 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1394 high = TREE_INT_CST_HIGH (expr);
1395 low = TREE_INT_CST_LOW (expr);
1397 /* First clear all bits that are beyond the type's precision in case
1398 we've been sign extended. */
1400 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1402 else if (prec > HOST_BITS_PER_WIDE_INT)
1403 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1407 if (prec < HOST_BITS_PER_WIDE_INT)
1408 low &= ~((HOST_WIDE_INT) (-1) << prec);
1411 if (high == 0 && low == 0)
1414 return ((high == 0 && (low & (low - 1)) == 0)
1415 || (low == 0 && (high & (high - 1)) == 0));
1418 /* Return 1 if EXPR is an integer constant other than zero or a
1419 complex constant other than zero. */
1422 integer_nonzerop (tree expr)
1426 return ((TREE_CODE (expr) == INTEGER_CST
1427 && (TREE_INT_CST_LOW (expr) != 0
1428 || TREE_INT_CST_HIGH (expr) != 0))
1429 || (TREE_CODE (expr) == COMPLEX_CST
1430 && (integer_nonzerop (TREE_REALPART (expr))
1431 || integer_nonzerop (TREE_IMAGPART (expr)))));
1434 /* Return the power of two represented by a tree node known to be a
1438 tree_log2 (tree expr)
1441 HOST_WIDE_INT high, low;
1445 if (TREE_CODE (expr) == COMPLEX_CST)
1446 return tree_log2 (TREE_REALPART (expr));
1448 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1449 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1451 high = TREE_INT_CST_HIGH (expr);
1452 low = TREE_INT_CST_LOW (expr);
1454 /* First clear all bits that are beyond the type's precision in case
1455 we've been sign extended. */
1457 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1459 else if (prec > HOST_BITS_PER_WIDE_INT)
1460 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1464 if (prec < HOST_BITS_PER_WIDE_INT)
1465 low &= ~((HOST_WIDE_INT) (-1) << prec);
1468 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1469 : exact_log2 (low));
1472 /* Similar, but return the largest integer Y such that 2 ** Y is less
1473 than or equal to EXPR. */
1476 tree_floor_log2 (tree expr)
1479 HOST_WIDE_INT high, low;
1483 if (TREE_CODE (expr) == COMPLEX_CST)
1484 return tree_log2 (TREE_REALPART (expr));
1486 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1487 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1489 high = TREE_INT_CST_HIGH (expr);
1490 low = TREE_INT_CST_LOW (expr);
1492 /* First clear all bits that are beyond the type's precision in case
1493 we've been sign extended. Ignore if type's precision hasn't been set
1494 since what we are doing is setting it. */
1496 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1498 else if (prec > HOST_BITS_PER_WIDE_INT)
1499 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1503 if (prec < HOST_BITS_PER_WIDE_INT)
1504 low &= ~((HOST_WIDE_INT) (-1) << prec);
1507 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1508 : floor_log2 (low));
1511 /* Return 1 if EXPR is the real constant zero. */
1514 real_zerop (tree expr)
1518 return ((TREE_CODE (expr) == REAL_CST
1519 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1520 || (TREE_CODE (expr) == COMPLEX_CST
1521 && real_zerop (TREE_REALPART (expr))
1522 && real_zerop (TREE_IMAGPART (expr))));
1525 /* Return 1 if EXPR is the real constant one in real or complex form. */
1528 real_onep (tree expr)
1532 return ((TREE_CODE (expr) == REAL_CST
1533 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1534 || (TREE_CODE (expr) == COMPLEX_CST
1535 && real_onep (TREE_REALPART (expr))
1536 && real_zerop (TREE_IMAGPART (expr))));
1539 /* Return 1 if EXPR is the real constant two. */
1542 real_twop (tree expr)
1546 return ((TREE_CODE (expr) == REAL_CST
1547 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1548 || (TREE_CODE (expr) == COMPLEX_CST
1549 && real_twop (TREE_REALPART (expr))
1550 && real_zerop (TREE_IMAGPART (expr))));
1553 /* Return 1 if EXPR is the real constant minus one. */
1556 real_minus_onep (tree expr)
1560 return ((TREE_CODE (expr) == REAL_CST
1561 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1562 || (TREE_CODE (expr) == COMPLEX_CST
1563 && real_minus_onep (TREE_REALPART (expr))
1564 && real_zerop (TREE_IMAGPART (expr))));
1567 /* Nonzero if EXP is a constant or a cast of a constant. */
1570 really_constant_p (tree exp)
1572 /* This is not quite the same as STRIP_NOPS. It does more. */
1573 while (TREE_CODE (exp) == NOP_EXPR
1574 || TREE_CODE (exp) == CONVERT_EXPR
1575 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1576 exp = TREE_OPERAND (exp, 0);
1577 return TREE_CONSTANT (exp);
1580 /* Return first list element whose TREE_VALUE is ELEM.
1581 Return 0 if ELEM is not in LIST. */
1584 value_member (tree elem, tree list)
1588 if (elem == TREE_VALUE (list))
1590 list = TREE_CHAIN (list);
1595 /* Return first list element whose TREE_PURPOSE is ELEM.
1596 Return 0 if ELEM is not in LIST. */
1599 purpose_member (tree elem, tree list)
1603 if (elem == TREE_PURPOSE (list))
1605 list = TREE_CHAIN (list);
1610 /* Return nonzero if ELEM is part of the chain CHAIN. */
1613 chain_member (tree elem, tree chain)
1619 chain = TREE_CHAIN (chain);
1625 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1626 We expect a null pointer to mark the end of the chain.
1627 This is the Lisp primitive `length'. */
1630 list_length (tree t)
1633 #ifdef ENABLE_TREE_CHECKING
1641 #ifdef ENABLE_TREE_CHECKING
1644 gcc_assert (p != q);
1652 /* Returns the number of FIELD_DECLs in TYPE. */
1655 fields_length (tree type)
1657 tree t = TYPE_FIELDS (type);
1660 for (; t; t = TREE_CHAIN (t))
1661 if (TREE_CODE (t) == FIELD_DECL)
1667 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1668 by modifying the last node in chain 1 to point to chain 2.
1669 This is the Lisp primitive `nconc'. */
1672 chainon (tree op1, tree op2)
1681 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1683 TREE_CHAIN (t1) = op2;
1685 #ifdef ENABLE_TREE_CHECKING
1688 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1689 gcc_assert (t2 != t1);
1696 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1699 tree_last (tree chain)
1703 while ((next = TREE_CHAIN (chain)))
1708 /* Reverse the order of elements in the chain T,
1709 and return the new head of the chain (old last element). */
1714 tree prev = 0, decl, next;
1715 for (decl = t; decl; decl = next)
1717 next = TREE_CHAIN (decl);
1718 TREE_CHAIN (decl) = prev;
1724 /* Return a newly created TREE_LIST node whose
1725 purpose and value fields are PARM and VALUE. */
1728 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1730 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1731 TREE_PURPOSE (t) = parm;
1732 TREE_VALUE (t) = value;
1736 /* Return a newly created TREE_LIST node whose
1737 purpose and value fields are PURPOSE and VALUE
1738 and whose TREE_CHAIN is CHAIN. */
1741 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1745 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1747 memset (node, 0, sizeof (struct tree_common));
1749 #ifdef GATHER_STATISTICS
1750 tree_node_counts[(int) x_kind]++;
1751 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1754 TREE_SET_CODE (node, TREE_LIST);
1755 TREE_CHAIN (node) = chain;
1756 TREE_PURPOSE (node) = purpose;
1757 TREE_VALUE (node) = value;
1762 /* Return the size nominally occupied by an object of type TYPE
1763 when it resides in memory. The value is measured in units of bytes,
1764 and its data type is that normally used for type sizes
1765 (which is the first type created by make_signed_type or
1766 make_unsigned_type). */
1769 size_in_bytes (tree type)
1773 if (type == error_mark_node)
1774 return integer_zero_node;
1776 type = TYPE_MAIN_VARIANT (type);
1777 t = TYPE_SIZE_UNIT (type);
1781 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1782 return size_zero_node;
1788 /* Return the size of TYPE (in bytes) as a wide integer
1789 or return -1 if the size can vary or is larger than an integer. */
1792 int_size_in_bytes (tree type)
1796 if (type == error_mark_node)
1799 type = TYPE_MAIN_VARIANT (type);
1800 t = TYPE_SIZE_UNIT (type);
1802 || TREE_CODE (t) != INTEGER_CST
1803 || TREE_INT_CST_HIGH (t) != 0
1804 /* If the result would appear negative, it's too big to represent. */
1805 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1808 return TREE_INT_CST_LOW (t);
1811 /* Return the maximum size of TYPE (in bytes) as a wide integer
1812 or return -1 if the size can vary or is larger than an integer. */
1815 max_int_size_in_bytes (tree type)
1817 HOST_WIDE_INT size = -1;
1820 /* If this is an array type, check for a possible MAX_SIZE attached. */
1822 if (TREE_CODE (type) == ARRAY_TYPE)
1824 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1826 if (size_tree && host_integerp (size_tree, 1))
1827 size = tree_low_cst (size_tree, 1);
1830 /* If we still haven't been able to get a size, see if the language
1831 can compute a maximum size. */
1835 size_tree = lang_hooks.types.max_size (type);
1837 if (size_tree && host_integerp (size_tree, 1))
1838 size = tree_low_cst (size_tree, 1);
1844 /* Return the bit position of FIELD, in bits from the start of the record.
1845 This is a tree of type bitsizetype. */
1848 bit_position (tree field)
1850 return bit_from_pos (DECL_FIELD_OFFSET (field),
1851 DECL_FIELD_BIT_OFFSET (field));
1854 /* Likewise, but return as an integer. It must be representable in
1855 that way (since it could be a signed value, we don't have the
1856 option of returning -1 like int_size_in_byte can. */
1859 int_bit_position (tree field)
1861 return tree_low_cst (bit_position (field), 0);
1864 /* Return the byte position of FIELD, in bytes from the start of the record.
1865 This is a tree of type sizetype. */
1868 byte_position (tree field)
1870 return byte_from_pos (DECL_FIELD_OFFSET (field),
1871 DECL_FIELD_BIT_OFFSET (field));
1874 /* Likewise, but return as an integer. It must be representable in
1875 that way (since it could be a signed value, we don't have the
1876 option of returning -1 like int_size_in_byte can. */
1879 int_byte_position (tree field)
1881 return tree_low_cst (byte_position (field), 0);
1884 /* Return the strictest alignment, in bits, that T is known to have. */
1889 unsigned int align0, align1;
1891 switch (TREE_CODE (t))
1893 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1894 /* If we have conversions, we know that the alignment of the
1895 object must meet each of the alignments of the types. */
1896 align0 = expr_align (TREE_OPERAND (t, 0));
1897 align1 = TYPE_ALIGN (TREE_TYPE (t));
1898 return MAX (align0, align1);
1900 case GIMPLE_MODIFY_STMT:
1901 /* We should never ask for the alignment of a gimple statement. */
1904 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1905 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1906 case CLEANUP_POINT_EXPR:
1907 /* These don't change the alignment of an object. */
1908 return expr_align (TREE_OPERAND (t, 0));
1911 /* The best we can do is say that the alignment is the least aligned
1913 align0 = expr_align (TREE_OPERAND (t, 1));
1914 align1 = expr_align (TREE_OPERAND (t, 2));
1915 return MIN (align0, align1);
1917 case LABEL_DECL: case CONST_DECL:
1918 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1919 if (DECL_ALIGN (t) != 0)
1920 return DECL_ALIGN (t);
1924 return FUNCTION_BOUNDARY;
1930 /* Otherwise take the alignment from that of the type. */
1931 return TYPE_ALIGN (TREE_TYPE (t));
1934 /* Return, as a tree node, the number of elements for TYPE (which is an
1935 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1938 array_type_nelts (tree type)
1940 tree index_type, min, max;
1942 /* If they did it with unspecified bounds, then we should have already
1943 given an error about it before we got here. */
1944 if (! TYPE_DOMAIN (type))
1945 return error_mark_node;
1947 index_type = TYPE_DOMAIN (type);
1948 min = TYPE_MIN_VALUE (index_type);
1949 max = TYPE_MAX_VALUE (index_type);
1951 return (integer_zerop (min)
1953 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1956 /* If arg is static -- a reference to an object in static storage -- then
1957 return the object. This is not the same as the C meaning of `static'.
1958 If arg isn't static, return NULL. */
1963 switch (TREE_CODE (arg))
1966 /* Nested functions are static, even though taking their address will
1967 involve a trampoline as we unnest the nested function and create
1968 the trampoline on the tree level. */
1972 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1973 && ! DECL_THREAD_LOCAL_P (arg)
1974 && ! DECL_DLLIMPORT_P (arg)
1978 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1982 return TREE_STATIC (arg) ? arg : NULL;
1989 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
1991 /* If we are referencing a bitfield, we can't evaluate an
1992 ADDR_EXPR at compile time and so it isn't a constant. */
1993 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1996 return staticp (TREE_OPERAND (arg, 0));
2001 case MISALIGNED_INDIRECT_REF:
2002 case ALIGN_INDIRECT_REF:
2004 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2007 case ARRAY_RANGE_REF:
2008 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2009 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2010 return staticp (TREE_OPERAND (arg, 0));
2015 /* All language specific tree codes should have been lowered by
2017 gcc_assert_lowered (arg);
2022 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2023 Do this to any expression which may be used in more than one place,
2024 but must be evaluated only once.
2026 Normally, expand_expr would reevaluate the expression each time.
2027 Calling save_expr produces something that is evaluated and recorded
2028 the first time expand_expr is called on it. Subsequent calls to
2029 expand_expr just reuse the recorded value.
2031 The call to expand_expr that generates code that actually computes
2032 the value is the first call *at compile time*. Subsequent calls
2033 *at compile time* generate code to use the saved value.
2034 This produces correct result provided that *at run time* control
2035 always flows through the insns made by the first expand_expr
2036 before reaching the other places where the save_expr was evaluated.
2037 You, the caller of save_expr, must make sure this is so.
2039 Constants, and certain read-only nodes, are returned with no
2040 SAVE_EXPR because that is safe. Expressions containing placeholders
2041 are not touched; see tree.def for an explanation of what these
2045 save_expr (tree expr)
2047 tree t = fold (expr);
2050 /* If the tree evaluates to a constant, then we don't want to hide that
2051 fact (i.e. this allows further folding, and direct checks for constants).
2052 However, a read-only object that has side effects cannot be bypassed.
2053 Since it is no problem to reevaluate literals, we just return the
2055 inner = skip_simple_arithmetic (t);
2057 if (TREE_INVARIANT (inner)
2058 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2059 || TREE_CODE (inner) == SAVE_EXPR
2060 || TREE_CODE (inner) == ERROR_MARK)
2063 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2064 it means that the size or offset of some field of an object depends on
2065 the value within another field.
2067 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2068 and some variable since it would then need to be both evaluated once and
2069 evaluated more than once. Front-ends must assure this case cannot
2070 happen by surrounding any such subexpressions in their own SAVE_EXPR
2071 and forcing evaluation at the proper time. */
2072 if (contains_placeholder_p (inner))
2075 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2077 /* This expression might be placed ahead of a jump to ensure that the
2078 value was computed on both sides of the jump. So make sure it isn't
2079 eliminated as dead. */
2080 TREE_SIDE_EFFECTS (t) = 1;
2081 TREE_INVARIANT (t) = 1;
2085 /* Look inside EXPR and into any simple arithmetic operations. Return
2086 the innermost non-arithmetic node. */
2089 skip_simple_arithmetic (tree expr)
2093 /* We don't care about whether this can be used as an lvalue in this
2095 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2096 expr = TREE_OPERAND (expr, 0);
2098 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2099 a constant, it will be more efficient to not make another SAVE_EXPR since
2100 it will allow better simplification and GCSE will be able to merge the
2101 computations if they actually occur. */
2105 if (UNARY_CLASS_P (inner))
2106 inner = TREE_OPERAND (inner, 0);
2107 else if (BINARY_CLASS_P (inner))
2109 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2110 inner = TREE_OPERAND (inner, 0);
2111 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2112 inner = TREE_OPERAND (inner, 1);
2123 /* Return which tree structure is used by T. */
2125 enum tree_node_structure_enum
2126 tree_node_structure (tree t)
2128 enum tree_code code = TREE_CODE (t);
2130 switch (TREE_CODE_CLASS (code))
2132 case tcc_declaration:
2137 return TS_FIELD_DECL;
2139 return TS_PARM_DECL;
2143 return TS_LABEL_DECL;
2145 return TS_RESULT_DECL;
2147 return TS_CONST_DECL;
2149 return TS_TYPE_DECL;
2151 return TS_FUNCTION_DECL;
2152 case SYMBOL_MEMORY_TAG:
2153 case NAME_MEMORY_TAG:
2154 case STRUCT_FIELD_TAG:
2155 case MEMORY_PARTITION_TAG:
2156 return TS_MEMORY_TAG;
2158 return TS_DECL_NON_COMMON;
2164 case tcc_comparison:
2167 case tcc_expression:
2171 case tcc_gimple_stmt:
2172 return TS_GIMPLE_STATEMENT;
2173 default: /* tcc_constant and tcc_exceptional */
2178 /* tcc_constant cases. */
2179 case INTEGER_CST: return TS_INT_CST;
2180 case REAL_CST: return TS_REAL_CST;
2181 case COMPLEX_CST: return TS_COMPLEX;
2182 case VECTOR_CST: return TS_VECTOR;
2183 case STRING_CST: return TS_STRING;
2184 /* tcc_exceptional cases. */
2185 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2187 case ERROR_MARK: return TS_COMMON;
2188 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2189 case TREE_LIST: return TS_LIST;
2190 case TREE_VEC: return TS_VEC;
2191 case PHI_NODE: return TS_PHI_NODE;
2192 case SSA_NAME: return TS_SSA_NAME;
2193 case PLACEHOLDER_EXPR: return TS_COMMON;
2194 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2195 case BLOCK: return TS_BLOCK;
2196 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2197 case TREE_BINFO: return TS_BINFO;
2198 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2199 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2206 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2207 or offset that depends on a field within a record. */
2210 contains_placeholder_p (tree exp)
2212 enum tree_code code;
2217 code = TREE_CODE (exp);
2218 if (code == PLACEHOLDER_EXPR)
2221 switch (TREE_CODE_CLASS (code))
2224 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2225 position computations since they will be converted into a
2226 WITH_RECORD_EXPR involving the reference, which will assume
2227 here will be valid. */
2228 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2230 case tcc_exceptional:
2231 if (code == TREE_LIST)
2232 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2233 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2238 case tcc_comparison:
2239 case tcc_expression:
2243 /* Ignoring the first operand isn't quite right, but works best. */
2244 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2247 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2248 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2249 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2255 switch (TREE_CODE_LENGTH (code))
2258 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2260 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2261 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2272 call_expr_arg_iterator iter;
2273 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
2274 if (CONTAINS_PLACEHOLDER_P (arg))
2288 /* Return true if any part of the computation of TYPE involves a
2289 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2290 (for QUAL_UNION_TYPE) and field positions. */
2293 type_contains_placeholder_1 (tree type)
2295 /* If the size contains a placeholder or the parent type (component type in
2296 the case of arrays) type involves a placeholder, this type does. */
2297 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2298 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2299 || (TREE_TYPE (type) != 0
2300 && type_contains_placeholder_p (TREE_TYPE (type))))
2303 /* Now do type-specific checks. Note that the last part of the check above
2304 greatly limits what we have to do below. */
2305 switch (TREE_CODE (type))
2313 case REFERENCE_TYPE:
2321 /* Here we just check the bounds. */
2322 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2323 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2326 /* We're already checked the component type (TREE_TYPE), so just check
2328 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2332 case QUAL_UNION_TYPE:
2336 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2337 if (TREE_CODE (field) == FIELD_DECL
2338 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2339 || (TREE_CODE (type) == QUAL_UNION_TYPE
2340 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2341 || type_contains_placeholder_p (TREE_TYPE (field))))
2353 type_contains_placeholder_p (tree type)
2357 /* If the contains_placeholder_bits field has been initialized,
2358 then we know the answer. */
2359 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2360 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2362 /* Indicate that we've seen this type node, and the answer is false.
2363 This is what we want to return if we run into recursion via fields. */
2364 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2366 /* Compute the real value. */
2367 result = type_contains_placeholder_1 (type);
2369 /* Store the real value. */
2370 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2375 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2376 return a tree with all occurrences of references to F in a
2377 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2378 contains only arithmetic expressions or a CALL_EXPR with a
2379 PLACEHOLDER_EXPR occurring only in its arglist. */
2382 substitute_in_expr (tree exp, tree f, tree r)
2384 enum tree_code code = TREE_CODE (exp);
2385 tree op0, op1, op2, op3;
2389 /* We handle TREE_LIST and COMPONENT_REF separately. */
2390 if (code == TREE_LIST)
2392 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2393 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2394 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2397 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2399 else if (code == COMPONENT_REF)
2401 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2402 and it is the right field, replace it with R. */
2403 for (inner = TREE_OPERAND (exp, 0);
2404 REFERENCE_CLASS_P (inner);
2405 inner = TREE_OPERAND (inner, 0))
2407 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2408 && TREE_OPERAND (exp, 1) == f)
2411 /* If this expression hasn't been completed let, leave it alone. */
2412 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2415 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2416 if (op0 == TREE_OPERAND (exp, 0))
2419 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2420 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2423 switch (TREE_CODE_CLASS (code))
2426 case tcc_declaration:
2429 case tcc_exceptional:
2432 case tcc_comparison:
2433 case tcc_expression:
2435 switch (TREE_CODE_LENGTH (code))
2441 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2442 if (op0 == TREE_OPERAND (exp, 0))
2445 new = fold_build1 (code, TREE_TYPE (exp), op0);
2449 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2450 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2452 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2455 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2459 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2460 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2461 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2463 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2464 && op2 == TREE_OPERAND (exp, 2))
2467 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2471 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2472 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2473 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2474 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2476 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2477 && op2 == TREE_OPERAND (exp, 2)
2478 && op3 == TREE_OPERAND (exp, 3))
2481 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2491 tree copy = NULL_TREE;
2493 int n = TREE_OPERAND_LENGTH (exp);
2494 for (i = 1; i < n; i++)
2496 tree op = TREE_OPERAND (exp, i);
2497 tree newop = SUBSTITUTE_IN_EXPR (op, f, r);
2500 copy = copy_node (exp);
2501 TREE_OPERAND (copy, i) = newop;
2514 TREE_READONLY (new) = TREE_READONLY (exp);
2518 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2519 for it within OBJ, a tree that is an object or a chain of references. */
2522 substitute_placeholder_in_expr (tree exp, tree obj)
2524 enum tree_code code = TREE_CODE (exp);
2525 tree op0, op1, op2, op3;
2527 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2528 in the chain of OBJ. */
2529 if (code == PLACEHOLDER_EXPR)
2531 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2534 for (elt = obj; elt != 0;
2535 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2536 || TREE_CODE (elt) == COND_EXPR)
2537 ? TREE_OPERAND (elt, 1)
2538 : (REFERENCE_CLASS_P (elt)
2539 || UNARY_CLASS_P (elt)
2540 || BINARY_CLASS_P (elt)
2541 || VL_EXP_CLASS_P (elt)
2542 || EXPRESSION_CLASS_P (elt))
2543 ? TREE_OPERAND (elt, 0) : 0))
2544 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2547 for (elt = obj; elt != 0;
2548 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2549 || TREE_CODE (elt) == COND_EXPR)
2550 ? TREE_OPERAND (elt, 1)
2551 : (REFERENCE_CLASS_P (elt)
2552 || UNARY_CLASS_P (elt)
2553 || BINARY_CLASS_P (elt)
2554 || VL_EXP_CLASS_P (elt)
2555 || EXPRESSION_CLASS_P (elt))
2556 ? TREE_OPERAND (elt, 0) : 0))
2557 if (POINTER_TYPE_P (TREE_TYPE (elt))
2558 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2560 return fold_build1 (INDIRECT_REF, need_type, elt);
2562 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2563 survives until RTL generation, there will be an error. */
2567 /* TREE_LIST is special because we need to look at TREE_VALUE
2568 and TREE_CHAIN, not TREE_OPERANDS. */
2569 else if (code == TREE_LIST)
2571 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2572 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2573 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2576 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2579 switch (TREE_CODE_CLASS (code))
2582 case tcc_declaration:
2585 case tcc_exceptional:
2588 case tcc_comparison:
2589 case tcc_expression:
2592 switch (TREE_CODE_LENGTH (code))
2598 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2599 if (op0 == TREE_OPERAND (exp, 0))
2602 return fold_build1 (code, TREE_TYPE (exp), op0);
2605 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2606 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2608 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2611 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2614 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2615 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2616 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2618 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2619 && op2 == TREE_OPERAND (exp, 2))
2622 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2625 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2626 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2627 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2628 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2630 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2631 && op2 == TREE_OPERAND (exp, 2)
2632 && op3 == TREE_OPERAND (exp, 3))
2635 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2644 tree copy = NULL_TREE;
2646 int n = TREE_OPERAND_LENGTH (exp);
2647 for (i = 1; i < n; i++)
2649 tree op = TREE_OPERAND (exp, i);
2650 tree newop = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2654 copy = copy_node (exp);
2655 TREE_OPERAND (copy, i) = newop;
2669 /* Stabilize a reference so that we can use it any number of times
2670 without causing its operands to be evaluated more than once.
2671 Returns the stabilized reference. This works by means of save_expr,
2672 so see the caveats in the comments about save_expr.
2674 Also allows conversion expressions whose operands are references.
2675 Any other kind of expression is returned unchanged. */
2678 stabilize_reference (tree ref)
2681 enum tree_code code = TREE_CODE (ref);
2688 /* No action is needed in this case. */
2694 case FIX_TRUNC_EXPR:
2695 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2699 result = build_nt (INDIRECT_REF,
2700 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2704 result = build_nt (COMPONENT_REF,
2705 stabilize_reference (TREE_OPERAND (ref, 0)),
2706 TREE_OPERAND (ref, 1), NULL_TREE);
2710 result = build_nt (BIT_FIELD_REF,
2711 stabilize_reference (TREE_OPERAND (ref, 0)),
2712 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2713 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2717 result = build_nt (ARRAY_REF,
2718 stabilize_reference (TREE_OPERAND (ref, 0)),
2719 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2720 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2723 case ARRAY_RANGE_REF:
2724 result = build_nt (ARRAY_RANGE_REF,
2725 stabilize_reference (TREE_OPERAND (ref, 0)),
2726 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2727 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2731 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2732 it wouldn't be ignored. This matters when dealing with
2734 return stabilize_reference_1 (ref);
2736 /* If arg isn't a kind of lvalue we recognize, make no change.
2737 Caller should recognize the error for an invalid lvalue. */
2742 return error_mark_node;
2745 TREE_TYPE (result) = TREE_TYPE (ref);
2746 TREE_READONLY (result) = TREE_READONLY (ref);
2747 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2748 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2753 /* Subroutine of stabilize_reference; this is called for subtrees of
2754 references. Any expression with side-effects must be put in a SAVE_EXPR
2755 to ensure that it is only evaluated once.
2757 We don't put SAVE_EXPR nodes around everything, because assigning very
2758 simple expressions to temporaries causes us to miss good opportunities
2759 for optimizations. Among other things, the opportunity to fold in the
2760 addition of a constant into an addressing mode often gets lost, e.g.
2761 "y[i+1] += x;". In general, we take the approach that we should not make
2762 an assignment unless we are forced into it - i.e., that any non-side effect
2763 operator should be allowed, and that cse should take care of coalescing
2764 multiple utterances of the same expression should that prove fruitful. */
2767 stabilize_reference_1 (tree e)
2770 enum tree_code code = TREE_CODE (e);
2772 /* We cannot ignore const expressions because it might be a reference
2773 to a const array but whose index contains side-effects. But we can
2774 ignore things that are actual constant or that already have been
2775 handled by this function. */
2777 if (TREE_INVARIANT (e))
2780 switch (TREE_CODE_CLASS (code))
2782 case tcc_exceptional:
2784 case tcc_declaration:
2785 case tcc_comparison:
2787 case tcc_expression:
2790 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2791 so that it will only be evaluated once. */
2792 /* The reference (r) and comparison (<) classes could be handled as
2793 below, but it is generally faster to only evaluate them once. */
2794 if (TREE_SIDE_EFFECTS (e))
2795 return save_expr (e);
2799 /* Constants need no processing. In fact, we should never reach
2804 /* Division is slow and tends to be compiled with jumps,
2805 especially the division by powers of 2 that is often
2806 found inside of an array reference. So do it just once. */
2807 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2808 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2809 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2810 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2811 return save_expr (e);
2812 /* Recursively stabilize each operand. */
2813 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2814 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2818 /* Recursively stabilize each operand. */
2819 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2826 TREE_TYPE (result) = TREE_TYPE (e);
2827 TREE_READONLY (result) = TREE_READONLY (e);
2828 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2829 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2830 TREE_INVARIANT (result) = 1;
2835 /* Low-level constructors for expressions. */
2837 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2838 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2841 recompute_tree_invariant_for_addr_expr (tree t)
2844 bool tc = true, ti = true, se = false;
2846 /* We started out assuming this address is both invariant and constant, but
2847 does not have side effects. Now go down any handled components and see if
2848 any of them involve offsets that are either non-constant or non-invariant.
2849 Also check for side-effects.
2851 ??? Note that this code makes no attempt to deal with the case where
2852 taking the address of something causes a copy due to misalignment. */
2854 #define UPDATE_TITCSE(NODE) \
2855 do { tree _node = (NODE); \
2856 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2857 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2858 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2860 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2861 node = TREE_OPERAND (node, 0))
2863 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2864 array reference (probably made temporarily by the G++ front end),
2865 so ignore all the operands. */
2866 if ((TREE_CODE (node) == ARRAY_REF
2867 || TREE_CODE (node) == ARRAY_RANGE_REF)
2868 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2870 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2871 if (TREE_OPERAND (node, 2))
2872 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2873 if (TREE_OPERAND (node, 3))
2874 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2876 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2877 FIELD_DECL, apparently. The G++ front end can put something else
2878 there, at least temporarily. */
2879 else if (TREE_CODE (node) == COMPONENT_REF
2880 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2882 if (TREE_OPERAND (node, 2))
2883 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2885 else if (TREE_CODE (node) == BIT_FIELD_REF)
2886 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2889 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2891 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2892 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2893 invariant and constant if the decl is static. It's also invariant if it's
2894 a decl in the current function. Taking the address of a volatile variable
2895 is not volatile. If it's a constant, the address is both invariant and
2896 constant. Otherwise it's neither. */
2897 if (TREE_CODE (node) == INDIRECT_REF)
2898 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2899 else if (DECL_P (node))
2903 else if (decl_function_context (node) == current_function_decl
2904 /* Addresses of thread-local variables are invariant. */
2905 || (TREE_CODE (node) == VAR_DECL
2906 && DECL_THREAD_LOCAL_P (node)))
2911 else if (CONSTANT_CLASS_P (node))
2916 se |= TREE_SIDE_EFFECTS (node);
2919 TREE_CONSTANT (t) = tc;
2920 TREE_INVARIANT (t) = ti;
2921 TREE_SIDE_EFFECTS (t) = se;
2922 #undef UPDATE_TITCSE
2925 /* Build an expression of code CODE, data type TYPE, and operands as
2926 specified. Expressions and reference nodes can be created this way.
2927 Constants, decls, types and misc nodes cannot be.
2929 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2930 enough for all extant tree codes. */
2933 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2937 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2939 t = make_node_stat (code PASS_MEM_STAT);
2946 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2948 int length = sizeof (struct tree_exp);
2949 #ifdef GATHER_STATISTICS
2950 tree_node_kind kind;
2954 #ifdef GATHER_STATISTICS
2955 switch (TREE_CODE_CLASS (code))
2957 case tcc_statement: /* an expression with side effects */
2960 case tcc_reference: /* a reference */
2968 tree_node_counts[(int) kind]++;
2969 tree_node_sizes[(int) kind] += length;
2972 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2974 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2976 memset (t, 0, sizeof (struct tree_common));
2978 TREE_SET_CODE (t, code);
2980 TREE_TYPE (t) = type;
2981 #ifdef USE_MAPPED_LOCATION
2982 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2984 SET_EXPR_LOCUS (t, NULL);
2986 TREE_OPERAND (t, 0) = node;
2987 TREE_BLOCK (t) = NULL_TREE;
2988 if (node && !TYPE_P (node))
2990 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2991 TREE_READONLY (t) = TREE_READONLY (node);
2994 if (TREE_CODE_CLASS (code) == tcc_statement)
2995 TREE_SIDE_EFFECTS (t) = 1;
2999 /* All of these have side-effects, no matter what their
3001 TREE_SIDE_EFFECTS (t) = 1;
3002 TREE_READONLY (t) = 0;
3005 case MISALIGNED_INDIRECT_REF:
3006 case ALIGN_INDIRECT_REF:
3008 /* Whether a dereference is readonly has nothing to do with whether
3009 its operand is readonly. */
3010 TREE_READONLY (t) = 0;
3015 recompute_tree_invariant_for_addr_expr (t);
3019 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3020 && node && !TYPE_P (node)
3021 && TREE_CONSTANT (node))
3022 TREE_CONSTANT (t) = 1;
3023 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3024 && node && TREE_INVARIANT (node))
3025 TREE_INVARIANT (t) = 1;
3026 if (TREE_CODE_CLASS (code) == tcc_reference
3027 && node && TREE_THIS_VOLATILE (node))
3028 TREE_THIS_VOLATILE (t) = 1;
3035 #define PROCESS_ARG(N) \
3037 TREE_OPERAND (t, N) = arg##N; \
3038 if (arg##N &&!TYPE_P (arg##N)) \
3040 if (TREE_SIDE_EFFECTS (arg##N)) \
3042 if (!TREE_READONLY (arg##N)) \
3044 if (!TREE_CONSTANT (arg##N)) \
3046 if (!TREE_INVARIANT (arg##N)) \
3052 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3054 bool constant, read_only, side_effects, invariant;
3057 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3060 /* FIXME tuples: Statement's aren't expressions! */
3061 if (code == GIMPLE_MODIFY_STMT)
3062 return build_gimple_modify_stmt_stat (arg0, arg1 PASS_MEM_STAT);
3064 /* Must use build_gimple_modify_stmt to construct GIMPLE_MODIFY_STMTs. */
3065 gcc_assert (code != GIMPLE_MODIFY_STMT);
3068 t = make_node_stat (code PASS_MEM_STAT);
3071 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3072 result based on those same flags for the arguments. But if the
3073 arguments aren't really even `tree' expressions, we shouldn't be trying
3076 /* Expressions without side effects may be constant if their
3077 arguments are as well. */
3078 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3079 || TREE_CODE_CLASS (code) == tcc_binary);
3081 side_effects = TREE_SIDE_EFFECTS (t);
3082 invariant = constant;
3087 TREE_READONLY (t) = read_only;
3088 TREE_CONSTANT (t) = constant;
3089 TREE_INVARIANT (t) = invariant;
3090 TREE_SIDE_EFFECTS (t) = side_effects;
3091 TREE_THIS_VOLATILE (t)
3092 = (TREE_CODE_CLASS (code) == tcc_reference
3093 && arg0 && TREE_THIS_VOLATILE (arg0));
3099 /* Build a GIMPLE_MODIFY_STMT node. This tree code doesn't have a
3100 type, so we can't use build2 (a.k.a. build2_stat). */
3103 build_gimple_modify_stmt_stat (tree arg0, tree arg1 MEM_STAT_DECL)
3107 t = make_node_stat (GIMPLE_MODIFY_STMT PASS_MEM_STAT);
3108 /* ?? We don't care about setting flags for tuples... */
3109 GIMPLE_STMT_OPERAND (t, 0) = arg0;
3110 GIMPLE_STMT_OPERAND (t, 1) = arg1;
3115 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3116 tree arg2 MEM_STAT_DECL)
3118 bool constant, read_only, side_effects, invariant;
3121 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3122 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3124 t = make_node_stat (code PASS_MEM_STAT);
3127 side_effects = TREE_SIDE_EFFECTS (t);
3133 TREE_SIDE_EFFECTS (t) = side_effects;
3134 TREE_THIS_VOLATILE (t)
3135 = (TREE_CODE_CLASS (code) == tcc_reference
3136 && arg0 && TREE_THIS_VOLATILE (arg0));
3142 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3143 tree arg2, tree arg3 MEM_STAT_DECL)
3145 bool constant, read_only, side_effects, invariant;
3148 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3150 t = make_node_stat (code PASS_MEM_STAT);
3153 side_effects = TREE_SIDE_EFFECTS (t);
3160 TREE_SIDE_EFFECTS (t) = side_effects;
3161 TREE_THIS_VOLATILE (t)
3162 = (TREE_CODE_CLASS (code) == tcc_reference
3163 && arg0 && TREE_THIS_VOLATILE (arg0));
3169 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3170 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3172 bool constant, read_only, side_effects, invariant;
3175 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3177 t = make_node_stat (code PASS_MEM_STAT);
3180 side_effects = TREE_SIDE_EFFECTS (t);
3188 TREE_SIDE_EFFECTS (t) = side_effects;
3189 TREE_THIS_VOLATILE (t)
3190 = (TREE_CODE_CLASS (code) == tcc_reference
3191 && arg0 && TREE_THIS_VOLATILE (arg0));
3197 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3198 tree arg2, tree arg3, tree arg4, tree arg5,
3199 tree arg6 MEM_STAT_DECL)
3201 bool constant, read_only, side_effects, invariant;
3204 gcc_assert (code == TARGET_MEM_REF);
3206 t = make_node_stat (code PASS_MEM_STAT);
3209 side_effects = TREE_SIDE_EFFECTS (t);
3219 TREE_SIDE_EFFECTS (t) = side_effects;
3220 TREE_THIS_VOLATILE (t) = 0;
3225 /* Similar except don't specify the TREE_TYPE
3226 and leave the TREE_SIDE_EFFECTS as 0.
3227 It is permissible for arguments to be null,
3228 or even garbage if their values do not matter. */
3231 build_nt (enum tree_code code, ...)
3238 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3242 t = make_node (code);
3243 length = TREE_CODE_LENGTH (code);
3245 for (i = 0; i < length; i++)
3246 TREE_OPERAND (t, i) = va_arg (p, tree);
3252 /* Similar to build_nt, but for creating a CALL_EXPR object with
3253 ARGLIST passed as a list. */
3256 build_nt_call_list (tree fn, tree arglist)
3261 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3262 CALL_EXPR_FN (t) = fn;
3263 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3264 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3265 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3269 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3270 We do NOT enter this node in any sort of symbol table.
3272 layout_decl is used to set up the decl's storage layout.
3273 Other slots are initialized to 0 or null pointers. */
3276 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3280 t = make_node_stat (code PASS_MEM_STAT);
3282 /* if (type == error_mark_node)
3283 type = integer_type_node; */
3284 /* That is not done, deliberately, so that having error_mark_node
3285 as the type can suppress useless errors in the use of this variable. */
3287 DECL_NAME (t) = name;
3288 TREE_TYPE (t) = type;
3290 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3292 else if (code == FUNCTION_DECL)
3293 DECL_MODE (t) = FUNCTION_MODE;
3298 /* Builds and returns function declaration with NAME and TYPE. */
3301 build_fn_decl (const char *name, tree type)
3303 tree id = get_identifier (name);
3304 tree decl = build_decl (FUNCTION_DECL, id, type);
3306 DECL_EXTERNAL (decl) = 1;
3307 TREE_PUBLIC (decl) = 1;
3308 DECL_ARTIFICIAL (decl) = 1;
3309 TREE_NOTHROW (decl) = 1;
3315 /* BLOCK nodes are used to represent the structure of binding contours
3316 and declarations, once those contours have been exited and their contents
3317 compiled. This information is used for outputting debugging info. */
3320 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3322 tree block = make_node (BLOCK);
3324 BLOCK_VARS (block) = vars;
3325 BLOCK_SUBBLOCKS (block) = subblocks;
3326 BLOCK_SUPERCONTEXT (block) = supercontext;
3327 BLOCK_CHAIN (block) = chain;
3331 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3332 /* ??? gengtype doesn't handle conditionals */
3333 static GTY(()) source_locus last_annotated_node;
3336 #ifdef USE_MAPPED_LOCATION
3339 expand_location (source_location loc)
3341 expanded_location xloc;
3350 const struct line_map *map = linemap_lookup (&line_table, loc);
3351 xloc.file = map->to_file;
3352 xloc.line = SOURCE_LINE (map, loc);
3353 xloc.column = SOURCE_COLUMN (map, loc);
3360 /* Record the exact location where an expression or an identifier were
3364 annotate_with_file_line (tree node, const char *file, int line)
3366 /* Roughly one percent of the calls to this function are to annotate
3367 a node with the same information already attached to that node!
3368 Just return instead of wasting memory. */
3369 if (EXPR_LOCUS (node)
3370 && EXPR_LINENO (node) == line
3371 && (EXPR_FILENAME (node) == file
3372 || !strcmp (EXPR_FILENAME (node), file)))
3374 last_annotated_node = EXPR_LOCUS (node);
3378 /* In heavily macroized code (such as GCC itself) this single
3379 entry cache can reduce the number of allocations by more
3381 if (last_annotated_node
3382 && last_annotated_node->line == line
3383 && (last_annotated_node->file == file
3384 || !strcmp (last_annotated_node->file, file)))
3386 SET_EXPR_LOCUS (node, last_annotated_node);
3390 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3391 EXPR_LINENO (node) = line;
3392 EXPR_FILENAME (node) = file;
3393 last_annotated_node = EXPR_LOCUS (node);
3397 annotate_with_locus (tree node, location_t locus)
3399 annotate_with_file_line (node, locus.file, locus.line);
3403 /* Source location accessor functions. */
3406 /* The source location of this expression. Non-tree_exp nodes such as
3407 decls and constants can be shared among multiple locations, so
3410 expr_location (tree node)
3412 #ifdef USE_MAPPED_LOCATION
3413 if (GIMPLE_STMT_P (node))
3414 return GIMPLE_STMT_LOCUS (node);
3415 return EXPR_P (node) ? node->exp.locus : UNKNOWN_LOCATION;
3417 if (GIMPLE_STMT_P (node))
3418 return EXPR_HAS_LOCATION (node)
3419 ? *GIMPLE_STMT_LOCUS (node) : UNKNOWN_LOCATION;
3420 return EXPR_HAS_LOCATION (node) ? *node->exp.locus : UNKNOWN_LOCATION;
3425 set_expr_location (tree node, location_t locus)
3427 #ifdef USE_MAPPED_LOCATION
3428 if (GIMPLE_STMT_P (node))
3429 GIMPLE_STMT_LOCUS (node) = locus;
3431 EXPR_CHECK (node)->exp.locus = locus;
3433 annotate_with_locus (node, locus);
3438 expr_has_location (tree node)
3440 #ifdef USE_MAPPED_LOCATION
3441 return expr_location (node) != UNKNOWN_LOCATION;
3443 return expr_locus (node) != NULL;
3447 #ifdef USE_MAPPED_LOCATION
3452 expr_locus (tree node)
3454 #ifdef USE_MAPPED_LOCATION
3455 if (GIMPLE_STMT_P (node))
3456 return &GIMPLE_STMT_LOCUS (node);
3457 return EXPR_P (node) ? &node->exp.locus : (location_t *) NULL;
3459 if (GIMPLE_STMT_P (node))
3460 return GIMPLE_STMT_LOCUS (node);
3461 /* ?? The cast below was originally "(location_t *)" in the macro,
3462 but that makes no sense. ?? */
3463 return EXPR_P (node) ? node->exp.locus : (source_locus) NULL;
3468 set_expr_locus (tree node,
3469 #ifdef USE_MAPPED_LOCATION
3470 source_location *loc
3476 #ifdef USE_MAPPED_LOCATION
3479 if (GIMPLE_STMT_P (node))
3480 GIMPLE_STMT_LOCUS (node) = UNKNOWN_LOCATION;
3482 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3486 if (GIMPLE_STMT_P (node))
3487 GIMPLE_STMT_LOCUS (node) = *loc;
3489 EXPR_CHECK (node)->exp.locus = *loc;
3492 if (GIMPLE_STMT_P (node))
3493 GIMPLE_STMT_LOCUS (node) = loc;
3495 EXPR_CHECK (node)->exp.locus = loc;
3500 expr_filename (tree node)
3502 #ifdef USE_MAPPED_LOCATION
3503 if (GIMPLE_STMT_P (node))
3504 return &LOCATION_FILE (GIMPLE_STMT_LOCUS (node));
3505 return &LOCATION_FILE (EXPR_CHECK (node)->exp.locus);
3507 if (GIMPLE_STMT_P (node))
3508 return &GIMPLE_STMT_LOCUS (node)->file;
3509 return &(EXPR_CHECK (node)->exp.locus->file);
3514 expr_lineno (tree node)
3516 #ifdef USE_MAPPED_LOCATION
3517 if (GIMPLE_STMT_P (node))
3518 return &LOCATION_LINE (GIMPLE_STMT_LOCUS (node));
3519 return &LOCATION_LINE (EXPR_CHECK (node)->exp.locus);
3521 if (GIMPLE_STMT_P (node))
3522 return &GIMPLE_STMT_LOCUS (node)->line;
3523 return &EXPR_CHECK (node)->exp.locus->line;
3527 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3531 build_decl_attribute_variant (tree ddecl, tree attribute)
3533 DECL_ATTRIBUTES (ddecl) = attribute;
3537 /* Borrowed from hashtab.c iterative_hash implementation. */
3538 #define mix(a,b,c) \
3540 a -= b; a -= c; a ^= (c>>13); \
3541 b -= c; b -= a; b ^= (a<< 8); \
3542 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3543 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3544 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3545 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3546 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3547 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3548 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3552 /* Produce good hash value combining VAL and VAL2. */
3553 static inline hashval_t
3554 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3556 /* the golden ratio; an arbitrary value. */
3557 hashval_t a = 0x9e3779b9;
3563 /* Produce good hash value combining PTR and VAL2. */
3564 static inline hashval_t
3565 iterative_hash_pointer (void *ptr, hashval_t val2)
3567 if (sizeof (ptr) == sizeof (hashval_t))
3568 return iterative_hash_hashval_t ((size_t) ptr, val2);
3571 hashval_t a = (hashval_t) (size_t) ptr;
3572 /* Avoid warnings about shifting of more than the width of the type on
3573 hosts that won't execute this path. */
3575 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3581 /* Produce good hash value combining VAL and VAL2. */
3582 static inline hashval_t
3583 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3585 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3586 return iterative_hash_hashval_t (val, val2);
3589 hashval_t a = (hashval_t) val;
3590 /* Avoid warnings about shifting of more than the width of the type on
3591 hosts that won't execute this path. */
3593 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3595 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3597 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3598 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3605 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3606 is ATTRIBUTE and its qualifiers are QUALS.
3608 Record such modified types already made so we don't make duplicates. */
3611 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3613 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3615 hashval_t hashcode = 0;
3617 enum tree_code code = TREE_CODE (ttype);
3619 ntype = copy_node (ttype);
3621 TYPE_POINTER_TO (ntype) = 0;
3622 TYPE_REFERENCE_TO (ntype) = 0;
3623 TYPE_ATTRIBUTES (ntype) = attribute;
3625 if (TYPE_STRUCTURAL_EQUALITY_P (ttype))
3626 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3628 TYPE_CANONICAL (ntype)
3629 = build_qualified_type (TYPE_CANONICAL (ttype), quals);
3631 /* Create a new main variant of TYPE. */
3632 TYPE_MAIN_VARIANT (ntype) = ntype;
3633 TYPE_NEXT_VARIANT (ntype) = 0;
3634 set_type_quals (ntype, TYPE_UNQUALIFIED);
3636 hashcode = iterative_hash_object (code, hashcode);
3637 if (TREE_TYPE (ntype))
3638 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3640 hashcode = attribute_hash_list (attribute, hashcode);
3642 switch (TREE_CODE (ntype))
3645 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3648 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3652 hashcode = iterative_hash_object
3653 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3654 hashcode = iterative_hash_object
3655 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3659 unsigned int precision = TYPE_PRECISION (ntype);
3660 hashcode = iterative_hash_object (precision, hashcode);
3667 ntype = type_hash_canon (hashcode, ntype);
3669 /* If the target-dependent attributes make NTYPE different from
3670 its canonical type, we will need to use structural equality
3671 checks for this qualified type. */
3672 if (!targetm.comp_type_attributes (ntype, ttype))
3673 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3675 ttype = build_qualified_type (ntype, quals);
3682 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3685 Record such modified types already made so we don't make duplicates. */
3688 build_type_attribute_variant (tree ttype, tree attribute)
3690 return build_type_attribute_qual_variant (ttype, attribute,
3691 TYPE_QUALS (ttype));
3694 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3697 We try both `text' and `__text__', ATTR may be either one. */
3698 /* ??? It might be a reasonable simplification to require ATTR to be only
3699 `text'. One might then also require attribute lists to be stored in
3700 their canonicalized form. */
3703 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3708 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3711 p = IDENTIFIER_POINTER (ident);
3712 ident_len = IDENTIFIER_LENGTH (ident);
3714 if (ident_len == attr_len
3715 && strcmp (attr, p) == 0)
3718 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3721 gcc_assert (attr[1] == '_');
3722 gcc_assert (attr[attr_len - 2] == '_');
3723 gcc_assert (attr[attr_len - 1] == '_');
3724 if (ident_len == attr_len - 4
3725 && strncmp (attr + 2, p, attr_len - 4) == 0)
3730 if (ident_len == attr_len + 4
3731 && p[0] == '_' && p[1] == '_'
3732 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3733 && strncmp (attr, p + 2, attr_len) == 0)
3740 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3743 We try both `text' and `__text__', ATTR may be either one. */
3746 is_attribute_p (const char *attr, tree ident)
3748 return is_attribute_with_length_p (attr, strlen (attr), ident);
3751 /* Given an attribute name and a list of attributes, return a pointer to the
3752 attribute's list element if the attribute is part of the list, or NULL_TREE
3753 if not found. If the attribute appears more than once, this only
3754 returns the first occurrence; the TREE_CHAIN of the return value should
3755 be passed back in if further occurrences are wanted. */
3758 lookup_attribute (const char *attr_name, tree list)
3761 size_t attr_len = strlen (attr_name);
3763 for (l = list; l; l = TREE_CHAIN (l))
3765 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3766 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3773 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3777 remove_attribute (const char *attr_name, tree list)
3780 size_t attr_len = strlen (attr_name);
3782 for (p = &list; *p; )
3785 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3786 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3787 *p = TREE_CHAIN (l);
3789 p = &TREE_CHAIN (l);
3795 /* Return an attribute list that is the union of a1 and a2. */
3798 merge_attributes (tree a1, tree a2)
3802 /* Either one unset? Take the set one. */
3804 if ((attributes = a1) == 0)
3807 /* One that completely contains the other? Take it. */
3809 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3811 if (attribute_list_contained (a2, a1))
3815 /* Pick the longest list, and hang on the other list. */
3817 if (list_length (a1) < list_length (a2))
3818 attributes = a2, a2 = a1;
3820 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3823 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3826 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3829 if (TREE_VALUE (a) != NULL
3830 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3831 && TREE_VALUE (a2) != NULL
3832 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3834 if (simple_cst_list_equal (TREE_VALUE (a),
3835 TREE_VALUE (a2)) == 1)
3838 else if (simple_cst_equal (TREE_VALUE (a),
3839 TREE_VALUE (a2)) == 1)
3844 a1 = copy_node (a2);
3845 TREE_CHAIN (a1) = attributes;
3854 /* Given types T1 and T2, merge their attributes and return
3858 merge_type_attributes (tree t1, tree t2)
3860 return merge_attributes (TYPE_ATTRIBUTES (t1),
3861 TYPE_ATTRIBUTES (t2));
3864 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3868 merge_decl_attributes (tree olddecl, tree newdecl)
3870 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3871 DECL_ATTRIBUTES (newdecl));
3874 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3876 /* Specialization of merge_decl_attributes for various Windows targets.
3878 This handles the following situation:
3880 __declspec (dllimport) int foo;
3883 The second instance of `foo' nullifies the dllimport. */
3886 merge_dllimport_decl_attributes (tree old, tree new)
3889 int delete_dllimport_p = 1;
3891 /* What we need to do here is remove from `old' dllimport if it doesn't
3892 appear in `new'. dllimport behaves like extern: if a declaration is
3893 marked dllimport and a definition appears later, then the object
3894 is not dllimport'd. We also remove a `new' dllimport if the old list
3895 contains dllexport: dllexport always overrides dllimport, regardless
3896 of the order of declaration. */
3897 if (!VAR_OR_FUNCTION_DECL_P (new))
3898 delete_dllimport_p = 0;
3899 else if (DECL_DLLIMPORT_P (new)
3900 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3902 DECL_DLLIMPORT_P (new) = 0;
3903 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3904 "dllimport ignored", new);
3906 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3908 /* Warn about overriding a symbol that has already been used. eg:
3909 extern int __attribute__ ((dllimport)) foo;
3910 int* bar () {return &foo;}
3913 if (TREE_USED (old))
3915 warning (0, "%q+D redeclared without dllimport attribute "
3916 "after being referenced with dll linkage", new);
3917 /* If we have used a variable's address with dllimport linkage,
3918 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3919 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3921 We still remove the attribute so that assembler code refers
3922 to '&foo rather than '_imp__foo'. */
3923 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3924 DECL_DLLIMPORT_P (new) = 1;
3927 /* Let an inline definition silently override the external reference,
3928 but otherwise warn about attribute inconsistency. */
3929 else if (TREE_CODE (new) == VAR_DECL
3930 || !DECL_DECLARED_INLINE_P (new))
3931 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3932 "previous dllimport ignored", new);
3935 delete_dllimport_p = 0;
3937 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3939 if (delete_dllimport_p)
3942 const size_t attr_len = strlen ("dllimport");
3944 /* Scan the list for dllimport and delete it. */
3945 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3947 if (is_attribute_with_length_p ("dllimport", attr_len,
3950 if (prev == NULL_TREE)
3953 TREE_CHAIN (prev) = TREE_CHAIN (t);
3962 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3963 struct attribute_spec.handler. */
3966 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3971 /* These attributes may apply to structure and union types being created,
3972 but otherwise should pass to the declaration involved. */
3975 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3976 | (int) ATTR_FLAG_ARRAY_NEXT))
3978 *no_add_attrs = true;
3979 return tree_cons (name, args, NULL_TREE);
3981 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3983 warning (OPT_Wattributes, "%qs attribute ignored",
3984 IDENTIFIER_POINTER (name));
3985 *no_add_attrs = true;
3991 if (TREE_CODE (node) != FUNCTION_DECL
3992 && TREE_CODE (node) != VAR_DECL)
3994 *no_add_attrs = true;
3995 warning (OPT_Wattributes, "%qs attribute ignored",
3996 IDENTIFIER_POINTER (name));
4000 /* Report error on dllimport ambiguities seen now before they cause
4002 else if (is_attribute_p ("dllimport", name))
4004 /* Honor any target-specific overrides. */
4005 if (!targetm.valid_dllimport_attribute_p (node))
4006 *no_add_attrs = true;
4008 else if (TREE_CODE (node) == FUNCTION_DECL
4009 && DECL_DECLARED_INLINE_P (node))
4011 warning (OPT_Wattributes, "inline function %q+D declared as "
4012 " dllimport: attribute ignored", node);
4013 *no_add_attrs = true;
4015 /* Like MS, treat definition of dllimported variables and
4016 non-inlined functions on declaration as syntax errors. */
4017 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4019 error ("function %q+D definition is marked dllimport", node);
4020 *no_add_attrs = true;
4023 else if (TREE_CODE (node) == VAR_DECL)
4025 if (DECL_INITIAL (node))
4027 error ("variable %q+D definition is marked dllimport",
4029 *no_add_attrs = true;
4032 /* `extern' needn't be specified with dllimport.
4033 Specify `extern' now and hope for the best. Sigh. */
4034 DECL_EXTERNAL (node) = 1;
4035 /* Also, implicitly give dllimport'd variables declared within
4036 a function global scope, unless declared static. */
4037 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4038 TREE_PUBLIC (node) = 1;
4041 if (*no_add_attrs == false)
4042 DECL_DLLIMPORT_P (node) = 1;
4045 /* Report error if symbol is not accessible at global scope. */
4046 if (!TREE_PUBLIC (node)
4047 && (TREE_CODE (node) == VAR_DECL
4048 || TREE_CODE (node) == FUNCTION_DECL))
4050 error ("external linkage required for symbol %q+D because of "
4051 "%qs attribute", node, IDENTIFIER_POINTER (name));
4052 *no_add_attrs = true;
4058 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4060 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4061 of the various TYPE_QUAL values. */
4064 set_type_quals (tree type, int type_quals)
4066 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4067 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4068 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4071 /* Returns true iff cand is equivalent to base with type_quals. */
4074 check_qualified_type (tree cand, tree base, int type_quals)
4076 return (TYPE_QUALS (cand) == type_quals
4077 && TYPE_NAME (cand) == TYPE_NAME (base)
4078 /* Apparently this is needed for Objective-C. */
4079 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4080 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4081 TYPE_ATTRIBUTES (base)));
4084 /* Return a version of the TYPE, qualified as indicated by the
4085 TYPE_QUALS, if one exists. If no qualified version exists yet,
4086 return NULL_TREE. */
4089 get_qualified_type (tree type, int type_quals)
4093 if (TYPE_QUALS (type) == type_quals)
4096 /* Search the chain of variants to see if there is already one there just
4097 like the one we need to have. If so, use that existing one. We must
4098 preserve the TYPE_NAME, since there is code that depends on this. */
4099 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4100 if (check_qualified_type (t, type, type_quals))
4106 /* Like get_qualified_type, but creates the type if it does not
4107 exist. This function never returns NULL_TREE. */
4110 build_qualified_type (tree type, int type_quals)
4114 /* See if we already have the appropriate qualified variant. */
4115 t = get_qualified_type (type, type_quals);
4117 /* If not, build it. */
4120 t = build_variant_type_copy (type);
4121 set_type_quals (t, type_quals);
4123 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4124 /* Propagate structural equality. */
4125 SET_TYPE_STRUCTURAL_EQUALITY (t);
4126 else if (TYPE_CANONICAL (type) != type)
4127 /* Build the underlying canonical type, since it is different
4129 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4132 /* T is its own canonical type. */
4133 TYPE_CANONICAL (t) = t;
4140 /* Create a new distinct copy of TYPE. The new type is made its own
4141 MAIN_VARIANT. If TYPE requires structural equality checks, the
4142 resulting type requires structural equality checks; otherwise, its
4143 TYPE_CANONICAL points to itself. */
4146 build_distinct_type_copy (tree type)
4148 tree t = copy_node (type);
4150 TYPE_POINTER_TO (t) = 0;
4151 TYPE_REFERENCE_TO (t) = 0;
4153 /* Set the canonical type either to a new equivalence class, or
4154 propagate the need for structural equality checks. */
4155 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4156 SET_TYPE_STRUCTURAL_EQUALITY (t);
4158 TYPE_CANONICAL (t) = t;
4160 /* Make it its own variant. */
4161 TYPE_MAIN_VARIANT (t) = t;
4162 TYPE_NEXT_VARIANT (t) = 0;
4167 /* Create a new variant of TYPE, equivalent but distinct. This is so
4168 the caller can modify it. TYPE_CANONICAL for the return type will
4169 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4170 are considered equal by the language itself (or that both types
4171 require structural equality checks). */
4174 build_variant_type_copy (tree type)
4176 tree t, m = TYPE_MAIN_VARIANT (type);
4178 t = build_distinct_type_copy (type);
4180 /* Since we're building a variant, assume that it is a non-semantic
4181 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4182 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4184 /* Add the new type to the chain of variants of TYPE. */
4185 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4186 TYPE_NEXT_VARIANT (m) = t;
4187 TYPE_MAIN_VARIANT (t) = m;
4192 /* Return true if the from tree in both tree maps are equal. */
4195 tree_map_base_eq (const void *va, const void *vb)
4197 const struct tree_map_base *a = va, *b = vb;
4198 return (a->from == b->from);
4201 /* Hash a from tree in a tree_map. */
4204 tree_map_base_hash (const void *item)
4206 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4209 /* Return true if this tree map structure is marked for garbage collection
4210 purposes. We simply return true if the from tree is marked, so that this
4211 structure goes away when the from tree goes away. */
4214 tree_map_base_marked_p (const void *p)
4216 return ggc_marked_p (((struct tree_map_base *) p)->from);
4220 tree_map_hash (const void *item)
4222 return (((const struct tree_map *) item)->hash);
4225 /* Return the initialization priority for DECL. */
4228 decl_init_priority_lookup (tree decl)
4230 struct tree_priority_map *h;
4231 struct tree_map_base in;
4233 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4234 gcc_assert (TREE_CODE (decl) == VAR_DECL
4235 ? DECL_HAS_INIT_PRIORITY_P (decl)
4236 : DECL_STATIC_CONSTRUCTOR (decl));
4238 h = htab_find (init_priority_for_decl, &in);
4239 return h ? h->init : DEFAULT_INIT_PRIORITY;
4242 /* Return the finalization priority for DECL. */
4245 decl_fini_priority_lookup (tree decl)
4247 struct tree_priority_map *h;
4248 struct tree_map_base in;
4250 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4251 gcc_assert (DECL_STATIC_DESTRUCTOR (decl));
4253 h = htab_find (init_priority_for_decl, &in);
4254 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4257 /* Return the initialization and finalization priority information for
4258 DECL. If there is no previous priority information, a freshly
4259 allocated structure is returned. */
4261 static struct tree_priority_map *
4262 decl_priority_info (tree decl)
4264 struct tree_priority_map in;
4265 struct tree_priority_map *h;
4268 in.base.from = decl;
4269 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4273 h = GGC_CNEW (struct tree_priority_map);
4275 h->base.from = decl;
4276 h->init = DEFAULT_INIT_PRIORITY;
4277 h->fini = DEFAULT_INIT_PRIORITY;
4283 /* Set the initialization priority for DECL to PRIORITY. */
4286 decl_init_priority_insert (tree decl, priority_type priority)
4288 struct tree_priority_map *h;
4290 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4291 h = decl_priority_info (decl);
4295 /* Set the finalization priority for DECL to PRIORITY. */
4298 decl_fini_priority_insert (tree decl, priority_type priority)
4300 struct tree_priority_map *h;
4302 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4303 h = decl_priority_info (decl);
4307 /* Look up a restrict qualified base decl for FROM. */
4310 decl_restrict_base_lookup (tree from)
4315 in.base.from = from;
4316 h = htab_find_with_hash (restrict_base_for_decl, &in,
4317 htab_hash_pointer (from));
4318 return h ? h->to : NULL_TREE;
4321 /* Record the restrict qualified base TO for FROM. */
4324 decl_restrict_base_insert (tree from, tree to)
4329 h = ggc_alloc (sizeof (struct tree_map));
4330 h->hash = htab_hash_pointer (from);
4331 h->base.from = from;
4333 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4334 *(struct tree_map **) loc = h;
4337 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4340 print_debug_expr_statistics (void)
4342 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4343 (long) htab_size (debug_expr_for_decl),
4344 (long) htab_elements (debug_expr_for_decl),
4345 htab_collisions (debug_expr_for_decl));
4348 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4351 print_value_expr_statistics (void)
4353 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4354 (long) htab_size (value_expr_for_decl),
4355 (long) htab_elements (value_expr_for_decl),
4356 htab_collisions (value_expr_for_decl));
4359 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4360 don't print anything if the table is empty. */
4363 print_restrict_base_statistics (void)
4365 if (htab_elements (restrict_base_for_decl) != 0)
4367 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4368 (long) htab_size (restrict_base_for_decl),
4369 (long) htab_elements (restrict_base_for_decl),
4370 htab_collisions (restrict_base_for_decl));
4373 /* Lookup a debug expression for FROM, and return it if we find one. */
4376 decl_debug_expr_lookup (tree from)
4378 struct tree_map *h, in;
4379 in.base.from = from;
4381 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4387 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4390 decl_debug_expr_insert (tree from, tree to)
4395 h = ggc_alloc (sizeof (struct tree_map));
4396 h->hash = htab_hash_pointer (from);
4397 h->base.from = from;
4399 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4400 *(struct tree_map **) loc = h;
4403 /* Lookup a value expression for FROM, and return it if we find one. */
4406 decl_value_expr_lookup (tree from)
4408 struct tree_map *h, in;
4409 in.base.from = from;
4411 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4417 /* Insert a mapping FROM->TO in the value expression hashtable. */
4420 decl_value_expr_insert (tree from, tree to)
4425 h = ggc_alloc (sizeof (struct tree_map));
4426 h->hash = htab_hash_pointer (from);
4427 h->base.from = from;
4429 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4430 *(struct tree_map **) loc = h;
4433 /* Hashing of types so that we don't make duplicates.
4434 The entry point is `type_hash_canon'. */
4436 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4437 with types in the TREE_VALUE slots), by adding the hash codes
4438 of the individual types. */
4441 type_hash_list (tree list, hashval_t hashcode)
4445 for (tail = list; tail; tail = TREE_CHAIN (tail))
4446 if (TREE_VALUE (tail) != error_mark_node)
4447 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4453 /* These are the Hashtable callback functions. */
4455 /* Returns true iff the types are equivalent. */
4458 type_hash_eq (const void *va, const void *vb)
4460 const struct type_hash *a = va, *b = vb;
4462 /* First test the things that are the same for all types. */
4463 if (a->hash != b->hash
4464 || TREE_CODE (a->type) != TREE_CODE (b->type)
4465 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4466 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4467 TYPE_ATTRIBUTES (b->type))
4468 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4469 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4472 switch (TREE_CODE (a->type))
4477 case REFERENCE_TYPE:
4481 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4484 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4485 && !(TYPE_VALUES (a->type)
4486 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4487 && TYPE_VALUES (b->type)
4488 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4489 && type_list_equal (TYPE_VALUES (a->type),
4490 TYPE_VALUES (b->type))))
4493 /* ... fall through ... */
4498 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4499 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4500 TYPE_MAX_VALUE (b->type)))
4501 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4502 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4503 TYPE_MIN_VALUE (b->type))));
4506 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4509 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4510 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4511 || (TYPE_ARG_TYPES (a->type)
4512 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4513 && TYPE_ARG_TYPES (b->type)
4514 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4515 && type_list_equal (TYPE_ARG_TYPES (a->type),
4516 TYPE_ARG_TYPES (b->type)))));
4519 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4523 case QUAL_UNION_TYPE:
4524 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4525 || (TYPE_FIELDS (a->type)
4526 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4527 && TYPE_FIELDS (b->type)
4528 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4529 && type_list_equal (TYPE_FIELDS (a->type),
4530 TYPE_FIELDS (b->type))));
4533 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4534 || (TYPE_ARG_TYPES (a->type)
4535 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4536 && TYPE_ARG_TYPES (b->type)
4537 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4538 && type_list_equal (TYPE_ARG_TYPES (a->type),
4539 TYPE_ARG_TYPES (b->type))));
4546 /* Return the cached hash value. */
4549 type_hash_hash (const void *item)
4551 return ((const struct type_hash *) item)->hash;
4554 /* Look in the type hash table for a type isomorphic to TYPE.
4555 If one is found, return it. Otherwise return 0. */
4558 type_hash_lookup (hashval_t hashcode, tree type)
4560 struct type_hash *h, in;
4562 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4563 must call that routine before comparing TYPE_ALIGNs. */
4569 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4575 /* Add an entry to the type-hash-table
4576 for a type TYPE whose hash code is HASHCODE. */
4579 type_hash_add (hashval_t hashcode, tree type)
4581 struct type_hash *h;
4584 h = ggc_alloc (sizeof (struct type_hash));
4587 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4588 *(struct type_hash **) loc = h;
4591 /* Given TYPE, and HASHCODE its hash code, return the canonical
4592 object for an identical type if one already exists.
4593 Otherwise, return TYPE, and record it as the canonical object.
4595 To use this function, first create a type of the sort you want.
4596 Then compute its hash code from the fields of the type that
4597 make it different from other similar types.
4598 Then call this function and use the value. */
4601 type_hash_canon (unsigned int hashcode, tree type)
4605 /* The hash table only contains main variants, so ensure that's what we're
4607 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4609 if (!lang_hooks.types.hash_types)
4612 /* See if the type is in the hash table already. If so, return it.
4613 Otherwise, add the type. */
4614 t1 = type_hash_lookup (hashcode, type);
4617 #ifdef GATHER_STATISTICS
4618 tree_node_counts[(int) t_kind]--;
4619 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4625 type_hash_add (hashcode, type);
4630 /* See if the data pointed to by the type hash table is marked. We consider
4631 it marked if the type is marked or if a debug type number or symbol
4632 table entry has been made for the type. This reduces the amount of
4633 debugging output and eliminates that dependency of the debug output on
4634 the number of garbage collections. */
4637 type_hash_marked_p (const void *p)
4639 tree type = ((struct type_hash *) p)->type;
4641 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4645 print_type_hash_statistics (void)
4647 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4648 (long) htab_size (type_hash_table),
4649 (long) htab_elements (type_hash_table),
4650 htab_collisions (type_hash_table));
4653 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4654 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4655 by adding the hash codes of the individual attributes. */
4658 attribute_hash_list (tree list, hashval_t hashcode)
4662 for (tail = list; tail; tail = TREE_CHAIN (tail))
4663 /* ??? Do we want to add in TREE_VALUE too? */
4664 hashcode = iterative_hash_object
4665 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4669 /* Given two lists of attributes, return true if list l2 is
4670 equivalent to l1. */
4673 attribute_list_equal (tree l1, tree l2)
4675 return attribute_list_contained (l1, l2)
4676 && attribute_list_contained (l2, l1);
4679 /* Given two lists of attributes, return true if list L2 is
4680 completely contained within L1. */
4681 /* ??? This would be faster if attribute names were stored in a canonicalized
4682 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4683 must be used to show these elements are equivalent (which they are). */
4684 /* ??? It's not clear that attributes with arguments will always be handled
4688 attribute_list_contained (tree l1, tree l2)
4692 /* First check the obvious, maybe the lists are identical. */
4696 /* Maybe the lists are similar. */
4697 for (t1 = l1, t2 = l2;
4699 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4700 && TREE_VALUE (t1) == TREE_VALUE (t2);
4701 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4703 /* Maybe the lists are equal. */
4704 if (t1 == 0 && t2 == 0)
4707 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4710 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4712 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4715 if (TREE_VALUE (t2) != NULL
4716 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4717 && TREE_VALUE (attr) != NULL
4718 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4720 if (simple_cst_list_equal (TREE_VALUE (t2),
4721 TREE_VALUE (attr)) == 1)
4724 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4735 /* Given two lists of types
4736 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4737 return 1 if the lists contain the same types in the same order.
4738 Also, the TREE_PURPOSEs must match. */
4741 type_list_equal (tree l1, tree l2)
4745 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4746 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4747 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4748 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4749 && (TREE_TYPE (TREE_PURPOSE (t1))
4750 == TREE_TYPE (TREE_PURPOSE (t2))))))
4756 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4757 given by TYPE. If the argument list accepts variable arguments,
4758 then this function counts only the ordinary arguments. */
4761 type_num_arguments (tree type)
4766 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4767 /* If the function does not take a variable number of arguments,
4768 the last element in the list will have type `void'. */
4769 if (VOID_TYPE_P (TREE_VALUE (t)))
4777 /* Nonzero if integer constants T1 and T2
4778 represent the same constant value. */
4781 tree_int_cst_equal (tree t1, tree t2)
4786 if (t1 == 0 || t2 == 0)
4789 if (TREE_CODE (t1) == INTEGER_CST
4790 && TREE_CODE (t2) == INTEGER_CST
4791 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4792 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4798 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4799 The precise way of comparison depends on their data type. */
4802 tree_int_cst_lt (tree t1, tree t2)
4807 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4809 int t1_sgn = tree_int_cst_sgn (t1);
4810 int t2_sgn = tree_int_cst_sgn (t2);
4812 if (t1_sgn < t2_sgn)
4814 else if (t1_sgn > t2_sgn)
4816 /* Otherwise, both are non-negative, so we compare them as
4817 unsigned just in case one of them would overflow a signed
4820 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4821 return INT_CST_LT (t1, t2);
4823 return INT_CST_LT_UNSIGNED (t1, t2);
4826 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4829 tree_int_cst_compare (tree t1, tree t2)
4831 if (tree_int_cst_lt (t1, t2))
4833 else if (tree_int_cst_lt (t2, t1))
4839 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4840 the host. If POS is zero, the value can be represented in a single
4841 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4842 be represented in a single unsigned HOST_WIDE_INT. */
4845 host_integerp (tree t, int pos)
4847 return (TREE_CODE (t) == INTEGER_CST
4848 && ((TREE_INT_CST_HIGH (t) == 0
4849 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4850 || (! pos && TREE_INT_CST_HIGH (t) == -1
4851 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4852 && !TYPE_UNSIGNED (TREE_TYPE (t)))
4853 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4856 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4857 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4858 be non-negative. We must be able to satisfy the above conditions. */
4861 tree_low_cst (tree t, int pos)
4863 gcc_assert (host_integerp (t, pos));
4864 return TREE_INT_CST_LOW (t);
4867 /* Return the most significant bit of the integer constant T. */
4870 tree_int_cst_msb (tree t)
4874 unsigned HOST_WIDE_INT l;
4876 /* Note that using TYPE_PRECISION here is wrong. We care about the
4877 actual bits, not the (arbitrary) range of the type. */
4878 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4879 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4880 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4881 return (l & 1) == 1;
4884 /* Return an indication of the sign of the integer constant T.
4885 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4886 Note that -1 will never be returned if T's type is unsigned. */
4889 tree_int_cst_sgn (tree t)
4891 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4893 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4895 else if (TREE_INT_CST_HIGH (t) < 0)
4901 /* Compare two constructor-element-type constants. Return 1 if the lists
4902 are known to be equal; otherwise return 0. */
4905 simple_cst_list_equal (tree l1, tree l2)
4907 while (l1 != NULL_TREE && l2 != NULL_TREE)
4909 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4912 l1 = TREE_CHAIN (l1);
4913 l2 = TREE_CHAIN (l2);
4919 /* Return truthvalue of whether T1 is the same tree structure as T2.
4920 Return 1 if they are the same.
4921 Return 0 if they are understandably different.
4922 Return -1 if either contains tree structure not understood by
4926 simple_cst_equal (tree t1, tree t2)
4928 enum tree_code code1, code2;
4934 if (t1 == 0 || t2 == 0)
4937 code1 = TREE_CODE (t1);
4938 code2 = TREE_CODE (t2);
4940 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4942 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4943 || code2 == NON_LVALUE_EXPR)
4944 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4946 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4949 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4950 || code2 == NON_LVALUE_EXPR)
4951 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4959 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4960 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4963 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4966 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4967 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4968 TREE_STRING_LENGTH (t1)));
4972 unsigned HOST_WIDE_INT idx;
4973 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4974 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4976 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4979 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4980 /* ??? Should we handle also fields here? */
4981 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4982 VEC_index (constructor_elt, v2, idx)->value))
4988 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4991 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
4994 if (call_expr_nargs (t1) != call_expr_nargs (t2))
4998 call_expr_arg_iterator iter1, iter2;
4999 for (arg1 = first_call_expr_arg (t1, &iter1),
5000 arg2 = first_call_expr_arg (t2, &iter2);
5002 arg1 = next_call_expr_arg (&iter1),
5003 arg2 = next_call_expr_arg (&iter2))
5005 cmp = simple_cst_equal (arg1, arg2);
5009 return arg1 == arg2;
5013 /* Special case: if either target is an unallocated VAR_DECL,
5014 it means that it's going to be unified with whatever the
5015 TARGET_EXPR is really supposed to initialize, so treat it
5016 as being equivalent to anything. */
5017 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5018 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5019 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5020 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5021 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5022 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5025 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5030 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5032 case WITH_CLEANUP_EXPR:
5033 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5037 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5040 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5041 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5055 /* This general rule works for most tree codes. All exceptions should be
5056 handled above. If this is a language-specific tree code, we can't
5057 trust what might be in the operand, so say we don't know
5059 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5062 switch (TREE_CODE_CLASS (code1))
5066 case tcc_comparison:
5067 case tcc_expression:
5071 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5073 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5085 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5086 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5087 than U, respectively. */
5090 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
5092 if (tree_int_cst_sgn (t) < 0)
5094 else if (TREE_INT_CST_HIGH (t) != 0)
5096 else if (TREE_INT_CST_LOW (t) == u)
5098 else if (TREE_INT_CST_LOW (t) < u)
5104 /* Return true if CODE represents an associative tree code. Otherwise
5107 associative_tree_code (enum tree_code code)
5126 /* Return true if CODE represents a commutative tree code. Otherwise
5129 commutative_tree_code (enum tree_code code)
5142 case UNORDERED_EXPR:
5146 case TRUTH_AND_EXPR:
5147 case TRUTH_XOR_EXPR:
5157 /* Generate a hash value for an expression. This can be used iteratively
5158 by passing a previous result as the "val" argument.
5160 This function is intended to produce the same hash for expressions which
5161 would compare equal using operand_equal_p. */
5164 iterative_hash_expr (tree t, hashval_t val)
5167 enum tree_code code;
5171 return iterative_hash_pointer (t, val);
5173 code = TREE_CODE (t);
5177 /* Alas, constants aren't shared, so we can't rely on pointer
5180 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5181 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5184 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5186 return iterative_hash_hashval_t (val2, val);
5189 return iterative_hash (TREE_STRING_POINTER (t),
5190 TREE_STRING_LENGTH (t), val);
5192 val = iterative_hash_expr (TREE_REALPART (t), val);
5193 return iterative_hash_expr (TREE_IMAGPART (t), val);
5195 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5199 /* we can just compare by pointer. */
5200 return iterative_hash_pointer (t, val);
5203 /* A list of expressions, for a CALL_EXPR or as the elements of a
5205 for (; t; t = TREE_CHAIN (t))
5206 val = iterative_hash_expr (TREE_VALUE (t), val);
5210 unsigned HOST_WIDE_INT idx;
5212 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5214 val = iterative_hash_expr (field, val);
5215 val = iterative_hash_expr (value, val);
5220 /* When referring to a built-in FUNCTION_DECL, use the
5221 __builtin__ form. Otherwise nodes that compare equal
5222 according to operand_equal_p might get different
5224 if (DECL_BUILT_IN (t))
5226 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5230 /* else FALL THROUGH */
5232 class = TREE_CODE_CLASS (code);
5234 if (class == tcc_declaration)
5236 /* DECL's have a unique ID */
5237 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5241 gcc_assert (IS_EXPR_CODE_CLASS (class));
5243 val = iterative_hash_object (code, val);
5245 /* Don't hash the type, that can lead to having nodes which
5246 compare equal according to operand_equal_p, but which
5247 have different hash codes. */
5248 if (code == NOP_EXPR
5249 || code == CONVERT_EXPR
5250 || code == NON_LVALUE_EXPR)
5252 /* Make sure to include signness in the hash computation. */
5253 val += TYPE_UNSIGNED (TREE_TYPE (t));
5254 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5257 else if (commutative_tree_code (code))
5259 /* It's a commutative expression. We want to hash it the same
5260 however it appears. We do this by first hashing both operands
5261 and then rehashing based on the order of their independent
5263 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5264 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5268 t = one, one = two, two = t;
5270 val = iterative_hash_hashval_t (one, val);
5271 val = iterative_hash_hashval_t (two, val);
5274 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5275 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5282 /* Constructors for pointer, array and function types.
5283 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5284 constructed by language-dependent code, not here.) */
5286 /* Construct, lay out and return the type of pointers to TO_TYPE with
5287 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5288 reference all of memory. If such a type has already been
5289 constructed, reuse it. */
5292 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5297 if (to_type == error_mark_node)
5298 return error_mark_node;
5300 /* In some cases, languages will have things that aren't a POINTER_TYPE
5301 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5302 In that case, return that type without regard to the rest of our
5305 ??? This is a kludge, but consistent with the way this function has
5306 always operated and there doesn't seem to be a good way to avoid this
5308 if (TYPE_POINTER_TO (to_type) != 0
5309 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5310 return TYPE_POINTER_TO (to_type);
5312 /* First, if we already have a type for pointers to TO_TYPE and it's
5313 the proper mode, use it. */
5314 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5315 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5318 t = make_node (POINTER_TYPE);
5320 TREE_TYPE (t) = to_type;
5321 TYPE_MODE (t) = mode;
5322 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5323 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5324 TYPE_POINTER_TO (to_type) = t;
5326 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5327 SET_TYPE_STRUCTURAL_EQUALITY (t);
5328 else if (TYPE_CANONICAL (to_type) != to_type)
5330 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5331 mode, can_alias_all);
5333 /* Lay out the type. This function has many callers that are concerned
5334 with expression-construction, and this simplifies them all. */
5340 /* By default build pointers in ptr_mode. */
5343 build_pointer_type (tree to_type)
5345 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5348 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5351 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5356 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5357 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5358 In that case, return that type without regard to the rest of our
5361 ??? This is a kludge, but consistent with the way this function has
5362 always operated and there doesn't seem to be a good way to avoid this
5364 if (TYPE_REFERENCE_TO (to_type) != 0
5365 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5366 return TYPE_REFERENCE_TO (to_type);
5368 /* First, if we already have a type for pointers to TO_TYPE and it's
5369 the proper mode, use it. */
5370 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5371 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5374 t = make_node (REFERENCE_TYPE);
5376 TREE_TYPE (t) = to_type;
5377 TYPE_MODE (t) = mode;
5378 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5379 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5380 TYPE_REFERENCE_TO (to_type) = t;
5382 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5383 SET_TYPE_STRUCTURAL_EQUALITY (t);
5384 else if (TYPE_CANONICAL (to_type) != to_type)
5386 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5387 mode, can_alias_all);
5395 /* Build the node for the type of references-to-TO_TYPE by default
5399 build_reference_type (tree to_type)
5401 return build_reference_type_for_mode (to_type, ptr_mode, false);
5404 /* Build a type that is compatible with t but has no cv quals anywhere
5407 const char *const *const * -> char ***. */
5410 build_type_no_quals (tree t)
5412 switch (TREE_CODE (t))
5415 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5417 TYPE_REF_CAN_ALIAS_ALL (t));
5418 case REFERENCE_TYPE:
5420 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5422 TYPE_REF_CAN_ALIAS_ALL (t));
5424 return TYPE_MAIN_VARIANT (t);
5428 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5429 MAXVAL should be the maximum value in the domain
5430 (one less than the length of the array).
5432 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5433 We don't enforce this limit, that is up to caller (e.g. language front end).
5434 The limit exists because the result is a signed type and we don't handle
5435 sizes that use more than one HOST_WIDE_INT. */
5438 build_index_type (tree maxval)
5440 tree itype = make_node (INTEGER_TYPE);
5442 TREE_TYPE (itype) = sizetype;
5443 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5444 TYPE_MIN_VALUE (itype) = size_zero_node;
5445 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5446 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5447 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5448 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5449 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5450 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5452 if (host_integerp (maxval, 1))
5453 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5456 /* Since we cannot hash this type, we need to compare it using
5457 structural equality checks. */
5458 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5463 /* Builds a signed or unsigned integer type of precision PRECISION.
5464 Used for C bitfields whose precision does not match that of
5465 built-in target types. */
5467 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5470 tree itype = make_node (INTEGER_TYPE);
5472 TYPE_PRECISION (itype) = precision;
5475 fixup_unsigned_type (itype);
5477 fixup_signed_type (itype);
5479 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5480 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5485 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5486 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5487 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5490 build_range_type (tree type, tree lowval, tree highval)
5492 tree itype = make_node (INTEGER_TYPE);
5494 TREE_TYPE (itype) = type;
5495 if (type == NULL_TREE)
5498 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5499 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5501 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5502 TYPE_MODE (itype) = TYPE_MODE (type);
5503 TYPE_SIZE (itype) = TYPE_SIZE (type);
5504 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5505 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5506 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5508 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5509 return type_hash_canon (tree_low_cst (highval, 0)
5510 - tree_low_cst (lowval, 0),
5516 /* Just like build_index_type, but takes lowval and highval instead
5517 of just highval (maxval). */
5520 build_index_2_type (tree lowval, tree highval)
5522 return build_range_type (sizetype, lowval, highval);
5525 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5526 and number of elements specified by the range of values of INDEX_TYPE.
5527 If such a type has already been constructed, reuse it. */
5530 build_array_type (tree elt_type, tree index_type)
5533 hashval_t hashcode = 0;
5535 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5537 error ("arrays of functions are not meaningful");
5538 elt_type = integer_type_node;
5541 t = make_node (ARRAY_TYPE);
5542 TREE_TYPE (t) = elt_type;
5543 TYPE_DOMAIN (t) = index_type;
5545 if (index_type == 0)
5548 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5549 t = type_hash_canon (hashcode, t);
5553 if (TYPE_CANONICAL (t) == t)
5555 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5556 SET_TYPE_STRUCTURAL_EQUALITY (t);
5557 else if (TYPE_CANONICAL (elt_type) != elt_type)
5559 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5565 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5566 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5567 t = type_hash_canon (hashcode, t);
5569 if (!COMPLETE_TYPE_P (t))
5572 if (TYPE_CANONICAL (t) == t)
5574 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5575 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5576 SET_TYPE_STRUCTURAL_EQUALITY (t);
5577 else if (TYPE_CANONICAL (elt_type) != elt_type
5578 || TYPE_CANONICAL (index_type) != index_type)
5580 = build_array_type (TYPE_CANONICAL (elt_type),
5581 TYPE_CANONICAL (index_type));
5587 /* Return the TYPE of the elements comprising
5588 the innermost dimension of ARRAY. */
5591 get_inner_array_type (tree array)
5593 tree type = TREE_TYPE (array);
5595 while (TREE_CODE (type) == ARRAY_TYPE)
5596 type = TREE_TYPE (type);
5601 /* Construct, lay out and return
5602 the type of functions returning type VALUE_TYPE
5603 given arguments of types ARG_TYPES.
5604 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5605 are data type nodes for the arguments of the function.
5606 If such a type has already been constructed, reuse it. */
5609 build_function_type (tree value_type, tree arg_types)
5612 hashval_t hashcode = 0;
5614 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5616 error ("function return type cannot be function");
5617 value_type = integer_type_node;
5620 /* Make a node of the sort we want. */
5621 t = make_node (FUNCTION_TYPE);
5622 TREE_TYPE (t) = value_type;
5623 TYPE_ARG_TYPES (t) = arg_types;
5625 /* We don't have canonicalization of function types, yet. */
5626 SET_TYPE_STRUCTURAL_EQUALITY (t);
5628 /* If we already have such a type, use the old one. */
5629 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5630 hashcode = type_hash_list (arg_types, hashcode);
5631 t = type_hash_canon (hashcode, t);
5633 if (!COMPLETE_TYPE_P (t))
5638 /* Build a function type. The RETURN_TYPE is the type returned by the
5639 function. If additional arguments are provided, they are
5640 additional argument types. The list of argument types must always
5641 be terminated by NULL_TREE. */
5644 build_function_type_list (tree return_type, ...)
5649 va_start (p, return_type);
5651 t = va_arg (p, tree);
5652 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5653 args = tree_cons (NULL_TREE, t, args);
5655 if (args == NULL_TREE)
5656 args = void_list_node;
5660 args = nreverse (args);
5661 TREE_CHAIN (last) = void_list_node;
5663 args = build_function_type (return_type, args);
5669 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5670 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5671 for the method. An implicit additional parameter (of type
5672 pointer-to-BASETYPE) is added to the ARGTYPES. */
5675 build_method_type_directly (tree basetype,
5683 /* Make a node of the sort we want. */
5684 t = make_node (METHOD_TYPE);
5686 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5687 TREE_TYPE (t) = rettype;
5688 ptype = build_pointer_type (basetype);
5690 /* The actual arglist for this function includes a "hidden" argument
5691 which is "this". Put it into the list of argument types. */
5692 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5693 TYPE_ARG_TYPES (t) = argtypes;
5695 /* We don't have canonicalization of method types yet. */
5696 SET_TYPE_STRUCTURAL_EQUALITY (t);
5698 /* If we already have such a type, use the old one. */
5699 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5700 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5701 hashcode = type_hash_list (argtypes, hashcode);
5702 t = type_hash_canon (hashcode, t);
5704 if (!COMPLETE_TYPE_P (t))
5710 /* Construct, lay out and return the type of methods belonging to class
5711 BASETYPE and whose arguments and values are described by TYPE.
5712 If that type exists already, reuse it.
5713 TYPE must be a FUNCTION_TYPE node. */
5716 build_method_type (tree basetype, tree type)
5718 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5720 return build_method_type_directly (basetype,
5722 TYPE_ARG_TYPES (type));
5725 /* Construct, lay out and return the type of offsets to a value
5726 of type TYPE, within an object of type BASETYPE.
5727 If a suitable offset type exists already, reuse it. */
5730 build_offset_type (tree basetype, tree type)
5733 hashval_t hashcode = 0;
5735 /* Make a node of the sort we want. */
5736 t = make_node (OFFSET_TYPE);
5738 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5739 TREE_TYPE (t) = type;
5741 /* If we already have such a type, use the old one. */
5742 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5743 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5744 t = type_hash_canon (hashcode, t);
5746 if (!COMPLETE_TYPE_P (t))
5749 if (TYPE_CANONICAL (t) == t)
5751 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5752 || TYPE_STRUCTURAL_EQUALITY_P (type))
5753 SET_TYPE_STRUCTURAL_EQUALITY (t);
5754 else if (TYPE_CANONICAL (basetype) != basetype
5755 || TYPE_CANONICAL (type) != type)
5757 = build_offset_type (TYPE_CANONICAL (basetype),
5758 TYPE_CANONICAL (type));
5764 /* Create a complex type whose components are COMPONENT_TYPE. */
5767 build_complex_type (tree component_type)
5772 /* Make a node of the sort we want. */
5773 t = make_node (COMPLEX_TYPE);
5775 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5777 /* If we already have such a type, use the old one. */
5778 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5779 t = type_hash_canon (hashcode, t);
5781 if (!COMPLETE_TYPE_P (t))
5784 if (TYPE_CANONICAL (t) == t)
5786 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
5787 SET_TYPE_STRUCTURAL_EQUALITY (t);
5788 else if (TYPE_CANONICAL (component_type) != component_type)
5790 = build_complex_type (TYPE_CANONICAL (component_type));
5793 /* If we are writing Dwarf2 output we need to create a name,
5794 since complex is a fundamental type. */
5795 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5799 if (component_type == char_type_node)
5800 name = "complex char";
5801 else if (component_type == signed_char_type_node)
5802 name = "complex signed char";
5803 else if (component_type == unsigned_char_type_node)
5804 name = "complex unsigned char";
5805 else if (component_type == short_integer_type_node)
5806 name = "complex short int";
5807 else if (component_type == short_unsigned_type_node)
5808 name = "complex short unsigned int";
5809 else if (component_type == integer_type_node)
5810 name = "complex int";
5811 else if (component_type == unsigned_type_node)
5812 name = "complex unsigned int";
5813 else if (component_type == long_integer_type_node)
5814 name = "complex long int";
5815 else if (component_type == long_unsigned_type_node)
5816 name = "complex long unsigned int";
5817 else if (component_type == long_long_integer_type_node)
5818 name = "complex long long int";
5819 else if (component_type == long_long_unsigned_type_node)
5820 name = "complex long long unsigned int";
5825 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
5828 return build_qualified_type (t, TYPE_QUALS (component_type));
5831 /* Return OP, stripped of any conversions to wider types as much as is safe.
5832 Converting the value back to OP's type makes a value equivalent to OP.
5834 If FOR_TYPE is nonzero, we return a value which, if converted to
5835 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5837 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5838 narrowest type that can hold the value, even if they don't exactly fit.
5839 Otherwise, bit-field references are changed to a narrower type
5840 only if they can be fetched directly from memory in that type.
5842 OP must have integer, real or enumeral type. Pointers are not allowed!
5844 There are some cases where the obvious value we could return
5845 would regenerate to OP if converted to OP's type,
5846 but would not extend like OP to wider types.
5847 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5848 For example, if OP is (unsigned short)(signed char)-1,
5849 we avoid returning (signed char)-1 if FOR_TYPE is int,
5850 even though extending that to an unsigned short would regenerate OP,
5851 since the result of extending (signed char)-1 to (int)
5852 is different from (int) OP. */
5855 get_unwidened (tree op, tree for_type)
5857 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5858 tree type = TREE_TYPE (op);
5860 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5862 = (for_type != 0 && for_type != type
5863 && final_prec > TYPE_PRECISION (type)
5864 && TYPE_UNSIGNED (type));
5867 while (TREE_CODE (op) == NOP_EXPR
5868 || TREE_CODE (op) == CONVERT_EXPR)
5872 /* TYPE_PRECISION on vector types has different meaning
5873 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5874 so avoid them here. */
5875 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5878 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5879 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5881 /* Truncations are many-one so cannot be removed.
5882 Unless we are later going to truncate down even farther. */
5884 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5887 /* See what's inside this conversion. If we decide to strip it,
5889 op = TREE_OPERAND (op, 0);
5891 /* If we have not stripped any zero-extensions (uns is 0),
5892 we can strip any kind of extension.
5893 If we have previously stripped a zero-extension,
5894 only zero-extensions can safely be stripped.
5895 Any extension can be stripped if the bits it would produce
5896 are all going to be discarded later by truncating to FOR_TYPE. */
5900 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5902 /* TYPE_UNSIGNED says whether this is a zero-extension.
5903 Let's avoid computing it if it does not affect WIN
5904 and if UNS will not be needed again. */
5906 || TREE_CODE (op) == NOP_EXPR
5907 || TREE_CODE (op) == CONVERT_EXPR)
5908 && TYPE_UNSIGNED (TREE_TYPE (op)))
5916 if (TREE_CODE (op) == COMPONENT_REF
5917 /* Since type_for_size always gives an integer type. */
5918 && TREE_CODE (type) != REAL_TYPE
5919 /* Don't crash if field not laid out yet. */
5920 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5921 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5923 unsigned int innerprec
5924 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5925 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5926 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5927 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5929 /* We can get this structure field in the narrowest type it fits in.
5930 If FOR_TYPE is 0, do this only for a field that matches the
5931 narrower type exactly and is aligned for it
5932 The resulting extension to its nominal type (a fullword type)
5933 must fit the same conditions as for other extensions. */
5936 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5937 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5938 && (! uns || final_prec <= innerprec || unsignedp))
5940 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5941 TREE_OPERAND (op, 1), NULL_TREE);
5942 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5943 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5950 /* Return OP or a simpler expression for a narrower value
5951 which can be sign-extended or zero-extended to give back OP.
5952 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5953 or 0 if the value should be sign-extended. */
5956 get_narrower (tree op, int *unsignedp_ptr)
5961 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5963 while (TREE_CODE (op) == NOP_EXPR)
5966 = (TYPE_PRECISION (TREE_TYPE (op))
5967 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5969 /* Truncations are many-one so cannot be removed. */
5973 /* See what's inside this conversion. If we decide to strip it,
5978 op = TREE_OPERAND (op, 0);
5979 /* An extension: the outermost one can be stripped,
5980 but remember whether it is zero or sign extension. */
5982 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5983 /* Otherwise, if a sign extension has been stripped,
5984 only sign extensions can now be stripped;
5985 if a zero extension has been stripped, only zero-extensions. */
5986 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5990 else /* bitschange == 0 */
5992 /* A change in nominal type can always be stripped, but we must
5993 preserve the unsignedness. */
5995 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5997 op = TREE_OPERAND (op, 0);
5998 /* Keep trying to narrow, but don't assign op to win if it
5999 would turn an integral type into something else. */
6000 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6007 if (TREE_CODE (op) == COMPONENT_REF
6008 /* Since type_for_size always gives an integer type. */
6009 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6010 /* Ensure field is laid out already. */
6011 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6012 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6014 unsigned HOST_WIDE_INT innerprec
6015 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6016 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6017 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6018 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6020 /* We can get this structure field in a narrower type that fits it,
6021 but the resulting extension to its nominal type (a fullword type)
6022 must satisfy the same conditions as for other extensions.
6024 Do this only for fields that are aligned (not bit-fields),
6025 because when bit-field insns will be used there is no
6026 advantage in doing this. */
6028 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6029 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6030 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6034 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6035 win = fold_convert (type, op);
6039 *unsignedp_ptr = uns;
6043 /* Nonzero if integer constant C has a value that is permissible
6044 for type TYPE (an INTEGER_TYPE). */
6047 int_fits_type_p (tree c, tree type)
6049 tree type_low_bound = TYPE_MIN_VALUE (type);
6050 tree type_high_bound = TYPE_MAX_VALUE (type);
6051 bool ok_for_low_bound, ok_for_high_bound;
6052 unsigned HOST_WIDE_INT low;
6055 /* If at least one bound of the type is a constant integer, we can check
6056 ourselves and maybe make a decision. If no such decision is possible, but
6057 this type is a subtype, try checking against that. Otherwise, use
6058 fit_double_type, which checks against the precision.
6060 Compute the status for each possibly constant bound, and return if we see
6061 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6062 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6063 for "constant known to fit". */
6065 /* Check if C >= type_low_bound. */
6066 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6068 if (tree_int_cst_lt (c, type_low_bound))
6070 ok_for_low_bound = true;
6073 ok_for_low_bound = false;
6075 /* Check if c <= type_high_bound. */
6076 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6078 if (tree_int_cst_lt (type_high_bound, c))
6080 ok_for_high_bound = true;
6083 ok_for_high_bound = false;
6085 /* If the constant fits both bounds, the result is known. */
6086 if (ok_for_low_bound && ok_for_high_bound)
6089 /* Perform some generic filtering which may allow making a decision
6090 even if the bounds are not constant. First, negative integers
6091 never fit in unsigned types, */
6092 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6095 /* Second, narrower types always fit in wider ones. */
6096 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6099 /* Third, unsigned integers with top bit set never fit signed types. */
6100 if (! TYPE_UNSIGNED (type)
6101 && TYPE_UNSIGNED (TREE_TYPE (c))
6102 && tree_int_cst_msb (c))
6105 /* If we haven't been able to decide at this point, there nothing more we
6106 can check ourselves here. Look at the base type if we have one and it
6107 has the same precision. */
6108 if (TREE_CODE (type) == INTEGER_TYPE
6109 && TREE_TYPE (type) != 0
6110 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6111 return int_fits_type_p (c, TREE_TYPE (type));
6113 /* Or to fit_double_type, if nothing else. */
6114 low = TREE_INT_CST_LOW (c);
6115 high = TREE_INT_CST_HIGH (c);
6116 return !fit_double_type (low, high, &low, &high, type);
6119 /* Subprogram of following function. Called by walk_tree.
6121 Return *TP if it is an automatic variable or parameter of the
6122 function passed in as DATA. */
6125 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6127 tree fn = (tree) data;
6132 else if (DECL_P (*tp)
6133 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
6139 /* Returns true if T is, contains, or refers to a type with variable
6140 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6141 arguments, but not the return type. If FN is nonzero, only return
6142 true if a modifier of the type or position of FN is a variable or
6143 parameter inside FN.
6145 This concept is more general than that of C99 'variably modified types':
6146 in C99, a struct type is never variably modified because a VLA may not
6147 appear as a structure member. However, in GNU C code like:
6149 struct S { int i[f()]; };
6151 is valid, and other languages may define similar constructs. */
6154 variably_modified_type_p (tree type, tree fn)
6158 /* Test if T is either variable (if FN is zero) or an expression containing
6159 a variable in FN. */
6160 #define RETURN_TRUE_IF_VAR(T) \
6161 do { tree _t = (T); \
6162 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6163 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6164 return true; } while (0)
6166 if (type == error_mark_node)
6169 /* If TYPE itself has variable size, it is variably modified. */
6170 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6171 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6173 switch (TREE_CODE (type))
6176 case REFERENCE_TYPE:
6178 if (variably_modified_type_p (TREE_TYPE (type), fn))
6184 /* If TYPE is a function type, it is variably modified if the
6185 return type is variably modified. */
6186 if (variably_modified_type_p (TREE_TYPE (type), fn))
6194 /* Scalar types are variably modified if their end points
6196 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6197 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6202 case QUAL_UNION_TYPE:
6203 /* We can't see if any of the fields are variably-modified by the
6204 definition we normally use, since that would produce infinite
6205 recursion via pointers. */
6206 /* This is variably modified if some field's type is. */
6207 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6208 if (TREE_CODE (t) == FIELD_DECL)
6210 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6211 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6212 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6214 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6215 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6220 /* Do not call ourselves to avoid infinite recursion. This is
6221 variably modified if the element type is. */
6222 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6223 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6230 /* The current language may have other cases to check, but in general,
6231 all other types are not variably modified. */
6232 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6234 #undef RETURN_TRUE_IF_VAR
6237 /* Given a DECL or TYPE, return the scope in which it was declared, or
6238 NULL_TREE if there is no containing scope. */
6241 get_containing_scope (tree t)
6243 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6246 /* Return the innermost context enclosing DECL that is
6247 a FUNCTION_DECL, or zero if none. */
6250 decl_function_context (tree decl)
6254 if (TREE_CODE (decl) == ERROR_MARK)
6257 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6258 where we look up the function at runtime. Such functions always take
6259 a first argument of type 'pointer to real context'.
6261 C++ should really be fixed to use DECL_CONTEXT for the real context,
6262 and use something else for the "virtual context". */
6263 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6266 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6268 context = DECL_CONTEXT (decl);
6270 while (context && TREE_CODE (context) != FUNCTION_DECL)
6272 if (TREE_CODE (context) == BLOCK)
6273 context = BLOCK_SUPERCONTEXT (context);
6275 context = get_containing_scope (context);
6281 /* Return the innermost context enclosing DECL that is
6282 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6283 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6286 decl_type_context (tree decl)
6288 tree context = DECL_CONTEXT (decl);
6291 switch (TREE_CODE (context))
6293 case NAMESPACE_DECL:
6294 case TRANSLATION_UNIT_DECL:
6299 case QUAL_UNION_TYPE:
6304 context = DECL_CONTEXT (context);
6308 context = BLOCK_SUPERCONTEXT (context);
6318 /* CALL is a CALL_EXPR. Return the declaration for the function
6319 called, or NULL_TREE if the called function cannot be
6323 get_callee_fndecl (tree call)
6327 if (call == error_mark_node)
6330 /* It's invalid to call this function with anything but a
6332 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6334 /* The first operand to the CALL is the address of the function
6336 addr = CALL_EXPR_FN (call);
6340 /* If this is a readonly function pointer, extract its initial value. */
6341 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6342 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6343 && DECL_INITIAL (addr))
6344 addr = DECL_INITIAL (addr);
6346 /* If the address is just `&f' for some function `f', then we know
6347 that `f' is being called. */
6348 if (TREE_CODE (addr) == ADDR_EXPR
6349 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6350 return TREE_OPERAND (addr, 0);
6352 /* We couldn't figure out what was being called. Maybe the front
6353 end has some idea. */
6354 return lang_hooks.lang_get_callee_fndecl (call);
6357 /* Print debugging information about tree nodes generated during the compile,
6358 and any language-specific information. */
6361 dump_tree_statistics (void)
6363 #ifdef GATHER_STATISTICS
6365 int total_nodes, total_bytes;
6368 fprintf (stderr, "\n??? tree nodes created\n\n");
6369 #ifdef GATHER_STATISTICS
6370 fprintf (stderr, "Kind Nodes Bytes\n");
6371 fprintf (stderr, "---------------------------------------\n");
6372 total_nodes = total_bytes = 0;
6373 for (i = 0; i < (int) all_kinds; i++)
6375 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6376 tree_node_counts[i], tree_node_sizes[i]);
6377 total_nodes += tree_node_counts[i];
6378 total_bytes += tree_node_sizes[i];
6380 fprintf (stderr, "---------------------------------------\n");
6381 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6382 fprintf (stderr, "---------------------------------------\n");
6383 ssanames_print_statistics ();
6384 phinodes_print_statistics ();
6386 fprintf (stderr, "(No per-node statistics)\n");
6388 print_type_hash_statistics ();
6389 print_debug_expr_statistics ();
6390 print_value_expr_statistics ();
6391 print_restrict_base_statistics ();
6392 lang_hooks.print_statistics ();
6395 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6397 /* Generate a crc32 of a string. */
6400 crc32_string (unsigned chksum, const char *string)
6404 unsigned value = *string << 24;
6407 for (ix = 8; ix--; value <<= 1)
6411 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6420 /* P is a string that will be used in a symbol. Mask out any characters
6421 that are not valid in that context. */
6424 clean_symbol_name (char *p)
6428 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6431 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6438 /* Generate a name for a special-purpose function function.
6439 The generated name may need to be unique across the whole link.
6440 TYPE is some string to identify the purpose of this function to the
6441 linker or collect2; it must start with an uppercase letter,
6443 I - for constructors
6445 N - for C++ anonymous namespaces
6446 F - for DWARF unwind frame information. */
6449 get_file_function_name (const char *type)
6455 /* If we already have a name we know to be unique, just use that. */
6456 if (first_global_object_name)
6457 p = first_global_object_name;
6458 /* If the target is handling the constructors/destructors, they
6459 will be local to this file and the name is only necessary for
6460 debugging purposes. */
6461 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6463 const char *file = main_input_filename;
6465 file = input_filename;
6466 /* Just use the file's basename, because the full pathname
6467 might be quite long. */
6468 p = strrchr (file, '/');
6473 p = q = ASTRDUP (p);
6474 clean_symbol_name (q);
6478 /* Otherwise, the name must be unique across the entire link.
6479 We don't have anything that we know to be unique to this translation
6480 unit, so use what we do have and throw in some randomness. */
6482 const char *name = weak_global_object_name;
6483 const char *file = main_input_filename;
6488 file = input_filename;
6490 len = strlen (file);
6491 q = alloca (9 * 2 + len + 1);
6492 memcpy (q, file, len + 1);
6493 clean_symbol_name (q);
6495 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6496 crc32_string (0, get_random_seed (false)));
6501 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6503 /* Set up the name of the file-level functions we may need.
6504 Use a global object (which is already required to be unique over
6505 the program) rather than the file name (which imposes extra
6507 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6509 return get_identifier (buf);
6512 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6514 /* Complain that the tree code of NODE does not match the expected 0
6515 terminated list of trailing codes. The trailing code list can be
6516 empty, for a more vague error message. FILE, LINE, and FUNCTION
6517 are of the caller. */
6520 tree_check_failed (const tree node, const char *file,
6521 int line, const char *function, ...)
6525 unsigned length = 0;
6528 va_start (args, function);
6529 while ((code = va_arg (args, int)))
6530 length += 4 + strlen (tree_code_name[code]);
6534 va_start (args, function);
6535 length += strlen ("expected ");
6536 buffer = alloca (length);
6538 while ((code = va_arg (args, int)))
6540 const char *prefix = length ? " or " : "expected ";
6542 strcpy (buffer + length, prefix);
6543 length += strlen (prefix);
6544 strcpy (buffer + length, tree_code_name[code]);
6545 length += strlen (tree_code_name[code]);
6550 buffer = (char *)"unexpected node";
6552 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6553 buffer, tree_code_name[TREE_CODE (node)],
6554 function, trim_filename (file), line);
6557 /* Complain that the tree code of NODE does match the expected 0
6558 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6562 tree_not_check_failed (const tree node, const char *file,
6563 int line, const char *function, ...)
6567 unsigned length = 0;
6570 va_start (args, function);
6571 while ((code = va_arg (args, int)))
6572 length += 4 + strlen (tree_code_name[code]);
6574 va_start (args, function);
6575 buffer = alloca (length);
6577 while ((code = va_arg (args, int)))
6581 strcpy (buffer + length, " or ");
6584 strcpy (buffer + length, tree_code_name[code]);
6585 length += strlen (tree_code_name[code]);
6589 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6590 buffer, tree_code_name[TREE_CODE (node)],
6591 function, trim_filename (file), line);
6594 /* Similar to tree_check_failed, except that we check for a class of tree
6595 code, given in CL. */
6598 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6599 const char *file, int line, const char *function)
6602 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6603 TREE_CODE_CLASS_STRING (cl),
6604 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6605 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6608 /* Similar to tree_check_failed, except that instead of specifying a
6609 dozen codes, use the knowledge that they're all sequential. */
6612 tree_range_check_failed (const tree node, const char *file, int line,
6613 const char *function, enum tree_code c1,
6617 unsigned length = 0;
6620 for (c = c1; c <= c2; ++c)
6621 length += 4 + strlen (tree_code_name[c]);
6623 length += strlen ("expected ");
6624 buffer = alloca (length);
6627 for (c = c1; c <= c2; ++c)
6629 const char *prefix = length ? " or " : "expected ";
6631 strcpy (buffer + length, prefix);
6632 length += strlen (prefix);
6633 strcpy (buffer + length, tree_code_name[c]);
6634 length += strlen (tree_code_name[c]);
6637 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6638 buffer, tree_code_name[TREE_CODE (node)],
6639 function, trim_filename (file), line);
6643 /* Similar to tree_check_failed, except that we check that a tree does
6644 not have the specified code, given in CL. */
6647 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6648 const char *file, int line, const char *function)
6651 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6652 TREE_CODE_CLASS_STRING (cl),
6653 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6654 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6658 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6661 omp_clause_check_failed (const tree node, const char *file, int line,
6662 const char *function, enum omp_clause_code code)
6664 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6665 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6666 function, trim_filename (file), line);
6670 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6673 omp_clause_range_check_failed (const tree node, const char *file, int line,
6674 const char *function, enum omp_clause_code c1,
6675 enum omp_clause_code c2)
6678 unsigned length = 0;
6679 enum omp_clause_code c;
6681 for (c = c1; c <= c2; ++c)
6682 length += 4 + strlen (omp_clause_code_name[c]);
6684 length += strlen ("expected ");
6685 buffer = alloca (length);
6688 for (c = c1; c <= c2; ++c)
6690 const char *prefix = length ? " or " : "expected ";
6692 strcpy (buffer + length, prefix);
6693 length += strlen (prefix);
6694 strcpy (buffer + length, omp_clause_code_name[c]);
6695 length += strlen (omp_clause_code_name[c]);
6698 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6699 buffer, omp_clause_code_name[TREE_CODE (node)],
6700 function, trim_filename (file), line);
6704 #undef DEFTREESTRUCT
6705 #define DEFTREESTRUCT(VAL, NAME) NAME,
6707 static const char *ts_enum_names[] = {
6708 #include "treestruct.def"
6710 #undef DEFTREESTRUCT
6712 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6714 /* Similar to tree_class_check_failed, except that we check for
6715 whether CODE contains the tree structure identified by EN. */
6718 tree_contains_struct_check_failed (const tree node,
6719 const enum tree_node_structure_enum en,
6720 const char *file, int line,
6721 const char *function)
6724 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6726 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6730 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6731 (dynamically sized) vector. */
6734 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6735 const char *function)
6738 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6739 idx + 1, len, function, trim_filename (file), line);
6742 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6743 (dynamically sized) vector. */
6746 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6747 const char *function)
6750 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6751 idx + 1, len, function, trim_filename (file), line);
6754 /* Similar to above, except that the check is for the bounds of the operand
6755 vector of an expression node EXP. */
6758 tree_operand_check_failed (int idx, tree exp, const char *file,
6759 int line, const char *function)
6761 int code = TREE_CODE (exp);
6763 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6764 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
6765 function, trim_filename (file), line);
6768 /* Similar to above, except that the check is for the number of
6769 operands of an OMP_CLAUSE node. */
6772 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6773 int line, const char *function)
6776 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6777 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6778 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6779 trim_filename (file), line);
6781 #endif /* ENABLE_TREE_CHECKING */
6783 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6784 and mapped to the machine mode MODE. Initialize its fields and build
6785 the information necessary for debugging output. */
6788 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6791 hashval_t hashcode = 0;
6793 /* Build a main variant, based on the main variant of the inner type, then
6794 use it to build the variant we return. */
6795 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
6796 && TYPE_MAIN_VARIANT (innertype) != innertype)
6797 return build_type_attribute_qual_variant (
6798 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
6799 TYPE_ATTRIBUTES (innertype),
6800 TYPE_QUALS (innertype));
6802 t = make_node (VECTOR_TYPE);
6803 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6804 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6805 TYPE_MODE (t) = mode;
6806 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6807 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6809 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
6810 SET_TYPE_STRUCTURAL_EQUALITY (t);
6811 else if (TYPE_CANONICAL (innertype) != innertype
6812 || mode != VOIDmode)
6814 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
6819 tree index = build_int_cst (NULL_TREE, nunits - 1);
6820 tree array = build_array_type (innertype, build_index_type (index));
6821 tree rt = make_node (RECORD_TYPE);
6823 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6824 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6826 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6827 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6828 the representation type, and we want to find that die when looking up
6829 the vector type. This is most easily achieved by making the TYPE_UID
6831 TYPE_UID (rt) = TYPE_UID (t);
6834 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
6835 hashcode = iterative_hash_host_wide_int (mode, hashcode);
6836 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
6837 return type_hash_canon (hashcode, t);
6841 make_or_reuse_type (unsigned size, int unsignedp)
6843 if (size == INT_TYPE_SIZE)
6844 return unsignedp ? unsigned_type_node : integer_type_node;
6845 if (size == CHAR_TYPE_SIZE)
6846 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6847 if (size == SHORT_TYPE_SIZE)
6848 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6849 if (size == LONG_TYPE_SIZE)
6850 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6851 if (size == LONG_LONG_TYPE_SIZE)
6852 return (unsignedp ? long_long_unsigned_type_node
6853 : long_long_integer_type_node);
6856 return make_unsigned_type (size);
6858 return make_signed_type (size);
6861 /* Create nodes for all integer types (and error_mark_node) using the sizes
6862 of C datatypes. The caller should call set_sizetype soon after calling
6863 this function to select one of the types as sizetype. */
6866 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6868 error_mark_node = make_node (ERROR_MARK);
6869 TREE_TYPE (error_mark_node) = error_mark_node;
6871 initialize_sizetypes (signed_sizetype);
6873 /* Define both `signed char' and `unsigned char'. */
6874 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6875 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6876 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6877 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6879 /* Define `char', which is like either `signed char' or `unsigned char'
6880 but not the same as either. */
6883 ? make_signed_type (CHAR_TYPE_SIZE)
6884 : make_unsigned_type (CHAR_TYPE_SIZE));
6885 TYPE_STRING_FLAG (char_type_node) = 1;
6887 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6888 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6889 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6890 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6891 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6892 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6893 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6894 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6896 /* Define a boolean type. This type only represents boolean values but
6897 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6898 Front ends which want to override this size (i.e. Java) can redefine
6899 boolean_type_node before calling build_common_tree_nodes_2. */
6900 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6901 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6902 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6903 TYPE_PRECISION (boolean_type_node) = 1;
6905 /* Fill in the rest of the sized types. Reuse existing type nodes
6907 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6908 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6909 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6910 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6911 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6913 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6914 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6915 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6916 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6917 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6919 access_public_node = get_identifier ("public");
6920 access_protected_node = get_identifier ("protected");
6921 access_private_node = get_identifier ("private");
6924 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6925 It will create several other common tree nodes. */
6928 build_common_tree_nodes_2 (int short_double)
6930 /* Define these next since types below may used them. */
6931 integer_zero_node = build_int_cst (NULL_TREE, 0);
6932 integer_one_node = build_int_cst (NULL_TREE, 1);
6933 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6935 size_zero_node = size_int (0);
6936 size_one_node = size_int (1);
6937 bitsize_zero_node = bitsize_int (0);
6938 bitsize_one_node = bitsize_int (1);
6939 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6941 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6942 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6944 void_type_node = make_node (VOID_TYPE);
6945 layout_type (void_type_node);
6947 /* We are not going to have real types in C with less than byte alignment,
6948 so we might as well not have any types that claim to have it. */
6949 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6950 TYPE_USER_ALIGN (void_type_node) = 0;
6952 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6953 layout_type (TREE_TYPE (null_pointer_node));
6955 ptr_type_node = build_pointer_type (void_type_node);
6957 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6958 fileptr_type_node = ptr_type_node;
6960 float_type_node = make_node (REAL_TYPE);
6961 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6962 layout_type (float_type_node);
6964 double_type_node = make_node (REAL_TYPE);
6966 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6968 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6969 layout_type (double_type_node);
6971 long_double_type_node = make_node (REAL_TYPE);
6972 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6973 layout_type (long_double_type_node);
6975 float_ptr_type_node = build_pointer_type (float_type_node);
6976 double_ptr_type_node = build_pointer_type (double_type_node);
6977 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6978 integer_ptr_type_node = build_pointer_type (integer_type_node);
6980 /* Fixed size integer types. */
6981 uint32_type_node = build_nonstandard_integer_type (32, true);
6982 uint64_type_node = build_nonstandard_integer_type (64, true);
6984 /* Decimal float types. */
6985 dfloat32_type_node = make_node (REAL_TYPE);
6986 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
6987 layout_type (dfloat32_type_node);
6988 TYPE_MODE (dfloat32_type_node) = SDmode;
6989 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
6991 dfloat64_type_node = make_node (REAL_TYPE);
6992 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
6993 layout_type (dfloat64_type_node);
6994 TYPE_MODE (dfloat64_type_node) = DDmode;
6995 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
6997 dfloat128_type_node = make_node (REAL_TYPE);
6998 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
6999 layout_type (dfloat128_type_node);
7000 TYPE_MODE (dfloat128_type_node) = TDmode;
7001 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7003 complex_integer_type_node = build_complex_type (integer_type_node);
7004 complex_float_type_node = build_complex_type (float_type_node);
7005 complex_double_type_node = build_complex_type (double_type_node);
7006 complex_long_double_type_node = build_complex_type (long_double_type_node);
7009 tree t = targetm.build_builtin_va_list ();
7011 /* Many back-ends define record types without setting TYPE_NAME.
7012 If we copied the record type here, we'd keep the original
7013 record type without a name. This breaks name mangling. So,
7014 don't copy record types and let c_common_nodes_and_builtins()
7015 declare the type to be __builtin_va_list. */
7016 if (TREE_CODE (t) != RECORD_TYPE)
7017 t = build_variant_type_copy (t);
7019 va_list_type_node = t;
7023 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7026 local_define_builtin (const char *name, tree type, enum built_in_function code,
7027 const char *library_name, int ecf_flags)
7031 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7032 library_name, NULL_TREE);
7033 if (ecf_flags & ECF_CONST)
7034 TREE_READONLY (decl) = 1;
7035 if (ecf_flags & ECF_PURE)
7036 DECL_IS_PURE (decl) = 1;
7037 if (ecf_flags & ECF_NORETURN)
7038 TREE_THIS_VOLATILE (decl) = 1;
7039 if (ecf_flags & ECF_NOTHROW)
7040 TREE_NOTHROW (decl) = 1;
7041 if (ecf_flags & ECF_MALLOC)
7042 DECL_IS_MALLOC (decl) = 1;
7044 built_in_decls[code] = decl;
7045 implicit_built_in_decls[code] = decl;
7048 /* Call this function after instantiating all builtins that the language
7049 front end cares about. This will build the rest of the builtins that
7050 are relied upon by the tree optimizers and the middle-end. */
7053 build_common_builtin_nodes (void)
7057 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7058 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7060 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7061 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7062 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7063 ftype = build_function_type (ptr_type_node, tmp);
7065 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7066 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7067 "memcpy", ECF_NOTHROW);
7068 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7069 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7070 "memmove", ECF_NOTHROW);
7073 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7075 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7076 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7077 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7078 ftype = build_function_type (integer_type_node, tmp);
7079 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7080 "memcmp", ECF_PURE | ECF_NOTHROW);
7083 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7085 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7086 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7087 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7088 ftype = build_function_type (ptr_type_node, tmp);
7089 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7090 "memset", ECF_NOTHROW);
7093 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7095 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7096 ftype = build_function_type (ptr_type_node, tmp);
7097 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7098 "alloca", ECF_NOTHROW | ECF_MALLOC);
7101 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7102 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7103 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7104 ftype = build_function_type (void_type_node, tmp);
7105 local_define_builtin ("__builtin_init_trampoline", ftype,
7106 BUILT_IN_INIT_TRAMPOLINE,
7107 "__builtin_init_trampoline", ECF_NOTHROW);
7109 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7110 ftype = build_function_type (ptr_type_node, tmp);
7111 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7112 BUILT_IN_ADJUST_TRAMPOLINE,
7113 "__builtin_adjust_trampoline",
7114 ECF_CONST | ECF_NOTHROW);
7116 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7117 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7118 ftype = build_function_type (void_type_node, tmp);
7119 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7120 BUILT_IN_NONLOCAL_GOTO,
7121 "__builtin_nonlocal_goto",
7122 ECF_NORETURN | ECF_NOTHROW);
7124 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7125 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7126 ftype = build_function_type (void_type_node, tmp);
7127 local_define_builtin ("__builtin_setjmp_setup", ftype,
7128 BUILT_IN_SETJMP_SETUP,
7129 "__builtin_setjmp_setup", ECF_NOTHROW);
7131 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7132 ftype = build_function_type (ptr_type_node, tmp);
7133 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7134 BUILT_IN_SETJMP_DISPATCHER,
7135 "__builtin_setjmp_dispatcher",
7136 ECF_PURE | ECF_NOTHROW);
7138 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7139 ftype = build_function_type (void_type_node, tmp);
7140 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7141 BUILT_IN_SETJMP_RECEIVER,
7142 "__builtin_setjmp_receiver", ECF_NOTHROW);
7144 ftype = build_function_type (ptr_type_node, void_list_node);
7145 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7146 "__builtin_stack_save", ECF_NOTHROW);
7148 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7149 ftype = build_function_type (void_type_node, tmp);
7150 local_define_builtin ("__builtin_stack_restore", ftype,
7151 BUILT_IN_STACK_RESTORE,
7152 "__builtin_stack_restore", ECF_NOTHROW);
7154 ftype = build_function_type (void_type_node, void_list_node);
7155 local_define_builtin ("__builtin_profile_func_enter", ftype,
7156 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7157 local_define_builtin ("__builtin_profile_func_exit", ftype,
7158 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7160 /* Complex multiplication and division. These are handled as builtins
7161 rather than optabs because emit_library_call_value doesn't support
7162 complex. Further, we can do slightly better with folding these
7163 beasties if the real and complex parts of the arguments are separate. */
7165 enum machine_mode mode;
7167 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7169 char mode_name_buf[4], *q;
7171 enum built_in_function mcode, dcode;
7172 tree type, inner_type;
7174 type = lang_hooks.types.type_for_mode (mode, 0);
7177 inner_type = TREE_TYPE (type);
7179 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7180 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7181 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7182 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7183 ftype = build_function_type (type, tmp);
7185 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7186 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7188 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7192 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7193 local_define_builtin (built_in_names[mcode], ftype, mcode,
7194 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7196 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7197 local_define_builtin (built_in_names[dcode], ftype, dcode,
7198 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7203 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7206 If we requested a pointer to a vector, build up the pointers that
7207 we stripped off while looking for the inner type. Similarly for
7208 return values from functions.
7210 The argument TYPE is the top of the chain, and BOTTOM is the
7211 new type which we will point to. */
7214 reconstruct_complex_type (tree type, tree bottom)
7218 if (POINTER_TYPE_P (type))
7220 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7221 outer = build_pointer_type (inner);
7223 else if (TREE_CODE (type) == ARRAY_TYPE)
7225 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7226 outer = build_array_type (inner, TYPE_DOMAIN (type));
7228 else if (TREE_CODE (type) == FUNCTION_TYPE)
7230 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7231 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7233 else if (TREE_CODE (type) == METHOD_TYPE)
7236 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7237 /* The build_method_type_directly() routine prepends 'this' to argument list,
7238 so we must compensate by getting rid of it. */
7239 argtypes = TYPE_ARG_TYPES (type);
7240 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
7242 TYPE_ARG_TYPES (type));
7243 TYPE_ARG_TYPES (outer) = argtypes;
7248 TYPE_READONLY (outer) = TYPE_READONLY (type);
7249 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
7254 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7257 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7261 switch (GET_MODE_CLASS (mode))
7263 case MODE_VECTOR_INT:
7264 case MODE_VECTOR_FLOAT:
7265 nunits = GET_MODE_NUNITS (mode);
7269 /* Check that there are no leftover bits. */
7270 gcc_assert (GET_MODE_BITSIZE (mode)
7271 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7273 nunits = GET_MODE_BITSIZE (mode)
7274 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7281 return make_vector_type (innertype, nunits, mode);
7284 /* Similarly, but takes the inner type and number of units, which must be
7288 build_vector_type (tree innertype, int nunits)
7290 return make_vector_type (innertype, nunits, VOIDmode);
7294 /* Build RESX_EXPR with given REGION_NUMBER. */
7296 build_resx (int region_number)
7299 t = build1 (RESX_EXPR, void_type_node,
7300 build_int_cst (NULL_TREE, region_number));
7304 /* Given an initializer INIT, return TRUE if INIT is zero or some
7305 aggregate of zeros. Otherwise return FALSE. */
7307 initializer_zerop (tree init)
7313 switch (TREE_CODE (init))
7316 return integer_zerop (init);
7319 /* ??? Note that this is not correct for C4X float formats. There,
7320 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7321 negative exponent. */
7322 return real_zerop (init)
7323 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7326 return integer_zerop (init)
7327 || (real_zerop (init)
7328 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7329 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7332 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7333 if (!initializer_zerop (TREE_VALUE (elt)))
7339 unsigned HOST_WIDE_INT idx;
7341 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7342 if (!initializer_zerop (elt))
7352 /* Build an empty statement. */
7355 build_empty_stmt (void)
7357 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7361 /* Build an OpenMP clause with code CODE. */
7364 build_omp_clause (enum omp_clause_code code)
7369 length = omp_clause_num_ops[code];
7370 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7372 t = ggc_alloc (size);
7373 memset (t, 0, size);
7374 TREE_SET_CODE (t, OMP_CLAUSE);
7375 OMP_CLAUSE_SET_CODE (t, code);
7377 #ifdef GATHER_STATISTICS
7378 tree_node_counts[(int) omp_clause_kind]++;
7379 tree_node_sizes[(int) omp_clause_kind] += size;
7385 /* Set various status flags when building a CALL_EXPR object T. */
7388 process_call_operands (tree t)
7392 side_effects = TREE_SIDE_EFFECTS (t);
7396 n = TREE_OPERAND_LENGTH (t);
7397 for (i = 1; i < n; i++)
7399 tree op = TREE_OPERAND (t, i);
7400 if (op && TREE_SIDE_EFFECTS (op))
7411 /* Calls have side-effects, except those to const or
7413 i = call_expr_flags (t);
7414 if (!(i & (ECF_CONST | ECF_PURE)))
7417 TREE_SIDE_EFFECTS (t) = side_effects;
7420 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7421 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7422 Except for the CODE and operand count field, other storage for the
7423 object is initialized to zeros. */
7426 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
7429 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
7431 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
7432 gcc_assert (len >= 1);
7434 #ifdef GATHER_STATISTICS
7435 tree_node_counts[(int) e_kind]++;
7436 tree_node_sizes[(int) e_kind] += length;
7439 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
7441 memset (t, 0, length);
7443 TREE_SET_CODE (t, code);
7445 /* Can't use TREE_OPERAND to store the length because if checking is
7446 enabled, it will try to check the length before we store it. :-P */
7447 t->exp.operands[0] = build_int_cst (sizetype, len);
7453 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7454 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
7458 build_call_list (tree return_type, tree fn, tree arglist)
7463 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
7464 TREE_TYPE (t) = return_type;
7465 CALL_EXPR_FN (t) = fn;
7466 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7467 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
7468 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
7469 process_call_operands (t);
7473 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7474 FN and a null static chain slot. NARGS is the number of call arguments
7475 which are specified as "..." arguments. */
7478 build_call_nary (tree return_type, tree fn, int nargs, ...)
7482 va_start (args, nargs);
7483 ret = build_call_valist (return_type, fn, nargs, args);
7488 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7489 FN and a null static chain slot. NARGS is the number of call arguments
7490 which are specified as a va_list ARGS. */
7493 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
7498 t = build_vl_exp (CALL_EXPR, nargs + 3);
7499 TREE_TYPE (t) = return_type;
7500 CALL_EXPR_FN (t) = fn;
7501 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7502 for (i = 0; i < nargs; i++)
7503 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
7504 process_call_operands (t);
7508 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7509 FN and a null static chain slot. NARGS is the number of call arguments
7510 which are specified as a tree array ARGS. */
7513 build_call_array (tree return_type, tree fn, int nargs, tree *args)
7518 t = build_vl_exp (CALL_EXPR, nargs + 3);
7519 TREE_TYPE (t) = return_type;
7520 CALL_EXPR_FN (t) = fn;
7521 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7522 for (i = 0; i < nargs; i++)
7523 CALL_EXPR_ARG (t, i) = args[i];
7524 process_call_operands (t);
7529 /* Returns true if it is possible to prove that the index of
7530 an array access REF (an ARRAY_REF expression) falls into the
7534 in_array_bounds_p (tree ref)
7536 tree idx = TREE_OPERAND (ref, 1);
7539 if (TREE_CODE (idx) != INTEGER_CST)
7542 min = array_ref_low_bound (ref);
7543 max = array_ref_up_bound (ref);
7546 || TREE_CODE (min) != INTEGER_CST
7547 || TREE_CODE (max) != INTEGER_CST)
7550 if (tree_int_cst_lt (idx, min)
7551 || tree_int_cst_lt (max, idx))
7557 /* Returns true if it is possible to prove that the range of
7558 an array access REF (an ARRAY_RANGE_REF expression) falls
7559 into the array bounds. */
7562 range_in_array_bounds_p (tree ref)
7564 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7565 tree range_min, range_max, min, max;
7567 range_min = TYPE_MIN_VALUE (domain_type);
7568 range_max = TYPE_MAX_VALUE (domain_type);
7571 || TREE_CODE (range_min) != INTEGER_CST
7572 || TREE_CODE (range_max) != INTEGER_CST)
7575 min = array_ref_low_bound (ref);
7576 max = array_ref_up_bound (ref);
7579 || TREE_CODE (min) != INTEGER_CST
7580 || TREE_CODE (max) != INTEGER_CST)
7583 if (tree_int_cst_lt (range_min, min)
7584 || tree_int_cst_lt (max, range_max))
7590 /* Return true if T (assumed to be a DECL) must be assigned a memory
7594 needs_to_live_in_memory (tree t)
7596 if (TREE_CODE (t) == SSA_NAME)
7597 t = SSA_NAME_VAR (t);
7599 return (TREE_ADDRESSABLE (t)
7600 || is_global_var (t)
7601 || (TREE_CODE (t) == RESULT_DECL
7602 && aggregate_value_p (t, current_function_decl)));
7605 /* There are situations in which a language considers record types
7606 compatible which have different field lists. Decide if two fields
7607 are compatible. It is assumed that the parent records are compatible. */
7610 fields_compatible_p (tree f1, tree f2)
7612 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7613 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7616 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7617 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7620 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7626 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7629 find_compatible_field (tree record, tree orig_field)
7633 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7634 if (TREE_CODE (f) == FIELD_DECL
7635 && fields_compatible_p (f, orig_field))
7638 /* ??? Why isn't this on the main fields list? */
7639 f = TYPE_VFIELD (record);
7640 if (f && TREE_CODE (f) == FIELD_DECL
7641 && fields_compatible_p (f, orig_field))
7644 /* ??? We should abort here, but Java appears to do Bad Things
7645 with inherited fields. */
7649 /* Return value of a constant X. */
7652 int_cst_value (tree x)
7654 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
7655 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
7656 bool negative = ((val >> (bits - 1)) & 1) != 0;
7658 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
7661 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
7663 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
7669 /* Returns unsigned variant of TYPE. */
7672 unsigned_type_for (tree type)
7674 if (POINTER_TYPE_P (type))
7675 return lang_hooks.types.unsigned_type (size_type_node);
7676 return lang_hooks.types.unsigned_type (type);
7679 /* Returns signed variant of TYPE. */
7682 signed_type_for (tree type)
7684 if (POINTER_TYPE_P (type))
7685 return lang_hooks.types.signed_type (size_type_node);
7686 return lang_hooks.types.signed_type (type);
7689 /* Returns the largest value obtainable by casting something in INNER type to
7693 upper_bound_in_type (tree outer, tree inner)
7695 unsigned HOST_WIDE_INT lo, hi;
7696 unsigned int det = 0;
7697 unsigned oprec = TYPE_PRECISION (outer);
7698 unsigned iprec = TYPE_PRECISION (inner);
7701 /* Compute a unique number for every combination. */
7702 det |= (oprec > iprec) ? 4 : 0;
7703 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7704 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7706 /* Determine the exponent to use. */
7711 /* oprec <= iprec, outer: signed, inner: don't care. */
7716 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7720 /* oprec > iprec, outer: signed, inner: signed. */
7724 /* oprec > iprec, outer: signed, inner: unsigned. */
7728 /* oprec > iprec, outer: unsigned, inner: signed. */
7732 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7739 /* Compute 2^^prec - 1. */
7740 if (prec <= HOST_BITS_PER_WIDE_INT)
7743 lo = ((~(unsigned HOST_WIDE_INT) 0)
7744 >> (HOST_BITS_PER_WIDE_INT - prec));
7748 hi = ((~(unsigned HOST_WIDE_INT) 0)
7749 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7750 lo = ~(unsigned HOST_WIDE_INT) 0;
7753 return build_int_cst_wide (outer, lo, hi);
7756 /* Returns the smallest value obtainable by casting something in INNER type to
7760 lower_bound_in_type (tree outer, tree inner)
7762 unsigned HOST_WIDE_INT lo, hi;
7763 unsigned oprec = TYPE_PRECISION (outer);
7764 unsigned iprec = TYPE_PRECISION (inner);
7766 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7768 if (TYPE_UNSIGNED (outer)
7769 /* If we are widening something of an unsigned type, OUTER type
7770 contains all values of INNER type. In particular, both INNER
7771 and OUTER types have zero in common. */
7772 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7776 /* If we are widening a signed type to another signed type, we
7777 want to obtain -2^^(iprec-1). If we are keeping the
7778 precision or narrowing to a signed type, we want to obtain
7780 unsigned prec = oprec > iprec ? iprec : oprec;
7782 if (prec <= HOST_BITS_PER_WIDE_INT)
7784 hi = ~(unsigned HOST_WIDE_INT) 0;
7785 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7789 hi = ((~(unsigned HOST_WIDE_INT) 0)
7790 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7795 return build_int_cst_wide (outer, lo, hi);
7798 /* Return nonzero if two operands that are suitable for PHI nodes are
7799 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7800 SSA_NAME or invariant. Note that this is strictly an optimization.
7801 That is, callers of this function can directly call operand_equal_p
7802 and get the same result, only slower. */
7805 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7809 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7811 return operand_equal_p (arg0, arg1, 0);
7814 /* Returns number of zeros at the end of binary representation of X.
7816 ??? Use ffs if available? */
7819 num_ending_zeros (tree x)
7821 unsigned HOST_WIDE_INT fr, nfr;
7822 unsigned num, abits;
7823 tree type = TREE_TYPE (x);
7825 if (TREE_INT_CST_LOW (x) == 0)
7827 num = HOST_BITS_PER_WIDE_INT;
7828 fr = TREE_INT_CST_HIGH (x);
7833 fr = TREE_INT_CST_LOW (x);
7836 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7839 if (nfr << abits == fr)
7846 if (num > TYPE_PRECISION (type))
7847 num = TYPE_PRECISION (type);
7849 return build_int_cst_type (type, num);
7853 #define WALK_SUBTREE(NODE) \
7856 result = walk_tree (&(NODE), func, data, pset); \
7862 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7863 be walked whenever a type is seen in the tree. Rest of operands and return
7864 value are as for walk_tree. */
7867 walk_type_fields (tree type, walk_tree_fn func, void *data,
7868 struct pointer_set_t *pset)
7870 tree result = NULL_TREE;
7872 switch (TREE_CODE (type))
7875 case REFERENCE_TYPE:
7876 /* We have to worry about mutually recursive pointers. These can't
7877 be written in C. They can in Ada. It's pathological, but
7878 there's an ACATS test (c38102a) that checks it. Deal with this
7879 by checking if we're pointing to another pointer, that one
7880 points to another pointer, that one does too, and we have no htab.
7881 If so, get a hash table. We check three levels deep to avoid
7882 the cost of the hash table if we don't need one. */
7883 if (POINTER_TYPE_P (TREE_TYPE (type))
7884 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7885 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7888 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7896 /* ... fall through ... */
7899 WALK_SUBTREE (TREE_TYPE (type));
7903 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7908 WALK_SUBTREE (TREE_TYPE (type));
7912 /* We never want to walk into default arguments. */
7913 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7914 WALK_SUBTREE (TREE_VALUE (arg));
7919 /* Don't follow this nodes's type if a pointer for fear that
7920 we'll have infinite recursion. If we have a PSET, then we
7923 || (!POINTER_TYPE_P (TREE_TYPE (type))
7924 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
7925 WALK_SUBTREE (TREE_TYPE (type));
7926 WALK_SUBTREE (TYPE_DOMAIN (type));
7930 WALK_SUBTREE (TREE_TYPE (type));
7931 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7941 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7942 called with the DATA and the address of each sub-tree. If FUNC returns a
7943 non-NULL value, the traversal is stopped, and the value returned by FUNC
7944 is returned. If PSET is non-NULL it is used to record the nodes visited,
7945 and to avoid visiting a node more than once. */
7948 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7950 enum tree_code code;
7954 #define WALK_SUBTREE_TAIL(NODE) \
7958 goto tail_recurse; \
7963 /* Skip empty subtrees. */
7967 /* Don't walk the same tree twice, if the user has requested
7968 that we avoid doing so. */
7969 if (pset && pointer_set_insert (pset, *tp))
7972 /* Call the function. */
7974 result = (*func) (tp, &walk_subtrees, data);
7976 /* If we found something, return it. */
7980 code = TREE_CODE (*tp);
7982 /* Even if we didn't, FUNC may have decided that there was nothing
7983 interesting below this point in the tree. */
7986 /* But we still need to check our siblings. */
7987 if (code == TREE_LIST)
7988 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7989 else if (code == OMP_CLAUSE)
7990 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7995 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
7997 if (result || !walk_subtrees)
8003 case IDENTIFIER_NODE:
8009 case PLACEHOLDER_EXPR:
8013 /* None of these have subtrees other than those already walked
8018 WALK_SUBTREE (TREE_VALUE (*tp));
8019 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8024 int len = TREE_VEC_LENGTH (*tp);
8029 /* Walk all elements but the first. */
8031 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8033 /* Now walk the first one as a tail call. */
8034 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8038 WALK_SUBTREE (TREE_REALPART (*tp));
8039 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8043 unsigned HOST_WIDE_INT idx;
8044 constructor_elt *ce;
8047 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8049 WALK_SUBTREE (ce->value);
8054 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8059 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8061 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8062 into declarations that are just mentioned, rather than
8063 declared; they don't really belong to this part of the tree.
8064 And, we can see cycles: the initializer for a declaration
8065 can refer to the declaration itself. */
8066 WALK_SUBTREE (DECL_INITIAL (decl));
8067 WALK_SUBTREE (DECL_SIZE (decl));
8068 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8070 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8073 case STATEMENT_LIST:
8075 tree_stmt_iterator i;
8076 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8077 WALK_SUBTREE (*tsi_stmt_ptr (i));
8082 switch (OMP_CLAUSE_CODE (*tp))
8084 case OMP_CLAUSE_PRIVATE:
8085 case OMP_CLAUSE_SHARED:
8086 case OMP_CLAUSE_FIRSTPRIVATE:
8087 case OMP_CLAUSE_LASTPRIVATE:
8088 case OMP_CLAUSE_COPYIN:
8089 case OMP_CLAUSE_COPYPRIVATE:
8091 case OMP_CLAUSE_NUM_THREADS:
8092 case OMP_CLAUSE_SCHEDULE:
8093 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8096 case OMP_CLAUSE_NOWAIT:
8097 case OMP_CLAUSE_ORDERED:
8098 case OMP_CLAUSE_DEFAULT:
8099 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8101 case OMP_CLAUSE_REDUCTION:
8104 for (i = 0; i < 4; i++)
8105 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8106 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8118 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8119 But, we only want to walk once. */
8120 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8121 for (i = 0; i < len; ++i)
8122 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8123 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8127 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8128 defining. We only want to walk into these fields of a type in this
8129 case and not in the general case of a mere reference to the type.
8131 The criterion is as follows: if the field can be an expression, it
8132 must be walked only here. This should be in keeping with the fields
8133 that are directly gimplified in gimplify_type_sizes in order for the
8134 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8135 variable-sized types.
8137 Note that DECLs get walked as part of processing the BIND_EXPR. */
8138 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8140 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8141 if (TREE_CODE (*type_p) == ERROR_MARK)
8144 /* Call the function for the type. See if it returns anything or
8145 doesn't want us to continue. If we are to continue, walk both
8146 the normal fields and those for the declaration case. */
8147 result = (*func) (type_p, &walk_subtrees, data);
8148 if (result || !walk_subtrees)
8151 result = walk_type_fields (*type_p, func, data, pset);
8155 /* If this is a record type, also walk the fields. */
8156 if (TREE_CODE (*type_p) == RECORD_TYPE
8157 || TREE_CODE (*type_p) == UNION_TYPE
8158 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8162 for (field = TYPE_FIELDS (*type_p); field;
8163 field = TREE_CHAIN (field))
8165 /* We'd like to look at the type of the field, but we can
8166 easily get infinite recursion. So assume it's pointed
8167 to elsewhere in the tree. Also, ignore things that
8169 if (TREE_CODE (field) != FIELD_DECL)
8172 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8173 WALK_SUBTREE (DECL_SIZE (field));
8174 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8175 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8176 WALK_SUBTREE (DECL_QUALIFIER (field));
8180 /* Same for scalar types. */
8181 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8182 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8183 || TREE_CODE (*type_p) == INTEGER_TYPE
8184 || TREE_CODE (*type_p) == REAL_TYPE)
8186 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8187 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8190 WALK_SUBTREE (TYPE_SIZE (*type_p));
8191 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8196 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
8197 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code)))
8201 /* Walk over all the sub-trees of this operand. */
8202 len = TREE_OPERAND_LENGTH (*tp);
8204 /* Go through the subtrees. We need to do this in forward order so
8205 that the scope of a FOR_EXPR is handled properly. */
8208 for (i = 0; i < len - 1; ++i)
8209 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp, i));
8210 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp, len - 1));
8213 /* If this is a type, walk the needed fields in the type. */
8214 else if (TYPE_P (*tp))
8215 return walk_type_fields (*tp, func, data, pset);
8219 /* We didn't find what we were looking for. */
8222 #undef WALK_SUBTREE_TAIL
8226 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8229 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
8232 struct pointer_set_t *pset;
8234 pset = pointer_set_create ();
8235 result = walk_tree (tp, func, data, pset);
8236 pointer_set_destroy (pset);
8241 /* Return true if STMT is an empty statement or contains nothing but
8242 empty statements. */
8245 empty_body_p (tree stmt)
8247 tree_stmt_iterator i;
8250 if (IS_EMPTY_STMT (stmt))
8252 else if (TREE_CODE (stmt) == BIND_EXPR)
8253 body = BIND_EXPR_BODY (stmt);
8254 else if (TREE_CODE (stmt) == STATEMENT_LIST)
8259 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
8260 if (!empty_body_p (tsi_stmt (i)))
8269 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8271 if (IS_EXPR_CODE_CLASS (c))
8272 return &t->exp.block;
8273 else if (IS_GIMPLE_STMT_CODE_CLASS (c))
8274 return &GIMPLE_STMT_BLOCK (t);
8280 generic_tree_operand (tree node, int i)
8282 if (GIMPLE_STMT_P (node))
8283 return &GIMPLE_STMT_OPERAND (node, i);
8284 return &TREE_OPERAND (node, i);
8288 generic_tree_type (tree node)
8290 if (GIMPLE_STMT_P (node))
8291 return &void_type_node;
8292 return &TREE_TYPE (node);
8295 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8296 FIXME: don't use this function. It exists for compatibility with
8297 the old representation of CALL_EXPRs where a list was used to hold the
8298 arguments. Places that currently extract the arglist from a CALL_EXPR
8299 ought to be rewritten to use the CALL_EXPR itself. */
8301 call_expr_arglist (tree exp)
8303 tree arglist = NULL_TREE;
8305 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
8306 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
8310 #include "gt-tree.h"