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, 2009, 2010,
4 2011 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"
44 #include "filenames.h"
47 #include "common/common-target.h"
48 #include "langhooks.h"
49 #include "tree-inline.h"
50 #include "tree-iterator.h"
51 #include "basic-block.h"
52 #include "tree-flow.h"
54 #include "pointer-set.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
58 #include "tree-diagnostic.h"
59 #include "tree-pretty-print.h"
66 /* Tree code classes. */
68 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
69 #define END_OF_BASE_TREE_CODES tcc_exceptional,
71 const enum tree_code_class tree_code_type[] = {
72 #include "all-tree.def"
76 #undef END_OF_BASE_TREE_CODES
78 /* Table indexed by tree code giving number of expression
79 operands beyond the fixed part of the node structure.
80 Not used for types or decls. */
82 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
83 #define END_OF_BASE_TREE_CODES 0,
85 const unsigned char tree_code_length[] = {
86 #include "all-tree.def"
90 #undef END_OF_BASE_TREE_CODES
92 /* Names of tree components.
93 Used for printing out the tree and error messages. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
95 #define END_OF_BASE_TREE_CODES "@dummy",
97 const char *const tree_code_name[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Each tree code class has an associated string representation.
105 These must correspond to the tree_code_class entries. */
107 const char *const tree_code_class_strings[] =
122 /* obstack.[ch] explicitly declined to prototype this. */
123 extern int _obstack_allocated_p (struct obstack *h, void *obj);
125 #ifdef GATHER_STATISTICS
126 /* Statistics-gathering stuff. */
128 static int tree_code_counts[MAX_TREE_CODES];
129 int tree_node_counts[(int) all_kinds];
130 int tree_node_sizes[(int) all_kinds];
132 /* Keep in sync with tree.h:enum tree_node_kind. */
133 static const char * const tree_node_kind_names[] = {
151 #endif /* GATHER_STATISTICS */
153 /* Unique id for next decl created. */
154 static GTY(()) int next_decl_uid;
155 /* Unique id for next type created. */
156 static GTY(()) int next_type_uid = 1;
157 /* Unique id for next debug decl created. Use negative numbers,
158 to catch erroneous uses. */
159 static GTY(()) int next_debug_decl_uid;
161 /* Since we cannot rehash a type after it is in the table, we have to
162 keep the hash code. */
164 struct GTY(()) type_hash {
169 /* Initial size of the hash table (rounded to next prime). */
170 #define TYPE_HASH_INITIAL_SIZE 1000
172 /* Now here is the hash table. When recording a type, it is added to
173 the slot whose index is the hash code. Note that the hash table is
174 used for several kinds of types (function types, array types and
175 array index range types, for now). While all these live in the
176 same table, they are completely independent, and the hash code is
177 computed differently for each of these. */
179 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
180 htab_t type_hash_table;
182 /* Hash table and temporary node for larger integer const values. */
183 static GTY (()) tree int_cst_node;
184 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
185 htab_t int_cst_hash_table;
187 /* Hash table for optimization flags and target option flags. Use the same
188 hash table for both sets of options. Nodes for building the current
189 optimization and target option nodes. The assumption is most of the time
190 the options created will already be in the hash table, so we avoid
191 allocating and freeing up a node repeatably. */
192 static GTY (()) tree cl_optimization_node;
193 static GTY (()) tree cl_target_option_node;
194 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
195 htab_t cl_option_hash_table;
197 /* General tree->tree mapping structure for use in hash tables. */
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
201 htab_t debug_expr_for_decl;
203 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
204 htab_t value_expr_for_decl;
206 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map)))
207 htab_t debug_args_for_decl;
209 static GTY ((if_marked ("tree_priority_map_marked_p"),
210 param_is (struct tree_priority_map)))
211 htab_t init_priority_for_decl;
213 static void set_type_quals (tree, int);
214 static int type_hash_eq (const void *, const void *);
215 static hashval_t type_hash_hash (const void *);
216 static hashval_t int_cst_hash_hash (const void *);
217 static int int_cst_hash_eq (const void *, const void *);
218 static hashval_t cl_option_hash_hash (const void *);
219 static int cl_option_hash_eq (const void *, const void *);
220 static void print_type_hash_statistics (void);
221 static void print_debug_expr_statistics (void);
222 static void print_value_expr_statistics (void);
223 static int type_hash_marked_p (const void *);
224 static unsigned int type_hash_list (const_tree, hashval_t);
225 static unsigned int attribute_hash_list (const_tree, hashval_t);
227 tree global_trees[TI_MAX];
228 tree integer_types[itk_none];
230 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
232 /* Number of operands for each OpenMP clause. */
233 unsigned const char omp_clause_num_ops[] =
235 0, /* OMP_CLAUSE_ERROR */
236 1, /* OMP_CLAUSE_PRIVATE */
237 1, /* OMP_CLAUSE_SHARED */
238 1, /* OMP_CLAUSE_FIRSTPRIVATE */
239 2, /* OMP_CLAUSE_LASTPRIVATE */
240 4, /* OMP_CLAUSE_REDUCTION */
241 1, /* OMP_CLAUSE_COPYIN */
242 1, /* OMP_CLAUSE_COPYPRIVATE */
243 1, /* OMP_CLAUSE_IF */
244 1, /* OMP_CLAUSE_NUM_THREADS */
245 1, /* OMP_CLAUSE_SCHEDULE */
246 0, /* OMP_CLAUSE_NOWAIT */
247 0, /* OMP_CLAUSE_ORDERED */
248 0, /* OMP_CLAUSE_DEFAULT */
249 3, /* OMP_CLAUSE_COLLAPSE */
250 0, /* OMP_CLAUSE_UNTIED */
251 1, /* OMP_CLAUSE_FINAL */
252 0 /* OMP_CLAUSE_MERGEABLE */
255 const char * const omp_clause_code_name[] =
278 /* Return the tree node structure used by tree code CODE. */
280 static inline enum tree_node_structure_enum
281 tree_node_structure_for_code (enum tree_code code)
283 switch (TREE_CODE_CLASS (code))
285 case tcc_declaration:
290 return TS_FIELD_DECL;
296 return TS_LABEL_DECL;
298 return TS_RESULT_DECL;
299 case DEBUG_EXPR_DECL:
302 return TS_CONST_DECL;
306 return TS_FUNCTION_DECL;
307 case TRANSLATION_UNIT_DECL:
308 return TS_TRANSLATION_UNIT_DECL;
310 return TS_DECL_NON_COMMON;
314 return TS_TYPE_NON_COMMON;
323 default: /* tcc_constant and tcc_exceptional */
328 /* tcc_constant cases. */
329 case INTEGER_CST: return TS_INT_CST;
330 case REAL_CST: return TS_REAL_CST;
331 case FIXED_CST: return TS_FIXED_CST;
332 case COMPLEX_CST: return TS_COMPLEX;
333 case VECTOR_CST: return TS_VECTOR;
334 case STRING_CST: return TS_STRING;
335 /* tcc_exceptional cases. */
336 case ERROR_MARK: return TS_COMMON;
337 case IDENTIFIER_NODE: return TS_IDENTIFIER;
338 case TREE_LIST: return TS_LIST;
339 case TREE_VEC: return TS_VEC;
340 case SSA_NAME: return TS_SSA_NAME;
341 case PLACEHOLDER_EXPR: return TS_COMMON;
342 case STATEMENT_LIST: return TS_STATEMENT_LIST;
343 case BLOCK: return TS_BLOCK;
344 case CONSTRUCTOR: return TS_CONSTRUCTOR;
345 case TREE_BINFO: return TS_BINFO;
346 case OMP_CLAUSE: return TS_OMP_CLAUSE;
347 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
348 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
356 /* Initialize tree_contains_struct to describe the hierarchy of tree
360 initialize_tree_contains_struct (void)
364 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
367 enum tree_node_structure_enum ts_code;
369 code = (enum tree_code) i;
370 ts_code = tree_node_structure_for_code (code);
372 /* Mark the TS structure itself. */
373 tree_contains_struct[code][ts_code] = 1;
375 /* Mark all the structures that TS is derived from. */
393 case TS_STATEMENT_LIST:
394 MARK_TS_TYPED (code);
398 case TS_DECL_MINIMAL:
404 case TS_OPTIMIZATION:
405 case TS_TARGET_OPTION:
406 MARK_TS_COMMON (code);
409 case TS_TYPE_WITH_LANG_SPECIFIC:
410 MARK_TS_TYPE_COMMON (code);
413 case TS_TYPE_NON_COMMON:
414 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code);
418 MARK_TS_DECL_MINIMAL (code);
423 MARK_TS_DECL_COMMON (code);
426 case TS_DECL_NON_COMMON:
427 MARK_TS_DECL_WITH_VIS (code);
430 case TS_DECL_WITH_VIS:
434 MARK_TS_DECL_WRTL (code);
438 MARK_TS_DECL_COMMON (code);
442 MARK_TS_DECL_WITH_VIS (code);
446 case TS_FUNCTION_DECL:
447 MARK_TS_DECL_NON_COMMON (code);
450 case TS_TRANSLATION_UNIT_DECL:
451 MARK_TS_DECL_COMMON (code);
459 /* Basic consistency checks for attributes used in fold. */
460 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
461 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
462 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
463 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
464 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
465 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
466 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
467 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
468 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
469 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
470 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
471 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
472 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
473 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
474 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
475 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
476 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
477 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
478 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
479 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
480 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
481 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
482 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
483 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
484 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
485 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
486 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
487 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
489 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
490 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
491 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
492 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
493 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
494 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
495 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
496 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
506 /* Initialize the hash table of types. */
507 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
510 debug_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
511 tree_decl_map_eq, 0);
513 value_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
514 tree_decl_map_eq, 0);
515 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
516 tree_priority_map_eq, 0);
518 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
519 int_cst_hash_eq, NULL);
521 int_cst_node = make_node (INTEGER_CST);
523 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
524 cl_option_hash_eq, NULL);
526 cl_optimization_node = make_node (OPTIMIZATION_NODE);
527 cl_target_option_node = make_node (TARGET_OPTION_NODE);
529 /* Initialize the tree_contains_struct array. */
530 initialize_tree_contains_struct ();
531 lang_hooks.init_ts ();
535 /* The name of the object as the assembler will see it (but before any
536 translations made by ASM_OUTPUT_LABELREF). Often this is the same
537 as DECL_NAME. It is an IDENTIFIER_NODE. */
539 decl_assembler_name (tree decl)
541 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
542 lang_hooks.set_decl_assembler_name (decl);
543 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
546 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
549 decl_assembler_name_equal (tree decl, const_tree asmname)
551 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
552 const char *decl_str;
553 const char *asmname_str;
556 if (decl_asmname == asmname)
559 decl_str = IDENTIFIER_POINTER (decl_asmname);
560 asmname_str = IDENTIFIER_POINTER (asmname);
563 /* If the target assembler name was set by the user, things are trickier.
564 We have a leading '*' to begin with. After that, it's arguable what
565 is the correct thing to do with -fleading-underscore. Arguably, we've
566 historically been doing the wrong thing in assemble_alias by always
567 printing the leading underscore. Since we're not changing that, make
568 sure user_label_prefix follows the '*' before matching. */
569 if (decl_str[0] == '*')
571 size_t ulp_len = strlen (user_label_prefix);
577 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
578 decl_str += ulp_len, test=true;
582 if (asmname_str[0] == '*')
584 size_t ulp_len = strlen (user_label_prefix);
590 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
591 asmname_str += ulp_len, test=true;
598 return strcmp (decl_str, asmname_str) == 0;
601 /* Hash asmnames ignoring the user specified marks. */
604 decl_assembler_name_hash (const_tree asmname)
606 if (IDENTIFIER_POINTER (asmname)[0] == '*')
608 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
609 size_t ulp_len = strlen (user_label_prefix);
613 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
616 return htab_hash_string (decl_str);
619 return htab_hash_string (IDENTIFIER_POINTER (asmname));
622 /* Compute the number of bytes occupied by a tree with code CODE.
623 This function cannot be used for nodes that have variable sizes,
624 including TREE_VEC, STRING_CST, and CALL_EXPR. */
626 tree_code_size (enum tree_code code)
628 switch (TREE_CODE_CLASS (code))
630 case tcc_declaration: /* A decl node */
635 return sizeof (struct tree_field_decl);
637 return sizeof (struct tree_parm_decl);
639 return sizeof (struct tree_var_decl);
641 return sizeof (struct tree_label_decl);
643 return sizeof (struct tree_result_decl);
645 return sizeof (struct tree_const_decl);
647 return sizeof (struct tree_type_decl);
649 return sizeof (struct tree_function_decl);
650 case DEBUG_EXPR_DECL:
651 return sizeof (struct tree_decl_with_rtl);
653 return sizeof (struct tree_decl_non_common);
657 case tcc_type: /* a type node */
658 return sizeof (struct tree_type_non_common);
660 case tcc_reference: /* a reference */
661 case tcc_expression: /* an expression */
662 case tcc_statement: /* an expression with side effects */
663 case tcc_comparison: /* a comparison expression */
664 case tcc_unary: /* a unary arithmetic expression */
665 case tcc_binary: /* a binary arithmetic expression */
666 return (sizeof (struct tree_exp)
667 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
669 case tcc_constant: /* a constant */
672 case INTEGER_CST: return sizeof (struct tree_int_cst);
673 case REAL_CST: return sizeof (struct tree_real_cst);
674 case FIXED_CST: return sizeof (struct tree_fixed_cst);
675 case COMPLEX_CST: return sizeof (struct tree_complex);
676 case VECTOR_CST: return sizeof (struct tree_vector);
677 case STRING_CST: gcc_unreachable ();
679 return lang_hooks.tree_size (code);
682 case tcc_exceptional: /* something random, like an identifier. */
685 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
686 case TREE_LIST: return sizeof (struct tree_list);
689 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
692 case OMP_CLAUSE: gcc_unreachable ();
694 case SSA_NAME: return sizeof (struct tree_ssa_name);
696 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
697 case BLOCK: return sizeof (struct tree_block);
698 case CONSTRUCTOR: return sizeof (struct tree_constructor);
699 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
700 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
703 return lang_hooks.tree_size (code);
711 /* Compute the number of bytes occupied by NODE. This routine only
712 looks at TREE_CODE, except for those nodes that have variable sizes. */
714 tree_size (const_tree node)
716 const enum tree_code code = TREE_CODE (node);
720 return (offsetof (struct tree_binfo, base_binfos)
721 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
724 return (sizeof (struct tree_vec)
725 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
728 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
731 return (sizeof (struct tree_omp_clause)
732 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
736 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
737 return (sizeof (struct tree_exp)
738 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
740 return tree_code_size (code);
744 /* Record interesting allocation statistics for a tree node with CODE
748 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED,
749 size_t length ATTRIBUTE_UNUSED)
751 #ifdef GATHER_STATISTICS
752 enum tree_code_class type = TREE_CODE_CLASS (code);
757 case tcc_declaration: /* A decl node */
761 case tcc_type: /* a type node */
765 case tcc_statement: /* an expression with side effects */
769 case tcc_reference: /* a reference */
773 case tcc_expression: /* an expression */
774 case tcc_comparison: /* a comparison expression */
775 case tcc_unary: /* a unary arithmetic expression */
776 case tcc_binary: /* a binary arithmetic expression */
780 case tcc_constant: /* a constant */
784 case tcc_exceptional: /* something random, like an identifier. */
787 case IDENTIFIER_NODE:
800 kind = ssa_name_kind;
812 kind = omp_clause_kind;
829 tree_code_counts[(int) code]++;
830 tree_node_counts[(int) kind]++;
831 tree_node_sizes[(int) kind] += length;
835 /* Allocate and return a new UID from the DECL_UID namespace. */
838 allocate_decl_uid (void)
840 return next_decl_uid++;
843 /* Return a newly allocated node of code CODE. For decl and type
844 nodes, some other fields are initialized. The rest of the node is
845 initialized to zero. This function cannot be used for TREE_VEC or
846 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
848 Achoo! I got a code in the node. */
851 make_node_stat (enum tree_code code MEM_STAT_DECL)
854 enum tree_code_class type = TREE_CODE_CLASS (code);
855 size_t length = tree_code_size (code);
857 record_node_allocation_statistics (code, length);
859 t = ggc_alloc_zone_cleared_tree_node_stat (
860 (code == IDENTIFIER_NODE) ? &tree_id_zone : &tree_zone,
861 length PASS_MEM_STAT);
862 TREE_SET_CODE (t, code);
867 TREE_SIDE_EFFECTS (t) = 1;
870 case tcc_declaration:
871 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
873 if (code == FUNCTION_DECL)
875 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
876 DECL_MODE (t) = FUNCTION_MODE;
881 DECL_SOURCE_LOCATION (t) = input_location;
882 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
883 DECL_UID (t) = --next_debug_decl_uid;
886 DECL_UID (t) = allocate_decl_uid ();
887 SET_DECL_PT_UID (t, -1);
889 if (TREE_CODE (t) == LABEL_DECL)
890 LABEL_DECL_UID (t) = -1;
895 TYPE_UID (t) = next_type_uid++;
896 TYPE_ALIGN (t) = BITS_PER_UNIT;
897 TYPE_USER_ALIGN (t) = 0;
898 TYPE_MAIN_VARIANT (t) = t;
899 TYPE_CANONICAL (t) = t;
901 /* Default to no attributes for type, but let target change that. */
902 TYPE_ATTRIBUTES (t) = NULL_TREE;
903 targetm.set_default_type_attributes (t);
905 /* We have not yet computed the alias set for this type. */
906 TYPE_ALIAS_SET (t) = -1;
910 TREE_CONSTANT (t) = 1;
919 case PREDECREMENT_EXPR:
920 case PREINCREMENT_EXPR:
921 case POSTDECREMENT_EXPR:
922 case POSTINCREMENT_EXPR:
923 /* All of these have side-effects, no matter what their
925 TREE_SIDE_EFFECTS (t) = 1;
934 /* Other classes need no special treatment. */
941 /* Return a new node with the same contents as NODE except that its
942 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
945 copy_node_stat (tree node MEM_STAT_DECL)
948 enum tree_code code = TREE_CODE (node);
951 gcc_assert (code != STATEMENT_LIST);
953 length = tree_size (node);
954 record_node_allocation_statistics (code, length);
955 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
956 memcpy (t, node, length);
958 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
960 TREE_ASM_WRITTEN (t) = 0;
961 TREE_VISITED (t) = 0;
962 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
963 *DECL_VAR_ANN_PTR (t) = 0;
965 if (TREE_CODE_CLASS (code) == tcc_declaration)
967 if (code == DEBUG_EXPR_DECL)
968 DECL_UID (t) = --next_debug_decl_uid;
971 DECL_UID (t) = allocate_decl_uid ();
972 if (DECL_PT_UID_SET_P (node))
973 SET_DECL_PT_UID (t, DECL_PT_UID (node));
975 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
976 && DECL_HAS_VALUE_EXPR_P (node))
978 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
979 DECL_HAS_VALUE_EXPR_P (t) = 1;
981 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
983 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
984 DECL_HAS_INIT_PRIORITY_P (t) = 1;
987 else if (TREE_CODE_CLASS (code) == tcc_type)
989 TYPE_UID (t) = next_type_uid++;
990 /* The following is so that the debug code for
991 the copy is different from the original type.
992 The two statements usually duplicate each other
993 (because they clear fields of the same union),
994 but the optimizer should catch that. */
995 TYPE_SYMTAB_POINTER (t) = 0;
996 TYPE_SYMTAB_ADDRESS (t) = 0;
998 /* Do not copy the values cache. */
999 if (TYPE_CACHED_VALUES_P(t))
1001 TYPE_CACHED_VALUES_P (t) = 0;
1002 TYPE_CACHED_VALUES (t) = NULL_TREE;
1009 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1010 For example, this can copy a list made of TREE_LIST nodes. */
1013 copy_list (tree list)
1021 head = prev = copy_node (list);
1022 next = TREE_CHAIN (list);
1025 TREE_CHAIN (prev) = copy_node (next);
1026 prev = TREE_CHAIN (prev);
1027 next = TREE_CHAIN (next);
1033 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1036 build_int_cst (tree type, HOST_WIDE_INT low)
1038 /* Support legacy code. */
1040 type = integer_type_node;
1042 return double_int_to_tree (type, shwi_to_double_int (low));
1045 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1048 build_int_cst_type (tree type, HOST_WIDE_INT low)
1052 return double_int_to_tree (type, shwi_to_double_int (low));
1055 /* Constructs tree in type TYPE from with value given by CST. Signedness
1056 of CST is assumed to be the same as the signedness of TYPE. */
1059 double_int_to_tree (tree type, double_int cst)
1061 /* Size types *are* sign extended. */
1062 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1063 || (TREE_CODE (type) == INTEGER_TYPE
1064 && TYPE_IS_SIZETYPE (type)));
1066 cst = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1068 return build_int_cst_wide (type, cst.low, cst.high);
1071 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1072 to be the same as the signedness of TYPE. */
1075 double_int_fits_to_tree_p (const_tree type, double_int cst)
1077 /* Size types *are* sign extended. */
1078 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1079 || (TREE_CODE (type) == INTEGER_TYPE
1080 && TYPE_IS_SIZETYPE (type)));
1083 = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1085 return double_int_equal_p (cst, ext);
1088 /* We force the double_int CST to the range of the type TYPE by sign or
1089 zero extending it. OVERFLOWABLE indicates if we are interested in
1090 overflow of the value, when >0 we are only interested in signed
1091 overflow, for <0 we are interested in any overflow. OVERFLOWED
1092 indicates whether overflow has already occurred. CONST_OVERFLOWED
1093 indicates whether constant overflow has already occurred. We force
1094 T's value to be within range of T's type (by setting to 0 or 1 all
1095 the bits outside the type's range). We set TREE_OVERFLOWED if,
1096 OVERFLOWED is nonzero,
1097 or OVERFLOWABLE is >0 and signed overflow occurs
1098 or OVERFLOWABLE is <0 and any overflow occurs
1099 We return a new tree node for the extended double_int. The node
1100 is shared if no overflow flags are set. */
1104 force_fit_type_double (tree type, double_int cst, int overflowable,
1107 bool sign_extended_type;
1109 /* Size types *are* sign extended. */
1110 sign_extended_type = (!TYPE_UNSIGNED (type)
1111 || (TREE_CODE (type) == INTEGER_TYPE
1112 && TYPE_IS_SIZETYPE (type)));
1114 /* If we need to set overflow flags, return a new unshared node. */
1115 if (overflowed || !double_int_fits_to_tree_p(type, cst))
1119 || (overflowable > 0 && sign_extended_type))
1121 tree t = make_node (INTEGER_CST);
1122 TREE_INT_CST (t) = double_int_ext (cst, TYPE_PRECISION (type),
1123 !sign_extended_type);
1124 TREE_TYPE (t) = type;
1125 TREE_OVERFLOW (t) = 1;
1130 /* Else build a shared node. */
1131 return double_int_to_tree (type, cst);
1134 /* These are the hash table functions for the hash table of INTEGER_CST
1135 nodes of a sizetype. */
1137 /* Return the hash code code X, an INTEGER_CST. */
1140 int_cst_hash_hash (const void *x)
1142 const_tree const t = (const_tree) x;
1144 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1145 ^ htab_hash_pointer (TREE_TYPE (t)));
1148 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1149 is the same as that given by *Y, which is the same. */
1152 int_cst_hash_eq (const void *x, const void *y)
1154 const_tree const xt = (const_tree) x;
1155 const_tree const yt = (const_tree) y;
1157 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1158 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1159 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1162 /* Create an INT_CST node of TYPE and value HI:LOW.
1163 The returned node is always shared. For small integers we use a
1164 per-type vector cache, for larger ones we use a single hash table. */
1167 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1175 switch (TREE_CODE (type))
1178 gcc_assert (hi == 0 && low == 0);
1182 case REFERENCE_TYPE:
1183 /* Cache NULL pointer. */
1192 /* Cache false or true. */
1200 if (TYPE_UNSIGNED (type))
1203 limit = INTEGER_SHARE_LIMIT;
1204 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1210 limit = INTEGER_SHARE_LIMIT + 1;
1211 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1213 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1227 /* Look for it in the type's vector of small shared ints. */
1228 if (!TYPE_CACHED_VALUES_P (type))
1230 TYPE_CACHED_VALUES_P (type) = 1;
1231 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1234 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1237 /* Make sure no one is clobbering the shared constant. */
1238 gcc_assert (TREE_TYPE (t) == type);
1239 gcc_assert (TREE_INT_CST_LOW (t) == low);
1240 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1244 /* Create a new shared int. */
1245 t = make_node (INTEGER_CST);
1247 TREE_INT_CST_LOW (t) = low;
1248 TREE_INT_CST_HIGH (t) = hi;
1249 TREE_TYPE (t) = type;
1251 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1256 /* Use the cache of larger shared ints. */
1259 TREE_INT_CST_LOW (int_cst_node) = low;
1260 TREE_INT_CST_HIGH (int_cst_node) = hi;
1261 TREE_TYPE (int_cst_node) = type;
1263 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1267 /* Insert this one into the hash table. */
1270 /* Make a new node for next time round. */
1271 int_cst_node = make_node (INTEGER_CST);
1278 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1279 and the rest are zeros. */
1282 build_low_bits_mask (tree type, unsigned bits)
1286 gcc_assert (bits <= TYPE_PRECISION (type));
1288 if (bits == TYPE_PRECISION (type)
1289 && !TYPE_UNSIGNED (type))
1290 /* Sign extended all-ones mask. */
1291 mask = double_int_minus_one;
1293 mask = double_int_mask (bits);
1295 return build_int_cst_wide (type, mask.low, mask.high);
1298 /* Checks that X is integer constant that can be expressed in (unsigned)
1299 HOST_WIDE_INT without loss of precision. */
1302 cst_and_fits_in_hwi (const_tree x)
1304 if (TREE_CODE (x) != INTEGER_CST)
1307 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1310 return (TREE_INT_CST_HIGH (x) == 0
1311 || TREE_INT_CST_HIGH (x) == -1);
1314 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1315 are in a list pointed to by VALS. */
1318 build_vector (tree type, tree vals)
1320 tree v = make_node (VECTOR_CST);
1325 TREE_VECTOR_CST_ELTS (v) = vals;
1326 TREE_TYPE (v) = type;
1328 /* Iterate through elements and check for overflow. */
1329 for (link = vals; link; link = TREE_CHAIN (link))
1331 tree value = TREE_VALUE (link);
1334 /* Don't crash if we get an address constant. */
1335 if (!CONSTANT_CLASS_P (value))
1338 over |= TREE_OVERFLOW (value);
1341 gcc_assert (cnt == TYPE_VECTOR_SUBPARTS (type));
1343 TREE_OVERFLOW (v) = over;
1347 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1348 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1351 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1353 tree list = NULL_TREE;
1354 unsigned HOST_WIDE_INT idx;
1357 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1358 list = tree_cons (NULL_TREE, value, list);
1359 for (; idx < TYPE_VECTOR_SUBPARTS (type); ++idx)
1360 list = tree_cons (NULL_TREE,
1361 build_zero_cst (TREE_TYPE (type)), list);
1362 return build_vector (type, nreverse (list));
1365 /* Build a vector of type VECTYPE where all the elements are SCs. */
1367 build_vector_from_val (tree vectype, tree sc)
1369 int i, nunits = TYPE_VECTOR_SUBPARTS (vectype);
1370 VEC(constructor_elt, gc) *v = NULL;
1372 if (sc == error_mark_node)
1375 /* Verify that the vector type is suitable for SC. Note that there
1376 is some inconsistency in the type-system with respect to restrict
1377 qualifications of pointers. Vector types always have a main-variant
1378 element type and the qualification is applied to the vector-type.
1379 So TREE_TYPE (vector-type) does not return a properly qualified
1380 vector element-type. */
1381 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc)),
1382 TREE_TYPE (vectype)));
1384 v = VEC_alloc (constructor_elt, gc, nunits);
1385 for (i = 0; i < nunits; ++i)
1386 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, sc);
1388 if (CONSTANT_CLASS_P (sc))
1389 return build_vector_from_ctor (vectype, v);
1391 return build_constructor (vectype, v);
1394 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1395 are in the VEC pointed to by VALS. */
1397 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1399 tree c = make_node (CONSTRUCTOR);
1401 constructor_elt *elt;
1402 bool constant_p = true;
1404 TREE_TYPE (c) = type;
1405 CONSTRUCTOR_ELTS (c) = vals;
1407 FOR_EACH_VEC_ELT (constructor_elt, vals, i, elt)
1408 if (!TREE_CONSTANT (elt->value))
1414 TREE_CONSTANT (c) = constant_p;
1419 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1422 build_constructor_single (tree type, tree index, tree value)
1424 VEC(constructor_elt,gc) *v;
1425 constructor_elt *elt;
1427 v = VEC_alloc (constructor_elt, gc, 1);
1428 elt = VEC_quick_push (constructor_elt, v, NULL);
1432 return build_constructor (type, v);
1436 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1437 are in a list pointed to by VALS. */
1439 build_constructor_from_list (tree type, tree vals)
1442 VEC(constructor_elt,gc) *v = NULL;
1446 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1447 for (t = vals; t; t = TREE_CHAIN (t))
1448 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1451 return build_constructor (type, v);
1454 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1457 build_fixed (tree type, FIXED_VALUE_TYPE f)
1460 FIXED_VALUE_TYPE *fp;
1462 v = make_node (FIXED_CST);
1463 fp = ggc_alloc_fixed_value ();
1464 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1466 TREE_TYPE (v) = type;
1467 TREE_FIXED_CST_PTR (v) = fp;
1471 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1474 build_real (tree type, REAL_VALUE_TYPE d)
1477 REAL_VALUE_TYPE *dp;
1480 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1481 Consider doing it via real_convert now. */
1483 v = make_node (REAL_CST);
1484 dp = ggc_alloc_real_value ();
1485 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1487 TREE_TYPE (v) = type;
1488 TREE_REAL_CST_PTR (v) = dp;
1489 TREE_OVERFLOW (v) = overflow;
1493 /* Return a new REAL_CST node whose type is TYPE
1494 and whose value is the integer value of the INTEGER_CST node I. */
1497 real_value_from_int_cst (const_tree type, const_tree i)
1501 /* Clear all bits of the real value type so that we can later do
1502 bitwise comparisons to see if two values are the same. */
1503 memset (&d, 0, sizeof d);
1505 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1506 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1507 TYPE_UNSIGNED (TREE_TYPE (i)));
1511 /* Given a tree representing an integer constant I, return a tree
1512 representing the same value as a floating-point constant of type TYPE. */
1515 build_real_from_int_cst (tree type, const_tree i)
1518 int overflow = TREE_OVERFLOW (i);
1520 v = build_real (type, real_value_from_int_cst (type, i));
1522 TREE_OVERFLOW (v) |= overflow;
1526 /* Return a newly constructed STRING_CST node whose value is
1527 the LEN characters at STR.
1528 The TREE_TYPE is not initialized. */
1531 build_string (int len, const char *str)
1536 /* Do not waste bytes provided by padding of struct tree_string. */
1537 length = len + offsetof (struct tree_string, str) + 1;
1539 record_node_allocation_statistics (STRING_CST, length);
1541 s = ggc_alloc_tree_node (length);
1543 memset (s, 0, sizeof (struct tree_typed));
1544 TREE_SET_CODE (s, STRING_CST);
1545 TREE_CONSTANT (s) = 1;
1546 TREE_STRING_LENGTH (s) = len;
1547 memcpy (s->string.str, str, len);
1548 s->string.str[len] = '\0';
1553 /* Return a newly constructed COMPLEX_CST node whose value is
1554 specified by the real and imaginary parts REAL and IMAG.
1555 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1556 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1559 build_complex (tree type, tree real, tree imag)
1561 tree t = make_node (COMPLEX_CST);
1563 TREE_REALPART (t) = real;
1564 TREE_IMAGPART (t) = imag;
1565 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1566 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1570 /* Return a constant of arithmetic type TYPE which is the
1571 multiplicative identity of the set TYPE. */
1574 build_one_cst (tree type)
1576 switch (TREE_CODE (type))
1578 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1579 case POINTER_TYPE: case REFERENCE_TYPE:
1581 return build_int_cst (type, 1);
1584 return build_real (type, dconst1);
1586 case FIXED_POINT_TYPE:
1587 /* We can only generate 1 for accum types. */
1588 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1589 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1593 tree scalar = build_one_cst (TREE_TYPE (type));
1595 return build_vector_from_val (type, scalar);
1599 return build_complex (type,
1600 build_one_cst (TREE_TYPE (type)),
1601 build_zero_cst (TREE_TYPE (type)));
1608 /* Build 0 constant of type TYPE. This is used by constructor folding
1609 and thus the constant should be represented in memory by
1613 build_zero_cst (tree type)
1615 switch (TREE_CODE (type))
1617 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1618 case POINTER_TYPE: case REFERENCE_TYPE:
1620 return build_int_cst (type, 0);
1623 return build_real (type, dconst0);
1625 case FIXED_POINT_TYPE:
1626 return build_fixed (type, FCONST0 (TYPE_MODE (type)));
1630 tree scalar = build_zero_cst (TREE_TYPE (type));
1632 return build_vector_from_val (type, scalar);
1637 tree zero = build_zero_cst (TREE_TYPE (type));
1639 return build_complex (type, zero, zero);
1643 if (!AGGREGATE_TYPE_P (type))
1644 return fold_convert (type, integer_zero_node);
1645 return build_constructor (type, NULL);
1650 /* Build a BINFO with LEN language slots. */
1653 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1656 size_t length = (offsetof (struct tree_binfo, base_binfos)
1657 + VEC_embedded_size (tree, base_binfos));
1659 record_node_allocation_statistics (TREE_BINFO, length);
1661 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1663 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1665 TREE_SET_CODE (t, TREE_BINFO);
1667 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1672 /* Create a CASE_LABEL_EXPR tree node and return it. */
1675 build_case_label (tree low_value, tree high_value, tree label_decl)
1677 tree t = make_node (CASE_LABEL_EXPR);
1679 TREE_TYPE (t) = void_type_node;
1680 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (label_decl));
1682 CASE_LOW (t) = low_value;
1683 CASE_HIGH (t) = high_value;
1684 CASE_LABEL (t) = label_decl;
1685 CASE_CHAIN (t) = NULL_TREE;
1690 /* Build a newly constructed TREE_VEC node of length LEN. */
1693 make_tree_vec_stat (int len MEM_STAT_DECL)
1696 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1698 record_node_allocation_statistics (TREE_VEC, length);
1700 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1702 TREE_SET_CODE (t, TREE_VEC);
1703 TREE_VEC_LENGTH (t) = len;
1708 /* Return 1 if EXPR is the integer constant zero or a complex constant
1712 integer_zerop (const_tree expr)
1716 return ((TREE_CODE (expr) == INTEGER_CST
1717 && TREE_INT_CST_LOW (expr) == 0
1718 && TREE_INT_CST_HIGH (expr) == 0)
1719 || (TREE_CODE (expr) == COMPLEX_CST
1720 && integer_zerop (TREE_REALPART (expr))
1721 && integer_zerop (TREE_IMAGPART (expr))));
1724 /* Return 1 if EXPR is the integer constant one or the corresponding
1725 complex constant. */
1728 integer_onep (const_tree expr)
1732 return ((TREE_CODE (expr) == INTEGER_CST
1733 && TREE_INT_CST_LOW (expr) == 1
1734 && TREE_INT_CST_HIGH (expr) == 0)
1735 || (TREE_CODE (expr) == COMPLEX_CST
1736 && integer_onep (TREE_REALPART (expr))
1737 && integer_zerop (TREE_IMAGPART (expr))));
1740 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1741 it contains. Likewise for the corresponding complex constant. */
1744 integer_all_onesp (const_tree expr)
1751 if (TREE_CODE (expr) == COMPLEX_CST
1752 && integer_all_onesp (TREE_REALPART (expr))
1753 && integer_zerop (TREE_IMAGPART (expr)))
1756 else if (TREE_CODE (expr) != INTEGER_CST)
1759 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1760 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1761 && TREE_INT_CST_HIGH (expr) == -1)
1766 prec = TYPE_PRECISION (TREE_TYPE (expr));
1767 if (prec >= HOST_BITS_PER_WIDE_INT)
1769 HOST_WIDE_INT high_value;
1772 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1774 /* Can not handle precisions greater than twice the host int size. */
1775 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1776 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1777 /* Shifting by the host word size is undefined according to the ANSI
1778 standard, so we must handle this as a special case. */
1781 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1783 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1784 && TREE_INT_CST_HIGH (expr) == high_value);
1787 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1790 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1794 integer_pow2p (const_tree expr)
1797 HOST_WIDE_INT high, low;
1801 if (TREE_CODE (expr) == COMPLEX_CST
1802 && integer_pow2p (TREE_REALPART (expr))
1803 && integer_zerop (TREE_IMAGPART (expr)))
1806 if (TREE_CODE (expr) != INTEGER_CST)
1809 prec = TYPE_PRECISION (TREE_TYPE (expr));
1810 high = TREE_INT_CST_HIGH (expr);
1811 low = TREE_INT_CST_LOW (expr);
1813 /* First clear all bits that are beyond the type's precision in case
1814 we've been sign extended. */
1816 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1818 else if (prec > HOST_BITS_PER_WIDE_INT)
1819 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1823 if (prec < HOST_BITS_PER_WIDE_INT)
1824 low &= ~((HOST_WIDE_INT) (-1) << prec);
1827 if (high == 0 && low == 0)
1830 return ((high == 0 && (low & (low - 1)) == 0)
1831 || (low == 0 && (high & (high - 1)) == 0));
1834 /* Return 1 if EXPR is an integer constant other than zero or a
1835 complex constant other than zero. */
1838 integer_nonzerop (const_tree expr)
1842 return ((TREE_CODE (expr) == INTEGER_CST
1843 && (TREE_INT_CST_LOW (expr) != 0
1844 || TREE_INT_CST_HIGH (expr) != 0))
1845 || (TREE_CODE (expr) == COMPLEX_CST
1846 && (integer_nonzerop (TREE_REALPART (expr))
1847 || integer_nonzerop (TREE_IMAGPART (expr)))));
1850 /* Return 1 if EXPR is the fixed-point constant zero. */
1853 fixed_zerop (const_tree expr)
1855 return (TREE_CODE (expr) == FIXED_CST
1856 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1859 /* Return the power of two represented by a tree node known to be a
1863 tree_log2 (const_tree expr)
1866 HOST_WIDE_INT high, low;
1870 if (TREE_CODE (expr) == COMPLEX_CST)
1871 return tree_log2 (TREE_REALPART (expr));
1873 prec = TYPE_PRECISION (TREE_TYPE (expr));
1874 high = TREE_INT_CST_HIGH (expr);
1875 low = TREE_INT_CST_LOW (expr);
1877 /* First clear all bits that are beyond the type's precision in case
1878 we've been sign extended. */
1880 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1882 else if (prec > HOST_BITS_PER_WIDE_INT)
1883 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1887 if (prec < HOST_BITS_PER_WIDE_INT)
1888 low &= ~((HOST_WIDE_INT) (-1) << prec);
1891 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1892 : exact_log2 (low));
1895 /* Similar, but return the largest integer Y such that 2 ** Y is less
1896 than or equal to EXPR. */
1899 tree_floor_log2 (const_tree expr)
1902 HOST_WIDE_INT high, low;
1906 if (TREE_CODE (expr) == COMPLEX_CST)
1907 return tree_log2 (TREE_REALPART (expr));
1909 prec = TYPE_PRECISION (TREE_TYPE (expr));
1910 high = TREE_INT_CST_HIGH (expr);
1911 low = TREE_INT_CST_LOW (expr);
1913 /* First clear all bits that are beyond the type's precision in case
1914 we've been sign extended. Ignore if type's precision hasn't been set
1915 since what we are doing is setting it. */
1917 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1919 else if (prec > HOST_BITS_PER_WIDE_INT)
1920 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1924 if (prec < HOST_BITS_PER_WIDE_INT)
1925 low &= ~((HOST_WIDE_INT) (-1) << prec);
1928 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1929 : floor_log2 (low));
1932 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1933 decimal float constants, so don't return 1 for them. */
1936 real_zerop (const_tree expr)
1940 return ((TREE_CODE (expr) == REAL_CST
1941 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1942 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1943 || (TREE_CODE (expr) == COMPLEX_CST
1944 && real_zerop (TREE_REALPART (expr))
1945 && real_zerop (TREE_IMAGPART (expr))));
1948 /* Return 1 if EXPR is the real constant one in real or complex form.
1949 Trailing zeroes matter for decimal float constants, so don't return
1953 real_onep (const_tree expr)
1957 return ((TREE_CODE (expr) == REAL_CST
1958 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1959 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1960 || (TREE_CODE (expr) == COMPLEX_CST
1961 && real_onep (TREE_REALPART (expr))
1962 && real_zerop (TREE_IMAGPART (expr))));
1965 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1966 for decimal float constants, so don't return 1 for them. */
1969 real_twop (const_tree expr)
1973 return ((TREE_CODE (expr) == REAL_CST
1974 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1975 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1976 || (TREE_CODE (expr) == COMPLEX_CST
1977 && real_twop (TREE_REALPART (expr))
1978 && real_zerop (TREE_IMAGPART (expr))));
1981 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1982 matter for decimal float constants, so don't return 1 for them. */
1985 real_minus_onep (const_tree expr)
1989 return ((TREE_CODE (expr) == REAL_CST
1990 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1991 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1992 || (TREE_CODE (expr) == COMPLEX_CST
1993 && real_minus_onep (TREE_REALPART (expr))
1994 && real_zerop (TREE_IMAGPART (expr))));
1997 /* Nonzero if EXP is a constant or a cast of a constant. */
2000 really_constant_p (const_tree exp)
2002 /* This is not quite the same as STRIP_NOPS. It does more. */
2003 while (CONVERT_EXPR_P (exp)
2004 || TREE_CODE (exp) == NON_LVALUE_EXPR)
2005 exp = TREE_OPERAND (exp, 0);
2006 return TREE_CONSTANT (exp);
2009 /* Return first list element whose TREE_VALUE is ELEM.
2010 Return 0 if ELEM is not in LIST. */
2013 value_member (tree elem, tree list)
2017 if (elem == TREE_VALUE (list))
2019 list = TREE_CHAIN (list);
2024 /* Return first list element whose TREE_PURPOSE is ELEM.
2025 Return 0 if ELEM is not in LIST. */
2028 purpose_member (const_tree elem, tree list)
2032 if (elem == TREE_PURPOSE (list))
2034 list = TREE_CHAIN (list);
2039 /* Return true if ELEM is in V. */
2042 vec_member (const_tree elem, VEC(tree,gc) *v)
2046 FOR_EACH_VEC_ELT (tree, v, ix, t)
2052 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2056 chain_index (int idx, tree chain)
2058 for (; chain && idx > 0; --idx)
2059 chain = TREE_CHAIN (chain);
2063 /* Return nonzero if ELEM is part of the chain CHAIN. */
2066 chain_member (const_tree elem, const_tree chain)
2072 chain = DECL_CHAIN (chain);
2078 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2079 We expect a null pointer to mark the end of the chain.
2080 This is the Lisp primitive `length'. */
2083 list_length (const_tree t)
2086 #ifdef ENABLE_TREE_CHECKING
2094 #ifdef ENABLE_TREE_CHECKING
2097 gcc_assert (p != q);
2105 /* Returns the number of FIELD_DECLs in TYPE. */
2108 fields_length (const_tree type)
2110 tree t = TYPE_FIELDS (type);
2113 for (; t; t = DECL_CHAIN (t))
2114 if (TREE_CODE (t) == FIELD_DECL)
2120 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2121 UNION_TYPE TYPE, or NULL_TREE if none. */
2124 first_field (const_tree type)
2126 tree t = TYPE_FIELDS (type);
2127 while (t && TREE_CODE (t) != FIELD_DECL)
2132 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2133 by modifying the last node in chain 1 to point to chain 2.
2134 This is the Lisp primitive `nconc'. */
2137 chainon (tree op1, tree op2)
2146 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2148 TREE_CHAIN (t1) = op2;
2150 #ifdef ENABLE_TREE_CHECKING
2153 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2154 gcc_assert (t2 != t1);
2161 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2164 tree_last (tree chain)
2168 while ((next = TREE_CHAIN (chain)))
2173 /* Reverse the order of elements in the chain T,
2174 and return the new head of the chain (old last element). */
2179 tree prev = 0, decl, next;
2180 for (decl = t; decl; decl = next)
2182 /* We shouldn't be using this function to reverse BLOCK chains; we
2183 have blocks_nreverse for that. */
2184 gcc_checking_assert (TREE_CODE (decl) != BLOCK);
2185 next = TREE_CHAIN (decl);
2186 TREE_CHAIN (decl) = prev;
2192 /* Return a newly created TREE_LIST node whose
2193 purpose and value fields are PARM and VALUE. */
2196 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2198 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2199 TREE_PURPOSE (t) = parm;
2200 TREE_VALUE (t) = value;
2204 /* Build a chain of TREE_LIST nodes from a vector. */
2207 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2209 tree ret = NULL_TREE;
2213 FOR_EACH_VEC_ELT (tree, vec, i, t)
2215 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2216 pp = &TREE_CHAIN (*pp);
2221 /* Return a newly created TREE_LIST node whose
2222 purpose and value fields are PURPOSE and VALUE
2223 and whose TREE_CHAIN is CHAIN. */
2226 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2230 node = ggc_alloc_zone_tree_node_stat (&tree_zone, sizeof (struct tree_list)
2232 memset (node, 0, sizeof (struct tree_common));
2234 record_node_allocation_statistics (TREE_LIST, sizeof (struct tree_list));
2236 TREE_SET_CODE (node, TREE_LIST);
2237 TREE_CHAIN (node) = chain;
2238 TREE_PURPOSE (node) = purpose;
2239 TREE_VALUE (node) = value;
2243 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2247 ctor_to_vec (tree ctor)
2249 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2253 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2254 VEC_quick_push (tree, vec, val);
2259 /* Return the size nominally occupied by an object of type TYPE
2260 when it resides in memory. The value is measured in units of bytes,
2261 and its data type is that normally used for type sizes
2262 (which is the first type created by make_signed_type or
2263 make_unsigned_type). */
2266 size_in_bytes (const_tree type)
2270 if (type == error_mark_node)
2271 return integer_zero_node;
2273 type = TYPE_MAIN_VARIANT (type);
2274 t = TYPE_SIZE_UNIT (type);
2278 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2279 return size_zero_node;
2285 /* Return the size of TYPE (in bytes) as a wide integer
2286 or return -1 if the size can vary or is larger than an integer. */
2289 int_size_in_bytes (const_tree type)
2293 if (type == error_mark_node)
2296 type = TYPE_MAIN_VARIANT (type);
2297 t = TYPE_SIZE_UNIT (type);
2299 || TREE_CODE (t) != INTEGER_CST
2300 || TREE_INT_CST_HIGH (t) != 0
2301 /* If the result would appear negative, it's too big to represent. */
2302 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2305 return TREE_INT_CST_LOW (t);
2308 /* Return the maximum size of TYPE (in bytes) as a wide integer
2309 or return -1 if the size can vary or is larger than an integer. */
2312 max_int_size_in_bytes (const_tree type)
2314 HOST_WIDE_INT size = -1;
2317 /* If this is an array type, check for a possible MAX_SIZE attached. */
2319 if (TREE_CODE (type) == ARRAY_TYPE)
2321 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2323 if (size_tree && host_integerp (size_tree, 1))
2324 size = tree_low_cst (size_tree, 1);
2327 /* If we still haven't been able to get a size, see if the language
2328 can compute a maximum size. */
2332 size_tree = lang_hooks.types.max_size (type);
2334 if (size_tree && host_integerp (size_tree, 1))
2335 size = tree_low_cst (size_tree, 1);
2341 /* Returns a tree for the size of EXP in bytes. */
2344 tree_expr_size (const_tree exp)
2347 && DECL_SIZE_UNIT (exp) != 0)
2348 return DECL_SIZE_UNIT (exp);
2350 return size_in_bytes (TREE_TYPE (exp));
2353 /* Return the bit position of FIELD, in bits from the start of the record.
2354 This is a tree of type bitsizetype. */
2357 bit_position (const_tree field)
2359 return bit_from_pos (DECL_FIELD_OFFSET (field),
2360 DECL_FIELD_BIT_OFFSET (field));
2363 /* Likewise, but return as an integer. It must be representable in
2364 that way (since it could be a signed value, we don't have the
2365 option of returning -1 like int_size_in_byte can. */
2368 int_bit_position (const_tree field)
2370 return tree_low_cst (bit_position (field), 0);
2373 /* Return the byte position of FIELD, in bytes from the start of the record.
2374 This is a tree of type sizetype. */
2377 byte_position (const_tree field)
2379 return byte_from_pos (DECL_FIELD_OFFSET (field),
2380 DECL_FIELD_BIT_OFFSET (field));
2383 /* Likewise, but return as an integer. It must be representable in
2384 that way (since it could be a signed value, we don't have the
2385 option of returning -1 like int_size_in_byte can. */
2388 int_byte_position (const_tree field)
2390 return tree_low_cst (byte_position (field), 0);
2393 /* Return the strictest alignment, in bits, that T is known to have. */
2396 expr_align (const_tree t)
2398 unsigned int align0, align1;
2400 switch (TREE_CODE (t))
2402 CASE_CONVERT: case NON_LVALUE_EXPR:
2403 /* If we have conversions, we know that the alignment of the
2404 object must meet each of the alignments of the types. */
2405 align0 = expr_align (TREE_OPERAND (t, 0));
2406 align1 = TYPE_ALIGN (TREE_TYPE (t));
2407 return MAX (align0, align1);
2409 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2410 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2411 case CLEANUP_POINT_EXPR:
2412 /* These don't change the alignment of an object. */
2413 return expr_align (TREE_OPERAND (t, 0));
2416 /* The best we can do is say that the alignment is the least aligned
2418 align0 = expr_align (TREE_OPERAND (t, 1));
2419 align1 = expr_align (TREE_OPERAND (t, 2));
2420 return MIN (align0, align1);
2422 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2423 meaningfully, it's always 1. */
2424 case LABEL_DECL: case CONST_DECL:
2425 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2427 gcc_assert (DECL_ALIGN (t) != 0);
2428 return DECL_ALIGN (t);
2434 /* Otherwise take the alignment from that of the type. */
2435 return TYPE_ALIGN (TREE_TYPE (t));
2438 /* Return, as a tree node, the number of elements for TYPE (which is an
2439 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2442 array_type_nelts (const_tree type)
2444 tree index_type, min, max;
2446 /* If they did it with unspecified bounds, then we should have already
2447 given an error about it before we got here. */
2448 if (! TYPE_DOMAIN (type))
2449 return error_mark_node;
2451 index_type = TYPE_DOMAIN (type);
2452 min = TYPE_MIN_VALUE (index_type);
2453 max = TYPE_MAX_VALUE (index_type);
2455 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2457 return error_mark_node;
2459 return (integer_zerop (min)
2461 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2464 /* If arg is static -- a reference to an object in static storage -- then
2465 return the object. This is not the same as the C meaning of `static'.
2466 If arg isn't static, return NULL. */
2471 switch (TREE_CODE (arg))
2474 /* Nested functions are static, even though taking their address will
2475 involve a trampoline as we unnest the nested function and create
2476 the trampoline on the tree level. */
2480 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2481 && ! DECL_THREAD_LOCAL_P (arg)
2482 && ! DECL_DLLIMPORT_P (arg)
2486 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2490 return TREE_STATIC (arg) ? arg : NULL;
2497 /* If the thing being referenced is not a field, then it is
2498 something language specific. */
2499 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2501 /* If we are referencing a bitfield, we can't evaluate an
2502 ADDR_EXPR at compile time and so it isn't a constant. */
2503 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2506 return staticp (TREE_OPERAND (arg, 0));
2512 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2515 case ARRAY_RANGE_REF:
2516 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2517 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2518 return staticp (TREE_OPERAND (arg, 0));
2522 case COMPOUND_LITERAL_EXPR:
2523 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2533 /* Return whether OP is a DECL whose address is function-invariant. */
2536 decl_address_invariant_p (const_tree op)
2538 /* The conditions below are slightly less strict than the one in
2541 switch (TREE_CODE (op))
2550 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2551 || DECL_THREAD_LOCAL_P (op)
2552 || DECL_CONTEXT (op) == current_function_decl
2553 || decl_function_context (op) == current_function_decl)
2558 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2559 || decl_function_context (op) == current_function_decl)
2570 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2573 decl_address_ip_invariant_p (const_tree op)
2575 /* The conditions below are slightly less strict than the one in
2578 switch (TREE_CODE (op))
2586 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2587 && !DECL_DLLIMPORT_P (op))
2588 || DECL_THREAD_LOCAL_P (op))
2593 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2605 /* Return true if T is function-invariant (internal function, does
2606 not handle arithmetic; that's handled in skip_simple_arithmetic and
2607 tree_invariant_p). */
2609 static bool tree_invariant_p (tree t);
2612 tree_invariant_p_1 (tree t)
2616 if (TREE_CONSTANT (t)
2617 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2620 switch (TREE_CODE (t))
2626 op = TREE_OPERAND (t, 0);
2627 while (handled_component_p (op))
2629 switch (TREE_CODE (op))
2632 case ARRAY_RANGE_REF:
2633 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2634 || TREE_OPERAND (op, 2) != NULL_TREE
2635 || TREE_OPERAND (op, 3) != NULL_TREE)
2640 if (TREE_OPERAND (op, 2) != NULL_TREE)
2646 op = TREE_OPERAND (op, 0);
2649 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2658 /* Return true if T is function-invariant. */
2661 tree_invariant_p (tree t)
2663 tree inner = skip_simple_arithmetic (t);
2664 return tree_invariant_p_1 (inner);
2667 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2668 Do this to any expression which may be used in more than one place,
2669 but must be evaluated only once.
2671 Normally, expand_expr would reevaluate the expression each time.
2672 Calling save_expr produces something that is evaluated and recorded
2673 the first time expand_expr is called on it. Subsequent calls to
2674 expand_expr just reuse the recorded value.
2676 The call to expand_expr that generates code that actually computes
2677 the value is the first call *at compile time*. Subsequent calls
2678 *at compile time* generate code to use the saved value.
2679 This produces correct result provided that *at run time* control
2680 always flows through the insns made by the first expand_expr
2681 before reaching the other places where the save_expr was evaluated.
2682 You, the caller of save_expr, must make sure this is so.
2684 Constants, and certain read-only nodes, are returned with no
2685 SAVE_EXPR because that is safe. Expressions containing placeholders
2686 are not touched; see tree.def for an explanation of what these
2690 save_expr (tree expr)
2692 tree t = fold (expr);
2695 /* If the tree evaluates to a constant, then we don't want to hide that
2696 fact (i.e. this allows further folding, and direct checks for constants).
2697 However, a read-only object that has side effects cannot be bypassed.
2698 Since it is no problem to reevaluate literals, we just return the
2700 inner = skip_simple_arithmetic (t);
2701 if (TREE_CODE (inner) == ERROR_MARK)
2704 if (tree_invariant_p_1 (inner))
2707 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2708 it means that the size or offset of some field of an object depends on
2709 the value within another field.
2711 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2712 and some variable since it would then need to be both evaluated once and
2713 evaluated more than once. Front-ends must assure this case cannot
2714 happen by surrounding any such subexpressions in their own SAVE_EXPR
2715 and forcing evaluation at the proper time. */
2716 if (contains_placeholder_p (inner))
2719 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2720 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2722 /* This expression might be placed ahead of a jump to ensure that the
2723 value was computed on both sides of the jump. So make sure it isn't
2724 eliminated as dead. */
2725 TREE_SIDE_EFFECTS (t) = 1;
2729 /* Look inside EXPR and into any simple arithmetic operations. Return
2730 the innermost non-arithmetic node. */
2733 skip_simple_arithmetic (tree expr)
2737 /* We don't care about whether this can be used as an lvalue in this
2739 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2740 expr = TREE_OPERAND (expr, 0);
2742 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2743 a constant, it will be more efficient to not make another SAVE_EXPR since
2744 it will allow better simplification and GCSE will be able to merge the
2745 computations if they actually occur. */
2749 if (UNARY_CLASS_P (inner))
2750 inner = TREE_OPERAND (inner, 0);
2751 else if (BINARY_CLASS_P (inner))
2753 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2754 inner = TREE_OPERAND (inner, 0);
2755 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2756 inner = TREE_OPERAND (inner, 1);
2768 /* Return which tree structure is used by T. */
2770 enum tree_node_structure_enum
2771 tree_node_structure (const_tree t)
2773 const enum tree_code code = TREE_CODE (t);
2774 return tree_node_structure_for_code (code);
2777 /* Set various status flags when building a CALL_EXPR object T. */
2780 process_call_operands (tree t)
2782 bool side_effects = TREE_SIDE_EFFECTS (t);
2783 bool read_only = false;
2784 int i = call_expr_flags (t);
2786 /* Calls have side-effects, except those to const or pure functions. */
2787 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2788 side_effects = true;
2789 /* Propagate TREE_READONLY of arguments for const functions. */
2793 if (!side_effects || read_only)
2794 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2796 tree op = TREE_OPERAND (t, i);
2797 if (op && TREE_SIDE_EFFECTS (op))
2798 side_effects = true;
2799 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2803 TREE_SIDE_EFFECTS (t) = side_effects;
2804 TREE_READONLY (t) = read_only;
2807 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2808 size or offset that depends on a field within a record. */
2811 contains_placeholder_p (const_tree exp)
2813 enum tree_code code;
2818 code = TREE_CODE (exp);
2819 if (code == PLACEHOLDER_EXPR)
2822 switch (TREE_CODE_CLASS (code))
2825 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2826 position computations since they will be converted into a
2827 WITH_RECORD_EXPR involving the reference, which will assume
2828 here will be valid. */
2829 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2831 case tcc_exceptional:
2832 if (code == TREE_LIST)
2833 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2834 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2839 case tcc_comparison:
2840 case tcc_expression:
2844 /* Ignoring the first operand isn't quite right, but works best. */
2845 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2848 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2849 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2850 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2853 /* The save_expr function never wraps anything containing
2854 a PLACEHOLDER_EXPR. */
2861 switch (TREE_CODE_LENGTH (code))
2864 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2866 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2867 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2878 const_call_expr_arg_iterator iter;
2879 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2880 if (CONTAINS_PLACEHOLDER_P (arg))
2894 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2895 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2899 type_contains_placeholder_1 (const_tree type)
2901 /* If the size contains a placeholder or the parent type (component type in
2902 the case of arrays) type involves a placeholder, this type does. */
2903 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2904 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2905 || (!POINTER_TYPE_P (type)
2907 && type_contains_placeholder_p (TREE_TYPE (type))))
2910 /* Now do type-specific checks. Note that the last part of the check above
2911 greatly limits what we have to do below. */
2912 switch (TREE_CODE (type))
2920 case REFERENCE_TYPE:
2928 case FIXED_POINT_TYPE:
2929 /* Here we just check the bounds. */
2930 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2931 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2934 /* We have already checked the component type above, so just check the
2936 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2940 case QUAL_UNION_TYPE:
2944 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2945 if (TREE_CODE (field) == FIELD_DECL
2946 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2947 || (TREE_CODE (type) == QUAL_UNION_TYPE
2948 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2949 || type_contains_placeholder_p (TREE_TYPE (field))))
2960 /* Wrapper around above function used to cache its result. */
2963 type_contains_placeholder_p (tree type)
2967 /* If the contains_placeholder_bits field has been initialized,
2968 then we know the answer. */
2969 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2970 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2972 /* Indicate that we've seen this type node, and the answer is false.
2973 This is what we want to return if we run into recursion via fields. */
2974 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2976 /* Compute the real value. */
2977 result = type_contains_placeholder_1 (type);
2979 /* Store the real value. */
2980 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2985 /* Push tree EXP onto vector QUEUE if it is not already present. */
2988 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2993 FOR_EACH_VEC_ELT (tree, *queue, i, iter)
2994 if (simple_cst_equal (iter, exp) == 1)
2998 VEC_safe_push (tree, heap, *queue, exp);
3001 /* Given a tree EXP, find all occurences of references to fields
3002 in a PLACEHOLDER_EXPR and place them in vector REFS without
3003 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3004 we assume here that EXP contains only arithmetic expressions
3005 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3009 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
3011 enum tree_code code = TREE_CODE (exp);
3015 /* We handle TREE_LIST and COMPONENT_REF separately. */
3016 if (code == TREE_LIST)
3018 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
3019 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
3021 else if (code == COMPONENT_REF)
3023 for (inner = TREE_OPERAND (exp, 0);
3024 REFERENCE_CLASS_P (inner);
3025 inner = TREE_OPERAND (inner, 0))
3028 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
3029 push_without_duplicates (exp, refs);
3031 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
3034 switch (TREE_CODE_CLASS (code))
3039 case tcc_declaration:
3040 /* Variables allocated to static storage can stay. */
3041 if (!TREE_STATIC (exp))
3042 push_without_duplicates (exp, refs);
3045 case tcc_expression:
3046 /* This is the pattern built in ada/make_aligning_type. */
3047 if (code == ADDR_EXPR
3048 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
3050 push_without_duplicates (exp, refs);
3054 /* Fall through... */
3056 case tcc_exceptional:
3059 case tcc_comparison:
3061 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3062 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3066 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3067 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3075 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3076 return a tree with all occurrences of references to F in a
3077 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3078 CONST_DECLs. Note that we assume here that EXP contains only
3079 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3080 occurring only in their argument list. */
3083 substitute_in_expr (tree exp, tree f, tree r)
3085 enum tree_code code = TREE_CODE (exp);
3086 tree op0, op1, op2, op3;
3089 /* We handle TREE_LIST and COMPONENT_REF separately. */
3090 if (code == TREE_LIST)
3092 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3093 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3094 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3097 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3099 else if (code == COMPONENT_REF)
3103 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3104 and it is the right field, replace it with R. */
3105 for (inner = TREE_OPERAND (exp, 0);
3106 REFERENCE_CLASS_P (inner);
3107 inner = TREE_OPERAND (inner, 0))
3111 op1 = TREE_OPERAND (exp, 1);
3113 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3116 /* If this expression hasn't been completed let, leave it alone. */
3117 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3120 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3121 if (op0 == TREE_OPERAND (exp, 0))
3125 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3128 switch (TREE_CODE_CLASS (code))
3133 case tcc_declaration:
3139 case tcc_expression:
3143 /* Fall through... */
3145 case tcc_exceptional:
3148 case tcc_comparison:
3150 switch (TREE_CODE_LENGTH (code))
3156 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3157 if (op0 == TREE_OPERAND (exp, 0))
3160 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3164 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3165 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3167 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3170 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3174 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3175 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3176 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3178 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3179 && op2 == TREE_OPERAND (exp, 2))
3182 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3186 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3187 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3188 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3189 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3191 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3192 && op2 == TREE_OPERAND (exp, 2)
3193 && op3 == TREE_OPERAND (exp, 3))
3197 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3209 new_tree = NULL_TREE;
3211 /* If we are trying to replace F with a constant, inline back
3212 functions which do nothing else than computing a value from
3213 the arguments they are passed. This makes it possible to
3214 fold partially or entirely the replacement expression. */
3215 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3217 tree t = maybe_inline_call_in_expr (exp);
3219 return SUBSTITUTE_IN_EXPR (t, f, r);
3222 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3224 tree op = TREE_OPERAND (exp, i);
3225 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3229 new_tree = copy_node (exp);
3230 TREE_OPERAND (new_tree, i) = new_op;
3236 new_tree = fold (new_tree);
3237 if (TREE_CODE (new_tree) == CALL_EXPR)
3238 process_call_operands (new_tree);
3249 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3251 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3252 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3257 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3258 for it within OBJ, a tree that is an object or a chain of references. */
3261 substitute_placeholder_in_expr (tree exp, tree obj)
3263 enum tree_code code = TREE_CODE (exp);
3264 tree op0, op1, op2, op3;
3267 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3268 in the chain of OBJ. */
3269 if (code == PLACEHOLDER_EXPR)
3271 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3274 for (elt = obj; elt != 0;
3275 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3276 || TREE_CODE (elt) == COND_EXPR)
3277 ? TREE_OPERAND (elt, 1)
3278 : (REFERENCE_CLASS_P (elt)
3279 || UNARY_CLASS_P (elt)
3280 || BINARY_CLASS_P (elt)
3281 || VL_EXP_CLASS_P (elt)
3282 || EXPRESSION_CLASS_P (elt))
3283 ? TREE_OPERAND (elt, 0) : 0))
3284 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3287 for (elt = obj; elt != 0;
3288 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3289 || TREE_CODE (elt) == COND_EXPR)
3290 ? TREE_OPERAND (elt, 1)
3291 : (REFERENCE_CLASS_P (elt)
3292 || UNARY_CLASS_P (elt)
3293 || BINARY_CLASS_P (elt)
3294 || VL_EXP_CLASS_P (elt)
3295 || EXPRESSION_CLASS_P (elt))
3296 ? TREE_OPERAND (elt, 0) : 0))
3297 if (POINTER_TYPE_P (TREE_TYPE (elt))
3298 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3300 return fold_build1 (INDIRECT_REF, need_type, elt);
3302 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3303 survives until RTL generation, there will be an error. */
3307 /* TREE_LIST is special because we need to look at TREE_VALUE
3308 and TREE_CHAIN, not TREE_OPERANDS. */
3309 else if (code == TREE_LIST)
3311 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3312 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3313 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3316 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3319 switch (TREE_CODE_CLASS (code))
3322 case tcc_declaration:
3325 case tcc_exceptional:
3328 case tcc_comparison:
3329 case tcc_expression:
3332 switch (TREE_CODE_LENGTH (code))
3338 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3339 if (op0 == TREE_OPERAND (exp, 0))
3342 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3346 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3347 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3349 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3352 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3356 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3357 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3358 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3360 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3361 && op2 == TREE_OPERAND (exp, 2))
3364 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3368 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3369 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3370 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3371 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3373 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3374 && op2 == TREE_OPERAND (exp, 2)
3375 && op3 == TREE_OPERAND (exp, 3))
3379 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3391 new_tree = NULL_TREE;
3393 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3395 tree op = TREE_OPERAND (exp, i);
3396 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3400 new_tree = copy_node (exp);
3401 TREE_OPERAND (new_tree, i) = new_op;
3407 new_tree = fold (new_tree);
3408 if (TREE_CODE (new_tree) == CALL_EXPR)
3409 process_call_operands (new_tree);
3420 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3422 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3423 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3428 /* Stabilize a reference so that we can use it any number of times
3429 without causing its operands to be evaluated more than once.
3430 Returns the stabilized reference. This works by means of save_expr,
3431 so see the caveats in the comments about save_expr.
3433 Also allows conversion expressions whose operands are references.
3434 Any other kind of expression is returned unchanged. */
3437 stabilize_reference (tree ref)
3440 enum tree_code code = TREE_CODE (ref);
3447 /* No action is needed in this case. */
3452 case FIX_TRUNC_EXPR:
3453 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3457 result = build_nt (INDIRECT_REF,
3458 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3462 result = build_nt (COMPONENT_REF,
3463 stabilize_reference (TREE_OPERAND (ref, 0)),
3464 TREE_OPERAND (ref, 1), NULL_TREE);
3468 result = build_nt (BIT_FIELD_REF,
3469 stabilize_reference (TREE_OPERAND (ref, 0)),
3470 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3471 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3475 result = build_nt (ARRAY_REF,
3476 stabilize_reference (TREE_OPERAND (ref, 0)),
3477 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3478 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3481 case ARRAY_RANGE_REF:
3482 result = build_nt (ARRAY_RANGE_REF,
3483 stabilize_reference (TREE_OPERAND (ref, 0)),
3484 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3485 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3489 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3490 it wouldn't be ignored. This matters when dealing with
3492 return stabilize_reference_1 (ref);
3494 /* If arg isn't a kind of lvalue we recognize, make no change.
3495 Caller should recognize the error for an invalid lvalue. */
3500 return error_mark_node;
3503 TREE_TYPE (result) = TREE_TYPE (ref);
3504 TREE_READONLY (result) = TREE_READONLY (ref);
3505 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3506 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3511 /* Subroutine of stabilize_reference; this is called for subtrees of
3512 references. Any expression with side-effects must be put in a SAVE_EXPR
3513 to ensure that it is only evaluated once.
3515 We don't put SAVE_EXPR nodes around everything, because assigning very
3516 simple expressions to temporaries causes us to miss good opportunities
3517 for optimizations. Among other things, the opportunity to fold in the
3518 addition of a constant into an addressing mode often gets lost, e.g.
3519 "y[i+1] += x;". In general, we take the approach that we should not make
3520 an assignment unless we are forced into it - i.e., that any non-side effect
3521 operator should be allowed, and that cse should take care of coalescing
3522 multiple utterances of the same expression should that prove fruitful. */
3525 stabilize_reference_1 (tree e)
3528 enum tree_code code = TREE_CODE (e);
3530 /* We cannot ignore const expressions because it might be a reference
3531 to a const array but whose index contains side-effects. But we can
3532 ignore things that are actual constant or that already have been
3533 handled by this function. */
3535 if (tree_invariant_p (e))
3538 switch (TREE_CODE_CLASS (code))
3540 case tcc_exceptional:
3542 case tcc_declaration:
3543 case tcc_comparison:
3545 case tcc_expression:
3548 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3549 so that it will only be evaluated once. */
3550 /* The reference (r) and comparison (<) classes could be handled as
3551 below, but it is generally faster to only evaluate them once. */
3552 if (TREE_SIDE_EFFECTS (e))
3553 return save_expr (e);
3557 /* Constants need no processing. In fact, we should never reach
3562 /* Division is slow and tends to be compiled with jumps,
3563 especially the division by powers of 2 that is often
3564 found inside of an array reference. So do it just once. */
3565 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3566 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3567 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3568 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3569 return save_expr (e);
3570 /* Recursively stabilize each operand. */
3571 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3572 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3576 /* Recursively stabilize each operand. */
3577 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3584 TREE_TYPE (result) = TREE_TYPE (e);
3585 TREE_READONLY (result) = TREE_READONLY (e);
3586 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3587 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3592 /* Low-level constructors for expressions. */
3594 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3595 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3598 recompute_tree_invariant_for_addr_expr (tree t)
3601 bool tc = true, se = false;
3603 /* We started out assuming this address is both invariant and constant, but
3604 does not have side effects. Now go down any handled components and see if
3605 any of them involve offsets that are either non-constant or non-invariant.
3606 Also check for side-effects.
3608 ??? Note that this code makes no attempt to deal with the case where
3609 taking the address of something causes a copy due to misalignment. */
3611 #define UPDATE_FLAGS(NODE) \
3612 do { tree _node = (NODE); \
3613 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3614 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3616 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3617 node = TREE_OPERAND (node, 0))
3619 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3620 array reference (probably made temporarily by the G++ front end),
3621 so ignore all the operands. */
3622 if ((TREE_CODE (node) == ARRAY_REF
3623 || TREE_CODE (node) == ARRAY_RANGE_REF)
3624 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3626 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3627 if (TREE_OPERAND (node, 2))
3628 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3629 if (TREE_OPERAND (node, 3))
3630 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3632 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3633 FIELD_DECL, apparently. The G++ front end can put something else
3634 there, at least temporarily. */
3635 else if (TREE_CODE (node) == COMPONENT_REF
3636 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3638 if (TREE_OPERAND (node, 2))
3639 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3641 else if (TREE_CODE (node) == BIT_FIELD_REF)
3642 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3645 node = lang_hooks.expr_to_decl (node, &tc, &se);
3647 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3648 the address, since &(*a)->b is a form of addition. If it's a constant, the
3649 address is constant too. If it's a decl, its address is constant if the
3650 decl is static. Everything else is not constant and, furthermore,
3651 taking the address of a volatile variable is not volatile. */
3652 if (TREE_CODE (node) == INDIRECT_REF
3653 || TREE_CODE (node) == MEM_REF)
3654 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3655 else if (CONSTANT_CLASS_P (node))
3657 else if (DECL_P (node))
3658 tc &= (staticp (node) != NULL_TREE);
3662 se |= TREE_SIDE_EFFECTS (node);
3666 TREE_CONSTANT (t) = tc;
3667 TREE_SIDE_EFFECTS (t) = se;
3671 /* Build an expression of code CODE, data type TYPE, and operands as
3672 specified. Expressions and reference nodes can be created this way.
3673 Constants, decls, types and misc nodes cannot be.
3675 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3676 enough for all extant tree codes. */
3679 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3683 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3685 t = make_node_stat (code PASS_MEM_STAT);
3692 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3694 int length = sizeof (struct tree_exp);
3697 record_node_allocation_statistics (code, length);
3699 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3701 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
3703 memset (t, 0, sizeof (struct tree_common));
3705 TREE_SET_CODE (t, code);
3707 TREE_TYPE (t) = type;
3708 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3709 TREE_OPERAND (t, 0) = node;
3710 TREE_BLOCK (t) = NULL_TREE;
3711 if (node && !TYPE_P (node))
3713 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3714 TREE_READONLY (t) = TREE_READONLY (node);
3717 if (TREE_CODE_CLASS (code) == tcc_statement)
3718 TREE_SIDE_EFFECTS (t) = 1;
3722 /* All of these have side-effects, no matter what their
3724 TREE_SIDE_EFFECTS (t) = 1;
3725 TREE_READONLY (t) = 0;
3729 /* Whether a dereference is readonly has nothing to do with whether
3730 its operand is readonly. */
3731 TREE_READONLY (t) = 0;
3736 recompute_tree_invariant_for_addr_expr (t);
3740 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3741 && node && !TYPE_P (node)
3742 && TREE_CONSTANT (node))
3743 TREE_CONSTANT (t) = 1;
3744 if (TREE_CODE_CLASS (code) == tcc_reference
3745 && node && TREE_THIS_VOLATILE (node))
3746 TREE_THIS_VOLATILE (t) = 1;
3753 #define PROCESS_ARG(N) \
3755 TREE_OPERAND (t, N) = arg##N; \
3756 if (arg##N &&!TYPE_P (arg##N)) \
3758 if (TREE_SIDE_EFFECTS (arg##N)) \
3760 if (!TREE_READONLY (arg##N) \
3761 && !CONSTANT_CLASS_P (arg##N)) \
3762 (void) (read_only = 0); \
3763 if (!TREE_CONSTANT (arg##N)) \
3764 (void) (constant = 0); \
3769 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3771 bool constant, read_only, side_effects;
3774 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3776 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3777 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3778 /* When sizetype precision doesn't match that of pointers
3779 we need to be able to build explicit extensions or truncations
3780 of the offset argument. */
3781 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3782 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3783 && TREE_CODE (arg1) == INTEGER_CST);
3785 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3786 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3787 && ptrofftype_p (TREE_TYPE (arg1)));
3789 t = make_node_stat (code PASS_MEM_STAT);
3792 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3793 result based on those same flags for the arguments. But if the
3794 arguments aren't really even `tree' expressions, we shouldn't be trying
3797 /* Expressions without side effects may be constant if their
3798 arguments are as well. */
3799 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3800 || TREE_CODE_CLASS (code) == tcc_binary);
3802 side_effects = TREE_SIDE_EFFECTS (t);
3807 TREE_READONLY (t) = read_only;
3808 TREE_CONSTANT (t) = constant;
3809 TREE_SIDE_EFFECTS (t) = side_effects;
3810 TREE_THIS_VOLATILE (t)
3811 = (TREE_CODE_CLASS (code) == tcc_reference
3812 && arg0 && TREE_THIS_VOLATILE (arg0));
3819 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3820 tree arg2 MEM_STAT_DECL)
3822 bool constant, read_only, side_effects;
3825 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3826 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3828 t = make_node_stat (code PASS_MEM_STAT);
3833 /* As a special exception, if COND_EXPR has NULL branches, we
3834 assume that it is a gimple statement and always consider
3835 it to have side effects. */
3836 if (code == COND_EXPR
3837 && tt == void_type_node
3838 && arg1 == NULL_TREE
3839 && arg2 == NULL_TREE)
3840 side_effects = true;
3842 side_effects = TREE_SIDE_EFFECTS (t);
3848 if (code == COND_EXPR)
3849 TREE_READONLY (t) = read_only;
3851 TREE_SIDE_EFFECTS (t) = side_effects;
3852 TREE_THIS_VOLATILE (t)
3853 = (TREE_CODE_CLASS (code) == tcc_reference
3854 && arg0 && TREE_THIS_VOLATILE (arg0));
3860 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3861 tree arg2, tree arg3 MEM_STAT_DECL)
3863 bool constant, read_only, side_effects;
3866 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3868 t = make_node_stat (code PASS_MEM_STAT);
3871 side_effects = TREE_SIDE_EFFECTS (t);
3878 TREE_SIDE_EFFECTS (t) = side_effects;
3879 TREE_THIS_VOLATILE (t)
3880 = (TREE_CODE_CLASS (code) == tcc_reference
3881 && arg0 && TREE_THIS_VOLATILE (arg0));
3887 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3888 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3890 bool constant, read_only, side_effects;
3893 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3895 t = make_node_stat (code PASS_MEM_STAT);
3898 side_effects = TREE_SIDE_EFFECTS (t);
3906 TREE_SIDE_EFFECTS (t) = side_effects;
3907 TREE_THIS_VOLATILE (t)
3908 = (TREE_CODE_CLASS (code) == tcc_reference
3909 && arg0 && TREE_THIS_VOLATILE (arg0));
3915 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3916 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3918 bool constant, read_only, side_effects;
3921 gcc_assert (code == TARGET_MEM_REF);
3923 t = make_node_stat (code PASS_MEM_STAT);
3926 side_effects = TREE_SIDE_EFFECTS (t);
3933 if (code == TARGET_MEM_REF)
3937 TREE_SIDE_EFFECTS (t) = side_effects;
3938 TREE_THIS_VOLATILE (t)
3939 = (code == TARGET_MEM_REF
3940 && arg5 && TREE_THIS_VOLATILE (arg5));
3945 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3946 on the pointer PTR. */
3949 build_simple_mem_ref_loc (location_t loc, tree ptr)
3951 HOST_WIDE_INT offset = 0;
3952 tree ptype = TREE_TYPE (ptr);
3954 /* For convenience allow addresses that collapse to a simple base
3956 if (TREE_CODE (ptr) == ADDR_EXPR
3957 && (handled_component_p (TREE_OPERAND (ptr, 0))
3958 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
3960 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
3962 ptr = build_fold_addr_expr (ptr);
3963 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
3965 tem = build2 (MEM_REF, TREE_TYPE (ptype),
3966 ptr, build_int_cst (ptype, offset));
3967 SET_EXPR_LOCATION (tem, loc);
3971 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3974 mem_ref_offset (const_tree t)
3976 tree toff = TREE_OPERAND (t, 1);
3977 return double_int_sext (tree_to_double_int (toff),
3978 TYPE_PRECISION (TREE_TYPE (toff)));
3981 /* Return the pointer-type relevant for TBAA purposes from the
3982 gimple memory reference tree T. This is the type to be used for
3983 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3986 reference_alias_ptr_type (const_tree t)
3988 const_tree base = t;
3989 while (handled_component_p (base))
3990 base = TREE_OPERAND (base, 0);
3991 if (TREE_CODE (base) == MEM_REF)
3992 return TREE_TYPE (TREE_OPERAND (base, 1));
3993 else if (TREE_CODE (base) == TARGET_MEM_REF)
3994 return TREE_TYPE (TMR_OFFSET (base));
3996 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base)));
3999 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4000 offsetted by OFFSET units. */
4003 build_invariant_address (tree type, tree base, HOST_WIDE_INT offset)
4005 tree ref = fold_build2 (MEM_REF, TREE_TYPE (type),
4006 build_fold_addr_expr (base),
4007 build_int_cst (ptr_type_node, offset));
4008 tree addr = build1 (ADDR_EXPR, type, ref);
4009 recompute_tree_invariant_for_addr_expr (addr);
4013 /* Similar except don't specify the TREE_TYPE
4014 and leave the TREE_SIDE_EFFECTS as 0.
4015 It is permissible for arguments to be null,
4016 or even garbage if their values do not matter. */
4019 build_nt (enum tree_code code, ...)
4026 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4030 t = make_node (code);
4031 length = TREE_CODE_LENGTH (code);
4033 for (i = 0; i < length; i++)
4034 TREE_OPERAND (t, i) = va_arg (p, tree);
4040 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4044 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
4049 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
4050 CALL_EXPR_FN (ret) = fn;
4051 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
4052 FOR_EACH_VEC_ELT (tree, args, ix, t)
4053 CALL_EXPR_ARG (ret, ix) = t;
4057 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4058 We do NOT enter this node in any sort of symbol table.
4060 LOC is the location of the decl.
4062 layout_decl is used to set up the decl's storage layout.
4063 Other slots are initialized to 0 or null pointers. */
4066 build_decl_stat (location_t loc, enum tree_code code, tree name,
4067 tree type MEM_STAT_DECL)
4071 t = make_node_stat (code PASS_MEM_STAT);
4072 DECL_SOURCE_LOCATION (t) = loc;
4074 /* if (type == error_mark_node)
4075 type = integer_type_node; */
4076 /* That is not done, deliberately, so that having error_mark_node
4077 as the type can suppress useless errors in the use of this variable. */
4079 DECL_NAME (t) = name;
4080 TREE_TYPE (t) = type;
4082 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4088 /* Builds and returns function declaration with NAME and TYPE. */
4091 build_fn_decl (const char *name, tree type)
4093 tree id = get_identifier (name);
4094 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4096 DECL_EXTERNAL (decl) = 1;
4097 TREE_PUBLIC (decl) = 1;
4098 DECL_ARTIFICIAL (decl) = 1;
4099 TREE_NOTHROW (decl) = 1;
4104 VEC(tree,gc) *all_translation_units;
4106 /* Builds a new translation-unit decl with name NAME, queues it in the
4107 global list of translation-unit decls and returns it. */
4110 build_translation_unit_decl (tree name)
4112 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4114 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4115 VEC_safe_push (tree, gc, all_translation_units, tu);
4120 /* BLOCK nodes are used to represent the structure of binding contours
4121 and declarations, once those contours have been exited and their contents
4122 compiled. This information is used for outputting debugging info. */
4125 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4127 tree block = make_node (BLOCK);
4129 BLOCK_VARS (block) = vars;
4130 BLOCK_SUBBLOCKS (block) = subblocks;
4131 BLOCK_SUPERCONTEXT (block) = supercontext;
4132 BLOCK_CHAIN (block) = chain;
4137 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4139 LOC is the location to use in tree T. */
4142 protected_set_expr_location (tree t, location_t loc)
4144 if (t && CAN_HAVE_LOCATION_P (t))
4145 SET_EXPR_LOCATION (t, loc);
4148 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4152 build_decl_attribute_variant (tree ddecl, tree attribute)
4154 DECL_ATTRIBUTES (ddecl) = attribute;
4158 /* Borrowed from hashtab.c iterative_hash implementation. */
4159 #define mix(a,b,c) \
4161 a -= b; a -= c; a ^= (c>>13); \
4162 b -= c; b -= a; b ^= (a<< 8); \
4163 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4164 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4165 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4166 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4167 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4168 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4169 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4173 /* Produce good hash value combining VAL and VAL2. */
4175 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4177 /* the golden ratio; an arbitrary value. */
4178 hashval_t a = 0x9e3779b9;
4184 /* Produce good hash value combining VAL and VAL2. */
4186 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4188 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4189 return iterative_hash_hashval_t (val, val2);
4192 hashval_t a = (hashval_t) val;
4193 /* Avoid warnings about shifting of more than the width of the type on
4194 hosts that won't execute this path. */
4196 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4198 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4200 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4201 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4208 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4209 is ATTRIBUTE and its qualifiers are QUALS.
4211 Record such modified types already made so we don't make duplicates. */
4214 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4216 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4218 hashval_t hashcode = 0;
4220 enum tree_code code = TREE_CODE (ttype);
4222 /* Building a distinct copy of a tagged type is inappropriate; it
4223 causes breakage in code that expects there to be a one-to-one
4224 relationship between a struct and its fields.
4225 build_duplicate_type is another solution (as used in
4226 handle_transparent_union_attribute), but that doesn't play well
4227 with the stronger C++ type identity model. */
4228 if (TREE_CODE (ttype) == RECORD_TYPE
4229 || TREE_CODE (ttype) == UNION_TYPE
4230 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4231 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4233 warning (OPT_Wattributes,
4234 "ignoring attributes applied to %qT after definition",
4235 TYPE_MAIN_VARIANT (ttype));
4236 return build_qualified_type (ttype, quals);
4239 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4240 ntype = build_distinct_type_copy (ttype);
4242 TYPE_ATTRIBUTES (ntype) = attribute;
4244 hashcode = iterative_hash_object (code, hashcode);
4245 if (TREE_TYPE (ntype))
4246 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4248 hashcode = attribute_hash_list (attribute, hashcode);
4250 switch (TREE_CODE (ntype))
4253 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4256 if (TYPE_DOMAIN (ntype))
4257 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4261 hashcode = iterative_hash_object
4262 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4263 hashcode = iterative_hash_object
4264 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4267 case FIXED_POINT_TYPE:
4269 unsigned int precision = TYPE_PRECISION (ntype);
4270 hashcode = iterative_hash_object (precision, hashcode);
4277 ntype = type_hash_canon (hashcode, ntype);
4279 /* If the target-dependent attributes make NTYPE different from
4280 its canonical type, we will need to use structural equality
4281 checks for this type. */
4282 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4283 || !comp_type_attributes (ntype, ttype))
4284 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4285 else if (TYPE_CANONICAL (ntype) == ntype)
4286 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4288 ttype = build_qualified_type (ntype, quals);
4290 else if (TYPE_QUALS (ttype) != quals)
4291 ttype = build_qualified_type (ttype, quals);
4296 /* Compare two attributes for their value identity. Return true if the
4297 attribute values are known to be equal; otherwise return false.
4301 attribute_value_equal (const_tree attr1, const_tree attr2)
4303 if (TREE_VALUE (attr1) == TREE_VALUE (attr2))
4306 if (TREE_VALUE (attr1) != NULL_TREE
4307 && TREE_CODE (TREE_VALUE (attr1)) == TREE_LIST
4308 && TREE_VALUE (attr2) != NULL
4309 && TREE_CODE (TREE_VALUE (attr2)) == TREE_LIST)
4310 return (simple_cst_list_equal (TREE_VALUE (attr1),
4311 TREE_VALUE (attr2)) == 1);
4313 return (simple_cst_equal (TREE_VALUE (attr1), TREE_VALUE (attr2)) == 1);
4316 /* Return 0 if the attributes for two types are incompatible, 1 if they
4317 are compatible, and 2 if they are nearly compatible (which causes a
4318 warning to be generated). */
4320 comp_type_attributes (const_tree type1, const_tree type2)
4322 const_tree a1 = TYPE_ATTRIBUTES (type1);
4323 const_tree a2 = TYPE_ATTRIBUTES (type2);
4328 for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a))
4330 const struct attribute_spec *as;
4333 as = lookup_attribute_spec (TREE_PURPOSE (a));
4334 if (!as || as->affects_type_identity == false)
4337 attr = lookup_attribute (as->name, CONST_CAST_TREE (a2));
4338 if (!attr || !attribute_value_equal (a, attr))
4343 for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a))
4345 const struct attribute_spec *as;
4347 as = lookup_attribute_spec (TREE_PURPOSE (a));
4348 if (!as || as->affects_type_identity == false)
4351 if (!lookup_attribute (as->name, CONST_CAST_TREE (a1)))
4353 /* We don't need to compare trees again, as we did this
4354 already in first loop. */
4356 /* All types - affecting identity - are equal, so
4357 there is no need to call target hook for comparison. */
4361 /* As some type combinations - like default calling-convention - might
4362 be compatible, we have to call the target hook to get the final result. */
4363 return targetm.comp_type_attributes (type1, type2);
4366 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4369 Record such modified types already made so we don't make duplicates. */
4372 build_type_attribute_variant (tree ttype, tree attribute)
4374 return build_type_attribute_qual_variant (ttype, attribute,
4375 TYPE_QUALS (ttype));
4379 /* Reset the expression *EXPR_P, a size or position.
4381 ??? We could reset all non-constant sizes or positions. But it's cheap
4382 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4384 We need to reset self-referential sizes or positions because they cannot
4385 be gimplified and thus can contain a CALL_EXPR after the gimplification
4386 is finished, which will run afoul of LTO streaming. And they need to be
4387 reset to something essentially dummy but not constant, so as to preserve
4388 the properties of the object they are attached to. */
4391 free_lang_data_in_one_sizepos (tree *expr_p)
4393 tree expr = *expr_p;
4394 if (CONTAINS_PLACEHOLDER_P (expr))
4395 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4399 /* Reset all the fields in a binfo node BINFO. We only keep
4400 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4403 free_lang_data_in_binfo (tree binfo)
4408 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4410 BINFO_VTABLE (binfo) = NULL_TREE;
4411 BINFO_BASE_ACCESSES (binfo) = NULL;
4412 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4413 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4415 FOR_EACH_VEC_ELT (tree, BINFO_BASE_BINFOS (binfo), i, t)
4416 free_lang_data_in_binfo (t);
4420 /* Reset all language specific information still present in TYPE. */
4423 free_lang_data_in_type (tree type)
4425 gcc_assert (TYPE_P (type));
4427 /* Give the FE a chance to remove its own data first. */
4428 lang_hooks.free_lang_data (type);
4430 TREE_LANG_FLAG_0 (type) = 0;
4431 TREE_LANG_FLAG_1 (type) = 0;
4432 TREE_LANG_FLAG_2 (type) = 0;
4433 TREE_LANG_FLAG_3 (type) = 0;
4434 TREE_LANG_FLAG_4 (type) = 0;
4435 TREE_LANG_FLAG_5 (type) = 0;
4436 TREE_LANG_FLAG_6 (type) = 0;
4438 if (TREE_CODE (type) == FUNCTION_TYPE)
4440 /* Remove the const and volatile qualifiers from arguments. The
4441 C++ front end removes them, but the C front end does not,
4442 leading to false ODR violation errors when merging two
4443 instances of the same function signature compiled by
4444 different front ends. */
4447 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4449 tree arg_type = TREE_VALUE (p);
4451 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4453 int quals = TYPE_QUALS (arg_type)
4455 & ~TYPE_QUAL_VOLATILE;
4456 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4457 free_lang_data_in_type (TREE_VALUE (p));
4462 /* Remove members that are not actually FIELD_DECLs from the field
4463 list of an aggregate. These occur in C++. */
4464 if (RECORD_OR_UNION_TYPE_P (type))
4468 /* Note that TYPE_FIELDS can be shared across distinct
4469 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4470 to be removed, we cannot set its TREE_CHAIN to NULL.
4471 Otherwise, we would not be able to find all the other fields
4472 in the other instances of this TREE_TYPE.
4474 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4476 member = TYPE_FIELDS (type);
4479 if (TREE_CODE (member) == FIELD_DECL)
4482 TREE_CHAIN (prev) = member;
4484 TYPE_FIELDS (type) = member;
4488 member = TREE_CHAIN (member);
4492 TREE_CHAIN (prev) = NULL_TREE;
4494 TYPE_FIELDS (type) = NULL_TREE;
4496 TYPE_METHODS (type) = NULL_TREE;
4497 if (TYPE_BINFO (type))
4498 free_lang_data_in_binfo (TYPE_BINFO (type));
4502 /* For non-aggregate types, clear out the language slot (which
4503 overloads TYPE_BINFO). */
4504 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4506 if (INTEGRAL_TYPE_P (type)
4507 || SCALAR_FLOAT_TYPE_P (type)
4508 || FIXED_POINT_TYPE_P (type))
4510 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4511 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4515 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4516 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4518 if (debug_info_level < DINFO_LEVEL_TERSE
4519 || (TYPE_CONTEXT (type)
4520 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4521 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4522 TYPE_CONTEXT (type) = NULL_TREE;
4524 if (debug_info_level < DINFO_LEVEL_TERSE)
4525 TYPE_STUB_DECL (type) = NULL_TREE;
4529 /* Return true if DECL may need an assembler name to be set. */
4532 need_assembler_name_p (tree decl)
4534 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4535 if (TREE_CODE (decl) != FUNCTION_DECL
4536 && TREE_CODE (decl) != VAR_DECL)
4539 /* If DECL already has its assembler name set, it does not need a
4541 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4542 || DECL_ASSEMBLER_NAME_SET_P (decl))
4545 /* Abstract decls do not need an assembler name. */
4546 if (DECL_ABSTRACT (decl))
4549 /* For VAR_DECLs, only static, public and external symbols need an
4551 if (TREE_CODE (decl) == VAR_DECL
4552 && !TREE_STATIC (decl)
4553 && !TREE_PUBLIC (decl)
4554 && !DECL_EXTERNAL (decl))
4557 if (TREE_CODE (decl) == FUNCTION_DECL)
4559 /* Do not set assembler name on builtins. Allow RTL expansion to
4560 decide whether to expand inline or via a regular call. */
4561 if (DECL_BUILT_IN (decl)
4562 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4565 /* Functions represented in the callgraph need an assembler name. */
4566 if (cgraph_get_node (decl) != NULL)
4569 /* Unused and not public functions don't need an assembler name. */
4570 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4578 /* Reset all language specific information still present in symbol
4582 free_lang_data_in_decl (tree decl)
4584 gcc_assert (DECL_P (decl));
4586 /* Give the FE a chance to remove its own data first. */
4587 lang_hooks.free_lang_data (decl);
4589 TREE_LANG_FLAG_0 (decl) = 0;
4590 TREE_LANG_FLAG_1 (decl) = 0;
4591 TREE_LANG_FLAG_2 (decl) = 0;
4592 TREE_LANG_FLAG_3 (decl) = 0;
4593 TREE_LANG_FLAG_4 (decl) = 0;
4594 TREE_LANG_FLAG_5 (decl) = 0;
4595 TREE_LANG_FLAG_6 (decl) = 0;
4597 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4598 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4599 if (TREE_CODE (decl) == FIELD_DECL)
4600 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4602 /* DECL_FCONTEXT is only used for debug info generation. */
4603 if (TREE_CODE (decl) == FIELD_DECL
4604 && debug_info_level < DINFO_LEVEL_TERSE)
4605 DECL_FCONTEXT (decl) = NULL_TREE;
4607 if (TREE_CODE (decl) == FUNCTION_DECL)
4609 if (gimple_has_body_p (decl))
4613 /* If DECL has a gimple body, then the context for its
4614 arguments must be DECL. Otherwise, it doesn't really
4615 matter, as we will not be emitting any code for DECL. In
4616 general, there may be other instances of DECL created by
4617 the front end and since PARM_DECLs are generally shared,
4618 their DECL_CONTEXT changes as the replicas of DECL are
4619 created. The only time where DECL_CONTEXT is important
4620 is for the FUNCTION_DECLs that have a gimple body (since
4621 the PARM_DECL will be used in the function's body). */
4622 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4623 DECL_CONTEXT (t) = decl;
4626 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4627 At this point, it is not needed anymore. */
4628 DECL_SAVED_TREE (decl) = NULL_TREE;
4630 /* Clear the abstract origin if it refers to a method. Otherwise
4631 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4632 origin will not be output correctly. */
4633 if (DECL_ABSTRACT_ORIGIN (decl)
4634 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))
4635 && RECORD_OR_UNION_TYPE_P
4636 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))))
4637 DECL_ABSTRACT_ORIGIN (decl) = NULL_TREE;
4639 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4640 DECL_VINDEX referring to itself into a vtable slot number as it
4641 should. Happens with functions that are copied and then forgotten
4642 about. Just clear it, it won't matter anymore. */
4643 if (DECL_VINDEX (decl) && !host_integerp (DECL_VINDEX (decl), 0))
4644 DECL_VINDEX (decl) = NULL_TREE;
4646 else if (TREE_CODE (decl) == VAR_DECL)
4648 if ((DECL_EXTERNAL (decl)
4649 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4650 || (decl_function_context (decl) && !TREE_STATIC (decl)))
4651 DECL_INITIAL (decl) = NULL_TREE;
4653 else if (TREE_CODE (decl) == TYPE_DECL)
4654 DECL_INITIAL (decl) = NULL_TREE;
4655 else if (TREE_CODE (decl) == TRANSLATION_UNIT_DECL
4656 && DECL_INITIAL (decl)
4657 && TREE_CODE (DECL_INITIAL (decl)) == BLOCK)
4659 /* Strip builtins from the translation-unit BLOCK. We still have
4660 targets without builtin_decl support and also builtins are
4661 shared nodes and thus we can't use TREE_CHAIN in multiple
4663 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
4667 if (TREE_CODE (var) == FUNCTION_DECL
4668 && DECL_BUILT_IN (var))
4669 *nextp = TREE_CHAIN (var);
4671 nextp = &TREE_CHAIN (var);
4677 /* Data used when collecting DECLs and TYPEs for language data removal. */
4679 struct free_lang_data_d
4681 /* Worklist to avoid excessive recursion. */
4682 VEC(tree,heap) *worklist;
4684 /* Set of traversed objects. Used to avoid duplicate visits. */
4685 struct pointer_set_t *pset;
4687 /* Array of symbols to process with free_lang_data_in_decl. */
4688 VEC(tree,heap) *decls;
4690 /* Array of types to process with free_lang_data_in_type. */
4691 VEC(tree,heap) *types;
4695 /* Save all language fields needed to generate proper debug information
4696 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4699 save_debug_info_for_decl (tree t)
4701 /*struct saved_debug_info_d *sdi;*/
4703 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4705 /* FIXME. Partial implementation for saving debug info removed. */
4709 /* Save all language fields needed to generate proper debug information
4710 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4713 save_debug_info_for_type (tree t)
4715 /*struct saved_debug_info_d *sdi;*/
4717 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4719 /* FIXME. Partial implementation for saving debug info removed. */
4723 /* Add type or decl T to one of the list of tree nodes that need their
4724 language data removed. The lists are held inside FLD. */
4727 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4731 VEC_safe_push (tree, heap, fld->decls, t);
4732 if (debug_info_level > DINFO_LEVEL_TERSE)
4733 save_debug_info_for_decl (t);
4735 else if (TYPE_P (t))
4737 VEC_safe_push (tree, heap, fld->types, t);
4738 if (debug_info_level > DINFO_LEVEL_TERSE)
4739 save_debug_info_for_type (t);
4745 /* Push tree node T into FLD->WORKLIST. */
4748 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4750 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4751 VEC_safe_push (tree, heap, fld->worklist, (t));
4755 /* Operand callback helper for free_lang_data_in_node. *TP is the
4756 subtree operand being considered. */
4759 find_decls_types_r (tree *tp, int *ws, void *data)
4762 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4764 if (TREE_CODE (t) == TREE_LIST)
4767 /* Language specific nodes will be removed, so there is no need
4768 to gather anything under them. */
4769 if (is_lang_specific (t))
4777 /* Note that walk_tree does not traverse every possible field in
4778 decls, so we have to do our own traversals here. */
4779 add_tree_to_fld_list (t, fld);
4781 fld_worklist_push (DECL_NAME (t), fld);
4782 fld_worklist_push (DECL_CONTEXT (t), fld);
4783 fld_worklist_push (DECL_SIZE (t), fld);
4784 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4786 /* We are going to remove everything under DECL_INITIAL for
4787 TYPE_DECLs. No point walking them. */
4788 if (TREE_CODE (t) != TYPE_DECL)
4789 fld_worklist_push (DECL_INITIAL (t), fld);
4791 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4792 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4794 if (TREE_CODE (t) == FUNCTION_DECL)
4796 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4797 fld_worklist_push (DECL_RESULT (t), fld);
4799 else if (TREE_CODE (t) == TYPE_DECL)
4801 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4802 fld_worklist_push (DECL_VINDEX (t), fld);
4804 else if (TREE_CODE (t) == FIELD_DECL)
4806 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4807 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4808 fld_worklist_push (DECL_QUALIFIER (t), fld);
4809 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4810 fld_worklist_push (DECL_FCONTEXT (t), fld);
4812 else if (TREE_CODE (t) == VAR_DECL)
4814 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4815 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4818 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4819 && DECL_HAS_VALUE_EXPR_P (t))
4820 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4822 if (TREE_CODE (t) != FIELD_DECL
4823 && TREE_CODE (t) != TYPE_DECL)
4824 fld_worklist_push (TREE_CHAIN (t), fld);
4827 else if (TYPE_P (t))
4829 /* Note that walk_tree does not traverse every possible field in
4830 types, so we have to do our own traversals here. */
4831 add_tree_to_fld_list (t, fld);
4833 if (!RECORD_OR_UNION_TYPE_P (t))
4834 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4835 fld_worklist_push (TYPE_SIZE (t), fld);
4836 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4837 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4838 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4839 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4840 fld_worklist_push (TYPE_NAME (t), fld);
4841 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4842 them and thus do not and want not to reach unused pointer types
4844 if (!POINTER_TYPE_P (t))
4845 fld_worklist_push (TYPE_MINVAL (t), fld);
4846 if (!RECORD_OR_UNION_TYPE_P (t))
4847 fld_worklist_push (TYPE_MAXVAL (t), fld);
4848 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4849 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4850 do not and want not to reach unused variants this way. */
4851 fld_worklist_push (TYPE_CONTEXT (t), fld);
4852 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4853 and want not to reach unused types this way. */
4855 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4859 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4861 fld_worklist_push (TREE_TYPE (tem), fld);
4862 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4864 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4865 && TREE_CODE (tem) == TREE_LIST)
4868 fld_worklist_push (TREE_VALUE (tem), fld);
4869 tem = TREE_CHAIN (tem);
4873 if (RECORD_OR_UNION_TYPE_P (t))
4876 /* Push all TYPE_FIELDS - there can be interleaving interesting
4877 and non-interesting things. */
4878 tem = TYPE_FIELDS (t);
4881 if (TREE_CODE (tem) == FIELD_DECL)
4882 fld_worklist_push (tem, fld);
4883 tem = TREE_CHAIN (tem);
4887 fld_worklist_push (TREE_CHAIN (t), fld);
4890 else if (TREE_CODE (t) == BLOCK)
4893 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4894 fld_worklist_push (tem, fld);
4895 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4896 fld_worklist_push (tem, fld);
4897 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4900 if (TREE_CODE (t) != IDENTIFIER_NODE
4901 && CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_TYPED))
4902 fld_worklist_push (TREE_TYPE (t), fld);
4908 /* Find decls and types in T. */
4911 find_decls_types (tree t, struct free_lang_data_d *fld)
4915 if (!pointer_set_contains (fld->pset, t))
4916 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4917 if (VEC_empty (tree, fld->worklist))
4919 t = VEC_pop (tree, fld->worklist);
4923 /* Translate all the types in LIST with the corresponding runtime
4927 get_eh_types_for_runtime (tree list)
4931 if (list == NULL_TREE)
4934 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4936 list = TREE_CHAIN (list);
4939 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4940 TREE_CHAIN (prev) = n;
4941 prev = TREE_CHAIN (prev);
4942 list = TREE_CHAIN (list);
4949 /* Find decls and types referenced in EH region R and store them in
4950 FLD->DECLS and FLD->TYPES. */
4953 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4964 /* The types referenced in each catch must first be changed to the
4965 EH types used at runtime. This removes references to FE types
4967 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4969 c->type_list = get_eh_types_for_runtime (c->type_list);
4970 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4975 case ERT_ALLOWED_EXCEPTIONS:
4976 r->u.allowed.type_list
4977 = get_eh_types_for_runtime (r->u.allowed.type_list);
4978 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4981 case ERT_MUST_NOT_THROW:
4982 walk_tree (&r->u.must_not_throw.failure_decl,
4983 find_decls_types_r, fld, fld->pset);
4989 /* Find decls and types referenced in cgraph node N and store them in
4990 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4991 look for *every* kind of DECL and TYPE node reachable from N,
4992 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4993 NAMESPACE_DECLs, etc). */
4996 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4999 struct function *fn;
5003 find_decls_types (n->decl, fld);
5005 if (!gimple_has_body_p (n->decl))
5008 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
5010 fn = DECL_STRUCT_FUNCTION (n->decl);
5012 /* Traverse locals. */
5013 FOR_EACH_LOCAL_DECL (fn, ix, t)
5014 find_decls_types (t, fld);
5016 /* Traverse EH regions in FN. */
5019 FOR_ALL_EH_REGION_FN (r, fn)
5020 find_decls_types_in_eh_region (r, fld);
5023 /* Traverse every statement in FN. */
5024 FOR_EACH_BB_FN (bb, fn)
5026 gimple_stmt_iterator si;
5029 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
5031 gimple phi = gsi_stmt (si);
5033 for (i = 0; i < gimple_phi_num_args (phi); i++)
5035 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
5036 find_decls_types (*arg_p, fld);
5040 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5042 gimple stmt = gsi_stmt (si);
5044 for (i = 0; i < gimple_num_ops (stmt); i++)
5046 tree arg = gimple_op (stmt, i);
5047 find_decls_types (arg, fld);
5054 /* Find decls and types referenced in varpool node N and store them in
5055 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5056 look for *every* kind of DECL and TYPE node reachable from N,
5057 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5058 NAMESPACE_DECLs, etc). */
5061 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
5063 find_decls_types (v->decl, fld);
5066 /* If T needs an assembler name, have one created for it. */
5069 assign_assembler_name_if_neeeded (tree t)
5071 if (need_assembler_name_p (t))
5073 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5074 diagnostics that use input_location to show locus
5075 information. The problem here is that, at this point,
5076 input_location is generally anchored to the end of the file
5077 (since the parser is long gone), so we don't have a good
5078 position to pin it to.
5080 To alleviate this problem, this uses the location of T's
5081 declaration. Examples of this are
5082 testsuite/g++.dg/template/cond2.C and
5083 testsuite/g++.dg/template/pr35240.C. */
5084 location_t saved_location = input_location;
5085 input_location = DECL_SOURCE_LOCATION (t);
5087 decl_assembler_name (t);
5089 input_location = saved_location;
5094 /* Free language specific information for every operand and expression
5095 in every node of the call graph. This process operates in three stages:
5097 1- Every callgraph node and varpool node is traversed looking for
5098 decls and types embedded in them. This is a more exhaustive
5099 search than that done by find_referenced_vars, because it will
5100 also collect individual fields, decls embedded in types, etc.
5102 2- All the decls found are sent to free_lang_data_in_decl.
5104 3- All the types found are sent to free_lang_data_in_type.
5106 The ordering between decls and types is important because
5107 free_lang_data_in_decl sets assembler names, which includes
5108 mangling. So types cannot be freed up until assembler names have
5112 free_lang_data_in_cgraph (void)
5114 struct cgraph_node *n;
5115 struct varpool_node *v;
5116 struct free_lang_data_d fld;
5121 /* Initialize sets and arrays to store referenced decls and types. */
5122 fld.pset = pointer_set_create ();
5123 fld.worklist = NULL;
5124 fld.decls = VEC_alloc (tree, heap, 100);
5125 fld.types = VEC_alloc (tree, heap, 100);
5127 /* Find decls and types in the body of every function in the callgraph. */
5128 for (n = cgraph_nodes; n; n = n->next)
5129 find_decls_types_in_node (n, &fld);
5131 FOR_EACH_VEC_ELT (alias_pair, alias_pairs, i, p)
5132 find_decls_types (p->decl, &fld);
5134 /* Find decls and types in every varpool symbol. */
5135 for (v = varpool_nodes; v; v = v->next)
5136 find_decls_types_in_var (v, &fld);
5138 /* Set the assembler name on every decl found. We need to do this
5139 now because free_lang_data_in_decl will invalidate data needed
5140 for mangling. This breaks mangling on interdependent decls. */
5141 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5142 assign_assembler_name_if_neeeded (t);
5144 /* Traverse every decl found freeing its language data. */
5145 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5146 free_lang_data_in_decl (t);
5148 /* Traverse every type found freeing its language data. */
5149 FOR_EACH_VEC_ELT (tree, fld.types, i, t)
5150 free_lang_data_in_type (t);
5152 pointer_set_destroy (fld.pset);
5153 VEC_free (tree, heap, fld.worklist);
5154 VEC_free (tree, heap, fld.decls);
5155 VEC_free (tree, heap, fld.types);
5159 /* Free resources that are used by FE but are not needed once they are done. */
5162 free_lang_data (void)
5166 /* If we are the LTO frontend we have freed lang-specific data already. */
5168 || !flag_generate_lto)
5171 /* Allocate and assign alias sets to the standard integer types
5172 while the slots are still in the way the frontends generated them. */
5173 for (i = 0; i < itk_none; ++i)
5174 if (integer_types[i])
5175 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5177 /* Traverse the IL resetting language specific information for
5178 operands, expressions, etc. */
5179 free_lang_data_in_cgraph ();
5181 /* Create gimple variants for common types. */
5182 ptrdiff_type_node = integer_type_node;
5183 fileptr_type_node = ptr_type_node;
5185 /* Reset some langhooks. Do not reset types_compatible_p, it may
5186 still be used indirectly via the get_alias_set langhook. */
5187 lang_hooks.callgraph.analyze_expr = NULL;
5188 lang_hooks.dwarf_name = lhd_dwarf_name;
5189 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5190 /* We do not want the default decl_assembler_name implementation,
5191 rather if we have fixed everything we want a wrapper around it
5192 asserting that all non-local symbols already got their assembler
5193 name and only produce assembler names for local symbols. Or rather
5194 make sure we never call decl_assembler_name on local symbols and
5195 devise a separate, middle-end private scheme for it. */
5197 /* Reset diagnostic machinery. */
5198 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5199 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5200 diagnostic_format_decoder (global_dc) = default_tree_printer;
5206 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5210 "*free_lang_data", /* name */
5212 free_lang_data, /* execute */
5215 0, /* static_pass_number */
5216 TV_IPA_FREE_LANG_DATA, /* tv_id */
5217 0, /* properties_required */
5218 0, /* properties_provided */
5219 0, /* properties_destroyed */
5220 0, /* todo_flags_start */
5221 TODO_ggc_collect /* todo_flags_finish */
5225 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5226 ATTR_NAME. Also used internally by remove_attribute(). */
5228 private_is_attribute_p (const char *attr_name, size_t attr_len, const_tree ident)
5230 size_t ident_len = IDENTIFIER_LENGTH (ident);
5232 if (ident_len == attr_len)
5234 if (strcmp (attr_name, IDENTIFIER_POINTER (ident)) == 0)
5237 else if (ident_len == attr_len + 4)
5239 /* There is the possibility that ATTR is 'text' and IDENT is
5241 const char *p = IDENTIFIER_POINTER (ident);
5242 if (p[0] == '_' && p[1] == '_'
5243 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5244 && strncmp (attr_name, p + 2, attr_len) == 0)
5251 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5252 of ATTR_NAME, and LIST is not NULL_TREE. */
5254 private_lookup_attribute (const char *attr_name, size_t attr_len, tree list)
5258 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5260 if (ident_len == attr_len)
5262 if (strcmp (attr_name, IDENTIFIER_POINTER (TREE_PURPOSE (list))) == 0)
5265 /* TODO: If we made sure that attributes were stored in the
5266 canonical form without '__...__' (ie, as in 'text' as opposed
5267 to '__text__') then we could avoid the following case. */
5268 else if (ident_len == attr_len + 4)
5270 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5271 if (p[0] == '_' && p[1] == '_'
5272 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5273 && strncmp (attr_name, p + 2, attr_len) == 0)
5276 list = TREE_CHAIN (list);
5282 /* A variant of lookup_attribute() that can be used with an identifier
5283 as the first argument, and where the identifier can be either
5284 'text' or '__text__'.
5286 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5287 return a pointer to the attribute's list element if the attribute
5288 is part of the list, or NULL_TREE if not found. If the attribute
5289 appears more than once, this only returns the first occurrence; the
5290 TREE_CHAIN of the return value should be passed back in if further
5291 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5292 can be in the form 'text' or '__text__'. */
5294 lookup_ident_attribute (tree attr_identifier, tree list)
5296 gcc_checking_assert (TREE_CODE (attr_identifier) == IDENTIFIER_NODE);
5300 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list)) == IDENTIFIER_NODE);
5302 /* Identifiers can be compared directly for equality. */
5303 if (attr_identifier == TREE_PURPOSE (list))
5306 /* If they are not equal, they may still be one in the form
5307 'text' while the other one is in the form '__text__'. TODO:
5308 If we were storing attributes in normalized 'text' form, then
5309 this could all go away and we could take full advantage of
5310 the fact that we're comparing identifiers. :-) */
5312 size_t attr_len = IDENTIFIER_LENGTH (attr_identifier);
5313 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5315 if (ident_len == attr_len + 4)
5317 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5318 const char *q = IDENTIFIER_POINTER (attr_identifier);
5319 if (p[0] == '_' && p[1] == '_'
5320 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5321 && strncmp (q, p + 2, attr_len) == 0)
5324 else if (ident_len + 4 == attr_len)
5326 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5327 const char *q = IDENTIFIER_POINTER (attr_identifier);
5328 if (q[0] == '_' && q[1] == '_'
5329 && q[attr_len - 2] == '_' && q[attr_len - 1] == '_'
5330 && strncmp (q + 2, p, ident_len) == 0)
5334 list = TREE_CHAIN (list);
5340 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5344 remove_attribute (const char *attr_name, tree list)
5347 size_t attr_len = strlen (attr_name);
5349 gcc_checking_assert (attr_name[0] != '_');
5351 for (p = &list; *p; )
5354 /* TODO: If we were storing attributes in normalized form, here
5355 we could use a simple strcmp(). */
5356 if (private_is_attribute_p (attr_name, attr_len, TREE_PURPOSE (l)))
5357 *p = TREE_CHAIN (l);
5359 p = &TREE_CHAIN (l);
5365 /* Return an attribute list that is the union of a1 and a2. */
5368 merge_attributes (tree a1, tree a2)
5372 /* Either one unset? Take the set one. */
5374 if ((attributes = a1) == 0)
5377 /* One that completely contains the other? Take it. */
5379 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5381 if (attribute_list_contained (a2, a1))
5385 /* Pick the longest list, and hang on the other list. */
5387 if (list_length (a1) < list_length (a2))
5388 attributes = a2, a2 = a1;
5390 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5393 for (a = lookup_ident_attribute (TREE_PURPOSE (a2), attributes);
5394 a != NULL_TREE && !attribute_value_equal (a, a2);
5395 a = lookup_ident_attribute (TREE_PURPOSE (a2), TREE_CHAIN (a)))
5399 a1 = copy_node (a2);
5400 TREE_CHAIN (a1) = attributes;
5409 /* Given types T1 and T2, merge their attributes and return
5413 merge_type_attributes (tree t1, tree t2)
5415 return merge_attributes (TYPE_ATTRIBUTES (t1),
5416 TYPE_ATTRIBUTES (t2));
5419 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5423 merge_decl_attributes (tree olddecl, tree newdecl)
5425 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5426 DECL_ATTRIBUTES (newdecl));
5429 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5431 /* Specialization of merge_decl_attributes for various Windows targets.
5433 This handles the following situation:
5435 __declspec (dllimport) int foo;
5438 The second instance of `foo' nullifies the dllimport. */
5441 merge_dllimport_decl_attributes (tree old, tree new_tree)
5444 int delete_dllimport_p = 1;
5446 /* What we need to do here is remove from `old' dllimport if it doesn't
5447 appear in `new'. dllimport behaves like extern: if a declaration is
5448 marked dllimport and a definition appears later, then the object
5449 is not dllimport'd. We also remove a `new' dllimport if the old list
5450 contains dllexport: dllexport always overrides dllimport, regardless
5451 of the order of declaration. */
5452 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5453 delete_dllimport_p = 0;
5454 else if (DECL_DLLIMPORT_P (new_tree)
5455 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5457 DECL_DLLIMPORT_P (new_tree) = 0;
5458 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5459 "dllimport ignored", new_tree);
5461 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5463 /* Warn about overriding a symbol that has already been used, e.g.:
5464 extern int __attribute__ ((dllimport)) foo;
5465 int* bar () {return &foo;}
5468 if (TREE_USED (old))
5470 warning (0, "%q+D redeclared without dllimport attribute "
5471 "after being referenced with dll linkage", new_tree);
5472 /* If we have used a variable's address with dllimport linkage,
5473 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5474 decl may already have had TREE_CONSTANT computed.
5475 We still remove the attribute so that assembler code refers
5476 to '&foo rather than '_imp__foo'. */
5477 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5478 DECL_DLLIMPORT_P (new_tree) = 1;
5481 /* Let an inline definition silently override the external reference,
5482 but otherwise warn about attribute inconsistency. */
5483 else if (TREE_CODE (new_tree) == VAR_DECL
5484 || !DECL_DECLARED_INLINE_P (new_tree))
5485 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5486 "previous dllimport ignored", new_tree);
5489 delete_dllimport_p = 0;
5491 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5493 if (delete_dllimport_p)
5494 a = remove_attribute ("dllimport", a);
5499 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5500 struct attribute_spec.handler. */
5503 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5509 /* These attributes may apply to structure and union types being created,
5510 but otherwise should pass to the declaration involved. */
5513 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5514 | (int) ATTR_FLAG_ARRAY_NEXT))
5516 *no_add_attrs = true;
5517 return tree_cons (name, args, NULL_TREE);
5519 if (TREE_CODE (node) == RECORD_TYPE
5520 || TREE_CODE (node) == UNION_TYPE)
5522 node = TYPE_NAME (node);
5528 warning (OPT_Wattributes, "%qE attribute ignored",
5530 *no_add_attrs = true;
5535 if (TREE_CODE (node) != FUNCTION_DECL
5536 && TREE_CODE (node) != VAR_DECL
5537 && TREE_CODE (node) != TYPE_DECL)
5539 *no_add_attrs = true;
5540 warning (OPT_Wattributes, "%qE attribute ignored",
5545 if (TREE_CODE (node) == TYPE_DECL
5546 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5547 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5549 *no_add_attrs = true;
5550 warning (OPT_Wattributes, "%qE attribute ignored",
5555 is_dllimport = is_attribute_p ("dllimport", name);
5557 /* Report error on dllimport ambiguities seen now before they cause
5561 /* Honor any target-specific overrides. */
5562 if (!targetm.valid_dllimport_attribute_p (node))
5563 *no_add_attrs = true;
5565 else if (TREE_CODE (node) == FUNCTION_DECL
5566 && DECL_DECLARED_INLINE_P (node))
5568 warning (OPT_Wattributes, "inline function %q+D declared as "
5569 " dllimport: attribute ignored", node);
5570 *no_add_attrs = true;
5572 /* Like MS, treat definition of dllimported variables and
5573 non-inlined functions on declaration as syntax errors. */
5574 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5576 error ("function %q+D definition is marked dllimport", node);
5577 *no_add_attrs = true;
5580 else if (TREE_CODE (node) == VAR_DECL)
5582 if (DECL_INITIAL (node))
5584 error ("variable %q+D definition is marked dllimport",
5586 *no_add_attrs = true;
5589 /* `extern' needn't be specified with dllimport.
5590 Specify `extern' now and hope for the best. Sigh. */
5591 DECL_EXTERNAL (node) = 1;
5592 /* Also, implicitly give dllimport'd variables declared within
5593 a function global scope, unless declared static. */
5594 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5595 TREE_PUBLIC (node) = 1;
5598 if (*no_add_attrs == false)
5599 DECL_DLLIMPORT_P (node) = 1;
5601 else if (TREE_CODE (node) == FUNCTION_DECL
5602 && DECL_DECLARED_INLINE_P (node)
5603 && flag_keep_inline_dllexport)
5604 /* An exported function, even if inline, must be emitted. */
5605 DECL_EXTERNAL (node) = 0;
5607 /* Report error if symbol is not accessible at global scope. */
5608 if (!TREE_PUBLIC (node)
5609 && (TREE_CODE (node) == VAR_DECL
5610 || TREE_CODE (node) == FUNCTION_DECL))
5612 error ("external linkage required for symbol %q+D because of "
5613 "%qE attribute", node, name);
5614 *no_add_attrs = true;
5617 /* A dllexport'd entity must have default visibility so that other
5618 program units (shared libraries or the main executable) can see
5619 it. A dllimport'd entity must have default visibility so that
5620 the linker knows that undefined references within this program
5621 unit can be resolved by the dynamic linker. */
5624 if (DECL_VISIBILITY_SPECIFIED (node)
5625 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5626 error ("%qE implies default visibility, but %qD has already "
5627 "been declared with a different visibility",
5629 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5630 DECL_VISIBILITY_SPECIFIED (node) = 1;
5636 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5638 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5639 of the various TYPE_QUAL values. */
5642 set_type_quals (tree type, int type_quals)
5644 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5645 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5646 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5647 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5650 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5653 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5655 return (TYPE_QUALS (cand) == type_quals
5656 && TYPE_NAME (cand) == TYPE_NAME (base)
5657 /* Apparently this is needed for Objective-C. */
5658 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5659 /* Check alignment. */
5660 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
5661 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5662 TYPE_ATTRIBUTES (base)));
5665 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5668 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
5670 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
5671 && TYPE_NAME (cand) == TYPE_NAME (base)
5672 /* Apparently this is needed for Objective-C. */
5673 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5674 /* Check alignment. */
5675 && TYPE_ALIGN (cand) == align
5676 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5677 TYPE_ATTRIBUTES (base)));
5680 /* Return a version of the TYPE, qualified as indicated by the
5681 TYPE_QUALS, if one exists. If no qualified version exists yet,
5682 return NULL_TREE. */
5685 get_qualified_type (tree type, int type_quals)
5689 if (TYPE_QUALS (type) == type_quals)
5692 /* Search the chain of variants to see if there is already one there just
5693 like the one we need to have. If so, use that existing one. We must
5694 preserve the TYPE_NAME, since there is code that depends on this. */
5695 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5696 if (check_qualified_type (t, type, type_quals))
5702 /* Like get_qualified_type, but creates the type if it does not
5703 exist. This function never returns NULL_TREE. */
5706 build_qualified_type (tree type, int type_quals)
5710 /* See if we already have the appropriate qualified variant. */
5711 t = get_qualified_type (type, type_quals);
5713 /* If not, build it. */
5716 t = build_variant_type_copy (type);
5717 set_type_quals (t, type_quals);
5719 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5720 /* Propagate structural equality. */
5721 SET_TYPE_STRUCTURAL_EQUALITY (t);
5722 else if (TYPE_CANONICAL (type) != type)
5723 /* Build the underlying canonical type, since it is different
5725 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5728 /* T is its own canonical type. */
5729 TYPE_CANONICAL (t) = t;
5736 /* Create a variant of type T with alignment ALIGN. */
5739 build_aligned_type (tree type, unsigned int align)
5743 if (TYPE_PACKED (type)
5744 || TYPE_ALIGN (type) == align)
5747 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5748 if (check_aligned_type (t, type, align))
5751 t = build_variant_type_copy (type);
5752 TYPE_ALIGN (t) = align;
5757 /* Create a new distinct copy of TYPE. The new type is made its own
5758 MAIN_VARIANT. If TYPE requires structural equality checks, the
5759 resulting type requires structural equality checks; otherwise, its
5760 TYPE_CANONICAL points to itself. */
5763 build_distinct_type_copy (tree type)
5765 tree t = copy_node (type);
5767 TYPE_POINTER_TO (t) = 0;
5768 TYPE_REFERENCE_TO (t) = 0;
5770 /* Set the canonical type either to a new equivalence class, or
5771 propagate the need for structural equality checks. */
5772 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5773 SET_TYPE_STRUCTURAL_EQUALITY (t);
5775 TYPE_CANONICAL (t) = t;
5777 /* Make it its own variant. */
5778 TYPE_MAIN_VARIANT (t) = t;
5779 TYPE_NEXT_VARIANT (t) = 0;
5781 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5782 whose TREE_TYPE is not t. This can also happen in the Ada
5783 frontend when using subtypes. */
5788 /* Create a new variant of TYPE, equivalent but distinct. This is so
5789 the caller can modify it. TYPE_CANONICAL for the return type will
5790 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5791 are considered equal by the language itself (or that both types
5792 require structural equality checks). */
5795 build_variant_type_copy (tree type)
5797 tree t, m = TYPE_MAIN_VARIANT (type);
5799 t = build_distinct_type_copy (type);
5801 /* Since we're building a variant, assume that it is a non-semantic
5802 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5803 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5805 /* Add the new type to the chain of variants of TYPE. */
5806 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5807 TYPE_NEXT_VARIANT (m) = t;
5808 TYPE_MAIN_VARIANT (t) = m;
5813 /* Return true if the from tree in both tree maps are equal. */
5816 tree_map_base_eq (const void *va, const void *vb)
5818 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5819 *const b = (const struct tree_map_base *) vb;
5820 return (a->from == b->from);
5823 /* Hash a from tree in a tree_base_map. */
5826 tree_map_base_hash (const void *item)
5828 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5831 /* Return true if this tree map structure is marked for garbage collection
5832 purposes. We simply return true if the from tree is marked, so that this
5833 structure goes away when the from tree goes away. */
5836 tree_map_base_marked_p (const void *p)
5838 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5841 /* Hash a from tree in a tree_map. */
5844 tree_map_hash (const void *item)
5846 return (((const struct tree_map *) item)->hash);
5849 /* Hash a from tree in a tree_decl_map. */
5852 tree_decl_map_hash (const void *item)
5854 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
5857 /* Return the initialization priority for DECL. */
5860 decl_init_priority_lookup (tree decl)
5862 struct tree_priority_map *h;
5863 struct tree_map_base in;
5865 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5867 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5868 return h ? h->init : DEFAULT_INIT_PRIORITY;
5871 /* Return the finalization priority for DECL. */
5874 decl_fini_priority_lookup (tree decl)
5876 struct tree_priority_map *h;
5877 struct tree_map_base in;
5879 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5881 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5882 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5885 /* Return the initialization and finalization priority information for
5886 DECL. If there is no previous priority information, a freshly
5887 allocated structure is returned. */
5889 static struct tree_priority_map *
5890 decl_priority_info (tree decl)
5892 struct tree_priority_map in;
5893 struct tree_priority_map *h;
5896 in.base.from = decl;
5897 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5898 h = (struct tree_priority_map *) *loc;
5901 h = ggc_alloc_cleared_tree_priority_map ();
5903 h->base.from = decl;
5904 h->init = DEFAULT_INIT_PRIORITY;
5905 h->fini = DEFAULT_INIT_PRIORITY;
5911 /* Set the initialization priority for DECL to PRIORITY. */
5914 decl_init_priority_insert (tree decl, priority_type priority)
5916 struct tree_priority_map *h;
5918 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5919 if (priority == DEFAULT_INIT_PRIORITY)
5921 h = decl_priority_info (decl);
5925 /* Set the finalization priority for DECL to PRIORITY. */
5928 decl_fini_priority_insert (tree decl, priority_type priority)
5930 struct tree_priority_map *h;
5932 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5933 if (priority == DEFAULT_INIT_PRIORITY)
5935 h = decl_priority_info (decl);
5939 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5942 print_debug_expr_statistics (void)
5944 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5945 (long) htab_size (debug_expr_for_decl),
5946 (long) htab_elements (debug_expr_for_decl),
5947 htab_collisions (debug_expr_for_decl));
5950 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5953 print_value_expr_statistics (void)
5955 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5956 (long) htab_size (value_expr_for_decl),
5957 (long) htab_elements (value_expr_for_decl),
5958 htab_collisions (value_expr_for_decl));
5961 /* Lookup a debug expression for FROM, and return it if we find one. */
5964 decl_debug_expr_lookup (tree from)
5966 struct tree_decl_map *h, in;
5967 in.base.from = from;
5969 h = (struct tree_decl_map *)
5970 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
5976 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5979 decl_debug_expr_insert (tree from, tree to)
5981 struct tree_decl_map *h;
5984 h = ggc_alloc_tree_decl_map ();
5985 h->base.from = from;
5987 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
5989 *(struct tree_decl_map **) loc = h;
5992 /* Lookup a value expression for FROM, and return it if we find one. */
5995 decl_value_expr_lookup (tree from)
5997 struct tree_decl_map *h, in;
5998 in.base.from = from;
6000 h = (struct tree_decl_map *)
6001 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
6007 /* Insert a mapping FROM->TO in the value expression hashtable. */
6010 decl_value_expr_insert (tree from, tree to)
6012 struct tree_decl_map *h;
6015 h = ggc_alloc_tree_decl_map ();
6016 h->base.from = from;
6018 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
6020 *(struct tree_decl_map **) loc = h;
6023 /* Lookup a vector of debug arguments for FROM, and return it if we
6027 decl_debug_args_lookup (tree from)
6029 struct tree_vec_map *h, in;
6031 if (!DECL_HAS_DEBUG_ARGS_P (from))
6033 gcc_checking_assert (debug_args_for_decl != NULL);
6034 in.base.from = from;
6035 h = (struct tree_vec_map *)
6036 htab_find_with_hash (debug_args_for_decl, &in, DECL_UID (from));
6042 /* Insert a mapping FROM->empty vector of debug arguments in the value
6043 expression hashtable. */
6046 decl_debug_args_insert (tree from)
6048 struct tree_vec_map *h;
6051 if (DECL_HAS_DEBUG_ARGS_P (from))
6052 return decl_debug_args_lookup (from);
6053 if (debug_args_for_decl == NULL)
6054 debug_args_for_decl = htab_create_ggc (64, tree_vec_map_hash,
6055 tree_vec_map_eq, 0);
6056 h = ggc_alloc_tree_vec_map ();
6057 h->base.from = from;
6059 loc = htab_find_slot_with_hash (debug_args_for_decl, h, DECL_UID (from),
6061 *(struct tree_vec_map **) loc = h;
6062 DECL_HAS_DEBUG_ARGS_P (from) = 1;
6066 /* Hashing of types so that we don't make duplicates.
6067 The entry point is `type_hash_canon'. */
6069 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6070 with types in the TREE_VALUE slots), by adding the hash codes
6071 of the individual types. */
6074 type_hash_list (const_tree list, hashval_t hashcode)
6078 for (tail = list; tail; tail = TREE_CHAIN (tail))
6079 if (TREE_VALUE (tail) != error_mark_node)
6080 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
6086 /* These are the Hashtable callback functions. */
6088 /* Returns true iff the types are equivalent. */
6091 type_hash_eq (const void *va, const void *vb)
6093 const struct type_hash *const a = (const struct type_hash *) va,
6094 *const b = (const struct type_hash *) vb;
6096 /* First test the things that are the same for all types. */
6097 if (a->hash != b->hash
6098 || TREE_CODE (a->type) != TREE_CODE (b->type)
6099 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
6100 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
6101 TYPE_ATTRIBUTES (b->type))
6102 || (TREE_CODE (a->type) != COMPLEX_TYPE
6103 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
6106 /* Be careful about comparing arrays before and after the element type
6107 has been completed; don't compare TYPE_ALIGN unless both types are
6109 if (COMPLETE_TYPE_P (a->type) && COMPLETE_TYPE_P (b->type)
6110 && (TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
6111 || TYPE_MODE (a->type) != TYPE_MODE (b->type)))
6114 switch (TREE_CODE (a->type))
6119 case REFERENCE_TYPE:
6123 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
6126 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
6127 && !(TYPE_VALUES (a->type)
6128 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
6129 && TYPE_VALUES (b->type)
6130 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
6131 && type_list_equal (TYPE_VALUES (a->type),
6132 TYPE_VALUES (b->type))))
6135 /* ... fall through ... */
6140 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
6141 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
6142 TYPE_MAX_VALUE (b->type)))
6143 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
6144 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
6145 TYPE_MIN_VALUE (b->type))));
6147 case FIXED_POINT_TYPE:
6148 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
6151 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
6154 if (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
6155 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6156 || (TYPE_ARG_TYPES (a->type)
6157 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6158 && TYPE_ARG_TYPES (b->type)
6159 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6160 && type_list_equal (TYPE_ARG_TYPES (a->type),
6161 TYPE_ARG_TYPES (b->type)))))
6165 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
6169 case QUAL_UNION_TYPE:
6170 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
6171 || (TYPE_FIELDS (a->type)
6172 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
6173 && TYPE_FIELDS (b->type)
6174 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
6175 && type_list_equal (TYPE_FIELDS (a->type),
6176 TYPE_FIELDS (b->type))));
6179 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6180 || (TYPE_ARG_TYPES (a->type)
6181 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6182 && TYPE_ARG_TYPES (b->type)
6183 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6184 && type_list_equal (TYPE_ARG_TYPES (a->type),
6185 TYPE_ARG_TYPES (b->type))))
6193 if (lang_hooks.types.type_hash_eq != NULL)
6194 return lang_hooks.types.type_hash_eq (a->type, b->type);
6199 /* Return the cached hash value. */
6202 type_hash_hash (const void *item)
6204 return ((const struct type_hash *) item)->hash;
6207 /* Look in the type hash table for a type isomorphic to TYPE.
6208 If one is found, return it. Otherwise return 0. */
6211 type_hash_lookup (hashval_t hashcode, tree type)
6213 struct type_hash *h, in;
6215 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6216 must call that routine before comparing TYPE_ALIGNs. */
6222 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6229 /* Add an entry to the type-hash-table
6230 for a type TYPE whose hash code is HASHCODE. */
6233 type_hash_add (hashval_t hashcode, tree type)
6235 struct type_hash *h;
6238 h = ggc_alloc_type_hash ();
6241 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6245 /* Given TYPE, and HASHCODE its hash code, return the canonical
6246 object for an identical type if one already exists.
6247 Otherwise, return TYPE, and record it as the canonical object.
6249 To use this function, first create a type of the sort you want.
6250 Then compute its hash code from the fields of the type that
6251 make it different from other similar types.
6252 Then call this function and use the value. */
6255 type_hash_canon (unsigned int hashcode, tree type)
6259 /* The hash table only contains main variants, so ensure that's what we're
6261 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6263 /* See if the type is in the hash table already. If so, return it.
6264 Otherwise, add the type. */
6265 t1 = type_hash_lookup (hashcode, type);
6268 #ifdef GATHER_STATISTICS
6269 tree_code_counts[(int) TREE_CODE (type)]--;
6270 tree_node_counts[(int) t_kind]--;
6271 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type_non_common);
6277 type_hash_add (hashcode, type);
6282 /* See if the data pointed to by the type hash table is marked. We consider
6283 it marked if the type is marked or if a debug type number or symbol
6284 table entry has been made for the type. */
6287 type_hash_marked_p (const void *p)
6289 const_tree const type = ((const struct type_hash *) p)->type;
6291 return ggc_marked_p (type);
6295 print_type_hash_statistics (void)
6297 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6298 (long) htab_size (type_hash_table),
6299 (long) htab_elements (type_hash_table),
6300 htab_collisions (type_hash_table));
6303 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6304 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6305 by adding the hash codes of the individual attributes. */
6308 attribute_hash_list (const_tree list, hashval_t hashcode)
6312 for (tail = list; tail; tail = TREE_CHAIN (tail))
6313 /* ??? Do we want to add in TREE_VALUE too? */
6314 hashcode = iterative_hash_object
6315 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6319 /* Given two lists of attributes, return true if list l2 is
6320 equivalent to l1. */
6323 attribute_list_equal (const_tree l1, const_tree l2)
6328 return attribute_list_contained (l1, l2)
6329 && attribute_list_contained (l2, l1);
6332 /* Given two lists of attributes, return true if list L2 is
6333 completely contained within L1. */
6334 /* ??? This would be faster if attribute names were stored in a canonicalized
6335 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6336 must be used to show these elements are equivalent (which they are). */
6337 /* ??? It's not clear that attributes with arguments will always be handled
6341 attribute_list_contained (const_tree l1, const_tree l2)
6345 /* First check the obvious, maybe the lists are identical. */
6349 /* Maybe the lists are similar. */
6350 for (t1 = l1, t2 = l2;
6352 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6353 && TREE_VALUE (t1) == TREE_VALUE (t2);
6354 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6357 /* Maybe the lists are equal. */
6358 if (t1 == 0 && t2 == 0)
6361 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6364 /* This CONST_CAST is okay because lookup_attribute does not
6365 modify its argument and the return value is assigned to a
6367 for (attr = lookup_ident_attribute (TREE_PURPOSE (t2), CONST_CAST_TREE(l1));
6368 attr != NULL_TREE && !attribute_value_equal (t2, attr);
6369 attr = lookup_ident_attribute (TREE_PURPOSE (t2), TREE_CHAIN (attr)))
6372 if (attr == NULL_TREE)
6379 /* Given two lists of types
6380 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6381 return 1 if the lists contain the same types in the same order.
6382 Also, the TREE_PURPOSEs must match. */
6385 type_list_equal (const_tree l1, const_tree l2)
6389 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6390 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6391 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6392 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6393 && (TREE_TYPE (TREE_PURPOSE (t1))
6394 == TREE_TYPE (TREE_PURPOSE (t2))))))
6400 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6401 given by TYPE. If the argument list accepts variable arguments,
6402 then this function counts only the ordinary arguments. */
6405 type_num_arguments (const_tree type)
6410 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6411 /* If the function does not take a variable number of arguments,
6412 the last element in the list will have type `void'. */
6413 if (VOID_TYPE_P (TREE_VALUE (t)))
6421 /* Nonzero if integer constants T1 and T2
6422 represent the same constant value. */
6425 tree_int_cst_equal (const_tree t1, const_tree t2)
6430 if (t1 == 0 || t2 == 0)
6433 if (TREE_CODE (t1) == INTEGER_CST
6434 && TREE_CODE (t2) == INTEGER_CST
6435 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6436 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6442 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6443 The precise way of comparison depends on their data type. */
6446 tree_int_cst_lt (const_tree t1, const_tree t2)
6451 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6453 int t1_sgn = tree_int_cst_sgn (t1);
6454 int t2_sgn = tree_int_cst_sgn (t2);
6456 if (t1_sgn < t2_sgn)
6458 else if (t1_sgn > t2_sgn)
6460 /* Otherwise, both are non-negative, so we compare them as
6461 unsigned just in case one of them would overflow a signed
6464 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6465 return INT_CST_LT (t1, t2);
6467 return INT_CST_LT_UNSIGNED (t1, t2);
6470 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6473 tree_int_cst_compare (const_tree t1, const_tree t2)
6475 if (tree_int_cst_lt (t1, t2))
6477 else if (tree_int_cst_lt (t2, t1))
6483 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6484 the host. If POS is zero, the value can be represented in a single
6485 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6486 be represented in a single unsigned HOST_WIDE_INT. */
6489 host_integerp (const_tree t, int pos)
6494 return (TREE_CODE (t) == INTEGER_CST
6495 && ((TREE_INT_CST_HIGH (t) == 0
6496 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6497 || (! pos && TREE_INT_CST_HIGH (t) == -1
6498 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6499 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6500 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6501 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6502 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6505 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6506 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6507 be non-negative. We must be able to satisfy the above conditions. */
6510 tree_low_cst (const_tree t, int pos)
6512 gcc_assert (host_integerp (t, pos));
6513 return TREE_INT_CST_LOW (t);
6516 /* Return the most significant bit of the integer constant T. */
6519 tree_int_cst_msb (const_tree t)
6523 unsigned HOST_WIDE_INT l;
6525 /* Note that using TYPE_PRECISION here is wrong. We care about the
6526 actual bits, not the (arbitrary) range of the type. */
6527 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6528 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6529 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6530 return (l & 1) == 1;
6533 /* Return an indication of the sign of the integer constant T.
6534 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6535 Note that -1 will never be returned if T's type is unsigned. */
6538 tree_int_cst_sgn (const_tree t)
6540 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6542 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6544 else if (TREE_INT_CST_HIGH (t) < 0)
6550 /* Return the minimum number of bits needed to represent VALUE in a
6551 signed or unsigned type, UNSIGNEDP says which. */
6554 tree_int_cst_min_precision (tree value, bool unsignedp)
6558 /* If the value is negative, compute its negative minus 1. The latter
6559 adjustment is because the absolute value of the largest negative value
6560 is one larger than the largest positive value. This is equivalent to
6561 a bit-wise negation, so use that operation instead. */
6563 if (tree_int_cst_sgn (value) < 0)
6564 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6566 /* Return the number of bits needed, taking into account the fact
6567 that we need one more bit for a signed than unsigned type. */
6569 if (integer_zerop (value))
6572 log = tree_floor_log2 (value);
6574 return log + 1 + !unsignedp;
6577 /* Compare two constructor-element-type constants. Return 1 if the lists
6578 are known to be equal; otherwise return 0. */
6581 simple_cst_list_equal (const_tree l1, const_tree l2)
6583 while (l1 != NULL_TREE && l2 != NULL_TREE)
6585 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6588 l1 = TREE_CHAIN (l1);
6589 l2 = TREE_CHAIN (l2);
6595 /* Return truthvalue of whether T1 is the same tree structure as T2.
6596 Return 1 if they are the same.
6597 Return 0 if they are understandably different.
6598 Return -1 if either contains tree structure not understood by
6602 simple_cst_equal (const_tree t1, const_tree t2)
6604 enum tree_code code1, code2;
6610 if (t1 == 0 || t2 == 0)
6613 code1 = TREE_CODE (t1);
6614 code2 = TREE_CODE (t2);
6616 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6618 if (CONVERT_EXPR_CODE_P (code2)
6619 || code2 == NON_LVALUE_EXPR)
6620 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6622 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6625 else if (CONVERT_EXPR_CODE_P (code2)
6626 || code2 == NON_LVALUE_EXPR)
6627 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6635 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6636 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6639 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6642 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6645 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6646 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6647 TREE_STRING_LENGTH (t1)));
6651 unsigned HOST_WIDE_INT idx;
6652 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6653 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6655 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6658 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6659 /* ??? Should we handle also fields here? */
6660 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6661 VEC_index (constructor_elt, v2, idx)->value))
6667 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6670 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6673 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6676 const_tree arg1, arg2;
6677 const_call_expr_arg_iterator iter1, iter2;
6678 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6679 arg2 = first_const_call_expr_arg (t2, &iter2);
6681 arg1 = next_const_call_expr_arg (&iter1),
6682 arg2 = next_const_call_expr_arg (&iter2))
6684 cmp = simple_cst_equal (arg1, arg2);
6688 return arg1 == arg2;
6692 /* Special case: if either target is an unallocated VAR_DECL,
6693 it means that it's going to be unified with whatever the
6694 TARGET_EXPR is really supposed to initialize, so treat it
6695 as being equivalent to anything. */
6696 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6697 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6698 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6699 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6700 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6701 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6704 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6709 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6711 case WITH_CLEANUP_EXPR:
6712 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6716 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6719 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6720 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6734 /* This general rule works for most tree codes. All exceptions should be
6735 handled above. If this is a language-specific tree code, we can't
6736 trust what might be in the operand, so say we don't know
6738 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6741 switch (TREE_CODE_CLASS (code1))
6745 case tcc_comparison:
6746 case tcc_expression:
6750 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6752 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6764 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6765 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6766 than U, respectively. */
6769 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6771 if (tree_int_cst_sgn (t) < 0)
6773 else if (TREE_INT_CST_HIGH (t) != 0)
6775 else if (TREE_INT_CST_LOW (t) == u)
6777 else if (TREE_INT_CST_LOW (t) < u)
6783 /* Return true if CODE represents an associative tree code. Otherwise
6786 associative_tree_code (enum tree_code code)
6805 /* Return true if CODE represents a commutative tree code. Otherwise
6808 commutative_tree_code (enum tree_code code)
6821 case UNORDERED_EXPR:
6825 case TRUTH_AND_EXPR:
6826 case TRUTH_XOR_EXPR:
6836 /* Return true if CODE represents a ternary tree code for which the
6837 first two operands are commutative. Otherwise return false. */
6839 commutative_ternary_tree_code (enum tree_code code)
6843 case WIDEN_MULT_PLUS_EXPR:
6844 case WIDEN_MULT_MINUS_EXPR:
6853 /* Generate a hash value for an expression. This can be used iteratively
6854 by passing a previous result as the VAL argument.
6856 This function is intended to produce the same hash for expressions which
6857 would compare equal using operand_equal_p. */
6860 iterative_hash_expr (const_tree t, hashval_t val)
6863 enum tree_code code;
6867 return iterative_hash_hashval_t (0, val);
6869 code = TREE_CODE (t);
6873 /* Alas, constants aren't shared, so we can't rely on pointer
6876 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6877 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6880 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6882 return iterative_hash_hashval_t (val2, val);
6886 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6888 return iterative_hash_hashval_t (val2, val);
6891 return iterative_hash (TREE_STRING_POINTER (t),
6892 TREE_STRING_LENGTH (t), val);
6894 val = iterative_hash_expr (TREE_REALPART (t), val);
6895 return iterative_hash_expr (TREE_IMAGPART (t), val);
6897 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6899 /* We can just compare by pointer. */
6900 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6901 case PLACEHOLDER_EXPR:
6902 /* The node itself doesn't matter. */
6905 /* A list of expressions, for a CALL_EXPR or as the elements of a
6907 for (; t; t = TREE_CHAIN (t))
6908 val = iterative_hash_expr (TREE_VALUE (t), val);
6912 unsigned HOST_WIDE_INT idx;
6914 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6916 val = iterative_hash_expr (field, val);
6917 val = iterative_hash_expr (value, val);
6923 /* The type of the second operand is relevant, except for
6924 its top-level qualifiers. */
6925 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t, 1)));
6927 val = iterative_hash_object (TYPE_HASH (type), val);
6929 /* We could use the standard hash computation from this point
6931 val = iterative_hash_object (code, val);
6932 val = iterative_hash_expr (TREE_OPERAND (t, 1), val);
6933 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6937 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6938 Otherwise nodes that compare equal according to operand_equal_p might
6939 get different hash codes. However, don't do this for machine specific
6940 or front end builtins, since the function code is overloaded in those
6942 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6943 && built_in_decls[DECL_FUNCTION_CODE (t)])
6945 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6946 code = TREE_CODE (t);
6950 tclass = TREE_CODE_CLASS (code);
6952 if (tclass == tcc_declaration)
6954 /* DECL's have a unique ID */
6955 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6959 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6961 val = iterative_hash_object (code, val);
6963 /* Don't hash the type, that can lead to having nodes which
6964 compare equal according to operand_equal_p, but which
6965 have different hash codes. */
6966 if (CONVERT_EXPR_CODE_P (code)
6967 || code == NON_LVALUE_EXPR)
6969 /* Make sure to include signness in the hash computation. */
6970 val += TYPE_UNSIGNED (TREE_TYPE (t));
6971 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6974 else if (commutative_tree_code (code))
6976 /* It's a commutative expression. We want to hash it the same
6977 however it appears. We do this by first hashing both operands
6978 and then rehashing based on the order of their independent
6980 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6981 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6985 t = one, one = two, two = t;
6987 val = iterative_hash_hashval_t (one, val);
6988 val = iterative_hash_hashval_t (two, val);
6991 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6992 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6999 /* Generate a hash value for a pair of expressions. This can be used
7000 iteratively by passing a previous result as the VAL argument.
7002 The same hash value is always returned for a given pair of expressions,
7003 regardless of the order in which they are presented. This is useful in
7004 hashing the operands of commutative functions. */
7007 iterative_hash_exprs_commutative (const_tree t1,
7008 const_tree t2, hashval_t val)
7010 hashval_t one = iterative_hash_expr (t1, 0);
7011 hashval_t two = iterative_hash_expr (t2, 0);
7015 t = one, one = two, two = t;
7016 val = iterative_hash_hashval_t (one, val);
7017 val = iterative_hash_hashval_t (two, val);
7022 /* Constructors for pointer, array and function types.
7023 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7024 constructed by language-dependent code, not here.) */
7026 /* Construct, lay out and return the type of pointers to TO_TYPE with
7027 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7028 reference all of memory. If such a type has already been
7029 constructed, reuse it. */
7032 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
7037 if (to_type == error_mark_node)
7038 return error_mark_node;
7040 /* If the pointed-to type has the may_alias attribute set, force
7041 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7042 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7043 can_alias_all = true;
7045 /* In some cases, languages will have things that aren't a POINTER_TYPE
7046 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7047 In that case, return that type without regard to the rest of our
7050 ??? This is a kludge, but consistent with the way this function has
7051 always operated and there doesn't seem to be a good way to avoid this
7053 if (TYPE_POINTER_TO (to_type) != 0
7054 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
7055 return TYPE_POINTER_TO (to_type);
7057 /* First, if we already have a type for pointers to TO_TYPE and it's
7058 the proper mode, use it. */
7059 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
7060 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7063 t = make_node (POINTER_TYPE);
7065 TREE_TYPE (t) = to_type;
7066 SET_TYPE_MODE (t, mode);
7067 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7068 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
7069 TYPE_POINTER_TO (to_type) = t;
7071 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7072 SET_TYPE_STRUCTURAL_EQUALITY (t);
7073 else if (TYPE_CANONICAL (to_type) != to_type)
7075 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
7076 mode, can_alias_all);
7078 /* Lay out the type. This function has many callers that are concerned
7079 with expression-construction, and this simplifies them all. */
7085 /* By default build pointers in ptr_mode. */
7088 build_pointer_type (tree to_type)
7090 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7091 : TYPE_ADDR_SPACE (to_type);
7092 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7093 return build_pointer_type_for_mode (to_type, pointer_mode, false);
7096 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7099 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
7104 if (to_type == error_mark_node)
7105 return error_mark_node;
7107 /* If the pointed-to type has the may_alias attribute set, force
7108 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7109 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7110 can_alias_all = true;
7112 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7113 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7114 In that case, return that type without regard to the rest of our
7117 ??? This is a kludge, but consistent with the way this function has
7118 always operated and there doesn't seem to be a good way to avoid this
7120 if (TYPE_REFERENCE_TO (to_type) != 0
7121 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7122 return TYPE_REFERENCE_TO (to_type);
7124 /* First, if we already have a type for pointers to TO_TYPE and it's
7125 the proper mode, use it. */
7126 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7127 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7130 t = make_node (REFERENCE_TYPE);
7132 TREE_TYPE (t) = to_type;
7133 SET_TYPE_MODE (t, mode);
7134 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7135 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7136 TYPE_REFERENCE_TO (to_type) = t;
7138 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7139 SET_TYPE_STRUCTURAL_EQUALITY (t);
7140 else if (TYPE_CANONICAL (to_type) != to_type)
7142 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7143 mode, can_alias_all);
7151 /* Build the node for the type of references-to-TO_TYPE by default
7155 build_reference_type (tree to_type)
7157 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7158 : TYPE_ADDR_SPACE (to_type);
7159 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7160 return build_reference_type_for_mode (to_type, pointer_mode, false);
7163 /* Build a type that is compatible with t but has no cv quals anywhere
7166 const char *const *const * -> char ***. */
7169 build_type_no_quals (tree t)
7171 switch (TREE_CODE (t))
7174 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7176 TYPE_REF_CAN_ALIAS_ALL (t));
7177 case REFERENCE_TYPE:
7179 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7181 TYPE_REF_CAN_ALIAS_ALL (t));
7183 return TYPE_MAIN_VARIANT (t);
7187 #define MAX_INT_CACHED_PREC \
7188 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7189 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7191 /* Builds a signed or unsigned integer type of precision PRECISION.
7192 Used for C bitfields whose precision does not match that of
7193 built-in target types. */
7195 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7201 unsignedp = MAX_INT_CACHED_PREC + 1;
7203 if (precision <= MAX_INT_CACHED_PREC)
7205 itype = nonstandard_integer_type_cache[precision + unsignedp];
7210 itype = make_node (INTEGER_TYPE);
7211 TYPE_PRECISION (itype) = precision;
7214 fixup_unsigned_type (itype);
7216 fixup_signed_type (itype);
7219 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7220 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7221 if (precision <= MAX_INT_CACHED_PREC)
7222 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7227 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7228 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7229 is true, reuse such a type that has already been constructed. */
7232 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7234 tree itype = make_node (INTEGER_TYPE);
7235 hashval_t hashcode = 0;
7237 TREE_TYPE (itype) = type;
7239 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7240 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7242 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7243 SET_TYPE_MODE (itype, TYPE_MODE (type));
7244 TYPE_SIZE (itype) = TYPE_SIZE (type);
7245 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7246 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7247 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7252 if ((TYPE_MIN_VALUE (itype)
7253 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7254 || (TYPE_MAX_VALUE (itype)
7255 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7257 /* Since we cannot reliably merge this type, we need to compare it using
7258 structural equality checks. */
7259 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7263 hashcode = iterative_hash_expr (TYPE_MIN_VALUE (itype), hashcode);
7264 hashcode = iterative_hash_expr (TYPE_MAX_VALUE (itype), hashcode);
7265 hashcode = iterative_hash_hashval_t (TYPE_HASH (type), hashcode);
7266 itype = type_hash_canon (hashcode, itype);
7271 /* Wrapper around build_range_type_1 with SHARED set to true. */
7274 build_range_type (tree type, tree lowval, tree highval)
7276 return build_range_type_1 (type, lowval, highval, true);
7279 /* Wrapper around build_range_type_1 with SHARED set to false. */
7282 build_nonshared_range_type (tree type, tree lowval, tree highval)
7284 return build_range_type_1 (type, lowval, highval, false);
7287 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7288 MAXVAL should be the maximum value in the domain
7289 (one less than the length of the array).
7291 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7292 We don't enforce this limit, that is up to caller (e.g. language front end).
7293 The limit exists because the result is a signed type and we don't handle
7294 sizes that use more than one HOST_WIDE_INT. */
7297 build_index_type (tree maxval)
7299 return build_range_type (sizetype, size_zero_node, maxval);
7302 /* Return true if the debug information for TYPE, a subtype, should be emitted
7303 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7304 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7305 debug info and doesn't reflect the source code. */
7308 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7310 tree base_type = TREE_TYPE (type), low, high;
7312 /* Subrange types have a base type which is an integral type. */
7313 if (!INTEGRAL_TYPE_P (base_type))
7316 /* Get the real bounds of the subtype. */
7317 if (lang_hooks.types.get_subrange_bounds)
7318 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7321 low = TYPE_MIN_VALUE (type);
7322 high = TYPE_MAX_VALUE (type);
7325 /* If the type and its base type have the same representation and the same
7326 name, then the type is not a subrange but a copy of the base type. */
7327 if ((TREE_CODE (base_type) == INTEGER_TYPE
7328 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7329 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7330 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7331 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7333 tree type_name = TYPE_NAME (type);
7334 tree base_type_name = TYPE_NAME (base_type);
7336 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7337 type_name = DECL_NAME (type_name);
7339 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7340 base_type_name = DECL_NAME (base_type_name);
7342 if (type_name == base_type_name)
7353 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7354 and number of elements specified by the range of values of INDEX_TYPE.
7355 If SHARED is true, reuse such a type that has already been constructed. */
7358 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7362 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7364 error ("arrays of functions are not meaningful");
7365 elt_type = integer_type_node;
7368 t = make_node (ARRAY_TYPE);
7369 TREE_TYPE (t) = elt_type;
7370 TYPE_DOMAIN (t) = index_type;
7371 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7374 /* If the element type is incomplete at this point we get marked for
7375 structural equality. Do not record these types in the canonical
7377 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7382 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7384 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7385 t = type_hash_canon (hashcode, t);
7388 if (TYPE_CANONICAL (t) == t)
7390 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7391 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7392 SET_TYPE_STRUCTURAL_EQUALITY (t);
7393 else if (TYPE_CANONICAL (elt_type) != elt_type
7394 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7396 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7398 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7405 /* Wrapper around build_array_type_1 with SHARED set to true. */
7408 build_array_type (tree elt_type, tree index_type)
7410 return build_array_type_1 (elt_type, index_type, true);
7413 /* Wrapper around build_array_type_1 with SHARED set to false. */
7416 build_nonshared_array_type (tree elt_type, tree index_type)
7418 return build_array_type_1 (elt_type, index_type, false);
7421 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7425 build_array_type_nelts (tree elt_type, unsigned HOST_WIDE_INT nelts)
7427 return build_array_type (elt_type, build_index_type (size_int (nelts - 1)));
7430 /* Recursively examines the array elements of TYPE, until a non-array
7431 element type is found. */
7434 strip_array_types (tree type)
7436 while (TREE_CODE (type) == ARRAY_TYPE)
7437 type = TREE_TYPE (type);
7442 /* Computes the canonical argument types from the argument type list
7445 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7446 on entry to this function, or if any of the ARGTYPES are
7449 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7450 true on entry to this function, or if any of the ARGTYPES are
7453 Returns a canonical argument list, which may be ARGTYPES when the
7454 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7455 true) or would not differ from ARGTYPES. */
7458 maybe_canonicalize_argtypes(tree argtypes,
7459 bool *any_structural_p,
7460 bool *any_noncanonical_p)
7463 bool any_noncanonical_argtypes_p = false;
7465 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7467 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7468 /* Fail gracefully by stating that the type is structural. */
7469 *any_structural_p = true;
7470 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7471 *any_structural_p = true;
7472 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7473 || TREE_PURPOSE (arg))
7474 /* If the argument has a default argument, we consider it
7475 non-canonical even though the type itself is canonical.
7476 That way, different variants of function and method types
7477 with default arguments will all point to the variant with
7478 no defaults as their canonical type. */
7479 any_noncanonical_argtypes_p = true;
7482 if (*any_structural_p)
7485 if (any_noncanonical_argtypes_p)
7487 /* Build the canonical list of argument types. */
7488 tree canon_argtypes = NULL_TREE;
7489 bool is_void = false;
7491 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7493 if (arg == void_list_node)
7496 canon_argtypes = tree_cons (NULL_TREE,
7497 TYPE_CANONICAL (TREE_VALUE (arg)),
7501 canon_argtypes = nreverse (canon_argtypes);
7503 canon_argtypes = chainon (canon_argtypes, void_list_node);
7505 /* There is a non-canonical type. */
7506 *any_noncanonical_p = true;
7507 return canon_argtypes;
7510 /* The canonical argument types are the same as ARGTYPES. */
7514 /* Construct, lay out and return
7515 the type of functions returning type VALUE_TYPE
7516 given arguments of types ARG_TYPES.
7517 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7518 are data type nodes for the arguments of the function.
7519 If such a type has already been constructed, reuse it. */
7522 build_function_type (tree value_type, tree arg_types)
7525 hashval_t hashcode = 0;
7526 bool any_structural_p, any_noncanonical_p;
7527 tree canon_argtypes;
7529 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7531 error ("function return type cannot be function");
7532 value_type = integer_type_node;
7535 /* Make a node of the sort we want. */
7536 t = make_node (FUNCTION_TYPE);
7537 TREE_TYPE (t) = value_type;
7538 TYPE_ARG_TYPES (t) = arg_types;
7540 /* If we already have such a type, use the old one. */
7541 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7542 hashcode = type_hash_list (arg_types, hashcode);
7543 t = type_hash_canon (hashcode, t);
7545 /* Set up the canonical type. */
7546 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7547 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7548 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7550 &any_noncanonical_p);
7551 if (any_structural_p)
7552 SET_TYPE_STRUCTURAL_EQUALITY (t);
7553 else if (any_noncanonical_p)
7554 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7557 if (!COMPLETE_TYPE_P (t))
7562 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7565 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7567 tree new_type = NULL;
7568 tree args, new_args = NULL, t;
7572 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7573 args = TREE_CHAIN (args), i++)
7574 if (!bitmap_bit_p (args_to_skip, i))
7575 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7577 new_reversed = nreverse (new_args);
7581 TREE_CHAIN (new_args) = void_list_node;
7583 new_reversed = void_list_node;
7586 /* Use copy_node to preserve as much as possible from original type
7587 (debug info, attribute lists etc.)
7588 Exception is METHOD_TYPEs must have THIS argument.
7589 When we are asked to remove it, we need to build new FUNCTION_TYPE
7591 if (TREE_CODE (orig_type) != METHOD_TYPE
7592 || !bitmap_bit_p (args_to_skip, 0))
7594 new_type = build_distinct_type_copy (orig_type);
7595 TYPE_ARG_TYPES (new_type) = new_reversed;
7600 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7602 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7605 /* This is a new type, not a copy of an old type. Need to reassociate
7606 variants. We can handle everything except the main variant lazily. */
7607 t = TYPE_MAIN_VARIANT (orig_type);
7610 TYPE_MAIN_VARIANT (new_type) = t;
7611 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7612 TYPE_NEXT_VARIANT (t) = new_type;
7616 TYPE_MAIN_VARIANT (new_type) = new_type;
7617 TYPE_NEXT_VARIANT (new_type) = NULL;
7622 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7624 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7625 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7626 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7629 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7631 tree new_decl = copy_node (orig_decl);
7634 new_type = TREE_TYPE (orig_decl);
7635 if (prototype_p (new_type))
7636 new_type = build_function_type_skip_args (new_type, args_to_skip);
7637 TREE_TYPE (new_decl) = new_type;
7639 /* For declarations setting DECL_VINDEX (i.e. methods)
7640 we expect first argument to be THIS pointer. */
7641 if (bitmap_bit_p (args_to_skip, 0))
7642 DECL_VINDEX (new_decl) = NULL_TREE;
7644 /* When signature changes, we need to clear builtin info. */
7645 if (DECL_BUILT_IN (new_decl) && !bitmap_empty_p (args_to_skip))
7647 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7648 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7653 /* Build a function type. The RETURN_TYPE is the type returned by the
7654 function. If VAARGS is set, no void_type_node is appended to the
7655 the list. ARGP must be always be terminated be a NULL_TREE. */
7658 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7662 t = va_arg (argp, tree);
7663 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7664 args = tree_cons (NULL_TREE, t, args);
7669 if (args != NULL_TREE)
7670 args = nreverse (args);
7671 gcc_assert (last != void_list_node);
7673 else if (args == NULL_TREE)
7674 args = void_list_node;
7678 args = nreverse (args);
7679 TREE_CHAIN (last) = void_list_node;
7681 args = build_function_type (return_type, args);
7686 /* Build a function type. The RETURN_TYPE is the type returned by the
7687 function. If additional arguments are provided, they are
7688 additional argument types. The list of argument types must always
7689 be terminated by NULL_TREE. */
7692 build_function_type_list (tree return_type, ...)
7697 va_start (p, return_type);
7698 args = build_function_type_list_1 (false, return_type, p);
7703 /* Build a variable argument function type. The RETURN_TYPE is the
7704 type returned by the function. If additional arguments are provided,
7705 they are additional argument types. The list of argument types must
7706 always be terminated by NULL_TREE. */
7709 build_varargs_function_type_list (tree return_type, ...)
7714 va_start (p, return_type);
7715 args = build_function_type_list_1 (true, return_type, p);
7721 /* Build a function type. RETURN_TYPE is the type returned by the
7722 function; VAARGS indicates whether the function takes varargs. The
7723 function takes N named arguments, the types of which are provided in
7727 build_function_type_array_1 (bool vaargs, tree return_type, int n,
7731 tree t = vaargs ? NULL_TREE : void_list_node;
7733 for (i = n - 1; i >= 0; i--)
7734 t = tree_cons (NULL_TREE, arg_types[i], t);
7736 return build_function_type (return_type, t);
7739 /* Build a function type. RETURN_TYPE is the type returned by the
7740 function. The function takes N named arguments, the types of which
7741 are provided in ARG_TYPES. */
7744 build_function_type_array (tree return_type, int n, tree *arg_types)
7746 return build_function_type_array_1 (false, return_type, n, arg_types);
7749 /* Build a variable argument function type. RETURN_TYPE is the type
7750 returned by the function. The function takes N named arguments, the
7751 types of which are provided in ARG_TYPES. */
7754 build_varargs_function_type_array (tree return_type, int n, tree *arg_types)
7756 return build_function_type_array_1 (true, return_type, n, arg_types);
7759 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7760 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7761 for the method. An implicit additional parameter (of type
7762 pointer-to-BASETYPE) is added to the ARGTYPES. */
7765 build_method_type_directly (tree basetype,
7772 bool any_structural_p, any_noncanonical_p;
7773 tree canon_argtypes;
7775 /* Make a node of the sort we want. */
7776 t = make_node (METHOD_TYPE);
7778 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7779 TREE_TYPE (t) = rettype;
7780 ptype = build_pointer_type (basetype);
7782 /* The actual arglist for this function includes a "hidden" argument
7783 which is "this". Put it into the list of argument types. */
7784 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7785 TYPE_ARG_TYPES (t) = argtypes;
7787 /* If we already have such a type, use the old one. */
7788 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7789 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7790 hashcode = type_hash_list (argtypes, hashcode);
7791 t = type_hash_canon (hashcode, t);
7793 /* Set up the canonical type. */
7795 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7796 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7798 = (TYPE_CANONICAL (basetype) != basetype
7799 || TYPE_CANONICAL (rettype) != rettype);
7800 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7802 &any_noncanonical_p);
7803 if (any_structural_p)
7804 SET_TYPE_STRUCTURAL_EQUALITY (t);
7805 else if (any_noncanonical_p)
7807 = build_method_type_directly (TYPE_CANONICAL (basetype),
7808 TYPE_CANONICAL (rettype),
7810 if (!COMPLETE_TYPE_P (t))
7816 /* Construct, lay out and return the type of methods belonging to class
7817 BASETYPE and whose arguments and values are described by TYPE.
7818 If that type exists already, reuse it.
7819 TYPE must be a FUNCTION_TYPE node. */
7822 build_method_type (tree basetype, tree type)
7824 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7826 return build_method_type_directly (basetype,
7828 TYPE_ARG_TYPES (type));
7831 /* Construct, lay out and return the type of offsets to a value
7832 of type TYPE, within an object of type BASETYPE.
7833 If a suitable offset type exists already, reuse it. */
7836 build_offset_type (tree basetype, tree type)
7839 hashval_t hashcode = 0;
7841 /* Make a node of the sort we want. */
7842 t = make_node (OFFSET_TYPE);
7844 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7845 TREE_TYPE (t) = type;
7847 /* If we already have such a type, use the old one. */
7848 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7849 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7850 t = type_hash_canon (hashcode, t);
7852 if (!COMPLETE_TYPE_P (t))
7855 if (TYPE_CANONICAL (t) == t)
7857 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7858 || TYPE_STRUCTURAL_EQUALITY_P (type))
7859 SET_TYPE_STRUCTURAL_EQUALITY (t);
7860 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7861 || TYPE_CANONICAL (type) != type)
7863 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7864 TYPE_CANONICAL (type));
7870 /* Create a complex type whose components are COMPONENT_TYPE. */
7873 build_complex_type (tree component_type)
7878 gcc_assert (INTEGRAL_TYPE_P (component_type)
7879 || SCALAR_FLOAT_TYPE_P (component_type)
7880 || FIXED_POINT_TYPE_P (component_type));
7882 /* Make a node of the sort we want. */
7883 t = make_node (COMPLEX_TYPE);
7885 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7887 /* If we already have such a type, use the old one. */
7888 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7889 t = type_hash_canon (hashcode, t);
7891 if (!COMPLETE_TYPE_P (t))
7894 if (TYPE_CANONICAL (t) == t)
7896 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7897 SET_TYPE_STRUCTURAL_EQUALITY (t);
7898 else if (TYPE_CANONICAL (component_type) != component_type)
7900 = build_complex_type (TYPE_CANONICAL (component_type));
7903 /* We need to create a name, since complex is a fundamental type. */
7904 if (! TYPE_NAME (t))
7907 if (component_type == char_type_node)
7908 name = "complex char";
7909 else if (component_type == signed_char_type_node)
7910 name = "complex signed char";
7911 else if (component_type == unsigned_char_type_node)
7912 name = "complex unsigned char";
7913 else if (component_type == short_integer_type_node)
7914 name = "complex short int";
7915 else if (component_type == short_unsigned_type_node)
7916 name = "complex short unsigned int";
7917 else if (component_type == integer_type_node)
7918 name = "complex int";
7919 else if (component_type == unsigned_type_node)
7920 name = "complex unsigned int";
7921 else if (component_type == long_integer_type_node)
7922 name = "complex long int";
7923 else if (component_type == long_unsigned_type_node)
7924 name = "complex long unsigned int";
7925 else if (component_type == long_long_integer_type_node)
7926 name = "complex long long int";
7927 else if (component_type == long_long_unsigned_type_node)
7928 name = "complex long long unsigned int";
7933 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7934 get_identifier (name), t);
7937 return build_qualified_type (t, TYPE_QUALS (component_type));
7940 /* If TYPE is a real or complex floating-point type and the target
7941 does not directly support arithmetic on TYPE then return the wider
7942 type to be used for arithmetic on TYPE. Otherwise, return
7946 excess_precision_type (tree type)
7948 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7950 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7951 switch (TREE_CODE (type))
7954 switch (flt_eval_method)
7957 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7958 return double_type_node;
7961 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7962 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7963 return long_double_type_node;
7970 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7972 switch (flt_eval_method)
7975 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7976 return complex_double_type_node;
7979 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7980 || (TYPE_MODE (TREE_TYPE (type))
7981 == TYPE_MODE (double_type_node)))
7982 return complex_long_double_type_node;
7995 /* Return OP, stripped of any conversions to wider types as much as is safe.
7996 Converting the value back to OP's type makes a value equivalent to OP.
7998 If FOR_TYPE is nonzero, we return a value which, if converted to
7999 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8001 OP must have integer, real or enumeral type. Pointers are not allowed!
8003 There are some cases where the obvious value we could return
8004 would regenerate to OP if converted to OP's type,
8005 but would not extend like OP to wider types.
8006 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8007 For example, if OP is (unsigned short)(signed char)-1,
8008 we avoid returning (signed char)-1 if FOR_TYPE is int,
8009 even though extending that to an unsigned short would regenerate OP,
8010 since the result of extending (signed char)-1 to (int)
8011 is different from (int) OP. */
8014 get_unwidened (tree op, tree for_type)
8016 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8017 tree type = TREE_TYPE (op);
8019 = TYPE_PRECISION (for_type != 0 ? for_type : type);
8021 = (for_type != 0 && for_type != type
8022 && final_prec > TYPE_PRECISION (type)
8023 && TYPE_UNSIGNED (type));
8026 while (CONVERT_EXPR_P (op))
8030 /* TYPE_PRECISION on vector types has different meaning
8031 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8032 so avoid them here. */
8033 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
8036 bitschange = TYPE_PRECISION (TREE_TYPE (op))
8037 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
8039 /* Truncations are many-one so cannot be removed.
8040 Unless we are later going to truncate down even farther. */
8042 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
8045 /* See what's inside this conversion. If we decide to strip it,
8047 op = TREE_OPERAND (op, 0);
8049 /* If we have not stripped any zero-extensions (uns is 0),
8050 we can strip any kind of extension.
8051 If we have previously stripped a zero-extension,
8052 only zero-extensions can safely be stripped.
8053 Any extension can be stripped if the bits it would produce
8054 are all going to be discarded later by truncating to FOR_TYPE. */
8058 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
8060 /* TYPE_UNSIGNED says whether this is a zero-extension.
8061 Let's avoid computing it if it does not affect WIN
8062 and if UNS will not be needed again. */
8064 || CONVERT_EXPR_P (op))
8065 && TYPE_UNSIGNED (TREE_TYPE (op)))
8073 /* If we finally reach a constant see if it fits in for_type and
8074 in that case convert it. */
8076 && TREE_CODE (win) == INTEGER_CST
8077 && TREE_TYPE (win) != for_type
8078 && int_fits_type_p (win, for_type))
8079 win = fold_convert (for_type, win);
8084 /* Return OP or a simpler expression for a narrower value
8085 which can be sign-extended or zero-extended to give back OP.
8086 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8087 or 0 if the value should be sign-extended. */
8090 get_narrower (tree op, int *unsignedp_ptr)
8095 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
8097 while (TREE_CODE (op) == NOP_EXPR)
8100 = (TYPE_PRECISION (TREE_TYPE (op))
8101 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
8103 /* Truncations are many-one so cannot be removed. */
8107 /* See what's inside this conversion. If we decide to strip it,
8112 op = TREE_OPERAND (op, 0);
8113 /* An extension: the outermost one can be stripped,
8114 but remember whether it is zero or sign extension. */
8116 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8117 /* Otherwise, if a sign extension has been stripped,
8118 only sign extensions can now be stripped;
8119 if a zero extension has been stripped, only zero-extensions. */
8120 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
8124 else /* bitschange == 0 */
8126 /* A change in nominal type can always be stripped, but we must
8127 preserve the unsignedness. */
8129 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8131 op = TREE_OPERAND (op, 0);
8132 /* Keep trying to narrow, but don't assign op to win if it
8133 would turn an integral type into something else. */
8134 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
8141 if (TREE_CODE (op) == COMPONENT_REF
8142 /* Since type_for_size always gives an integer type. */
8143 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8144 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8145 /* Ensure field is laid out already. */
8146 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8147 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
8149 unsigned HOST_WIDE_INT innerprec
8150 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
8151 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8152 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8153 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8155 /* We can get this structure field in a narrower type that fits it,
8156 but the resulting extension to its nominal type (a fullword type)
8157 must satisfy the same conditions as for other extensions.
8159 Do this only for fields that are aligned (not bit-fields),
8160 because when bit-field insns will be used there is no
8161 advantage in doing this. */
8163 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8164 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8165 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8169 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8170 win = fold_convert (type, op);
8174 *unsignedp_ptr = uns;
8178 /* Returns true if integer constant C has a value that is permissible
8179 for type TYPE (an INTEGER_TYPE). */
8182 int_fits_type_p (const_tree c, const_tree type)
8184 tree type_low_bound, type_high_bound;
8185 bool ok_for_low_bound, ok_for_high_bound, unsc;
8188 dc = tree_to_double_int (c);
8189 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
8191 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
8192 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
8194 /* So c is an unsigned integer whose type is sizetype and type is not.
8195 sizetype'd integers are sign extended even though they are
8196 unsigned. If the integer value fits in the lower end word of c,
8197 and if the higher end word has all its bits set to 1, that
8198 means the higher end bits are set to 1 only for sign extension.
8199 So let's convert c into an equivalent zero extended unsigned
8201 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
8204 type_low_bound = TYPE_MIN_VALUE (type);
8205 type_high_bound = TYPE_MAX_VALUE (type);
8207 /* If at least one bound of the type is a constant integer, we can check
8208 ourselves and maybe make a decision. If no such decision is possible, but
8209 this type is a subtype, try checking against that. Otherwise, use
8210 double_int_fits_to_tree_p, which checks against the precision.
8212 Compute the status for each possibly constant bound, and return if we see
8213 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8214 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8215 for "constant known to fit". */
8217 /* Check if c >= type_low_bound. */
8218 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8220 dd = tree_to_double_int (type_low_bound);
8221 if (TREE_CODE (type) == INTEGER_TYPE
8222 && TYPE_IS_SIZETYPE (type)
8223 && TYPE_UNSIGNED (type))
8224 dd = double_int_zext (dd, TYPE_PRECISION (type));
8225 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
8227 int c_neg = (!unsc && double_int_negative_p (dc));
8228 int t_neg = (unsc && double_int_negative_p (dd));
8230 if (c_neg && !t_neg)
8232 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
8235 else if (double_int_cmp (dc, dd, unsc) < 0)
8237 ok_for_low_bound = true;
8240 ok_for_low_bound = false;
8242 /* Check if c <= type_high_bound. */
8243 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8245 dd = tree_to_double_int (type_high_bound);
8246 if (TREE_CODE (type) == INTEGER_TYPE
8247 && TYPE_IS_SIZETYPE (type)
8248 && TYPE_UNSIGNED (type))
8249 dd = double_int_zext (dd, TYPE_PRECISION (type));
8250 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8252 int c_neg = (!unsc && double_int_negative_p (dc));
8253 int t_neg = (unsc && double_int_negative_p (dd));
8255 if (t_neg && !c_neg)
8257 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
8260 else if (double_int_cmp (dc, dd, unsc) > 0)
8262 ok_for_high_bound = true;
8265 ok_for_high_bound = false;
8267 /* If the constant fits both bounds, the result is known. */
8268 if (ok_for_low_bound && ok_for_high_bound)
8271 /* Perform some generic filtering which may allow making a decision
8272 even if the bounds are not constant. First, negative integers
8273 never fit in unsigned types, */
8274 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8277 /* Second, narrower types always fit in wider ones. */
8278 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8281 /* Third, unsigned integers with top bit set never fit signed types. */
8282 if (! TYPE_UNSIGNED (type) && unsc)
8284 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8285 if (prec < HOST_BITS_PER_WIDE_INT)
8287 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8290 else if (((((unsigned HOST_WIDE_INT) 1)
8291 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8295 /* If we haven't been able to decide at this point, there nothing more we
8296 can check ourselves here. Look at the base type if we have one and it
8297 has the same precision. */
8298 if (TREE_CODE (type) == INTEGER_TYPE
8299 && TREE_TYPE (type) != 0
8300 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8302 type = TREE_TYPE (type);
8306 /* Or to double_int_fits_to_tree_p, if nothing else. */
8307 return double_int_fits_to_tree_p (type, dc);
8310 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8311 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8312 represented (assuming two's-complement arithmetic) within the bit
8313 precision of the type are returned instead. */
8316 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8318 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8319 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8320 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8321 TYPE_UNSIGNED (type));
8324 if (TYPE_UNSIGNED (type))
8325 mpz_set_ui (min, 0);
8329 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8330 mn = double_int_sext (double_int_add (mn, double_int_one),
8331 TYPE_PRECISION (type));
8332 mpz_set_double_int (min, mn, false);
8336 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8337 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8338 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8339 TYPE_UNSIGNED (type));
8342 if (TYPE_UNSIGNED (type))
8343 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8346 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8351 /* Return true if VAR is an automatic variable defined in function FN. */
8354 auto_var_in_fn_p (const_tree var, const_tree fn)
8356 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8357 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8358 || TREE_CODE (var) == PARM_DECL)
8359 && ! TREE_STATIC (var))
8360 || TREE_CODE (var) == LABEL_DECL
8361 || TREE_CODE (var) == RESULT_DECL));
8364 /* Subprogram of following function. Called by walk_tree.
8366 Return *TP if it is an automatic variable or parameter of the
8367 function passed in as DATA. */
8370 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8372 tree fn = (tree) data;
8377 else if (DECL_P (*tp)
8378 && auto_var_in_fn_p (*tp, fn))
8384 /* Returns true if T is, contains, or refers to a type with variable
8385 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8386 arguments, but not the return type. If FN is nonzero, only return
8387 true if a modifier of the type or position of FN is a variable or
8388 parameter inside FN.
8390 This concept is more general than that of C99 'variably modified types':
8391 in C99, a struct type is never variably modified because a VLA may not
8392 appear as a structure member. However, in GNU C code like:
8394 struct S { int i[f()]; };
8396 is valid, and other languages may define similar constructs. */
8399 variably_modified_type_p (tree type, tree fn)
8403 /* Test if T is either variable (if FN is zero) or an expression containing
8404 a variable in FN. */
8405 #define RETURN_TRUE_IF_VAR(T) \
8406 do { tree _t = (T); \
8407 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8408 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8409 return true; } while (0)
8411 if (type == error_mark_node)
8414 /* If TYPE itself has variable size, it is variably modified. */
8415 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8416 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8418 switch (TREE_CODE (type))
8421 case REFERENCE_TYPE:
8423 if (variably_modified_type_p (TREE_TYPE (type), fn))
8429 /* If TYPE is a function type, it is variably modified if the
8430 return type is variably modified. */
8431 if (variably_modified_type_p (TREE_TYPE (type), fn))
8437 case FIXED_POINT_TYPE:
8440 /* Scalar types are variably modified if their end points
8442 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8443 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8448 case QUAL_UNION_TYPE:
8449 /* We can't see if any of the fields are variably-modified by the
8450 definition we normally use, since that would produce infinite
8451 recursion via pointers. */
8452 /* This is variably modified if some field's type is. */
8453 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8454 if (TREE_CODE (t) == FIELD_DECL)
8456 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8457 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8458 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8460 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8461 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8466 /* Do not call ourselves to avoid infinite recursion. This is
8467 variably modified if the element type is. */
8468 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8469 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8476 /* The current language may have other cases to check, but in general,
8477 all other types are not variably modified. */
8478 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8480 #undef RETURN_TRUE_IF_VAR
8483 /* Given a DECL or TYPE, return the scope in which it was declared, or
8484 NULL_TREE if there is no containing scope. */
8487 get_containing_scope (const_tree t)
8489 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8492 /* Return the innermost context enclosing DECL that is
8493 a FUNCTION_DECL, or zero if none. */
8496 decl_function_context (const_tree decl)
8500 if (TREE_CODE (decl) == ERROR_MARK)
8503 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8504 where we look up the function at runtime. Such functions always take
8505 a first argument of type 'pointer to real context'.
8507 C++ should really be fixed to use DECL_CONTEXT for the real context,
8508 and use something else for the "virtual context". */
8509 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8512 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8514 context = DECL_CONTEXT (decl);
8516 while (context && TREE_CODE (context) != FUNCTION_DECL)
8518 if (TREE_CODE (context) == BLOCK)
8519 context = BLOCK_SUPERCONTEXT (context);
8521 context = get_containing_scope (context);
8527 /* Return the innermost context enclosing DECL that is
8528 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8529 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8532 decl_type_context (const_tree decl)
8534 tree context = DECL_CONTEXT (decl);
8537 switch (TREE_CODE (context))
8539 case NAMESPACE_DECL:
8540 case TRANSLATION_UNIT_DECL:
8545 case QUAL_UNION_TYPE:
8550 context = DECL_CONTEXT (context);
8554 context = BLOCK_SUPERCONTEXT (context);
8564 /* CALL is a CALL_EXPR. Return the declaration for the function
8565 called, or NULL_TREE if the called function cannot be
8569 get_callee_fndecl (const_tree call)
8573 if (call == error_mark_node)
8574 return error_mark_node;
8576 /* It's invalid to call this function with anything but a
8578 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8580 /* The first operand to the CALL is the address of the function
8582 addr = CALL_EXPR_FN (call);
8586 /* If this is a readonly function pointer, extract its initial value. */
8587 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8588 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8589 && DECL_INITIAL (addr))
8590 addr = DECL_INITIAL (addr);
8592 /* If the address is just `&f' for some function `f', then we know
8593 that `f' is being called. */
8594 if (TREE_CODE (addr) == ADDR_EXPR
8595 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8596 return TREE_OPERAND (addr, 0);
8598 /* We couldn't figure out what was being called. */
8602 /* Print debugging information about tree nodes generated during the compile,
8603 and any language-specific information. */
8606 dump_tree_statistics (void)
8608 #ifdef GATHER_STATISTICS
8610 int total_nodes, total_bytes;
8613 fprintf (stderr, "\n??? tree nodes created\n\n");
8614 #ifdef GATHER_STATISTICS
8615 fprintf (stderr, "Kind Nodes Bytes\n");
8616 fprintf (stderr, "---------------------------------------\n");
8617 total_nodes = total_bytes = 0;
8618 for (i = 0; i < (int) all_kinds; i++)
8620 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8621 tree_node_counts[i], tree_node_sizes[i]);
8622 total_nodes += tree_node_counts[i];
8623 total_bytes += tree_node_sizes[i];
8625 fprintf (stderr, "---------------------------------------\n");
8626 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8627 fprintf (stderr, "---------------------------------------\n");
8628 fprintf (stderr, "Code Nodes\n");
8629 fprintf (stderr, "----------------------------\n");
8630 for (i = 0; i < (int) MAX_TREE_CODES; i++)
8631 fprintf (stderr, "%-20s %7d\n", tree_code_name[i], tree_code_counts[i]);
8632 fprintf (stderr, "----------------------------\n");
8633 ssanames_print_statistics ();
8634 phinodes_print_statistics ();
8636 fprintf (stderr, "(No per-node statistics)\n");
8638 print_type_hash_statistics ();
8639 print_debug_expr_statistics ();
8640 print_value_expr_statistics ();
8641 lang_hooks.print_statistics ();
8644 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8646 /* Generate a crc32 of a byte. */
8649 crc32_byte (unsigned chksum, char byte)
8651 unsigned value = (unsigned) byte << 24;
8654 for (ix = 8; ix--; value <<= 1)
8658 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8666 /* Generate a crc32 of a string. */
8669 crc32_string (unsigned chksum, const char *string)
8673 chksum = crc32_byte (chksum, *string);
8679 /* P is a string that will be used in a symbol. Mask out any characters
8680 that are not valid in that context. */
8683 clean_symbol_name (char *p)
8687 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8690 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8697 /* Generate a name for a special-purpose function.
8698 The generated name may need to be unique across the whole link.
8699 Changes to this function may also require corresponding changes to
8700 xstrdup_mask_random.
8701 TYPE is some string to identify the purpose of this function to the
8702 linker or collect2; it must start with an uppercase letter,
8704 I - for constructors
8706 N - for C++ anonymous namespaces
8707 F - for DWARF unwind frame information. */
8710 get_file_function_name (const char *type)
8716 /* If we already have a name we know to be unique, just use that. */
8717 if (first_global_object_name)
8718 p = q = ASTRDUP (first_global_object_name);
8719 /* If the target is handling the constructors/destructors, they
8720 will be local to this file and the name is only necessary for
8722 We also assign sub_I and sub_D sufixes to constructors called from
8723 the global static constructors. These are always local. */
8724 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8725 || (strncmp (type, "sub_", 4) == 0
8726 && (type[4] == 'I' || type[4] == 'D')))
8728 const char *file = main_input_filename;
8730 file = input_filename;
8731 /* Just use the file's basename, because the full pathname
8732 might be quite long. */
8733 p = q = ASTRDUP (lbasename (file));
8737 /* Otherwise, the name must be unique across the entire link.
8738 We don't have anything that we know to be unique to this translation
8739 unit, so use what we do have and throw in some randomness. */
8741 const char *name = weak_global_object_name;
8742 const char *file = main_input_filename;
8747 file = input_filename;
8749 len = strlen (file);
8750 q = (char *) alloca (9 * 2 + len + 1);
8751 memcpy (q, file, len + 1);
8753 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8754 crc32_string (0, get_random_seed (false)));
8759 clean_symbol_name (q);
8760 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8763 /* Set up the name of the file-level functions we may need.
8764 Use a global object (which is already required to be unique over
8765 the program) rather than the file name (which imposes extra
8767 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8769 return get_identifier (buf);
8772 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8774 /* Complain that the tree code of NODE does not match the expected 0
8775 terminated list of trailing codes. The trailing code list can be
8776 empty, for a more vague error message. FILE, LINE, and FUNCTION
8777 are of the caller. */
8780 tree_check_failed (const_tree node, const char *file,
8781 int line, const char *function, ...)
8785 unsigned length = 0;
8788 va_start (args, function);
8789 while ((code = va_arg (args, int)))
8790 length += 4 + strlen (tree_code_name[code]);
8795 va_start (args, function);
8796 length += strlen ("expected ");
8797 buffer = tmp = (char *) alloca (length);
8799 while ((code = va_arg (args, int)))
8801 const char *prefix = length ? " or " : "expected ";
8803 strcpy (tmp + length, prefix);
8804 length += strlen (prefix);
8805 strcpy (tmp + length, tree_code_name[code]);
8806 length += strlen (tree_code_name[code]);
8811 buffer = "unexpected node";
8813 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8814 buffer, tree_code_name[TREE_CODE (node)],
8815 function, trim_filename (file), line);
8818 /* Complain that the tree code of NODE does match the expected 0
8819 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8823 tree_not_check_failed (const_tree node, const char *file,
8824 int line, const char *function, ...)
8828 unsigned length = 0;
8831 va_start (args, function);
8832 while ((code = va_arg (args, int)))
8833 length += 4 + strlen (tree_code_name[code]);
8835 va_start (args, function);
8836 buffer = (char *) alloca (length);
8838 while ((code = va_arg (args, int)))
8842 strcpy (buffer + length, " or ");
8845 strcpy (buffer + length, tree_code_name[code]);
8846 length += strlen (tree_code_name[code]);
8850 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8851 buffer, tree_code_name[TREE_CODE (node)],
8852 function, trim_filename (file), line);
8855 /* Similar to tree_check_failed, except that we check for a class of tree
8856 code, given in CL. */
8859 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8860 const char *file, int line, const char *function)
8863 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8864 TREE_CODE_CLASS_STRING (cl),
8865 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8866 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8869 /* Similar to tree_check_failed, except that instead of specifying a
8870 dozen codes, use the knowledge that they're all sequential. */
8873 tree_range_check_failed (const_tree node, const char *file, int line,
8874 const char *function, enum tree_code c1,
8878 unsigned length = 0;
8881 for (c = c1; c <= c2; ++c)
8882 length += 4 + strlen (tree_code_name[c]);
8884 length += strlen ("expected ");
8885 buffer = (char *) alloca (length);
8888 for (c = c1; c <= c2; ++c)
8890 const char *prefix = length ? " or " : "expected ";
8892 strcpy (buffer + length, prefix);
8893 length += strlen (prefix);
8894 strcpy (buffer + length, tree_code_name[c]);
8895 length += strlen (tree_code_name[c]);
8898 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8899 buffer, tree_code_name[TREE_CODE (node)],
8900 function, trim_filename (file), line);
8904 /* Similar to tree_check_failed, except that we check that a tree does
8905 not have the specified code, given in CL. */
8908 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8909 const char *file, int line, const char *function)
8912 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8913 TREE_CODE_CLASS_STRING (cl),
8914 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8915 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8919 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8922 omp_clause_check_failed (const_tree node, const char *file, int line,
8923 const char *function, enum omp_clause_code code)
8925 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8926 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8927 function, trim_filename (file), line);
8931 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8934 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8935 const char *function, enum omp_clause_code c1,
8936 enum omp_clause_code c2)
8939 unsigned length = 0;
8942 for (c = c1; c <= c2; ++c)
8943 length += 4 + strlen (omp_clause_code_name[c]);
8945 length += strlen ("expected ");
8946 buffer = (char *) alloca (length);
8949 for (c = c1; c <= c2; ++c)
8951 const char *prefix = length ? " or " : "expected ";
8953 strcpy (buffer + length, prefix);
8954 length += strlen (prefix);
8955 strcpy (buffer + length, omp_clause_code_name[c]);
8956 length += strlen (omp_clause_code_name[c]);
8959 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8960 buffer, omp_clause_code_name[TREE_CODE (node)],
8961 function, trim_filename (file), line);
8965 #undef DEFTREESTRUCT
8966 #define DEFTREESTRUCT(VAL, NAME) NAME,
8968 static const char *ts_enum_names[] = {
8969 #include "treestruct.def"
8971 #undef DEFTREESTRUCT
8973 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8975 /* Similar to tree_class_check_failed, except that we check for
8976 whether CODE contains the tree structure identified by EN. */
8979 tree_contains_struct_check_failed (const_tree node,
8980 const enum tree_node_structure_enum en,
8981 const char *file, int line,
8982 const char *function)
8985 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8987 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8991 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8992 (dynamically sized) vector. */
8995 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8996 const char *function)
8999 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9000 idx + 1, len, function, trim_filename (file), line);
9003 /* Similar to above, except that the check is for the bounds of the operand
9004 vector of an expression node EXP. */
9007 tree_operand_check_failed (int idx, const_tree exp, const char *file,
9008 int line, const char *function)
9010 int code = TREE_CODE (exp);
9012 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9013 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
9014 function, trim_filename (file), line);
9017 /* Similar to above, except that the check is for the number of
9018 operands of an OMP_CLAUSE node. */
9021 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
9022 int line, const char *function)
9025 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9026 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
9027 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
9028 trim_filename (file), line);
9030 #endif /* ENABLE_TREE_CHECKING */
9032 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9033 and mapped to the machine mode MODE. Initialize its fields and build
9034 the information necessary for debugging output. */
9037 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
9040 hashval_t hashcode = 0;
9042 t = make_node (VECTOR_TYPE);
9043 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
9044 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
9045 SET_TYPE_MODE (t, mode);
9047 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
9048 SET_TYPE_STRUCTURAL_EQUALITY (t);
9049 else if (TYPE_CANONICAL (innertype) != innertype
9050 || mode != VOIDmode)
9052 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
9056 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
9057 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
9058 hashcode = iterative_hash_host_wide_int (mode, hashcode);
9059 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
9060 t = type_hash_canon (hashcode, t);
9062 /* We have built a main variant, based on the main variant of the
9063 inner type. Use it to build the variant we return. */
9064 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
9065 && TREE_TYPE (t) != innertype)
9066 return build_type_attribute_qual_variant (t,
9067 TYPE_ATTRIBUTES (innertype),
9068 TYPE_QUALS (innertype));
9074 make_or_reuse_type (unsigned size, int unsignedp)
9076 if (size == INT_TYPE_SIZE)
9077 return unsignedp ? unsigned_type_node : integer_type_node;
9078 if (size == CHAR_TYPE_SIZE)
9079 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
9080 if (size == SHORT_TYPE_SIZE)
9081 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
9082 if (size == LONG_TYPE_SIZE)
9083 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
9084 if (size == LONG_LONG_TYPE_SIZE)
9085 return (unsignedp ? long_long_unsigned_type_node
9086 : long_long_integer_type_node);
9087 if (size == 128 && int128_integer_type_node)
9088 return (unsignedp ? int128_unsigned_type_node
9089 : int128_integer_type_node);
9092 return make_unsigned_type (size);
9094 return make_signed_type (size);
9097 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9100 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
9104 if (size == SHORT_FRACT_TYPE_SIZE)
9105 return unsignedp ? sat_unsigned_short_fract_type_node
9106 : sat_short_fract_type_node;
9107 if (size == FRACT_TYPE_SIZE)
9108 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
9109 if (size == LONG_FRACT_TYPE_SIZE)
9110 return unsignedp ? sat_unsigned_long_fract_type_node
9111 : sat_long_fract_type_node;
9112 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9113 return unsignedp ? sat_unsigned_long_long_fract_type_node
9114 : sat_long_long_fract_type_node;
9118 if (size == SHORT_FRACT_TYPE_SIZE)
9119 return unsignedp ? unsigned_short_fract_type_node
9120 : short_fract_type_node;
9121 if (size == FRACT_TYPE_SIZE)
9122 return unsignedp ? unsigned_fract_type_node : fract_type_node;
9123 if (size == LONG_FRACT_TYPE_SIZE)
9124 return unsignedp ? unsigned_long_fract_type_node
9125 : long_fract_type_node;
9126 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9127 return unsignedp ? unsigned_long_long_fract_type_node
9128 : long_long_fract_type_node;
9131 return make_fract_type (size, unsignedp, satp);
9134 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9137 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
9141 if (size == SHORT_ACCUM_TYPE_SIZE)
9142 return unsignedp ? sat_unsigned_short_accum_type_node
9143 : sat_short_accum_type_node;
9144 if (size == ACCUM_TYPE_SIZE)
9145 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
9146 if (size == LONG_ACCUM_TYPE_SIZE)
9147 return unsignedp ? sat_unsigned_long_accum_type_node
9148 : sat_long_accum_type_node;
9149 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9150 return unsignedp ? sat_unsigned_long_long_accum_type_node
9151 : sat_long_long_accum_type_node;
9155 if (size == SHORT_ACCUM_TYPE_SIZE)
9156 return unsignedp ? unsigned_short_accum_type_node
9157 : short_accum_type_node;
9158 if (size == ACCUM_TYPE_SIZE)
9159 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9160 if (size == LONG_ACCUM_TYPE_SIZE)
9161 return unsignedp ? unsigned_long_accum_type_node
9162 : long_accum_type_node;
9163 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9164 return unsignedp ? unsigned_long_long_accum_type_node
9165 : long_long_accum_type_node;
9168 return make_accum_type (size, unsignedp, satp);
9171 /* Create nodes for all integer types (and error_mark_node) using the sizes
9172 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9173 SHORT_DOUBLE specifies whether double should be of the same precision
9177 build_common_tree_nodes (bool signed_char, bool short_double)
9179 error_mark_node = make_node (ERROR_MARK);
9180 TREE_TYPE (error_mark_node) = error_mark_node;
9182 initialize_sizetypes ();
9184 /* Define both `signed char' and `unsigned char'. */
9185 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9186 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9187 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9188 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9190 /* Define `char', which is like either `signed char' or `unsigned char'
9191 but not the same as either. */
9194 ? make_signed_type (CHAR_TYPE_SIZE)
9195 : make_unsigned_type (CHAR_TYPE_SIZE));
9196 TYPE_STRING_FLAG (char_type_node) = 1;
9198 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9199 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9200 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9201 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9202 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9203 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9204 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9205 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9206 #if HOST_BITS_PER_WIDE_INT >= 64
9207 /* TODO: This isn't correct, but as logic depends at the moment on
9208 host's instead of target's wide-integer.
9209 If there is a target not supporting TImode, but has an 128-bit
9210 integer-scalar register, this target check needs to be adjusted. */
9211 if (targetm.scalar_mode_supported_p (TImode))
9213 int128_integer_type_node = make_signed_type (128);
9214 int128_unsigned_type_node = make_unsigned_type (128);
9218 /* Define a boolean type. This type only represents boolean values but
9219 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9220 Front ends which want to override this size (i.e. Java) can redefine
9221 boolean_type_node before calling build_common_tree_nodes_2. */
9222 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9223 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9224 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9225 TYPE_PRECISION (boolean_type_node) = 1;
9227 /* Define what type to use for size_t. */
9228 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
9229 size_type_node = unsigned_type_node;
9230 else if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
9231 size_type_node = long_unsigned_type_node;
9232 else if (strcmp (SIZE_TYPE, "long long unsigned int") == 0)
9233 size_type_node = long_long_unsigned_type_node;
9234 else if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
9235 size_type_node = short_unsigned_type_node;
9239 /* Fill in the rest of the sized types. Reuse existing type nodes
9241 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9242 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9243 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9244 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9245 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9247 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9248 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9249 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9250 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9251 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9253 access_public_node = get_identifier ("public");
9254 access_protected_node = get_identifier ("protected");
9255 access_private_node = get_identifier ("private");
9257 /* Define these next since types below may used them. */
9258 integer_zero_node = build_int_cst (integer_type_node, 0);
9259 integer_one_node = build_int_cst (integer_type_node, 1);
9260 integer_three_node = build_int_cst (integer_type_node, 3);
9261 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9263 size_zero_node = size_int (0);
9264 size_one_node = size_int (1);
9265 bitsize_zero_node = bitsize_int (0);
9266 bitsize_one_node = bitsize_int (1);
9267 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9269 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9270 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9272 void_type_node = make_node (VOID_TYPE);
9273 layout_type (void_type_node);
9275 /* We are not going to have real types in C with less than byte alignment,
9276 so we might as well not have any types that claim to have it. */
9277 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9278 TYPE_USER_ALIGN (void_type_node) = 0;
9280 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9281 layout_type (TREE_TYPE (null_pointer_node));
9283 ptr_type_node = build_pointer_type (void_type_node);
9285 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9286 fileptr_type_node = ptr_type_node;
9288 float_type_node = make_node (REAL_TYPE);
9289 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9290 layout_type (float_type_node);
9292 double_type_node = make_node (REAL_TYPE);
9294 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9296 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9297 layout_type (double_type_node);
9299 long_double_type_node = make_node (REAL_TYPE);
9300 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9301 layout_type (long_double_type_node);
9303 float_ptr_type_node = build_pointer_type (float_type_node);
9304 double_ptr_type_node = build_pointer_type (double_type_node);
9305 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9306 integer_ptr_type_node = build_pointer_type (integer_type_node);
9308 /* Fixed size integer types. */
9309 uint32_type_node = build_nonstandard_integer_type (32, true);
9310 uint64_type_node = build_nonstandard_integer_type (64, true);
9312 /* Decimal float types. */
9313 dfloat32_type_node = make_node (REAL_TYPE);
9314 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9315 layout_type (dfloat32_type_node);
9316 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9317 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9319 dfloat64_type_node = make_node (REAL_TYPE);
9320 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9321 layout_type (dfloat64_type_node);
9322 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9323 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9325 dfloat128_type_node = make_node (REAL_TYPE);
9326 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9327 layout_type (dfloat128_type_node);
9328 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9329 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9331 complex_integer_type_node = build_complex_type (integer_type_node);
9332 complex_float_type_node = build_complex_type (float_type_node);
9333 complex_double_type_node = build_complex_type (double_type_node);
9334 complex_long_double_type_node = build_complex_type (long_double_type_node);
9336 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9337 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9338 sat_ ## KIND ## _type_node = \
9339 make_sat_signed_ ## KIND ## _type (SIZE); \
9340 sat_unsigned_ ## KIND ## _type_node = \
9341 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9342 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9343 unsigned_ ## KIND ## _type_node = \
9344 make_unsigned_ ## KIND ## _type (SIZE);
9346 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9347 sat_ ## WIDTH ## KIND ## _type_node = \
9348 make_sat_signed_ ## KIND ## _type (SIZE); \
9349 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9350 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9351 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9352 unsigned_ ## WIDTH ## KIND ## _type_node = \
9353 make_unsigned_ ## KIND ## _type (SIZE);
9355 /* Make fixed-point type nodes based on four different widths. */
9356 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9357 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9358 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9359 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9360 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9362 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9363 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9364 NAME ## _type_node = \
9365 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9366 u ## NAME ## _type_node = \
9367 make_or_reuse_unsigned_ ## KIND ## _type \
9368 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9369 sat_ ## NAME ## _type_node = \
9370 make_or_reuse_sat_signed_ ## KIND ## _type \
9371 (GET_MODE_BITSIZE (MODE ## mode)); \
9372 sat_u ## NAME ## _type_node = \
9373 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9374 (GET_MODE_BITSIZE (U ## MODE ## mode));
9376 /* Fixed-point type and mode nodes. */
9377 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9378 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9379 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9380 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9381 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9382 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9383 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9384 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9385 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9386 MAKE_FIXED_MODE_NODE (accum, da, DA)
9387 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9390 tree t = targetm.build_builtin_va_list ();
9392 /* Many back-ends define record types without setting TYPE_NAME.
9393 If we copied the record type here, we'd keep the original
9394 record type without a name. This breaks name mangling. So,
9395 don't copy record types and let c_common_nodes_and_builtins()
9396 declare the type to be __builtin_va_list. */
9397 if (TREE_CODE (t) != RECORD_TYPE)
9398 t = build_variant_type_copy (t);
9400 va_list_type_node = t;
9404 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9407 local_define_builtin (const char *name, tree type, enum built_in_function code,
9408 const char *library_name, int ecf_flags)
9412 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9413 library_name, NULL_TREE);
9414 if (ecf_flags & ECF_CONST)
9415 TREE_READONLY (decl) = 1;
9416 if (ecf_flags & ECF_PURE)
9417 DECL_PURE_P (decl) = 1;
9418 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9419 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9420 if (ecf_flags & ECF_NORETURN)
9421 TREE_THIS_VOLATILE (decl) = 1;
9422 if (ecf_flags & ECF_NOTHROW)
9423 TREE_NOTHROW (decl) = 1;
9424 if (ecf_flags & ECF_MALLOC)
9425 DECL_IS_MALLOC (decl) = 1;
9426 if (ecf_flags & ECF_LEAF)
9427 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9428 NULL, DECL_ATTRIBUTES (decl));
9430 built_in_decls[code] = decl;
9431 implicit_built_in_decls[code] = decl;
9434 /* Call this function after instantiating all builtins that the language
9435 front end cares about. This will build the rest of the builtins that
9436 are relied upon by the tree optimizers and the middle-end. */
9439 build_common_builtin_nodes (void)
9443 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9444 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9446 ftype = build_function_type_list (ptr_type_node,
9447 ptr_type_node, const_ptr_type_node,
9448 size_type_node, NULL_TREE);
9450 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9451 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9452 "memcpy", ECF_NOTHROW | ECF_LEAF);
9453 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9454 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9455 "memmove", ECF_NOTHROW | ECF_LEAF);
9458 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9460 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9461 const_ptr_type_node, size_type_node,
9463 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9464 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9467 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9469 ftype = build_function_type_list (ptr_type_node,
9470 ptr_type_node, integer_type_node,
9471 size_type_node, NULL_TREE);
9472 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9473 "memset", ECF_NOTHROW | ECF_LEAF);
9476 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9478 ftype = build_function_type_list (ptr_type_node,
9479 size_type_node, NULL_TREE);
9480 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9481 "alloca", ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9484 /* If we're checking the stack, `alloca' can throw. */
9485 if (flag_stack_check)
9486 TREE_NOTHROW (built_in_decls[BUILT_IN_ALLOCA]) = 0;
9488 ftype = build_function_type_list (void_type_node,
9489 ptr_type_node, ptr_type_node,
9490 ptr_type_node, NULL_TREE);
9491 local_define_builtin ("__builtin_init_trampoline", ftype,
9492 BUILT_IN_INIT_TRAMPOLINE,
9493 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9495 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9496 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9497 BUILT_IN_ADJUST_TRAMPOLINE,
9498 "__builtin_adjust_trampoline",
9499 ECF_CONST | ECF_NOTHROW);
9501 ftype = build_function_type_list (void_type_node,
9502 ptr_type_node, ptr_type_node, NULL_TREE);
9503 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9504 BUILT_IN_NONLOCAL_GOTO,
9505 "__builtin_nonlocal_goto",
9506 ECF_NORETURN | ECF_NOTHROW);
9508 ftype = build_function_type_list (void_type_node,
9509 ptr_type_node, ptr_type_node, NULL_TREE);
9510 local_define_builtin ("__builtin_setjmp_setup", ftype,
9511 BUILT_IN_SETJMP_SETUP,
9512 "__builtin_setjmp_setup", ECF_NOTHROW);
9514 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9515 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9516 BUILT_IN_SETJMP_DISPATCHER,
9517 "__builtin_setjmp_dispatcher",
9518 ECF_PURE | ECF_NOTHROW);
9520 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9521 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9522 BUILT_IN_SETJMP_RECEIVER,
9523 "__builtin_setjmp_receiver", ECF_NOTHROW);
9525 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9526 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9527 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9529 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9530 local_define_builtin ("__builtin_stack_restore", ftype,
9531 BUILT_IN_STACK_RESTORE,
9532 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9534 /* If there's a possibility that we might use the ARM EABI, build the
9535 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9536 if (targetm.arm_eabi_unwinder)
9538 ftype = build_function_type_list (void_type_node, NULL_TREE);
9539 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9540 BUILT_IN_CXA_END_CLEANUP,
9541 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9544 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9545 local_define_builtin ("__builtin_unwind_resume", ftype,
9546 BUILT_IN_UNWIND_RESUME,
9547 ((targetm_common.except_unwind_info (&global_options)
9549 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9552 if (built_in_decls[BUILT_IN_RETURN_ADDRESS] == NULL_TREE)
9554 ftype = build_function_type_list (ptr_type_node, integer_type_node,
9556 local_define_builtin ("__builtin_return_address", ftype,
9557 BUILT_IN_RETURN_ADDRESS,
9558 "__builtin_return_address",
9562 if (built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER] == NULL_TREE
9563 || built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT] == NULL_TREE)
9565 ftype = build_function_type_list (void_type_node, ptr_type_node,
9566 ptr_type_node, NULL_TREE);
9567 if (built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER] == NULL_TREE)
9568 local_define_builtin ("__cyg_profile_func_enter", ftype,
9569 BUILT_IN_PROFILE_FUNC_ENTER,
9570 "__cyg_profile_func_enter", 0);
9571 if (built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT] == NULL_TREE)
9572 local_define_builtin ("__cyg_profile_func_exit", ftype,
9573 BUILT_IN_PROFILE_FUNC_EXIT,
9574 "__cyg_profile_func_exit", 0);
9577 /* The exception object and filter values from the runtime. The argument
9578 must be zero before exception lowering, i.e. from the front end. After
9579 exception lowering, it will be the region number for the exception
9580 landing pad. These functions are PURE instead of CONST to prevent
9581 them from being hoisted past the exception edge that will initialize
9582 its value in the landing pad. */
9583 ftype = build_function_type_list (ptr_type_node,
9584 integer_type_node, NULL_TREE);
9585 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9586 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9588 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9589 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9590 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9591 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9593 ftype = build_function_type_list (void_type_node,
9594 integer_type_node, integer_type_node,
9596 local_define_builtin ("__builtin_eh_copy_values", ftype,
9597 BUILT_IN_EH_COPY_VALUES,
9598 "__builtin_eh_copy_values", ECF_NOTHROW);
9600 /* Complex multiplication and division. These are handled as builtins
9601 rather than optabs because emit_library_call_value doesn't support
9602 complex. Further, we can do slightly better with folding these
9603 beasties if the real and complex parts of the arguments are separate. */
9607 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9609 char mode_name_buf[4], *q;
9611 enum built_in_function mcode, dcode;
9612 tree type, inner_type;
9613 const char *prefix = "__";
9615 if (targetm.libfunc_gnu_prefix)
9618 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9621 inner_type = TREE_TYPE (type);
9623 ftype = build_function_type_list (type, inner_type, inner_type,
9624 inner_type, inner_type, NULL_TREE);
9626 mcode = ((enum built_in_function)
9627 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9628 dcode = ((enum built_in_function)
9629 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9631 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9635 built_in_names[mcode] = concat (prefix, "mul", mode_name_buf, "3",
9637 local_define_builtin (built_in_names[mcode], ftype, mcode,
9638 built_in_names[mcode],
9639 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9641 built_in_names[dcode] = concat (prefix, "div", mode_name_buf, "3",
9643 local_define_builtin (built_in_names[dcode], ftype, dcode,
9644 built_in_names[dcode],
9645 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9650 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9653 If we requested a pointer to a vector, build up the pointers that
9654 we stripped off while looking for the inner type. Similarly for
9655 return values from functions.
9657 The argument TYPE is the top of the chain, and BOTTOM is the
9658 new type which we will point to. */
9661 reconstruct_complex_type (tree type, tree bottom)
9665 if (TREE_CODE (type) == POINTER_TYPE)
9667 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9668 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9669 TYPE_REF_CAN_ALIAS_ALL (type));
9671 else if (TREE_CODE (type) == REFERENCE_TYPE)
9673 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9674 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9675 TYPE_REF_CAN_ALIAS_ALL (type));
9677 else if (TREE_CODE (type) == ARRAY_TYPE)
9679 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9680 outer = build_array_type (inner, TYPE_DOMAIN (type));
9682 else if (TREE_CODE (type) == FUNCTION_TYPE)
9684 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9685 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9687 else if (TREE_CODE (type) == METHOD_TYPE)
9689 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9690 /* The build_method_type_directly() routine prepends 'this' to argument list,
9691 so we must compensate by getting rid of it. */
9693 = build_method_type_directly
9694 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9696 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9698 else if (TREE_CODE (type) == OFFSET_TYPE)
9700 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9701 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9706 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9710 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9713 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9717 switch (GET_MODE_CLASS (mode))
9719 case MODE_VECTOR_INT:
9720 case MODE_VECTOR_FLOAT:
9721 case MODE_VECTOR_FRACT:
9722 case MODE_VECTOR_UFRACT:
9723 case MODE_VECTOR_ACCUM:
9724 case MODE_VECTOR_UACCUM:
9725 nunits = GET_MODE_NUNITS (mode);
9729 /* Check that there are no leftover bits. */
9730 gcc_assert (GET_MODE_BITSIZE (mode)
9731 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9733 nunits = GET_MODE_BITSIZE (mode)
9734 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9741 return make_vector_type (innertype, nunits, mode);
9744 /* Similarly, but takes the inner type and number of units, which must be
9748 build_vector_type (tree innertype, int nunits)
9750 return make_vector_type (innertype, nunits, VOIDmode);
9753 /* Similarly, but takes the inner type and number of units, which must be
9757 build_opaque_vector_type (tree innertype, int nunits)
9760 innertype = build_distinct_type_copy (innertype);
9761 t = make_vector_type (innertype, nunits, VOIDmode);
9762 TYPE_VECTOR_OPAQUE (t) = true;
9767 /* Given an initializer INIT, return TRUE if INIT is zero or some
9768 aggregate of zeros. Otherwise return FALSE. */
9770 initializer_zerop (const_tree init)
9776 switch (TREE_CODE (init))
9779 return integer_zerop (init);
9782 /* ??? Note that this is not correct for C4X float formats. There,
9783 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9784 negative exponent. */
9785 return real_zerop (init)
9786 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9789 return fixed_zerop (init);
9792 return integer_zerop (init)
9793 || (real_zerop (init)
9794 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9795 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9798 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9799 if (!initializer_zerop (TREE_VALUE (elt)))
9805 unsigned HOST_WIDE_INT idx;
9807 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9808 if (!initializer_zerop (elt))
9817 /* We need to loop through all elements to handle cases like
9818 "\0" and "\0foobar". */
9819 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9820 if (TREE_STRING_POINTER (init)[i] != '\0')
9831 /* Build an empty statement at location LOC. */
9834 build_empty_stmt (location_t loc)
9836 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9837 SET_EXPR_LOCATION (t, loc);
9842 /* Build an OpenMP clause with code CODE. LOC is the location of the
9846 build_omp_clause (location_t loc, enum omp_clause_code code)
9851 length = omp_clause_num_ops[code];
9852 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9854 record_node_allocation_statistics (OMP_CLAUSE, size);
9856 t = ggc_alloc_tree_node (size);
9857 memset (t, 0, size);
9858 TREE_SET_CODE (t, OMP_CLAUSE);
9859 OMP_CLAUSE_SET_CODE (t, code);
9860 OMP_CLAUSE_LOCATION (t) = loc;
9865 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9866 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9867 Except for the CODE and operand count field, other storage for the
9868 object is initialized to zeros. */
9871 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9874 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9876 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9877 gcc_assert (len >= 1);
9879 record_node_allocation_statistics (code, length);
9881 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9883 TREE_SET_CODE (t, code);
9885 /* Can't use TREE_OPERAND to store the length because if checking is
9886 enabled, it will try to check the length before we store it. :-P */
9887 t->exp.operands[0] = build_int_cst (sizetype, len);
9892 /* Helper function for build_call_* functions; build a CALL_EXPR with
9893 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9894 the argument slots. */
9897 build_call_1 (tree return_type, tree fn, int nargs)
9901 t = build_vl_exp (CALL_EXPR, nargs + 3);
9902 TREE_TYPE (t) = return_type;
9903 CALL_EXPR_FN (t) = fn;
9904 CALL_EXPR_STATIC_CHAIN (t) = NULL;
9909 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9910 FN and a null static chain slot. NARGS is the number of call arguments
9911 which are specified as "..." arguments. */
9914 build_call_nary (tree return_type, tree fn, int nargs, ...)
9918 va_start (args, nargs);
9919 ret = build_call_valist (return_type, fn, nargs, args);
9924 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9925 FN and a null static chain slot. NARGS is the number of call arguments
9926 which are specified as a va_list ARGS. */
9929 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9934 t = build_call_1 (return_type, fn, nargs);
9935 for (i = 0; i < nargs; i++)
9936 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9937 process_call_operands (t);
9941 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9942 FN and a null static chain slot. NARGS is the number of call arguments
9943 which are specified as a tree array ARGS. */
9946 build_call_array_loc (location_t loc, tree return_type, tree fn,
9947 int nargs, const tree *args)
9952 t = build_call_1 (return_type, fn, nargs);
9953 for (i = 0; i < nargs; i++)
9954 CALL_EXPR_ARG (t, i) = args[i];
9955 process_call_operands (t);
9956 SET_EXPR_LOCATION (t, loc);
9960 /* Like build_call_array, but takes a VEC. */
9963 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9968 ret = build_call_1 (return_type, fn, VEC_length (tree, args));
9969 FOR_EACH_VEC_ELT (tree, args, ix, t)
9970 CALL_EXPR_ARG (ret, ix) = t;
9971 process_call_operands (ret);
9976 /* Returns true if it is possible to prove that the index of
9977 an array access REF (an ARRAY_REF expression) falls into the
9981 in_array_bounds_p (tree ref)
9983 tree idx = TREE_OPERAND (ref, 1);
9986 if (TREE_CODE (idx) != INTEGER_CST)
9989 min = array_ref_low_bound (ref);
9990 max = array_ref_up_bound (ref);
9993 || TREE_CODE (min) != INTEGER_CST
9994 || TREE_CODE (max) != INTEGER_CST)
9997 if (tree_int_cst_lt (idx, min)
9998 || tree_int_cst_lt (max, idx))
10004 /* Returns true if it is possible to prove that the range of
10005 an array access REF (an ARRAY_RANGE_REF expression) falls
10006 into the array bounds. */
10009 range_in_array_bounds_p (tree ref)
10011 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
10012 tree range_min, range_max, min, max;
10014 range_min = TYPE_MIN_VALUE (domain_type);
10015 range_max = TYPE_MAX_VALUE (domain_type);
10018 || TREE_CODE (range_min) != INTEGER_CST
10019 || TREE_CODE (range_max) != INTEGER_CST)
10022 min = array_ref_low_bound (ref);
10023 max = array_ref_up_bound (ref);
10026 || TREE_CODE (min) != INTEGER_CST
10027 || TREE_CODE (max) != INTEGER_CST)
10030 if (tree_int_cst_lt (range_min, min)
10031 || tree_int_cst_lt (max, range_max))
10037 /* Return true if T (assumed to be a DECL) must be assigned a memory
10041 needs_to_live_in_memory (const_tree t)
10043 if (TREE_CODE (t) == SSA_NAME)
10044 t = SSA_NAME_VAR (t);
10046 return (TREE_ADDRESSABLE (t)
10047 || is_global_var (t)
10048 || (TREE_CODE (t) == RESULT_DECL
10049 && !DECL_BY_REFERENCE (t)
10050 && aggregate_value_p (t, current_function_decl)));
10053 /* Return value of a constant X and sign-extend it. */
10056 int_cst_value (const_tree x)
10058 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10059 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
10061 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10062 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10063 || TREE_INT_CST_HIGH (x) == -1);
10065 if (bits < HOST_BITS_PER_WIDE_INT)
10067 bool negative = ((val >> (bits - 1)) & 1) != 0;
10069 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
10071 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
10077 /* Return value of a constant X and sign-extend it. */
10080 widest_int_cst_value (const_tree x)
10082 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10083 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
10085 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10086 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
10087 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
10088 << HOST_BITS_PER_WIDE_INT);
10090 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10091 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10092 || TREE_INT_CST_HIGH (x) == -1);
10095 if (bits < HOST_BITS_PER_WIDEST_INT)
10097 bool negative = ((val >> (bits - 1)) & 1) != 0;
10099 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
10101 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
10107 /* If TYPE is an integral type, return an equivalent type which is
10108 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
10109 return TYPE itself. */
10112 signed_or_unsigned_type_for (int unsignedp, tree type)
10115 if (POINTER_TYPE_P (type))
10117 /* If the pointer points to the normal address space, use the
10118 size_type_node. Otherwise use an appropriate size for the pointer
10119 based on the named address space it points to. */
10120 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
10121 t = size_type_node;
10123 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10126 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
10129 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10132 /* Returns unsigned variant of TYPE. */
10135 unsigned_type_for (tree type)
10137 return signed_or_unsigned_type_for (1, type);
10140 /* Returns signed variant of TYPE. */
10143 signed_type_for (tree type)
10145 return signed_or_unsigned_type_for (0, type);
10148 /* Returns the largest value obtainable by casting something in INNER type to
10152 upper_bound_in_type (tree outer, tree inner)
10155 unsigned int det = 0;
10156 unsigned oprec = TYPE_PRECISION (outer);
10157 unsigned iprec = TYPE_PRECISION (inner);
10160 /* Compute a unique number for every combination. */
10161 det |= (oprec > iprec) ? 4 : 0;
10162 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10163 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10165 /* Determine the exponent to use. */
10170 /* oprec <= iprec, outer: signed, inner: don't care. */
10175 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10179 /* oprec > iprec, outer: signed, inner: signed. */
10183 /* oprec > iprec, outer: signed, inner: unsigned. */
10187 /* oprec > iprec, outer: unsigned, inner: signed. */
10191 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10195 gcc_unreachable ();
10198 /* Compute 2^^prec - 1. */
10199 if (prec <= HOST_BITS_PER_WIDE_INT)
10202 high.low = ((~(unsigned HOST_WIDE_INT) 0)
10203 >> (HOST_BITS_PER_WIDE_INT - prec));
10207 high.high = ((~(unsigned HOST_WIDE_INT) 0)
10208 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
10209 high.low = ~(unsigned HOST_WIDE_INT) 0;
10212 return double_int_to_tree (outer, high);
10215 /* Returns the smallest value obtainable by casting something in INNER type to
10219 lower_bound_in_type (tree outer, tree inner)
10222 unsigned oprec = TYPE_PRECISION (outer);
10223 unsigned iprec = TYPE_PRECISION (inner);
10225 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10227 if (TYPE_UNSIGNED (outer)
10228 /* If we are widening something of an unsigned type, OUTER type
10229 contains all values of INNER type. In particular, both INNER
10230 and OUTER types have zero in common. */
10231 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10232 low.low = low.high = 0;
10235 /* If we are widening a signed type to another signed type, we
10236 want to obtain -2^^(iprec-1). If we are keeping the
10237 precision or narrowing to a signed type, we want to obtain
10239 unsigned prec = oprec > iprec ? iprec : oprec;
10241 if (prec <= HOST_BITS_PER_WIDE_INT)
10243 low.high = ~(unsigned HOST_WIDE_INT) 0;
10244 low.low = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10248 low.high = ((~(unsigned HOST_WIDE_INT) 0)
10249 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10254 return double_int_to_tree (outer, low);
10257 /* Return nonzero if two operands that are suitable for PHI nodes are
10258 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10259 SSA_NAME or invariant. Note that this is strictly an optimization.
10260 That is, callers of this function can directly call operand_equal_p
10261 and get the same result, only slower. */
10264 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10268 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10270 return operand_equal_p (arg0, arg1, 0);
10273 /* Returns number of zeros at the end of binary representation of X.
10275 ??? Use ffs if available? */
10278 num_ending_zeros (const_tree x)
10280 unsigned HOST_WIDE_INT fr, nfr;
10281 unsigned num, abits;
10282 tree type = TREE_TYPE (x);
10284 if (TREE_INT_CST_LOW (x) == 0)
10286 num = HOST_BITS_PER_WIDE_INT;
10287 fr = TREE_INT_CST_HIGH (x);
10292 fr = TREE_INT_CST_LOW (x);
10295 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10298 if (nfr << abits == fr)
10305 if (num > TYPE_PRECISION (type))
10306 num = TYPE_PRECISION (type);
10308 return build_int_cst_type (type, num);
10312 #define WALK_SUBTREE(NODE) \
10315 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10321 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10322 be walked whenever a type is seen in the tree. Rest of operands and return
10323 value are as for walk_tree. */
10326 walk_type_fields (tree type, walk_tree_fn func, void *data,
10327 struct pointer_set_t *pset, walk_tree_lh lh)
10329 tree result = NULL_TREE;
10331 switch (TREE_CODE (type))
10334 case REFERENCE_TYPE:
10335 /* We have to worry about mutually recursive pointers. These can't
10336 be written in C. They can in Ada. It's pathological, but
10337 there's an ACATS test (c38102a) that checks it. Deal with this
10338 by checking if we're pointing to another pointer, that one
10339 points to another pointer, that one does too, and we have no htab.
10340 If so, get a hash table. We check three levels deep to avoid
10341 the cost of the hash table if we don't need one. */
10342 if (POINTER_TYPE_P (TREE_TYPE (type))
10343 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10344 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10347 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10355 /* ... fall through ... */
10358 WALK_SUBTREE (TREE_TYPE (type));
10362 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10364 /* Fall through. */
10366 case FUNCTION_TYPE:
10367 WALK_SUBTREE (TREE_TYPE (type));
10371 /* We never want to walk into default arguments. */
10372 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10373 WALK_SUBTREE (TREE_VALUE (arg));
10378 /* Don't follow this nodes's type if a pointer for fear that
10379 we'll have infinite recursion. If we have a PSET, then we
10382 || (!POINTER_TYPE_P (TREE_TYPE (type))
10383 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10384 WALK_SUBTREE (TREE_TYPE (type));
10385 WALK_SUBTREE (TYPE_DOMAIN (type));
10389 WALK_SUBTREE (TREE_TYPE (type));
10390 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10400 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10401 called with the DATA and the address of each sub-tree. If FUNC returns a
10402 non-NULL value, the traversal is stopped, and the value returned by FUNC
10403 is returned. If PSET is non-NULL it is used to record the nodes visited,
10404 and to avoid visiting a node more than once. */
10407 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10408 struct pointer_set_t *pset, walk_tree_lh lh)
10410 enum tree_code code;
10414 #define WALK_SUBTREE_TAIL(NODE) \
10418 goto tail_recurse; \
10423 /* Skip empty subtrees. */
10427 /* Don't walk the same tree twice, if the user has requested
10428 that we avoid doing so. */
10429 if (pset && pointer_set_insert (pset, *tp))
10432 /* Call the function. */
10434 result = (*func) (tp, &walk_subtrees, data);
10436 /* If we found something, return it. */
10440 code = TREE_CODE (*tp);
10442 /* Even if we didn't, FUNC may have decided that there was nothing
10443 interesting below this point in the tree. */
10444 if (!walk_subtrees)
10446 /* But we still need to check our siblings. */
10447 if (code == TREE_LIST)
10448 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10449 else if (code == OMP_CLAUSE)
10450 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10457 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10458 if (result || !walk_subtrees)
10465 case IDENTIFIER_NODE:
10472 case PLACEHOLDER_EXPR:
10476 /* None of these have subtrees other than those already walked
10481 WALK_SUBTREE (TREE_VALUE (*tp));
10482 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10487 int len = TREE_VEC_LENGTH (*tp);
10492 /* Walk all elements but the first. */
10494 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10496 /* Now walk the first one as a tail call. */
10497 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10501 WALK_SUBTREE (TREE_REALPART (*tp));
10502 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10506 unsigned HOST_WIDE_INT idx;
10507 constructor_elt *ce;
10510 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10512 WALK_SUBTREE (ce->value);
10517 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10522 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10524 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10525 into declarations that are just mentioned, rather than
10526 declared; they don't really belong to this part of the tree.
10527 And, we can see cycles: the initializer for a declaration
10528 can refer to the declaration itself. */
10529 WALK_SUBTREE (DECL_INITIAL (decl));
10530 WALK_SUBTREE (DECL_SIZE (decl));
10531 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10533 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10536 case STATEMENT_LIST:
10538 tree_stmt_iterator i;
10539 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10540 WALK_SUBTREE (*tsi_stmt_ptr (i));
10545 switch (OMP_CLAUSE_CODE (*tp))
10547 case OMP_CLAUSE_PRIVATE:
10548 case OMP_CLAUSE_SHARED:
10549 case OMP_CLAUSE_FIRSTPRIVATE:
10550 case OMP_CLAUSE_COPYIN:
10551 case OMP_CLAUSE_COPYPRIVATE:
10552 case OMP_CLAUSE_FINAL:
10553 case OMP_CLAUSE_IF:
10554 case OMP_CLAUSE_NUM_THREADS:
10555 case OMP_CLAUSE_SCHEDULE:
10556 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10559 case OMP_CLAUSE_NOWAIT:
10560 case OMP_CLAUSE_ORDERED:
10561 case OMP_CLAUSE_DEFAULT:
10562 case OMP_CLAUSE_UNTIED:
10563 case OMP_CLAUSE_MERGEABLE:
10564 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10566 case OMP_CLAUSE_LASTPRIVATE:
10567 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10568 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10569 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10571 case OMP_CLAUSE_COLLAPSE:
10574 for (i = 0; i < 3; i++)
10575 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10576 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10579 case OMP_CLAUSE_REDUCTION:
10582 for (i = 0; i < 4; i++)
10583 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10584 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10588 gcc_unreachable ();
10596 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10597 But, we only want to walk once. */
10598 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10599 for (i = 0; i < len; ++i)
10600 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10601 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10605 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10606 defining. We only want to walk into these fields of a type in this
10607 case and not in the general case of a mere reference to the type.
10609 The criterion is as follows: if the field can be an expression, it
10610 must be walked only here. This should be in keeping with the fields
10611 that are directly gimplified in gimplify_type_sizes in order for the
10612 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10613 variable-sized types.
10615 Note that DECLs get walked as part of processing the BIND_EXPR. */
10616 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10618 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10619 if (TREE_CODE (*type_p) == ERROR_MARK)
10622 /* Call the function for the type. See if it returns anything or
10623 doesn't want us to continue. If we are to continue, walk both
10624 the normal fields and those for the declaration case. */
10625 result = (*func) (type_p, &walk_subtrees, data);
10626 if (result || !walk_subtrees)
10629 /* But do not walk a pointed-to type since it may itself need to
10630 be walked in the declaration case if it isn't anonymous. */
10631 if (!POINTER_TYPE_P (*type_p))
10633 result = walk_type_fields (*type_p, func, data, pset, lh);
10638 /* If this is a record type, also walk the fields. */
10639 if (RECORD_OR_UNION_TYPE_P (*type_p))
10643 for (field = TYPE_FIELDS (*type_p); field;
10644 field = DECL_CHAIN (field))
10646 /* We'd like to look at the type of the field, but we can
10647 easily get infinite recursion. So assume it's pointed
10648 to elsewhere in the tree. Also, ignore things that
10650 if (TREE_CODE (field) != FIELD_DECL)
10653 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10654 WALK_SUBTREE (DECL_SIZE (field));
10655 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10656 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10657 WALK_SUBTREE (DECL_QUALIFIER (field));
10661 /* Same for scalar types. */
10662 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10663 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10664 || TREE_CODE (*type_p) == INTEGER_TYPE
10665 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10666 || TREE_CODE (*type_p) == REAL_TYPE)
10668 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10669 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10672 WALK_SUBTREE (TYPE_SIZE (*type_p));
10673 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10678 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10682 /* Walk over all the sub-trees of this operand. */
10683 len = TREE_OPERAND_LENGTH (*tp);
10685 /* Go through the subtrees. We need to do this in forward order so
10686 that the scope of a FOR_EXPR is handled properly. */
10689 for (i = 0; i < len - 1; ++i)
10690 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10691 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10694 /* If this is a type, walk the needed fields in the type. */
10695 else if (TYPE_P (*tp))
10696 return walk_type_fields (*tp, func, data, pset, lh);
10700 /* We didn't find what we were looking for. */
10703 #undef WALK_SUBTREE_TAIL
10705 #undef WALK_SUBTREE
10707 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10710 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10714 struct pointer_set_t *pset;
10716 pset = pointer_set_create ();
10717 result = walk_tree_1 (tp, func, data, pset, lh);
10718 pointer_set_destroy (pset);
10724 tree_block (tree t)
10726 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10728 if (IS_EXPR_CODE_CLASS (c))
10729 return &t->exp.block;
10730 gcc_unreachable ();
10734 /* Create a nameless artificial label and put it in the current
10735 function context. The label has a location of LOC. Returns the
10736 newly created label. */
10739 create_artificial_label (location_t loc)
10741 tree lab = build_decl (loc,
10742 LABEL_DECL, NULL_TREE, void_type_node);
10744 DECL_ARTIFICIAL (lab) = 1;
10745 DECL_IGNORED_P (lab) = 1;
10746 DECL_CONTEXT (lab) = current_function_decl;
10750 /* Given a tree, try to return a useful variable name that we can use
10751 to prefix a temporary that is being assigned the value of the tree.
10752 I.E. given <temp> = &A, return A. */
10757 tree stripped_decl;
10760 STRIP_NOPS (stripped_decl);
10761 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10762 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10765 switch (TREE_CODE (stripped_decl))
10768 return get_name (TREE_OPERAND (stripped_decl, 0));
10775 /* Return true if TYPE has a variable argument list. */
10778 stdarg_p (const_tree fntype)
10780 function_args_iterator args_iter;
10781 tree n = NULL_TREE, t;
10786 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10791 return n != NULL_TREE && n != void_type_node;
10794 /* Return true if TYPE has a prototype. */
10797 prototype_p (tree fntype)
10801 gcc_assert (fntype != NULL_TREE);
10803 t = TYPE_ARG_TYPES (fntype);
10804 return (t != NULL_TREE);
10807 /* If BLOCK is inlined from an __attribute__((__artificial__))
10808 routine, return pointer to location from where it has been
10811 block_nonartificial_location (tree block)
10813 location_t *ret = NULL;
10815 while (block && TREE_CODE (block) == BLOCK
10816 && BLOCK_ABSTRACT_ORIGIN (block))
10818 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10820 while (TREE_CODE (ao) == BLOCK
10821 && BLOCK_ABSTRACT_ORIGIN (ao)
10822 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10823 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10825 if (TREE_CODE (ao) == FUNCTION_DECL)
10827 /* If AO is an artificial inline, point RET to the
10828 call site locus at which it has been inlined and continue
10829 the loop, in case AO's caller is also an artificial
10831 if (DECL_DECLARED_INLINE_P (ao)
10832 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10833 ret = &BLOCK_SOURCE_LOCATION (block);
10837 else if (TREE_CODE (ao) != BLOCK)
10840 block = BLOCK_SUPERCONTEXT (block);
10846 /* If EXP is inlined from an __attribute__((__artificial__))
10847 function, return the location of the original call expression. */
10850 tree_nonartificial_location (tree exp)
10852 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10857 return EXPR_LOCATION (exp);
10861 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10864 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10867 cl_option_hash_hash (const void *x)
10869 const_tree const t = (const_tree) x;
10873 hashval_t hash = 0;
10875 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10877 p = (const char *)TREE_OPTIMIZATION (t);
10878 len = sizeof (struct cl_optimization);
10881 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10883 p = (const char *)TREE_TARGET_OPTION (t);
10884 len = sizeof (struct cl_target_option);
10888 gcc_unreachable ();
10890 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10892 for (i = 0; i < len; i++)
10894 hash = (hash << 4) ^ ((i << 2) | p[i]);
10899 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10900 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10904 cl_option_hash_eq (const void *x, const void *y)
10906 const_tree const xt = (const_tree) x;
10907 const_tree const yt = (const_tree) y;
10912 if (TREE_CODE (xt) != TREE_CODE (yt))
10915 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10917 xp = (const char *)TREE_OPTIMIZATION (xt);
10918 yp = (const char *)TREE_OPTIMIZATION (yt);
10919 len = sizeof (struct cl_optimization);
10922 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10924 xp = (const char *)TREE_TARGET_OPTION (xt);
10925 yp = (const char *)TREE_TARGET_OPTION (yt);
10926 len = sizeof (struct cl_target_option);
10930 gcc_unreachable ();
10932 return (memcmp (xp, yp, len) == 0);
10935 /* Build an OPTIMIZATION_NODE based on the current options. */
10938 build_optimization_node (void)
10943 /* Use the cache of optimization nodes. */
10945 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
10948 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10952 /* Insert this one into the hash table. */
10953 t = cl_optimization_node;
10956 /* Make a new node for next time round. */
10957 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10963 /* Build a TARGET_OPTION_NODE based on the current options. */
10966 build_target_option_node (void)
10971 /* Use the cache of optimization nodes. */
10973 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
10976 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10980 /* Insert this one into the hash table. */
10981 t = cl_target_option_node;
10984 /* Make a new node for next time round. */
10985 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10991 /* Determine the "ultimate origin" of a block. The block may be an inlined
10992 instance of an inlined instance of a block which is local to an inline
10993 function, so we have to trace all of the way back through the origin chain
10994 to find out what sort of node actually served as the original seed for the
10998 block_ultimate_origin (const_tree block)
11000 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
11002 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11003 nodes in the function to point to themselves; ignore that if
11004 we're trying to output the abstract instance of this function. */
11005 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
11008 if (immediate_origin == NULL_TREE)
11013 tree lookahead = immediate_origin;
11017 ret_val = lookahead;
11018 lookahead = (TREE_CODE (ret_val) == BLOCK
11019 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
11021 while (lookahead != NULL && lookahead != ret_val);
11023 /* The block's abstract origin chain may not be the *ultimate* origin of
11024 the block. It could lead to a DECL that has an abstract origin set.
11025 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11026 will give us if it has one). Note that DECL's abstract origins are
11027 supposed to be the most distant ancestor (or so decl_ultimate_origin
11028 claims), so we don't need to loop following the DECL origins. */
11029 if (DECL_P (ret_val))
11030 return DECL_ORIGIN (ret_val);
11036 /* Return true if T1 and T2 are equivalent lists. */
11039 list_equal_p (const_tree t1, const_tree t2)
11041 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
11042 if (TREE_VALUE (t1) != TREE_VALUE (t2))
11047 /* Return true iff conversion in EXP generates no instruction. Mark
11048 it inline so that we fully inline into the stripping functions even
11049 though we have two uses of this function. */
11052 tree_nop_conversion (const_tree exp)
11054 tree outer_type, inner_type;
11056 if (!CONVERT_EXPR_P (exp)
11057 && TREE_CODE (exp) != NON_LVALUE_EXPR)
11059 if (TREE_OPERAND (exp, 0) == error_mark_node)
11062 outer_type = TREE_TYPE (exp);
11063 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11068 /* Use precision rather then machine mode when we can, which gives
11069 the correct answer even for submode (bit-field) types. */
11070 if ((INTEGRAL_TYPE_P (outer_type)
11071 || POINTER_TYPE_P (outer_type)
11072 || TREE_CODE (outer_type) == OFFSET_TYPE)
11073 && (INTEGRAL_TYPE_P (inner_type)
11074 || POINTER_TYPE_P (inner_type)
11075 || TREE_CODE (inner_type) == OFFSET_TYPE))
11076 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
11078 /* Otherwise fall back on comparing machine modes (e.g. for
11079 aggregate types, floats). */
11080 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
11083 /* Return true iff conversion in EXP generates no instruction. Don't
11084 consider conversions changing the signedness. */
11087 tree_sign_nop_conversion (const_tree exp)
11089 tree outer_type, inner_type;
11091 if (!tree_nop_conversion (exp))
11094 outer_type = TREE_TYPE (exp);
11095 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11097 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
11098 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
11101 /* Strip conversions from EXP according to tree_nop_conversion and
11102 return the resulting expression. */
11105 tree_strip_nop_conversions (tree exp)
11107 while (tree_nop_conversion (exp))
11108 exp = TREE_OPERAND (exp, 0);
11112 /* Strip conversions from EXP according to tree_sign_nop_conversion
11113 and return the resulting expression. */
11116 tree_strip_sign_nop_conversions (tree exp)
11118 while (tree_sign_nop_conversion (exp))
11119 exp = TREE_OPERAND (exp, 0);
11123 static GTY(()) tree gcc_eh_personality_decl;
11125 /* Return the GCC personality function decl. */
11128 lhd_gcc_personality (void)
11130 if (!gcc_eh_personality_decl)
11131 gcc_eh_personality_decl = build_personality_function ("gcc");
11132 return gcc_eh_personality_decl;
11135 /* Try to find a base info of BINFO that would have its field decl at offset
11136 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11137 found, return, otherwise return NULL_TREE. */
11140 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
11142 tree type = BINFO_TYPE (binfo);
11146 HOST_WIDE_INT pos, size;
11150 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (expected_type))
11155 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
11157 if (TREE_CODE (fld) != FIELD_DECL)
11160 pos = int_bit_position (fld);
11161 size = tree_low_cst (DECL_SIZE (fld), 1);
11162 if (pos <= offset && (pos + size) > offset)
11165 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
11168 if (!DECL_ARTIFICIAL (fld))
11170 binfo = TYPE_BINFO (TREE_TYPE (fld));
11174 /* Offset 0 indicates the primary base, whose vtable contents are
11175 represented in the binfo for the derived class. */
11176 else if (offset != 0)
11178 tree base_binfo, found_binfo = NULL_TREE;
11179 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
11180 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
11182 found_binfo = base_binfo;
11187 binfo = found_binfo;
11190 type = TREE_TYPE (fld);
11195 /* Returns true if X is a typedef decl. */
11198 is_typedef_decl (tree x)
11200 return (x && TREE_CODE (x) == TYPE_DECL
11201 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
11204 /* Returns true iff TYPE is a type variant created for a typedef. */
11207 typedef_variant_p (tree type)
11209 return is_typedef_decl (TYPE_NAME (type));
11212 /* Warn about a use of an identifier which was marked deprecated. */
11214 warn_deprecated_use (tree node, tree attr)
11218 if (node == 0 || !warn_deprecated_decl)
11224 attr = DECL_ATTRIBUTES (node);
11225 else if (TYPE_P (node))
11227 tree decl = TYPE_STUB_DECL (node);
11229 attr = lookup_attribute ("deprecated",
11230 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
11235 attr = lookup_attribute ("deprecated", attr);
11238 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
11244 expanded_location xloc = expand_location (DECL_SOURCE_LOCATION (node));
11246 warning (OPT_Wdeprecated_declarations,
11247 "%qD is deprecated (declared at %s:%d): %s",
11248 node, xloc.file, xloc.line, msg);
11250 warning (OPT_Wdeprecated_declarations,
11251 "%qD is deprecated (declared at %s:%d)",
11252 node, xloc.file, xloc.line);
11254 else if (TYPE_P (node))
11256 tree what = NULL_TREE;
11257 tree decl = TYPE_STUB_DECL (node);
11259 if (TYPE_NAME (node))
11261 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
11262 what = TYPE_NAME (node);
11263 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
11264 && DECL_NAME (TYPE_NAME (node)))
11265 what = DECL_NAME (TYPE_NAME (node));
11270 expanded_location xloc
11271 = expand_location (DECL_SOURCE_LOCATION (decl));
11275 warning (OPT_Wdeprecated_declarations,
11276 "%qE is deprecated (declared at %s:%d): %s",
11277 what, xloc.file, xloc.line, msg);
11279 warning (OPT_Wdeprecated_declarations,
11280 "%qE is deprecated (declared at %s:%d)", what,
11281 xloc.file, xloc.line);
11286 warning (OPT_Wdeprecated_declarations,
11287 "type is deprecated (declared at %s:%d): %s",
11288 xloc.file, xloc.line, msg);
11290 warning (OPT_Wdeprecated_declarations,
11291 "type is deprecated (declared at %s:%d)",
11292 xloc.file, xloc.line);
11300 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
11303 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
11308 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
11311 warning (OPT_Wdeprecated_declarations, "type is deprecated");
11317 #include "gt-tree.h"