1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
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 3, 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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "fixed-value.h"
55 /* Each tree code class has an associated string representation.
56 These must correspond to the tree_code_class entries. */
58 const char *const tree_code_class_strings[] =
74 /* obstack.[ch] explicitly declined to prototype this. */
75 extern int _obstack_allocated_p (struct obstack *h, void *obj);
77 #ifdef GATHER_STATISTICS
78 /* Statistics-gathering stuff. */
80 int tree_node_counts[(int) all_kinds];
81 int tree_node_sizes[(int) all_kinds];
83 /* Keep in sync with tree.h:enum tree_node_kind. */
84 static const char * const tree_node_kind_names[] = {
106 #endif /* GATHER_STATISTICS */
108 /* Unique id for next decl created. */
109 static GTY(()) int next_decl_uid;
110 /* Unique id for next type created. */
111 static GTY(()) int next_type_uid = 1;
113 /* Since we cannot rehash a type after it is in the table, we have to
114 keep the hash code. */
116 struct type_hash GTY(())
122 /* Initial size of the hash table (rounded to next prime). */
123 #define TYPE_HASH_INITIAL_SIZE 1000
125 /* Now here is the hash table. When recording a type, it is added to
126 the slot whose index is the hash code. Note that the hash table is
127 used for several kinds of types (function types, array types and
128 array index range types, for now). While all these live in the
129 same table, they are completely independent, and the hash code is
130 computed differently for each of these. */
132 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
133 htab_t type_hash_table;
135 /* Hash table and temporary node for larger integer const values. */
136 static GTY (()) tree int_cst_node;
137 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
138 htab_t int_cst_hash_table;
140 /* General tree->tree mapping structure for use in hash tables. */
143 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
144 htab_t debug_expr_for_decl;
146 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
147 htab_t value_expr_for_decl;
149 static GTY ((if_marked ("tree_priority_map_marked_p"),
150 param_is (struct tree_priority_map)))
151 htab_t init_priority_for_decl;
153 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
154 htab_t restrict_base_for_decl;
156 static void set_type_quals (tree, int);
157 static int type_hash_eq (const void *, const void *);
158 static hashval_t type_hash_hash (const void *);
159 static hashval_t int_cst_hash_hash (const void *);
160 static int int_cst_hash_eq (const void *, const void *);
161 static void print_type_hash_statistics (void);
162 static void print_debug_expr_statistics (void);
163 static void print_value_expr_statistics (void);
164 static int type_hash_marked_p (const void *);
165 static unsigned int type_hash_list (const_tree, hashval_t);
166 static unsigned int attribute_hash_list (const_tree, hashval_t);
168 tree global_trees[TI_MAX];
169 tree integer_types[itk_none];
171 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
173 /* Number of operands for each OpenMP clause. */
174 unsigned const char omp_clause_num_ops[] =
176 0, /* OMP_CLAUSE_ERROR */
177 1, /* OMP_CLAUSE_PRIVATE */
178 1, /* OMP_CLAUSE_SHARED */
179 1, /* OMP_CLAUSE_FIRSTPRIVATE */
180 1, /* OMP_CLAUSE_LASTPRIVATE */
181 4, /* OMP_CLAUSE_REDUCTION */
182 1, /* OMP_CLAUSE_COPYIN */
183 1, /* OMP_CLAUSE_COPYPRIVATE */
184 1, /* OMP_CLAUSE_IF */
185 1, /* OMP_CLAUSE_NUM_THREADS */
186 1, /* OMP_CLAUSE_SCHEDULE */
187 0, /* OMP_CLAUSE_NOWAIT */
188 0, /* OMP_CLAUSE_ORDERED */
189 0 /* OMP_CLAUSE_DEFAULT */
192 const char * const omp_clause_code_name[] =
215 /* Initialize the hash table of types. */
216 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
219 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
222 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
224 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
225 tree_priority_map_eq, 0);
226 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
229 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
230 int_cst_hash_eq, NULL);
232 int_cst_node = make_node (INTEGER_CST);
234 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
235 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
236 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
239 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
240 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
241 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
242 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
243 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
244 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
245 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
246 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
247 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
250 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
251 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
252 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
253 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
254 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
255 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
257 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
258 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
259 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
260 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
261 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
262 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
263 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
264 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
265 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
266 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
267 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
268 tree_contains_struct[MEMORY_PARTITION_TAG][TS_DECL_MINIMAL] = 1;
270 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
271 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
272 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_TAG] = 1;
274 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_PARTITION_TAG] = 1;
276 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
277 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
278 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
279 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
281 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
282 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
283 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
284 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
285 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
286 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
287 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
288 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
290 lang_hooks.init_ts ();
294 /* The name of the object as the assembler will see it (but before any
295 translations made by ASM_OUTPUT_LABELREF). Often this is the same
296 as DECL_NAME. It is an IDENTIFIER_NODE. */
298 decl_assembler_name (tree decl)
300 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
301 lang_hooks.set_decl_assembler_name (decl);
302 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
305 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
308 decl_assembler_name_equal (tree decl, tree asmname)
310 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
312 if (decl_asmname == asmname)
315 /* If the target assembler name was set by the user, things are trickier.
316 We have a leading '*' to begin with. After that, it's arguable what
317 is the correct thing to do with -fleading-underscore. Arguably, we've
318 historically been doing the wrong thing in assemble_alias by always
319 printing the leading underscore. Since we're not changing that, make
320 sure user_label_prefix follows the '*' before matching. */
321 if (IDENTIFIER_POINTER (decl_asmname)[0] == '*')
323 const char *decl_str = IDENTIFIER_POINTER (decl_asmname) + 1;
324 size_t ulp_len = strlen (user_label_prefix);
328 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
333 return strcmp (decl_str, IDENTIFIER_POINTER (asmname)) == 0;
339 /* Compute the number of bytes occupied by a tree with code CODE.
340 This function cannot be used for nodes that have variable sizes,
341 including TREE_VEC, PHI_NODE, STRING_CST, and CALL_EXPR. */
343 tree_code_size (enum tree_code code)
345 switch (TREE_CODE_CLASS (code))
347 case tcc_declaration: /* A decl node */
352 return sizeof (struct tree_field_decl);
354 return sizeof (struct tree_parm_decl);
356 return sizeof (struct tree_var_decl);
358 return sizeof (struct tree_label_decl);
360 return sizeof (struct tree_result_decl);
362 return sizeof (struct tree_const_decl);
364 return sizeof (struct tree_type_decl);
366 return sizeof (struct tree_function_decl);
367 case NAME_MEMORY_TAG:
368 case SYMBOL_MEMORY_TAG:
369 return sizeof (struct tree_memory_tag);
370 case MEMORY_PARTITION_TAG:
371 return sizeof (struct tree_memory_partition_tag);
373 return sizeof (struct tree_decl_non_common);
377 case tcc_type: /* a type node */
378 return sizeof (struct tree_type);
380 case tcc_reference: /* a reference */
381 case tcc_expression: /* an expression */
382 case tcc_statement: /* an expression with side effects */
383 case tcc_comparison: /* a comparison expression */
384 case tcc_unary: /* a unary arithmetic expression */
385 case tcc_binary: /* a binary arithmetic expression */
386 return (sizeof (struct tree_exp)
387 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
389 case tcc_gimple_stmt:
390 return (sizeof (struct gimple_stmt)
391 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
393 case tcc_constant: /* a constant */
396 case INTEGER_CST: return sizeof (struct tree_int_cst);
397 case REAL_CST: return sizeof (struct tree_real_cst);
398 case FIXED_CST: return sizeof (struct tree_fixed_cst);
399 case COMPLEX_CST: return sizeof (struct tree_complex);
400 case VECTOR_CST: return sizeof (struct tree_vector);
401 case STRING_CST: gcc_unreachable ();
403 return lang_hooks.tree_size (code);
406 case tcc_exceptional: /* something random, like an identifier. */
409 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
410 case TREE_LIST: return sizeof (struct tree_list);
413 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
417 case PHI_NODE: gcc_unreachable ();
419 case SSA_NAME: return sizeof (struct tree_ssa_name);
421 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
422 case BLOCK: return sizeof (struct tree_block);
423 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
424 case CONSTRUCTOR: return sizeof (struct tree_constructor);
427 return lang_hooks.tree_size (code);
435 /* Compute the number of bytes occupied by NODE. This routine only
436 looks at TREE_CODE, except for those nodes that have variable sizes. */
438 tree_size (const_tree node)
440 const enum tree_code code = TREE_CODE (node);
444 return (sizeof (struct tree_phi_node)
445 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
448 return (offsetof (struct tree_binfo, base_binfos)
449 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
452 return (sizeof (struct tree_vec)
453 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
456 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
459 return (sizeof (struct tree_omp_clause)
460 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
464 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
465 return (sizeof (struct tree_exp)
466 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
468 return tree_code_size (code);
472 /* Return a newly allocated node of code CODE. For decl and type
473 nodes, some other fields are initialized. The rest of the node is
474 initialized to zero. This function cannot be used for PHI_NODE,
475 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
478 Achoo! I got a code in the node. */
481 make_node_stat (enum tree_code code MEM_STAT_DECL)
484 enum tree_code_class type = TREE_CODE_CLASS (code);
485 size_t length = tree_code_size (code);
486 #ifdef GATHER_STATISTICS
491 case tcc_declaration: /* A decl node */
495 case tcc_type: /* a type node */
499 case tcc_statement: /* an expression with side effects */
503 case tcc_reference: /* a reference */
507 case tcc_expression: /* an expression */
508 case tcc_comparison: /* a comparison expression */
509 case tcc_unary: /* a unary arithmetic expression */
510 case tcc_binary: /* a binary arithmetic expression */
514 case tcc_constant: /* a constant */
518 case tcc_gimple_stmt:
519 kind = gimple_stmt_kind;
522 case tcc_exceptional: /* something random, like an identifier. */
525 case IDENTIFIER_NODE:
542 kind = ssa_name_kind;
563 tree_node_counts[(int) kind]++;
564 tree_node_sizes[(int) kind] += length;
567 if (code == IDENTIFIER_NODE)
568 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
570 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
572 memset (t, 0, length);
574 TREE_SET_CODE (t, code);
579 TREE_SIDE_EFFECTS (t) = 1;
582 case tcc_declaration:
583 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
584 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
585 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
587 if (code == FUNCTION_DECL)
589 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
590 DECL_MODE (t) = FUNCTION_MODE;
594 /* We have not yet computed the alias set for this declaration. */
595 DECL_POINTER_ALIAS_SET (t) = -1;
597 DECL_SOURCE_LOCATION (t) = input_location;
598 DECL_UID (t) = next_decl_uid++;
603 TYPE_UID (t) = next_type_uid++;
604 TYPE_ALIGN (t) = BITS_PER_UNIT;
605 TYPE_USER_ALIGN (t) = 0;
606 TYPE_MAIN_VARIANT (t) = t;
607 TYPE_CANONICAL (t) = t;
609 /* Default to no attributes for type, but let target change that. */
610 TYPE_ATTRIBUTES (t) = NULL_TREE;
611 targetm.set_default_type_attributes (t);
613 /* We have not yet computed the alias set for this type. */
614 TYPE_ALIAS_SET (t) = -1;
618 TREE_CONSTANT (t) = 1;
627 case PREDECREMENT_EXPR:
628 case PREINCREMENT_EXPR:
629 case POSTDECREMENT_EXPR:
630 case POSTINCREMENT_EXPR:
631 /* All of these have side-effects, no matter what their
633 TREE_SIDE_EFFECTS (t) = 1;
641 case tcc_gimple_stmt:
644 case GIMPLE_MODIFY_STMT:
645 TREE_SIDE_EFFECTS (t) = 1;
653 /* Other classes need no special treatment. */
660 /* Return a new node with the same contents as NODE except that its
661 TREE_CHAIN is zero and it has a fresh uid. */
664 copy_node_stat (tree node MEM_STAT_DECL)
667 enum tree_code code = TREE_CODE (node);
670 gcc_assert (code != STATEMENT_LIST);
672 length = tree_size (node);
673 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
674 memcpy (t, node, length);
676 if (!GIMPLE_TUPLE_P (node))
678 TREE_ASM_WRITTEN (t) = 0;
679 TREE_VISITED (t) = 0;
682 if (TREE_CODE_CLASS (code) == tcc_declaration)
684 DECL_UID (t) = next_decl_uid++;
685 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
686 && DECL_HAS_VALUE_EXPR_P (node))
688 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
689 DECL_HAS_VALUE_EXPR_P (t) = 1;
691 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
693 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
694 DECL_HAS_INIT_PRIORITY_P (t) = 1;
696 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
698 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
699 DECL_BASED_ON_RESTRICT_P (t) = 1;
702 else if (TREE_CODE_CLASS (code) == tcc_type)
704 TYPE_UID (t) = next_type_uid++;
705 /* The following is so that the debug code for
706 the copy is different from the original type.
707 The two statements usually duplicate each other
708 (because they clear fields of the same union),
709 but the optimizer should catch that. */
710 TYPE_SYMTAB_POINTER (t) = 0;
711 TYPE_SYMTAB_ADDRESS (t) = 0;
713 /* Do not copy the values cache. */
714 if (TYPE_CACHED_VALUES_P(t))
716 TYPE_CACHED_VALUES_P (t) = 0;
717 TYPE_CACHED_VALUES (t) = NULL_TREE;
724 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
725 For example, this can copy a list made of TREE_LIST nodes. */
728 copy_list (tree list)
736 head = prev = copy_node (list);
737 next = TREE_CHAIN (list);
740 TREE_CHAIN (prev) = copy_node (next);
741 prev = TREE_CHAIN (prev);
742 next = TREE_CHAIN (next);
748 /* Create an INT_CST node with a LOW value sign extended. */
751 build_int_cst (tree type, HOST_WIDE_INT low)
753 /* Support legacy code. */
755 type = integer_type_node;
757 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
760 /* Create an INT_CST node with a LOW value zero extended. */
763 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
765 return build_int_cst_wide (type, low, 0);
768 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
769 if it is negative. This function is similar to build_int_cst, but
770 the extra bits outside of the type precision are cleared. Constants
771 with these extra bits may confuse the fold so that it detects overflows
772 even in cases when they do not occur, and in general should be avoided.
773 We cannot however make this a default behavior of build_int_cst without
774 more intrusive changes, since there are parts of gcc that rely on the extra
775 precision of the integer constants. */
778 build_int_cst_type (tree type, HOST_WIDE_INT low)
780 unsigned HOST_WIDE_INT low1;
785 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
787 return build_int_cst_wide (type, low1, hi);
790 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
791 and sign extended according to the value range of TYPE. */
794 build_int_cst_wide_type (tree type,
795 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
797 fit_double_type (low, high, &low, &high, type);
798 return build_int_cst_wide (type, low, high);
801 /* These are the hash table functions for the hash table of INTEGER_CST
802 nodes of a sizetype. */
804 /* Return the hash code code X, an INTEGER_CST. */
807 int_cst_hash_hash (const void *x)
809 const_tree const t = (const_tree) x;
811 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
812 ^ htab_hash_pointer (TREE_TYPE (t)));
815 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
816 is the same as that given by *Y, which is the same. */
819 int_cst_hash_eq (const void *x, const void *y)
821 const_tree const xt = (const_tree) x;
822 const_tree const yt = (const_tree) y;
824 return (TREE_TYPE (xt) == TREE_TYPE (yt)
825 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
826 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
829 /* Create an INT_CST node of TYPE and value HI:LOW.
830 The returned node is always shared. For small integers we use a
831 per-type vector cache, for larger ones we use a single hash table. */
834 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
842 switch (TREE_CODE (type))
846 /* Cache NULL pointer. */
855 /* Cache false or true. */
863 if (TYPE_UNSIGNED (type))
866 limit = INTEGER_SHARE_LIMIT;
867 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
873 limit = INTEGER_SHARE_LIMIT + 1;
874 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
876 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
890 /* Look for it in the type's vector of small shared ints. */
891 if (!TYPE_CACHED_VALUES_P (type))
893 TYPE_CACHED_VALUES_P (type) = 1;
894 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
897 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
900 /* Make sure no one is clobbering the shared constant. */
901 gcc_assert (TREE_TYPE (t) == type);
902 gcc_assert (TREE_INT_CST_LOW (t) == low);
903 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
907 /* Create a new shared int. */
908 t = make_node (INTEGER_CST);
910 TREE_INT_CST_LOW (t) = low;
911 TREE_INT_CST_HIGH (t) = hi;
912 TREE_TYPE (t) = type;
914 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
919 /* Use the cache of larger shared ints. */
922 TREE_INT_CST_LOW (int_cst_node) = low;
923 TREE_INT_CST_HIGH (int_cst_node) = hi;
924 TREE_TYPE (int_cst_node) = type;
926 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
930 /* Insert this one into the hash table. */
933 /* Make a new node for next time round. */
934 int_cst_node = make_node (INTEGER_CST);
941 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
942 and the rest are zeros. */
945 build_low_bits_mask (tree type, unsigned bits)
947 unsigned HOST_WIDE_INT low;
949 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
951 gcc_assert (bits <= TYPE_PRECISION (type));
953 if (bits == TYPE_PRECISION (type)
954 && !TYPE_UNSIGNED (type))
956 /* Sign extended all-ones mask. */
960 else if (bits <= HOST_BITS_PER_WIDE_INT)
962 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
967 bits -= HOST_BITS_PER_WIDE_INT;
969 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
972 return build_int_cst_wide (type, low, high);
975 /* Checks that X is integer constant that can be expressed in (unsigned)
976 HOST_WIDE_INT without loss of precision. */
979 cst_and_fits_in_hwi (const_tree x)
981 if (TREE_CODE (x) != INTEGER_CST)
984 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
987 return (TREE_INT_CST_HIGH (x) == 0
988 || TREE_INT_CST_HIGH (x) == -1);
991 /* Return a new VECTOR_CST node whose type is TYPE and whose values
992 are in a list pointed to by VALS. */
995 build_vector (tree type, tree vals)
997 tree v = make_node (VECTOR_CST);
1001 TREE_VECTOR_CST_ELTS (v) = vals;
1002 TREE_TYPE (v) = type;
1004 /* Iterate through elements and check for overflow. */
1005 for (link = vals; link; link = TREE_CHAIN (link))
1007 tree value = TREE_VALUE (link);
1009 /* Don't crash if we get an address constant. */
1010 if (!CONSTANT_CLASS_P (value))
1013 over |= TREE_OVERFLOW (value);
1016 TREE_OVERFLOW (v) = over;
1020 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1021 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1024 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1026 tree list = NULL_TREE;
1027 unsigned HOST_WIDE_INT idx;
1030 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1031 list = tree_cons (NULL_TREE, value, list);
1032 return build_vector (type, nreverse (list));
1035 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1036 are in the VEC pointed to by VALS. */
1038 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1040 tree c = make_node (CONSTRUCTOR);
1041 TREE_TYPE (c) = type;
1042 CONSTRUCTOR_ELTS (c) = vals;
1046 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1049 build_constructor_single (tree type, tree index, tree value)
1051 VEC(constructor_elt,gc) *v;
1052 constructor_elt *elt;
1055 v = VEC_alloc (constructor_elt, gc, 1);
1056 elt = VEC_quick_push (constructor_elt, v, NULL);
1060 t = build_constructor (type, v);
1061 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1066 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1067 are in a list pointed to by VALS. */
1069 build_constructor_from_list (tree type, tree vals)
1072 VEC(constructor_elt,gc) *v = NULL;
1073 bool constant_p = true;
1077 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1078 for (t = vals; t; t = TREE_CHAIN (t))
1080 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1081 val = TREE_VALUE (t);
1082 elt->index = TREE_PURPOSE (t);
1084 if (!TREE_CONSTANT (val))
1089 t = build_constructor (type, v);
1090 TREE_CONSTANT (t) = constant_p;
1094 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1097 build_fixed (tree type, FIXED_VALUE_TYPE f)
1100 FIXED_VALUE_TYPE *fp;
1102 v = make_node (FIXED_CST);
1103 fp = ggc_alloc (sizeof (FIXED_VALUE_TYPE));
1104 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1106 TREE_TYPE (v) = type;
1107 TREE_FIXED_CST_PTR (v) = fp;
1111 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1114 build_real (tree type, REAL_VALUE_TYPE d)
1117 REAL_VALUE_TYPE *dp;
1120 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1121 Consider doing it via real_convert now. */
1123 v = make_node (REAL_CST);
1124 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1125 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1127 TREE_TYPE (v) = type;
1128 TREE_REAL_CST_PTR (v) = dp;
1129 TREE_OVERFLOW (v) = overflow;
1133 /* Return a new REAL_CST node whose type is TYPE
1134 and whose value is the integer value of the INTEGER_CST node I. */
1137 real_value_from_int_cst (const_tree type, const_tree i)
1141 /* Clear all bits of the real value type so that we can later do
1142 bitwise comparisons to see if two values are the same. */
1143 memset (&d, 0, sizeof d);
1145 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1146 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1147 TYPE_UNSIGNED (TREE_TYPE (i)));
1151 /* Given a tree representing an integer constant I, return a tree
1152 representing the same value as a floating-point constant of type TYPE. */
1155 build_real_from_int_cst (tree type, const_tree i)
1158 int overflow = TREE_OVERFLOW (i);
1160 v = build_real (type, real_value_from_int_cst (type, i));
1162 TREE_OVERFLOW (v) |= overflow;
1166 /* Return a newly constructed STRING_CST node whose value is
1167 the LEN characters at STR.
1168 The TREE_TYPE is not initialized. */
1171 build_string (int len, const char *str)
1176 /* Do not waste bytes provided by padding of struct tree_string. */
1177 length = len + offsetof (struct tree_string, str) + 1;
1179 #ifdef GATHER_STATISTICS
1180 tree_node_counts[(int) c_kind]++;
1181 tree_node_sizes[(int) c_kind] += length;
1184 s = ggc_alloc_tree (length);
1186 memset (s, 0, sizeof (struct tree_common));
1187 TREE_SET_CODE (s, STRING_CST);
1188 TREE_CONSTANT (s) = 1;
1189 TREE_STRING_LENGTH (s) = len;
1190 memcpy (s->string.str, str, len);
1191 s->string.str[len] = '\0';
1196 /* Return a newly constructed COMPLEX_CST node whose value is
1197 specified by the real and imaginary parts REAL and IMAG.
1198 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1199 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1202 build_complex (tree type, tree real, tree imag)
1204 tree t = make_node (COMPLEX_CST);
1206 TREE_REALPART (t) = real;
1207 TREE_IMAGPART (t) = imag;
1208 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1209 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1213 /* Return a constant of arithmetic type TYPE which is the
1214 multiplicative identity of the set TYPE. */
1217 build_one_cst (tree type)
1219 switch (TREE_CODE (type))
1221 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1222 case POINTER_TYPE: case REFERENCE_TYPE:
1224 return build_int_cst (type, 1);
1227 return build_real (type, dconst1);
1229 case FIXED_POINT_TYPE:
1230 /* We can only generate 1 for accum types. */
1231 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1232 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1239 scalar = build_one_cst (TREE_TYPE (type));
1241 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1243 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1244 cst = tree_cons (NULL_TREE, scalar, cst);
1246 return build_vector (type, cst);
1250 return build_complex (type,
1251 build_one_cst (TREE_TYPE (type)),
1252 fold_convert (TREE_TYPE (type), integer_zero_node));
1259 /* Build a BINFO with LEN language slots. */
1262 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1265 size_t length = (offsetof (struct tree_binfo, base_binfos)
1266 + VEC_embedded_size (tree, base_binfos));
1268 #ifdef GATHER_STATISTICS
1269 tree_node_counts[(int) binfo_kind]++;
1270 tree_node_sizes[(int) binfo_kind] += length;
1273 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1275 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1277 TREE_SET_CODE (t, TREE_BINFO);
1279 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1285 /* Build a newly constructed TREE_VEC node of length LEN. */
1288 make_tree_vec_stat (int len MEM_STAT_DECL)
1291 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1293 #ifdef GATHER_STATISTICS
1294 tree_node_counts[(int) vec_kind]++;
1295 tree_node_sizes[(int) vec_kind] += length;
1298 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1300 memset (t, 0, length);
1302 TREE_SET_CODE (t, TREE_VEC);
1303 TREE_VEC_LENGTH (t) = len;
1308 /* Return 1 if EXPR is the integer constant zero or a complex constant
1312 integer_zerop (const_tree expr)
1316 return ((TREE_CODE (expr) == INTEGER_CST
1317 && TREE_INT_CST_LOW (expr) == 0
1318 && TREE_INT_CST_HIGH (expr) == 0)
1319 || (TREE_CODE (expr) == COMPLEX_CST
1320 && integer_zerop (TREE_REALPART (expr))
1321 && integer_zerop (TREE_IMAGPART (expr))));
1324 /* Return 1 if EXPR is the integer constant one or the corresponding
1325 complex constant. */
1328 integer_onep (const_tree expr)
1332 return ((TREE_CODE (expr) == INTEGER_CST
1333 && TREE_INT_CST_LOW (expr) == 1
1334 && TREE_INT_CST_HIGH (expr) == 0)
1335 || (TREE_CODE (expr) == COMPLEX_CST
1336 && integer_onep (TREE_REALPART (expr))
1337 && integer_zerop (TREE_IMAGPART (expr))));
1340 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1341 it contains. Likewise for the corresponding complex constant. */
1344 integer_all_onesp (const_tree expr)
1351 if (TREE_CODE (expr) == COMPLEX_CST
1352 && integer_all_onesp (TREE_REALPART (expr))
1353 && integer_zerop (TREE_IMAGPART (expr)))
1356 else if (TREE_CODE (expr) != INTEGER_CST)
1359 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1360 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1361 && TREE_INT_CST_HIGH (expr) == -1)
1366 /* Note that using TYPE_PRECISION here is wrong. We care about the
1367 actual bits, not the (arbitrary) range of the type. */
1368 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1369 if (prec >= HOST_BITS_PER_WIDE_INT)
1371 HOST_WIDE_INT high_value;
1374 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1376 /* Can not handle precisions greater than twice the host int size. */
1377 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1378 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1379 /* Shifting by the host word size is undefined according to the ANSI
1380 standard, so we must handle this as a special case. */
1383 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1385 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1386 && TREE_INT_CST_HIGH (expr) == high_value);
1389 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1392 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1396 integer_pow2p (const_tree expr)
1399 HOST_WIDE_INT high, low;
1403 if (TREE_CODE (expr) == COMPLEX_CST
1404 && integer_pow2p (TREE_REALPART (expr))
1405 && integer_zerop (TREE_IMAGPART (expr)))
1408 if (TREE_CODE (expr) != INTEGER_CST)
1411 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1412 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1413 high = TREE_INT_CST_HIGH (expr);
1414 low = TREE_INT_CST_LOW (expr);
1416 /* First clear all bits that are beyond the type's precision in case
1417 we've been sign extended. */
1419 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1421 else if (prec > HOST_BITS_PER_WIDE_INT)
1422 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1426 if (prec < HOST_BITS_PER_WIDE_INT)
1427 low &= ~((HOST_WIDE_INT) (-1) << prec);
1430 if (high == 0 && low == 0)
1433 return ((high == 0 && (low & (low - 1)) == 0)
1434 || (low == 0 && (high & (high - 1)) == 0));
1437 /* Return 1 if EXPR is an integer constant other than zero or a
1438 complex constant other than zero. */
1441 integer_nonzerop (const_tree expr)
1445 return ((TREE_CODE (expr) == INTEGER_CST
1446 && (TREE_INT_CST_LOW (expr) != 0
1447 || TREE_INT_CST_HIGH (expr) != 0))
1448 || (TREE_CODE (expr) == COMPLEX_CST
1449 && (integer_nonzerop (TREE_REALPART (expr))
1450 || integer_nonzerop (TREE_IMAGPART (expr)))));
1453 /* Return 1 if EXPR is the fixed-point constant zero. */
1456 fixed_zerop (const_tree expr)
1458 return (TREE_CODE (expr) == FIXED_CST
1459 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1462 /* Return the power of two represented by a tree node known to be a
1466 tree_log2 (const_tree expr)
1469 HOST_WIDE_INT high, low;
1473 if (TREE_CODE (expr) == COMPLEX_CST)
1474 return tree_log2 (TREE_REALPART (expr));
1476 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1477 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1479 high = TREE_INT_CST_HIGH (expr);
1480 low = TREE_INT_CST_LOW (expr);
1482 /* First clear all bits that are beyond the type's precision in case
1483 we've been sign extended. */
1485 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1487 else if (prec > HOST_BITS_PER_WIDE_INT)
1488 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1492 if (prec < HOST_BITS_PER_WIDE_INT)
1493 low &= ~((HOST_WIDE_INT) (-1) << prec);
1496 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1497 : exact_log2 (low));
1500 /* Similar, but return the largest integer Y such that 2 ** Y is less
1501 than or equal to EXPR. */
1504 tree_floor_log2 (const_tree expr)
1507 HOST_WIDE_INT high, low;
1511 if (TREE_CODE (expr) == COMPLEX_CST)
1512 return tree_log2 (TREE_REALPART (expr));
1514 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1515 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1517 high = TREE_INT_CST_HIGH (expr);
1518 low = TREE_INT_CST_LOW (expr);
1520 /* First clear all bits that are beyond the type's precision in case
1521 we've been sign extended. Ignore if type's precision hasn't been set
1522 since what we are doing is setting it. */
1524 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1526 else if (prec > HOST_BITS_PER_WIDE_INT)
1527 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1531 if (prec < HOST_BITS_PER_WIDE_INT)
1532 low &= ~((HOST_WIDE_INT) (-1) << prec);
1535 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1536 : floor_log2 (low));
1539 /* Return 1 if EXPR is the real constant zero. */
1542 real_zerop (const_tree expr)
1546 return ((TREE_CODE (expr) == REAL_CST
1547 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1548 || (TREE_CODE (expr) == COMPLEX_CST
1549 && real_zerop (TREE_REALPART (expr))
1550 && real_zerop (TREE_IMAGPART (expr))));
1553 /* Return 1 if EXPR is the real constant one in real or complex form. */
1556 real_onep (const_tree expr)
1560 return ((TREE_CODE (expr) == REAL_CST
1561 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1562 || (TREE_CODE (expr) == COMPLEX_CST
1563 && real_onep (TREE_REALPART (expr))
1564 && real_zerop (TREE_IMAGPART (expr))));
1567 /* Return 1 if EXPR is the real constant two. */
1570 real_twop (const_tree expr)
1574 return ((TREE_CODE (expr) == REAL_CST
1575 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1576 || (TREE_CODE (expr) == COMPLEX_CST
1577 && real_twop (TREE_REALPART (expr))
1578 && real_zerop (TREE_IMAGPART (expr))));
1581 /* Return 1 if EXPR is the real constant minus one. */
1584 real_minus_onep (const_tree expr)
1588 return ((TREE_CODE (expr) == REAL_CST
1589 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1590 || (TREE_CODE (expr) == COMPLEX_CST
1591 && real_minus_onep (TREE_REALPART (expr))
1592 && real_zerop (TREE_IMAGPART (expr))));
1595 /* Nonzero if EXP is a constant or a cast of a constant. */
1598 really_constant_p (const_tree exp)
1600 /* This is not quite the same as STRIP_NOPS. It does more. */
1601 while (TREE_CODE (exp) == NOP_EXPR
1602 || TREE_CODE (exp) == CONVERT_EXPR
1603 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1604 exp = TREE_OPERAND (exp, 0);
1605 return TREE_CONSTANT (exp);
1608 /* Return first list element whose TREE_VALUE is ELEM.
1609 Return 0 if ELEM is not in LIST. */
1612 value_member (tree elem, tree list)
1616 if (elem == TREE_VALUE (list))
1618 list = TREE_CHAIN (list);
1623 /* Return first list element whose TREE_PURPOSE is ELEM.
1624 Return 0 if ELEM is not in LIST. */
1627 purpose_member (const_tree elem, tree list)
1631 if (elem == TREE_PURPOSE (list))
1633 list = TREE_CHAIN (list);
1638 /* Return nonzero if ELEM is part of the chain CHAIN. */
1641 chain_member (const_tree elem, const_tree chain)
1647 chain = TREE_CHAIN (chain);
1653 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1654 We expect a null pointer to mark the end of the chain.
1655 This is the Lisp primitive `length'. */
1658 list_length (const_tree t)
1661 #ifdef ENABLE_TREE_CHECKING
1669 #ifdef ENABLE_TREE_CHECKING
1672 gcc_assert (p != q);
1680 /* Returns the number of FIELD_DECLs in TYPE. */
1683 fields_length (const_tree type)
1685 tree t = TYPE_FIELDS (type);
1688 for (; t; t = TREE_CHAIN (t))
1689 if (TREE_CODE (t) == FIELD_DECL)
1695 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1696 by modifying the last node in chain 1 to point to chain 2.
1697 This is the Lisp primitive `nconc'. */
1700 chainon (tree op1, tree op2)
1709 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1711 TREE_CHAIN (t1) = op2;
1713 #ifdef ENABLE_TREE_CHECKING
1716 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1717 gcc_assert (t2 != t1);
1724 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1727 tree_last (tree chain)
1731 while ((next = TREE_CHAIN (chain)))
1736 /* Reverse the order of elements in the chain T,
1737 and return the new head of the chain (old last element). */
1742 tree prev = 0, decl, next;
1743 for (decl = t; decl; decl = next)
1745 next = TREE_CHAIN (decl);
1746 TREE_CHAIN (decl) = prev;
1752 /* Return a newly created TREE_LIST node whose
1753 purpose and value fields are PARM and VALUE. */
1756 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1758 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1759 TREE_PURPOSE (t) = parm;
1760 TREE_VALUE (t) = value;
1764 /* Return a newly created TREE_LIST node whose
1765 purpose and value fields are PURPOSE and VALUE
1766 and whose TREE_CHAIN is CHAIN. */
1769 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1773 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1775 memset (node, 0, sizeof (struct tree_common));
1777 #ifdef GATHER_STATISTICS
1778 tree_node_counts[(int) x_kind]++;
1779 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1782 TREE_SET_CODE (node, TREE_LIST);
1783 TREE_CHAIN (node) = chain;
1784 TREE_PURPOSE (node) = purpose;
1785 TREE_VALUE (node) = value;
1790 /* Return the size nominally occupied by an object of type TYPE
1791 when it resides in memory. The value is measured in units of bytes,
1792 and its data type is that normally used for type sizes
1793 (which is the first type created by make_signed_type or
1794 make_unsigned_type). */
1797 size_in_bytes (const_tree type)
1801 if (type == error_mark_node)
1802 return integer_zero_node;
1804 type = TYPE_MAIN_VARIANT (type);
1805 t = TYPE_SIZE_UNIT (type);
1809 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1810 return size_zero_node;
1816 /* Return the size of TYPE (in bytes) as a wide integer
1817 or return -1 if the size can vary or is larger than an integer. */
1820 int_size_in_bytes (const_tree type)
1824 if (type == error_mark_node)
1827 type = TYPE_MAIN_VARIANT (type);
1828 t = TYPE_SIZE_UNIT (type);
1830 || TREE_CODE (t) != INTEGER_CST
1831 || TREE_INT_CST_HIGH (t) != 0
1832 /* If the result would appear negative, it's too big to represent. */
1833 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1836 return TREE_INT_CST_LOW (t);
1839 /* Return the maximum size of TYPE (in bytes) as a wide integer
1840 or return -1 if the size can vary or is larger than an integer. */
1843 max_int_size_in_bytes (const_tree type)
1845 HOST_WIDE_INT size = -1;
1848 /* If this is an array type, check for a possible MAX_SIZE attached. */
1850 if (TREE_CODE (type) == ARRAY_TYPE)
1852 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1854 if (size_tree && host_integerp (size_tree, 1))
1855 size = tree_low_cst (size_tree, 1);
1858 /* If we still haven't been able to get a size, see if the language
1859 can compute a maximum size. */
1863 size_tree = lang_hooks.types.max_size (type);
1865 if (size_tree && host_integerp (size_tree, 1))
1866 size = tree_low_cst (size_tree, 1);
1872 /* Return the bit position of FIELD, in bits from the start of the record.
1873 This is a tree of type bitsizetype. */
1876 bit_position (const_tree field)
1878 return bit_from_pos (DECL_FIELD_OFFSET (field),
1879 DECL_FIELD_BIT_OFFSET (field));
1882 /* Likewise, but return as an integer. It must be representable in
1883 that way (since it could be a signed value, we don't have the
1884 option of returning -1 like int_size_in_byte can. */
1887 int_bit_position (const_tree field)
1889 return tree_low_cst (bit_position (field), 0);
1892 /* Return the byte position of FIELD, in bytes from the start of the record.
1893 This is a tree of type sizetype. */
1896 byte_position (const_tree field)
1898 return byte_from_pos (DECL_FIELD_OFFSET (field),
1899 DECL_FIELD_BIT_OFFSET (field));
1902 /* Likewise, but return as an integer. It must be representable in
1903 that way (since it could be a signed value, we don't have the
1904 option of returning -1 like int_size_in_byte can. */
1907 int_byte_position (const_tree field)
1909 return tree_low_cst (byte_position (field), 0);
1912 /* Return the strictest alignment, in bits, that T is known to have. */
1915 expr_align (const_tree t)
1917 unsigned int align0, align1;
1919 switch (TREE_CODE (t))
1921 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1922 /* If we have conversions, we know that the alignment of the
1923 object must meet each of the alignments of the types. */
1924 align0 = expr_align (TREE_OPERAND (t, 0));
1925 align1 = TYPE_ALIGN (TREE_TYPE (t));
1926 return MAX (align0, align1);
1928 case GIMPLE_MODIFY_STMT:
1929 /* We should never ask for the alignment of a gimple statement. */
1932 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1933 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1934 case CLEANUP_POINT_EXPR:
1935 /* These don't change the alignment of an object. */
1936 return expr_align (TREE_OPERAND (t, 0));
1939 /* The best we can do is say that the alignment is the least aligned
1941 align0 = expr_align (TREE_OPERAND (t, 1));
1942 align1 = expr_align (TREE_OPERAND (t, 2));
1943 return MIN (align0, align1);
1945 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
1946 meaningfully, it's always 1. */
1947 case LABEL_DECL: case CONST_DECL:
1948 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1950 gcc_assert (DECL_ALIGN (t) != 0);
1951 return DECL_ALIGN (t);
1957 /* Otherwise take the alignment from that of the type. */
1958 return TYPE_ALIGN (TREE_TYPE (t));
1961 /* Return, as a tree node, the number of elements for TYPE (which is an
1962 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1965 array_type_nelts (const_tree type)
1967 tree index_type, min, max;
1969 /* If they did it with unspecified bounds, then we should have already
1970 given an error about it before we got here. */
1971 if (! TYPE_DOMAIN (type))
1972 return error_mark_node;
1974 index_type = TYPE_DOMAIN (type);
1975 min = TYPE_MIN_VALUE (index_type);
1976 max = TYPE_MAX_VALUE (index_type);
1978 return (integer_zerop (min)
1980 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1983 /* If arg is static -- a reference to an object in static storage -- then
1984 return the object. This is not the same as the C meaning of `static'.
1985 If arg isn't static, return NULL. */
1990 switch (TREE_CODE (arg))
1993 /* Nested functions are static, even though taking their address will
1994 involve a trampoline as we unnest the nested function and create
1995 the trampoline on the tree level. */
1999 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2000 && ! DECL_THREAD_LOCAL_P (arg)
2001 && ! DECL_DLLIMPORT_P (arg)
2005 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2009 return TREE_STATIC (arg) ? arg : NULL;
2016 /* If the thing being referenced is not a field, then it is
2017 something language specific. */
2018 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
2019 return (*lang_hooks.staticp) (arg);
2021 /* If we are referencing a bitfield, we can't evaluate an
2022 ADDR_EXPR at compile time and so it isn't a constant. */
2023 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2026 return staticp (TREE_OPERAND (arg, 0));
2031 case MISALIGNED_INDIRECT_REF:
2032 case ALIGN_INDIRECT_REF:
2034 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2037 case ARRAY_RANGE_REF:
2038 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2039 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2040 return staticp (TREE_OPERAND (arg, 0));
2045 if ((unsigned int) TREE_CODE (arg)
2046 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2047 return lang_hooks.staticp (arg);
2056 /* Return whether OP is a DECL whose address is function-invariant. */
2059 decl_address_invariant_p (const_tree op)
2061 /* The conditions below are slightly less strict than the one in
2064 switch (TREE_CODE (op))
2073 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2074 && !DECL_DLLIMPORT_P (op))
2075 || DECL_THREAD_LOCAL_P (op)
2076 || DECL_CONTEXT (op) == current_function_decl
2077 || decl_function_context (op) == current_function_decl)
2082 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2083 || decl_function_context (op) == current_function_decl)
2095 /* Return true if T is function-invariant (internal function, does
2096 not handle arithmetic; that's handled in skip_simple_arithmetic and
2097 tree_invariant_p). */
2099 static bool tree_invariant_p (tree t);
2102 tree_invariant_p_1 (tree t)
2106 if (TREE_CONSTANT (t)
2107 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2110 switch (TREE_CODE (t))
2116 op = TREE_OPERAND (t, 0);
2117 while (handled_component_p (op))
2119 switch (TREE_CODE (op))
2122 case ARRAY_RANGE_REF:
2123 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2124 || TREE_OPERAND (op, 2) != NULL_TREE
2125 || TREE_OPERAND (op, 3) != NULL_TREE)
2130 if (TREE_OPERAND (op, 2) != NULL_TREE)
2136 op = TREE_OPERAND (op, 0);
2139 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2148 /* Return true if T is function-invariant. */
2151 tree_invariant_p (tree t)
2153 tree inner = skip_simple_arithmetic (t);
2154 return tree_invariant_p_1 (inner);
2157 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2158 Do this to any expression which may be used in more than one place,
2159 but must be evaluated only once.
2161 Normally, expand_expr would reevaluate the expression each time.
2162 Calling save_expr produces something that is evaluated and recorded
2163 the first time expand_expr is called on it. Subsequent calls to
2164 expand_expr just reuse the recorded value.
2166 The call to expand_expr that generates code that actually computes
2167 the value is the first call *at compile time*. Subsequent calls
2168 *at compile time* generate code to use the saved value.
2169 This produces correct result provided that *at run time* control
2170 always flows through the insns made by the first expand_expr
2171 before reaching the other places where the save_expr was evaluated.
2172 You, the caller of save_expr, must make sure this is so.
2174 Constants, and certain read-only nodes, are returned with no
2175 SAVE_EXPR because that is safe. Expressions containing placeholders
2176 are not touched; see tree.def for an explanation of what these
2180 save_expr (tree expr)
2182 tree t = fold (expr);
2185 /* If the tree evaluates to a constant, then we don't want to hide that
2186 fact (i.e. this allows further folding, and direct checks for constants).
2187 However, a read-only object that has side effects cannot be bypassed.
2188 Since it is no problem to reevaluate literals, we just return the
2190 inner = skip_simple_arithmetic (t);
2191 if (TREE_CODE (inner) == ERROR_MARK)
2194 if (tree_invariant_p_1 (inner))
2197 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2198 it means that the size or offset of some field of an object depends on
2199 the value within another field.
2201 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2202 and some variable since it would then need to be both evaluated once and
2203 evaluated more than once. Front-ends must assure this case cannot
2204 happen by surrounding any such subexpressions in their own SAVE_EXPR
2205 and forcing evaluation at the proper time. */
2206 if (contains_placeholder_p (inner))
2209 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2211 /* This expression might be placed ahead of a jump to ensure that the
2212 value was computed on both sides of the jump. So make sure it isn't
2213 eliminated as dead. */
2214 TREE_SIDE_EFFECTS (t) = 1;
2218 /* Look inside EXPR and into any simple arithmetic operations. Return
2219 the innermost non-arithmetic node. */
2222 skip_simple_arithmetic (tree expr)
2226 /* We don't care about whether this can be used as an lvalue in this
2228 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2229 expr = TREE_OPERAND (expr, 0);
2231 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2232 a constant, it will be more efficient to not make another SAVE_EXPR since
2233 it will allow better simplification and GCSE will be able to merge the
2234 computations if they actually occur. */
2238 if (UNARY_CLASS_P (inner))
2239 inner = TREE_OPERAND (inner, 0);
2240 else if (BINARY_CLASS_P (inner))
2242 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2243 inner = TREE_OPERAND (inner, 0);
2244 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2245 inner = TREE_OPERAND (inner, 1);
2256 /* Return which tree structure is used by T. */
2258 enum tree_node_structure_enum
2259 tree_node_structure (const_tree t)
2261 const enum tree_code code = TREE_CODE (t);
2263 switch (TREE_CODE_CLASS (code))
2265 case tcc_declaration:
2270 return TS_FIELD_DECL;
2272 return TS_PARM_DECL;
2276 return TS_LABEL_DECL;
2278 return TS_RESULT_DECL;
2280 return TS_CONST_DECL;
2282 return TS_TYPE_DECL;
2284 return TS_FUNCTION_DECL;
2285 case SYMBOL_MEMORY_TAG:
2286 case NAME_MEMORY_TAG:
2287 case MEMORY_PARTITION_TAG:
2288 return TS_MEMORY_TAG;
2290 return TS_DECL_NON_COMMON;
2296 case tcc_comparison:
2299 case tcc_expression:
2303 case tcc_gimple_stmt:
2304 return TS_GIMPLE_STATEMENT;
2305 default: /* tcc_constant and tcc_exceptional */
2310 /* tcc_constant cases. */
2311 case INTEGER_CST: return TS_INT_CST;
2312 case REAL_CST: return TS_REAL_CST;
2313 case FIXED_CST: return TS_FIXED_CST;
2314 case COMPLEX_CST: return TS_COMPLEX;
2315 case VECTOR_CST: return TS_VECTOR;
2316 case STRING_CST: return TS_STRING;
2317 /* tcc_exceptional cases. */
2318 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2320 case ERROR_MARK: return TS_COMMON;
2321 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2322 case TREE_LIST: return TS_LIST;
2323 case TREE_VEC: return TS_VEC;
2324 case PHI_NODE: return TS_PHI_NODE;
2325 case SSA_NAME: return TS_SSA_NAME;
2326 case PLACEHOLDER_EXPR: return TS_COMMON;
2327 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2328 case BLOCK: return TS_BLOCK;
2329 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2330 case TREE_BINFO: return TS_BINFO;
2331 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2332 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2339 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2340 or offset that depends on a field within a record. */
2343 contains_placeholder_p (const_tree exp)
2345 enum tree_code code;
2350 code = TREE_CODE (exp);
2351 if (code == PLACEHOLDER_EXPR)
2354 switch (TREE_CODE_CLASS (code))
2357 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2358 position computations since they will be converted into a
2359 WITH_RECORD_EXPR involving the reference, which will assume
2360 here will be valid. */
2361 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2363 case tcc_exceptional:
2364 if (code == TREE_LIST)
2365 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2366 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2371 case tcc_comparison:
2372 case tcc_expression:
2376 /* Ignoring the first operand isn't quite right, but works best. */
2377 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2380 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2381 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2382 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2388 switch (TREE_CODE_LENGTH (code))
2391 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2393 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2394 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2405 const_call_expr_arg_iterator iter;
2406 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2407 if (CONTAINS_PLACEHOLDER_P (arg))
2421 /* Return true if any part of the computation of TYPE involves a
2422 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2423 (for QUAL_UNION_TYPE) and field positions. */
2426 type_contains_placeholder_1 (const_tree type)
2428 /* If the size contains a placeholder or the parent type (component type in
2429 the case of arrays) type involves a placeholder, this type does. */
2430 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2431 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2432 || (TREE_TYPE (type) != 0
2433 && type_contains_placeholder_p (TREE_TYPE (type))))
2436 /* Now do type-specific checks. Note that the last part of the check above
2437 greatly limits what we have to do below. */
2438 switch (TREE_CODE (type))
2446 case REFERENCE_TYPE:
2454 case FIXED_POINT_TYPE:
2455 /* Here we just check the bounds. */
2456 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2457 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2460 /* We're already checked the component type (TREE_TYPE), so just check
2462 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2466 case QUAL_UNION_TYPE:
2470 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2471 if (TREE_CODE (field) == FIELD_DECL
2472 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2473 || (TREE_CODE (type) == QUAL_UNION_TYPE
2474 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2475 || type_contains_placeholder_p (TREE_TYPE (field))))
2487 type_contains_placeholder_p (tree type)
2491 /* If the contains_placeholder_bits field has been initialized,
2492 then we know the answer. */
2493 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2494 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2496 /* Indicate that we've seen this type node, and the answer is false.
2497 This is what we want to return if we run into recursion via fields. */
2498 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2500 /* Compute the real value. */
2501 result = type_contains_placeholder_1 (type);
2503 /* Store the real value. */
2504 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2509 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2510 return a tree with all occurrences of references to F in a
2511 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2512 contains only arithmetic expressions or a CALL_EXPR with a
2513 PLACEHOLDER_EXPR occurring only in its arglist. */
2516 substitute_in_expr (tree exp, tree f, tree r)
2518 enum tree_code code = TREE_CODE (exp);
2519 tree op0, op1, op2, op3;
2523 /* We handle TREE_LIST and COMPONENT_REF separately. */
2524 if (code == TREE_LIST)
2526 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2527 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2528 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2531 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2533 else if (code == COMPONENT_REF)
2535 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2536 and it is the right field, replace it with R. */
2537 for (inner = TREE_OPERAND (exp, 0);
2538 REFERENCE_CLASS_P (inner);
2539 inner = TREE_OPERAND (inner, 0))
2541 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2542 && TREE_OPERAND (exp, 1) == f)
2545 /* If this expression hasn't been completed let, leave it alone. */
2546 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2549 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2550 if (op0 == TREE_OPERAND (exp, 0))
2553 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2554 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2557 switch (TREE_CODE_CLASS (code))
2560 case tcc_declaration:
2563 case tcc_exceptional:
2566 case tcc_comparison:
2567 case tcc_expression:
2569 switch (TREE_CODE_LENGTH (code))
2575 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2576 if (op0 == TREE_OPERAND (exp, 0))
2579 new = fold_build1 (code, TREE_TYPE (exp), op0);
2583 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2584 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2586 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2589 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2593 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2594 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2595 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2597 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2598 && op2 == TREE_OPERAND (exp, 2))
2601 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2605 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2606 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2607 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2608 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2610 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2611 && op2 == TREE_OPERAND (exp, 2)
2612 && op3 == TREE_OPERAND (exp, 3))
2615 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2625 tree copy = NULL_TREE;
2628 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2630 tree op = TREE_OPERAND (exp, i);
2631 tree newop = SUBSTITUTE_IN_EXPR (op, f, r);
2634 copy = copy_node (exp);
2635 TREE_OPERAND (copy, i) = newop;
2649 TREE_READONLY (new) = TREE_READONLY (exp);
2653 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2654 for it within OBJ, a tree that is an object or a chain of references. */
2657 substitute_placeholder_in_expr (tree exp, tree obj)
2659 enum tree_code code = TREE_CODE (exp);
2660 tree op0, op1, op2, op3;
2662 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2663 in the chain of OBJ. */
2664 if (code == PLACEHOLDER_EXPR)
2666 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2669 for (elt = obj; elt != 0;
2670 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2671 || TREE_CODE (elt) == COND_EXPR)
2672 ? TREE_OPERAND (elt, 1)
2673 : (REFERENCE_CLASS_P (elt)
2674 || UNARY_CLASS_P (elt)
2675 || BINARY_CLASS_P (elt)
2676 || VL_EXP_CLASS_P (elt)
2677 || EXPRESSION_CLASS_P (elt))
2678 ? TREE_OPERAND (elt, 0) : 0))
2679 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2682 for (elt = obj; elt != 0;
2683 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2684 || TREE_CODE (elt) == COND_EXPR)
2685 ? TREE_OPERAND (elt, 1)
2686 : (REFERENCE_CLASS_P (elt)
2687 || UNARY_CLASS_P (elt)
2688 || BINARY_CLASS_P (elt)
2689 || VL_EXP_CLASS_P (elt)
2690 || EXPRESSION_CLASS_P (elt))
2691 ? TREE_OPERAND (elt, 0) : 0))
2692 if (POINTER_TYPE_P (TREE_TYPE (elt))
2693 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2695 return fold_build1 (INDIRECT_REF, need_type, elt);
2697 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2698 survives until RTL generation, there will be an error. */
2702 /* TREE_LIST is special because we need to look at TREE_VALUE
2703 and TREE_CHAIN, not TREE_OPERANDS. */
2704 else if (code == TREE_LIST)
2706 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2707 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2708 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2711 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2714 switch (TREE_CODE_CLASS (code))
2717 case tcc_declaration:
2720 case tcc_exceptional:
2723 case tcc_comparison:
2724 case tcc_expression:
2727 switch (TREE_CODE_LENGTH (code))
2733 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2734 if (op0 == TREE_OPERAND (exp, 0))
2737 return fold_build1 (code, TREE_TYPE (exp), op0);
2740 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2741 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2743 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2746 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2749 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2750 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2751 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2753 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2754 && op2 == TREE_OPERAND (exp, 2))
2757 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2760 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2761 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2762 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2763 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2765 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2766 && op2 == TREE_OPERAND (exp, 2)
2767 && op3 == TREE_OPERAND (exp, 3))
2770 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2779 tree copy = NULL_TREE;
2781 int n = TREE_OPERAND_LENGTH (exp);
2782 for (i = 1; i < n; i++)
2784 tree op = TREE_OPERAND (exp, i);
2785 tree newop = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2789 copy = copy_node (exp);
2790 TREE_OPERAND (copy, i) = newop;
2804 /* Stabilize a reference so that we can use it any number of times
2805 without causing its operands to be evaluated more than once.
2806 Returns the stabilized reference. This works by means of save_expr,
2807 so see the caveats in the comments about save_expr.
2809 Also allows conversion expressions whose operands are references.
2810 Any other kind of expression is returned unchanged. */
2813 stabilize_reference (tree ref)
2816 enum tree_code code = TREE_CODE (ref);
2823 /* No action is needed in this case. */
2829 case FIX_TRUNC_EXPR:
2830 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2834 result = build_nt (INDIRECT_REF,
2835 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2839 result = build_nt (COMPONENT_REF,
2840 stabilize_reference (TREE_OPERAND (ref, 0)),
2841 TREE_OPERAND (ref, 1), NULL_TREE);
2845 result = build_nt (BIT_FIELD_REF,
2846 stabilize_reference (TREE_OPERAND (ref, 0)),
2847 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2848 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2852 result = build_nt (ARRAY_REF,
2853 stabilize_reference (TREE_OPERAND (ref, 0)),
2854 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2855 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2858 case ARRAY_RANGE_REF:
2859 result = build_nt (ARRAY_RANGE_REF,
2860 stabilize_reference (TREE_OPERAND (ref, 0)),
2861 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2862 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2866 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2867 it wouldn't be ignored. This matters when dealing with
2869 return stabilize_reference_1 (ref);
2871 /* If arg isn't a kind of lvalue we recognize, make no change.
2872 Caller should recognize the error for an invalid lvalue. */
2877 return error_mark_node;
2880 TREE_TYPE (result) = TREE_TYPE (ref);
2881 TREE_READONLY (result) = TREE_READONLY (ref);
2882 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2883 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2888 /* Subroutine of stabilize_reference; this is called for subtrees of
2889 references. Any expression with side-effects must be put in a SAVE_EXPR
2890 to ensure that it is only evaluated once.
2892 We don't put SAVE_EXPR nodes around everything, because assigning very
2893 simple expressions to temporaries causes us to miss good opportunities
2894 for optimizations. Among other things, the opportunity to fold in the
2895 addition of a constant into an addressing mode often gets lost, e.g.
2896 "y[i+1] += x;". In general, we take the approach that we should not make
2897 an assignment unless we are forced into it - i.e., that any non-side effect
2898 operator should be allowed, and that cse should take care of coalescing
2899 multiple utterances of the same expression should that prove fruitful. */
2902 stabilize_reference_1 (tree e)
2905 enum tree_code code = TREE_CODE (e);
2907 /* We cannot ignore const expressions because it might be a reference
2908 to a const array but whose index contains side-effects. But we can
2909 ignore things that are actual constant or that already have been
2910 handled by this function. */
2912 if (tree_invariant_p (e))
2915 switch (TREE_CODE_CLASS (code))
2917 case tcc_exceptional:
2919 case tcc_declaration:
2920 case tcc_comparison:
2922 case tcc_expression:
2925 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2926 so that it will only be evaluated once. */
2927 /* The reference (r) and comparison (<) classes could be handled as
2928 below, but it is generally faster to only evaluate them once. */
2929 if (TREE_SIDE_EFFECTS (e))
2930 return save_expr (e);
2934 /* Constants need no processing. In fact, we should never reach
2939 /* Division is slow and tends to be compiled with jumps,
2940 especially the division by powers of 2 that is often
2941 found inside of an array reference. So do it just once. */
2942 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2943 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2944 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2945 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2946 return save_expr (e);
2947 /* Recursively stabilize each operand. */
2948 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2949 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2953 /* Recursively stabilize each operand. */
2954 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2961 TREE_TYPE (result) = TREE_TYPE (e);
2962 TREE_READONLY (result) = TREE_READONLY (e);
2963 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2964 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2969 /* Low-level constructors for expressions. */
2971 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2972 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2975 recompute_tree_invariant_for_addr_expr (tree t)
2978 bool tc = true, se = false;
2980 /* We started out assuming this address is both invariant and constant, but
2981 does not have side effects. Now go down any handled components and see if
2982 any of them involve offsets that are either non-constant or non-invariant.
2983 Also check for side-effects.
2985 ??? Note that this code makes no attempt to deal with the case where
2986 taking the address of something causes a copy due to misalignment. */
2988 #define UPDATE_FLAGS(NODE) \
2989 do { tree _node = (NODE); \
2990 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2991 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2993 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2994 node = TREE_OPERAND (node, 0))
2996 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2997 array reference (probably made temporarily by the G++ front end),
2998 so ignore all the operands. */
2999 if ((TREE_CODE (node) == ARRAY_REF
3000 || TREE_CODE (node) == ARRAY_RANGE_REF)
3001 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3003 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3004 if (TREE_OPERAND (node, 2))
3005 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3006 if (TREE_OPERAND (node, 3))
3007 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3009 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3010 FIELD_DECL, apparently. The G++ front end can put something else
3011 there, at least temporarily. */
3012 else if (TREE_CODE (node) == COMPONENT_REF
3013 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3015 if (TREE_OPERAND (node, 2))
3016 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3018 else if (TREE_CODE (node) == BIT_FIELD_REF)
3019 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3022 node = lang_hooks.expr_to_decl (node, &tc, &se);
3024 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3025 the address, since &(*a)->b is a form of addition. If it's a constant, the
3026 address is constant too. If it's a decl, its address is constant if the
3027 decl is static. Everything else is not constant and, furthermore,
3028 taking the address of a volatile variable is not volatile. */
3029 if (TREE_CODE (node) == INDIRECT_REF)
3030 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3031 else if (CONSTANT_CLASS_P (node))
3033 else if (DECL_P (node))
3034 tc &= (staticp (node) != NULL_TREE);
3038 se |= TREE_SIDE_EFFECTS (node);
3042 TREE_CONSTANT (t) = tc;
3043 TREE_SIDE_EFFECTS (t) = se;
3047 /* Build an expression of code CODE, data type TYPE, and operands as
3048 specified. Expressions and reference nodes can be created this way.
3049 Constants, decls, types and misc nodes cannot be.
3051 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3052 enough for all extant tree codes. */
3055 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3059 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3061 t = make_node_stat (code PASS_MEM_STAT);
3068 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3070 int length = sizeof (struct tree_exp);
3071 #ifdef GATHER_STATISTICS
3072 tree_node_kind kind;
3076 #ifdef GATHER_STATISTICS
3077 switch (TREE_CODE_CLASS (code))
3079 case tcc_statement: /* an expression with side effects */
3082 case tcc_reference: /* a reference */
3090 tree_node_counts[(int) kind]++;
3091 tree_node_sizes[(int) kind] += length;
3094 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3096 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
3098 memset (t, 0, sizeof (struct tree_common));
3100 TREE_SET_CODE (t, code);
3102 TREE_TYPE (t) = type;
3103 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3104 TREE_OPERAND (t, 0) = node;
3105 TREE_BLOCK (t) = NULL_TREE;
3106 if (node && !TYPE_P (node))
3108 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3109 TREE_READONLY (t) = TREE_READONLY (node);
3112 if (TREE_CODE_CLASS (code) == tcc_statement)
3113 TREE_SIDE_EFFECTS (t) = 1;
3117 /* All of these have side-effects, no matter what their
3119 TREE_SIDE_EFFECTS (t) = 1;
3120 TREE_READONLY (t) = 0;
3123 case MISALIGNED_INDIRECT_REF:
3124 case ALIGN_INDIRECT_REF:
3126 /* Whether a dereference is readonly has nothing to do with whether
3127 its operand is readonly. */
3128 TREE_READONLY (t) = 0;
3133 recompute_tree_invariant_for_addr_expr (t);
3137 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3138 && node && !TYPE_P (node)
3139 && TREE_CONSTANT (node))
3140 TREE_CONSTANT (t) = 1;
3141 if (TREE_CODE_CLASS (code) == tcc_reference
3142 && node && TREE_THIS_VOLATILE (node))
3143 TREE_THIS_VOLATILE (t) = 1;
3150 #define PROCESS_ARG(N) \
3152 TREE_OPERAND (t, N) = arg##N; \
3153 if (arg##N &&!TYPE_P (arg##N)) \
3155 if (TREE_SIDE_EFFECTS (arg##N)) \
3157 if (!TREE_READONLY (arg##N)) \
3159 if (!TREE_CONSTANT (arg##N)) \
3165 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3167 bool constant, read_only, side_effects;
3170 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3173 /* FIXME tuples: Statement's aren't expressions! */
3174 if (code == GIMPLE_MODIFY_STMT)
3175 return build_gimple_modify_stmt_stat (arg0, arg1 PASS_MEM_STAT);
3177 /* Must use build_gimple_modify_stmt to construct GIMPLE_MODIFY_STMTs. */
3178 gcc_assert (code != GIMPLE_MODIFY_STMT);
3181 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3182 && arg0 && arg1 && tt && POINTER_TYPE_P (tt))
3183 gcc_assert (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST);
3185 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3186 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3187 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3188 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3190 t = make_node_stat (code PASS_MEM_STAT);
3193 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3194 result based on those same flags for the arguments. But if the
3195 arguments aren't really even `tree' expressions, we shouldn't be trying
3198 /* Expressions without side effects may be constant if their
3199 arguments are as well. */
3200 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3201 || TREE_CODE_CLASS (code) == tcc_binary);
3203 side_effects = TREE_SIDE_EFFECTS (t);
3208 TREE_READONLY (t) = read_only;
3209 TREE_CONSTANT (t) = constant;
3210 TREE_SIDE_EFFECTS (t) = side_effects;
3211 TREE_THIS_VOLATILE (t)
3212 = (TREE_CODE_CLASS (code) == tcc_reference
3213 && arg0 && TREE_THIS_VOLATILE (arg0));
3219 /* Build a GIMPLE_MODIFY_STMT node. This tree code doesn't have a
3220 type, so we can't use build2 (a.k.a. build2_stat). */
3223 build_gimple_modify_stmt_stat (tree arg0, tree arg1 MEM_STAT_DECL)
3227 t = make_node_stat (GIMPLE_MODIFY_STMT PASS_MEM_STAT);
3228 /* ?? We don't care about setting flags for tuples... */
3229 GIMPLE_STMT_OPERAND (t, 0) = arg0;
3230 GIMPLE_STMT_OPERAND (t, 1) = arg1;
3235 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3236 tree arg2 MEM_STAT_DECL)
3238 bool constant, read_only, side_effects;
3241 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3242 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3244 t = make_node_stat (code PASS_MEM_STAT);
3247 /* As a special exception, if COND_EXPR has NULL branches, we
3248 assume that it is a gimple statement and always consider
3249 it to have side effects. */
3250 if (code == COND_EXPR
3251 && tt == void_type_node
3252 && arg1 == NULL_TREE
3253 && arg2 == NULL_TREE)
3254 side_effects = true;
3256 side_effects = TREE_SIDE_EFFECTS (t);
3262 TREE_SIDE_EFFECTS (t) = side_effects;
3263 TREE_THIS_VOLATILE (t)
3264 = (TREE_CODE_CLASS (code) == tcc_reference
3265 && arg0 && TREE_THIS_VOLATILE (arg0));
3271 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3272 tree arg2, tree arg3 MEM_STAT_DECL)
3274 bool constant, read_only, side_effects;
3277 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3279 t = make_node_stat (code PASS_MEM_STAT);
3282 side_effects = TREE_SIDE_EFFECTS (t);
3289 TREE_SIDE_EFFECTS (t) = side_effects;
3290 TREE_THIS_VOLATILE (t)
3291 = (TREE_CODE_CLASS (code) == tcc_reference
3292 && arg0 && TREE_THIS_VOLATILE (arg0));
3298 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3299 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3301 bool constant, read_only, side_effects;
3304 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3306 t = make_node_stat (code PASS_MEM_STAT);
3309 side_effects = TREE_SIDE_EFFECTS (t);
3317 TREE_SIDE_EFFECTS (t) = side_effects;
3318 TREE_THIS_VOLATILE (t)
3319 = (TREE_CODE_CLASS (code) == tcc_reference
3320 && arg0 && TREE_THIS_VOLATILE (arg0));
3326 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3327 tree arg2, tree arg3, tree arg4, tree arg5,
3328 tree arg6 MEM_STAT_DECL)
3330 bool constant, read_only, side_effects;
3333 gcc_assert (code == TARGET_MEM_REF);
3335 t = make_node_stat (code PASS_MEM_STAT);
3338 side_effects = TREE_SIDE_EFFECTS (t);
3348 TREE_SIDE_EFFECTS (t) = side_effects;
3349 TREE_THIS_VOLATILE (t) = 0;
3354 /* Similar except don't specify the TREE_TYPE
3355 and leave the TREE_SIDE_EFFECTS as 0.
3356 It is permissible for arguments to be null,
3357 or even garbage if their values do not matter. */
3360 build_nt (enum tree_code code, ...)
3367 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3371 t = make_node (code);
3372 length = TREE_CODE_LENGTH (code);
3374 for (i = 0; i < length; i++)
3375 TREE_OPERAND (t, i) = va_arg (p, tree);
3381 /* Similar to build_nt, but for creating a CALL_EXPR object with
3382 ARGLIST passed as a list. */
3385 build_nt_call_list (tree fn, tree arglist)
3390 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3391 CALL_EXPR_FN (t) = fn;
3392 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3393 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3394 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3398 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3399 We do NOT enter this node in any sort of symbol table.
3401 layout_decl is used to set up the decl's storage layout.
3402 Other slots are initialized to 0 or null pointers. */
3405 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3409 t = make_node_stat (code PASS_MEM_STAT);
3411 /* if (type == error_mark_node)
3412 type = integer_type_node; */
3413 /* That is not done, deliberately, so that having error_mark_node
3414 as the type can suppress useless errors in the use of this variable. */
3416 DECL_NAME (t) = name;
3417 TREE_TYPE (t) = type;
3419 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3425 /* Builds and returns function declaration with NAME and TYPE. */
3428 build_fn_decl (const char *name, tree type)
3430 tree id = get_identifier (name);
3431 tree decl = build_decl (FUNCTION_DECL, id, type);
3433 DECL_EXTERNAL (decl) = 1;
3434 TREE_PUBLIC (decl) = 1;
3435 DECL_ARTIFICIAL (decl) = 1;
3436 TREE_NOTHROW (decl) = 1;
3442 /* BLOCK nodes are used to represent the structure of binding contours
3443 and declarations, once those contours have been exited and their contents
3444 compiled. This information is used for outputting debugging info. */
3447 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3449 tree block = make_node (BLOCK);
3451 BLOCK_VARS (block) = vars;
3452 BLOCK_SUBBLOCKS (block) = subblocks;
3453 BLOCK_SUPERCONTEXT (block) = supercontext;
3454 BLOCK_CHAIN (block) = chain;
3459 expand_location (source_location loc)
3461 expanded_location xloc;
3470 const struct line_map *map = linemap_lookup (line_table, loc);
3471 xloc.file = map->to_file;
3472 xloc.line = SOURCE_LINE (map, loc);
3473 xloc.column = SOURCE_COLUMN (map, loc);
3479 /* Source location accessor functions. */
3482 /* The source location of this expression. Non-tree_exp nodes such as
3483 decls and constants can be shared among multiple locations, so
3486 expr_location (const_tree node)
3488 if (GIMPLE_STMT_P (node))
3489 return GIMPLE_STMT_LOCUS (node);
3490 return EXPR_P (node) ? node->exp.locus : UNKNOWN_LOCATION;
3494 set_expr_location (tree node, location_t locus)
3496 if (GIMPLE_STMT_P (node))
3497 GIMPLE_STMT_LOCUS (node) = locus;
3499 EXPR_CHECK (node)->exp.locus = locus;
3503 expr_has_location (const_tree node)
3505 return expr_location (node) != UNKNOWN_LOCATION;
3509 expr_locus (const_tree node)
3511 if (GIMPLE_STMT_P (node))
3512 return CONST_CAST (source_location *, &GIMPLE_STMT_LOCUS (node));
3513 return (EXPR_P (node)
3514 ? CONST_CAST (source_location *, &node->exp.locus)
3515 : (source_location *) NULL);
3519 set_expr_locus (tree node, source_location *loc)
3523 if (GIMPLE_STMT_P (node))
3524 GIMPLE_STMT_LOCUS (node) = UNKNOWN_LOCATION;
3526 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3530 if (GIMPLE_STMT_P (node))
3531 GIMPLE_STMT_LOCUS (node) = *loc;
3533 EXPR_CHECK (node)->exp.locus = *loc;
3537 /* Return the file name of the location of NODE. */
3539 expr_filename (const_tree node)
3541 if (GIMPLE_STMT_P (node))
3542 return LOCATION_FILE (GIMPLE_STMT_LOCUS (node));
3543 return LOCATION_FILE (EXPR_CHECK (node)->exp.locus);
3546 /* Return the line number of the location of NODE. */
3548 expr_lineno (const_tree node)
3550 if (GIMPLE_STMT_P (node))
3551 return LOCATION_LINE (GIMPLE_STMT_LOCUS (node));
3552 return LOCATION_LINE (EXPR_CHECK (node)->exp.locus);
3556 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3560 build_decl_attribute_variant (tree ddecl, tree attribute)
3562 DECL_ATTRIBUTES (ddecl) = attribute;
3566 /* Borrowed from hashtab.c iterative_hash implementation. */
3567 #define mix(a,b,c) \
3569 a -= b; a -= c; a ^= (c>>13); \
3570 b -= c; b -= a; b ^= (a<< 8); \
3571 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3572 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3573 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3574 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3575 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3576 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3577 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3581 /* Produce good hash value combining VAL and VAL2. */
3582 static inline hashval_t
3583 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3585 /* the golden ratio; an arbitrary value. */
3586 hashval_t a = 0x9e3779b9;
3592 /* Produce good hash value combining PTR and VAL2. */
3593 static inline hashval_t
3594 iterative_hash_pointer (const void *ptr, hashval_t val2)
3596 if (sizeof (ptr) == sizeof (hashval_t))
3597 return iterative_hash_hashval_t ((size_t) ptr, val2);
3600 hashval_t a = (hashval_t) (size_t) ptr;
3601 /* Avoid warnings about shifting of more than the width of the type on
3602 hosts that won't execute this path. */
3604 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3610 /* Produce good hash value combining VAL and VAL2. */
3611 static inline hashval_t
3612 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3614 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3615 return iterative_hash_hashval_t (val, val2);
3618 hashval_t a = (hashval_t) val;
3619 /* Avoid warnings about shifting of more than the width of the type on
3620 hosts that won't execute this path. */
3622 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3624 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3626 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3627 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3634 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3635 is ATTRIBUTE and its qualifiers are QUALS.
3637 Record such modified types already made so we don't make duplicates. */
3640 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3642 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3644 hashval_t hashcode = 0;
3646 enum tree_code code = TREE_CODE (ttype);
3648 /* Building a distinct copy of a tagged type is inappropriate; it
3649 causes breakage in code that expects there to be a one-to-one
3650 relationship between a struct and its fields.
3651 build_duplicate_type is another solution (as used in
3652 handle_transparent_union_attribute), but that doesn't play well
3653 with the stronger C++ type identity model. */
3654 if (TREE_CODE (ttype) == RECORD_TYPE
3655 || TREE_CODE (ttype) == UNION_TYPE
3656 || TREE_CODE (ttype) == QUAL_UNION_TYPE
3657 || TREE_CODE (ttype) == ENUMERAL_TYPE)
3659 warning (OPT_Wattributes,
3660 "ignoring attributes applied to %qT after definition",
3661 TYPE_MAIN_VARIANT (ttype));
3662 return build_qualified_type (ttype, quals);
3665 ntype = build_distinct_type_copy (ttype);
3667 TYPE_ATTRIBUTES (ntype) = attribute;
3668 set_type_quals (ntype, TYPE_UNQUALIFIED);
3670 hashcode = iterative_hash_object (code, hashcode);
3671 if (TREE_TYPE (ntype))
3672 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3674 hashcode = attribute_hash_list (attribute, hashcode);
3676 switch (TREE_CODE (ntype))
3679 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3682 if (TYPE_DOMAIN (ntype))
3683 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3687 hashcode = iterative_hash_object
3688 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3689 hashcode = iterative_hash_object
3690 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3693 case FIXED_POINT_TYPE:
3695 unsigned int precision = TYPE_PRECISION (ntype);
3696 hashcode = iterative_hash_object (precision, hashcode);
3703 ntype = type_hash_canon (hashcode, ntype);
3705 /* If the target-dependent attributes make NTYPE different from
3706 its canonical type, we will need to use structural equality
3707 checks for this qualified type. */
3708 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
3709 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
3710 || !targetm.comp_type_attributes (ntype, ttype))
3711 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3713 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
3715 ttype = build_qualified_type (ntype, quals);
3717 else if (TYPE_QUALS (ttype) != quals)
3718 ttype = build_qualified_type (ttype, quals);
3724 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3727 Record such modified types already made so we don't make duplicates. */
3730 build_type_attribute_variant (tree ttype, tree attribute)
3732 return build_type_attribute_qual_variant (ttype, attribute,
3733 TYPE_QUALS (ttype));
3736 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3739 We try both `text' and `__text__', ATTR may be either one. */
3740 /* ??? It might be a reasonable simplification to require ATTR to be only
3741 `text'. One might then also require attribute lists to be stored in
3742 their canonicalized form. */
3745 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
3750 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3753 p = IDENTIFIER_POINTER (ident);
3754 ident_len = IDENTIFIER_LENGTH (ident);
3756 if (ident_len == attr_len
3757 && strcmp (attr, p) == 0)
3760 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3763 gcc_assert (attr[1] == '_');
3764 gcc_assert (attr[attr_len - 2] == '_');
3765 gcc_assert (attr[attr_len - 1] == '_');
3766 if (ident_len == attr_len - 4
3767 && strncmp (attr + 2, p, attr_len - 4) == 0)
3772 if (ident_len == attr_len + 4
3773 && p[0] == '_' && p[1] == '_'
3774 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3775 && strncmp (attr, p + 2, attr_len) == 0)
3782 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3785 We try both `text' and `__text__', ATTR may be either one. */
3788 is_attribute_p (const char *attr, const_tree ident)
3790 return is_attribute_with_length_p (attr, strlen (attr), ident);
3793 /* Given an attribute name and a list of attributes, return a pointer to the
3794 attribute's list element if the attribute is part of the list, or NULL_TREE
3795 if not found. If the attribute appears more than once, this only
3796 returns the first occurrence; the TREE_CHAIN of the return value should
3797 be passed back in if further occurrences are wanted. */
3800 lookup_attribute (const char *attr_name, tree list)
3803 size_t attr_len = strlen (attr_name);
3805 for (l = list; l; l = TREE_CHAIN (l))
3807 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3808 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3814 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3818 remove_attribute (const char *attr_name, tree list)
3821 size_t attr_len = strlen (attr_name);
3823 for (p = &list; *p; )
3826 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3827 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3828 *p = TREE_CHAIN (l);
3830 p = &TREE_CHAIN (l);
3836 /* Return an attribute list that is the union of a1 and a2. */
3839 merge_attributes (tree a1, tree a2)
3843 /* Either one unset? Take the set one. */
3845 if ((attributes = a1) == 0)
3848 /* One that completely contains the other? Take it. */
3850 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3852 if (attribute_list_contained (a2, a1))
3856 /* Pick the longest list, and hang on the other list. */
3858 if (list_length (a1) < list_length (a2))
3859 attributes = a2, a2 = a1;
3861 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3864 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3867 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3870 if (TREE_VALUE (a) != NULL
3871 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3872 && TREE_VALUE (a2) != NULL
3873 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3875 if (simple_cst_list_equal (TREE_VALUE (a),
3876 TREE_VALUE (a2)) == 1)
3879 else if (simple_cst_equal (TREE_VALUE (a),
3880 TREE_VALUE (a2)) == 1)
3885 a1 = copy_node (a2);
3886 TREE_CHAIN (a1) = attributes;
3895 /* Given types T1 and T2, merge their attributes and return
3899 merge_type_attributes (tree t1, tree t2)
3901 return merge_attributes (TYPE_ATTRIBUTES (t1),
3902 TYPE_ATTRIBUTES (t2));
3905 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3909 merge_decl_attributes (tree olddecl, tree newdecl)
3911 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3912 DECL_ATTRIBUTES (newdecl));
3915 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3917 /* Specialization of merge_decl_attributes for various Windows targets.
3919 This handles the following situation:
3921 __declspec (dllimport) int foo;
3924 The second instance of `foo' nullifies the dllimport. */
3927 merge_dllimport_decl_attributes (tree old, tree new)
3930 int delete_dllimport_p = 1;
3932 /* What we need to do here is remove from `old' dllimport if it doesn't
3933 appear in `new'. dllimport behaves like extern: if a declaration is
3934 marked dllimport and a definition appears later, then the object
3935 is not dllimport'd. We also remove a `new' dllimport if the old list
3936 contains dllexport: dllexport always overrides dllimport, regardless
3937 of the order of declaration. */
3938 if (!VAR_OR_FUNCTION_DECL_P (new))
3939 delete_dllimport_p = 0;
3940 else if (DECL_DLLIMPORT_P (new)
3941 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3943 DECL_DLLIMPORT_P (new) = 0;
3944 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3945 "dllimport ignored", new);
3947 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3949 /* Warn about overriding a symbol that has already been used. eg:
3950 extern int __attribute__ ((dllimport)) foo;
3951 int* bar () {return &foo;}
3954 if (TREE_USED (old))
3956 warning (0, "%q+D redeclared without dllimport attribute "
3957 "after being referenced with dll linkage", new);
3958 /* If we have used a variable's address with dllimport linkage,
3959 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3960 decl may already have had TREE_CONSTANT computed.
3961 We still remove the attribute so that assembler code refers
3962 to '&foo rather than '_imp__foo'. */
3963 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3964 DECL_DLLIMPORT_P (new) = 1;
3967 /* Let an inline definition silently override the external reference,
3968 but otherwise warn about attribute inconsistency. */
3969 else if (TREE_CODE (new) == VAR_DECL
3970 || !DECL_DECLARED_INLINE_P (new))
3971 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3972 "previous dllimport ignored", new);
3975 delete_dllimport_p = 0;
3977 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3979 if (delete_dllimport_p)
3982 const size_t attr_len = strlen ("dllimport");
3984 /* Scan the list for dllimport and delete it. */
3985 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3987 if (is_attribute_with_length_p ("dllimport", attr_len,
3990 if (prev == NULL_TREE)
3993 TREE_CHAIN (prev) = TREE_CHAIN (t);
4002 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4003 struct attribute_spec.handler. */
4006 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
4011 /* These attributes may apply to structure and union types being created,
4012 but otherwise should pass to the declaration involved. */
4015 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
4016 | (int) ATTR_FLAG_ARRAY_NEXT))
4018 *no_add_attrs = true;
4019 return tree_cons (name, args, NULL_TREE);
4021 if (TREE_CODE (node) == RECORD_TYPE
4022 || TREE_CODE (node) == UNION_TYPE)
4024 node = TYPE_NAME (node);
4030 warning (OPT_Wattributes, "%qs attribute ignored",
4031 IDENTIFIER_POINTER (name));
4032 *no_add_attrs = true;
4037 if (TREE_CODE (node) != FUNCTION_DECL
4038 && TREE_CODE (node) != VAR_DECL
4039 && TREE_CODE (node) != TYPE_DECL)
4041 *no_add_attrs = true;
4042 warning (OPT_Wattributes, "%qs attribute ignored",
4043 IDENTIFIER_POINTER (name));
4047 if (TREE_CODE (node) == TYPE_DECL
4048 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
4049 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
4051 *no_add_attrs = true;
4052 warning (OPT_Wattributes, "%qs attribute ignored",
4053 IDENTIFIER_POINTER (name));
4057 /* Report error on dllimport ambiguities seen now before they cause
4059 else if (is_attribute_p ("dllimport", name))
4061 /* Honor any target-specific overrides. */
4062 if (!targetm.valid_dllimport_attribute_p (node))
4063 *no_add_attrs = true;
4065 else if (TREE_CODE (node) == FUNCTION_DECL
4066 && DECL_DECLARED_INLINE_P (node))
4068 warning (OPT_Wattributes, "inline function %q+D declared as "
4069 " dllimport: attribute ignored", node);
4070 *no_add_attrs = true;
4072 /* Like MS, treat definition of dllimported variables and
4073 non-inlined functions on declaration as syntax errors. */
4074 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4076 error ("function %q+D definition is marked dllimport", node);
4077 *no_add_attrs = true;
4080 else if (TREE_CODE (node) == VAR_DECL)
4082 if (DECL_INITIAL (node))
4084 error ("variable %q+D definition is marked dllimport",
4086 *no_add_attrs = true;
4089 /* `extern' needn't be specified with dllimport.
4090 Specify `extern' now and hope for the best. Sigh. */
4091 DECL_EXTERNAL (node) = 1;
4092 /* Also, implicitly give dllimport'd variables declared within
4093 a function global scope, unless declared static. */
4094 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4095 TREE_PUBLIC (node) = 1;
4098 if (*no_add_attrs == false)
4099 DECL_DLLIMPORT_P (node) = 1;
4102 /* Report error if symbol is not accessible at global scope. */
4103 if (!TREE_PUBLIC (node)
4104 && (TREE_CODE (node) == VAR_DECL
4105 || TREE_CODE (node) == FUNCTION_DECL))
4107 error ("external linkage required for symbol %q+D because of "
4108 "%qs attribute", node, IDENTIFIER_POINTER (name));
4109 *no_add_attrs = true;
4112 /* A dllexport'd entity must have default visibility so that other
4113 program units (shared libraries or the main executable) can see
4114 it. A dllimport'd entity must have default visibility so that
4115 the linker knows that undefined references within this program
4116 unit can be resolved by the dynamic linker. */
4119 if (DECL_VISIBILITY_SPECIFIED (node)
4120 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
4121 error ("%qs implies default visibility, but %qD has already "
4122 "been declared with a different visibility",
4123 IDENTIFIER_POINTER (name), node);
4124 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
4125 DECL_VISIBILITY_SPECIFIED (node) = 1;
4131 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4133 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4134 of the various TYPE_QUAL values. */
4137 set_type_quals (tree type, int type_quals)
4139 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4140 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4141 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4144 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4147 check_qualified_type (const_tree cand, const_tree base, int type_quals)
4149 return (TYPE_QUALS (cand) == type_quals
4150 && TYPE_NAME (cand) == TYPE_NAME (base)
4151 /* Apparently this is needed for Objective-C. */
4152 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4153 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4154 TYPE_ATTRIBUTES (base)));
4157 /* Return a version of the TYPE, qualified as indicated by the
4158 TYPE_QUALS, if one exists. If no qualified version exists yet,
4159 return NULL_TREE. */
4162 get_qualified_type (tree type, int type_quals)
4166 if (TYPE_QUALS (type) == type_quals)
4169 /* Search the chain of variants to see if there is already one there just
4170 like the one we need to have. If so, use that existing one. We must
4171 preserve the TYPE_NAME, since there is code that depends on this. */
4172 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4173 if (check_qualified_type (t, type, type_quals))
4179 /* Like get_qualified_type, but creates the type if it does not
4180 exist. This function never returns NULL_TREE. */
4183 build_qualified_type (tree type, int type_quals)
4187 /* See if we already have the appropriate qualified variant. */
4188 t = get_qualified_type (type, type_quals);
4190 /* If not, build it. */
4193 t = build_variant_type_copy (type);
4194 set_type_quals (t, type_quals);
4196 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4197 /* Propagate structural equality. */
4198 SET_TYPE_STRUCTURAL_EQUALITY (t);
4199 else if (TYPE_CANONICAL (type) != type)
4200 /* Build the underlying canonical type, since it is different
4202 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4205 /* T is its own canonical type. */
4206 TYPE_CANONICAL (t) = t;
4213 /* Create a new distinct copy of TYPE. The new type is made its own
4214 MAIN_VARIANT. If TYPE requires structural equality checks, the
4215 resulting type requires structural equality checks; otherwise, its
4216 TYPE_CANONICAL points to itself. */
4219 build_distinct_type_copy (tree type)
4221 tree t = copy_node (type);
4223 TYPE_POINTER_TO (t) = 0;
4224 TYPE_REFERENCE_TO (t) = 0;
4226 /* Set the canonical type either to a new equivalence class, or
4227 propagate the need for structural equality checks. */
4228 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4229 SET_TYPE_STRUCTURAL_EQUALITY (t);
4231 TYPE_CANONICAL (t) = t;
4233 /* Make it its own variant. */
4234 TYPE_MAIN_VARIANT (t) = t;
4235 TYPE_NEXT_VARIANT (t) = 0;
4237 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4238 whose TREE_TYPE is not t. This can also happen in the Ada
4239 frontend when using subtypes. */
4244 /* Create a new variant of TYPE, equivalent but distinct. This is so
4245 the caller can modify it. TYPE_CANONICAL for the return type will
4246 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4247 are considered equal by the language itself (or that both types
4248 require structural equality checks). */
4251 build_variant_type_copy (tree type)
4253 tree t, m = TYPE_MAIN_VARIANT (type);
4255 t = build_distinct_type_copy (type);
4257 /* Since we're building a variant, assume that it is a non-semantic
4258 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4259 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4261 /* Add the new type to the chain of variants of TYPE. */
4262 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4263 TYPE_NEXT_VARIANT (m) = t;
4264 TYPE_MAIN_VARIANT (t) = m;
4269 /* Return true if the from tree in both tree maps are equal. */
4272 tree_map_base_eq (const void *va, const void *vb)
4274 const struct tree_map_base *const a = va, *const b = vb;
4275 return (a->from == b->from);
4278 /* Hash a from tree in a tree_map. */
4281 tree_map_base_hash (const void *item)
4283 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4286 /* Return true if this tree map structure is marked for garbage collection
4287 purposes. We simply return true if the from tree is marked, so that this
4288 structure goes away when the from tree goes away. */
4291 tree_map_base_marked_p (const void *p)
4293 return ggc_marked_p (((const struct tree_map_base *) p)->from);
4297 tree_map_hash (const void *item)
4299 return (((const struct tree_map *) item)->hash);
4302 /* Return the initialization priority for DECL. */
4305 decl_init_priority_lookup (tree decl)
4307 struct tree_priority_map *h;
4308 struct tree_map_base in;
4310 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4312 h = htab_find (init_priority_for_decl, &in);
4313 return h ? h->init : DEFAULT_INIT_PRIORITY;
4316 /* Return the finalization priority for DECL. */
4319 decl_fini_priority_lookup (tree decl)
4321 struct tree_priority_map *h;
4322 struct tree_map_base in;
4324 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4326 h = htab_find (init_priority_for_decl, &in);
4327 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4330 /* Return the initialization and finalization priority information for
4331 DECL. If there is no previous priority information, a freshly
4332 allocated structure is returned. */
4334 static struct tree_priority_map *
4335 decl_priority_info (tree decl)
4337 struct tree_priority_map in;
4338 struct tree_priority_map *h;
4341 in.base.from = decl;
4342 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4346 h = GGC_CNEW (struct tree_priority_map);
4348 h->base.from = decl;
4349 h->init = DEFAULT_INIT_PRIORITY;
4350 h->fini = DEFAULT_INIT_PRIORITY;
4356 /* Set the initialization priority for DECL to PRIORITY. */
4359 decl_init_priority_insert (tree decl, priority_type priority)
4361 struct tree_priority_map *h;
4363 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4364 h = decl_priority_info (decl);
4368 /* Set the finalization priority for DECL to PRIORITY. */
4371 decl_fini_priority_insert (tree decl, priority_type priority)
4373 struct tree_priority_map *h;
4375 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4376 h = decl_priority_info (decl);
4380 /* Look up a restrict qualified base decl for FROM. */
4383 decl_restrict_base_lookup (tree from)
4388 in.base.from = from;
4389 h = htab_find_with_hash (restrict_base_for_decl, &in,
4390 htab_hash_pointer (from));
4391 return h ? h->to : NULL_TREE;
4394 /* Record the restrict qualified base TO for FROM. */
4397 decl_restrict_base_insert (tree from, tree to)
4402 h = ggc_alloc (sizeof (struct tree_map));
4403 h->hash = htab_hash_pointer (from);
4404 h->base.from = from;
4406 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4407 *(struct tree_map **) loc = h;
4410 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4413 print_debug_expr_statistics (void)
4415 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4416 (long) htab_size (debug_expr_for_decl),
4417 (long) htab_elements (debug_expr_for_decl),
4418 htab_collisions (debug_expr_for_decl));
4421 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4424 print_value_expr_statistics (void)
4426 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4427 (long) htab_size (value_expr_for_decl),
4428 (long) htab_elements (value_expr_for_decl),
4429 htab_collisions (value_expr_for_decl));
4432 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4433 don't print anything if the table is empty. */
4436 print_restrict_base_statistics (void)
4438 if (htab_elements (restrict_base_for_decl) != 0)
4440 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4441 (long) htab_size (restrict_base_for_decl),
4442 (long) htab_elements (restrict_base_for_decl),
4443 htab_collisions (restrict_base_for_decl));
4446 /* Lookup a debug expression for FROM, and return it if we find one. */
4449 decl_debug_expr_lookup (tree from)
4451 struct tree_map *h, in;
4452 in.base.from = from;
4454 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4460 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4463 decl_debug_expr_insert (tree from, tree to)
4468 h = ggc_alloc (sizeof (struct tree_map));
4469 h->hash = htab_hash_pointer (from);
4470 h->base.from = from;
4472 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4473 *(struct tree_map **) loc = h;
4476 /* Lookup a value expression for FROM, and return it if we find one. */
4479 decl_value_expr_lookup (tree from)
4481 struct tree_map *h, in;
4482 in.base.from = from;
4484 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4490 /* Insert a mapping FROM->TO in the value expression hashtable. */
4493 decl_value_expr_insert (tree from, tree to)
4498 h = ggc_alloc (sizeof (struct tree_map));
4499 h->hash = htab_hash_pointer (from);
4500 h->base.from = from;
4502 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4503 *(struct tree_map **) loc = h;
4506 /* Hashing of types so that we don't make duplicates.
4507 The entry point is `type_hash_canon'. */
4509 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4510 with types in the TREE_VALUE slots), by adding the hash codes
4511 of the individual types. */
4514 type_hash_list (const_tree list, hashval_t hashcode)
4518 for (tail = list; tail; tail = TREE_CHAIN (tail))
4519 if (TREE_VALUE (tail) != error_mark_node)
4520 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4526 /* These are the Hashtable callback functions. */
4528 /* Returns true iff the types are equivalent. */
4531 type_hash_eq (const void *va, const void *vb)
4533 const struct type_hash *const a = va, *const b = vb;
4535 /* First test the things that are the same for all types. */
4536 if (a->hash != b->hash
4537 || TREE_CODE (a->type) != TREE_CODE (b->type)
4538 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4539 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4540 TYPE_ATTRIBUTES (b->type))
4541 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4542 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4545 switch (TREE_CODE (a->type))
4550 case REFERENCE_TYPE:
4554 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4557 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4558 && !(TYPE_VALUES (a->type)
4559 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4560 && TYPE_VALUES (b->type)
4561 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4562 && type_list_equal (TYPE_VALUES (a->type),
4563 TYPE_VALUES (b->type))))
4566 /* ... fall through ... */
4571 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4572 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4573 TYPE_MAX_VALUE (b->type)))
4574 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4575 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4576 TYPE_MIN_VALUE (b->type))));
4578 case FIXED_POINT_TYPE:
4579 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
4582 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4585 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4586 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4587 || (TYPE_ARG_TYPES (a->type)
4588 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4589 && TYPE_ARG_TYPES (b->type)
4590 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4591 && type_list_equal (TYPE_ARG_TYPES (a->type),
4592 TYPE_ARG_TYPES (b->type)))));
4595 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4599 case QUAL_UNION_TYPE:
4600 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4601 || (TYPE_FIELDS (a->type)
4602 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4603 && TYPE_FIELDS (b->type)
4604 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4605 && type_list_equal (TYPE_FIELDS (a->type),
4606 TYPE_FIELDS (b->type))));
4609 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4610 || (TYPE_ARG_TYPES (a->type)
4611 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4612 && TYPE_ARG_TYPES (b->type)
4613 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4614 && type_list_equal (TYPE_ARG_TYPES (a->type),
4615 TYPE_ARG_TYPES (b->type))))
4623 if (lang_hooks.types.type_hash_eq != NULL)
4624 return lang_hooks.types.type_hash_eq (a->type, b->type);
4629 /* Return the cached hash value. */
4632 type_hash_hash (const void *item)
4634 return ((const struct type_hash *) item)->hash;
4637 /* Look in the type hash table for a type isomorphic to TYPE.
4638 If one is found, return it. Otherwise return 0. */
4641 type_hash_lookup (hashval_t hashcode, tree type)
4643 struct type_hash *h, in;
4645 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4646 must call that routine before comparing TYPE_ALIGNs. */
4652 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4658 /* Add an entry to the type-hash-table
4659 for a type TYPE whose hash code is HASHCODE. */
4662 type_hash_add (hashval_t hashcode, tree type)
4664 struct type_hash *h;
4667 h = ggc_alloc (sizeof (struct type_hash));
4670 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4674 /* Given TYPE, and HASHCODE its hash code, return the canonical
4675 object for an identical type if one already exists.
4676 Otherwise, return TYPE, and record it as the canonical object.
4678 To use this function, first create a type of the sort you want.
4679 Then compute its hash code from the fields of the type that
4680 make it different from other similar types.
4681 Then call this function and use the value. */
4684 type_hash_canon (unsigned int hashcode, tree type)
4688 /* The hash table only contains main variants, so ensure that's what we're
4690 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4692 if (!lang_hooks.types.hash_types)
4695 /* See if the type is in the hash table already. If so, return it.
4696 Otherwise, add the type. */
4697 t1 = type_hash_lookup (hashcode, type);
4700 #ifdef GATHER_STATISTICS
4701 tree_node_counts[(int) t_kind]--;
4702 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4708 type_hash_add (hashcode, type);
4713 /* See if the data pointed to by the type hash table is marked. We consider
4714 it marked if the type is marked or if a debug type number or symbol
4715 table entry has been made for the type. This reduces the amount of
4716 debugging output and eliminates that dependency of the debug output on
4717 the number of garbage collections. */
4720 type_hash_marked_p (const void *p)
4722 const_tree const type = ((const struct type_hash *) p)->type;
4724 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4728 print_type_hash_statistics (void)
4730 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4731 (long) htab_size (type_hash_table),
4732 (long) htab_elements (type_hash_table),
4733 htab_collisions (type_hash_table));
4736 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4737 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4738 by adding the hash codes of the individual attributes. */
4741 attribute_hash_list (const_tree list, hashval_t hashcode)
4745 for (tail = list; tail; tail = TREE_CHAIN (tail))
4746 /* ??? Do we want to add in TREE_VALUE too? */
4747 hashcode = iterative_hash_object
4748 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4752 /* Given two lists of attributes, return true if list l2 is
4753 equivalent to l1. */
4756 attribute_list_equal (const_tree l1, const_tree l2)
4758 return attribute_list_contained (l1, l2)
4759 && attribute_list_contained (l2, l1);
4762 /* Given two lists of attributes, return true if list L2 is
4763 completely contained within L1. */
4764 /* ??? This would be faster if attribute names were stored in a canonicalized
4765 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4766 must be used to show these elements are equivalent (which they are). */
4767 /* ??? It's not clear that attributes with arguments will always be handled
4771 attribute_list_contained (const_tree l1, const_tree l2)
4775 /* First check the obvious, maybe the lists are identical. */
4779 /* Maybe the lists are similar. */
4780 for (t1 = l1, t2 = l2;
4782 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4783 && TREE_VALUE (t1) == TREE_VALUE (t2);
4784 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4786 /* Maybe the lists are equal. */
4787 if (t1 == 0 && t2 == 0)
4790 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4793 /* This CONST_CAST is okay because lookup_attribute does not
4794 modify its argument and the return value is assigned to a
4796 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4797 CONST_CAST_TREE(l1));
4799 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4802 if (TREE_VALUE (t2) != NULL
4803 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4804 && TREE_VALUE (attr) != NULL
4805 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4807 if (simple_cst_list_equal (TREE_VALUE (t2),
4808 TREE_VALUE (attr)) == 1)
4811 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4822 /* Given two lists of types
4823 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4824 return 1 if the lists contain the same types in the same order.
4825 Also, the TREE_PURPOSEs must match. */
4828 type_list_equal (const_tree l1, const_tree l2)
4832 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4833 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4834 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4835 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4836 && (TREE_TYPE (TREE_PURPOSE (t1))
4837 == TREE_TYPE (TREE_PURPOSE (t2))))))
4843 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4844 given by TYPE. If the argument list accepts variable arguments,
4845 then this function counts only the ordinary arguments. */
4848 type_num_arguments (const_tree type)
4853 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4854 /* If the function does not take a variable number of arguments,
4855 the last element in the list will have type `void'. */
4856 if (VOID_TYPE_P (TREE_VALUE (t)))
4864 /* Nonzero if integer constants T1 and T2
4865 represent the same constant value. */
4868 tree_int_cst_equal (const_tree t1, const_tree t2)
4873 if (t1 == 0 || t2 == 0)
4876 if (TREE_CODE (t1) == INTEGER_CST
4877 && TREE_CODE (t2) == INTEGER_CST
4878 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4879 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4885 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4886 The precise way of comparison depends on their data type. */
4889 tree_int_cst_lt (const_tree t1, const_tree t2)
4894 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4896 int t1_sgn = tree_int_cst_sgn (t1);
4897 int t2_sgn = tree_int_cst_sgn (t2);
4899 if (t1_sgn < t2_sgn)
4901 else if (t1_sgn > t2_sgn)
4903 /* Otherwise, both are non-negative, so we compare them as
4904 unsigned just in case one of them would overflow a signed
4907 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4908 return INT_CST_LT (t1, t2);
4910 return INT_CST_LT_UNSIGNED (t1, t2);
4913 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4916 tree_int_cst_compare (const_tree t1, const_tree t2)
4918 if (tree_int_cst_lt (t1, t2))
4920 else if (tree_int_cst_lt (t2, t1))
4926 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4927 the host. If POS is zero, the value can be represented in a single
4928 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4929 be represented in a single unsigned HOST_WIDE_INT. */
4932 host_integerp (const_tree t, int pos)
4934 return (TREE_CODE (t) == INTEGER_CST
4935 && ((TREE_INT_CST_HIGH (t) == 0
4936 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4937 || (! pos && TREE_INT_CST_HIGH (t) == -1
4938 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4939 && (!TYPE_UNSIGNED (TREE_TYPE (t))
4940 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
4941 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
4942 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4945 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4946 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4947 be non-negative. We must be able to satisfy the above conditions. */
4950 tree_low_cst (const_tree t, int pos)
4952 gcc_assert (host_integerp (t, pos));
4953 return TREE_INT_CST_LOW (t);
4956 /* Return the most significant bit of the integer constant T. */
4959 tree_int_cst_msb (const_tree t)
4963 unsigned HOST_WIDE_INT l;
4965 /* Note that using TYPE_PRECISION here is wrong. We care about the
4966 actual bits, not the (arbitrary) range of the type. */
4967 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4968 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4969 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4970 return (l & 1) == 1;
4973 /* Return an indication of the sign of the integer constant T.
4974 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4975 Note that -1 will never be returned if T's type is unsigned. */
4978 tree_int_cst_sgn (const_tree t)
4980 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4982 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4984 else if (TREE_INT_CST_HIGH (t) < 0)
4990 /* Compare two constructor-element-type constants. Return 1 if the lists
4991 are known to be equal; otherwise return 0. */
4994 simple_cst_list_equal (const_tree l1, const_tree l2)
4996 while (l1 != NULL_TREE && l2 != NULL_TREE)
4998 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
5001 l1 = TREE_CHAIN (l1);
5002 l2 = TREE_CHAIN (l2);
5008 /* Return truthvalue of whether T1 is the same tree structure as T2.
5009 Return 1 if they are the same.
5010 Return 0 if they are understandably different.
5011 Return -1 if either contains tree structure not understood by
5015 simple_cst_equal (const_tree t1, const_tree t2)
5017 enum tree_code code1, code2;
5023 if (t1 == 0 || t2 == 0)
5026 code1 = TREE_CODE (t1);
5027 code2 = TREE_CODE (t2);
5029 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
5031 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5032 || code2 == NON_LVALUE_EXPR)
5033 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5035 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
5038 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5039 || code2 == NON_LVALUE_EXPR)
5040 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
5048 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5049 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
5052 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
5055 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
5058 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
5059 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
5060 TREE_STRING_LENGTH (t1)));
5064 unsigned HOST_WIDE_INT idx;
5065 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
5066 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
5068 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5071 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5072 /* ??? Should we handle also fields here? */
5073 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5074 VEC_index (constructor_elt, v2, idx)->value))
5080 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5083 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5086 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5089 const_tree arg1, arg2;
5090 const_call_expr_arg_iterator iter1, iter2;
5091 for (arg1 = first_const_call_expr_arg (t1, &iter1),
5092 arg2 = first_const_call_expr_arg (t2, &iter2);
5094 arg1 = next_const_call_expr_arg (&iter1),
5095 arg2 = next_const_call_expr_arg (&iter2))
5097 cmp = simple_cst_equal (arg1, arg2);
5101 return arg1 == arg2;
5105 /* Special case: if either target is an unallocated VAR_DECL,
5106 it means that it's going to be unified with whatever the
5107 TARGET_EXPR is really supposed to initialize, so treat it
5108 as being equivalent to anything. */
5109 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5110 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5111 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5112 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5113 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5114 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5117 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5122 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5124 case WITH_CLEANUP_EXPR:
5125 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5129 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5132 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5133 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5147 /* This general rule works for most tree codes. All exceptions should be
5148 handled above. If this is a language-specific tree code, we can't
5149 trust what might be in the operand, so say we don't know
5151 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5154 switch (TREE_CODE_CLASS (code1))
5158 case tcc_comparison:
5159 case tcc_expression:
5163 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5165 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5177 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5178 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5179 than U, respectively. */
5182 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
5184 if (tree_int_cst_sgn (t) < 0)
5186 else if (TREE_INT_CST_HIGH (t) != 0)
5188 else if (TREE_INT_CST_LOW (t) == u)
5190 else if (TREE_INT_CST_LOW (t) < u)
5196 /* Return true if CODE represents an associative tree code. Otherwise
5199 associative_tree_code (enum tree_code code)
5218 /* Return true if CODE represents a commutative tree code. Otherwise
5221 commutative_tree_code (enum tree_code code)
5234 case UNORDERED_EXPR:
5238 case TRUTH_AND_EXPR:
5239 case TRUTH_XOR_EXPR:
5249 /* Generate a hash value for an expression. This can be used iteratively
5250 by passing a previous result as the "val" argument.
5252 This function is intended to produce the same hash for expressions which
5253 would compare equal using operand_equal_p. */
5256 iterative_hash_expr (const_tree t, hashval_t val)
5259 enum tree_code code;
5263 return iterative_hash_pointer (t, val);
5265 code = TREE_CODE (t);
5269 /* Alas, constants aren't shared, so we can't rely on pointer
5272 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5273 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5276 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5278 return iterative_hash_hashval_t (val2, val);
5282 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
5284 return iterative_hash_hashval_t (val2, val);
5287 return iterative_hash (TREE_STRING_POINTER (t),
5288 TREE_STRING_LENGTH (t), val);
5290 val = iterative_hash_expr (TREE_REALPART (t), val);
5291 return iterative_hash_expr (TREE_IMAGPART (t), val);
5293 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5297 /* we can just compare by pointer. */
5298 return iterative_hash_pointer (t, val);
5301 /* A list of expressions, for a CALL_EXPR or as the elements of a
5303 for (; t; t = TREE_CHAIN (t))
5304 val = iterative_hash_expr (TREE_VALUE (t), val);
5308 unsigned HOST_WIDE_INT idx;
5310 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5312 val = iterative_hash_expr (field, val);
5313 val = iterative_hash_expr (value, val);
5318 /* When referring to a built-in FUNCTION_DECL, use the
5319 __builtin__ form. Otherwise nodes that compare equal
5320 according to operand_equal_p might get different
5322 if (DECL_BUILT_IN (t))
5324 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5328 /* else FALL THROUGH */
5330 class = TREE_CODE_CLASS (code);
5332 if (class == tcc_declaration)
5334 /* DECL's have a unique ID */
5335 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5339 gcc_assert (IS_EXPR_CODE_CLASS (class));
5341 val = iterative_hash_object (code, val);
5343 /* Don't hash the type, that can lead to having nodes which
5344 compare equal according to operand_equal_p, but which
5345 have different hash codes. */
5346 if (code == NOP_EXPR
5347 || code == CONVERT_EXPR
5348 || code == NON_LVALUE_EXPR)
5350 /* Make sure to include signness in the hash computation. */
5351 val += TYPE_UNSIGNED (TREE_TYPE (t));
5352 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5355 else if (commutative_tree_code (code))
5357 /* It's a commutative expression. We want to hash it the same
5358 however it appears. We do this by first hashing both operands
5359 and then rehashing based on the order of their independent
5361 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5362 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5366 t = one, one = two, two = t;
5368 val = iterative_hash_hashval_t (one, val);
5369 val = iterative_hash_hashval_t (two, val);
5372 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5373 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5380 /* Constructors for pointer, array and function types.
5381 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5382 constructed by language-dependent code, not here.) */
5384 /* Construct, lay out and return the type of pointers to TO_TYPE with
5385 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5386 reference all of memory. If such a type has already been
5387 constructed, reuse it. */
5390 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5395 if (to_type == error_mark_node)
5396 return error_mark_node;
5398 /* In some cases, languages will have things that aren't a POINTER_TYPE
5399 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5400 In that case, return that type without regard to the rest of our
5403 ??? This is a kludge, but consistent with the way this function has
5404 always operated and there doesn't seem to be a good way to avoid this
5406 if (TYPE_POINTER_TO (to_type) != 0
5407 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5408 return TYPE_POINTER_TO (to_type);
5410 /* First, if we already have a type for pointers to TO_TYPE and it's
5411 the proper mode, use it. */
5412 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5413 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5416 t = make_node (POINTER_TYPE);
5418 TREE_TYPE (t) = to_type;
5419 TYPE_MODE (t) = mode;
5420 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5421 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5422 TYPE_POINTER_TO (to_type) = t;
5424 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5425 SET_TYPE_STRUCTURAL_EQUALITY (t);
5426 else if (TYPE_CANONICAL (to_type) != to_type)
5428 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5429 mode, can_alias_all);
5431 /* Lay out the type. This function has many callers that are concerned
5432 with expression-construction, and this simplifies them all. */
5438 /* By default build pointers in ptr_mode. */
5441 build_pointer_type (tree to_type)
5443 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5446 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5449 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5454 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5455 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5456 In that case, return that type without regard to the rest of our
5459 ??? This is a kludge, but consistent with the way this function has
5460 always operated and there doesn't seem to be a good way to avoid this
5462 if (TYPE_REFERENCE_TO (to_type) != 0
5463 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5464 return TYPE_REFERENCE_TO (to_type);
5466 /* First, if we already have a type for pointers to TO_TYPE and it's
5467 the proper mode, use it. */
5468 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5469 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5472 t = make_node (REFERENCE_TYPE);
5474 TREE_TYPE (t) = to_type;
5475 TYPE_MODE (t) = mode;
5476 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5477 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5478 TYPE_REFERENCE_TO (to_type) = t;
5480 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5481 SET_TYPE_STRUCTURAL_EQUALITY (t);
5482 else if (TYPE_CANONICAL (to_type) != to_type)
5484 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5485 mode, can_alias_all);
5493 /* Build the node for the type of references-to-TO_TYPE by default
5497 build_reference_type (tree to_type)
5499 return build_reference_type_for_mode (to_type, ptr_mode, false);
5502 /* Build a type that is compatible with t but has no cv quals anywhere
5505 const char *const *const * -> char ***. */
5508 build_type_no_quals (tree t)
5510 switch (TREE_CODE (t))
5513 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5515 TYPE_REF_CAN_ALIAS_ALL (t));
5516 case REFERENCE_TYPE:
5518 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5520 TYPE_REF_CAN_ALIAS_ALL (t));
5522 return TYPE_MAIN_VARIANT (t);
5526 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5527 MAXVAL should be the maximum value in the domain
5528 (one less than the length of the array).
5530 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5531 We don't enforce this limit, that is up to caller (e.g. language front end).
5532 The limit exists because the result is a signed type and we don't handle
5533 sizes that use more than one HOST_WIDE_INT. */
5536 build_index_type (tree maxval)
5538 tree itype = make_node (INTEGER_TYPE);
5540 TREE_TYPE (itype) = sizetype;
5541 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5542 TYPE_MIN_VALUE (itype) = size_zero_node;
5543 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5544 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5545 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5546 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5547 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5548 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5550 if (host_integerp (maxval, 1))
5551 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5554 /* Since we cannot hash this type, we need to compare it using
5555 structural equality checks. */
5556 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5561 /* Builds a signed or unsigned integer type of precision PRECISION.
5562 Used for C bitfields whose precision does not match that of
5563 built-in target types. */
5565 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5568 tree itype = make_node (INTEGER_TYPE);
5570 TYPE_PRECISION (itype) = precision;
5573 fixup_unsigned_type (itype);
5575 fixup_signed_type (itype);
5577 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5578 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5583 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5584 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5585 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5588 build_range_type (tree type, tree lowval, tree highval)
5590 tree itype = make_node (INTEGER_TYPE);
5592 TREE_TYPE (itype) = type;
5593 if (type == NULL_TREE)
5596 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5597 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5599 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5600 TYPE_MODE (itype) = TYPE_MODE (type);
5601 TYPE_SIZE (itype) = TYPE_SIZE (type);
5602 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5603 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5604 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5606 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5607 return type_hash_canon (tree_low_cst (highval, 0)
5608 - tree_low_cst (lowval, 0),
5614 /* Just like build_index_type, but takes lowval and highval instead
5615 of just highval (maxval). */
5618 build_index_2_type (tree lowval, tree highval)
5620 return build_range_type (sizetype, lowval, highval);
5623 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5624 and number of elements specified by the range of values of INDEX_TYPE.
5625 If such a type has already been constructed, reuse it. */
5628 build_array_type (tree elt_type, tree index_type)
5631 hashval_t hashcode = 0;
5633 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5635 error ("arrays of functions are not meaningful");
5636 elt_type = integer_type_node;
5639 t = make_node (ARRAY_TYPE);
5640 TREE_TYPE (t) = elt_type;
5641 TYPE_DOMAIN (t) = index_type;
5643 if (index_type == 0)
5646 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5647 t = type_hash_canon (hashcode, t);
5651 if (TYPE_CANONICAL (t) == t)
5653 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5654 SET_TYPE_STRUCTURAL_EQUALITY (t);
5655 else if (TYPE_CANONICAL (elt_type) != elt_type)
5657 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5663 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5664 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5665 t = type_hash_canon (hashcode, t);
5667 if (!COMPLETE_TYPE_P (t))
5670 if (TYPE_CANONICAL (t) == t)
5672 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5673 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5674 SET_TYPE_STRUCTURAL_EQUALITY (t);
5675 else if (TYPE_CANONICAL (elt_type) != elt_type
5676 || TYPE_CANONICAL (index_type) != index_type)
5678 = build_array_type (TYPE_CANONICAL (elt_type),
5679 TYPE_CANONICAL (index_type));
5685 /* Return the TYPE of the elements comprising
5686 the innermost dimension of ARRAY. */
5689 get_inner_array_type (const_tree array)
5691 tree type = TREE_TYPE (array);
5693 while (TREE_CODE (type) == ARRAY_TYPE)
5694 type = TREE_TYPE (type);
5699 /* Computes the canonical argument types from the argument type list
5702 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5703 on entry to this function, or if any of the ARGTYPES are
5706 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5707 true on entry to this function, or if any of the ARGTYPES are
5710 Returns a canonical argument list, which may be ARGTYPES when the
5711 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5712 true) or would not differ from ARGTYPES. */
5715 maybe_canonicalize_argtypes(tree argtypes,
5716 bool *any_structural_p,
5717 bool *any_noncanonical_p)
5720 bool any_noncanonical_argtypes_p = false;
5722 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
5724 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
5725 /* Fail gracefully by stating that the type is structural. */
5726 *any_structural_p = true;
5727 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
5728 *any_structural_p = true;
5729 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
5730 || TREE_PURPOSE (arg))
5731 /* If the argument has a default argument, we consider it
5732 non-canonical even though the type itself is canonical.
5733 That way, different variants of function and method types
5734 with default arguments will all point to the variant with
5735 no defaults as their canonical type. */
5736 any_noncanonical_argtypes_p = true;
5739 if (*any_structural_p)
5742 if (any_noncanonical_argtypes_p)
5744 /* Build the canonical list of argument types. */
5745 tree canon_argtypes = NULL_TREE;
5746 bool is_void = false;
5748 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
5750 if (arg == void_list_node)
5753 canon_argtypes = tree_cons (NULL_TREE,
5754 TYPE_CANONICAL (TREE_VALUE (arg)),
5758 canon_argtypes = nreverse (canon_argtypes);
5760 canon_argtypes = chainon (canon_argtypes, void_list_node);
5762 /* There is a non-canonical type. */
5763 *any_noncanonical_p = true;
5764 return canon_argtypes;
5767 /* The canonical argument types are the same as ARGTYPES. */
5771 /* Construct, lay out and return
5772 the type of functions returning type VALUE_TYPE
5773 given arguments of types ARG_TYPES.
5774 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5775 are data type nodes for the arguments of the function.
5776 If such a type has already been constructed, reuse it. */
5779 build_function_type (tree value_type, tree arg_types)
5782 hashval_t hashcode = 0;
5783 bool any_structural_p, any_noncanonical_p;
5784 tree canon_argtypes;
5786 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5788 error ("function return type cannot be function");
5789 value_type = integer_type_node;
5792 /* Make a node of the sort we want. */
5793 t = make_node (FUNCTION_TYPE);
5794 TREE_TYPE (t) = value_type;
5795 TYPE_ARG_TYPES (t) = arg_types;
5797 /* If we already have such a type, use the old one. */
5798 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5799 hashcode = type_hash_list (arg_types, hashcode);
5800 t = type_hash_canon (hashcode, t);
5802 /* Set up the canonical type. */
5803 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
5804 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
5805 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
5807 &any_noncanonical_p);
5808 if (any_structural_p)
5809 SET_TYPE_STRUCTURAL_EQUALITY (t);
5810 else if (any_noncanonical_p)
5811 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
5814 if (!COMPLETE_TYPE_P (t))
5819 /* Build a function type. The RETURN_TYPE is the type returned by the
5820 function. If additional arguments are provided, they are
5821 additional argument types. The list of argument types must always
5822 be terminated by NULL_TREE. */
5825 build_function_type_list (tree return_type, ...)
5830 va_start (p, return_type);
5832 t = va_arg (p, tree);
5833 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5834 args = tree_cons (NULL_TREE, t, args);
5836 if (args == NULL_TREE)
5837 args = void_list_node;
5841 args = nreverse (args);
5842 TREE_CHAIN (last) = void_list_node;
5844 args = build_function_type (return_type, args);
5850 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5851 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5852 for the method. An implicit additional parameter (of type
5853 pointer-to-BASETYPE) is added to the ARGTYPES. */
5856 build_method_type_directly (tree basetype,
5863 bool any_structural_p, any_noncanonical_p;
5864 tree canon_argtypes;
5866 /* Make a node of the sort we want. */
5867 t = make_node (METHOD_TYPE);
5869 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5870 TREE_TYPE (t) = rettype;
5871 ptype = build_pointer_type (basetype);
5873 /* The actual arglist for this function includes a "hidden" argument
5874 which is "this". Put it into the list of argument types. */
5875 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5876 TYPE_ARG_TYPES (t) = argtypes;
5878 /* If we already have such a type, use the old one. */
5879 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5880 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5881 hashcode = type_hash_list (argtypes, hashcode);
5882 t = type_hash_canon (hashcode, t);
5884 /* Set up the canonical type. */
5886 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5887 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
5889 = (TYPE_CANONICAL (basetype) != basetype
5890 || TYPE_CANONICAL (rettype) != rettype);
5891 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
5893 &any_noncanonical_p);
5894 if (any_structural_p)
5895 SET_TYPE_STRUCTURAL_EQUALITY (t);
5896 else if (any_noncanonical_p)
5898 = build_method_type_directly (TYPE_CANONICAL (basetype),
5899 TYPE_CANONICAL (rettype),
5901 if (!COMPLETE_TYPE_P (t))
5907 /* Construct, lay out and return the type of methods belonging to class
5908 BASETYPE and whose arguments and values are described by TYPE.
5909 If that type exists already, reuse it.
5910 TYPE must be a FUNCTION_TYPE node. */
5913 build_method_type (tree basetype, tree type)
5915 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5917 return build_method_type_directly (basetype,
5919 TYPE_ARG_TYPES (type));
5922 /* Construct, lay out and return the type of offsets to a value
5923 of type TYPE, within an object of type BASETYPE.
5924 If a suitable offset type exists already, reuse it. */
5927 build_offset_type (tree basetype, tree type)
5930 hashval_t hashcode = 0;
5932 /* Make a node of the sort we want. */
5933 t = make_node (OFFSET_TYPE);
5935 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5936 TREE_TYPE (t) = type;
5938 /* If we already have such a type, use the old one. */
5939 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5940 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5941 t = type_hash_canon (hashcode, t);
5943 if (!COMPLETE_TYPE_P (t))
5946 if (TYPE_CANONICAL (t) == t)
5948 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5949 || TYPE_STRUCTURAL_EQUALITY_P (type))
5950 SET_TYPE_STRUCTURAL_EQUALITY (t);
5951 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
5952 || TYPE_CANONICAL (type) != type)
5954 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
5955 TYPE_CANONICAL (type));
5961 /* Create a complex type whose components are COMPONENT_TYPE. */
5964 build_complex_type (tree component_type)
5969 /* Make a node of the sort we want. */
5970 t = make_node (COMPLEX_TYPE);
5972 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5974 /* If we already have such a type, use the old one. */
5975 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5976 t = type_hash_canon (hashcode, t);
5978 if (!COMPLETE_TYPE_P (t))
5981 if (TYPE_CANONICAL (t) == t)
5983 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
5984 SET_TYPE_STRUCTURAL_EQUALITY (t);
5985 else if (TYPE_CANONICAL (component_type) != component_type)
5987 = build_complex_type (TYPE_CANONICAL (component_type));
5990 /* We need to create a name, since complex is a fundamental type. */
5991 if (! TYPE_NAME (t))
5994 if (component_type == char_type_node)
5995 name = "complex char";
5996 else if (component_type == signed_char_type_node)
5997 name = "complex signed char";
5998 else if (component_type == unsigned_char_type_node)
5999 name = "complex unsigned char";
6000 else if (component_type == short_integer_type_node)
6001 name = "complex short int";
6002 else if (component_type == short_unsigned_type_node)
6003 name = "complex short unsigned int";
6004 else if (component_type == integer_type_node)
6005 name = "complex int";
6006 else if (component_type == unsigned_type_node)
6007 name = "complex unsigned int";
6008 else if (component_type == long_integer_type_node)
6009 name = "complex long int";
6010 else if (component_type == long_unsigned_type_node)
6011 name = "complex long unsigned int";
6012 else if (component_type == long_long_integer_type_node)
6013 name = "complex long long int";
6014 else if (component_type == long_long_unsigned_type_node)
6015 name = "complex long long unsigned int";
6020 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
6023 return build_qualified_type (t, TYPE_QUALS (component_type));
6026 /* Return OP, stripped of any conversions to wider types as much as is safe.
6027 Converting the value back to OP's type makes a value equivalent to OP.
6029 If FOR_TYPE is nonzero, we return a value which, if converted to
6030 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6032 OP must have integer, real or enumeral type. Pointers are not allowed!
6034 There are some cases where the obvious value we could return
6035 would regenerate to OP if converted to OP's type,
6036 but would not extend like OP to wider types.
6037 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6038 For example, if OP is (unsigned short)(signed char)-1,
6039 we avoid returning (signed char)-1 if FOR_TYPE is int,
6040 even though extending that to an unsigned short would regenerate OP,
6041 since the result of extending (signed char)-1 to (int)
6042 is different from (int) OP. */
6045 get_unwidened (tree op, tree for_type)
6047 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6048 tree type = TREE_TYPE (op);
6050 = TYPE_PRECISION (for_type != 0 ? for_type : type);
6052 = (for_type != 0 && for_type != type
6053 && final_prec > TYPE_PRECISION (type)
6054 && TYPE_UNSIGNED (type));
6057 while (TREE_CODE (op) == NOP_EXPR
6058 || TREE_CODE (op) == CONVERT_EXPR)
6062 /* TYPE_PRECISION on vector types has different meaning
6063 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6064 so avoid them here. */
6065 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
6068 bitschange = TYPE_PRECISION (TREE_TYPE (op))
6069 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
6071 /* Truncations are many-one so cannot be removed.
6072 Unless we are later going to truncate down even farther. */
6074 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
6077 /* See what's inside this conversion. If we decide to strip it,
6079 op = TREE_OPERAND (op, 0);
6081 /* If we have not stripped any zero-extensions (uns is 0),
6082 we can strip any kind of extension.
6083 If we have previously stripped a zero-extension,
6084 only zero-extensions can safely be stripped.
6085 Any extension can be stripped if the bits it would produce
6086 are all going to be discarded later by truncating to FOR_TYPE. */
6090 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
6092 /* TYPE_UNSIGNED says whether this is a zero-extension.
6093 Let's avoid computing it if it does not affect WIN
6094 and if UNS will not be needed again. */
6096 || TREE_CODE (op) == NOP_EXPR
6097 || TREE_CODE (op) == CONVERT_EXPR)
6098 && TYPE_UNSIGNED (TREE_TYPE (op)))
6109 /* Return OP or a simpler expression for a narrower value
6110 which can be sign-extended or zero-extended to give back OP.
6111 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6112 or 0 if the value should be sign-extended. */
6115 get_narrower (tree op, int *unsignedp_ptr)
6120 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
6122 while (TREE_CODE (op) == NOP_EXPR)
6125 = (TYPE_PRECISION (TREE_TYPE (op))
6126 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
6128 /* Truncations are many-one so cannot be removed. */
6132 /* See what's inside this conversion. If we decide to strip it,
6137 op = TREE_OPERAND (op, 0);
6138 /* An extension: the outermost one can be stripped,
6139 but remember whether it is zero or sign extension. */
6141 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6142 /* Otherwise, if a sign extension has been stripped,
6143 only sign extensions can now be stripped;
6144 if a zero extension has been stripped, only zero-extensions. */
6145 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6149 else /* bitschange == 0 */
6151 /* A change in nominal type can always be stripped, but we must
6152 preserve the unsignedness. */
6154 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6156 op = TREE_OPERAND (op, 0);
6157 /* Keep trying to narrow, but don't assign op to win if it
6158 would turn an integral type into something else. */
6159 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6166 if (TREE_CODE (op) == COMPONENT_REF
6167 /* Since type_for_size always gives an integer type. */
6168 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6169 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
6170 /* Ensure field is laid out already. */
6171 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6172 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6174 unsigned HOST_WIDE_INT innerprec
6175 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6176 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6177 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6178 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6180 /* We can get this structure field in a narrower type that fits it,
6181 but the resulting extension to its nominal type (a fullword type)
6182 must satisfy the same conditions as for other extensions.
6184 Do this only for fields that are aligned (not bit-fields),
6185 because when bit-field insns will be used there is no
6186 advantage in doing this. */
6188 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6189 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6190 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6194 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6195 win = fold_convert (type, op);
6199 *unsignedp_ptr = uns;
6203 /* Nonzero if integer constant C has a value that is permissible
6204 for type TYPE (an INTEGER_TYPE). */
6207 int_fits_type_p (const_tree c, const_tree type)
6209 tree type_low_bound = TYPE_MIN_VALUE (type);
6210 tree type_high_bound = TYPE_MAX_VALUE (type);
6211 bool ok_for_low_bound, ok_for_high_bound;
6212 unsigned HOST_WIDE_INT low;
6215 /* If at least one bound of the type is a constant integer, we can check
6216 ourselves and maybe make a decision. If no such decision is possible, but
6217 this type is a subtype, try checking against that. Otherwise, use
6218 fit_double_type, which checks against the precision.
6220 Compute the status for each possibly constant bound, and return if we see
6221 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6222 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6223 for "constant known to fit". */
6225 /* Check if C >= type_low_bound. */
6226 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6228 if (tree_int_cst_lt (c, type_low_bound))
6230 ok_for_low_bound = true;
6233 ok_for_low_bound = false;
6235 /* Check if c <= type_high_bound. */
6236 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6238 if (tree_int_cst_lt (type_high_bound, c))
6240 ok_for_high_bound = true;
6243 ok_for_high_bound = false;
6245 /* If the constant fits both bounds, the result is known. */
6246 if (ok_for_low_bound && ok_for_high_bound)
6249 /* Perform some generic filtering which may allow making a decision
6250 even if the bounds are not constant. First, negative integers
6251 never fit in unsigned types, */
6252 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6255 /* Second, narrower types always fit in wider ones. */
6256 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6259 /* Third, unsigned integers with top bit set never fit signed types. */
6260 if (! TYPE_UNSIGNED (type)
6261 && TYPE_UNSIGNED (TREE_TYPE (c))
6262 && tree_int_cst_msb (c))
6265 /* If we haven't been able to decide at this point, there nothing more we
6266 can check ourselves here. Look at the base type if we have one and it
6267 has the same precision. */
6268 if (TREE_CODE (type) == INTEGER_TYPE
6269 && TREE_TYPE (type) != 0
6270 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6271 return int_fits_type_p (c, TREE_TYPE (type));
6273 /* Or to fit_double_type, if nothing else. */
6274 low = TREE_INT_CST_LOW (c);
6275 high = TREE_INT_CST_HIGH (c);
6276 return !fit_double_type (low, high, &low, &high, type);
6279 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6280 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6281 represented (assuming two's-complement arithmetic) within the bit
6282 precision of the type are returned instead. */
6285 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
6287 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
6288 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
6289 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
6290 TYPE_UNSIGNED (type));
6293 if (TYPE_UNSIGNED (type))
6294 mpz_set_ui (min, 0);
6298 mn = double_int_mask (TYPE_PRECISION (type) - 1);
6299 mn = double_int_sext (double_int_add (mn, double_int_one),
6300 TYPE_PRECISION (type));
6301 mpz_set_double_int (min, mn, false);
6305 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
6306 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
6307 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
6308 TYPE_UNSIGNED (type));
6311 if (TYPE_UNSIGNED (type))
6312 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
6315 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
6320 /* auto_var_in_fn_p is called to determine whether VAR is an automatic
6321 variable defined in function FN. */
6324 auto_var_in_fn_p (const_tree var, const_tree fn)
6326 return (DECL_P (var) && DECL_CONTEXT (var) == fn
6327 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
6328 && ! TREE_STATIC (var))
6329 || TREE_CODE (var) == LABEL_DECL
6330 || TREE_CODE (var) == RESULT_DECL));
6333 /* Subprogram of following function. Called by walk_tree.
6335 Return *TP if it is an automatic variable or parameter of the
6336 function passed in as DATA. */
6339 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6341 tree fn = (tree) data;
6346 else if (DECL_P (*tp)
6347 && auto_var_in_fn_p (*tp, fn))
6353 /* Returns true if T is, contains, or refers to a type with variable
6354 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6355 arguments, but not the return type. If FN is nonzero, only return
6356 true if a modifier of the type or position of FN is a variable or
6357 parameter inside FN.
6359 This concept is more general than that of C99 'variably modified types':
6360 in C99, a struct type is never variably modified because a VLA may not
6361 appear as a structure member. However, in GNU C code like:
6363 struct S { int i[f()]; };
6365 is valid, and other languages may define similar constructs. */
6368 variably_modified_type_p (tree type, tree fn)
6372 /* Test if T is either variable (if FN is zero) or an expression containing
6373 a variable in FN. */
6374 #define RETURN_TRUE_IF_VAR(T) \
6375 do { tree _t = (T); \
6376 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6377 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6378 return true; } while (0)
6380 if (type == error_mark_node)
6383 /* If TYPE itself has variable size, it is variably modified. */
6384 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6385 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6387 switch (TREE_CODE (type))
6390 case REFERENCE_TYPE:
6392 if (variably_modified_type_p (TREE_TYPE (type), fn))
6398 /* If TYPE is a function type, it is variably modified if the
6399 return type is variably modified. */
6400 if (variably_modified_type_p (TREE_TYPE (type), fn))
6406 case FIXED_POINT_TYPE:
6409 /* Scalar types are variably modified if their end points
6411 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6412 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6417 case QUAL_UNION_TYPE:
6418 /* We can't see if any of the fields are variably-modified by the
6419 definition we normally use, since that would produce infinite
6420 recursion via pointers. */
6421 /* This is variably modified if some field's type is. */
6422 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6423 if (TREE_CODE (t) == FIELD_DECL)
6425 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6426 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6427 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6429 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6430 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6435 /* Do not call ourselves to avoid infinite recursion. This is
6436 variably modified if the element type is. */
6437 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6438 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6445 /* The current language may have other cases to check, but in general,
6446 all other types are not variably modified. */
6447 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6449 #undef RETURN_TRUE_IF_VAR
6452 /* Given a DECL or TYPE, return the scope in which it was declared, or
6453 NULL_TREE if there is no containing scope. */
6456 get_containing_scope (const_tree t)
6458 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6461 /* Return the innermost context enclosing DECL that is
6462 a FUNCTION_DECL, or zero if none. */
6465 decl_function_context (const_tree decl)
6469 if (TREE_CODE (decl) == ERROR_MARK)
6472 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6473 where we look up the function at runtime. Such functions always take
6474 a first argument of type 'pointer to real context'.
6476 C++ should really be fixed to use DECL_CONTEXT for the real context,
6477 and use something else for the "virtual context". */
6478 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6481 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6483 context = DECL_CONTEXT (decl);
6485 while (context && TREE_CODE (context) != FUNCTION_DECL)
6487 if (TREE_CODE (context) == BLOCK)
6488 context = BLOCK_SUPERCONTEXT (context);
6490 context = get_containing_scope (context);
6496 /* Return the innermost context enclosing DECL that is
6497 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6498 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6501 decl_type_context (const_tree decl)
6503 tree context = DECL_CONTEXT (decl);
6506 switch (TREE_CODE (context))
6508 case NAMESPACE_DECL:
6509 case TRANSLATION_UNIT_DECL:
6514 case QUAL_UNION_TYPE:
6519 context = DECL_CONTEXT (context);
6523 context = BLOCK_SUPERCONTEXT (context);
6533 /* CALL is a CALL_EXPR. Return the declaration for the function
6534 called, or NULL_TREE if the called function cannot be
6538 get_callee_fndecl (const_tree call)
6542 if (call == error_mark_node)
6543 return error_mark_node;
6545 /* It's invalid to call this function with anything but a
6547 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6549 /* The first operand to the CALL is the address of the function
6551 addr = CALL_EXPR_FN (call);
6555 /* If this is a readonly function pointer, extract its initial value. */
6556 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6557 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6558 && DECL_INITIAL (addr))
6559 addr = DECL_INITIAL (addr);
6561 /* If the address is just `&f' for some function `f', then we know
6562 that `f' is being called. */
6563 if (TREE_CODE (addr) == ADDR_EXPR
6564 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6565 return TREE_OPERAND (addr, 0);
6567 /* We couldn't figure out what was being called. Maybe the front
6568 end has some idea. */
6569 return lang_hooks.lang_get_callee_fndecl (call);
6572 /* Print debugging information about tree nodes generated during the compile,
6573 and any language-specific information. */
6576 dump_tree_statistics (void)
6578 #ifdef GATHER_STATISTICS
6580 int total_nodes, total_bytes;
6583 fprintf (stderr, "\n??? tree nodes created\n\n");
6584 #ifdef GATHER_STATISTICS
6585 fprintf (stderr, "Kind Nodes Bytes\n");
6586 fprintf (stderr, "---------------------------------------\n");
6587 total_nodes = total_bytes = 0;
6588 for (i = 0; i < (int) all_kinds; i++)
6590 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6591 tree_node_counts[i], tree_node_sizes[i]);
6592 total_nodes += tree_node_counts[i];
6593 total_bytes += tree_node_sizes[i];
6595 fprintf (stderr, "---------------------------------------\n");
6596 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6597 fprintf (stderr, "---------------------------------------\n");
6598 ssanames_print_statistics ();
6599 phinodes_print_statistics ();
6601 fprintf (stderr, "(No per-node statistics)\n");
6603 print_type_hash_statistics ();
6604 print_debug_expr_statistics ();
6605 print_value_expr_statistics ();
6606 print_restrict_base_statistics ();
6607 lang_hooks.print_statistics ();
6610 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6612 /* Generate a crc32 of a string. */
6615 crc32_string (unsigned chksum, const char *string)
6619 unsigned value = *string << 24;
6622 for (ix = 8; ix--; value <<= 1)
6626 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6635 /* P is a string that will be used in a symbol. Mask out any characters
6636 that are not valid in that context. */
6639 clean_symbol_name (char *p)
6643 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6646 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6653 /* Generate a name for a special-purpose function function.
6654 The generated name may need to be unique across the whole link.
6655 TYPE is some string to identify the purpose of this function to the
6656 linker or collect2; it must start with an uppercase letter,
6658 I - for constructors
6660 N - for C++ anonymous namespaces
6661 F - for DWARF unwind frame information. */
6664 get_file_function_name (const char *type)
6670 /* If we already have a name we know to be unique, just use that. */
6671 if (first_global_object_name)
6672 p = first_global_object_name;
6673 /* If the target is handling the constructors/destructors, they
6674 will be local to this file and the name is only necessary for
6675 debugging purposes. */
6676 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6678 const char *file = main_input_filename;
6680 file = input_filename;
6681 /* Just use the file's basename, because the full pathname
6682 might be quite long. */
6683 p = strrchr (file, '/');
6688 p = q = ASTRDUP (p);
6689 clean_symbol_name (q);
6693 /* Otherwise, the name must be unique across the entire link.
6694 We don't have anything that we know to be unique to this translation
6695 unit, so use what we do have and throw in some randomness. */
6697 const char *name = weak_global_object_name;
6698 const char *file = main_input_filename;
6703 file = input_filename;
6705 len = strlen (file);
6706 q = alloca (9 * 2 + len + 1);
6707 memcpy (q, file, len + 1);
6708 clean_symbol_name (q);
6710 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6711 crc32_string (0, get_random_seed (false)));
6716 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6718 /* Set up the name of the file-level functions we may need.
6719 Use a global object (which is already required to be unique over
6720 the program) rather than the file name (which imposes extra
6722 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6724 return get_identifier (buf);
6727 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6729 /* Complain that the tree code of NODE does not match the expected 0
6730 terminated list of trailing codes. The trailing code list can be
6731 empty, for a more vague error message. FILE, LINE, and FUNCTION
6732 are of the caller. */
6735 tree_check_failed (const_tree node, const char *file,
6736 int line, const char *function, ...)
6740 unsigned length = 0;
6743 va_start (args, function);
6744 while ((code = va_arg (args, int)))
6745 length += 4 + strlen (tree_code_name[code]);
6750 va_start (args, function);
6751 length += strlen ("expected ");
6752 buffer = tmp = alloca (length);
6754 while ((code = va_arg (args, int)))
6756 const char *prefix = length ? " or " : "expected ";
6758 strcpy (tmp + length, prefix);
6759 length += strlen (prefix);
6760 strcpy (tmp + length, tree_code_name[code]);
6761 length += strlen (tree_code_name[code]);
6766 buffer = "unexpected node";
6768 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6769 buffer, tree_code_name[TREE_CODE (node)],
6770 function, trim_filename (file), line);
6773 /* Complain that the tree code of NODE does match the expected 0
6774 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6778 tree_not_check_failed (const_tree node, const char *file,
6779 int line, const char *function, ...)
6783 unsigned length = 0;
6786 va_start (args, function);
6787 while ((code = va_arg (args, int)))
6788 length += 4 + strlen (tree_code_name[code]);
6790 va_start (args, function);
6791 buffer = alloca (length);
6793 while ((code = va_arg (args, int)))
6797 strcpy (buffer + length, " or ");
6800 strcpy (buffer + length, tree_code_name[code]);
6801 length += strlen (tree_code_name[code]);
6805 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6806 buffer, tree_code_name[TREE_CODE (node)],
6807 function, trim_filename (file), line);
6810 /* Similar to tree_check_failed, except that we check for a class of tree
6811 code, given in CL. */
6814 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
6815 const char *file, int line, const char *function)
6818 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6819 TREE_CODE_CLASS_STRING (cl),
6820 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6821 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6824 /* Similar to tree_check_failed, except that instead of specifying a
6825 dozen codes, use the knowledge that they're all sequential. */
6828 tree_range_check_failed (const_tree node, const char *file, int line,
6829 const char *function, enum tree_code c1,
6833 unsigned length = 0;
6836 for (c = c1; c <= c2; ++c)
6837 length += 4 + strlen (tree_code_name[c]);
6839 length += strlen ("expected ");
6840 buffer = alloca (length);
6843 for (c = c1; c <= c2; ++c)
6845 const char *prefix = length ? " or " : "expected ";
6847 strcpy (buffer + length, prefix);
6848 length += strlen (prefix);
6849 strcpy (buffer + length, tree_code_name[c]);
6850 length += strlen (tree_code_name[c]);
6853 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6854 buffer, tree_code_name[TREE_CODE (node)],
6855 function, trim_filename (file), line);
6859 /* Similar to tree_check_failed, except that we check that a tree does
6860 not have the specified code, given in CL. */
6863 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
6864 const char *file, int line, const char *function)
6867 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6868 TREE_CODE_CLASS_STRING (cl),
6869 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6870 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6874 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6877 omp_clause_check_failed (const_tree node, const char *file, int line,
6878 const char *function, enum omp_clause_code code)
6880 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6881 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6882 function, trim_filename (file), line);
6886 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6889 omp_clause_range_check_failed (const_tree node, const char *file, int line,
6890 const char *function, enum omp_clause_code c1,
6891 enum omp_clause_code c2)
6894 unsigned length = 0;
6895 enum omp_clause_code c;
6897 for (c = c1; c <= c2; ++c)
6898 length += 4 + strlen (omp_clause_code_name[c]);
6900 length += strlen ("expected ");
6901 buffer = alloca (length);
6904 for (c = c1; c <= c2; ++c)
6906 const char *prefix = length ? " or " : "expected ";
6908 strcpy (buffer + length, prefix);
6909 length += strlen (prefix);
6910 strcpy (buffer + length, omp_clause_code_name[c]);
6911 length += strlen (omp_clause_code_name[c]);
6914 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6915 buffer, omp_clause_code_name[TREE_CODE (node)],
6916 function, trim_filename (file), line);
6920 #undef DEFTREESTRUCT
6921 #define DEFTREESTRUCT(VAL, NAME) NAME,
6923 static const char *ts_enum_names[] = {
6924 #include "treestruct.def"
6926 #undef DEFTREESTRUCT
6928 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6930 /* Similar to tree_class_check_failed, except that we check for
6931 whether CODE contains the tree structure identified by EN. */
6934 tree_contains_struct_check_failed (const_tree node,
6935 const enum tree_node_structure_enum en,
6936 const char *file, int line,
6937 const char *function)
6940 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6942 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6946 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6947 (dynamically sized) vector. */
6950 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6951 const char *function)
6954 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6955 idx + 1, len, function, trim_filename (file), line);
6958 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6959 (dynamically sized) vector. */
6962 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6963 const char *function)
6966 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6967 idx + 1, len, function, trim_filename (file), line);
6970 /* Similar to above, except that the check is for the bounds of the operand
6971 vector of an expression node EXP. */
6974 tree_operand_check_failed (int idx, const_tree exp, const char *file,
6975 int line, const char *function)
6977 int code = TREE_CODE (exp);
6979 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6980 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
6981 function, trim_filename (file), line);
6984 /* Similar to above, except that the check is for the number of
6985 operands of an OMP_CLAUSE node. */
6988 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
6989 int line, const char *function)
6992 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6993 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6994 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6995 trim_filename (file), line);
6997 #endif /* ENABLE_TREE_CHECKING */
6999 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7000 and mapped to the machine mode MODE. Initialize its fields and build
7001 the information necessary for debugging output. */
7004 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
7007 hashval_t hashcode = 0;
7009 /* Build a main variant, based on the main variant of the inner type, then
7010 use it to build the variant we return. */
7011 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
7012 && TYPE_MAIN_VARIANT (innertype) != innertype)
7013 return build_type_attribute_qual_variant (
7014 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
7015 TYPE_ATTRIBUTES (innertype),
7016 TYPE_QUALS (innertype));
7018 t = make_node (VECTOR_TYPE);
7019 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
7020 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
7021 TYPE_MODE (t) = mode;
7022 TYPE_READONLY (t) = TYPE_READONLY (innertype);
7023 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
7025 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
7026 SET_TYPE_STRUCTURAL_EQUALITY (t);
7027 else if (TYPE_CANONICAL (innertype) != innertype
7028 || mode != VOIDmode)
7030 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
7035 tree index = build_int_cst (NULL_TREE, nunits - 1);
7036 tree array = build_array_type (innertype, build_index_type (index));
7037 tree rt = make_node (RECORD_TYPE);
7039 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
7040 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
7042 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
7043 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7044 the representation type, and we want to find that die when looking up
7045 the vector type. This is most easily achieved by making the TYPE_UID
7047 TYPE_UID (rt) = TYPE_UID (t);
7050 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
7051 hashcode = iterative_hash_host_wide_int (mode, hashcode);
7052 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
7053 return type_hash_canon (hashcode, t);
7057 make_or_reuse_type (unsigned size, int unsignedp)
7059 if (size == INT_TYPE_SIZE)
7060 return unsignedp ? unsigned_type_node : integer_type_node;
7061 if (size == CHAR_TYPE_SIZE)
7062 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
7063 if (size == SHORT_TYPE_SIZE)
7064 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
7065 if (size == LONG_TYPE_SIZE)
7066 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
7067 if (size == LONG_LONG_TYPE_SIZE)
7068 return (unsignedp ? long_long_unsigned_type_node
7069 : long_long_integer_type_node);
7072 return make_unsigned_type (size);
7074 return make_signed_type (size);
7077 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7080 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
7084 if (size == SHORT_FRACT_TYPE_SIZE)
7085 return unsignedp ? sat_unsigned_short_fract_type_node
7086 : sat_short_fract_type_node;
7087 if (size == FRACT_TYPE_SIZE)
7088 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
7089 if (size == LONG_FRACT_TYPE_SIZE)
7090 return unsignedp ? sat_unsigned_long_fract_type_node
7091 : sat_long_fract_type_node;
7092 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7093 return unsignedp ? sat_unsigned_long_long_fract_type_node
7094 : sat_long_long_fract_type_node;
7098 if (size == SHORT_FRACT_TYPE_SIZE)
7099 return unsignedp ? unsigned_short_fract_type_node
7100 : short_fract_type_node;
7101 if (size == FRACT_TYPE_SIZE)
7102 return unsignedp ? unsigned_fract_type_node : fract_type_node;
7103 if (size == LONG_FRACT_TYPE_SIZE)
7104 return unsignedp ? unsigned_long_fract_type_node
7105 : long_fract_type_node;
7106 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7107 return unsignedp ? unsigned_long_long_fract_type_node
7108 : long_long_fract_type_node;
7111 return make_fract_type (size, unsignedp, satp);
7114 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7117 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
7121 if (size == SHORT_ACCUM_TYPE_SIZE)
7122 return unsignedp ? sat_unsigned_short_accum_type_node
7123 : sat_short_accum_type_node;
7124 if (size == ACCUM_TYPE_SIZE)
7125 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
7126 if (size == LONG_ACCUM_TYPE_SIZE)
7127 return unsignedp ? sat_unsigned_long_accum_type_node
7128 : sat_long_accum_type_node;
7129 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7130 return unsignedp ? sat_unsigned_long_long_accum_type_node
7131 : sat_long_long_accum_type_node;
7135 if (size == SHORT_ACCUM_TYPE_SIZE)
7136 return unsignedp ? unsigned_short_accum_type_node
7137 : short_accum_type_node;
7138 if (size == ACCUM_TYPE_SIZE)
7139 return unsignedp ? unsigned_accum_type_node : accum_type_node;
7140 if (size == LONG_ACCUM_TYPE_SIZE)
7141 return unsignedp ? unsigned_long_accum_type_node
7142 : long_accum_type_node;
7143 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7144 return unsignedp ? unsigned_long_long_accum_type_node
7145 : long_long_accum_type_node;
7148 return make_accum_type (size, unsignedp, satp);
7151 /* Create nodes for all integer types (and error_mark_node) using the sizes
7152 of C datatypes. The caller should call set_sizetype soon after calling
7153 this function to select one of the types as sizetype. */
7156 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
7158 error_mark_node = make_node (ERROR_MARK);
7159 TREE_TYPE (error_mark_node) = error_mark_node;
7161 initialize_sizetypes (signed_sizetype);
7163 /* Define both `signed char' and `unsigned char'. */
7164 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
7165 TYPE_STRING_FLAG (signed_char_type_node) = 1;
7166 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
7167 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
7169 /* Define `char', which is like either `signed char' or `unsigned char'
7170 but not the same as either. */
7173 ? make_signed_type (CHAR_TYPE_SIZE)
7174 : make_unsigned_type (CHAR_TYPE_SIZE));
7175 TYPE_STRING_FLAG (char_type_node) = 1;
7177 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
7178 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
7179 integer_type_node = make_signed_type (INT_TYPE_SIZE);
7180 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
7181 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
7182 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
7183 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
7184 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
7186 /* Define a boolean type. This type only represents boolean values but
7187 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7188 Front ends which want to override this size (i.e. Java) can redefine
7189 boolean_type_node before calling build_common_tree_nodes_2. */
7190 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
7191 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
7192 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
7193 TYPE_PRECISION (boolean_type_node) = 1;
7195 /* Fill in the rest of the sized types. Reuse existing type nodes
7197 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
7198 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
7199 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
7200 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
7201 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
7203 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
7204 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
7205 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
7206 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
7207 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
7209 access_public_node = get_identifier ("public");
7210 access_protected_node = get_identifier ("protected");
7211 access_private_node = get_identifier ("private");
7214 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7215 It will create several other common tree nodes. */
7218 build_common_tree_nodes_2 (int short_double)
7220 /* Define these next since types below may used them. */
7221 integer_zero_node = build_int_cst (NULL_TREE, 0);
7222 integer_one_node = build_int_cst (NULL_TREE, 1);
7223 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
7225 size_zero_node = size_int (0);
7226 size_one_node = size_int (1);
7227 bitsize_zero_node = bitsize_int (0);
7228 bitsize_one_node = bitsize_int (1);
7229 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
7231 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
7232 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
7234 void_type_node = make_node (VOID_TYPE);
7235 layout_type (void_type_node);
7237 /* We are not going to have real types in C with less than byte alignment,
7238 so we might as well not have any types that claim to have it. */
7239 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
7240 TYPE_USER_ALIGN (void_type_node) = 0;
7242 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
7243 layout_type (TREE_TYPE (null_pointer_node));
7245 ptr_type_node = build_pointer_type (void_type_node);
7247 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
7248 fileptr_type_node = ptr_type_node;
7250 float_type_node = make_node (REAL_TYPE);
7251 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
7252 layout_type (float_type_node);
7254 double_type_node = make_node (REAL_TYPE);
7256 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
7258 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
7259 layout_type (double_type_node);
7261 long_double_type_node = make_node (REAL_TYPE);
7262 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
7263 layout_type (long_double_type_node);
7265 float_ptr_type_node = build_pointer_type (float_type_node);
7266 double_ptr_type_node = build_pointer_type (double_type_node);
7267 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7268 integer_ptr_type_node = build_pointer_type (integer_type_node);
7270 /* Fixed size integer types. */
7271 uint32_type_node = build_nonstandard_integer_type (32, true);
7272 uint64_type_node = build_nonstandard_integer_type (64, true);
7274 /* Decimal float types. */
7275 dfloat32_type_node = make_node (REAL_TYPE);
7276 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7277 layout_type (dfloat32_type_node);
7278 TYPE_MODE (dfloat32_type_node) = SDmode;
7279 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7281 dfloat64_type_node = make_node (REAL_TYPE);
7282 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7283 layout_type (dfloat64_type_node);
7284 TYPE_MODE (dfloat64_type_node) = DDmode;
7285 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7287 dfloat128_type_node = make_node (REAL_TYPE);
7288 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7289 layout_type (dfloat128_type_node);
7290 TYPE_MODE (dfloat128_type_node) = TDmode;
7291 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7293 complex_integer_type_node = build_complex_type (integer_type_node);
7294 complex_float_type_node = build_complex_type (float_type_node);
7295 complex_double_type_node = build_complex_type (double_type_node);
7296 complex_long_double_type_node = build_complex_type (long_double_type_node);
7298 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7299 #define MAKE_FIXED_TYPE_NODE(KIND,WIDTH,SIZE) \
7300 sat_ ## WIDTH ## KIND ## _type_node = \
7301 make_sat_signed_ ## KIND ## _type (SIZE); \
7302 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7303 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7304 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7305 unsigned_ ## WIDTH ## KIND ## _type_node = \
7306 make_unsigned_ ## KIND ## _type (SIZE);
7308 /* Make fixed-point type nodes based on four different widths. */
7309 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7310 MAKE_FIXED_TYPE_NODE (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7311 MAKE_FIXED_TYPE_NODE (N1, , N2 ## _TYPE_SIZE) \
7312 MAKE_FIXED_TYPE_NODE (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7313 MAKE_FIXED_TYPE_NODE (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7315 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7316 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7317 NAME ## _type_node = \
7318 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7319 u ## NAME ## _type_node = \
7320 make_or_reuse_unsigned_ ## KIND ## _type \
7321 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7322 sat_ ## NAME ## _type_node = \
7323 make_or_reuse_sat_signed_ ## KIND ## _type \
7324 (GET_MODE_BITSIZE (MODE ## mode)); \
7325 sat_u ## NAME ## _type_node = \
7326 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7327 (GET_MODE_BITSIZE (U ## MODE ## mode));
7329 /* Fixed-point type and mode nodes. */
7330 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
7331 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
7332 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
7333 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
7334 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
7335 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
7336 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
7337 MAKE_FIXED_MODE_NODE (accum, ha, HA)
7338 MAKE_FIXED_MODE_NODE (accum, sa, SA)
7339 MAKE_FIXED_MODE_NODE (accum, da, DA)
7340 MAKE_FIXED_MODE_NODE (accum, ta, TA)
7343 tree t = targetm.build_builtin_va_list ();
7345 /* Many back-ends define record types without setting TYPE_NAME.
7346 If we copied the record type here, we'd keep the original
7347 record type without a name. This breaks name mangling. So,
7348 don't copy record types and let c_common_nodes_and_builtins()
7349 declare the type to be __builtin_va_list. */
7350 if (TREE_CODE (t) != RECORD_TYPE)
7351 t = build_variant_type_copy (t);
7353 va_list_type_node = t;
7357 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7360 local_define_builtin (const char *name, tree type, enum built_in_function code,
7361 const char *library_name, int ecf_flags)
7365 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7366 library_name, NULL_TREE);
7367 if (ecf_flags & ECF_CONST)
7368 TREE_READONLY (decl) = 1;
7369 if (ecf_flags & ECF_PURE)
7370 DECL_PURE_P (decl) = 1;
7371 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
7372 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
7373 if (ecf_flags & ECF_NORETURN)
7374 TREE_THIS_VOLATILE (decl) = 1;
7375 if (ecf_flags & ECF_NOTHROW)
7376 TREE_NOTHROW (decl) = 1;
7377 if (ecf_flags & ECF_MALLOC)
7378 DECL_IS_MALLOC (decl) = 1;
7380 built_in_decls[code] = decl;
7381 implicit_built_in_decls[code] = decl;
7384 /* Call this function after instantiating all builtins that the language
7385 front end cares about. This will build the rest of the builtins that
7386 are relied upon by the tree optimizers and the middle-end. */
7389 build_common_builtin_nodes (void)
7393 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7394 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7396 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7397 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7398 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7399 ftype = build_function_type (ptr_type_node, tmp);
7401 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7402 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7403 "memcpy", ECF_NOTHROW);
7404 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7405 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7406 "memmove", ECF_NOTHROW);
7409 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7411 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7412 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7413 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7414 ftype = build_function_type (integer_type_node, tmp);
7415 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7416 "memcmp", ECF_PURE | ECF_NOTHROW);
7419 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7421 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7422 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7423 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7424 ftype = build_function_type (ptr_type_node, tmp);
7425 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7426 "memset", ECF_NOTHROW);
7429 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7431 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7432 ftype = build_function_type (ptr_type_node, tmp);
7433 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7434 "alloca", ECF_NOTHROW | ECF_MALLOC);
7437 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7438 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7439 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7440 ftype = build_function_type (void_type_node, tmp);
7441 local_define_builtin ("__builtin_init_trampoline", ftype,
7442 BUILT_IN_INIT_TRAMPOLINE,
7443 "__builtin_init_trampoline", ECF_NOTHROW);
7445 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7446 ftype = build_function_type (ptr_type_node, tmp);
7447 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7448 BUILT_IN_ADJUST_TRAMPOLINE,
7449 "__builtin_adjust_trampoline",
7450 ECF_CONST | ECF_NOTHROW);
7452 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7453 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7454 ftype = build_function_type (void_type_node, tmp);
7455 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7456 BUILT_IN_NONLOCAL_GOTO,
7457 "__builtin_nonlocal_goto",
7458 ECF_NORETURN | ECF_NOTHROW);
7460 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7461 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7462 ftype = build_function_type (void_type_node, tmp);
7463 local_define_builtin ("__builtin_setjmp_setup", ftype,
7464 BUILT_IN_SETJMP_SETUP,
7465 "__builtin_setjmp_setup", ECF_NOTHROW);
7467 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7468 ftype = build_function_type (ptr_type_node, tmp);
7469 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7470 BUILT_IN_SETJMP_DISPATCHER,
7471 "__builtin_setjmp_dispatcher",
7472 ECF_PURE | ECF_NOTHROW);
7474 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7475 ftype = build_function_type (void_type_node, tmp);
7476 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7477 BUILT_IN_SETJMP_RECEIVER,
7478 "__builtin_setjmp_receiver", ECF_NOTHROW);
7480 ftype = build_function_type (ptr_type_node, void_list_node);
7481 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7482 "__builtin_stack_save", ECF_NOTHROW);
7484 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7485 ftype = build_function_type (void_type_node, tmp);
7486 local_define_builtin ("__builtin_stack_restore", ftype,
7487 BUILT_IN_STACK_RESTORE,
7488 "__builtin_stack_restore", ECF_NOTHROW);
7490 ftype = build_function_type (void_type_node, void_list_node);
7491 local_define_builtin ("__builtin_profile_func_enter", ftype,
7492 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7493 local_define_builtin ("__builtin_profile_func_exit", ftype,
7494 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7496 /* Complex multiplication and division. These are handled as builtins
7497 rather than optabs because emit_library_call_value doesn't support
7498 complex. Further, we can do slightly better with folding these
7499 beasties if the real and complex parts of the arguments are separate. */
7501 enum machine_mode mode;
7503 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7505 char mode_name_buf[4], *q;
7507 enum built_in_function mcode, dcode;
7508 tree type, inner_type;
7510 type = lang_hooks.types.type_for_mode (mode, 0);
7513 inner_type = TREE_TYPE (type);
7515 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7516 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7517 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7518 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7519 ftype = build_function_type (type, tmp);
7521 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7522 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7524 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7528 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7529 local_define_builtin (built_in_names[mcode], ftype, mcode,
7530 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7532 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7533 local_define_builtin (built_in_names[dcode], ftype, dcode,
7534 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7539 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7542 If we requested a pointer to a vector, build up the pointers that
7543 we stripped off while looking for the inner type. Similarly for
7544 return values from functions.
7546 The argument TYPE is the top of the chain, and BOTTOM is the
7547 new type which we will point to. */
7550 reconstruct_complex_type (tree type, tree bottom)
7554 if (TREE_CODE (type) == POINTER_TYPE)
7556 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7557 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
7558 TYPE_REF_CAN_ALIAS_ALL (type));
7560 else if (TREE_CODE (type) == REFERENCE_TYPE)
7562 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7563 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
7564 TYPE_REF_CAN_ALIAS_ALL (type));
7566 else if (TREE_CODE (type) == ARRAY_TYPE)
7568 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7569 outer = build_array_type (inner, TYPE_DOMAIN (type));
7571 else if (TREE_CODE (type) == FUNCTION_TYPE)
7573 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7574 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7576 else if (TREE_CODE (type) == METHOD_TYPE)
7578 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7579 /* The build_method_type_directly() routine prepends 'this' to argument list,
7580 so we must compensate by getting rid of it. */
7582 = build_method_type_directly
7583 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
7585 TREE_CHAIN (TYPE_ARG_TYPES (type)));
7587 else if (TREE_CODE (type) == OFFSET_TYPE)
7589 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7590 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
7595 return build_qualified_type (outer, TYPE_QUALS (type));
7598 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7601 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7605 switch (GET_MODE_CLASS (mode))
7607 case MODE_VECTOR_INT:
7608 case MODE_VECTOR_FLOAT:
7609 case MODE_VECTOR_FRACT:
7610 case MODE_VECTOR_UFRACT:
7611 case MODE_VECTOR_ACCUM:
7612 case MODE_VECTOR_UACCUM:
7613 nunits = GET_MODE_NUNITS (mode);
7617 /* Check that there are no leftover bits. */
7618 gcc_assert (GET_MODE_BITSIZE (mode)
7619 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7621 nunits = GET_MODE_BITSIZE (mode)
7622 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7629 return make_vector_type (innertype, nunits, mode);
7632 /* Similarly, but takes the inner type and number of units, which must be
7636 build_vector_type (tree innertype, int nunits)
7638 return make_vector_type (innertype, nunits, VOIDmode);
7642 /* Build RESX_EXPR with given REGION_NUMBER. */
7644 build_resx (int region_number)
7647 t = build1 (RESX_EXPR, void_type_node,
7648 build_int_cst (NULL_TREE, region_number));
7652 /* Given an initializer INIT, return TRUE if INIT is zero or some
7653 aggregate of zeros. Otherwise return FALSE. */
7655 initializer_zerop (const_tree init)
7661 switch (TREE_CODE (init))
7664 return integer_zerop (init);
7667 /* ??? Note that this is not correct for C4X float formats. There,
7668 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7669 negative exponent. */
7670 return real_zerop (init)
7671 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7674 return fixed_zerop (init);
7677 return integer_zerop (init)
7678 || (real_zerop (init)
7679 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7680 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7683 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7684 if (!initializer_zerop (TREE_VALUE (elt)))
7690 unsigned HOST_WIDE_INT idx;
7692 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7693 if (!initializer_zerop (elt))
7703 /* Build an empty statement. */
7706 build_empty_stmt (void)
7708 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7712 /* Build an OpenMP clause with code CODE. */
7715 build_omp_clause (enum omp_clause_code code)
7720 length = omp_clause_num_ops[code];
7721 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7723 t = ggc_alloc (size);
7724 memset (t, 0, size);
7725 TREE_SET_CODE (t, OMP_CLAUSE);
7726 OMP_CLAUSE_SET_CODE (t, code);
7728 #ifdef GATHER_STATISTICS
7729 tree_node_counts[(int) omp_clause_kind]++;
7730 tree_node_sizes[(int) omp_clause_kind] += size;
7736 /* Set various status flags when building a CALL_EXPR object T. */
7739 process_call_operands (tree t)
7743 side_effects = TREE_SIDE_EFFECTS (t);
7747 n = TREE_OPERAND_LENGTH (t);
7748 for (i = 1; i < n; i++)
7750 tree op = TREE_OPERAND (t, i);
7751 if (op && TREE_SIDE_EFFECTS (op))
7762 /* Calls have side-effects, except those to const or
7764 i = call_expr_flags (t);
7765 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
7768 TREE_SIDE_EFFECTS (t) = side_effects;
7771 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7772 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7773 Except for the CODE and operand count field, other storage for the
7774 object is initialized to zeros. */
7777 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
7780 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
7782 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
7783 gcc_assert (len >= 1);
7785 #ifdef GATHER_STATISTICS
7786 tree_node_counts[(int) e_kind]++;
7787 tree_node_sizes[(int) e_kind] += length;
7790 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
7792 memset (t, 0, length);
7794 TREE_SET_CODE (t, code);
7796 /* Can't use TREE_OPERAND to store the length because if checking is
7797 enabled, it will try to check the length before we store it. :-P */
7798 t->exp.operands[0] = build_int_cst (sizetype, len);
7804 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7805 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
7809 build_call_list (tree return_type, tree fn, tree arglist)
7814 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
7815 TREE_TYPE (t) = return_type;
7816 CALL_EXPR_FN (t) = fn;
7817 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7818 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
7819 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
7820 process_call_operands (t);
7824 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7825 FN and a null static chain slot. NARGS is the number of call arguments
7826 which are specified as "..." arguments. */
7829 build_call_nary (tree return_type, tree fn, int nargs, ...)
7833 va_start (args, nargs);
7834 ret = build_call_valist (return_type, fn, nargs, args);
7839 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7840 FN and a null static chain slot. NARGS is the number of call arguments
7841 which are specified as a va_list ARGS. */
7844 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
7849 t = build_vl_exp (CALL_EXPR, nargs + 3);
7850 TREE_TYPE (t) = return_type;
7851 CALL_EXPR_FN (t) = fn;
7852 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7853 for (i = 0; i < nargs; i++)
7854 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
7855 process_call_operands (t);
7859 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7860 FN and a null static chain slot. NARGS is the number of call arguments
7861 which are specified as a tree array ARGS. */
7864 build_call_array (tree return_type, tree fn, int nargs, tree *args)
7869 t = build_vl_exp (CALL_EXPR, nargs + 3);
7870 TREE_TYPE (t) = return_type;
7871 CALL_EXPR_FN (t) = fn;
7872 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7873 for (i = 0; i < nargs; i++)
7874 CALL_EXPR_ARG (t, i) = args[i];
7875 process_call_operands (t);
7880 /* Returns true if it is possible to prove that the index of
7881 an array access REF (an ARRAY_REF expression) falls into the
7885 in_array_bounds_p (tree ref)
7887 tree idx = TREE_OPERAND (ref, 1);
7890 if (TREE_CODE (idx) != INTEGER_CST)
7893 min = array_ref_low_bound (ref);
7894 max = array_ref_up_bound (ref);
7897 || TREE_CODE (min) != INTEGER_CST
7898 || TREE_CODE (max) != INTEGER_CST)
7901 if (tree_int_cst_lt (idx, min)
7902 || tree_int_cst_lt (max, idx))
7908 /* Returns true if it is possible to prove that the range of
7909 an array access REF (an ARRAY_RANGE_REF expression) falls
7910 into the array bounds. */
7913 range_in_array_bounds_p (tree ref)
7915 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7916 tree range_min, range_max, min, max;
7918 range_min = TYPE_MIN_VALUE (domain_type);
7919 range_max = TYPE_MAX_VALUE (domain_type);
7922 || TREE_CODE (range_min) != INTEGER_CST
7923 || TREE_CODE (range_max) != INTEGER_CST)
7926 min = array_ref_low_bound (ref);
7927 max = array_ref_up_bound (ref);
7930 || TREE_CODE (min) != INTEGER_CST
7931 || TREE_CODE (max) != INTEGER_CST)
7934 if (tree_int_cst_lt (range_min, min)
7935 || tree_int_cst_lt (max, range_max))
7941 /* Return true if T (assumed to be a DECL) must be assigned a memory
7945 needs_to_live_in_memory (const_tree t)
7947 if (TREE_CODE (t) == SSA_NAME)
7948 t = SSA_NAME_VAR (t);
7950 return (TREE_ADDRESSABLE (t)
7951 || is_global_var (t)
7952 || (TREE_CODE (t) == RESULT_DECL
7953 && aggregate_value_p (t, current_function_decl)));
7956 /* There are situations in which a language considers record types
7957 compatible which have different field lists. Decide if two fields
7958 are compatible. It is assumed that the parent records are compatible. */
7961 fields_compatible_p (const_tree f1, const_tree f2)
7963 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7964 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7967 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7968 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7971 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7977 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7980 find_compatible_field (tree record, tree orig_field)
7984 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7985 if (TREE_CODE (f) == FIELD_DECL
7986 && fields_compatible_p (f, orig_field))
7989 /* ??? Why isn't this on the main fields list? */
7990 f = TYPE_VFIELD (record);
7991 if (f && TREE_CODE (f) == FIELD_DECL
7992 && fields_compatible_p (f, orig_field))
7995 /* ??? We should abort here, but Java appears to do Bad Things
7996 with inherited fields. */
8000 /* Return value of a constant X and sign-extend it. */
8003 int_cst_value (const_tree x)
8005 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8006 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
8008 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8009 gcc_assert (TREE_INT_CST_HIGH (x) == 0
8010 || TREE_INT_CST_HIGH (x) == -1);
8012 if (bits < HOST_BITS_PER_WIDE_INT)
8014 bool negative = ((val >> (bits - 1)) & 1) != 0;
8016 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
8018 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
8024 /* If TYPE is an integral type, return an equivalent type which is
8025 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8026 return TYPE itself. */
8029 signed_or_unsigned_type_for (int unsignedp, tree type)
8032 if (POINTER_TYPE_P (type))
8035 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
8038 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
8041 /* Returns unsigned variant of TYPE. */
8044 unsigned_type_for (tree type)
8046 return signed_or_unsigned_type_for (1, type);
8049 /* Returns signed variant of TYPE. */
8052 signed_type_for (tree type)
8054 return signed_or_unsigned_type_for (0, type);
8057 /* Returns the largest value obtainable by casting something in INNER type to
8061 upper_bound_in_type (tree outer, tree inner)
8063 unsigned HOST_WIDE_INT lo, hi;
8064 unsigned int det = 0;
8065 unsigned oprec = TYPE_PRECISION (outer);
8066 unsigned iprec = TYPE_PRECISION (inner);
8069 /* Compute a unique number for every combination. */
8070 det |= (oprec > iprec) ? 4 : 0;
8071 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
8072 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
8074 /* Determine the exponent to use. */
8079 /* oprec <= iprec, outer: signed, inner: don't care. */
8084 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8088 /* oprec > iprec, outer: signed, inner: signed. */
8092 /* oprec > iprec, outer: signed, inner: unsigned. */
8096 /* oprec > iprec, outer: unsigned, inner: signed. */
8100 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8107 /* Compute 2^^prec - 1. */
8108 if (prec <= HOST_BITS_PER_WIDE_INT)
8111 lo = ((~(unsigned HOST_WIDE_INT) 0)
8112 >> (HOST_BITS_PER_WIDE_INT - prec));
8116 hi = ((~(unsigned HOST_WIDE_INT) 0)
8117 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
8118 lo = ~(unsigned HOST_WIDE_INT) 0;
8121 return build_int_cst_wide (outer, lo, hi);
8124 /* Returns the smallest value obtainable by casting something in INNER type to
8128 lower_bound_in_type (tree outer, tree inner)
8130 unsigned HOST_WIDE_INT lo, hi;
8131 unsigned oprec = TYPE_PRECISION (outer);
8132 unsigned iprec = TYPE_PRECISION (inner);
8134 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8136 if (TYPE_UNSIGNED (outer)
8137 /* If we are widening something of an unsigned type, OUTER type
8138 contains all values of INNER type. In particular, both INNER
8139 and OUTER types have zero in common. */
8140 || (oprec > iprec && TYPE_UNSIGNED (inner)))
8144 /* If we are widening a signed type to another signed type, we
8145 want to obtain -2^^(iprec-1). If we are keeping the
8146 precision or narrowing to a signed type, we want to obtain
8148 unsigned prec = oprec > iprec ? iprec : oprec;
8150 if (prec <= HOST_BITS_PER_WIDE_INT)
8152 hi = ~(unsigned HOST_WIDE_INT) 0;
8153 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
8157 hi = ((~(unsigned HOST_WIDE_INT) 0)
8158 << (prec - HOST_BITS_PER_WIDE_INT - 1));
8163 return build_int_cst_wide (outer, lo, hi);
8166 /* Return nonzero if two operands that are suitable for PHI nodes are
8167 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8168 SSA_NAME or invariant. Note that this is strictly an optimization.
8169 That is, callers of this function can directly call operand_equal_p
8170 and get the same result, only slower. */
8173 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
8177 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
8179 return operand_equal_p (arg0, arg1, 0);
8182 /* Returns number of zeros at the end of binary representation of X.
8184 ??? Use ffs if available? */
8187 num_ending_zeros (const_tree x)
8189 unsigned HOST_WIDE_INT fr, nfr;
8190 unsigned num, abits;
8191 tree type = TREE_TYPE (x);
8193 if (TREE_INT_CST_LOW (x) == 0)
8195 num = HOST_BITS_PER_WIDE_INT;
8196 fr = TREE_INT_CST_HIGH (x);
8201 fr = TREE_INT_CST_LOW (x);
8204 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
8207 if (nfr << abits == fr)
8214 if (num > TYPE_PRECISION (type))
8215 num = TYPE_PRECISION (type);
8217 return build_int_cst_type (type, num);
8221 #define WALK_SUBTREE(NODE) \
8224 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8230 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8231 be walked whenever a type is seen in the tree. Rest of operands and return
8232 value are as for walk_tree. */
8235 walk_type_fields (tree type, walk_tree_fn func, void *data,
8236 struct pointer_set_t *pset, walk_tree_lh lh)
8238 tree result = NULL_TREE;
8240 switch (TREE_CODE (type))
8243 case REFERENCE_TYPE:
8244 /* We have to worry about mutually recursive pointers. These can't
8245 be written in C. They can in Ada. It's pathological, but
8246 there's an ACATS test (c38102a) that checks it. Deal with this
8247 by checking if we're pointing to another pointer, that one
8248 points to another pointer, that one does too, and we have no htab.
8249 If so, get a hash table. We check three levels deep to avoid
8250 the cost of the hash table if we don't need one. */
8251 if (POINTER_TYPE_P (TREE_TYPE (type))
8252 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
8253 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
8256 result = walk_tree_without_duplicates (&TREE_TYPE (type),
8264 /* ... fall through ... */
8267 WALK_SUBTREE (TREE_TYPE (type));
8271 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
8276 WALK_SUBTREE (TREE_TYPE (type));
8280 /* We never want to walk into default arguments. */
8281 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
8282 WALK_SUBTREE (TREE_VALUE (arg));
8287 /* Don't follow this nodes's type if a pointer for fear that
8288 we'll have infinite recursion. If we have a PSET, then we
8291 || (!POINTER_TYPE_P (TREE_TYPE (type))
8292 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
8293 WALK_SUBTREE (TREE_TYPE (type));
8294 WALK_SUBTREE (TYPE_DOMAIN (type));
8298 WALK_SUBTREE (TREE_TYPE (type));
8299 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
8309 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8310 called with the DATA and the address of each sub-tree. If FUNC returns a
8311 non-NULL value, the traversal is stopped, and the value returned by FUNC
8312 is returned. If PSET is non-NULL it is used to record the nodes visited,
8313 and to avoid visiting a node more than once. */
8316 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
8317 struct pointer_set_t *pset, walk_tree_lh lh)
8319 enum tree_code code;
8323 #define WALK_SUBTREE_TAIL(NODE) \
8327 goto tail_recurse; \
8332 /* Skip empty subtrees. */
8336 /* Don't walk the same tree twice, if the user has requested
8337 that we avoid doing so. */
8338 if (pset && pointer_set_insert (pset, *tp))
8341 /* Call the function. */
8343 result = (*func) (tp, &walk_subtrees, data);
8345 /* If we found something, return it. */
8349 code = TREE_CODE (*tp);
8351 /* Even if we didn't, FUNC may have decided that there was nothing
8352 interesting below this point in the tree. */
8355 /* But we still need to check our siblings. */
8356 if (code == TREE_LIST)
8357 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8358 else if (code == OMP_CLAUSE)
8359 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8366 result = (*lh) (tp, &walk_subtrees, func, data, pset);
8367 if (result || !walk_subtrees)
8374 case IDENTIFIER_NODE:
8381 case PLACEHOLDER_EXPR:
8385 /* None of these have subtrees other than those already walked
8390 WALK_SUBTREE (TREE_VALUE (*tp));
8391 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8396 int len = TREE_VEC_LENGTH (*tp);
8401 /* Walk all elements but the first. */
8403 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8405 /* Now walk the first one as a tail call. */
8406 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8410 WALK_SUBTREE (TREE_REALPART (*tp));
8411 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8415 unsigned HOST_WIDE_INT idx;
8416 constructor_elt *ce;
8419 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8421 WALK_SUBTREE (ce->value);
8426 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8431 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8433 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8434 into declarations that are just mentioned, rather than
8435 declared; they don't really belong to this part of the tree.
8436 And, we can see cycles: the initializer for a declaration
8437 can refer to the declaration itself. */
8438 WALK_SUBTREE (DECL_INITIAL (decl));
8439 WALK_SUBTREE (DECL_SIZE (decl));
8440 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8442 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8445 case STATEMENT_LIST:
8447 tree_stmt_iterator i;
8448 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8449 WALK_SUBTREE (*tsi_stmt_ptr (i));
8454 switch (OMP_CLAUSE_CODE (*tp))
8456 case OMP_CLAUSE_PRIVATE:
8457 case OMP_CLAUSE_SHARED:
8458 case OMP_CLAUSE_FIRSTPRIVATE:
8459 case OMP_CLAUSE_LASTPRIVATE:
8460 case OMP_CLAUSE_COPYIN:
8461 case OMP_CLAUSE_COPYPRIVATE:
8463 case OMP_CLAUSE_NUM_THREADS:
8464 case OMP_CLAUSE_SCHEDULE:
8465 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8468 case OMP_CLAUSE_NOWAIT:
8469 case OMP_CLAUSE_ORDERED:
8470 case OMP_CLAUSE_DEFAULT:
8471 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8473 case OMP_CLAUSE_REDUCTION:
8476 for (i = 0; i < 4; i++)
8477 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8478 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8490 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8491 But, we only want to walk once. */
8492 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8493 for (i = 0; i < len; ++i)
8494 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8495 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8499 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8500 defining. We only want to walk into these fields of a type in this
8501 case and not in the general case of a mere reference to the type.
8503 The criterion is as follows: if the field can be an expression, it
8504 must be walked only here. This should be in keeping with the fields
8505 that are directly gimplified in gimplify_type_sizes in order for the
8506 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8507 variable-sized types.
8509 Note that DECLs get walked as part of processing the BIND_EXPR. */
8510 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8512 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8513 if (TREE_CODE (*type_p) == ERROR_MARK)
8516 /* Call the function for the type. See if it returns anything or
8517 doesn't want us to continue. If we are to continue, walk both
8518 the normal fields and those for the declaration case. */
8519 result = (*func) (type_p, &walk_subtrees, data);
8520 if (result || !walk_subtrees)
8523 result = walk_type_fields (*type_p, func, data, pset, lh);
8527 /* If this is a record type, also walk the fields. */
8528 if (TREE_CODE (*type_p) == RECORD_TYPE
8529 || TREE_CODE (*type_p) == UNION_TYPE
8530 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8534 for (field = TYPE_FIELDS (*type_p); field;
8535 field = TREE_CHAIN (field))
8537 /* We'd like to look at the type of the field, but we can
8538 easily get infinite recursion. So assume it's pointed
8539 to elsewhere in the tree. Also, ignore things that
8541 if (TREE_CODE (field) != FIELD_DECL)
8544 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8545 WALK_SUBTREE (DECL_SIZE (field));
8546 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8547 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8548 WALK_SUBTREE (DECL_QUALIFIER (field));
8552 /* Same for scalar types. */
8553 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8554 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8555 || TREE_CODE (*type_p) == INTEGER_TYPE
8556 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
8557 || TREE_CODE (*type_p) == REAL_TYPE)
8559 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8560 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8563 WALK_SUBTREE (TYPE_SIZE (*type_p));
8564 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8569 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
8570 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code)))
8574 /* Walk over all the sub-trees of this operand. */
8575 len = TREE_OPERAND_LENGTH (*tp);
8577 /* Go through the subtrees. We need to do this in forward order so
8578 that the scope of a FOR_EXPR is handled properly. */
8581 for (i = 0; i < len - 1; ++i)
8582 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp, i));
8583 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp, len - 1));
8586 /* If this is a type, walk the needed fields in the type. */
8587 else if (TYPE_P (*tp))
8588 return walk_type_fields (*tp, func, data, pset, lh);
8592 /* We didn't find what we were looking for. */
8595 #undef WALK_SUBTREE_TAIL
8599 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8602 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
8606 struct pointer_set_t *pset;
8608 pset = pointer_set_create ();
8609 result = walk_tree_1 (tp, func, data, pset, lh);
8610 pointer_set_destroy (pset);
8615 /* Return true if STMT is an empty statement or contains nothing but
8616 empty statements. */
8619 empty_body_p (tree stmt)
8621 tree_stmt_iterator i;
8624 if (IS_EMPTY_STMT (stmt))
8626 else if (TREE_CODE (stmt) == BIND_EXPR)
8627 body = BIND_EXPR_BODY (stmt);
8628 else if (TREE_CODE (stmt) == STATEMENT_LIST)
8633 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
8634 if (!empty_body_p (tsi_stmt (i)))
8643 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8645 if (IS_EXPR_CODE_CLASS (c))
8646 return &t->exp.block;
8647 else if (IS_GIMPLE_STMT_CODE_CLASS (c))
8648 return &GIMPLE_STMT_BLOCK (t);
8654 generic_tree_operand (tree node, int i)
8656 if (GIMPLE_STMT_P (node))
8657 return &GIMPLE_STMT_OPERAND (node, i);
8658 return &TREE_OPERAND (node, i);
8662 generic_tree_type (tree node)
8664 if (GIMPLE_STMT_P (node))
8665 return &void_type_node;
8666 return &TREE_TYPE (node);
8669 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8670 FIXME: don't use this function. It exists for compatibility with
8671 the old representation of CALL_EXPRs where a list was used to hold the
8672 arguments. Places that currently extract the arglist from a CALL_EXPR
8673 ought to be rewritten to use the CALL_EXPR itself. */
8675 call_expr_arglist (tree exp)
8677 tree arglist = NULL_TREE;
8679 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
8680 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
8684 /* Return true if TYPE has a variable argument list. */
8687 stdarg_p (tree fntype)
8689 function_args_iterator args_iter;
8690 tree n = NULL_TREE, t;
8695 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8700 return n != NULL_TREE && n != void_type_node;
8703 /* Return true if TYPE has a prototype. */
8706 prototype_p (tree fntype)
8710 gcc_assert (fntype != NULL_TREE);
8712 t = TYPE_ARG_TYPES (fntype);
8713 return (t != NULL_TREE);
8716 /* Return the number of arguments that a function has. */
8719 function_args_count (tree fntype)
8721 function_args_iterator args_iter;
8727 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8736 /* If BLOCK is inlined from an __attribute__((__artificial__))
8737 routine, return pointer to location from where it has been
8740 block_nonartificial_location (tree block)
8742 location_t *ret = NULL;
8744 while (block && TREE_CODE (block) == BLOCK
8745 && BLOCK_ABSTRACT_ORIGIN (block))
8747 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
8749 while (TREE_CODE (ao) == BLOCK && BLOCK_ABSTRACT_ORIGIN (ao))
8750 ao = BLOCK_ABSTRACT_ORIGIN (ao);
8752 if (TREE_CODE (ao) == FUNCTION_DECL)
8754 /* If AO is an artificial inline, point RET to the
8755 call site locus at which it has been inlined and continue
8756 the loop, in case AO's caller is also an artificial
8758 if (DECL_DECLARED_INLINE_P (ao)
8759 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
8760 ret = &BLOCK_SOURCE_LOCATION (block);
8764 else if (TREE_CODE (ao) != BLOCK)
8767 block = BLOCK_SUPERCONTEXT (block);
8772 #include "gt-tree.h"