1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "fixed-value.h"
55 /* Tree code classes. */
57 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
58 #define END_OF_BASE_TREE_CODES tcc_exceptional,
60 const enum tree_code_class tree_code_type[] = {
61 #include "all-tree.def"
65 #undef END_OF_BASE_TREE_CODES
67 /* Table indexed by tree code giving number of expression
68 operands beyond the fixed part of the node structure.
69 Not used for types or decls. */
71 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
72 #define END_OF_BASE_TREE_CODES 0,
74 const unsigned char tree_code_length[] = {
75 #include "all-tree.def"
79 #undef END_OF_BASE_TREE_CODES
81 /* Names of tree components.
82 Used for printing out the tree and error messages. */
83 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
84 #define END_OF_BASE_TREE_CODES "@dummy",
86 const char *const tree_code_name[] = {
87 #include "all-tree.def"
91 #undef END_OF_BASE_TREE_CODES
93 /* Each tree code class has an associated string representation.
94 These must correspond to the tree_code_class entries. */
96 const char *const tree_code_class_strings[] =
111 /* obstack.[ch] explicitly declined to prototype this. */
112 extern int _obstack_allocated_p (struct obstack *h, void *obj);
114 #ifdef GATHER_STATISTICS
115 /* Statistics-gathering stuff. */
117 int tree_node_counts[(int) all_kinds];
118 int tree_node_sizes[(int) all_kinds];
120 /* Keep in sync with tree.h:enum tree_node_kind. */
121 static const char * const tree_node_kind_names[] = {
141 #endif /* GATHER_STATISTICS */
143 /* Unique id for next decl created. */
144 static GTY(()) int next_decl_uid;
145 /* Unique id for next type created. */
146 static GTY(()) int next_type_uid = 1;
148 /* Since we cannot rehash a type after it is in the table, we have to
149 keep the hash code. */
151 struct type_hash GTY(())
157 /* Initial size of the hash table (rounded to next prime). */
158 #define TYPE_HASH_INITIAL_SIZE 1000
160 /* Now here is the hash table. When recording a type, it is added to
161 the slot whose index is the hash code. Note that the hash table is
162 used for several kinds of types (function types, array types and
163 array index range types, for now). While all these live in the
164 same table, they are completely independent, and the hash code is
165 computed differently for each of these. */
167 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
168 htab_t type_hash_table;
170 /* Hash table and temporary node for larger integer const values. */
171 static GTY (()) tree int_cst_node;
172 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
173 htab_t int_cst_hash_table;
175 /* Hash table for optimization flags and target option flags. Use the same
176 hash table for both sets of options. Nodes for building the current
177 optimization and target option nodes. The assumption is most of the time
178 the options created will already be in the hash table, so we avoid
179 allocating and freeing up a node repeatably. */
180 static GTY (()) tree cl_optimization_node;
181 static GTY (()) tree cl_target_option_node;
182 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
183 htab_t cl_option_hash_table;
185 /* General tree->tree mapping structure for use in hash tables. */
188 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
189 htab_t debug_expr_for_decl;
191 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
192 htab_t value_expr_for_decl;
194 static GTY ((if_marked ("tree_priority_map_marked_p"),
195 param_is (struct tree_priority_map)))
196 htab_t init_priority_for_decl;
198 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
199 htab_t restrict_base_for_decl;
201 static void set_type_quals (tree, int);
202 static int type_hash_eq (const void *, const void *);
203 static hashval_t type_hash_hash (const void *);
204 static hashval_t int_cst_hash_hash (const void *);
205 static int int_cst_hash_eq (const void *, const void *);
206 static hashval_t cl_option_hash_hash (const void *);
207 static int cl_option_hash_eq (const void *, const void *);
208 static void print_type_hash_statistics (void);
209 static void print_debug_expr_statistics (void);
210 static void print_value_expr_statistics (void);
211 static int type_hash_marked_p (const void *);
212 static unsigned int type_hash_list (const_tree, hashval_t);
213 static unsigned int attribute_hash_list (const_tree, hashval_t);
215 tree global_trees[TI_MAX];
216 tree integer_types[itk_none];
218 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
220 /* Number of operands for each OpenMP clause. */
221 unsigned const char omp_clause_num_ops[] =
223 0, /* OMP_CLAUSE_ERROR */
224 1, /* OMP_CLAUSE_PRIVATE */
225 1, /* OMP_CLAUSE_SHARED */
226 1, /* OMP_CLAUSE_FIRSTPRIVATE */
227 2, /* OMP_CLAUSE_LASTPRIVATE */
228 4, /* OMP_CLAUSE_REDUCTION */
229 1, /* OMP_CLAUSE_COPYIN */
230 1, /* OMP_CLAUSE_COPYPRIVATE */
231 1, /* OMP_CLAUSE_IF */
232 1, /* OMP_CLAUSE_NUM_THREADS */
233 1, /* OMP_CLAUSE_SCHEDULE */
234 0, /* OMP_CLAUSE_NOWAIT */
235 0, /* OMP_CLAUSE_ORDERED */
236 0, /* OMP_CLAUSE_DEFAULT */
237 3, /* OMP_CLAUSE_COLLAPSE */
238 0 /* OMP_CLAUSE_UNTIED */
241 const char * const omp_clause_code_name[] =
266 /* Initialize the hash table of types. */
267 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
270 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
273 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
275 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
276 tree_priority_map_eq, 0);
277 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
280 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
281 int_cst_hash_eq, NULL);
283 int_cst_node = make_node (INTEGER_CST);
285 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
286 cl_option_hash_eq, NULL);
288 cl_optimization_node = make_node (OPTIMIZATION_NODE);
289 cl_target_option_node = make_node (TARGET_OPTION_NODE);
291 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
292 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
293 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
296 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
297 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
298 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
299 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
300 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
301 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
302 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
303 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
304 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
307 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
308 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
309 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
310 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
311 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
312 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
314 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
315 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
316 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
317 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
318 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
319 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
320 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
321 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
322 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
323 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
324 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
325 tree_contains_struct[MEMORY_PARTITION_TAG][TS_DECL_MINIMAL] = 1;
327 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
328 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
329 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_TAG] = 1;
331 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_PARTITION_TAG] = 1;
333 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
334 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
335 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
336 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
338 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
339 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
340 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
341 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
342 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
343 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
344 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
345 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
347 lang_hooks.init_ts ();
351 /* The name of the object as the assembler will see it (but before any
352 translations made by ASM_OUTPUT_LABELREF). Often this is the same
353 as DECL_NAME. It is an IDENTIFIER_NODE. */
355 decl_assembler_name (tree decl)
357 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
358 lang_hooks.set_decl_assembler_name (decl);
359 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
362 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
365 decl_assembler_name_equal (tree decl, const_tree asmname)
367 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
368 const char *decl_str;
369 const char *asmname_str;
372 if (decl_asmname == asmname)
375 decl_str = IDENTIFIER_POINTER (decl_asmname);
376 asmname_str = IDENTIFIER_POINTER (asmname);
379 /* If the target assembler name was set by the user, things are trickier.
380 We have a leading '*' to begin with. After that, it's arguable what
381 is the correct thing to do with -fleading-underscore. Arguably, we've
382 historically been doing the wrong thing in assemble_alias by always
383 printing the leading underscore. Since we're not changing that, make
384 sure user_label_prefix follows the '*' before matching. */
385 if (decl_str[0] == '*')
387 size_t ulp_len = strlen (user_label_prefix);
393 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
394 decl_str += ulp_len, test=true;
398 if (asmname_str[0] == '*')
400 size_t ulp_len = strlen (user_label_prefix);
406 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
407 asmname_str += ulp_len, test=true;
414 return strcmp (decl_str, asmname_str) == 0;
417 /* Hash asmnames ignoring the user specified marks. */
420 decl_assembler_name_hash (const_tree asmname)
422 if (IDENTIFIER_POINTER (asmname)[0] == '*')
424 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
425 size_t ulp_len = strlen (user_label_prefix);
429 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
432 return htab_hash_string (decl_str);
435 return htab_hash_string (IDENTIFIER_POINTER (asmname));
438 /* Compute the number of bytes occupied by a tree with code CODE.
439 This function cannot be used for nodes that have variable sizes,
440 including TREE_VEC, STRING_CST, and CALL_EXPR. */
442 tree_code_size (enum tree_code code)
444 switch (TREE_CODE_CLASS (code))
446 case tcc_declaration: /* A decl node */
451 return sizeof (struct tree_field_decl);
453 return sizeof (struct tree_parm_decl);
455 return sizeof (struct tree_var_decl);
457 return sizeof (struct tree_label_decl);
459 return sizeof (struct tree_result_decl);
461 return sizeof (struct tree_const_decl);
463 return sizeof (struct tree_type_decl);
465 return sizeof (struct tree_function_decl);
466 case NAME_MEMORY_TAG:
467 case SYMBOL_MEMORY_TAG:
468 return sizeof (struct tree_memory_tag);
469 case MEMORY_PARTITION_TAG:
470 return sizeof (struct tree_memory_partition_tag);
472 return sizeof (struct tree_decl_non_common);
476 case tcc_type: /* a type node */
477 return sizeof (struct tree_type);
479 case tcc_reference: /* a reference */
480 case tcc_expression: /* an expression */
481 case tcc_statement: /* an expression with side effects */
482 case tcc_comparison: /* a comparison expression */
483 case tcc_unary: /* a unary arithmetic expression */
484 case tcc_binary: /* a binary arithmetic expression */
485 return (sizeof (struct tree_exp)
486 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
488 case tcc_constant: /* a constant */
491 case INTEGER_CST: return sizeof (struct tree_int_cst);
492 case REAL_CST: return sizeof (struct tree_real_cst);
493 case FIXED_CST: return sizeof (struct tree_fixed_cst);
494 case COMPLEX_CST: return sizeof (struct tree_complex);
495 case VECTOR_CST: return sizeof (struct tree_vector);
496 case STRING_CST: gcc_unreachable ();
498 return lang_hooks.tree_size (code);
501 case tcc_exceptional: /* something random, like an identifier. */
504 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
505 case TREE_LIST: return sizeof (struct tree_list);
508 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
511 case OMP_CLAUSE: gcc_unreachable ();
513 case SSA_NAME: return sizeof (struct tree_ssa_name);
515 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
516 case BLOCK: return sizeof (struct tree_block);
517 case CONSTRUCTOR: return sizeof (struct tree_constructor);
518 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
519 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
522 return lang_hooks.tree_size (code);
530 /* Compute the number of bytes occupied by NODE. This routine only
531 looks at TREE_CODE, except for those nodes that have variable sizes. */
533 tree_size (const_tree node)
535 const enum tree_code code = TREE_CODE (node);
539 return (offsetof (struct tree_binfo, base_binfos)
540 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
543 return (sizeof (struct tree_vec)
544 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
547 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
550 return (sizeof (struct tree_omp_clause)
551 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
555 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
556 return (sizeof (struct tree_exp)
557 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
559 return tree_code_size (code);
563 /* Return a newly allocated node of code CODE. For decl and type
564 nodes, some other fields are initialized. The rest of the node is
565 initialized to zero. This function cannot be used for TREE_VEC or
566 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
568 Achoo! I got a code in the node. */
571 make_node_stat (enum tree_code code MEM_STAT_DECL)
574 enum tree_code_class type = TREE_CODE_CLASS (code);
575 size_t length = tree_code_size (code);
576 #ifdef GATHER_STATISTICS
581 case tcc_declaration: /* A decl node */
585 case tcc_type: /* a type node */
589 case tcc_statement: /* an expression with side effects */
593 case tcc_reference: /* a reference */
597 case tcc_expression: /* an expression */
598 case tcc_comparison: /* a comparison expression */
599 case tcc_unary: /* a unary arithmetic expression */
600 case tcc_binary: /* a binary arithmetic expression */
604 case tcc_constant: /* a constant */
608 case tcc_exceptional: /* something random, like an identifier. */
611 case IDENTIFIER_NODE:
624 kind = ssa_name_kind;
645 tree_node_counts[(int) kind]++;
646 tree_node_sizes[(int) kind] += length;
649 if (code == IDENTIFIER_NODE)
650 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
652 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
654 memset (t, 0, length);
656 TREE_SET_CODE (t, code);
661 TREE_SIDE_EFFECTS (t) = 1;
664 case tcc_declaration:
665 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
667 if (code == FUNCTION_DECL)
669 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
670 DECL_MODE (t) = FUNCTION_MODE;
674 /* We have not yet computed the alias set for this declaration. */
675 DECL_POINTER_ALIAS_SET (t) = -1;
677 DECL_SOURCE_LOCATION (t) = input_location;
678 DECL_UID (t) = next_decl_uid++;
683 TYPE_UID (t) = next_type_uid++;
684 TYPE_ALIGN (t) = BITS_PER_UNIT;
685 TYPE_USER_ALIGN (t) = 0;
686 TYPE_MAIN_VARIANT (t) = t;
687 TYPE_CANONICAL (t) = t;
689 /* Default to no attributes for type, but let target change that. */
690 TYPE_ATTRIBUTES (t) = NULL_TREE;
691 targetm.set_default_type_attributes (t);
693 /* We have not yet computed the alias set for this type. */
694 TYPE_ALIAS_SET (t) = -1;
698 TREE_CONSTANT (t) = 1;
707 case PREDECREMENT_EXPR:
708 case PREINCREMENT_EXPR:
709 case POSTDECREMENT_EXPR:
710 case POSTINCREMENT_EXPR:
711 /* All of these have side-effects, no matter what their
713 TREE_SIDE_EFFECTS (t) = 1;
722 /* Other classes need no special treatment. */
729 /* Return a new node with the same contents as NODE except that its
730 TREE_CHAIN is zero and it has a fresh uid. */
733 copy_node_stat (tree node MEM_STAT_DECL)
736 enum tree_code code = TREE_CODE (node);
739 gcc_assert (code != STATEMENT_LIST);
741 length = tree_size (node);
742 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
743 memcpy (t, node, length);
746 TREE_ASM_WRITTEN (t) = 0;
747 TREE_VISITED (t) = 0;
750 if (TREE_CODE_CLASS (code) == tcc_declaration)
752 DECL_UID (t) = next_decl_uid++;
753 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
754 && DECL_HAS_VALUE_EXPR_P (node))
756 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
757 DECL_HAS_VALUE_EXPR_P (t) = 1;
759 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
761 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
762 DECL_HAS_INIT_PRIORITY_P (t) = 1;
764 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
766 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
767 DECL_BASED_ON_RESTRICT_P (t) = 1;
770 else if (TREE_CODE_CLASS (code) == tcc_type)
772 TYPE_UID (t) = next_type_uid++;
773 /* The following is so that the debug code for
774 the copy is different from the original type.
775 The two statements usually duplicate each other
776 (because they clear fields of the same union),
777 but the optimizer should catch that. */
778 TYPE_SYMTAB_POINTER (t) = 0;
779 TYPE_SYMTAB_ADDRESS (t) = 0;
781 /* Do not copy the values cache. */
782 if (TYPE_CACHED_VALUES_P(t))
784 TYPE_CACHED_VALUES_P (t) = 0;
785 TYPE_CACHED_VALUES (t) = NULL_TREE;
792 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
793 For example, this can copy a list made of TREE_LIST nodes. */
796 copy_list (tree list)
804 head = prev = copy_node (list);
805 next = TREE_CHAIN (list);
808 TREE_CHAIN (prev) = copy_node (next);
809 prev = TREE_CHAIN (prev);
810 next = TREE_CHAIN (next);
816 /* Create an INT_CST node with a LOW value sign extended. */
819 build_int_cst (tree type, HOST_WIDE_INT low)
821 /* Support legacy code. */
823 type = integer_type_node;
825 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
828 /* Create an INT_CST node with a LOW value zero extended. */
831 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
833 return build_int_cst_wide (type, low, 0);
836 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
837 if it is negative. This function is similar to build_int_cst, but
838 the extra bits outside of the type precision are cleared. Constants
839 with these extra bits may confuse the fold so that it detects overflows
840 even in cases when they do not occur, and in general should be avoided.
841 We cannot however make this a default behavior of build_int_cst without
842 more intrusive changes, since there are parts of gcc that rely on the extra
843 precision of the integer constants. */
846 build_int_cst_type (tree type, HOST_WIDE_INT low)
848 unsigned HOST_WIDE_INT low1;
853 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
855 return build_int_cst_wide (type, low1, hi);
858 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
859 and sign extended according to the value range of TYPE. */
862 build_int_cst_wide_type (tree type,
863 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
865 fit_double_type (low, high, &low, &high, type);
866 return build_int_cst_wide (type, low, high);
869 /* These are the hash table functions for the hash table of INTEGER_CST
870 nodes of a sizetype. */
872 /* Return the hash code code X, an INTEGER_CST. */
875 int_cst_hash_hash (const void *x)
877 const_tree const t = (const_tree) x;
879 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
880 ^ htab_hash_pointer (TREE_TYPE (t)));
883 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
884 is the same as that given by *Y, which is the same. */
887 int_cst_hash_eq (const void *x, const void *y)
889 const_tree const xt = (const_tree) x;
890 const_tree const yt = (const_tree) y;
892 return (TREE_TYPE (xt) == TREE_TYPE (yt)
893 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
894 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
897 /* Create an INT_CST node of TYPE and value HI:LOW.
898 The returned node is always shared. For small integers we use a
899 per-type vector cache, for larger ones we use a single hash table. */
902 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
910 switch (TREE_CODE (type))
914 /* Cache NULL pointer. */
923 /* Cache false or true. */
931 if (TYPE_UNSIGNED (type))
934 limit = INTEGER_SHARE_LIMIT;
935 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
941 limit = INTEGER_SHARE_LIMIT + 1;
942 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
944 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
958 /* Look for it in the type's vector of small shared ints. */
959 if (!TYPE_CACHED_VALUES_P (type))
961 TYPE_CACHED_VALUES_P (type) = 1;
962 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
965 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
968 /* Make sure no one is clobbering the shared constant. */
969 gcc_assert (TREE_TYPE (t) == type);
970 gcc_assert (TREE_INT_CST_LOW (t) == low);
971 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
975 /* Create a new shared int. */
976 t = make_node (INTEGER_CST);
978 TREE_INT_CST_LOW (t) = low;
979 TREE_INT_CST_HIGH (t) = hi;
980 TREE_TYPE (t) = type;
982 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
987 /* Use the cache of larger shared ints. */
990 TREE_INT_CST_LOW (int_cst_node) = low;
991 TREE_INT_CST_HIGH (int_cst_node) = hi;
992 TREE_TYPE (int_cst_node) = type;
994 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
998 /* Insert this one into the hash table. */
1001 /* Make a new node for next time round. */
1002 int_cst_node = make_node (INTEGER_CST);
1009 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1010 and the rest are zeros. */
1013 build_low_bits_mask (tree type, unsigned bits)
1015 unsigned HOST_WIDE_INT low;
1017 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1019 gcc_assert (bits <= TYPE_PRECISION (type));
1021 if (bits == TYPE_PRECISION (type)
1022 && !TYPE_UNSIGNED (type))
1024 /* Sign extended all-ones mask. */
1028 else if (bits <= HOST_BITS_PER_WIDE_INT)
1030 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1035 bits -= HOST_BITS_PER_WIDE_INT;
1037 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1040 return build_int_cst_wide (type, low, high);
1043 /* Checks that X is integer constant that can be expressed in (unsigned)
1044 HOST_WIDE_INT without loss of precision. */
1047 cst_and_fits_in_hwi (const_tree x)
1049 if (TREE_CODE (x) != INTEGER_CST)
1052 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1055 return (TREE_INT_CST_HIGH (x) == 0
1056 || TREE_INT_CST_HIGH (x) == -1);
1059 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1060 are in a list pointed to by VALS. */
1063 build_vector (tree type, tree vals)
1065 tree v = make_node (VECTOR_CST);
1069 TREE_VECTOR_CST_ELTS (v) = vals;
1070 TREE_TYPE (v) = type;
1072 /* Iterate through elements and check for overflow. */
1073 for (link = vals; link; link = TREE_CHAIN (link))
1075 tree value = TREE_VALUE (link);
1077 /* Don't crash if we get an address constant. */
1078 if (!CONSTANT_CLASS_P (value))
1081 over |= TREE_OVERFLOW (value);
1084 TREE_OVERFLOW (v) = over;
1088 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1089 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1092 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1094 tree list = NULL_TREE;
1095 unsigned HOST_WIDE_INT idx;
1098 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1099 list = tree_cons (NULL_TREE, value, list);
1100 return build_vector (type, nreverse (list));
1103 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1104 are in the VEC pointed to by VALS. */
1106 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1108 tree c = make_node (CONSTRUCTOR);
1109 TREE_TYPE (c) = type;
1110 CONSTRUCTOR_ELTS (c) = vals;
1114 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1117 build_constructor_single (tree type, tree index, tree value)
1119 VEC(constructor_elt,gc) *v;
1120 constructor_elt *elt;
1123 v = VEC_alloc (constructor_elt, gc, 1);
1124 elt = VEC_quick_push (constructor_elt, v, NULL);
1128 t = build_constructor (type, v);
1129 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1134 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1135 are in a list pointed to by VALS. */
1137 build_constructor_from_list (tree type, tree vals)
1140 VEC(constructor_elt,gc) *v = NULL;
1141 bool constant_p = true;
1145 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1146 for (t = vals; t; t = TREE_CHAIN (t))
1148 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1149 val = TREE_VALUE (t);
1150 elt->index = TREE_PURPOSE (t);
1152 if (!TREE_CONSTANT (val))
1157 t = build_constructor (type, v);
1158 TREE_CONSTANT (t) = constant_p;
1162 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1165 build_fixed (tree type, FIXED_VALUE_TYPE f)
1168 FIXED_VALUE_TYPE *fp;
1170 v = make_node (FIXED_CST);
1171 fp = GGC_NEW (FIXED_VALUE_TYPE);
1172 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1174 TREE_TYPE (v) = type;
1175 TREE_FIXED_CST_PTR (v) = fp;
1179 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1182 build_real (tree type, REAL_VALUE_TYPE d)
1185 REAL_VALUE_TYPE *dp;
1188 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1189 Consider doing it via real_convert now. */
1191 v = make_node (REAL_CST);
1192 dp = GGC_NEW (REAL_VALUE_TYPE);
1193 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1195 TREE_TYPE (v) = type;
1196 TREE_REAL_CST_PTR (v) = dp;
1197 TREE_OVERFLOW (v) = overflow;
1201 /* Return a new REAL_CST node whose type is TYPE
1202 and whose value is the integer value of the INTEGER_CST node I. */
1205 real_value_from_int_cst (const_tree type, const_tree i)
1209 /* Clear all bits of the real value type so that we can later do
1210 bitwise comparisons to see if two values are the same. */
1211 memset (&d, 0, sizeof d);
1213 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1214 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1215 TYPE_UNSIGNED (TREE_TYPE (i)));
1219 /* Given a tree representing an integer constant I, return a tree
1220 representing the same value as a floating-point constant of type TYPE. */
1223 build_real_from_int_cst (tree type, const_tree i)
1226 int overflow = TREE_OVERFLOW (i);
1228 v = build_real (type, real_value_from_int_cst (type, i));
1230 TREE_OVERFLOW (v) |= overflow;
1234 /* Return a newly constructed STRING_CST node whose value is
1235 the LEN characters at STR.
1236 The TREE_TYPE is not initialized. */
1239 build_string (int len, const char *str)
1244 /* Do not waste bytes provided by padding of struct tree_string. */
1245 length = len + offsetof (struct tree_string, str) + 1;
1247 #ifdef GATHER_STATISTICS
1248 tree_node_counts[(int) c_kind]++;
1249 tree_node_sizes[(int) c_kind] += length;
1252 s = ggc_alloc_tree (length);
1254 memset (s, 0, sizeof (struct tree_common));
1255 TREE_SET_CODE (s, STRING_CST);
1256 TREE_CONSTANT (s) = 1;
1257 TREE_STRING_LENGTH (s) = len;
1258 memcpy (s->string.str, str, len);
1259 s->string.str[len] = '\0';
1264 /* Return a newly constructed COMPLEX_CST node whose value is
1265 specified by the real and imaginary parts REAL and IMAG.
1266 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1267 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1270 build_complex (tree type, tree real, tree imag)
1272 tree t = make_node (COMPLEX_CST);
1274 TREE_REALPART (t) = real;
1275 TREE_IMAGPART (t) = imag;
1276 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1277 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1281 /* Return a constant of arithmetic type TYPE which is the
1282 multiplicative identity of the set TYPE. */
1285 build_one_cst (tree type)
1287 switch (TREE_CODE (type))
1289 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1290 case POINTER_TYPE: case REFERENCE_TYPE:
1292 return build_int_cst (type, 1);
1295 return build_real (type, dconst1);
1297 case FIXED_POINT_TYPE:
1298 /* We can only generate 1 for accum types. */
1299 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1300 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1307 scalar = build_one_cst (TREE_TYPE (type));
1309 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1311 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1312 cst = tree_cons (NULL_TREE, scalar, cst);
1314 return build_vector (type, cst);
1318 return build_complex (type,
1319 build_one_cst (TREE_TYPE (type)),
1320 fold_convert (TREE_TYPE (type), integer_zero_node));
1327 /* Build a BINFO with LEN language slots. */
1330 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1333 size_t length = (offsetof (struct tree_binfo, base_binfos)
1334 + VEC_embedded_size (tree, base_binfos));
1336 #ifdef GATHER_STATISTICS
1337 tree_node_counts[(int) binfo_kind]++;
1338 tree_node_sizes[(int) binfo_kind] += length;
1341 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1343 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1345 TREE_SET_CODE (t, TREE_BINFO);
1347 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1353 /* Build a newly constructed TREE_VEC node of length LEN. */
1356 make_tree_vec_stat (int len MEM_STAT_DECL)
1359 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1361 #ifdef GATHER_STATISTICS
1362 tree_node_counts[(int) vec_kind]++;
1363 tree_node_sizes[(int) vec_kind] += length;
1366 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1368 memset (t, 0, length);
1370 TREE_SET_CODE (t, TREE_VEC);
1371 TREE_VEC_LENGTH (t) = len;
1376 /* Return 1 if EXPR is the integer constant zero or a complex constant
1380 integer_zerop (const_tree expr)
1384 return ((TREE_CODE (expr) == INTEGER_CST
1385 && TREE_INT_CST_LOW (expr) == 0
1386 && TREE_INT_CST_HIGH (expr) == 0)
1387 || (TREE_CODE (expr) == COMPLEX_CST
1388 && integer_zerop (TREE_REALPART (expr))
1389 && integer_zerop (TREE_IMAGPART (expr))));
1392 /* Return 1 if EXPR is the integer constant one or the corresponding
1393 complex constant. */
1396 integer_onep (const_tree expr)
1400 return ((TREE_CODE (expr) == INTEGER_CST
1401 && TREE_INT_CST_LOW (expr) == 1
1402 && TREE_INT_CST_HIGH (expr) == 0)
1403 || (TREE_CODE (expr) == COMPLEX_CST
1404 && integer_onep (TREE_REALPART (expr))
1405 && integer_zerop (TREE_IMAGPART (expr))));
1408 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1409 it contains. Likewise for the corresponding complex constant. */
1412 integer_all_onesp (const_tree expr)
1419 if (TREE_CODE (expr) == COMPLEX_CST
1420 && integer_all_onesp (TREE_REALPART (expr))
1421 && integer_zerop (TREE_IMAGPART (expr)))
1424 else if (TREE_CODE (expr) != INTEGER_CST)
1427 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1428 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1429 && TREE_INT_CST_HIGH (expr) == -1)
1434 /* Note that using TYPE_PRECISION here is wrong. We care about the
1435 actual bits, not the (arbitrary) range of the type. */
1436 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1437 if (prec >= HOST_BITS_PER_WIDE_INT)
1439 HOST_WIDE_INT high_value;
1442 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1444 /* Can not handle precisions greater than twice the host int size. */
1445 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1446 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1447 /* Shifting by the host word size is undefined according to the ANSI
1448 standard, so we must handle this as a special case. */
1451 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1453 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1454 && TREE_INT_CST_HIGH (expr) == high_value);
1457 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1460 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1464 integer_pow2p (const_tree expr)
1467 HOST_WIDE_INT high, low;
1471 if (TREE_CODE (expr) == COMPLEX_CST
1472 && integer_pow2p (TREE_REALPART (expr))
1473 && integer_zerop (TREE_IMAGPART (expr)))
1476 if (TREE_CODE (expr) != INTEGER_CST)
1479 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1480 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1481 high = TREE_INT_CST_HIGH (expr);
1482 low = TREE_INT_CST_LOW (expr);
1484 /* First clear all bits that are beyond the type's precision in case
1485 we've been sign extended. */
1487 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1489 else if (prec > HOST_BITS_PER_WIDE_INT)
1490 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1494 if (prec < HOST_BITS_PER_WIDE_INT)
1495 low &= ~((HOST_WIDE_INT) (-1) << prec);
1498 if (high == 0 && low == 0)
1501 return ((high == 0 && (low & (low - 1)) == 0)
1502 || (low == 0 && (high & (high - 1)) == 0));
1505 /* Return 1 if EXPR is an integer constant other than zero or a
1506 complex constant other than zero. */
1509 integer_nonzerop (const_tree expr)
1513 return ((TREE_CODE (expr) == INTEGER_CST
1514 && (TREE_INT_CST_LOW (expr) != 0
1515 || TREE_INT_CST_HIGH (expr) != 0))
1516 || (TREE_CODE (expr) == COMPLEX_CST
1517 && (integer_nonzerop (TREE_REALPART (expr))
1518 || integer_nonzerop (TREE_IMAGPART (expr)))));
1521 /* Return 1 if EXPR is the fixed-point constant zero. */
1524 fixed_zerop (const_tree expr)
1526 return (TREE_CODE (expr) == FIXED_CST
1527 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1530 /* Return the power of two represented by a tree node known to be a
1534 tree_log2 (const_tree expr)
1537 HOST_WIDE_INT high, low;
1541 if (TREE_CODE (expr) == COMPLEX_CST)
1542 return tree_log2 (TREE_REALPART (expr));
1544 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1545 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1547 high = TREE_INT_CST_HIGH (expr);
1548 low = TREE_INT_CST_LOW (expr);
1550 /* First clear all bits that are beyond the type's precision in case
1551 we've been sign extended. */
1553 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1555 else if (prec > HOST_BITS_PER_WIDE_INT)
1556 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1560 if (prec < HOST_BITS_PER_WIDE_INT)
1561 low &= ~((HOST_WIDE_INT) (-1) << prec);
1564 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1565 : exact_log2 (low));
1568 /* Similar, but return the largest integer Y such that 2 ** Y is less
1569 than or equal to EXPR. */
1572 tree_floor_log2 (const_tree expr)
1575 HOST_WIDE_INT high, low;
1579 if (TREE_CODE (expr) == COMPLEX_CST)
1580 return tree_log2 (TREE_REALPART (expr));
1582 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1583 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1585 high = TREE_INT_CST_HIGH (expr);
1586 low = TREE_INT_CST_LOW (expr);
1588 /* First clear all bits that are beyond the type's precision in case
1589 we've been sign extended. Ignore if type's precision hasn't been set
1590 since what we are doing is setting it. */
1592 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1594 else if (prec > HOST_BITS_PER_WIDE_INT)
1595 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1599 if (prec < HOST_BITS_PER_WIDE_INT)
1600 low &= ~((HOST_WIDE_INT) (-1) << prec);
1603 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1604 : floor_log2 (low));
1607 /* Return 1 if EXPR is the real constant zero. */
1610 real_zerop (const_tree expr)
1614 return ((TREE_CODE (expr) == REAL_CST
1615 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1616 || (TREE_CODE (expr) == COMPLEX_CST
1617 && real_zerop (TREE_REALPART (expr))
1618 && real_zerop (TREE_IMAGPART (expr))));
1621 /* Return 1 if EXPR is the real constant one in real or complex form. */
1624 real_onep (const_tree expr)
1628 return ((TREE_CODE (expr) == REAL_CST
1629 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1630 || (TREE_CODE (expr) == COMPLEX_CST
1631 && real_onep (TREE_REALPART (expr))
1632 && real_zerop (TREE_IMAGPART (expr))));
1635 /* Return 1 if EXPR is the real constant two. */
1638 real_twop (const_tree expr)
1642 return ((TREE_CODE (expr) == REAL_CST
1643 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1644 || (TREE_CODE (expr) == COMPLEX_CST
1645 && real_twop (TREE_REALPART (expr))
1646 && real_zerop (TREE_IMAGPART (expr))));
1649 /* Return 1 if EXPR is the real constant minus one. */
1652 real_minus_onep (const_tree expr)
1656 return ((TREE_CODE (expr) == REAL_CST
1657 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1658 || (TREE_CODE (expr) == COMPLEX_CST
1659 && real_minus_onep (TREE_REALPART (expr))
1660 && real_zerop (TREE_IMAGPART (expr))));
1663 /* Nonzero if EXP is a constant or a cast of a constant. */
1666 really_constant_p (const_tree exp)
1668 /* This is not quite the same as STRIP_NOPS. It does more. */
1669 while (CONVERT_EXPR_P (exp)
1670 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1671 exp = TREE_OPERAND (exp, 0);
1672 return TREE_CONSTANT (exp);
1675 /* Return first list element whose TREE_VALUE is ELEM.
1676 Return 0 if ELEM is not in LIST. */
1679 value_member (tree elem, tree list)
1683 if (elem == TREE_VALUE (list))
1685 list = TREE_CHAIN (list);
1690 /* Return first list element whose TREE_PURPOSE is ELEM.
1691 Return 0 if ELEM is not in LIST. */
1694 purpose_member (const_tree elem, tree list)
1698 if (elem == TREE_PURPOSE (list))
1700 list = TREE_CHAIN (list);
1705 /* Return nonzero if ELEM is part of the chain CHAIN. */
1708 chain_member (const_tree elem, const_tree chain)
1714 chain = TREE_CHAIN (chain);
1720 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1721 We expect a null pointer to mark the end of the chain.
1722 This is the Lisp primitive `length'. */
1725 list_length (const_tree t)
1728 #ifdef ENABLE_TREE_CHECKING
1736 #ifdef ENABLE_TREE_CHECKING
1739 gcc_assert (p != q);
1747 /* Returns the number of FIELD_DECLs in TYPE. */
1750 fields_length (const_tree type)
1752 tree t = TYPE_FIELDS (type);
1755 for (; t; t = TREE_CHAIN (t))
1756 if (TREE_CODE (t) == FIELD_DECL)
1762 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1763 by modifying the last node in chain 1 to point to chain 2.
1764 This is the Lisp primitive `nconc'. */
1767 chainon (tree op1, tree op2)
1776 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1778 TREE_CHAIN (t1) = op2;
1780 #ifdef ENABLE_TREE_CHECKING
1783 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1784 gcc_assert (t2 != t1);
1791 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1794 tree_last (tree chain)
1798 while ((next = TREE_CHAIN (chain)))
1803 /* Reverse the order of elements in the chain T,
1804 and return the new head of the chain (old last element). */
1809 tree prev = 0, decl, next;
1810 for (decl = t; decl; decl = next)
1812 next = TREE_CHAIN (decl);
1813 TREE_CHAIN (decl) = prev;
1819 /* Return a newly created TREE_LIST node whose
1820 purpose and value fields are PARM and VALUE. */
1823 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1825 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1826 TREE_PURPOSE (t) = parm;
1827 TREE_VALUE (t) = value;
1831 /* Return a newly created TREE_LIST node whose
1832 purpose and value fields are PURPOSE and VALUE
1833 and whose TREE_CHAIN is CHAIN. */
1836 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1840 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1842 memset (node, 0, sizeof (struct tree_common));
1844 #ifdef GATHER_STATISTICS
1845 tree_node_counts[(int) x_kind]++;
1846 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1849 TREE_SET_CODE (node, TREE_LIST);
1850 TREE_CHAIN (node) = chain;
1851 TREE_PURPOSE (node) = purpose;
1852 TREE_VALUE (node) = value;
1856 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
1859 ctor_to_list (tree ctor)
1861 tree list = NULL_TREE;
1866 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
1868 *p = build_tree_list (purpose, val);
1869 p = &TREE_CHAIN (*p);
1875 /* Return the size nominally occupied by an object of type TYPE
1876 when it resides in memory. The value is measured in units of bytes,
1877 and its data type is that normally used for type sizes
1878 (which is the first type created by make_signed_type or
1879 make_unsigned_type). */
1882 size_in_bytes (const_tree type)
1886 if (type == error_mark_node)
1887 return integer_zero_node;
1889 type = TYPE_MAIN_VARIANT (type);
1890 t = TYPE_SIZE_UNIT (type);
1894 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1895 return size_zero_node;
1901 /* Return the size of TYPE (in bytes) as a wide integer
1902 or return -1 if the size can vary or is larger than an integer. */
1905 int_size_in_bytes (const_tree type)
1909 if (type == error_mark_node)
1912 type = TYPE_MAIN_VARIANT (type);
1913 t = TYPE_SIZE_UNIT (type);
1915 || TREE_CODE (t) != INTEGER_CST
1916 || TREE_INT_CST_HIGH (t) != 0
1917 /* If the result would appear negative, it's too big to represent. */
1918 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1921 return TREE_INT_CST_LOW (t);
1924 /* Return the maximum size of TYPE (in bytes) as a wide integer
1925 or return -1 if the size can vary or is larger than an integer. */
1928 max_int_size_in_bytes (const_tree type)
1930 HOST_WIDE_INT size = -1;
1933 /* If this is an array type, check for a possible MAX_SIZE attached. */
1935 if (TREE_CODE (type) == ARRAY_TYPE)
1937 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1939 if (size_tree && host_integerp (size_tree, 1))
1940 size = tree_low_cst (size_tree, 1);
1943 /* If we still haven't been able to get a size, see if the language
1944 can compute a maximum size. */
1948 size_tree = lang_hooks.types.max_size (type);
1950 if (size_tree && host_integerp (size_tree, 1))
1951 size = tree_low_cst (size_tree, 1);
1957 /* Return the bit position of FIELD, in bits from the start of the record.
1958 This is a tree of type bitsizetype. */
1961 bit_position (const_tree field)
1963 return bit_from_pos (DECL_FIELD_OFFSET (field),
1964 DECL_FIELD_BIT_OFFSET (field));
1967 /* Likewise, but return as an integer. It must be representable in
1968 that way (since it could be a signed value, we don't have the
1969 option of returning -1 like int_size_in_byte can. */
1972 int_bit_position (const_tree field)
1974 return tree_low_cst (bit_position (field), 0);
1977 /* Return the byte position of FIELD, in bytes from the start of the record.
1978 This is a tree of type sizetype. */
1981 byte_position (const_tree field)
1983 return byte_from_pos (DECL_FIELD_OFFSET (field),
1984 DECL_FIELD_BIT_OFFSET (field));
1987 /* Likewise, but return as an integer. It must be representable in
1988 that way (since it could be a signed value, we don't have the
1989 option of returning -1 like int_size_in_byte can. */
1992 int_byte_position (const_tree field)
1994 return tree_low_cst (byte_position (field), 0);
1997 /* Return the strictest alignment, in bits, that T is known to have. */
2000 expr_align (const_tree t)
2002 unsigned int align0, align1;
2004 switch (TREE_CODE (t))
2006 CASE_CONVERT: case NON_LVALUE_EXPR:
2007 /* If we have conversions, we know that the alignment of the
2008 object must meet each of the alignments of the types. */
2009 align0 = expr_align (TREE_OPERAND (t, 0));
2010 align1 = TYPE_ALIGN (TREE_TYPE (t));
2011 return MAX (align0, align1);
2013 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2014 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2015 case CLEANUP_POINT_EXPR:
2016 /* These don't change the alignment of an object. */
2017 return expr_align (TREE_OPERAND (t, 0));
2020 /* The best we can do is say that the alignment is the least aligned
2022 align0 = expr_align (TREE_OPERAND (t, 1));
2023 align1 = expr_align (TREE_OPERAND (t, 2));
2024 return MIN (align0, align1);
2026 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2027 meaningfully, it's always 1. */
2028 case LABEL_DECL: case CONST_DECL:
2029 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2031 gcc_assert (DECL_ALIGN (t) != 0);
2032 return DECL_ALIGN (t);
2038 /* Otherwise take the alignment from that of the type. */
2039 return TYPE_ALIGN (TREE_TYPE (t));
2042 /* Return, as a tree node, the number of elements for TYPE (which is an
2043 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2046 array_type_nelts (const_tree type)
2048 tree index_type, min, max;
2050 /* If they did it with unspecified bounds, then we should have already
2051 given an error about it before we got here. */
2052 if (! TYPE_DOMAIN (type))
2053 return error_mark_node;
2055 index_type = TYPE_DOMAIN (type);
2056 min = TYPE_MIN_VALUE (index_type);
2057 max = TYPE_MAX_VALUE (index_type);
2059 return (integer_zerop (min)
2061 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2064 /* If arg is static -- a reference to an object in static storage -- then
2065 return the object. This is not the same as the C meaning of `static'.
2066 If arg isn't static, return NULL. */
2071 switch (TREE_CODE (arg))
2074 /* Nested functions are static, even though taking their address will
2075 involve a trampoline as we unnest the nested function and create
2076 the trampoline on the tree level. */
2080 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2081 && ! DECL_THREAD_LOCAL_P (arg)
2082 && ! DECL_DLLIMPORT_P (arg)
2086 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2090 return TREE_STATIC (arg) ? arg : NULL;
2097 /* If the thing being referenced is not a field, then it is
2098 something language specific. */
2099 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
2100 return (*lang_hooks.staticp) (arg);
2102 /* If we are referencing a bitfield, we can't evaluate an
2103 ADDR_EXPR at compile time and so it isn't a constant. */
2104 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2107 return staticp (TREE_OPERAND (arg, 0));
2112 case MISALIGNED_INDIRECT_REF:
2113 case ALIGN_INDIRECT_REF:
2115 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2118 case ARRAY_RANGE_REF:
2119 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2120 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2121 return staticp (TREE_OPERAND (arg, 0));
2126 if ((unsigned int) TREE_CODE (arg)
2127 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2128 return lang_hooks.staticp (arg);
2137 /* Return whether OP is a DECL whose address is function-invariant. */
2140 decl_address_invariant_p (const_tree op)
2142 /* The conditions below are slightly less strict than the one in
2145 switch (TREE_CODE (op))
2154 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2155 && !DECL_DLLIMPORT_P (op))
2156 || DECL_THREAD_LOCAL_P (op)
2157 || DECL_CONTEXT (op) == current_function_decl
2158 || decl_function_context (op) == current_function_decl)
2163 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2164 || decl_function_context (op) == current_function_decl)
2175 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2178 decl_address_ip_invariant_p (const_tree op)
2180 /* The conditions below are slightly less strict than the one in
2183 switch (TREE_CODE (op))
2191 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2192 && !DECL_DLLIMPORT_P (op))
2193 || DECL_THREAD_LOCAL_P (op))
2198 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2210 /* Return true if T is function-invariant (internal function, does
2211 not handle arithmetic; that's handled in skip_simple_arithmetic and
2212 tree_invariant_p). */
2214 static bool tree_invariant_p (tree t);
2217 tree_invariant_p_1 (tree t)
2221 if (TREE_CONSTANT (t)
2222 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2225 switch (TREE_CODE (t))
2231 op = TREE_OPERAND (t, 0);
2232 while (handled_component_p (op))
2234 switch (TREE_CODE (op))
2237 case ARRAY_RANGE_REF:
2238 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2239 || TREE_OPERAND (op, 2) != NULL_TREE
2240 || TREE_OPERAND (op, 3) != NULL_TREE)
2245 if (TREE_OPERAND (op, 2) != NULL_TREE)
2251 op = TREE_OPERAND (op, 0);
2254 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2263 /* Return true if T is function-invariant. */
2266 tree_invariant_p (tree t)
2268 tree inner = skip_simple_arithmetic (t);
2269 return tree_invariant_p_1 (inner);
2272 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2273 Do this to any expression which may be used in more than one place,
2274 but must be evaluated only once.
2276 Normally, expand_expr would reevaluate the expression each time.
2277 Calling save_expr produces something that is evaluated and recorded
2278 the first time expand_expr is called on it. Subsequent calls to
2279 expand_expr just reuse the recorded value.
2281 The call to expand_expr that generates code that actually computes
2282 the value is the first call *at compile time*. Subsequent calls
2283 *at compile time* generate code to use the saved value.
2284 This produces correct result provided that *at run time* control
2285 always flows through the insns made by the first expand_expr
2286 before reaching the other places where the save_expr was evaluated.
2287 You, the caller of save_expr, must make sure this is so.
2289 Constants, and certain read-only nodes, are returned with no
2290 SAVE_EXPR because that is safe. Expressions containing placeholders
2291 are not touched; see tree.def for an explanation of what these
2295 save_expr (tree expr)
2297 tree t = fold (expr);
2300 /* If the tree evaluates to a constant, then we don't want to hide that
2301 fact (i.e. this allows further folding, and direct checks for constants).
2302 However, a read-only object that has side effects cannot be bypassed.
2303 Since it is no problem to reevaluate literals, we just return the
2305 inner = skip_simple_arithmetic (t);
2306 if (TREE_CODE (inner) == ERROR_MARK)
2309 if (tree_invariant_p_1 (inner))
2312 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2313 it means that the size or offset of some field of an object depends on
2314 the value within another field.
2316 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2317 and some variable since it would then need to be both evaluated once and
2318 evaluated more than once. Front-ends must assure this case cannot
2319 happen by surrounding any such subexpressions in their own SAVE_EXPR
2320 and forcing evaluation at the proper time. */
2321 if (contains_placeholder_p (inner))
2324 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2326 /* This expression might be placed ahead of a jump to ensure that the
2327 value was computed on both sides of the jump. So make sure it isn't
2328 eliminated as dead. */
2329 TREE_SIDE_EFFECTS (t) = 1;
2333 /* Look inside EXPR and into any simple arithmetic operations. Return
2334 the innermost non-arithmetic node. */
2337 skip_simple_arithmetic (tree expr)
2341 /* We don't care about whether this can be used as an lvalue in this
2343 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2344 expr = TREE_OPERAND (expr, 0);
2346 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2347 a constant, it will be more efficient to not make another SAVE_EXPR since
2348 it will allow better simplification and GCSE will be able to merge the
2349 computations if they actually occur. */
2353 if (UNARY_CLASS_P (inner))
2354 inner = TREE_OPERAND (inner, 0);
2355 else if (BINARY_CLASS_P (inner))
2357 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2358 inner = TREE_OPERAND (inner, 0);
2359 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2360 inner = TREE_OPERAND (inner, 1);
2371 /* Return which tree structure is used by T. */
2373 enum tree_node_structure_enum
2374 tree_node_structure (const_tree t)
2376 const enum tree_code code = TREE_CODE (t);
2378 switch (TREE_CODE_CLASS (code))
2380 case tcc_declaration:
2385 return TS_FIELD_DECL;
2387 return TS_PARM_DECL;
2391 return TS_LABEL_DECL;
2393 return TS_RESULT_DECL;
2395 return TS_CONST_DECL;
2397 return TS_TYPE_DECL;
2399 return TS_FUNCTION_DECL;
2400 case SYMBOL_MEMORY_TAG:
2401 case NAME_MEMORY_TAG:
2402 case MEMORY_PARTITION_TAG:
2403 return TS_MEMORY_TAG;
2405 return TS_DECL_NON_COMMON;
2411 case tcc_comparison:
2414 case tcc_expression:
2418 default: /* tcc_constant and tcc_exceptional */
2423 /* tcc_constant cases. */
2424 case INTEGER_CST: return TS_INT_CST;
2425 case REAL_CST: return TS_REAL_CST;
2426 case FIXED_CST: return TS_FIXED_CST;
2427 case COMPLEX_CST: return TS_COMPLEX;
2428 case VECTOR_CST: return TS_VECTOR;
2429 case STRING_CST: return TS_STRING;
2430 /* tcc_exceptional cases. */
2431 case ERROR_MARK: return TS_COMMON;
2432 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2433 case TREE_LIST: return TS_LIST;
2434 case TREE_VEC: return TS_VEC;
2435 case SSA_NAME: return TS_SSA_NAME;
2436 case PLACEHOLDER_EXPR: return TS_COMMON;
2437 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2438 case BLOCK: return TS_BLOCK;
2439 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2440 case TREE_BINFO: return TS_BINFO;
2441 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2442 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
2443 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
2450 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2451 or offset that depends on a field within a record. */
2454 contains_placeholder_p (const_tree exp)
2456 enum tree_code code;
2461 code = TREE_CODE (exp);
2462 if (code == PLACEHOLDER_EXPR)
2465 switch (TREE_CODE_CLASS (code))
2468 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2469 position computations since they will be converted into a
2470 WITH_RECORD_EXPR involving the reference, which will assume
2471 here will be valid. */
2472 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2474 case tcc_exceptional:
2475 if (code == TREE_LIST)
2476 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2477 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2482 case tcc_comparison:
2483 case tcc_expression:
2487 /* Ignoring the first operand isn't quite right, but works best. */
2488 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2491 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2492 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2493 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2499 switch (TREE_CODE_LENGTH (code))
2502 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2504 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2505 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2516 const_call_expr_arg_iterator iter;
2517 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2518 if (CONTAINS_PLACEHOLDER_P (arg))
2532 /* Return true if any part of the computation of TYPE involves a
2533 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2534 (for QUAL_UNION_TYPE) and field positions. */
2537 type_contains_placeholder_1 (const_tree type)
2539 /* If the size contains a placeholder or the parent type (component type in
2540 the case of arrays) type involves a placeholder, this type does. */
2541 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2542 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2543 || (TREE_TYPE (type) != 0
2544 && type_contains_placeholder_p (TREE_TYPE (type))))
2547 /* Now do type-specific checks. Note that the last part of the check above
2548 greatly limits what we have to do below. */
2549 switch (TREE_CODE (type))
2557 case REFERENCE_TYPE:
2565 case FIXED_POINT_TYPE:
2566 /* Here we just check the bounds. */
2567 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2568 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2571 /* We're already checked the component type (TREE_TYPE), so just check
2573 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2577 case QUAL_UNION_TYPE:
2581 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2582 if (TREE_CODE (field) == FIELD_DECL
2583 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2584 || (TREE_CODE (type) == QUAL_UNION_TYPE
2585 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2586 || type_contains_placeholder_p (TREE_TYPE (field))))
2598 type_contains_placeholder_p (tree type)
2602 /* If the contains_placeholder_bits field has been initialized,
2603 then we know the answer. */
2604 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2605 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2607 /* Indicate that we've seen this type node, and the answer is false.
2608 This is what we want to return if we run into recursion via fields. */
2609 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2611 /* Compute the real value. */
2612 result = type_contains_placeholder_1 (type);
2614 /* Store the real value. */
2615 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2620 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2621 return a tree with all occurrences of references to F in a
2622 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2623 contains only arithmetic expressions or a CALL_EXPR with a
2624 PLACEHOLDER_EXPR occurring only in its arglist. */
2627 substitute_in_expr (tree exp, tree f, tree r)
2629 enum tree_code code = TREE_CODE (exp);
2630 tree op0, op1, op2, op3;
2631 tree new_tree, inner;
2633 /* We handle TREE_LIST and COMPONENT_REF separately. */
2634 if (code == TREE_LIST)
2636 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2637 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2638 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2641 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2643 else if (code == COMPONENT_REF)
2645 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2646 and it is the right field, replace it with R. */
2647 for (inner = TREE_OPERAND (exp, 0);
2648 REFERENCE_CLASS_P (inner);
2649 inner = TREE_OPERAND (inner, 0))
2651 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2652 && TREE_OPERAND (exp, 1) == f)
2655 /* If this expression hasn't been completed let, leave it alone. */
2656 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2659 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2660 if (op0 == TREE_OPERAND (exp, 0))
2663 new_tree = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2664 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2667 switch (TREE_CODE_CLASS (code))
2670 case tcc_declaration:
2673 case tcc_exceptional:
2676 case tcc_comparison:
2677 case tcc_expression:
2679 switch (TREE_CODE_LENGTH (code))
2685 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2686 if (op0 == TREE_OPERAND (exp, 0))
2689 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
2693 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2694 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2696 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2699 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2703 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2704 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2705 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2707 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2708 && op2 == TREE_OPERAND (exp, 2))
2711 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2715 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2716 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2717 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2718 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2720 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2721 && op2 == TREE_OPERAND (exp, 2)
2722 && op3 == TREE_OPERAND (exp, 3))
2725 new_tree = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2735 tree copy = NULL_TREE;
2738 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2740 tree op = TREE_OPERAND (exp, i);
2741 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
2745 copy = copy_node (exp);
2746 TREE_OPERAND (copy, i) = new_op;
2751 new_tree = fold (copy);
2761 TREE_READONLY (new_tree) = TREE_READONLY (exp);
2765 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2766 for it within OBJ, a tree that is an object or a chain of references. */
2769 substitute_placeholder_in_expr (tree exp, tree obj)
2771 enum tree_code code = TREE_CODE (exp);
2772 tree op0, op1, op2, op3;
2774 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2775 in the chain of OBJ. */
2776 if (code == PLACEHOLDER_EXPR)
2778 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2781 for (elt = obj; elt != 0;
2782 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2783 || TREE_CODE (elt) == COND_EXPR)
2784 ? TREE_OPERAND (elt, 1)
2785 : (REFERENCE_CLASS_P (elt)
2786 || UNARY_CLASS_P (elt)
2787 || BINARY_CLASS_P (elt)
2788 || VL_EXP_CLASS_P (elt)
2789 || EXPRESSION_CLASS_P (elt))
2790 ? TREE_OPERAND (elt, 0) : 0))
2791 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2794 for (elt = obj; elt != 0;
2795 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2796 || TREE_CODE (elt) == COND_EXPR)
2797 ? TREE_OPERAND (elt, 1)
2798 : (REFERENCE_CLASS_P (elt)
2799 || UNARY_CLASS_P (elt)
2800 || BINARY_CLASS_P (elt)
2801 || VL_EXP_CLASS_P (elt)
2802 || EXPRESSION_CLASS_P (elt))
2803 ? TREE_OPERAND (elt, 0) : 0))
2804 if (POINTER_TYPE_P (TREE_TYPE (elt))
2805 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2807 return fold_build1 (INDIRECT_REF, need_type, elt);
2809 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2810 survives until RTL generation, there will be an error. */
2814 /* TREE_LIST is special because we need to look at TREE_VALUE
2815 and TREE_CHAIN, not TREE_OPERANDS. */
2816 else if (code == TREE_LIST)
2818 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2819 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2820 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2823 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2826 switch (TREE_CODE_CLASS (code))
2829 case tcc_declaration:
2832 case tcc_exceptional:
2835 case tcc_comparison:
2836 case tcc_expression:
2839 switch (TREE_CODE_LENGTH (code))
2845 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2846 if (op0 == TREE_OPERAND (exp, 0))
2849 return fold_build1 (code, TREE_TYPE (exp), op0);
2852 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2853 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2855 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2858 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2861 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2862 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2863 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2865 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2866 && op2 == TREE_OPERAND (exp, 2))
2869 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2872 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2873 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2874 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2875 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2877 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2878 && op2 == TREE_OPERAND (exp, 2)
2879 && op3 == TREE_OPERAND (exp, 3))
2882 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2891 tree copy = NULL_TREE;
2894 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2896 tree op = TREE_OPERAND (exp, i);
2897 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2901 copy = copy_node (exp);
2902 TREE_OPERAND (copy, i) = new_op;
2917 /* Stabilize a reference so that we can use it any number of times
2918 without causing its operands to be evaluated more than once.
2919 Returns the stabilized reference. This works by means of save_expr,
2920 so see the caveats in the comments about save_expr.
2922 Also allows conversion expressions whose operands are references.
2923 Any other kind of expression is returned unchanged. */
2926 stabilize_reference (tree ref)
2929 enum tree_code code = TREE_CODE (ref);
2936 /* No action is needed in this case. */
2941 case FIX_TRUNC_EXPR:
2942 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2946 result = build_nt (INDIRECT_REF,
2947 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2951 result = build_nt (COMPONENT_REF,
2952 stabilize_reference (TREE_OPERAND (ref, 0)),
2953 TREE_OPERAND (ref, 1), NULL_TREE);
2957 result = build_nt (BIT_FIELD_REF,
2958 stabilize_reference (TREE_OPERAND (ref, 0)),
2959 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2960 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2964 result = build_nt (ARRAY_REF,
2965 stabilize_reference (TREE_OPERAND (ref, 0)),
2966 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2967 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2970 case ARRAY_RANGE_REF:
2971 result = build_nt (ARRAY_RANGE_REF,
2972 stabilize_reference (TREE_OPERAND (ref, 0)),
2973 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2974 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2978 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2979 it wouldn't be ignored. This matters when dealing with
2981 return stabilize_reference_1 (ref);
2983 /* If arg isn't a kind of lvalue we recognize, make no change.
2984 Caller should recognize the error for an invalid lvalue. */
2989 return error_mark_node;
2992 TREE_TYPE (result) = TREE_TYPE (ref);
2993 TREE_READONLY (result) = TREE_READONLY (ref);
2994 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2995 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3000 /* Subroutine of stabilize_reference; this is called for subtrees of
3001 references. Any expression with side-effects must be put in a SAVE_EXPR
3002 to ensure that it is only evaluated once.
3004 We don't put SAVE_EXPR nodes around everything, because assigning very
3005 simple expressions to temporaries causes us to miss good opportunities
3006 for optimizations. Among other things, the opportunity to fold in the
3007 addition of a constant into an addressing mode often gets lost, e.g.
3008 "y[i+1] += x;". In general, we take the approach that we should not make
3009 an assignment unless we are forced into it - i.e., that any non-side effect
3010 operator should be allowed, and that cse should take care of coalescing
3011 multiple utterances of the same expression should that prove fruitful. */
3014 stabilize_reference_1 (tree e)
3017 enum tree_code code = TREE_CODE (e);
3019 /* We cannot ignore const expressions because it might be a reference
3020 to a const array but whose index contains side-effects. But we can
3021 ignore things that are actual constant or that already have been
3022 handled by this function. */
3024 if (tree_invariant_p (e))
3027 switch (TREE_CODE_CLASS (code))
3029 case tcc_exceptional:
3031 case tcc_declaration:
3032 case tcc_comparison:
3034 case tcc_expression:
3037 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3038 so that it will only be evaluated once. */
3039 /* The reference (r) and comparison (<) classes could be handled as
3040 below, but it is generally faster to only evaluate them once. */
3041 if (TREE_SIDE_EFFECTS (e))
3042 return save_expr (e);
3046 /* Constants need no processing. In fact, we should never reach
3051 /* Division is slow and tends to be compiled with jumps,
3052 especially the division by powers of 2 that is often
3053 found inside of an array reference. So do it just once. */
3054 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3055 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3056 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3057 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3058 return save_expr (e);
3059 /* Recursively stabilize each operand. */
3060 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3061 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3065 /* Recursively stabilize each operand. */
3066 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3073 TREE_TYPE (result) = TREE_TYPE (e);
3074 TREE_READONLY (result) = TREE_READONLY (e);
3075 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3076 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3081 /* Low-level constructors for expressions. */
3083 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3084 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3087 recompute_tree_invariant_for_addr_expr (tree t)
3090 bool tc = true, se = false;
3092 /* We started out assuming this address is both invariant and constant, but
3093 does not have side effects. Now go down any handled components and see if
3094 any of them involve offsets that are either non-constant or non-invariant.
3095 Also check for side-effects.
3097 ??? Note that this code makes no attempt to deal with the case where
3098 taking the address of something causes a copy due to misalignment. */
3100 #define UPDATE_FLAGS(NODE) \
3101 do { tree _node = (NODE); \
3102 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3103 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3105 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3106 node = TREE_OPERAND (node, 0))
3108 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3109 array reference (probably made temporarily by the G++ front end),
3110 so ignore all the operands. */
3111 if ((TREE_CODE (node) == ARRAY_REF
3112 || TREE_CODE (node) == ARRAY_RANGE_REF)
3113 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3115 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3116 if (TREE_OPERAND (node, 2))
3117 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3118 if (TREE_OPERAND (node, 3))
3119 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3121 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3122 FIELD_DECL, apparently. The G++ front end can put something else
3123 there, at least temporarily. */
3124 else if (TREE_CODE (node) == COMPONENT_REF
3125 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3127 if (TREE_OPERAND (node, 2))
3128 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3130 else if (TREE_CODE (node) == BIT_FIELD_REF)
3131 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3134 node = lang_hooks.expr_to_decl (node, &tc, &se);
3136 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3137 the address, since &(*a)->b is a form of addition. If it's a constant, the
3138 address is constant too. If it's a decl, its address is constant if the
3139 decl is static. Everything else is not constant and, furthermore,
3140 taking the address of a volatile variable is not volatile. */
3141 if (TREE_CODE (node) == INDIRECT_REF)
3142 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3143 else if (CONSTANT_CLASS_P (node))
3145 else if (DECL_P (node))
3146 tc &= (staticp (node) != NULL_TREE);
3150 se |= TREE_SIDE_EFFECTS (node);
3154 TREE_CONSTANT (t) = tc;
3155 TREE_SIDE_EFFECTS (t) = se;
3159 /* Build an expression of code CODE, data type TYPE, and operands as
3160 specified. Expressions and reference nodes can be created this way.
3161 Constants, decls, types and misc nodes cannot be.
3163 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3164 enough for all extant tree codes. */
3167 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3171 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3173 t = make_node_stat (code PASS_MEM_STAT);
3180 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3182 int length = sizeof (struct tree_exp);
3183 #ifdef GATHER_STATISTICS
3184 tree_node_kind kind;
3188 #ifdef GATHER_STATISTICS
3189 switch (TREE_CODE_CLASS (code))
3191 case tcc_statement: /* an expression with side effects */
3194 case tcc_reference: /* a reference */
3202 tree_node_counts[(int) kind]++;
3203 tree_node_sizes[(int) kind] += length;
3206 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3208 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3210 memset (t, 0, sizeof (struct tree_common));
3212 TREE_SET_CODE (t, code);
3214 TREE_TYPE (t) = type;
3215 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3216 TREE_OPERAND (t, 0) = node;
3217 TREE_BLOCK (t) = NULL_TREE;
3218 if (node && !TYPE_P (node))
3220 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3221 TREE_READONLY (t) = TREE_READONLY (node);
3224 if (TREE_CODE_CLASS (code) == tcc_statement)
3225 TREE_SIDE_EFFECTS (t) = 1;
3229 /* All of these have side-effects, no matter what their
3231 TREE_SIDE_EFFECTS (t) = 1;
3232 TREE_READONLY (t) = 0;
3235 case MISALIGNED_INDIRECT_REF:
3236 case ALIGN_INDIRECT_REF:
3238 /* Whether a dereference is readonly has nothing to do with whether
3239 its operand is readonly. */
3240 TREE_READONLY (t) = 0;
3245 recompute_tree_invariant_for_addr_expr (t);
3249 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3250 && node && !TYPE_P (node)
3251 && TREE_CONSTANT (node))
3252 TREE_CONSTANT (t) = 1;
3253 if (TREE_CODE_CLASS (code) == tcc_reference
3254 && node && TREE_THIS_VOLATILE (node))
3255 TREE_THIS_VOLATILE (t) = 1;
3262 #define PROCESS_ARG(N) \
3264 TREE_OPERAND (t, N) = arg##N; \
3265 if (arg##N &&!TYPE_P (arg##N)) \
3267 if (TREE_SIDE_EFFECTS (arg##N)) \
3269 if (!TREE_READONLY (arg##N)) \
3271 if (!TREE_CONSTANT (arg##N)) \
3277 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3279 bool constant, read_only, side_effects;
3282 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3284 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3285 && arg0 && arg1 && tt && POINTER_TYPE_P (tt))
3286 gcc_assert (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST);
3288 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3289 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3290 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3291 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3293 t = make_node_stat (code PASS_MEM_STAT);
3296 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3297 result based on those same flags for the arguments. But if the
3298 arguments aren't really even `tree' expressions, we shouldn't be trying
3301 /* Expressions without side effects may be constant if their
3302 arguments are as well. */
3303 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3304 || TREE_CODE_CLASS (code) == tcc_binary);
3306 side_effects = TREE_SIDE_EFFECTS (t);
3311 TREE_READONLY (t) = read_only;
3312 TREE_CONSTANT (t) = constant;
3313 TREE_SIDE_EFFECTS (t) = side_effects;
3314 TREE_THIS_VOLATILE (t)
3315 = (TREE_CODE_CLASS (code) == tcc_reference
3316 && arg0 && TREE_THIS_VOLATILE (arg0));
3323 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3324 tree arg2 MEM_STAT_DECL)
3326 bool constant, read_only, side_effects;
3329 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3330 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3332 t = make_node_stat (code PASS_MEM_STAT);
3335 /* As a special exception, if COND_EXPR has NULL branches, we
3336 assume that it is a gimple statement and always consider
3337 it to have side effects. */
3338 if (code == COND_EXPR
3339 && tt == void_type_node
3340 && arg1 == NULL_TREE
3341 && arg2 == NULL_TREE)
3342 side_effects = true;
3344 side_effects = TREE_SIDE_EFFECTS (t);
3350 TREE_SIDE_EFFECTS (t) = side_effects;
3351 TREE_THIS_VOLATILE (t)
3352 = (TREE_CODE_CLASS (code) == tcc_reference
3353 && arg0 && TREE_THIS_VOLATILE (arg0));
3359 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3360 tree arg2, tree arg3 MEM_STAT_DECL)
3362 bool constant, read_only, side_effects;
3365 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3367 t = make_node_stat (code PASS_MEM_STAT);
3370 side_effects = TREE_SIDE_EFFECTS (t);
3377 TREE_SIDE_EFFECTS (t) = side_effects;
3378 TREE_THIS_VOLATILE (t)
3379 = (TREE_CODE_CLASS (code) == tcc_reference
3380 && arg0 && TREE_THIS_VOLATILE (arg0));
3386 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3387 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3389 bool constant, read_only, side_effects;
3392 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3394 t = make_node_stat (code PASS_MEM_STAT);
3397 side_effects = TREE_SIDE_EFFECTS (t);
3405 TREE_SIDE_EFFECTS (t) = side_effects;
3406 TREE_THIS_VOLATILE (t)
3407 = (TREE_CODE_CLASS (code) == tcc_reference
3408 && arg0 && TREE_THIS_VOLATILE (arg0));
3414 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3415 tree arg2, tree arg3, tree arg4, tree arg5,
3416 tree arg6 MEM_STAT_DECL)
3418 bool constant, read_only, side_effects;
3421 gcc_assert (code == TARGET_MEM_REF);
3423 t = make_node_stat (code PASS_MEM_STAT);
3426 side_effects = TREE_SIDE_EFFECTS (t);
3436 TREE_SIDE_EFFECTS (t) = side_effects;
3437 TREE_THIS_VOLATILE (t) = 0;
3442 /* Similar except don't specify the TREE_TYPE
3443 and leave the TREE_SIDE_EFFECTS as 0.
3444 It is permissible for arguments to be null,
3445 or even garbage if their values do not matter. */
3448 build_nt (enum tree_code code, ...)
3455 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3459 t = make_node (code);
3460 length = TREE_CODE_LENGTH (code);
3462 for (i = 0; i < length; i++)
3463 TREE_OPERAND (t, i) = va_arg (p, tree);
3469 /* Similar to build_nt, but for creating a CALL_EXPR object with
3470 ARGLIST passed as a list. */
3473 build_nt_call_list (tree fn, tree arglist)
3478 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3479 CALL_EXPR_FN (t) = fn;
3480 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3481 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3482 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3486 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3487 We do NOT enter this node in any sort of symbol table.
3489 layout_decl is used to set up the decl's storage layout.
3490 Other slots are initialized to 0 or null pointers. */
3493 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3497 t = make_node_stat (code PASS_MEM_STAT);
3499 /* if (type == error_mark_node)
3500 type = integer_type_node; */
3501 /* That is not done, deliberately, so that having error_mark_node
3502 as the type can suppress useless errors in the use of this variable. */
3504 DECL_NAME (t) = name;
3505 TREE_TYPE (t) = type;
3507 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3513 /* Builds and returns function declaration with NAME and TYPE. */
3516 build_fn_decl (const char *name, tree type)
3518 tree id = get_identifier (name);
3519 tree decl = build_decl (FUNCTION_DECL, id, type);
3521 DECL_EXTERNAL (decl) = 1;
3522 TREE_PUBLIC (decl) = 1;
3523 DECL_ARTIFICIAL (decl) = 1;
3524 TREE_NOTHROW (decl) = 1;
3530 /* BLOCK nodes are used to represent the structure of binding contours
3531 and declarations, once those contours have been exited and their contents
3532 compiled. This information is used for outputting debugging info. */
3535 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3537 tree block = make_node (BLOCK);
3539 BLOCK_VARS (block) = vars;
3540 BLOCK_SUBBLOCKS (block) = subblocks;
3541 BLOCK_SUPERCONTEXT (block) = supercontext;
3542 BLOCK_CHAIN (block) = chain;
3547 expand_location (source_location loc)
3549 expanded_location xloc;
3559 const struct line_map *map = linemap_lookup (line_table, loc);
3560 xloc.file = map->to_file;
3561 xloc.line = SOURCE_LINE (map, loc);
3562 xloc.column = SOURCE_COLUMN (map, loc);
3563 xloc.sysp = map->sysp != 0;
3569 /* Source location accessor functions. */
3573 set_expr_locus (tree node, source_location *loc)
3576 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3578 EXPR_CHECK (node)->exp.locus = *loc;
3581 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3583 LOC is the location to use in tree T. */
3585 void protected_set_expr_location (tree t, location_t loc)
3587 if (t && t != error_mark_node && CAN_HAVE_LOCATION_P (t))
3588 SET_EXPR_LOCATION (t, loc);
3591 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3595 build_decl_attribute_variant (tree ddecl, tree attribute)
3597 DECL_ATTRIBUTES (ddecl) = attribute;
3601 /* Borrowed from hashtab.c iterative_hash implementation. */
3602 #define mix(a,b,c) \
3604 a -= b; a -= c; a ^= (c>>13); \
3605 b -= c; b -= a; b ^= (a<< 8); \
3606 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3607 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3608 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3609 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3610 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3611 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3612 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3616 /* Produce good hash value combining VAL and VAL2. */
3618 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3620 /* the golden ratio; an arbitrary value. */
3621 hashval_t a = 0x9e3779b9;
3627 /* Produce good hash value combining PTR and VAL2. */
3628 static inline hashval_t
3629 iterative_hash_pointer (const void *ptr, hashval_t val2)
3631 if (sizeof (ptr) == sizeof (hashval_t))
3632 return iterative_hash_hashval_t ((size_t) ptr, val2);
3635 hashval_t a = (hashval_t) (size_t) ptr;
3636 /* Avoid warnings about shifting of more than the width of the type on
3637 hosts that won't execute this path. */
3639 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3645 /* Produce good hash value combining VAL and VAL2. */
3646 static inline hashval_t
3647 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3649 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3650 return iterative_hash_hashval_t (val, val2);
3653 hashval_t a = (hashval_t) val;
3654 /* Avoid warnings about shifting of more than the width of the type on
3655 hosts that won't execute this path. */
3657 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3659 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3661 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3662 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3669 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3670 is ATTRIBUTE and its qualifiers are QUALS.
3672 Record such modified types already made so we don't make duplicates. */
3675 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3677 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3679 hashval_t hashcode = 0;
3681 enum tree_code code = TREE_CODE (ttype);
3683 /* Building a distinct copy of a tagged type is inappropriate; it
3684 causes breakage in code that expects there to be a one-to-one
3685 relationship between a struct and its fields.
3686 build_duplicate_type is another solution (as used in
3687 handle_transparent_union_attribute), but that doesn't play well
3688 with the stronger C++ type identity model. */
3689 if (TREE_CODE (ttype) == RECORD_TYPE
3690 || TREE_CODE (ttype) == UNION_TYPE
3691 || TREE_CODE (ttype) == QUAL_UNION_TYPE
3692 || TREE_CODE (ttype) == ENUMERAL_TYPE)
3694 warning (OPT_Wattributes,
3695 "ignoring attributes applied to %qT after definition",
3696 TYPE_MAIN_VARIANT (ttype));
3697 return build_qualified_type (ttype, quals);
3700 ntype = build_distinct_type_copy (ttype);
3702 TYPE_ATTRIBUTES (ntype) = attribute;
3703 set_type_quals (ntype, TYPE_UNQUALIFIED);
3705 hashcode = iterative_hash_object (code, hashcode);
3706 if (TREE_TYPE (ntype))
3707 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3709 hashcode = attribute_hash_list (attribute, hashcode);
3711 switch (TREE_CODE (ntype))
3714 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3717 if (TYPE_DOMAIN (ntype))
3718 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3722 hashcode = iterative_hash_object
3723 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3724 hashcode = iterative_hash_object
3725 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3728 case FIXED_POINT_TYPE:
3730 unsigned int precision = TYPE_PRECISION (ntype);
3731 hashcode = iterative_hash_object (precision, hashcode);
3738 ntype = type_hash_canon (hashcode, ntype);
3740 /* If the target-dependent attributes make NTYPE different from
3741 its canonical type, we will need to use structural equality
3742 checks for this qualified type. */
3743 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
3744 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
3745 || !targetm.comp_type_attributes (ntype, ttype))
3746 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3748 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
3750 ttype = build_qualified_type (ntype, quals);
3752 else if (TYPE_QUALS (ttype) != quals)
3753 ttype = build_qualified_type (ttype, quals);
3759 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3762 Record such modified types already made so we don't make duplicates. */
3765 build_type_attribute_variant (tree ttype, tree attribute)
3767 return build_type_attribute_qual_variant (ttype, attribute,
3768 TYPE_QUALS (ttype));
3771 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3774 We try both `text' and `__text__', ATTR may be either one. */
3775 /* ??? It might be a reasonable simplification to require ATTR to be only
3776 `text'. One might then also require attribute lists to be stored in
3777 their canonicalized form. */
3780 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
3785 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3788 p = IDENTIFIER_POINTER (ident);
3789 ident_len = IDENTIFIER_LENGTH (ident);
3791 if (ident_len == attr_len
3792 && strcmp (attr, p) == 0)
3795 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3798 gcc_assert (attr[1] == '_');
3799 gcc_assert (attr[attr_len - 2] == '_');
3800 gcc_assert (attr[attr_len - 1] == '_');
3801 if (ident_len == attr_len - 4
3802 && strncmp (attr + 2, p, attr_len - 4) == 0)
3807 if (ident_len == attr_len + 4
3808 && p[0] == '_' && p[1] == '_'
3809 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3810 && strncmp (attr, p + 2, attr_len) == 0)
3817 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3820 We try both `text' and `__text__', ATTR may be either one. */
3823 is_attribute_p (const char *attr, const_tree ident)
3825 return is_attribute_with_length_p (attr, strlen (attr), ident);
3828 /* Given an attribute name and a list of attributes, return a pointer to the
3829 attribute's list element if the attribute is part of the list, or NULL_TREE
3830 if not found. If the attribute appears more than once, this only
3831 returns the first occurrence; the TREE_CHAIN of the return value should
3832 be passed back in if further occurrences are wanted. */
3835 lookup_attribute (const char *attr_name, tree list)
3838 size_t attr_len = strlen (attr_name);
3840 for (l = list; l; l = TREE_CHAIN (l))
3842 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3843 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3849 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3853 remove_attribute (const char *attr_name, tree list)
3856 size_t attr_len = strlen (attr_name);
3858 for (p = &list; *p; )
3861 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3862 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3863 *p = TREE_CHAIN (l);
3865 p = &TREE_CHAIN (l);
3871 /* Return an attribute list that is the union of a1 and a2. */
3874 merge_attributes (tree a1, tree a2)
3878 /* Either one unset? Take the set one. */
3880 if ((attributes = a1) == 0)
3883 /* One that completely contains the other? Take it. */
3885 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3887 if (attribute_list_contained (a2, a1))
3891 /* Pick the longest list, and hang on the other list. */
3893 if (list_length (a1) < list_length (a2))
3894 attributes = a2, a2 = a1;
3896 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3899 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3902 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3905 if (TREE_VALUE (a) != NULL
3906 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3907 && TREE_VALUE (a2) != NULL
3908 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3910 if (simple_cst_list_equal (TREE_VALUE (a),
3911 TREE_VALUE (a2)) == 1)
3914 else if (simple_cst_equal (TREE_VALUE (a),
3915 TREE_VALUE (a2)) == 1)
3920 a1 = copy_node (a2);
3921 TREE_CHAIN (a1) = attributes;
3930 /* Given types T1 and T2, merge their attributes and return
3934 merge_type_attributes (tree t1, tree t2)
3936 return merge_attributes (TYPE_ATTRIBUTES (t1),
3937 TYPE_ATTRIBUTES (t2));
3940 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3944 merge_decl_attributes (tree olddecl, tree newdecl)
3946 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3947 DECL_ATTRIBUTES (newdecl));
3950 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3952 /* Specialization of merge_decl_attributes for various Windows targets.
3954 This handles the following situation:
3956 __declspec (dllimport) int foo;
3959 The second instance of `foo' nullifies the dllimport. */
3962 merge_dllimport_decl_attributes (tree old, tree new_tree)
3965 int delete_dllimport_p = 1;
3967 /* What we need to do here is remove from `old' dllimport if it doesn't
3968 appear in `new'. dllimport behaves like extern: if a declaration is
3969 marked dllimport and a definition appears later, then the object
3970 is not dllimport'd. We also remove a `new' dllimport if the old list
3971 contains dllexport: dllexport always overrides dllimport, regardless
3972 of the order of declaration. */
3973 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
3974 delete_dllimport_p = 0;
3975 else if (DECL_DLLIMPORT_P (new_tree)
3976 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3978 DECL_DLLIMPORT_P (new_tree) = 0;
3979 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3980 "dllimport ignored", new_tree);
3982 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
3984 /* Warn about overriding a symbol that has already been used, e.g.:
3985 extern int __attribute__ ((dllimport)) foo;
3986 int* bar () {return &foo;}
3989 if (TREE_USED (old))
3991 warning (0, "%q+D redeclared without dllimport attribute "
3992 "after being referenced with dll linkage", new_tree);
3993 /* If we have used a variable's address with dllimport linkage,
3994 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3995 decl may already have had TREE_CONSTANT computed.
3996 We still remove the attribute so that assembler code refers
3997 to '&foo rather than '_imp__foo'. */
3998 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3999 DECL_DLLIMPORT_P (new_tree) = 1;
4002 /* Let an inline definition silently override the external reference,
4003 but otherwise warn about attribute inconsistency. */
4004 else if (TREE_CODE (new_tree) == VAR_DECL
4005 || !DECL_DECLARED_INLINE_P (new_tree))
4006 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
4007 "previous dllimport ignored", new_tree);
4010 delete_dllimport_p = 0;
4012 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
4014 if (delete_dllimport_p)
4017 const size_t attr_len = strlen ("dllimport");
4019 /* Scan the list for dllimport and delete it. */
4020 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
4022 if (is_attribute_with_length_p ("dllimport", attr_len,
4025 if (prev == NULL_TREE)
4028 TREE_CHAIN (prev) = TREE_CHAIN (t);
4037 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4038 struct attribute_spec.handler. */
4041 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
4046 /* These attributes may apply to structure and union types being created,
4047 but otherwise should pass to the declaration involved. */
4050 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
4051 | (int) ATTR_FLAG_ARRAY_NEXT))
4053 *no_add_attrs = true;
4054 return tree_cons (name, args, NULL_TREE);
4056 if (TREE_CODE (node) == RECORD_TYPE
4057 || TREE_CODE (node) == UNION_TYPE)
4059 node = TYPE_NAME (node);
4065 warning (OPT_Wattributes, "%qs attribute ignored",
4066 IDENTIFIER_POINTER (name));
4067 *no_add_attrs = true;
4072 if (TREE_CODE (node) != FUNCTION_DECL
4073 && TREE_CODE (node) != VAR_DECL
4074 && TREE_CODE (node) != TYPE_DECL)
4076 *no_add_attrs = true;
4077 warning (OPT_Wattributes, "%qs attribute ignored",
4078 IDENTIFIER_POINTER (name));
4082 if (TREE_CODE (node) == TYPE_DECL
4083 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
4084 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
4086 *no_add_attrs = true;
4087 warning (OPT_Wattributes, "%qs attribute ignored",
4088 IDENTIFIER_POINTER (name));
4092 /* Report error on dllimport ambiguities seen now before they cause
4094 else if (is_attribute_p ("dllimport", name))
4096 /* Honor any target-specific overrides. */
4097 if (!targetm.valid_dllimport_attribute_p (node))
4098 *no_add_attrs = true;
4100 else if (TREE_CODE (node) == FUNCTION_DECL
4101 && DECL_DECLARED_INLINE_P (node))
4103 warning (OPT_Wattributes, "inline function %q+D declared as "
4104 " dllimport: attribute ignored", node);
4105 *no_add_attrs = true;
4107 /* Like MS, treat definition of dllimported variables and
4108 non-inlined functions on declaration as syntax errors. */
4109 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4111 error ("function %q+D definition is marked dllimport", node);
4112 *no_add_attrs = true;
4115 else if (TREE_CODE (node) == VAR_DECL)
4117 if (DECL_INITIAL (node))
4119 error ("variable %q+D definition is marked dllimport",
4121 *no_add_attrs = true;
4124 /* `extern' needn't be specified with dllimport.
4125 Specify `extern' now and hope for the best. Sigh. */
4126 DECL_EXTERNAL (node) = 1;
4127 /* Also, implicitly give dllimport'd variables declared within
4128 a function global scope, unless declared static. */
4129 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4130 TREE_PUBLIC (node) = 1;
4133 if (*no_add_attrs == false)
4134 DECL_DLLIMPORT_P (node) = 1;
4137 /* Report error if symbol is not accessible at global scope. */
4138 if (!TREE_PUBLIC (node)
4139 && (TREE_CODE (node) == VAR_DECL
4140 || TREE_CODE (node) == FUNCTION_DECL))
4142 error ("external linkage required for symbol %q+D because of "
4143 "%qs attribute", node, IDENTIFIER_POINTER (name));
4144 *no_add_attrs = true;
4147 /* A dllexport'd entity must have default visibility so that other
4148 program units (shared libraries or the main executable) can see
4149 it. A dllimport'd entity must have default visibility so that
4150 the linker knows that undefined references within this program
4151 unit can be resolved by the dynamic linker. */
4154 if (DECL_VISIBILITY_SPECIFIED (node)
4155 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
4156 error ("%qs implies default visibility, but %qD has already "
4157 "been declared with a different visibility",
4158 IDENTIFIER_POINTER (name), node);
4159 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
4160 DECL_VISIBILITY_SPECIFIED (node) = 1;
4166 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4168 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4169 of the various TYPE_QUAL values. */
4172 set_type_quals (tree type, int type_quals)
4174 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4175 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4176 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4179 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4182 check_qualified_type (const_tree cand, const_tree base, int type_quals)
4184 return (TYPE_QUALS (cand) == type_quals
4185 && TYPE_NAME (cand) == TYPE_NAME (base)
4186 /* Apparently this is needed for Objective-C. */
4187 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4188 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4189 TYPE_ATTRIBUTES (base)));
4192 /* Return a version of the TYPE, qualified as indicated by the
4193 TYPE_QUALS, if one exists. If no qualified version exists yet,
4194 return NULL_TREE. */
4197 get_qualified_type (tree type, int type_quals)
4201 if (TYPE_QUALS (type) == type_quals)
4204 /* Search the chain of variants to see if there is already one there just
4205 like the one we need to have. If so, use that existing one. We must
4206 preserve the TYPE_NAME, since there is code that depends on this. */
4207 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4208 if (check_qualified_type (t, type, type_quals))
4214 /* Like get_qualified_type, but creates the type if it does not
4215 exist. This function never returns NULL_TREE. */
4218 build_qualified_type (tree type, int type_quals)
4222 /* See if we already have the appropriate qualified variant. */
4223 t = get_qualified_type (type, type_quals);
4225 /* If not, build it. */
4228 t = build_variant_type_copy (type);
4229 set_type_quals (t, type_quals);
4231 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4232 /* Propagate structural equality. */
4233 SET_TYPE_STRUCTURAL_EQUALITY (t);
4234 else if (TYPE_CANONICAL (type) != type)
4235 /* Build the underlying canonical type, since it is different
4237 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4240 /* T is its own canonical type. */
4241 TYPE_CANONICAL (t) = t;
4248 /* Create a new distinct copy of TYPE. The new type is made its own
4249 MAIN_VARIANT. If TYPE requires structural equality checks, the
4250 resulting type requires structural equality checks; otherwise, its
4251 TYPE_CANONICAL points to itself. */
4254 build_distinct_type_copy (tree type)
4256 tree t = copy_node (type);
4258 TYPE_POINTER_TO (t) = 0;
4259 TYPE_REFERENCE_TO (t) = 0;
4261 /* Set the canonical type either to a new equivalence class, or
4262 propagate the need for structural equality checks. */
4263 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4264 SET_TYPE_STRUCTURAL_EQUALITY (t);
4266 TYPE_CANONICAL (t) = t;
4268 /* Make it its own variant. */
4269 TYPE_MAIN_VARIANT (t) = t;
4270 TYPE_NEXT_VARIANT (t) = 0;
4272 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4273 whose TREE_TYPE is not t. This can also happen in the Ada
4274 frontend when using subtypes. */
4279 /* Create a new variant of TYPE, equivalent but distinct. This is so
4280 the caller can modify it. TYPE_CANONICAL for the return type will
4281 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4282 are considered equal by the language itself (or that both types
4283 require structural equality checks). */
4286 build_variant_type_copy (tree type)
4288 tree t, m = TYPE_MAIN_VARIANT (type);
4290 t = build_distinct_type_copy (type);
4292 /* Since we're building a variant, assume that it is a non-semantic
4293 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4294 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4296 /* Add the new type to the chain of variants of TYPE. */
4297 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4298 TYPE_NEXT_VARIANT (m) = t;
4299 TYPE_MAIN_VARIANT (t) = m;
4304 /* Return true if the from tree in both tree maps are equal. */
4307 tree_map_base_eq (const void *va, const void *vb)
4309 const struct tree_map_base *const a = (const struct tree_map_base *) va,
4310 *const b = (const struct tree_map_base *) vb;
4311 return (a->from == b->from);
4314 /* Hash a from tree in a tree_map. */
4317 tree_map_base_hash (const void *item)
4319 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4322 /* Return true if this tree map structure is marked for garbage collection
4323 purposes. We simply return true if the from tree is marked, so that this
4324 structure goes away when the from tree goes away. */
4327 tree_map_base_marked_p (const void *p)
4329 return ggc_marked_p (((const struct tree_map_base *) p)->from);
4333 tree_map_hash (const void *item)
4335 return (((const struct tree_map *) item)->hash);
4338 /* Return the initialization priority for DECL. */
4341 decl_init_priority_lookup (tree decl)
4343 struct tree_priority_map *h;
4344 struct tree_map_base in;
4346 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4348 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4349 return h ? h->init : DEFAULT_INIT_PRIORITY;
4352 /* Return the finalization priority for DECL. */
4355 decl_fini_priority_lookup (tree decl)
4357 struct tree_priority_map *h;
4358 struct tree_map_base in;
4360 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4362 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4363 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4366 /* Return the initialization and finalization priority information for
4367 DECL. If there is no previous priority information, a freshly
4368 allocated structure is returned. */
4370 static struct tree_priority_map *
4371 decl_priority_info (tree decl)
4373 struct tree_priority_map in;
4374 struct tree_priority_map *h;
4377 in.base.from = decl;
4378 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4379 h = (struct tree_priority_map *) *loc;
4382 h = GGC_CNEW (struct tree_priority_map);
4384 h->base.from = decl;
4385 h->init = DEFAULT_INIT_PRIORITY;
4386 h->fini = DEFAULT_INIT_PRIORITY;
4392 /* Set the initialization priority for DECL to PRIORITY. */
4395 decl_init_priority_insert (tree decl, priority_type priority)
4397 struct tree_priority_map *h;
4399 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4400 h = decl_priority_info (decl);
4404 /* Set the finalization priority for DECL to PRIORITY. */
4407 decl_fini_priority_insert (tree decl, priority_type priority)
4409 struct tree_priority_map *h;
4411 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4412 h = decl_priority_info (decl);
4416 /* Look up a restrict qualified base decl for FROM. */
4419 decl_restrict_base_lookup (tree from)
4424 in.base.from = from;
4425 h = (struct tree_map *) htab_find_with_hash (restrict_base_for_decl, &in,
4426 htab_hash_pointer (from));
4427 return h ? h->to : NULL_TREE;
4430 /* Record the restrict qualified base TO for FROM. */
4433 decl_restrict_base_insert (tree from, tree to)
4438 h = GGC_NEW (struct tree_map);
4439 h->hash = htab_hash_pointer (from);
4440 h->base.from = from;
4442 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4443 *(struct tree_map **) loc = h;
4446 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4449 print_debug_expr_statistics (void)
4451 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4452 (long) htab_size (debug_expr_for_decl),
4453 (long) htab_elements (debug_expr_for_decl),
4454 htab_collisions (debug_expr_for_decl));
4457 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4460 print_value_expr_statistics (void)
4462 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4463 (long) htab_size (value_expr_for_decl),
4464 (long) htab_elements (value_expr_for_decl),
4465 htab_collisions (value_expr_for_decl));
4468 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4469 don't print anything if the table is empty. */
4472 print_restrict_base_statistics (void)
4474 if (htab_elements (restrict_base_for_decl) != 0)
4476 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4477 (long) htab_size (restrict_base_for_decl),
4478 (long) htab_elements (restrict_base_for_decl),
4479 htab_collisions (restrict_base_for_decl));
4482 /* Lookup a debug expression for FROM, and return it if we find one. */
4485 decl_debug_expr_lookup (tree from)
4487 struct tree_map *h, in;
4488 in.base.from = from;
4490 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
4491 htab_hash_pointer (from));
4497 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4500 decl_debug_expr_insert (tree from, tree to)
4505 h = GGC_NEW (struct tree_map);
4506 h->hash = htab_hash_pointer (from);
4507 h->base.from = from;
4509 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4510 *(struct tree_map **) loc = h;
4513 /* Lookup a value expression for FROM, and return it if we find one. */
4516 decl_value_expr_lookup (tree from)
4518 struct tree_map *h, in;
4519 in.base.from = from;
4521 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
4522 htab_hash_pointer (from));
4528 /* Insert a mapping FROM->TO in the value expression hashtable. */
4531 decl_value_expr_insert (tree from, tree to)
4536 h = GGC_NEW (struct tree_map);
4537 h->hash = htab_hash_pointer (from);
4538 h->base.from = from;
4540 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4541 *(struct tree_map **) loc = h;
4544 /* Hashing of types so that we don't make duplicates.
4545 The entry point is `type_hash_canon'. */
4547 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4548 with types in the TREE_VALUE slots), by adding the hash codes
4549 of the individual types. */
4552 type_hash_list (const_tree list, hashval_t hashcode)
4556 for (tail = list; tail; tail = TREE_CHAIN (tail))
4557 if (TREE_VALUE (tail) != error_mark_node)
4558 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4564 /* These are the Hashtable callback functions. */
4566 /* Returns true iff the types are equivalent. */
4569 type_hash_eq (const void *va, const void *vb)
4571 const struct type_hash *const a = (const struct type_hash *) va,
4572 *const b = (const struct type_hash *) vb;
4574 /* First test the things that are the same for all types. */
4575 if (a->hash != b->hash
4576 || TREE_CODE (a->type) != TREE_CODE (b->type)
4577 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4578 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4579 TYPE_ATTRIBUTES (b->type))
4580 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4581 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4584 switch (TREE_CODE (a->type))
4589 case REFERENCE_TYPE:
4593 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4596 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4597 && !(TYPE_VALUES (a->type)
4598 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4599 && TYPE_VALUES (b->type)
4600 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4601 && type_list_equal (TYPE_VALUES (a->type),
4602 TYPE_VALUES (b->type))))
4605 /* ... fall through ... */
4610 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4611 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4612 TYPE_MAX_VALUE (b->type)))
4613 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4614 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4615 TYPE_MIN_VALUE (b->type))));
4617 case FIXED_POINT_TYPE:
4618 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
4621 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4624 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4625 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4626 || (TYPE_ARG_TYPES (a->type)
4627 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4628 && TYPE_ARG_TYPES (b->type)
4629 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4630 && type_list_equal (TYPE_ARG_TYPES (a->type),
4631 TYPE_ARG_TYPES (b->type)))));
4634 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4638 case QUAL_UNION_TYPE:
4639 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4640 || (TYPE_FIELDS (a->type)
4641 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4642 && TYPE_FIELDS (b->type)
4643 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4644 && type_list_equal (TYPE_FIELDS (a->type),
4645 TYPE_FIELDS (b->type))));
4648 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4649 || (TYPE_ARG_TYPES (a->type)
4650 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4651 && TYPE_ARG_TYPES (b->type)
4652 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4653 && type_list_equal (TYPE_ARG_TYPES (a->type),
4654 TYPE_ARG_TYPES (b->type))))
4662 if (lang_hooks.types.type_hash_eq != NULL)
4663 return lang_hooks.types.type_hash_eq (a->type, b->type);
4668 /* Return the cached hash value. */
4671 type_hash_hash (const void *item)
4673 return ((const struct type_hash *) item)->hash;
4676 /* Look in the type hash table for a type isomorphic to TYPE.
4677 If one is found, return it. Otherwise return 0. */
4680 type_hash_lookup (hashval_t hashcode, tree type)
4682 struct type_hash *h, in;
4684 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4685 must call that routine before comparing TYPE_ALIGNs. */
4691 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
4698 /* Add an entry to the type-hash-table
4699 for a type TYPE whose hash code is HASHCODE. */
4702 type_hash_add (hashval_t hashcode, tree type)
4704 struct type_hash *h;
4707 h = GGC_NEW (struct type_hash);
4710 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4714 /* Given TYPE, and HASHCODE its hash code, return the canonical
4715 object for an identical type if one already exists.
4716 Otherwise, return TYPE, and record it as the canonical object.
4718 To use this function, first create a type of the sort you want.
4719 Then compute its hash code from the fields of the type that
4720 make it different from other similar types.
4721 Then call this function and use the value. */
4724 type_hash_canon (unsigned int hashcode, tree type)
4728 /* The hash table only contains main variants, so ensure that's what we're
4730 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4732 if (!lang_hooks.types.hash_types)
4735 /* See if the type is in the hash table already. If so, return it.
4736 Otherwise, add the type. */
4737 t1 = type_hash_lookup (hashcode, type);
4740 #ifdef GATHER_STATISTICS
4741 tree_node_counts[(int) t_kind]--;
4742 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4748 type_hash_add (hashcode, type);
4753 /* See if the data pointed to by the type hash table is marked. We consider
4754 it marked if the type is marked or if a debug type number or symbol
4755 table entry has been made for the type. This reduces the amount of
4756 debugging output and eliminates that dependency of the debug output on
4757 the number of garbage collections. */
4760 type_hash_marked_p (const void *p)
4762 const_tree const type = ((const struct type_hash *) p)->type;
4764 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4768 print_type_hash_statistics (void)
4770 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4771 (long) htab_size (type_hash_table),
4772 (long) htab_elements (type_hash_table),
4773 htab_collisions (type_hash_table));
4776 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4777 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4778 by adding the hash codes of the individual attributes. */
4781 attribute_hash_list (const_tree list, hashval_t hashcode)
4785 for (tail = list; tail; tail = TREE_CHAIN (tail))
4786 /* ??? Do we want to add in TREE_VALUE too? */
4787 hashcode = iterative_hash_object
4788 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4792 /* Given two lists of attributes, return true if list l2 is
4793 equivalent to l1. */
4796 attribute_list_equal (const_tree l1, const_tree l2)
4798 return attribute_list_contained (l1, l2)
4799 && attribute_list_contained (l2, l1);
4802 /* Given two lists of attributes, return true if list L2 is
4803 completely contained within L1. */
4804 /* ??? This would be faster if attribute names were stored in a canonicalized
4805 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4806 must be used to show these elements are equivalent (which they are). */
4807 /* ??? It's not clear that attributes with arguments will always be handled
4811 attribute_list_contained (const_tree l1, const_tree l2)
4815 /* First check the obvious, maybe the lists are identical. */
4819 /* Maybe the lists are similar. */
4820 for (t1 = l1, t2 = l2;
4822 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4823 && TREE_VALUE (t1) == TREE_VALUE (t2);
4824 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4826 /* Maybe the lists are equal. */
4827 if (t1 == 0 && t2 == 0)
4830 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4833 /* This CONST_CAST is okay because lookup_attribute does not
4834 modify its argument and the return value is assigned to a
4836 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4837 CONST_CAST_TREE(l1));
4839 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4842 if (TREE_VALUE (t2) != NULL
4843 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4844 && TREE_VALUE (attr) != NULL
4845 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4847 if (simple_cst_list_equal (TREE_VALUE (t2),
4848 TREE_VALUE (attr)) == 1)
4851 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4862 /* Given two lists of types
4863 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4864 return 1 if the lists contain the same types in the same order.
4865 Also, the TREE_PURPOSEs must match. */
4868 type_list_equal (const_tree l1, const_tree l2)
4872 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4873 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4874 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4875 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4876 && (TREE_TYPE (TREE_PURPOSE (t1))
4877 == TREE_TYPE (TREE_PURPOSE (t2))))))
4883 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4884 given by TYPE. If the argument list accepts variable arguments,
4885 then this function counts only the ordinary arguments. */
4888 type_num_arguments (const_tree type)
4893 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4894 /* If the function does not take a variable number of arguments,
4895 the last element in the list will have type `void'. */
4896 if (VOID_TYPE_P (TREE_VALUE (t)))
4904 /* Nonzero if integer constants T1 and T2
4905 represent the same constant value. */
4908 tree_int_cst_equal (const_tree t1, const_tree t2)
4913 if (t1 == 0 || t2 == 0)
4916 if (TREE_CODE (t1) == INTEGER_CST
4917 && TREE_CODE (t2) == INTEGER_CST
4918 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4919 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4925 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4926 The precise way of comparison depends on their data type. */
4929 tree_int_cst_lt (const_tree t1, const_tree t2)
4934 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4936 int t1_sgn = tree_int_cst_sgn (t1);
4937 int t2_sgn = tree_int_cst_sgn (t2);
4939 if (t1_sgn < t2_sgn)
4941 else if (t1_sgn > t2_sgn)
4943 /* Otherwise, both are non-negative, so we compare them as
4944 unsigned just in case one of them would overflow a signed
4947 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4948 return INT_CST_LT (t1, t2);
4950 return INT_CST_LT_UNSIGNED (t1, t2);
4953 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4956 tree_int_cst_compare (const_tree t1, const_tree t2)
4958 if (tree_int_cst_lt (t1, t2))
4960 else if (tree_int_cst_lt (t2, t1))
4966 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4967 the host. If POS is zero, the value can be represented in a single
4968 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4969 be represented in a single unsigned HOST_WIDE_INT. */
4972 host_integerp (const_tree t, int pos)
4974 return (TREE_CODE (t) == INTEGER_CST
4975 && ((TREE_INT_CST_HIGH (t) == 0
4976 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4977 || (! pos && TREE_INT_CST_HIGH (t) == -1
4978 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4979 && (!TYPE_UNSIGNED (TREE_TYPE (t))
4980 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
4981 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
4982 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4985 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4986 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4987 be non-negative. We must be able to satisfy the above conditions. */
4990 tree_low_cst (const_tree t, int pos)
4992 gcc_assert (host_integerp (t, pos));
4993 return TREE_INT_CST_LOW (t);
4996 /* Return the most significant bit of the integer constant T. */
4999 tree_int_cst_msb (const_tree t)
5003 unsigned HOST_WIDE_INT l;
5005 /* Note that using TYPE_PRECISION here is wrong. We care about the
5006 actual bits, not the (arbitrary) range of the type. */
5007 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
5008 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
5009 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
5010 return (l & 1) == 1;
5013 /* Return an indication of the sign of the integer constant T.
5014 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
5015 Note that -1 will never be returned if T's type is unsigned. */
5018 tree_int_cst_sgn (const_tree t)
5020 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
5022 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
5024 else if (TREE_INT_CST_HIGH (t) < 0)
5030 /* Compare two constructor-element-type constants. Return 1 if the lists
5031 are known to be equal; otherwise return 0. */
5034 simple_cst_list_equal (const_tree l1, const_tree l2)
5036 while (l1 != NULL_TREE && l2 != NULL_TREE)
5038 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
5041 l1 = TREE_CHAIN (l1);
5042 l2 = TREE_CHAIN (l2);
5048 /* Return truthvalue of whether T1 is the same tree structure as T2.
5049 Return 1 if they are the same.
5050 Return 0 if they are understandably different.
5051 Return -1 if either contains tree structure not understood by
5055 simple_cst_equal (const_tree t1, const_tree t2)
5057 enum tree_code code1, code2;
5063 if (t1 == 0 || t2 == 0)
5066 code1 = TREE_CODE (t1);
5067 code2 = TREE_CODE (t2);
5069 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
5071 if (CONVERT_EXPR_CODE_P (code2)
5072 || code2 == NON_LVALUE_EXPR)
5073 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5075 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
5078 else if (CONVERT_EXPR_CODE_P (code2)
5079 || code2 == NON_LVALUE_EXPR)
5080 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
5088 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5089 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
5092 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
5095 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
5098 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
5099 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
5100 TREE_STRING_LENGTH (t1)));
5104 unsigned HOST_WIDE_INT idx;
5105 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
5106 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
5108 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5111 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5112 /* ??? Should we handle also fields here? */
5113 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5114 VEC_index (constructor_elt, v2, idx)->value))
5120 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5123 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5126 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5129 const_tree arg1, arg2;
5130 const_call_expr_arg_iterator iter1, iter2;
5131 for (arg1 = first_const_call_expr_arg (t1, &iter1),
5132 arg2 = first_const_call_expr_arg (t2, &iter2);
5134 arg1 = next_const_call_expr_arg (&iter1),
5135 arg2 = next_const_call_expr_arg (&iter2))
5137 cmp = simple_cst_equal (arg1, arg2);
5141 return arg1 == arg2;
5145 /* Special case: if either target is an unallocated VAR_DECL,
5146 it means that it's going to be unified with whatever the
5147 TARGET_EXPR is really supposed to initialize, so treat it
5148 as being equivalent to anything. */
5149 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5150 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5151 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5152 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5153 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5154 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5157 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5162 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5164 case WITH_CLEANUP_EXPR:
5165 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5169 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5172 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5173 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5187 /* This general rule works for most tree codes. All exceptions should be
5188 handled above. If this is a language-specific tree code, we can't
5189 trust what might be in the operand, so say we don't know
5191 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5194 switch (TREE_CODE_CLASS (code1))
5198 case tcc_comparison:
5199 case tcc_expression:
5203 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5205 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5217 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5218 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5219 than U, respectively. */
5222 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
5224 if (tree_int_cst_sgn (t) < 0)
5226 else if (TREE_INT_CST_HIGH (t) != 0)
5228 else if (TREE_INT_CST_LOW (t) == u)
5230 else if (TREE_INT_CST_LOW (t) < u)
5236 /* Return true if CODE represents an associative tree code. Otherwise
5239 associative_tree_code (enum tree_code code)
5258 /* Return true if CODE represents a commutative tree code. Otherwise
5261 commutative_tree_code (enum tree_code code)
5274 case UNORDERED_EXPR:
5278 case TRUTH_AND_EXPR:
5279 case TRUTH_XOR_EXPR:
5289 /* Generate a hash value for an expression. This can be used iteratively
5290 by passing a previous result as the VAL argument.
5292 This function is intended to produce the same hash for expressions which
5293 would compare equal using operand_equal_p. */
5296 iterative_hash_expr (const_tree t, hashval_t val)
5299 enum tree_code code;
5303 return iterative_hash_pointer (t, val);
5305 code = TREE_CODE (t);
5309 /* Alas, constants aren't shared, so we can't rely on pointer
5312 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5313 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5316 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5318 return iterative_hash_hashval_t (val2, val);
5322 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
5324 return iterative_hash_hashval_t (val2, val);
5327 return iterative_hash (TREE_STRING_POINTER (t),
5328 TREE_STRING_LENGTH (t), val);
5330 val = iterative_hash_expr (TREE_REALPART (t), val);
5331 return iterative_hash_expr (TREE_IMAGPART (t), val);
5333 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5336 /* we can just compare by pointer. */
5337 return iterative_hash_pointer (t, val);
5340 /* A list of expressions, for a CALL_EXPR or as the elements of a
5342 for (; t; t = TREE_CHAIN (t))
5343 val = iterative_hash_expr (TREE_VALUE (t), val);
5347 unsigned HOST_WIDE_INT idx;
5349 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5351 val = iterative_hash_expr (field, val);
5352 val = iterative_hash_expr (value, val);
5357 /* When referring to a built-in FUNCTION_DECL, use the
5358 __builtin__ form. Otherwise nodes that compare equal
5359 according to operand_equal_p might get different
5361 if (DECL_BUILT_IN (t))
5363 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5367 /* else FALL THROUGH */
5369 tclass = TREE_CODE_CLASS (code);
5371 if (tclass == tcc_declaration)
5373 /* DECL's have a unique ID */
5374 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5378 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
5380 val = iterative_hash_object (code, val);
5382 /* Don't hash the type, that can lead to having nodes which
5383 compare equal according to operand_equal_p, but which
5384 have different hash codes. */
5385 if (CONVERT_EXPR_CODE_P (code)
5386 || code == NON_LVALUE_EXPR)
5388 /* Make sure to include signness in the hash computation. */
5389 val += TYPE_UNSIGNED (TREE_TYPE (t));
5390 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5393 else if (commutative_tree_code (code))
5395 /* It's a commutative expression. We want to hash it the same
5396 however it appears. We do this by first hashing both operands
5397 and then rehashing based on the order of their independent
5399 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5400 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5404 t = one, one = two, two = t;
5406 val = iterative_hash_hashval_t (one, val);
5407 val = iterative_hash_hashval_t (two, val);
5410 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5411 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5418 /* Generate a hash value for a pair of expressions. This can be used
5419 iteratively by passing a previous result as the VAL argument.
5421 The same hash value is always returned for a given pair of expressions,
5422 regardless of the order in which they are presented. This is useful in
5423 hashing the operands of commutative functions. */
5426 iterative_hash_exprs_commutative (const_tree t1,
5427 const_tree t2, hashval_t val)
5429 hashval_t one = iterative_hash_expr (t1, 0);
5430 hashval_t two = iterative_hash_expr (t2, 0);
5434 t = one, one = two, two = t;
5435 val = iterative_hash_hashval_t (one, val);
5436 val = iterative_hash_hashval_t (two, val);
5441 /* Constructors for pointer, array and function types.
5442 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5443 constructed by language-dependent code, not here.) */
5445 /* Construct, lay out and return the type of pointers to TO_TYPE with
5446 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5447 reference all of memory. If such a type has already been
5448 constructed, reuse it. */
5451 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5456 if (to_type == error_mark_node)
5457 return error_mark_node;
5459 /* If the pointed-to type has the may_alias attribute set, force
5460 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5461 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5462 can_alias_all = true;
5464 /* In some cases, languages will have things that aren't a POINTER_TYPE
5465 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5466 In that case, return that type without regard to the rest of our
5469 ??? This is a kludge, but consistent with the way this function has
5470 always operated and there doesn't seem to be a good way to avoid this
5472 if (TYPE_POINTER_TO (to_type) != 0
5473 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5474 return TYPE_POINTER_TO (to_type);
5476 /* First, if we already have a type for pointers to TO_TYPE and it's
5477 the proper mode, use it. */
5478 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5479 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5482 t = make_node (POINTER_TYPE);
5484 TREE_TYPE (t) = to_type;
5485 TYPE_MODE (t) = mode;
5486 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5487 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5488 TYPE_POINTER_TO (to_type) = t;
5490 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5491 SET_TYPE_STRUCTURAL_EQUALITY (t);
5492 else if (TYPE_CANONICAL (to_type) != to_type)
5494 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5495 mode, can_alias_all);
5497 /* Lay out the type. This function has many callers that are concerned
5498 with expression-construction, and this simplifies them all. */
5504 /* By default build pointers in ptr_mode. */
5507 build_pointer_type (tree to_type)
5509 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5512 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5515 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5520 if (to_type == error_mark_node)
5521 return error_mark_node;
5523 /* If the pointed-to type has the may_alias attribute set, force
5524 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5525 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5526 can_alias_all = true;
5528 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5529 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5530 In that case, return that type without regard to the rest of our
5533 ??? This is a kludge, but consistent with the way this function has
5534 always operated and there doesn't seem to be a good way to avoid this
5536 if (TYPE_REFERENCE_TO (to_type) != 0
5537 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5538 return TYPE_REFERENCE_TO (to_type);
5540 /* First, if we already have a type for pointers to TO_TYPE and it's
5541 the proper mode, use it. */
5542 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5543 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5546 t = make_node (REFERENCE_TYPE);
5548 TREE_TYPE (t) = to_type;
5549 TYPE_MODE (t) = mode;
5550 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5551 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5552 TYPE_REFERENCE_TO (to_type) = t;
5554 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5555 SET_TYPE_STRUCTURAL_EQUALITY (t);
5556 else if (TYPE_CANONICAL (to_type) != to_type)
5558 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5559 mode, can_alias_all);
5567 /* Build the node for the type of references-to-TO_TYPE by default
5571 build_reference_type (tree to_type)
5573 return build_reference_type_for_mode (to_type, ptr_mode, false);
5576 /* Build a type that is compatible with t but has no cv quals anywhere
5579 const char *const *const * -> char ***. */
5582 build_type_no_quals (tree t)
5584 switch (TREE_CODE (t))
5587 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5589 TYPE_REF_CAN_ALIAS_ALL (t));
5590 case REFERENCE_TYPE:
5592 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5594 TYPE_REF_CAN_ALIAS_ALL (t));
5596 return TYPE_MAIN_VARIANT (t);
5600 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5601 MAXVAL should be the maximum value in the domain
5602 (one less than the length of the array).
5604 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5605 We don't enforce this limit, that is up to caller (e.g. language front end).
5606 The limit exists because the result is a signed type and we don't handle
5607 sizes that use more than one HOST_WIDE_INT. */
5610 build_index_type (tree maxval)
5612 tree itype = make_node (INTEGER_TYPE);
5614 TREE_TYPE (itype) = sizetype;
5615 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5616 TYPE_MIN_VALUE (itype) = size_zero_node;
5617 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5618 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5619 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5620 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5621 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5622 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5624 if (host_integerp (maxval, 1))
5625 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5628 /* Since we cannot hash this type, we need to compare it using
5629 structural equality checks. */
5630 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5635 /* Builds a signed or unsigned integer type of precision PRECISION.
5636 Used for C bitfields whose precision does not match that of
5637 built-in target types. */
5639 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5642 tree itype = make_node (INTEGER_TYPE);
5644 TYPE_PRECISION (itype) = precision;
5647 fixup_unsigned_type (itype);
5649 fixup_signed_type (itype);
5651 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5652 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5657 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5658 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5659 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5662 build_range_type (tree type, tree lowval, tree highval)
5664 tree itype = make_node (INTEGER_TYPE);
5666 TREE_TYPE (itype) = type;
5667 if (type == NULL_TREE)
5670 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5671 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5673 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5674 TYPE_MODE (itype) = TYPE_MODE (type);
5675 TYPE_SIZE (itype) = TYPE_SIZE (type);
5676 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5677 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5678 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5680 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5681 return type_hash_canon (tree_low_cst (highval, 0)
5682 - tree_low_cst (lowval, 0),
5688 /* Just like build_index_type, but takes lowval and highval instead
5689 of just highval (maxval). */
5692 build_index_2_type (tree lowval, tree highval)
5694 return build_range_type (sizetype, lowval, highval);
5697 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5698 and number of elements specified by the range of values of INDEX_TYPE.
5699 If such a type has already been constructed, reuse it. */
5702 build_array_type (tree elt_type, tree index_type)
5705 hashval_t hashcode = 0;
5707 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5709 error ("arrays of functions are not meaningful");
5710 elt_type = integer_type_node;
5713 t = make_node (ARRAY_TYPE);
5714 TREE_TYPE (t) = elt_type;
5715 TYPE_DOMAIN (t) = index_type;
5717 if (index_type == 0)
5720 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5721 t = type_hash_canon (hashcode, t);
5725 if (TYPE_CANONICAL (t) == t)
5727 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5728 SET_TYPE_STRUCTURAL_EQUALITY (t);
5729 else if (TYPE_CANONICAL (elt_type) != elt_type)
5731 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5737 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5738 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5739 t = type_hash_canon (hashcode, t);
5741 if (!COMPLETE_TYPE_P (t))
5744 if (TYPE_CANONICAL (t) == t)
5746 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5747 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5748 SET_TYPE_STRUCTURAL_EQUALITY (t);
5749 else if (TYPE_CANONICAL (elt_type) != elt_type
5750 || TYPE_CANONICAL (index_type) != index_type)
5752 = build_array_type (TYPE_CANONICAL (elt_type),
5753 TYPE_CANONICAL (index_type));
5759 /* Recursively examines the array elements of TYPE, until a non-array
5760 element type is found. */
5763 strip_array_types (tree type)
5765 while (TREE_CODE (type) == ARRAY_TYPE)
5766 type = TREE_TYPE (type);
5771 /* Computes the canonical argument types from the argument type list
5774 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5775 on entry to this function, or if any of the ARGTYPES are
5778 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5779 true on entry to this function, or if any of the ARGTYPES are
5782 Returns a canonical argument list, which may be ARGTYPES when the
5783 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5784 true) or would not differ from ARGTYPES. */
5787 maybe_canonicalize_argtypes(tree argtypes,
5788 bool *any_structural_p,
5789 bool *any_noncanonical_p)
5792 bool any_noncanonical_argtypes_p = false;
5794 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
5796 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
5797 /* Fail gracefully by stating that the type is structural. */
5798 *any_structural_p = true;
5799 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
5800 *any_structural_p = true;
5801 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
5802 || TREE_PURPOSE (arg))
5803 /* If the argument has a default argument, we consider it
5804 non-canonical even though the type itself is canonical.
5805 That way, different variants of function and method types
5806 with default arguments will all point to the variant with
5807 no defaults as their canonical type. */
5808 any_noncanonical_argtypes_p = true;
5811 if (*any_structural_p)
5814 if (any_noncanonical_argtypes_p)
5816 /* Build the canonical list of argument types. */
5817 tree canon_argtypes = NULL_TREE;
5818 bool is_void = false;
5820 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
5822 if (arg == void_list_node)
5825 canon_argtypes = tree_cons (NULL_TREE,
5826 TYPE_CANONICAL (TREE_VALUE (arg)),
5830 canon_argtypes = nreverse (canon_argtypes);
5832 canon_argtypes = chainon (canon_argtypes, void_list_node);
5834 /* There is a non-canonical type. */
5835 *any_noncanonical_p = true;
5836 return canon_argtypes;
5839 /* The canonical argument types are the same as ARGTYPES. */
5843 /* Construct, lay out and return
5844 the type of functions returning type VALUE_TYPE
5845 given arguments of types ARG_TYPES.
5846 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5847 are data type nodes for the arguments of the function.
5848 If such a type has already been constructed, reuse it. */
5851 build_function_type (tree value_type, tree arg_types)
5854 hashval_t hashcode = 0;
5855 bool any_structural_p, any_noncanonical_p;
5856 tree canon_argtypes;
5858 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5860 error ("function return type cannot be function");
5861 value_type = integer_type_node;
5864 /* Make a node of the sort we want. */
5865 t = make_node (FUNCTION_TYPE);
5866 TREE_TYPE (t) = value_type;
5867 TYPE_ARG_TYPES (t) = arg_types;
5869 /* If we already have such a type, use the old one. */
5870 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5871 hashcode = type_hash_list (arg_types, hashcode);
5872 t = type_hash_canon (hashcode, t);
5874 /* Set up the canonical type. */
5875 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
5876 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
5877 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
5879 &any_noncanonical_p);
5880 if (any_structural_p)
5881 SET_TYPE_STRUCTURAL_EQUALITY (t);
5882 else if (any_noncanonical_p)
5883 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
5886 if (!COMPLETE_TYPE_P (t))
5891 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
5894 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
5896 tree new_type = NULL;
5897 tree args, new_args = NULL, t;
5901 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
5902 args = TREE_CHAIN (args), i++)
5903 if (!bitmap_bit_p (args_to_skip, i))
5904 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
5906 new_reversed = nreverse (new_args);
5910 TREE_CHAIN (new_args) = void_list_node;
5912 new_reversed = void_list_node;
5914 gcc_assert (new_reversed);
5916 /* Use copy_node to preserve as much as possible from original type
5917 (debug info, attribute lists etc.)
5918 Exception is METHOD_TYPEs must have THIS argument.
5919 When we are asked to remove it, we need to build new FUNCTION_TYPE
5921 if (TREE_CODE (orig_type) != METHOD_TYPE
5922 || !bitmap_bit_p (args_to_skip, 0))
5924 new_type = copy_node (orig_type);
5925 TYPE_ARG_TYPES (new_type) = new_reversed;
5928 new_type = build_function_type (TREE_TYPE (orig_type), new_reversed);
5930 /* This is a new type, not a copy of an old type. Need to reassociate
5931 variants. We can handle everything except the main variant lazily. */
5932 t = TYPE_MAIN_VARIANT (orig_type);
5935 TYPE_MAIN_VARIANT (new_type) = t;
5936 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
5937 TYPE_NEXT_VARIANT (t) = new_type;
5941 TYPE_MAIN_VARIANT (new_type) = new_type;
5942 TYPE_NEXT_VARIANT (new_type) = NULL;
5947 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
5949 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
5950 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
5951 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
5954 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
5956 tree new_decl = copy_node (orig_decl);
5959 new_type = TREE_TYPE (orig_decl);
5960 if (prototype_p (new_type))
5961 new_type = build_function_type_skip_args (new_type, args_to_skip);
5962 TREE_TYPE (orig_decl) = new_type;
5966 /* Build a function type. The RETURN_TYPE is the type returned by the
5967 function. If VAARGS is set, no void_type_node is appended to the
5968 the list. ARGP muse be alway be terminated be a NULL_TREE. */
5971 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
5975 t = va_arg (argp, tree);
5976 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
5977 args = tree_cons (NULL_TREE, t, args);
5982 if (args != NULL_TREE)
5983 args = nreverse (args);
5984 gcc_assert (args != NULL_TREE && last != void_list_node);
5986 else if (args == NULL_TREE)
5987 args = void_list_node;
5991 args = nreverse (args);
5992 TREE_CHAIN (last) = void_list_node;
5994 args = build_function_type (return_type, args);
5999 /* Build a function type. The RETURN_TYPE is the type returned by the
6000 function. If additional arguments are provided, they are
6001 additional argument types. The list of argument types must always
6002 be terminated by NULL_TREE. */
6005 build_function_type_list (tree return_type, ...)
6010 va_start (p, return_type);
6011 args = build_function_type_list_1 (false, return_type, p);
6016 /* Build a variable argument function type. The RETURN_TYPE is the
6017 type returned by the function. If additional arguments are provided,
6018 they are additional argument types. The list of argument types must
6019 always be terminated by NULL_TREE. */
6022 build_varargs_function_type_list (tree return_type, ...)
6027 va_start (p, return_type);
6028 args = build_function_type_list_1 (true, return_type, p);
6034 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
6035 and ARGTYPES (a TREE_LIST) are the return type and arguments types
6036 for the method. An implicit additional parameter (of type
6037 pointer-to-BASETYPE) is added to the ARGTYPES. */
6040 build_method_type_directly (tree basetype,
6047 bool any_structural_p, any_noncanonical_p;
6048 tree canon_argtypes;
6050 /* Make a node of the sort we want. */
6051 t = make_node (METHOD_TYPE);
6053 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6054 TREE_TYPE (t) = rettype;
6055 ptype = build_pointer_type (basetype);
6057 /* The actual arglist for this function includes a "hidden" argument
6058 which is "this". Put it into the list of argument types. */
6059 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
6060 TYPE_ARG_TYPES (t) = argtypes;
6062 /* If we already have such a type, use the old one. */
6063 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6064 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
6065 hashcode = type_hash_list (argtypes, hashcode);
6066 t = type_hash_canon (hashcode, t);
6068 /* Set up the canonical type. */
6070 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6071 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
6073 = (TYPE_CANONICAL (basetype) != basetype
6074 || TYPE_CANONICAL (rettype) != rettype);
6075 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
6077 &any_noncanonical_p);
6078 if (any_structural_p)
6079 SET_TYPE_STRUCTURAL_EQUALITY (t);
6080 else if (any_noncanonical_p)
6082 = build_method_type_directly (TYPE_CANONICAL (basetype),
6083 TYPE_CANONICAL (rettype),
6085 if (!COMPLETE_TYPE_P (t))
6091 /* Construct, lay out and return the type of methods belonging to class
6092 BASETYPE and whose arguments and values are described by TYPE.
6093 If that type exists already, reuse it.
6094 TYPE must be a FUNCTION_TYPE node. */
6097 build_method_type (tree basetype, tree type)
6099 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
6101 return build_method_type_directly (basetype,
6103 TYPE_ARG_TYPES (type));
6106 /* Construct, lay out and return the type of offsets to a value
6107 of type TYPE, within an object of type BASETYPE.
6108 If a suitable offset type exists already, reuse it. */
6111 build_offset_type (tree basetype, tree type)
6114 hashval_t hashcode = 0;
6116 /* Make a node of the sort we want. */
6117 t = make_node (OFFSET_TYPE);
6119 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6120 TREE_TYPE (t) = type;
6122 /* If we already have such a type, use the old one. */
6123 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6124 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
6125 t = type_hash_canon (hashcode, t);
6127 if (!COMPLETE_TYPE_P (t))
6130 if (TYPE_CANONICAL (t) == t)
6132 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6133 || TYPE_STRUCTURAL_EQUALITY_P (type))
6134 SET_TYPE_STRUCTURAL_EQUALITY (t);
6135 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
6136 || TYPE_CANONICAL (type) != type)
6138 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
6139 TYPE_CANONICAL (type));
6145 /* Create a complex type whose components are COMPONENT_TYPE. */
6148 build_complex_type (tree component_type)
6153 /* Make a node of the sort we want. */
6154 t = make_node (COMPLEX_TYPE);
6156 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
6158 /* If we already have such a type, use the old one. */
6159 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
6160 t = type_hash_canon (hashcode, t);
6162 if (!COMPLETE_TYPE_P (t))
6165 if (TYPE_CANONICAL (t) == t)
6167 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
6168 SET_TYPE_STRUCTURAL_EQUALITY (t);
6169 else if (TYPE_CANONICAL (component_type) != component_type)
6171 = build_complex_type (TYPE_CANONICAL (component_type));
6174 /* We need to create a name, since complex is a fundamental type. */
6175 if (! TYPE_NAME (t))
6178 if (component_type == char_type_node)
6179 name = "complex char";
6180 else if (component_type == signed_char_type_node)
6181 name = "complex signed char";
6182 else if (component_type == unsigned_char_type_node)
6183 name = "complex unsigned char";
6184 else if (component_type == short_integer_type_node)
6185 name = "complex short int";
6186 else if (component_type == short_unsigned_type_node)
6187 name = "complex short unsigned int";
6188 else if (component_type == integer_type_node)
6189 name = "complex int";
6190 else if (component_type == unsigned_type_node)
6191 name = "complex unsigned int";
6192 else if (component_type == long_integer_type_node)
6193 name = "complex long int";
6194 else if (component_type == long_unsigned_type_node)
6195 name = "complex long unsigned int";
6196 else if (component_type == long_long_integer_type_node)
6197 name = "complex long long int";
6198 else if (component_type == long_long_unsigned_type_node)
6199 name = "complex long long unsigned int";
6204 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
6207 return build_qualified_type (t, TYPE_QUALS (component_type));
6210 /* Return OP, stripped of any conversions to wider types as much as is safe.
6211 Converting the value back to OP's type makes a value equivalent to OP.
6213 If FOR_TYPE is nonzero, we return a value which, if converted to
6214 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6216 OP must have integer, real or enumeral type. Pointers are not allowed!
6218 There are some cases where the obvious value we could return
6219 would regenerate to OP if converted to OP's type,
6220 but would not extend like OP to wider types.
6221 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6222 For example, if OP is (unsigned short)(signed char)-1,
6223 we avoid returning (signed char)-1 if FOR_TYPE is int,
6224 even though extending that to an unsigned short would regenerate OP,
6225 since the result of extending (signed char)-1 to (int)
6226 is different from (int) OP. */
6229 get_unwidened (tree op, tree for_type)
6231 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6232 tree type = TREE_TYPE (op);
6234 = TYPE_PRECISION (for_type != 0 ? for_type : type);
6236 = (for_type != 0 && for_type != type
6237 && final_prec > TYPE_PRECISION (type)
6238 && TYPE_UNSIGNED (type));
6241 while (CONVERT_EXPR_P (op))
6245 /* TYPE_PRECISION on vector types has different meaning
6246 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6247 so avoid them here. */
6248 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
6251 bitschange = TYPE_PRECISION (TREE_TYPE (op))
6252 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
6254 /* Truncations are many-one so cannot be removed.
6255 Unless we are later going to truncate down even farther. */
6257 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
6260 /* See what's inside this conversion. If we decide to strip it,
6262 op = TREE_OPERAND (op, 0);
6264 /* If we have not stripped any zero-extensions (uns is 0),
6265 we can strip any kind of extension.
6266 If we have previously stripped a zero-extension,
6267 only zero-extensions can safely be stripped.
6268 Any extension can be stripped if the bits it would produce
6269 are all going to be discarded later by truncating to FOR_TYPE. */
6273 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
6275 /* TYPE_UNSIGNED says whether this is a zero-extension.
6276 Let's avoid computing it if it does not affect WIN
6277 and if UNS will not be needed again. */
6279 || CONVERT_EXPR_P (op))
6280 && TYPE_UNSIGNED (TREE_TYPE (op)))
6291 /* Return OP or a simpler expression for a narrower value
6292 which can be sign-extended or zero-extended to give back OP.
6293 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6294 or 0 if the value should be sign-extended. */
6297 get_narrower (tree op, int *unsignedp_ptr)
6302 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
6304 while (TREE_CODE (op) == NOP_EXPR)
6307 = (TYPE_PRECISION (TREE_TYPE (op))
6308 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
6310 /* Truncations are many-one so cannot be removed. */
6314 /* See what's inside this conversion. If we decide to strip it,
6319 op = TREE_OPERAND (op, 0);
6320 /* An extension: the outermost one can be stripped,
6321 but remember whether it is zero or sign extension. */
6323 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6324 /* Otherwise, if a sign extension has been stripped,
6325 only sign extensions can now be stripped;
6326 if a zero extension has been stripped, only zero-extensions. */
6327 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6331 else /* bitschange == 0 */
6333 /* A change in nominal type can always be stripped, but we must
6334 preserve the unsignedness. */
6336 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6338 op = TREE_OPERAND (op, 0);
6339 /* Keep trying to narrow, but don't assign op to win if it
6340 would turn an integral type into something else. */
6341 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6348 if (TREE_CODE (op) == COMPONENT_REF
6349 /* Since type_for_size always gives an integer type. */
6350 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6351 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
6352 /* Ensure field is laid out already. */
6353 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6354 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6356 unsigned HOST_WIDE_INT innerprec
6357 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6358 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6359 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6360 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6362 /* We can get this structure field in a narrower type that fits it,
6363 but the resulting extension to its nominal type (a fullword type)
6364 must satisfy the same conditions as for other extensions.
6366 Do this only for fields that are aligned (not bit-fields),
6367 because when bit-field insns will be used there is no
6368 advantage in doing this. */
6370 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6371 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6372 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6376 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6377 win = fold_convert (type, op);
6381 *unsignedp_ptr = uns;
6385 /* Nonzero if integer constant C has a value that is permissible
6386 for type TYPE (an INTEGER_TYPE). */
6389 int_fits_type_p (const_tree c, const_tree type)
6391 tree type_low_bound = TYPE_MIN_VALUE (type);
6392 tree type_high_bound = TYPE_MAX_VALUE (type);
6393 bool ok_for_low_bound, ok_for_high_bound;
6394 unsigned HOST_WIDE_INT low;
6397 /* If at least one bound of the type is a constant integer, we can check
6398 ourselves and maybe make a decision. If no such decision is possible, but
6399 this type is a subtype, try checking against that. Otherwise, use
6400 fit_double_type, which checks against the precision.
6402 Compute the status for each possibly constant bound, and return if we see
6403 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6404 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6405 for "constant known to fit". */
6407 if (TREE_TYPE (c) == sizetype
6408 && TYPE_UNSIGNED (TREE_TYPE (c))
6409 && TREE_INT_CST_HIGH (c) == -1
6410 && !TREE_OVERFLOW (c))
6411 /* So c is an unsigned integer which type is sizetype.
6412 sizetype'd integers are sign extended even though they are
6413 unsigned. If the integer value fits in the lower end word of c,
6414 and if the higher end word has all its bits set to 1, that
6415 means the higher end bits are set to 1 only for sign extension.
6416 So let's convert c into an equivalent zero extended unsigned
6418 c = force_fit_type_double (size_type_node,
6419 TREE_INT_CST_LOW (c),
6420 TREE_INT_CST_HIGH (c),
6422 /* Check if C >= type_low_bound. */
6423 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6425 if (tree_int_cst_lt (c, type_low_bound))
6427 ok_for_low_bound = true;
6430 ok_for_low_bound = false;
6432 /* Check if c <= type_high_bound. */
6433 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6435 if (tree_int_cst_lt (type_high_bound, c))
6437 ok_for_high_bound = true;
6440 ok_for_high_bound = false;
6442 /* If the constant fits both bounds, the result is known. */
6443 if (ok_for_low_bound && ok_for_high_bound)
6446 /* Perform some generic filtering which may allow making a decision
6447 even if the bounds are not constant. First, negative integers
6448 never fit in unsigned types, */
6449 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6452 /* Second, narrower types always fit in wider ones. */
6453 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6456 /* Third, unsigned integers with top bit set never fit signed types. */
6457 if (! TYPE_UNSIGNED (type)
6458 && TYPE_UNSIGNED (TREE_TYPE (c))
6459 && tree_int_cst_msb (c))
6462 /* If we haven't been able to decide at this point, there nothing more we
6463 can check ourselves here. Look at the base type if we have one and it
6464 has the same precision. */
6465 if (TREE_CODE (type) == INTEGER_TYPE
6466 && TREE_TYPE (type) != 0
6467 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6468 return int_fits_type_p (c, TREE_TYPE (type));
6470 /* Or to fit_double_type, if nothing else. */
6471 low = TREE_INT_CST_LOW (c);
6472 high = TREE_INT_CST_HIGH (c);
6473 return !fit_double_type (low, high, &low, &high, type);
6476 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6477 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6478 represented (assuming two's-complement arithmetic) within the bit
6479 precision of the type are returned instead. */
6482 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
6484 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
6485 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
6486 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
6487 TYPE_UNSIGNED (type));
6490 if (TYPE_UNSIGNED (type))
6491 mpz_set_ui (min, 0);
6495 mn = double_int_mask (TYPE_PRECISION (type) - 1);
6496 mn = double_int_sext (double_int_add (mn, double_int_one),
6497 TYPE_PRECISION (type));
6498 mpz_set_double_int (min, mn, false);
6502 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
6503 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
6504 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
6505 TYPE_UNSIGNED (type));
6508 if (TYPE_UNSIGNED (type))
6509 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
6512 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
6517 /* Return true if VAR is an automatic variable defined in function FN. */
6520 auto_var_in_fn_p (const_tree var, const_tree fn)
6522 return (DECL_P (var) && DECL_CONTEXT (var) == fn
6523 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
6524 && ! TREE_STATIC (var))
6525 || TREE_CODE (var) == LABEL_DECL
6526 || TREE_CODE (var) == RESULT_DECL));
6529 /* Subprogram of following function. Called by walk_tree.
6531 Return *TP if it is an automatic variable or parameter of the
6532 function passed in as DATA. */
6535 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6537 tree fn = (tree) data;
6542 else if (DECL_P (*tp)
6543 && auto_var_in_fn_p (*tp, fn))
6549 /* Returns true if T is, contains, or refers to a type with variable
6550 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6551 arguments, but not the return type. If FN is nonzero, only return
6552 true if a modifier of the type or position of FN is a variable or
6553 parameter inside FN.
6555 This concept is more general than that of C99 'variably modified types':
6556 in C99, a struct type is never variably modified because a VLA may not
6557 appear as a structure member. However, in GNU C code like:
6559 struct S { int i[f()]; };
6561 is valid, and other languages may define similar constructs. */
6564 variably_modified_type_p (tree type, tree fn)
6568 /* Test if T is either variable (if FN is zero) or an expression containing
6569 a variable in FN. */
6570 #define RETURN_TRUE_IF_VAR(T) \
6571 do { tree _t = (T); \
6572 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6573 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6574 return true; } while (0)
6576 if (type == error_mark_node)
6579 /* If TYPE itself has variable size, it is variably modified. */
6580 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6581 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6583 switch (TREE_CODE (type))
6586 case REFERENCE_TYPE:
6588 if (variably_modified_type_p (TREE_TYPE (type), fn))
6594 /* If TYPE is a function type, it is variably modified if the
6595 return type is variably modified. */
6596 if (variably_modified_type_p (TREE_TYPE (type), fn))
6602 case FIXED_POINT_TYPE:
6605 /* Scalar types are variably modified if their end points
6607 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6608 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6613 case QUAL_UNION_TYPE:
6614 /* We can't see if any of the fields are variably-modified by the
6615 definition we normally use, since that would produce infinite
6616 recursion via pointers. */
6617 /* This is variably modified if some field's type is. */
6618 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6619 if (TREE_CODE (t) == FIELD_DECL)
6621 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6622 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6623 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6625 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6626 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6631 /* Do not call ourselves to avoid infinite recursion. This is
6632 variably modified if the element type is. */
6633 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6634 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6641 /* The current language may have other cases to check, but in general,
6642 all other types are not variably modified. */
6643 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6645 #undef RETURN_TRUE_IF_VAR
6648 /* Given a DECL or TYPE, return the scope in which it was declared, or
6649 NULL_TREE if there is no containing scope. */
6652 get_containing_scope (const_tree t)
6654 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6657 /* Return the innermost context enclosing DECL that is
6658 a FUNCTION_DECL, or zero if none. */
6661 decl_function_context (const_tree decl)
6665 if (TREE_CODE (decl) == ERROR_MARK)
6668 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6669 where we look up the function at runtime. Such functions always take
6670 a first argument of type 'pointer to real context'.
6672 C++ should really be fixed to use DECL_CONTEXT for the real context,
6673 and use something else for the "virtual context". */
6674 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6677 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6679 context = DECL_CONTEXT (decl);
6681 while (context && TREE_CODE (context) != FUNCTION_DECL)
6683 if (TREE_CODE (context) == BLOCK)
6684 context = BLOCK_SUPERCONTEXT (context);
6686 context = get_containing_scope (context);
6692 /* Return the innermost context enclosing DECL that is
6693 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6694 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6697 decl_type_context (const_tree decl)
6699 tree context = DECL_CONTEXT (decl);
6702 switch (TREE_CODE (context))
6704 case NAMESPACE_DECL:
6705 case TRANSLATION_UNIT_DECL:
6710 case QUAL_UNION_TYPE:
6715 context = DECL_CONTEXT (context);
6719 context = BLOCK_SUPERCONTEXT (context);
6729 /* CALL is a CALL_EXPR. Return the declaration for the function
6730 called, or NULL_TREE if the called function cannot be
6734 get_callee_fndecl (const_tree call)
6738 if (call == error_mark_node)
6739 return error_mark_node;
6741 /* It's invalid to call this function with anything but a
6743 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6745 /* The first operand to the CALL is the address of the function
6747 addr = CALL_EXPR_FN (call);
6751 /* If this is a readonly function pointer, extract its initial value. */
6752 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6753 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6754 && DECL_INITIAL (addr))
6755 addr = DECL_INITIAL (addr);
6757 /* If the address is just `&f' for some function `f', then we know
6758 that `f' is being called. */
6759 if (TREE_CODE (addr) == ADDR_EXPR
6760 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6761 return TREE_OPERAND (addr, 0);
6763 /* We couldn't figure out what was being called. Maybe the front
6764 end has some idea. */
6765 return lang_hooks.lang_get_callee_fndecl (call);
6768 /* Print debugging information about tree nodes generated during the compile,
6769 and any language-specific information. */
6772 dump_tree_statistics (void)
6774 #ifdef GATHER_STATISTICS
6776 int total_nodes, total_bytes;
6779 fprintf (stderr, "\n??? tree nodes created\n\n");
6780 #ifdef GATHER_STATISTICS
6781 fprintf (stderr, "Kind Nodes Bytes\n");
6782 fprintf (stderr, "---------------------------------------\n");
6783 total_nodes = total_bytes = 0;
6784 for (i = 0; i < (int) all_kinds; i++)
6786 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6787 tree_node_counts[i], tree_node_sizes[i]);
6788 total_nodes += tree_node_counts[i];
6789 total_bytes += tree_node_sizes[i];
6791 fprintf (stderr, "---------------------------------------\n");
6792 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6793 fprintf (stderr, "---------------------------------------\n");
6794 ssanames_print_statistics ();
6795 phinodes_print_statistics ();
6797 fprintf (stderr, "(No per-node statistics)\n");
6799 print_type_hash_statistics ();
6800 print_debug_expr_statistics ();
6801 print_value_expr_statistics ();
6802 print_restrict_base_statistics ();
6803 lang_hooks.print_statistics ();
6806 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6808 /* Generate a crc32 of a string. */
6811 crc32_string (unsigned chksum, const char *string)
6815 unsigned value = *string << 24;
6818 for (ix = 8; ix--; value <<= 1)
6822 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6831 /* P is a string that will be used in a symbol. Mask out any characters
6832 that are not valid in that context. */
6835 clean_symbol_name (char *p)
6839 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6842 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6849 /* Generate a name for a special-purpose function function.
6850 The generated name may need to be unique across the whole link.
6851 TYPE is some string to identify the purpose of this function to the
6852 linker or collect2; it must start with an uppercase letter,
6854 I - for constructors
6856 N - for C++ anonymous namespaces
6857 F - for DWARF unwind frame information. */
6860 get_file_function_name (const char *type)
6866 /* If we already have a name we know to be unique, just use that. */
6867 if (first_global_object_name)
6868 p = first_global_object_name;
6869 /* If the target is handling the constructors/destructors, they
6870 will be local to this file and the name is only necessary for
6871 debugging purposes. */
6872 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6874 const char *file = main_input_filename;
6876 file = input_filename;
6877 /* Just use the file's basename, because the full pathname
6878 might be quite long. */
6879 p = strrchr (file, '/');
6884 p = q = ASTRDUP (p);
6885 clean_symbol_name (q);
6889 /* Otherwise, the name must be unique across the entire link.
6890 We don't have anything that we know to be unique to this translation
6891 unit, so use what we do have and throw in some randomness. */
6893 const char *name = weak_global_object_name;
6894 const char *file = main_input_filename;
6899 file = input_filename;
6901 len = strlen (file);
6902 q = (char *) alloca (9 * 2 + len + 1);
6903 memcpy (q, file, len + 1);
6904 clean_symbol_name (q);
6906 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6907 crc32_string (0, get_random_seed (false)));
6912 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
6915 /* Set up the name of the file-level functions we may need.
6916 Use a global object (which is already required to be unique over
6917 the program) rather than the file name (which imposes extra
6919 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6921 return get_identifier (buf);
6924 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6926 /* Complain that the tree code of NODE does not match the expected 0
6927 terminated list of trailing codes. The trailing code list can be
6928 empty, for a more vague error message. FILE, LINE, and FUNCTION
6929 are of the caller. */
6932 tree_check_failed (const_tree node, const char *file,
6933 int line, const char *function, ...)
6937 unsigned length = 0;
6940 va_start (args, function);
6941 while ((code = va_arg (args, int)))
6942 length += 4 + strlen (tree_code_name[code]);
6947 va_start (args, function);
6948 length += strlen ("expected ");
6949 buffer = tmp = (char *) alloca (length);
6951 while ((code = va_arg (args, int)))
6953 const char *prefix = length ? " or " : "expected ";
6955 strcpy (tmp + length, prefix);
6956 length += strlen (prefix);
6957 strcpy (tmp + length, tree_code_name[code]);
6958 length += strlen (tree_code_name[code]);
6963 buffer = "unexpected node";
6965 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6966 buffer, tree_code_name[TREE_CODE (node)],
6967 function, trim_filename (file), line);
6970 /* Complain that the tree code of NODE does match the expected 0
6971 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6975 tree_not_check_failed (const_tree node, const char *file,
6976 int line, const char *function, ...)
6980 unsigned length = 0;
6983 va_start (args, function);
6984 while ((code = va_arg (args, int)))
6985 length += 4 + strlen (tree_code_name[code]);
6987 va_start (args, function);
6988 buffer = (char *) alloca (length);
6990 while ((code = va_arg (args, int)))
6994 strcpy (buffer + length, " or ");
6997 strcpy (buffer + length, tree_code_name[code]);
6998 length += strlen (tree_code_name[code]);
7002 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
7003 buffer, tree_code_name[TREE_CODE (node)],
7004 function, trim_filename (file), line);
7007 /* Similar to tree_check_failed, except that we check for a class of tree
7008 code, given in CL. */
7011 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
7012 const char *file, int line, const char *function)
7015 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
7016 TREE_CODE_CLASS_STRING (cl),
7017 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
7018 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7021 /* Similar to tree_check_failed, except that instead of specifying a
7022 dozen codes, use the knowledge that they're all sequential. */
7025 tree_range_check_failed (const_tree node, const char *file, int line,
7026 const char *function, enum tree_code c1,
7030 unsigned length = 0;
7033 for (c = c1; c <= c2; ++c)
7034 length += 4 + strlen (tree_code_name[c]);
7036 length += strlen ("expected ");
7037 buffer = (char *) alloca (length);
7040 for (c = c1; c <= c2; ++c)
7042 const char *prefix = length ? " or " : "expected ";
7044 strcpy (buffer + length, prefix);
7045 length += strlen (prefix);
7046 strcpy (buffer + length, tree_code_name[c]);
7047 length += strlen (tree_code_name[c]);
7050 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7051 buffer, tree_code_name[TREE_CODE (node)],
7052 function, trim_filename (file), line);
7056 /* Similar to tree_check_failed, except that we check that a tree does
7057 not have the specified code, given in CL. */
7060 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
7061 const char *file, int line, const char *function)
7064 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
7065 TREE_CODE_CLASS_STRING (cl),
7066 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
7067 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7071 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
7074 omp_clause_check_failed (const_tree node, const char *file, int line,
7075 const char *function, enum omp_clause_code code)
7077 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
7078 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
7079 function, trim_filename (file), line);
7083 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
7086 omp_clause_range_check_failed (const_tree node, const char *file, int line,
7087 const char *function, enum omp_clause_code c1,
7088 enum omp_clause_code c2)
7091 unsigned length = 0;
7092 enum omp_clause_code c;
7094 for (c = c1; c <= c2; ++c)
7095 length += 4 + strlen (omp_clause_code_name[c]);
7097 length += strlen ("expected ");
7098 buffer = (char *) alloca (length);
7101 for (c = c1; c <= c2; ++c)
7103 const char *prefix = length ? " or " : "expected ";
7105 strcpy (buffer + length, prefix);
7106 length += strlen (prefix);
7107 strcpy (buffer + length, omp_clause_code_name[c]);
7108 length += strlen (omp_clause_code_name[c]);
7111 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7112 buffer, omp_clause_code_name[TREE_CODE (node)],
7113 function, trim_filename (file), line);
7117 #undef DEFTREESTRUCT
7118 #define DEFTREESTRUCT(VAL, NAME) NAME,
7120 static const char *ts_enum_names[] = {
7121 #include "treestruct.def"
7123 #undef DEFTREESTRUCT
7125 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
7127 /* Similar to tree_class_check_failed, except that we check for
7128 whether CODE contains the tree structure identified by EN. */
7131 tree_contains_struct_check_failed (const_tree node,
7132 const enum tree_node_structure_enum en,
7133 const char *file, int line,
7134 const char *function)
7137 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
7139 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7143 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
7144 (dynamically sized) vector. */
7147 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
7148 const char *function)
7151 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7152 idx + 1, len, function, trim_filename (file), line);
7155 /* Similar to above, except that the check is for the bounds of the operand
7156 vector of an expression node EXP. */
7159 tree_operand_check_failed (int idx, const_tree exp, const char *file,
7160 int line, const char *function)
7162 int code = TREE_CODE (exp);
7164 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7165 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
7166 function, trim_filename (file), line);
7169 /* Similar to above, except that the check is for the number of
7170 operands of an OMP_CLAUSE node. */
7173 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
7174 int line, const char *function)
7177 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7178 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
7179 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
7180 trim_filename (file), line);
7182 #endif /* ENABLE_TREE_CHECKING */
7184 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7185 and mapped to the machine mode MODE. Initialize its fields and build
7186 the information necessary for debugging output. */
7189 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
7192 hashval_t hashcode = 0;
7194 /* Build a main variant, based on the main variant of the inner type, then
7195 use it to build the variant we return. */
7196 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
7197 && TYPE_MAIN_VARIANT (innertype) != innertype)
7198 return build_type_attribute_qual_variant (
7199 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
7200 TYPE_ATTRIBUTES (innertype),
7201 TYPE_QUALS (innertype));
7203 t = make_node (VECTOR_TYPE);
7204 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
7205 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
7206 TYPE_MODE (t) = mode;
7207 TYPE_READONLY (t) = TYPE_READONLY (innertype);
7208 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
7210 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
7211 SET_TYPE_STRUCTURAL_EQUALITY (t);
7212 else if (TYPE_CANONICAL (innertype) != innertype
7213 || mode != VOIDmode)
7215 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
7220 tree index = build_int_cst (NULL_TREE, nunits - 1);
7221 tree array = build_array_type (innertype, build_index_type (index));
7222 tree rt = make_node (RECORD_TYPE);
7224 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
7225 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
7227 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
7228 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7229 the representation type, and we want to find that die when looking up
7230 the vector type. This is most easily achieved by making the TYPE_UID
7232 TYPE_UID (rt) = TYPE_UID (t);
7235 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
7236 hashcode = iterative_hash_host_wide_int (mode, hashcode);
7237 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
7238 return type_hash_canon (hashcode, t);
7242 make_or_reuse_type (unsigned size, int unsignedp)
7244 if (size == INT_TYPE_SIZE)
7245 return unsignedp ? unsigned_type_node : integer_type_node;
7246 if (size == CHAR_TYPE_SIZE)
7247 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
7248 if (size == SHORT_TYPE_SIZE)
7249 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
7250 if (size == LONG_TYPE_SIZE)
7251 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
7252 if (size == LONG_LONG_TYPE_SIZE)
7253 return (unsignedp ? long_long_unsigned_type_node
7254 : long_long_integer_type_node);
7257 return make_unsigned_type (size);
7259 return make_signed_type (size);
7262 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7265 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
7269 if (size == SHORT_FRACT_TYPE_SIZE)
7270 return unsignedp ? sat_unsigned_short_fract_type_node
7271 : sat_short_fract_type_node;
7272 if (size == FRACT_TYPE_SIZE)
7273 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
7274 if (size == LONG_FRACT_TYPE_SIZE)
7275 return unsignedp ? sat_unsigned_long_fract_type_node
7276 : sat_long_fract_type_node;
7277 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7278 return unsignedp ? sat_unsigned_long_long_fract_type_node
7279 : sat_long_long_fract_type_node;
7283 if (size == SHORT_FRACT_TYPE_SIZE)
7284 return unsignedp ? unsigned_short_fract_type_node
7285 : short_fract_type_node;
7286 if (size == FRACT_TYPE_SIZE)
7287 return unsignedp ? unsigned_fract_type_node : fract_type_node;
7288 if (size == LONG_FRACT_TYPE_SIZE)
7289 return unsignedp ? unsigned_long_fract_type_node
7290 : long_fract_type_node;
7291 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7292 return unsignedp ? unsigned_long_long_fract_type_node
7293 : long_long_fract_type_node;
7296 return make_fract_type (size, unsignedp, satp);
7299 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7302 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
7306 if (size == SHORT_ACCUM_TYPE_SIZE)
7307 return unsignedp ? sat_unsigned_short_accum_type_node
7308 : sat_short_accum_type_node;
7309 if (size == ACCUM_TYPE_SIZE)
7310 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
7311 if (size == LONG_ACCUM_TYPE_SIZE)
7312 return unsignedp ? sat_unsigned_long_accum_type_node
7313 : sat_long_accum_type_node;
7314 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7315 return unsignedp ? sat_unsigned_long_long_accum_type_node
7316 : sat_long_long_accum_type_node;
7320 if (size == SHORT_ACCUM_TYPE_SIZE)
7321 return unsignedp ? unsigned_short_accum_type_node
7322 : short_accum_type_node;
7323 if (size == ACCUM_TYPE_SIZE)
7324 return unsignedp ? unsigned_accum_type_node : accum_type_node;
7325 if (size == LONG_ACCUM_TYPE_SIZE)
7326 return unsignedp ? unsigned_long_accum_type_node
7327 : long_accum_type_node;
7328 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7329 return unsignedp ? unsigned_long_long_accum_type_node
7330 : long_long_accum_type_node;
7333 return make_accum_type (size, unsignedp, satp);
7336 /* Create nodes for all integer types (and error_mark_node) using the sizes
7337 of C datatypes. The caller should call set_sizetype soon after calling
7338 this function to select one of the types as sizetype. */
7341 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
7343 error_mark_node = make_node (ERROR_MARK);
7344 TREE_TYPE (error_mark_node) = error_mark_node;
7346 initialize_sizetypes (signed_sizetype);
7348 /* Define both `signed char' and `unsigned char'. */
7349 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
7350 TYPE_STRING_FLAG (signed_char_type_node) = 1;
7351 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
7352 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
7354 /* Define `char', which is like either `signed char' or `unsigned char'
7355 but not the same as either. */
7358 ? make_signed_type (CHAR_TYPE_SIZE)
7359 : make_unsigned_type (CHAR_TYPE_SIZE));
7360 TYPE_STRING_FLAG (char_type_node) = 1;
7362 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
7363 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
7364 integer_type_node = make_signed_type (INT_TYPE_SIZE);
7365 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
7366 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
7367 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
7368 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
7369 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
7371 /* Define a boolean type. This type only represents boolean values but
7372 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7373 Front ends which want to override this size (i.e. Java) can redefine
7374 boolean_type_node before calling build_common_tree_nodes_2. */
7375 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
7376 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
7377 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
7378 TYPE_PRECISION (boolean_type_node) = 1;
7380 /* Fill in the rest of the sized types. Reuse existing type nodes
7382 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
7383 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
7384 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
7385 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
7386 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
7388 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
7389 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
7390 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
7391 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
7392 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
7394 access_public_node = get_identifier ("public");
7395 access_protected_node = get_identifier ("protected");
7396 access_private_node = get_identifier ("private");
7399 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7400 It will create several other common tree nodes. */
7403 build_common_tree_nodes_2 (int short_double)
7405 /* Define these next since types below may used them. */
7406 integer_zero_node = build_int_cst (NULL_TREE, 0);
7407 integer_one_node = build_int_cst (NULL_TREE, 1);
7408 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
7410 size_zero_node = size_int (0);
7411 size_one_node = size_int (1);
7412 bitsize_zero_node = bitsize_int (0);
7413 bitsize_one_node = bitsize_int (1);
7414 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
7416 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
7417 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
7419 void_type_node = make_node (VOID_TYPE);
7420 layout_type (void_type_node);
7422 /* We are not going to have real types in C with less than byte alignment,
7423 so we might as well not have any types that claim to have it. */
7424 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
7425 TYPE_USER_ALIGN (void_type_node) = 0;
7427 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
7428 layout_type (TREE_TYPE (null_pointer_node));
7430 ptr_type_node = build_pointer_type (void_type_node);
7432 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
7433 fileptr_type_node = ptr_type_node;
7435 float_type_node = make_node (REAL_TYPE);
7436 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
7437 layout_type (float_type_node);
7439 double_type_node = make_node (REAL_TYPE);
7441 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
7443 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
7444 layout_type (double_type_node);
7446 long_double_type_node = make_node (REAL_TYPE);
7447 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
7448 layout_type (long_double_type_node);
7450 float_ptr_type_node = build_pointer_type (float_type_node);
7451 double_ptr_type_node = build_pointer_type (double_type_node);
7452 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7453 integer_ptr_type_node = build_pointer_type (integer_type_node);
7455 /* Fixed size integer types. */
7456 uint32_type_node = build_nonstandard_integer_type (32, true);
7457 uint64_type_node = build_nonstandard_integer_type (64, true);
7459 /* Decimal float types. */
7460 dfloat32_type_node = make_node (REAL_TYPE);
7461 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7462 layout_type (dfloat32_type_node);
7463 TYPE_MODE (dfloat32_type_node) = SDmode;
7464 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7466 dfloat64_type_node = make_node (REAL_TYPE);
7467 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7468 layout_type (dfloat64_type_node);
7469 TYPE_MODE (dfloat64_type_node) = DDmode;
7470 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7472 dfloat128_type_node = make_node (REAL_TYPE);
7473 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7474 layout_type (dfloat128_type_node);
7475 TYPE_MODE (dfloat128_type_node) = TDmode;
7476 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7478 complex_integer_type_node = build_complex_type (integer_type_node);
7479 complex_float_type_node = build_complex_type (float_type_node);
7480 complex_double_type_node = build_complex_type (double_type_node);
7481 complex_long_double_type_node = build_complex_type (long_double_type_node);
7483 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7484 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
7485 sat_ ## KIND ## _type_node = \
7486 make_sat_signed_ ## KIND ## _type (SIZE); \
7487 sat_unsigned_ ## KIND ## _type_node = \
7488 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7489 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7490 unsigned_ ## KIND ## _type_node = \
7491 make_unsigned_ ## KIND ## _type (SIZE);
7493 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
7494 sat_ ## WIDTH ## KIND ## _type_node = \
7495 make_sat_signed_ ## KIND ## _type (SIZE); \
7496 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7497 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7498 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7499 unsigned_ ## WIDTH ## KIND ## _type_node = \
7500 make_unsigned_ ## KIND ## _type (SIZE);
7502 /* Make fixed-point type nodes based on four different widths. */
7503 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7504 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7505 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
7506 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7507 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7509 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7510 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7511 NAME ## _type_node = \
7512 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7513 u ## NAME ## _type_node = \
7514 make_or_reuse_unsigned_ ## KIND ## _type \
7515 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7516 sat_ ## NAME ## _type_node = \
7517 make_or_reuse_sat_signed_ ## KIND ## _type \
7518 (GET_MODE_BITSIZE (MODE ## mode)); \
7519 sat_u ## NAME ## _type_node = \
7520 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7521 (GET_MODE_BITSIZE (U ## MODE ## mode));
7523 /* Fixed-point type and mode nodes. */
7524 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
7525 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
7526 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
7527 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
7528 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
7529 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
7530 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
7531 MAKE_FIXED_MODE_NODE (accum, ha, HA)
7532 MAKE_FIXED_MODE_NODE (accum, sa, SA)
7533 MAKE_FIXED_MODE_NODE (accum, da, DA)
7534 MAKE_FIXED_MODE_NODE (accum, ta, TA)
7537 tree t = targetm.build_builtin_va_list ();
7539 /* Many back-ends define record types without setting TYPE_NAME.
7540 If we copied the record type here, we'd keep the original
7541 record type without a name. This breaks name mangling. So,
7542 don't copy record types and let c_common_nodes_and_builtins()
7543 declare the type to be __builtin_va_list. */
7544 if (TREE_CODE (t) != RECORD_TYPE)
7545 t = build_variant_type_copy (t);
7547 va_list_type_node = t;
7551 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7554 local_define_builtin (const char *name, tree type, enum built_in_function code,
7555 const char *library_name, int ecf_flags)
7559 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7560 library_name, NULL_TREE);
7561 if (ecf_flags & ECF_CONST)
7562 TREE_READONLY (decl) = 1;
7563 if (ecf_flags & ECF_PURE)
7564 DECL_PURE_P (decl) = 1;
7565 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
7566 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
7567 if (ecf_flags & ECF_NORETURN)
7568 TREE_THIS_VOLATILE (decl) = 1;
7569 if (ecf_flags & ECF_NOTHROW)
7570 TREE_NOTHROW (decl) = 1;
7571 if (ecf_flags & ECF_MALLOC)
7572 DECL_IS_MALLOC (decl) = 1;
7574 built_in_decls[code] = decl;
7575 implicit_built_in_decls[code] = decl;
7578 /* Call this function after instantiating all builtins that the language
7579 front end cares about. This will build the rest of the builtins that
7580 are relied upon by the tree optimizers and the middle-end. */
7583 build_common_builtin_nodes (void)
7587 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7588 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7590 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7591 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7592 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7593 ftype = build_function_type (ptr_type_node, tmp);
7595 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7596 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7597 "memcpy", ECF_NOTHROW);
7598 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7599 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7600 "memmove", ECF_NOTHROW);
7603 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7605 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7606 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7607 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7608 ftype = build_function_type (integer_type_node, tmp);
7609 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7610 "memcmp", ECF_PURE | ECF_NOTHROW);
7613 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7615 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7616 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7617 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7618 ftype = build_function_type (ptr_type_node, tmp);
7619 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7620 "memset", ECF_NOTHROW);
7623 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7625 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7626 ftype = build_function_type (ptr_type_node, tmp);
7627 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7628 "alloca", ECF_NOTHROW | ECF_MALLOC);
7631 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7632 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7633 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7634 ftype = build_function_type (void_type_node, tmp);
7635 local_define_builtin ("__builtin_init_trampoline", ftype,
7636 BUILT_IN_INIT_TRAMPOLINE,
7637 "__builtin_init_trampoline", ECF_NOTHROW);
7639 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7640 ftype = build_function_type (ptr_type_node, tmp);
7641 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7642 BUILT_IN_ADJUST_TRAMPOLINE,
7643 "__builtin_adjust_trampoline",
7644 ECF_CONST | ECF_NOTHROW);
7646 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7647 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7648 ftype = build_function_type (void_type_node, tmp);
7649 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7650 BUILT_IN_NONLOCAL_GOTO,
7651 "__builtin_nonlocal_goto",
7652 ECF_NORETURN | ECF_NOTHROW);
7654 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7655 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7656 ftype = build_function_type (void_type_node, tmp);
7657 local_define_builtin ("__builtin_setjmp_setup", ftype,
7658 BUILT_IN_SETJMP_SETUP,
7659 "__builtin_setjmp_setup", ECF_NOTHROW);
7661 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7662 ftype = build_function_type (ptr_type_node, tmp);
7663 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7664 BUILT_IN_SETJMP_DISPATCHER,
7665 "__builtin_setjmp_dispatcher",
7666 ECF_PURE | ECF_NOTHROW);
7668 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7669 ftype = build_function_type (void_type_node, tmp);
7670 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7671 BUILT_IN_SETJMP_RECEIVER,
7672 "__builtin_setjmp_receiver", ECF_NOTHROW);
7674 ftype = build_function_type (ptr_type_node, void_list_node);
7675 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7676 "__builtin_stack_save", ECF_NOTHROW);
7678 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7679 ftype = build_function_type (void_type_node, tmp);
7680 local_define_builtin ("__builtin_stack_restore", ftype,
7681 BUILT_IN_STACK_RESTORE,
7682 "__builtin_stack_restore", ECF_NOTHROW);
7684 ftype = build_function_type (void_type_node, void_list_node);
7685 local_define_builtin ("__builtin_profile_func_enter", ftype,
7686 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7687 local_define_builtin ("__builtin_profile_func_exit", ftype,
7688 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7690 /* Complex multiplication and division. These are handled as builtins
7691 rather than optabs because emit_library_call_value doesn't support
7692 complex. Further, we can do slightly better with folding these
7693 beasties if the real and complex parts of the arguments are separate. */
7695 enum machine_mode mode;
7697 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7699 char mode_name_buf[4], *q;
7701 enum built_in_function mcode, dcode;
7702 tree type, inner_type;
7704 type = lang_hooks.types.type_for_mode (mode, 0);
7707 inner_type = TREE_TYPE (type);
7709 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7710 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7711 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7712 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7713 ftype = build_function_type (type, tmp);
7715 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7716 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7718 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7722 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7723 local_define_builtin (built_in_names[mcode], ftype, mcode,
7724 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7726 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7727 local_define_builtin (built_in_names[dcode], ftype, dcode,
7728 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7733 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7736 If we requested a pointer to a vector, build up the pointers that
7737 we stripped off while looking for the inner type. Similarly for
7738 return values from functions.
7740 The argument TYPE is the top of the chain, and BOTTOM is the
7741 new type which we will point to. */
7744 reconstruct_complex_type (tree type, tree bottom)
7748 if (TREE_CODE (type) == POINTER_TYPE)
7750 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7751 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
7752 TYPE_REF_CAN_ALIAS_ALL (type));
7754 else if (TREE_CODE (type) == REFERENCE_TYPE)
7756 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7757 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
7758 TYPE_REF_CAN_ALIAS_ALL (type));
7760 else if (TREE_CODE (type) == ARRAY_TYPE)
7762 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7763 outer = build_array_type (inner, TYPE_DOMAIN (type));
7765 else if (TREE_CODE (type) == FUNCTION_TYPE)
7767 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7768 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7770 else if (TREE_CODE (type) == METHOD_TYPE)
7772 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7773 /* The build_method_type_directly() routine prepends 'this' to argument list,
7774 so we must compensate by getting rid of it. */
7776 = build_method_type_directly
7777 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
7779 TREE_CHAIN (TYPE_ARG_TYPES (type)));
7781 else if (TREE_CODE (type) == OFFSET_TYPE)
7783 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7784 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
7789 return build_qualified_type (outer, TYPE_QUALS (type));
7792 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7795 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7799 switch (GET_MODE_CLASS (mode))
7801 case MODE_VECTOR_INT:
7802 case MODE_VECTOR_FLOAT:
7803 case MODE_VECTOR_FRACT:
7804 case MODE_VECTOR_UFRACT:
7805 case MODE_VECTOR_ACCUM:
7806 case MODE_VECTOR_UACCUM:
7807 nunits = GET_MODE_NUNITS (mode);
7811 /* Check that there are no leftover bits. */
7812 gcc_assert (GET_MODE_BITSIZE (mode)
7813 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7815 nunits = GET_MODE_BITSIZE (mode)
7816 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7823 return make_vector_type (innertype, nunits, mode);
7826 /* Similarly, but takes the inner type and number of units, which must be
7830 build_vector_type (tree innertype, int nunits)
7832 return make_vector_type (innertype, nunits, VOIDmode);
7836 /* Build RESX_EXPR with given REGION_NUMBER. */
7838 build_resx (int region_number)
7841 t = build1 (RESX_EXPR, void_type_node,
7842 build_int_cst (NULL_TREE, region_number));
7846 /* Given an initializer INIT, return TRUE if INIT is zero or some
7847 aggregate of zeros. Otherwise return FALSE. */
7849 initializer_zerop (const_tree init)
7855 switch (TREE_CODE (init))
7858 return integer_zerop (init);
7861 /* ??? Note that this is not correct for C4X float formats. There,
7862 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7863 negative exponent. */
7864 return real_zerop (init)
7865 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7868 return fixed_zerop (init);
7871 return integer_zerop (init)
7872 || (real_zerop (init)
7873 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7874 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7877 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7878 if (!initializer_zerop (TREE_VALUE (elt)))
7884 unsigned HOST_WIDE_INT idx;
7886 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7887 if (!initializer_zerop (elt))
7897 /* Build an empty statement. */
7900 build_empty_stmt (void)
7902 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7906 /* Build an OpenMP clause with code CODE. */
7909 build_omp_clause (enum omp_clause_code code)
7914 length = omp_clause_num_ops[code];
7915 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7917 t = GGC_NEWVAR (union tree_node, size);
7918 memset (t, 0, size);
7919 TREE_SET_CODE (t, OMP_CLAUSE);
7920 OMP_CLAUSE_SET_CODE (t, code);
7922 #ifdef GATHER_STATISTICS
7923 tree_node_counts[(int) omp_clause_kind]++;
7924 tree_node_sizes[(int) omp_clause_kind] += size;
7930 /* Set various status flags when building a CALL_EXPR object T. */
7933 process_call_operands (tree t)
7937 side_effects = TREE_SIDE_EFFECTS (t);
7941 n = TREE_OPERAND_LENGTH (t);
7942 for (i = 1; i < n; i++)
7944 tree op = TREE_OPERAND (t, i);
7945 if (op && TREE_SIDE_EFFECTS (op))
7956 /* Calls have side-effects, except those to const or
7958 i = call_expr_flags (t);
7959 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
7962 TREE_SIDE_EFFECTS (t) = side_effects;
7965 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7966 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7967 Except for the CODE and operand count field, other storage for the
7968 object is initialized to zeros. */
7971 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
7974 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
7976 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
7977 gcc_assert (len >= 1);
7979 #ifdef GATHER_STATISTICS
7980 tree_node_counts[(int) e_kind]++;
7981 tree_node_sizes[(int) e_kind] += length;
7984 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
7986 memset (t, 0, length);
7988 TREE_SET_CODE (t, code);
7990 /* Can't use TREE_OPERAND to store the length because if checking is
7991 enabled, it will try to check the length before we store it. :-P */
7992 t->exp.operands[0] = build_int_cst (sizetype, len);
7998 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7999 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
8003 build_call_list (tree return_type, tree fn, tree arglist)
8008 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
8009 TREE_TYPE (t) = return_type;
8010 CALL_EXPR_FN (t) = fn;
8011 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8012 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
8013 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
8014 process_call_operands (t);
8018 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8019 FN and a null static chain slot. NARGS is the number of call arguments
8020 which are specified as "..." arguments. */
8023 build_call_nary (tree return_type, tree fn, int nargs, ...)
8027 va_start (args, nargs);
8028 ret = build_call_valist (return_type, fn, nargs, args);
8033 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8034 FN and a null static chain slot. NARGS is the number of call arguments
8035 which are specified as a va_list ARGS. */
8038 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
8043 t = build_vl_exp (CALL_EXPR, nargs + 3);
8044 TREE_TYPE (t) = return_type;
8045 CALL_EXPR_FN (t) = fn;
8046 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8047 for (i = 0; i < nargs; i++)
8048 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
8049 process_call_operands (t);
8053 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8054 FN and a null static chain slot. NARGS is the number of call arguments
8055 which are specified as a tree array ARGS. */
8058 build_call_array (tree return_type, tree fn, int nargs, tree *args)
8063 t = build_vl_exp (CALL_EXPR, nargs + 3);
8064 TREE_TYPE (t) = return_type;
8065 CALL_EXPR_FN (t) = fn;
8066 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8067 for (i = 0; i < nargs; i++)
8068 CALL_EXPR_ARG (t, i) = args[i];
8069 process_call_operands (t);
8074 /* Returns true if it is possible to prove that the index of
8075 an array access REF (an ARRAY_REF expression) falls into the
8079 in_array_bounds_p (tree ref)
8081 tree idx = TREE_OPERAND (ref, 1);
8084 if (TREE_CODE (idx) != INTEGER_CST)
8087 min = array_ref_low_bound (ref);
8088 max = array_ref_up_bound (ref);
8091 || TREE_CODE (min) != INTEGER_CST
8092 || TREE_CODE (max) != INTEGER_CST)
8095 if (tree_int_cst_lt (idx, min)
8096 || tree_int_cst_lt (max, idx))
8102 /* Returns true if it is possible to prove that the range of
8103 an array access REF (an ARRAY_RANGE_REF expression) falls
8104 into the array bounds. */
8107 range_in_array_bounds_p (tree ref)
8109 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
8110 tree range_min, range_max, min, max;
8112 range_min = TYPE_MIN_VALUE (domain_type);
8113 range_max = TYPE_MAX_VALUE (domain_type);
8116 || TREE_CODE (range_min) != INTEGER_CST
8117 || TREE_CODE (range_max) != INTEGER_CST)
8120 min = array_ref_low_bound (ref);
8121 max = array_ref_up_bound (ref);
8124 || TREE_CODE (min) != INTEGER_CST
8125 || TREE_CODE (max) != INTEGER_CST)
8128 if (tree_int_cst_lt (range_min, min)
8129 || tree_int_cst_lt (max, range_max))
8135 /* Return true if T (assumed to be a DECL) must be assigned a memory
8139 needs_to_live_in_memory (const_tree t)
8141 if (TREE_CODE (t) == SSA_NAME)
8142 t = SSA_NAME_VAR (t);
8144 return (TREE_ADDRESSABLE (t)
8145 || is_global_var (t)
8146 || (TREE_CODE (t) == RESULT_DECL
8147 && aggregate_value_p (t, current_function_decl)));
8150 /* There are situations in which a language considers record types
8151 compatible which have different field lists. Decide if two fields
8152 are compatible. It is assumed that the parent records are compatible. */
8155 fields_compatible_p (const_tree f1, const_tree f2)
8157 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
8158 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
8161 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
8162 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
8165 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
8171 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8174 find_compatible_field (tree record, tree orig_field)
8178 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
8179 if (TREE_CODE (f) == FIELD_DECL
8180 && fields_compatible_p (f, orig_field))
8183 /* ??? Why isn't this on the main fields list? */
8184 f = TYPE_VFIELD (record);
8185 if (f && TREE_CODE (f) == FIELD_DECL
8186 && fields_compatible_p (f, orig_field))
8189 /* ??? We should abort here, but Java appears to do Bad Things
8190 with inherited fields. */
8194 /* Return value of a constant X and sign-extend it. */
8197 int_cst_value (const_tree x)
8199 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8200 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
8202 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8203 gcc_assert (TREE_INT_CST_HIGH (x) == 0
8204 || TREE_INT_CST_HIGH (x) == -1);
8206 if (bits < HOST_BITS_PER_WIDE_INT)
8208 bool negative = ((val >> (bits - 1)) & 1) != 0;
8210 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
8212 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
8218 /* If TYPE is an integral type, return an equivalent type which is
8219 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8220 return TYPE itself. */
8223 signed_or_unsigned_type_for (int unsignedp, tree type)
8226 if (POINTER_TYPE_P (type))
8229 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
8232 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
8235 /* Returns unsigned variant of TYPE. */
8238 unsigned_type_for (tree type)
8240 return signed_or_unsigned_type_for (1, type);
8243 /* Returns signed variant of TYPE. */
8246 signed_type_for (tree type)
8248 return signed_or_unsigned_type_for (0, type);
8251 /* Returns the largest value obtainable by casting something in INNER type to
8255 upper_bound_in_type (tree outer, tree inner)
8257 unsigned HOST_WIDE_INT lo, hi;
8258 unsigned int det = 0;
8259 unsigned oprec = TYPE_PRECISION (outer);
8260 unsigned iprec = TYPE_PRECISION (inner);
8263 /* Compute a unique number for every combination. */
8264 det |= (oprec > iprec) ? 4 : 0;
8265 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
8266 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
8268 /* Determine the exponent to use. */
8273 /* oprec <= iprec, outer: signed, inner: don't care. */
8278 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8282 /* oprec > iprec, outer: signed, inner: signed. */
8286 /* oprec > iprec, outer: signed, inner: unsigned. */
8290 /* oprec > iprec, outer: unsigned, inner: signed. */
8294 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8301 /* Compute 2^^prec - 1. */
8302 if (prec <= HOST_BITS_PER_WIDE_INT)
8305 lo = ((~(unsigned HOST_WIDE_INT) 0)
8306 >> (HOST_BITS_PER_WIDE_INT - prec));
8310 hi = ((~(unsigned HOST_WIDE_INT) 0)
8311 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
8312 lo = ~(unsigned HOST_WIDE_INT) 0;
8315 return build_int_cst_wide (outer, lo, hi);
8318 /* Returns the smallest value obtainable by casting something in INNER type to
8322 lower_bound_in_type (tree outer, tree inner)
8324 unsigned HOST_WIDE_INT lo, hi;
8325 unsigned oprec = TYPE_PRECISION (outer);
8326 unsigned iprec = TYPE_PRECISION (inner);
8328 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8330 if (TYPE_UNSIGNED (outer)
8331 /* If we are widening something of an unsigned type, OUTER type
8332 contains all values of INNER type. In particular, both INNER
8333 and OUTER types have zero in common. */
8334 || (oprec > iprec && TYPE_UNSIGNED (inner)))
8338 /* If we are widening a signed type to another signed type, we
8339 want to obtain -2^^(iprec-1). If we are keeping the
8340 precision or narrowing to a signed type, we want to obtain
8342 unsigned prec = oprec > iprec ? iprec : oprec;
8344 if (prec <= HOST_BITS_PER_WIDE_INT)
8346 hi = ~(unsigned HOST_WIDE_INT) 0;
8347 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
8351 hi = ((~(unsigned HOST_WIDE_INT) 0)
8352 << (prec - HOST_BITS_PER_WIDE_INT - 1));
8357 return build_int_cst_wide (outer, lo, hi);
8360 /* Return nonzero if two operands that are suitable for PHI nodes are
8361 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8362 SSA_NAME or invariant. Note that this is strictly an optimization.
8363 That is, callers of this function can directly call operand_equal_p
8364 and get the same result, only slower. */
8367 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
8371 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
8373 return operand_equal_p (arg0, arg1, 0);
8376 /* Returns number of zeros at the end of binary representation of X.
8378 ??? Use ffs if available? */
8381 num_ending_zeros (const_tree x)
8383 unsigned HOST_WIDE_INT fr, nfr;
8384 unsigned num, abits;
8385 tree type = TREE_TYPE (x);
8387 if (TREE_INT_CST_LOW (x) == 0)
8389 num = HOST_BITS_PER_WIDE_INT;
8390 fr = TREE_INT_CST_HIGH (x);
8395 fr = TREE_INT_CST_LOW (x);
8398 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
8401 if (nfr << abits == fr)
8408 if (num > TYPE_PRECISION (type))
8409 num = TYPE_PRECISION (type);
8411 return build_int_cst_type (type, num);
8415 #define WALK_SUBTREE(NODE) \
8418 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8424 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8425 be walked whenever a type is seen in the tree. Rest of operands and return
8426 value are as for walk_tree. */
8429 walk_type_fields (tree type, walk_tree_fn func, void *data,
8430 struct pointer_set_t *pset, walk_tree_lh lh)
8432 tree result = NULL_TREE;
8434 switch (TREE_CODE (type))
8437 case REFERENCE_TYPE:
8438 /* We have to worry about mutually recursive pointers. These can't
8439 be written in C. They can in Ada. It's pathological, but
8440 there's an ACATS test (c38102a) that checks it. Deal with this
8441 by checking if we're pointing to another pointer, that one
8442 points to another pointer, that one does too, and we have no htab.
8443 If so, get a hash table. We check three levels deep to avoid
8444 the cost of the hash table if we don't need one. */
8445 if (POINTER_TYPE_P (TREE_TYPE (type))
8446 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
8447 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
8450 result = walk_tree_without_duplicates (&TREE_TYPE (type),
8458 /* ... fall through ... */
8461 WALK_SUBTREE (TREE_TYPE (type));
8465 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
8470 WALK_SUBTREE (TREE_TYPE (type));
8474 /* We never want to walk into default arguments. */
8475 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
8476 WALK_SUBTREE (TREE_VALUE (arg));
8481 /* Don't follow this nodes's type if a pointer for fear that
8482 we'll have infinite recursion. If we have a PSET, then we
8485 || (!POINTER_TYPE_P (TREE_TYPE (type))
8486 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
8487 WALK_SUBTREE (TREE_TYPE (type));
8488 WALK_SUBTREE (TYPE_DOMAIN (type));
8492 WALK_SUBTREE (TREE_TYPE (type));
8493 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
8503 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8504 called with the DATA and the address of each sub-tree. If FUNC returns a
8505 non-NULL value, the traversal is stopped, and the value returned by FUNC
8506 is returned. If PSET is non-NULL it is used to record the nodes visited,
8507 and to avoid visiting a node more than once. */
8510 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
8511 struct pointer_set_t *pset, walk_tree_lh lh)
8513 enum tree_code code;
8517 #define WALK_SUBTREE_TAIL(NODE) \
8521 goto tail_recurse; \
8526 /* Skip empty subtrees. */
8530 /* Don't walk the same tree twice, if the user has requested
8531 that we avoid doing so. */
8532 if (pset && pointer_set_insert (pset, *tp))
8535 /* Call the function. */
8537 result = (*func) (tp, &walk_subtrees, data);
8539 /* If we found something, return it. */
8543 code = TREE_CODE (*tp);
8545 /* Even if we didn't, FUNC may have decided that there was nothing
8546 interesting below this point in the tree. */
8549 /* But we still need to check our siblings. */
8550 if (code == TREE_LIST)
8551 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8552 else if (code == OMP_CLAUSE)
8553 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8560 result = (*lh) (tp, &walk_subtrees, func, data, pset);
8561 if (result || !walk_subtrees)
8568 case IDENTIFIER_NODE:
8575 case PLACEHOLDER_EXPR:
8579 /* None of these have subtrees other than those already walked
8584 WALK_SUBTREE (TREE_VALUE (*tp));
8585 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8590 int len = TREE_VEC_LENGTH (*tp);
8595 /* Walk all elements but the first. */
8597 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8599 /* Now walk the first one as a tail call. */
8600 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8604 WALK_SUBTREE (TREE_REALPART (*tp));
8605 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8609 unsigned HOST_WIDE_INT idx;
8610 constructor_elt *ce;
8613 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8615 WALK_SUBTREE (ce->value);
8620 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8625 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8627 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8628 into declarations that are just mentioned, rather than
8629 declared; they don't really belong to this part of the tree.
8630 And, we can see cycles: the initializer for a declaration
8631 can refer to the declaration itself. */
8632 WALK_SUBTREE (DECL_INITIAL (decl));
8633 WALK_SUBTREE (DECL_SIZE (decl));
8634 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8636 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8639 case STATEMENT_LIST:
8641 tree_stmt_iterator i;
8642 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8643 WALK_SUBTREE (*tsi_stmt_ptr (i));
8648 switch (OMP_CLAUSE_CODE (*tp))
8650 case OMP_CLAUSE_PRIVATE:
8651 case OMP_CLAUSE_SHARED:
8652 case OMP_CLAUSE_FIRSTPRIVATE:
8653 case OMP_CLAUSE_COPYIN:
8654 case OMP_CLAUSE_COPYPRIVATE:
8656 case OMP_CLAUSE_NUM_THREADS:
8657 case OMP_CLAUSE_SCHEDULE:
8658 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8661 case OMP_CLAUSE_NOWAIT:
8662 case OMP_CLAUSE_ORDERED:
8663 case OMP_CLAUSE_DEFAULT:
8664 case OMP_CLAUSE_UNTIED:
8665 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8667 case OMP_CLAUSE_LASTPRIVATE:
8668 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
8669 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
8670 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8672 case OMP_CLAUSE_COLLAPSE:
8675 for (i = 0; i < 3; i++)
8676 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8677 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8680 case OMP_CLAUSE_REDUCTION:
8683 for (i = 0; i < 4; i++)
8684 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8685 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8697 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8698 But, we only want to walk once. */
8699 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8700 for (i = 0; i < len; ++i)
8701 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8702 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8705 case CHANGE_DYNAMIC_TYPE_EXPR:
8706 WALK_SUBTREE (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*tp));
8707 WALK_SUBTREE_TAIL (CHANGE_DYNAMIC_TYPE_LOCATION (*tp));
8710 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8711 defining. We only want to walk into these fields of a type in this
8712 case and not in the general case of a mere reference to the type.
8714 The criterion is as follows: if the field can be an expression, it
8715 must be walked only here. This should be in keeping with the fields
8716 that are directly gimplified in gimplify_type_sizes in order for the
8717 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8718 variable-sized types.
8720 Note that DECLs get walked as part of processing the BIND_EXPR. */
8721 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8723 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8724 if (TREE_CODE (*type_p) == ERROR_MARK)
8727 /* Call the function for the type. See if it returns anything or
8728 doesn't want us to continue. If we are to continue, walk both
8729 the normal fields and those for the declaration case. */
8730 result = (*func) (type_p, &walk_subtrees, data);
8731 if (result || !walk_subtrees)
8734 result = walk_type_fields (*type_p, func, data, pset, lh);
8738 /* If this is a record type, also walk the fields. */
8739 if (TREE_CODE (*type_p) == RECORD_TYPE
8740 || TREE_CODE (*type_p) == UNION_TYPE
8741 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8745 for (field = TYPE_FIELDS (*type_p); field;
8746 field = TREE_CHAIN (field))
8748 /* We'd like to look at the type of the field, but we can
8749 easily get infinite recursion. So assume it's pointed
8750 to elsewhere in the tree. Also, ignore things that
8752 if (TREE_CODE (field) != FIELD_DECL)
8755 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8756 WALK_SUBTREE (DECL_SIZE (field));
8757 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8758 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8759 WALK_SUBTREE (DECL_QUALIFIER (field));
8763 /* Same for scalar types. */
8764 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8765 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8766 || TREE_CODE (*type_p) == INTEGER_TYPE
8767 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
8768 || TREE_CODE (*type_p) == REAL_TYPE)
8770 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8771 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8774 WALK_SUBTREE (TYPE_SIZE (*type_p));
8775 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8780 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
8784 /* Walk over all the sub-trees of this operand. */
8785 len = TREE_OPERAND_LENGTH (*tp);
8787 /* Go through the subtrees. We need to do this in forward order so
8788 that the scope of a FOR_EXPR is handled properly. */
8791 for (i = 0; i < len - 1; ++i)
8792 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8793 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
8796 /* If this is a type, walk the needed fields in the type. */
8797 else if (TYPE_P (*tp))
8798 return walk_type_fields (*tp, func, data, pset, lh);
8802 /* We didn't find what we were looking for. */
8805 #undef WALK_SUBTREE_TAIL
8809 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8812 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
8816 struct pointer_set_t *pset;
8818 pset = pointer_set_create ();
8819 result = walk_tree_1 (tp, func, data, pset, lh);
8820 pointer_set_destroy (pset);
8828 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8830 if (IS_EXPR_CODE_CLASS (c))
8831 return &t->exp.block;
8836 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8837 FIXME: don't use this function. It exists for compatibility with
8838 the old representation of CALL_EXPRs where a list was used to hold the
8839 arguments. Places that currently extract the arglist from a CALL_EXPR
8840 ought to be rewritten to use the CALL_EXPR itself. */
8842 call_expr_arglist (tree exp)
8844 tree arglist = NULL_TREE;
8846 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
8847 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
8852 /* Create a nameless artificial label and put it in the current function
8853 context. Returns the newly created label. */
8856 create_artificial_label (void)
8858 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
8860 DECL_ARTIFICIAL (lab) = 1;
8861 DECL_IGNORED_P (lab) = 1;
8862 DECL_CONTEXT (lab) = current_function_decl;
8866 /* Given a tree, try to return a useful variable name that we can use
8867 to prefix a temporary that is being assigned the value of the tree.
8868 I.E. given <temp> = &A, return A. */
8876 STRIP_NOPS (stripped_decl);
8877 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
8878 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
8881 switch (TREE_CODE (stripped_decl))
8884 return get_name (TREE_OPERAND (stripped_decl, 0));
8891 /* Return true if TYPE has a variable argument list. */
8894 stdarg_p (tree fntype)
8896 function_args_iterator args_iter;
8897 tree n = NULL_TREE, t;
8902 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8907 return n != NULL_TREE && n != void_type_node;
8910 /* Return true if TYPE has a prototype. */
8913 prototype_p (tree fntype)
8917 gcc_assert (fntype != NULL_TREE);
8919 t = TYPE_ARG_TYPES (fntype);
8920 return (t != NULL_TREE);
8923 /* Return the number of arguments that a function has. */
8926 function_args_count (tree fntype)
8928 function_args_iterator args_iter;
8934 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8943 /* If BLOCK is inlined from an __attribute__((__artificial__))
8944 routine, return pointer to location from where it has been
8947 block_nonartificial_location (tree block)
8949 location_t *ret = NULL;
8951 while (block && TREE_CODE (block) == BLOCK
8952 && BLOCK_ABSTRACT_ORIGIN (block))
8954 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
8956 while (TREE_CODE (ao) == BLOCK
8957 && BLOCK_ABSTRACT_ORIGIN (ao)
8958 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
8959 ao = BLOCK_ABSTRACT_ORIGIN (ao);
8961 if (TREE_CODE (ao) == FUNCTION_DECL)
8963 /* If AO is an artificial inline, point RET to the
8964 call site locus at which it has been inlined and continue
8965 the loop, in case AO's caller is also an artificial
8967 if (DECL_DECLARED_INLINE_P (ao)
8968 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
8969 ret = &BLOCK_SOURCE_LOCATION (block);
8973 else if (TREE_CODE (ao) != BLOCK)
8976 block = BLOCK_SUPERCONTEXT (block);
8981 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
8984 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
8987 cl_option_hash_hash (const void *x)
8989 const_tree const t = (const_tree) x;
8995 if (TREE_CODE (t) == OPTIMIZATION_NODE)
8997 p = (const char *)TREE_OPTIMIZATION (t);
8998 len = sizeof (struct cl_optimization);
9001 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
9003 p = (const char *)TREE_TARGET_OPTION (t);
9004 len = sizeof (struct cl_target_option);
9010 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
9012 for (i = 0; i < len; i++)
9014 hash = (hash << 4) ^ ((i << 2) | p[i]);
9019 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
9020 TARGET_OPTION tree node) is the same as that given by *Y, which is the
9024 cl_option_hash_eq (const void *x, const void *y)
9026 const_tree const xt = (const_tree) x;
9027 const_tree const yt = (const_tree) y;
9032 if (TREE_CODE (xt) != TREE_CODE (yt))
9035 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
9037 xp = (const char *)TREE_OPTIMIZATION (xt);
9038 yp = (const char *)TREE_OPTIMIZATION (yt);
9039 len = sizeof (struct cl_optimization);
9042 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
9044 xp = (const char *)TREE_TARGET_OPTION (xt);
9045 yp = (const char *)TREE_TARGET_OPTION (yt);
9046 len = sizeof (struct cl_target_option);
9052 return (memcmp (xp, yp, len) == 0);
9055 /* Build an OPTIMIZATION_NODE based on the current options. */
9058 build_optimization_node (void)
9063 /* Use the cache of optimization nodes. */
9065 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
9067 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
9071 /* Insert this one into the hash table. */
9072 t = cl_optimization_node;
9075 /* Make a new node for next time round. */
9076 cl_optimization_node = make_node (OPTIMIZATION_NODE);
9082 /* Build a TARGET_OPTION_NODE based on the current options. */
9085 build_target_option_node (void)
9090 /* Use the cache of optimization nodes. */
9092 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
9094 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
9098 /* Insert this one into the hash table. */
9099 t = cl_target_option_node;
9102 /* Make a new node for next time round. */
9103 cl_target_option_node = make_node (TARGET_OPTION_NODE);
9109 #include "gt-tree.h"