1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This file contains the low level primitives for operating on tree nodes,
24 including allocation, list operations, interning of identifiers,
25 construction of data type nodes and statement nodes,
26 and construction of type conversion nodes. It also contains
27 tables index by tree code that describe how to take apart
30 It is intended to be language-independent, but occasionally
31 calls language-dependent routines defined (for C) in typecheck.c. */
35 #include "coretypes.h"
48 #include "langhooks.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
55 /* Each tree code class has an associated string representation.
56 These must correspond to the tree_code_class entries. */
58 const char *const tree_code_class_strings[] =
72 /* obstack.[ch] explicitly declined to prototype this. */
73 extern int _obstack_allocated_p (struct obstack *h, void *obj);
75 #ifdef GATHER_STATISTICS
76 /* Statistics-gathering stuff. */
78 int tree_node_counts[(int) all_kinds];
79 int tree_node_sizes[(int) all_kinds];
81 /* Keep in sync with tree.h:enum tree_node_kind. */
82 static const char * const tree_node_kind_names[] = {
104 #endif /* GATHER_STATISTICS */
106 /* Unique id for next decl created. */
107 static GTY(()) int next_decl_uid;
108 /* Unique id for next type created. */
109 static GTY(()) int next_type_uid = 1;
111 /* Since we cannot rehash a type after it is in the table, we have to
112 keep the hash code. */
114 struct type_hash GTY(())
120 /* Initial size of the hash table (rounded to next prime). */
121 #define TYPE_HASH_INITIAL_SIZE 1000
123 /* Now here is the hash table. When recording a type, it is added to
124 the slot whose index is the hash code. Note that the hash table is
125 used for several kinds of types (function types, array types and
126 array index range types, for now). While all these live in the
127 same table, they are completely independent, and the hash code is
128 computed differently for each of these. */
130 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
131 htab_t type_hash_table;
133 /* Hash table and temporary node for larger integer const values. */
134 static GTY (()) tree int_cst_node;
135 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
136 htab_t int_cst_hash_table;
138 /* General tree->tree mapping structure for use in hash tables. */
141 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
142 htab_t debug_expr_for_decl;
144 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
145 htab_t value_expr_for_decl;
147 static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map)))
148 htab_t init_priority_for_decl;
150 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
151 htab_t restrict_base_for_decl;
153 struct tree_int_map GTY(())
158 static unsigned int tree_int_map_hash (const void *);
159 static int tree_int_map_eq (const void *, const void *);
160 static int tree_int_map_marked_p (const void *);
161 static void set_type_quals (tree, int);
162 static int type_hash_eq (const void *, const void *);
163 static hashval_t type_hash_hash (const void *);
164 static hashval_t int_cst_hash_hash (const void *);
165 static int int_cst_hash_eq (const void *, const void *);
166 static void print_type_hash_statistics (void);
167 static void print_debug_expr_statistics (void);
168 static void print_value_expr_statistics (void);
169 static int type_hash_marked_p (const void *);
170 static unsigned int type_hash_list (tree, hashval_t);
171 static unsigned int attribute_hash_list (tree, hashval_t);
173 tree global_trees[TI_MAX];
174 tree integer_types[itk_none];
176 unsigned char tree_contains_struct[256][64];
178 /* Number of operands for each OpenMP clause. */
179 unsigned const char omp_clause_num_ops[] =
181 0, /* OMP_CLAUSE_ERROR */
182 1, /* OMP_CLAUSE_PRIVATE */
183 1, /* OMP_CLAUSE_SHARED */
184 1, /* OMP_CLAUSE_FIRSTPRIVATE */
185 1, /* OMP_CLAUSE_LASTPRIVATE */
186 4, /* OMP_CLAUSE_REDUCTION */
187 1, /* OMP_CLAUSE_COPYIN */
188 1, /* OMP_CLAUSE_COPYPRIVATE */
189 1, /* OMP_CLAUSE_IF */
190 1, /* OMP_CLAUSE_NUM_THREADS */
191 1, /* OMP_CLAUSE_SCHEDULE */
192 0, /* OMP_CLAUSE_NOWAIT */
193 0, /* OMP_CLAUSE_ORDERED */
194 0 /* OMP_CLAUSE_DEFAULT */
197 const char * const omp_clause_code_name[] =
220 /* Initialize the hash table of types. */
221 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
224 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
227 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
229 init_priority_for_decl = htab_create_ggc (512, tree_int_map_hash,
231 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
234 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
235 int_cst_hash_eq, NULL);
237 int_cst_node = make_node (INTEGER_CST);
239 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
240 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
241 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
244 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
245 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
246 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
247 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
248 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
249 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
250 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
251 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
252 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
255 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
256 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
257 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
258 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
259 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
260 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
262 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
263 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
264 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
265 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
266 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
267 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
268 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
269 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
270 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
271 tree_contains_struct[STRUCT_FIELD_TAG][TS_DECL_MINIMAL] = 1;
272 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
273 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
274 tree_contains_struct[MEMORY_PARTITION_TAG][TS_DECL_MINIMAL] = 1;
276 tree_contains_struct[STRUCT_FIELD_TAG][TS_MEMORY_TAG] = 1;
277 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
278 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
279 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_TAG] = 1;
281 tree_contains_struct[STRUCT_FIELD_TAG][TS_STRUCT_FIELD_TAG] = 1;
282 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_PARTITION_TAG] = 1;
284 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
285 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
286 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
287 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
289 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
290 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
291 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
292 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
293 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
294 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
295 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
296 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
298 lang_hooks.init_ts ();
302 /* The name of the object as the assembler will see it (but before any
303 translations made by ASM_OUTPUT_LABELREF). Often this is the same
304 as DECL_NAME. It is an IDENTIFIER_NODE. */
306 decl_assembler_name (tree decl)
308 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
309 lang_hooks.set_decl_assembler_name (decl);
310 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
313 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
316 decl_assembler_name_equal (tree decl, tree asmname)
318 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
320 if (decl_asmname == asmname)
323 /* If the target assembler name was set by the user, things are trickier.
324 We have a leading '*' to begin with. After that, it's arguable what
325 is the correct thing to do with -fleading-underscore. Arguably, we've
326 historically been doing the wrong thing in assemble_alias by always
327 printing the leading underscore. Since we're not changing that, make
328 sure user_label_prefix follows the '*' before matching. */
329 if (IDENTIFIER_POINTER (decl_asmname)[0] == '*')
331 const char *decl_str = IDENTIFIER_POINTER (decl_asmname) + 1;
332 size_t ulp_len = strlen (user_label_prefix);
336 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
341 return strcmp (decl_str, IDENTIFIER_POINTER (asmname)) == 0;
347 /* Compute the number of bytes occupied by a tree with code CODE.
348 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
349 codes, which are of variable length. */
351 tree_code_size (enum tree_code code)
353 switch (TREE_CODE_CLASS (code))
355 case tcc_declaration: /* A decl node */
360 return sizeof (struct tree_field_decl);
362 return sizeof (struct tree_parm_decl);
364 return sizeof (struct tree_var_decl);
366 return sizeof (struct tree_label_decl);
368 return sizeof (struct tree_result_decl);
370 return sizeof (struct tree_const_decl);
372 return sizeof (struct tree_type_decl);
374 return sizeof (struct tree_function_decl);
375 case NAME_MEMORY_TAG:
376 case SYMBOL_MEMORY_TAG:
377 return sizeof (struct tree_memory_tag);
378 case STRUCT_FIELD_TAG:
379 return sizeof (struct tree_struct_field_tag);
380 case MEMORY_PARTITION_TAG:
381 return sizeof (struct tree_memory_partition_tag);
383 return sizeof (struct tree_decl_non_common);
387 case tcc_type: /* a type node */
388 return sizeof (struct tree_type);
390 case tcc_reference: /* a reference */
391 case tcc_expression: /* an expression */
392 case tcc_statement: /* an expression with side effects */
393 case tcc_comparison: /* a comparison expression */
394 case tcc_unary: /* a unary arithmetic expression */
395 case tcc_binary: /* a binary arithmetic expression */
396 return (sizeof (struct tree_exp)
397 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
399 case tcc_gimple_stmt:
400 return (sizeof (struct gimple_stmt)
401 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
403 case tcc_constant: /* a constant */
406 case INTEGER_CST: return sizeof (struct tree_int_cst);
407 case REAL_CST: return sizeof (struct tree_real_cst);
408 case COMPLEX_CST: return sizeof (struct tree_complex);
409 case VECTOR_CST: return sizeof (struct tree_vector);
410 case STRING_CST: gcc_unreachable ();
412 return lang_hooks.tree_size (code);
415 case tcc_exceptional: /* something random, like an identifier. */
418 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
419 case TREE_LIST: return sizeof (struct tree_list);
422 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
426 case PHI_NODE: gcc_unreachable ();
428 case SSA_NAME: return sizeof (struct tree_ssa_name);
430 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
431 case BLOCK: return sizeof (struct tree_block);
432 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
433 case CONSTRUCTOR: return sizeof (struct tree_constructor);
436 return lang_hooks.tree_size (code);
444 /* Compute the number of bytes occupied by NODE. This routine only
445 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
447 tree_size (tree node)
449 enum tree_code code = TREE_CODE (node);
453 return (sizeof (struct tree_phi_node)
454 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
457 return (offsetof (struct tree_binfo, base_binfos)
458 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
461 return (sizeof (struct tree_vec)
462 + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *));
465 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
468 return (sizeof (struct tree_omp_clause)
469 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
473 return tree_code_size (code);
477 /* Return a newly allocated node of code CODE. For decl and type
478 nodes, some other fields are initialized. The rest of the node is
479 initialized to zero. This function cannot be used for PHI_NODE,
480 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
483 Achoo! I got a code in the node. */
486 make_node_stat (enum tree_code code MEM_STAT_DECL)
489 enum tree_code_class type = TREE_CODE_CLASS (code);
490 size_t length = tree_code_size (code);
491 #ifdef GATHER_STATISTICS
496 case tcc_declaration: /* A decl node */
500 case tcc_type: /* a type node */
504 case tcc_statement: /* an expression with side effects */
508 case tcc_reference: /* a reference */
512 case tcc_expression: /* an expression */
513 case tcc_comparison: /* a comparison expression */
514 case tcc_unary: /* a unary arithmetic expression */
515 case tcc_binary: /* a binary arithmetic expression */
519 case tcc_constant: /* a constant */
523 case tcc_gimple_stmt:
524 kind = gimple_stmt_kind;
527 case tcc_exceptional: /* something random, like an identifier. */
530 case IDENTIFIER_NODE:
547 kind = ssa_name_kind;
568 tree_node_counts[(int) kind]++;
569 tree_node_sizes[(int) kind] += length;
572 if (code == IDENTIFIER_NODE)
573 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
575 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
577 memset (t, 0, length);
579 TREE_SET_CODE (t, code);
584 TREE_SIDE_EFFECTS (t) = 1;
587 case tcc_declaration:
588 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
589 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
590 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
592 if (code != FUNCTION_DECL)
594 DECL_USER_ALIGN (t) = 0;
595 /* We have not yet computed the alias set for this declaration. */
596 DECL_POINTER_ALIAS_SET (t) = -1;
598 DECL_SOURCE_LOCATION (t) = input_location;
599 DECL_UID (t) = next_decl_uid++;
604 TYPE_UID (t) = next_type_uid++;
605 TYPE_ALIGN (t) = BITS_PER_UNIT;
606 TYPE_USER_ALIGN (t) = 0;
607 TYPE_MAIN_VARIANT (t) = t;
608 TYPE_CANONICAL (t) = t;
610 /* Default to no attributes for type, but let target change that. */
611 TYPE_ATTRIBUTES (t) = NULL_TREE;
612 targetm.set_default_type_attributes (t);
614 /* We have not yet computed the alias set for this type. */
615 TYPE_ALIAS_SET (t) = -1;
619 TREE_CONSTANT (t) = 1;
620 TREE_INVARIANT (t) = 1;
629 case PREDECREMENT_EXPR:
630 case PREINCREMENT_EXPR:
631 case POSTDECREMENT_EXPR:
632 case POSTINCREMENT_EXPR:
633 /* All of these have side-effects, no matter what their
635 TREE_SIDE_EFFECTS (t) = 1;
643 case tcc_gimple_stmt:
646 case GIMPLE_MODIFY_STMT:
647 TREE_SIDE_EFFECTS (t) = 1;
655 /* Other classes need no special treatment. */
662 /* Return a new node with the same contents as NODE except that its
663 TREE_CHAIN is zero and it has a fresh uid. */
666 copy_node_stat (tree node MEM_STAT_DECL)
669 enum tree_code code = TREE_CODE (node);
672 gcc_assert (code != STATEMENT_LIST);
674 length = tree_size (node);
675 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
676 memcpy (t, node, length);
678 if (!GIMPLE_TUPLE_P (node))
680 TREE_ASM_WRITTEN (t) = 0;
681 TREE_VISITED (t) = 0;
684 if (TREE_CODE_CLASS (code) == tcc_declaration)
686 DECL_UID (t) = next_decl_uid++;
687 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
688 && DECL_HAS_VALUE_EXPR_P (node))
690 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
691 DECL_HAS_VALUE_EXPR_P (t) = 1;
693 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
695 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
696 DECL_HAS_INIT_PRIORITY_P (t) = 1;
698 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
700 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
701 DECL_BASED_ON_RESTRICT_P (t) = 1;
704 else if (TREE_CODE_CLASS (code) == tcc_type)
706 TYPE_UID (t) = next_type_uid++;
707 /* The following is so that the debug code for
708 the copy is different from the original type.
709 The two statements usually duplicate each other
710 (because they clear fields of the same union),
711 but the optimizer should catch that. */
712 TYPE_SYMTAB_POINTER (t) = 0;
713 TYPE_SYMTAB_ADDRESS (t) = 0;
715 /* Do not copy the values cache. */
716 if (TYPE_CACHED_VALUES_P(t))
718 TYPE_CACHED_VALUES_P (t) = 0;
719 TYPE_CACHED_VALUES (t) = NULL_TREE;
726 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
727 For example, this can copy a list made of TREE_LIST nodes. */
730 copy_list (tree list)
738 head = prev = copy_node (list);
739 next = TREE_CHAIN (list);
742 TREE_CHAIN (prev) = copy_node (next);
743 prev = TREE_CHAIN (prev);
744 next = TREE_CHAIN (next);
750 /* Create an INT_CST node with a LOW value sign extended. */
753 build_int_cst (tree type, HOST_WIDE_INT low)
755 /* Support legacy code. */
757 type = integer_type_node;
759 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
762 /* Create an INT_CST node with a LOW value zero extended. */
765 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
767 return build_int_cst_wide (type, low, 0);
770 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
771 if it is negative. This function is similar to build_int_cst, but
772 the extra bits outside of the type precision are cleared. Constants
773 with these extra bits may confuse the fold so that it detects overflows
774 even in cases when they do not occur, and in general should be avoided.
775 We cannot however make this a default behavior of build_int_cst without
776 more intrusive changes, since there are parts of gcc that rely on the extra
777 precision of the integer constants. */
780 build_int_cst_type (tree type, HOST_WIDE_INT low)
782 unsigned HOST_WIDE_INT low1;
787 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
789 return build_int_cst_wide (type, low1, hi);
792 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
793 and sign extended according to the value range of TYPE. */
796 build_int_cst_wide_type (tree type,
797 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
799 fit_double_type (low, high, &low, &high, type);
800 return build_int_cst_wide (type, low, high);
803 /* These are the hash table functions for the hash table of INTEGER_CST
804 nodes of a sizetype. */
806 /* Return the hash code code X, an INTEGER_CST. */
809 int_cst_hash_hash (const void *x)
813 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
814 ^ htab_hash_pointer (TREE_TYPE (t)));
817 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
818 is the same as that given by *Y, which is the same. */
821 int_cst_hash_eq (const void *x, const void *y)
826 return (TREE_TYPE (xt) == TREE_TYPE (yt)
827 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
828 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
831 /* Create an INT_CST node of TYPE and value HI:LOW.
832 The returned node is always shared. For small integers we use a
833 per-type vector cache, for larger ones we use a single hash table. */
836 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
844 switch (TREE_CODE (type))
848 /* Cache NULL pointer. */
857 /* Cache false or true. */
865 if (TYPE_UNSIGNED (type))
868 limit = INTEGER_SHARE_LIMIT;
869 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
875 limit = INTEGER_SHARE_LIMIT + 1;
876 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
878 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
892 /* Look for it in the type's vector of small shared ints. */
893 if (!TYPE_CACHED_VALUES_P (type))
895 TYPE_CACHED_VALUES_P (type) = 1;
896 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
899 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
902 /* Make sure no one is clobbering the shared constant. */
903 gcc_assert (TREE_TYPE (t) == type);
904 gcc_assert (TREE_INT_CST_LOW (t) == low);
905 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
909 /* Create a new shared int. */
910 t = make_node (INTEGER_CST);
912 TREE_INT_CST_LOW (t) = low;
913 TREE_INT_CST_HIGH (t) = hi;
914 TREE_TYPE (t) = type;
916 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
921 /* Use the cache of larger shared ints. */
924 TREE_INT_CST_LOW (int_cst_node) = low;
925 TREE_INT_CST_HIGH (int_cst_node) = hi;
926 TREE_TYPE (int_cst_node) = type;
928 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
932 /* Insert this one into the hash table. */
935 /* Make a new node for next time round. */
936 int_cst_node = make_node (INTEGER_CST);
943 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
944 and the rest are zeros. */
947 build_low_bits_mask (tree type, unsigned bits)
949 unsigned HOST_WIDE_INT low;
951 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
953 gcc_assert (bits <= TYPE_PRECISION (type));
955 if (bits == TYPE_PRECISION (type)
956 && !TYPE_UNSIGNED (type))
958 /* Sign extended all-ones mask. */
962 else if (bits <= HOST_BITS_PER_WIDE_INT)
964 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
969 bits -= HOST_BITS_PER_WIDE_INT;
971 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
974 return build_int_cst_wide (type, low, high);
977 /* Checks that X is integer constant that can be expressed in (unsigned)
978 HOST_WIDE_INT without loss of precision. */
981 cst_and_fits_in_hwi (tree x)
983 if (TREE_CODE (x) != INTEGER_CST)
986 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
989 return (TREE_INT_CST_HIGH (x) == 0
990 || TREE_INT_CST_HIGH (x) == -1);
993 /* Return a new VECTOR_CST node whose type is TYPE and whose values
994 are in a list pointed to by VALS. */
997 build_vector (tree type, tree vals)
999 tree v = make_node (VECTOR_CST);
1000 int over1 = 0, over2 = 0;
1003 TREE_VECTOR_CST_ELTS (v) = vals;
1004 TREE_TYPE (v) = type;
1006 /* Iterate through elements and check for overflow. */
1007 for (link = vals; link; link = TREE_CHAIN (link))
1009 tree value = TREE_VALUE (link);
1011 /* Don't crash if we get an address constant. */
1012 if (!CONSTANT_CLASS_P (value))
1015 over1 |= TREE_OVERFLOW (value);
1016 over2 |= TREE_CONSTANT_OVERFLOW (value);
1019 TREE_OVERFLOW (v) = over1;
1020 TREE_CONSTANT_OVERFLOW (v) = over2;
1025 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1026 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1029 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1031 tree list = NULL_TREE;
1032 unsigned HOST_WIDE_INT idx;
1035 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1036 list = tree_cons (NULL_TREE, value, list);
1037 return build_vector (type, nreverse (list));
1040 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1041 are in the VEC pointed to by VALS. */
1043 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1045 tree c = make_node (CONSTRUCTOR);
1046 TREE_TYPE (c) = type;
1047 CONSTRUCTOR_ELTS (c) = vals;
1051 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1054 build_constructor_single (tree type, tree index, tree value)
1056 VEC(constructor_elt,gc) *v;
1057 constructor_elt *elt;
1060 v = VEC_alloc (constructor_elt, gc, 1);
1061 elt = VEC_quick_push (constructor_elt, v, NULL);
1065 t = build_constructor (type, v);
1066 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1071 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1072 are in a list pointed to by VALS. */
1074 build_constructor_from_list (tree type, tree vals)
1077 VEC(constructor_elt,gc) *v = NULL;
1078 bool constant_p = true;
1082 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1083 for (t = vals; t; t = TREE_CHAIN (t))
1085 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1086 val = TREE_VALUE (t);
1087 elt->index = TREE_PURPOSE (t);
1089 if (!TREE_CONSTANT (val))
1094 t = build_constructor (type, v);
1095 TREE_CONSTANT (t) = constant_p;
1100 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1103 build_real (tree type, REAL_VALUE_TYPE d)
1106 REAL_VALUE_TYPE *dp;
1109 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1110 Consider doing it via real_convert now. */
1112 v = make_node (REAL_CST);
1113 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1114 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1116 TREE_TYPE (v) = type;
1117 TREE_REAL_CST_PTR (v) = dp;
1118 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1122 /* Return a new REAL_CST node whose type is TYPE
1123 and whose value is the integer value of the INTEGER_CST node I. */
1126 real_value_from_int_cst (tree type, tree i)
1130 /* Clear all bits of the real value type so that we can later do
1131 bitwise comparisons to see if two values are the same. */
1132 memset (&d, 0, sizeof d);
1134 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1135 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1136 TYPE_UNSIGNED (TREE_TYPE (i)));
1140 /* Given a tree representing an integer constant I, return a tree
1141 representing the same value as a floating-point constant of type TYPE. */
1144 build_real_from_int_cst (tree type, tree i)
1147 int overflow = TREE_OVERFLOW (i);
1149 v = build_real (type, real_value_from_int_cst (type, i));
1151 TREE_OVERFLOW (v) |= overflow;
1152 TREE_CONSTANT_OVERFLOW (v) |= overflow;
1156 /* Return a newly constructed STRING_CST node whose value is
1157 the LEN characters at STR.
1158 The TREE_TYPE is not initialized. */
1161 build_string (int len, const char *str)
1166 /* Do not waste bytes provided by padding of struct tree_string. */
1167 length = len + offsetof (struct tree_string, str) + 1;
1169 #ifdef GATHER_STATISTICS
1170 tree_node_counts[(int) c_kind]++;
1171 tree_node_sizes[(int) c_kind] += length;
1174 s = ggc_alloc_tree (length);
1176 memset (s, 0, sizeof (struct tree_common));
1177 TREE_SET_CODE (s, STRING_CST);
1178 TREE_CONSTANT (s) = 1;
1179 TREE_INVARIANT (s) = 1;
1180 TREE_STRING_LENGTH (s) = len;
1181 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1182 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1187 /* Return a newly constructed COMPLEX_CST node whose value is
1188 specified by the real and imaginary parts REAL and IMAG.
1189 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1190 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1193 build_complex (tree type, tree real, tree imag)
1195 tree t = make_node (COMPLEX_CST);
1197 TREE_REALPART (t) = real;
1198 TREE_IMAGPART (t) = imag;
1199 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1200 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1201 TREE_CONSTANT_OVERFLOW (t)
1202 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1206 /* Return a constant of arithmetic type TYPE which is the
1207 multiplicative identity of the set TYPE. */
1210 build_one_cst (tree type)
1212 switch (TREE_CODE (type))
1214 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1215 case POINTER_TYPE: case REFERENCE_TYPE:
1217 return build_int_cst (type, 1);
1220 return build_real (type, dconst1);
1227 scalar = build_one_cst (TREE_TYPE (type));
1229 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1231 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1232 cst = tree_cons (NULL_TREE, scalar, cst);
1234 return build_vector (type, cst);
1238 return build_complex (type,
1239 build_one_cst (TREE_TYPE (type)),
1240 fold_convert (TREE_TYPE (type), integer_zero_node));
1247 /* Build a BINFO with LEN language slots. */
1250 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1253 size_t length = (offsetof (struct tree_binfo, base_binfos)
1254 + VEC_embedded_size (tree, base_binfos));
1256 #ifdef GATHER_STATISTICS
1257 tree_node_counts[(int) binfo_kind]++;
1258 tree_node_sizes[(int) binfo_kind] += length;
1261 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1263 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1265 TREE_SET_CODE (t, TREE_BINFO);
1267 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1273 /* Build a newly constructed TREE_VEC node of length LEN. */
1276 make_tree_vec_stat (int len MEM_STAT_DECL)
1279 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1281 #ifdef GATHER_STATISTICS
1282 tree_node_counts[(int) vec_kind]++;
1283 tree_node_sizes[(int) vec_kind] += length;
1286 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1288 memset (t, 0, length);
1290 TREE_SET_CODE (t, TREE_VEC);
1291 TREE_VEC_LENGTH (t) = len;
1296 /* Return 1 if EXPR is the integer constant zero or a complex constant
1300 integer_zerop (tree expr)
1304 return ((TREE_CODE (expr) == INTEGER_CST
1305 && TREE_INT_CST_LOW (expr) == 0
1306 && TREE_INT_CST_HIGH (expr) == 0)
1307 || (TREE_CODE (expr) == COMPLEX_CST
1308 && integer_zerop (TREE_REALPART (expr))
1309 && integer_zerop (TREE_IMAGPART (expr))));
1312 /* Return 1 if EXPR is the integer constant one or the corresponding
1313 complex constant. */
1316 integer_onep (tree expr)
1320 return ((TREE_CODE (expr) == INTEGER_CST
1321 && TREE_INT_CST_LOW (expr) == 1
1322 && TREE_INT_CST_HIGH (expr) == 0)
1323 || (TREE_CODE (expr) == COMPLEX_CST
1324 && integer_onep (TREE_REALPART (expr))
1325 && integer_zerop (TREE_IMAGPART (expr))));
1328 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1329 it contains. Likewise for the corresponding complex constant. */
1332 integer_all_onesp (tree expr)
1339 if (TREE_CODE (expr) == COMPLEX_CST
1340 && integer_all_onesp (TREE_REALPART (expr))
1341 && integer_zerop (TREE_IMAGPART (expr)))
1344 else if (TREE_CODE (expr) != INTEGER_CST)
1347 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1348 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1349 && TREE_INT_CST_HIGH (expr) == -1)
1354 /* Note that using TYPE_PRECISION here is wrong. We care about the
1355 actual bits, not the (arbitrary) range of the type. */
1356 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1357 if (prec >= HOST_BITS_PER_WIDE_INT)
1359 HOST_WIDE_INT high_value;
1362 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1364 /* Can not handle precisions greater than twice the host int size. */
1365 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1366 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1367 /* Shifting by the host word size is undefined according to the ANSI
1368 standard, so we must handle this as a special case. */
1371 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1373 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1374 && TREE_INT_CST_HIGH (expr) == high_value);
1377 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1380 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1384 integer_pow2p (tree expr)
1387 HOST_WIDE_INT high, low;
1391 if (TREE_CODE (expr) == COMPLEX_CST
1392 && integer_pow2p (TREE_REALPART (expr))
1393 && integer_zerop (TREE_IMAGPART (expr)))
1396 if (TREE_CODE (expr) != INTEGER_CST)
1399 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1400 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1401 high = TREE_INT_CST_HIGH (expr);
1402 low = TREE_INT_CST_LOW (expr);
1404 /* First clear all bits that are beyond the type's precision in case
1405 we've been sign extended. */
1407 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1409 else if (prec > HOST_BITS_PER_WIDE_INT)
1410 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1414 if (prec < HOST_BITS_PER_WIDE_INT)
1415 low &= ~((HOST_WIDE_INT) (-1) << prec);
1418 if (high == 0 && low == 0)
1421 return ((high == 0 && (low & (low - 1)) == 0)
1422 || (low == 0 && (high & (high - 1)) == 0));
1425 /* Return 1 if EXPR is an integer constant other than zero or a
1426 complex constant other than zero. */
1429 integer_nonzerop (tree expr)
1433 return ((TREE_CODE (expr) == INTEGER_CST
1434 && (TREE_INT_CST_LOW (expr) != 0
1435 || TREE_INT_CST_HIGH (expr) != 0))
1436 || (TREE_CODE (expr) == COMPLEX_CST
1437 && (integer_nonzerop (TREE_REALPART (expr))
1438 || integer_nonzerop (TREE_IMAGPART (expr)))));
1441 /* Return the power of two represented by a tree node known to be a
1445 tree_log2 (tree expr)
1448 HOST_WIDE_INT high, low;
1452 if (TREE_CODE (expr) == COMPLEX_CST)
1453 return tree_log2 (TREE_REALPART (expr));
1455 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1456 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1458 high = TREE_INT_CST_HIGH (expr);
1459 low = TREE_INT_CST_LOW (expr);
1461 /* First clear all bits that are beyond the type's precision in case
1462 we've been sign extended. */
1464 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1466 else if (prec > HOST_BITS_PER_WIDE_INT)
1467 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1471 if (prec < HOST_BITS_PER_WIDE_INT)
1472 low &= ~((HOST_WIDE_INT) (-1) << prec);
1475 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1476 : exact_log2 (low));
1479 /* Similar, but return the largest integer Y such that 2 ** Y is less
1480 than or equal to EXPR. */
1483 tree_floor_log2 (tree expr)
1486 HOST_WIDE_INT high, low;
1490 if (TREE_CODE (expr) == COMPLEX_CST)
1491 return tree_log2 (TREE_REALPART (expr));
1493 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1494 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1496 high = TREE_INT_CST_HIGH (expr);
1497 low = TREE_INT_CST_LOW (expr);
1499 /* First clear all bits that are beyond the type's precision in case
1500 we've been sign extended. Ignore if type's precision hasn't been set
1501 since what we are doing is setting it. */
1503 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1505 else if (prec > HOST_BITS_PER_WIDE_INT)
1506 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1510 if (prec < HOST_BITS_PER_WIDE_INT)
1511 low &= ~((HOST_WIDE_INT) (-1) << prec);
1514 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1515 : floor_log2 (low));
1518 /* Return 1 if EXPR is the real constant zero. */
1521 real_zerop (tree expr)
1525 return ((TREE_CODE (expr) == REAL_CST
1526 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1527 || (TREE_CODE (expr) == COMPLEX_CST
1528 && real_zerop (TREE_REALPART (expr))
1529 && real_zerop (TREE_IMAGPART (expr))));
1532 /* Return 1 if EXPR is the real constant one in real or complex form. */
1535 real_onep (tree expr)
1539 return ((TREE_CODE (expr) == REAL_CST
1540 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1541 || (TREE_CODE (expr) == COMPLEX_CST
1542 && real_onep (TREE_REALPART (expr))
1543 && real_zerop (TREE_IMAGPART (expr))));
1546 /* Return 1 if EXPR is the real constant two. */
1549 real_twop (tree expr)
1553 return ((TREE_CODE (expr) == REAL_CST
1554 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1555 || (TREE_CODE (expr) == COMPLEX_CST
1556 && real_twop (TREE_REALPART (expr))
1557 && real_zerop (TREE_IMAGPART (expr))));
1560 /* Return 1 if EXPR is the real constant minus one. */
1563 real_minus_onep (tree expr)
1567 return ((TREE_CODE (expr) == REAL_CST
1568 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1569 || (TREE_CODE (expr) == COMPLEX_CST
1570 && real_minus_onep (TREE_REALPART (expr))
1571 && real_zerop (TREE_IMAGPART (expr))));
1574 /* Nonzero if EXP is a constant or a cast of a constant. */
1577 really_constant_p (tree exp)
1579 /* This is not quite the same as STRIP_NOPS. It does more. */
1580 while (TREE_CODE (exp) == NOP_EXPR
1581 || TREE_CODE (exp) == CONVERT_EXPR
1582 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1583 exp = TREE_OPERAND (exp, 0);
1584 return TREE_CONSTANT (exp);
1587 /* Return first list element whose TREE_VALUE is ELEM.
1588 Return 0 if ELEM is not in LIST. */
1591 value_member (tree elem, tree list)
1595 if (elem == TREE_VALUE (list))
1597 list = TREE_CHAIN (list);
1602 /* Return first list element whose TREE_PURPOSE is ELEM.
1603 Return 0 if ELEM is not in LIST. */
1606 purpose_member (tree elem, tree list)
1610 if (elem == TREE_PURPOSE (list))
1612 list = TREE_CHAIN (list);
1617 /* Return nonzero if ELEM is part of the chain CHAIN. */
1620 chain_member (tree elem, tree chain)
1626 chain = TREE_CHAIN (chain);
1632 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1633 We expect a null pointer to mark the end of the chain.
1634 This is the Lisp primitive `length'. */
1637 list_length (tree t)
1640 #ifdef ENABLE_TREE_CHECKING
1648 #ifdef ENABLE_TREE_CHECKING
1651 gcc_assert (p != q);
1659 /* Returns the number of FIELD_DECLs in TYPE. */
1662 fields_length (tree type)
1664 tree t = TYPE_FIELDS (type);
1667 for (; t; t = TREE_CHAIN (t))
1668 if (TREE_CODE (t) == FIELD_DECL)
1674 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1675 by modifying the last node in chain 1 to point to chain 2.
1676 This is the Lisp primitive `nconc'. */
1679 chainon (tree op1, tree op2)
1688 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1690 TREE_CHAIN (t1) = op2;
1692 #ifdef ENABLE_TREE_CHECKING
1695 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1696 gcc_assert (t2 != t1);
1703 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1706 tree_last (tree chain)
1710 while ((next = TREE_CHAIN (chain)))
1715 /* Reverse the order of elements in the chain T,
1716 and return the new head of the chain (old last element). */
1721 tree prev = 0, decl, next;
1722 for (decl = t; decl; decl = next)
1724 next = TREE_CHAIN (decl);
1725 TREE_CHAIN (decl) = prev;
1731 /* Return a newly created TREE_LIST node whose
1732 purpose and value fields are PARM and VALUE. */
1735 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1737 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1738 TREE_PURPOSE (t) = parm;
1739 TREE_VALUE (t) = value;
1743 /* Return a newly created TREE_LIST node whose
1744 purpose and value fields are PURPOSE and VALUE
1745 and whose TREE_CHAIN is CHAIN. */
1748 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1752 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1754 memset (node, 0, sizeof (struct tree_common));
1756 #ifdef GATHER_STATISTICS
1757 tree_node_counts[(int) x_kind]++;
1758 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1761 TREE_SET_CODE (node, TREE_LIST);
1762 TREE_CHAIN (node) = chain;
1763 TREE_PURPOSE (node) = purpose;
1764 TREE_VALUE (node) = value;
1769 /* Return the size nominally occupied by an object of type TYPE
1770 when it resides in memory. The value is measured in units of bytes,
1771 and its data type is that normally used for type sizes
1772 (which is the first type created by make_signed_type or
1773 make_unsigned_type). */
1776 size_in_bytes (tree type)
1780 if (type == error_mark_node)
1781 return integer_zero_node;
1783 type = TYPE_MAIN_VARIANT (type);
1784 t = TYPE_SIZE_UNIT (type);
1788 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1789 return size_zero_node;
1795 /* Return the size of TYPE (in bytes) as a wide integer
1796 or return -1 if the size can vary or is larger than an integer. */
1799 int_size_in_bytes (tree type)
1803 if (type == error_mark_node)
1806 type = TYPE_MAIN_VARIANT (type);
1807 t = TYPE_SIZE_UNIT (type);
1809 || TREE_CODE (t) != INTEGER_CST
1810 || TREE_INT_CST_HIGH (t) != 0
1811 /* If the result would appear negative, it's too big to represent. */
1812 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1815 return TREE_INT_CST_LOW (t);
1818 /* Return the maximum size of TYPE (in bytes) as a wide integer
1819 or return -1 if the size can vary or is larger than an integer. */
1822 max_int_size_in_bytes (tree type)
1824 HOST_WIDE_INT size = -1;
1827 /* If this is an array type, check for a possible MAX_SIZE attached. */
1829 if (TREE_CODE (type) == ARRAY_TYPE)
1831 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1833 if (size_tree && host_integerp (size_tree, 1))
1834 size = tree_low_cst (size_tree, 1);
1837 /* If we still haven't been able to get a size, see if the language
1838 can compute a maximum size. */
1842 size_tree = lang_hooks.types.max_size (type);
1844 if (size_tree && host_integerp (size_tree, 1))
1845 size = tree_low_cst (size_tree, 1);
1851 /* Return the bit position of FIELD, in bits from the start of the record.
1852 This is a tree of type bitsizetype. */
1855 bit_position (tree field)
1857 return bit_from_pos (DECL_FIELD_OFFSET (field),
1858 DECL_FIELD_BIT_OFFSET (field));
1861 /* Likewise, but return as an integer. It must be representable in
1862 that way (since it could be a signed value, we don't have the
1863 option of returning -1 like int_size_in_byte can. */
1866 int_bit_position (tree field)
1868 return tree_low_cst (bit_position (field), 0);
1871 /* Return the byte position of FIELD, in bytes from the start of the record.
1872 This is a tree of type sizetype. */
1875 byte_position (tree field)
1877 return byte_from_pos (DECL_FIELD_OFFSET (field),
1878 DECL_FIELD_BIT_OFFSET (field));
1881 /* Likewise, but return as an integer. It must be representable in
1882 that way (since it could be a signed value, we don't have the
1883 option of returning -1 like int_size_in_byte can. */
1886 int_byte_position (tree field)
1888 return tree_low_cst (byte_position (field), 0);
1891 /* Return the strictest alignment, in bits, that T is known to have. */
1896 unsigned int align0, align1;
1898 switch (TREE_CODE (t))
1900 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1901 /* If we have conversions, we know that the alignment of the
1902 object must meet each of the alignments of the types. */
1903 align0 = expr_align (TREE_OPERAND (t, 0));
1904 align1 = TYPE_ALIGN (TREE_TYPE (t));
1905 return MAX (align0, align1);
1908 /* FIXME tuples: It is unclear to me if this function, which
1909 is only called from ADA, is called on gimple or non gimple
1910 trees. Let's assume it's from gimple trees unless we hit
1914 case SAVE_EXPR: case COMPOUND_EXPR: case GIMPLE_MODIFY_STMT:
1915 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1916 case CLEANUP_POINT_EXPR:
1917 /* These don't change the alignment of an object. */
1918 return expr_align (TREE_OPERAND (t, 0));
1921 /* The best we can do is say that the alignment is the least aligned
1923 align0 = expr_align (TREE_OPERAND (t, 1));
1924 align1 = expr_align (TREE_OPERAND (t, 2));
1925 return MIN (align0, align1);
1927 case LABEL_DECL: case CONST_DECL:
1928 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1929 if (DECL_ALIGN (t) != 0)
1930 return DECL_ALIGN (t);
1934 return FUNCTION_BOUNDARY;
1940 /* Otherwise take the alignment from that of the type. */
1941 return TYPE_ALIGN (TREE_TYPE (t));
1944 /* Return, as a tree node, the number of elements for TYPE (which is an
1945 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1948 array_type_nelts (tree type)
1950 tree index_type, min, max;
1952 /* If they did it with unspecified bounds, then we should have already
1953 given an error about it before we got here. */
1954 if (! TYPE_DOMAIN (type))
1955 return error_mark_node;
1957 index_type = TYPE_DOMAIN (type);
1958 min = TYPE_MIN_VALUE (index_type);
1959 max = TYPE_MAX_VALUE (index_type);
1961 return (integer_zerop (min)
1963 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1966 /* If arg is static -- a reference to an object in static storage -- then
1967 return the object. This is not the same as the C meaning of `static'.
1968 If arg isn't static, return NULL. */
1973 switch (TREE_CODE (arg))
1976 /* Nested functions are static, even though taking their address will
1977 involve a trampoline as we unnest the nested function and create
1978 the trampoline on the tree level. */
1982 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1983 && ! DECL_THREAD_LOCAL_P (arg)
1984 && ! DECL_DLLIMPORT_P (arg)
1988 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1992 return TREE_STATIC (arg) ? arg : NULL;
1999 /* If the thing being referenced is not a field, then it is
2000 something language specific. */
2001 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
2002 return (*lang_hooks.staticp) (arg);
2004 /* If we are referencing a bitfield, we can't evaluate an
2005 ADDR_EXPR at compile time and so it isn't a constant. */
2006 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2009 return staticp (TREE_OPERAND (arg, 0));
2014 case MISALIGNED_INDIRECT_REF:
2015 case ALIGN_INDIRECT_REF:
2017 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2020 case ARRAY_RANGE_REF:
2021 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2022 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2023 return staticp (TREE_OPERAND (arg, 0));
2028 if ((unsigned int) TREE_CODE (arg)
2029 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2030 return lang_hooks.staticp (arg);
2036 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2037 Do this to any expression which may be used in more than one place,
2038 but must be evaluated only once.
2040 Normally, expand_expr would reevaluate the expression each time.
2041 Calling save_expr produces something that is evaluated and recorded
2042 the first time expand_expr is called on it. Subsequent calls to
2043 expand_expr just reuse the recorded value.
2045 The call to expand_expr that generates code that actually computes
2046 the value is the first call *at compile time*. Subsequent calls
2047 *at compile time* generate code to use the saved value.
2048 This produces correct result provided that *at run time* control
2049 always flows through the insns made by the first expand_expr
2050 before reaching the other places where the save_expr was evaluated.
2051 You, the caller of save_expr, must make sure this is so.
2053 Constants, and certain read-only nodes, are returned with no
2054 SAVE_EXPR because that is safe. Expressions containing placeholders
2055 are not touched; see tree.def for an explanation of what these
2059 save_expr (tree expr)
2061 tree t = fold (expr);
2064 /* If the tree evaluates to a constant, then we don't want to hide that
2065 fact (i.e. this allows further folding, and direct checks for constants).
2066 However, a read-only object that has side effects cannot be bypassed.
2067 Since it is no problem to reevaluate literals, we just return the
2069 inner = skip_simple_arithmetic (t);
2071 if (TREE_INVARIANT (inner)
2072 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2073 || TREE_CODE (inner) == SAVE_EXPR
2074 || TREE_CODE (inner) == ERROR_MARK)
2077 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2078 it means that the size or offset of some field of an object depends on
2079 the value within another field.
2081 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2082 and some variable since it would then need to be both evaluated once and
2083 evaluated more than once. Front-ends must assure this case cannot
2084 happen by surrounding any such subexpressions in their own SAVE_EXPR
2085 and forcing evaluation at the proper time. */
2086 if (contains_placeholder_p (inner))
2089 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2091 /* This expression might be placed ahead of a jump to ensure that the
2092 value was computed on both sides of the jump. So make sure it isn't
2093 eliminated as dead. */
2094 TREE_SIDE_EFFECTS (t) = 1;
2095 TREE_INVARIANT (t) = 1;
2099 /* Look inside EXPR and into any simple arithmetic operations. Return
2100 the innermost non-arithmetic node. */
2103 skip_simple_arithmetic (tree expr)
2107 /* We don't care about whether this can be used as an lvalue in this
2109 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2110 expr = TREE_OPERAND (expr, 0);
2112 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2113 a constant, it will be more efficient to not make another SAVE_EXPR since
2114 it will allow better simplification and GCSE will be able to merge the
2115 computations if they actually occur. */
2119 if (UNARY_CLASS_P (inner))
2120 inner = TREE_OPERAND (inner, 0);
2121 else if (BINARY_CLASS_P (inner))
2123 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2124 inner = TREE_OPERAND (inner, 0);
2125 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2126 inner = TREE_OPERAND (inner, 1);
2137 /* Return which tree structure is used by T. */
2139 enum tree_node_structure_enum
2140 tree_node_structure (tree t)
2142 enum tree_code code = TREE_CODE (t);
2144 switch (TREE_CODE_CLASS (code))
2146 case tcc_declaration:
2151 return TS_FIELD_DECL;
2153 return TS_PARM_DECL;
2157 return TS_LABEL_DECL;
2159 return TS_RESULT_DECL;
2161 return TS_CONST_DECL;
2163 return TS_TYPE_DECL;
2165 return TS_FUNCTION_DECL;
2166 case SYMBOL_MEMORY_TAG:
2167 case NAME_MEMORY_TAG:
2168 case STRUCT_FIELD_TAG:
2169 case MEMORY_PARTITION_TAG:
2170 return TS_MEMORY_TAG;
2172 return TS_DECL_NON_COMMON;
2178 case tcc_comparison:
2181 case tcc_expression:
2184 case tcc_gimple_stmt:
2185 return TS_GIMPLE_STATEMENT;
2186 default: /* tcc_constant and tcc_exceptional */
2191 /* tcc_constant cases. */
2192 case INTEGER_CST: return TS_INT_CST;
2193 case REAL_CST: return TS_REAL_CST;
2194 case COMPLEX_CST: return TS_COMPLEX;
2195 case VECTOR_CST: return TS_VECTOR;
2196 case STRING_CST: return TS_STRING;
2197 /* tcc_exceptional cases. */
2198 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2200 case ERROR_MARK: return TS_COMMON;
2201 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2202 case TREE_LIST: return TS_LIST;
2203 case TREE_VEC: return TS_VEC;
2204 case PHI_NODE: return TS_PHI_NODE;
2205 case SSA_NAME: return TS_SSA_NAME;
2206 case PLACEHOLDER_EXPR: return TS_COMMON;
2207 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2208 case BLOCK: return TS_BLOCK;
2209 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2210 case TREE_BINFO: return TS_BINFO;
2211 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2212 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2219 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2220 or offset that depends on a field within a record. */
2223 contains_placeholder_p (tree exp)
2225 enum tree_code code;
2230 code = TREE_CODE (exp);
2231 if (code == PLACEHOLDER_EXPR)
2234 switch (TREE_CODE_CLASS (code))
2237 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2238 position computations since they will be converted into a
2239 WITH_RECORD_EXPR involving the reference, which will assume
2240 here will be valid. */
2241 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2243 case tcc_exceptional:
2244 if (code == TREE_LIST)
2245 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2246 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2251 case tcc_comparison:
2252 case tcc_expression:
2256 /* Ignoring the first operand isn't quite right, but works best. */
2257 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2260 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2261 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2262 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2265 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2271 switch (TREE_CODE_LENGTH (code))
2274 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2276 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2277 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2288 /* Return true if any part of the computation of TYPE involves a
2289 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2290 (for QUAL_UNION_TYPE) and field positions. */
2293 type_contains_placeholder_1 (tree type)
2295 /* If the size contains a placeholder or the parent type (component type in
2296 the case of arrays) type involves a placeholder, this type does. */
2297 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2298 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2299 || (TREE_TYPE (type) != 0
2300 && type_contains_placeholder_p (TREE_TYPE (type))))
2303 /* Now do type-specific checks. Note that the last part of the check above
2304 greatly limits what we have to do below. */
2305 switch (TREE_CODE (type))
2313 case REFERENCE_TYPE:
2321 /* Here we just check the bounds. */
2322 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2323 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2326 /* We're already checked the component type (TREE_TYPE), so just check
2328 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2332 case QUAL_UNION_TYPE:
2336 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2337 if (TREE_CODE (field) == FIELD_DECL
2338 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2339 || (TREE_CODE (type) == QUAL_UNION_TYPE
2340 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2341 || type_contains_placeholder_p (TREE_TYPE (field))))
2353 type_contains_placeholder_p (tree type)
2357 /* If the contains_placeholder_bits field has been initialized,
2358 then we know the answer. */
2359 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2360 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2362 /* Indicate that we've seen this type node, and the answer is false.
2363 This is what we want to return if we run into recursion via fields. */
2364 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2366 /* Compute the real value. */
2367 result = type_contains_placeholder_1 (type);
2369 /* Store the real value. */
2370 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2375 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2376 return a tree with all occurrences of references to F in a
2377 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2378 contains only arithmetic expressions or a CALL_EXPR with a
2379 PLACEHOLDER_EXPR occurring only in its arglist. */
2382 substitute_in_expr (tree exp, tree f, tree r)
2384 enum tree_code code = TREE_CODE (exp);
2385 tree op0, op1, op2, op3;
2389 /* We handle TREE_LIST and COMPONENT_REF separately. */
2390 if (code == TREE_LIST)
2392 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2393 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2394 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2397 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2399 else if (code == COMPONENT_REF)
2401 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2402 and it is the right field, replace it with R. */
2403 for (inner = TREE_OPERAND (exp, 0);
2404 REFERENCE_CLASS_P (inner);
2405 inner = TREE_OPERAND (inner, 0))
2407 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2408 && TREE_OPERAND (exp, 1) == f)
2411 /* If this expression hasn't been completed let, leave it alone. */
2412 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2415 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2416 if (op0 == TREE_OPERAND (exp, 0))
2419 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2420 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2423 switch (TREE_CODE_CLASS (code))
2426 case tcc_declaration:
2429 case tcc_exceptional:
2432 case tcc_comparison:
2433 case tcc_expression:
2435 switch (TREE_CODE_LENGTH (code))
2441 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2442 if (op0 == TREE_OPERAND (exp, 0))
2445 new = fold_build1 (code, TREE_TYPE (exp), op0);
2449 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2450 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2452 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2455 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2459 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2460 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2461 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2463 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2464 && op2 == TREE_OPERAND (exp, 2))
2467 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2471 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2472 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2473 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2474 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2476 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2477 && op2 == TREE_OPERAND (exp, 2)
2478 && op3 == TREE_OPERAND (exp, 3))
2481 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2493 TREE_READONLY (new) = TREE_READONLY (exp);
2497 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2498 for it within OBJ, a tree that is an object or a chain of references. */
2501 substitute_placeholder_in_expr (tree exp, tree obj)
2503 enum tree_code code = TREE_CODE (exp);
2504 tree op0, op1, op2, op3;
2506 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2507 in the chain of OBJ. */
2508 if (code == PLACEHOLDER_EXPR)
2510 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2513 for (elt = obj; elt != 0;
2514 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2515 || TREE_CODE (elt) == COND_EXPR)
2516 ? TREE_OPERAND (elt, 1)
2517 : (REFERENCE_CLASS_P (elt)
2518 || UNARY_CLASS_P (elt)
2519 || BINARY_CLASS_P (elt)
2520 || EXPRESSION_CLASS_P (elt))
2521 ? TREE_OPERAND (elt, 0) : 0))
2522 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2525 for (elt = obj; elt != 0;
2526 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2527 || TREE_CODE (elt) == COND_EXPR)
2528 ? TREE_OPERAND (elt, 1)
2529 : (REFERENCE_CLASS_P (elt)
2530 || UNARY_CLASS_P (elt)
2531 || BINARY_CLASS_P (elt)
2532 || EXPRESSION_CLASS_P (elt))
2533 ? TREE_OPERAND (elt, 0) : 0))
2534 if (POINTER_TYPE_P (TREE_TYPE (elt))
2535 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2537 return fold_build1 (INDIRECT_REF, need_type, elt);
2539 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2540 survives until RTL generation, there will be an error. */
2544 /* TREE_LIST is special because we need to look at TREE_VALUE
2545 and TREE_CHAIN, not TREE_OPERANDS. */
2546 else if (code == TREE_LIST)
2548 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2549 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2550 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2553 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2556 switch (TREE_CODE_CLASS (code))
2559 case tcc_declaration:
2562 case tcc_exceptional:
2565 case tcc_comparison:
2566 case tcc_expression:
2569 switch (TREE_CODE_LENGTH (code))
2575 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2576 if (op0 == TREE_OPERAND (exp, 0))
2579 return fold_build1 (code, TREE_TYPE (exp), op0);
2582 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2583 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2585 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2588 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2591 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2592 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2593 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2595 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2596 && op2 == TREE_OPERAND (exp, 2))
2599 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2602 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2603 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2604 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2605 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2607 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2608 && op2 == TREE_OPERAND (exp, 2)
2609 && op3 == TREE_OPERAND (exp, 3))
2612 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2624 /* Stabilize a reference so that we can use it any number of times
2625 without causing its operands to be evaluated more than once.
2626 Returns the stabilized reference. This works by means of save_expr,
2627 so see the caveats in the comments about save_expr.
2629 Also allows conversion expressions whose operands are references.
2630 Any other kind of expression is returned unchanged. */
2633 stabilize_reference (tree ref)
2636 enum tree_code code = TREE_CODE (ref);
2643 /* No action is needed in this case. */
2649 case FIX_TRUNC_EXPR:
2650 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2654 result = build_nt (INDIRECT_REF,
2655 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2659 result = build_nt (COMPONENT_REF,
2660 stabilize_reference (TREE_OPERAND (ref, 0)),
2661 TREE_OPERAND (ref, 1), NULL_TREE);
2665 result = build_nt (BIT_FIELD_REF,
2666 stabilize_reference (TREE_OPERAND (ref, 0)),
2667 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2668 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2672 result = build_nt (ARRAY_REF,
2673 stabilize_reference (TREE_OPERAND (ref, 0)),
2674 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2675 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2678 case ARRAY_RANGE_REF:
2679 result = build_nt (ARRAY_RANGE_REF,
2680 stabilize_reference (TREE_OPERAND (ref, 0)),
2681 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2682 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2686 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2687 it wouldn't be ignored. This matters when dealing with
2689 return stabilize_reference_1 (ref);
2691 /* If arg isn't a kind of lvalue we recognize, make no change.
2692 Caller should recognize the error for an invalid lvalue. */
2697 return error_mark_node;
2700 TREE_TYPE (result) = TREE_TYPE (ref);
2701 TREE_READONLY (result) = TREE_READONLY (ref);
2702 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2703 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2708 /* Subroutine of stabilize_reference; this is called for subtrees of
2709 references. Any expression with side-effects must be put in a SAVE_EXPR
2710 to ensure that it is only evaluated once.
2712 We don't put SAVE_EXPR nodes around everything, because assigning very
2713 simple expressions to temporaries causes us to miss good opportunities
2714 for optimizations. Among other things, the opportunity to fold in the
2715 addition of a constant into an addressing mode often gets lost, e.g.
2716 "y[i+1] += x;". In general, we take the approach that we should not make
2717 an assignment unless we are forced into it - i.e., that any non-side effect
2718 operator should be allowed, and that cse should take care of coalescing
2719 multiple utterances of the same expression should that prove fruitful. */
2722 stabilize_reference_1 (tree e)
2725 enum tree_code code = TREE_CODE (e);
2727 /* We cannot ignore const expressions because it might be a reference
2728 to a const array but whose index contains side-effects. But we can
2729 ignore things that are actual constant or that already have been
2730 handled by this function. */
2732 if (TREE_INVARIANT (e))
2735 switch (TREE_CODE_CLASS (code))
2737 case tcc_exceptional:
2739 case tcc_declaration:
2740 case tcc_comparison:
2742 case tcc_expression:
2744 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2745 so that it will only be evaluated once. */
2746 /* The reference (r) and comparison (<) classes could be handled as
2747 below, but it is generally faster to only evaluate them once. */
2748 if (TREE_SIDE_EFFECTS (e))
2749 return save_expr (e);
2753 /* Constants need no processing. In fact, we should never reach
2758 /* Division is slow and tends to be compiled with jumps,
2759 especially the division by powers of 2 that is often
2760 found inside of an array reference. So do it just once. */
2761 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2762 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2763 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2764 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2765 return save_expr (e);
2766 /* Recursively stabilize each operand. */
2767 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2768 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2772 /* Recursively stabilize each operand. */
2773 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2780 TREE_TYPE (result) = TREE_TYPE (e);
2781 TREE_READONLY (result) = TREE_READONLY (e);
2782 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2783 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2784 TREE_INVARIANT (result) = 1;
2789 /* Low-level constructors for expressions. */
2791 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2792 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2795 recompute_tree_invariant_for_addr_expr (tree t)
2798 bool tc = true, ti = true, se = false;
2800 /* We started out assuming this address is both invariant and constant, but
2801 does not have side effects. Now go down any handled components and see if
2802 any of them involve offsets that are either non-constant or non-invariant.
2803 Also check for side-effects.
2805 ??? Note that this code makes no attempt to deal with the case where
2806 taking the address of something causes a copy due to misalignment. */
2808 #define UPDATE_TITCSE(NODE) \
2809 do { tree _node = (NODE); \
2810 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2811 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2812 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2814 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2815 node = TREE_OPERAND (node, 0))
2817 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2818 array reference (probably made temporarily by the G++ front end),
2819 so ignore all the operands. */
2820 if ((TREE_CODE (node) == ARRAY_REF
2821 || TREE_CODE (node) == ARRAY_RANGE_REF)
2822 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2824 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2825 if (TREE_OPERAND (node, 2))
2826 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2827 if (TREE_OPERAND (node, 3))
2828 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2830 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2831 FIELD_DECL, apparently. The G++ front end can put something else
2832 there, at least temporarily. */
2833 else if (TREE_CODE (node) == COMPONENT_REF
2834 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2836 if (TREE_OPERAND (node, 2))
2837 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2839 else if (TREE_CODE (node) == BIT_FIELD_REF)
2840 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2843 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2845 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2846 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2847 invariant and constant if the decl is static. It's also invariant if it's
2848 a decl in the current function. Taking the address of a volatile variable
2849 is not volatile. If it's a constant, the address is both invariant and
2850 constant. Otherwise it's neither. */
2851 if (TREE_CODE (node) == INDIRECT_REF)
2852 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2853 else if (DECL_P (node))
2857 else if (decl_function_context (node) == current_function_decl
2858 /* Addresses of thread-local variables are invariant. */
2859 || (TREE_CODE (node) == VAR_DECL
2860 && DECL_THREAD_LOCAL_P (node)))
2865 else if (CONSTANT_CLASS_P (node))
2870 se |= TREE_SIDE_EFFECTS (node);
2873 TREE_CONSTANT (t) = tc;
2874 TREE_INVARIANT (t) = ti;
2875 TREE_SIDE_EFFECTS (t) = se;
2876 #undef UPDATE_TITCSE
2879 /* Build an expression of code CODE, data type TYPE, and operands as
2880 specified. Expressions and reference nodes can be created this way.
2881 Constants, decls, types and misc nodes cannot be.
2883 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2884 enough for all extant tree codes. */
2887 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2891 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2893 t = make_node_stat (code PASS_MEM_STAT);
2900 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2902 int length = sizeof (struct tree_exp);
2903 #ifdef GATHER_STATISTICS
2904 tree_node_kind kind;
2908 #ifdef GATHER_STATISTICS
2909 switch (TREE_CODE_CLASS (code))
2911 case tcc_statement: /* an expression with side effects */
2914 case tcc_reference: /* a reference */
2922 tree_node_counts[(int) kind]++;
2923 tree_node_sizes[(int) kind] += length;
2926 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2928 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2930 memset (t, 0, sizeof (struct tree_common));
2932 TREE_SET_CODE (t, code);
2934 TREE_TYPE (t) = type;
2935 #ifdef USE_MAPPED_LOCATION
2936 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2938 SET_EXPR_LOCUS (t, NULL);
2940 TREE_COMPLEXITY (t) = 0;
2941 TREE_OPERAND (t, 0) = node;
2942 TREE_BLOCK (t) = NULL_TREE;
2943 if (node && !TYPE_P (node))
2945 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2946 TREE_READONLY (t) = TREE_READONLY (node);
2949 if (TREE_CODE_CLASS (code) == tcc_statement)
2950 TREE_SIDE_EFFECTS (t) = 1;
2954 /* All of these have side-effects, no matter what their
2956 TREE_SIDE_EFFECTS (t) = 1;
2957 TREE_READONLY (t) = 0;
2960 case MISALIGNED_INDIRECT_REF:
2961 case ALIGN_INDIRECT_REF:
2963 /* Whether a dereference is readonly has nothing to do with whether
2964 its operand is readonly. */
2965 TREE_READONLY (t) = 0;
2970 recompute_tree_invariant_for_addr_expr (t);
2974 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2975 && node && !TYPE_P (node)
2976 && TREE_CONSTANT (node))
2977 TREE_CONSTANT (t) = 1;
2978 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2979 && node && TREE_INVARIANT (node))
2980 TREE_INVARIANT (t) = 1;
2981 if (TREE_CODE_CLASS (code) == tcc_reference
2982 && node && TREE_THIS_VOLATILE (node))
2983 TREE_THIS_VOLATILE (t) = 1;
2990 #define PROCESS_ARG(N) \
2992 TREE_OPERAND (t, N) = arg##N; \
2993 if (arg##N &&!TYPE_P (arg##N)) \
2995 if (TREE_SIDE_EFFECTS (arg##N)) \
2997 if (!TREE_READONLY (arg##N)) \
2999 if (!TREE_CONSTANT (arg##N)) \
3001 if (!TREE_INVARIANT (arg##N)) \
3007 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3009 bool constant, read_only, side_effects, invariant;
3012 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3014 if (code == MODIFY_EXPR && cfun && cfun->gimplified)
3016 /* We should be talking GIMPLE_MODIFY_STMT by now. */
3020 /* FIXME tuples: For now let's be lazy; later we must rewrite all
3021 build2 calls to build2_gimple calls. */
3022 if (TREE_CODE_CLASS (code) == tcc_gimple_stmt)
3023 return build2_gimple (code, arg0, arg1);
3025 t = make_node_stat (code PASS_MEM_STAT);
3028 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3029 result based on those same flags for the arguments. But if the
3030 arguments aren't really even `tree' expressions, we shouldn't be trying
3033 /* Expressions without side effects may be constant if their
3034 arguments are as well. */
3035 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3036 || TREE_CODE_CLASS (code) == tcc_binary);
3038 side_effects = TREE_SIDE_EFFECTS (t);
3039 invariant = constant;
3044 TREE_READONLY (t) = read_only;
3045 TREE_CONSTANT (t) = constant;
3046 TREE_INVARIANT (t) = invariant;
3047 TREE_SIDE_EFFECTS (t) = side_effects;
3048 TREE_THIS_VOLATILE (t)
3049 = (TREE_CODE_CLASS (code) == tcc_reference
3050 && arg0 && TREE_THIS_VOLATILE (arg0));
3056 /* Similar as build2_stat, but for GIMPLE tuples. For convenience's sake,
3057 arguments and return type are trees. */
3060 build2_gimple_stat (enum tree_code code, tree arg0, tree arg1 MEM_STAT_DECL)
3065 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3067 t = make_node_stat (code PASS_MEM_STAT);
3069 side_effects = TREE_SIDE_EFFECTS (t);
3071 /* ?? We don't care about setting flags for tuples... */
3072 GIMPLE_STMT_OPERAND (t, 0) = arg0;
3073 GIMPLE_STMT_OPERAND (t, 1) = arg1;
3075 /* ...except perhaps side_effects and volatility. ?? */
3076 TREE_SIDE_EFFECTS (t) = side_effects;
3077 TREE_THIS_VOLATILE (t) = (TREE_CODE_CLASS (code) == tcc_reference
3078 && arg0 && TREE_THIS_VOLATILE (arg0));
3085 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3086 tree arg2 MEM_STAT_DECL)
3088 bool constant, read_only, side_effects, invariant;
3091 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3093 t = make_node_stat (code PASS_MEM_STAT);
3096 side_effects = TREE_SIDE_EFFECTS (t);
3102 if (code == CALL_EXPR && !side_effects)
3107 /* Calls have side-effects, except those to const or
3109 i = call_expr_flags (t);
3110 if (!(i & (ECF_CONST | ECF_PURE)))
3113 /* And even those have side-effects if their arguments do. */
3114 else for (node = arg1; node; node = TREE_CHAIN (node))
3115 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
3122 TREE_SIDE_EFFECTS (t) = side_effects;
3123 TREE_THIS_VOLATILE (t)
3124 = (TREE_CODE_CLASS (code) == tcc_reference
3125 && arg0 && TREE_THIS_VOLATILE (arg0));
3131 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3132 tree arg2, tree arg3 MEM_STAT_DECL)
3134 bool constant, read_only, side_effects, invariant;
3137 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3139 t = make_node_stat (code PASS_MEM_STAT);
3142 side_effects = TREE_SIDE_EFFECTS (t);
3149 TREE_SIDE_EFFECTS (t) = side_effects;
3150 TREE_THIS_VOLATILE (t)
3151 = (TREE_CODE_CLASS (code) == tcc_reference
3152 && arg0 && TREE_THIS_VOLATILE (arg0));
3158 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3159 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3161 bool constant, read_only, side_effects, invariant;
3164 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3166 t = make_node_stat (code PASS_MEM_STAT);
3169 side_effects = TREE_SIDE_EFFECTS (t);
3177 TREE_SIDE_EFFECTS (t) = side_effects;
3178 TREE_THIS_VOLATILE (t)
3179 = (TREE_CODE_CLASS (code) == tcc_reference
3180 && arg0 && TREE_THIS_VOLATILE (arg0));
3186 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3187 tree arg2, tree arg3, tree arg4, tree arg5,
3188 tree arg6 MEM_STAT_DECL)
3190 bool constant, read_only, side_effects, invariant;
3193 gcc_assert (code == TARGET_MEM_REF);
3195 t = make_node_stat (code PASS_MEM_STAT);
3198 side_effects = TREE_SIDE_EFFECTS (t);
3208 TREE_SIDE_EFFECTS (t) = side_effects;
3209 TREE_THIS_VOLATILE (t) = 0;
3214 /* Similar except don't specify the TREE_TYPE
3215 and leave the TREE_SIDE_EFFECTS as 0.
3216 It is permissible for arguments to be null,
3217 or even garbage if their values do not matter. */
3220 build_nt (enum tree_code code, ...)
3229 t = make_node (code);
3230 length = TREE_CODE_LENGTH (code);
3232 for (i = 0; i < length; i++)
3233 TREE_OPERAND (t, i) = va_arg (p, tree);
3239 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3240 We do NOT enter this node in any sort of symbol table.
3242 layout_decl is used to set up the decl's storage layout.
3243 Other slots are initialized to 0 or null pointers. */
3246 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3250 t = make_node_stat (code PASS_MEM_STAT);
3252 /* if (type == error_mark_node)
3253 type = integer_type_node; */
3254 /* That is not done, deliberately, so that having error_mark_node
3255 as the type can suppress useless errors in the use of this variable. */
3257 DECL_NAME (t) = name;
3258 TREE_TYPE (t) = type;
3260 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3262 else if (code == FUNCTION_DECL)
3263 DECL_MODE (t) = FUNCTION_MODE;
3268 /* Builds and returns function declaration with NAME and TYPE. */
3271 build_fn_decl (const char *name, tree type)
3273 tree id = get_identifier (name);
3274 tree decl = build_decl (FUNCTION_DECL, id, type);
3276 DECL_EXTERNAL (decl) = 1;
3277 TREE_PUBLIC (decl) = 1;
3278 DECL_ARTIFICIAL (decl) = 1;
3279 TREE_NOTHROW (decl) = 1;
3285 /* BLOCK nodes are used to represent the structure of binding contours
3286 and declarations, once those contours have been exited and their contents
3287 compiled. This information is used for outputting debugging info. */
3290 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3292 tree block = make_node (BLOCK);
3294 BLOCK_VARS (block) = vars;
3295 BLOCK_SUBBLOCKS (block) = subblocks;
3296 BLOCK_SUPERCONTEXT (block) = supercontext;
3297 BLOCK_CHAIN (block) = chain;
3301 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3302 /* ??? gengtype doesn't handle conditionals */
3303 static GTY(()) source_locus last_annotated_node;
3306 #ifdef USE_MAPPED_LOCATION
3309 expand_location (source_location loc)
3311 expanded_location xloc;
3320 const struct line_map *map = linemap_lookup (&line_table, loc);
3321 xloc.file = map->to_file;
3322 xloc.line = SOURCE_LINE (map, loc);
3323 xloc.column = SOURCE_COLUMN (map, loc);
3330 /* Record the exact location where an expression or an identifier were
3334 annotate_with_file_line (tree node, const char *file, int line)
3336 /* Roughly one percent of the calls to this function are to annotate
3337 a node with the same information already attached to that node!
3338 Just return instead of wasting memory. */
3339 if (EXPR_LOCUS (node)
3340 && EXPR_LINENO (node) == line
3341 && (EXPR_FILENAME (node) == file
3342 || !strcmp (EXPR_FILENAME (node), file)))
3344 last_annotated_node = EXPR_LOCUS (node);
3348 /* In heavily macroized code (such as GCC itself) this single
3349 entry cache can reduce the number of allocations by more
3351 if (last_annotated_node
3352 && last_annotated_node->line == line
3353 && (last_annotated_node->file == file
3354 || !strcmp (last_annotated_node->file, file)))
3356 SET_EXPR_LOCUS (node, last_annotated_node);
3360 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3361 EXPR_LINENO (node) = line;
3362 EXPR_FILENAME (node) = file;
3363 last_annotated_node = EXPR_LOCUS (node);
3367 annotate_with_locus (tree node, location_t locus)
3369 annotate_with_file_line (node, locus.file, locus.line);
3373 /* Source location accessor functions. */
3376 /* The source location of this expression. Non-tree_exp nodes such as
3377 decls and constants can be shared among multiple locations, so
3380 expr_location (tree node)
3382 #ifdef USE_MAPPED_LOCATION
3383 if (GIMPLE_STMT_P (node))
3384 return GIMPLE_STMT_LOCUS (node);
3385 return EXPR_P (node) ? node->exp.locus : UNKNOWN_LOCATION;
3387 if (GIMPLE_STMT_P (node))
3388 return EXPR_HAS_LOCATION (node)
3389 ? *GIMPLE_STMT_LOCUS (node) : UNKNOWN_LOCATION;
3390 return EXPR_HAS_LOCATION (node) ? *node->exp.locus : UNKNOWN_LOCATION;
3395 set_expr_location (tree node, location_t locus)
3397 #ifdef USE_MAPPED_LOCATION
3398 if (GIMPLE_STMT_P (node))
3399 GIMPLE_STMT_LOCUS (node) = locus;
3401 EXPR_CHECK (node)->exp.locus = locus;
3403 annotate_with_locus (node, locus);
3408 expr_has_location (tree node)
3410 #ifdef USE_MAPPED_LOCATION
3411 return expr_location (node) != UNKNOWN_LOCATION;
3413 return expr_locus (node) != NULL;
3417 #ifdef USE_MAPPED_LOCATION
3422 expr_locus (tree node)
3424 #ifdef USE_MAPPED_LOCATION
3425 if (GIMPLE_STMT_P (node))
3426 return &GIMPLE_STMT_LOCUS (node);
3427 return EXPR_P (node) ? &node->exp.locus : (location_t *) NULL;
3429 if (GIMPLE_STMT_P (node))
3430 return GIMPLE_STMT_LOCUS (node);
3431 /* ?? The cast below was originally "(location_t *)" in the macro,
3432 but that makes no sense. ?? */
3433 return EXPR_P (node) ? node->exp.locus : (source_locus) NULL;
3438 set_expr_locus (tree node,
3439 #ifdef USE_MAPPED_LOCATION
3440 source_location *loc
3446 #ifdef USE_MAPPED_LOCATION
3449 if (GIMPLE_STMT_P (node))
3450 GIMPLE_STMT_LOCUS (node) = UNKNOWN_LOCATION;
3452 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3456 if (GIMPLE_STMT_P (node))
3457 GIMPLE_STMT_LOCUS (node) = *loc;
3459 EXPR_CHECK (node)->exp.locus = *loc;
3462 if (GIMPLE_STMT_P (node))
3463 GIMPLE_STMT_LOCUS (node) = loc;
3465 EXPR_CHECK (node)->exp.locus = loc;
3470 expr_filename (tree node)
3472 #ifdef USE_MAPPED_LOCATION
3473 if (GIMPLE_STMT_P (node))
3474 return &LOCATION_FILE (GIMPLE_STMT_LOCUS (node));
3475 return &LOCATION_FILE (EXPR_CHECK (node)->exp.locus);
3477 if (GIMPLE_STMT_P (node))
3478 return &GIMPLE_STMT_LOCUS (node)->file;
3479 return &(EXPR_CHECK (node)->exp.locus->file);
3484 expr_lineno (tree node)
3486 #ifdef USE_MAPPED_LOCATION
3487 if (GIMPLE_STMT_P (node))
3488 return &LOCATION_LINE (GIMPLE_STMT_LOCUS (node));
3489 return &LOCATION_LINE (EXPR_CHECK (node)->exp.locus);
3491 if (GIMPLE_STMT_P (node))
3492 return &GIMPLE_STMT_LOCUS (node)->line;
3493 return &EXPR_CHECK (node)->exp.locus->line;
3497 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3501 build_decl_attribute_variant (tree ddecl, tree attribute)
3503 DECL_ATTRIBUTES (ddecl) = attribute;
3507 /* Borrowed from hashtab.c iterative_hash implementation. */
3508 #define mix(a,b,c) \
3510 a -= b; a -= c; a ^= (c>>13); \
3511 b -= c; b -= a; b ^= (a<< 8); \
3512 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3513 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3514 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3515 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3516 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3517 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3518 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3522 /* Produce good hash value combining VAL and VAL2. */
3523 static inline hashval_t
3524 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3526 /* the golden ratio; an arbitrary value. */
3527 hashval_t a = 0x9e3779b9;
3533 /* Produce good hash value combining PTR and VAL2. */
3534 static inline hashval_t
3535 iterative_hash_pointer (void *ptr, hashval_t val2)
3537 if (sizeof (ptr) == sizeof (hashval_t))
3538 return iterative_hash_hashval_t ((size_t) ptr, val2);
3541 hashval_t a = (hashval_t) (size_t) ptr;
3542 /* Avoid warnings about shifting of more than the width of the type on
3543 hosts that won't execute this path. */
3545 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3551 /* Produce good hash value combining VAL and VAL2. */
3552 static inline hashval_t
3553 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3555 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3556 return iterative_hash_hashval_t (val, val2);
3559 hashval_t a = (hashval_t) val;
3560 /* Avoid warnings about shifting of more than the width of the type on
3561 hosts that won't execute this path. */
3563 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3565 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3567 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3568 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3575 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3576 is ATTRIBUTE and its qualifiers are QUALS.
3578 Record such modified types already made so we don't make duplicates. */
3581 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3583 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3585 hashval_t hashcode = 0;
3587 enum tree_code code = TREE_CODE (ttype);
3589 ntype = copy_node (ttype);
3591 TYPE_POINTER_TO (ntype) = 0;
3592 TYPE_REFERENCE_TO (ntype) = 0;
3593 TYPE_ATTRIBUTES (ntype) = attribute;
3595 if (TYPE_STRUCTURAL_EQUALITY_P (ttype))
3596 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3598 TYPE_CANONICAL (ntype)
3599 = build_qualified_type (TYPE_CANONICAL (ttype), quals);
3601 /* Create a new main variant of TYPE. */
3602 TYPE_MAIN_VARIANT (ntype) = ntype;
3603 TYPE_NEXT_VARIANT (ntype) = 0;
3604 set_type_quals (ntype, TYPE_UNQUALIFIED);
3606 hashcode = iterative_hash_object (code, hashcode);
3607 if (TREE_TYPE (ntype))
3608 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3610 hashcode = attribute_hash_list (attribute, hashcode);
3612 switch (TREE_CODE (ntype))
3615 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3618 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3622 hashcode = iterative_hash_object
3623 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3624 hashcode = iterative_hash_object
3625 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3629 unsigned int precision = TYPE_PRECISION (ntype);
3630 hashcode = iterative_hash_object (precision, hashcode);
3637 ntype = type_hash_canon (hashcode, ntype);
3639 /* If the target-dependent attributes make NTYPE different from
3640 its canonical type, we will need to use structural equality
3641 checks for this qualified type. */
3642 if (!targetm.comp_type_attributes (ntype, ttype))
3643 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3645 ttype = build_qualified_type (ntype, quals);
3652 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3655 Record such modified types already made so we don't make duplicates. */
3658 build_type_attribute_variant (tree ttype, tree attribute)
3660 return build_type_attribute_qual_variant (ttype, attribute,
3661 TYPE_QUALS (ttype));
3664 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3667 We try both `text' and `__text__', ATTR may be either one. */
3668 /* ??? It might be a reasonable simplification to require ATTR to be only
3669 `text'. One might then also require attribute lists to be stored in
3670 their canonicalized form. */
3673 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3678 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3681 p = IDENTIFIER_POINTER (ident);
3682 ident_len = IDENTIFIER_LENGTH (ident);
3684 if (ident_len == attr_len
3685 && strcmp (attr, p) == 0)
3688 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3691 gcc_assert (attr[1] == '_');
3692 gcc_assert (attr[attr_len - 2] == '_');
3693 gcc_assert (attr[attr_len - 1] == '_');
3694 if (ident_len == attr_len - 4
3695 && strncmp (attr + 2, p, attr_len - 4) == 0)
3700 if (ident_len == attr_len + 4
3701 && p[0] == '_' && p[1] == '_'
3702 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3703 && strncmp (attr, p + 2, attr_len) == 0)
3710 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3713 We try both `text' and `__text__', ATTR may be either one. */
3716 is_attribute_p (const char *attr, tree ident)
3718 return is_attribute_with_length_p (attr, strlen (attr), ident);
3721 /* Given an attribute name and a list of attributes, return a pointer to the
3722 attribute's list element if the attribute is part of the list, or NULL_TREE
3723 if not found. If the attribute appears more than once, this only
3724 returns the first occurrence; the TREE_CHAIN of the return value should
3725 be passed back in if further occurrences are wanted. */
3728 lookup_attribute (const char *attr_name, tree list)
3731 size_t attr_len = strlen (attr_name);
3733 for (l = list; l; l = TREE_CHAIN (l))
3735 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3736 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3743 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3747 remove_attribute (const char *attr_name, tree list)
3750 size_t attr_len = strlen (attr_name);
3752 for (p = &list; *p; )
3755 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3756 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3757 *p = TREE_CHAIN (l);
3759 p = &TREE_CHAIN (l);
3765 /* Return an attribute list that is the union of a1 and a2. */
3768 merge_attributes (tree a1, tree a2)
3772 /* Either one unset? Take the set one. */
3774 if ((attributes = a1) == 0)
3777 /* One that completely contains the other? Take it. */
3779 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3781 if (attribute_list_contained (a2, a1))
3785 /* Pick the longest list, and hang on the other list. */
3787 if (list_length (a1) < list_length (a2))
3788 attributes = a2, a2 = a1;
3790 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3793 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3796 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3799 if (TREE_VALUE (a) != NULL
3800 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3801 && TREE_VALUE (a2) != NULL
3802 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3804 if (simple_cst_list_equal (TREE_VALUE (a),
3805 TREE_VALUE (a2)) == 1)
3808 else if (simple_cst_equal (TREE_VALUE (a),
3809 TREE_VALUE (a2)) == 1)
3814 a1 = copy_node (a2);
3815 TREE_CHAIN (a1) = attributes;
3824 /* Given types T1 and T2, merge their attributes and return
3828 merge_type_attributes (tree t1, tree t2)
3830 return merge_attributes (TYPE_ATTRIBUTES (t1),
3831 TYPE_ATTRIBUTES (t2));
3834 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3838 merge_decl_attributes (tree olddecl, tree newdecl)
3840 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3841 DECL_ATTRIBUTES (newdecl));
3844 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3846 /* Specialization of merge_decl_attributes for various Windows targets.
3848 This handles the following situation:
3850 __declspec (dllimport) int foo;
3853 The second instance of `foo' nullifies the dllimport. */
3856 merge_dllimport_decl_attributes (tree old, tree new)
3859 int delete_dllimport_p = 1;
3861 /* What we need to do here is remove from `old' dllimport if it doesn't
3862 appear in `new'. dllimport behaves like extern: if a declaration is
3863 marked dllimport and a definition appears later, then the object
3864 is not dllimport'd. We also remove a `new' dllimport if the old list
3865 contains dllexport: dllexport always overrides dllimport, regardless
3866 of the order of declaration. */
3867 if (!VAR_OR_FUNCTION_DECL_P (new))
3868 delete_dllimport_p = 0;
3869 else if (DECL_DLLIMPORT_P (new)
3870 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3872 DECL_DLLIMPORT_P (new) = 0;
3873 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3874 "dllimport ignored", new);
3876 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3878 /* Warn about overriding a symbol that has already been used. eg:
3879 extern int __attribute__ ((dllimport)) foo;
3880 int* bar () {return &foo;}
3883 if (TREE_USED (old))
3885 warning (0, "%q+D redeclared without dllimport attribute "
3886 "after being referenced with dll linkage", new);
3887 /* If we have used a variable's address with dllimport linkage,
3888 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3889 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3891 We still remove the attribute so that assembler code refers
3892 to '&foo rather than '_imp__foo'. */
3893 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3894 DECL_DLLIMPORT_P (new) = 1;
3897 /* Let an inline definition silently override the external reference,
3898 but otherwise warn about attribute inconsistency. */
3899 else if (TREE_CODE (new) == VAR_DECL
3900 || !DECL_DECLARED_INLINE_P (new))
3901 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3902 "previous dllimport ignored", new);
3905 delete_dllimport_p = 0;
3907 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3909 if (delete_dllimport_p)
3912 const size_t attr_len = strlen ("dllimport");
3914 /* Scan the list for dllimport and delete it. */
3915 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3917 if (is_attribute_with_length_p ("dllimport", attr_len,
3920 if (prev == NULL_TREE)
3923 TREE_CHAIN (prev) = TREE_CHAIN (t);
3932 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3933 struct attribute_spec.handler. */
3936 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3941 /* These attributes may apply to structure and union types being created,
3942 but otherwise should pass to the declaration involved. */
3945 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3946 | (int) ATTR_FLAG_ARRAY_NEXT))
3948 *no_add_attrs = true;
3949 return tree_cons (name, args, NULL_TREE);
3951 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3953 warning (OPT_Wattributes, "%qs attribute ignored",
3954 IDENTIFIER_POINTER (name));
3955 *no_add_attrs = true;
3961 if (TREE_CODE (node) != FUNCTION_DECL
3962 && TREE_CODE (node) != VAR_DECL)
3964 *no_add_attrs = true;
3965 warning (OPT_Wattributes, "%qs attribute ignored",
3966 IDENTIFIER_POINTER (name));
3970 /* Report error on dllimport ambiguities seen now before they cause
3972 else if (is_attribute_p ("dllimport", name))
3974 /* Honor any target-specific overrides. */
3975 if (!targetm.valid_dllimport_attribute_p (node))
3976 *no_add_attrs = true;
3978 else if (TREE_CODE (node) == FUNCTION_DECL
3979 && DECL_DECLARED_INLINE_P (node))
3981 warning (OPT_Wattributes, "inline function %q+D declared as "
3982 " dllimport: attribute ignored", node);
3983 *no_add_attrs = true;
3985 /* Like MS, treat definition of dllimported variables and
3986 non-inlined functions on declaration as syntax errors. */
3987 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
3989 error ("function %q+D definition is marked dllimport", node);
3990 *no_add_attrs = true;
3993 else if (TREE_CODE (node) == VAR_DECL)
3995 if (DECL_INITIAL (node))
3997 error ("variable %q+D definition is marked dllimport",
3999 *no_add_attrs = true;
4002 /* `extern' needn't be specified with dllimport.
4003 Specify `extern' now and hope for the best. Sigh. */
4004 DECL_EXTERNAL (node) = 1;
4005 /* Also, implicitly give dllimport'd variables declared within
4006 a function global scope, unless declared static. */
4007 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4008 TREE_PUBLIC (node) = 1;
4011 if (*no_add_attrs == false)
4012 DECL_DLLIMPORT_P (node) = 1;
4015 /* Report error if symbol is not accessible at global scope. */
4016 if (!TREE_PUBLIC (node)
4017 && (TREE_CODE (node) == VAR_DECL
4018 || TREE_CODE (node) == FUNCTION_DECL))
4020 error ("external linkage required for symbol %q+D because of "
4021 "%qs attribute", node, IDENTIFIER_POINTER (name));
4022 *no_add_attrs = true;
4028 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4030 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4031 of the various TYPE_QUAL values. */
4034 set_type_quals (tree type, int type_quals)
4036 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4037 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4038 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4041 /* Returns true iff cand is equivalent to base with type_quals. */
4044 check_qualified_type (tree cand, tree base, int type_quals)
4046 return (TYPE_QUALS (cand) == type_quals
4047 && TYPE_NAME (cand) == TYPE_NAME (base)
4048 /* Apparently this is needed for Objective-C. */
4049 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4050 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4051 TYPE_ATTRIBUTES (base)));
4054 /* Return a version of the TYPE, qualified as indicated by the
4055 TYPE_QUALS, if one exists. If no qualified version exists yet,
4056 return NULL_TREE. */
4059 get_qualified_type (tree type, int type_quals)
4063 if (TYPE_QUALS (type) == type_quals)
4066 /* Search the chain of variants to see if there is already one there just
4067 like the one we need to have. If so, use that existing one. We must
4068 preserve the TYPE_NAME, since there is code that depends on this. */
4069 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4070 if (check_qualified_type (t, type, type_quals))
4076 /* Like get_qualified_type, but creates the type if it does not
4077 exist. This function never returns NULL_TREE. */
4080 build_qualified_type (tree type, int type_quals)
4084 /* See if we already have the appropriate qualified variant. */
4085 t = get_qualified_type (type, type_quals);
4087 /* If not, build it. */
4090 t = build_variant_type_copy (type);
4091 set_type_quals (t, type_quals);
4093 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4094 /* Propagate structural equality. */
4095 SET_TYPE_STRUCTURAL_EQUALITY (t);
4096 else if (TYPE_CANONICAL (type) != type)
4097 /* Build the underlying canonical type, since it is different
4099 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4102 /* T is its own canonical type. */
4103 TYPE_CANONICAL (t) = t;
4110 /* Create a new distinct copy of TYPE. The new type is made its own
4111 MAIN_VARIANT. If TYPE requires structural equality checks, the
4112 resulting type requires structural equality checks; otherwise, its
4113 TYPE_CANONICAL points to itself. */
4116 build_distinct_type_copy (tree type)
4118 tree t = copy_node (type);
4120 TYPE_POINTER_TO (t) = 0;
4121 TYPE_REFERENCE_TO (t) = 0;
4123 /* Set the canonical type either to a new equivalence class, or
4124 propagate the need for structural equality checks. */
4125 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4126 SET_TYPE_STRUCTURAL_EQUALITY (t);
4128 TYPE_CANONICAL (t) = t;
4130 /* Make it its own variant. */
4131 TYPE_MAIN_VARIANT (t) = t;
4132 TYPE_NEXT_VARIANT (t) = 0;
4137 /* Create a new variant of TYPE, equivalent but distinct. This is so
4138 the caller can modify it. TYPE_CANONICAL for the return type will
4139 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4140 are considered equal by the language itself (or that both types
4141 require structural equality checks). */
4144 build_variant_type_copy (tree type)
4146 tree t, m = TYPE_MAIN_VARIANT (type);
4148 t = build_distinct_type_copy (type);
4150 /* Since we're building a variant, assume that it is a non-semantic
4151 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4152 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4154 /* Add the new type to the chain of variants of TYPE. */
4155 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4156 TYPE_NEXT_VARIANT (m) = t;
4157 TYPE_MAIN_VARIANT (t) = m;
4162 /* Return true if the from tree in both tree maps are equal. */
4165 tree_map_eq (const void *va, const void *vb)
4167 const struct tree_map *a = va, *b = vb;
4168 return (a->from == b->from);
4171 /* Hash a from tree in a tree_map. */
4174 tree_map_hash (const void *item)
4176 return (((const struct tree_map *) item)->hash);
4179 /* Return true if this tree map structure is marked for garbage collection
4180 purposes. We simply return true if the from tree is marked, so that this
4181 structure goes away when the from tree goes away. */
4184 tree_map_marked_p (const void *p)
4186 tree from = ((struct tree_map *) p)->from;
4188 return ggc_marked_p (from);
4191 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
4194 tree_int_map_eq (const void *va, const void *vb)
4196 const struct tree_int_map *a = va, *b = vb;
4197 return (a->from == b->from);
4200 /* Hash a from tree in the tree_int_map * ITEM. */
4203 tree_int_map_hash (const void *item)
4205 return htab_hash_pointer (((const struct tree_int_map *)item)->from);
4208 /* Return true if this tree int map structure is marked for garbage collection
4209 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
4210 structure goes away when the from tree goes away. */
4213 tree_int_map_marked_p (const void *p)
4215 tree from = ((struct tree_int_map *) p)->from;
4217 return ggc_marked_p (from);
4219 /* Lookup an init priority for FROM, and return it if we find one. */
4222 decl_init_priority_lookup (tree from)
4224 struct tree_int_map *h, in;
4227 h = htab_find_with_hash (init_priority_for_decl,
4228 &in, htab_hash_pointer (from));
4234 /* Insert a mapping FROM->TO in the init priority hashtable. */
4237 decl_init_priority_insert (tree from, unsigned short to)
4239 struct tree_int_map *h;
4242 h = ggc_alloc (sizeof (struct tree_int_map));
4245 loc = htab_find_slot_with_hash (init_priority_for_decl, h,
4246 htab_hash_pointer (from), INSERT);
4247 *(struct tree_int_map **) loc = h;
4250 /* Look up a restrict qualified base decl for FROM. */
4253 decl_restrict_base_lookup (tree from)
4259 h = htab_find_with_hash (restrict_base_for_decl, &in,
4260 htab_hash_pointer (from));
4261 return h ? h->to : NULL_TREE;
4264 /* Record the restrict qualified base TO for FROM. */
4267 decl_restrict_base_insert (tree from, tree to)
4272 h = ggc_alloc (sizeof (struct tree_map));
4273 h->hash = htab_hash_pointer (from);
4276 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4277 *(struct tree_map **) loc = h;
4280 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4283 print_debug_expr_statistics (void)
4285 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4286 (long) htab_size (debug_expr_for_decl),
4287 (long) htab_elements (debug_expr_for_decl),
4288 htab_collisions (debug_expr_for_decl));
4291 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4294 print_value_expr_statistics (void)
4296 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4297 (long) htab_size (value_expr_for_decl),
4298 (long) htab_elements (value_expr_for_decl),
4299 htab_collisions (value_expr_for_decl));
4302 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4303 don't print anything if the table is empty. */
4306 print_restrict_base_statistics (void)
4308 if (htab_elements (restrict_base_for_decl) != 0)
4310 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4311 (long) htab_size (restrict_base_for_decl),
4312 (long) htab_elements (restrict_base_for_decl),
4313 htab_collisions (restrict_base_for_decl));
4316 /* Lookup a debug expression for FROM, and return it if we find one. */
4319 decl_debug_expr_lookup (tree from)
4321 struct tree_map *h, in;
4324 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4330 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4333 decl_debug_expr_insert (tree from, tree to)
4338 h = ggc_alloc (sizeof (struct tree_map));
4339 h->hash = htab_hash_pointer (from);
4342 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4343 *(struct tree_map **) loc = h;
4346 /* Lookup a value expression for FROM, and return it if we find one. */
4349 decl_value_expr_lookup (tree from)
4351 struct tree_map *h, in;
4354 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4360 /* Insert a mapping FROM->TO in the value expression hashtable. */
4363 decl_value_expr_insert (tree from, tree to)
4368 h = ggc_alloc (sizeof (struct tree_map));
4369 h->hash = htab_hash_pointer (from);
4372 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4373 *(struct tree_map **) loc = h;
4376 /* Hashing of types so that we don't make duplicates.
4377 The entry point is `type_hash_canon'. */
4379 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4380 with types in the TREE_VALUE slots), by adding the hash codes
4381 of the individual types. */
4384 type_hash_list (tree list, hashval_t hashcode)
4388 for (tail = list; tail; tail = TREE_CHAIN (tail))
4389 if (TREE_VALUE (tail) != error_mark_node)
4390 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4396 /* These are the Hashtable callback functions. */
4398 /* Returns true iff the types are equivalent. */
4401 type_hash_eq (const void *va, const void *vb)
4403 const struct type_hash *a = va, *b = vb;
4405 /* First test the things that are the same for all types. */
4406 if (a->hash != b->hash
4407 || TREE_CODE (a->type) != TREE_CODE (b->type)
4408 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4409 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4410 TYPE_ATTRIBUTES (b->type))
4411 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4412 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4415 switch (TREE_CODE (a->type))
4420 case REFERENCE_TYPE:
4424 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4427 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4428 && !(TYPE_VALUES (a->type)
4429 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4430 && TYPE_VALUES (b->type)
4431 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4432 && type_list_equal (TYPE_VALUES (a->type),
4433 TYPE_VALUES (b->type))))
4436 /* ... fall through ... */
4441 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4442 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4443 TYPE_MAX_VALUE (b->type)))
4444 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4445 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4446 TYPE_MIN_VALUE (b->type))));
4449 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4452 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4453 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4454 || (TYPE_ARG_TYPES (a->type)
4455 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4456 && TYPE_ARG_TYPES (b->type)
4457 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4458 && type_list_equal (TYPE_ARG_TYPES (a->type),
4459 TYPE_ARG_TYPES (b->type)))));
4462 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4466 case QUAL_UNION_TYPE:
4467 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4468 || (TYPE_FIELDS (a->type)
4469 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4470 && TYPE_FIELDS (b->type)
4471 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4472 && type_list_equal (TYPE_FIELDS (a->type),
4473 TYPE_FIELDS (b->type))));
4476 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4477 || (TYPE_ARG_TYPES (a->type)
4478 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4479 && TYPE_ARG_TYPES (b->type)
4480 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4481 && type_list_equal (TYPE_ARG_TYPES (a->type),
4482 TYPE_ARG_TYPES (b->type))));
4489 /* Return the cached hash value. */
4492 type_hash_hash (const void *item)
4494 return ((const struct type_hash *) item)->hash;
4497 /* Look in the type hash table for a type isomorphic to TYPE.
4498 If one is found, return it. Otherwise return 0. */
4501 type_hash_lookup (hashval_t hashcode, tree type)
4503 struct type_hash *h, in;
4505 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4506 must call that routine before comparing TYPE_ALIGNs. */
4512 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4518 /* Add an entry to the type-hash-table
4519 for a type TYPE whose hash code is HASHCODE. */
4522 type_hash_add (hashval_t hashcode, tree type)
4524 struct type_hash *h;
4527 h = ggc_alloc (sizeof (struct type_hash));
4530 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4531 *(struct type_hash **) loc = h;
4534 /* Given TYPE, and HASHCODE its hash code, return the canonical
4535 object for an identical type if one already exists.
4536 Otherwise, return TYPE, and record it as the canonical object.
4538 To use this function, first create a type of the sort you want.
4539 Then compute its hash code from the fields of the type that
4540 make it different from other similar types.
4541 Then call this function and use the value. */
4544 type_hash_canon (unsigned int hashcode, tree type)
4548 /* The hash table only contains main variants, so ensure that's what we're
4550 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4552 if (!lang_hooks.types.hash_types)
4555 /* See if the type is in the hash table already. If so, return it.
4556 Otherwise, add the type. */
4557 t1 = type_hash_lookup (hashcode, type);
4560 #ifdef GATHER_STATISTICS
4561 tree_node_counts[(int) t_kind]--;
4562 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4568 type_hash_add (hashcode, type);
4573 /* See if the data pointed to by the type hash table is marked. We consider
4574 it marked if the type is marked or if a debug type number or symbol
4575 table entry has been made for the type. This reduces the amount of
4576 debugging output and eliminates that dependency of the debug output on
4577 the number of garbage collections. */
4580 type_hash_marked_p (const void *p)
4582 tree type = ((struct type_hash *) p)->type;
4584 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4588 print_type_hash_statistics (void)
4590 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4591 (long) htab_size (type_hash_table),
4592 (long) htab_elements (type_hash_table),
4593 htab_collisions (type_hash_table));
4596 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4597 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4598 by adding the hash codes of the individual attributes. */
4601 attribute_hash_list (tree list, hashval_t hashcode)
4605 for (tail = list; tail; tail = TREE_CHAIN (tail))
4606 /* ??? Do we want to add in TREE_VALUE too? */
4607 hashcode = iterative_hash_object
4608 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4612 /* Given two lists of attributes, return true if list l2 is
4613 equivalent to l1. */
4616 attribute_list_equal (tree l1, tree l2)
4618 return attribute_list_contained (l1, l2)
4619 && attribute_list_contained (l2, l1);
4622 /* Given two lists of attributes, return true if list L2 is
4623 completely contained within L1. */
4624 /* ??? This would be faster if attribute names were stored in a canonicalized
4625 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4626 must be used to show these elements are equivalent (which they are). */
4627 /* ??? It's not clear that attributes with arguments will always be handled
4631 attribute_list_contained (tree l1, tree l2)
4635 /* First check the obvious, maybe the lists are identical. */
4639 /* Maybe the lists are similar. */
4640 for (t1 = l1, t2 = l2;
4642 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4643 && TREE_VALUE (t1) == TREE_VALUE (t2);
4644 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4646 /* Maybe the lists are equal. */
4647 if (t1 == 0 && t2 == 0)
4650 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4653 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4655 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4658 if (TREE_VALUE (t2) != NULL
4659 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4660 && TREE_VALUE (attr) != NULL
4661 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4663 if (simple_cst_list_equal (TREE_VALUE (t2),
4664 TREE_VALUE (attr)) == 1)
4667 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4678 /* Given two lists of types
4679 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4680 return 1 if the lists contain the same types in the same order.
4681 Also, the TREE_PURPOSEs must match. */
4684 type_list_equal (tree l1, tree l2)
4688 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4689 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4690 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4691 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4692 && (TREE_TYPE (TREE_PURPOSE (t1))
4693 == TREE_TYPE (TREE_PURPOSE (t2))))))
4699 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4700 given by TYPE. If the argument list accepts variable arguments,
4701 then this function counts only the ordinary arguments. */
4704 type_num_arguments (tree type)
4709 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4710 /* If the function does not take a variable number of arguments,
4711 the last element in the list will have type `void'. */
4712 if (VOID_TYPE_P (TREE_VALUE (t)))
4720 /* Nonzero if integer constants T1 and T2
4721 represent the same constant value. */
4724 tree_int_cst_equal (tree t1, tree t2)
4729 if (t1 == 0 || t2 == 0)
4732 if (TREE_CODE (t1) == INTEGER_CST
4733 && TREE_CODE (t2) == INTEGER_CST
4734 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4735 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4741 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4742 The precise way of comparison depends on their data type. */
4745 tree_int_cst_lt (tree t1, tree t2)
4750 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4752 int t1_sgn = tree_int_cst_sgn (t1);
4753 int t2_sgn = tree_int_cst_sgn (t2);
4755 if (t1_sgn < t2_sgn)
4757 else if (t1_sgn > t2_sgn)
4759 /* Otherwise, both are non-negative, so we compare them as
4760 unsigned just in case one of them would overflow a signed
4763 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4764 return INT_CST_LT (t1, t2);
4766 return INT_CST_LT_UNSIGNED (t1, t2);
4769 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4772 tree_int_cst_compare (tree t1, tree t2)
4774 if (tree_int_cst_lt (t1, t2))
4776 else if (tree_int_cst_lt (t2, t1))
4782 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4783 the host. If POS is zero, the value can be represented in a single
4784 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4785 be represented in a single unsigned HOST_WIDE_INT. */
4788 host_integerp (tree t, int pos)
4790 return (TREE_CODE (t) == INTEGER_CST
4791 && ((TREE_INT_CST_HIGH (t) == 0
4792 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4793 || (! pos && TREE_INT_CST_HIGH (t) == -1
4794 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4795 && !TYPE_UNSIGNED (TREE_TYPE (t)))
4796 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4799 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4800 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4801 be non-negative. We must be able to satisfy the above conditions. */
4804 tree_low_cst (tree t, int pos)
4806 gcc_assert (host_integerp (t, pos));
4807 return TREE_INT_CST_LOW (t);
4810 /* Return the most significant bit of the integer constant T. */
4813 tree_int_cst_msb (tree t)
4817 unsigned HOST_WIDE_INT l;
4819 /* Note that using TYPE_PRECISION here is wrong. We care about the
4820 actual bits, not the (arbitrary) range of the type. */
4821 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4822 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4823 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4824 return (l & 1) == 1;
4827 /* Return an indication of the sign of the integer constant T.
4828 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4829 Note that -1 will never be returned if T's type is unsigned. */
4832 tree_int_cst_sgn (tree t)
4834 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4836 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4838 else if (TREE_INT_CST_HIGH (t) < 0)
4844 /* Compare two constructor-element-type constants. Return 1 if the lists
4845 are known to be equal; otherwise return 0. */
4848 simple_cst_list_equal (tree l1, tree l2)
4850 while (l1 != NULL_TREE && l2 != NULL_TREE)
4852 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4855 l1 = TREE_CHAIN (l1);
4856 l2 = TREE_CHAIN (l2);
4862 /* Return truthvalue of whether T1 is the same tree structure as T2.
4863 Return 1 if they are the same.
4864 Return 0 if they are understandably different.
4865 Return -1 if either contains tree structure not understood by
4869 simple_cst_equal (tree t1, tree t2)
4871 enum tree_code code1, code2;
4877 if (t1 == 0 || t2 == 0)
4880 code1 = TREE_CODE (t1);
4881 code2 = TREE_CODE (t2);
4883 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4885 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4886 || code2 == NON_LVALUE_EXPR)
4887 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4889 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4892 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4893 || code2 == NON_LVALUE_EXPR)
4894 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4902 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4903 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4906 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4909 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4910 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4911 TREE_STRING_LENGTH (t1)));
4915 unsigned HOST_WIDE_INT idx;
4916 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4917 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4919 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4922 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4923 /* ??? Should we handle also fields here? */
4924 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4925 VEC_index (constructor_elt, v2, idx)->value))
4931 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4934 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4938 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4941 /* Special case: if either target is an unallocated VAR_DECL,
4942 it means that it's going to be unified with whatever the
4943 TARGET_EXPR is really supposed to initialize, so treat it
4944 as being equivalent to anything. */
4945 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4946 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4947 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
4948 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4949 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4950 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
4953 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4958 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4960 case WITH_CLEANUP_EXPR:
4961 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4965 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
4968 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4969 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4983 /* This general rule works for most tree codes. All exceptions should be
4984 handled above. If this is a language-specific tree code, we can't
4985 trust what might be in the operand, so say we don't know
4987 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4990 switch (TREE_CODE_CLASS (code1))
4994 case tcc_comparison:
4995 case tcc_expression:
4999 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5001 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5013 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5014 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5015 than U, respectively. */
5018 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
5020 if (tree_int_cst_sgn (t) < 0)
5022 else if (TREE_INT_CST_HIGH (t) != 0)
5024 else if (TREE_INT_CST_LOW (t) == u)
5026 else if (TREE_INT_CST_LOW (t) < u)
5032 /* Return true if CODE represents an associative tree code. Otherwise
5035 associative_tree_code (enum tree_code code)
5054 /* Return true if CODE represents a commutative tree code. Otherwise
5057 commutative_tree_code (enum tree_code code)
5070 case UNORDERED_EXPR:
5074 case TRUTH_AND_EXPR:
5075 case TRUTH_XOR_EXPR:
5085 /* Generate a hash value for an expression. This can be used iteratively
5086 by passing a previous result as the "val" argument.
5088 This function is intended to produce the same hash for expressions which
5089 would compare equal using operand_equal_p. */
5092 iterative_hash_expr (tree t, hashval_t val)
5095 enum tree_code code;
5099 return iterative_hash_pointer (t, val);
5101 code = TREE_CODE (t);
5105 /* Alas, constants aren't shared, so we can't rely on pointer
5108 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5109 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5112 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5114 return iterative_hash_hashval_t (val2, val);
5117 return iterative_hash (TREE_STRING_POINTER (t),
5118 TREE_STRING_LENGTH (t), val);
5120 val = iterative_hash_expr (TREE_REALPART (t), val);
5121 return iterative_hash_expr (TREE_IMAGPART (t), val);
5123 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5127 /* we can just compare by pointer. */
5128 return iterative_hash_pointer (t, val);
5131 /* A list of expressions, for a CALL_EXPR or as the elements of a
5133 for (; t; t = TREE_CHAIN (t))
5134 val = iterative_hash_expr (TREE_VALUE (t), val);
5138 unsigned HOST_WIDE_INT idx;
5140 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5142 val = iterative_hash_expr (field, val);
5143 val = iterative_hash_expr (value, val);
5148 /* When referring to a built-in FUNCTION_DECL, use the
5149 __builtin__ form. Otherwise nodes that compare equal
5150 according to operand_equal_p might get different
5152 if (DECL_BUILT_IN (t))
5154 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5158 /* else FALL THROUGH */
5160 class = TREE_CODE_CLASS (code);
5162 if (class == tcc_declaration)
5164 /* DECL's have a unique ID */
5165 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5169 gcc_assert (IS_EXPR_CODE_CLASS (class));
5171 val = iterative_hash_object (code, val);
5173 /* Don't hash the type, that can lead to having nodes which
5174 compare equal according to operand_equal_p, but which
5175 have different hash codes. */
5176 if (code == NOP_EXPR
5177 || code == CONVERT_EXPR
5178 || code == NON_LVALUE_EXPR)
5180 /* Make sure to include signness in the hash computation. */
5181 val += TYPE_UNSIGNED (TREE_TYPE (t));
5182 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5185 else if (commutative_tree_code (code))
5187 /* It's a commutative expression. We want to hash it the same
5188 however it appears. We do this by first hashing both operands
5189 and then rehashing based on the order of their independent
5191 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5192 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5196 t = one, one = two, two = t;
5198 val = iterative_hash_hashval_t (one, val);
5199 val = iterative_hash_hashval_t (two, val);
5202 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i)
5203 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5210 /* Constructors for pointer, array and function types.
5211 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5212 constructed by language-dependent code, not here.) */
5214 /* Construct, lay out and return the type of pointers to TO_TYPE with
5215 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5216 reference all of memory. If such a type has already been
5217 constructed, reuse it. */
5220 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5225 if (to_type == error_mark_node)
5226 return error_mark_node;
5228 /* In some cases, languages will have things that aren't a POINTER_TYPE
5229 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5230 In that case, return that type without regard to the rest of our
5233 ??? This is a kludge, but consistent with the way this function has
5234 always operated and there doesn't seem to be a good way to avoid this
5236 if (TYPE_POINTER_TO (to_type) != 0
5237 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5238 return TYPE_POINTER_TO (to_type);
5240 /* First, if we already have a type for pointers to TO_TYPE and it's
5241 the proper mode, use it. */
5242 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5243 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5246 t = make_node (POINTER_TYPE);
5248 TREE_TYPE (t) = to_type;
5249 TYPE_MODE (t) = mode;
5250 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5251 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5252 TYPE_POINTER_TO (to_type) = t;
5254 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5255 SET_TYPE_STRUCTURAL_EQUALITY (t);
5256 else if (TYPE_CANONICAL (to_type) != to_type)
5258 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5259 mode, can_alias_all);
5261 /* Lay out the type. This function has many callers that are concerned
5262 with expression-construction, and this simplifies them all. */
5268 /* By default build pointers in ptr_mode. */
5271 build_pointer_type (tree to_type)
5273 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5276 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5279 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5284 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5285 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5286 In that case, return that type without regard to the rest of our
5289 ??? This is a kludge, but consistent with the way this function has
5290 always operated and there doesn't seem to be a good way to avoid this
5292 if (TYPE_REFERENCE_TO (to_type) != 0
5293 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5294 return TYPE_REFERENCE_TO (to_type);
5296 /* First, if we already have a type for pointers to TO_TYPE and it's
5297 the proper mode, use it. */
5298 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5299 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5302 t = make_node (REFERENCE_TYPE);
5304 TREE_TYPE (t) = to_type;
5305 TYPE_MODE (t) = mode;
5306 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5307 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5308 TYPE_REFERENCE_TO (to_type) = t;
5310 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5311 SET_TYPE_STRUCTURAL_EQUALITY (t);
5312 else if (TYPE_CANONICAL (to_type) != to_type)
5314 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5315 mode, can_alias_all);
5323 /* Build the node for the type of references-to-TO_TYPE by default
5327 build_reference_type (tree to_type)
5329 return build_reference_type_for_mode (to_type, ptr_mode, false);
5332 /* Build a type that is compatible with t but has no cv quals anywhere
5335 const char *const *const * -> char ***. */
5338 build_type_no_quals (tree t)
5340 switch (TREE_CODE (t))
5343 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5345 TYPE_REF_CAN_ALIAS_ALL (t));
5346 case REFERENCE_TYPE:
5348 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5350 TYPE_REF_CAN_ALIAS_ALL (t));
5352 return TYPE_MAIN_VARIANT (t);
5356 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5357 MAXVAL should be the maximum value in the domain
5358 (one less than the length of the array).
5360 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5361 We don't enforce this limit, that is up to caller (e.g. language front end).
5362 The limit exists because the result is a signed type and we don't handle
5363 sizes that use more than one HOST_WIDE_INT. */
5366 build_index_type (tree maxval)
5368 tree itype = make_node (INTEGER_TYPE);
5370 TREE_TYPE (itype) = sizetype;
5371 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5372 TYPE_MIN_VALUE (itype) = size_zero_node;
5373 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5374 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5375 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5376 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5377 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5378 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5380 if (host_integerp (maxval, 1))
5381 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5384 /* Since we cannot hash this type, we need to compare it using
5385 structural equality checks. */
5386 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5391 /* Builds a signed or unsigned integer type of precision PRECISION.
5392 Used for C bitfields whose precision does not match that of
5393 built-in target types. */
5395 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5398 tree itype = make_node (INTEGER_TYPE);
5400 TYPE_PRECISION (itype) = precision;
5403 fixup_unsigned_type (itype);
5405 fixup_signed_type (itype);
5407 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5408 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5413 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5414 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5415 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5418 build_range_type (tree type, tree lowval, tree highval)
5420 tree itype = make_node (INTEGER_TYPE);
5422 TREE_TYPE (itype) = type;
5423 if (type == NULL_TREE)
5426 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5427 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5429 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5430 TYPE_MODE (itype) = TYPE_MODE (type);
5431 TYPE_SIZE (itype) = TYPE_SIZE (type);
5432 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5433 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5434 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5436 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5437 return type_hash_canon (tree_low_cst (highval, 0)
5438 - tree_low_cst (lowval, 0),
5444 /* Just like build_index_type, but takes lowval and highval instead
5445 of just highval (maxval). */
5448 build_index_2_type (tree lowval, tree highval)
5450 return build_range_type (sizetype, lowval, highval);
5453 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5454 and number of elements specified by the range of values of INDEX_TYPE.
5455 If such a type has already been constructed, reuse it. */
5458 build_array_type (tree elt_type, tree index_type)
5461 hashval_t hashcode = 0;
5463 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5465 error ("arrays of functions are not meaningful");
5466 elt_type = integer_type_node;
5469 t = make_node (ARRAY_TYPE);
5470 TREE_TYPE (t) = elt_type;
5471 TYPE_DOMAIN (t) = index_type;
5473 if (index_type == 0)
5476 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5477 t = type_hash_canon (hashcode, t);
5481 if (TYPE_CANONICAL (t) == t)
5483 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5484 SET_TYPE_STRUCTURAL_EQUALITY (t);
5485 else if (TYPE_CANONICAL (elt_type) != elt_type)
5487 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5493 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5494 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5495 t = type_hash_canon (hashcode, t);
5497 if (!COMPLETE_TYPE_P (t))
5500 if (TYPE_CANONICAL (t) == t)
5502 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5503 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5504 SET_TYPE_STRUCTURAL_EQUALITY (t);
5505 else if (TYPE_CANONICAL (elt_type) != elt_type
5506 || TYPE_CANONICAL (index_type) != index_type)
5508 = build_array_type (TYPE_CANONICAL (elt_type),
5509 TYPE_CANONICAL (index_type));
5515 /* Return the TYPE of the elements comprising
5516 the innermost dimension of ARRAY. */
5519 get_inner_array_type (tree array)
5521 tree type = TREE_TYPE (array);
5523 while (TREE_CODE (type) == ARRAY_TYPE)
5524 type = TREE_TYPE (type);
5529 /* Construct, lay out and return
5530 the type of functions returning type VALUE_TYPE
5531 given arguments of types ARG_TYPES.
5532 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5533 are data type nodes for the arguments of the function.
5534 If such a type has already been constructed, reuse it. */
5537 build_function_type (tree value_type, tree arg_types)
5540 hashval_t hashcode = 0;
5542 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5544 error ("function return type cannot be function");
5545 value_type = integer_type_node;
5548 /* Make a node of the sort we want. */
5549 t = make_node (FUNCTION_TYPE);
5550 TREE_TYPE (t) = value_type;
5551 TYPE_ARG_TYPES (t) = arg_types;
5553 /* We don't have canonicalization of function types, yet. */
5554 SET_TYPE_STRUCTURAL_EQUALITY (t);
5556 /* If we already have such a type, use the old one. */
5557 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5558 hashcode = type_hash_list (arg_types, hashcode);
5559 t = type_hash_canon (hashcode, t);
5561 if (!COMPLETE_TYPE_P (t))
5566 /* Build a function type. The RETURN_TYPE is the type returned by the
5567 function. If additional arguments are provided, they are
5568 additional argument types. The list of argument types must always
5569 be terminated by NULL_TREE. */
5572 build_function_type_list (tree return_type, ...)
5577 va_start (p, return_type);
5579 t = va_arg (p, tree);
5580 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5581 args = tree_cons (NULL_TREE, t, args);
5583 if (args == NULL_TREE)
5584 args = void_list_node;
5588 args = nreverse (args);
5589 TREE_CHAIN (last) = void_list_node;
5591 args = build_function_type (return_type, args);
5597 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5598 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5599 for the method. An implicit additional parameter (of type
5600 pointer-to-BASETYPE) is added to the ARGTYPES. */
5603 build_method_type_directly (tree basetype,
5611 /* Make a node of the sort we want. */
5612 t = make_node (METHOD_TYPE);
5614 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5615 TREE_TYPE (t) = rettype;
5616 ptype = build_pointer_type (basetype);
5618 /* The actual arglist for this function includes a "hidden" argument
5619 which is "this". Put it into the list of argument types. */
5620 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5621 TYPE_ARG_TYPES (t) = argtypes;
5623 /* We don't have canonicalization of method types yet. */
5624 SET_TYPE_STRUCTURAL_EQUALITY (t);
5626 /* If we already have such a type, use the old one. */
5627 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5628 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5629 hashcode = type_hash_list (argtypes, hashcode);
5630 t = type_hash_canon (hashcode, t);
5632 if (!COMPLETE_TYPE_P (t))
5638 /* Construct, lay out and return the type of methods belonging to class
5639 BASETYPE and whose arguments and values are described by TYPE.
5640 If that type exists already, reuse it.
5641 TYPE must be a FUNCTION_TYPE node. */
5644 build_method_type (tree basetype, tree type)
5646 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5648 return build_method_type_directly (basetype,
5650 TYPE_ARG_TYPES (type));
5653 /* Construct, lay out and return the type of offsets to a value
5654 of type TYPE, within an object of type BASETYPE.
5655 If a suitable offset type exists already, reuse it. */
5658 build_offset_type (tree basetype, tree type)
5661 hashval_t hashcode = 0;
5663 /* Make a node of the sort we want. */
5664 t = make_node (OFFSET_TYPE);
5666 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5667 TREE_TYPE (t) = type;
5669 /* If we already have such a type, use the old one. */
5670 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5671 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5672 t = type_hash_canon (hashcode, t);
5674 if (!COMPLETE_TYPE_P (t))
5677 if (TYPE_CANONICAL (t) == t)
5679 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5680 || TYPE_STRUCTURAL_EQUALITY_P (type))
5681 SET_TYPE_STRUCTURAL_EQUALITY (t);
5682 else if (TYPE_CANONICAL (basetype) != basetype
5683 || TYPE_CANONICAL (type) != type)
5685 = build_offset_type (TYPE_CANONICAL (basetype),
5686 TYPE_CANONICAL (type));
5692 /* Create a complex type whose components are COMPONENT_TYPE. */
5695 build_complex_type (tree component_type)
5700 /* Make a node of the sort we want. */
5701 t = make_node (COMPLEX_TYPE);
5703 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5705 /* If we already have such a type, use the old one. */
5706 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5707 t = type_hash_canon (hashcode, t);
5709 if (!COMPLETE_TYPE_P (t))
5712 if (TYPE_CANONICAL (t) == t)
5714 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
5715 SET_TYPE_STRUCTURAL_EQUALITY (t);
5716 else if (TYPE_CANONICAL (component_type) != component_type)
5718 = build_complex_type (TYPE_CANONICAL (component_type));
5721 /* If we are writing Dwarf2 output we need to create a name,
5722 since complex is a fundamental type. */
5723 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5727 if (component_type == char_type_node)
5728 name = "complex char";
5729 else if (component_type == signed_char_type_node)
5730 name = "complex signed char";
5731 else if (component_type == unsigned_char_type_node)
5732 name = "complex unsigned char";
5733 else if (component_type == short_integer_type_node)
5734 name = "complex short int";
5735 else if (component_type == short_unsigned_type_node)
5736 name = "complex short unsigned int";
5737 else if (component_type == integer_type_node)
5738 name = "complex int";
5739 else if (component_type == unsigned_type_node)
5740 name = "complex unsigned int";
5741 else if (component_type == long_integer_type_node)
5742 name = "complex long int";
5743 else if (component_type == long_unsigned_type_node)
5744 name = "complex long unsigned int";
5745 else if (component_type == long_long_integer_type_node)
5746 name = "complex long long int";
5747 else if (component_type == long_long_unsigned_type_node)
5748 name = "complex long long unsigned int";
5753 TYPE_NAME (t) = get_identifier (name);
5756 return build_qualified_type (t, TYPE_QUALS (component_type));
5759 /* Return OP, stripped of any conversions to wider types as much as is safe.
5760 Converting the value back to OP's type makes a value equivalent to OP.
5762 If FOR_TYPE is nonzero, we return a value which, if converted to
5763 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5765 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5766 narrowest type that can hold the value, even if they don't exactly fit.
5767 Otherwise, bit-field references are changed to a narrower type
5768 only if they can be fetched directly from memory in that type.
5770 OP must have integer, real or enumeral type. Pointers are not allowed!
5772 There are some cases where the obvious value we could return
5773 would regenerate to OP if converted to OP's type,
5774 but would not extend like OP to wider types.
5775 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5776 For example, if OP is (unsigned short)(signed char)-1,
5777 we avoid returning (signed char)-1 if FOR_TYPE is int,
5778 even though extending that to an unsigned short would regenerate OP,
5779 since the result of extending (signed char)-1 to (int)
5780 is different from (int) OP. */
5783 get_unwidened (tree op, tree for_type)
5785 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5786 tree type = TREE_TYPE (op);
5788 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5790 = (for_type != 0 && for_type != type
5791 && final_prec > TYPE_PRECISION (type)
5792 && TYPE_UNSIGNED (type));
5795 while (TREE_CODE (op) == NOP_EXPR
5796 || TREE_CODE (op) == CONVERT_EXPR)
5800 /* TYPE_PRECISION on vector types has different meaning
5801 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5802 so avoid them here. */
5803 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5806 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5807 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5809 /* Truncations are many-one so cannot be removed.
5810 Unless we are later going to truncate down even farther. */
5812 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5815 /* See what's inside this conversion. If we decide to strip it,
5817 op = TREE_OPERAND (op, 0);
5819 /* If we have not stripped any zero-extensions (uns is 0),
5820 we can strip any kind of extension.
5821 If we have previously stripped a zero-extension,
5822 only zero-extensions can safely be stripped.
5823 Any extension can be stripped if the bits it would produce
5824 are all going to be discarded later by truncating to FOR_TYPE. */
5828 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5830 /* TYPE_UNSIGNED says whether this is a zero-extension.
5831 Let's avoid computing it if it does not affect WIN
5832 and if UNS will not be needed again. */
5834 || TREE_CODE (op) == NOP_EXPR
5835 || TREE_CODE (op) == CONVERT_EXPR)
5836 && TYPE_UNSIGNED (TREE_TYPE (op)))
5844 if (TREE_CODE (op) == COMPONENT_REF
5845 /* Since type_for_size always gives an integer type. */
5846 && TREE_CODE (type) != REAL_TYPE
5847 /* Don't crash if field not laid out yet. */
5848 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5849 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5851 unsigned int innerprec
5852 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5853 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5854 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5855 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5857 /* We can get this structure field in the narrowest type it fits in.
5858 If FOR_TYPE is 0, do this only for a field that matches the
5859 narrower type exactly and is aligned for it
5860 The resulting extension to its nominal type (a fullword type)
5861 must fit the same conditions as for other extensions. */
5864 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5865 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5866 && (! uns || final_prec <= innerprec || unsignedp))
5868 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5869 TREE_OPERAND (op, 1), NULL_TREE);
5870 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5871 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5878 /* Return OP or a simpler expression for a narrower value
5879 which can be sign-extended or zero-extended to give back OP.
5880 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5881 or 0 if the value should be sign-extended. */
5884 get_narrower (tree op, int *unsignedp_ptr)
5889 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5891 while (TREE_CODE (op) == NOP_EXPR)
5894 = (TYPE_PRECISION (TREE_TYPE (op))
5895 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5897 /* Truncations are many-one so cannot be removed. */
5901 /* See what's inside this conversion. If we decide to strip it,
5906 op = TREE_OPERAND (op, 0);
5907 /* An extension: the outermost one can be stripped,
5908 but remember whether it is zero or sign extension. */
5910 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5911 /* Otherwise, if a sign extension has been stripped,
5912 only sign extensions can now be stripped;
5913 if a zero extension has been stripped, only zero-extensions. */
5914 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5918 else /* bitschange == 0 */
5920 /* A change in nominal type can always be stripped, but we must
5921 preserve the unsignedness. */
5923 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5925 op = TREE_OPERAND (op, 0);
5926 /* Keep trying to narrow, but don't assign op to win if it
5927 would turn an integral type into something else. */
5928 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
5935 if (TREE_CODE (op) == COMPONENT_REF
5936 /* Since type_for_size always gives an integer type. */
5937 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
5938 /* Ensure field is laid out already. */
5939 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5940 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5942 unsigned HOST_WIDE_INT innerprec
5943 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5944 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5945 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5946 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5948 /* We can get this structure field in a narrower type that fits it,
5949 but the resulting extension to its nominal type (a fullword type)
5950 must satisfy the same conditions as for other extensions.
5952 Do this only for fields that are aligned (not bit-fields),
5953 because when bit-field insns will be used there is no
5954 advantage in doing this. */
5956 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5957 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5958 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
5962 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
5963 win = fold_convert (type, op);
5967 *unsignedp_ptr = uns;
5971 /* Nonzero if integer constant C has a value that is permissible
5972 for type TYPE (an INTEGER_TYPE). */
5975 int_fits_type_p (tree c, tree type)
5977 tree type_low_bound = TYPE_MIN_VALUE (type);
5978 tree type_high_bound = TYPE_MAX_VALUE (type);
5979 bool ok_for_low_bound, ok_for_high_bound;
5980 unsigned HOST_WIDE_INT low;
5983 /* If at least one bound of the type is a constant integer, we can check
5984 ourselves and maybe make a decision. If no such decision is possible, but
5985 this type is a subtype, try checking against that. Otherwise, use
5986 fit_double_type, which checks against the precision.
5988 Compute the status for each possibly constant bound, and return if we see
5989 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5990 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5991 for "constant known to fit". */
5993 /* Check if C >= type_low_bound. */
5994 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
5996 if (tree_int_cst_lt (c, type_low_bound))
5998 ok_for_low_bound = true;
6001 ok_for_low_bound = false;
6003 /* Check if c <= type_high_bound. */
6004 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6006 if (tree_int_cst_lt (type_high_bound, c))
6008 ok_for_high_bound = true;
6011 ok_for_high_bound = false;
6013 /* If the constant fits both bounds, the result is known. */
6014 if (ok_for_low_bound && ok_for_high_bound)
6017 /* Perform some generic filtering which may allow making a decision
6018 even if the bounds are not constant. First, negative integers
6019 never fit in unsigned types, */
6020 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6023 /* Second, narrower types always fit in wider ones. */
6024 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6027 /* Third, unsigned integers with top bit set never fit signed types. */
6028 if (! TYPE_UNSIGNED (type)
6029 && TYPE_UNSIGNED (TREE_TYPE (c))
6030 && tree_int_cst_msb (c))
6033 /* If we haven't been able to decide at this point, there nothing more we
6034 can check ourselves here. Look at the base type if we have one and it
6035 has the same precision. */
6036 if (TREE_CODE (type) == INTEGER_TYPE
6037 && TREE_TYPE (type) != 0
6038 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6039 return int_fits_type_p (c, TREE_TYPE (type));
6041 /* Or to fit_double_type, if nothing else. */
6042 low = TREE_INT_CST_LOW (c);
6043 high = TREE_INT_CST_HIGH (c);
6044 return !fit_double_type (low, high, &low, &high, type);
6047 /* Subprogram of following function. Called by walk_tree.
6049 Return *TP if it is an automatic variable or parameter of the
6050 function passed in as DATA. */
6053 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6055 tree fn = (tree) data;
6060 else if (DECL_P (*tp)
6061 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
6067 /* Returns true if T is, contains, or refers to a type with variable
6068 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6069 arguments, but not the return type. If FN is nonzero, only return
6070 true if a modifier of the type or position of FN is a variable or
6071 parameter inside FN.
6073 This concept is more general than that of C99 'variably modified types':
6074 in C99, a struct type is never variably modified because a VLA may not
6075 appear as a structure member. However, in GNU C code like:
6077 struct S { int i[f()]; };
6079 is valid, and other languages may define similar constructs. */
6082 variably_modified_type_p (tree type, tree fn)
6086 /* Test if T is either variable (if FN is zero) or an expression containing
6087 a variable in FN. */
6088 #define RETURN_TRUE_IF_VAR(T) \
6089 do { tree _t = (T); \
6090 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6091 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6092 return true; } while (0)
6094 if (type == error_mark_node)
6097 /* If TYPE itself has variable size, it is variably modified. */
6098 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6099 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6101 switch (TREE_CODE (type))
6104 case REFERENCE_TYPE:
6106 if (variably_modified_type_p (TREE_TYPE (type), fn))
6112 /* If TYPE is a function type, it is variably modified if the
6113 return type is variably modified. */
6114 if (variably_modified_type_p (TREE_TYPE (type), fn))
6122 /* Scalar types are variably modified if their end points
6124 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6125 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6130 case QUAL_UNION_TYPE:
6131 /* We can't see if any of the fields are variably-modified by the
6132 definition we normally use, since that would produce infinite
6133 recursion via pointers. */
6134 /* This is variably modified if some field's type is. */
6135 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6136 if (TREE_CODE (t) == FIELD_DECL)
6138 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6139 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6140 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6142 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6143 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6148 /* Do not call ourselves to avoid infinite recursion. This is
6149 variably modified if the element type is. */
6150 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6151 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6158 /* The current language may have other cases to check, but in general,
6159 all other types are not variably modified. */
6160 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6162 #undef RETURN_TRUE_IF_VAR
6165 /* Given a DECL or TYPE, return the scope in which it was declared, or
6166 NULL_TREE if there is no containing scope. */
6169 get_containing_scope (tree t)
6171 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6174 /* Return the innermost context enclosing DECL that is
6175 a FUNCTION_DECL, or zero if none. */
6178 decl_function_context (tree decl)
6182 if (TREE_CODE (decl) == ERROR_MARK)
6185 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6186 where we look up the function at runtime. Such functions always take
6187 a first argument of type 'pointer to real context'.
6189 C++ should really be fixed to use DECL_CONTEXT for the real context,
6190 and use something else for the "virtual context". */
6191 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6194 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6196 context = DECL_CONTEXT (decl);
6198 while (context && TREE_CODE (context) != FUNCTION_DECL)
6200 if (TREE_CODE (context) == BLOCK)
6201 context = BLOCK_SUPERCONTEXT (context);
6203 context = get_containing_scope (context);
6209 /* Return the innermost context enclosing DECL that is
6210 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6211 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6214 decl_type_context (tree decl)
6216 tree context = DECL_CONTEXT (decl);
6219 switch (TREE_CODE (context))
6221 case NAMESPACE_DECL:
6222 case TRANSLATION_UNIT_DECL:
6227 case QUAL_UNION_TYPE:
6232 context = DECL_CONTEXT (context);
6236 context = BLOCK_SUPERCONTEXT (context);
6246 /* CALL is a CALL_EXPR. Return the declaration for the function
6247 called, or NULL_TREE if the called function cannot be
6251 get_callee_fndecl (tree call)
6255 if (call == error_mark_node)
6258 /* It's invalid to call this function with anything but a
6260 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6262 /* The first operand to the CALL is the address of the function
6264 addr = TREE_OPERAND (call, 0);
6268 /* If this is a readonly function pointer, extract its initial value. */
6269 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6270 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6271 && DECL_INITIAL (addr))
6272 addr = DECL_INITIAL (addr);
6274 /* If the address is just `&f' for some function `f', then we know
6275 that `f' is being called. */
6276 if (TREE_CODE (addr) == ADDR_EXPR
6277 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6278 return TREE_OPERAND (addr, 0);
6280 /* We couldn't figure out what was being called. Maybe the front
6281 end has some idea. */
6282 return lang_hooks.lang_get_callee_fndecl (call);
6285 /* Print debugging information about tree nodes generated during the compile,
6286 and any language-specific information. */
6289 dump_tree_statistics (void)
6291 #ifdef GATHER_STATISTICS
6293 int total_nodes, total_bytes;
6296 fprintf (stderr, "\n??? tree nodes created\n\n");
6297 #ifdef GATHER_STATISTICS
6298 fprintf (stderr, "Kind Nodes Bytes\n");
6299 fprintf (stderr, "---------------------------------------\n");
6300 total_nodes = total_bytes = 0;
6301 for (i = 0; i < (int) all_kinds; i++)
6303 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6304 tree_node_counts[i], tree_node_sizes[i]);
6305 total_nodes += tree_node_counts[i];
6306 total_bytes += tree_node_sizes[i];
6308 fprintf (stderr, "---------------------------------------\n");
6309 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6310 fprintf (stderr, "---------------------------------------\n");
6311 ssanames_print_statistics ();
6312 phinodes_print_statistics ();
6314 fprintf (stderr, "(No per-node statistics)\n");
6316 print_type_hash_statistics ();
6317 print_debug_expr_statistics ();
6318 print_value_expr_statistics ();
6319 print_restrict_base_statistics ();
6320 lang_hooks.print_statistics ();
6323 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6325 /* Generate a crc32 of a string. */
6328 crc32_string (unsigned chksum, const char *string)
6332 unsigned value = *string << 24;
6335 for (ix = 8; ix--; value <<= 1)
6339 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6348 /* P is a string that will be used in a symbol. Mask out any characters
6349 that are not valid in that context. */
6352 clean_symbol_name (char *p)
6356 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6359 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6366 /* Generate a name for a special-purpose function function.
6367 The generated name may need to be unique across the whole link.
6368 TYPE is some string to identify the purpose of this function to the
6369 linker or collect2; it must start with an uppercase letter,
6371 I - for constructors
6373 N - for C++ anonymous namespaces
6374 F - for DWARF unwind frame information. */
6377 get_file_function_name (const char *type)
6383 /* If we already have a name we know to be unique, just use that. */
6384 if (first_global_object_name)
6385 p = first_global_object_name;
6386 /* If the target is handling the constructors/destructors, they
6387 will be local to this file and the name is only necessary for
6388 debugging purposes. */
6389 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6391 const char *file = main_input_filename;
6393 file = input_filename;
6394 /* Just use the file's basename, because the full pathname
6395 might be quite long. */
6396 p = strrchr (file, '/');
6401 p = q = ASTRDUP (p);
6402 clean_symbol_name (q);
6406 /* Otherwise, the name must be unique across the entire link.
6407 We don't have anything that we know to be unique to this translation
6408 unit, so use what we do have and throw in some randomness. */
6410 const char *name = weak_global_object_name;
6411 const char *file = main_input_filename;
6416 file = input_filename;
6418 len = strlen (file);
6419 q = alloca (9 * 2 + len + 1);
6420 memcpy (q, file, len + 1);
6421 clean_symbol_name (q);
6423 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6424 crc32_string (0, flag_random_seed));
6429 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6431 /* Set up the name of the file-level functions we may need.
6432 Use a global object (which is already required to be unique over
6433 the program) rather than the file name (which imposes extra
6435 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6437 return get_identifier (buf);
6440 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6442 /* Complain that the tree code of NODE does not match the expected 0
6443 terminated list of trailing codes. The trailing code list can be
6444 empty, for a more vague error message. FILE, LINE, and FUNCTION
6445 are of the caller. */
6448 tree_check_failed (const tree node, const char *file,
6449 int line, const char *function, ...)
6453 unsigned length = 0;
6456 va_start (args, function);
6457 while ((code = va_arg (args, int)))
6458 length += 4 + strlen (tree_code_name[code]);
6462 va_start (args, function);
6463 length += strlen ("expected ");
6464 buffer = alloca (length);
6466 while ((code = va_arg (args, int)))
6468 const char *prefix = length ? " or " : "expected ";
6470 strcpy (buffer + length, prefix);
6471 length += strlen (prefix);
6472 strcpy (buffer + length, tree_code_name[code]);
6473 length += strlen (tree_code_name[code]);
6478 buffer = (char *)"unexpected node";
6480 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6481 buffer, tree_code_name[TREE_CODE (node)],
6482 function, trim_filename (file), line);
6485 /* Complain that the tree code of NODE does match the expected 0
6486 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6490 tree_not_check_failed (const tree node, const char *file,
6491 int line, const char *function, ...)
6495 unsigned length = 0;
6498 va_start (args, function);
6499 while ((code = va_arg (args, int)))
6500 length += 4 + strlen (tree_code_name[code]);
6502 va_start (args, function);
6503 buffer = alloca (length);
6505 while ((code = va_arg (args, int)))
6509 strcpy (buffer + length, " or ");
6512 strcpy (buffer + length, tree_code_name[code]);
6513 length += strlen (tree_code_name[code]);
6517 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6518 buffer, tree_code_name[TREE_CODE (node)],
6519 function, trim_filename (file), line);
6522 /* Similar to tree_check_failed, except that we check for a class of tree
6523 code, given in CL. */
6526 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6527 const char *file, int line, const char *function)
6530 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6531 TREE_CODE_CLASS_STRING (cl),
6532 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6533 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6536 /* Similar to tree_check_failed, except that instead of specifying a
6537 dozen codes, use the knowledge that they're all sequential. */
6540 tree_range_check_failed (const tree node, const char *file, int line,
6541 const char *function, enum tree_code c1,
6545 unsigned length = 0;
6548 for (c = c1; c <= c2; ++c)
6549 length += 4 + strlen (tree_code_name[c]);
6551 length += strlen ("expected ");
6552 buffer = alloca (length);
6555 for (c = c1; c <= c2; ++c)
6557 const char *prefix = length ? " or " : "expected ";
6559 strcpy (buffer + length, prefix);
6560 length += strlen (prefix);
6561 strcpy (buffer + length, tree_code_name[c]);
6562 length += strlen (tree_code_name[c]);
6565 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6566 buffer, tree_code_name[TREE_CODE (node)],
6567 function, trim_filename (file), line);
6571 /* Similar to tree_check_failed, except that we check that a tree does
6572 not have the specified code, given in CL. */
6575 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6576 const char *file, int line, const char *function)
6579 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6580 TREE_CODE_CLASS_STRING (cl),
6581 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6582 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6586 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6589 omp_clause_check_failed (const tree node, const char *file, int line,
6590 const char *function, enum omp_clause_code code)
6592 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6593 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6594 function, trim_filename (file), line);
6598 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6601 omp_clause_range_check_failed (const tree node, const char *file, int line,
6602 const char *function, enum omp_clause_code c1,
6603 enum omp_clause_code c2)
6606 unsigned length = 0;
6607 enum omp_clause_code c;
6609 for (c = c1; c <= c2; ++c)
6610 length += 4 + strlen (omp_clause_code_name[c]);
6612 length += strlen ("expected ");
6613 buffer = alloca (length);
6616 for (c = c1; c <= c2; ++c)
6618 const char *prefix = length ? " or " : "expected ";
6620 strcpy (buffer + length, prefix);
6621 length += strlen (prefix);
6622 strcpy (buffer + length, omp_clause_code_name[c]);
6623 length += strlen (omp_clause_code_name[c]);
6626 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6627 buffer, omp_clause_code_name[TREE_CODE (node)],
6628 function, trim_filename (file), line);
6632 #undef DEFTREESTRUCT
6633 #define DEFTREESTRUCT(VAL, NAME) NAME,
6635 static const char *ts_enum_names[] = {
6636 #include "treestruct.def"
6638 #undef DEFTREESTRUCT
6640 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6642 /* Similar to tree_class_check_failed, except that we check for
6643 whether CODE contains the tree structure identified by EN. */
6646 tree_contains_struct_check_failed (const tree node,
6647 const enum tree_node_structure_enum en,
6648 const char *file, int line,
6649 const char *function)
6652 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6654 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6658 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6659 (dynamically sized) vector. */
6662 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6663 const char *function)
6666 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6667 idx + 1, len, function, trim_filename (file), line);
6670 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6671 (dynamically sized) vector. */
6674 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6675 const char *function)
6678 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6679 idx + 1, len, function, trim_filename (file), line);
6682 /* Similar to above, except that the check is for the bounds of the operand
6683 vector of an expression node. */
6686 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
6687 int line, const char *function)
6690 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6691 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
6692 function, trim_filename (file), line);
6695 /* Similar to above, except that the check is for the number of
6696 operands of an OMP_CLAUSE node. */
6699 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6700 int line, const char *function)
6703 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6704 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6705 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6706 trim_filename (file), line);
6708 #endif /* ENABLE_TREE_CHECKING */
6710 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6711 and mapped to the machine mode MODE. Initialize its fields and build
6712 the information necessary for debugging output. */
6715 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6718 hashval_t hashcode = 0;
6720 /* Build a main variant, based on the main variant of the inner type, then
6721 use it to build the variant we return. */
6722 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
6723 && TYPE_MAIN_VARIANT (innertype) != innertype)
6724 return build_type_attribute_qual_variant (
6725 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
6726 TYPE_ATTRIBUTES (innertype),
6727 TYPE_QUALS (innertype));
6729 t = make_node (VECTOR_TYPE);
6730 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6731 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6732 TYPE_MODE (t) = mode;
6733 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6734 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6736 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
6737 SET_TYPE_STRUCTURAL_EQUALITY (t);
6738 else if (TYPE_CANONICAL (innertype) != innertype
6739 || mode != VOIDmode)
6741 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
6746 tree index = build_int_cst (NULL_TREE, nunits - 1);
6747 tree array = build_array_type (innertype, build_index_type (index));
6748 tree rt = make_node (RECORD_TYPE);
6750 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6751 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6753 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6754 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6755 the representation type, and we want to find that die when looking up
6756 the vector type. This is most easily achieved by making the TYPE_UID
6758 TYPE_UID (rt) = TYPE_UID (t);
6761 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
6762 hashcode = iterative_hash_host_wide_int (mode, hashcode);
6763 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
6764 return type_hash_canon (hashcode, t);
6768 make_or_reuse_type (unsigned size, int unsignedp)
6770 if (size == INT_TYPE_SIZE)
6771 return unsignedp ? unsigned_type_node : integer_type_node;
6772 if (size == CHAR_TYPE_SIZE)
6773 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6774 if (size == SHORT_TYPE_SIZE)
6775 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6776 if (size == LONG_TYPE_SIZE)
6777 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6778 if (size == LONG_LONG_TYPE_SIZE)
6779 return (unsignedp ? long_long_unsigned_type_node
6780 : long_long_integer_type_node);
6783 return make_unsigned_type (size);
6785 return make_signed_type (size);
6788 /* Create nodes for all integer types (and error_mark_node) using the sizes
6789 of C datatypes. The caller should call set_sizetype soon after calling
6790 this function to select one of the types as sizetype. */
6793 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6795 error_mark_node = make_node (ERROR_MARK);
6796 TREE_TYPE (error_mark_node) = error_mark_node;
6798 initialize_sizetypes (signed_sizetype);
6800 /* Define both `signed char' and `unsigned char'. */
6801 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6802 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6803 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6804 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6806 /* Define `char', which is like either `signed char' or `unsigned char'
6807 but not the same as either. */
6810 ? make_signed_type (CHAR_TYPE_SIZE)
6811 : make_unsigned_type (CHAR_TYPE_SIZE));
6812 TYPE_STRING_FLAG (char_type_node) = 1;
6814 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6815 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6816 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6817 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6818 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6819 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6820 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6821 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6823 /* Define a boolean type. This type only represents boolean values but
6824 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6825 Front ends which want to override this size (i.e. Java) can redefine
6826 boolean_type_node before calling build_common_tree_nodes_2. */
6827 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6828 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6829 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6830 TYPE_PRECISION (boolean_type_node) = 1;
6832 /* Fill in the rest of the sized types. Reuse existing type nodes
6834 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6835 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6836 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6837 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6838 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6840 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6841 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6842 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6843 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6844 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6846 access_public_node = get_identifier ("public");
6847 access_protected_node = get_identifier ("protected");
6848 access_private_node = get_identifier ("private");
6851 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6852 It will create several other common tree nodes. */
6855 build_common_tree_nodes_2 (int short_double)
6857 /* Define these next since types below may used them. */
6858 integer_zero_node = build_int_cst (NULL_TREE, 0);
6859 integer_one_node = build_int_cst (NULL_TREE, 1);
6860 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6862 size_zero_node = size_int (0);
6863 size_one_node = size_int (1);
6864 bitsize_zero_node = bitsize_int (0);
6865 bitsize_one_node = bitsize_int (1);
6866 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6868 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6869 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6871 void_type_node = make_node (VOID_TYPE);
6872 layout_type (void_type_node);
6874 /* We are not going to have real types in C with less than byte alignment,
6875 so we might as well not have any types that claim to have it. */
6876 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6877 TYPE_USER_ALIGN (void_type_node) = 0;
6879 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6880 layout_type (TREE_TYPE (null_pointer_node));
6882 ptr_type_node = build_pointer_type (void_type_node);
6884 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6885 fileptr_type_node = ptr_type_node;
6887 float_type_node = make_node (REAL_TYPE);
6888 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6889 layout_type (float_type_node);
6891 double_type_node = make_node (REAL_TYPE);
6893 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6895 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6896 layout_type (double_type_node);
6898 long_double_type_node = make_node (REAL_TYPE);
6899 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6900 layout_type (long_double_type_node);
6902 float_ptr_type_node = build_pointer_type (float_type_node);
6903 double_ptr_type_node = build_pointer_type (double_type_node);
6904 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6905 integer_ptr_type_node = build_pointer_type (integer_type_node);
6907 /* Fixed size integer types. */
6908 uint32_type_node = build_nonstandard_integer_type (32, true);
6909 uint64_type_node = build_nonstandard_integer_type (64, true);
6911 /* Decimal float types. */
6912 dfloat32_type_node = make_node (REAL_TYPE);
6913 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
6914 layout_type (dfloat32_type_node);
6915 TYPE_MODE (dfloat32_type_node) = SDmode;
6916 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
6918 dfloat64_type_node = make_node (REAL_TYPE);
6919 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
6920 layout_type (dfloat64_type_node);
6921 TYPE_MODE (dfloat64_type_node) = DDmode;
6922 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
6924 dfloat128_type_node = make_node (REAL_TYPE);
6925 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
6926 layout_type (dfloat128_type_node);
6927 TYPE_MODE (dfloat128_type_node) = TDmode;
6928 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
6930 complex_integer_type_node = make_node (COMPLEX_TYPE);
6931 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6932 layout_type (complex_integer_type_node);
6934 complex_float_type_node = make_node (COMPLEX_TYPE);
6935 TREE_TYPE (complex_float_type_node) = float_type_node;
6936 layout_type (complex_float_type_node);
6938 complex_double_type_node = make_node (COMPLEX_TYPE);
6939 TREE_TYPE (complex_double_type_node) = double_type_node;
6940 layout_type (complex_double_type_node);
6942 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6943 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6944 layout_type (complex_long_double_type_node);
6947 tree t = targetm.build_builtin_va_list ();
6949 /* Many back-ends define record types without setting TYPE_NAME.
6950 If we copied the record type here, we'd keep the original
6951 record type without a name. This breaks name mangling. So,
6952 don't copy record types and let c_common_nodes_and_builtins()
6953 declare the type to be __builtin_va_list. */
6954 if (TREE_CODE (t) != RECORD_TYPE)
6955 t = build_variant_type_copy (t);
6957 va_list_type_node = t;
6961 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6964 local_define_builtin (const char *name, tree type, enum built_in_function code,
6965 const char *library_name, int ecf_flags)
6969 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
6970 library_name, NULL_TREE);
6971 if (ecf_flags & ECF_CONST)
6972 TREE_READONLY (decl) = 1;
6973 if (ecf_flags & ECF_PURE)
6974 DECL_IS_PURE (decl) = 1;
6975 if (ecf_flags & ECF_NORETURN)
6976 TREE_THIS_VOLATILE (decl) = 1;
6977 if (ecf_flags & ECF_NOTHROW)
6978 TREE_NOTHROW (decl) = 1;
6979 if (ecf_flags & ECF_MALLOC)
6980 DECL_IS_MALLOC (decl) = 1;
6982 built_in_decls[code] = decl;
6983 implicit_built_in_decls[code] = decl;
6986 /* Call this function after instantiating all builtins that the language
6987 front end cares about. This will build the rest of the builtins that
6988 are relied upon by the tree optimizers and the middle-end. */
6991 build_common_builtin_nodes (void)
6995 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
6996 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6998 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6999 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7000 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7001 ftype = build_function_type (ptr_type_node, tmp);
7003 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7004 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7005 "memcpy", ECF_NOTHROW);
7006 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7007 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7008 "memmove", ECF_NOTHROW);
7011 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7013 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7014 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7015 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7016 ftype = build_function_type (integer_type_node, tmp);
7017 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7018 "memcmp", ECF_PURE | ECF_NOTHROW);
7021 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7023 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7024 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7025 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7026 ftype = build_function_type (ptr_type_node, tmp);
7027 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7028 "memset", ECF_NOTHROW);
7031 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7033 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7034 ftype = build_function_type (ptr_type_node, tmp);
7035 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7036 "alloca", ECF_NOTHROW | ECF_MALLOC);
7039 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7040 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7041 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7042 ftype = build_function_type (void_type_node, tmp);
7043 local_define_builtin ("__builtin_init_trampoline", ftype,
7044 BUILT_IN_INIT_TRAMPOLINE,
7045 "__builtin_init_trampoline", ECF_NOTHROW);
7047 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7048 ftype = build_function_type (ptr_type_node, tmp);
7049 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7050 BUILT_IN_ADJUST_TRAMPOLINE,
7051 "__builtin_adjust_trampoline",
7052 ECF_CONST | ECF_NOTHROW);
7054 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7055 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7056 ftype = build_function_type (void_type_node, tmp);
7057 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7058 BUILT_IN_NONLOCAL_GOTO,
7059 "__builtin_nonlocal_goto",
7060 ECF_NORETURN | ECF_NOTHROW);
7062 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7063 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7064 ftype = build_function_type (void_type_node, tmp);
7065 local_define_builtin ("__builtin_setjmp_setup", ftype,
7066 BUILT_IN_SETJMP_SETUP,
7067 "__builtin_setjmp_setup", ECF_NOTHROW);
7069 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7070 ftype = build_function_type (ptr_type_node, tmp);
7071 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7072 BUILT_IN_SETJMP_DISPATCHER,
7073 "__builtin_setjmp_dispatcher",
7074 ECF_PURE | ECF_NOTHROW);
7076 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7077 ftype = build_function_type (void_type_node, tmp);
7078 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7079 BUILT_IN_SETJMP_RECEIVER,
7080 "__builtin_setjmp_receiver", ECF_NOTHROW);
7082 ftype = build_function_type (ptr_type_node, void_list_node);
7083 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7084 "__builtin_stack_save", ECF_NOTHROW);
7086 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7087 ftype = build_function_type (void_type_node, tmp);
7088 local_define_builtin ("__builtin_stack_restore", ftype,
7089 BUILT_IN_STACK_RESTORE,
7090 "__builtin_stack_restore", ECF_NOTHROW);
7092 ftype = build_function_type (void_type_node, void_list_node);
7093 local_define_builtin ("__builtin_profile_func_enter", ftype,
7094 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7095 local_define_builtin ("__builtin_profile_func_exit", ftype,
7096 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7098 /* Complex multiplication and division. These are handled as builtins
7099 rather than optabs because emit_library_call_value doesn't support
7100 complex. Further, we can do slightly better with folding these
7101 beasties if the real and complex parts of the arguments are separate. */
7103 enum machine_mode mode;
7105 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7107 char mode_name_buf[4], *q;
7109 enum built_in_function mcode, dcode;
7110 tree type, inner_type;
7112 type = lang_hooks.types.type_for_mode (mode, 0);
7115 inner_type = TREE_TYPE (type);
7117 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7118 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7119 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7120 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7121 ftype = build_function_type (type, tmp);
7123 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7124 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7126 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7130 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7131 local_define_builtin (built_in_names[mcode], ftype, mcode,
7132 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7134 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7135 local_define_builtin (built_in_names[dcode], ftype, dcode,
7136 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7141 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7144 If we requested a pointer to a vector, build up the pointers that
7145 we stripped off while looking for the inner type. Similarly for
7146 return values from functions.
7148 The argument TYPE is the top of the chain, and BOTTOM is the
7149 new type which we will point to. */
7152 reconstruct_complex_type (tree type, tree bottom)
7156 if (POINTER_TYPE_P (type))
7158 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7159 outer = build_pointer_type (inner);
7161 else if (TREE_CODE (type) == ARRAY_TYPE)
7163 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7164 outer = build_array_type (inner, TYPE_DOMAIN (type));
7166 else if (TREE_CODE (type) == FUNCTION_TYPE)
7168 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7169 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7171 else if (TREE_CODE (type) == METHOD_TYPE)
7174 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7175 /* The build_method_type_directly() routine prepends 'this' to argument list,
7176 so we must compensate by getting rid of it. */
7177 argtypes = TYPE_ARG_TYPES (type);
7178 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
7180 TYPE_ARG_TYPES (type));
7181 TYPE_ARG_TYPES (outer) = argtypes;
7186 TYPE_READONLY (outer) = TYPE_READONLY (type);
7187 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
7192 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7195 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7199 switch (GET_MODE_CLASS (mode))
7201 case MODE_VECTOR_INT:
7202 case MODE_VECTOR_FLOAT:
7203 nunits = GET_MODE_NUNITS (mode);
7207 /* Check that there are no leftover bits. */
7208 gcc_assert (GET_MODE_BITSIZE (mode)
7209 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7211 nunits = GET_MODE_BITSIZE (mode)
7212 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7219 return make_vector_type (innertype, nunits, mode);
7222 /* Similarly, but takes the inner type and number of units, which must be
7226 build_vector_type (tree innertype, int nunits)
7228 return make_vector_type (innertype, nunits, VOIDmode);
7232 /* Build RESX_EXPR with given REGION_NUMBER. */
7234 build_resx (int region_number)
7237 t = build1 (RESX_EXPR, void_type_node,
7238 build_int_cst (NULL_TREE, region_number));
7242 /* Given an initializer INIT, return TRUE if INIT is zero or some
7243 aggregate of zeros. Otherwise return FALSE. */
7245 initializer_zerop (tree init)
7251 switch (TREE_CODE (init))
7254 return integer_zerop (init);
7257 /* ??? Note that this is not correct for C4X float formats. There,
7258 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7259 negative exponent. */
7260 return real_zerop (init)
7261 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7264 return integer_zerop (init)
7265 || (real_zerop (init)
7266 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7267 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7270 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7271 if (!initializer_zerop (TREE_VALUE (elt)))
7277 unsigned HOST_WIDE_INT idx;
7279 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7280 if (!initializer_zerop (elt))
7290 /* Build an empty statement. */
7293 build_empty_stmt (void)
7295 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7299 /* Build an OpenMP clause with code CODE. */
7302 build_omp_clause (enum omp_clause_code code)
7307 length = omp_clause_num_ops[code];
7308 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7310 t = ggc_alloc (size);
7311 memset (t, 0, size);
7312 TREE_SET_CODE (t, OMP_CLAUSE);
7313 OMP_CLAUSE_SET_CODE (t, code);
7315 #ifdef GATHER_STATISTICS
7316 tree_node_counts[(int) omp_clause_kind]++;
7317 tree_node_sizes[(int) omp_clause_kind] += size;
7324 /* Returns true if it is possible to prove that the index of
7325 an array access REF (an ARRAY_REF expression) falls into the
7329 in_array_bounds_p (tree ref)
7331 tree idx = TREE_OPERAND (ref, 1);
7334 if (TREE_CODE (idx) != INTEGER_CST)
7337 min = array_ref_low_bound (ref);
7338 max = array_ref_up_bound (ref);
7341 || TREE_CODE (min) != INTEGER_CST
7342 || TREE_CODE (max) != INTEGER_CST)
7345 if (tree_int_cst_lt (idx, min)
7346 || tree_int_cst_lt (max, idx))
7352 /* Returns true if it is possible to prove that the range of
7353 an array access REF (an ARRAY_RANGE_REF expression) falls
7354 into the array bounds. */
7357 range_in_array_bounds_p (tree ref)
7359 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7360 tree range_min, range_max, min, max;
7362 range_min = TYPE_MIN_VALUE (domain_type);
7363 range_max = TYPE_MAX_VALUE (domain_type);
7366 || TREE_CODE (range_min) != INTEGER_CST
7367 || TREE_CODE (range_max) != INTEGER_CST)
7370 min = array_ref_low_bound (ref);
7371 max = array_ref_up_bound (ref);
7374 || TREE_CODE (min) != INTEGER_CST
7375 || TREE_CODE (max) != INTEGER_CST)
7378 if (tree_int_cst_lt (range_min, min)
7379 || tree_int_cst_lt (max, range_max))
7385 /* Return true if T (assumed to be a DECL) is a global variable. */
7388 is_global_var (tree t)
7391 return (TREE_STATIC (t) || MTAG_GLOBAL (t));
7393 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
7396 /* Return true if T (assumed to be a DECL) must be assigned a memory
7400 needs_to_live_in_memory (tree t)
7402 if (TREE_CODE (t) == SSA_NAME)
7403 t = SSA_NAME_VAR (t);
7405 return (TREE_ADDRESSABLE (t)
7406 || is_global_var (t)
7407 || (TREE_CODE (t) == RESULT_DECL
7408 && aggregate_value_p (t, current_function_decl)));
7411 /* There are situations in which a language considers record types
7412 compatible which have different field lists. Decide if two fields
7413 are compatible. It is assumed that the parent records are compatible. */
7416 fields_compatible_p (tree f1, tree f2)
7418 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7419 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7422 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7423 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7426 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7432 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7435 find_compatible_field (tree record, tree orig_field)
7439 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7440 if (TREE_CODE (f) == FIELD_DECL
7441 && fields_compatible_p (f, orig_field))
7444 /* ??? Why isn't this on the main fields list? */
7445 f = TYPE_VFIELD (record);
7446 if (f && TREE_CODE (f) == FIELD_DECL
7447 && fields_compatible_p (f, orig_field))
7450 /* ??? We should abort here, but Java appears to do Bad Things
7451 with inherited fields. */
7455 /* Return value of a constant X. */
7458 int_cst_value (tree x)
7460 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
7461 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
7462 bool negative = ((val >> (bits - 1)) & 1) != 0;
7464 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
7467 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
7469 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
7474 /* Returns the greatest common divisor of A and B, which must be
7478 tree_fold_gcd (tree a, tree b)
7481 tree type = TREE_TYPE (a);
7483 gcc_assert (TREE_CODE (a) == INTEGER_CST);
7484 gcc_assert (TREE_CODE (b) == INTEGER_CST);
7486 if (integer_zerop (a))
7489 if (integer_zerop (b))
7492 if (tree_int_cst_sgn (a) == -1)
7493 a = fold_build2 (MULT_EXPR, type, a,
7494 build_int_cst (type, -1));
7496 if (tree_int_cst_sgn (b) == -1)
7497 b = fold_build2 (MULT_EXPR, type, b,
7498 build_int_cst (type, -1));
7502 a_mod_b = fold_build2 (FLOOR_MOD_EXPR, type, a, b);
7504 if (!TREE_INT_CST_LOW (a_mod_b)
7505 && !TREE_INT_CST_HIGH (a_mod_b))
7513 /* Returns unsigned variant of TYPE. */
7516 unsigned_type_for (tree type)
7518 if (POINTER_TYPE_P (type))
7519 return lang_hooks.types.unsigned_type (size_type_node);
7520 return lang_hooks.types.unsigned_type (type);
7523 /* Returns signed variant of TYPE. */
7526 signed_type_for (tree type)
7528 if (POINTER_TYPE_P (type))
7529 return lang_hooks.types.signed_type (size_type_node);
7530 return lang_hooks.types.signed_type (type);
7533 /* Returns the largest value obtainable by casting something in INNER type to
7537 upper_bound_in_type (tree outer, tree inner)
7539 unsigned HOST_WIDE_INT lo, hi;
7540 unsigned int det = 0;
7541 unsigned oprec = TYPE_PRECISION (outer);
7542 unsigned iprec = TYPE_PRECISION (inner);
7545 /* Compute a unique number for every combination. */
7546 det |= (oprec > iprec) ? 4 : 0;
7547 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7548 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7550 /* Determine the exponent to use. */
7555 /* oprec <= iprec, outer: signed, inner: don't care. */
7560 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7564 /* oprec > iprec, outer: signed, inner: signed. */
7568 /* oprec > iprec, outer: signed, inner: unsigned. */
7572 /* oprec > iprec, outer: unsigned, inner: signed. */
7576 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7583 /* Compute 2^^prec - 1. */
7584 if (prec <= HOST_BITS_PER_WIDE_INT)
7587 lo = ((~(unsigned HOST_WIDE_INT) 0)
7588 >> (HOST_BITS_PER_WIDE_INT - prec));
7592 hi = ((~(unsigned HOST_WIDE_INT) 0)
7593 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7594 lo = ~(unsigned HOST_WIDE_INT) 0;
7597 return build_int_cst_wide (outer, lo, hi);
7600 /* Returns the smallest value obtainable by casting something in INNER type to
7604 lower_bound_in_type (tree outer, tree inner)
7606 unsigned HOST_WIDE_INT lo, hi;
7607 unsigned oprec = TYPE_PRECISION (outer);
7608 unsigned iprec = TYPE_PRECISION (inner);
7610 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7612 if (TYPE_UNSIGNED (outer)
7613 /* If we are widening something of an unsigned type, OUTER type
7614 contains all values of INNER type. In particular, both INNER
7615 and OUTER types have zero in common. */
7616 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7620 /* If we are widening a signed type to another signed type, we
7621 want to obtain -2^^(iprec-1). If we are keeping the
7622 precision or narrowing to a signed type, we want to obtain
7624 unsigned prec = oprec > iprec ? iprec : oprec;
7626 if (prec <= HOST_BITS_PER_WIDE_INT)
7628 hi = ~(unsigned HOST_WIDE_INT) 0;
7629 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7633 hi = ((~(unsigned HOST_WIDE_INT) 0)
7634 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7639 return build_int_cst_wide (outer, lo, hi);
7642 /* Return nonzero if two operands that are suitable for PHI nodes are
7643 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7644 SSA_NAME or invariant. Note that this is strictly an optimization.
7645 That is, callers of this function can directly call operand_equal_p
7646 and get the same result, only slower. */
7649 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7653 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7655 return operand_equal_p (arg0, arg1, 0);
7658 /* Returns number of zeros at the end of binary representation of X.
7660 ??? Use ffs if available? */
7663 num_ending_zeros (tree x)
7665 unsigned HOST_WIDE_INT fr, nfr;
7666 unsigned num, abits;
7667 tree type = TREE_TYPE (x);
7669 if (TREE_INT_CST_LOW (x) == 0)
7671 num = HOST_BITS_PER_WIDE_INT;
7672 fr = TREE_INT_CST_HIGH (x);
7677 fr = TREE_INT_CST_LOW (x);
7680 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7683 if (nfr << abits == fr)
7690 if (num > TYPE_PRECISION (type))
7691 num = TYPE_PRECISION (type);
7693 return build_int_cst_type (type, num);
7697 #define WALK_SUBTREE(NODE) \
7700 result = walk_tree (&(NODE), func, data, pset); \
7706 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7707 be walked whenever a type is seen in the tree. Rest of operands and return
7708 value are as for walk_tree. */
7711 walk_type_fields (tree type, walk_tree_fn func, void *data,
7712 struct pointer_set_t *pset)
7714 tree result = NULL_TREE;
7716 switch (TREE_CODE (type))
7719 case REFERENCE_TYPE:
7720 /* We have to worry about mutually recursive pointers. These can't
7721 be written in C. They can in Ada. It's pathological, but
7722 there's an ACATS test (c38102a) that checks it. Deal with this
7723 by checking if we're pointing to another pointer, that one
7724 points to another pointer, that one does too, and we have no htab.
7725 If so, get a hash table. We check three levels deep to avoid
7726 the cost of the hash table if we don't need one. */
7727 if (POINTER_TYPE_P (TREE_TYPE (type))
7728 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7729 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7732 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7740 /* ... fall through ... */
7743 WALK_SUBTREE (TREE_TYPE (type));
7747 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7752 WALK_SUBTREE (TREE_TYPE (type));
7756 /* We never want to walk into default arguments. */
7757 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7758 WALK_SUBTREE (TREE_VALUE (arg));
7763 /* Don't follow this nodes's type if a pointer for fear that we'll
7764 have infinite recursion. Those types are uninteresting anyway. */
7765 if (!POINTER_TYPE_P (TREE_TYPE (type))
7766 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE)
7767 WALK_SUBTREE (TREE_TYPE (type));
7768 WALK_SUBTREE (TYPE_DOMAIN (type));
7772 WALK_SUBTREE (TREE_TYPE (type));
7773 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7783 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7784 called with the DATA and the address of each sub-tree. If FUNC returns a
7785 non-NULL value, the traversal is stopped, and the value returned by FUNC
7786 is returned. If PSET is non-NULL it is used to record the nodes visited,
7787 and to avoid visiting a node more than once. */
7790 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7792 enum tree_code code;
7796 #define WALK_SUBTREE_TAIL(NODE) \
7800 goto tail_recurse; \
7805 /* Skip empty subtrees. */
7809 /* Don't walk the same tree twice, if the user has requested
7810 that we avoid doing so. */
7811 if (pset && pointer_set_insert (pset, *tp))
7814 /* Call the function. */
7816 result = (*func) (tp, &walk_subtrees, data);
7818 /* If we found something, return it. */
7822 code = TREE_CODE (*tp);
7824 /* Even if we didn't, FUNC may have decided that there was nothing
7825 interesting below this point in the tree. */
7828 /* But we still need to check our siblings. */
7829 if (code == TREE_LIST)
7830 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7831 else if (code == OMP_CLAUSE)
7832 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7837 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
7839 if (result || !walk_subtrees)
7845 case IDENTIFIER_NODE:
7851 case PLACEHOLDER_EXPR:
7855 /* None of these have subtrees other than those already walked
7860 WALK_SUBTREE (TREE_VALUE (*tp));
7861 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7866 int len = TREE_VEC_LENGTH (*tp);
7871 /* Walk all elements but the first. */
7873 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
7875 /* Now walk the first one as a tail call. */
7876 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
7880 WALK_SUBTREE (TREE_REALPART (*tp));
7881 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
7885 unsigned HOST_WIDE_INT idx;
7886 constructor_elt *ce;
7889 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
7891 WALK_SUBTREE (ce->value);
7896 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
7901 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
7903 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7904 into declarations that are just mentioned, rather than
7905 declared; they don't really belong to this part of the tree.
7906 And, we can see cycles: the initializer for a declaration
7907 can refer to the declaration itself. */
7908 WALK_SUBTREE (DECL_INITIAL (decl));
7909 WALK_SUBTREE (DECL_SIZE (decl));
7910 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
7912 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
7915 case STATEMENT_LIST:
7917 tree_stmt_iterator i;
7918 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
7919 WALK_SUBTREE (*tsi_stmt_ptr (i));
7924 switch (OMP_CLAUSE_CODE (*tp))
7926 case OMP_CLAUSE_PRIVATE:
7927 case OMP_CLAUSE_SHARED:
7928 case OMP_CLAUSE_FIRSTPRIVATE:
7929 case OMP_CLAUSE_LASTPRIVATE:
7930 case OMP_CLAUSE_COPYIN:
7931 case OMP_CLAUSE_COPYPRIVATE:
7933 case OMP_CLAUSE_NUM_THREADS:
7934 case OMP_CLAUSE_SCHEDULE:
7935 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
7938 case OMP_CLAUSE_NOWAIT:
7939 case OMP_CLAUSE_ORDERED:
7940 case OMP_CLAUSE_DEFAULT:
7941 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7943 case OMP_CLAUSE_REDUCTION:
7946 for (i = 0; i < 4; i++)
7947 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
7948 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7960 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7961 But, we only want to walk once. */
7962 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
7963 for (i = 0; i < len; ++i)
7964 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7965 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
7969 /* If this is a TYPE_DECL, walk into the fields of the type that it's
7970 defining. We only want to walk into these fields of a type in this
7971 case and not in the general case of a mere reference to the type.
7973 The criterion is as follows: if the field can be an expression, it
7974 must be walked only here. This should be in keeping with the fields
7975 that are directly gimplified in gimplify_type_sizes in order for the
7976 mark/copy-if-shared/unmark machinery of the gimplifier to work with
7977 variable-sized types.
7979 Note that DECLs get walked as part of processing the BIND_EXPR. */
7980 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
7982 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
7983 if (TREE_CODE (*type_p) == ERROR_MARK)
7986 /* Call the function for the type. See if it returns anything or
7987 doesn't want us to continue. If we are to continue, walk both
7988 the normal fields and those for the declaration case. */
7989 result = (*func) (type_p, &walk_subtrees, data);
7990 if (result || !walk_subtrees)
7993 result = walk_type_fields (*type_p, func, data, pset);
7997 /* If this is a record type, also walk the fields. */
7998 if (TREE_CODE (*type_p) == RECORD_TYPE
7999 || TREE_CODE (*type_p) == UNION_TYPE
8000 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8004 for (field = TYPE_FIELDS (*type_p); field;
8005 field = TREE_CHAIN (field))
8007 /* We'd like to look at the type of the field, but we can
8008 easily get infinite recursion. So assume it's pointed
8009 to elsewhere in the tree. Also, ignore things that
8011 if (TREE_CODE (field) != FIELD_DECL)
8014 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8015 WALK_SUBTREE (DECL_SIZE (field));
8016 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8017 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8018 WALK_SUBTREE (DECL_QUALIFIER (field));
8022 /* Same for scalar types. */
8023 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8024 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8025 || TREE_CODE (*type_p) == INTEGER_TYPE
8026 || TREE_CODE (*type_p) == REAL_TYPE)
8028 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8029 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8032 WALK_SUBTREE (TYPE_SIZE (*type_p));
8033 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8038 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
8039 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code)))
8043 /* Walk over all the sub-trees of this operand. */
8044 len = TREE_CODE_LENGTH (code);
8046 /* Go through the subtrees. We need to do this in forward order so
8047 that the scope of a FOR_EXPR is handled properly. */
8050 for (i = 0; i < len - 1; ++i)
8051 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp, i));
8052 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp, len - 1));
8055 /* If this is a type, walk the needed fields in the type. */
8056 else if (TYPE_P (*tp))
8057 return walk_type_fields (*tp, func, data, pset);
8061 /* We didn't find what we were looking for. */
8064 #undef WALK_SUBTREE_TAIL
8068 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8071 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
8074 struct pointer_set_t *pset;
8076 pset = pointer_set_create ();
8077 result = walk_tree (tp, func, data, pset);
8078 pointer_set_destroy (pset);
8083 /* Return true if STMT is an empty statement or contains nothing but
8084 empty statements. */
8087 empty_body_p (tree stmt)
8089 tree_stmt_iterator i;
8092 if (IS_EMPTY_STMT (stmt))
8094 else if (TREE_CODE (stmt) == BIND_EXPR)
8095 body = BIND_EXPR_BODY (stmt);
8096 else if (TREE_CODE (stmt) == STATEMENT_LIST)
8101 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
8102 if (!empty_body_p (tsi_stmt (i)))
8111 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8113 if (IS_EXPR_CODE_CLASS (c))
8114 return &t->exp.block;
8115 else if (IS_GIMPLE_STMT_CODE_CLASS (c))
8116 return &GIMPLE_STMT_BLOCK (t);
8122 generic_tree_operand (tree node, int i)
8124 if (GIMPLE_STMT_P (node))
8125 return &GIMPLE_STMT_OPERAND (node, i);
8126 return &TREE_OPERAND (node, i);
8130 generic_tree_type (tree node)
8132 if (GIMPLE_STMT_P (node))
8133 return &void_type_node;
8134 return &TREE_TYPE (node);
8137 #include "gt-tree.h"