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 /* If the thing being referenced is not a field, then it is
1990 something language specific. */
1991 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1992 return (*lang_hooks.staticp) (arg);
1994 /* If we are referencing a bitfield, we can't evaluate an
1995 ADDR_EXPR at compile time and so it isn't a constant. */
1996 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1999 return staticp (TREE_OPERAND (arg, 0));
2004 case MISALIGNED_INDIRECT_REF:
2005 case ALIGN_INDIRECT_REF:
2007 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2010 case ARRAY_RANGE_REF:
2011 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2012 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2013 return staticp (TREE_OPERAND (arg, 0));
2018 if ((unsigned int) TREE_CODE (arg)
2019 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2020 return lang_hooks.staticp (arg);
2026 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2027 Do this to any expression which may be used in more than one place,
2028 but must be evaluated only once.
2030 Normally, expand_expr would reevaluate the expression each time.
2031 Calling save_expr produces something that is evaluated and recorded
2032 the first time expand_expr is called on it. Subsequent calls to
2033 expand_expr just reuse the recorded value.
2035 The call to expand_expr that generates code that actually computes
2036 the value is the first call *at compile time*. Subsequent calls
2037 *at compile time* generate code to use the saved value.
2038 This produces correct result provided that *at run time* control
2039 always flows through the insns made by the first expand_expr
2040 before reaching the other places where the save_expr was evaluated.
2041 You, the caller of save_expr, must make sure this is so.
2043 Constants, and certain read-only nodes, are returned with no
2044 SAVE_EXPR because that is safe. Expressions containing placeholders
2045 are not touched; see tree.def for an explanation of what these
2049 save_expr (tree expr)
2051 tree t = fold (expr);
2054 /* If the tree evaluates to a constant, then we don't want to hide that
2055 fact (i.e. this allows further folding, and direct checks for constants).
2056 However, a read-only object that has side effects cannot be bypassed.
2057 Since it is no problem to reevaluate literals, we just return the
2059 inner = skip_simple_arithmetic (t);
2061 if (TREE_INVARIANT (inner)
2062 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2063 || TREE_CODE (inner) == SAVE_EXPR
2064 || TREE_CODE (inner) == ERROR_MARK)
2067 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2068 it means that the size or offset of some field of an object depends on
2069 the value within another field.
2071 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2072 and some variable since it would then need to be both evaluated once and
2073 evaluated more than once. Front-ends must assure this case cannot
2074 happen by surrounding any such subexpressions in their own SAVE_EXPR
2075 and forcing evaluation at the proper time. */
2076 if (contains_placeholder_p (inner))
2079 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2081 /* This expression might be placed ahead of a jump to ensure that the
2082 value was computed on both sides of the jump. So make sure it isn't
2083 eliminated as dead. */
2084 TREE_SIDE_EFFECTS (t) = 1;
2085 TREE_INVARIANT (t) = 1;
2089 /* Look inside EXPR and into any simple arithmetic operations. Return
2090 the innermost non-arithmetic node. */
2093 skip_simple_arithmetic (tree expr)
2097 /* We don't care about whether this can be used as an lvalue in this
2099 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2100 expr = TREE_OPERAND (expr, 0);
2102 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2103 a constant, it will be more efficient to not make another SAVE_EXPR since
2104 it will allow better simplification and GCSE will be able to merge the
2105 computations if they actually occur. */
2109 if (UNARY_CLASS_P (inner))
2110 inner = TREE_OPERAND (inner, 0);
2111 else if (BINARY_CLASS_P (inner))
2113 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2114 inner = TREE_OPERAND (inner, 0);
2115 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2116 inner = TREE_OPERAND (inner, 1);
2127 /* Return which tree structure is used by T. */
2129 enum tree_node_structure_enum
2130 tree_node_structure (tree t)
2132 enum tree_code code = TREE_CODE (t);
2134 switch (TREE_CODE_CLASS (code))
2136 case tcc_declaration:
2141 return TS_FIELD_DECL;
2143 return TS_PARM_DECL;
2147 return TS_LABEL_DECL;
2149 return TS_RESULT_DECL;
2151 return TS_CONST_DECL;
2153 return TS_TYPE_DECL;
2155 return TS_FUNCTION_DECL;
2156 case SYMBOL_MEMORY_TAG:
2157 case NAME_MEMORY_TAG:
2158 case STRUCT_FIELD_TAG:
2159 case MEMORY_PARTITION_TAG:
2160 return TS_MEMORY_TAG;
2162 return TS_DECL_NON_COMMON;
2168 case tcc_comparison:
2171 case tcc_expression:
2175 case tcc_gimple_stmt:
2176 return TS_GIMPLE_STATEMENT;
2177 default: /* tcc_constant and tcc_exceptional */
2182 /* tcc_constant cases. */
2183 case INTEGER_CST: return TS_INT_CST;
2184 case REAL_CST: return TS_REAL_CST;
2185 case COMPLEX_CST: return TS_COMPLEX;
2186 case VECTOR_CST: return TS_VECTOR;
2187 case STRING_CST: return TS_STRING;
2188 /* tcc_exceptional cases. */
2189 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2191 case ERROR_MARK: return TS_COMMON;
2192 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2193 case TREE_LIST: return TS_LIST;
2194 case TREE_VEC: return TS_VEC;
2195 case PHI_NODE: return TS_PHI_NODE;
2196 case SSA_NAME: return TS_SSA_NAME;
2197 case PLACEHOLDER_EXPR: return TS_COMMON;
2198 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2199 case BLOCK: return TS_BLOCK;
2200 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2201 case TREE_BINFO: return TS_BINFO;
2202 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2203 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2210 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2211 or offset that depends on a field within a record. */
2214 contains_placeholder_p (tree exp)
2216 enum tree_code code;
2221 code = TREE_CODE (exp);
2222 if (code == PLACEHOLDER_EXPR)
2225 switch (TREE_CODE_CLASS (code))
2228 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2229 position computations since they will be converted into a
2230 WITH_RECORD_EXPR involving the reference, which will assume
2231 here will be valid. */
2232 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2234 case tcc_exceptional:
2235 if (code == TREE_LIST)
2236 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2237 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2242 case tcc_comparison:
2243 case tcc_expression:
2247 /* Ignoring the first operand isn't quite right, but works best. */
2248 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2251 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2252 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2253 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2259 switch (TREE_CODE_LENGTH (code))
2262 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2264 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2265 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2276 call_expr_arg_iterator iter;
2277 FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
2278 if (CONTAINS_PLACEHOLDER_P (arg))
2292 /* Return true if any part of the computation of TYPE involves a
2293 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2294 (for QUAL_UNION_TYPE) and field positions. */
2297 type_contains_placeholder_1 (tree type)
2299 /* If the size contains a placeholder or the parent type (component type in
2300 the case of arrays) type involves a placeholder, this type does. */
2301 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2302 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2303 || (TREE_TYPE (type) != 0
2304 && type_contains_placeholder_p (TREE_TYPE (type))))
2307 /* Now do type-specific checks. Note that the last part of the check above
2308 greatly limits what we have to do below. */
2309 switch (TREE_CODE (type))
2317 case REFERENCE_TYPE:
2325 /* Here we just check the bounds. */
2326 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2327 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2330 /* We're already checked the component type (TREE_TYPE), so just check
2332 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2336 case QUAL_UNION_TYPE:
2340 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2341 if (TREE_CODE (field) == FIELD_DECL
2342 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2343 || (TREE_CODE (type) == QUAL_UNION_TYPE
2344 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2345 || type_contains_placeholder_p (TREE_TYPE (field))))
2357 type_contains_placeholder_p (tree type)
2361 /* If the contains_placeholder_bits field has been initialized,
2362 then we know the answer. */
2363 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2364 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2366 /* Indicate that we've seen this type node, and the answer is false.
2367 This is what we want to return if we run into recursion via fields. */
2368 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2370 /* Compute the real value. */
2371 result = type_contains_placeholder_1 (type);
2373 /* Store the real value. */
2374 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2379 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2380 return a tree with all occurrences of references to F in a
2381 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2382 contains only arithmetic expressions or a CALL_EXPR with a
2383 PLACEHOLDER_EXPR occurring only in its arglist. */
2386 substitute_in_expr (tree exp, tree f, tree r)
2388 enum tree_code code = TREE_CODE (exp);
2389 tree op0, op1, op2, op3;
2393 /* We handle TREE_LIST and COMPONENT_REF separately. */
2394 if (code == TREE_LIST)
2396 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2397 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2398 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2401 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2403 else if (code == COMPONENT_REF)
2405 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2406 and it is the right field, replace it with R. */
2407 for (inner = TREE_OPERAND (exp, 0);
2408 REFERENCE_CLASS_P (inner);
2409 inner = TREE_OPERAND (inner, 0))
2411 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2412 && TREE_OPERAND (exp, 1) == f)
2415 /* If this expression hasn't been completed let, leave it alone. */
2416 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2419 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2420 if (op0 == TREE_OPERAND (exp, 0))
2423 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2424 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2427 switch (TREE_CODE_CLASS (code))
2430 case tcc_declaration:
2433 case tcc_exceptional:
2436 case tcc_comparison:
2437 case tcc_expression:
2439 switch (TREE_CODE_LENGTH (code))
2445 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2446 if (op0 == TREE_OPERAND (exp, 0))
2449 new = fold_build1 (code, TREE_TYPE (exp), op0);
2453 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2454 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2456 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2459 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2463 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2464 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2465 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2467 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2468 && op2 == TREE_OPERAND (exp, 2))
2471 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2475 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2476 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2477 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2478 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2480 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2481 && op2 == TREE_OPERAND (exp, 2)
2482 && op3 == TREE_OPERAND (exp, 3))
2485 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2495 tree copy = NULL_TREE;
2497 int n = TREE_OPERAND_LENGTH (exp);
2498 for (i = 1; i < n; i++)
2500 tree op = TREE_OPERAND (exp, i);
2501 tree newop = SUBSTITUTE_IN_EXPR (op, f, r);
2504 copy = copy_node (exp);
2505 TREE_OPERAND (copy, i) = newop;
2518 TREE_READONLY (new) = TREE_READONLY (exp);
2522 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2523 for it within OBJ, a tree that is an object or a chain of references. */
2526 substitute_placeholder_in_expr (tree exp, tree obj)
2528 enum tree_code code = TREE_CODE (exp);
2529 tree op0, op1, op2, op3;
2531 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2532 in the chain of OBJ. */
2533 if (code == PLACEHOLDER_EXPR)
2535 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2538 for (elt = obj; elt != 0;
2539 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2540 || TREE_CODE (elt) == COND_EXPR)
2541 ? TREE_OPERAND (elt, 1)
2542 : (REFERENCE_CLASS_P (elt)
2543 || UNARY_CLASS_P (elt)
2544 || BINARY_CLASS_P (elt)
2545 || VL_EXP_CLASS_P (elt)
2546 || EXPRESSION_CLASS_P (elt))
2547 ? TREE_OPERAND (elt, 0) : 0))
2548 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2551 for (elt = obj; elt != 0;
2552 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2553 || TREE_CODE (elt) == COND_EXPR)
2554 ? TREE_OPERAND (elt, 1)
2555 : (REFERENCE_CLASS_P (elt)
2556 || UNARY_CLASS_P (elt)
2557 || BINARY_CLASS_P (elt)
2558 || VL_EXP_CLASS_P (elt)
2559 || EXPRESSION_CLASS_P (elt))
2560 ? TREE_OPERAND (elt, 0) : 0))
2561 if (POINTER_TYPE_P (TREE_TYPE (elt))
2562 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2564 return fold_build1 (INDIRECT_REF, need_type, elt);
2566 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2567 survives until RTL generation, there will be an error. */
2571 /* TREE_LIST is special because we need to look at TREE_VALUE
2572 and TREE_CHAIN, not TREE_OPERANDS. */
2573 else if (code == TREE_LIST)
2575 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2576 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2577 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2580 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2583 switch (TREE_CODE_CLASS (code))
2586 case tcc_declaration:
2589 case tcc_exceptional:
2592 case tcc_comparison:
2593 case tcc_expression:
2596 switch (TREE_CODE_LENGTH (code))
2602 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2603 if (op0 == TREE_OPERAND (exp, 0))
2606 return fold_build1 (code, TREE_TYPE (exp), op0);
2609 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2610 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2612 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2615 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2618 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2619 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2620 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2622 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2623 && op2 == TREE_OPERAND (exp, 2))
2626 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2629 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2630 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2631 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2632 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2634 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2635 && op2 == TREE_OPERAND (exp, 2)
2636 && op3 == TREE_OPERAND (exp, 3))
2639 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2648 tree copy = NULL_TREE;
2650 int n = TREE_OPERAND_LENGTH (exp);
2651 for (i = 1; i < n; i++)
2653 tree op = TREE_OPERAND (exp, i);
2654 tree newop = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2658 copy = copy_node (exp);
2659 TREE_OPERAND (copy, i) = newop;
2673 /* Stabilize a reference so that we can use it any number of times
2674 without causing its operands to be evaluated more than once.
2675 Returns the stabilized reference. This works by means of save_expr,
2676 so see the caveats in the comments about save_expr.
2678 Also allows conversion expressions whose operands are references.
2679 Any other kind of expression is returned unchanged. */
2682 stabilize_reference (tree ref)
2685 enum tree_code code = TREE_CODE (ref);
2692 /* No action is needed in this case. */
2698 case FIX_TRUNC_EXPR:
2699 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2703 result = build_nt (INDIRECT_REF,
2704 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2708 result = build_nt (COMPONENT_REF,
2709 stabilize_reference (TREE_OPERAND (ref, 0)),
2710 TREE_OPERAND (ref, 1), NULL_TREE);
2714 result = build_nt (BIT_FIELD_REF,
2715 stabilize_reference (TREE_OPERAND (ref, 0)),
2716 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2717 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2721 result = build_nt (ARRAY_REF,
2722 stabilize_reference (TREE_OPERAND (ref, 0)),
2723 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2724 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2727 case ARRAY_RANGE_REF:
2728 result = build_nt (ARRAY_RANGE_REF,
2729 stabilize_reference (TREE_OPERAND (ref, 0)),
2730 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2731 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2735 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2736 it wouldn't be ignored. This matters when dealing with
2738 return stabilize_reference_1 (ref);
2740 /* If arg isn't a kind of lvalue we recognize, make no change.
2741 Caller should recognize the error for an invalid lvalue. */
2746 return error_mark_node;
2749 TREE_TYPE (result) = TREE_TYPE (ref);
2750 TREE_READONLY (result) = TREE_READONLY (ref);
2751 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2752 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2757 /* Subroutine of stabilize_reference; this is called for subtrees of
2758 references. Any expression with side-effects must be put in a SAVE_EXPR
2759 to ensure that it is only evaluated once.
2761 We don't put SAVE_EXPR nodes around everything, because assigning very
2762 simple expressions to temporaries causes us to miss good opportunities
2763 for optimizations. Among other things, the opportunity to fold in the
2764 addition of a constant into an addressing mode often gets lost, e.g.
2765 "y[i+1] += x;". In general, we take the approach that we should not make
2766 an assignment unless we are forced into it - i.e., that any non-side effect
2767 operator should be allowed, and that cse should take care of coalescing
2768 multiple utterances of the same expression should that prove fruitful. */
2771 stabilize_reference_1 (tree e)
2774 enum tree_code code = TREE_CODE (e);
2776 /* We cannot ignore const expressions because it might be a reference
2777 to a const array but whose index contains side-effects. But we can
2778 ignore things that are actual constant or that already have been
2779 handled by this function. */
2781 if (TREE_INVARIANT (e))
2784 switch (TREE_CODE_CLASS (code))
2786 case tcc_exceptional:
2788 case tcc_declaration:
2789 case tcc_comparison:
2791 case tcc_expression:
2794 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2795 so that it will only be evaluated once. */
2796 /* The reference (r) and comparison (<) classes could be handled as
2797 below, but it is generally faster to only evaluate them once. */
2798 if (TREE_SIDE_EFFECTS (e))
2799 return save_expr (e);
2803 /* Constants need no processing. In fact, we should never reach
2808 /* Division is slow and tends to be compiled with jumps,
2809 especially the division by powers of 2 that is often
2810 found inside of an array reference. So do it just once. */
2811 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2812 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2813 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2814 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2815 return save_expr (e);
2816 /* Recursively stabilize each operand. */
2817 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2818 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2822 /* Recursively stabilize each operand. */
2823 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2830 TREE_TYPE (result) = TREE_TYPE (e);
2831 TREE_READONLY (result) = TREE_READONLY (e);
2832 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2833 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2834 TREE_INVARIANT (result) = 1;
2839 /* Low-level constructors for expressions. */
2841 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2842 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2845 recompute_tree_invariant_for_addr_expr (tree t)
2848 bool tc = true, ti = true, se = false;
2850 /* We started out assuming this address is both invariant and constant, but
2851 does not have side effects. Now go down any handled components and see if
2852 any of them involve offsets that are either non-constant or non-invariant.
2853 Also check for side-effects.
2855 ??? Note that this code makes no attempt to deal with the case where
2856 taking the address of something causes a copy due to misalignment. */
2858 #define UPDATE_TITCSE(NODE) \
2859 do { tree _node = (NODE); \
2860 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2861 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2862 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2864 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2865 node = TREE_OPERAND (node, 0))
2867 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2868 array reference (probably made temporarily by the G++ front end),
2869 so ignore all the operands. */
2870 if ((TREE_CODE (node) == ARRAY_REF
2871 || TREE_CODE (node) == ARRAY_RANGE_REF)
2872 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2874 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2875 if (TREE_OPERAND (node, 2))
2876 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2877 if (TREE_OPERAND (node, 3))
2878 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2880 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2881 FIELD_DECL, apparently. The G++ front end can put something else
2882 there, at least temporarily. */
2883 else if (TREE_CODE (node) == COMPONENT_REF
2884 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2886 if (TREE_OPERAND (node, 2))
2887 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2889 else if (TREE_CODE (node) == BIT_FIELD_REF)
2890 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2893 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2895 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2896 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2897 invariant and constant if the decl is static. It's also invariant if it's
2898 a decl in the current function. Taking the address of a volatile variable
2899 is not volatile. If it's a constant, the address is both invariant and
2900 constant. Otherwise it's neither. */
2901 if (TREE_CODE (node) == INDIRECT_REF)
2902 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2903 else if (DECL_P (node))
2907 else if (decl_function_context (node) == current_function_decl
2908 /* Addresses of thread-local variables are invariant. */
2909 || (TREE_CODE (node) == VAR_DECL
2910 && DECL_THREAD_LOCAL_P (node)))
2915 else if (CONSTANT_CLASS_P (node))
2920 se |= TREE_SIDE_EFFECTS (node);
2923 TREE_CONSTANT (t) = tc;
2924 TREE_INVARIANT (t) = ti;
2925 TREE_SIDE_EFFECTS (t) = se;
2926 #undef UPDATE_TITCSE
2929 /* Build an expression of code CODE, data type TYPE, and operands as
2930 specified. Expressions and reference nodes can be created this way.
2931 Constants, decls, types and misc nodes cannot be.
2933 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2934 enough for all extant tree codes. */
2937 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2941 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2943 t = make_node_stat (code PASS_MEM_STAT);
2950 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2952 int length = sizeof (struct tree_exp);
2953 #ifdef GATHER_STATISTICS
2954 tree_node_kind kind;
2958 #ifdef GATHER_STATISTICS
2959 switch (TREE_CODE_CLASS (code))
2961 case tcc_statement: /* an expression with side effects */
2964 case tcc_reference: /* a reference */
2972 tree_node_counts[(int) kind]++;
2973 tree_node_sizes[(int) kind] += length;
2976 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2978 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2980 memset (t, 0, sizeof (struct tree_common));
2982 TREE_SET_CODE (t, code);
2984 TREE_TYPE (t) = type;
2985 #ifdef USE_MAPPED_LOCATION
2986 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2988 SET_EXPR_LOCUS (t, NULL);
2990 TREE_OPERAND (t, 0) = node;
2991 TREE_BLOCK (t) = NULL_TREE;
2992 if (node && !TYPE_P (node))
2994 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2995 TREE_READONLY (t) = TREE_READONLY (node);
2998 if (TREE_CODE_CLASS (code) == tcc_statement)
2999 TREE_SIDE_EFFECTS (t) = 1;
3003 /* All of these have side-effects, no matter what their
3005 TREE_SIDE_EFFECTS (t) = 1;
3006 TREE_READONLY (t) = 0;
3009 case MISALIGNED_INDIRECT_REF:
3010 case ALIGN_INDIRECT_REF:
3012 /* Whether a dereference is readonly has nothing to do with whether
3013 its operand is readonly. */
3014 TREE_READONLY (t) = 0;
3019 recompute_tree_invariant_for_addr_expr (t);
3023 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3024 && node && !TYPE_P (node)
3025 && TREE_CONSTANT (node))
3026 TREE_CONSTANT (t) = 1;
3027 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3028 && node && TREE_INVARIANT (node))
3029 TREE_INVARIANT (t) = 1;
3030 if (TREE_CODE_CLASS (code) == tcc_reference
3031 && node && TREE_THIS_VOLATILE (node))
3032 TREE_THIS_VOLATILE (t) = 1;
3039 #define PROCESS_ARG(N) \
3041 TREE_OPERAND (t, N) = arg##N; \
3042 if (arg##N &&!TYPE_P (arg##N)) \
3044 if (TREE_SIDE_EFFECTS (arg##N)) \
3046 if (!TREE_READONLY (arg##N)) \
3048 if (!TREE_CONSTANT (arg##N)) \
3050 if (!TREE_INVARIANT (arg##N)) \
3056 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3058 bool constant, read_only, side_effects, invariant;
3061 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3064 /* FIXME tuples: Statement's aren't expressions! */
3065 if (code == GIMPLE_MODIFY_STMT)
3066 return build_gimple_modify_stmt_stat (arg0, arg1 PASS_MEM_STAT);
3068 /* Must use build_gimple_modify_stmt to construct GIMPLE_MODIFY_STMTs. */
3069 gcc_assert (code != GIMPLE_MODIFY_STMT);
3072 t = make_node_stat (code PASS_MEM_STAT);
3075 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3076 result based on those same flags for the arguments. But if the
3077 arguments aren't really even `tree' expressions, we shouldn't be trying
3080 /* Expressions without side effects may be constant if their
3081 arguments are as well. */
3082 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3083 || TREE_CODE_CLASS (code) == tcc_binary);
3085 side_effects = TREE_SIDE_EFFECTS (t);
3086 invariant = constant;
3091 TREE_READONLY (t) = read_only;
3092 TREE_CONSTANT (t) = constant;
3093 TREE_INVARIANT (t) = invariant;
3094 TREE_SIDE_EFFECTS (t) = side_effects;
3095 TREE_THIS_VOLATILE (t)
3096 = (TREE_CODE_CLASS (code) == tcc_reference
3097 && arg0 && TREE_THIS_VOLATILE (arg0));
3103 /* Build a GIMPLE_MODIFY_STMT node. This tree code doesn't have a
3104 type, so we can't use build2 (a.k.a. build2_stat). */
3107 build_gimple_modify_stmt_stat (tree arg0, tree arg1 MEM_STAT_DECL)
3111 t = make_node_stat (GIMPLE_MODIFY_STMT PASS_MEM_STAT);
3112 /* ?? We don't care about setting flags for tuples... */
3113 GIMPLE_STMT_OPERAND (t, 0) = arg0;
3114 GIMPLE_STMT_OPERAND (t, 1) = arg1;
3119 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3120 tree arg2 MEM_STAT_DECL)
3122 bool constant, read_only, side_effects, invariant;
3125 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3126 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3128 t = make_node_stat (code PASS_MEM_STAT);
3131 /* As a special exception, if COND_EXPR has NULL branches, we
3132 assume that it is a gimple statement and always consider
3133 it to have side effects. */
3134 if (code == COND_EXPR
3135 && tt == void_type_node
3136 && arg1 == NULL_TREE
3137 && arg2 == NULL_TREE)
3138 side_effects = true;
3140 side_effects = TREE_SIDE_EFFECTS (t);
3146 TREE_SIDE_EFFECTS (t) = side_effects;
3147 TREE_THIS_VOLATILE (t)
3148 = (TREE_CODE_CLASS (code) == tcc_reference
3149 && arg0 && TREE_THIS_VOLATILE (arg0));
3155 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3156 tree arg2, tree arg3 MEM_STAT_DECL)
3158 bool constant, read_only, side_effects, invariant;
3161 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3163 t = make_node_stat (code PASS_MEM_STAT);
3166 side_effects = TREE_SIDE_EFFECTS (t);
3173 TREE_SIDE_EFFECTS (t) = side_effects;
3174 TREE_THIS_VOLATILE (t)
3175 = (TREE_CODE_CLASS (code) == tcc_reference
3176 && arg0 && TREE_THIS_VOLATILE (arg0));
3182 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3183 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3185 bool constant, read_only, side_effects, invariant;
3188 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3190 t = make_node_stat (code PASS_MEM_STAT);
3193 side_effects = TREE_SIDE_EFFECTS (t);
3201 TREE_SIDE_EFFECTS (t) = side_effects;
3202 TREE_THIS_VOLATILE (t)
3203 = (TREE_CODE_CLASS (code) == tcc_reference
3204 && arg0 && TREE_THIS_VOLATILE (arg0));
3210 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3211 tree arg2, tree arg3, tree arg4, tree arg5,
3212 tree arg6 MEM_STAT_DECL)
3214 bool constant, read_only, side_effects, invariant;
3217 gcc_assert (code == TARGET_MEM_REF);
3219 t = make_node_stat (code PASS_MEM_STAT);
3222 side_effects = TREE_SIDE_EFFECTS (t);
3232 TREE_SIDE_EFFECTS (t) = side_effects;
3233 TREE_THIS_VOLATILE (t) = 0;
3238 /* Similar except don't specify the TREE_TYPE
3239 and leave the TREE_SIDE_EFFECTS as 0.
3240 It is permissible for arguments to be null,
3241 or even garbage if their values do not matter. */
3244 build_nt (enum tree_code code, ...)
3251 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3255 t = make_node (code);
3256 length = TREE_CODE_LENGTH (code);
3258 for (i = 0; i < length; i++)
3259 TREE_OPERAND (t, i) = va_arg (p, tree);
3265 /* Similar to build_nt, but for creating a CALL_EXPR object with
3266 ARGLIST passed as a list. */
3269 build_nt_call_list (tree fn, tree arglist)
3274 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3275 CALL_EXPR_FN (t) = fn;
3276 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3277 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3278 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3282 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3283 We do NOT enter this node in any sort of symbol table.
3285 layout_decl is used to set up the decl's storage layout.
3286 Other slots are initialized to 0 or null pointers. */
3289 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3293 t = make_node_stat (code PASS_MEM_STAT);
3295 /* if (type == error_mark_node)
3296 type = integer_type_node; */
3297 /* That is not done, deliberately, so that having error_mark_node
3298 as the type can suppress useless errors in the use of this variable. */
3300 DECL_NAME (t) = name;
3301 TREE_TYPE (t) = type;
3303 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3305 else if (code == FUNCTION_DECL)
3306 DECL_MODE (t) = FUNCTION_MODE;
3311 /* Builds and returns function declaration with NAME and TYPE. */
3314 build_fn_decl (const char *name, tree type)
3316 tree id = get_identifier (name);
3317 tree decl = build_decl (FUNCTION_DECL, id, type);
3319 DECL_EXTERNAL (decl) = 1;
3320 TREE_PUBLIC (decl) = 1;
3321 DECL_ARTIFICIAL (decl) = 1;
3322 TREE_NOTHROW (decl) = 1;
3328 /* BLOCK nodes are used to represent the structure of binding contours
3329 and declarations, once those contours have been exited and their contents
3330 compiled. This information is used for outputting debugging info. */
3333 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3335 tree block = make_node (BLOCK);
3337 BLOCK_VARS (block) = vars;
3338 BLOCK_SUBBLOCKS (block) = subblocks;
3339 BLOCK_SUPERCONTEXT (block) = supercontext;
3340 BLOCK_CHAIN (block) = chain;
3344 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3345 /* ??? gengtype doesn't handle conditionals */
3346 static GTY(()) source_locus last_annotated_node;
3349 #ifdef USE_MAPPED_LOCATION
3352 expand_location (source_location loc)
3354 expanded_location xloc;
3363 const struct line_map *map = linemap_lookup (&line_table, loc);
3364 xloc.file = map->to_file;
3365 xloc.line = SOURCE_LINE (map, loc);
3366 xloc.column = SOURCE_COLUMN (map, loc);
3373 /* Record the exact location where an expression or an identifier were
3377 annotate_with_file_line (tree node, const char *file, int line)
3379 /* Roughly one percent of the calls to this function are to annotate
3380 a node with the same information already attached to that node!
3381 Just return instead of wasting memory. */
3382 if (EXPR_LOCUS (node)
3383 && EXPR_LINENO (node) == line
3384 && (EXPR_FILENAME (node) == file
3385 || !strcmp (EXPR_FILENAME (node), file)))
3387 last_annotated_node = EXPR_LOCUS (node);
3391 /* In heavily macroized code (such as GCC itself) this single
3392 entry cache can reduce the number of allocations by more
3394 if (last_annotated_node
3395 && last_annotated_node->line == line
3396 && (last_annotated_node->file == file
3397 || !strcmp (last_annotated_node->file, file)))
3399 SET_EXPR_LOCUS (node, last_annotated_node);
3403 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3404 EXPR_LINENO (node) = line;
3405 EXPR_FILENAME (node) = file;
3406 last_annotated_node = EXPR_LOCUS (node);
3410 annotate_with_locus (tree node, location_t locus)
3412 annotate_with_file_line (node, locus.file, locus.line);
3416 /* Source location accessor functions. */
3419 /* The source location of this expression. Non-tree_exp nodes such as
3420 decls and constants can be shared among multiple locations, so
3423 expr_location (tree node)
3425 #ifdef USE_MAPPED_LOCATION
3426 if (GIMPLE_STMT_P (node))
3427 return GIMPLE_STMT_LOCUS (node);
3428 return EXPR_P (node) ? node->exp.locus : UNKNOWN_LOCATION;
3430 if (GIMPLE_STMT_P (node))
3431 return EXPR_HAS_LOCATION (node)
3432 ? *GIMPLE_STMT_LOCUS (node) : UNKNOWN_LOCATION;
3433 return EXPR_HAS_LOCATION (node) ? *node->exp.locus : UNKNOWN_LOCATION;
3438 set_expr_location (tree node, location_t locus)
3440 #ifdef USE_MAPPED_LOCATION
3441 if (GIMPLE_STMT_P (node))
3442 GIMPLE_STMT_LOCUS (node) = locus;
3444 EXPR_CHECK (node)->exp.locus = locus;
3446 annotate_with_locus (node, locus);
3451 expr_has_location (tree node)
3453 #ifdef USE_MAPPED_LOCATION
3454 return expr_location (node) != UNKNOWN_LOCATION;
3456 return expr_locus (node) != NULL;
3460 #ifdef USE_MAPPED_LOCATION
3465 expr_locus (tree node)
3467 #ifdef USE_MAPPED_LOCATION
3468 if (GIMPLE_STMT_P (node))
3469 return &GIMPLE_STMT_LOCUS (node);
3470 return EXPR_P (node) ? &node->exp.locus : (location_t *) NULL;
3472 if (GIMPLE_STMT_P (node))
3473 return GIMPLE_STMT_LOCUS (node);
3474 /* ?? The cast below was originally "(location_t *)" in the macro,
3475 but that makes no sense. ?? */
3476 return EXPR_P (node) ? node->exp.locus : (source_locus) NULL;
3481 set_expr_locus (tree node,
3482 #ifdef USE_MAPPED_LOCATION
3483 source_location *loc
3489 #ifdef USE_MAPPED_LOCATION
3492 if (GIMPLE_STMT_P (node))
3493 GIMPLE_STMT_LOCUS (node) = UNKNOWN_LOCATION;
3495 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3499 if (GIMPLE_STMT_P (node))
3500 GIMPLE_STMT_LOCUS (node) = *loc;
3502 EXPR_CHECK (node)->exp.locus = *loc;
3505 if (GIMPLE_STMT_P (node))
3506 GIMPLE_STMT_LOCUS (node) = loc;
3508 EXPR_CHECK (node)->exp.locus = loc;
3513 expr_filename (tree node)
3515 #ifdef USE_MAPPED_LOCATION
3516 if (GIMPLE_STMT_P (node))
3517 return &LOCATION_FILE (GIMPLE_STMT_LOCUS (node));
3518 return &LOCATION_FILE (EXPR_CHECK (node)->exp.locus);
3520 if (GIMPLE_STMT_P (node))
3521 return &GIMPLE_STMT_LOCUS (node)->file;
3522 return &(EXPR_CHECK (node)->exp.locus->file);
3527 expr_lineno (tree node)
3529 #ifdef USE_MAPPED_LOCATION
3530 if (GIMPLE_STMT_P (node))
3531 return &LOCATION_LINE (GIMPLE_STMT_LOCUS (node));
3532 return &LOCATION_LINE (EXPR_CHECK (node)->exp.locus);
3534 if (GIMPLE_STMT_P (node))
3535 return &GIMPLE_STMT_LOCUS (node)->line;
3536 return &EXPR_CHECK (node)->exp.locus->line;
3540 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3544 build_decl_attribute_variant (tree ddecl, tree attribute)
3546 DECL_ATTRIBUTES (ddecl) = attribute;
3550 /* Borrowed from hashtab.c iterative_hash implementation. */
3551 #define mix(a,b,c) \
3553 a -= b; a -= c; a ^= (c>>13); \
3554 b -= c; b -= a; b ^= (a<< 8); \
3555 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3556 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3557 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3558 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3559 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3560 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3561 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3565 /* Produce good hash value combining VAL and VAL2. */
3566 static inline hashval_t
3567 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3569 /* the golden ratio; an arbitrary value. */
3570 hashval_t a = 0x9e3779b9;
3576 /* Produce good hash value combining PTR and VAL2. */
3577 static inline hashval_t
3578 iterative_hash_pointer (void *ptr, hashval_t val2)
3580 if (sizeof (ptr) == sizeof (hashval_t))
3581 return iterative_hash_hashval_t ((size_t) ptr, val2);
3584 hashval_t a = (hashval_t) (size_t) ptr;
3585 /* Avoid warnings about shifting of more than the width of the type on
3586 hosts that won't execute this path. */
3588 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3594 /* Produce good hash value combining VAL and VAL2. */
3595 static inline hashval_t
3596 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3598 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3599 return iterative_hash_hashval_t (val, val2);
3602 hashval_t a = (hashval_t) val;
3603 /* Avoid warnings about shifting of more than the width of the type on
3604 hosts that won't execute this path. */
3606 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3608 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3610 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3611 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3618 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3619 is ATTRIBUTE and its qualifiers are QUALS.
3621 Record such modified types already made so we don't make duplicates. */
3624 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3626 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3628 hashval_t hashcode = 0;
3630 enum tree_code code = TREE_CODE (ttype);
3632 ntype = copy_node (ttype);
3634 TYPE_POINTER_TO (ntype) = 0;
3635 TYPE_REFERENCE_TO (ntype) = 0;
3636 TYPE_ATTRIBUTES (ntype) = attribute;
3638 if (TYPE_STRUCTURAL_EQUALITY_P (ttype))
3639 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3641 TYPE_CANONICAL (ntype)
3642 = build_qualified_type (TYPE_CANONICAL (ttype), quals);
3644 /* Create a new main variant of TYPE. */
3645 TYPE_MAIN_VARIANT (ntype) = ntype;
3646 TYPE_NEXT_VARIANT (ntype) = 0;
3647 set_type_quals (ntype, TYPE_UNQUALIFIED);
3649 hashcode = iterative_hash_object (code, hashcode);
3650 if (TREE_TYPE (ntype))
3651 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3653 hashcode = attribute_hash_list (attribute, hashcode);
3655 switch (TREE_CODE (ntype))
3658 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3661 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3665 hashcode = iterative_hash_object
3666 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3667 hashcode = iterative_hash_object
3668 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3672 unsigned int precision = TYPE_PRECISION (ntype);
3673 hashcode = iterative_hash_object (precision, hashcode);
3680 ntype = type_hash_canon (hashcode, ntype);
3682 /* If the target-dependent attributes make NTYPE different from
3683 its canonical type, we will need to use structural equality
3684 checks for this qualified type. */
3685 if (!targetm.comp_type_attributes (ntype, ttype))
3686 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3688 ttype = build_qualified_type (ntype, quals);
3695 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3698 Record such modified types already made so we don't make duplicates. */
3701 build_type_attribute_variant (tree ttype, tree attribute)
3703 return build_type_attribute_qual_variant (ttype, attribute,
3704 TYPE_QUALS (ttype));
3707 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3710 We try both `text' and `__text__', ATTR may be either one. */
3711 /* ??? It might be a reasonable simplification to require ATTR to be only
3712 `text'. One might then also require attribute lists to be stored in
3713 their canonicalized form. */
3716 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3721 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3724 p = IDENTIFIER_POINTER (ident);
3725 ident_len = IDENTIFIER_LENGTH (ident);
3727 if (ident_len == attr_len
3728 && strcmp (attr, p) == 0)
3731 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3734 gcc_assert (attr[1] == '_');
3735 gcc_assert (attr[attr_len - 2] == '_');
3736 gcc_assert (attr[attr_len - 1] == '_');
3737 if (ident_len == attr_len - 4
3738 && strncmp (attr + 2, p, attr_len - 4) == 0)
3743 if (ident_len == attr_len + 4
3744 && p[0] == '_' && p[1] == '_'
3745 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3746 && strncmp (attr, p + 2, attr_len) == 0)
3753 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3756 We try both `text' and `__text__', ATTR may be either one. */
3759 is_attribute_p (const char *attr, tree ident)
3761 return is_attribute_with_length_p (attr, strlen (attr), ident);
3764 /* Given an attribute name and a list of attributes, return a pointer to the
3765 attribute's list element if the attribute is part of the list, or NULL_TREE
3766 if not found. If the attribute appears more than once, this only
3767 returns the first occurrence; the TREE_CHAIN of the return value should
3768 be passed back in if further occurrences are wanted. */
3771 lookup_attribute (const char *attr_name, tree list)
3774 size_t attr_len = strlen (attr_name);
3776 for (l = list; l; l = TREE_CHAIN (l))
3778 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3779 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3786 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3790 remove_attribute (const char *attr_name, tree list)
3793 size_t attr_len = strlen (attr_name);
3795 for (p = &list; *p; )
3798 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3799 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3800 *p = TREE_CHAIN (l);
3802 p = &TREE_CHAIN (l);
3808 /* Return an attribute list that is the union of a1 and a2. */
3811 merge_attributes (tree a1, tree a2)
3815 /* Either one unset? Take the set one. */
3817 if ((attributes = a1) == 0)
3820 /* One that completely contains the other? Take it. */
3822 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3824 if (attribute_list_contained (a2, a1))
3828 /* Pick the longest list, and hang on the other list. */
3830 if (list_length (a1) < list_length (a2))
3831 attributes = a2, a2 = a1;
3833 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3836 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3839 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3842 if (TREE_VALUE (a) != NULL
3843 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3844 && TREE_VALUE (a2) != NULL
3845 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3847 if (simple_cst_list_equal (TREE_VALUE (a),
3848 TREE_VALUE (a2)) == 1)
3851 else if (simple_cst_equal (TREE_VALUE (a),
3852 TREE_VALUE (a2)) == 1)
3857 a1 = copy_node (a2);
3858 TREE_CHAIN (a1) = attributes;
3867 /* Given types T1 and T2, merge their attributes and return
3871 merge_type_attributes (tree t1, tree t2)
3873 return merge_attributes (TYPE_ATTRIBUTES (t1),
3874 TYPE_ATTRIBUTES (t2));
3877 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3881 merge_decl_attributes (tree olddecl, tree newdecl)
3883 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3884 DECL_ATTRIBUTES (newdecl));
3887 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3889 /* Specialization of merge_decl_attributes for various Windows targets.
3891 This handles the following situation:
3893 __declspec (dllimport) int foo;
3896 The second instance of `foo' nullifies the dllimport. */
3899 merge_dllimport_decl_attributes (tree old, tree new)
3902 int delete_dllimport_p = 1;
3904 /* What we need to do here is remove from `old' dllimport if it doesn't
3905 appear in `new'. dllimport behaves like extern: if a declaration is
3906 marked dllimport and a definition appears later, then the object
3907 is not dllimport'd. We also remove a `new' dllimport if the old list
3908 contains dllexport: dllexport always overrides dllimport, regardless
3909 of the order of declaration. */
3910 if (!VAR_OR_FUNCTION_DECL_P (new))
3911 delete_dllimport_p = 0;
3912 else if (DECL_DLLIMPORT_P (new)
3913 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3915 DECL_DLLIMPORT_P (new) = 0;
3916 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3917 "dllimport ignored", new);
3919 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3921 /* Warn about overriding a symbol that has already been used. eg:
3922 extern int __attribute__ ((dllimport)) foo;
3923 int* bar () {return &foo;}
3926 if (TREE_USED (old))
3928 warning (0, "%q+D redeclared without dllimport attribute "
3929 "after being referenced with dll linkage", new);
3930 /* If we have used a variable's address with dllimport linkage,
3931 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3932 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3934 We still remove the attribute so that assembler code refers
3935 to '&foo rather than '_imp__foo'. */
3936 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3937 DECL_DLLIMPORT_P (new) = 1;
3940 /* Let an inline definition silently override the external reference,
3941 but otherwise warn about attribute inconsistency. */
3942 else if (TREE_CODE (new) == VAR_DECL
3943 || !DECL_DECLARED_INLINE_P (new))
3944 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3945 "previous dllimport ignored", new);
3948 delete_dllimport_p = 0;
3950 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3952 if (delete_dllimport_p)
3955 const size_t attr_len = strlen ("dllimport");
3957 /* Scan the list for dllimport and delete it. */
3958 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3960 if (is_attribute_with_length_p ("dllimport", attr_len,
3963 if (prev == NULL_TREE)
3966 TREE_CHAIN (prev) = TREE_CHAIN (t);
3975 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3976 struct attribute_spec.handler. */
3979 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3984 /* These attributes may apply to structure and union types being created,
3985 but otherwise should pass to the declaration involved. */
3988 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3989 | (int) ATTR_FLAG_ARRAY_NEXT))
3991 *no_add_attrs = true;
3992 return tree_cons (name, args, NULL_TREE);
3994 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3996 warning (OPT_Wattributes, "%qs attribute ignored",
3997 IDENTIFIER_POINTER (name));
3998 *no_add_attrs = true;
4004 if (TREE_CODE (node) != FUNCTION_DECL
4005 && TREE_CODE (node) != VAR_DECL)
4007 *no_add_attrs = true;
4008 warning (OPT_Wattributes, "%qs attribute ignored",
4009 IDENTIFIER_POINTER (name));
4013 /* Report error on dllimport ambiguities seen now before they cause
4015 else if (is_attribute_p ("dllimport", name))
4017 /* Honor any target-specific overrides. */
4018 if (!targetm.valid_dllimport_attribute_p (node))
4019 *no_add_attrs = true;
4021 else if (TREE_CODE (node) == FUNCTION_DECL
4022 && DECL_DECLARED_INLINE_P (node))
4024 warning (OPT_Wattributes, "inline function %q+D declared as "
4025 " dllimport: attribute ignored", node);
4026 *no_add_attrs = true;
4028 /* Like MS, treat definition of dllimported variables and
4029 non-inlined functions on declaration as syntax errors. */
4030 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4032 error ("function %q+D definition is marked dllimport", node);
4033 *no_add_attrs = true;
4036 else if (TREE_CODE (node) == VAR_DECL)
4038 if (DECL_INITIAL (node))
4040 error ("variable %q+D definition is marked dllimport",
4042 *no_add_attrs = true;
4045 /* `extern' needn't be specified with dllimport.
4046 Specify `extern' now and hope for the best. Sigh. */
4047 DECL_EXTERNAL (node) = 1;
4048 /* Also, implicitly give dllimport'd variables declared within
4049 a function global scope, unless declared static. */
4050 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4051 TREE_PUBLIC (node) = 1;
4054 if (*no_add_attrs == false)
4055 DECL_DLLIMPORT_P (node) = 1;
4058 /* Report error if symbol is not accessible at global scope. */
4059 if (!TREE_PUBLIC (node)
4060 && (TREE_CODE (node) == VAR_DECL
4061 || TREE_CODE (node) == FUNCTION_DECL))
4063 error ("external linkage required for symbol %q+D because of "
4064 "%qs attribute", node, IDENTIFIER_POINTER (name));
4065 *no_add_attrs = true;
4071 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4073 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4074 of the various TYPE_QUAL values. */
4077 set_type_quals (tree type, int type_quals)
4079 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4080 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4081 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4084 /* Returns true iff cand is equivalent to base with type_quals. */
4087 check_qualified_type (tree cand, tree base, int type_quals)
4089 return (TYPE_QUALS (cand) == type_quals
4090 && TYPE_NAME (cand) == TYPE_NAME (base)
4091 /* Apparently this is needed for Objective-C. */
4092 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4093 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4094 TYPE_ATTRIBUTES (base)));
4097 /* Return a version of the TYPE, qualified as indicated by the
4098 TYPE_QUALS, if one exists. If no qualified version exists yet,
4099 return NULL_TREE. */
4102 get_qualified_type (tree type, int type_quals)
4106 if (TYPE_QUALS (type) == type_quals)
4109 /* Search the chain of variants to see if there is already one there just
4110 like the one we need to have. If so, use that existing one. We must
4111 preserve the TYPE_NAME, since there is code that depends on this. */
4112 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4113 if (check_qualified_type (t, type, type_quals))
4119 /* Like get_qualified_type, but creates the type if it does not
4120 exist. This function never returns NULL_TREE. */
4123 build_qualified_type (tree type, int type_quals)
4127 /* See if we already have the appropriate qualified variant. */
4128 t = get_qualified_type (type, type_quals);
4130 /* If not, build it. */
4133 t = build_variant_type_copy (type);
4134 set_type_quals (t, type_quals);
4136 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4137 /* Propagate structural equality. */
4138 SET_TYPE_STRUCTURAL_EQUALITY (t);
4139 else if (TYPE_CANONICAL (type) != type)
4140 /* Build the underlying canonical type, since it is different
4142 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4145 /* T is its own canonical type. */
4146 TYPE_CANONICAL (t) = t;
4153 /* Create a new distinct copy of TYPE. The new type is made its own
4154 MAIN_VARIANT. If TYPE requires structural equality checks, the
4155 resulting type requires structural equality checks; otherwise, its
4156 TYPE_CANONICAL points to itself. */
4159 build_distinct_type_copy (tree type)
4161 tree t = copy_node (type);
4163 TYPE_POINTER_TO (t) = 0;
4164 TYPE_REFERENCE_TO (t) = 0;
4166 /* Set the canonical type either to a new equivalence class, or
4167 propagate the need for structural equality checks. */
4168 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4169 SET_TYPE_STRUCTURAL_EQUALITY (t);
4171 TYPE_CANONICAL (t) = t;
4173 /* Make it its own variant. */
4174 TYPE_MAIN_VARIANT (t) = t;
4175 TYPE_NEXT_VARIANT (t) = 0;
4177 /* VRP assumes that TREE_TYPE (TYPE_MIN_VALUE (type)) == type. */
4178 if (INTEGRAL_TYPE_P (t) || SCALAR_FLOAT_TYPE_P (t))
4180 if (TYPE_MIN_VALUE (t) != NULL_TREE)
4181 TYPE_MIN_VALUE (t) = fold_convert (t, TYPE_MIN_VALUE (t));
4182 if (TYPE_MAX_VALUE (t) != NULL_TREE)
4183 TYPE_MAX_VALUE (t) = fold_convert (t, TYPE_MAX_VALUE (t));
4189 /* Create a new variant of TYPE, equivalent but distinct. This is so
4190 the caller can modify it. TYPE_CANONICAL for the return type will
4191 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4192 are considered equal by the language itself (or that both types
4193 require structural equality checks). */
4196 build_variant_type_copy (tree type)
4198 tree t, m = TYPE_MAIN_VARIANT (type);
4200 t = build_distinct_type_copy (type);
4202 /* Since we're building a variant, assume that it is a non-semantic
4203 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4204 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4206 /* Add the new type to the chain of variants of TYPE. */
4207 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4208 TYPE_NEXT_VARIANT (m) = t;
4209 TYPE_MAIN_VARIANT (t) = m;
4214 /* Return true if the from tree in both tree maps are equal. */
4217 tree_map_base_eq (const void *va, const void *vb)
4219 const struct tree_map_base *a = va, *b = vb;
4220 return (a->from == b->from);
4223 /* Hash a from tree in a tree_map. */
4226 tree_map_base_hash (const void *item)
4228 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4231 /* Return true if this tree map structure is marked for garbage collection
4232 purposes. We simply return true if the from tree is marked, so that this
4233 structure goes away when the from tree goes away. */
4236 tree_map_base_marked_p (const void *p)
4238 return ggc_marked_p (((struct tree_map_base *) p)->from);
4242 tree_map_hash (const void *item)
4244 return (((const struct tree_map *) item)->hash);
4247 /* Return the initialization priority for DECL. */
4250 decl_init_priority_lookup (tree decl)
4252 struct tree_priority_map *h;
4253 struct tree_map_base in;
4255 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4256 gcc_assert (TREE_CODE (decl) == VAR_DECL
4257 ? DECL_HAS_INIT_PRIORITY_P (decl)
4258 : DECL_STATIC_CONSTRUCTOR (decl));
4260 h = htab_find (init_priority_for_decl, &in);
4261 return h ? h->init : DEFAULT_INIT_PRIORITY;
4264 /* Return the finalization priority for DECL. */
4267 decl_fini_priority_lookup (tree decl)
4269 struct tree_priority_map *h;
4270 struct tree_map_base in;
4272 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4273 gcc_assert (DECL_STATIC_DESTRUCTOR (decl));
4275 h = htab_find (init_priority_for_decl, &in);
4276 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4279 /* Return the initialization and finalization priority information for
4280 DECL. If there is no previous priority information, a freshly
4281 allocated structure is returned. */
4283 static struct tree_priority_map *
4284 decl_priority_info (tree decl)
4286 struct tree_priority_map in;
4287 struct tree_priority_map *h;
4290 in.base.from = decl;
4291 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4295 h = GGC_CNEW (struct tree_priority_map);
4297 h->base.from = decl;
4298 h->init = DEFAULT_INIT_PRIORITY;
4299 h->fini = DEFAULT_INIT_PRIORITY;
4305 /* Set the initialization priority for DECL to PRIORITY. */
4308 decl_init_priority_insert (tree decl, priority_type priority)
4310 struct tree_priority_map *h;
4312 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4313 h = decl_priority_info (decl);
4317 /* Set the finalization priority for DECL to PRIORITY. */
4320 decl_fini_priority_insert (tree decl, priority_type priority)
4322 struct tree_priority_map *h;
4324 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4325 h = decl_priority_info (decl);
4329 /* Look up a restrict qualified base decl for FROM. */
4332 decl_restrict_base_lookup (tree from)
4337 in.base.from = from;
4338 h = htab_find_with_hash (restrict_base_for_decl, &in,
4339 htab_hash_pointer (from));
4340 return h ? h->to : NULL_TREE;
4343 /* Record the restrict qualified base TO for FROM. */
4346 decl_restrict_base_insert (tree from, tree to)
4351 h = ggc_alloc (sizeof (struct tree_map));
4352 h->hash = htab_hash_pointer (from);
4353 h->base.from = from;
4355 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4356 *(struct tree_map **) loc = h;
4359 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4362 print_debug_expr_statistics (void)
4364 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4365 (long) htab_size (debug_expr_for_decl),
4366 (long) htab_elements (debug_expr_for_decl),
4367 htab_collisions (debug_expr_for_decl));
4370 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4373 print_value_expr_statistics (void)
4375 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4376 (long) htab_size (value_expr_for_decl),
4377 (long) htab_elements (value_expr_for_decl),
4378 htab_collisions (value_expr_for_decl));
4381 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4382 don't print anything if the table is empty. */
4385 print_restrict_base_statistics (void)
4387 if (htab_elements (restrict_base_for_decl) != 0)
4389 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4390 (long) htab_size (restrict_base_for_decl),
4391 (long) htab_elements (restrict_base_for_decl),
4392 htab_collisions (restrict_base_for_decl));
4395 /* Lookup a debug expression for FROM, and return it if we find one. */
4398 decl_debug_expr_lookup (tree from)
4400 struct tree_map *h, in;
4401 in.base.from = from;
4403 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4409 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4412 decl_debug_expr_insert (tree from, tree to)
4417 h = ggc_alloc (sizeof (struct tree_map));
4418 h->hash = htab_hash_pointer (from);
4419 h->base.from = from;
4421 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4422 *(struct tree_map **) loc = h;
4425 /* Lookup a value expression for FROM, and return it if we find one. */
4428 decl_value_expr_lookup (tree from)
4430 struct tree_map *h, in;
4431 in.base.from = from;
4433 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4439 /* Insert a mapping FROM->TO in the value expression hashtable. */
4442 decl_value_expr_insert (tree from, tree to)
4447 h = ggc_alloc (sizeof (struct tree_map));
4448 h->hash = htab_hash_pointer (from);
4449 h->base.from = from;
4451 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4452 *(struct tree_map **) loc = h;
4455 /* Hashing of types so that we don't make duplicates.
4456 The entry point is `type_hash_canon'. */
4458 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4459 with types in the TREE_VALUE slots), by adding the hash codes
4460 of the individual types. */
4463 type_hash_list (tree list, hashval_t hashcode)
4467 for (tail = list; tail; tail = TREE_CHAIN (tail))
4468 if (TREE_VALUE (tail) != error_mark_node)
4469 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4475 /* These are the Hashtable callback functions. */
4477 /* Returns true iff the types are equivalent. */
4480 type_hash_eq (const void *va, const void *vb)
4482 const struct type_hash *a = va, *b = vb;
4484 /* First test the things that are the same for all types. */
4485 if (a->hash != b->hash
4486 || TREE_CODE (a->type) != TREE_CODE (b->type)
4487 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4488 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4489 TYPE_ATTRIBUTES (b->type))
4490 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4491 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4494 switch (TREE_CODE (a->type))
4499 case REFERENCE_TYPE:
4503 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4506 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4507 && !(TYPE_VALUES (a->type)
4508 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4509 && TYPE_VALUES (b->type)
4510 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4511 && type_list_equal (TYPE_VALUES (a->type),
4512 TYPE_VALUES (b->type))))
4515 /* ... fall through ... */
4520 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4521 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4522 TYPE_MAX_VALUE (b->type)))
4523 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4524 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4525 TYPE_MIN_VALUE (b->type))));
4528 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4531 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4532 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4533 || (TYPE_ARG_TYPES (a->type)
4534 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4535 && TYPE_ARG_TYPES (b->type)
4536 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4537 && type_list_equal (TYPE_ARG_TYPES (a->type),
4538 TYPE_ARG_TYPES (b->type)))));
4541 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4545 case QUAL_UNION_TYPE:
4546 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4547 || (TYPE_FIELDS (a->type)
4548 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4549 && TYPE_FIELDS (b->type)
4550 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4551 && type_list_equal (TYPE_FIELDS (a->type),
4552 TYPE_FIELDS (b->type))));
4555 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4556 || (TYPE_ARG_TYPES (a->type)
4557 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4558 && TYPE_ARG_TYPES (b->type)
4559 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4560 && type_list_equal (TYPE_ARG_TYPES (a->type),
4561 TYPE_ARG_TYPES (b->type))));
4568 /* Return the cached hash value. */
4571 type_hash_hash (const void *item)
4573 return ((const struct type_hash *) item)->hash;
4576 /* Look in the type hash table for a type isomorphic to TYPE.
4577 If one is found, return it. Otherwise return 0. */
4580 type_hash_lookup (hashval_t hashcode, tree type)
4582 struct type_hash *h, in;
4584 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4585 must call that routine before comparing TYPE_ALIGNs. */
4591 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4597 /* Add an entry to the type-hash-table
4598 for a type TYPE whose hash code is HASHCODE. */
4601 type_hash_add (hashval_t hashcode, tree type)
4603 struct type_hash *h;
4606 h = ggc_alloc (sizeof (struct type_hash));
4609 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4610 *(struct type_hash **) loc = h;
4613 /* Given TYPE, and HASHCODE its hash code, return the canonical
4614 object for an identical type if one already exists.
4615 Otherwise, return TYPE, and record it as the canonical object.
4617 To use this function, first create a type of the sort you want.
4618 Then compute its hash code from the fields of the type that
4619 make it different from other similar types.
4620 Then call this function and use the value. */
4623 type_hash_canon (unsigned int hashcode, tree type)
4627 /* The hash table only contains main variants, so ensure that's what we're
4629 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4631 if (!lang_hooks.types.hash_types)
4634 /* See if the type is in the hash table already. If so, return it.
4635 Otherwise, add the type. */
4636 t1 = type_hash_lookup (hashcode, type);
4639 #ifdef GATHER_STATISTICS
4640 tree_node_counts[(int) t_kind]--;
4641 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4647 type_hash_add (hashcode, type);
4652 /* See if the data pointed to by the type hash table is marked. We consider
4653 it marked if the type is marked or if a debug type number or symbol
4654 table entry has been made for the type. This reduces the amount of
4655 debugging output and eliminates that dependency of the debug output on
4656 the number of garbage collections. */
4659 type_hash_marked_p (const void *p)
4661 tree type = ((struct type_hash *) p)->type;
4663 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4667 print_type_hash_statistics (void)
4669 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4670 (long) htab_size (type_hash_table),
4671 (long) htab_elements (type_hash_table),
4672 htab_collisions (type_hash_table));
4675 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4676 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4677 by adding the hash codes of the individual attributes. */
4680 attribute_hash_list (tree list, hashval_t hashcode)
4684 for (tail = list; tail; tail = TREE_CHAIN (tail))
4685 /* ??? Do we want to add in TREE_VALUE too? */
4686 hashcode = iterative_hash_object
4687 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4691 /* Given two lists of attributes, return true if list l2 is
4692 equivalent to l1. */
4695 attribute_list_equal (tree l1, tree l2)
4697 return attribute_list_contained (l1, l2)
4698 && attribute_list_contained (l2, l1);
4701 /* Given two lists of attributes, return true if list L2 is
4702 completely contained within L1. */
4703 /* ??? This would be faster if attribute names were stored in a canonicalized
4704 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4705 must be used to show these elements are equivalent (which they are). */
4706 /* ??? It's not clear that attributes with arguments will always be handled
4710 attribute_list_contained (tree l1, tree l2)
4714 /* First check the obvious, maybe the lists are identical. */
4718 /* Maybe the lists are similar. */
4719 for (t1 = l1, t2 = l2;
4721 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4722 && TREE_VALUE (t1) == TREE_VALUE (t2);
4723 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4725 /* Maybe the lists are equal. */
4726 if (t1 == 0 && t2 == 0)
4729 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4732 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4734 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4737 if (TREE_VALUE (t2) != NULL
4738 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4739 && TREE_VALUE (attr) != NULL
4740 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4742 if (simple_cst_list_equal (TREE_VALUE (t2),
4743 TREE_VALUE (attr)) == 1)
4746 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4757 /* Given two lists of types
4758 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4759 return 1 if the lists contain the same types in the same order.
4760 Also, the TREE_PURPOSEs must match. */
4763 type_list_equal (tree l1, tree l2)
4767 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4768 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4769 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4770 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4771 && (TREE_TYPE (TREE_PURPOSE (t1))
4772 == TREE_TYPE (TREE_PURPOSE (t2))))))
4778 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4779 given by TYPE. If the argument list accepts variable arguments,
4780 then this function counts only the ordinary arguments. */
4783 type_num_arguments (tree type)
4788 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4789 /* If the function does not take a variable number of arguments,
4790 the last element in the list will have type `void'. */
4791 if (VOID_TYPE_P (TREE_VALUE (t)))
4799 /* Nonzero if integer constants T1 and T2
4800 represent the same constant value. */
4803 tree_int_cst_equal (tree t1, tree t2)
4808 if (t1 == 0 || t2 == 0)
4811 if (TREE_CODE (t1) == INTEGER_CST
4812 && TREE_CODE (t2) == INTEGER_CST
4813 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4814 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4820 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4821 The precise way of comparison depends on their data type. */
4824 tree_int_cst_lt (tree t1, tree t2)
4829 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4831 int t1_sgn = tree_int_cst_sgn (t1);
4832 int t2_sgn = tree_int_cst_sgn (t2);
4834 if (t1_sgn < t2_sgn)
4836 else if (t1_sgn > t2_sgn)
4838 /* Otherwise, both are non-negative, so we compare them as
4839 unsigned just in case one of them would overflow a signed
4842 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4843 return INT_CST_LT (t1, t2);
4845 return INT_CST_LT_UNSIGNED (t1, t2);
4848 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4851 tree_int_cst_compare (tree t1, tree t2)
4853 if (tree_int_cst_lt (t1, t2))
4855 else if (tree_int_cst_lt (t2, t1))
4861 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4862 the host. If POS is zero, the value can be represented in a single
4863 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4864 be represented in a single unsigned HOST_WIDE_INT. */
4867 host_integerp (tree t, int pos)
4869 return (TREE_CODE (t) == INTEGER_CST
4870 && ((TREE_INT_CST_HIGH (t) == 0
4871 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4872 || (! pos && TREE_INT_CST_HIGH (t) == -1
4873 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4874 && !TYPE_UNSIGNED (TREE_TYPE (t)))
4875 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4878 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4879 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4880 be non-negative. We must be able to satisfy the above conditions. */
4883 tree_low_cst (tree t, int pos)
4885 gcc_assert (host_integerp (t, pos));
4886 return TREE_INT_CST_LOW (t);
4889 /* Return the most significant bit of the integer constant T. */
4892 tree_int_cst_msb (tree t)
4896 unsigned HOST_WIDE_INT l;
4898 /* Note that using TYPE_PRECISION here is wrong. We care about the
4899 actual bits, not the (arbitrary) range of the type. */
4900 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4901 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4902 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4903 return (l & 1) == 1;
4906 /* Return an indication of the sign of the integer constant T.
4907 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4908 Note that -1 will never be returned if T's type is unsigned. */
4911 tree_int_cst_sgn (tree t)
4913 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4915 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4917 else if (TREE_INT_CST_HIGH (t) < 0)
4923 /* Compare two constructor-element-type constants. Return 1 if the lists
4924 are known to be equal; otherwise return 0. */
4927 simple_cst_list_equal (tree l1, tree l2)
4929 while (l1 != NULL_TREE && l2 != NULL_TREE)
4931 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4934 l1 = TREE_CHAIN (l1);
4935 l2 = TREE_CHAIN (l2);
4941 /* Return truthvalue of whether T1 is the same tree structure as T2.
4942 Return 1 if they are the same.
4943 Return 0 if they are understandably different.
4944 Return -1 if either contains tree structure not understood by
4948 simple_cst_equal (tree t1, tree t2)
4950 enum tree_code code1, code2;
4956 if (t1 == 0 || t2 == 0)
4959 code1 = TREE_CODE (t1);
4960 code2 = TREE_CODE (t2);
4962 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4964 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4965 || code2 == NON_LVALUE_EXPR)
4966 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4968 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4971 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4972 || code2 == NON_LVALUE_EXPR)
4973 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4981 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4982 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4985 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4988 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4989 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4990 TREE_STRING_LENGTH (t1)));
4994 unsigned HOST_WIDE_INT idx;
4995 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4996 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4998 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5001 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5002 /* ??? Should we handle also fields here? */
5003 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5004 VEC_index (constructor_elt, v2, idx)->value))
5010 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5013 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5016 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5020 call_expr_arg_iterator iter1, iter2;
5021 for (arg1 = first_call_expr_arg (t1, &iter1),
5022 arg2 = first_call_expr_arg (t2, &iter2);
5024 arg1 = next_call_expr_arg (&iter1),
5025 arg2 = next_call_expr_arg (&iter2))
5027 cmp = simple_cst_equal (arg1, arg2);
5031 return arg1 == arg2;
5035 /* Special case: if either target is an unallocated VAR_DECL,
5036 it means that it's going to be unified with whatever the
5037 TARGET_EXPR is really supposed to initialize, so treat it
5038 as being equivalent to anything. */
5039 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5040 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5041 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5042 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5043 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5044 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5047 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5052 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5054 case WITH_CLEANUP_EXPR:
5055 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5059 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5062 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5063 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5077 /* This general rule works for most tree codes. All exceptions should be
5078 handled above. If this is a language-specific tree code, we can't
5079 trust what might be in the operand, so say we don't know
5081 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5084 switch (TREE_CODE_CLASS (code1))
5088 case tcc_comparison:
5089 case tcc_expression:
5093 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5095 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5107 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5108 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5109 than U, respectively. */
5112 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
5114 if (tree_int_cst_sgn (t) < 0)
5116 else if (TREE_INT_CST_HIGH (t) != 0)
5118 else if (TREE_INT_CST_LOW (t) == u)
5120 else if (TREE_INT_CST_LOW (t) < u)
5126 /* Return true if CODE represents an associative tree code. Otherwise
5129 associative_tree_code (enum tree_code code)
5148 /* Return true if CODE represents a commutative tree code. Otherwise
5151 commutative_tree_code (enum tree_code code)
5164 case UNORDERED_EXPR:
5168 case TRUTH_AND_EXPR:
5169 case TRUTH_XOR_EXPR:
5179 /* Generate a hash value for an expression. This can be used iteratively
5180 by passing a previous result as the "val" argument.
5182 This function is intended to produce the same hash for expressions which
5183 would compare equal using operand_equal_p. */
5186 iterative_hash_expr (tree t, hashval_t val)
5189 enum tree_code code;
5193 return iterative_hash_pointer (t, val);
5195 code = TREE_CODE (t);
5199 /* Alas, constants aren't shared, so we can't rely on pointer
5202 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5203 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5206 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5208 return iterative_hash_hashval_t (val2, val);
5211 return iterative_hash (TREE_STRING_POINTER (t),
5212 TREE_STRING_LENGTH (t), val);
5214 val = iterative_hash_expr (TREE_REALPART (t), val);
5215 return iterative_hash_expr (TREE_IMAGPART (t), val);
5217 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5221 /* we can just compare by pointer. */
5222 return iterative_hash_pointer (t, val);
5225 /* A list of expressions, for a CALL_EXPR or as the elements of a
5227 for (; t; t = TREE_CHAIN (t))
5228 val = iterative_hash_expr (TREE_VALUE (t), val);
5232 unsigned HOST_WIDE_INT idx;
5234 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5236 val = iterative_hash_expr (field, val);
5237 val = iterative_hash_expr (value, val);
5242 /* When referring to a built-in FUNCTION_DECL, use the
5243 __builtin__ form. Otherwise nodes that compare equal
5244 according to operand_equal_p might get different
5246 if (DECL_BUILT_IN (t))
5248 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5252 /* else FALL THROUGH */
5254 class = TREE_CODE_CLASS (code);
5256 if (class == tcc_declaration)
5258 /* DECL's have a unique ID */
5259 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5263 gcc_assert (IS_EXPR_CODE_CLASS (class));
5265 val = iterative_hash_object (code, val);
5267 /* Don't hash the type, that can lead to having nodes which
5268 compare equal according to operand_equal_p, but which
5269 have different hash codes. */
5270 if (code == NOP_EXPR
5271 || code == CONVERT_EXPR
5272 || code == NON_LVALUE_EXPR)
5274 /* Make sure to include signness in the hash computation. */
5275 val += TYPE_UNSIGNED (TREE_TYPE (t));
5276 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5279 else if (commutative_tree_code (code))
5281 /* It's a commutative expression. We want to hash it the same
5282 however it appears. We do this by first hashing both operands
5283 and then rehashing based on the order of their independent
5285 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5286 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5290 t = one, one = two, two = t;
5292 val = iterative_hash_hashval_t (one, val);
5293 val = iterative_hash_hashval_t (two, val);
5296 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5297 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5304 /* Constructors for pointer, array and function types.
5305 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5306 constructed by language-dependent code, not here.) */
5308 /* Construct, lay out and return the type of pointers to TO_TYPE with
5309 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5310 reference all of memory. If such a type has already been
5311 constructed, reuse it. */
5314 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5319 if (to_type == error_mark_node)
5320 return error_mark_node;
5322 /* In some cases, languages will have things that aren't a POINTER_TYPE
5323 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5324 In that case, return that type without regard to the rest of our
5327 ??? This is a kludge, but consistent with the way this function has
5328 always operated and there doesn't seem to be a good way to avoid this
5330 if (TYPE_POINTER_TO (to_type) != 0
5331 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5332 return TYPE_POINTER_TO (to_type);
5334 /* First, if we already have a type for pointers to TO_TYPE and it's
5335 the proper mode, use it. */
5336 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5337 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5340 t = make_node (POINTER_TYPE);
5342 TREE_TYPE (t) = to_type;
5343 TYPE_MODE (t) = mode;
5344 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5345 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5346 TYPE_POINTER_TO (to_type) = t;
5348 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5349 SET_TYPE_STRUCTURAL_EQUALITY (t);
5350 else if (TYPE_CANONICAL (to_type) != to_type)
5352 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5353 mode, can_alias_all);
5355 /* Lay out the type. This function has many callers that are concerned
5356 with expression-construction, and this simplifies them all. */
5362 /* By default build pointers in ptr_mode. */
5365 build_pointer_type (tree to_type)
5367 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5370 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5373 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5378 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5379 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5380 In that case, return that type without regard to the rest of our
5383 ??? This is a kludge, but consistent with the way this function has
5384 always operated and there doesn't seem to be a good way to avoid this
5386 if (TYPE_REFERENCE_TO (to_type) != 0
5387 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5388 return TYPE_REFERENCE_TO (to_type);
5390 /* First, if we already have a type for pointers to TO_TYPE and it's
5391 the proper mode, use it. */
5392 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5393 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5396 t = make_node (REFERENCE_TYPE);
5398 TREE_TYPE (t) = to_type;
5399 TYPE_MODE (t) = mode;
5400 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5401 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5402 TYPE_REFERENCE_TO (to_type) = t;
5404 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5405 SET_TYPE_STRUCTURAL_EQUALITY (t);
5406 else if (TYPE_CANONICAL (to_type) != to_type)
5408 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5409 mode, can_alias_all);
5417 /* Build the node for the type of references-to-TO_TYPE by default
5421 build_reference_type (tree to_type)
5423 return build_reference_type_for_mode (to_type, ptr_mode, false);
5426 /* Build a type that is compatible with t but has no cv quals anywhere
5429 const char *const *const * -> char ***. */
5432 build_type_no_quals (tree t)
5434 switch (TREE_CODE (t))
5437 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5439 TYPE_REF_CAN_ALIAS_ALL (t));
5440 case REFERENCE_TYPE:
5442 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5444 TYPE_REF_CAN_ALIAS_ALL (t));
5446 return TYPE_MAIN_VARIANT (t);
5450 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5451 MAXVAL should be the maximum value in the domain
5452 (one less than the length of the array).
5454 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5455 We don't enforce this limit, that is up to caller (e.g. language front end).
5456 The limit exists because the result is a signed type and we don't handle
5457 sizes that use more than one HOST_WIDE_INT. */
5460 build_index_type (tree maxval)
5462 tree itype = make_node (INTEGER_TYPE);
5464 TREE_TYPE (itype) = sizetype;
5465 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5466 TYPE_MIN_VALUE (itype) = size_zero_node;
5467 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5468 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5469 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5470 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5471 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5472 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5474 if (host_integerp (maxval, 1))
5475 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5478 /* Since we cannot hash this type, we need to compare it using
5479 structural equality checks. */
5480 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5485 /* Builds a signed or unsigned integer type of precision PRECISION.
5486 Used for C bitfields whose precision does not match that of
5487 built-in target types. */
5489 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5492 tree itype = make_node (INTEGER_TYPE);
5494 TYPE_PRECISION (itype) = precision;
5497 fixup_unsigned_type (itype);
5499 fixup_signed_type (itype);
5501 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5502 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5507 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5508 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5509 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5512 build_range_type (tree type, tree lowval, tree highval)
5514 tree itype = make_node (INTEGER_TYPE);
5516 TREE_TYPE (itype) = type;
5517 if (type == NULL_TREE)
5520 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5521 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5523 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5524 TYPE_MODE (itype) = TYPE_MODE (type);
5525 TYPE_SIZE (itype) = TYPE_SIZE (type);
5526 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5527 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5528 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5530 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5531 return type_hash_canon (tree_low_cst (highval, 0)
5532 - tree_low_cst (lowval, 0),
5538 /* Just like build_index_type, but takes lowval and highval instead
5539 of just highval (maxval). */
5542 build_index_2_type (tree lowval, tree highval)
5544 return build_range_type (sizetype, lowval, highval);
5547 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5548 and number of elements specified by the range of values of INDEX_TYPE.
5549 If such a type has already been constructed, reuse it. */
5552 build_array_type (tree elt_type, tree index_type)
5555 hashval_t hashcode = 0;
5557 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5559 error ("arrays of functions are not meaningful");
5560 elt_type = integer_type_node;
5563 t = make_node (ARRAY_TYPE);
5564 TREE_TYPE (t) = elt_type;
5565 TYPE_DOMAIN (t) = index_type;
5567 if (index_type == 0)
5570 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5571 t = type_hash_canon (hashcode, t);
5575 if (TYPE_CANONICAL (t) == t)
5577 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5578 SET_TYPE_STRUCTURAL_EQUALITY (t);
5579 else if (TYPE_CANONICAL (elt_type) != elt_type)
5581 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5587 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5588 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5589 t = type_hash_canon (hashcode, t);
5591 if (!COMPLETE_TYPE_P (t))
5594 if (TYPE_CANONICAL (t) == t)
5596 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5597 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5598 SET_TYPE_STRUCTURAL_EQUALITY (t);
5599 else if (TYPE_CANONICAL (elt_type) != elt_type
5600 || TYPE_CANONICAL (index_type) != index_type)
5602 = build_array_type (TYPE_CANONICAL (elt_type),
5603 TYPE_CANONICAL (index_type));
5609 /* Return the TYPE of the elements comprising
5610 the innermost dimension of ARRAY. */
5613 get_inner_array_type (tree array)
5615 tree type = TREE_TYPE (array);
5617 while (TREE_CODE (type) == ARRAY_TYPE)
5618 type = TREE_TYPE (type);
5623 /* Construct, lay out and return
5624 the type of functions returning type VALUE_TYPE
5625 given arguments of types ARG_TYPES.
5626 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5627 are data type nodes for the arguments of the function.
5628 If such a type has already been constructed, reuse it. */
5631 build_function_type (tree value_type, tree arg_types)
5634 hashval_t hashcode = 0;
5636 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5638 error ("function return type cannot be function");
5639 value_type = integer_type_node;
5642 /* Make a node of the sort we want. */
5643 t = make_node (FUNCTION_TYPE);
5644 TREE_TYPE (t) = value_type;
5645 TYPE_ARG_TYPES (t) = arg_types;
5647 /* We don't have canonicalization of function types, yet. */
5648 SET_TYPE_STRUCTURAL_EQUALITY (t);
5650 /* If we already have such a type, use the old one. */
5651 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5652 hashcode = type_hash_list (arg_types, hashcode);
5653 t = type_hash_canon (hashcode, t);
5655 if (!COMPLETE_TYPE_P (t))
5660 /* Build a function type. The RETURN_TYPE is the type returned by the
5661 function. If additional arguments are provided, they are
5662 additional argument types. The list of argument types must always
5663 be terminated by NULL_TREE. */
5666 build_function_type_list (tree return_type, ...)
5671 va_start (p, return_type);
5673 t = va_arg (p, tree);
5674 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5675 args = tree_cons (NULL_TREE, t, args);
5677 if (args == NULL_TREE)
5678 args = void_list_node;
5682 args = nreverse (args);
5683 TREE_CHAIN (last) = void_list_node;
5685 args = build_function_type (return_type, args);
5691 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5692 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5693 for the method. An implicit additional parameter (of type
5694 pointer-to-BASETYPE) is added to the ARGTYPES. */
5697 build_method_type_directly (tree basetype,
5705 /* Make a node of the sort we want. */
5706 t = make_node (METHOD_TYPE);
5708 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5709 TREE_TYPE (t) = rettype;
5710 ptype = build_pointer_type (basetype);
5712 /* The actual arglist for this function includes a "hidden" argument
5713 which is "this". Put it into the list of argument types. */
5714 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5715 TYPE_ARG_TYPES (t) = argtypes;
5717 /* We don't have canonicalization of method types yet. */
5718 SET_TYPE_STRUCTURAL_EQUALITY (t);
5720 /* If we already have such a type, use the old one. */
5721 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5722 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5723 hashcode = type_hash_list (argtypes, hashcode);
5724 t = type_hash_canon (hashcode, t);
5726 if (!COMPLETE_TYPE_P (t))
5732 /* Construct, lay out and return the type of methods belonging to class
5733 BASETYPE and whose arguments and values are described by TYPE.
5734 If that type exists already, reuse it.
5735 TYPE must be a FUNCTION_TYPE node. */
5738 build_method_type (tree basetype, tree type)
5740 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5742 return build_method_type_directly (basetype,
5744 TYPE_ARG_TYPES (type));
5747 /* Construct, lay out and return the type of offsets to a value
5748 of type TYPE, within an object of type BASETYPE.
5749 If a suitable offset type exists already, reuse it. */
5752 build_offset_type (tree basetype, tree type)
5755 hashval_t hashcode = 0;
5757 /* Make a node of the sort we want. */
5758 t = make_node (OFFSET_TYPE);
5760 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5761 TREE_TYPE (t) = type;
5763 /* If we already have such a type, use the old one. */
5764 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5765 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5766 t = type_hash_canon (hashcode, t);
5768 if (!COMPLETE_TYPE_P (t))
5771 if (TYPE_CANONICAL (t) == t)
5773 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5774 || TYPE_STRUCTURAL_EQUALITY_P (type))
5775 SET_TYPE_STRUCTURAL_EQUALITY (t);
5776 else if (TYPE_CANONICAL (basetype) != basetype
5777 || TYPE_CANONICAL (type) != type)
5779 = build_offset_type (TYPE_CANONICAL (basetype),
5780 TYPE_CANONICAL (type));
5786 /* Create a complex type whose components are COMPONENT_TYPE. */
5789 build_complex_type (tree component_type)
5794 /* Make a node of the sort we want. */
5795 t = make_node (COMPLEX_TYPE);
5797 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5799 /* If we already have such a type, use the old one. */
5800 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5801 t = type_hash_canon (hashcode, t);
5803 if (!COMPLETE_TYPE_P (t))
5806 if (TYPE_CANONICAL (t) == t)
5808 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
5809 SET_TYPE_STRUCTURAL_EQUALITY (t);
5810 else if (TYPE_CANONICAL (component_type) != component_type)
5812 = build_complex_type (TYPE_CANONICAL (component_type));
5815 /* If we are writing Dwarf2 output we need to create a name,
5816 since complex is a fundamental type. */
5817 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5821 if (component_type == char_type_node)
5822 name = "complex char";
5823 else if (component_type == signed_char_type_node)
5824 name = "complex signed char";
5825 else if (component_type == unsigned_char_type_node)
5826 name = "complex unsigned char";
5827 else if (component_type == short_integer_type_node)
5828 name = "complex short int";
5829 else if (component_type == short_unsigned_type_node)
5830 name = "complex short unsigned int";
5831 else if (component_type == integer_type_node)
5832 name = "complex int";
5833 else if (component_type == unsigned_type_node)
5834 name = "complex unsigned int";
5835 else if (component_type == long_integer_type_node)
5836 name = "complex long int";
5837 else if (component_type == long_unsigned_type_node)
5838 name = "complex long unsigned int";
5839 else if (component_type == long_long_integer_type_node)
5840 name = "complex long long int";
5841 else if (component_type == long_long_unsigned_type_node)
5842 name = "complex long long unsigned int";
5847 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
5850 return build_qualified_type (t, TYPE_QUALS (component_type));
5853 /* Return OP, stripped of any conversions to wider types as much as is safe.
5854 Converting the value back to OP's type makes a value equivalent to OP.
5856 If FOR_TYPE is nonzero, we return a value which, if converted to
5857 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5859 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5860 narrowest type that can hold the value, even if they don't exactly fit.
5861 Otherwise, bit-field references are changed to a narrower type
5862 only if they can be fetched directly from memory in that type.
5864 OP must have integer, real or enumeral type. Pointers are not allowed!
5866 There are some cases where the obvious value we could return
5867 would regenerate to OP if converted to OP's type,
5868 but would not extend like OP to wider types.
5869 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5870 For example, if OP is (unsigned short)(signed char)-1,
5871 we avoid returning (signed char)-1 if FOR_TYPE is int,
5872 even though extending that to an unsigned short would regenerate OP,
5873 since the result of extending (signed char)-1 to (int)
5874 is different from (int) OP. */
5877 get_unwidened (tree op, tree for_type)
5879 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5880 tree type = TREE_TYPE (op);
5882 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5884 = (for_type != 0 && for_type != type
5885 && final_prec > TYPE_PRECISION (type)
5886 && TYPE_UNSIGNED (type));
5889 while (TREE_CODE (op) == NOP_EXPR
5890 || TREE_CODE (op) == CONVERT_EXPR)
5894 /* TYPE_PRECISION on vector types has different meaning
5895 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5896 so avoid them here. */
5897 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5900 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5901 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5903 /* Truncations are many-one so cannot be removed.
5904 Unless we are later going to truncate down even farther. */
5906 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5909 /* See what's inside this conversion. If we decide to strip it,
5911 op = TREE_OPERAND (op, 0);
5913 /* If we have not stripped any zero-extensions (uns is 0),
5914 we can strip any kind of extension.
5915 If we have previously stripped a zero-extension,
5916 only zero-extensions can safely be stripped.
5917 Any extension can be stripped if the bits it would produce
5918 are all going to be discarded later by truncating to FOR_TYPE. */
5922 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5924 /* TYPE_UNSIGNED says whether this is a zero-extension.
5925 Let's avoid computing it if it does not affect WIN
5926 and if UNS will not be needed again. */
5928 || TREE_CODE (op) == NOP_EXPR
5929 || TREE_CODE (op) == CONVERT_EXPR)
5930 && TYPE_UNSIGNED (TREE_TYPE (op)))
5938 if (TREE_CODE (op) == COMPONENT_REF
5939 /* Since type_for_size always gives an integer type. */
5940 && TREE_CODE (type) != REAL_TYPE
5941 /* Don't crash if field not laid out yet. */
5942 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5943 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5945 unsigned int innerprec
5946 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5947 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5948 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5949 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5951 /* We can get this structure field in the narrowest type it fits in.
5952 If FOR_TYPE is 0, do this only for a field that matches the
5953 narrower type exactly and is aligned for it
5954 The resulting extension to its nominal type (a fullword type)
5955 must fit the same conditions as for other extensions. */
5958 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5959 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5960 && (! uns || final_prec <= innerprec || unsignedp))
5962 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5963 TREE_OPERAND (op, 1), NULL_TREE);
5964 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5965 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5972 /* Return OP or a simpler expression for a narrower value
5973 which can be sign-extended or zero-extended to give back OP.
5974 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5975 or 0 if the value should be sign-extended. */
5978 get_narrower (tree op, int *unsignedp_ptr)
5983 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5985 while (TREE_CODE (op) == NOP_EXPR)
5988 = (TYPE_PRECISION (TREE_TYPE (op))
5989 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5991 /* Truncations are many-one so cannot be removed. */
5995 /* See what's inside this conversion. If we decide to strip it,
6000 op = TREE_OPERAND (op, 0);
6001 /* An extension: the outermost one can be stripped,
6002 but remember whether it is zero or sign extension. */
6004 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6005 /* Otherwise, if a sign extension has been stripped,
6006 only sign extensions can now be stripped;
6007 if a zero extension has been stripped, only zero-extensions. */
6008 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6012 else /* bitschange == 0 */
6014 /* A change in nominal type can always be stripped, but we must
6015 preserve the unsignedness. */
6017 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6019 op = TREE_OPERAND (op, 0);
6020 /* Keep trying to narrow, but don't assign op to win if it
6021 would turn an integral type into something else. */
6022 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6029 if (TREE_CODE (op) == COMPONENT_REF
6030 /* Since type_for_size always gives an integer type. */
6031 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6032 /* Ensure field is laid out already. */
6033 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6034 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6036 unsigned HOST_WIDE_INT innerprec
6037 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6038 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6039 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6040 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6042 /* We can get this structure field in a narrower type that fits it,
6043 but the resulting extension to its nominal type (a fullword type)
6044 must satisfy the same conditions as for other extensions.
6046 Do this only for fields that are aligned (not bit-fields),
6047 because when bit-field insns will be used there is no
6048 advantage in doing this. */
6050 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6051 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6052 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6056 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6057 win = fold_convert (type, op);
6061 *unsignedp_ptr = uns;
6065 /* Nonzero if integer constant C has a value that is permissible
6066 for type TYPE (an INTEGER_TYPE). */
6069 int_fits_type_p (tree c, tree type)
6071 tree type_low_bound = TYPE_MIN_VALUE (type);
6072 tree type_high_bound = TYPE_MAX_VALUE (type);
6073 bool ok_for_low_bound, ok_for_high_bound;
6074 unsigned HOST_WIDE_INT low;
6077 /* If at least one bound of the type is a constant integer, we can check
6078 ourselves and maybe make a decision. If no such decision is possible, but
6079 this type is a subtype, try checking against that. Otherwise, use
6080 fit_double_type, which checks against the precision.
6082 Compute the status for each possibly constant bound, and return if we see
6083 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6084 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6085 for "constant known to fit". */
6087 /* Check if C >= type_low_bound. */
6088 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6090 if (tree_int_cst_lt (c, type_low_bound))
6092 ok_for_low_bound = true;
6095 ok_for_low_bound = false;
6097 /* Check if c <= type_high_bound. */
6098 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6100 if (tree_int_cst_lt (type_high_bound, c))
6102 ok_for_high_bound = true;
6105 ok_for_high_bound = false;
6107 /* If the constant fits both bounds, the result is known. */
6108 if (ok_for_low_bound && ok_for_high_bound)
6111 /* Perform some generic filtering which may allow making a decision
6112 even if the bounds are not constant. First, negative integers
6113 never fit in unsigned types, */
6114 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6117 /* Second, narrower types always fit in wider ones. */
6118 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6121 /* Third, unsigned integers with top bit set never fit signed types. */
6122 if (! TYPE_UNSIGNED (type)
6123 && TYPE_UNSIGNED (TREE_TYPE (c))
6124 && tree_int_cst_msb (c))
6127 /* If we haven't been able to decide at this point, there nothing more we
6128 can check ourselves here. Look at the base type if we have one and it
6129 has the same precision. */
6130 if (TREE_CODE (type) == INTEGER_TYPE
6131 && TREE_TYPE (type) != 0
6132 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6133 return int_fits_type_p (c, TREE_TYPE (type));
6135 /* Or to fit_double_type, if nothing else. */
6136 low = TREE_INT_CST_LOW (c);
6137 high = TREE_INT_CST_HIGH (c);
6138 return !fit_double_type (low, high, &low, &high, type);
6141 /* Subprogram of following function. Called by walk_tree.
6143 Return *TP if it is an automatic variable or parameter of the
6144 function passed in as DATA. */
6147 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6149 tree fn = (tree) data;
6154 else if (DECL_P (*tp)
6155 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
6161 /* Returns true if T is, contains, or refers to a type with variable
6162 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6163 arguments, but not the return type. If FN is nonzero, only return
6164 true if a modifier of the type or position of FN is a variable or
6165 parameter inside FN.
6167 This concept is more general than that of C99 'variably modified types':
6168 in C99, a struct type is never variably modified because a VLA may not
6169 appear as a structure member. However, in GNU C code like:
6171 struct S { int i[f()]; };
6173 is valid, and other languages may define similar constructs. */
6176 variably_modified_type_p (tree type, tree fn)
6180 /* Test if T is either variable (if FN is zero) or an expression containing
6181 a variable in FN. */
6182 #define RETURN_TRUE_IF_VAR(T) \
6183 do { tree _t = (T); \
6184 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6185 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6186 return true; } while (0)
6188 if (type == error_mark_node)
6191 /* If TYPE itself has variable size, it is variably modified. */
6192 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6193 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6195 switch (TREE_CODE (type))
6198 case REFERENCE_TYPE:
6200 if (variably_modified_type_p (TREE_TYPE (type), fn))
6206 /* If TYPE is a function type, it is variably modified if the
6207 return type is variably modified. */
6208 if (variably_modified_type_p (TREE_TYPE (type), fn))
6216 /* Scalar types are variably modified if their end points
6218 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6219 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6224 case QUAL_UNION_TYPE:
6225 /* We can't see if any of the fields are variably-modified by the
6226 definition we normally use, since that would produce infinite
6227 recursion via pointers. */
6228 /* This is variably modified if some field's type is. */
6229 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6230 if (TREE_CODE (t) == FIELD_DECL)
6232 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6233 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6234 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6236 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6237 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6242 /* Do not call ourselves to avoid infinite recursion. This is
6243 variably modified if the element type is. */
6244 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6245 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6252 /* The current language may have other cases to check, but in general,
6253 all other types are not variably modified. */
6254 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6256 #undef RETURN_TRUE_IF_VAR
6259 /* Given a DECL or TYPE, return the scope in which it was declared, or
6260 NULL_TREE if there is no containing scope. */
6263 get_containing_scope (tree t)
6265 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6268 /* Return the innermost context enclosing DECL that is
6269 a FUNCTION_DECL, or zero if none. */
6272 decl_function_context (tree decl)
6276 if (TREE_CODE (decl) == ERROR_MARK)
6279 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6280 where we look up the function at runtime. Such functions always take
6281 a first argument of type 'pointer to real context'.
6283 C++ should really be fixed to use DECL_CONTEXT for the real context,
6284 and use something else for the "virtual context". */
6285 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6288 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6290 context = DECL_CONTEXT (decl);
6292 while (context && TREE_CODE (context) != FUNCTION_DECL)
6294 if (TREE_CODE (context) == BLOCK)
6295 context = BLOCK_SUPERCONTEXT (context);
6297 context = get_containing_scope (context);
6303 /* Return the innermost context enclosing DECL that is
6304 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6305 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6308 decl_type_context (tree decl)
6310 tree context = DECL_CONTEXT (decl);
6313 switch (TREE_CODE (context))
6315 case NAMESPACE_DECL:
6316 case TRANSLATION_UNIT_DECL:
6321 case QUAL_UNION_TYPE:
6326 context = DECL_CONTEXT (context);
6330 context = BLOCK_SUPERCONTEXT (context);
6340 /* CALL is a CALL_EXPR. Return the declaration for the function
6341 called, or NULL_TREE if the called function cannot be
6345 get_callee_fndecl (tree call)
6349 if (call == error_mark_node)
6352 /* It's invalid to call this function with anything but a
6354 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6356 /* The first operand to the CALL is the address of the function
6358 addr = CALL_EXPR_FN (call);
6362 /* If this is a readonly function pointer, extract its initial value. */
6363 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6364 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6365 && DECL_INITIAL (addr))
6366 addr = DECL_INITIAL (addr);
6368 /* If the address is just `&f' for some function `f', then we know
6369 that `f' is being called. */
6370 if (TREE_CODE (addr) == ADDR_EXPR
6371 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6372 return TREE_OPERAND (addr, 0);
6374 /* We couldn't figure out what was being called. Maybe the front
6375 end has some idea. */
6376 return lang_hooks.lang_get_callee_fndecl (call);
6379 /* Print debugging information about tree nodes generated during the compile,
6380 and any language-specific information. */
6383 dump_tree_statistics (void)
6385 #ifdef GATHER_STATISTICS
6387 int total_nodes, total_bytes;
6390 fprintf (stderr, "\n??? tree nodes created\n\n");
6391 #ifdef GATHER_STATISTICS
6392 fprintf (stderr, "Kind Nodes Bytes\n");
6393 fprintf (stderr, "---------------------------------------\n");
6394 total_nodes = total_bytes = 0;
6395 for (i = 0; i < (int) all_kinds; i++)
6397 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6398 tree_node_counts[i], tree_node_sizes[i]);
6399 total_nodes += tree_node_counts[i];
6400 total_bytes += tree_node_sizes[i];
6402 fprintf (stderr, "---------------------------------------\n");
6403 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6404 fprintf (stderr, "---------------------------------------\n");
6405 ssanames_print_statistics ();
6406 phinodes_print_statistics ();
6408 fprintf (stderr, "(No per-node statistics)\n");
6410 print_type_hash_statistics ();
6411 print_debug_expr_statistics ();
6412 print_value_expr_statistics ();
6413 print_restrict_base_statistics ();
6414 lang_hooks.print_statistics ();
6417 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6419 /* Generate a crc32 of a string. */
6422 crc32_string (unsigned chksum, const char *string)
6426 unsigned value = *string << 24;
6429 for (ix = 8; ix--; value <<= 1)
6433 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6442 /* P is a string that will be used in a symbol. Mask out any characters
6443 that are not valid in that context. */
6446 clean_symbol_name (char *p)
6450 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6453 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6460 /* Generate a name for a special-purpose function function.
6461 The generated name may need to be unique across the whole link.
6462 TYPE is some string to identify the purpose of this function to the
6463 linker or collect2; it must start with an uppercase letter,
6465 I - for constructors
6467 N - for C++ anonymous namespaces
6468 F - for DWARF unwind frame information. */
6471 get_file_function_name (const char *type)
6477 /* If we already have a name we know to be unique, just use that. */
6478 if (first_global_object_name)
6479 p = first_global_object_name;
6480 /* If the target is handling the constructors/destructors, they
6481 will be local to this file and the name is only necessary for
6482 debugging purposes. */
6483 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6485 const char *file = main_input_filename;
6487 file = input_filename;
6488 /* Just use the file's basename, because the full pathname
6489 might be quite long. */
6490 p = strrchr (file, '/');
6495 p = q = ASTRDUP (p);
6496 clean_symbol_name (q);
6500 /* Otherwise, the name must be unique across the entire link.
6501 We don't have anything that we know to be unique to this translation
6502 unit, so use what we do have and throw in some randomness. */
6504 const char *name = weak_global_object_name;
6505 const char *file = main_input_filename;
6510 file = input_filename;
6512 len = strlen (file);
6513 q = alloca (9 * 2 + len + 1);
6514 memcpy (q, file, len + 1);
6515 clean_symbol_name (q);
6517 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6518 crc32_string (0, get_random_seed (false)));
6523 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6525 /* Set up the name of the file-level functions we may need.
6526 Use a global object (which is already required to be unique over
6527 the program) rather than the file name (which imposes extra
6529 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6531 return get_identifier (buf);
6534 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6536 /* Complain that the tree code of NODE does not match the expected 0
6537 terminated list of trailing codes. The trailing code list can be
6538 empty, for a more vague error message. FILE, LINE, and FUNCTION
6539 are of the caller. */
6542 tree_check_failed (const tree node, const char *file,
6543 int line, const char *function, ...)
6547 unsigned length = 0;
6550 va_start (args, function);
6551 while ((code = va_arg (args, int)))
6552 length += 4 + strlen (tree_code_name[code]);
6556 va_start (args, function);
6557 length += strlen ("expected ");
6558 buffer = alloca (length);
6560 while ((code = va_arg (args, int)))
6562 const char *prefix = length ? " or " : "expected ";
6564 strcpy (buffer + length, prefix);
6565 length += strlen (prefix);
6566 strcpy (buffer + length, tree_code_name[code]);
6567 length += strlen (tree_code_name[code]);
6572 buffer = (char *)"unexpected node";
6574 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6575 buffer, tree_code_name[TREE_CODE (node)],
6576 function, trim_filename (file), line);
6579 /* Complain that the tree code of NODE does match the expected 0
6580 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6584 tree_not_check_failed (const tree node, const char *file,
6585 int line, const char *function, ...)
6589 unsigned length = 0;
6592 va_start (args, function);
6593 while ((code = va_arg (args, int)))
6594 length += 4 + strlen (tree_code_name[code]);
6596 va_start (args, function);
6597 buffer = alloca (length);
6599 while ((code = va_arg (args, int)))
6603 strcpy (buffer + length, " or ");
6606 strcpy (buffer + length, tree_code_name[code]);
6607 length += strlen (tree_code_name[code]);
6611 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6612 buffer, tree_code_name[TREE_CODE (node)],
6613 function, trim_filename (file), line);
6616 /* Similar to tree_check_failed, except that we check for a class of tree
6617 code, given in CL. */
6620 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6621 const char *file, int line, const char *function)
6624 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6625 TREE_CODE_CLASS_STRING (cl),
6626 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6627 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6630 /* Similar to tree_check_failed, except that instead of specifying a
6631 dozen codes, use the knowledge that they're all sequential. */
6634 tree_range_check_failed (const tree node, const char *file, int line,
6635 const char *function, enum tree_code c1,
6639 unsigned length = 0;
6642 for (c = c1; c <= c2; ++c)
6643 length += 4 + strlen (tree_code_name[c]);
6645 length += strlen ("expected ");
6646 buffer = alloca (length);
6649 for (c = c1; c <= c2; ++c)
6651 const char *prefix = length ? " or " : "expected ";
6653 strcpy (buffer + length, prefix);
6654 length += strlen (prefix);
6655 strcpy (buffer + length, tree_code_name[c]);
6656 length += strlen (tree_code_name[c]);
6659 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6660 buffer, tree_code_name[TREE_CODE (node)],
6661 function, trim_filename (file), line);
6665 /* Similar to tree_check_failed, except that we check that a tree does
6666 not have the specified code, given in CL. */
6669 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6670 const char *file, int line, const char *function)
6673 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6674 TREE_CODE_CLASS_STRING (cl),
6675 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6676 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6680 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6683 omp_clause_check_failed (const tree node, const char *file, int line,
6684 const char *function, enum omp_clause_code code)
6686 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6687 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6688 function, trim_filename (file), line);
6692 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6695 omp_clause_range_check_failed (const tree node, const char *file, int line,
6696 const char *function, enum omp_clause_code c1,
6697 enum omp_clause_code c2)
6700 unsigned length = 0;
6701 enum omp_clause_code c;
6703 for (c = c1; c <= c2; ++c)
6704 length += 4 + strlen (omp_clause_code_name[c]);
6706 length += strlen ("expected ");
6707 buffer = alloca (length);
6710 for (c = c1; c <= c2; ++c)
6712 const char *prefix = length ? " or " : "expected ";
6714 strcpy (buffer + length, prefix);
6715 length += strlen (prefix);
6716 strcpy (buffer + length, omp_clause_code_name[c]);
6717 length += strlen (omp_clause_code_name[c]);
6720 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6721 buffer, omp_clause_code_name[TREE_CODE (node)],
6722 function, trim_filename (file), line);
6726 #undef DEFTREESTRUCT
6727 #define DEFTREESTRUCT(VAL, NAME) NAME,
6729 static const char *ts_enum_names[] = {
6730 #include "treestruct.def"
6732 #undef DEFTREESTRUCT
6734 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6736 /* Similar to tree_class_check_failed, except that we check for
6737 whether CODE contains the tree structure identified by EN. */
6740 tree_contains_struct_check_failed (const tree node,
6741 const enum tree_node_structure_enum en,
6742 const char *file, int line,
6743 const char *function)
6746 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6748 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6752 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6753 (dynamically sized) vector. */
6756 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6757 const char *function)
6760 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6761 idx + 1, len, function, trim_filename (file), line);
6764 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6765 (dynamically sized) vector. */
6768 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6769 const char *function)
6772 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6773 idx + 1, len, function, trim_filename (file), line);
6776 /* Similar to above, except that the check is for the bounds of the operand
6777 vector of an expression node EXP. */
6780 tree_operand_check_failed (int idx, tree exp, const char *file,
6781 int line, const char *function)
6783 int code = TREE_CODE (exp);
6785 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6786 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
6787 function, trim_filename (file), line);
6790 /* Similar to above, except that the check is for the number of
6791 operands of an OMP_CLAUSE node. */
6794 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6795 int line, const char *function)
6798 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6799 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6800 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6801 trim_filename (file), line);
6803 #endif /* ENABLE_TREE_CHECKING */
6805 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6806 and mapped to the machine mode MODE. Initialize its fields and build
6807 the information necessary for debugging output. */
6810 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6813 hashval_t hashcode = 0;
6815 /* Build a main variant, based on the main variant of the inner type, then
6816 use it to build the variant we return. */
6817 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
6818 && TYPE_MAIN_VARIANT (innertype) != innertype)
6819 return build_type_attribute_qual_variant (
6820 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
6821 TYPE_ATTRIBUTES (innertype),
6822 TYPE_QUALS (innertype));
6824 t = make_node (VECTOR_TYPE);
6825 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6826 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6827 TYPE_MODE (t) = mode;
6828 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6829 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6831 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
6832 SET_TYPE_STRUCTURAL_EQUALITY (t);
6833 else if (TYPE_CANONICAL (innertype) != innertype
6834 || mode != VOIDmode)
6836 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
6841 tree index = build_int_cst (NULL_TREE, nunits - 1);
6842 tree array = build_array_type (innertype, build_index_type (index));
6843 tree rt = make_node (RECORD_TYPE);
6845 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6846 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6848 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6849 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6850 the representation type, and we want to find that die when looking up
6851 the vector type. This is most easily achieved by making the TYPE_UID
6853 TYPE_UID (rt) = TYPE_UID (t);
6856 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
6857 hashcode = iterative_hash_host_wide_int (mode, hashcode);
6858 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
6859 return type_hash_canon (hashcode, t);
6863 make_or_reuse_type (unsigned size, int unsignedp)
6865 if (size == INT_TYPE_SIZE)
6866 return unsignedp ? unsigned_type_node : integer_type_node;
6867 if (size == CHAR_TYPE_SIZE)
6868 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6869 if (size == SHORT_TYPE_SIZE)
6870 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6871 if (size == LONG_TYPE_SIZE)
6872 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6873 if (size == LONG_LONG_TYPE_SIZE)
6874 return (unsignedp ? long_long_unsigned_type_node
6875 : long_long_integer_type_node);
6878 return make_unsigned_type (size);
6880 return make_signed_type (size);
6883 /* Create nodes for all integer types (and error_mark_node) using the sizes
6884 of C datatypes. The caller should call set_sizetype soon after calling
6885 this function to select one of the types as sizetype. */
6888 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6890 error_mark_node = make_node (ERROR_MARK);
6891 TREE_TYPE (error_mark_node) = error_mark_node;
6893 initialize_sizetypes (signed_sizetype);
6895 /* Define both `signed char' and `unsigned char'. */
6896 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6897 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6898 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6899 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6901 /* Define `char', which is like either `signed char' or `unsigned char'
6902 but not the same as either. */
6905 ? make_signed_type (CHAR_TYPE_SIZE)
6906 : make_unsigned_type (CHAR_TYPE_SIZE));
6907 TYPE_STRING_FLAG (char_type_node) = 1;
6909 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6910 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6911 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6912 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6913 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6914 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6915 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6916 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6918 /* Define a boolean type. This type only represents boolean values but
6919 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6920 Front ends which want to override this size (i.e. Java) can redefine
6921 boolean_type_node before calling build_common_tree_nodes_2. */
6922 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6923 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6924 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6925 TYPE_PRECISION (boolean_type_node) = 1;
6927 /* Fill in the rest of the sized types. Reuse existing type nodes
6929 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6930 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6931 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6932 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6933 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6935 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6936 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6937 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6938 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6939 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6941 access_public_node = get_identifier ("public");
6942 access_protected_node = get_identifier ("protected");
6943 access_private_node = get_identifier ("private");
6946 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6947 It will create several other common tree nodes. */
6950 build_common_tree_nodes_2 (int short_double)
6952 /* Define these next since types below may used them. */
6953 integer_zero_node = build_int_cst (NULL_TREE, 0);
6954 integer_one_node = build_int_cst (NULL_TREE, 1);
6955 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6957 size_zero_node = size_int (0);
6958 size_one_node = size_int (1);
6959 bitsize_zero_node = bitsize_int (0);
6960 bitsize_one_node = bitsize_int (1);
6961 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6963 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6964 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6966 void_type_node = make_node (VOID_TYPE);
6967 layout_type (void_type_node);
6969 /* We are not going to have real types in C with less than byte alignment,
6970 so we might as well not have any types that claim to have it. */
6971 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6972 TYPE_USER_ALIGN (void_type_node) = 0;
6974 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6975 layout_type (TREE_TYPE (null_pointer_node));
6977 ptr_type_node = build_pointer_type (void_type_node);
6979 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6980 fileptr_type_node = ptr_type_node;
6982 float_type_node = make_node (REAL_TYPE);
6983 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6984 layout_type (float_type_node);
6986 double_type_node = make_node (REAL_TYPE);
6988 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6990 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6991 layout_type (double_type_node);
6993 long_double_type_node = make_node (REAL_TYPE);
6994 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6995 layout_type (long_double_type_node);
6997 float_ptr_type_node = build_pointer_type (float_type_node);
6998 double_ptr_type_node = build_pointer_type (double_type_node);
6999 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7000 integer_ptr_type_node = build_pointer_type (integer_type_node);
7002 /* Fixed size integer types. */
7003 uint32_type_node = build_nonstandard_integer_type (32, true);
7004 uint64_type_node = build_nonstandard_integer_type (64, true);
7006 /* Decimal float types. */
7007 dfloat32_type_node = make_node (REAL_TYPE);
7008 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7009 layout_type (dfloat32_type_node);
7010 TYPE_MODE (dfloat32_type_node) = SDmode;
7011 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7013 dfloat64_type_node = make_node (REAL_TYPE);
7014 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7015 layout_type (dfloat64_type_node);
7016 TYPE_MODE (dfloat64_type_node) = DDmode;
7017 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7019 dfloat128_type_node = make_node (REAL_TYPE);
7020 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7021 layout_type (dfloat128_type_node);
7022 TYPE_MODE (dfloat128_type_node) = TDmode;
7023 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7025 complex_integer_type_node = build_complex_type (integer_type_node);
7026 complex_float_type_node = build_complex_type (float_type_node);
7027 complex_double_type_node = build_complex_type (double_type_node);
7028 complex_long_double_type_node = build_complex_type (long_double_type_node);
7031 tree t = targetm.build_builtin_va_list ();
7033 /* Many back-ends define record types without setting TYPE_NAME.
7034 If we copied the record type here, we'd keep the original
7035 record type without a name. This breaks name mangling. So,
7036 don't copy record types and let c_common_nodes_and_builtins()
7037 declare the type to be __builtin_va_list. */
7038 if (TREE_CODE (t) != RECORD_TYPE)
7039 t = build_variant_type_copy (t);
7041 va_list_type_node = t;
7045 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7048 local_define_builtin (const char *name, tree type, enum built_in_function code,
7049 const char *library_name, int ecf_flags)
7053 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7054 library_name, NULL_TREE);
7055 if (ecf_flags & ECF_CONST)
7056 TREE_READONLY (decl) = 1;
7057 if (ecf_flags & ECF_PURE)
7058 DECL_IS_PURE (decl) = 1;
7059 if (ecf_flags & ECF_NORETURN)
7060 TREE_THIS_VOLATILE (decl) = 1;
7061 if (ecf_flags & ECF_NOTHROW)
7062 TREE_NOTHROW (decl) = 1;
7063 if (ecf_flags & ECF_MALLOC)
7064 DECL_IS_MALLOC (decl) = 1;
7066 built_in_decls[code] = decl;
7067 implicit_built_in_decls[code] = decl;
7070 /* Call this function after instantiating all builtins that the language
7071 front end cares about. This will build the rest of the builtins that
7072 are relied upon by the tree optimizers and the middle-end. */
7075 build_common_builtin_nodes (void)
7079 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7080 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7082 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7083 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7084 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7085 ftype = build_function_type (ptr_type_node, tmp);
7087 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7088 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7089 "memcpy", ECF_NOTHROW);
7090 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7091 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7092 "memmove", ECF_NOTHROW);
7095 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7097 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7098 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7099 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7100 ftype = build_function_type (integer_type_node, tmp);
7101 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7102 "memcmp", ECF_PURE | ECF_NOTHROW);
7105 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7107 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7108 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7109 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7110 ftype = build_function_type (ptr_type_node, tmp);
7111 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7112 "memset", ECF_NOTHROW);
7115 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7117 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7118 ftype = build_function_type (ptr_type_node, tmp);
7119 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7120 "alloca", ECF_NOTHROW | ECF_MALLOC);
7123 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7124 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7125 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7126 ftype = build_function_type (void_type_node, tmp);
7127 local_define_builtin ("__builtin_init_trampoline", ftype,
7128 BUILT_IN_INIT_TRAMPOLINE,
7129 "__builtin_init_trampoline", 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_adjust_trampoline", ftype,
7134 BUILT_IN_ADJUST_TRAMPOLINE,
7135 "__builtin_adjust_trampoline",
7136 ECF_CONST | ECF_NOTHROW);
7138 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7139 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7140 ftype = build_function_type (void_type_node, tmp);
7141 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7142 BUILT_IN_NONLOCAL_GOTO,
7143 "__builtin_nonlocal_goto",
7144 ECF_NORETURN | ECF_NOTHROW);
7146 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7147 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7148 ftype = build_function_type (void_type_node, tmp);
7149 local_define_builtin ("__builtin_setjmp_setup", ftype,
7150 BUILT_IN_SETJMP_SETUP,
7151 "__builtin_setjmp_setup", ECF_NOTHROW);
7153 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7154 ftype = build_function_type (ptr_type_node, tmp);
7155 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7156 BUILT_IN_SETJMP_DISPATCHER,
7157 "__builtin_setjmp_dispatcher",
7158 ECF_PURE | ECF_NOTHROW);
7160 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7161 ftype = build_function_type (void_type_node, tmp);
7162 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7163 BUILT_IN_SETJMP_RECEIVER,
7164 "__builtin_setjmp_receiver", ECF_NOTHROW);
7166 ftype = build_function_type (ptr_type_node, void_list_node);
7167 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7168 "__builtin_stack_save", ECF_NOTHROW);
7170 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7171 ftype = build_function_type (void_type_node, tmp);
7172 local_define_builtin ("__builtin_stack_restore", ftype,
7173 BUILT_IN_STACK_RESTORE,
7174 "__builtin_stack_restore", ECF_NOTHROW);
7176 ftype = build_function_type (void_type_node, void_list_node);
7177 local_define_builtin ("__builtin_profile_func_enter", ftype,
7178 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7179 local_define_builtin ("__builtin_profile_func_exit", ftype,
7180 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7182 /* Complex multiplication and division. These are handled as builtins
7183 rather than optabs because emit_library_call_value doesn't support
7184 complex. Further, we can do slightly better with folding these
7185 beasties if the real and complex parts of the arguments are separate. */
7187 enum machine_mode mode;
7189 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7191 char mode_name_buf[4], *q;
7193 enum built_in_function mcode, dcode;
7194 tree type, inner_type;
7196 type = lang_hooks.types.type_for_mode (mode, 0);
7199 inner_type = TREE_TYPE (type);
7201 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7202 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7203 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7204 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7205 ftype = build_function_type (type, tmp);
7207 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7208 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7210 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7214 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7215 local_define_builtin (built_in_names[mcode], ftype, mcode,
7216 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7218 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7219 local_define_builtin (built_in_names[dcode], ftype, dcode,
7220 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7225 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7228 If we requested a pointer to a vector, build up the pointers that
7229 we stripped off while looking for the inner type. Similarly for
7230 return values from functions.
7232 The argument TYPE is the top of the chain, and BOTTOM is the
7233 new type which we will point to. */
7236 reconstruct_complex_type (tree type, tree bottom)
7240 if (TREE_CODE (type) == POINTER_TYPE)
7242 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7243 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
7244 TYPE_REF_CAN_ALIAS_ALL (type));
7246 else if (TREE_CODE (type) == REFERENCE_TYPE)
7248 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7249 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
7250 TYPE_REF_CAN_ALIAS_ALL (type));
7252 else if (TREE_CODE (type) == ARRAY_TYPE)
7254 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7255 outer = build_array_type (inner, TYPE_DOMAIN (type));
7257 else if (TREE_CODE (type) == FUNCTION_TYPE)
7259 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7260 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7262 else if (TREE_CODE (type) == METHOD_TYPE)
7265 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7266 /* The build_method_type_directly() routine prepends 'this' to argument list,
7267 so we must compensate by getting rid of it. */
7268 argtypes = TYPE_ARG_TYPES (type);
7269 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
7271 TYPE_ARG_TYPES (type));
7272 TYPE_ARG_TYPES (outer) = argtypes;
7277 TYPE_READONLY (outer) = TYPE_READONLY (type);
7278 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
7283 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7286 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7290 switch (GET_MODE_CLASS (mode))
7292 case MODE_VECTOR_INT:
7293 case MODE_VECTOR_FLOAT:
7294 nunits = GET_MODE_NUNITS (mode);
7298 /* Check that there are no leftover bits. */
7299 gcc_assert (GET_MODE_BITSIZE (mode)
7300 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7302 nunits = GET_MODE_BITSIZE (mode)
7303 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7310 return make_vector_type (innertype, nunits, mode);
7313 /* Similarly, but takes the inner type and number of units, which must be
7317 build_vector_type (tree innertype, int nunits)
7319 return make_vector_type (innertype, nunits, VOIDmode);
7323 /* Build RESX_EXPR with given REGION_NUMBER. */
7325 build_resx (int region_number)
7328 t = build1 (RESX_EXPR, void_type_node,
7329 build_int_cst (NULL_TREE, region_number));
7333 /* Given an initializer INIT, return TRUE if INIT is zero or some
7334 aggregate of zeros. Otherwise return FALSE. */
7336 initializer_zerop (tree init)
7342 switch (TREE_CODE (init))
7345 return integer_zerop (init);
7348 /* ??? Note that this is not correct for C4X float formats. There,
7349 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7350 negative exponent. */
7351 return real_zerop (init)
7352 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7355 return integer_zerop (init)
7356 || (real_zerop (init)
7357 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7358 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7361 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7362 if (!initializer_zerop (TREE_VALUE (elt)))
7368 unsigned HOST_WIDE_INT idx;
7370 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7371 if (!initializer_zerop (elt))
7381 /* Build an empty statement. */
7384 build_empty_stmt (void)
7386 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7390 /* Build an OpenMP clause with code CODE. */
7393 build_omp_clause (enum omp_clause_code code)
7398 length = omp_clause_num_ops[code];
7399 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7401 t = ggc_alloc (size);
7402 memset (t, 0, size);
7403 TREE_SET_CODE (t, OMP_CLAUSE);
7404 OMP_CLAUSE_SET_CODE (t, code);
7406 #ifdef GATHER_STATISTICS
7407 tree_node_counts[(int) omp_clause_kind]++;
7408 tree_node_sizes[(int) omp_clause_kind] += size;
7414 /* Set various status flags when building a CALL_EXPR object T. */
7417 process_call_operands (tree t)
7421 side_effects = TREE_SIDE_EFFECTS (t);
7425 n = TREE_OPERAND_LENGTH (t);
7426 for (i = 1; i < n; i++)
7428 tree op = TREE_OPERAND (t, i);
7429 if (op && TREE_SIDE_EFFECTS (op))
7440 /* Calls have side-effects, except those to const or
7442 i = call_expr_flags (t);
7443 if (!(i & (ECF_CONST | ECF_PURE)))
7446 TREE_SIDE_EFFECTS (t) = side_effects;
7449 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7450 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7451 Except for the CODE and operand count field, other storage for the
7452 object is initialized to zeros. */
7455 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
7458 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
7460 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
7461 gcc_assert (len >= 1);
7463 #ifdef GATHER_STATISTICS
7464 tree_node_counts[(int) e_kind]++;
7465 tree_node_sizes[(int) e_kind] += length;
7468 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
7470 memset (t, 0, length);
7472 TREE_SET_CODE (t, code);
7474 /* Can't use TREE_OPERAND to store the length because if checking is
7475 enabled, it will try to check the length before we store it. :-P */
7476 t->exp.operands[0] = build_int_cst (sizetype, len);
7482 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7483 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
7487 build_call_list (tree return_type, tree fn, tree arglist)
7492 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
7493 TREE_TYPE (t) = return_type;
7494 CALL_EXPR_FN (t) = fn;
7495 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7496 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
7497 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
7498 process_call_operands (t);
7502 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7503 FN and a null static chain slot. NARGS is the number of call arguments
7504 which are specified as "..." arguments. */
7507 build_call_nary (tree return_type, tree fn, int nargs, ...)
7511 va_start (args, nargs);
7512 ret = build_call_valist (return_type, fn, nargs, args);
7517 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7518 FN and a null static chain slot. NARGS is the number of call arguments
7519 which are specified as a va_list ARGS. */
7522 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
7527 t = build_vl_exp (CALL_EXPR, nargs + 3);
7528 TREE_TYPE (t) = return_type;
7529 CALL_EXPR_FN (t) = fn;
7530 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7531 for (i = 0; i < nargs; i++)
7532 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
7533 process_call_operands (t);
7537 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7538 FN and a null static chain slot. NARGS is the number of call arguments
7539 which are specified as a tree array ARGS. */
7542 build_call_array (tree return_type, tree fn, int nargs, tree *args)
7547 t = build_vl_exp (CALL_EXPR, nargs + 3);
7548 TREE_TYPE (t) = return_type;
7549 CALL_EXPR_FN (t) = fn;
7550 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7551 for (i = 0; i < nargs; i++)
7552 CALL_EXPR_ARG (t, i) = args[i];
7553 process_call_operands (t);
7558 /* Returns true if it is possible to prove that the index of
7559 an array access REF (an ARRAY_REF expression) falls into the
7563 in_array_bounds_p (tree ref)
7565 tree idx = TREE_OPERAND (ref, 1);
7568 if (TREE_CODE (idx) != INTEGER_CST)
7571 min = array_ref_low_bound (ref);
7572 max = array_ref_up_bound (ref);
7575 || TREE_CODE (min) != INTEGER_CST
7576 || TREE_CODE (max) != INTEGER_CST)
7579 if (tree_int_cst_lt (idx, min)
7580 || tree_int_cst_lt (max, idx))
7586 /* Returns true if it is possible to prove that the range of
7587 an array access REF (an ARRAY_RANGE_REF expression) falls
7588 into the array bounds. */
7591 range_in_array_bounds_p (tree ref)
7593 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7594 tree range_min, range_max, min, max;
7596 range_min = TYPE_MIN_VALUE (domain_type);
7597 range_max = TYPE_MAX_VALUE (domain_type);
7600 || TREE_CODE (range_min) != INTEGER_CST
7601 || TREE_CODE (range_max) != INTEGER_CST)
7604 min = array_ref_low_bound (ref);
7605 max = array_ref_up_bound (ref);
7608 || TREE_CODE (min) != INTEGER_CST
7609 || TREE_CODE (max) != INTEGER_CST)
7612 if (tree_int_cst_lt (range_min, min)
7613 || tree_int_cst_lt (max, range_max))
7619 /* Return true if T (assumed to be a DECL) must be assigned a memory
7623 needs_to_live_in_memory (tree t)
7625 if (TREE_CODE (t) == SSA_NAME)
7626 t = SSA_NAME_VAR (t);
7628 return (TREE_ADDRESSABLE (t)
7629 || is_global_var (t)
7630 || (TREE_CODE (t) == RESULT_DECL
7631 && aggregate_value_p (t, current_function_decl)));
7634 /* There are situations in which a language considers record types
7635 compatible which have different field lists. Decide if two fields
7636 are compatible. It is assumed that the parent records are compatible. */
7639 fields_compatible_p (tree f1, tree f2)
7641 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7642 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7645 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7646 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7649 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7655 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7658 find_compatible_field (tree record, tree orig_field)
7662 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7663 if (TREE_CODE (f) == FIELD_DECL
7664 && fields_compatible_p (f, orig_field))
7667 /* ??? Why isn't this on the main fields list? */
7668 f = TYPE_VFIELD (record);
7669 if (f && TREE_CODE (f) == FIELD_DECL
7670 && fields_compatible_p (f, orig_field))
7673 /* ??? We should abort here, but Java appears to do Bad Things
7674 with inherited fields. */
7678 /* Return value of a constant X. */
7681 int_cst_value (tree x)
7683 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
7684 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
7685 bool negative = ((val >> (bits - 1)) & 1) != 0;
7687 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
7690 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
7692 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
7698 /* Returns unsigned variant of TYPE. */
7701 unsigned_type_for (tree type)
7703 if (POINTER_TYPE_P (type))
7704 return lang_hooks.types.unsigned_type (size_type_node);
7705 return lang_hooks.types.unsigned_type (type);
7708 /* Returns signed variant of TYPE. */
7711 signed_type_for (tree type)
7713 if (POINTER_TYPE_P (type))
7714 return lang_hooks.types.signed_type (size_type_node);
7715 return lang_hooks.types.signed_type (type);
7718 /* Returns the largest value obtainable by casting something in INNER type to
7722 upper_bound_in_type (tree outer, tree inner)
7724 unsigned HOST_WIDE_INT lo, hi;
7725 unsigned int det = 0;
7726 unsigned oprec = TYPE_PRECISION (outer);
7727 unsigned iprec = TYPE_PRECISION (inner);
7730 /* Compute a unique number for every combination. */
7731 det |= (oprec > iprec) ? 4 : 0;
7732 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7733 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7735 /* Determine the exponent to use. */
7740 /* oprec <= iprec, outer: signed, inner: don't care. */
7745 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7749 /* oprec > iprec, outer: signed, inner: signed. */
7753 /* oprec > iprec, outer: signed, inner: unsigned. */
7757 /* oprec > iprec, outer: unsigned, inner: signed. */
7761 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7768 /* Compute 2^^prec - 1. */
7769 if (prec <= HOST_BITS_PER_WIDE_INT)
7772 lo = ((~(unsigned HOST_WIDE_INT) 0)
7773 >> (HOST_BITS_PER_WIDE_INT - prec));
7777 hi = ((~(unsigned HOST_WIDE_INT) 0)
7778 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7779 lo = ~(unsigned HOST_WIDE_INT) 0;
7782 return build_int_cst_wide (outer, lo, hi);
7785 /* Returns the smallest value obtainable by casting something in INNER type to
7789 lower_bound_in_type (tree outer, tree inner)
7791 unsigned HOST_WIDE_INT lo, hi;
7792 unsigned oprec = TYPE_PRECISION (outer);
7793 unsigned iprec = TYPE_PRECISION (inner);
7795 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7797 if (TYPE_UNSIGNED (outer)
7798 /* If we are widening something of an unsigned type, OUTER type
7799 contains all values of INNER type. In particular, both INNER
7800 and OUTER types have zero in common. */
7801 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7805 /* If we are widening a signed type to another signed type, we
7806 want to obtain -2^^(iprec-1). If we are keeping the
7807 precision or narrowing to a signed type, we want to obtain
7809 unsigned prec = oprec > iprec ? iprec : oprec;
7811 if (prec <= HOST_BITS_PER_WIDE_INT)
7813 hi = ~(unsigned HOST_WIDE_INT) 0;
7814 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7818 hi = ((~(unsigned HOST_WIDE_INT) 0)
7819 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7824 return build_int_cst_wide (outer, lo, hi);
7827 /* Return nonzero if two operands that are suitable for PHI nodes are
7828 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7829 SSA_NAME or invariant. Note that this is strictly an optimization.
7830 That is, callers of this function can directly call operand_equal_p
7831 and get the same result, only slower. */
7834 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7838 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7840 return operand_equal_p (arg0, arg1, 0);
7843 /* Returns number of zeros at the end of binary representation of X.
7845 ??? Use ffs if available? */
7848 num_ending_zeros (tree x)
7850 unsigned HOST_WIDE_INT fr, nfr;
7851 unsigned num, abits;
7852 tree type = TREE_TYPE (x);
7854 if (TREE_INT_CST_LOW (x) == 0)
7856 num = HOST_BITS_PER_WIDE_INT;
7857 fr = TREE_INT_CST_HIGH (x);
7862 fr = TREE_INT_CST_LOW (x);
7865 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7868 if (nfr << abits == fr)
7875 if (num > TYPE_PRECISION (type))
7876 num = TYPE_PRECISION (type);
7878 return build_int_cst_type (type, num);
7882 #define WALK_SUBTREE(NODE) \
7885 result = walk_tree (&(NODE), func, data, pset); \
7891 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7892 be walked whenever a type is seen in the tree. Rest of operands and return
7893 value are as for walk_tree. */
7896 walk_type_fields (tree type, walk_tree_fn func, void *data,
7897 struct pointer_set_t *pset)
7899 tree result = NULL_TREE;
7901 switch (TREE_CODE (type))
7904 case REFERENCE_TYPE:
7905 /* We have to worry about mutually recursive pointers. These can't
7906 be written in C. They can in Ada. It's pathological, but
7907 there's an ACATS test (c38102a) that checks it. Deal with this
7908 by checking if we're pointing to another pointer, that one
7909 points to another pointer, that one does too, and we have no htab.
7910 If so, get a hash table. We check three levels deep to avoid
7911 the cost of the hash table if we don't need one. */
7912 if (POINTER_TYPE_P (TREE_TYPE (type))
7913 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7914 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7917 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7925 /* ... fall through ... */
7928 WALK_SUBTREE (TREE_TYPE (type));
7932 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7937 WALK_SUBTREE (TREE_TYPE (type));
7941 /* We never want to walk into default arguments. */
7942 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7943 WALK_SUBTREE (TREE_VALUE (arg));
7948 /* Don't follow this nodes's type if a pointer for fear that
7949 we'll have infinite recursion. If we have a PSET, then we
7952 || (!POINTER_TYPE_P (TREE_TYPE (type))
7953 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
7954 WALK_SUBTREE (TREE_TYPE (type));
7955 WALK_SUBTREE (TYPE_DOMAIN (type));
7959 WALK_SUBTREE (TREE_TYPE (type));
7960 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7970 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7971 called with the DATA and the address of each sub-tree. If FUNC returns a
7972 non-NULL value, the traversal is stopped, and the value returned by FUNC
7973 is returned. If PSET is non-NULL it is used to record the nodes visited,
7974 and to avoid visiting a node more than once. */
7977 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7979 enum tree_code code;
7983 #define WALK_SUBTREE_TAIL(NODE) \
7987 goto tail_recurse; \
7992 /* Skip empty subtrees. */
7996 /* Don't walk the same tree twice, if the user has requested
7997 that we avoid doing so. */
7998 if (pset && pointer_set_insert (pset, *tp))
8001 /* Call the function. */
8003 result = (*func) (tp, &walk_subtrees, data);
8005 /* If we found something, return it. */
8009 code = TREE_CODE (*tp);
8011 /* Even if we didn't, FUNC may have decided that there was nothing
8012 interesting below this point in the tree. */
8015 /* But we still need to check our siblings. */
8016 if (code == TREE_LIST)
8017 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8018 else if (code == OMP_CLAUSE)
8019 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8024 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
8026 if (result || !walk_subtrees)
8032 case IDENTIFIER_NODE:
8038 case PLACEHOLDER_EXPR:
8042 /* None of these have subtrees other than those already walked
8047 WALK_SUBTREE (TREE_VALUE (*tp));
8048 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8053 int len = TREE_VEC_LENGTH (*tp);
8058 /* Walk all elements but the first. */
8060 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8062 /* Now walk the first one as a tail call. */
8063 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8067 WALK_SUBTREE (TREE_REALPART (*tp));
8068 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8072 unsigned HOST_WIDE_INT idx;
8073 constructor_elt *ce;
8076 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8078 WALK_SUBTREE (ce->value);
8083 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8088 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8090 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8091 into declarations that are just mentioned, rather than
8092 declared; they don't really belong to this part of the tree.
8093 And, we can see cycles: the initializer for a declaration
8094 can refer to the declaration itself. */
8095 WALK_SUBTREE (DECL_INITIAL (decl));
8096 WALK_SUBTREE (DECL_SIZE (decl));
8097 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8099 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8102 case STATEMENT_LIST:
8104 tree_stmt_iterator i;
8105 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8106 WALK_SUBTREE (*tsi_stmt_ptr (i));
8111 switch (OMP_CLAUSE_CODE (*tp))
8113 case OMP_CLAUSE_PRIVATE:
8114 case OMP_CLAUSE_SHARED:
8115 case OMP_CLAUSE_FIRSTPRIVATE:
8116 case OMP_CLAUSE_LASTPRIVATE:
8117 case OMP_CLAUSE_COPYIN:
8118 case OMP_CLAUSE_COPYPRIVATE:
8120 case OMP_CLAUSE_NUM_THREADS:
8121 case OMP_CLAUSE_SCHEDULE:
8122 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8125 case OMP_CLAUSE_NOWAIT:
8126 case OMP_CLAUSE_ORDERED:
8127 case OMP_CLAUSE_DEFAULT:
8128 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8130 case OMP_CLAUSE_REDUCTION:
8133 for (i = 0; i < 4; i++)
8134 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8135 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8147 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8148 But, we only want to walk once. */
8149 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8150 for (i = 0; i < len; ++i)
8151 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8152 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8156 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8157 defining. We only want to walk into these fields of a type in this
8158 case and not in the general case of a mere reference to the type.
8160 The criterion is as follows: if the field can be an expression, it
8161 must be walked only here. This should be in keeping with the fields
8162 that are directly gimplified in gimplify_type_sizes in order for the
8163 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8164 variable-sized types.
8166 Note that DECLs get walked as part of processing the BIND_EXPR. */
8167 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8169 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8170 if (TREE_CODE (*type_p) == ERROR_MARK)
8173 /* Call the function for the type. See if it returns anything or
8174 doesn't want us to continue. If we are to continue, walk both
8175 the normal fields and those for the declaration case. */
8176 result = (*func) (type_p, &walk_subtrees, data);
8177 if (result || !walk_subtrees)
8180 result = walk_type_fields (*type_p, func, data, pset);
8184 /* If this is a record type, also walk the fields. */
8185 if (TREE_CODE (*type_p) == RECORD_TYPE
8186 || TREE_CODE (*type_p) == UNION_TYPE
8187 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8191 for (field = TYPE_FIELDS (*type_p); field;
8192 field = TREE_CHAIN (field))
8194 /* We'd like to look at the type of the field, but we can
8195 easily get infinite recursion. So assume it's pointed
8196 to elsewhere in the tree. Also, ignore things that
8198 if (TREE_CODE (field) != FIELD_DECL)
8201 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8202 WALK_SUBTREE (DECL_SIZE (field));
8203 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8204 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8205 WALK_SUBTREE (DECL_QUALIFIER (field));
8209 /* Same for scalar types. */
8210 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8211 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8212 || TREE_CODE (*type_p) == INTEGER_TYPE
8213 || TREE_CODE (*type_p) == REAL_TYPE)
8215 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8216 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8219 WALK_SUBTREE (TYPE_SIZE (*type_p));
8220 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8225 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
8226 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code)))
8230 /* Walk over all the sub-trees of this operand. */
8231 len = TREE_OPERAND_LENGTH (*tp);
8233 /* Go through the subtrees. We need to do this in forward order so
8234 that the scope of a FOR_EXPR is handled properly. */
8237 for (i = 0; i < len - 1; ++i)
8238 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp, i));
8239 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp, len - 1));
8242 /* If this is a type, walk the needed fields in the type. */
8243 else if (TYPE_P (*tp))
8244 return walk_type_fields (*tp, func, data, pset);
8248 /* We didn't find what we were looking for. */
8251 #undef WALK_SUBTREE_TAIL
8255 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8258 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
8261 struct pointer_set_t *pset;
8263 pset = pointer_set_create ();
8264 result = walk_tree (tp, func, data, pset);
8265 pointer_set_destroy (pset);
8270 /* Return true if STMT is an empty statement or contains nothing but
8271 empty statements. */
8274 empty_body_p (tree stmt)
8276 tree_stmt_iterator i;
8279 if (IS_EMPTY_STMT (stmt))
8281 else if (TREE_CODE (stmt) == BIND_EXPR)
8282 body = BIND_EXPR_BODY (stmt);
8283 else if (TREE_CODE (stmt) == STATEMENT_LIST)
8288 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
8289 if (!empty_body_p (tsi_stmt (i)))
8298 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8300 if (IS_EXPR_CODE_CLASS (c))
8301 return &t->exp.block;
8302 else if (IS_GIMPLE_STMT_CODE_CLASS (c))
8303 return &GIMPLE_STMT_BLOCK (t);
8309 generic_tree_operand (tree node, int i)
8311 if (GIMPLE_STMT_P (node))
8312 return &GIMPLE_STMT_OPERAND (node, i);
8313 return &TREE_OPERAND (node, i);
8317 generic_tree_type (tree node)
8319 if (GIMPLE_STMT_P (node))
8320 return &void_type_node;
8321 return &TREE_TYPE (node);
8324 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8325 FIXME: don't use this function. It exists for compatibility with
8326 the old representation of CALL_EXPRs where a list was used to hold the
8327 arguments. Places that currently extract the arglist from a CALL_EXPR
8328 ought to be rewritten to use the CALL_EXPR itself. */
8330 call_expr_arglist (tree exp)
8332 tree arglist = NULL_TREE;
8334 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
8335 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
8339 #include "gt-tree.h"