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_VTABLE, 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_VIRTUALS (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 targets
4660 without builtin_decl_explicit support and also builtins are shared
4661 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4662 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
4666 if (TREE_CODE (var) == FUNCTION_DECL
4667 && DECL_BUILT_IN (var))
4668 *nextp = TREE_CHAIN (var);
4670 nextp = &TREE_CHAIN (var);
4676 /* Data used when collecting DECLs and TYPEs for language data removal. */
4678 struct free_lang_data_d
4680 /* Worklist to avoid excessive recursion. */
4681 VEC(tree,heap) *worklist;
4683 /* Set of traversed objects. Used to avoid duplicate visits. */
4684 struct pointer_set_t *pset;
4686 /* Array of symbols to process with free_lang_data_in_decl. */
4687 VEC(tree,heap) *decls;
4689 /* Array of types to process with free_lang_data_in_type. */
4690 VEC(tree,heap) *types;
4694 /* Save all language fields needed to generate proper debug information
4695 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4698 save_debug_info_for_decl (tree t)
4700 /*struct saved_debug_info_d *sdi;*/
4702 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4704 /* FIXME. Partial implementation for saving debug info removed. */
4708 /* Save all language fields needed to generate proper debug information
4709 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4712 save_debug_info_for_type (tree t)
4714 /*struct saved_debug_info_d *sdi;*/
4716 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4718 /* FIXME. Partial implementation for saving debug info removed. */
4722 /* Add type or decl T to one of the list of tree nodes that need their
4723 language data removed. The lists are held inside FLD. */
4726 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4730 VEC_safe_push (tree, heap, fld->decls, t);
4731 if (debug_info_level > DINFO_LEVEL_TERSE)
4732 save_debug_info_for_decl (t);
4734 else if (TYPE_P (t))
4736 VEC_safe_push (tree, heap, fld->types, t);
4737 if (debug_info_level > DINFO_LEVEL_TERSE)
4738 save_debug_info_for_type (t);
4744 /* Push tree node T into FLD->WORKLIST. */
4747 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4749 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4750 VEC_safe_push (tree, heap, fld->worklist, (t));
4754 /* Operand callback helper for free_lang_data_in_node. *TP is the
4755 subtree operand being considered. */
4758 find_decls_types_r (tree *tp, int *ws, void *data)
4761 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4763 if (TREE_CODE (t) == TREE_LIST)
4766 /* Language specific nodes will be removed, so there is no need
4767 to gather anything under them. */
4768 if (is_lang_specific (t))
4776 /* Note that walk_tree does not traverse every possible field in
4777 decls, so we have to do our own traversals here. */
4778 add_tree_to_fld_list (t, fld);
4780 fld_worklist_push (DECL_NAME (t), fld);
4781 fld_worklist_push (DECL_CONTEXT (t), fld);
4782 fld_worklist_push (DECL_SIZE (t), fld);
4783 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4785 /* We are going to remove everything under DECL_INITIAL for
4786 TYPE_DECLs. No point walking them. */
4787 if (TREE_CODE (t) != TYPE_DECL)
4788 fld_worklist_push (DECL_INITIAL (t), fld);
4790 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4791 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4793 if (TREE_CODE (t) == FUNCTION_DECL)
4795 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4796 fld_worklist_push (DECL_RESULT (t), fld);
4798 else if (TREE_CODE (t) == TYPE_DECL)
4800 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4801 fld_worklist_push (DECL_VINDEX (t), fld);
4803 else if (TREE_CODE (t) == FIELD_DECL)
4805 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4806 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4807 fld_worklist_push (DECL_QUALIFIER (t), fld);
4808 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4809 fld_worklist_push (DECL_FCONTEXT (t), fld);
4811 else if (TREE_CODE (t) == VAR_DECL)
4813 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4814 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4817 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4818 && DECL_HAS_VALUE_EXPR_P (t))
4819 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4821 if (TREE_CODE (t) != FIELD_DECL
4822 && TREE_CODE (t) != TYPE_DECL)
4823 fld_worklist_push (TREE_CHAIN (t), fld);
4826 else if (TYPE_P (t))
4828 /* Note that walk_tree does not traverse every possible field in
4829 types, so we have to do our own traversals here. */
4830 add_tree_to_fld_list (t, fld);
4832 if (!RECORD_OR_UNION_TYPE_P (t))
4833 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4834 fld_worklist_push (TYPE_SIZE (t), fld);
4835 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4836 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4837 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4838 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4839 fld_worklist_push (TYPE_NAME (t), fld);
4840 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4841 them and thus do not and want not to reach unused pointer types
4843 if (!POINTER_TYPE_P (t))
4844 fld_worklist_push (TYPE_MINVAL (t), fld);
4845 if (!RECORD_OR_UNION_TYPE_P (t))
4846 fld_worklist_push (TYPE_MAXVAL (t), fld);
4847 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4848 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4849 do not and want not to reach unused variants this way. */
4850 fld_worklist_push (TYPE_CONTEXT (t), fld);
4851 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4852 and want not to reach unused types this way. */
4854 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4858 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4860 fld_worklist_push (TREE_TYPE (tem), fld);
4861 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4863 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4864 && TREE_CODE (tem) == TREE_LIST)
4867 fld_worklist_push (TREE_VALUE (tem), fld);
4868 tem = TREE_CHAIN (tem);
4872 if (RECORD_OR_UNION_TYPE_P (t))
4875 /* Push all TYPE_FIELDS - there can be interleaving interesting
4876 and non-interesting things. */
4877 tem = TYPE_FIELDS (t);
4880 if (TREE_CODE (tem) == FIELD_DECL)
4881 fld_worklist_push (tem, fld);
4882 tem = TREE_CHAIN (tem);
4886 fld_worklist_push (TREE_CHAIN (t), fld);
4889 else if (TREE_CODE (t) == BLOCK)
4892 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4893 fld_worklist_push (tem, fld);
4894 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4895 fld_worklist_push (tem, fld);
4896 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4899 if (TREE_CODE (t) != IDENTIFIER_NODE
4900 && CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_TYPED))
4901 fld_worklist_push (TREE_TYPE (t), fld);
4907 /* Find decls and types in T. */
4910 find_decls_types (tree t, struct free_lang_data_d *fld)
4914 if (!pointer_set_contains (fld->pset, t))
4915 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4916 if (VEC_empty (tree, fld->worklist))
4918 t = VEC_pop (tree, fld->worklist);
4922 /* Translate all the types in LIST with the corresponding runtime
4926 get_eh_types_for_runtime (tree list)
4930 if (list == NULL_TREE)
4933 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4935 list = TREE_CHAIN (list);
4938 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4939 TREE_CHAIN (prev) = n;
4940 prev = TREE_CHAIN (prev);
4941 list = TREE_CHAIN (list);
4948 /* Find decls and types referenced in EH region R and store them in
4949 FLD->DECLS and FLD->TYPES. */
4952 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4963 /* The types referenced in each catch must first be changed to the
4964 EH types used at runtime. This removes references to FE types
4966 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4968 c->type_list = get_eh_types_for_runtime (c->type_list);
4969 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4974 case ERT_ALLOWED_EXCEPTIONS:
4975 r->u.allowed.type_list
4976 = get_eh_types_for_runtime (r->u.allowed.type_list);
4977 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4980 case ERT_MUST_NOT_THROW:
4981 walk_tree (&r->u.must_not_throw.failure_decl,
4982 find_decls_types_r, fld, fld->pset);
4988 /* Find decls and types referenced in cgraph node N and store them in
4989 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4990 look for *every* kind of DECL and TYPE node reachable from N,
4991 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4992 NAMESPACE_DECLs, etc). */
4995 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4998 struct function *fn;
5002 find_decls_types (n->decl, fld);
5004 if (!gimple_has_body_p (n->decl))
5007 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
5009 fn = DECL_STRUCT_FUNCTION (n->decl);
5011 /* Traverse locals. */
5012 FOR_EACH_LOCAL_DECL (fn, ix, t)
5013 find_decls_types (t, fld);
5015 /* Traverse EH regions in FN. */
5018 FOR_ALL_EH_REGION_FN (r, fn)
5019 find_decls_types_in_eh_region (r, fld);
5022 /* Traverse every statement in FN. */
5023 FOR_EACH_BB_FN (bb, fn)
5025 gimple_stmt_iterator si;
5028 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
5030 gimple phi = gsi_stmt (si);
5032 for (i = 0; i < gimple_phi_num_args (phi); i++)
5034 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
5035 find_decls_types (*arg_p, fld);
5039 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5041 gimple stmt = gsi_stmt (si);
5043 for (i = 0; i < gimple_num_ops (stmt); i++)
5045 tree arg = gimple_op (stmt, i);
5046 find_decls_types (arg, fld);
5053 /* Find decls and types referenced in varpool node N and store them in
5054 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5055 look for *every* kind of DECL and TYPE node reachable from N,
5056 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5057 NAMESPACE_DECLs, etc). */
5060 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
5062 find_decls_types (v->decl, fld);
5065 /* If T needs an assembler name, have one created for it. */
5068 assign_assembler_name_if_neeeded (tree t)
5070 if (need_assembler_name_p (t))
5072 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5073 diagnostics that use input_location to show locus
5074 information. The problem here is that, at this point,
5075 input_location is generally anchored to the end of the file
5076 (since the parser is long gone), so we don't have a good
5077 position to pin it to.
5079 To alleviate this problem, this uses the location of T's
5080 declaration. Examples of this are
5081 testsuite/g++.dg/template/cond2.C and
5082 testsuite/g++.dg/template/pr35240.C. */
5083 location_t saved_location = input_location;
5084 input_location = DECL_SOURCE_LOCATION (t);
5086 decl_assembler_name (t);
5088 input_location = saved_location;
5093 /* Free language specific information for every operand and expression
5094 in every node of the call graph. This process operates in three stages:
5096 1- Every callgraph node and varpool node is traversed looking for
5097 decls and types embedded in them. This is a more exhaustive
5098 search than that done by find_referenced_vars, because it will
5099 also collect individual fields, decls embedded in types, etc.
5101 2- All the decls found are sent to free_lang_data_in_decl.
5103 3- All the types found are sent to free_lang_data_in_type.
5105 The ordering between decls and types is important because
5106 free_lang_data_in_decl sets assembler names, which includes
5107 mangling. So types cannot be freed up until assembler names have
5111 free_lang_data_in_cgraph (void)
5113 struct cgraph_node *n;
5114 struct varpool_node *v;
5115 struct free_lang_data_d fld;
5120 /* Initialize sets and arrays to store referenced decls and types. */
5121 fld.pset = pointer_set_create ();
5122 fld.worklist = NULL;
5123 fld.decls = VEC_alloc (tree, heap, 100);
5124 fld.types = VEC_alloc (tree, heap, 100);
5126 /* Find decls and types in the body of every function in the callgraph. */
5127 for (n = cgraph_nodes; n; n = n->next)
5128 find_decls_types_in_node (n, &fld);
5130 FOR_EACH_VEC_ELT (alias_pair, alias_pairs, i, p)
5131 find_decls_types (p->decl, &fld);
5133 /* Find decls and types in every varpool symbol. */
5134 for (v = varpool_nodes; v; v = v->next)
5135 find_decls_types_in_var (v, &fld);
5137 /* Set the assembler name on every decl found. We need to do this
5138 now because free_lang_data_in_decl will invalidate data needed
5139 for mangling. This breaks mangling on interdependent decls. */
5140 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5141 assign_assembler_name_if_neeeded (t);
5143 /* Traverse every decl found freeing its language data. */
5144 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5145 free_lang_data_in_decl (t);
5147 /* Traverse every type found freeing its language data. */
5148 FOR_EACH_VEC_ELT (tree, fld.types, i, t)
5149 free_lang_data_in_type (t);
5151 pointer_set_destroy (fld.pset);
5152 VEC_free (tree, heap, fld.worklist);
5153 VEC_free (tree, heap, fld.decls);
5154 VEC_free (tree, heap, fld.types);
5158 /* Free resources that are used by FE but are not needed once they are done. */
5161 free_lang_data (void)
5165 /* If we are the LTO frontend we have freed lang-specific data already. */
5167 || !flag_generate_lto)
5170 /* Allocate and assign alias sets to the standard integer types
5171 while the slots are still in the way the frontends generated them. */
5172 for (i = 0; i < itk_none; ++i)
5173 if (integer_types[i])
5174 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5176 /* Traverse the IL resetting language specific information for
5177 operands, expressions, etc. */
5178 free_lang_data_in_cgraph ();
5180 /* Create gimple variants for common types. */
5181 ptrdiff_type_node = integer_type_node;
5182 fileptr_type_node = ptr_type_node;
5184 /* Reset some langhooks. Do not reset types_compatible_p, it may
5185 still be used indirectly via the get_alias_set langhook. */
5186 lang_hooks.callgraph.analyze_expr = NULL;
5187 lang_hooks.dwarf_name = lhd_dwarf_name;
5188 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5189 /* We do not want the default decl_assembler_name implementation,
5190 rather if we have fixed everything we want a wrapper around it
5191 asserting that all non-local symbols already got their assembler
5192 name and only produce assembler names for local symbols. Or rather
5193 make sure we never call decl_assembler_name on local symbols and
5194 devise a separate, middle-end private scheme for it. */
5196 /* Reset diagnostic machinery. */
5197 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5198 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5199 diagnostic_format_decoder (global_dc) = default_tree_printer;
5205 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5209 "*free_lang_data", /* name */
5211 free_lang_data, /* execute */
5214 0, /* static_pass_number */
5215 TV_IPA_FREE_LANG_DATA, /* tv_id */
5216 0, /* properties_required */
5217 0, /* properties_provided */
5218 0, /* properties_destroyed */
5219 0, /* todo_flags_start */
5220 TODO_ggc_collect /* todo_flags_finish */
5224 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5225 ATTR_NAME. Also used internally by remove_attribute(). */
5227 private_is_attribute_p (const char *attr_name, size_t attr_len, const_tree ident)
5229 size_t ident_len = IDENTIFIER_LENGTH (ident);
5231 if (ident_len == attr_len)
5233 if (strcmp (attr_name, IDENTIFIER_POINTER (ident)) == 0)
5236 else if (ident_len == attr_len + 4)
5238 /* There is the possibility that ATTR is 'text' and IDENT is
5240 const char *p = IDENTIFIER_POINTER (ident);
5241 if (p[0] == '_' && p[1] == '_'
5242 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5243 && strncmp (attr_name, p + 2, attr_len) == 0)
5250 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5251 of ATTR_NAME, and LIST is not NULL_TREE. */
5253 private_lookup_attribute (const char *attr_name, size_t attr_len, tree list)
5257 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5259 if (ident_len == attr_len)
5261 if (strcmp (attr_name, IDENTIFIER_POINTER (TREE_PURPOSE (list))) == 0)
5264 /* TODO: If we made sure that attributes were stored in the
5265 canonical form without '__...__' (ie, as in 'text' as opposed
5266 to '__text__') then we could avoid the following case. */
5267 else if (ident_len == attr_len + 4)
5269 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5270 if (p[0] == '_' && p[1] == '_'
5271 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5272 && strncmp (attr_name, p + 2, attr_len) == 0)
5275 list = TREE_CHAIN (list);
5281 /* A variant of lookup_attribute() that can be used with an identifier
5282 as the first argument, and where the identifier can be either
5283 'text' or '__text__'.
5285 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5286 return a pointer to the attribute's list element if the attribute
5287 is part of the list, or NULL_TREE if not found. If the attribute
5288 appears more than once, this only returns the first occurrence; the
5289 TREE_CHAIN of the return value should be passed back in if further
5290 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5291 can be in the form 'text' or '__text__'. */
5293 lookup_ident_attribute (tree attr_identifier, tree list)
5295 gcc_checking_assert (TREE_CODE (attr_identifier) == IDENTIFIER_NODE);
5299 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list)) == IDENTIFIER_NODE);
5301 /* Identifiers can be compared directly for equality. */
5302 if (attr_identifier == TREE_PURPOSE (list))
5305 /* If they are not equal, they may still be one in the form
5306 'text' while the other one is in the form '__text__'. TODO:
5307 If we were storing attributes in normalized 'text' form, then
5308 this could all go away and we could take full advantage of
5309 the fact that we're comparing identifiers. :-) */
5311 size_t attr_len = IDENTIFIER_LENGTH (attr_identifier);
5312 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5314 if (ident_len == attr_len + 4)
5316 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5317 const char *q = IDENTIFIER_POINTER (attr_identifier);
5318 if (p[0] == '_' && p[1] == '_'
5319 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5320 && strncmp (q, p + 2, attr_len) == 0)
5323 else if (ident_len + 4 == attr_len)
5325 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5326 const char *q = IDENTIFIER_POINTER (attr_identifier);
5327 if (q[0] == '_' && q[1] == '_'
5328 && q[attr_len - 2] == '_' && q[attr_len - 1] == '_'
5329 && strncmp (q + 2, p, ident_len) == 0)
5333 list = TREE_CHAIN (list);
5339 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5343 remove_attribute (const char *attr_name, tree list)
5346 size_t attr_len = strlen (attr_name);
5348 gcc_checking_assert (attr_name[0] != '_');
5350 for (p = &list; *p; )
5353 /* TODO: If we were storing attributes in normalized form, here
5354 we could use a simple strcmp(). */
5355 if (private_is_attribute_p (attr_name, attr_len, TREE_PURPOSE (l)))
5356 *p = TREE_CHAIN (l);
5358 p = &TREE_CHAIN (l);
5364 /* Return an attribute list that is the union of a1 and a2. */
5367 merge_attributes (tree a1, tree a2)
5371 /* Either one unset? Take the set one. */
5373 if ((attributes = a1) == 0)
5376 /* One that completely contains the other? Take it. */
5378 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5380 if (attribute_list_contained (a2, a1))
5384 /* Pick the longest list, and hang on the other list. */
5386 if (list_length (a1) < list_length (a2))
5387 attributes = a2, a2 = a1;
5389 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5392 for (a = lookup_ident_attribute (TREE_PURPOSE (a2), attributes);
5393 a != NULL_TREE && !attribute_value_equal (a, a2);
5394 a = lookup_ident_attribute (TREE_PURPOSE (a2), TREE_CHAIN (a)))
5398 a1 = copy_node (a2);
5399 TREE_CHAIN (a1) = attributes;
5408 /* Given types T1 and T2, merge their attributes and return
5412 merge_type_attributes (tree t1, tree t2)
5414 return merge_attributes (TYPE_ATTRIBUTES (t1),
5415 TYPE_ATTRIBUTES (t2));
5418 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5422 merge_decl_attributes (tree olddecl, tree newdecl)
5424 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5425 DECL_ATTRIBUTES (newdecl));
5428 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5430 /* Specialization of merge_decl_attributes for various Windows targets.
5432 This handles the following situation:
5434 __declspec (dllimport) int foo;
5437 The second instance of `foo' nullifies the dllimport. */
5440 merge_dllimport_decl_attributes (tree old, tree new_tree)
5443 int delete_dllimport_p = 1;
5445 /* What we need to do here is remove from `old' dllimport if it doesn't
5446 appear in `new'. dllimport behaves like extern: if a declaration is
5447 marked dllimport and a definition appears later, then the object
5448 is not dllimport'd. We also remove a `new' dllimport if the old list
5449 contains dllexport: dllexport always overrides dllimport, regardless
5450 of the order of declaration. */
5451 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5452 delete_dllimport_p = 0;
5453 else if (DECL_DLLIMPORT_P (new_tree)
5454 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5456 DECL_DLLIMPORT_P (new_tree) = 0;
5457 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5458 "dllimport ignored", new_tree);
5460 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5462 /* Warn about overriding a symbol that has already been used, e.g.:
5463 extern int __attribute__ ((dllimport)) foo;
5464 int* bar () {return &foo;}
5467 if (TREE_USED (old))
5469 warning (0, "%q+D redeclared without dllimport attribute "
5470 "after being referenced with dll linkage", new_tree);
5471 /* If we have used a variable's address with dllimport linkage,
5472 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5473 decl may already have had TREE_CONSTANT computed.
5474 We still remove the attribute so that assembler code refers
5475 to '&foo rather than '_imp__foo'. */
5476 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5477 DECL_DLLIMPORT_P (new_tree) = 1;
5480 /* Let an inline definition silently override the external reference,
5481 but otherwise warn about attribute inconsistency. */
5482 else if (TREE_CODE (new_tree) == VAR_DECL
5483 || !DECL_DECLARED_INLINE_P (new_tree))
5484 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5485 "previous dllimport ignored", new_tree);
5488 delete_dllimport_p = 0;
5490 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5492 if (delete_dllimport_p)
5493 a = remove_attribute ("dllimport", a);
5498 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5499 struct attribute_spec.handler. */
5502 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5508 /* These attributes may apply to structure and union types being created,
5509 but otherwise should pass to the declaration involved. */
5512 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5513 | (int) ATTR_FLAG_ARRAY_NEXT))
5515 *no_add_attrs = true;
5516 return tree_cons (name, args, NULL_TREE);
5518 if (TREE_CODE (node) == RECORD_TYPE
5519 || TREE_CODE (node) == UNION_TYPE)
5521 node = TYPE_NAME (node);
5527 warning (OPT_Wattributes, "%qE attribute ignored",
5529 *no_add_attrs = true;
5534 if (TREE_CODE (node) != FUNCTION_DECL
5535 && TREE_CODE (node) != VAR_DECL
5536 && TREE_CODE (node) != TYPE_DECL)
5538 *no_add_attrs = true;
5539 warning (OPT_Wattributes, "%qE attribute ignored",
5544 if (TREE_CODE (node) == TYPE_DECL
5545 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5546 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5548 *no_add_attrs = true;
5549 warning (OPT_Wattributes, "%qE attribute ignored",
5554 is_dllimport = is_attribute_p ("dllimport", name);
5556 /* Report error on dllimport ambiguities seen now before they cause
5560 /* Honor any target-specific overrides. */
5561 if (!targetm.valid_dllimport_attribute_p (node))
5562 *no_add_attrs = true;
5564 else if (TREE_CODE (node) == FUNCTION_DECL
5565 && DECL_DECLARED_INLINE_P (node))
5567 warning (OPT_Wattributes, "inline function %q+D declared as "
5568 " dllimport: attribute ignored", node);
5569 *no_add_attrs = true;
5571 /* Like MS, treat definition of dllimported variables and
5572 non-inlined functions on declaration as syntax errors. */
5573 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5575 error ("function %q+D definition is marked dllimport", node);
5576 *no_add_attrs = true;
5579 else if (TREE_CODE (node) == VAR_DECL)
5581 if (DECL_INITIAL (node))
5583 error ("variable %q+D definition is marked dllimport",
5585 *no_add_attrs = true;
5588 /* `extern' needn't be specified with dllimport.
5589 Specify `extern' now and hope for the best. Sigh. */
5590 DECL_EXTERNAL (node) = 1;
5591 /* Also, implicitly give dllimport'd variables declared within
5592 a function global scope, unless declared static. */
5593 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5594 TREE_PUBLIC (node) = 1;
5597 if (*no_add_attrs == false)
5598 DECL_DLLIMPORT_P (node) = 1;
5600 else if (TREE_CODE (node) == FUNCTION_DECL
5601 && DECL_DECLARED_INLINE_P (node)
5602 && flag_keep_inline_dllexport)
5603 /* An exported function, even if inline, must be emitted. */
5604 DECL_EXTERNAL (node) = 0;
5606 /* Report error if symbol is not accessible at global scope. */
5607 if (!TREE_PUBLIC (node)
5608 && (TREE_CODE (node) == VAR_DECL
5609 || TREE_CODE (node) == FUNCTION_DECL))
5611 error ("external linkage required for symbol %q+D because of "
5612 "%qE attribute", node, name);
5613 *no_add_attrs = true;
5616 /* A dllexport'd entity must have default visibility so that other
5617 program units (shared libraries or the main executable) can see
5618 it. A dllimport'd entity must have default visibility so that
5619 the linker knows that undefined references within this program
5620 unit can be resolved by the dynamic linker. */
5623 if (DECL_VISIBILITY_SPECIFIED (node)
5624 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5625 error ("%qE implies default visibility, but %qD has already "
5626 "been declared with a different visibility",
5628 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5629 DECL_VISIBILITY_SPECIFIED (node) = 1;
5635 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5637 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5638 of the various TYPE_QUAL values. */
5641 set_type_quals (tree type, int type_quals)
5643 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5644 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5645 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5646 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5649 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5652 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5654 return (TYPE_QUALS (cand) == type_quals
5655 && TYPE_NAME (cand) == TYPE_NAME (base)
5656 /* Apparently this is needed for Objective-C. */
5657 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5658 /* Check alignment. */
5659 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
5660 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5661 TYPE_ATTRIBUTES (base)));
5664 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5667 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
5669 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
5670 && TYPE_NAME (cand) == TYPE_NAME (base)
5671 /* Apparently this is needed for Objective-C. */
5672 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5673 /* Check alignment. */
5674 && TYPE_ALIGN (cand) == align
5675 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5676 TYPE_ATTRIBUTES (base)));
5679 /* Return a version of the TYPE, qualified as indicated by the
5680 TYPE_QUALS, if one exists. If no qualified version exists yet,
5681 return NULL_TREE. */
5684 get_qualified_type (tree type, int type_quals)
5688 if (TYPE_QUALS (type) == type_quals)
5691 /* Search the chain of variants to see if there is already one there just
5692 like the one we need to have. If so, use that existing one. We must
5693 preserve the TYPE_NAME, since there is code that depends on this. */
5694 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5695 if (check_qualified_type (t, type, type_quals))
5701 /* Like get_qualified_type, but creates the type if it does not
5702 exist. This function never returns NULL_TREE. */
5705 build_qualified_type (tree type, int type_quals)
5709 /* See if we already have the appropriate qualified variant. */
5710 t = get_qualified_type (type, type_quals);
5712 /* If not, build it. */
5715 t = build_variant_type_copy (type);
5716 set_type_quals (t, type_quals);
5718 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5719 /* Propagate structural equality. */
5720 SET_TYPE_STRUCTURAL_EQUALITY (t);
5721 else if (TYPE_CANONICAL (type) != type)
5722 /* Build the underlying canonical type, since it is different
5724 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5727 /* T is its own canonical type. */
5728 TYPE_CANONICAL (t) = t;
5735 /* Create a variant of type T with alignment ALIGN. */
5738 build_aligned_type (tree type, unsigned int align)
5742 if (TYPE_PACKED (type)
5743 || TYPE_ALIGN (type) == align)
5746 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5747 if (check_aligned_type (t, type, align))
5750 t = build_variant_type_copy (type);
5751 TYPE_ALIGN (t) = align;
5756 /* Create a new distinct copy of TYPE. The new type is made its own
5757 MAIN_VARIANT. If TYPE requires structural equality checks, the
5758 resulting type requires structural equality checks; otherwise, its
5759 TYPE_CANONICAL points to itself. */
5762 build_distinct_type_copy (tree type)
5764 tree t = copy_node (type);
5766 TYPE_POINTER_TO (t) = 0;
5767 TYPE_REFERENCE_TO (t) = 0;
5769 /* Set the canonical type either to a new equivalence class, or
5770 propagate the need for structural equality checks. */
5771 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5772 SET_TYPE_STRUCTURAL_EQUALITY (t);
5774 TYPE_CANONICAL (t) = t;
5776 /* Make it its own variant. */
5777 TYPE_MAIN_VARIANT (t) = t;
5778 TYPE_NEXT_VARIANT (t) = 0;
5780 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5781 whose TREE_TYPE is not t. This can also happen in the Ada
5782 frontend when using subtypes. */
5787 /* Create a new variant of TYPE, equivalent but distinct. This is so
5788 the caller can modify it. TYPE_CANONICAL for the return type will
5789 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5790 are considered equal by the language itself (or that both types
5791 require structural equality checks). */
5794 build_variant_type_copy (tree type)
5796 tree t, m = TYPE_MAIN_VARIANT (type);
5798 t = build_distinct_type_copy (type);
5800 /* Since we're building a variant, assume that it is a non-semantic
5801 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5802 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5804 /* Add the new type to the chain of variants of TYPE. */
5805 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5806 TYPE_NEXT_VARIANT (m) = t;
5807 TYPE_MAIN_VARIANT (t) = m;
5812 /* Return true if the from tree in both tree maps are equal. */
5815 tree_map_base_eq (const void *va, const void *vb)
5817 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5818 *const b = (const struct tree_map_base *) vb;
5819 return (a->from == b->from);
5822 /* Hash a from tree in a tree_base_map. */
5825 tree_map_base_hash (const void *item)
5827 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5830 /* Return true if this tree map structure is marked for garbage collection
5831 purposes. We simply return true if the from tree is marked, so that this
5832 structure goes away when the from tree goes away. */
5835 tree_map_base_marked_p (const void *p)
5837 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5840 /* Hash a from tree in a tree_map. */
5843 tree_map_hash (const void *item)
5845 return (((const struct tree_map *) item)->hash);
5848 /* Hash a from tree in a tree_decl_map. */
5851 tree_decl_map_hash (const void *item)
5853 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
5856 /* Return the initialization priority for DECL. */
5859 decl_init_priority_lookup (tree decl)
5861 struct tree_priority_map *h;
5862 struct tree_map_base in;
5864 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5866 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5867 return h ? h->init : DEFAULT_INIT_PRIORITY;
5870 /* Return the finalization priority for DECL. */
5873 decl_fini_priority_lookup (tree decl)
5875 struct tree_priority_map *h;
5876 struct tree_map_base in;
5878 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5880 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5881 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5884 /* Return the initialization and finalization priority information for
5885 DECL. If there is no previous priority information, a freshly
5886 allocated structure is returned. */
5888 static struct tree_priority_map *
5889 decl_priority_info (tree decl)
5891 struct tree_priority_map in;
5892 struct tree_priority_map *h;
5895 in.base.from = decl;
5896 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5897 h = (struct tree_priority_map *) *loc;
5900 h = ggc_alloc_cleared_tree_priority_map ();
5902 h->base.from = decl;
5903 h->init = DEFAULT_INIT_PRIORITY;
5904 h->fini = DEFAULT_INIT_PRIORITY;
5910 /* Set the initialization priority for DECL to PRIORITY. */
5913 decl_init_priority_insert (tree decl, priority_type priority)
5915 struct tree_priority_map *h;
5917 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5918 if (priority == DEFAULT_INIT_PRIORITY)
5920 h = decl_priority_info (decl);
5924 /* Set the finalization priority for DECL to PRIORITY. */
5927 decl_fini_priority_insert (tree decl, priority_type priority)
5929 struct tree_priority_map *h;
5931 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5932 if (priority == DEFAULT_INIT_PRIORITY)
5934 h = decl_priority_info (decl);
5938 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5941 print_debug_expr_statistics (void)
5943 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5944 (long) htab_size (debug_expr_for_decl),
5945 (long) htab_elements (debug_expr_for_decl),
5946 htab_collisions (debug_expr_for_decl));
5949 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5952 print_value_expr_statistics (void)
5954 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5955 (long) htab_size (value_expr_for_decl),
5956 (long) htab_elements (value_expr_for_decl),
5957 htab_collisions (value_expr_for_decl));
5960 /* Lookup a debug expression for FROM, and return it if we find one. */
5963 decl_debug_expr_lookup (tree from)
5965 struct tree_decl_map *h, in;
5966 in.base.from = from;
5968 h = (struct tree_decl_map *)
5969 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
5975 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5978 decl_debug_expr_insert (tree from, tree to)
5980 struct tree_decl_map *h;
5983 h = ggc_alloc_tree_decl_map ();
5984 h->base.from = from;
5986 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
5988 *(struct tree_decl_map **) loc = h;
5991 /* Lookup a value expression for FROM, and return it if we find one. */
5994 decl_value_expr_lookup (tree from)
5996 struct tree_decl_map *h, in;
5997 in.base.from = from;
5999 h = (struct tree_decl_map *)
6000 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
6006 /* Insert a mapping FROM->TO in the value expression hashtable. */
6009 decl_value_expr_insert (tree from, tree to)
6011 struct tree_decl_map *h;
6014 h = ggc_alloc_tree_decl_map ();
6015 h->base.from = from;
6017 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
6019 *(struct tree_decl_map **) loc = h;
6022 /* Lookup a vector of debug arguments for FROM, and return it if we
6026 decl_debug_args_lookup (tree from)
6028 struct tree_vec_map *h, in;
6030 if (!DECL_HAS_DEBUG_ARGS_P (from))
6032 gcc_checking_assert (debug_args_for_decl != NULL);
6033 in.base.from = from;
6034 h = (struct tree_vec_map *)
6035 htab_find_with_hash (debug_args_for_decl, &in, DECL_UID (from));
6041 /* Insert a mapping FROM->empty vector of debug arguments in the value
6042 expression hashtable. */
6045 decl_debug_args_insert (tree from)
6047 struct tree_vec_map *h;
6050 if (DECL_HAS_DEBUG_ARGS_P (from))
6051 return decl_debug_args_lookup (from);
6052 if (debug_args_for_decl == NULL)
6053 debug_args_for_decl = htab_create_ggc (64, tree_vec_map_hash,
6054 tree_vec_map_eq, 0);
6055 h = ggc_alloc_tree_vec_map ();
6056 h->base.from = from;
6058 loc = htab_find_slot_with_hash (debug_args_for_decl, h, DECL_UID (from),
6060 *(struct tree_vec_map **) loc = h;
6061 DECL_HAS_DEBUG_ARGS_P (from) = 1;
6065 /* Hashing of types so that we don't make duplicates.
6066 The entry point is `type_hash_canon'. */
6068 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6069 with types in the TREE_VALUE slots), by adding the hash codes
6070 of the individual types. */
6073 type_hash_list (const_tree list, hashval_t hashcode)
6077 for (tail = list; tail; tail = TREE_CHAIN (tail))
6078 if (TREE_VALUE (tail) != error_mark_node)
6079 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
6085 /* These are the Hashtable callback functions. */
6087 /* Returns true iff the types are equivalent. */
6090 type_hash_eq (const void *va, const void *vb)
6092 const struct type_hash *const a = (const struct type_hash *) va,
6093 *const b = (const struct type_hash *) vb;
6095 /* First test the things that are the same for all types. */
6096 if (a->hash != b->hash
6097 || TREE_CODE (a->type) != TREE_CODE (b->type)
6098 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
6099 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
6100 TYPE_ATTRIBUTES (b->type))
6101 || (TREE_CODE (a->type) != COMPLEX_TYPE
6102 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
6105 /* Be careful about comparing arrays before and after the element type
6106 has been completed; don't compare TYPE_ALIGN unless both types are
6108 if (COMPLETE_TYPE_P (a->type) && COMPLETE_TYPE_P (b->type)
6109 && (TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
6110 || TYPE_MODE (a->type) != TYPE_MODE (b->type)))
6113 switch (TREE_CODE (a->type))
6118 case REFERENCE_TYPE:
6122 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
6125 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
6126 && !(TYPE_VALUES (a->type)
6127 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
6128 && TYPE_VALUES (b->type)
6129 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
6130 && type_list_equal (TYPE_VALUES (a->type),
6131 TYPE_VALUES (b->type))))
6134 /* ... fall through ... */
6139 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
6140 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
6141 TYPE_MAX_VALUE (b->type)))
6142 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
6143 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
6144 TYPE_MIN_VALUE (b->type))));
6146 case FIXED_POINT_TYPE:
6147 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
6150 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
6153 if (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
6154 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6155 || (TYPE_ARG_TYPES (a->type)
6156 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6157 && TYPE_ARG_TYPES (b->type)
6158 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6159 && type_list_equal (TYPE_ARG_TYPES (a->type),
6160 TYPE_ARG_TYPES (b->type)))))
6164 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
6168 case QUAL_UNION_TYPE:
6169 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
6170 || (TYPE_FIELDS (a->type)
6171 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
6172 && TYPE_FIELDS (b->type)
6173 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
6174 && type_list_equal (TYPE_FIELDS (a->type),
6175 TYPE_FIELDS (b->type))));
6178 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6179 || (TYPE_ARG_TYPES (a->type)
6180 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6181 && TYPE_ARG_TYPES (b->type)
6182 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6183 && type_list_equal (TYPE_ARG_TYPES (a->type),
6184 TYPE_ARG_TYPES (b->type))))
6192 if (lang_hooks.types.type_hash_eq != NULL)
6193 return lang_hooks.types.type_hash_eq (a->type, b->type);
6198 /* Return the cached hash value. */
6201 type_hash_hash (const void *item)
6203 return ((const struct type_hash *) item)->hash;
6206 /* Look in the type hash table for a type isomorphic to TYPE.
6207 If one is found, return it. Otherwise return 0. */
6210 type_hash_lookup (hashval_t hashcode, tree type)
6212 struct type_hash *h, in;
6214 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6215 must call that routine before comparing TYPE_ALIGNs. */
6221 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6228 /* Add an entry to the type-hash-table
6229 for a type TYPE whose hash code is HASHCODE. */
6232 type_hash_add (hashval_t hashcode, tree type)
6234 struct type_hash *h;
6237 h = ggc_alloc_type_hash ();
6240 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6244 /* Given TYPE, and HASHCODE its hash code, return the canonical
6245 object for an identical type if one already exists.
6246 Otherwise, return TYPE, and record it as the canonical object.
6248 To use this function, first create a type of the sort you want.
6249 Then compute its hash code from the fields of the type that
6250 make it different from other similar types.
6251 Then call this function and use the value. */
6254 type_hash_canon (unsigned int hashcode, tree type)
6258 /* The hash table only contains main variants, so ensure that's what we're
6260 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6262 /* See if the type is in the hash table already. If so, return it.
6263 Otherwise, add the type. */
6264 t1 = type_hash_lookup (hashcode, type);
6267 #ifdef GATHER_STATISTICS
6268 tree_code_counts[(int) TREE_CODE (type)]--;
6269 tree_node_counts[(int) t_kind]--;
6270 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type_non_common);
6276 type_hash_add (hashcode, type);
6281 /* See if the data pointed to by the type hash table is marked. We consider
6282 it marked if the type is marked or if a debug type number or symbol
6283 table entry has been made for the type. */
6286 type_hash_marked_p (const void *p)
6288 const_tree const type = ((const struct type_hash *) p)->type;
6290 return ggc_marked_p (type);
6294 print_type_hash_statistics (void)
6296 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6297 (long) htab_size (type_hash_table),
6298 (long) htab_elements (type_hash_table),
6299 htab_collisions (type_hash_table));
6302 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6303 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6304 by adding the hash codes of the individual attributes. */
6307 attribute_hash_list (const_tree list, hashval_t hashcode)
6311 for (tail = list; tail; tail = TREE_CHAIN (tail))
6312 /* ??? Do we want to add in TREE_VALUE too? */
6313 hashcode = iterative_hash_object
6314 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6318 /* Given two lists of attributes, return true if list l2 is
6319 equivalent to l1. */
6322 attribute_list_equal (const_tree l1, const_tree l2)
6327 return attribute_list_contained (l1, l2)
6328 && attribute_list_contained (l2, l1);
6331 /* Given two lists of attributes, return true if list L2 is
6332 completely contained within L1. */
6333 /* ??? This would be faster if attribute names were stored in a canonicalized
6334 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6335 must be used to show these elements are equivalent (which they are). */
6336 /* ??? It's not clear that attributes with arguments will always be handled
6340 attribute_list_contained (const_tree l1, const_tree l2)
6344 /* First check the obvious, maybe the lists are identical. */
6348 /* Maybe the lists are similar. */
6349 for (t1 = l1, t2 = l2;
6351 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6352 && TREE_VALUE (t1) == TREE_VALUE (t2);
6353 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6356 /* Maybe the lists are equal. */
6357 if (t1 == 0 && t2 == 0)
6360 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6363 /* This CONST_CAST is okay because lookup_attribute does not
6364 modify its argument and the return value is assigned to a
6366 for (attr = lookup_ident_attribute (TREE_PURPOSE (t2), CONST_CAST_TREE(l1));
6367 attr != NULL_TREE && !attribute_value_equal (t2, attr);
6368 attr = lookup_ident_attribute (TREE_PURPOSE (t2), TREE_CHAIN (attr)))
6371 if (attr == NULL_TREE)
6378 /* Given two lists of types
6379 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6380 return 1 if the lists contain the same types in the same order.
6381 Also, the TREE_PURPOSEs must match. */
6384 type_list_equal (const_tree l1, const_tree l2)
6388 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6389 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6390 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6391 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6392 && (TREE_TYPE (TREE_PURPOSE (t1))
6393 == TREE_TYPE (TREE_PURPOSE (t2))))))
6399 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6400 given by TYPE. If the argument list accepts variable arguments,
6401 then this function counts only the ordinary arguments. */
6404 type_num_arguments (const_tree type)
6409 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6410 /* If the function does not take a variable number of arguments,
6411 the last element in the list will have type `void'. */
6412 if (VOID_TYPE_P (TREE_VALUE (t)))
6420 /* Nonzero if integer constants T1 and T2
6421 represent the same constant value. */
6424 tree_int_cst_equal (const_tree t1, const_tree t2)
6429 if (t1 == 0 || t2 == 0)
6432 if (TREE_CODE (t1) == INTEGER_CST
6433 && TREE_CODE (t2) == INTEGER_CST
6434 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6435 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6441 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6442 The precise way of comparison depends on their data type. */
6445 tree_int_cst_lt (const_tree t1, const_tree t2)
6450 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6452 int t1_sgn = tree_int_cst_sgn (t1);
6453 int t2_sgn = tree_int_cst_sgn (t2);
6455 if (t1_sgn < t2_sgn)
6457 else if (t1_sgn > t2_sgn)
6459 /* Otherwise, both are non-negative, so we compare them as
6460 unsigned just in case one of them would overflow a signed
6463 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6464 return INT_CST_LT (t1, t2);
6466 return INT_CST_LT_UNSIGNED (t1, t2);
6469 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6472 tree_int_cst_compare (const_tree t1, const_tree t2)
6474 if (tree_int_cst_lt (t1, t2))
6476 else if (tree_int_cst_lt (t2, t1))
6482 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6483 the host. If POS is zero, the value can be represented in a single
6484 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6485 be represented in a single unsigned HOST_WIDE_INT. */
6488 host_integerp (const_tree t, int pos)
6493 return (TREE_CODE (t) == INTEGER_CST
6494 && ((TREE_INT_CST_HIGH (t) == 0
6495 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6496 || (! pos && TREE_INT_CST_HIGH (t) == -1
6497 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6498 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6499 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6500 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6501 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6504 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6505 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6506 be non-negative. We must be able to satisfy the above conditions. */
6509 tree_low_cst (const_tree t, int pos)
6511 gcc_assert (host_integerp (t, pos));
6512 return TREE_INT_CST_LOW (t);
6515 /* Return the most significant (sign) bit of T. */
6518 tree_int_cst_sign_bit (const_tree t)
6520 unsigned bitno = TYPE_PRECISION (TREE_TYPE (t)) - 1;
6521 unsigned HOST_WIDE_INT w;
6523 if (bitno < HOST_BITS_PER_WIDE_INT)
6524 w = TREE_INT_CST_LOW (t);
6527 w = TREE_INT_CST_HIGH (t);
6528 bitno -= HOST_BITS_PER_WIDE_INT;
6531 return (w >> bitno) & 1;
6534 /* Return an indication of the sign of the integer constant T.
6535 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6536 Note that -1 will never be returned if T's type is unsigned. */
6539 tree_int_cst_sgn (const_tree t)
6541 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6543 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6545 else if (TREE_INT_CST_HIGH (t) < 0)
6551 /* Return the minimum number of bits needed to represent VALUE in a
6552 signed or unsigned type, UNSIGNEDP says which. */
6555 tree_int_cst_min_precision (tree value, bool unsignedp)
6559 /* If the value is negative, compute its negative minus 1. The latter
6560 adjustment is because the absolute value of the largest negative value
6561 is one larger than the largest positive value. This is equivalent to
6562 a bit-wise negation, so use that operation instead. */
6564 if (tree_int_cst_sgn (value) < 0)
6565 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6567 /* Return the number of bits needed, taking into account the fact
6568 that we need one more bit for a signed than unsigned type. */
6570 if (integer_zerop (value))
6573 log = tree_floor_log2 (value);
6575 return log + 1 + !unsignedp;
6578 /* Compare two constructor-element-type constants. Return 1 if the lists
6579 are known to be equal; otherwise return 0. */
6582 simple_cst_list_equal (const_tree l1, const_tree l2)
6584 while (l1 != NULL_TREE && l2 != NULL_TREE)
6586 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6589 l1 = TREE_CHAIN (l1);
6590 l2 = TREE_CHAIN (l2);
6596 /* Return truthvalue of whether T1 is the same tree structure as T2.
6597 Return 1 if they are the same.
6598 Return 0 if they are understandably different.
6599 Return -1 if either contains tree structure not understood by
6603 simple_cst_equal (const_tree t1, const_tree t2)
6605 enum tree_code code1, code2;
6611 if (t1 == 0 || t2 == 0)
6614 code1 = TREE_CODE (t1);
6615 code2 = TREE_CODE (t2);
6617 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6619 if (CONVERT_EXPR_CODE_P (code2)
6620 || code2 == NON_LVALUE_EXPR)
6621 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6623 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6626 else if (CONVERT_EXPR_CODE_P (code2)
6627 || code2 == NON_LVALUE_EXPR)
6628 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6636 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6637 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6640 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6643 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6646 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6647 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6648 TREE_STRING_LENGTH (t1)));
6652 unsigned HOST_WIDE_INT idx;
6653 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6654 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6656 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6659 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6660 /* ??? Should we handle also fields here? */
6661 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6662 VEC_index (constructor_elt, v2, idx)->value))
6668 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6671 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6674 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6677 const_tree arg1, arg2;
6678 const_call_expr_arg_iterator iter1, iter2;
6679 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6680 arg2 = first_const_call_expr_arg (t2, &iter2);
6682 arg1 = next_const_call_expr_arg (&iter1),
6683 arg2 = next_const_call_expr_arg (&iter2))
6685 cmp = simple_cst_equal (arg1, arg2);
6689 return arg1 == arg2;
6693 /* Special case: if either target is an unallocated VAR_DECL,
6694 it means that it's going to be unified with whatever the
6695 TARGET_EXPR is really supposed to initialize, so treat it
6696 as being equivalent to anything. */
6697 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6698 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6699 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6700 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6701 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6702 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6705 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6710 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6712 case WITH_CLEANUP_EXPR:
6713 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6717 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6720 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6721 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6735 /* This general rule works for most tree codes. All exceptions should be
6736 handled above. If this is a language-specific tree code, we can't
6737 trust what might be in the operand, so say we don't know
6739 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6742 switch (TREE_CODE_CLASS (code1))
6746 case tcc_comparison:
6747 case tcc_expression:
6751 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6753 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6765 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6766 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6767 than U, respectively. */
6770 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6772 if (tree_int_cst_sgn (t) < 0)
6774 else if (TREE_INT_CST_HIGH (t) != 0)
6776 else if (TREE_INT_CST_LOW (t) == u)
6778 else if (TREE_INT_CST_LOW (t) < u)
6784 /* Return true if CODE represents an associative tree code. Otherwise
6787 associative_tree_code (enum tree_code code)
6806 /* Return true if CODE represents a commutative tree code. Otherwise
6809 commutative_tree_code (enum tree_code code)
6822 case UNORDERED_EXPR:
6826 case TRUTH_AND_EXPR:
6827 case TRUTH_XOR_EXPR:
6837 /* Return true if CODE represents a ternary tree code for which the
6838 first two operands are commutative. Otherwise return false. */
6840 commutative_ternary_tree_code (enum tree_code code)
6844 case WIDEN_MULT_PLUS_EXPR:
6845 case WIDEN_MULT_MINUS_EXPR:
6854 /* Generate a hash value for an expression. This can be used iteratively
6855 by passing a previous result as the VAL argument.
6857 This function is intended to produce the same hash for expressions which
6858 would compare equal using operand_equal_p. */
6861 iterative_hash_expr (const_tree t, hashval_t val)
6864 enum tree_code code;
6868 return iterative_hash_hashval_t (0, val);
6870 code = TREE_CODE (t);
6874 /* Alas, constants aren't shared, so we can't rely on pointer
6877 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6878 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6881 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6883 return iterative_hash_hashval_t (val2, val);
6887 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6889 return iterative_hash_hashval_t (val2, val);
6892 return iterative_hash (TREE_STRING_POINTER (t),
6893 TREE_STRING_LENGTH (t), val);
6895 val = iterative_hash_expr (TREE_REALPART (t), val);
6896 return iterative_hash_expr (TREE_IMAGPART (t), val);
6898 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6900 /* We can just compare by pointer. */
6901 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6902 case PLACEHOLDER_EXPR:
6903 /* The node itself doesn't matter. */
6906 /* A list of expressions, for a CALL_EXPR or as the elements of a
6908 for (; t; t = TREE_CHAIN (t))
6909 val = iterative_hash_expr (TREE_VALUE (t), val);
6913 unsigned HOST_WIDE_INT idx;
6915 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6917 val = iterative_hash_expr (field, val);
6918 val = iterative_hash_expr (value, val);
6924 /* The type of the second operand is relevant, except for
6925 its top-level qualifiers. */
6926 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t, 1)));
6928 val = iterative_hash_object (TYPE_HASH (type), val);
6930 /* We could use the standard hash computation from this point
6932 val = iterative_hash_object (code, val);
6933 val = iterative_hash_expr (TREE_OPERAND (t, 1), val);
6934 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6938 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6939 Otherwise nodes that compare equal according to operand_equal_p might
6940 get different hash codes. However, don't do this for machine specific
6941 or front end builtins, since the function code is overloaded in those
6943 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6944 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t)))
6946 t = builtin_decl_explicit (DECL_FUNCTION_CODE (t));
6947 code = TREE_CODE (t);
6951 tclass = TREE_CODE_CLASS (code);
6953 if (tclass == tcc_declaration)
6955 /* DECL's have a unique ID */
6956 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6960 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6962 val = iterative_hash_object (code, val);
6964 /* Don't hash the type, that can lead to having nodes which
6965 compare equal according to operand_equal_p, but which
6966 have different hash codes. */
6967 if (CONVERT_EXPR_CODE_P (code)
6968 || code == NON_LVALUE_EXPR)
6970 /* Make sure to include signness in the hash computation. */
6971 val += TYPE_UNSIGNED (TREE_TYPE (t));
6972 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6975 else if (commutative_tree_code (code))
6977 /* It's a commutative expression. We want to hash it the same
6978 however it appears. We do this by first hashing both operands
6979 and then rehashing based on the order of their independent
6981 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6982 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6986 t = one, one = two, two = t;
6988 val = iterative_hash_hashval_t (one, val);
6989 val = iterative_hash_hashval_t (two, val);
6992 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6993 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
7000 /* Generate a hash value for a pair of expressions. This can be used
7001 iteratively by passing a previous result as the VAL argument.
7003 The same hash value is always returned for a given pair of expressions,
7004 regardless of the order in which they are presented. This is useful in
7005 hashing the operands of commutative functions. */
7008 iterative_hash_exprs_commutative (const_tree t1,
7009 const_tree t2, hashval_t val)
7011 hashval_t one = iterative_hash_expr (t1, 0);
7012 hashval_t two = iterative_hash_expr (t2, 0);
7016 t = one, one = two, two = t;
7017 val = iterative_hash_hashval_t (one, val);
7018 val = iterative_hash_hashval_t (two, val);
7023 /* Constructors for pointer, array and function types.
7024 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7025 constructed by language-dependent code, not here.) */
7027 /* Construct, lay out and return the type of pointers to TO_TYPE with
7028 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7029 reference all of memory. If such a type has already been
7030 constructed, reuse it. */
7033 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
7038 if (to_type == error_mark_node)
7039 return error_mark_node;
7041 /* If the pointed-to type has the may_alias attribute set, force
7042 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7043 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7044 can_alias_all = true;
7046 /* In some cases, languages will have things that aren't a POINTER_TYPE
7047 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7048 In that case, return that type without regard to the rest of our
7051 ??? This is a kludge, but consistent with the way this function has
7052 always operated and there doesn't seem to be a good way to avoid this
7054 if (TYPE_POINTER_TO (to_type) != 0
7055 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
7056 return TYPE_POINTER_TO (to_type);
7058 /* First, if we already have a type for pointers to TO_TYPE and it's
7059 the proper mode, use it. */
7060 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
7061 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7064 t = make_node (POINTER_TYPE);
7066 TREE_TYPE (t) = to_type;
7067 SET_TYPE_MODE (t, mode);
7068 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7069 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
7070 TYPE_POINTER_TO (to_type) = t;
7072 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7073 SET_TYPE_STRUCTURAL_EQUALITY (t);
7074 else if (TYPE_CANONICAL (to_type) != to_type)
7076 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
7077 mode, can_alias_all);
7079 /* Lay out the type. This function has many callers that are concerned
7080 with expression-construction, and this simplifies them all. */
7086 /* By default build pointers in ptr_mode. */
7089 build_pointer_type (tree to_type)
7091 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7092 : TYPE_ADDR_SPACE (to_type);
7093 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7094 return build_pointer_type_for_mode (to_type, pointer_mode, false);
7097 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7100 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
7105 if (to_type == error_mark_node)
7106 return error_mark_node;
7108 /* If the pointed-to type has the may_alias attribute set, force
7109 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7110 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7111 can_alias_all = true;
7113 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7114 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7115 In that case, return that type without regard to the rest of our
7118 ??? This is a kludge, but consistent with the way this function has
7119 always operated and there doesn't seem to be a good way to avoid this
7121 if (TYPE_REFERENCE_TO (to_type) != 0
7122 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7123 return TYPE_REFERENCE_TO (to_type);
7125 /* First, if we already have a type for pointers to TO_TYPE and it's
7126 the proper mode, use it. */
7127 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7128 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7131 t = make_node (REFERENCE_TYPE);
7133 TREE_TYPE (t) = to_type;
7134 SET_TYPE_MODE (t, mode);
7135 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7136 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7137 TYPE_REFERENCE_TO (to_type) = t;
7139 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7140 SET_TYPE_STRUCTURAL_EQUALITY (t);
7141 else if (TYPE_CANONICAL (to_type) != to_type)
7143 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7144 mode, can_alias_all);
7152 /* Build the node for the type of references-to-TO_TYPE by default
7156 build_reference_type (tree to_type)
7158 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7159 : TYPE_ADDR_SPACE (to_type);
7160 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7161 return build_reference_type_for_mode (to_type, pointer_mode, false);
7164 /* Build a type that is compatible with t but has no cv quals anywhere
7167 const char *const *const * -> char ***. */
7170 build_type_no_quals (tree t)
7172 switch (TREE_CODE (t))
7175 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7177 TYPE_REF_CAN_ALIAS_ALL (t));
7178 case REFERENCE_TYPE:
7180 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7182 TYPE_REF_CAN_ALIAS_ALL (t));
7184 return TYPE_MAIN_VARIANT (t);
7188 #define MAX_INT_CACHED_PREC \
7189 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7190 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7192 /* Builds a signed or unsigned integer type of precision PRECISION.
7193 Used for C bitfields whose precision does not match that of
7194 built-in target types. */
7196 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7202 unsignedp = MAX_INT_CACHED_PREC + 1;
7204 if (precision <= MAX_INT_CACHED_PREC)
7206 itype = nonstandard_integer_type_cache[precision + unsignedp];
7211 itype = make_node (INTEGER_TYPE);
7212 TYPE_PRECISION (itype) = precision;
7215 fixup_unsigned_type (itype);
7217 fixup_signed_type (itype);
7220 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7221 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7222 if (precision <= MAX_INT_CACHED_PREC)
7223 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7228 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7229 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7230 is true, reuse such a type that has already been constructed. */
7233 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7235 tree itype = make_node (INTEGER_TYPE);
7236 hashval_t hashcode = 0;
7238 TREE_TYPE (itype) = type;
7240 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7241 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7243 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7244 SET_TYPE_MODE (itype, TYPE_MODE (type));
7245 TYPE_SIZE (itype) = TYPE_SIZE (type);
7246 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7247 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7248 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7253 if ((TYPE_MIN_VALUE (itype)
7254 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7255 || (TYPE_MAX_VALUE (itype)
7256 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7258 /* Since we cannot reliably merge this type, we need to compare it using
7259 structural equality checks. */
7260 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7264 hashcode = iterative_hash_expr (TYPE_MIN_VALUE (itype), hashcode);
7265 hashcode = iterative_hash_expr (TYPE_MAX_VALUE (itype), hashcode);
7266 hashcode = iterative_hash_hashval_t (TYPE_HASH (type), hashcode);
7267 itype = type_hash_canon (hashcode, itype);
7272 /* Wrapper around build_range_type_1 with SHARED set to true. */
7275 build_range_type (tree type, tree lowval, tree highval)
7277 return build_range_type_1 (type, lowval, highval, true);
7280 /* Wrapper around build_range_type_1 with SHARED set to false. */
7283 build_nonshared_range_type (tree type, tree lowval, tree highval)
7285 return build_range_type_1 (type, lowval, highval, false);
7288 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7289 MAXVAL should be the maximum value in the domain
7290 (one less than the length of the array).
7292 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7293 We don't enforce this limit, that is up to caller (e.g. language front end).
7294 The limit exists because the result is a signed type and we don't handle
7295 sizes that use more than one HOST_WIDE_INT. */
7298 build_index_type (tree maxval)
7300 return build_range_type (sizetype, size_zero_node, maxval);
7303 /* Return true if the debug information for TYPE, a subtype, should be emitted
7304 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7305 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7306 debug info and doesn't reflect the source code. */
7309 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7311 tree base_type = TREE_TYPE (type), low, high;
7313 /* Subrange types have a base type which is an integral type. */
7314 if (!INTEGRAL_TYPE_P (base_type))
7317 /* Get the real bounds of the subtype. */
7318 if (lang_hooks.types.get_subrange_bounds)
7319 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7322 low = TYPE_MIN_VALUE (type);
7323 high = TYPE_MAX_VALUE (type);
7326 /* If the type and its base type have the same representation and the same
7327 name, then the type is not a subrange but a copy of the base type. */
7328 if ((TREE_CODE (base_type) == INTEGER_TYPE
7329 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7330 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7331 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7332 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7334 tree type_name = TYPE_NAME (type);
7335 tree base_type_name = TYPE_NAME (base_type);
7337 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7338 type_name = DECL_NAME (type_name);
7340 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7341 base_type_name = DECL_NAME (base_type_name);
7343 if (type_name == base_type_name)
7354 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7355 and number of elements specified by the range of values of INDEX_TYPE.
7356 If SHARED is true, reuse such a type that has already been constructed. */
7359 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7363 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7365 error ("arrays of functions are not meaningful");
7366 elt_type = integer_type_node;
7369 t = make_node (ARRAY_TYPE);
7370 TREE_TYPE (t) = elt_type;
7371 TYPE_DOMAIN (t) = index_type;
7372 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7375 /* If the element type is incomplete at this point we get marked for
7376 structural equality. Do not record these types in the canonical
7378 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7383 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7385 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7386 t = type_hash_canon (hashcode, t);
7389 if (TYPE_CANONICAL (t) == t)
7391 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7392 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7393 SET_TYPE_STRUCTURAL_EQUALITY (t);
7394 else if (TYPE_CANONICAL (elt_type) != elt_type
7395 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7397 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7399 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7406 /* Wrapper around build_array_type_1 with SHARED set to true. */
7409 build_array_type (tree elt_type, tree index_type)
7411 return build_array_type_1 (elt_type, index_type, true);
7414 /* Wrapper around build_array_type_1 with SHARED set to false. */
7417 build_nonshared_array_type (tree elt_type, tree index_type)
7419 return build_array_type_1 (elt_type, index_type, false);
7422 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7426 build_array_type_nelts (tree elt_type, unsigned HOST_WIDE_INT nelts)
7428 return build_array_type (elt_type, build_index_type (size_int (nelts - 1)));
7431 /* Recursively examines the array elements of TYPE, until a non-array
7432 element type is found. */
7435 strip_array_types (tree type)
7437 while (TREE_CODE (type) == ARRAY_TYPE)
7438 type = TREE_TYPE (type);
7443 /* Computes the canonical argument types from the argument type list
7446 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7447 on entry to this function, or if any of the ARGTYPES are
7450 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7451 true on entry to this function, or if any of the ARGTYPES are
7454 Returns a canonical argument list, which may be ARGTYPES when the
7455 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7456 true) or would not differ from ARGTYPES. */
7459 maybe_canonicalize_argtypes(tree argtypes,
7460 bool *any_structural_p,
7461 bool *any_noncanonical_p)
7464 bool any_noncanonical_argtypes_p = false;
7466 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7468 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7469 /* Fail gracefully by stating that the type is structural. */
7470 *any_structural_p = true;
7471 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7472 *any_structural_p = true;
7473 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7474 || TREE_PURPOSE (arg))
7475 /* If the argument has a default argument, we consider it
7476 non-canonical even though the type itself is canonical.
7477 That way, different variants of function and method types
7478 with default arguments will all point to the variant with
7479 no defaults as their canonical type. */
7480 any_noncanonical_argtypes_p = true;
7483 if (*any_structural_p)
7486 if (any_noncanonical_argtypes_p)
7488 /* Build the canonical list of argument types. */
7489 tree canon_argtypes = NULL_TREE;
7490 bool is_void = false;
7492 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7494 if (arg == void_list_node)
7497 canon_argtypes = tree_cons (NULL_TREE,
7498 TYPE_CANONICAL (TREE_VALUE (arg)),
7502 canon_argtypes = nreverse (canon_argtypes);
7504 canon_argtypes = chainon (canon_argtypes, void_list_node);
7506 /* There is a non-canonical type. */
7507 *any_noncanonical_p = true;
7508 return canon_argtypes;
7511 /* The canonical argument types are the same as ARGTYPES. */
7515 /* Construct, lay out and return
7516 the type of functions returning type VALUE_TYPE
7517 given arguments of types ARG_TYPES.
7518 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7519 are data type nodes for the arguments of the function.
7520 If such a type has already been constructed, reuse it. */
7523 build_function_type (tree value_type, tree arg_types)
7526 hashval_t hashcode = 0;
7527 bool any_structural_p, any_noncanonical_p;
7528 tree canon_argtypes;
7530 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7532 error ("function return type cannot be function");
7533 value_type = integer_type_node;
7536 /* Make a node of the sort we want. */
7537 t = make_node (FUNCTION_TYPE);
7538 TREE_TYPE (t) = value_type;
7539 TYPE_ARG_TYPES (t) = arg_types;
7541 /* If we already have such a type, use the old one. */
7542 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7543 hashcode = type_hash_list (arg_types, hashcode);
7544 t = type_hash_canon (hashcode, t);
7546 /* Set up the canonical type. */
7547 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7548 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7549 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7551 &any_noncanonical_p);
7552 if (any_structural_p)
7553 SET_TYPE_STRUCTURAL_EQUALITY (t);
7554 else if (any_noncanonical_p)
7555 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7558 if (!COMPLETE_TYPE_P (t))
7563 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7566 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7568 tree new_type = NULL;
7569 tree args, new_args = NULL, t;
7573 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7574 args = TREE_CHAIN (args), i++)
7575 if (!bitmap_bit_p (args_to_skip, i))
7576 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7578 new_reversed = nreverse (new_args);
7582 TREE_CHAIN (new_args) = void_list_node;
7584 new_reversed = void_list_node;
7587 /* Use copy_node to preserve as much as possible from original type
7588 (debug info, attribute lists etc.)
7589 Exception is METHOD_TYPEs must have THIS argument.
7590 When we are asked to remove it, we need to build new FUNCTION_TYPE
7592 if (TREE_CODE (orig_type) != METHOD_TYPE
7593 || !bitmap_bit_p (args_to_skip, 0))
7595 new_type = build_distinct_type_copy (orig_type);
7596 TYPE_ARG_TYPES (new_type) = new_reversed;
7601 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7603 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7606 /* This is a new type, not a copy of an old type. Need to reassociate
7607 variants. We can handle everything except the main variant lazily. */
7608 t = TYPE_MAIN_VARIANT (orig_type);
7611 TYPE_MAIN_VARIANT (new_type) = t;
7612 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7613 TYPE_NEXT_VARIANT (t) = new_type;
7617 TYPE_MAIN_VARIANT (new_type) = new_type;
7618 TYPE_NEXT_VARIANT (new_type) = NULL;
7623 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7625 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7626 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7627 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7630 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7632 tree new_decl = copy_node (orig_decl);
7635 new_type = TREE_TYPE (orig_decl);
7636 if (prototype_p (new_type))
7637 new_type = build_function_type_skip_args (new_type, args_to_skip);
7638 TREE_TYPE (new_decl) = new_type;
7640 /* For declarations setting DECL_VINDEX (i.e. methods)
7641 we expect first argument to be THIS pointer. */
7642 if (bitmap_bit_p (args_to_skip, 0))
7643 DECL_VINDEX (new_decl) = NULL_TREE;
7645 /* When signature changes, we need to clear builtin info. */
7646 if (DECL_BUILT_IN (new_decl) && !bitmap_empty_p (args_to_skip))
7648 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7649 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7654 /* Build a function type. The RETURN_TYPE is the type returned by the
7655 function. If VAARGS is set, no void_type_node is appended to the
7656 the list. ARGP must be always be terminated be a NULL_TREE. */
7659 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7663 t = va_arg (argp, tree);
7664 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7665 args = tree_cons (NULL_TREE, t, args);
7670 if (args != NULL_TREE)
7671 args = nreverse (args);
7672 gcc_assert (last != void_list_node);
7674 else if (args == NULL_TREE)
7675 args = void_list_node;
7679 args = nreverse (args);
7680 TREE_CHAIN (last) = void_list_node;
7682 args = build_function_type (return_type, args);
7687 /* Build a function type. The RETURN_TYPE is the type returned by the
7688 function. If additional arguments are provided, they are
7689 additional argument types. The list of argument types must always
7690 be terminated by NULL_TREE. */
7693 build_function_type_list (tree return_type, ...)
7698 va_start (p, return_type);
7699 args = build_function_type_list_1 (false, return_type, p);
7704 /* Build a variable argument function type. The RETURN_TYPE is the
7705 type returned by the function. If additional arguments are provided,
7706 they are additional argument types. The list of argument types must
7707 always be terminated by NULL_TREE. */
7710 build_varargs_function_type_list (tree return_type, ...)
7715 va_start (p, return_type);
7716 args = build_function_type_list_1 (true, return_type, p);
7722 /* Build a function type. RETURN_TYPE is the type returned by the
7723 function; VAARGS indicates whether the function takes varargs. The
7724 function takes N named arguments, the types of which are provided in
7728 build_function_type_array_1 (bool vaargs, tree return_type, int n,
7732 tree t = vaargs ? NULL_TREE : void_list_node;
7734 for (i = n - 1; i >= 0; i--)
7735 t = tree_cons (NULL_TREE, arg_types[i], t);
7737 return build_function_type (return_type, t);
7740 /* Build a function type. RETURN_TYPE is the type returned by the
7741 function. The function takes N named arguments, the types of which
7742 are provided in ARG_TYPES. */
7745 build_function_type_array (tree return_type, int n, tree *arg_types)
7747 return build_function_type_array_1 (false, return_type, n, arg_types);
7750 /* Build a variable argument function type. RETURN_TYPE is the type
7751 returned by the function. The function takes N named arguments, the
7752 types of which are provided in ARG_TYPES. */
7755 build_varargs_function_type_array (tree return_type, int n, tree *arg_types)
7757 return build_function_type_array_1 (true, return_type, n, arg_types);
7760 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7761 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7762 for the method. An implicit additional parameter (of type
7763 pointer-to-BASETYPE) is added to the ARGTYPES. */
7766 build_method_type_directly (tree basetype,
7773 bool any_structural_p, any_noncanonical_p;
7774 tree canon_argtypes;
7776 /* Make a node of the sort we want. */
7777 t = make_node (METHOD_TYPE);
7779 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7780 TREE_TYPE (t) = rettype;
7781 ptype = build_pointer_type (basetype);
7783 /* The actual arglist for this function includes a "hidden" argument
7784 which is "this". Put it into the list of argument types. */
7785 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7786 TYPE_ARG_TYPES (t) = argtypes;
7788 /* If we already have such a type, use the old one. */
7789 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7790 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7791 hashcode = type_hash_list (argtypes, hashcode);
7792 t = type_hash_canon (hashcode, t);
7794 /* Set up the canonical type. */
7796 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7797 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7799 = (TYPE_CANONICAL (basetype) != basetype
7800 || TYPE_CANONICAL (rettype) != rettype);
7801 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7803 &any_noncanonical_p);
7804 if (any_structural_p)
7805 SET_TYPE_STRUCTURAL_EQUALITY (t);
7806 else if (any_noncanonical_p)
7808 = build_method_type_directly (TYPE_CANONICAL (basetype),
7809 TYPE_CANONICAL (rettype),
7811 if (!COMPLETE_TYPE_P (t))
7817 /* Construct, lay out and return the type of methods belonging to class
7818 BASETYPE and whose arguments and values are described by TYPE.
7819 If that type exists already, reuse it.
7820 TYPE must be a FUNCTION_TYPE node. */
7823 build_method_type (tree basetype, tree type)
7825 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7827 return build_method_type_directly (basetype,
7829 TYPE_ARG_TYPES (type));
7832 /* Construct, lay out and return the type of offsets to a value
7833 of type TYPE, within an object of type BASETYPE.
7834 If a suitable offset type exists already, reuse it. */
7837 build_offset_type (tree basetype, tree type)
7840 hashval_t hashcode = 0;
7842 /* Make a node of the sort we want. */
7843 t = make_node (OFFSET_TYPE);
7845 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7846 TREE_TYPE (t) = type;
7848 /* If we already have such a type, use the old one. */
7849 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7850 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7851 t = type_hash_canon (hashcode, t);
7853 if (!COMPLETE_TYPE_P (t))
7856 if (TYPE_CANONICAL (t) == t)
7858 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7859 || TYPE_STRUCTURAL_EQUALITY_P (type))
7860 SET_TYPE_STRUCTURAL_EQUALITY (t);
7861 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7862 || TYPE_CANONICAL (type) != type)
7864 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7865 TYPE_CANONICAL (type));
7871 /* Create a complex type whose components are COMPONENT_TYPE. */
7874 build_complex_type (tree component_type)
7879 gcc_assert (INTEGRAL_TYPE_P (component_type)
7880 || SCALAR_FLOAT_TYPE_P (component_type)
7881 || FIXED_POINT_TYPE_P (component_type));
7883 /* Make a node of the sort we want. */
7884 t = make_node (COMPLEX_TYPE);
7886 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7888 /* If we already have such a type, use the old one. */
7889 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7890 t = type_hash_canon (hashcode, t);
7892 if (!COMPLETE_TYPE_P (t))
7895 if (TYPE_CANONICAL (t) == t)
7897 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7898 SET_TYPE_STRUCTURAL_EQUALITY (t);
7899 else if (TYPE_CANONICAL (component_type) != component_type)
7901 = build_complex_type (TYPE_CANONICAL (component_type));
7904 /* We need to create a name, since complex is a fundamental type. */
7905 if (! TYPE_NAME (t))
7908 if (component_type == char_type_node)
7909 name = "complex char";
7910 else if (component_type == signed_char_type_node)
7911 name = "complex signed char";
7912 else if (component_type == unsigned_char_type_node)
7913 name = "complex unsigned char";
7914 else if (component_type == short_integer_type_node)
7915 name = "complex short int";
7916 else if (component_type == short_unsigned_type_node)
7917 name = "complex short unsigned int";
7918 else if (component_type == integer_type_node)
7919 name = "complex int";
7920 else if (component_type == unsigned_type_node)
7921 name = "complex unsigned int";
7922 else if (component_type == long_integer_type_node)
7923 name = "complex long int";
7924 else if (component_type == long_unsigned_type_node)
7925 name = "complex long unsigned int";
7926 else if (component_type == long_long_integer_type_node)
7927 name = "complex long long int";
7928 else if (component_type == long_long_unsigned_type_node)
7929 name = "complex long long unsigned int";
7934 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7935 get_identifier (name), t);
7938 return build_qualified_type (t, TYPE_QUALS (component_type));
7941 /* If TYPE is a real or complex floating-point type and the target
7942 does not directly support arithmetic on TYPE then return the wider
7943 type to be used for arithmetic on TYPE. Otherwise, return
7947 excess_precision_type (tree type)
7949 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7951 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7952 switch (TREE_CODE (type))
7955 switch (flt_eval_method)
7958 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7959 return double_type_node;
7962 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7963 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7964 return long_double_type_node;
7971 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7973 switch (flt_eval_method)
7976 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7977 return complex_double_type_node;
7980 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7981 || (TYPE_MODE (TREE_TYPE (type))
7982 == TYPE_MODE (double_type_node)))
7983 return complex_long_double_type_node;
7996 /* Return OP, stripped of any conversions to wider types as much as is safe.
7997 Converting the value back to OP's type makes a value equivalent to OP.
7999 If FOR_TYPE is nonzero, we return a value which, if converted to
8000 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8002 OP must have integer, real or enumeral type. Pointers are not allowed!
8004 There are some cases where the obvious value we could return
8005 would regenerate to OP if converted to OP's type,
8006 but would not extend like OP to wider types.
8007 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8008 For example, if OP is (unsigned short)(signed char)-1,
8009 we avoid returning (signed char)-1 if FOR_TYPE is int,
8010 even though extending that to an unsigned short would regenerate OP,
8011 since the result of extending (signed char)-1 to (int)
8012 is different from (int) OP. */
8015 get_unwidened (tree op, tree for_type)
8017 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8018 tree type = TREE_TYPE (op);
8020 = TYPE_PRECISION (for_type != 0 ? for_type : type);
8022 = (for_type != 0 && for_type != type
8023 && final_prec > TYPE_PRECISION (type)
8024 && TYPE_UNSIGNED (type));
8027 while (CONVERT_EXPR_P (op))
8031 /* TYPE_PRECISION on vector types has different meaning
8032 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8033 so avoid them here. */
8034 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
8037 bitschange = TYPE_PRECISION (TREE_TYPE (op))
8038 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
8040 /* Truncations are many-one so cannot be removed.
8041 Unless we are later going to truncate down even farther. */
8043 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
8046 /* See what's inside this conversion. If we decide to strip it,
8048 op = TREE_OPERAND (op, 0);
8050 /* If we have not stripped any zero-extensions (uns is 0),
8051 we can strip any kind of extension.
8052 If we have previously stripped a zero-extension,
8053 only zero-extensions can safely be stripped.
8054 Any extension can be stripped if the bits it would produce
8055 are all going to be discarded later by truncating to FOR_TYPE. */
8059 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
8061 /* TYPE_UNSIGNED says whether this is a zero-extension.
8062 Let's avoid computing it if it does not affect WIN
8063 and if UNS will not be needed again. */
8065 || CONVERT_EXPR_P (op))
8066 && TYPE_UNSIGNED (TREE_TYPE (op)))
8074 /* If we finally reach a constant see if it fits in for_type and
8075 in that case convert it. */
8077 && TREE_CODE (win) == INTEGER_CST
8078 && TREE_TYPE (win) != for_type
8079 && int_fits_type_p (win, for_type))
8080 win = fold_convert (for_type, win);
8085 /* Return OP or a simpler expression for a narrower value
8086 which can be sign-extended or zero-extended to give back OP.
8087 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8088 or 0 if the value should be sign-extended. */
8091 get_narrower (tree op, int *unsignedp_ptr)
8096 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
8098 while (TREE_CODE (op) == NOP_EXPR)
8101 = (TYPE_PRECISION (TREE_TYPE (op))
8102 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
8104 /* Truncations are many-one so cannot be removed. */
8108 /* See what's inside this conversion. If we decide to strip it,
8113 op = TREE_OPERAND (op, 0);
8114 /* An extension: the outermost one can be stripped,
8115 but remember whether it is zero or sign extension. */
8117 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8118 /* Otherwise, if a sign extension has been stripped,
8119 only sign extensions can now be stripped;
8120 if a zero extension has been stripped, only zero-extensions. */
8121 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
8125 else /* bitschange == 0 */
8127 /* A change in nominal type can always be stripped, but we must
8128 preserve the unsignedness. */
8130 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8132 op = TREE_OPERAND (op, 0);
8133 /* Keep trying to narrow, but don't assign op to win if it
8134 would turn an integral type into something else. */
8135 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
8142 if (TREE_CODE (op) == COMPONENT_REF
8143 /* Since type_for_size always gives an integer type. */
8144 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8145 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8146 /* Ensure field is laid out already. */
8147 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8148 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
8150 unsigned HOST_WIDE_INT innerprec
8151 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
8152 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8153 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8154 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8156 /* We can get this structure field in a narrower type that fits it,
8157 but the resulting extension to its nominal type (a fullword type)
8158 must satisfy the same conditions as for other extensions.
8160 Do this only for fields that are aligned (not bit-fields),
8161 because when bit-field insns will be used there is no
8162 advantage in doing this. */
8164 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8165 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8166 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8170 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8171 win = fold_convert (type, op);
8175 *unsignedp_ptr = uns;
8179 /* Returns true if integer constant C has a value that is permissible
8180 for type TYPE (an INTEGER_TYPE). */
8183 int_fits_type_p (const_tree c, const_tree type)
8185 tree type_low_bound, type_high_bound;
8186 bool ok_for_low_bound, ok_for_high_bound, unsc;
8189 dc = tree_to_double_int (c);
8190 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
8192 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
8193 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
8195 /* So c is an unsigned integer whose type is sizetype and type is not.
8196 sizetype'd integers are sign extended even though they are
8197 unsigned. If the integer value fits in the lower end word of c,
8198 and if the higher end word has all its bits set to 1, that
8199 means the higher end bits are set to 1 only for sign extension.
8200 So let's convert c into an equivalent zero extended unsigned
8202 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
8205 type_low_bound = TYPE_MIN_VALUE (type);
8206 type_high_bound = TYPE_MAX_VALUE (type);
8208 /* If at least one bound of the type is a constant integer, we can check
8209 ourselves and maybe make a decision. If no such decision is possible, but
8210 this type is a subtype, try checking against that. Otherwise, use
8211 double_int_fits_to_tree_p, which checks against the precision.
8213 Compute the status for each possibly constant bound, and return if we see
8214 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8215 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8216 for "constant known to fit". */
8218 /* Check if c >= type_low_bound. */
8219 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8221 dd = tree_to_double_int (type_low_bound);
8222 if (TREE_CODE (type) == INTEGER_TYPE
8223 && TYPE_IS_SIZETYPE (type)
8224 && TYPE_UNSIGNED (type))
8225 dd = double_int_zext (dd, TYPE_PRECISION (type));
8226 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
8228 int c_neg = (!unsc && double_int_negative_p (dc));
8229 int t_neg = (unsc && double_int_negative_p (dd));
8231 if (c_neg && !t_neg)
8233 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
8236 else if (double_int_cmp (dc, dd, unsc) < 0)
8238 ok_for_low_bound = true;
8241 ok_for_low_bound = false;
8243 /* Check if c <= type_high_bound. */
8244 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8246 dd = tree_to_double_int (type_high_bound);
8247 if (TREE_CODE (type) == INTEGER_TYPE
8248 && TYPE_IS_SIZETYPE (type)
8249 && TYPE_UNSIGNED (type))
8250 dd = double_int_zext (dd, TYPE_PRECISION (type));
8251 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8253 int c_neg = (!unsc && double_int_negative_p (dc));
8254 int t_neg = (unsc && double_int_negative_p (dd));
8256 if (t_neg && !c_neg)
8258 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
8261 else if (double_int_cmp (dc, dd, unsc) > 0)
8263 ok_for_high_bound = true;
8266 ok_for_high_bound = false;
8268 /* If the constant fits both bounds, the result is known. */
8269 if (ok_for_low_bound && ok_for_high_bound)
8272 /* Perform some generic filtering which may allow making a decision
8273 even if the bounds are not constant. First, negative integers
8274 never fit in unsigned types, */
8275 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8278 /* Second, narrower types always fit in wider ones. */
8279 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8282 /* Third, unsigned integers with top bit set never fit signed types. */
8283 if (! TYPE_UNSIGNED (type) && unsc)
8285 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8286 if (prec < HOST_BITS_PER_WIDE_INT)
8288 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8291 else if (((((unsigned HOST_WIDE_INT) 1)
8292 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8296 /* If we haven't been able to decide at this point, there nothing more we
8297 can check ourselves here. Look at the base type if we have one and it
8298 has the same precision. */
8299 if (TREE_CODE (type) == INTEGER_TYPE
8300 && TREE_TYPE (type) != 0
8301 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8303 type = TREE_TYPE (type);
8307 /* Or to double_int_fits_to_tree_p, if nothing else. */
8308 return double_int_fits_to_tree_p (type, dc);
8311 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8312 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8313 represented (assuming two's-complement arithmetic) within the bit
8314 precision of the type are returned instead. */
8317 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8319 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8320 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8321 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8322 TYPE_UNSIGNED (type));
8325 if (TYPE_UNSIGNED (type))
8326 mpz_set_ui (min, 0);
8330 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8331 mn = double_int_sext (double_int_add (mn, double_int_one),
8332 TYPE_PRECISION (type));
8333 mpz_set_double_int (min, mn, false);
8337 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8338 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8339 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8340 TYPE_UNSIGNED (type));
8343 if (TYPE_UNSIGNED (type))
8344 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8347 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8352 /* Return true if VAR is an automatic variable defined in function FN. */
8355 auto_var_in_fn_p (const_tree var, const_tree fn)
8357 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8358 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8359 || TREE_CODE (var) == PARM_DECL)
8360 && ! TREE_STATIC (var))
8361 || TREE_CODE (var) == LABEL_DECL
8362 || TREE_CODE (var) == RESULT_DECL));
8365 /* Subprogram of following function. Called by walk_tree.
8367 Return *TP if it is an automatic variable or parameter of the
8368 function passed in as DATA. */
8371 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8373 tree fn = (tree) data;
8378 else if (DECL_P (*tp)
8379 && auto_var_in_fn_p (*tp, fn))
8385 /* Returns true if T is, contains, or refers to a type with variable
8386 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8387 arguments, but not the return type. If FN is nonzero, only return
8388 true if a modifier of the type or position of FN is a variable or
8389 parameter inside FN.
8391 This concept is more general than that of C99 'variably modified types':
8392 in C99, a struct type is never variably modified because a VLA may not
8393 appear as a structure member. However, in GNU C code like:
8395 struct S { int i[f()]; };
8397 is valid, and other languages may define similar constructs. */
8400 variably_modified_type_p (tree type, tree fn)
8404 /* Test if T is either variable (if FN is zero) or an expression containing
8405 a variable in FN. */
8406 #define RETURN_TRUE_IF_VAR(T) \
8407 do { tree _t = (T); \
8408 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8409 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8410 return true; } while (0)
8412 if (type == error_mark_node)
8415 /* If TYPE itself has variable size, it is variably modified. */
8416 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8417 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8419 switch (TREE_CODE (type))
8422 case REFERENCE_TYPE:
8424 if (variably_modified_type_p (TREE_TYPE (type), fn))
8430 /* If TYPE is a function type, it is variably modified if the
8431 return type is variably modified. */
8432 if (variably_modified_type_p (TREE_TYPE (type), fn))
8438 case FIXED_POINT_TYPE:
8441 /* Scalar types are variably modified if their end points
8443 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8444 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8449 case QUAL_UNION_TYPE:
8450 /* We can't see if any of the fields are variably-modified by the
8451 definition we normally use, since that would produce infinite
8452 recursion via pointers. */
8453 /* This is variably modified if some field's type is. */
8454 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8455 if (TREE_CODE (t) == FIELD_DECL)
8457 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8458 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8459 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8461 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8462 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8467 /* Do not call ourselves to avoid infinite recursion. This is
8468 variably modified if the element type is. */
8469 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8470 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8477 /* The current language may have other cases to check, but in general,
8478 all other types are not variably modified. */
8479 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8481 #undef RETURN_TRUE_IF_VAR
8484 /* Given a DECL or TYPE, return the scope in which it was declared, or
8485 NULL_TREE if there is no containing scope. */
8488 get_containing_scope (const_tree t)
8490 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8493 /* Return the innermost context enclosing DECL that is
8494 a FUNCTION_DECL, or zero if none. */
8497 decl_function_context (const_tree decl)
8501 if (TREE_CODE (decl) == ERROR_MARK)
8504 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8505 where we look up the function at runtime. Such functions always take
8506 a first argument of type 'pointer to real context'.
8508 C++ should really be fixed to use DECL_CONTEXT for the real context,
8509 and use something else for the "virtual context". */
8510 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8513 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8515 context = DECL_CONTEXT (decl);
8517 while (context && TREE_CODE (context) != FUNCTION_DECL)
8519 if (TREE_CODE (context) == BLOCK)
8520 context = BLOCK_SUPERCONTEXT (context);
8522 context = get_containing_scope (context);
8528 /* Return the innermost context enclosing DECL that is
8529 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8530 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8533 decl_type_context (const_tree decl)
8535 tree context = DECL_CONTEXT (decl);
8538 switch (TREE_CODE (context))
8540 case NAMESPACE_DECL:
8541 case TRANSLATION_UNIT_DECL:
8546 case QUAL_UNION_TYPE:
8551 context = DECL_CONTEXT (context);
8555 context = BLOCK_SUPERCONTEXT (context);
8565 /* CALL is a CALL_EXPR. Return the declaration for the function
8566 called, or NULL_TREE if the called function cannot be
8570 get_callee_fndecl (const_tree call)
8574 if (call == error_mark_node)
8575 return error_mark_node;
8577 /* It's invalid to call this function with anything but a
8579 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8581 /* The first operand to the CALL is the address of the function
8583 addr = CALL_EXPR_FN (call);
8587 /* If this is a readonly function pointer, extract its initial value. */
8588 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8589 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8590 && DECL_INITIAL (addr))
8591 addr = DECL_INITIAL (addr);
8593 /* If the address is just `&f' for some function `f', then we know
8594 that `f' is being called. */
8595 if (TREE_CODE (addr) == ADDR_EXPR
8596 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8597 return TREE_OPERAND (addr, 0);
8599 /* We couldn't figure out what was being called. */
8603 /* Print debugging information about tree nodes generated during the compile,
8604 and any language-specific information. */
8607 dump_tree_statistics (void)
8609 #ifdef GATHER_STATISTICS
8611 int total_nodes, total_bytes;
8614 fprintf (stderr, "\n??? tree nodes created\n\n");
8615 #ifdef GATHER_STATISTICS
8616 fprintf (stderr, "Kind Nodes Bytes\n");
8617 fprintf (stderr, "---------------------------------------\n");
8618 total_nodes = total_bytes = 0;
8619 for (i = 0; i < (int) all_kinds; i++)
8621 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8622 tree_node_counts[i], tree_node_sizes[i]);
8623 total_nodes += tree_node_counts[i];
8624 total_bytes += tree_node_sizes[i];
8626 fprintf (stderr, "---------------------------------------\n");
8627 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8628 fprintf (stderr, "---------------------------------------\n");
8629 fprintf (stderr, "Code Nodes\n");
8630 fprintf (stderr, "----------------------------\n");
8631 for (i = 0; i < (int) MAX_TREE_CODES; i++)
8632 fprintf (stderr, "%-20s %7d\n", tree_code_name[i], tree_code_counts[i]);
8633 fprintf (stderr, "----------------------------\n");
8634 ssanames_print_statistics ();
8635 phinodes_print_statistics ();
8637 fprintf (stderr, "(No per-node statistics)\n");
8639 print_type_hash_statistics ();
8640 print_debug_expr_statistics ();
8641 print_value_expr_statistics ();
8642 lang_hooks.print_statistics ();
8645 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8647 /* Generate a crc32 of a byte. */
8650 crc32_byte (unsigned chksum, char byte)
8652 unsigned value = (unsigned) byte << 24;
8655 for (ix = 8; ix--; value <<= 1)
8659 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8667 /* Generate a crc32 of a string. */
8670 crc32_string (unsigned chksum, const char *string)
8674 chksum = crc32_byte (chksum, *string);
8680 /* P is a string that will be used in a symbol. Mask out any characters
8681 that are not valid in that context. */
8684 clean_symbol_name (char *p)
8688 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8691 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8698 /* Generate a name for a special-purpose function.
8699 The generated name may need to be unique across the whole link.
8700 Changes to this function may also require corresponding changes to
8701 xstrdup_mask_random.
8702 TYPE is some string to identify the purpose of this function to the
8703 linker or collect2; it must start with an uppercase letter,
8705 I - for constructors
8707 N - for C++ anonymous namespaces
8708 F - for DWARF unwind frame information. */
8711 get_file_function_name (const char *type)
8717 /* If we already have a name we know to be unique, just use that. */
8718 if (first_global_object_name)
8719 p = q = ASTRDUP (first_global_object_name);
8720 /* If the target is handling the constructors/destructors, they
8721 will be local to this file and the name is only necessary for
8723 We also assign sub_I and sub_D sufixes to constructors called from
8724 the global static constructors. These are always local. */
8725 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8726 || (strncmp (type, "sub_", 4) == 0
8727 && (type[4] == 'I' || type[4] == 'D')))
8729 const char *file = main_input_filename;
8731 file = input_filename;
8732 /* Just use the file's basename, because the full pathname
8733 might be quite long. */
8734 p = q = ASTRDUP (lbasename (file));
8738 /* Otherwise, the name must be unique across the entire link.
8739 We don't have anything that we know to be unique to this translation
8740 unit, so use what we do have and throw in some randomness. */
8742 const char *name = weak_global_object_name;
8743 const char *file = main_input_filename;
8748 file = input_filename;
8750 len = strlen (file);
8751 q = (char *) alloca (9 + 17 + len + 1);
8752 memcpy (q, file, len + 1);
8754 snprintf (q + len, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX,
8755 crc32_string (0, name), get_random_seed (false));
8760 clean_symbol_name (q);
8761 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8764 /* Set up the name of the file-level functions we may need.
8765 Use a global object (which is already required to be unique over
8766 the program) rather than the file name (which imposes extra
8768 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8770 return get_identifier (buf);
8773 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8775 /* Complain that the tree code of NODE does not match the expected 0
8776 terminated list of trailing codes. The trailing code list can be
8777 empty, for a more vague error message. FILE, LINE, and FUNCTION
8778 are of the caller. */
8781 tree_check_failed (const_tree node, const char *file,
8782 int line, const char *function, ...)
8786 unsigned length = 0;
8789 va_start (args, function);
8790 while ((code = va_arg (args, int)))
8791 length += 4 + strlen (tree_code_name[code]);
8796 va_start (args, function);
8797 length += strlen ("expected ");
8798 buffer = tmp = (char *) alloca (length);
8800 while ((code = va_arg (args, int)))
8802 const char *prefix = length ? " or " : "expected ";
8804 strcpy (tmp + length, prefix);
8805 length += strlen (prefix);
8806 strcpy (tmp + length, tree_code_name[code]);
8807 length += strlen (tree_code_name[code]);
8812 buffer = "unexpected node";
8814 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8815 buffer, tree_code_name[TREE_CODE (node)],
8816 function, trim_filename (file), line);
8819 /* Complain that the tree code of NODE does match the expected 0
8820 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8824 tree_not_check_failed (const_tree node, const char *file,
8825 int line, const char *function, ...)
8829 unsigned length = 0;
8832 va_start (args, function);
8833 while ((code = va_arg (args, int)))
8834 length += 4 + strlen (tree_code_name[code]);
8836 va_start (args, function);
8837 buffer = (char *) alloca (length);
8839 while ((code = va_arg (args, int)))
8843 strcpy (buffer + length, " or ");
8846 strcpy (buffer + length, tree_code_name[code]);
8847 length += strlen (tree_code_name[code]);
8851 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8852 buffer, tree_code_name[TREE_CODE (node)],
8853 function, trim_filename (file), line);
8856 /* Similar to tree_check_failed, except that we check for a class of tree
8857 code, given in CL. */
8860 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8861 const char *file, int line, const char *function)
8864 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8865 TREE_CODE_CLASS_STRING (cl),
8866 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8867 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8870 /* Similar to tree_check_failed, except that instead of specifying a
8871 dozen codes, use the knowledge that they're all sequential. */
8874 tree_range_check_failed (const_tree node, const char *file, int line,
8875 const char *function, enum tree_code c1,
8879 unsigned length = 0;
8882 for (c = c1; c <= c2; ++c)
8883 length += 4 + strlen (tree_code_name[c]);
8885 length += strlen ("expected ");
8886 buffer = (char *) alloca (length);
8889 for (c = c1; c <= c2; ++c)
8891 const char *prefix = length ? " or " : "expected ";
8893 strcpy (buffer + length, prefix);
8894 length += strlen (prefix);
8895 strcpy (buffer + length, tree_code_name[c]);
8896 length += strlen (tree_code_name[c]);
8899 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8900 buffer, tree_code_name[TREE_CODE (node)],
8901 function, trim_filename (file), line);
8905 /* Similar to tree_check_failed, except that we check that a tree does
8906 not have the specified code, given in CL. */
8909 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8910 const char *file, int line, const char *function)
8913 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8914 TREE_CODE_CLASS_STRING (cl),
8915 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8916 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8920 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8923 omp_clause_check_failed (const_tree node, const char *file, int line,
8924 const char *function, enum omp_clause_code code)
8926 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8927 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8928 function, trim_filename (file), line);
8932 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8935 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8936 const char *function, enum omp_clause_code c1,
8937 enum omp_clause_code c2)
8940 unsigned length = 0;
8943 for (c = c1; c <= c2; ++c)
8944 length += 4 + strlen (omp_clause_code_name[c]);
8946 length += strlen ("expected ");
8947 buffer = (char *) alloca (length);
8950 for (c = c1; c <= c2; ++c)
8952 const char *prefix = length ? " or " : "expected ";
8954 strcpy (buffer + length, prefix);
8955 length += strlen (prefix);
8956 strcpy (buffer + length, omp_clause_code_name[c]);
8957 length += strlen (omp_clause_code_name[c]);
8960 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8961 buffer, omp_clause_code_name[TREE_CODE (node)],
8962 function, trim_filename (file), line);
8966 #undef DEFTREESTRUCT
8967 #define DEFTREESTRUCT(VAL, NAME) NAME,
8969 static const char *ts_enum_names[] = {
8970 #include "treestruct.def"
8972 #undef DEFTREESTRUCT
8974 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8976 /* Similar to tree_class_check_failed, except that we check for
8977 whether CODE contains the tree structure identified by EN. */
8980 tree_contains_struct_check_failed (const_tree node,
8981 const enum tree_node_structure_enum en,
8982 const char *file, int line,
8983 const char *function)
8986 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8988 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8992 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8993 (dynamically sized) vector. */
8996 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8997 const char *function)
9000 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9001 idx + 1, len, function, trim_filename (file), line);
9004 /* Similar to above, except that the check is for the bounds of the operand
9005 vector of an expression node EXP. */
9008 tree_operand_check_failed (int idx, const_tree exp, const char *file,
9009 int line, const char *function)
9011 int code = TREE_CODE (exp);
9013 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9014 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
9015 function, trim_filename (file), line);
9018 /* Similar to above, except that the check is for the number of
9019 operands of an OMP_CLAUSE node. */
9022 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
9023 int line, const char *function)
9026 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9027 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
9028 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
9029 trim_filename (file), line);
9031 #endif /* ENABLE_TREE_CHECKING */
9033 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9034 and mapped to the machine mode MODE. Initialize its fields and build
9035 the information necessary for debugging output. */
9038 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
9041 hashval_t hashcode = 0;
9043 t = make_node (VECTOR_TYPE);
9044 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
9045 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
9046 SET_TYPE_MODE (t, mode);
9048 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
9049 SET_TYPE_STRUCTURAL_EQUALITY (t);
9050 else if (TYPE_CANONICAL (innertype) != innertype
9051 || mode != VOIDmode)
9053 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
9057 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
9058 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
9059 hashcode = iterative_hash_host_wide_int (mode, hashcode);
9060 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
9061 t = type_hash_canon (hashcode, t);
9063 /* We have built a main variant, based on the main variant of the
9064 inner type. Use it to build the variant we return. */
9065 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
9066 && TREE_TYPE (t) != innertype)
9067 return build_type_attribute_qual_variant (t,
9068 TYPE_ATTRIBUTES (innertype),
9069 TYPE_QUALS (innertype));
9075 make_or_reuse_type (unsigned size, int unsignedp)
9077 if (size == INT_TYPE_SIZE)
9078 return unsignedp ? unsigned_type_node : integer_type_node;
9079 if (size == CHAR_TYPE_SIZE)
9080 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
9081 if (size == SHORT_TYPE_SIZE)
9082 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
9083 if (size == LONG_TYPE_SIZE)
9084 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
9085 if (size == LONG_LONG_TYPE_SIZE)
9086 return (unsignedp ? long_long_unsigned_type_node
9087 : long_long_integer_type_node);
9088 if (size == 128 && int128_integer_type_node)
9089 return (unsignedp ? int128_unsigned_type_node
9090 : int128_integer_type_node);
9093 return make_unsigned_type (size);
9095 return make_signed_type (size);
9098 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9101 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
9105 if (size == SHORT_FRACT_TYPE_SIZE)
9106 return unsignedp ? sat_unsigned_short_fract_type_node
9107 : sat_short_fract_type_node;
9108 if (size == FRACT_TYPE_SIZE)
9109 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
9110 if (size == LONG_FRACT_TYPE_SIZE)
9111 return unsignedp ? sat_unsigned_long_fract_type_node
9112 : sat_long_fract_type_node;
9113 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9114 return unsignedp ? sat_unsigned_long_long_fract_type_node
9115 : sat_long_long_fract_type_node;
9119 if (size == SHORT_FRACT_TYPE_SIZE)
9120 return unsignedp ? unsigned_short_fract_type_node
9121 : short_fract_type_node;
9122 if (size == FRACT_TYPE_SIZE)
9123 return unsignedp ? unsigned_fract_type_node : fract_type_node;
9124 if (size == LONG_FRACT_TYPE_SIZE)
9125 return unsignedp ? unsigned_long_fract_type_node
9126 : long_fract_type_node;
9127 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9128 return unsignedp ? unsigned_long_long_fract_type_node
9129 : long_long_fract_type_node;
9132 return make_fract_type (size, unsignedp, satp);
9135 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9138 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
9142 if (size == SHORT_ACCUM_TYPE_SIZE)
9143 return unsignedp ? sat_unsigned_short_accum_type_node
9144 : sat_short_accum_type_node;
9145 if (size == ACCUM_TYPE_SIZE)
9146 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
9147 if (size == LONG_ACCUM_TYPE_SIZE)
9148 return unsignedp ? sat_unsigned_long_accum_type_node
9149 : sat_long_accum_type_node;
9150 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9151 return unsignedp ? sat_unsigned_long_long_accum_type_node
9152 : sat_long_long_accum_type_node;
9156 if (size == SHORT_ACCUM_TYPE_SIZE)
9157 return unsignedp ? unsigned_short_accum_type_node
9158 : short_accum_type_node;
9159 if (size == ACCUM_TYPE_SIZE)
9160 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9161 if (size == LONG_ACCUM_TYPE_SIZE)
9162 return unsignedp ? unsigned_long_accum_type_node
9163 : long_accum_type_node;
9164 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9165 return unsignedp ? unsigned_long_long_accum_type_node
9166 : long_long_accum_type_node;
9169 return make_accum_type (size, unsignedp, satp);
9172 /* Create nodes for all integer types (and error_mark_node) using the sizes
9173 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9174 SHORT_DOUBLE specifies whether double should be of the same precision
9178 build_common_tree_nodes (bool signed_char, bool short_double)
9180 error_mark_node = make_node (ERROR_MARK);
9181 TREE_TYPE (error_mark_node) = error_mark_node;
9183 initialize_sizetypes ();
9185 /* Define both `signed char' and `unsigned char'. */
9186 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9187 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9188 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9189 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9191 /* Define `char', which is like either `signed char' or `unsigned char'
9192 but not the same as either. */
9195 ? make_signed_type (CHAR_TYPE_SIZE)
9196 : make_unsigned_type (CHAR_TYPE_SIZE));
9197 TYPE_STRING_FLAG (char_type_node) = 1;
9199 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9200 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9201 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9202 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9203 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9204 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9205 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9206 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9207 #if HOST_BITS_PER_WIDE_INT >= 64
9208 /* TODO: This isn't correct, but as logic depends at the moment on
9209 host's instead of target's wide-integer.
9210 If there is a target not supporting TImode, but has an 128-bit
9211 integer-scalar register, this target check needs to be adjusted. */
9212 if (targetm.scalar_mode_supported_p (TImode))
9214 int128_integer_type_node = make_signed_type (128);
9215 int128_unsigned_type_node = make_unsigned_type (128);
9219 /* Define a boolean type. This type only represents boolean values but
9220 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9221 Front ends which want to override this size (i.e. Java) can redefine
9222 boolean_type_node before calling build_common_tree_nodes_2. */
9223 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9224 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9225 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9226 TYPE_PRECISION (boolean_type_node) = 1;
9228 /* Define what type to use for size_t. */
9229 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
9230 size_type_node = unsigned_type_node;
9231 else if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
9232 size_type_node = long_unsigned_type_node;
9233 else if (strcmp (SIZE_TYPE, "long long unsigned int") == 0)
9234 size_type_node = long_long_unsigned_type_node;
9235 else if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
9236 size_type_node = short_unsigned_type_node;
9240 /* Fill in the rest of the sized types. Reuse existing type nodes
9242 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9243 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9244 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9245 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9246 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9248 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9249 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9250 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9251 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9252 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9254 access_public_node = get_identifier ("public");
9255 access_protected_node = get_identifier ("protected");
9256 access_private_node = get_identifier ("private");
9258 /* Define these next since types below may used them. */
9259 integer_zero_node = build_int_cst (integer_type_node, 0);
9260 integer_one_node = build_int_cst (integer_type_node, 1);
9261 integer_three_node = build_int_cst (integer_type_node, 3);
9262 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9264 size_zero_node = size_int (0);
9265 size_one_node = size_int (1);
9266 bitsize_zero_node = bitsize_int (0);
9267 bitsize_one_node = bitsize_int (1);
9268 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9270 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9271 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9273 void_type_node = make_node (VOID_TYPE);
9274 layout_type (void_type_node);
9276 /* We are not going to have real types in C with less than byte alignment,
9277 so we might as well not have any types that claim to have it. */
9278 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9279 TYPE_USER_ALIGN (void_type_node) = 0;
9281 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9282 layout_type (TREE_TYPE (null_pointer_node));
9284 ptr_type_node = build_pointer_type (void_type_node);
9286 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9287 fileptr_type_node = ptr_type_node;
9289 float_type_node = make_node (REAL_TYPE);
9290 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9291 layout_type (float_type_node);
9293 double_type_node = make_node (REAL_TYPE);
9295 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9297 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9298 layout_type (double_type_node);
9300 long_double_type_node = make_node (REAL_TYPE);
9301 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9302 layout_type (long_double_type_node);
9304 float_ptr_type_node = build_pointer_type (float_type_node);
9305 double_ptr_type_node = build_pointer_type (double_type_node);
9306 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9307 integer_ptr_type_node = build_pointer_type (integer_type_node);
9309 /* Fixed size integer types. */
9310 uint32_type_node = build_nonstandard_integer_type (32, true);
9311 uint64_type_node = build_nonstandard_integer_type (64, true);
9313 /* Decimal float types. */
9314 dfloat32_type_node = make_node (REAL_TYPE);
9315 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9316 layout_type (dfloat32_type_node);
9317 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9318 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9320 dfloat64_type_node = make_node (REAL_TYPE);
9321 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9322 layout_type (dfloat64_type_node);
9323 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9324 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9326 dfloat128_type_node = make_node (REAL_TYPE);
9327 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9328 layout_type (dfloat128_type_node);
9329 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9330 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9332 complex_integer_type_node = build_complex_type (integer_type_node);
9333 complex_float_type_node = build_complex_type (float_type_node);
9334 complex_double_type_node = build_complex_type (double_type_node);
9335 complex_long_double_type_node = build_complex_type (long_double_type_node);
9337 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9338 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9339 sat_ ## KIND ## _type_node = \
9340 make_sat_signed_ ## KIND ## _type (SIZE); \
9341 sat_unsigned_ ## KIND ## _type_node = \
9342 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9343 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9344 unsigned_ ## KIND ## _type_node = \
9345 make_unsigned_ ## KIND ## _type (SIZE);
9347 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9348 sat_ ## WIDTH ## KIND ## _type_node = \
9349 make_sat_signed_ ## KIND ## _type (SIZE); \
9350 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9351 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9352 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9353 unsigned_ ## WIDTH ## KIND ## _type_node = \
9354 make_unsigned_ ## KIND ## _type (SIZE);
9356 /* Make fixed-point type nodes based on four different widths. */
9357 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9358 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9359 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9360 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9361 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9363 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9364 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9365 NAME ## _type_node = \
9366 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9367 u ## NAME ## _type_node = \
9368 make_or_reuse_unsigned_ ## KIND ## _type \
9369 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9370 sat_ ## NAME ## _type_node = \
9371 make_or_reuse_sat_signed_ ## KIND ## _type \
9372 (GET_MODE_BITSIZE (MODE ## mode)); \
9373 sat_u ## NAME ## _type_node = \
9374 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9375 (GET_MODE_BITSIZE (U ## MODE ## mode));
9377 /* Fixed-point type and mode nodes. */
9378 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9379 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9380 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9381 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9382 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9383 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9384 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9385 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9386 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9387 MAKE_FIXED_MODE_NODE (accum, da, DA)
9388 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9391 tree t = targetm.build_builtin_va_list ();
9393 /* Many back-ends define record types without setting TYPE_NAME.
9394 If we copied the record type here, we'd keep the original
9395 record type without a name. This breaks name mangling. So,
9396 don't copy record types and let c_common_nodes_and_builtins()
9397 declare the type to be __builtin_va_list. */
9398 if (TREE_CODE (t) != RECORD_TYPE)
9399 t = build_variant_type_copy (t);
9401 va_list_type_node = t;
9405 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9408 local_define_builtin (const char *name, tree type, enum built_in_function code,
9409 const char *library_name, int ecf_flags)
9413 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9414 library_name, NULL_TREE);
9415 if (ecf_flags & ECF_CONST)
9416 TREE_READONLY (decl) = 1;
9417 if (ecf_flags & ECF_PURE)
9418 DECL_PURE_P (decl) = 1;
9419 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9420 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9421 if (ecf_flags & ECF_NORETURN)
9422 TREE_THIS_VOLATILE (decl) = 1;
9423 if (ecf_flags & ECF_NOTHROW)
9424 TREE_NOTHROW (decl) = 1;
9425 if (ecf_flags & ECF_MALLOC)
9426 DECL_IS_MALLOC (decl) = 1;
9427 if (ecf_flags & ECF_LEAF)
9428 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9429 NULL, DECL_ATTRIBUTES (decl));
9431 set_builtin_decl (code, decl, true);
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 (!builtin_decl_explicit_p (BUILT_IN_MEMCPY)
9444 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
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 (!builtin_decl_explicit_p (BUILT_IN_MEMCPY))
9451 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9452 "memcpy", ECF_NOTHROW | ECF_LEAF);
9453 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9454 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9455 "memmove", ECF_NOTHROW | ECF_LEAF);
9458 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP))
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 (!builtin_decl_explicit_p (BUILT_IN_MEMSET))
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 (!builtin_decl_explicit_p (BUILT_IN_ALLOCA))
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 ftype = build_function_type_list (ptr_type_node, size_type_node,
9485 size_type_node, NULL_TREE);
9486 local_define_builtin ("__builtin_alloca_with_align", ftype,
9487 BUILT_IN_ALLOCA_WITH_ALIGN, "alloca",
9488 ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9490 /* If we're checking the stack, `alloca' can throw. */
9491 if (flag_stack_check)
9493 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA)) = 0;
9494 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN)) = 0;
9497 ftype = build_function_type_list (void_type_node,
9498 ptr_type_node, ptr_type_node,
9499 ptr_type_node, NULL_TREE);
9500 local_define_builtin ("__builtin_init_trampoline", ftype,
9501 BUILT_IN_INIT_TRAMPOLINE,
9502 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9504 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9505 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9506 BUILT_IN_ADJUST_TRAMPOLINE,
9507 "__builtin_adjust_trampoline",
9508 ECF_CONST | ECF_NOTHROW);
9510 ftype = build_function_type_list (void_type_node,
9511 ptr_type_node, ptr_type_node, NULL_TREE);
9512 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9513 BUILT_IN_NONLOCAL_GOTO,
9514 "__builtin_nonlocal_goto",
9515 ECF_NORETURN | ECF_NOTHROW);
9517 ftype = build_function_type_list (void_type_node,
9518 ptr_type_node, ptr_type_node, NULL_TREE);
9519 local_define_builtin ("__builtin_setjmp_setup", ftype,
9520 BUILT_IN_SETJMP_SETUP,
9521 "__builtin_setjmp_setup", ECF_NOTHROW);
9523 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9524 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9525 BUILT_IN_SETJMP_DISPATCHER,
9526 "__builtin_setjmp_dispatcher",
9527 ECF_PURE | ECF_NOTHROW);
9529 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9530 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9531 BUILT_IN_SETJMP_RECEIVER,
9532 "__builtin_setjmp_receiver", ECF_NOTHROW);
9534 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9535 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9536 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9538 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9539 local_define_builtin ("__builtin_stack_restore", ftype,
9540 BUILT_IN_STACK_RESTORE,
9541 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9543 /* If there's a possibility that we might use the ARM EABI, build the
9544 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9545 if (targetm.arm_eabi_unwinder)
9547 ftype = build_function_type_list (void_type_node, NULL_TREE);
9548 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9549 BUILT_IN_CXA_END_CLEANUP,
9550 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9553 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9554 local_define_builtin ("__builtin_unwind_resume", ftype,
9555 BUILT_IN_UNWIND_RESUME,
9556 ((targetm_common.except_unwind_info (&global_options)
9558 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9561 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS) == NULL_TREE)
9563 ftype = build_function_type_list (ptr_type_node, integer_type_node,
9565 local_define_builtin ("__builtin_return_address", ftype,
9566 BUILT_IN_RETURN_ADDRESS,
9567 "__builtin_return_address",
9571 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER)
9572 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
9574 ftype = build_function_type_list (void_type_node, ptr_type_node,
9575 ptr_type_node, NULL_TREE);
9576 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER))
9577 local_define_builtin ("__cyg_profile_func_enter", ftype,
9578 BUILT_IN_PROFILE_FUNC_ENTER,
9579 "__cyg_profile_func_enter", 0);
9580 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
9581 local_define_builtin ("__cyg_profile_func_exit", ftype,
9582 BUILT_IN_PROFILE_FUNC_EXIT,
9583 "__cyg_profile_func_exit", 0);
9586 /* The exception object and filter values from the runtime. The argument
9587 must be zero before exception lowering, i.e. from the front end. After
9588 exception lowering, it will be the region number for the exception
9589 landing pad. These functions are PURE instead of CONST to prevent
9590 them from being hoisted past the exception edge that will initialize
9591 its value in the landing pad. */
9592 ftype = build_function_type_list (ptr_type_node,
9593 integer_type_node, NULL_TREE);
9594 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9595 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9597 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9598 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9599 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9600 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9602 ftype = build_function_type_list (void_type_node,
9603 integer_type_node, integer_type_node,
9605 local_define_builtin ("__builtin_eh_copy_values", ftype,
9606 BUILT_IN_EH_COPY_VALUES,
9607 "__builtin_eh_copy_values", ECF_NOTHROW);
9609 /* Complex multiplication and division. These are handled as builtins
9610 rather than optabs because emit_library_call_value doesn't support
9611 complex. Further, we can do slightly better with folding these
9612 beasties if the real and complex parts of the arguments are separate. */
9616 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9618 char mode_name_buf[4], *q;
9620 enum built_in_function mcode, dcode;
9621 tree type, inner_type;
9622 const char *prefix = "__";
9624 if (targetm.libfunc_gnu_prefix)
9627 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9630 inner_type = TREE_TYPE (type);
9632 ftype = build_function_type_list (type, inner_type, inner_type,
9633 inner_type, inner_type, NULL_TREE);
9635 mcode = ((enum built_in_function)
9636 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9637 dcode = ((enum built_in_function)
9638 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9640 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9644 built_in_names[mcode] = concat (prefix, "mul", mode_name_buf, "3",
9646 local_define_builtin (built_in_names[mcode], ftype, mcode,
9647 built_in_names[mcode],
9648 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9650 built_in_names[dcode] = concat (prefix, "div", mode_name_buf, "3",
9652 local_define_builtin (built_in_names[dcode], ftype, dcode,
9653 built_in_names[dcode],
9654 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9659 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9662 If we requested a pointer to a vector, build up the pointers that
9663 we stripped off while looking for the inner type. Similarly for
9664 return values from functions.
9666 The argument TYPE is the top of the chain, and BOTTOM is the
9667 new type which we will point to. */
9670 reconstruct_complex_type (tree type, tree bottom)
9674 if (TREE_CODE (type) == POINTER_TYPE)
9676 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9677 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9678 TYPE_REF_CAN_ALIAS_ALL (type));
9680 else if (TREE_CODE (type) == REFERENCE_TYPE)
9682 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9683 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9684 TYPE_REF_CAN_ALIAS_ALL (type));
9686 else if (TREE_CODE (type) == ARRAY_TYPE)
9688 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9689 outer = build_array_type (inner, TYPE_DOMAIN (type));
9691 else if (TREE_CODE (type) == FUNCTION_TYPE)
9693 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9694 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9696 else if (TREE_CODE (type) == METHOD_TYPE)
9698 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9699 /* The build_method_type_directly() routine prepends 'this' to argument list,
9700 so we must compensate by getting rid of it. */
9702 = build_method_type_directly
9703 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9705 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9707 else if (TREE_CODE (type) == OFFSET_TYPE)
9709 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9710 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9715 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9719 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9722 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9726 switch (GET_MODE_CLASS (mode))
9728 case MODE_VECTOR_INT:
9729 case MODE_VECTOR_FLOAT:
9730 case MODE_VECTOR_FRACT:
9731 case MODE_VECTOR_UFRACT:
9732 case MODE_VECTOR_ACCUM:
9733 case MODE_VECTOR_UACCUM:
9734 nunits = GET_MODE_NUNITS (mode);
9738 /* Check that there are no leftover bits. */
9739 gcc_assert (GET_MODE_BITSIZE (mode)
9740 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9742 nunits = GET_MODE_BITSIZE (mode)
9743 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9750 return make_vector_type (innertype, nunits, mode);
9753 /* Similarly, but takes the inner type and number of units, which must be
9757 build_vector_type (tree innertype, int nunits)
9759 return make_vector_type (innertype, nunits, VOIDmode);
9762 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9765 build_opaque_vector_type (tree innertype, int nunits)
9767 tree t = make_vector_type (innertype, nunits, VOIDmode);
9769 /* We always build the non-opaque variant before the opaque one,
9770 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9771 cand = TYPE_NEXT_VARIANT (t);
9773 && TYPE_VECTOR_OPAQUE (cand)
9774 && check_qualified_type (cand, t, TYPE_QUALS (t)))
9776 /* Othewise build a variant type and make sure to queue it after
9777 the non-opaque type. */
9778 cand = build_distinct_type_copy (t);
9779 TYPE_VECTOR_OPAQUE (cand) = true;
9780 TYPE_CANONICAL (cand) = TYPE_CANONICAL (t);
9781 TYPE_NEXT_VARIANT (cand) = TYPE_NEXT_VARIANT (t);
9782 TYPE_NEXT_VARIANT (t) = cand;
9783 TYPE_MAIN_VARIANT (cand) = TYPE_MAIN_VARIANT (t);
9788 /* Given an initializer INIT, return TRUE if INIT is zero or some
9789 aggregate of zeros. Otherwise return FALSE. */
9791 initializer_zerop (const_tree init)
9797 switch (TREE_CODE (init))
9800 return integer_zerop (init);
9803 /* ??? Note that this is not correct for C4X float formats. There,
9804 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9805 negative exponent. */
9806 return real_zerop (init)
9807 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9810 return fixed_zerop (init);
9813 return integer_zerop (init)
9814 || (real_zerop (init)
9815 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9816 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9819 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9820 if (!initializer_zerop (TREE_VALUE (elt)))
9826 unsigned HOST_WIDE_INT idx;
9828 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9829 if (!initializer_zerop (elt))
9838 /* We need to loop through all elements to handle cases like
9839 "\0" and "\0foobar". */
9840 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9841 if (TREE_STRING_POINTER (init)[i] != '\0')
9852 /* Build an empty statement at location LOC. */
9855 build_empty_stmt (location_t loc)
9857 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9858 SET_EXPR_LOCATION (t, loc);
9863 /* Build an OpenMP clause with code CODE. LOC is the location of the
9867 build_omp_clause (location_t loc, enum omp_clause_code code)
9872 length = omp_clause_num_ops[code];
9873 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9875 record_node_allocation_statistics (OMP_CLAUSE, size);
9877 t = ggc_alloc_tree_node (size);
9878 memset (t, 0, size);
9879 TREE_SET_CODE (t, OMP_CLAUSE);
9880 OMP_CLAUSE_SET_CODE (t, code);
9881 OMP_CLAUSE_LOCATION (t) = loc;
9886 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9887 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9888 Except for the CODE and operand count field, other storage for the
9889 object is initialized to zeros. */
9892 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9895 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9897 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9898 gcc_assert (len >= 1);
9900 record_node_allocation_statistics (code, length);
9902 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9904 TREE_SET_CODE (t, code);
9906 /* Can't use TREE_OPERAND to store the length because if checking is
9907 enabled, it will try to check the length before we store it. :-P */
9908 t->exp.operands[0] = build_int_cst (sizetype, len);
9913 /* Helper function for build_call_* functions; build a CALL_EXPR with
9914 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9915 the argument slots. */
9918 build_call_1 (tree return_type, tree fn, int nargs)
9922 t = build_vl_exp (CALL_EXPR, nargs + 3);
9923 TREE_TYPE (t) = return_type;
9924 CALL_EXPR_FN (t) = fn;
9925 CALL_EXPR_STATIC_CHAIN (t) = NULL;
9930 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9931 FN and a null static chain slot. NARGS is the number of call arguments
9932 which are specified as "..." arguments. */
9935 build_call_nary (tree return_type, tree fn, int nargs, ...)
9939 va_start (args, nargs);
9940 ret = build_call_valist (return_type, fn, nargs, args);
9945 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9946 FN and a null static chain slot. NARGS is the number of call arguments
9947 which are specified as a va_list ARGS. */
9950 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9955 t = build_call_1 (return_type, fn, nargs);
9956 for (i = 0; i < nargs; i++)
9957 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9958 process_call_operands (t);
9962 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9963 FN and a null static chain slot. NARGS is the number of call arguments
9964 which are specified as a tree array ARGS. */
9967 build_call_array_loc (location_t loc, tree return_type, tree fn,
9968 int nargs, const tree *args)
9973 t = build_call_1 (return_type, fn, nargs);
9974 for (i = 0; i < nargs; i++)
9975 CALL_EXPR_ARG (t, i) = args[i];
9976 process_call_operands (t);
9977 SET_EXPR_LOCATION (t, loc);
9981 /* Like build_call_array, but takes a VEC. */
9984 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9989 ret = build_call_1 (return_type, fn, VEC_length (tree, args));
9990 FOR_EACH_VEC_ELT (tree, args, ix, t)
9991 CALL_EXPR_ARG (ret, ix) = t;
9992 process_call_operands (ret);
9997 /* Returns true if it is possible to prove that the index of
9998 an array access REF (an ARRAY_REF expression) falls into the
10002 in_array_bounds_p (tree ref)
10004 tree idx = TREE_OPERAND (ref, 1);
10007 if (TREE_CODE (idx) != INTEGER_CST)
10010 min = array_ref_low_bound (ref);
10011 max = array_ref_up_bound (ref);
10014 || TREE_CODE (min) != INTEGER_CST
10015 || TREE_CODE (max) != INTEGER_CST)
10018 if (tree_int_cst_lt (idx, min)
10019 || tree_int_cst_lt (max, idx))
10025 /* Returns true if it is possible to prove that the range of
10026 an array access REF (an ARRAY_RANGE_REF expression) falls
10027 into the array bounds. */
10030 range_in_array_bounds_p (tree ref)
10032 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
10033 tree range_min, range_max, min, max;
10035 range_min = TYPE_MIN_VALUE (domain_type);
10036 range_max = TYPE_MAX_VALUE (domain_type);
10039 || TREE_CODE (range_min) != INTEGER_CST
10040 || TREE_CODE (range_max) != INTEGER_CST)
10043 min = array_ref_low_bound (ref);
10044 max = array_ref_up_bound (ref);
10047 || TREE_CODE (min) != INTEGER_CST
10048 || TREE_CODE (max) != INTEGER_CST)
10051 if (tree_int_cst_lt (range_min, min)
10052 || tree_int_cst_lt (max, range_max))
10058 /* Return true if T (assumed to be a DECL) must be assigned a memory
10062 needs_to_live_in_memory (const_tree t)
10064 if (TREE_CODE (t) == SSA_NAME)
10065 t = SSA_NAME_VAR (t);
10067 return (TREE_ADDRESSABLE (t)
10068 || is_global_var (t)
10069 || (TREE_CODE (t) == RESULT_DECL
10070 && !DECL_BY_REFERENCE (t)
10071 && aggregate_value_p (t, current_function_decl)));
10074 /* Return value of a constant X and sign-extend it. */
10077 int_cst_value (const_tree x)
10079 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10080 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
10082 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10083 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10084 || TREE_INT_CST_HIGH (x) == -1);
10086 if (bits < HOST_BITS_PER_WIDE_INT)
10088 bool negative = ((val >> (bits - 1)) & 1) != 0;
10090 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
10092 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
10098 /* Return value of a constant X and sign-extend it. */
10101 widest_int_cst_value (const_tree x)
10103 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10104 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
10106 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10107 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
10108 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
10109 << HOST_BITS_PER_WIDE_INT);
10111 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10112 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10113 || TREE_INT_CST_HIGH (x) == -1);
10116 if (bits < HOST_BITS_PER_WIDEST_INT)
10118 bool negative = ((val >> (bits - 1)) & 1) != 0;
10120 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
10122 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
10128 /* If TYPE is an integral type, return an equivalent type which is
10129 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
10130 return TYPE itself. */
10133 signed_or_unsigned_type_for (int unsignedp, tree type)
10136 if (POINTER_TYPE_P (type))
10138 /* If the pointer points to the normal address space, use the
10139 size_type_node. Otherwise use an appropriate size for the pointer
10140 based on the named address space it points to. */
10141 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
10142 t = size_type_node;
10144 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10147 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
10150 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10153 /* Returns unsigned variant of TYPE. */
10156 unsigned_type_for (tree type)
10158 return signed_or_unsigned_type_for (1, type);
10161 /* Returns signed variant of TYPE. */
10164 signed_type_for (tree type)
10166 return signed_or_unsigned_type_for (0, type);
10169 /* Returns the largest value obtainable by casting something in INNER type to
10173 upper_bound_in_type (tree outer, tree inner)
10176 unsigned int det = 0;
10177 unsigned oprec = TYPE_PRECISION (outer);
10178 unsigned iprec = TYPE_PRECISION (inner);
10181 /* Compute a unique number for every combination. */
10182 det |= (oprec > iprec) ? 4 : 0;
10183 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10184 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10186 /* Determine the exponent to use. */
10191 /* oprec <= iprec, outer: signed, inner: don't care. */
10196 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10200 /* oprec > iprec, outer: signed, inner: signed. */
10204 /* oprec > iprec, outer: signed, inner: unsigned. */
10208 /* oprec > iprec, outer: unsigned, inner: signed. */
10212 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10216 gcc_unreachable ();
10219 /* Compute 2^^prec - 1. */
10220 if (prec <= HOST_BITS_PER_WIDE_INT)
10223 high.low = ((~(unsigned HOST_WIDE_INT) 0)
10224 >> (HOST_BITS_PER_WIDE_INT - prec));
10228 high.high = ((~(unsigned HOST_WIDE_INT) 0)
10229 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
10230 high.low = ~(unsigned HOST_WIDE_INT) 0;
10233 return double_int_to_tree (outer, high);
10236 /* Returns the smallest value obtainable by casting something in INNER type to
10240 lower_bound_in_type (tree outer, tree inner)
10243 unsigned oprec = TYPE_PRECISION (outer);
10244 unsigned iprec = TYPE_PRECISION (inner);
10246 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10248 if (TYPE_UNSIGNED (outer)
10249 /* If we are widening something of an unsigned type, OUTER type
10250 contains all values of INNER type. In particular, both INNER
10251 and OUTER types have zero in common. */
10252 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10253 low.low = low.high = 0;
10256 /* If we are widening a signed type to another signed type, we
10257 want to obtain -2^^(iprec-1). If we are keeping the
10258 precision or narrowing to a signed type, we want to obtain
10260 unsigned prec = oprec > iprec ? iprec : oprec;
10262 if (prec <= HOST_BITS_PER_WIDE_INT)
10264 low.high = ~(unsigned HOST_WIDE_INT) 0;
10265 low.low = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10269 low.high = ((~(unsigned HOST_WIDE_INT) 0)
10270 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10275 return double_int_to_tree (outer, low);
10278 /* Return nonzero if two operands that are suitable for PHI nodes are
10279 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10280 SSA_NAME or invariant. Note that this is strictly an optimization.
10281 That is, callers of this function can directly call operand_equal_p
10282 and get the same result, only slower. */
10285 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10289 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10291 return operand_equal_p (arg0, arg1, 0);
10294 /* Returns number of zeros at the end of binary representation of X.
10296 ??? Use ffs if available? */
10299 num_ending_zeros (const_tree x)
10301 unsigned HOST_WIDE_INT fr, nfr;
10302 unsigned num, abits;
10303 tree type = TREE_TYPE (x);
10305 if (TREE_INT_CST_LOW (x) == 0)
10307 num = HOST_BITS_PER_WIDE_INT;
10308 fr = TREE_INT_CST_HIGH (x);
10313 fr = TREE_INT_CST_LOW (x);
10316 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10319 if (nfr << abits == fr)
10326 if (num > TYPE_PRECISION (type))
10327 num = TYPE_PRECISION (type);
10329 return build_int_cst_type (type, num);
10333 #define WALK_SUBTREE(NODE) \
10336 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10342 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10343 be walked whenever a type is seen in the tree. Rest of operands and return
10344 value are as for walk_tree. */
10347 walk_type_fields (tree type, walk_tree_fn func, void *data,
10348 struct pointer_set_t *pset, walk_tree_lh lh)
10350 tree result = NULL_TREE;
10352 switch (TREE_CODE (type))
10355 case REFERENCE_TYPE:
10356 /* We have to worry about mutually recursive pointers. These can't
10357 be written in C. They can in Ada. It's pathological, but
10358 there's an ACATS test (c38102a) that checks it. Deal with this
10359 by checking if we're pointing to another pointer, that one
10360 points to another pointer, that one does too, and we have no htab.
10361 If so, get a hash table. We check three levels deep to avoid
10362 the cost of the hash table if we don't need one. */
10363 if (POINTER_TYPE_P (TREE_TYPE (type))
10364 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10365 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10368 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10376 /* ... fall through ... */
10379 WALK_SUBTREE (TREE_TYPE (type));
10383 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10385 /* Fall through. */
10387 case FUNCTION_TYPE:
10388 WALK_SUBTREE (TREE_TYPE (type));
10392 /* We never want to walk into default arguments. */
10393 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10394 WALK_SUBTREE (TREE_VALUE (arg));
10399 /* Don't follow this nodes's type if a pointer for fear that
10400 we'll have infinite recursion. If we have a PSET, then we
10403 || (!POINTER_TYPE_P (TREE_TYPE (type))
10404 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10405 WALK_SUBTREE (TREE_TYPE (type));
10406 WALK_SUBTREE (TYPE_DOMAIN (type));
10410 WALK_SUBTREE (TREE_TYPE (type));
10411 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10421 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10422 called with the DATA and the address of each sub-tree. If FUNC returns a
10423 non-NULL value, the traversal is stopped, and the value returned by FUNC
10424 is returned. If PSET is non-NULL it is used to record the nodes visited,
10425 and to avoid visiting a node more than once. */
10428 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10429 struct pointer_set_t *pset, walk_tree_lh lh)
10431 enum tree_code code;
10435 #define WALK_SUBTREE_TAIL(NODE) \
10439 goto tail_recurse; \
10444 /* Skip empty subtrees. */
10448 /* Don't walk the same tree twice, if the user has requested
10449 that we avoid doing so. */
10450 if (pset && pointer_set_insert (pset, *tp))
10453 /* Call the function. */
10455 result = (*func) (tp, &walk_subtrees, data);
10457 /* If we found something, return it. */
10461 code = TREE_CODE (*tp);
10463 /* Even if we didn't, FUNC may have decided that there was nothing
10464 interesting below this point in the tree. */
10465 if (!walk_subtrees)
10467 /* But we still need to check our siblings. */
10468 if (code == TREE_LIST)
10469 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10470 else if (code == OMP_CLAUSE)
10471 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10478 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10479 if (result || !walk_subtrees)
10486 case IDENTIFIER_NODE:
10493 case PLACEHOLDER_EXPR:
10497 /* None of these have subtrees other than those already walked
10502 WALK_SUBTREE (TREE_VALUE (*tp));
10503 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10508 int len = TREE_VEC_LENGTH (*tp);
10513 /* Walk all elements but the first. */
10515 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10517 /* Now walk the first one as a tail call. */
10518 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10522 WALK_SUBTREE (TREE_REALPART (*tp));
10523 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10527 unsigned HOST_WIDE_INT idx;
10528 constructor_elt *ce;
10531 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10533 WALK_SUBTREE (ce->value);
10538 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10543 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10545 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10546 into declarations that are just mentioned, rather than
10547 declared; they don't really belong to this part of the tree.
10548 And, we can see cycles: the initializer for a declaration
10549 can refer to the declaration itself. */
10550 WALK_SUBTREE (DECL_INITIAL (decl));
10551 WALK_SUBTREE (DECL_SIZE (decl));
10552 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10554 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10557 case STATEMENT_LIST:
10559 tree_stmt_iterator i;
10560 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10561 WALK_SUBTREE (*tsi_stmt_ptr (i));
10566 switch (OMP_CLAUSE_CODE (*tp))
10568 case OMP_CLAUSE_PRIVATE:
10569 case OMP_CLAUSE_SHARED:
10570 case OMP_CLAUSE_FIRSTPRIVATE:
10571 case OMP_CLAUSE_COPYIN:
10572 case OMP_CLAUSE_COPYPRIVATE:
10573 case OMP_CLAUSE_FINAL:
10574 case OMP_CLAUSE_IF:
10575 case OMP_CLAUSE_NUM_THREADS:
10576 case OMP_CLAUSE_SCHEDULE:
10577 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10580 case OMP_CLAUSE_NOWAIT:
10581 case OMP_CLAUSE_ORDERED:
10582 case OMP_CLAUSE_DEFAULT:
10583 case OMP_CLAUSE_UNTIED:
10584 case OMP_CLAUSE_MERGEABLE:
10585 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10587 case OMP_CLAUSE_LASTPRIVATE:
10588 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10589 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10590 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10592 case OMP_CLAUSE_COLLAPSE:
10595 for (i = 0; i < 3; i++)
10596 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10597 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10600 case OMP_CLAUSE_REDUCTION:
10603 for (i = 0; i < 4; i++)
10604 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10605 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10609 gcc_unreachable ();
10617 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10618 But, we only want to walk once. */
10619 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10620 for (i = 0; i < len; ++i)
10621 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10622 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10626 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10627 defining. We only want to walk into these fields of a type in this
10628 case and not in the general case of a mere reference to the type.
10630 The criterion is as follows: if the field can be an expression, it
10631 must be walked only here. This should be in keeping with the fields
10632 that are directly gimplified in gimplify_type_sizes in order for the
10633 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10634 variable-sized types.
10636 Note that DECLs get walked as part of processing the BIND_EXPR. */
10637 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10639 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10640 if (TREE_CODE (*type_p) == ERROR_MARK)
10643 /* Call the function for the type. See if it returns anything or
10644 doesn't want us to continue. If we are to continue, walk both
10645 the normal fields and those for the declaration case. */
10646 result = (*func) (type_p, &walk_subtrees, data);
10647 if (result || !walk_subtrees)
10650 /* But do not walk a pointed-to type since it may itself need to
10651 be walked in the declaration case if it isn't anonymous. */
10652 if (!POINTER_TYPE_P (*type_p))
10654 result = walk_type_fields (*type_p, func, data, pset, lh);
10659 /* If this is a record type, also walk the fields. */
10660 if (RECORD_OR_UNION_TYPE_P (*type_p))
10664 for (field = TYPE_FIELDS (*type_p); field;
10665 field = DECL_CHAIN (field))
10667 /* We'd like to look at the type of the field, but we can
10668 easily get infinite recursion. So assume it's pointed
10669 to elsewhere in the tree. Also, ignore things that
10671 if (TREE_CODE (field) != FIELD_DECL)
10674 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10675 WALK_SUBTREE (DECL_SIZE (field));
10676 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10677 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10678 WALK_SUBTREE (DECL_QUALIFIER (field));
10682 /* Same for scalar types. */
10683 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10684 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10685 || TREE_CODE (*type_p) == INTEGER_TYPE
10686 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10687 || TREE_CODE (*type_p) == REAL_TYPE)
10689 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10690 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10693 WALK_SUBTREE (TYPE_SIZE (*type_p));
10694 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10699 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10703 /* Walk over all the sub-trees of this operand. */
10704 len = TREE_OPERAND_LENGTH (*tp);
10706 /* Go through the subtrees. We need to do this in forward order so
10707 that the scope of a FOR_EXPR is handled properly. */
10710 for (i = 0; i < len - 1; ++i)
10711 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10712 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10715 /* If this is a type, walk the needed fields in the type. */
10716 else if (TYPE_P (*tp))
10717 return walk_type_fields (*tp, func, data, pset, lh);
10721 /* We didn't find what we were looking for. */
10724 #undef WALK_SUBTREE_TAIL
10726 #undef WALK_SUBTREE
10728 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10731 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10735 struct pointer_set_t *pset;
10737 pset = pointer_set_create ();
10738 result = walk_tree_1 (tp, func, data, pset, lh);
10739 pointer_set_destroy (pset);
10745 tree_block (tree t)
10747 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10749 if (IS_EXPR_CODE_CLASS (c))
10750 return &t->exp.block;
10751 gcc_unreachable ();
10755 /* Create a nameless artificial label and put it in the current
10756 function context. The label has a location of LOC. Returns the
10757 newly created label. */
10760 create_artificial_label (location_t loc)
10762 tree lab = build_decl (loc,
10763 LABEL_DECL, NULL_TREE, void_type_node);
10765 DECL_ARTIFICIAL (lab) = 1;
10766 DECL_IGNORED_P (lab) = 1;
10767 DECL_CONTEXT (lab) = current_function_decl;
10771 /* Given a tree, try to return a useful variable name that we can use
10772 to prefix a temporary that is being assigned the value of the tree.
10773 I.E. given <temp> = &A, return A. */
10778 tree stripped_decl;
10781 STRIP_NOPS (stripped_decl);
10782 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10783 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10786 switch (TREE_CODE (stripped_decl))
10789 return get_name (TREE_OPERAND (stripped_decl, 0));
10796 /* Return true if TYPE has a variable argument list. */
10799 stdarg_p (const_tree fntype)
10801 function_args_iterator args_iter;
10802 tree n = NULL_TREE, t;
10807 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10812 return n != NULL_TREE && n != void_type_node;
10815 /* Return true if TYPE has a prototype. */
10818 prototype_p (tree fntype)
10822 gcc_assert (fntype != NULL_TREE);
10824 t = TYPE_ARG_TYPES (fntype);
10825 return (t != NULL_TREE);
10828 /* If BLOCK is inlined from an __attribute__((__artificial__))
10829 routine, return pointer to location from where it has been
10832 block_nonartificial_location (tree block)
10834 location_t *ret = NULL;
10836 while (block && TREE_CODE (block) == BLOCK
10837 && BLOCK_ABSTRACT_ORIGIN (block))
10839 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10841 while (TREE_CODE (ao) == BLOCK
10842 && BLOCK_ABSTRACT_ORIGIN (ao)
10843 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10844 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10846 if (TREE_CODE (ao) == FUNCTION_DECL)
10848 /* If AO is an artificial inline, point RET to the
10849 call site locus at which it has been inlined and continue
10850 the loop, in case AO's caller is also an artificial
10852 if (DECL_DECLARED_INLINE_P (ao)
10853 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10854 ret = &BLOCK_SOURCE_LOCATION (block);
10858 else if (TREE_CODE (ao) != BLOCK)
10861 block = BLOCK_SUPERCONTEXT (block);
10867 /* If EXP is inlined from an __attribute__((__artificial__))
10868 function, return the location of the original call expression. */
10871 tree_nonartificial_location (tree exp)
10873 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10878 return EXPR_LOCATION (exp);
10882 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10885 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10888 cl_option_hash_hash (const void *x)
10890 const_tree const t = (const_tree) x;
10894 hashval_t hash = 0;
10896 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10898 p = (const char *)TREE_OPTIMIZATION (t);
10899 len = sizeof (struct cl_optimization);
10902 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10904 p = (const char *)TREE_TARGET_OPTION (t);
10905 len = sizeof (struct cl_target_option);
10909 gcc_unreachable ();
10911 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10913 for (i = 0; i < len; i++)
10915 hash = (hash << 4) ^ ((i << 2) | p[i]);
10920 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10921 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10925 cl_option_hash_eq (const void *x, const void *y)
10927 const_tree const xt = (const_tree) x;
10928 const_tree const yt = (const_tree) y;
10933 if (TREE_CODE (xt) != TREE_CODE (yt))
10936 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10938 xp = (const char *)TREE_OPTIMIZATION (xt);
10939 yp = (const char *)TREE_OPTIMIZATION (yt);
10940 len = sizeof (struct cl_optimization);
10943 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10945 xp = (const char *)TREE_TARGET_OPTION (xt);
10946 yp = (const char *)TREE_TARGET_OPTION (yt);
10947 len = sizeof (struct cl_target_option);
10951 gcc_unreachable ();
10953 return (memcmp (xp, yp, len) == 0);
10956 /* Build an OPTIMIZATION_NODE based on the current options. */
10959 build_optimization_node (void)
10964 /* Use the cache of optimization nodes. */
10966 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
10969 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10973 /* Insert this one into the hash table. */
10974 t = cl_optimization_node;
10977 /* Make a new node for next time round. */
10978 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10984 /* Build a TARGET_OPTION_NODE based on the current options. */
10987 build_target_option_node (void)
10992 /* Use the cache of optimization nodes. */
10994 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
10997 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
11001 /* Insert this one into the hash table. */
11002 t = cl_target_option_node;
11005 /* Make a new node for next time round. */
11006 cl_target_option_node = make_node (TARGET_OPTION_NODE);
11012 /* Determine the "ultimate origin" of a block. The block may be an inlined
11013 instance of an inlined instance of a block which is local to an inline
11014 function, so we have to trace all of the way back through the origin chain
11015 to find out what sort of node actually served as the original seed for the
11019 block_ultimate_origin (const_tree block)
11021 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
11023 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11024 nodes in the function to point to themselves; ignore that if
11025 we're trying to output the abstract instance of this function. */
11026 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
11029 if (immediate_origin == NULL_TREE)
11034 tree lookahead = immediate_origin;
11038 ret_val = lookahead;
11039 lookahead = (TREE_CODE (ret_val) == BLOCK
11040 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
11042 while (lookahead != NULL && lookahead != ret_val);
11044 /* The block's abstract origin chain may not be the *ultimate* origin of
11045 the block. It could lead to a DECL that has an abstract origin set.
11046 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11047 will give us if it has one). Note that DECL's abstract origins are
11048 supposed to be the most distant ancestor (or so decl_ultimate_origin
11049 claims), so we don't need to loop following the DECL origins. */
11050 if (DECL_P (ret_val))
11051 return DECL_ORIGIN (ret_val);
11057 /* Return true if T1 and T2 are equivalent lists. */
11060 list_equal_p (const_tree t1, const_tree t2)
11062 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
11063 if (TREE_VALUE (t1) != TREE_VALUE (t2))
11068 /* Return true iff conversion in EXP generates no instruction. Mark
11069 it inline so that we fully inline into the stripping functions even
11070 though we have two uses of this function. */
11073 tree_nop_conversion (const_tree exp)
11075 tree outer_type, inner_type;
11077 if (!CONVERT_EXPR_P (exp)
11078 && TREE_CODE (exp) != NON_LVALUE_EXPR)
11080 if (TREE_OPERAND (exp, 0) == error_mark_node)
11083 outer_type = TREE_TYPE (exp);
11084 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11089 /* Use precision rather then machine mode when we can, which gives
11090 the correct answer even for submode (bit-field) types. */
11091 if ((INTEGRAL_TYPE_P (outer_type)
11092 || POINTER_TYPE_P (outer_type)
11093 || TREE_CODE (outer_type) == OFFSET_TYPE)
11094 && (INTEGRAL_TYPE_P (inner_type)
11095 || POINTER_TYPE_P (inner_type)
11096 || TREE_CODE (inner_type) == OFFSET_TYPE))
11097 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
11099 /* Otherwise fall back on comparing machine modes (e.g. for
11100 aggregate types, floats). */
11101 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
11104 /* Return true iff conversion in EXP generates no instruction. Don't
11105 consider conversions changing the signedness. */
11108 tree_sign_nop_conversion (const_tree exp)
11110 tree outer_type, inner_type;
11112 if (!tree_nop_conversion (exp))
11115 outer_type = TREE_TYPE (exp);
11116 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11118 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
11119 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
11122 /* Strip conversions from EXP according to tree_nop_conversion and
11123 return the resulting expression. */
11126 tree_strip_nop_conversions (tree exp)
11128 while (tree_nop_conversion (exp))
11129 exp = TREE_OPERAND (exp, 0);
11133 /* Strip conversions from EXP according to tree_sign_nop_conversion
11134 and return the resulting expression. */
11137 tree_strip_sign_nop_conversions (tree exp)
11139 while (tree_sign_nop_conversion (exp))
11140 exp = TREE_OPERAND (exp, 0);
11144 static GTY(()) tree gcc_eh_personality_decl;
11146 /* Return the GCC personality function decl. */
11149 lhd_gcc_personality (void)
11151 if (!gcc_eh_personality_decl)
11152 gcc_eh_personality_decl = build_personality_function ("gcc");
11153 return gcc_eh_personality_decl;
11156 /* Try to find a base info of BINFO that would have its field decl at offset
11157 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11158 found, return, otherwise return NULL_TREE. */
11161 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
11163 tree type = BINFO_TYPE (binfo);
11167 HOST_WIDE_INT pos, size;
11171 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (expected_type))
11176 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
11178 if (TREE_CODE (fld) != FIELD_DECL)
11181 pos = int_bit_position (fld);
11182 size = tree_low_cst (DECL_SIZE (fld), 1);
11183 if (pos <= offset && (pos + size) > offset)
11186 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
11189 if (!DECL_ARTIFICIAL (fld))
11191 binfo = TYPE_BINFO (TREE_TYPE (fld));
11195 /* Offset 0 indicates the primary base, whose vtable contents are
11196 represented in the binfo for the derived class. */
11197 else if (offset != 0)
11199 tree base_binfo, found_binfo = NULL_TREE;
11200 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
11201 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
11203 found_binfo = base_binfo;
11208 binfo = found_binfo;
11211 type = TREE_TYPE (fld);
11216 /* Returns true if X is a typedef decl. */
11219 is_typedef_decl (tree x)
11221 return (x && TREE_CODE (x) == TYPE_DECL
11222 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
11225 /* Returns true iff TYPE is a type variant created for a typedef. */
11228 typedef_variant_p (tree type)
11230 return is_typedef_decl (TYPE_NAME (type));
11233 /* Warn about a use of an identifier which was marked deprecated. */
11235 warn_deprecated_use (tree node, tree attr)
11239 if (node == 0 || !warn_deprecated_decl)
11245 attr = DECL_ATTRIBUTES (node);
11246 else if (TYPE_P (node))
11248 tree decl = TYPE_STUB_DECL (node);
11250 attr = lookup_attribute ("deprecated",
11251 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
11256 attr = lookup_attribute ("deprecated", attr);
11259 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
11265 expanded_location xloc = expand_location (DECL_SOURCE_LOCATION (node));
11267 warning (OPT_Wdeprecated_declarations,
11268 "%qD is deprecated (declared at %s:%d): %s",
11269 node, xloc.file, xloc.line, msg);
11271 warning (OPT_Wdeprecated_declarations,
11272 "%qD is deprecated (declared at %s:%d)",
11273 node, xloc.file, xloc.line);
11275 else if (TYPE_P (node))
11277 tree what = NULL_TREE;
11278 tree decl = TYPE_STUB_DECL (node);
11280 if (TYPE_NAME (node))
11282 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
11283 what = TYPE_NAME (node);
11284 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
11285 && DECL_NAME (TYPE_NAME (node)))
11286 what = DECL_NAME (TYPE_NAME (node));
11291 expanded_location xloc
11292 = expand_location (DECL_SOURCE_LOCATION (decl));
11296 warning (OPT_Wdeprecated_declarations,
11297 "%qE is deprecated (declared at %s:%d): %s",
11298 what, xloc.file, xloc.line, msg);
11300 warning (OPT_Wdeprecated_declarations,
11301 "%qE is deprecated (declared at %s:%d)", what,
11302 xloc.file, xloc.line);
11307 warning (OPT_Wdeprecated_declarations,
11308 "type is deprecated (declared at %s:%d): %s",
11309 xloc.file, xloc.line, msg);
11311 warning (OPT_Wdeprecated_declarations,
11312 "type is deprecated (declared at %s:%d)",
11313 xloc.file, xloc.line);
11321 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
11324 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
11329 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
11332 warning (OPT_Wdeprecated_declarations, "type is deprecated");
11338 #include "gt-tree.h"