1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 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[STRUCT_FIELD_TAG][TS_DECL_MINIMAL] = 1;
267 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
268 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
269 tree_contains_struct[MEMORY_PARTITION_TAG][TS_DECL_MINIMAL] = 1;
271 tree_contains_struct[STRUCT_FIELD_TAG][TS_MEMORY_TAG] = 1;
272 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
273 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
274 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_TAG] = 1;
276 tree_contains_struct[STRUCT_FIELD_TAG][TS_STRUCT_FIELD_TAG] = 1;
277 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_PARTITION_TAG] = 1;
279 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
280 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
281 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
282 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
284 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
285 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
286 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
287 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
288 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
289 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
290 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
291 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
293 lang_hooks.init_ts ();
297 /* The name of the object as the assembler will see it (but before any
298 translations made by ASM_OUTPUT_LABELREF). Often this is the same
299 as DECL_NAME. It is an IDENTIFIER_NODE. */
301 decl_assembler_name (tree decl)
303 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
304 lang_hooks.set_decl_assembler_name (decl);
305 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
308 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
311 decl_assembler_name_equal (tree decl, tree asmname)
313 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
315 if (decl_asmname == asmname)
318 /* If the target assembler name was set by the user, things are trickier.
319 We have a leading '*' to begin with. After that, it's arguable what
320 is the correct thing to do with -fleading-underscore. Arguably, we've
321 historically been doing the wrong thing in assemble_alias by always
322 printing the leading underscore. Since we're not changing that, make
323 sure user_label_prefix follows the '*' before matching. */
324 if (IDENTIFIER_POINTER (decl_asmname)[0] == '*')
326 const char *decl_str = IDENTIFIER_POINTER (decl_asmname) + 1;
327 size_t ulp_len = strlen (user_label_prefix);
331 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
336 return strcmp (decl_str, IDENTIFIER_POINTER (asmname)) == 0;
342 /* Compute the number of bytes occupied by a tree with code CODE.
343 This function cannot be used for nodes that have variable sizes,
344 including TREE_VEC, PHI_NODE, STRING_CST, and CALL_EXPR. */
346 tree_code_size (enum tree_code code)
348 switch (TREE_CODE_CLASS (code))
350 case tcc_declaration: /* A decl node */
355 return sizeof (struct tree_field_decl);
357 return sizeof (struct tree_parm_decl);
359 return sizeof (struct tree_var_decl);
361 return sizeof (struct tree_label_decl);
363 return sizeof (struct tree_result_decl);
365 return sizeof (struct tree_const_decl);
367 return sizeof (struct tree_type_decl);
369 return sizeof (struct tree_function_decl);
370 case NAME_MEMORY_TAG:
371 case SYMBOL_MEMORY_TAG:
372 return sizeof (struct tree_memory_tag);
373 case STRUCT_FIELD_TAG:
374 return sizeof (struct tree_struct_field_tag);
375 case MEMORY_PARTITION_TAG:
376 return sizeof (struct tree_memory_partition_tag);
378 return sizeof (struct tree_decl_non_common);
382 case tcc_type: /* a type node */
383 return sizeof (struct tree_type);
385 case tcc_reference: /* a reference */
386 case tcc_expression: /* an expression */
387 case tcc_statement: /* an expression with side effects */
388 case tcc_comparison: /* a comparison expression */
389 case tcc_unary: /* a unary arithmetic expression */
390 case tcc_binary: /* a binary arithmetic expression */
391 return (sizeof (struct tree_exp)
392 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
394 case tcc_gimple_stmt:
395 return (sizeof (struct gimple_stmt)
396 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
398 case tcc_constant: /* a constant */
401 case INTEGER_CST: return sizeof (struct tree_int_cst);
402 case REAL_CST: return sizeof (struct tree_real_cst);
403 case FIXED_CST: return sizeof (struct tree_fixed_cst);
404 case COMPLEX_CST: return sizeof (struct tree_complex);
405 case VECTOR_CST: return sizeof (struct tree_vector);
406 case STRING_CST: gcc_unreachable ();
408 return lang_hooks.tree_size (code);
411 case tcc_exceptional: /* something random, like an identifier. */
414 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
415 case TREE_LIST: return sizeof (struct tree_list);
418 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
422 case PHI_NODE: gcc_unreachable ();
424 case SSA_NAME: return sizeof (struct tree_ssa_name);
426 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
427 case BLOCK: return sizeof (struct tree_block);
428 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
429 case CONSTRUCTOR: return sizeof (struct tree_constructor);
432 return lang_hooks.tree_size (code);
440 /* Compute the number of bytes occupied by NODE. This routine only
441 looks at TREE_CODE, except for those nodes that have variable sizes. */
443 tree_size (const_tree node)
445 const enum tree_code code = TREE_CODE (node);
449 return (sizeof (struct tree_phi_node)
450 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
453 return (offsetof (struct tree_binfo, base_binfos)
454 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
457 return (sizeof (struct tree_vec)
458 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
461 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
464 return (sizeof (struct tree_omp_clause)
465 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
469 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
470 return (sizeof (struct tree_exp)
471 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
473 return tree_code_size (code);
477 /* Return a newly allocated node of code CODE. For decl and type
478 nodes, some other fields are initialized. The rest of the node is
479 initialized to zero. This function cannot be used for PHI_NODE,
480 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
483 Achoo! I got a code in the node. */
486 make_node_stat (enum tree_code code MEM_STAT_DECL)
489 enum tree_code_class type = TREE_CODE_CLASS (code);
490 size_t length = tree_code_size (code);
491 #ifdef GATHER_STATISTICS
496 case tcc_declaration: /* A decl node */
500 case tcc_type: /* a type node */
504 case tcc_statement: /* an expression with side effects */
508 case tcc_reference: /* a reference */
512 case tcc_expression: /* an expression */
513 case tcc_comparison: /* a comparison expression */
514 case tcc_unary: /* a unary arithmetic expression */
515 case tcc_binary: /* a binary arithmetic expression */
519 case tcc_constant: /* a constant */
523 case tcc_gimple_stmt:
524 kind = gimple_stmt_kind;
527 case tcc_exceptional: /* something random, like an identifier. */
530 case IDENTIFIER_NODE:
547 kind = ssa_name_kind;
568 tree_node_counts[(int) kind]++;
569 tree_node_sizes[(int) kind] += length;
572 if (code == IDENTIFIER_NODE)
573 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
575 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
577 memset (t, 0, length);
579 TREE_SET_CODE (t, code);
584 TREE_SIDE_EFFECTS (t) = 1;
587 case tcc_declaration:
588 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
589 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
590 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
592 if (code == FUNCTION_DECL)
594 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
595 DECL_MODE (t) = FUNCTION_MODE;
599 /* We have not yet computed the alias set for this declaration. */
600 DECL_POINTER_ALIAS_SET (t) = -1;
602 DECL_SOURCE_LOCATION (t) = input_location;
603 DECL_UID (t) = next_decl_uid++;
608 TYPE_UID (t) = next_type_uid++;
609 TYPE_ALIGN (t) = BITS_PER_UNIT;
610 TYPE_USER_ALIGN (t) = 0;
611 TYPE_MAIN_VARIANT (t) = t;
612 TYPE_CANONICAL (t) = t;
614 /* Default to no attributes for type, but let target change that. */
615 TYPE_ATTRIBUTES (t) = NULL_TREE;
616 targetm.set_default_type_attributes (t);
618 /* We have not yet computed the alias set for this type. */
619 TYPE_ALIAS_SET (t) = -1;
623 TREE_CONSTANT (t) = 1;
624 TREE_INVARIANT (t) = 1;
633 case PREDECREMENT_EXPR:
634 case PREINCREMENT_EXPR:
635 case POSTDECREMENT_EXPR:
636 case POSTINCREMENT_EXPR:
637 /* All of these have side-effects, no matter what their
639 TREE_SIDE_EFFECTS (t) = 1;
647 case tcc_gimple_stmt:
650 case GIMPLE_MODIFY_STMT:
651 TREE_SIDE_EFFECTS (t) = 1;
659 /* Other classes need no special treatment. */
666 /* Return a new node with the same contents as NODE except that its
667 TREE_CHAIN is zero and it has a fresh uid. */
670 copy_node_stat (tree node MEM_STAT_DECL)
673 enum tree_code code = TREE_CODE (node);
676 gcc_assert (code != STATEMENT_LIST);
678 length = tree_size (node);
679 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
680 memcpy (t, node, length);
682 if (!GIMPLE_TUPLE_P (node))
684 TREE_ASM_WRITTEN (t) = 0;
685 TREE_VISITED (t) = 0;
688 if (TREE_CODE_CLASS (code) == tcc_declaration)
690 DECL_UID (t) = next_decl_uid++;
691 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
692 && DECL_HAS_VALUE_EXPR_P (node))
694 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
695 DECL_HAS_VALUE_EXPR_P (t) = 1;
697 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
699 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
700 DECL_HAS_INIT_PRIORITY_P (t) = 1;
702 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
704 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
705 DECL_BASED_ON_RESTRICT_P (t) = 1;
708 else if (TREE_CODE_CLASS (code) == tcc_type)
710 TYPE_UID (t) = next_type_uid++;
711 /* The following is so that the debug code for
712 the copy is different from the original type.
713 The two statements usually duplicate each other
714 (because they clear fields of the same union),
715 but the optimizer should catch that. */
716 TYPE_SYMTAB_POINTER (t) = 0;
717 TYPE_SYMTAB_ADDRESS (t) = 0;
719 /* Do not copy the values cache. */
720 if (TYPE_CACHED_VALUES_P(t))
722 TYPE_CACHED_VALUES_P (t) = 0;
723 TYPE_CACHED_VALUES (t) = NULL_TREE;
730 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
731 For example, this can copy a list made of TREE_LIST nodes. */
734 copy_list (tree list)
742 head = prev = copy_node (list);
743 next = TREE_CHAIN (list);
746 TREE_CHAIN (prev) = copy_node (next);
747 prev = TREE_CHAIN (prev);
748 next = TREE_CHAIN (next);
754 /* Create an INT_CST node with a LOW value sign extended. */
757 build_int_cst (tree type, HOST_WIDE_INT low)
759 /* Support legacy code. */
761 type = integer_type_node;
763 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
766 /* Create an INT_CST node with a LOW value zero extended. */
769 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
771 return build_int_cst_wide (type, low, 0);
774 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
775 if it is negative. This function is similar to build_int_cst, but
776 the extra bits outside of the type precision are cleared. Constants
777 with these extra bits may confuse the fold so that it detects overflows
778 even in cases when they do not occur, and in general should be avoided.
779 We cannot however make this a default behavior of build_int_cst without
780 more intrusive changes, since there are parts of gcc that rely on the extra
781 precision of the integer constants. */
784 build_int_cst_type (tree type, HOST_WIDE_INT low)
786 unsigned HOST_WIDE_INT low1;
791 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
793 return build_int_cst_wide (type, low1, hi);
796 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
797 and sign extended according to the value range of TYPE. */
800 build_int_cst_wide_type (tree type,
801 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
803 fit_double_type (low, high, &low, &high, type);
804 return build_int_cst_wide (type, low, high);
807 /* These are the hash table functions for the hash table of INTEGER_CST
808 nodes of a sizetype. */
810 /* Return the hash code code X, an INTEGER_CST. */
813 int_cst_hash_hash (const void *x)
815 const_tree const t = (const_tree) x;
817 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
818 ^ htab_hash_pointer (TREE_TYPE (t)));
821 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
822 is the same as that given by *Y, which is the same. */
825 int_cst_hash_eq (const void *x, const void *y)
827 const_tree const xt = (const_tree) x;
828 const_tree const yt = (const_tree) y;
830 return (TREE_TYPE (xt) == TREE_TYPE (yt)
831 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
832 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
835 /* Create an INT_CST node of TYPE and value HI:LOW.
836 The returned node is always shared. For small integers we use a
837 per-type vector cache, for larger ones we use a single hash table. */
840 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
848 switch (TREE_CODE (type))
852 /* Cache NULL pointer. */
861 /* Cache false or true. */
869 if (TYPE_UNSIGNED (type))
872 limit = INTEGER_SHARE_LIMIT;
873 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
879 limit = INTEGER_SHARE_LIMIT + 1;
880 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
882 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
896 /* Look for it in the type's vector of small shared ints. */
897 if (!TYPE_CACHED_VALUES_P (type))
899 TYPE_CACHED_VALUES_P (type) = 1;
900 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
903 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
906 /* Make sure no one is clobbering the shared constant. */
907 gcc_assert (TREE_TYPE (t) == type);
908 gcc_assert (TREE_INT_CST_LOW (t) == low);
909 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
913 /* Create a new shared int. */
914 t = make_node (INTEGER_CST);
916 TREE_INT_CST_LOW (t) = low;
917 TREE_INT_CST_HIGH (t) = hi;
918 TREE_TYPE (t) = type;
920 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
925 /* Use the cache of larger shared ints. */
928 TREE_INT_CST_LOW (int_cst_node) = low;
929 TREE_INT_CST_HIGH (int_cst_node) = hi;
930 TREE_TYPE (int_cst_node) = type;
932 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
936 /* Insert this one into the hash table. */
939 /* Make a new node for next time round. */
940 int_cst_node = make_node (INTEGER_CST);
947 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
948 and the rest are zeros. */
951 build_low_bits_mask (tree type, unsigned bits)
953 unsigned HOST_WIDE_INT low;
955 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
957 gcc_assert (bits <= TYPE_PRECISION (type));
959 if (bits == TYPE_PRECISION (type)
960 && !TYPE_UNSIGNED (type))
962 /* Sign extended all-ones mask. */
966 else if (bits <= HOST_BITS_PER_WIDE_INT)
968 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
973 bits -= HOST_BITS_PER_WIDE_INT;
975 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
978 return build_int_cst_wide (type, low, high);
981 /* Checks that X is integer constant that can be expressed in (unsigned)
982 HOST_WIDE_INT without loss of precision. */
985 cst_and_fits_in_hwi (const_tree x)
987 if (TREE_CODE (x) != INTEGER_CST)
990 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
993 return (TREE_INT_CST_HIGH (x) == 0
994 || TREE_INT_CST_HIGH (x) == -1);
997 /* Return a new VECTOR_CST node whose type is TYPE and whose values
998 are in a list pointed to by VALS. */
1001 build_vector (tree type, tree vals)
1003 tree v = make_node (VECTOR_CST);
1007 TREE_VECTOR_CST_ELTS (v) = vals;
1008 TREE_TYPE (v) = type;
1010 /* Iterate through elements and check for overflow. */
1011 for (link = vals; link; link = TREE_CHAIN (link))
1013 tree value = TREE_VALUE (link);
1015 /* Don't crash if we get an address constant. */
1016 if (!CONSTANT_CLASS_P (value))
1019 over |= TREE_OVERFLOW (value);
1022 TREE_OVERFLOW (v) = over;
1026 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1027 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1030 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1032 tree list = NULL_TREE;
1033 unsigned HOST_WIDE_INT idx;
1036 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1037 list = tree_cons (NULL_TREE, value, list);
1038 return build_vector (type, nreverse (list));
1041 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1042 are in the VEC pointed to by VALS. */
1044 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1046 tree c = make_node (CONSTRUCTOR);
1047 TREE_TYPE (c) = type;
1048 CONSTRUCTOR_ELTS (c) = vals;
1052 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1055 build_constructor_single (tree type, tree index, tree value)
1057 VEC(constructor_elt,gc) *v;
1058 constructor_elt *elt;
1061 v = VEC_alloc (constructor_elt, gc, 1);
1062 elt = VEC_quick_push (constructor_elt, v, NULL);
1066 t = build_constructor (type, v);
1067 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1072 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1073 are in a list pointed to by VALS. */
1075 build_constructor_from_list (tree type, tree vals)
1078 VEC(constructor_elt,gc) *v = NULL;
1079 bool constant_p = true;
1083 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1084 for (t = vals; t; t = TREE_CHAIN (t))
1086 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1087 val = TREE_VALUE (t);
1088 elt->index = TREE_PURPOSE (t);
1090 if (!TREE_CONSTANT (val))
1095 t = build_constructor (type, v);
1096 TREE_CONSTANT (t) = constant_p;
1100 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1103 build_fixed (tree type, FIXED_VALUE_TYPE f)
1106 FIXED_VALUE_TYPE *fp;
1108 v = make_node (FIXED_CST);
1109 fp = ggc_alloc (sizeof (FIXED_VALUE_TYPE));
1110 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1112 TREE_TYPE (v) = type;
1113 TREE_FIXED_CST_PTR (v) = fp;
1117 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1120 build_real (tree type, REAL_VALUE_TYPE d)
1123 REAL_VALUE_TYPE *dp;
1126 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1127 Consider doing it via real_convert now. */
1129 v = make_node (REAL_CST);
1130 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1131 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1133 TREE_TYPE (v) = type;
1134 TREE_REAL_CST_PTR (v) = dp;
1135 TREE_OVERFLOW (v) = overflow;
1139 /* Return a new REAL_CST node whose type is TYPE
1140 and whose value is the integer value of the INTEGER_CST node I. */
1143 real_value_from_int_cst (const_tree type, const_tree i)
1147 /* Clear all bits of the real value type so that we can later do
1148 bitwise comparisons to see if two values are the same. */
1149 memset (&d, 0, sizeof d);
1151 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1152 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1153 TYPE_UNSIGNED (TREE_TYPE (i)));
1157 /* Given a tree representing an integer constant I, return a tree
1158 representing the same value as a floating-point constant of type TYPE. */
1161 build_real_from_int_cst (tree type, const_tree i)
1164 int overflow = TREE_OVERFLOW (i);
1166 v = build_real (type, real_value_from_int_cst (type, i));
1168 TREE_OVERFLOW (v) |= overflow;
1172 /* Return a newly constructed STRING_CST node whose value is
1173 the LEN characters at STR.
1174 The TREE_TYPE is not initialized. */
1177 build_string (int len, const char *str)
1182 /* Do not waste bytes provided by padding of struct tree_string. */
1183 length = len + offsetof (struct tree_string, str) + 1;
1185 #ifdef GATHER_STATISTICS
1186 tree_node_counts[(int) c_kind]++;
1187 tree_node_sizes[(int) c_kind] += length;
1190 s = ggc_alloc_tree (length);
1192 memset (s, 0, sizeof (struct tree_common));
1193 TREE_SET_CODE (s, STRING_CST);
1194 TREE_CONSTANT (s) = 1;
1195 TREE_INVARIANT (s) = 1;
1196 TREE_STRING_LENGTH (s) = len;
1197 memcpy (CONST_CAST (TREE_STRING_POINTER (s)), str, len);
1198 ((char *) CONST_CAST (TREE_STRING_POINTER (s)))[len] = '\0';
1203 /* Return a newly constructed COMPLEX_CST node whose value is
1204 specified by the real and imaginary parts REAL and IMAG.
1205 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1206 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1209 build_complex (tree type, tree real, tree imag)
1211 tree t = make_node (COMPLEX_CST);
1213 TREE_REALPART (t) = real;
1214 TREE_IMAGPART (t) = imag;
1215 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1216 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1220 /* Return a constant of arithmetic type TYPE which is the
1221 multiplicative identity of the set TYPE. */
1224 build_one_cst (tree type)
1226 switch (TREE_CODE (type))
1228 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1229 case POINTER_TYPE: case REFERENCE_TYPE:
1231 return build_int_cst (type, 1);
1234 return build_real (type, dconst1);
1236 case FIXED_POINT_TYPE:
1237 /* We can only generate 1 for accum types. */
1238 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1239 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1246 scalar = build_one_cst (TREE_TYPE (type));
1248 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1250 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1251 cst = tree_cons (NULL_TREE, scalar, cst);
1253 return build_vector (type, cst);
1257 return build_complex (type,
1258 build_one_cst (TREE_TYPE (type)),
1259 fold_convert (TREE_TYPE (type), integer_zero_node));
1266 /* Build a BINFO with LEN language slots. */
1269 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1272 size_t length = (offsetof (struct tree_binfo, base_binfos)
1273 + VEC_embedded_size (tree, base_binfos));
1275 #ifdef GATHER_STATISTICS
1276 tree_node_counts[(int) binfo_kind]++;
1277 tree_node_sizes[(int) binfo_kind] += length;
1280 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1282 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1284 TREE_SET_CODE (t, TREE_BINFO);
1286 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1292 /* Build a newly constructed TREE_VEC node of length LEN. */
1295 make_tree_vec_stat (int len MEM_STAT_DECL)
1298 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1300 #ifdef GATHER_STATISTICS
1301 tree_node_counts[(int) vec_kind]++;
1302 tree_node_sizes[(int) vec_kind] += length;
1305 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1307 memset (t, 0, length);
1309 TREE_SET_CODE (t, TREE_VEC);
1310 TREE_VEC_LENGTH (t) = len;
1315 /* Return 1 if EXPR is the integer constant zero or a complex constant
1319 integer_zerop (const_tree expr)
1323 return ((TREE_CODE (expr) == INTEGER_CST
1324 && TREE_INT_CST_LOW (expr) == 0
1325 && TREE_INT_CST_HIGH (expr) == 0)
1326 || (TREE_CODE (expr) == COMPLEX_CST
1327 && integer_zerop (TREE_REALPART (expr))
1328 && integer_zerop (TREE_IMAGPART (expr))));
1331 /* Return 1 if EXPR is the integer constant one or the corresponding
1332 complex constant. */
1335 integer_onep (const_tree expr)
1339 return ((TREE_CODE (expr) == INTEGER_CST
1340 && TREE_INT_CST_LOW (expr) == 1
1341 && TREE_INT_CST_HIGH (expr) == 0)
1342 || (TREE_CODE (expr) == COMPLEX_CST
1343 && integer_onep (TREE_REALPART (expr))
1344 && integer_zerop (TREE_IMAGPART (expr))));
1347 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1348 it contains. Likewise for the corresponding complex constant. */
1351 integer_all_onesp (const_tree expr)
1358 if (TREE_CODE (expr) == COMPLEX_CST
1359 && integer_all_onesp (TREE_REALPART (expr))
1360 && integer_zerop (TREE_IMAGPART (expr)))
1363 else if (TREE_CODE (expr) != INTEGER_CST)
1366 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1367 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1368 && TREE_INT_CST_HIGH (expr) == -1)
1373 /* Note that using TYPE_PRECISION here is wrong. We care about the
1374 actual bits, not the (arbitrary) range of the type. */
1375 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1376 if (prec >= HOST_BITS_PER_WIDE_INT)
1378 HOST_WIDE_INT high_value;
1381 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1383 /* Can not handle precisions greater than twice the host int size. */
1384 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1385 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1386 /* Shifting by the host word size is undefined according to the ANSI
1387 standard, so we must handle this as a special case. */
1390 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1392 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1393 && TREE_INT_CST_HIGH (expr) == high_value);
1396 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1399 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1403 integer_pow2p (const_tree expr)
1406 HOST_WIDE_INT high, low;
1410 if (TREE_CODE (expr) == COMPLEX_CST
1411 && integer_pow2p (TREE_REALPART (expr))
1412 && integer_zerop (TREE_IMAGPART (expr)))
1415 if (TREE_CODE (expr) != INTEGER_CST)
1418 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1419 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1420 high = TREE_INT_CST_HIGH (expr);
1421 low = TREE_INT_CST_LOW (expr);
1423 /* First clear all bits that are beyond the type's precision in case
1424 we've been sign extended. */
1426 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1428 else if (prec > HOST_BITS_PER_WIDE_INT)
1429 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1433 if (prec < HOST_BITS_PER_WIDE_INT)
1434 low &= ~((HOST_WIDE_INT) (-1) << prec);
1437 if (high == 0 && low == 0)
1440 return ((high == 0 && (low & (low - 1)) == 0)
1441 || (low == 0 && (high & (high - 1)) == 0));
1444 /* Return 1 if EXPR is an integer constant other than zero or a
1445 complex constant other than zero. */
1448 integer_nonzerop (const_tree expr)
1452 return ((TREE_CODE (expr) == INTEGER_CST
1453 && (TREE_INT_CST_LOW (expr) != 0
1454 || TREE_INT_CST_HIGH (expr) != 0))
1455 || (TREE_CODE (expr) == COMPLEX_CST
1456 && (integer_nonzerop (TREE_REALPART (expr))
1457 || integer_nonzerop (TREE_IMAGPART (expr)))));
1460 /* Return 1 if EXPR is the fixed-point constant zero. */
1463 fixed_zerop (const_tree expr)
1465 return (TREE_CODE (expr) == FIXED_CST
1466 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1469 /* Return the power of two represented by a tree node known to be a
1473 tree_log2 (const_tree expr)
1476 HOST_WIDE_INT high, low;
1480 if (TREE_CODE (expr) == COMPLEX_CST)
1481 return tree_log2 (TREE_REALPART (expr));
1483 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1484 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1486 high = TREE_INT_CST_HIGH (expr);
1487 low = TREE_INT_CST_LOW (expr);
1489 /* First clear all bits that are beyond the type's precision in case
1490 we've been sign extended. */
1492 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1494 else if (prec > HOST_BITS_PER_WIDE_INT)
1495 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1499 if (prec < HOST_BITS_PER_WIDE_INT)
1500 low &= ~((HOST_WIDE_INT) (-1) << prec);
1503 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1504 : exact_log2 (low));
1507 /* Similar, but return the largest integer Y such that 2 ** Y is less
1508 than or equal to EXPR. */
1511 tree_floor_log2 (const_tree expr)
1514 HOST_WIDE_INT high, low;
1518 if (TREE_CODE (expr) == COMPLEX_CST)
1519 return tree_log2 (TREE_REALPART (expr));
1521 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1522 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1524 high = TREE_INT_CST_HIGH (expr);
1525 low = TREE_INT_CST_LOW (expr);
1527 /* First clear all bits that are beyond the type's precision in case
1528 we've been sign extended. Ignore if type's precision hasn't been set
1529 since what we are doing is setting it. */
1531 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1533 else if (prec > HOST_BITS_PER_WIDE_INT)
1534 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1538 if (prec < HOST_BITS_PER_WIDE_INT)
1539 low &= ~((HOST_WIDE_INT) (-1) << prec);
1542 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1543 : floor_log2 (low));
1546 /* Return 1 if EXPR is the real constant zero. */
1549 real_zerop (const_tree expr)
1553 return ((TREE_CODE (expr) == REAL_CST
1554 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1555 || (TREE_CODE (expr) == COMPLEX_CST
1556 && real_zerop (TREE_REALPART (expr))
1557 && real_zerop (TREE_IMAGPART (expr))));
1560 /* Return 1 if EXPR is the real constant one in real or complex form. */
1563 real_onep (const_tree expr)
1567 return ((TREE_CODE (expr) == REAL_CST
1568 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1569 || (TREE_CODE (expr) == COMPLEX_CST
1570 && real_onep (TREE_REALPART (expr))
1571 && real_zerop (TREE_IMAGPART (expr))));
1574 /* Return 1 if EXPR is the real constant two. */
1577 real_twop (const_tree expr)
1581 return ((TREE_CODE (expr) == REAL_CST
1582 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1583 || (TREE_CODE (expr) == COMPLEX_CST
1584 && real_twop (TREE_REALPART (expr))
1585 && real_zerop (TREE_IMAGPART (expr))));
1588 /* Return 1 if EXPR is the real constant minus one. */
1591 real_minus_onep (const_tree expr)
1595 return ((TREE_CODE (expr) == REAL_CST
1596 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1597 || (TREE_CODE (expr) == COMPLEX_CST
1598 && real_minus_onep (TREE_REALPART (expr))
1599 && real_zerop (TREE_IMAGPART (expr))));
1602 /* Nonzero if EXP is a constant or a cast of a constant. */
1605 really_constant_p (const_tree exp)
1607 /* This is not quite the same as STRIP_NOPS. It does more. */
1608 while (TREE_CODE (exp) == NOP_EXPR
1609 || TREE_CODE (exp) == CONVERT_EXPR
1610 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1611 exp = TREE_OPERAND (exp, 0);
1612 return TREE_CONSTANT (exp);
1615 /* Return first list element whose TREE_VALUE is ELEM.
1616 Return 0 if ELEM is not in LIST. */
1619 value_member (tree elem, tree list)
1623 if (elem == TREE_VALUE (list))
1625 list = TREE_CHAIN (list);
1630 /* Return first list element whose TREE_PURPOSE is ELEM.
1631 Return 0 if ELEM is not in LIST. */
1634 purpose_member (const_tree elem, tree list)
1638 if (elem == TREE_PURPOSE (list))
1640 list = TREE_CHAIN (list);
1645 /* Return nonzero if ELEM is part of the chain CHAIN. */
1648 chain_member (const_tree elem, const_tree chain)
1654 chain = TREE_CHAIN (chain);
1660 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1661 We expect a null pointer to mark the end of the chain.
1662 This is the Lisp primitive `length'. */
1665 list_length (const_tree t)
1668 #ifdef ENABLE_TREE_CHECKING
1676 #ifdef ENABLE_TREE_CHECKING
1679 gcc_assert (p != q);
1687 /* Returns the number of FIELD_DECLs in TYPE. */
1690 fields_length (const_tree type)
1692 tree t = TYPE_FIELDS (type);
1695 for (; t; t = TREE_CHAIN (t))
1696 if (TREE_CODE (t) == FIELD_DECL)
1702 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1703 by modifying the last node in chain 1 to point to chain 2.
1704 This is the Lisp primitive `nconc'. */
1707 chainon (tree op1, tree op2)
1716 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1718 TREE_CHAIN (t1) = op2;
1720 #ifdef ENABLE_TREE_CHECKING
1723 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1724 gcc_assert (t2 != t1);
1731 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1734 tree_last (tree chain)
1738 while ((next = TREE_CHAIN (chain)))
1743 /* Reverse the order of elements in the chain T,
1744 and return the new head of the chain (old last element). */
1749 tree prev = 0, decl, next;
1750 for (decl = t; decl; decl = next)
1752 next = TREE_CHAIN (decl);
1753 TREE_CHAIN (decl) = prev;
1759 /* Return a newly created TREE_LIST node whose
1760 purpose and value fields are PARM and VALUE. */
1763 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1765 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1766 TREE_PURPOSE (t) = parm;
1767 TREE_VALUE (t) = value;
1771 /* Return a newly created TREE_LIST node whose
1772 purpose and value fields are PURPOSE and VALUE
1773 and whose TREE_CHAIN is CHAIN. */
1776 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1780 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1782 memset (node, 0, sizeof (struct tree_common));
1784 #ifdef GATHER_STATISTICS
1785 tree_node_counts[(int) x_kind]++;
1786 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1789 TREE_SET_CODE (node, TREE_LIST);
1790 TREE_CHAIN (node) = chain;
1791 TREE_PURPOSE (node) = purpose;
1792 TREE_VALUE (node) = value;
1797 /* Return the size nominally occupied by an object of type TYPE
1798 when it resides in memory. The value is measured in units of bytes,
1799 and its data type is that normally used for type sizes
1800 (which is the first type created by make_signed_type or
1801 make_unsigned_type). */
1804 size_in_bytes (const_tree type)
1808 if (type == error_mark_node)
1809 return integer_zero_node;
1811 type = TYPE_MAIN_VARIANT (type);
1812 t = TYPE_SIZE_UNIT (type);
1816 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1817 return size_zero_node;
1823 /* Return the size of TYPE (in bytes) as a wide integer
1824 or return -1 if the size can vary or is larger than an integer. */
1827 int_size_in_bytes (const_tree type)
1831 if (type == error_mark_node)
1834 type = TYPE_MAIN_VARIANT (type);
1835 t = TYPE_SIZE_UNIT (type);
1837 || TREE_CODE (t) != INTEGER_CST
1838 || TREE_INT_CST_HIGH (t) != 0
1839 /* If the result would appear negative, it's too big to represent. */
1840 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1843 return TREE_INT_CST_LOW (t);
1846 /* Return the maximum size of TYPE (in bytes) as a wide integer
1847 or return -1 if the size can vary or is larger than an integer. */
1850 max_int_size_in_bytes (const_tree type)
1852 HOST_WIDE_INT size = -1;
1855 /* If this is an array type, check for a possible MAX_SIZE attached. */
1857 if (TREE_CODE (type) == ARRAY_TYPE)
1859 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1861 if (size_tree && host_integerp (size_tree, 1))
1862 size = tree_low_cst (size_tree, 1);
1865 /* If we still haven't been able to get a size, see if the language
1866 can compute a maximum size. */
1870 size_tree = lang_hooks.types.max_size (type);
1872 if (size_tree && host_integerp (size_tree, 1))
1873 size = tree_low_cst (size_tree, 1);
1879 /* Return the bit position of FIELD, in bits from the start of the record.
1880 This is a tree of type bitsizetype. */
1883 bit_position (const_tree field)
1885 return bit_from_pos (DECL_FIELD_OFFSET (field),
1886 DECL_FIELD_BIT_OFFSET (field));
1889 /* Likewise, but return as an integer. It must be representable in
1890 that way (since it could be a signed value, we don't have the
1891 option of returning -1 like int_size_in_byte can. */
1894 int_bit_position (const_tree field)
1896 return tree_low_cst (bit_position (field), 0);
1899 /* Return the byte position of FIELD, in bytes from the start of the record.
1900 This is a tree of type sizetype. */
1903 byte_position (const_tree field)
1905 return byte_from_pos (DECL_FIELD_OFFSET (field),
1906 DECL_FIELD_BIT_OFFSET (field));
1909 /* Likewise, but return as an integer. It must be representable in
1910 that way (since it could be a signed value, we don't have the
1911 option of returning -1 like int_size_in_byte can. */
1914 int_byte_position (const_tree field)
1916 return tree_low_cst (byte_position (field), 0);
1919 /* Return the strictest alignment, in bits, that T is known to have. */
1922 expr_align (const_tree t)
1924 unsigned int align0, align1;
1926 switch (TREE_CODE (t))
1928 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1929 /* If we have conversions, we know that the alignment of the
1930 object must meet each of the alignments of the types. */
1931 align0 = expr_align (TREE_OPERAND (t, 0));
1932 align1 = TYPE_ALIGN (TREE_TYPE (t));
1933 return MAX (align0, align1);
1935 case GIMPLE_MODIFY_STMT:
1936 /* We should never ask for the alignment of a gimple statement. */
1939 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1940 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1941 case CLEANUP_POINT_EXPR:
1942 /* These don't change the alignment of an object. */
1943 return expr_align (TREE_OPERAND (t, 0));
1946 /* The best we can do is say that the alignment is the least aligned
1948 align0 = expr_align (TREE_OPERAND (t, 1));
1949 align1 = expr_align (TREE_OPERAND (t, 2));
1950 return MIN (align0, align1);
1952 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
1953 meaningfully, it's always 1. */
1954 case LABEL_DECL: case CONST_DECL:
1955 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1957 gcc_assert (DECL_ALIGN (t) != 0);
1958 return DECL_ALIGN (t);
1964 /* Otherwise take the alignment from that of the type. */
1965 return TYPE_ALIGN (TREE_TYPE (t));
1968 /* Return, as a tree node, the number of elements for TYPE (which is an
1969 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1972 array_type_nelts (const_tree type)
1974 tree index_type, min, max;
1976 /* If they did it with unspecified bounds, then we should have already
1977 given an error about it before we got here. */
1978 if (! TYPE_DOMAIN (type))
1979 return error_mark_node;
1981 index_type = TYPE_DOMAIN (type);
1982 min = TYPE_MIN_VALUE (index_type);
1983 max = TYPE_MAX_VALUE (index_type);
1985 return (integer_zerop (min)
1987 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1990 /* If arg is static -- a reference to an object in static storage -- then
1991 return the object. This is not the same as the C meaning of `static'.
1992 If arg isn't static, return NULL. */
1997 switch (TREE_CODE (arg))
2000 /* Nested functions are static, even though taking their address will
2001 involve a trampoline as we unnest the nested function and create
2002 the trampoline on the tree level. */
2006 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2007 && ! DECL_THREAD_LOCAL_P (arg)
2008 && ! DECL_DLLIMPORT_P (arg)
2012 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2016 return TREE_STATIC (arg) ? arg : NULL;
2023 /* If the thing being referenced is not a field, then it is
2024 something language specific. */
2025 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
2026 return (*lang_hooks.staticp) (arg);
2028 /* If we are referencing a bitfield, we can't evaluate an
2029 ADDR_EXPR at compile time and so it isn't a constant. */
2030 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2033 return staticp (TREE_OPERAND (arg, 0));
2038 case MISALIGNED_INDIRECT_REF:
2039 case ALIGN_INDIRECT_REF:
2041 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2044 case ARRAY_RANGE_REF:
2045 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2046 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2047 return staticp (TREE_OPERAND (arg, 0));
2052 if ((unsigned int) TREE_CODE (arg)
2053 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2054 return lang_hooks.staticp (arg);
2060 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2061 Do this to any expression which may be used in more than one place,
2062 but must be evaluated only once.
2064 Normally, expand_expr would reevaluate the expression each time.
2065 Calling save_expr produces something that is evaluated and recorded
2066 the first time expand_expr is called on it. Subsequent calls to
2067 expand_expr just reuse the recorded value.
2069 The call to expand_expr that generates code that actually computes
2070 the value is the first call *at compile time*. Subsequent calls
2071 *at compile time* generate code to use the saved value.
2072 This produces correct result provided that *at run time* control
2073 always flows through the insns made by the first expand_expr
2074 before reaching the other places where the save_expr was evaluated.
2075 You, the caller of save_expr, must make sure this is so.
2077 Constants, and certain read-only nodes, are returned with no
2078 SAVE_EXPR because that is safe. Expressions containing placeholders
2079 are not touched; see tree.def for an explanation of what these
2083 save_expr (tree expr)
2085 tree t = fold (expr);
2088 /* If the tree evaluates to a constant, then we don't want to hide that
2089 fact (i.e. this allows further folding, and direct checks for constants).
2090 However, a read-only object that has side effects cannot be bypassed.
2091 Since it is no problem to reevaluate literals, we just return the
2093 inner = skip_simple_arithmetic (t);
2095 if (TREE_INVARIANT (inner)
2096 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2097 || TREE_CODE (inner) == SAVE_EXPR
2098 || TREE_CODE (inner) == ERROR_MARK)
2101 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2102 it means that the size or offset of some field of an object depends on
2103 the value within another field.
2105 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2106 and some variable since it would then need to be both evaluated once and
2107 evaluated more than once. Front-ends must assure this case cannot
2108 happen by surrounding any such subexpressions in their own SAVE_EXPR
2109 and forcing evaluation at the proper time. */
2110 if (contains_placeholder_p (inner))
2113 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2115 /* This expression might be placed ahead of a jump to ensure that the
2116 value was computed on both sides of the jump. So make sure it isn't
2117 eliminated as dead. */
2118 TREE_SIDE_EFFECTS (t) = 1;
2119 TREE_INVARIANT (t) = 1;
2123 /* Look inside EXPR and into any simple arithmetic operations. Return
2124 the innermost non-arithmetic node. */
2127 skip_simple_arithmetic (tree expr)
2131 /* We don't care about whether this can be used as an lvalue in this
2133 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2134 expr = TREE_OPERAND (expr, 0);
2136 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2137 a constant, it will be more efficient to not make another SAVE_EXPR since
2138 it will allow better simplification and GCSE will be able to merge the
2139 computations if they actually occur. */
2143 if (UNARY_CLASS_P (inner))
2144 inner = TREE_OPERAND (inner, 0);
2145 else if (BINARY_CLASS_P (inner))
2147 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2148 inner = TREE_OPERAND (inner, 0);
2149 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2150 inner = TREE_OPERAND (inner, 1);
2161 /* Return which tree structure is used by T. */
2163 enum tree_node_structure_enum
2164 tree_node_structure (const_tree t)
2166 const enum tree_code code = TREE_CODE (t);
2168 switch (TREE_CODE_CLASS (code))
2170 case tcc_declaration:
2175 return TS_FIELD_DECL;
2177 return TS_PARM_DECL;
2181 return TS_LABEL_DECL;
2183 return TS_RESULT_DECL;
2185 return TS_CONST_DECL;
2187 return TS_TYPE_DECL;
2189 return TS_FUNCTION_DECL;
2190 case SYMBOL_MEMORY_TAG:
2191 case NAME_MEMORY_TAG:
2192 case STRUCT_FIELD_TAG:
2193 case MEMORY_PARTITION_TAG:
2194 return TS_MEMORY_TAG;
2196 return TS_DECL_NON_COMMON;
2202 case tcc_comparison:
2205 case tcc_expression:
2209 case tcc_gimple_stmt:
2210 return TS_GIMPLE_STATEMENT;
2211 default: /* tcc_constant and tcc_exceptional */
2216 /* tcc_constant cases. */
2217 case INTEGER_CST: return TS_INT_CST;
2218 case REAL_CST: return TS_REAL_CST;
2219 case FIXED_CST: return TS_FIXED_CST;
2220 case COMPLEX_CST: return TS_COMPLEX;
2221 case VECTOR_CST: return TS_VECTOR;
2222 case STRING_CST: return TS_STRING;
2223 /* tcc_exceptional cases. */
2224 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2226 case ERROR_MARK: return TS_COMMON;
2227 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2228 case TREE_LIST: return TS_LIST;
2229 case TREE_VEC: return TS_VEC;
2230 case PHI_NODE: return TS_PHI_NODE;
2231 case SSA_NAME: return TS_SSA_NAME;
2232 case PLACEHOLDER_EXPR: return TS_COMMON;
2233 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2234 case BLOCK: return TS_BLOCK;
2235 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2236 case TREE_BINFO: return TS_BINFO;
2237 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2238 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2245 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2246 or offset that depends on a field within a record. */
2249 contains_placeholder_p (const_tree exp)
2251 enum tree_code code;
2256 code = TREE_CODE (exp);
2257 if (code == PLACEHOLDER_EXPR)
2260 switch (TREE_CODE_CLASS (code))
2263 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2264 position computations since they will be converted into a
2265 WITH_RECORD_EXPR involving the reference, which will assume
2266 here will be valid. */
2267 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2269 case tcc_exceptional:
2270 if (code == TREE_LIST)
2271 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2272 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2277 case tcc_comparison:
2278 case tcc_expression:
2282 /* Ignoring the first operand isn't quite right, but works best. */
2283 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2286 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2287 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2288 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2294 switch (TREE_CODE_LENGTH (code))
2297 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2299 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2300 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2311 const_call_expr_arg_iterator iter;
2312 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2313 if (CONTAINS_PLACEHOLDER_P (arg))
2327 /* Return true if any part of the computation of TYPE involves a
2328 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2329 (for QUAL_UNION_TYPE) and field positions. */
2332 type_contains_placeholder_1 (const_tree type)
2334 /* If the size contains a placeholder or the parent type (component type in
2335 the case of arrays) type involves a placeholder, this type does. */
2336 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2337 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2338 || (TREE_TYPE (type) != 0
2339 && type_contains_placeholder_p (TREE_TYPE (type))))
2342 /* Now do type-specific checks. Note that the last part of the check above
2343 greatly limits what we have to do below. */
2344 switch (TREE_CODE (type))
2352 case REFERENCE_TYPE:
2360 case FIXED_POINT_TYPE:
2361 /* Here we just check the bounds. */
2362 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2363 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2366 /* We're already checked the component type (TREE_TYPE), so just check
2368 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2372 case QUAL_UNION_TYPE:
2376 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2377 if (TREE_CODE (field) == FIELD_DECL
2378 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2379 || (TREE_CODE (type) == QUAL_UNION_TYPE
2380 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2381 || type_contains_placeholder_p (TREE_TYPE (field))))
2393 type_contains_placeholder_p (tree type)
2397 /* If the contains_placeholder_bits field has been initialized,
2398 then we know the answer. */
2399 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2400 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2402 /* Indicate that we've seen this type node, and the answer is false.
2403 This is what we want to return if we run into recursion via fields. */
2404 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2406 /* Compute the real value. */
2407 result = type_contains_placeholder_1 (type);
2409 /* Store the real value. */
2410 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2415 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2416 return a tree with all occurrences of references to F in a
2417 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2418 contains only arithmetic expressions or a CALL_EXPR with a
2419 PLACEHOLDER_EXPR occurring only in its arglist. */
2422 substitute_in_expr (tree exp, tree f, tree r)
2424 enum tree_code code = TREE_CODE (exp);
2425 tree op0, op1, op2, op3;
2429 /* We handle TREE_LIST and COMPONENT_REF separately. */
2430 if (code == TREE_LIST)
2432 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2433 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2434 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2437 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2439 else if (code == COMPONENT_REF)
2441 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2442 and it is the right field, replace it with R. */
2443 for (inner = TREE_OPERAND (exp, 0);
2444 REFERENCE_CLASS_P (inner);
2445 inner = TREE_OPERAND (inner, 0))
2447 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2448 && TREE_OPERAND (exp, 1) == f)
2451 /* If this expression hasn't been completed let, leave it alone. */
2452 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2455 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2456 if (op0 == TREE_OPERAND (exp, 0))
2459 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2460 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2463 switch (TREE_CODE_CLASS (code))
2466 case tcc_declaration:
2469 case tcc_exceptional:
2472 case tcc_comparison:
2473 case tcc_expression:
2475 switch (TREE_CODE_LENGTH (code))
2481 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2482 if (op0 == TREE_OPERAND (exp, 0))
2485 new = fold_build1 (code, TREE_TYPE (exp), op0);
2489 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2490 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2492 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2495 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2499 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2500 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2501 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2503 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2504 && op2 == TREE_OPERAND (exp, 2))
2507 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2511 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2512 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2513 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2514 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2516 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2517 && op2 == TREE_OPERAND (exp, 2)
2518 && op3 == TREE_OPERAND (exp, 3))
2521 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2531 tree copy = NULL_TREE;
2533 int n = TREE_OPERAND_LENGTH (exp);
2534 for (i = 1; i < n; i++)
2536 tree op = TREE_OPERAND (exp, i);
2537 tree newop = SUBSTITUTE_IN_EXPR (op, f, r);
2540 copy = copy_node (exp);
2541 TREE_OPERAND (copy, i) = newop;
2554 TREE_READONLY (new) = TREE_READONLY (exp);
2558 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2559 for it within OBJ, a tree that is an object or a chain of references. */
2562 substitute_placeholder_in_expr (tree exp, tree obj)
2564 enum tree_code code = TREE_CODE (exp);
2565 tree op0, op1, op2, op3;
2567 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2568 in the chain of OBJ. */
2569 if (code == PLACEHOLDER_EXPR)
2571 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2574 for (elt = obj; elt != 0;
2575 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2576 || TREE_CODE (elt) == COND_EXPR)
2577 ? TREE_OPERAND (elt, 1)
2578 : (REFERENCE_CLASS_P (elt)
2579 || UNARY_CLASS_P (elt)
2580 || BINARY_CLASS_P (elt)
2581 || VL_EXP_CLASS_P (elt)
2582 || EXPRESSION_CLASS_P (elt))
2583 ? TREE_OPERAND (elt, 0) : 0))
2584 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2587 for (elt = obj; elt != 0;
2588 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2589 || TREE_CODE (elt) == COND_EXPR)
2590 ? TREE_OPERAND (elt, 1)
2591 : (REFERENCE_CLASS_P (elt)
2592 || UNARY_CLASS_P (elt)
2593 || BINARY_CLASS_P (elt)
2594 || VL_EXP_CLASS_P (elt)
2595 || EXPRESSION_CLASS_P (elt))
2596 ? TREE_OPERAND (elt, 0) : 0))
2597 if (POINTER_TYPE_P (TREE_TYPE (elt))
2598 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2600 return fold_build1 (INDIRECT_REF, need_type, elt);
2602 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2603 survives until RTL generation, there will be an error. */
2607 /* TREE_LIST is special because we need to look at TREE_VALUE
2608 and TREE_CHAIN, not TREE_OPERANDS. */
2609 else if (code == TREE_LIST)
2611 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2612 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2613 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2616 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2619 switch (TREE_CODE_CLASS (code))
2622 case tcc_declaration:
2625 case tcc_exceptional:
2628 case tcc_comparison:
2629 case tcc_expression:
2632 switch (TREE_CODE_LENGTH (code))
2638 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2639 if (op0 == TREE_OPERAND (exp, 0))
2642 return fold_build1 (code, TREE_TYPE (exp), op0);
2645 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2646 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2648 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2651 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2654 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2655 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2656 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2658 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2659 && op2 == TREE_OPERAND (exp, 2))
2662 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2665 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2666 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2667 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2668 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2670 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2671 && op2 == TREE_OPERAND (exp, 2)
2672 && op3 == TREE_OPERAND (exp, 3))
2675 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2684 tree copy = NULL_TREE;
2686 int n = TREE_OPERAND_LENGTH (exp);
2687 for (i = 1; i < n; i++)
2689 tree op = TREE_OPERAND (exp, i);
2690 tree newop = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2694 copy = copy_node (exp);
2695 TREE_OPERAND (copy, i) = newop;
2709 /* Stabilize a reference so that we can use it any number of times
2710 without causing its operands to be evaluated more than once.
2711 Returns the stabilized reference. This works by means of save_expr,
2712 so see the caveats in the comments about save_expr.
2714 Also allows conversion expressions whose operands are references.
2715 Any other kind of expression is returned unchanged. */
2718 stabilize_reference (tree ref)
2721 enum tree_code code = TREE_CODE (ref);
2728 /* No action is needed in this case. */
2734 case FIX_TRUNC_EXPR:
2735 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2739 result = build_nt (INDIRECT_REF,
2740 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2744 result = build_nt (COMPONENT_REF,
2745 stabilize_reference (TREE_OPERAND (ref, 0)),
2746 TREE_OPERAND (ref, 1), NULL_TREE);
2750 result = build_nt (BIT_FIELD_REF,
2751 stabilize_reference (TREE_OPERAND (ref, 0)),
2752 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2753 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2757 result = build_nt (ARRAY_REF,
2758 stabilize_reference (TREE_OPERAND (ref, 0)),
2759 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2760 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2763 case ARRAY_RANGE_REF:
2764 result = build_nt (ARRAY_RANGE_REF,
2765 stabilize_reference (TREE_OPERAND (ref, 0)),
2766 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2767 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2771 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2772 it wouldn't be ignored. This matters when dealing with
2774 return stabilize_reference_1 (ref);
2776 /* If arg isn't a kind of lvalue we recognize, make no change.
2777 Caller should recognize the error for an invalid lvalue. */
2782 return error_mark_node;
2785 TREE_TYPE (result) = TREE_TYPE (ref);
2786 TREE_READONLY (result) = TREE_READONLY (ref);
2787 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2788 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2793 /* Subroutine of stabilize_reference; this is called for subtrees of
2794 references. Any expression with side-effects must be put in a SAVE_EXPR
2795 to ensure that it is only evaluated once.
2797 We don't put SAVE_EXPR nodes around everything, because assigning very
2798 simple expressions to temporaries causes us to miss good opportunities
2799 for optimizations. Among other things, the opportunity to fold in the
2800 addition of a constant into an addressing mode often gets lost, e.g.
2801 "y[i+1] += x;". In general, we take the approach that we should not make
2802 an assignment unless we are forced into it - i.e., that any non-side effect
2803 operator should be allowed, and that cse should take care of coalescing
2804 multiple utterances of the same expression should that prove fruitful. */
2807 stabilize_reference_1 (tree e)
2810 enum tree_code code = TREE_CODE (e);
2812 /* We cannot ignore const expressions because it might be a reference
2813 to a const array but whose index contains side-effects. But we can
2814 ignore things that are actual constant or that already have been
2815 handled by this function. */
2817 if (TREE_INVARIANT (e))
2820 switch (TREE_CODE_CLASS (code))
2822 case tcc_exceptional:
2824 case tcc_declaration:
2825 case tcc_comparison:
2827 case tcc_expression:
2830 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2831 so that it will only be evaluated once. */
2832 /* The reference (r) and comparison (<) classes could be handled as
2833 below, but it is generally faster to only evaluate them once. */
2834 if (TREE_SIDE_EFFECTS (e))
2835 return save_expr (e);
2839 /* Constants need no processing. In fact, we should never reach
2844 /* Division is slow and tends to be compiled with jumps,
2845 especially the division by powers of 2 that is often
2846 found inside of an array reference. So do it just once. */
2847 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2848 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2849 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2850 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2851 return save_expr (e);
2852 /* Recursively stabilize each operand. */
2853 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2854 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2858 /* Recursively stabilize each operand. */
2859 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2866 TREE_TYPE (result) = TREE_TYPE (e);
2867 TREE_READONLY (result) = TREE_READONLY (e);
2868 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2869 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2870 TREE_INVARIANT (result) = 1;
2875 /* Low-level constructors for expressions. */
2877 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2878 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2881 recompute_tree_invariant_for_addr_expr (tree t)
2884 bool tc = true, ti = true, se = false;
2886 /* We started out assuming this address is both invariant and constant, but
2887 does not have side effects. Now go down any handled components and see if
2888 any of them involve offsets that are either non-constant or non-invariant.
2889 Also check for side-effects.
2891 ??? Note that this code makes no attempt to deal with the case where
2892 taking the address of something causes a copy due to misalignment. */
2894 #define UPDATE_TITCSE(NODE) \
2895 do { tree _node = (NODE); \
2896 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2897 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2898 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2900 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2901 node = TREE_OPERAND (node, 0))
2903 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2904 array reference (probably made temporarily by the G++ front end),
2905 so ignore all the operands. */
2906 if ((TREE_CODE (node) == ARRAY_REF
2907 || TREE_CODE (node) == ARRAY_RANGE_REF)
2908 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2910 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2911 if (TREE_OPERAND (node, 2))
2912 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2913 if (TREE_OPERAND (node, 3))
2914 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2916 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2917 FIELD_DECL, apparently. The G++ front end can put something else
2918 there, at least temporarily. */
2919 else if (TREE_CODE (node) == COMPONENT_REF
2920 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2922 if (TREE_OPERAND (node, 2))
2923 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2925 else if (TREE_CODE (node) == BIT_FIELD_REF)
2926 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2929 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2931 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2932 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2933 invariant and constant if the decl is static. It's also invariant if it's
2934 a decl in the current function. Taking the address of a volatile variable
2935 is not volatile. If it's a constant, the address is both invariant and
2936 constant. Otherwise it's neither. */
2937 if (TREE_CODE (node) == INDIRECT_REF)
2938 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2939 else if (DECL_P (node))
2943 else if (decl_function_context (node) == current_function_decl
2944 /* Addresses of thread-local variables are invariant. */
2945 || (TREE_CODE (node) == VAR_DECL
2946 && DECL_THREAD_LOCAL_P (node)))
2951 else if (CONSTANT_CLASS_P (node))
2956 se |= TREE_SIDE_EFFECTS (node);
2959 TREE_CONSTANT (t) = tc;
2960 TREE_INVARIANT (t) = ti;
2961 TREE_SIDE_EFFECTS (t) = se;
2962 #undef UPDATE_TITCSE
2965 /* Build an expression of code CODE, data type TYPE, and operands as
2966 specified. Expressions and reference nodes can be created this way.
2967 Constants, decls, types and misc nodes cannot be.
2969 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2970 enough for all extant tree codes. */
2973 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2977 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2979 t = make_node_stat (code PASS_MEM_STAT);
2986 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2988 int length = sizeof (struct tree_exp);
2989 #ifdef GATHER_STATISTICS
2990 tree_node_kind kind;
2994 #ifdef GATHER_STATISTICS
2995 switch (TREE_CODE_CLASS (code))
2997 case tcc_statement: /* an expression with side effects */
3000 case tcc_reference: /* a reference */
3008 tree_node_counts[(int) kind]++;
3009 tree_node_sizes[(int) kind] += length;
3012 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3014 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
3016 memset (t, 0, sizeof (struct tree_common));
3018 TREE_SET_CODE (t, code);
3020 TREE_TYPE (t) = type;
3021 #ifdef USE_MAPPED_LOCATION
3022 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3024 SET_EXPR_LOCUS (t, NULL);
3026 TREE_OPERAND (t, 0) = node;
3027 TREE_BLOCK (t) = NULL_TREE;
3028 if (node && !TYPE_P (node))
3030 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3031 TREE_READONLY (t) = TREE_READONLY (node);
3034 if (TREE_CODE_CLASS (code) == tcc_statement)
3035 TREE_SIDE_EFFECTS (t) = 1;
3039 /* All of these have side-effects, no matter what their
3041 TREE_SIDE_EFFECTS (t) = 1;
3042 TREE_READONLY (t) = 0;
3045 case MISALIGNED_INDIRECT_REF:
3046 case ALIGN_INDIRECT_REF:
3048 /* Whether a dereference is readonly has nothing to do with whether
3049 its operand is readonly. */
3050 TREE_READONLY (t) = 0;
3055 recompute_tree_invariant_for_addr_expr (t);
3059 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3060 && node && !TYPE_P (node)
3061 && TREE_CONSTANT (node))
3062 TREE_CONSTANT (t) = 1;
3063 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3064 && node && TREE_INVARIANT (node))
3065 TREE_INVARIANT (t) = 1;
3066 if (TREE_CODE_CLASS (code) == tcc_reference
3067 && node && TREE_THIS_VOLATILE (node))
3068 TREE_THIS_VOLATILE (t) = 1;
3075 #define PROCESS_ARG(N) \
3077 TREE_OPERAND (t, N) = arg##N; \
3078 if (arg##N &&!TYPE_P (arg##N)) \
3080 if (TREE_SIDE_EFFECTS (arg##N)) \
3082 if (!TREE_READONLY (arg##N)) \
3084 if (!TREE_CONSTANT (arg##N)) \
3086 if (!TREE_INVARIANT (arg##N)) \
3092 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3094 bool constant, read_only, side_effects, invariant;
3097 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3100 /* FIXME tuples: Statement's aren't expressions! */
3101 if (code == GIMPLE_MODIFY_STMT)
3102 return build_gimple_modify_stmt_stat (arg0, arg1 PASS_MEM_STAT);
3104 /* Must use build_gimple_modify_stmt to construct GIMPLE_MODIFY_STMTs. */
3105 gcc_assert (code != GIMPLE_MODIFY_STMT);
3108 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3109 && arg0 && arg1 && tt && POINTER_TYPE_P (tt))
3110 gcc_assert (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST);
3112 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3113 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3114 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3115 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3117 t = make_node_stat (code PASS_MEM_STAT);
3120 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3121 result based on those same flags for the arguments. But if the
3122 arguments aren't really even `tree' expressions, we shouldn't be trying
3125 /* Expressions without side effects may be constant if their
3126 arguments are as well. */
3127 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3128 || TREE_CODE_CLASS (code) == tcc_binary);
3130 side_effects = TREE_SIDE_EFFECTS (t);
3131 invariant = constant;
3136 TREE_READONLY (t) = read_only;
3137 TREE_CONSTANT (t) = constant;
3138 TREE_INVARIANT (t) = invariant;
3139 TREE_SIDE_EFFECTS (t) = side_effects;
3140 TREE_THIS_VOLATILE (t)
3141 = (TREE_CODE_CLASS (code) == tcc_reference
3142 && arg0 && TREE_THIS_VOLATILE (arg0));
3148 /* Build a GIMPLE_MODIFY_STMT node. This tree code doesn't have a
3149 type, so we can't use build2 (a.k.a. build2_stat). */
3152 build_gimple_modify_stmt_stat (tree arg0, tree arg1 MEM_STAT_DECL)
3156 t = make_node_stat (GIMPLE_MODIFY_STMT PASS_MEM_STAT);
3157 /* ?? We don't care about setting flags for tuples... */
3158 GIMPLE_STMT_OPERAND (t, 0) = arg0;
3159 GIMPLE_STMT_OPERAND (t, 1) = arg1;
3164 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3165 tree arg2 MEM_STAT_DECL)
3167 bool constant, read_only, side_effects, invariant;
3170 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3171 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3173 t = make_node_stat (code PASS_MEM_STAT);
3176 /* As a special exception, if COND_EXPR has NULL branches, we
3177 assume that it is a gimple statement and always consider
3178 it to have side effects. */
3179 if (code == COND_EXPR
3180 && tt == void_type_node
3181 && arg1 == NULL_TREE
3182 && arg2 == NULL_TREE)
3183 side_effects = true;
3185 side_effects = TREE_SIDE_EFFECTS (t);
3191 TREE_SIDE_EFFECTS (t) = side_effects;
3192 TREE_THIS_VOLATILE (t)
3193 = (TREE_CODE_CLASS (code) == tcc_reference
3194 && arg0 && TREE_THIS_VOLATILE (arg0));
3200 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3201 tree arg2, tree arg3 MEM_STAT_DECL)
3203 bool constant, read_only, side_effects, invariant;
3206 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3208 t = make_node_stat (code PASS_MEM_STAT);
3211 side_effects = TREE_SIDE_EFFECTS (t);
3218 TREE_SIDE_EFFECTS (t) = side_effects;
3219 TREE_THIS_VOLATILE (t)
3220 = (TREE_CODE_CLASS (code) == tcc_reference
3221 && arg0 && TREE_THIS_VOLATILE (arg0));
3227 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3228 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3230 bool constant, read_only, side_effects, invariant;
3233 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3235 t = make_node_stat (code PASS_MEM_STAT);
3238 side_effects = TREE_SIDE_EFFECTS (t);
3246 TREE_SIDE_EFFECTS (t) = side_effects;
3247 TREE_THIS_VOLATILE (t)
3248 = (TREE_CODE_CLASS (code) == tcc_reference
3249 && arg0 && TREE_THIS_VOLATILE (arg0));
3255 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3256 tree arg2, tree arg3, tree arg4, tree arg5,
3257 tree arg6 MEM_STAT_DECL)
3259 bool constant, read_only, side_effects, invariant;
3262 gcc_assert (code == TARGET_MEM_REF);
3264 t = make_node_stat (code PASS_MEM_STAT);
3267 side_effects = TREE_SIDE_EFFECTS (t);
3277 TREE_SIDE_EFFECTS (t) = side_effects;
3278 TREE_THIS_VOLATILE (t) = 0;
3283 /* Similar except don't specify the TREE_TYPE
3284 and leave the TREE_SIDE_EFFECTS as 0.
3285 It is permissible for arguments to be null,
3286 or even garbage if their values do not matter. */
3289 build_nt (enum tree_code code, ...)
3296 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3300 t = make_node (code);
3301 length = TREE_CODE_LENGTH (code);
3303 for (i = 0; i < length; i++)
3304 TREE_OPERAND (t, i) = va_arg (p, tree);
3310 /* Similar to build_nt, but for creating a CALL_EXPR object with
3311 ARGLIST passed as a list. */
3314 build_nt_call_list (tree fn, tree arglist)
3319 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3320 CALL_EXPR_FN (t) = fn;
3321 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3322 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3323 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3327 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3328 We do NOT enter this node in any sort of symbol table.
3330 layout_decl is used to set up the decl's storage layout.
3331 Other slots are initialized to 0 or null pointers. */
3334 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3338 t = make_node_stat (code PASS_MEM_STAT);
3340 /* if (type == error_mark_node)
3341 type = integer_type_node; */
3342 /* That is not done, deliberately, so that having error_mark_node
3343 as the type can suppress useless errors in the use of this variable. */
3345 DECL_NAME (t) = name;
3346 TREE_TYPE (t) = type;
3348 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3354 /* Builds and returns function declaration with NAME and TYPE. */
3357 build_fn_decl (const char *name, tree type)
3359 tree id = get_identifier (name);
3360 tree decl = build_decl (FUNCTION_DECL, id, type);
3362 DECL_EXTERNAL (decl) = 1;
3363 TREE_PUBLIC (decl) = 1;
3364 DECL_ARTIFICIAL (decl) = 1;
3365 TREE_NOTHROW (decl) = 1;
3371 /* BLOCK nodes are used to represent the structure of binding contours
3372 and declarations, once those contours have been exited and their contents
3373 compiled. This information is used for outputting debugging info. */
3376 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3378 tree block = make_node (BLOCK);
3380 BLOCK_VARS (block) = vars;
3381 BLOCK_SUBBLOCKS (block) = subblocks;
3382 BLOCK_SUPERCONTEXT (block) = supercontext;
3383 BLOCK_CHAIN (block) = chain;
3387 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3388 /* ??? gengtype doesn't handle conditionals */
3389 static GTY(()) source_locus last_annotated_node;
3392 #ifdef USE_MAPPED_LOCATION
3395 expand_location (source_location loc)
3397 expanded_location xloc;
3406 const struct line_map *map = linemap_lookup (&line_table, loc);
3407 xloc.file = map->to_file;
3408 xloc.line = SOURCE_LINE (map, loc);
3409 xloc.column = SOURCE_COLUMN (map, loc);
3416 /* Record the exact location where an expression or an identifier were
3420 annotate_with_file_line (tree node, const char *file, int line)
3422 /* Roughly one percent of the calls to this function are to annotate
3423 a node with the same information already attached to that node!
3424 Just return instead of wasting memory. */
3425 if (EXPR_LOCUS (node)
3426 && EXPR_LINENO (node) == line
3427 && (EXPR_FILENAME (node) == file
3428 || !strcmp (EXPR_FILENAME (node), file)))
3430 last_annotated_node = EXPR_LOCUS (node);
3434 /* In heavily macroized code (such as GCC itself) this single
3435 entry cache can reduce the number of allocations by more
3437 if (last_annotated_node
3438 && last_annotated_node->line == line
3439 && (last_annotated_node->file == file
3440 || !strcmp (last_annotated_node->file, file)))
3442 SET_EXPR_LOCUS (node, last_annotated_node);
3446 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3447 EXPR_LINENO (node) = line;
3448 EXPR_FILENAME (node) = file;
3449 last_annotated_node = EXPR_LOCUS (node);
3453 annotate_with_locus (tree node, location_t locus)
3455 annotate_with_file_line (node, locus.file, locus.line);
3459 /* Source location accessor functions. */
3462 /* The source location of this expression. Non-tree_exp nodes such as
3463 decls and constants can be shared among multiple locations, so
3466 expr_location (const_tree node)
3468 #ifdef USE_MAPPED_LOCATION
3469 if (GIMPLE_STMT_P (node))
3470 return GIMPLE_STMT_LOCUS (node);
3471 return EXPR_P (node) ? node->exp.locus : UNKNOWN_LOCATION;
3473 if (GIMPLE_STMT_P (node))
3474 return EXPR_HAS_LOCATION (node)
3475 ? *GIMPLE_STMT_LOCUS (node) : UNKNOWN_LOCATION;
3476 return EXPR_HAS_LOCATION (node) ? *node->exp.locus : UNKNOWN_LOCATION;
3481 set_expr_location (tree node, location_t locus)
3483 #ifdef USE_MAPPED_LOCATION
3484 if (GIMPLE_STMT_P (node))
3485 GIMPLE_STMT_LOCUS (node) = locus;
3487 EXPR_CHECK (node)->exp.locus = locus;
3489 annotate_with_locus (node, locus);
3494 expr_has_location (const_tree node)
3496 #ifdef USE_MAPPED_LOCATION
3497 return expr_location (node) != UNKNOWN_LOCATION;
3499 return expr_locus (node) != NULL;
3503 #ifdef USE_MAPPED_LOCATION
3508 expr_locus (const_tree node)
3510 #ifdef USE_MAPPED_LOCATION
3511 if (GIMPLE_STMT_P (node))
3512 return &GIMPLE_STMT_LOCUS (node);
3513 return EXPR_P (node) ? &node->exp.locus : (location_t *) NULL;
3515 if (GIMPLE_STMT_P (node))
3516 return GIMPLE_STMT_LOCUS (node);
3517 /* ?? The cast below was originally "(location_t *)" in the macro,
3518 but that makes no sense. ?? */
3519 return EXPR_P (node) ? node->exp.locus : (source_locus) NULL;
3524 set_expr_locus (tree node,
3525 #ifdef USE_MAPPED_LOCATION
3526 source_location *loc
3532 #ifdef USE_MAPPED_LOCATION
3535 if (GIMPLE_STMT_P (node))
3536 GIMPLE_STMT_LOCUS (node) = UNKNOWN_LOCATION;
3538 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3542 if (GIMPLE_STMT_P (node))
3543 GIMPLE_STMT_LOCUS (node) = *loc;
3545 EXPR_CHECK (node)->exp.locus = *loc;
3548 if (GIMPLE_STMT_P (node))
3549 GIMPLE_STMT_LOCUS (node) = loc;
3551 EXPR_CHECK (node)->exp.locus = loc;
3556 expr_filename (const_tree node)
3558 #ifdef USE_MAPPED_LOCATION
3559 if (GIMPLE_STMT_P (node))
3560 return &LOCATION_FILE (GIMPLE_STMT_LOCUS (node));
3561 return &LOCATION_FILE (EXPR_CHECK (node)->exp.locus);
3563 if (GIMPLE_STMT_P (node))
3564 return &GIMPLE_STMT_LOCUS (node)->file;
3565 return &(EXPR_CHECK (node)->exp.locus->file);
3570 expr_lineno (const_tree node)
3572 #ifdef USE_MAPPED_LOCATION
3573 if (GIMPLE_STMT_P (node))
3574 return &LOCATION_LINE (GIMPLE_STMT_LOCUS (node));
3575 return &LOCATION_LINE (EXPR_CHECK (node)->exp.locus);
3577 if (GIMPLE_STMT_P (node))
3578 return &GIMPLE_STMT_LOCUS (node)->line;
3579 return &EXPR_CHECK (node)->exp.locus->line;
3583 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3587 build_decl_attribute_variant (tree ddecl, tree attribute)
3589 DECL_ATTRIBUTES (ddecl) = attribute;
3593 /* Borrowed from hashtab.c iterative_hash implementation. */
3594 #define mix(a,b,c) \
3596 a -= b; a -= c; a ^= (c>>13); \
3597 b -= c; b -= a; b ^= (a<< 8); \
3598 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3599 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3600 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3601 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3602 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3603 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3604 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3608 /* Produce good hash value combining VAL and VAL2. */
3609 static inline hashval_t
3610 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3612 /* the golden ratio; an arbitrary value. */
3613 hashval_t a = 0x9e3779b9;
3619 /* Produce good hash value combining PTR and VAL2. */
3620 static inline hashval_t
3621 iterative_hash_pointer (const void *ptr, hashval_t val2)
3623 if (sizeof (ptr) == sizeof (hashval_t))
3624 return iterative_hash_hashval_t ((size_t) ptr, val2);
3627 hashval_t a = (hashval_t) (size_t) ptr;
3628 /* Avoid warnings about shifting of more than the width of the type on
3629 hosts that won't execute this path. */
3631 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3637 /* Produce good hash value combining VAL and VAL2. */
3638 static inline hashval_t
3639 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3641 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3642 return iterative_hash_hashval_t (val, val2);
3645 hashval_t a = (hashval_t) val;
3646 /* Avoid warnings about shifting of more than the width of the type on
3647 hosts that won't execute this path. */
3649 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3651 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3653 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3654 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3661 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3662 is ATTRIBUTE and its qualifiers are QUALS.
3664 Record such modified types already made so we don't make duplicates. */
3667 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3669 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3671 hashval_t hashcode = 0;
3673 enum tree_code code = TREE_CODE (ttype);
3675 ntype = copy_node (ttype);
3677 TYPE_POINTER_TO (ntype) = 0;
3678 TYPE_REFERENCE_TO (ntype) = 0;
3679 TYPE_ATTRIBUTES (ntype) = attribute;
3681 if (TYPE_STRUCTURAL_EQUALITY_P (ttype))
3682 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3684 TYPE_CANONICAL (ntype)
3685 = build_qualified_type (TYPE_CANONICAL (ttype), quals);
3687 /* Create a new main variant of TYPE. */
3688 TYPE_MAIN_VARIANT (ntype) = ntype;
3689 TYPE_NEXT_VARIANT (ntype) = 0;
3690 set_type_quals (ntype, TYPE_UNQUALIFIED);
3692 hashcode = iterative_hash_object (code, hashcode);
3693 if (TREE_TYPE (ntype))
3694 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3696 hashcode = attribute_hash_list (attribute, hashcode);
3698 switch (TREE_CODE (ntype))
3701 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3704 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3708 hashcode = iterative_hash_object
3709 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3710 hashcode = iterative_hash_object
3711 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3714 case FIXED_POINT_TYPE:
3716 unsigned int precision = TYPE_PRECISION (ntype);
3717 hashcode = iterative_hash_object (precision, hashcode);
3724 ntype = type_hash_canon (hashcode, ntype);
3726 /* If the target-dependent attributes make NTYPE different from
3727 its canonical type, we will need to use structural equality
3728 checks for this qualified type. */
3729 if (!targetm.comp_type_attributes (ntype, ttype))
3730 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3732 ttype = build_qualified_type (ntype, quals);
3739 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3742 Record such modified types already made so we don't make duplicates. */
3745 build_type_attribute_variant (tree ttype, tree attribute)
3747 return build_type_attribute_qual_variant (ttype, attribute,
3748 TYPE_QUALS (ttype));
3751 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3754 We try both `text' and `__text__', ATTR may be either one. */
3755 /* ??? It might be a reasonable simplification to require ATTR to be only
3756 `text'. One might then also require attribute lists to be stored in
3757 their canonicalized form. */
3760 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
3765 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3768 p = IDENTIFIER_POINTER (ident);
3769 ident_len = IDENTIFIER_LENGTH (ident);
3771 if (ident_len == attr_len
3772 && strcmp (attr, p) == 0)
3775 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3778 gcc_assert (attr[1] == '_');
3779 gcc_assert (attr[attr_len - 2] == '_');
3780 gcc_assert (attr[attr_len - 1] == '_');
3781 if (ident_len == attr_len - 4
3782 && strncmp (attr + 2, p, attr_len - 4) == 0)
3787 if (ident_len == attr_len + 4
3788 && p[0] == '_' && p[1] == '_'
3789 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3790 && strncmp (attr, p + 2, attr_len) == 0)
3797 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3800 We try both `text' and `__text__', ATTR may be either one. */
3803 is_attribute_p (const char *attr, const_tree ident)
3805 return is_attribute_with_length_p (attr, strlen (attr), ident);
3808 /* Given an attribute name and a list of attributes, return a pointer to the
3809 attribute's list element if the attribute is part of the list, or NULL_TREE
3810 if not found. If the attribute appears more than once, this only
3811 returns the first occurrence; the TREE_CHAIN of the return value should
3812 be passed back in if further occurrences are wanted. */
3814 #define LOOKUP_ATTRIBUTE_BODY(TYPE) do { \
3816 size_t attr_len = strlen (attr_name); \
3817 for (l = list; l; l = TREE_CHAIN (l)) \
3819 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE); \
3820 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l))) \
3827 lookup_attribute (const char *attr_name, tree list)
3829 LOOKUP_ATTRIBUTE_BODY(tree);
3833 const_lookup_attribute (const char *attr_name, const_tree list)
3835 LOOKUP_ATTRIBUTE_BODY(const_tree);
3838 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3842 remove_attribute (const char *attr_name, tree list)
3845 size_t attr_len = strlen (attr_name);
3847 for (p = &list; *p; )
3850 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3851 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3852 *p = TREE_CHAIN (l);
3854 p = &TREE_CHAIN (l);
3860 /* Return an attribute list that is the union of a1 and a2. */
3863 merge_attributes (tree a1, tree a2)
3867 /* Either one unset? Take the set one. */
3869 if ((attributes = a1) == 0)
3872 /* One that completely contains the other? Take it. */
3874 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3876 if (attribute_list_contained (a2, a1))
3880 /* Pick the longest list, and hang on the other list. */
3882 if (list_length (a1) < list_length (a2))
3883 attributes = a2, a2 = a1;
3885 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3888 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3891 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3894 if (TREE_VALUE (a) != NULL
3895 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3896 && TREE_VALUE (a2) != NULL
3897 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3899 if (simple_cst_list_equal (TREE_VALUE (a),
3900 TREE_VALUE (a2)) == 1)
3903 else if (simple_cst_equal (TREE_VALUE (a),
3904 TREE_VALUE (a2)) == 1)
3909 a1 = copy_node (a2);
3910 TREE_CHAIN (a1) = attributes;
3919 /* Given types T1 and T2, merge their attributes and return
3923 merge_type_attributes (tree t1, tree t2)
3925 return merge_attributes (TYPE_ATTRIBUTES (t1),
3926 TYPE_ATTRIBUTES (t2));
3929 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3933 merge_decl_attributes (tree olddecl, tree newdecl)
3935 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3936 DECL_ATTRIBUTES (newdecl));
3939 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3941 /* Specialization of merge_decl_attributes for various Windows targets.
3943 This handles the following situation:
3945 __declspec (dllimport) int foo;
3948 The second instance of `foo' nullifies the dllimport. */
3951 merge_dllimport_decl_attributes (tree old, tree new)
3954 int delete_dllimport_p = 1;
3956 /* What we need to do here is remove from `old' dllimport if it doesn't
3957 appear in `new'. dllimport behaves like extern: if a declaration is
3958 marked dllimport and a definition appears later, then the object
3959 is not dllimport'd. We also remove a `new' dllimport if the old list
3960 contains dllexport: dllexport always overrides dllimport, regardless
3961 of the order of declaration. */
3962 if (!VAR_OR_FUNCTION_DECL_P (new))
3963 delete_dllimport_p = 0;
3964 else if (DECL_DLLIMPORT_P (new)
3965 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3967 DECL_DLLIMPORT_P (new) = 0;
3968 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3969 "dllimport ignored", new);
3971 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3973 /* Warn about overriding a symbol that has already been used. eg:
3974 extern int __attribute__ ((dllimport)) foo;
3975 int* bar () {return &foo;}
3978 if (TREE_USED (old))
3980 warning (0, "%q+D redeclared without dllimport attribute "
3981 "after being referenced with dll linkage", new);
3982 /* If we have used a variable's address with dllimport linkage,
3983 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3984 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3986 We still remove the attribute so that assembler code refers
3987 to '&foo rather than '_imp__foo'. */
3988 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3989 DECL_DLLIMPORT_P (new) = 1;
3992 /* Let an inline definition silently override the external reference,
3993 but otherwise warn about attribute inconsistency. */
3994 else if (TREE_CODE (new) == VAR_DECL
3995 || !DECL_DECLARED_INLINE_P (new))
3996 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3997 "previous dllimport ignored", new);
4000 delete_dllimport_p = 0;
4002 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
4004 if (delete_dllimport_p)
4007 const size_t attr_len = strlen ("dllimport");
4009 /* Scan the list for dllimport and delete it. */
4010 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
4012 if (is_attribute_with_length_p ("dllimport", attr_len,
4015 if (prev == NULL_TREE)
4018 TREE_CHAIN (prev) = TREE_CHAIN (t);
4027 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4028 struct attribute_spec.handler. */
4031 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
4036 /* These attributes may apply to structure and union types being created,
4037 but otherwise should pass to the declaration involved. */
4040 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
4041 | (int) ATTR_FLAG_ARRAY_NEXT))
4043 *no_add_attrs = true;
4044 return tree_cons (name, args, NULL_TREE);
4046 if (TREE_CODE (node) == RECORD_TYPE
4047 || TREE_CODE (node) == UNION_TYPE)
4049 node = TYPE_NAME (node);
4055 warning (OPT_Wattributes, "%qs attribute ignored",
4056 IDENTIFIER_POINTER (name));
4057 *no_add_attrs = true;
4062 if (TREE_CODE (node) != FUNCTION_DECL
4063 && TREE_CODE (node) != VAR_DECL
4064 && TREE_CODE (node) != TYPE_DECL)
4066 *no_add_attrs = true;
4067 warning (OPT_Wattributes, "%qs attribute ignored",
4068 IDENTIFIER_POINTER (name));
4072 /* Report error on dllimport ambiguities seen now before they cause
4074 else if (is_attribute_p ("dllimport", name))
4076 /* Honor any target-specific overrides. */
4077 if (!targetm.valid_dllimport_attribute_p (node))
4078 *no_add_attrs = true;
4080 else if (TREE_CODE (node) == FUNCTION_DECL
4081 && DECL_DECLARED_INLINE_P (node))
4083 warning (OPT_Wattributes, "inline function %q+D declared as "
4084 " dllimport: attribute ignored", node);
4085 *no_add_attrs = true;
4087 /* Like MS, treat definition of dllimported variables and
4088 non-inlined functions on declaration as syntax errors. */
4089 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4091 error ("function %q+D definition is marked dllimport", node);
4092 *no_add_attrs = true;
4095 else if (TREE_CODE (node) == VAR_DECL)
4097 if (DECL_INITIAL (node))
4099 error ("variable %q+D definition is marked dllimport",
4101 *no_add_attrs = true;
4104 /* `extern' needn't be specified with dllimport.
4105 Specify `extern' now and hope for the best. Sigh. */
4106 DECL_EXTERNAL (node) = 1;
4107 /* Also, implicitly give dllimport'd variables declared within
4108 a function global scope, unless declared static. */
4109 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4110 TREE_PUBLIC (node) = 1;
4113 if (*no_add_attrs == false)
4114 DECL_DLLIMPORT_P (node) = 1;
4117 /* Report error if symbol is not accessible at global scope. */
4118 if (!TREE_PUBLIC (node)
4119 && (TREE_CODE (node) == VAR_DECL
4120 || TREE_CODE (node) == FUNCTION_DECL))
4122 error ("external linkage required for symbol %q+D because of "
4123 "%qs attribute", node, IDENTIFIER_POINTER (name));
4124 *no_add_attrs = true;
4127 /* A dllexport'd entity must have default visibility so that other
4128 program units (shared libraries or the main executable) can see
4129 it. A dllimport'd entity must have default visibility so that
4130 the linker knows that undefined references within this program
4131 unit can be resolved by the dynamic linker. */
4134 if (DECL_VISIBILITY_SPECIFIED (node)
4135 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
4136 error ("%qs implies default visibility, but %qD has already "
4137 "been declared with a different visibility",
4138 IDENTIFIER_POINTER (name), node);
4139 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
4140 DECL_VISIBILITY_SPECIFIED (node) = 1;
4146 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4148 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4149 of the various TYPE_QUAL values. */
4152 set_type_quals (tree type, int type_quals)
4154 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4155 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4156 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4159 /* Returns true iff cand is equivalent to base with type_quals. */
4162 check_qualified_type (const_tree cand, const_tree base, int type_quals)
4164 return (TYPE_QUALS (cand) == type_quals
4165 && TYPE_NAME (cand) == TYPE_NAME (base)
4166 /* Apparently this is needed for Objective-C. */
4167 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4168 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4169 TYPE_ATTRIBUTES (base)));
4172 /* Return a version of the TYPE, qualified as indicated by the
4173 TYPE_QUALS, if one exists. If no qualified version exists yet,
4174 return NULL_TREE. */
4177 get_qualified_type (tree type, int type_quals)
4181 if (TYPE_QUALS (type) == type_quals)
4184 /* Search the chain of variants to see if there is already one there just
4185 like the one we need to have. If so, use that existing one. We must
4186 preserve the TYPE_NAME, since there is code that depends on this. */
4187 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4188 if (check_qualified_type (t, type, type_quals))
4194 /* Like get_qualified_type, but creates the type if it does not
4195 exist. This function never returns NULL_TREE. */
4198 build_qualified_type (tree type, int type_quals)
4202 /* See if we already have the appropriate qualified variant. */
4203 t = get_qualified_type (type, type_quals);
4205 /* If not, build it. */
4208 t = build_variant_type_copy (type);
4209 set_type_quals (t, type_quals);
4211 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4212 /* Propagate structural equality. */
4213 SET_TYPE_STRUCTURAL_EQUALITY (t);
4214 else if (TYPE_CANONICAL (type) != type)
4215 /* Build the underlying canonical type, since it is different
4217 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4220 /* T is its own canonical type. */
4221 TYPE_CANONICAL (t) = t;
4228 /* Create a new distinct copy of TYPE. The new type is made its own
4229 MAIN_VARIANT. If TYPE requires structural equality checks, the
4230 resulting type requires structural equality checks; otherwise, its
4231 TYPE_CANONICAL points to itself. */
4234 build_distinct_type_copy (tree type)
4236 tree t = copy_node (type);
4238 TYPE_POINTER_TO (t) = 0;
4239 TYPE_REFERENCE_TO (t) = 0;
4241 /* Set the canonical type either to a new equivalence class, or
4242 propagate the need for structural equality checks. */
4243 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4244 SET_TYPE_STRUCTURAL_EQUALITY (t);
4246 TYPE_CANONICAL (t) = t;
4248 /* Make it its own variant. */
4249 TYPE_MAIN_VARIANT (t) = t;
4250 TYPE_NEXT_VARIANT (t) = 0;
4252 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4253 whose TREE_TYPE is not t. This can also happen in the Ada
4254 frontend when using subtypes. */
4259 /* Create a new variant of TYPE, equivalent but distinct. This is so
4260 the caller can modify it. TYPE_CANONICAL for the return type will
4261 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4262 are considered equal by the language itself (or that both types
4263 require structural equality checks). */
4266 build_variant_type_copy (tree type)
4268 tree t, m = TYPE_MAIN_VARIANT (type);
4270 t = build_distinct_type_copy (type);
4272 /* Since we're building a variant, assume that it is a non-semantic
4273 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4274 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4276 /* Add the new type to the chain of variants of TYPE. */
4277 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4278 TYPE_NEXT_VARIANT (m) = t;
4279 TYPE_MAIN_VARIANT (t) = m;
4284 /* Return true if the from tree in both tree maps are equal. */
4287 tree_map_base_eq (const void *va, const void *vb)
4289 const struct tree_map_base *const a = va, *const b = vb;
4290 return (a->from == b->from);
4293 /* Hash a from tree in a tree_map. */
4296 tree_map_base_hash (const void *item)
4298 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4301 /* Return true if this tree map structure is marked for garbage collection
4302 purposes. We simply return true if the from tree is marked, so that this
4303 structure goes away when the from tree goes away. */
4306 tree_map_base_marked_p (const void *p)
4308 return ggc_marked_p (((const struct tree_map_base *) p)->from);
4312 tree_map_hash (const void *item)
4314 return (((const struct tree_map *) item)->hash);
4317 /* Return the initialization priority for DECL. */
4320 decl_init_priority_lookup (tree decl)
4322 struct tree_priority_map *h;
4323 struct tree_map_base in;
4325 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4326 gcc_assert (TREE_CODE (decl) == VAR_DECL
4327 ? DECL_HAS_INIT_PRIORITY_P (decl)
4328 : DECL_STATIC_CONSTRUCTOR (decl));
4330 h = htab_find (init_priority_for_decl, &in);
4331 return h ? h->init : DEFAULT_INIT_PRIORITY;
4334 /* Return the finalization priority for DECL. */
4337 decl_fini_priority_lookup (tree decl)
4339 struct tree_priority_map *h;
4340 struct tree_map_base in;
4342 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4343 gcc_assert (DECL_STATIC_DESTRUCTOR (decl));
4345 h = htab_find (init_priority_for_decl, &in);
4346 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4349 /* Return the initialization and finalization priority information for
4350 DECL. If there is no previous priority information, a freshly
4351 allocated structure is returned. */
4353 static struct tree_priority_map *
4354 decl_priority_info (tree decl)
4356 struct tree_priority_map in;
4357 struct tree_priority_map *h;
4360 in.base.from = decl;
4361 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4365 h = GGC_CNEW (struct tree_priority_map);
4367 h->base.from = decl;
4368 h->init = DEFAULT_INIT_PRIORITY;
4369 h->fini = DEFAULT_INIT_PRIORITY;
4375 /* Set the initialization priority for DECL to PRIORITY. */
4378 decl_init_priority_insert (tree decl, priority_type priority)
4380 struct tree_priority_map *h;
4382 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4383 h = decl_priority_info (decl);
4387 /* Set the finalization priority for DECL to PRIORITY. */
4390 decl_fini_priority_insert (tree decl, priority_type priority)
4392 struct tree_priority_map *h;
4394 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4395 h = decl_priority_info (decl);
4399 /* Look up a restrict qualified base decl for FROM. */
4402 decl_restrict_base_lookup (tree from)
4407 in.base.from = from;
4408 h = htab_find_with_hash (restrict_base_for_decl, &in,
4409 htab_hash_pointer (from));
4410 return h ? h->to : NULL_TREE;
4413 /* Record the restrict qualified base TO for FROM. */
4416 decl_restrict_base_insert (tree from, tree to)
4421 h = ggc_alloc (sizeof (struct tree_map));
4422 h->hash = htab_hash_pointer (from);
4423 h->base.from = from;
4425 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4426 *(struct tree_map **) loc = h;
4429 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4432 print_debug_expr_statistics (void)
4434 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4435 (long) htab_size (debug_expr_for_decl),
4436 (long) htab_elements (debug_expr_for_decl),
4437 htab_collisions (debug_expr_for_decl));
4440 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4443 print_value_expr_statistics (void)
4445 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4446 (long) htab_size (value_expr_for_decl),
4447 (long) htab_elements (value_expr_for_decl),
4448 htab_collisions (value_expr_for_decl));
4451 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4452 don't print anything if the table is empty. */
4455 print_restrict_base_statistics (void)
4457 if (htab_elements (restrict_base_for_decl) != 0)
4459 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4460 (long) htab_size (restrict_base_for_decl),
4461 (long) htab_elements (restrict_base_for_decl),
4462 htab_collisions (restrict_base_for_decl));
4465 /* Lookup a debug expression for FROM, and return it if we find one. */
4468 decl_debug_expr_lookup (tree from)
4470 struct tree_map *h, in;
4471 in.base.from = from;
4473 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4479 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4482 decl_debug_expr_insert (tree from, tree to)
4487 h = ggc_alloc (sizeof (struct tree_map));
4488 h->hash = htab_hash_pointer (from);
4489 h->base.from = from;
4491 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4492 *(struct tree_map **) loc = h;
4495 /* Lookup a value expression for FROM, and return it if we find one. */
4498 decl_value_expr_lookup (tree from)
4500 struct tree_map *h, in;
4501 in.base.from = from;
4503 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4509 /* Insert a mapping FROM->TO in the value expression hashtable. */
4512 decl_value_expr_insert (tree from, tree to)
4517 h = ggc_alloc (sizeof (struct tree_map));
4518 h->hash = htab_hash_pointer (from);
4519 h->base.from = from;
4521 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4522 *(struct tree_map **) loc = h;
4525 /* Hashing of types so that we don't make duplicates.
4526 The entry point is `type_hash_canon'. */
4528 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4529 with types in the TREE_VALUE slots), by adding the hash codes
4530 of the individual types. */
4533 type_hash_list (const_tree list, hashval_t hashcode)
4537 for (tail = list; tail; tail = TREE_CHAIN (tail))
4538 if (TREE_VALUE (tail) != error_mark_node)
4539 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4545 /* These are the Hashtable callback functions. */
4547 /* Returns true iff the types are equivalent. */
4550 type_hash_eq (const void *va, const void *vb)
4552 const struct type_hash *const a = va, *const b = vb;
4554 /* First test the things that are the same for all types. */
4555 if (a->hash != b->hash
4556 || TREE_CODE (a->type) != TREE_CODE (b->type)
4557 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4558 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4559 TYPE_ATTRIBUTES (b->type))
4560 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4561 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4564 switch (TREE_CODE (a->type))
4569 case REFERENCE_TYPE:
4573 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4576 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4577 && !(TYPE_VALUES (a->type)
4578 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4579 && TYPE_VALUES (b->type)
4580 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4581 && type_list_equal (TYPE_VALUES (a->type),
4582 TYPE_VALUES (b->type))))
4585 /* ... fall through ... */
4590 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4591 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4592 TYPE_MAX_VALUE (b->type)))
4593 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4594 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4595 TYPE_MIN_VALUE (b->type))));
4597 case FIXED_POINT_TYPE:
4598 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
4601 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4604 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4605 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4606 || (TYPE_ARG_TYPES (a->type)
4607 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4608 && TYPE_ARG_TYPES (b->type)
4609 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4610 && type_list_equal (TYPE_ARG_TYPES (a->type),
4611 TYPE_ARG_TYPES (b->type)))));
4614 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4618 case QUAL_UNION_TYPE:
4619 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4620 || (TYPE_FIELDS (a->type)
4621 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4622 && TYPE_FIELDS (b->type)
4623 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4624 && type_list_equal (TYPE_FIELDS (a->type),
4625 TYPE_FIELDS (b->type))));
4628 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4629 || (TYPE_ARG_TYPES (a->type)
4630 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4631 && TYPE_ARG_TYPES (b->type)
4632 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4633 && type_list_equal (TYPE_ARG_TYPES (a->type),
4634 TYPE_ARG_TYPES (b->type))));
4641 /* Return the cached hash value. */
4644 type_hash_hash (const void *item)
4646 return ((const struct type_hash *) item)->hash;
4649 /* Look in the type hash table for a type isomorphic to TYPE.
4650 If one is found, return it. Otherwise return 0. */
4653 type_hash_lookup (hashval_t hashcode, tree type)
4655 struct type_hash *h, in;
4657 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4658 must call that routine before comparing TYPE_ALIGNs. */
4664 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4670 /* Add an entry to the type-hash-table
4671 for a type TYPE whose hash code is HASHCODE. */
4674 type_hash_add (hashval_t hashcode, tree type)
4676 struct type_hash *h;
4679 h = ggc_alloc (sizeof (struct type_hash));
4682 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4683 *(struct type_hash **) loc = h;
4686 /* Given TYPE, and HASHCODE its hash code, return the canonical
4687 object for an identical type if one already exists.
4688 Otherwise, return TYPE, and record it as the canonical object.
4690 To use this function, first create a type of the sort you want.
4691 Then compute its hash code from the fields of the type that
4692 make it different from other similar types.
4693 Then call this function and use the value. */
4696 type_hash_canon (unsigned int hashcode, tree type)
4700 /* The hash table only contains main variants, so ensure that's what we're
4702 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4704 if (!lang_hooks.types.hash_types)
4707 /* See if the type is in the hash table already. If so, return it.
4708 Otherwise, add the type. */
4709 t1 = type_hash_lookup (hashcode, type);
4712 #ifdef GATHER_STATISTICS
4713 tree_node_counts[(int) t_kind]--;
4714 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4720 type_hash_add (hashcode, type);
4725 /* See if the data pointed to by the type hash table is marked. We consider
4726 it marked if the type is marked or if a debug type number or symbol
4727 table entry has been made for the type. This reduces the amount of
4728 debugging output and eliminates that dependency of the debug output on
4729 the number of garbage collections. */
4732 type_hash_marked_p (const void *p)
4734 const_tree const type = ((const struct type_hash *) p)->type;
4736 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4740 print_type_hash_statistics (void)
4742 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4743 (long) htab_size (type_hash_table),
4744 (long) htab_elements (type_hash_table),
4745 htab_collisions (type_hash_table));
4748 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4749 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4750 by adding the hash codes of the individual attributes. */
4753 attribute_hash_list (const_tree list, hashval_t hashcode)
4757 for (tail = list; tail; tail = TREE_CHAIN (tail))
4758 /* ??? Do we want to add in TREE_VALUE too? */
4759 hashcode = iterative_hash_object
4760 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4764 /* Given two lists of attributes, return true if list l2 is
4765 equivalent to l1. */
4768 attribute_list_equal (const_tree l1, const_tree l2)
4770 return attribute_list_contained (l1, l2)
4771 && attribute_list_contained (l2, l1);
4774 /* Given two lists of attributes, return true if list L2 is
4775 completely contained within L1. */
4776 /* ??? This would be faster if attribute names were stored in a canonicalized
4777 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4778 must be used to show these elements are equivalent (which they are). */
4779 /* ??? It's not clear that attributes with arguments will always be handled
4783 attribute_list_contained (const_tree l1, const_tree l2)
4787 /* First check the obvious, maybe the lists are identical. */
4791 /* Maybe the lists are similar. */
4792 for (t1 = l1, t2 = l2;
4794 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4795 && TREE_VALUE (t1) == TREE_VALUE (t2);
4796 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4798 /* Maybe the lists are equal. */
4799 if (t1 == 0 && t2 == 0)
4802 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4805 for (attr = const_lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4807 attr = const_lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4810 if (TREE_VALUE (t2) != NULL
4811 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4812 && TREE_VALUE (attr) != NULL
4813 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4815 if (simple_cst_list_equal (TREE_VALUE (t2),
4816 TREE_VALUE (attr)) == 1)
4819 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4830 /* Given two lists of types
4831 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4832 return 1 if the lists contain the same types in the same order.
4833 Also, the TREE_PURPOSEs must match. */
4836 type_list_equal (const_tree l1, const_tree l2)
4840 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4841 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4842 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4843 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4844 && (TREE_TYPE (TREE_PURPOSE (t1))
4845 == TREE_TYPE (TREE_PURPOSE (t2))))))
4851 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4852 given by TYPE. If the argument list accepts variable arguments,
4853 then this function counts only the ordinary arguments. */
4856 type_num_arguments (const_tree type)
4861 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4862 /* If the function does not take a variable number of arguments,
4863 the last element in the list will have type `void'. */
4864 if (VOID_TYPE_P (TREE_VALUE (t)))
4872 /* Nonzero if integer constants T1 and T2
4873 represent the same constant value. */
4876 tree_int_cst_equal (const_tree t1, const_tree t2)
4881 if (t1 == 0 || t2 == 0)
4884 if (TREE_CODE (t1) == INTEGER_CST
4885 && TREE_CODE (t2) == INTEGER_CST
4886 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4887 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4893 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4894 The precise way of comparison depends on their data type. */
4897 tree_int_cst_lt (const_tree t1, const_tree t2)
4902 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4904 int t1_sgn = tree_int_cst_sgn (t1);
4905 int t2_sgn = tree_int_cst_sgn (t2);
4907 if (t1_sgn < t2_sgn)
4909 else if (t1_sgn > t2_sgn)
4911 /* Otherwise, both are non-negative, so we compare them as
4912 unsigned just in case one of them would overflow a signed
4915 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4916 return INT_CST_LT (t1, t2);
4918 return INT_CST_LT_UNSIGNED (t1, t2);
4921 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4924 tree_int_cst_compare (const_tree t1, const_tree t2)
4926 if (tree_int_cst_lt (t1, t2))
4928 else if (tree_int_cst_lt (t2, t1))
4934 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4935 the host. If POS is zero, the value can be represented in a single
4936 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4937 be represented in a single unsigned HOST_WIDE_INT. */
4940 host_integerp (const_tree t, int pos)
4942 return (TREE_CODE (t) == INTEGER_CST
4943 && ((TREE_INT_CST_HIGH (t) == 0
4944 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4945 || (! pos && TREE_INT_CST_HIGH (t) == -1
4946 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4947 && (!TYPE_UNSIGNED (TREE_TYPE (t))
4948 || TYPE_IS_SIZETYPE (TREE_TYPE (t))))
4949 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4952 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4953 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4954 be non-negative. We must be able to satisfy the above conditions. */
4957 tree_low_cst (const_tree t, int pos)
4959 gcc_assert (host_integerp (t, pos));
4960 return TREE_INT_CST_LOW (t);
4963 /* Return the most significant bit of the integer constant T. */
4966 tree_int_cst_msb (const_tree t)
4970 unsigned HOST_WIDE_INT l;
4972 /* Note that using TYPE_PRECISION here is wrong. We care about the
4973 actual bits, not the (arbitrary) range of the type. */
4974 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4975 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4976 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4977 return (l & 1) == 1;
4980 /* Return an indication of the sign of the integer constant T.
4981 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4982 Note that -1 will never be returned if T's type is unsigned. */
4985 tree_int_cst_sgn (const_tree t)
4987 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4989 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4991 else if (TREE_INT_CST_HIGH (t) < 0)
4997 /* Compare two constructor-element-type constants. Return 1 if the lists
4998 are known to be equal; otherwise return 0. */
5001 simple_cst_list_equal (const_tree l1, const_tree l2)
5003 while (l1 != NULL_TREE && l2 != NULL_TREE)
5005 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
5008 l1 = TREE_CHAIN (l1);
5009 l2 = TREE_CHAIN (l2);
5015 /* Return truthvalue of whether T1 is the same tree structure as T2.
5016 Return 1 if they are the same.
5017 Return 0 if they are understandably different.
5018 Return -1 if either contains tree structure not understood by
5022 simple_cst_equal (const_tree t1, const_tree t2)
5024 enum tree_code code1, code2;
5030 if (t1 == 0 || t2 == 0)
5033 code1 = TREE_CODE (t1);
5034 code2 = TREE_CODE (t2);
5036 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
5038 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5039 || code2 == NON_LVALUE_EXPR)
5040 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5042 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
5045 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5046 || code2 == NON_LVALUE_EXPR)
5047 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
5055 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5056 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
5059 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
5062 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
5065 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
5066 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
5067 TREE_STRING_LENGTH (t1)));
5071 unsigned HOST_WIDE_INT idx;
5072 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
5073 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
5075 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5078 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5079 /* ??? Should we handle also fields here? */
5080 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5081 VEC_index (constructor_elt, v2, idx)->value))
5087 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5090 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5093 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5096 const_tree arg1, arg2;
5097 const_call_expr_arg_iterator iter1, iter2;
5098 for (arg1 = first_const_call_expr_arg (t1, &iter1),
5099 arg2 = first_const_call_expr_arg (t2, &iter2);
5101 arg1 = next_const_call_expr_arg (&iter1),
5102 arg2 = next_const_call_expr_arg (&iter2))
5104 cmp = simple_cst_equal (arg1, arg2);
5108 return arg1 == arg2;
5112 /* Special case: if either target is an unallocated VAR_DECL,
5113 it means that it's going to be unified with whatever the
5114 TARGET_EXPR is really supposed to initialize, so treat it
5115 as being equivalent to anything. */
5116 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5117 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5118 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5119 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5120 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5121 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5124 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5129 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5131 case WITH_CLEANUP_EXPR:
5132 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5136 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5139 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5140 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5154 /* This general rule works for most tree codes. All exceptions should be
5155 handled above. If this is a language-specific tree code, we can't
5156 trust what might be in the operand, so say we don't know
5158 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5161 switch (TREE_CODE_CLASS (code1))
5165 case tcc_comparison:
5166 case tcc_expression:
5170 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5172 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5184 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5185 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5186 than U, respectively. */
5189 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
5191 if (tree_int_cst_sgn (t) < 0)
5193 else if (TREE_INT_CST_HIGH (t) != 0)
5195 else if (TREE_INT_CST_LOW (t) == u)
5197 else if (TREE_INT_CST_LOW (t) < u)
5203 /* Return true if CODE represents an associative tree code. Otherwise
5206 associative_tree_code (enum tree_code code)
5225 /* Return true if CODE represents a commutative tree code. Otherwise
5228 commutative_tree_code (enum tree_code code)
5241 case UNORDERED_EXPR:
5245 case TRUTH_AND_EXPR:
5246 case TRUTH_XOR_EXPR:
5256 /* Generate a hash value for an expression. This can be used iteratively
5257 by passing a previous result as the "val" argument.
5259 This function is intended to produce the same hash for expressions which
5260 would compare equal using operand_equal_p. */
5263 iterative_hash_expr (const_tree t, hashval_t val)
5266 enum tree_code code;
5270 return iterative_hash_pointer (t, val);
5272 code = TREE_CODE (t);
5276 /* Alas, constants aren't shared, so we can't rely on pointer
5279 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5280 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5283 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5285 return iterative_hash_hashval_t (val2, val);
5289 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
5291 return iterative_hash_hashval_t (val2, val);
5294 return iterative_hash (TREE_STRING_POINTER (t),
5295 TREE_STRING_LENGTH (t), val);
5297 val = iterative_hash_expr (TREE_REALPART (t), val);
5298 return iterative_hash_expr (TREE_IMAGPART (t), val);
5300 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5304 /* we can just compare by pointer. */
5305 return iterative_hash_pointer (t, val);
5308 /* A list of expressions, for a CALL_EXPR or as the elements of a
5310 for (; t; t = TREE_CHAIN (t))
5311 val = iterative_hash_expr (TREE_VALUE (t), val);
5315 unsigned HOST_WIDE_INT idx;
5317 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5319 val = iterative_hash_expr (field, val);
5320 val = iterative_hash_expr (value, val);
5325 /* When referring to a built-in FUNCTION_DECL, use the
5326 __builtin__ form. Otherwise nodes that compare equal
5327 according to operand_equal_p might get different
5329 if (DECL_BUILT_IN (t))
5331 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5335 /* else FALL THROUGH */
5337 class = TREE_CODE_CLASS (code);
5339 if (class == tcc_declaration)
5341 /* DECL's have a unique ID */
5342 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5346 gcc_assert (IS_EXPR_CODE_CLASS (class));
5348 val = iterative_hash_object (code, val);
5350 /* Don't hash the type, that can lead to having nodes which
5351 compare equal according to operand_equal_p, but which
5352 have different hash codes. */
5353 if (code == NOP_EXPR
5354 || code == CONVERT_EXPR
5355 || code == NON_LVALUE_EXPR)
5357 /* Make sure to include signness in the hash computation. */
5358 val += TYPE_UNSIGNED (TREE_TYPE (t));
5359 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5362 else if (commutative_tree_code (code))
5364 /* It's a commutative expression. We want to hash it the same
5365 however it appears. We do this by first hashing both operands
5366 and then rehashing based on the order of their independent
5368 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5369 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5373 t = one, one = two, two = t;
5375 val = iterative_hash_hashval_t (one, val);
5376 val = iterative_hash_hashval_t (two, val);
5379 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5380 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5387 /* Constructors for pointer, array and function types.
5388 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5389 constructed by language-dependent code, not here.) */
5391 /* Construct, lay out and return the type of pointers to TO_TYPE with
5392 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5393 reference all of memory. If such a type has already been
5394 constructed, reuse it. */
5397 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5402 if (to_type == error_mark_node)
5403 return error_mark_node;
5405 /* In some cases, languages will have things that aren't a POINTER_TYPE
5406 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5407 In that case, return that type without regard to the rest of our
5410 ??? This is a kludge, but consistent with the way this function has
5411 always operated and there doesn't seem to be a good way to avoid this
5413 if (TYPE_POINTER_TO (to_type) != 0
5414 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5415 return TYPE_POINTER_TO (to_type);
5417 /* First, if we already have a type for pointers to TO_TYPE and it's
5418 the proper mode, use it. */
5419 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5420 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5423 t = make_node (POINTER_TYPE);
5425 TREE_TYPE (t) = to_type;
5426 TYPE_MODE (t) = mode;
5427 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5428 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5429 TYPE_POINTER_TO (to_type) = t;
5431 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5432 SET_TYPE_STRUCTURAL_EQUALITY (t);
5433 else if (TYPE_CANONICAL (to_type) != to_type)
5435 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5436 mode, can_alias_all);
5438 /* Lay out the type. This function has many callers that are concerned
5439 with expression-construction, and this simplifies them all. */
5445 /* By default build pointers in ptr_mode. */
5448 build_pointer_type (tree to_type)
5450 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5453 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5456 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5461 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5462 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5463 In that case, return that type without regard to the rest of our
5466 ??? This is a kludge, but consistent with the way this function has
5467 always operated and there doesn't seem to be a good way to avoid this
5469 if (TYPE_REFERENCE_TO (to_type) != 0
5470 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5471 return TYPE_REFERENCE_TO (to_type);
5473 /* First, if we already have a type for pointers to TO_TYPE and it's
5474 the proper mode, use it. */
5475 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5476 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5479 t = make_node (REFERENCE_TYPE);
5481 TREE_TYPE (t) = to_type;
5482 TYPE_MODE (t) = mode;
5483 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5484 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5485 TYPE_REFERENCE_TO (to_type) = t;
5487 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5488 SET_TYPE_STRUCTURAL_EQUALITY (t);
5489 else if (TYPE_CANONICAL (to_type) != to_type)
5491 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5492 mode, can_alias_all);
5500 /* Build the node for the type of references-to-TO_TYPE by default
5504 build_reference_type (tree to_type)
5506 return build_reference_type_for_mode (to_type, ptr_mode, false);
5509 /* Build a type that is compatible with t but has no cv quals anywhere
5512 const char *const *const * -> char ***. */
5515 build_type_no_quals (tree t)
5517 switch (TREE_CODE (t))
5520 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5522 TYPE_REF_CAN_ALIAS_ALL (t));
5523 case REFERENCE_TYPE:
5525 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5527 TYPE_REF_CAN_ALIAS_ALL (t));
5529 return TYPE_MAIN_VARIANT (t);
5533 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5534 MAXVAL should be the maximum value in the domain
5535 (one less than the length of the array).
5537 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5538 We don't enforce this limit, that is up to caller (e.g. language front end).
5539 The limit exists because the result is a signed type and we don't handle
5540 sizes that use more than one HOST_WIDE_INT. */
5543 build_index_type (tree maxval)
5545 tree itype = make_node (INTEGER_TYPE);
5547 TREE_TYPE (itype) = sizetype;
5548 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5549 TYPE_MIN_VALUE (itype) = size_zero_node;
5550 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5551 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5552 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5553 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5554 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5555 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5557 if (host_integerp (maxval, 1))
5558 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5561 /* Since we cannot hash this type, we need to compare it using
5562 structural equality checks. */
5563 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5568 /* Builds a signed or unsigned integer type of precision PRECISION.
5569 Used for C bitfields whose precision does not match that of
5570 built-in target types. */
5572 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5575 tree itype = make_node (INTEGER_TYPE);
5577 TYPE_PRECISION (itype) = precision;
5580 fixup_unsigned_type (itype);
5582 fixup_signed_type (itype);
5584 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5585 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5590 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5591 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5592 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5595 build_range_type (tree type, tree lowval, tree highval)
5597 tree itype = make_node (INTEGER_TYPE);
5599 TREE_TYPE (itype) = type;
5600 if (type == NULL_TREE)
5603 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5604 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5606 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5607 TYPE_MODE (itype) = TYPE_MODE (type);
5608 TYPE_SIZE (itype) = TYPE_SIZE (type);
5609 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5610 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5611 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5613 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5614 return type_hash_canon (tree_low_cst (highval, 0)
5615 - tree_low_cst (lowval, 0),
5621 /* Just like build_index_type, but takes lowval and highval instead
5622 of just highval (maxval). */
5625 build_index_2_type (tree lowval, tree highval)
5627 return build_range_type (sizetype, lowval, highval);
5630 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5631 and number of elements specified by the range of values of INDEX_TYPE.
5632 If such a type has already been constructed, reuse it. */
5635 build_array_type (tree elt_type, tree index_type)
5638 hashval_t hashcode = 0;
5640 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5642 error ("arrays of functions are not meaningful");
5643 elt_type = integer_type_node;
5646 t = make_node (ARRAY_TYPE);
5647 TREE_TYPE (t) = elt_type;
5648 TYPE_DOMAIN (t) = index_type;
5650 if (index_type == 0)
5653 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5654 t = type_hash_canon (hashcode, t);
5658 if (TYPE_CANONICAL (t) == t)
5660 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5661 SET_TYPE_STRUCTURAL_EQUALITY (t);
5662 else if (TYPE_CANONICAL (elt_type) != elt_type)
5664 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5670 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5671 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5672 t = type_hash_canon (hashcode, t);
5674 if (!COMPLETE_TYPE_P (t))
5677 if (TYPE_CANONICAL (t) == t)
5679 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5680 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5681 SET_TYPE_STRUCTURAL_EQUALITY (t);
5682 else if (TYPE_CANONICAL (elt_type) != elt_type
5683 || TYPE_CANONICAL (index_type) != index_type)
5685 = build_array_type (TYPE_CANONICAL (elt_type),
5686 TYPE_CANONICAL (index_type));
5692 /* Return the TYPE of the elements comprising
5693 the innermost dimension of ARRAY. */
5696 get_inner_array_type (const_tree array)
5698 tree type = TREE_TYPE (array);
5700 while (TREE_CODE (type) == ARRAY_TYPE)
5701 type = TREE_TYPE (type);
5706 /* Computes the canonical argument types from the argument type list
5709 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5710 on entry to this function, or if any of the ARGTYPES are
5713 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5714 true on entry to this function, or if any of the ARGTYPES are
5717 Returns a canonical argument list, which may be ARGTYPES when the
5718 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5719 true) or would not differ from ARGTYPES. */
5722 maybe_canonicalize_argtypes(tree argtypes,
5723 bool *any_structural_p,
5724 bool *any_noncanonical_p)
5727 bool any_noncanonical_argtypes_p = false;
5729 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
5731 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
5732 /* Fail gracefully by stating that the type is structural. */
5733 *any_structural_p = true;
5734 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
5735 *any_structural_p = true;
5736 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
5737 || TREE_PURPOSE (arg))
5738 /* If the argument has a default argument, we consider it
5739 non-canonical even though the type itself is canonical.
5740 That way, different variants of function and method types
5741 with default arguments will all point to the variant with
5742 no defaults as their canonical type. */
5743 any_noncanonical_argtypes_p = true;
5746 if (*any_structural_p)
5749 if (any_noncanonical_argtypes_p)
5751 /* Build the canonical list of argument types. */
5752 tree canon_argtypes = NULL_TREE;
5753 bool is_void = false;
5755 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
5757 if (arg == void_list_node)
5760 canon_argtypes = tree_cons (NULL_TREE,
5761 TYPE_CANONICAL (TREE_VALUE (arg)),
5765 canon_argtypes = nreverse (canon_argtypes);
5767 canon_argtypes = chainon (canon_argtypes, void_list_node);
5769 /* There is a non-canonical type. */
5770 *any_noncanonical_p = true;
5771 return canon_argtypes;
5774 /* The canonical argument types are the same as ARGTYPES. */
5778 /* Construct, lay out and return
5779 the type of functions returning type VALUE_TYPE
5780 given arguments of types ARG_TYPES.
5781 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5782 are data type nodes for the arguments of the function.
5783 If such a type has already been constructed, reuse it. */
5786 build_function_type (tree value_type, tree arg_types)
5789 hashval_t hashcode = 0;
5790 bool any_structural_p, any_noncanonical_p;
5791 tree canon_argtypes;
5793 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5795 error ("function return type cannot be function");
5796 value_type = integer_type_node;
5799 /* Make a node of the sort we want. */
5800 t = make_node (FUNCTION_TYPE);
5801 TREE_TYPE (t) = value_type;
5802 TYPE_ARG_TYPES (t) = arg_types;
5804 /* If we already have such a type, use the old one. */
5805 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5806 hashcode = type_hash_list (arg_types, hashcode);
5807 t = type_hash_canon (hashcode, t);
5809 /* Set up the canonical type. */
5810 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
5811 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
5812 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
5814 &any_noncanonical_p);
5815 if (any_structural_p)
5816 SET_TYPE_STRUCTURAL_EQUALITY (t);
5817 else if (any_noncanonical_p)
5818 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
5821 if (!COMPLETE_TYPE_P (t))
5826 /* Build a function type. The RETURN_TYPE is the type returned by the
5827 function. If additional arguments are provided, they are
5828 additional argument types. The list of argument types must always
5829 be terminated by NULL_TREE. */
5832 build_function_type_list (tree return_type, ...)
5837 va_start (p, return_type);
5839 t = va_arg (p, tree);
5840 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5841 args = tree_cons (NULL_TREE, t, args);
5843 if (args == NULL_TREE)
5844 args = void_list_node;
5848 args = nreverse (args);
5849 TREE_CHAIN (last) = void_list_node;
5851 args = build_function_type (return_type, args);
5857 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5858 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5859 for the method. An implicit additional parameter (of type
5860 pointer-to-BASETYPE) is added to the ARGTYPES. */
5863 build_method_type_directly (tree basetype,
5870 bool any_structural_p, any_noncanonical_p;
5871 tree canon_argtypes;
5873 /* Make a node of the sort we want. */
5874 t = make_node (METHOD_TYPE);
5876 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5877 TREE_TYPE (t) = rettype;
5878 ptype = build_pointer_type (basetype);
5880 /* The actual arglist for this function includes a "hidden" argument
5881 which is "this". Put it into the list of argument types. */
5882 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5883 TYPE_ARG_TYPES (t) = argtypes;
5885 /* If we already have such a type, use the old one. */
5886 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5887 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5888 hashcode = type_hash_list (argtypes, hashcode);
5889 t = type_hash_canon (hashcode, t);
5891 /* Set up the canonical type. */
5893 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5894 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
5896 = (TYPE_CANONICAL (basetype) != basetype
5897 || TYPE_CANONICAL (rettype) != rettype);
5898 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
5900 &any_noncanonical_p);
5901 if (any_structural_p)
5902 SET_TYPE_STRUCTURAL_EQUALITY (t);
5903 else if (any_noncanonical_p)
5905 = build_method_type_directly (TYPE_CANONICAL (basetype),
5906 TYPE_CANONICAL (rettype),
5908 if (!COMPLETE_TYPE_P (t))
5914 /* Construct, lay out and return the type of methods belonging to class
5915 BASETYPE and whose arguments and values are described by TYPE.
5916 If that type exists already, reuse it.
5917 TYPE must be a FUNCTION_TYPE node. */
5920 build_method_type (tree basetype, tree type)
5922 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5924 return build_method_type_directly (basetype,
5926 TYPE_ARG_TYPES (type));
5929 /* Construct, lay out and return the type of offsets to a value
5930 of type TYPE, within an object of type BASETYPE.
5931 If a suitable offset type exists already, reuse it. */
5934 build_offset_type (tree basetype, tree type)
5937 hashval_t hashcode = 0;
5939 /* Make a node of the sort we want. */
5940 t = make_node (OFFSET_TYPE);
5942 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5943 TREE_TYPE (t) = type;
5945 /* If we already have such a type, use the old one. */
5946 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5947 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5948 t = type_hash_canon (hashcode, t);
5950 if (!COMPLETE_TYPE_P (t))
5953 if (TYPE_CANONICAL (t) == t)
5955 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5956 || TYPE_STRUCTURAL_EQUALITY_P (type))
5957 SET_TYPE_STRUCTURAL_EQUALITY (t);
5958 else if (TYPE_CANONICAL (basetype) != basetype
5959 || TYPE_CANONICAL (type) != type)
5961 = build_offset_type (TYPE_CANONICAL (basetype),
5962 TYPE_CANONICAL (type));
5968 /* Create a complex type whose components are COMPONENT_TYPE. */
5971 build_complex_type (tree component_type)
5976 /* Make a node of the sort we want. */
5977 t = make_node (COMPLEX_TYPE);
5979 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5981 /* If we already have such a type, use the old one. */
5982 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5983 t = type_hash_canon (hashcode, t);
5985 if (!COMPLETE_TYPE_P (t))
5988 if (TYPE_CANONICAL (t) == t)
5990 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
5991 SET_TYPE_STRUCTURAL_EQUALITY (t);
5992 else if (TYPE_CANONICAL (component_type) != component_type)
5994 = build_complex_type (TYPE_CANONICAL (component_type));
5997 /* If we are writing Dwarf2 output we need to create a name,
5998 since complex is a fundamental type. */
5999 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
6003 if (component_type == char_type_node)
6004 name = "complex char";
6005 else if (component_type == signed_char_type_node)
6006 name = "complex signed char";
6007 else if (component_type == unsigned_char_type_node)
6008 name = "complex unsigned char";
6009 else if (component_type == short_integer_type_node)
6010 name = "complex short int";
6011 else if (component_type == short_unsigned_type_node)
6012 name = "complex short unsigned int";
6013 else if (component_type == integer_type_node)
6014 name = "complex int";
6015 else if (component_type == unsigned_type_node)
6016 name = "complex unsigned int";
6017 else if (component_type == long_integer_type_node)
6018 name = "complex long int";
6019 else if (component_type == long_unsigned_type_node)
6020 name = "complex long unsigned int";
6021 else if (component_type == long_long_integer_type_node)
6022 name = "complex long long int";
6023 else if (component_type == long_long_unsigned_type_node)
6024 name = "complex long long unsigned int";
6029 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
6032 return build_qualified_type (t, TYPE_QUALS (component_type));
6035 /* Return OP, stripped of any conversions to wider types as much as is safe.
6036 Converting the value back to OP's type makes a value equivalent to OP.
6038 If FOR_TYPE is nonzero, we return a value which, if converted to
6039 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6041 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
6042 narrowest type that can hold the value, even if they don't exactly fit.
6043 Otherwise, bit-field references are changed to a narrower type
6044 only if they can be fetched directly from memory in that type.
6046 OP must have integer, real or enumeral type. Pointers are not allowed!
6048 There are some cases where the obvious value we could return
6049 would regenerate to OP if converted to OP's type,
6050 but would not extend like OP to wider types.
6051 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6052 For example, if OP is (unsigned short)(signed char)-1,
6053 we avoid returning (signed char)-1 if FOR_TYPE is int,
6054 even though extending that to an unsigned short would regenerate OP,
6055 since the result of extending (signed char)-1 to (int)
6056 is different from (int) OP. */
6059 get_unwidened (tree op, tree for_type)
6061 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6062 tree type = TREE_TYPE (op);
6064 = TYPE_PRECISION (for_type != 0 ? for_type : type);
6066 = (for_type != 0 && for_type != type
6067 && final_prec > TYPE_PRECISION (type)
6068 && TYPE_UNSIGNED (type));
6071 while (TREE_CODE (op) == NOP_EXPR
6072 || TREE_CODE (op) == CONVERT_EXPR)
6076 /* TYPE_PRECISION on vector types has different meaning
6077 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6078 so avoid them here. */
6079 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
6082 bitschange = TYPE_PRECISION (TREE_TYPE (op))
6083 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
6085 /* Truncations are many-one so cannot be removed.
6086 Unless we are later going to truncate down even farther. */
6088 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
6091 /* See what's inside this conversion. If we decide to strip it,
6093 op = TREE_OPERAND (op, 0);
6095 /* If we have not stripped any zero-extensions (uns is 0),
6096 we can strip any kind of extension.
6097 If we have previously stripped a zero-extension,
6098 only zero-extensions can safely be stripped.
6099 Any extension can be stripped if the bits it would produce
6100 are all going to be discarded later by truncating to FOR_TYPE. */
6104 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
6106 /* TYPE_UNSIGNED says whether this is a zero-extension.
6107 Let's avoid computing it if it does not affect WIN
6108 and if UNS will not be needed again. */
6110 || TREE_CODE (op) == NOP_EXPR
6111 || TREE_CODE (op) == CONVERT_EXPR)
6112 && TYPE_UNSIGNED (TREE_TYPE (op)))
6120 if (TREE_CODE (op) == COMPONENT_REF
6121 /* Since type_for_size always gives an integer type. */
6122 && TREE_CODE (type) != REAL_TYPE
6123 && TREE_CODE (type) != FIXED_POINT_TYPE
6124 /* Don't crash if field not laid out yet. */
6125 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6126 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6128 unsigned int innerprec
6129 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6130 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6131 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6132 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6134 /* We can get this structure field in the narrowest type it fits in.
6135 If FOR_TYPE is 0, do this only for a field that matches the
6136 narrower type exactly and is aligned for it
6137 The resulting extension to its nominal type (a fullword type)
6138 must fit the same conditions as for other extensions. */
6141 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
6142 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
6143 && (! uns || final_prec <= innerprec || unsignedp))
6145 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
6146 TREE_OPERAND (op, 1), NULL_TREE);
6147 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
6148 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
6155 /* Return OP or a simpler expression for a narrower value
6156 which can be sign-extended or zero-extended to give back OP.
6157 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6158 or 0 if the value should be sign-extended. */
6161 get_narrower (tree op, int *unsignedp_ptr)
6166 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
6168 while (TREE_CODE (op) == NOP_EXPR)
6171 = (TYPE_PRECISION (TREE_TYPE (op))
6172 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
6174 /* Truncations are many-one so cannot be removed. */
6178 /* See what's inside this conversion. If we decide to strip it,
6183 op = TREE_OPERAND (op, 0);
6184 /* An extension: the outermost one can be stripped,
6185 but remember whether it is zero or sign extension. */
6187 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6188 /* Otherwise, if a sign extension has been stripped,
6189 only sign extensions can now be stripped;
6190 if a zero extension has been stripped, only zero-extensions. */
6191 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6195 else /* bitschange == 0 */
6197 /* A change in nominal type can always be stripped, but we must
6198 preserve the unsignedness. */
6200 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6202 op = TREE_OPERAND (op, 0);
6203 /* Keep trying to narrow, but don't assign op to win if it
6204 would turn an integral type into something else. */
6205 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6212 if (TREE_CODE (op) == COMPONENT_REF
6213 /* Since type_for_size always gives an integer type. */
6214 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6215 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
6216 /* Ensure field is laid out already. */
6217 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6218 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6220 unsigned HOST_WIDE_INT innerprec
6221 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6222 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6223 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6224 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6226 /* We can get this structure field in a narrower type that fits it,
6227 but the resulting extension to its nominal type (a fullword type)
6228 must satisfy the same conditions as for other extensions.
6230 Do this only for fields that are aligned (not bit-fields),
6231 because when bit-field insns will be used there is no
6232 advantage in doing this. */
6234 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6235 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6236 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6240 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6241 win = fold_convert (type, op);
6245 *unsignedp_ptr = uns;
6249 /* Nonzero if integer constant C has a value that is permissible
6250 for type TYPE (an INTEGER_TYPE). */
6253 int_fits_type_p (const_tree c, const_tree type)
6255 tree type_low_bound = TYPE_MIN_VALUE (type);
6256 tree type_high_bound = TYPE_MAX_VALUE (type);
6257 bool ok_for_low_bound, ok_for_high_bound;
6258 unsigned HOST_WIDE_INT low;
6261 /* If at least one bound of the type is a constant integer, we can check
6262 ourselves and maybe make a decision. If no such decision is possible, but
6263 this type is a subtype, try checking against that. Otherwise, use
6264 fit_double_type, which checks against the precision.
6266 Compute the status for each possibly constant bound, and return if we see
6267 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6268 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6269 for "constant known to fit". */
6271 /* Check if C >= type_low_bound. */
6272 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6274 if (tree_int_cst_lt (c, type_low_bound))
6276 ok_for_low_bound = true;
6279 ok_for_low_bound = false;
6281 /* Check if c <= type_high_bound. */
6282 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6284 if (tree_int_cst_lt (type_high_bound, c))
6286 ok_for_high_bound = true;
6289 ok_for_high_bound = false;
6291 /* If the constant fits both bounds, the result is known. */
6292 if (ok_for_low_bound && ok_for_high_bound)
6295 /* Perform some generic filtering which may allow making a decision
6296 even if the bounds are not constant. First, negative integers
6297 never fit in unsigned types, */
6298 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6301 /* Second, narrower types always fit in wider ones. */
6302 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6305 /* Third, unsigned integers with top bit set never fit signed types. */
6306 if (! TYPE_UNSIGNED (type)
6307 && TYPE_UNSIGNED (TREE_TYPE (c))
6308 && tree_int_cst_msb (c))
6311 /* If we haven't been able to decide at this point, there nothing more we
6312 can check ourselves here. Look at the base type if we have one and it
6313 has the same precision. */
6314 if (TREE_CODE (type) == INTEGER_TYPE
6315 && TREE_TYPE (type) != 0
6316 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6317 return int_fits_type_p (c, TREE_TYPE (type));
6319 /* Or to fit_double_type, if nothing else. */
6320 low = TREE_INT_CST_LOW (c);
6321 high = TREE_INT_CST_HIGH (c);
6322 return !fit_double_type (low, high, &low, &high, type);
6325 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6326 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6327 represented (assuming two's-complement arithmetic) within the bit
6328 precision of the type are returned instead. */
6331 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
6333 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
6334 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
6335 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
6336 TYPE_UNSIGNED (type));
6339 if (TYPE_UNSIGNED (type))
6340 mpz_set_ui (min, 0);
6344 mn = double_int_mask (TYPE_PRECISION (type) - 1);
6345 mn = double_int_sext (double_int_add (mn, double_int_one),
6346 TYPE_PRECISION (type));
6347 mpz_set_double_int (min, mn, false);
6351 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
6352 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
6353 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
6354 TYPE_UNSIGNED (type));
6357 if (TYPE_UNSIGNED (type))
6358 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
6361 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
6366 /* auto_var_in_fn_p is called to determine whether VAR is an automatic
6367 variable defined in function FN. */
6370 auto_var_in_fn_p (const_tree var, const_tree fn)
6372 return (DECL_P (var) && DECL_CONTEXT (var) == fn
6373 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
6374 && ! TREE_STATIC (var))
6375 || TREE_CODE (var) == LABEL_DECL
6376 || TREE_CODE (var) == RESULT_DECL));
6379 /* Subprogram of following function. Called by walk_tree.
6381 Return *TP if it is an automatic variable or parameter of the
6382 function passed in as DATA. */
6385 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6387 tree fn = (tree) data;
6392 else if (DECL_P (*tp)
6393 && auto_var_in_fn_p (*tp, fn))
6399 /* Returns true if T is, contains, or refers to a type with variable
6400 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6401 arguments, but not the return type. If FN is nonzero, only return
6402 true if a modifier of the type or position of FN is a variable or
6403 parameter inside FN.
6405 This concept is more general than that of C99 'variably modified types':
6406 in C99, a struct type is never variably modified because a VLA may not
6407 appear as a structure member. However, in GNU C code like:
6409 struct S { int i[f()]; };
6411 is valid, and other languages may define similar constructs. */
6414 variably_modified_type_p (tree type, tree fn)
6418 /* Test if T is either variable (if FN is zero) or an expression containing
6419 a variable in FN. */
6420 #define RETURN_TRUE_IF_VAR(T) \
6421 do { tree _t = (T); \
6422 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6423 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6424 return true; } while (0)
6426 if (type == error_mark_node)
6429 /* If TYPE itself has variable size, it is variably modified. */
6430 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6431 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6433 switch (TREE_CODE (type))
6436 case REFERENCE_TYPE:
6438 if (variably_modified_type_p (TREE_TYPE (type), fn))
6444 /* If TYPE is a function type, it is variably modified if the
6445 return type is variably modified. */
6446 if (variably_modified_type_p (TREE_TYPE (type), fn))
6452 case FIXED_POINT_TYPE:
6455 /* Scalar types are variably modified if their end points
6457 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6458 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6463 case QUAL_UNION_TYPE:
6464 /* We can't see if any of the fields are variably-modified by the
6465 definition we normally use, since that would produce infinite
6466 recursion via pointers. */
6467 /* This is variably modified if some field's type is. */
6468 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6469 if (TREE_CODE (t) == FIELD_DECL)
6471 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6472 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6473 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6475 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6476 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6481 /* Do not call ourselves to avoid infinite recursion. This is
6482 variably modified if the element type is. */
6483 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6484 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6491 /* The current language may have other cases to check, but in general,
6492 all other types are not variably modified. */
6493 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6495 #undef RETURN_TRUE_IF_VAR
6498 /* Given a DECL or TYPE, return the scope in which it was declared, or
6499 NULL_TREE if there is no containing scope. */
6502 get_containing_scope (const_tree t)
6504 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6507 /* Return the innermost context enclosing DECL that is
6508 a FUNCTION_DECL, or zero if none. */
6511 decl_function_context (const_tree decl)
6515 if (TREE_CODE (decl) == ERROR_MARK)
6518 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6519 where we look up the function at runtime. Such functions always take
6520 a first argument of type 'pointer to real context'.
6522 C++ should really be fixed to use DECL_CONTEXT for the real context,
6523 and use something else for the "virtual context". */
6524 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6527 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6529 context = DECL_CONTEXT (decl);
6531 while (context && TREE_CODE (context) != FUNCTION_DECL)
6533 if (TREE_CODE (context) == BLOCK)
6534 context = BLOCK_SUPERCONTEXT (context);
6536 context = get_containing_scope (context);
6542 /* Return the innermost context enclosing DECL that is
6543 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6544 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6547 decl_type_context (const_tree decl)
6549 tree context = DECL_CONTEXT (decl);
6552 switch (TREE_CODE (context))
6554 case NAMESPACE_DECL:
6555 case TRANSLATION_UNIT_DECL:
6560 case QUAL_UNION_TYPE:
6565 context = DECL_CONTEXT (context);
6569 context = BLOCK_SUPERCONTEXT (context);
6579 /* CALL is a CALL_EXPR. Return the declaration for the function
6580 called, or NULL_TREE if the called function cannot be
6584 get_callee_fndecl (const_tree call)
6588 if (call == error_mark_node)
6589 return error_mark_node;
6591 /* It's invalid to call this function with anything but a
6593 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6595 /* The first operand to the CALL is the address of the function
6597 addr = CALL_EXPR_FN (call);
6601 /* If this is a readonly function pointer, extract its initial value. */
6602 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6603 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6604 && DECL_INITIAL (addr))
6605 addr = DECL_INITIAL (addr);
6607 /* If the address is just `&f' for some function `f', then we know
6608 that `f' is being called. */
6609 if (TREE_CODE (addr) == ADDR_EXPR
6610 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6611 return TREE_OPERAND (addr, 0);
6613 /* We couldn't figure out what was being called. Maybe the front
6614 end has some idea. */
6615 return lang_hooks.lang_get_callee_fndecl (call);
6618 /* Print debugging information about tree nodes generated during the compile,
6619 and any language-specific information. */
6622 dump_tree_statistics (void)
6624 #ifdef GATHER_STATISTICS
6626 int total_nodes, total_bytes;
6629 fprintf (stderr, "\n??? tree nodes created\n\n");
6630 #ifdef GATHER_STATISTICS
6631 fprintf (stderr, "Kind Nodes Bytes\n");
6632 fprintf (stderr, "---------------------------------------\n");
6633 total_nodes = total_bytes = 0;
6634 for (i = 0; i < (int) all_kinds; i++)
6636 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6637 tree_node_counts[i], tree_node_sizes[i]);
6638 total_nodes += tree_node_counts[i];
6639 total_bytes += tree_node_sizes[i];
6641 fprintf (stderr, "---------------------------------------\n");
6642 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6643 fprintf (stderr, "---------------------------------------\n");
6644 ssanames_print_statistics ();
6645 phinodes_print_statistics ();
6647 fprintf (stderr, "(No per-node statistics)\n");
6649 print_type_hash_statistics ();
6650 print_debug_expr_statistics ();
6651 print_value_expr_statistics ();
6652 print_restrict_base_statistics ();
6653 lang_hooks.print_statistics ();
6656 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6658 /* Generate a crc32 of a string. */
6661 crc32_string (unsigned chksum, const char *string)
6665 unsigned value = *string << 24;
6668 for (ix = 8; ix--; value <<= 1)
6672 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6681 /* P is a string that will be used in a symbol. Mask out any characters
6682 that are not valid in that context. */
6685 clean_symbol_name (char *p)
6689 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6692 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6699 /* Generate a name for a special-purpose function function.
6700 The generated name may need to be unique across the whole link.
6701 TYPE is some string to identify the purpose of this function to the
6702 linker or collect2; it must start with an uppercase letter,
6704 I - for constructors
6706 N - for C++ anonymous namespaces
6707 F - for DWARF unwind frame information. */
6710 get_file_function_name (const char *type)
6716 /* If we already have a name we know to be unique, just use that. */
6717 if (first_global_object_name)
6718 p = first_global_object_name;
6719 /* If the target is handling the constructors/destructors, they
6720 will be local to this file and the name is only necessary for
6721 debugging purposes. */
6722 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6724 const char *file = main_input_filename;
6726 file = input_filename;
6727 /* Just use the file's basename, because the full pathname
6728 might be quite long. */
6729 p = strrchr (file, '/');
6734 p = q = ASTRDUP (p);
6735 clean_symbol_name (q);
6739 /* Otherwise, the name must be unique across the entire link.
6740 We don't have anything that we know to be unique to this translation
6741 unit, so use what we do have and throw in some randomness. */
6743 const char *name = weak_global_object_name;
6744 const char *file = main_input_filename;
6749 file = input_filename;
6751 len = strlen (file);
6752 q = alloca (9 * 2 + len + 1);
6753 memcpy (q, file, len + 1);
6754 clean_symbol_name (q);
6756 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6757 crc32_string (0, get_random_seed (false)));
6762 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6764 /* Set up the name of the file-level functions we may need.
6765 Use a global object (which is already required to be unique over
6766 the program) rather than the file name (which imposes extra
6768 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6770 return get_identifier (buf);
6773 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6775 /* Complain that the tree code of NODE does not match the expected 0
6776 terminated list of trailing codes. The trailing code list can be
6777 empty, for a more vague error message. FILE, LINE, and FUNCTION
6778 are of the caller. */
6781 tree_check_failed (const_tree node, const char *file,
6782 int line, const char *function, ...)
6786 unsigned length = 0;
6789 va_start (args, function);
6790 while ((code = va_arg (args, int)))
6791 length += 4 + strlen (tree_code_name[code]);
6796 va_start (args, function);
6797 length += strlen ("expected ");
6798 buffer = tmp = alloca (length);
6800 while ((code = va_arg (args, int)))
6802 const char *prefix = length ? " or " : "expected ";
6804 strcpy (tmp + length, prefix);
6805 length += strlen (prefix);
6806 strcpy (tmp + length, tree_code_name[code]);
6807 length += strlen (tree_code_name[code]);
6812 buffer = "unexpected node";
6814 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6815 buffer, tree_code_name[TREE_CODE (node)],
6816 function, trim_filename (file), line);
6819 /* Complain that the tree code of NODE does match the expected 0
6820 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6824 tree_not_check_failed (const_tree node, const char *file,
6825 int line, const char *function, ...)
6829 unsigned length = 0;
6832 va_start (args, function);
6833 while ((code = va_arg (args, int)))
6834 length += 4 + strlen (tree_code_name[code]);
6836 va_start (args, function);
6837 buffer = alloca (length);
6839 while ((code = va_arg (args, int)))
6843 strcpy (buffer + length, " or ");
6846 strcpy (buffer + length, tree_code_name[code]);
6847 length += strlen (tree_code_name[code]);
6851 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6852 buffer, tree_code_name[TREE_CODE (node)],
6853 function, trim_filename (file), line);
6856 /* Similar to tree_check_failed, except that we check for a class of tree
6857 code, given in CL. */
6860 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
6861 const char *file, int line, const char *function)
6864 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6865 TREE_CODE_CLASS_STRING (cl),
6866 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6867 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6870 /* Similar to tree_check_failed, except that instead of specifying a
6871 dozen codes, use the knowledge that they're all sequential. */
6874 tree_range_check_failed (const_tree node, const char *file, int line,
6875 const char *function, enum tree_code c1,
6879 unsigned length = 0;
6882 for (c = c1; c <= c2; ++c)
6883 length += 4 + strlen (tree_code_name[c]);
6885 length += strlen ("expected ");
6886 buffer = alloca (length);
6889 for (c = c1; c <= c2; ++c)
6891 const char *prefix = length ? " or " : "expected ";
6893 strcpy (buffer + length, prefix);
6894 length += strlen (prefix);
6895 strcpy (buffer + length, tree_code_name[c]);
6896 length += strlen (tree_code_name[c]);
6899 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6900 buffer, tree_code_name[TREE_CODE (node)],
6901 function, trim_filename (file), line);
6905 /* Similar to tree_check_failed, except that we check that a tree does
6906 not have the specified code, given in CL. */
6909 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
6910 const char *file, int line, const char *function)
6913 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6914 TREE_CODE_CLASS_STRING (cl),
6915 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6916 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6920 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6923 omp_clause_check_failed (const_tree node, const char *file, int line,
6924 const char *function, enum omp_clause_code code)
6926 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6927 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6928 function, trim_filename (file), line);
6932 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6935 omp_clause_range_check_failed (const_tree node, const char *file, int line,
6936 const char *function, enum omp_clause_code c1,
6937 enum omp_clause_code c2)
6940 unsigned length = 0;
6941 enum omp_clause_code c;
6943 for (c = c1; c <= c2; ++c)
6944 length += 4 + strlen (omp_clause_code_name[c]);
6946 length += strlen ("expected ");
6947 buffer = alloca (length);
6950 for (c = c1; c <= c2; ++c)
6952 const char *prefix = length ? " or " : "expected ";
6954 strcpy (buffer + length, prefix);
6955 length += strlen (prefix);
6956 strcpy (buffer + length, omp_clause_code_name[c]);
6957 length += strlen (omp_clause_code_name[c]);
6960 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6961 buffer, omp_clause_code_name[TREE_CODE (node)],
6962 function, trim_filename (file), line);
6966 #undef DEFTREESTRUCT
6967 #define DEFTREESTRUCT(VAL, NAME) NAME,
6969 static const char *ts_enum_names[] = {
6970 #include "treestruct.def"
6972 #undef DEFTREESTRUCT
6974 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6976 /* Similar to tree_class_check_failed, except that we check for
6977 whether CODE contains the tree structure identified by EN. */
6980 tree_contains_struct_check_failed (const_tree node,
6981 const enum tree_node_structure_enum en,
6982 const char *file, int line,
6983 const char *function)
6986 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6988 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6992 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6993 (dynamically sized) vector. */
6996 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6997 const char *function)
7000 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7001 idx + 1, len, function, trim_filename (file), line);
7004 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
7005 (dynamically sized) vector. */
7008 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
7009 const char *function)
7012 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
7013 idx + 1, len, function, trim_filename (file), line);
7016 /* Similar to above, except that the check is for the bounds of the operand
7017 vector of an expression node EXP. */
7020 tree_operand_check_failed (int idx, const_tree exp, const char *file,
7021 int line, const char *function)
7023 int code = TREE_CODE (exp);
7025 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7026 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
7027 function, trim_filename (file), line);
7030 /* Similar to above, except that the check is for the number of
7031 operands of an OMP_CLAUSE node. */
7034 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
7035 int line, const char *function)
7038 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7039 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
7040 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
7041 trim_filename (file), line);
7043 #endif /* ENABLE_TREE_CHECKING */
7045 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7046 and mapped to the machine mode MODE. Initialize its fields and build
7047 the information necessary for debugging output. */
7050 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
7053 hashval_t hashcode = 0;
7055 /* Build a main variant, based on the main variant of the inner type, then
7056 use it to build the variant we return. */
7057 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
7058 && TYPE_MAIN_VARIANT (innertype) != innertype)
7059 return build_type_attribute_qual_variant (
7060 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
7061 TYPE_ATTRIBUTES (innertype),
7062 TYPE_QUALS (innertype));
7064 t = make_node (VECTOR_TYPE);
7065 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
7066 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
7067 TYPE_MODE (t) = mode;
7068 TYPE_READONLY (t) = TYPE_READONLY (innertype);
7069 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
7071 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
7072 SET_TYPE_STRUCTURAL_EQUALITY (t);
7073 else if (TYPE_CANONICAL (innertype) != innertype
7074 || mode != VOIDmode)
7076 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
7081 tree index = build_int_cst (NULL_TREE, nunits - 1);
7082 tree array = build_array_type (innertype, build_index_type (index));
7083 tree rt = make_node (RECORD_TYPE);
7085 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
7086 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
7088 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
7089 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7090 the representation type, and we want to find that die when looking up
7091 the vector type. This is most easily achieved by making the TYPE_UID
7093 TYPE_UID (rt) = TYPE_UID (t);
7096 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
7097 hashcode = iterative_hash_host_wide_int (mode, hashcode);
7098 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
7099 return type_hash_canon (hashcode, t);
7103 make_or_reuse_type (unsigned size, int unsignedp)
7105 if (size == INT_TYPE_SIZE)
7106 return unsignedp ? unsigned_type_node : integer_type_node;
7107 if (size == CHAR_TYPE_SIZE)
7108 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
7109 if (size == SHORT_TYPE_SIZE)
7110 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
7111 if (size == LONG_TYPE_SIZE)
7112 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
7113 if (size == LONG_LONG_TYPE_SIZE)
7114 return (unsignedp ? long_long_unsigned_type_node
7115 : long_long_integer_type_node);
7118 return make_unsigned_type (size);
7120 return make_signed_type (size);
7123 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7126 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
7130 if (size == SHORT_FRACT_TYPE_SIZE)
7131 return unsignedp ? sat_unsigned_short_fract_type_node
7132 : sat_short_fract_type_node;
7133 if (size == FRACT_TYPE_SIZE)
7134 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
7135 if (size == LONG_FRACT_TYPE_SIZE)
7136 return unsignedp ? sat_unsigned_long_fract_type_node
7137 : sat_long_fract_type_node;
7138 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7139 return unsignedp ? sat_unsigned_long_long_fract_type_node
7140 : sat_long_long_fract_type_node;
7144 if (size == SHORT_FRACT_TYPE_SIZE)
7145 return unsignedp ? unsigned_short_fract_type_node
7146 : short_fract_type_node;
7147 if (size == FRACT_TYPE_SIZE)
7148 return unsignedp ? unsigned_fract_type_node : fract_type_node;
7149 if (size == LONG_FRACT_TYPE_SIZE)
7150 return unsignedp ? unsigned_long_fract_type_node
7151 : long_fract_type_node;
7152 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7153 return unsignedp ? unsigned_long_long_fract_type_node
7154 : long_long_fract_type_node;
7157 return make_fract_type (size, unsignedp, satp);
7160 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7163 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
7167 if (size == SHORT_ACCUM_TYPE_SIZE)
7168 return unsignedp ? sat_unsigned_short_accum_type_node
7169 : sat_short_accum_type_node;
7170 if (size == ACCUM_TYPE_SIZE)
7171 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
7172 if (size == LONG_ACCUM_TYPE_SIZE)
7173 return unsignedp ? sat_unsigned_long_accum_type_node
7174 : sat_long_accum_type_node;
7175 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7176 return unsignedp ? sat_unsigned_long_long_accum_type_node
7177 : sat_long_long_accum_type_node;
7181 if (size == SHORT_ACCUM_TYPE_SIZE)
7182 return unsignedp ? unsigned_short_accum_type_node
7183 : short_accum_type_node;
7184 if (size == ACCUM_TYPE_SIZE)
7185 return unsignedp ? unsigned_accum_type_node : accum_type_node;
7186 if (size == LONG_ACCUM_TYPE_SIZE)
7187 return unsignedp ? unsigned_long_accum_type_node
7188 : long_accum_type_node;
7189 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7190 return unsignedp ? unsigned_long_long_accum_type_node
7191 : long_long_accum_type_node;
7194 return make_accum_type (size, unsignedp, satp);
7197 /* Create nodes for all integer types (and error_mark_node) using the sizes
7198 of C datatypes. The caller should call set_sizetype soon after calling
7199 this function to select one of the types as sizetype. */
7202 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
7204 error_mark_node = make_node (ERROR_MARK);
7205 TREE_TYPE (error_mark_node) = error_mark_node;
7207 initialize_sizetypes (signed_sizetype);
7209 /* Define both `signed char' and `unsigned char'. */
7210 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
7211 TYPE_STRING_FLAG (signed_char_type_node) = 1;
7212 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
7213 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
7215 /* Define `char', which is like either `signed char' or `unsigned char'
7216 but not the same as either. */
7219 ? make_signed_type (CHAR_TYPE_SIZE)
7220 : make_unsigned_type (CHAR_TYPE_SIZE));
7221 TYPE_STRING_FLAG (char_type_node) = 1;
7223 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
7224 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
7225 integer_type_node = make_signed_type (INT_TYPE_SIZE);
7226 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
7227 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
7228 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
7229 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
7230 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
7232 /* Define a boolean type. This type only represents boolean values but
7233 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7234 Front ends which want to override this size (i.e. Java) can redefine
7235 boolean_type_node before calling build_common_tree_nodes_2. */
7236 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
7237 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
7238 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
7239 TYPE_PRECISION (boolean_type_node) = 1;
7241 /* Fill in the rest of the sized types. Reuse existing type nodes
7243 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
7244 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
7245 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
7246 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
7247 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
7249 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
7250 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
7251 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
7252 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
7253 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
7255 access_public_node = get_identifier ("public");
7256 access_protected_node = get_identifier ("protected");
7257 access_private_node = get_identifier ("private");
7260 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7261 It will create several other common tree nodes. */
7264 build_common_tree_nodes_2 (int short_double)
7266 /* Define these next since types below may used them. */
7267 integer_zero_node = build_int_cst (NULL_TREE, 0);
7268 integer_one_node = build_int_cst (NULL_TREE, 1);
7269 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
7271 size_zero_node = size_int (0);
7272 size_one_node = size_int (1);
7273 bitsize_zero_node = bitsize_int (0);
7274 bitsize_one_node = bitsize_int (1);
7275 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
7277 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
7278 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
7280 void_type_node = make_node (VOID_TYPE);
7281 layout_type (void_type_node);
7283 /* We are not going to have real types in C with less than byte alignment,
7284 so we might as well not have any types that claim to have it. */
7285 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
7286 TYPE_USER_ALIGN (void_type_node) = 0;
7288 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
7289 layout_type (TREE_TYPE (null_pointer_node));
7291 ptr_type_node = build_pointer_type (void_type_node);
7293 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
7294 fileptr_type_node = ptr_type_node;
7296 float_type_node = make_node (REAL_TYPE);
7297 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
7298 layout_type (float_type_node);
7300 double_type_node = make_node (REAL_TYPE);
7302 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
7304 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
7305 layout_type (double_type_node);
7307 long_double_type_node = make_node (REAL_TYPE);
7308 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
7309 layout_type (long_double_type_node);
7311 float_ptr_type_node = build_pointer_type (float_type_node);
7312 double_ptr_type_node = build_pointer_type (double_type_node);
7313 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7314 integer_ptr_type_node = build_pointer_type (integer_type_node);
7316 /* Fixed size integer types. */
7317 uint32_type_node = build_nonstandard_integer_type (32, true);
7318 uint64_type_node = build_nonstandard_integer_type (64, true);
7320 /* Decimal float types. */
7321 dfloat32_type_node = make_node (REAL_TYPE);
7322 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7323 layout_type (dfloat32_type_node);
7324 TYPE_MODE (dfloat32_type_node) = SDmode;
7325 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7327 dfloat64_type_node = make_node (REAL_TYPE);
7328 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7329 layout_type (dfloat64_type_node);
7330 TYPE_MODE (dfloat64_type_node) = DDmode;
7331 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7333 dfloat128_type_node = make_node (REAL_TYPE);
7334 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7335 layout_type (dfloat128_type_node);
7336 TYPE_MODE (dfloat128_type_node) = TDmode;
7337 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7339 complex_integer_type_node = build_complex_type (integer_type_node);
7340 complex_float_type_node = build_complex_type (float_type_node);
7341 complex_double_type_node = build_complex_type (double_type_node);
7342 complex_long_double_type_node = build_complex_type (long_double_type_node);
7344 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7345 #define MAKE_FIXED_TYPE_NODE(KIND,WIDTH,SIZE) \
7346 sat_ ## WIDTH ## KIND ## _type_node = \
7347 make_sat_signed_ ## KIND ## _type (SIZE); \
7348 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7349 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7350 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7351 unsigned_ ## WIDTH ## KIND ## _type_node = \
7352 make_unsigned_ ## KIND ## _type (SIZE);
7354 /* Make fixed-point type nodes based on four different widths. */
7355 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7356 MAKE_FIXED_TYPE_NODE (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7357 MAKE_FIXED_TYPE_NODE (N1, , N2 ## _TYPE_SIZE) \
7358 MAKE_FIXED_TYPE_NODE (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7359 MAKE_FIXED_TYPE_NODE (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7361 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7362 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7363 NAME ## _type_node = \
7364 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7365 u ## NAME ## _type_node = \
7366 make_or_reuse_unsigned_ ## KIND ## _type \
7367 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7368 sat_ ## NAME ## _type_node = \
7369 make_or_reuse_sat_signed_ ## KIND ## _type \
7370 (GET_MODE_BITSIZE (MODE ## mode)); \
7371 sat_u ## NAME ## _type_node = \
7372 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7373 (GET_MODE_BITSIZE (U ## MODE ## mode));
7375 /* Fixed-point type and mode nodes. */
7376 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
7377 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
7378 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
7379 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
7380 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
7381 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
7382 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
7383 MAKE_FIXED_MODE_NODE (accum, ha, HA)
7384 MAKE_FIXED_MODE_NODE (accum, sa, SA)
7385 MAKE_FIXED_MODE_NODE (accum, da, DA)
7386 MAKE_FIXED_MODE_NODE (accum, ta, TA)
7389 tree t = targetm.build_builtin_va_list ();
7391 /* Many back-ends define record types without setting TYPE_NAME.
7392 If we copied the record type here, we'd keep the original
7393 record type without a name. This breaks name mangling. So,
7394 don't copy record types and let c_common_nodes_and_builtins()
7395 declare the type to be __builtin_va_list. */
7396 if (TREE_CODE (t) != RECORD_TYPE)
7397 t = build_variant_type_copy (t);
7399 va_list_type_node = t;
7403 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7406 local_define_builtin (const char *name, tree type, enum built_in_function code,
7407 const char *library_name, int ecf_flags)
7411 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7412 library_name, NULL_TREE);
7413 if (ecf_flags & ECF_CONST)
7414 TREE_READONLY (decl) = 1;
7415 if (ecf_flags & ECF_PURE)
7416 DECL_IS_PURE (decl) = 1;
7417 if (ecf_flags & ECF_NORETURN)
7418 TREE_THIS_VOLATILE (decl) = 1;
7419 if (ecf_flags & ECF_NOTHROW)
7420 TREE_NOTHROW (decl) = 1;
7421 if (ecf_flags & ECF_MALLOC)
7422 DECL_IS_MALLOC (decl) = 1;
7424 built_in_decls[code] = decl;
7425 implicit_built_in_decls[code] = decl;
7428 /* Call this function after instantiating all builtins that the language
7429 front end cares about. This will build the rest of the builtins that
7430 are relied upon by the tree optimizers and the middle-end. */
7433 build_common_builtin_nodes (void)
7437 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7438 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7440 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7441 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7442 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7443 ftype = build_function_type (ptr_type_node, tmp);
7445 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7446 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7447 "memcpy", ECF_NOTHROW);
7448 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7449 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7450 "memmove", ECF_NOTHROW);
7453 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7455 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7456 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7457 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7458 ftype = build_function_type (integer_type_node, tmp);
7459 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7460 "memcmp", ECF_PURE | ECF_NOTHROW);
7463 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7465 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7466 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7467 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7468 ftype = build_function_type (ptr_type_node, tmp);
7469 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7470 "memset", ECF_NOTHROW);
7473 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7475 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7476 ftype = build_function_type (ptr_type_node, tmp);
7477 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7478 "alloca", ECF_NOTHROW | ECF_MALLOC);
7481 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7482 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7483 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7484 ftype = build_function_type (void_type_node, tmp);
7485 local_define_builtin ("__builtin_init_trampoline", ftype,
7486 BUILT_IN_INIT_TRAMPOLINE,
7487 "__builtin_init_trampoline", ECF_NOTHROW);
7489 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7490 ftype = build_function_type (ptr_type_node, tmp);
7491 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7492 BUILT_IN_ADJUST_TRAMPOLINE,
7493 "__builtin_adjust_trampoline",
7494 ECF_CONST | ECF_NOTHROW);
7496 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7497 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7498 ftype = build_function_type (void_type_node, tmp);
7499 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7500 BUILT_IN_NONLOCAL_GOTO,
7501 "__builtin_nonlocal_goto",
7502 ECF_NORETURN | ECF_NOTHROW);
7504 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7505 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7506 ftype = build_function_type (void_type_node, tmp);
7507 local_define_builtin ("__builtin_setjmp_setup", ftype,
7508 BUILT_IN_SETJMP_SETUP,
7509 "__builtin_setjmp_setup", ECF_NOTHROW);
7511 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7512 ftype = build_function_type (ptr_type_node, tmp);
7513 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7514 BUILT_IN_SETJMP_DISPATCHER,
7515 "__builtin_setjmp_dispatcher",
7516 ECF_PURE | ECF_NOTHROW);
7518 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7519 ftype = build_function_type (void_type_node, tmp);
7520 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7521 BUILT_IN_SETJMP_RECEIVER,
7522 "__builtin_setjmp_receiver", ECF_NOTHROW);
7524 ftype = build_function_type (ptr_type_node, void_list_node);
7525 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7526 "__builtin_stack_save", ECF_NOTHROW);
7528 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7529 ftype = build_function_type (void_type_node, tmp);
7530 local_define_builtin ("__builtin_stack_restore", ftype,
7531 BUILT_IN_STACK_RESTORE,
7532 "__builtin_stack_restore", ECF_NOTHROW);
7534 ftype = build_function_type (void_type_node, void_list_node);
7535 local_define_builtin ("__builtin_profile_func_enter", ftype,
7536 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7537 local_define_builtin ("__builtin_profile_func_exit", ftype,
7538 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7540 /* Complex multiplication and division. These are handled as builtins
7541 rather than optabs because emit_library_call_value doesn't support
7542 complex. Further, we can do slightly better with folding these
7543 beasties if the real and complex parts of the arguments are separate. */
7545 enum machine_mode mode;
7547 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7549 char mode_name_buf[4], *q;
7551 enum built_in_function mcode, dcode;
7552 tree type, inner_type;
7554 type = lang_hooks.types.type_for_mode (mode, 0);
7557 inner_type = TREE_TYPE (type);
7559 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7560 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7561 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7562 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7563 ftype = build_function_type (type, tmp);
7565 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7566 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7568 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7572 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7573 local_define_builtin (built_in_names[mcode], ftype, mcode,
7574 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7576 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7577 local_define_builtin (built_in_names[dcode], ftype, dcode,
7578 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7583 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7586 If we requested a pointer to a vector, build up the pointers that
7587 we stripped off while looking for the inner type. Similarly for
7588 return values from functions.
7590 The argument TYPE is the top of the chain, and BOTTOM is the
7591 new type which we will point to. */
7594 reconstruct_complex_type (tree type, tree bottom)
7598 if (TREE_CODE (type) == POINTER_TYPE)
7600 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7601 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
7602 TYPE_REF_CAN_ALIAS_ALL (type));
7604 else if (TREE_CODE (type) == REFERENCE_TYPE)
7606 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7607 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
7608 TYPE_REF_CAN_ALIAS_ALL (type));
7610 else if (TREE_CODE (type) == ARRAY_TYPE)
7612 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7613 outer = build_array_type (inner, TYPE_DOMAIN (type));
7615 else if (TREE_CODE (type) == FUNCTION_TYPE)
7617 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7618 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7620 else if (TREE_CODE (type) == METHOD_TYPE)
7622 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7623 /* The build_method_type_directly() routine prepends 'this' to argument list,
7624 so we must compensate by getting rid of it. */
7626 = build_method_type_directly
7627 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
7629 TREE_CHAIN (TYPE_ARG_TYPES (type)));
7634 return build_qualified_type (outer, TYPE_QUALS (type));
7637 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7640 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7644 switch (GET_MODE_CLASS (mode))
7646 case MODE_VECTOR_INT:
7647 case MODE_VECTOR_FLOAT:
7648 case MODE_VECTOR_FRACT:
7649 case MODE_VECTOR_UFRACT:
7650 case MODE_VECTOR_ACCUM:
7651 case MODE_VECTOR_UACCUM:
7652 nunits = GET_MODE_NUNITS (mode);
7656 /* Check that there are no leftover bits. */
7657 gcc_assert (GET_MODE_BITSIZE (mode)
7658 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7660 nunits = GET_MODE_BITSIZE (mode)
7661 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7668 return make_vector_type (innertype, nunits, mode);
7671 /* Similarly, but takes the inner type and number of units, which must be
7675 build_vector_type (tree innertype, int nunits)
7677 return make_vector_type (innertype, nunits, VOIDmode);
7681 /* Build RESX_EXPR with given REGION_NUMBER. */
7683 build_resx (int region_number)
7686 t = build1 (RESX_EXPR, void_type_node,
7687 build_int_cst (NULL_TREE, region_number));
7691 /* Given an initializer INIT, return TRUE if INIT is zero or some
7692 aggregate of zeros. Otherwise return FALSE. */
7694 initializer_zerop (const_tree init)
7700 switch (TREE_CODE (init))
7703 return integer_zerop (init);
7706 /* ??? Note that this is not correct for C4X float formats. There,
7707 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7708 negative exponent. */
7709 return real_zerop (init)
7710 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7713 return fixed_zerop (init);
7716 return integer_zerop (init)
7717 || (real_zerop (init)
7718 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7719 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7722 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7723 if (!initializer_zerop (TREE_VALUE (elt)))
7729 unsigned HOST_WIDE_INT idx;
7731 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7732 if (!initializer_zerop (elt))
7742 /* Build an empty statement. */
7745 build_empty_stmt (void)
7747 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7751 /* Build an OpenMP clause with code CODE. */
7754 build_omp_clause (enum omp_clause_code code)
7759 length = omp_clause_num_ops[code];
7760 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7762 t = ggc_alloc (size);
7763 memset (t, 0, size);
7764 TREE_SET_CODE (t, OMP_CLAUSE);
7765 OMP_CLAUSE_SET_CODE (t, code);
7767 #ifdef GATHER_STATISTICS
7768 tree_node_counts[(int) omp_clause_kind]++;
7769 tree_node_sizes[(int) omp_clause_kind] += size;
7775 /* Set various status flags when building a CALL_EXPR object T. */
7778 process_call_operands (tree t)
7782 side_effects = TREE_SIDE_EFFECTS (t);
7786 n = TREE_OPERAND_LENGTH (t);
7787 for (i = 1; i < n; i++)
7789 tree op = TREE_OPERAND (t, i);
7790 if (op && TREE_SIDE_EFFECTS (op))
7801 /* Calls have side-effects, except those to const or
7803 i = call_expr_flags (t);
7804 if (!(i & (ECF_CONST | ECF_PURE)))
7807 TREE_SIDE_EFFECTS (t) = side_effects;
7810 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7811 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7812 Except for the CODE and operand count field, other storage for the
7813 object is initialized to zeros. */
7816 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
7819 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
7821 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
7822 gcc_assert (len >= 1);
7824 #ifdef GATHER_STATISTICS
7825 tree_node_counts[(int) e_kind]++;
7826 tree_node_sizes[(int) e_kind] += length;
7829 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
7831 memset (t, 0, length);
7833 TREE_SET_CODE (t, code);
7835 /* Can't use TREE_OPERAND to store the length because if checking is
7836 enabled, it will try to check the length before we store it. :-P */
7837 t->exp.operands[0] = build_int_cst (sizetype, len);
7843 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7844 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
7848 build_call_list (tree return_type, tree fn, tree arglist)
7853 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
7854 TREE_TYPE (t) = return_type;
7855 CALL_EXPR_FN (t) = fn;
7856 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7857 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
7858 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
7859 process_call_operands (t);
7863 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7864 FN and a null static chain slot. NARGS is the number of call arguments
7865 which are specified as "..." arguments. */
7868 build_call_nary (tree return_type, tree fn, int nargs, ...)
7872 va_start (args, nargs);
7873 ret = build_call_valist (return_type, fn, nargs, args);
7878 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7879 FN and a null static chain slot. NARGS is the number of call arguments
7880 which are specified as a va_list ARGS. */
7883 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
7888 t = build_vl_exp (CALL_EXPR, nargs + 3);
7889 TREE_TYPE (t) = return_type;
7890 CALL_EXPR_FN (t) = fn;
7891 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7892 for (i = 0; i < nargs; i++)
7893 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
7894 process_call_operands (t);
7898 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7899 FN and a null static chain slot. NARGS is the number of call arguments
7900 which are specified as a tree array ARGS. */
7903 build_call_array (tree return_type, tree fn, int nargs, tree *args)
7908 t = build_vl_exp (CALL_EXPR, nargs + 3);
7909 TREE_TYPE (t) = return_type;
7910 CALL_EXPR_FN (t) = fn;
7911 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7912 for (i = 0; i < nargs; i++)
7913 CALL_EXPR_ARG (t, i) = args[i];
7914 process_call_operands (t);
7919 /* Returns true if it is possible to prove that the index of
7920 an array access REF (an ARRAY_REF expression) falls into the
7924 in_array_bounds_p (tree ref)
7926 tree idx = TREE_OPERAND (ref, 1);
7929 if (TREE_CODE (idx) != INTEGER_CST)
7932 min = array_ref_low_bound (ref);
7933 max = array_ref_up_bound (ref);
7936 || TREE_CODE (min) != INTEGER_CST
7937 || TREE_CODE (max) != INTEGER_CST)
7940 if (tree_int_cst_lt (idx, min)
7941 || tree_int_cst_lt (max, idx))
7947 /* Returns true if it is possible to prove that the range of
7948 an array access REF (an ARRAY_RANGE_REF expression) falls
7949 into the array bounds. */
7952 range_in_array_bounds_p (tree ref)
7954 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7955 tree range_min, range_max, min, max;
7957 range_min = TYPE_MIN_VALUE (domain_type);
7958 range_max = TYPE_MAX_VALUE (domain_type);
7961 || TREE_CODE (range_min) != INTEGER_CST
7962 || TREE_CODE (range_max) != INTEGER_CST)
7965 min = array_ref_low_bound (ref);
7966 max = array_ref_up_bound (ref);
7969 || TREE_CODE (min) != INTEGER_CST
7970 || TREE_CODE (max) != INTEGER_CST)
7973 if (tree_int_cst_lt (range_min, min)
7974 || tree_int_cst_lt (max, range_max))
7980 /* Return true if T (assumed to be a DECL) must be assigned a memory
7984 needs_to_live_in_memory (const_tree t)
7986 if (TREE_CODE (t) == SSA_NAME)
7987 t = SSA_NAME_VAR (t);
7989 return (TREE_ADDRESSABLE (t)
7990 || is_global_var (t)
7991 || (TREE_CODE (t) == RESULT_DECL
7992 && aggregate_value_p (t, current_function_decl)));
7995 /* There are situations in which a language considers record types
7996 compatible which have different field lists. Decide if two fields
7997 are compatible. It is assumed that the parent records are compatible. */
8000 fields_compatible_p (const_tree f1, const_tree f2)
8002 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
8003 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
8006 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
8007 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
8010 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
8016 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8019 find_compatible_field (tree record, tree orig_field)
8023 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
8024 if (TREE_CODE (f) == FIELD_DECL
8025 && fields_compatible_p (f, orig_field))
8028 /* ??? Why isn't this on the main fields list? */
8029 f = TYPE_VFIELD (record);
8030 if (f && TREE_CODE (f) == FIELD_DECL
8031 && fields_compatible_p (f, orig_field))
8034 /* ??? We should abort here, but Java appears to do Bad Things
8035 with inherited fields. */
8039 /* Return value of a constant X. */
8042 int_cst_value (const_tree x)
8044 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8045 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
8046 bool negative = ((val >> (bits - 1)) & 1) != 0;
8048 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
8051 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
8053 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
8058 /* If TYPE is an integral type, return an equivalent type which is
8059 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8060 return TYPE itself. */
8063 signed_or_unsigned_type_for (int unsignedp, tree type)
8066 if (POINTER_TYPE_P (type))
8069 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
8072 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
8075 /* Returns unsigned variant of TYPE. */
8078 unsigned_type_for (tree type)
8080 return signed_or_unsigned_type_for (1, type);
8083 /* Returns signed variant of TYPE. */
8086 signed_type_for (tree type)
8088 return signed_or_unsigned_type_for (0, type);
8091 /* Returns the largest value obtainable by casting something in INNER type to
8095 upper_bound_in_type (tree outer, tree inner)
8097 unsigned HOST_WIDE_INT lo, hi;
8098 unsigned int det = 0;
8099 unsigned oprec = TYPE_PRECISION (outer);
8100 unsigned iprec = TYPE_PRECISION (inner);
8103 /* Compute a unique number for every combination. */
8104 det |= (oprec > iprec) ? 4 : 0;
8105 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
8106 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
8108 /* Determine the exponent to use. */
8113 /* oprec <= iprec, outer: signed, inner: don't care. */
8118 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8122 /* oprec > iprec, outer: signed, inner: signed. */
8126 /* oprec > iprec, outer: signed, inner: unsigned. */
8130 /* oprec > iprec, outer: unsigned, inner: signed. */
8134 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8141 /* Compute 2^^prec - 1. */
8142 if (prec <= HOST_BITS_PER_WIDE_INT)
8145 lo = ((~(unsigned HOST_WIDE_INT) 0)
8146 >> (HOST_BITS_PER_WIDE_INT - prec));
8150 hi = ((~(unsigned HOST_WIDE_INT) 0)
8151 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
8152 lo = ~(unsigned HOST_WIDE_INT) 0;
8155 return build_int_cst_wide (outer, lo, hi);
8158 /* Returns the smallest value obtainable by casting something in INNER type to
8162 lower_bound_in_type (tree outer, tree inner)
8164 unsigned HOST_WIDE_INT lo, hi;
8165 unsigned oprec = TYPE_PRECISION (outer);
8166 unsigned iprec = TYPE_PRECISION (inner);
8168 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8170 if (TYPE_UNSIGNED (outer)
8171 /* If we are widening something of an unsigned type, OUTER type
8172 contains all values of INNER type. In particular, both INNER
8173 and OUTER types have zero in common. */
8174 || (oprec > iprec && TYPE_UNSIGNED (inner)))
8178 /* If we are widening a signed type to another signed type, we
8179 want to obtain -2^^(iprec-1). If we are keeping the
8180 precision or narrowing to a signed type, we want to obtain
8182 unsigned prec = oprec > iprec ? iprec : oprec;
8184 if (prec <= HOST_BITS_PER_WIDE_INT)
8186 hi = ~(unsigned HOST_WIDE_INT) 0;
8187 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
8191 hi = ((~(unsigned HOST_WIDE_INT) 0)
8192 << (prec - HOST_BITS_PER_WIDE_INT - 1));
8197 return build_int_cst_wide (outer, lo, hi);
8200 /* Return nonzero if two operands that are suitable for PHI nodes are
8201 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8202 SSA_NAME or invariant. Note that this is strictly an optimization.
8203 That is, callers of this function can directly call operand_equal_p
8204 and get the same result, only slower. */
8207 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
8211 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
8213 return operand_equal_p (arg0, arg1, 0);
8216 /* Returns number of zeros at the end of binary representation of X.
8218 ??? Use ffs if available? */
8221 num_ending_zeros (const_tree x)
8223 unsigned HOST_WIDE_INT fr, nfr;
8224 unsigned num, abits;
8225 tree type = TREE_TYPE (x);
8227 if (TREE_INT_CST_LOW (x) == 0)
8229 num = HOST_BITS_PER_WIDE_INT;
8230 fr = TREE_INT_CST_HIGH (x);
8235 fr = TREE_INT_CST_LOW (x);
8238 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
8241 if (nfr << abits == fr)
8248 if (num > TYPE_PRECISION (type))
8249 num = TYPE_PRECISION (type);
8251 return build_int_cst_type (type, num);
8255 #define WALK_SUBTREE(NODE) \
8258 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8264 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8265 be walked whenever a type is seen in the tree. Rest of operands and return
8266 value are as for walk_tree. */
8269 walk_type_fields (tree type, walk_tree_fn func, void *data,
8270 struct pointer_set_t *pset, walk_tree_lh lh)
8272 tree result = NULL_TREE;
8274 switch (TREE_CODE (type))
8277 case REFERENCE_TYPE:
8278 /* We have to worry about mutually recursive pointers. These can't
8279 be written in C. They can in Ada. It's pathological, but
8280 there's an ACATS test (c38102a) that checks it. Deal with this
8281 by checking if we're pointing to another pointer, that one
8282 points to another pointer, that one does too, and we have no htab.
8283 If so, get a hash table. We check three levels deep to avoid
8284 the cost of the hash table if we don't need one. */
8285 if (POINTER_TYPE_P (TREE_TYPE (type))
8286 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
8287 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
8290 result = walk_tree_without_duplicates (&TREE_TYPE (type),
8298 /* ... fall through ... */
8301 WALK_SUBTREE (TREE_TYPE (type));
8305 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
8310 WALK_SUBTREE (TREE_TYPE (type));
8314 /* We never want to walk into default arguments. */
8315 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
8316 WALK_SUBTREE (TREE_VALUE (arg));
8321 /* Don't follow this nodes's type if a pointer for fear that
8322 we'll have infinite recursion. If we have a PSET, then we
8325 || (!POINTER_TYPE_P (TREE_TYPE (type))
8326 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
8327 WALK_SUBTREE (TREE_TYPE (type));
8328 WALK_SUBTREE (TYPE_DOMAIN (type));
8332 WALK_SUBTREE (TREE_TYPE (type));
8333 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
8343 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8344 called with the DATA and the address of each sub-tree. If FUNC returns a
8345 non-NULL value, the traversal is stopped, and the value returned by FUNC
8346 is returned. If PSET is non-NULL it is used to record the nodes visited,
8347 and to avoid visiting a node more than once. */
8350 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
8351 struct pointer_set_t *pset, walk_tree_lh lh)
8353 enum tree_code code;
8357 #define WALK_SUBTREE_TAIL(NODE) \
8361 goto tail_recurse; \
8366 /* Skip empty subtrees. */
8370 /* Don't walk the same tree twice, if the user has requested
8371 that we avoid doing so. */
8372 if (pset && pointer_set_insert (pset, *tp))
8375 /* Call the function. */
8377 result = (*func) (tp, &walk_subtrees, data);
8379 /* If we found something, return it. */
8383 code = TREE_CODE (*tp);
8385 /* Even if we didn't, FUNC may have decided that there was nothing
8386 interesting below this point in the tree. */
8389 /* But we still need to check our siblings. */
8390 if (code == TREE_LIST)
8391 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8392 else if (code == OMP_CLAUSE)
8393 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8400 result = (*lh) (tp, &walk_subtrees, func, data, pset);
8401 if (result || !walk_subtrees)
8408 case IDENTIFIER_NODE:
8415 case PLACEHOLDER_EXPR:
8419 /* None of these have subtrees other than those already walked
8424 WALK_SUBTREE (TREE_VALUE (*tp));
8425 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8430 int len = TREE_VEC_LENGTH (*tp);
8435 /* Walk all elements but the first. */
8437 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8439 /* Now walk the first one as a tail call. */
8440 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8444 WALK_SUBTREE (TREE_REALPART (*tp));
8445 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8449 unsigned HOST_WIDE_INT idx;
8450 constructor_elt *ce;
8453 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8455 WALK_SUBTREE (ce->value);
8460 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8465 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8467 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8468 into declarations that are just mentioned, rather than
8469 declared; they don't really belong to this part of the tree.
8470 And, we can see cycles: the initializer for a declaration
8471 can refer to the declaration itself. */
8472 WALK_SUBTREE (DECL_INITIAL (decl));
8473 WALK_SUBTREE (DECL_SIZE (decl));
8474 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8476 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8479 case STATEMENT_LIST:
8481 tree_stmt_iterator i;
8482 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8483 WALK_SUBTREE (*tsi_stmt_ptr (i));
8488 switch (OMP_CLAUSE_CODE (*tp))
8490 case OMP_CLAUSE_PRIVATE:
8491 case OMP_CLAUSE_SHARED:
8492 case OMP_CLAUSE_FIRSTPRIVATE:
8493 case OMP_CLAUSE_LASTPRIVATE:
8494 case OMP_CLAUSE_COPYIN:
8495 case OMP_CLAUSE_COPYPRIVATE:
8497 case OMP_CLAUSE_NUM_THREADS:
8498 case OMP_CLAUSE_SCHEDULE:
8499 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8502 case OMP_CLAUSE_NOWAIT:
8503 case OMP_CLAUSE_ORDERED:
8504 case OMP_CLAUSE_DEFAULT:
8505 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8507 case OMP_CLAUSE_REDUCTION:
8510 for (i = 0; i < 4; i++)
8511 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8512 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8524 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8525 But, we only want to walk once. */
8526 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8527 for (i = 0; i < len; ++i)
8528 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8529 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8533 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8534 defining. We only want to walk into these fields of a type in this
8535 case and not in the general case of a mere reference to the type.
8537 The criterion is as follows: if the field can be an expression, it
8538 must be walked only here. This should be in keeping with the fields
8539 that are directly gimplified in gimplify_type_sizes in order for the
8540 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8541 variable-sized types.
8543 Note that DECLs get walked as part of processing the BIND_EXPR. */
8544 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8546 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8547 if (TREE_CODE (*type_p) == ERROR_MARK)
8550 /* Call the function for the type. See if it returns anything or
8551 doesn't want us to continue. If we are to continue, walk both
8552 the normal fields and those for the declaration case. */
8553 result = (*func) (type_p, &walk_subtrees, data);
8554 if (result || !walk_subtrees)
8557 result = walk_type_fields (*type_p, func, data, pset, lh);
8561 /* If this is a record type, also walk the fields. */
8562 if (TREE_CODE (*type_p) == RECORD_TYPE
8563 || TREE_CODE (*type_p) == UNION_TYPE
8564 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8568 for (field = TYPE_FIELDS (*type_p); field;
8569 field = TREE_CHAIN (field))
8571 /* We'd like to look at the type of the field, but we can
8572 easily get infinite recursion. So assume it's pointed
8573 to elsewhere in the tree. Also, ignore things that
8575 if (TREE_CODE (field) != FIELD_DECL)
8578 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8579 WALK_SUBTREE (DECL_SIZE (field));
8580 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8581 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8582 WALK_SUBTREE (DECL_QUALIFIER (field));
8586 /* Same for scalar types. */
8587 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8588 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8589 || TREE_CODE (*type_p) == INTEGER_TYPE
8590 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
8591 || TREE_CODE (*type_p) == REAL_TYPE)
8593 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8594 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8597 WALK_SUBTREE (TYPE_SIZE (*type_p));
8598 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8603 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
8604 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code)))
8608 /* Walk over all the sub-trees of this operand. */
8609 len = TREE_OPERAND_LENGTH (*tp);
8611 /* Go through the subtrees. We need to do this in forward order so
8612 that the scope of a FOR_EXPR is handled properly. */
8615 for (i = 0; i < len - 1; ++i)
8616 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp, i));
8617 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp, len - 1));
8620 /* If this is a type, walk the needed fields in the type. */
8621 else if (TYPE_P (*tp))
8622 return walk_type_fields (*tp, func, data, pset, lh);
8626 /* We didn't find what we were looking for. */
8629 #undef WALK_SUBTREE_TAIL
8633 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8636 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
8640 struct pointer_set_t *pset;
8642 pset = pointer_set_create ();
8643 result = walk_tree_1 (tp, func, data, pset, lh);
8644 pointer_set_destroy (pset);
8649 /* Return true if STMT is an empty statement or contains nothing but
8650 empty statements. */
8653 empty_body_p (const_tree stmt)
8655 const_tree_stmt_iterator i;
8658 if (IS_EMPTY_STMT (stmt))
8660 else if (TREE_CODE (stmt) == BIND_EXPR)
8661 body = BIND_EXPR_BODY (stmt);
8662 else if (TREE_CODE (stmt) == STATEMENT_LIST)
8667 for (i = ctsi_start (body); !ctsi_end_p (i); ctsi_next (&i))
8668 if (!empty_body_p (ctsi_stmt (i)))
8677 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8679 if (IS_EXPR_CODE_CLASS (c))
8680 return &t->exp.block;
8681 else if (IS_GIMPLE_STMT_CODE_CLASS (c))
8682 return &GIMPLE_STMT_BLOCK (t);
8688 generic_tree_operand (tree node, int i)
8690 if (GIMPLE_STMT_P (node))
8691 return &GIMPLE_STMT_OPERAND (node, i);
8692 return &TREE_OPERAND (node, i);
8696 generic_tree_type (tree node)
8698 if (GIMPLE_STMT_P (node))
8699 return &void_type_node;
8700 return &TREE_TYPE (node);
8703 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8704 FIXME: don't use this function. It exists for compatibility with
8705 the old representation of CALL_EXPRs where a list was used to hold the
8706 arguments. Places that currently extract the arglist from a CALL_EXPR
8707 ought to be rewritten to use the CALL_EXPR itself. */
8709 call_expr_arglist (tree exp)
8711 tree arglist = NULL_TREE;
8713 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
8714 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
8718 #include "gt-tree.h"