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, 2012 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 Note that for a C string literal, LEN should include the trailing NUL.
1529 The TREE_TYPE is not initialized. */
1532 build_string (int len, const char *str)
1537 /* Do not waste bytes provided by padding of struct tree_string. */
1538 length = len + offsetof (struct tree_string, str) + 1;
1540 record_node_allocation_statistics (STRING_CST, length);
1542 s = ggc_alloc_tree_node (length);
1544 memset (s, 0, sizeof (struct tree_typed));
1545 TREE_SET_CODE (s, STRING_CST);
1546 TREE_CONSTANT (s) = 1;
1547 TREE_STRING_LENGTH (s) = len;
1548 memcpy (s->string.str, str, len);
1549 s->string.str[len] = '\0';
1554 /* Return a newly constructed COMPLEX_CST node whose value is
1555 specified by the real and imaginary parts REAL and IMAG.
1556 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1557 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1560 build_complex (tree type, tree real, tree imag)
1562 tree t = make_node (COMPLEX_CST);
1564 TREE_REALPART (t) = real;
1565 TREE_IMAGPART (t) = imag;
1566 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1567 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1571 /* Return a constant of arithmetic type TYPE which is the
1572 multiplicative identity of the set TYPE. */
1575 build_one_cst (tree type)
1577 switch (TREE_CODE (type))
1579 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1580 case POINTER_TYPE: case REFERENCE_TYPE:
1582 return build_int_cst (type, 1);
1585 return build_real (type, dconst1);
1587 case FIXED_POINT_TYPE:
1588 /* We can only generate 1 for accum types. */
1589 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1590 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1594 tree scalar = build_one_cst (TREE_TYPE (type));
1596 return build_vector_from_val (type, scalar);
1600 return build_complex (type,
1601 build_one_cst (TREE_TYPE (type)),
1602 build_zero_cst (TREE_TYPE (type)));
1609 /* Build 0 constant of type TYPE. This is used by constructor folding
1610 and thus the constant should be represented in memory by
1614 build_zero_cst (tree type)
1616 switch (TREE_CODE (type))
1618 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1619 case POINTER_TYPE: case REFERENCE_TYPE:
1621 return build_int_cst (type, 0);
1624 return build_real (type, dconst0);
1626 case FIXED_POINT_TYPE:
1627 return build_fixed (type, FCONST0 (TYPE_MODE (type)));
1631 tree scalar = build_zero_cst (TREE_TYPE (type));
1633 return build_vector_from_val (type, scalar);
1638 tree zero = build_zero_cst (TREE_TYPE (type));
1640 return build_complex (type, zero, zero);
1644 if (!AGGREGATE_TYPE_P (type))
1645 return fold_convert (type, integer_zero_node);
1646 return build_constructor (type, NULL);
1651 /* Build a BINFO with LEN language slots. */
1654 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1657 size_t length = (offsetof (struct tree_binfo, base_binfos)
1658 + VEC_embedded_size (tree, base_binfos));
1660 record_node_allocation_statistics (TREE_BINFO, length);
1662 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1664 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1666 TREE_SET_CODE (t, TREE_BINFO);
1668 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1673 /* Create a CASE_LABEL_EXPR tree node and return it. */
1676 build_case_label (tree low_value, tree high_value, tree label_decl)
1678 tree t = make_node (CASE_LABEL_EXPR);
1680 TREE_TYPE (t) = void_type_node;
1681 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (label_decl));
1683 CASE_LOW (t) = low_value;
1684 CASE_HIGH (t) = high_value;
1685 CASE_LABEL (t) = label_decl;
1686 CASE_CHAIN (t) = NULL_TREE;
1691 /* Build a newly constructed TREE_VEC node of length LEN. */
1694 make_tree_vec_stat (int len MEM_STAT_DECL)
1697 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1699 record_node_allocation_statistics (TREE_VEC, length);
1701 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1703 TREE_SET_CODE (t, TREE_VEC);
1704 TREE_VEC_LENGTH (t) = len;
1709 /* Return 1 if EXPR is the integer constant zero or a complex constant
1713 integer_zerop (const_tree expr)
1717 return ((TREE_CODE (expr) == INTEGER_CST
1718 && TREE_INT_CST_LOW (expr) == 0
1719 && TREE_INT_CST_HIGH (expr) == 0)
1720 || (TREE_CODE (expr) == COMPLEX_CST
1721 && integer_zerop (TREE_REALPART (expr))
1722 && integer_zerop (TREE_IMAGPART (expr))));
1725 /* Return 1 if EXPR is the integer constant one or the corresponding
1726 complex constant. */
1729 integer_onep (const_tree expr)
1733 return ((TREE_CODE (expr) == INTEGER_CST
1734 && TREE_INT_CST_LOW (expr) == 1
1735 && TREE_INT_CST_HIGH (expr) == 0)
1736 || (TREE_CODE (expr) == COMPLEX_CST
1737 && integer_onep (TREE_REALPART (expr))
1738 && integer_zerop (TREE_IMAGPART (expr))));
1741 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1742 it contains. Likewise for the corresponding complex constant. */
1745 integer_all_onesp (const_tree expr)
1752 if (TREE_CODE (expr) == COMPLEX_CST
1753 && integer_all_onesp (TREE_REALPART (expr))
1754 && integer_zerop (TREE_IMAGPART (expr)))
1757 else if (TREE_CODE (expr) != INTEGER_CST)
1760 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1761 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1762 && TREE_INT_CST_HIGH (expr) == -1)
1767 prec = TYPE_PRECISION (TREE_TYPE (expr));
1768 if (prec >= HOST_BITS_PER_WIDE_INT)
1770 HOST_WIDE_INT high_value;
1773 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1775 /* Can not handle precisions greater than twice the host int size. */
1776 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1777 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1778 /* Shifting by the host word size is undefined according to the ANSI
1779 standard, so we must handle this as a special case. */
1782 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1784 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1785 && TREE_INT_CST_HIGH (expr) == high_value);
1788 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1791 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1795 integer_pow2p (const_tree expr)
1798 HOST_WIDE_INT high, low;
1802 if (TREE_CODE (expr) == COMPLEX_CST
1803 && integer_pow2p (TREE_REALPART (expr))
1804 && integer_zerop (TREE_IMAGPART (expr)))
1807 if (TREE_CODE (expr) != INTEGER_CST)
1810 prec = TYPE_PRECISION (TREE_TYPE (expr));
1811 high = TREE_INT_CST_HIGH (expr);
1812 low = TREE_INT_CST_LOW (expr);
1814 /* First clear all bits that are beyond the type's precision in case
1815 we've been sign extended. */
1817 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1819 else if (prec > HOST_BITS_PER_WIDE_INT)
1820 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1824 if (prec < HOST_BITS_PER_WIDE_INT)
1825 low &= ~((HOST_WIDE_INT) (-1) << prec);
1828 if (high == 0 && low == 0)
1831 return ((high == 0 && (low & (low - 1)) == 0)
1832 || (low == 0 && (high & (high - 1)) == 0));
1835 /* Return 1 if EXPR is an integer constant other than zero or a
1836 complex constant other than zero. */
1839 integer_nonzerop (const_tree expr)
1843 return ((TREE_CODE (expr) == INTEGER_CST
1844 && (TREE_INT_CST_LOW (expr) != 0
1845 || TREE_INT_CST_HIGH (expr) != 0))
1846 || (TREE_CODE (expr) == COMPLEX_CST
1847 && (integer_nonzerop (TREE_REALPART (expr))
1848 || integer_nonzerop (TREE_IMAGPART (expr)))));
1851 /* Return 1 if EXPR is the fixed-point constant zero. */
1854 fixed_zerop (const_tree expr)
1856 return (TREE_CODE (expr) == FIXED_CST
1857 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1860 /* Return the power of two represented by a tree node known to be a
1864 tree_log2 (const_tree expr)
1867 HOST_WIDE_INT high, low;
1871 if (TREE_CODE (expr) == COMPLEX_CST)
1872 return tree_log2 (TREE_REALPART (expr));
1874 prec = TYPE_PRECISION (TREE_TYPE (expr));
1875 high = TREE_INT_CST_HIGH (expr);
1876 low = TREE_INT_CST_LOW (expr);
1878 /* First clear all bits that are beyond the type's precision in case
1879 we've been sign extended. */
1881 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1883 else if (prec > HOST_BITS_PER_WIDE_INT)
1884 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1888 if (prec < HOST_BITS_PER_WIDE_INT)
1889 low &= ~((HOST_WIDE_INT) (-1) << prec);
1892 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1893 : exact_log2 (low));
1896 /* Similar, but return the largest integer Y such that 2 ** Y is less
1897 than or equal to EXPR. */
1900 tree_floor_log2 (const_tree expr)
1903 HOST_WIDE_INT high, low;
1907 if (TREE_CODE (expr) == COMPLEX_CST)
1908 return tree_log2 (TREE_REALPART (expr));
1910 prec = TYPE_PRECISION (TREE_TYPE (expr));
1911 high = TREE_INT_CST_HIGH (expr);
1912 low = TREE_INT_CST_LOW (expr);
1914 /* First clear all bits that are beyond the type's precision in case
1915 we've been sign extended. Ignore if type's precision hasn't been set
1916 since what we are doing is setting it. */
1918 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1920 else if (prec > HOST_BITS_PER_WIDE_INT)
1921 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1925 if (prec < HOST_BITS_PER_WIDE_INT)
1926 low &= ~((HOST_WIDE_INT) (-1) << prec);
1929 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1930 : floor_log2 (low));
1933 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1934 decimal float constants, so don't return 1 for them. */
1937 real_zerop (const_tree expr)
1941 return ((TREE_CODE (expr) == REAL_CST
1942 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1943 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1944 || (TREE_CODE (expr) == COMPLEX_CST
1945 && real_zerop (TREE_REALPART (expr))
1946 && real_zerop (TREE_IMAGPART (expr))));
1949 /* Return 1 if EXPR is the real constant one in real or complex form.
1950 Trailing zeroes matter for decimal float constants, so don't return
1954 real_onep (const_tree expr)
1958 return ((TREE_CODE (expr) == REAL_CST
1959 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1960 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1961 || (TREE_CODE (expr) == COMPLEX_CST
1962 && real_onep (TREE_REALPART (expr))
1963 && real_zerop (TREE_IMAGPART (expr))));
1966 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1967 for decimal float constants, so don't return 1 for them. */
1970 real_twop (const_tree expr)
1974 return ((TREE_CODE (expr) == REAL_CST
1975 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1976 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1977 || (TREE_CODE (expr) == COMPLEX_CST
1978 && real_twop (TREE_REALPART (expr))
1979 && real_zerop (TREE_IMAGPART (expr))));
1982 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1983 matter for decimal float constants, so don't return 1 for them. */
1986 real_minus_onep (const_tree expr)
1990 return ((TREE_CODE (expr) == REAL_CST
1991 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1992 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1993 || (TREE_CODE (expr) == COMPLEX_CST
1994 && real_minus_onep (TREE_REALPART (expr))
1995 && real_zerop (TREE_IMAGPART (expr))));
1998 /* Nonzero if EXP is a constant or a cast of a constant. */
2001 really_constant_p (const_tree exp)
2003 /* This is not quite the same as STRIP_NOPS. It does more. */
2004 while (CONVERT_EXPR_P (exp)
2005 || TREE_CODE (exp) == NON_LVALUE_EXPR)
2006 exp = TREE_OPERAND (exp, 0);
2007 return TREE_CONSTANT (exp);
2010 /* Return first list element whose TREE_VALUE is ELEM.
2011 Return 0 if ELEM is not in LIST. */
2014 value_member (tree elem, tree list)
2018 if (elem == TREE_VALUE (list))
2020 list = TREE_CHAIN (list);
2025 /* Return first list element whose TREE_PURPOSE is ELEM.
2026 Return 0 if ELEM is not in LIST. */
2029 purpose_member (const_tree elem, tree list)
2033 if (elem == TREE_PURPOSE (list))
2035 list = TREE_CHAIN (list);
2040 /* Return true if ELEM is in V. */
2043 vec_member (const_tree elem, VEC(tree,gc) *v)
2047 FOR_EACH_VEC_ELT (tree, v, ix, t)
2053 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2057 chain_index (int idx, tree chain)
2059 for (; chain && idx > 0; --idx)
2060 chain = TREE_CHAIN (chain);
2064 /* Return nonzero if ELEM is part of the chain CHAIN. */
2067 chain_member (const_tree elem, const_tree chain)
2073 chain = DECL_CHAIN (chain);
2079 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2080 We expect a null pointer to mark the end of the chain.
2081 This is the Lisp primitive `length'. */
2084 list_length (const_tree t)
2087 #ifdef ENABLE_TREE_CHECKING
2095 #ifdef ENABLE_TREE_CHECKING
2098 gcc_assert (p != q);
2106 /* Returns the number of FIELD_DECLs in TYPE. */
2109 fields_length (const_tree type)
2111 tree t = TYPE_FIELDS (type);
2114 for (; t; t = DECL_CHAIN (t))
2115 if (TREE_CODE (t) == FIELD_DECL)
2121 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2122 UNION_TYPE TYPE, or NULL_TREE if none. */
2125 first_field (const_tree type)
2127 tree t = TYPE_FIELDS (type);
2128 while (t && TREE_CODE (t) != FIELD_DECL)
2133 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2134 by modifying the last node in chain 1 to point to chain 2.
2135 This is the Lisp primitive `nconc'. */
2138 chainon (tree op1, tree op2)
2147 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2149 TREE_CHAIN (t1) = op2;
2151 #ifdef ENABLE_TREE_CHECKING
2154 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2155 gcc_assert (t2 != t1);
2162 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2165 tree_last (tree chain)
2169 while ((next = TREE_CHAIN (chain)))
2174 /* Reverse the order of elements in the chain T,
2175 and return the new head of the chain (old last element). */
2180 tree prev = 0, decl, next;
2181 for (decl = t; decl; decl = next)
2183 /* We shouldn't be using this function to reverse BLOCK chains; we
2184 have blocks_nreverse for that. */
2185 gcc_checking_assert (TREE_CODE (decl) != BLOCK);
2186 next = TREE_CHAIN (decl);
2187 TREE_CHAIN (decl) = prev;
2193 /* Return a newly created TREE_LIST node whose
2194 purpose and value fields are PARM and VALUE. */
2197 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2199 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2200 TREE_PURPOSE (t) = parm;
2201 TREE_VALUE (t) = value;
2205 /* Build a chain of TREE_LIST nodes from a vector. */
2208 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2210 tree ret = NULL_TREE;
2214 FOR_EACH_VEC_ELT (tree, vec, i, t)
2216 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2217 pp = &TREE_CHAIN (*pp);
2222 /* Return a newly created TREE_LIST node whose
2223 purpose and value fields are PURPOSE and VALUE
2224 and whose TREE_CHAIN is CHAIN. */
2227 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2231 node = ggc_alloc_zone_tree_node_stat (&tree_zone, sizeof (struct tree_list)
2233 memset (node, 0, sizeof (struct tree_common));
2235 record_node_allocation_statistics (TREE_LIST, sizeof (struct tree_list));
2237 TREE_SET_CODE (node, TREE_LIST);
2238 TREE_CHAIN (node) = chain;
2239 TREE_PURPOSE (node) = purpose;
2240 TREE_VALUE (node) = value;
2244 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2248 ctor_to_vec (tree ctor)
2250 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2254 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2255 VEC_quick_push (tree, vec, val);
2260 /* Return the size nominally occupied by an object of type TYPE
2261 when it resides in memory. The value is measured in units of bytes,
2262 and its data type is that normally used for type sizes
2263 (which is the first type created by make_signed_type or
2264 make_unsigned_type). */
2267 size_in_bytes (const_tree type)
2271 if (type == error_mark_node)
2272 return integer_zero_node;
2274 type = TYPE_MAIN_VARIANT (type);
2275 t = TYPE_SIZE_UNIT (type);
2279 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2280 return size_zero_node;
2286 /* Return the size of TYPE (in bytes) as a wide integer
2287 or return -1 if the size can vary or is larger than an integer. */
2290 int_size_in_bytes (const_tree type)
2294 if (type == error_mark_node)
2297 type = TYPE_MAIN_VARIANT (type);
2298 t = TYPE_SIZE_UNIT (type);
2300 || TREE_CODE (t) != INTEGER_CST
2301 || TREE_INT_CST_HIGH (t) != 0
2302 /* If the result would appear negative, it's too big to represent. */
2303 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2306 return TREE_INT_CST_LOW (t);
2309 /* Return the maximum size of TYPE (in bytes) as a wide integer
2310 or return -1 if the size can vary or is larger than an integer. */
2313 max_int_size_in_bytes (const_tree type)
2315 HOST_WIDE_INT size = -1;
2318 /* If this is an array type, check for a possible MAX_SIZE attached. */
2320 if (TREE_CODE (type) == ARRAY_TYPE)
2322 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2324 if (size_tree && host_integerp (size_tree, 1))
2325 size = tree_low_cst (size_tree, 1);
2328 /* If we still haven't been able to get a size, see if the language
2329 can compute a maximum size. */
2333 size_tree = lang_hooks.types.max_size (type);
2335 if (size_tree && host_integerp (size_tree, 1))
2336 size = tree_low_cst (size_tree, 1);
2342 /* Returns a tree for the size of EXP in bytes. */
2345 tree_expr_size (const_tree exp)
2348 && DECL_SIZE_UNIT (exp) != 0)
2349 return DECL_SIZE_UNIT (exp);
2351 return size_in_bytes (TREE_TYPE (exp));
2354 /* Return the bit position of FIELD, in bits from the start of the record.
2355 This is a tree of type bitsizetype. */
2358 bit_position (const_tree field)
2360 return bit_from_pos (DECL_FIELD_OFFSET (field),
2361 DECL_FIELD_BIT_OFFSET (field));
2364 /* Likewise, but return as an integer. It must be representable in
2365 that way (since it could be a signed value, we don't have the
2366 option of returning -1 like int_size_in_byte can. */
2369 int_bit_position (const_tree field)
2371 return tree_low_cst (bit_position (field), 0);
2374 /* Return the byte position of FIELD, in bytes from the start of the record.
2375 This is a tree of type sizetype. */
2378 byte_position (const_tree field)
2380 return byte_from_pos (DECL_FIELD_OFFSET (field),
2381 DECL_FIELD_BIT_OFFSET (field));
2384 /* Likewise, but return as an integer. It must be representable in
2385 that way (since it could be a signed value, we don't have the
2386 option of returning -1 like int_size_in_byte can. */
2389 int_byte_position (const_tree field)
2391 return tree_low_cst (byte_position (field), 0);
2394 /* Return the strictest alignment, in bits, that T is known to have. */
2397 expr_align (const_tree t)
2399 unsigned int align0, align1;
2401 switch (TREE_CODE (t))
2403 CASE_CONVERT: case NON_LVALUE_EXPR:
2404 /* If we have conversions, we know that the alignment of the
2405 object must meet each of the alignments of the types. */
2406 align0 = expr_align (TREE_OPERAND (t, 0));
2407 align1 = TYPE_ALIGN (TREE_TYPE (t));
2408 return MAX (align0, align1);
2410 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2411 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2412 case CLEANUP_POINT_EXPR:
2413 /* These don't change the alignment of an object. */
2414 return expr_align (TREE_OPERAND (t, 0));
2417 /* The best we can do is say that the alignment is the least aligned
2419 align0 = expr_align (TREE_OPERAND (t, 1));
2420 align1 = expr_align (TREE_OPERAND (t, 2));
2421 return MIN (align0, align1);
2423 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2424 meaningfully, it's always 1. */
2425 case LABEL_DECL: case CONST_DECL:
2426 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2428 gcc_assert (DECL_ALIGN (t) != 0);
2429 return DECL_ALIGN (t);
2435 /* Otherwise take the alignment from that of the type. */
2436 return TYPE_ALIGN (TREE_TYPE (t));
2439 /* Return, as a tree node, the number of elements for TYPE (which is an
2440 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2443 array_type_nelts (const_tree type)
2445 tree index_type, min, max;
2447 /* If they did it with unspecified bounds, then we should have already
2448 given an error about it before we got here. */
2449 if (! TYPE_DOMAIN (type))
2450 return error_mark_node;
2452 index_type = TYPE_DOMAIN (type);
2453 min = TYPE_MIN_VALUE (index_type);
2454 max = TYPE_MAX_VALUE (index_type);
2456 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2458 return error_mark_node;
2460 return (integer_zerop (min)
2462 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2465 /* If arg is static -- a reference to an object in static storage -- then
2466 return the object. This is not the same as the C meaning of `static'.
2467 If arg isn't static, return NULL. */
2472 switch (TREE_CODE (arg))
2475 /* Nested functions are static, even though taking their address will
2476 involve a trampoline as we unnest the nested function and create
2477 the trampoline on the tree level. */
2481 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2482 && ! DECL_THREAD_LOCAL_P (arg)
2483 && ! DECL_DLLIMPORT_P (arg)
2487 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2491 return TREE_STATIC (arg) ? arg : NULL;
2498 /* If the thing being referenced is not a field, then it is
2499 something language specific. */
2500 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2502 /* If we are referencing a bitfield, we can't evaluate an
2503 ADDR_EXPR at compile time and so it isn't a constant. */
2504 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2507 return staticp (TREE_OPERAND (arg, 0));
2513 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2516 case ARRAY_RANGE_REF:
2517 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2518 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2519 return staticp (TREE_OPERAND (arg, 0));
2523 case COMPOUND_LITERAL_EXPR:
2524 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2534 /* Return whether OP is a DECL whose address is function-invariant. */
2537 decl_address_invariant_p (const_tree op)
2539 /* The conditions below are slightly less strict than the one in
2542 switch (TREE_CODE (op))
2551 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2552 || DECL_THREAD_LOCAL_P (op)
2553 || DECL_CONTEXT (op) == current_function_decl
2554 || decl_function_context (op) == current_function_decl)
2559 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2560 || decl_function_context (op) == current_function_decl)
2571 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2574 decl_address_ip_invariant_p (const_tree op)
2576 /* The conditions below are slightly less strict than the one in
2579 switch (TREE_CODE (op))
2587 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2588 && !DECL_DLLIMPORT_P (op))
2589 || DECL_THREAD_LOCAL_P (op))
2594 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2606 /* Return true if T is function-invariant (internal function, does
2607 not handle arithmetic; that's handled in skip_simple_arithmetic and
2608 tree_invariant_p). */
2610 static bool tree_invariant_p (tree t);
2613 tree_invariant_p_1 (tree t)
2617 if (TREE_CONSTANT (t)
2618 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2621 switch (TREE_CODE (t))
2627 op = TREE_OPERAND (t, 0);
2628 while (handled_component_p (op))
2630 switch (TREE_CODE (op))
2633 case ARRAY_RANGE_REF:
2634 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2635 || TREE_OPERAND (op, 2) != NULL_TREE
2636 || TREE_OPERAND (op, 3) != NULL_TREE)
2641 if (TREE_OPERAND (op, 2) != NULL_TREE)
2647 op = TREE_OPERAND (op, 0);
2650 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2659 /* Return true if T is function-invariant. */
2662 tree_invariant_p (tree t)
2664 tree inner = skip_simple_arithmetic (t);
2665 return tree_invariant_p_1 (inner);
2668 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2669 Do this to any expression which may be used in more than one place,
2670 but must be evaluated only once.
2672 Normally, expand_expr would reevaluate the expression each time.
2673 Calling save_expr produces something that is evaluated and recorded
2674 the first time expand_expr is called on it. Subsequent calls to
2675 expand_expr just reuse the recorded value.
2677 The call to expand_expr that generates code that actually computes
2678 the value is the first call *at compile time*. Subsequent calls
2679 *at compile time* generate code to use the saved value.
2680 This produces correct result provided that *at run time* control
2681 always flows through the insns made by the first expand_expr
2682 before reaching the other places where the save_expr was evaluated.
2683 You, the caller of save_expr, must make sure this is so.
2685 Constants, and certain read-only nodes, are returned with no
2686 SAVE_EXPR because that is safe. Expressions containing placeholders
2687 are not touched; see tree.def for an explanation of what these
2691 save_expr (tree expr)
2693 tree t = fold (expr);
2696 /* If the tree evaluates to a constant, then we don't want to hide that
2697 fact (i.e. this allows further folding, and direct checks for constants).
2698 However, a read-only object that has side effects cannot be bypassed.
2699 Since it is no problem to reevaluate literals, we just return the
2701 inner = skip_simple_arithmetic (t);
2702 if (TREE_CODE (inner) == ERROR_MARK)
2705 if (tree_invariant_p_1 (inner))
2708 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2709 it means that the size or offset of some field of an object depends on
2710 the value within another field.
2712 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2713 and some variable since it would then need to be both evaluated once and
2714 evaluated more than once. Front-ends must assure this case cannot
2715 happen by surrounding any such subexpressions in their own SAVE_EXPR
2716 and forcing evaluation at the proper time. */
2717 if (contains_placeholder_p (inner))
2720 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2721 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2723 /* This expression might be placed ahead of a jump to ensure that the
2724 value was computed on both sides of the jump. So make sure it isn't
2725 eliminated as dead. */
2726 TREE_SIDE_EFFECTS (t) = 1;
2730 /* Look inside EXPR and into any simple arithmetic operations. Return
2731 the innermost non-arithmetic node. */
2734 skip_simple_arithmetic (tree expr)
2738 /* We don't care about whether this can be used as an lvalue in this
2740 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2741 expr = TREE_OPERAND (expr, 0);
2743 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2744 a constant, it will be more efficient to not make another SAVE_EXPR since
2745 it will allow better simplification and GCSE will be able to merge the
2746 computations if they actually occur. */
2750 if (UNARY_CLASS_P (inner))
2751 inner = TREE_OPERAND (inner, 0);
2752 else if (BINARY_CLASS_P (inner))
2754 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2755 inner = TREE_OPERAND (inner, 0);
2756 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2757 inner = TREE_OPERAND (inner, 1);
2769 /* Return which tree structure is used by T. */
2771 enum tree_node_structure_enum
2772 tree_node_structure (const_tree t)
2774 const enum tree_code code = TREE_CODE (t);
2775 return tree_node_structure_for_code (code);
2778 /* Set various status flags when building a CALL_EXPR object T. */
2781 process_call_operands (tree t)
2783 bool side_effects = TREE_SIDE_EFFECTS (t);
2784 bool read_only = false;
2785 int i = call_expr_flags (t);
2787 /* Calls have side-effects, except those to const or pure functions. */
2788 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2789 side_effects = true;
2790 /* Propagate TREE_READONLY of arguments for const functions. */
2794 if (!side_effects || read_only)
2795 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2797 tree op = TREE_OPERAND (t, i);
2798 if (op && TREE_SIDE_EFFECTS (op))
2799 side_effects = true;
2800 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2804 TREE_SIDE_EFFECTS (t) = side_effects;
2805 TREE_READONLY (t) = read_only;
2808 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2809 size or offset that depends on a field within a record. */
2812 contains_placeholder_p (const_tree exp)
2814 enum tree_code code;
2819 code = TREE_CODE (exp);
2820 if (code == PLACEHOLDER_EXPR)
2823 switch (TREE_CODE_CLASS (code))
2826 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2827 position computations since they will be converted into a
2828 WITH_RECORD_EXPR involving the reference, which will assume
2829 here will be valid. */
2830 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2832 case tcc_exceptional:
2833 if (code == TREE_LIST)
2834 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2835 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2840 case tcc_comparison:
2841 case tcc_expression:
2845 /* Ignoring the first operand isn't quite right, but works best. */
2846 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2849 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2850 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2851 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2854 /* The save_expr function never wraps anything containing
2855 a PLACEHOLDER_EXPR. */
2862 switch (TREE_CODE_LENGTH (code))
2865 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2867 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2868 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2879 const_call_expr_arg_iterator iter;
2880 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2881 if (CONTAINS_PLACEHOLDER_P (arg))
2895 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2896 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2900 type_contains_placeholder_1 (const_tree type)
2902 /* If the size contains a placeholder or the parent type (component type in
2903 the case of arrays) type involves a placeholder, this type does. */
2904 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2905 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2906 || (!POINTER_TYPE_P (type)
2908 && type_contains_placeholder_p (TREE_TYPE (type))))
2911 /* Now do type-specific checks. Note that the last part of the check above
2912 greatly limits what we have to do below. */
2913 switch (TREE_CODE (type))
2921 case REFERENCE_TYPE:
2929 case FIXED_POINT_TYPE:
2930 /* Here we just check the bounds. */
2931 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2932 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2935 /* We have already checked the component type above, so just check the
2937 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2941 case QUAL_UNION_TYPE:
2945 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2946 if (TREE_CODE (field) == FIELD_DECL
2947 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2948 || (TREE_CODE (type) == QUAL_UNION_TYPE
2949 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2950 || type_contains_placeholder_p (TREE_TYPE (field))))
2961 /* Wrapper around above function used to cache its result. */
2964 type_contains_placeholder_p (tree type)
2968 /* If the contains_placeholder_bits field has been initialized,
2969 then we know the answer. */
2970 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2971 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2973 /* Indicate that we've seen this type node, and the answer is false.
2974 This is what we want to return if we run into recursion via fields. */
2975 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2977 /* Compute the real value. */
2978 result = type_contains_placeholder_1 (type);
2980 /* Store the real value. */
2981 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2986 /* Push tree EXP onto vector QUEUE if it is not already present. */
2989 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2994 FOR_EACH_VEC_ELT (tree, *queue, i, iter)
2995 if (simple_cst_equal (iter, exp) == 1)
2999 VEC_safe_push (tree, heap, *queue, exp);
3002 /* Given a tree EXP, find all occurences of references to fields
3003 in a PLACEHOLDER_EXPR and place them in vector REFS without
3004 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3005 we assume here that EXP contains only arithmetic expressions
3006 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3010 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
3012 enum tree_code code = TREE_CODE (exp);
3016 /* We handle TREE_LIST and COMPONENT_REF separately. */
3017 if (code == TREE_LIST)
3019 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
3020 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
3022 else if (code == COMPONENT_REF)
3024 for (inner = TREE_OPERAND (exp, 0);
3025 REFERENCE_CLASS_P (inner);
3026 inner = TREE_OPERAND (inner, 0))
3029 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
3030 push_without_duplicates (exp, refs);
3032 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
3035 switch (TREE_CODE_CLASS (code))
3040 case tcc_declaration:
3041 /* Variables allocated to static storage can stay. */
3042 if (!TREE_STATIC (exp))
3043 push_without_duplicates (exp, refs);
3046 case tcc_expression:
3047 /* This is the pattern built in ada/make_aligning_type. */
3048 if (code == ADDR_EXPR
3049 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
3051 push_without_duplicates (exp, refs);
3055 /* Fall through... */
3057 case tcc_exceptional:
3060 case tcc_comparison:
3062 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3063 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3067 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3068 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3076 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3077 return a tree with all occurrences of references to F in a
3078 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3079 CONST_DECLs. Note that we assume here that EXP contains only
3080 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3081 occurring only in their argument list. */
3084 substitute_in_expr (tree exp, tree f, tree r)
3086 enum tree_code code = TREE_CODE (exp);
3087 tree op0, op1, op2, op3;
3090 /* We handle TREE_LIST and COMPONENT_REF separately. */
3091 if (code == TREE_LIST)
3093 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3094 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3095 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3098 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3100 else if (code == COMPONENT_REF)
3104 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3105 and it is the right field, replace it with R. */
3106 for (inner = TREE_OPERAND (exp, 0);
3107 REFERENCE_CLASS_P (inner);
3108 inner = TREE_OPERAND (inner, 0))
3112 op1 = TREE_OPERAND (exp, 1);
3114 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3117 /* If this expression hasn't been completed let, leave it alone. */
3118 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3121 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3122 if (op0 == TREE_OPERAND (exp, 0))
3126 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3129 switch (TREE_CODE_CLASS (code))
3134 case tcc_declaration:
3140 case tcc_expression:
3144 /* Fall through... */
3146 case tcc_exceptional:
3149 case tcc_comparison:
3151 switch (TREE_CODE_LENGTH (code))
3157 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3158 if (op0 == TREE_OPERAND (exp, 0))
3161 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3165 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3166 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3168 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3171 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3175 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3176 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3177 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3179 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3180 && op2 == TREE_OPERAND (exp, 2))
3183 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3187 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3188 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3189 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3190 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3192 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3193 && op2 == TREE_OPERAND (exp, 2)
3194 && op3 == TREE_OPERAND (exp, 3))
3198 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3210 new_tree = NULL_TREE;
3212 /* If we are trying to replace F with a constant, inline back
3213 functions which do nothing else than computing a value from
3214 the arguments they are passed. This makes it possible to
3215 fold partially or entirely the replacement expression. */
3216 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3218 tree t = maybe_inline_call_in_expr (exp);
3220 return SUBSTITUTE_IN_EXPR (t, f, r);
3223 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3225 tree op = TREE_OPERAND (exp, i);
3226 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3230 new_tree = copy_node (exp);
3231 TREE_OPERAND (new_tree, i) = new_op;
3237 new_tree = fold (new_tree);
3238 if (TREE_CODE (new_tree) == CALL_EXPR)
3239 process_call_operands (new_tree);
3250 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3252 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3253 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3258 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3259 for it within OBJ, a tree that is an object or a chain of references. */
3262 substitute_placeholder_in_expr (tree exp, tree obj)
3264 enum tree_code code = TREE_CODE (exp);
3265 tree op0, op1, op2, op3;
3268 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3269 in the chain of OBJ. */
3270 if (code == PLACEHOLDER_EXPR)
3272 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3275 for (elt = obj; elt != 0;
3276 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3277 || TREE_CODE (elt) == COND_EXPR)
3278 ? TREE_OPERAND (elt, 1)
3279 : (REFERENCE_CLASS_P (elt)
3280 || UNARY_CLASS_P (elt)
3281 || BINARY_CLASS_P (elt)
3282 || VL_EXP_CLASS_P (elt)
3283 || EXPRESSION_CLASS_P (elt))
3284 ? TREE_OPERAND (elt, 0) : 0))
3285 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3288 for (elt = obj; elt != 0;
3289 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3290 || TREE_CODE (elt) == COND_EXPR)
3291 ? TREE_OPERAND (elt, 1)
3292 : (REFERENCE_CLASS_P (elt)
3293 || UNARY_CLASS_P (elt)
3294 || BINARY_CLASS_P (elt)
3295 || VL_EXP_CLASS_P (elt)
3296 || EXPRESSION_CLASS_P (elt))
3297 ? TREE_OPERAND (elt, 0) : 0))
3298 if (POINTER_TYPE_P (TREE_TYPE (elt))
3299 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3301 return fold_build1 (INDIRECT_REF, need_type, elt);
3303 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3304 survives until RTL generation, there will be an error. */
3308 /* TREE_LIST is special because we need to look at TREE_VALUE
3309 and TREE_CHAIN, not TREE_OPERANDS. */
3310 else if (code == TREE_LIST)
3312 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3313 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3314 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3317 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3320 switch (TREE_CODE_CLASS (code))
3323 case tcc_declaration:
3326 case tcc_exceptional:
3329 case tcc_comparison:
3330 case tcc_expression:
3333 switch (TREE_CODE_LENGTH (code))
3339 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3340 if (op0 == TREE_OPERAND (exp, 0))
3343 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3347 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3348 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3350 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3353 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3357 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3358 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3359 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3361 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3362 && op2 == TREE_OPERAND (exp, 2))
3365 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3369 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3370 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3371 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3372 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3374 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3375 && op2 == TREE_OPERAND (exp, 2)
3376 && op3 == TREE_OPERAND (exp, 3))
3380 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3392 new_tree = NULL_TREE;
3394 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3396 tree op = TREE_OPERAND (exp, i);
3397 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3401 new_tree = copy_node (exp);
3402 TREE_OPERAND (new_tree, i) = new_op;
3408 new_tree = fold (new_tree);
3409 if (TREE_CODE (new_tree) == CALL_EXPR)
3410 process_call_operands (new_tree);
3421 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3423 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3424 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3429 /* Stabilize a reference so that we can use it any number of times
3430 without causing its operands to be evaluated more than once.
3431 Returns the stabilized reference. This works by means of save_expr,
3432 so see the caveats in the comments about save_expr.
3434 Also allows conversion expressions whose operands are references.
3435 Any other kind of expression is returned unchanged. */
3438 stabilize_reference (tree ref)
3441 enum tree_code code = TREE_CODE (ref);
3448 /* No action is needed in this case. */
3453 case FIX_TRUNC_EXPR:
3454 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3458 result = build_nt (INDIRECT_REF,
3459 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3463 result = build_nt (COMPONENT_REF,
3464 stabilize_reference (TREE_OPERAND (ref, 0)),
3465 TREE_OPERAND (ref, 1), NULL_TREE);
3469 result = build_nt (BIT_FIELD_REF,
3470 stabilize_reference (TREE_OPERAND (ref, 0)),
3471 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3472 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3476 result = build_nt (ARRAY_REF,
3477 stabilize_reference (TREE_OPERAND (ref, 0)),
3478 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3479 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3482 case ARRAY_RANGE_REF:
3483 result = build_nt (ARRAY_RANGE_REF,
3484 stabilize_reference (TREE_OPERAND (ref, 0)),
3485 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3486 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3490 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3491 it wouldn't be ignored. This matters when dealing with
3493 return stabilize_reference_1 (ref);
3495 /* If arg isn't a kind of lvalue we recognize, make no change.
3496 Caller should recognize the error for an invalid lvalue. */
3501 return error_mark_node;
3504 TREE_TYPE (result) = TREE_TYPE (ref);
3505 TREE_READONLY (result) = TREE_READONLY (ref);
3506 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3507 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3512 /* Subroutine of stabilize_reference; this is called for subtrees of
3513 references. Any expression with side-effects must be put in a SAVE_EXPR
3514 to ensure that it is only evaluated once.
3516 We don't put SAVE_EXPR nodes around everything, because assigning very
3517 simple expressions to temporaries causes us to miss good opportunities
3518 for optimizations. Among other things, the opportunity to fold in the
3519 addition of a constant into an addressing mode often gets lost, e.g.
3520 "y[i+1] += x;". In general, we take the approach that we should not make
3521 an assignment unless we are forced into it - i.e., that any non-side effect
3522 operator should be allowed, and that cse should take care of coalescing
3523 multiple utterances of the same expression should that prove fruitful. */
3526 stabilize_reference_1 (tree e)
3529 enum tree_code code = TREE_CODE (e);
3531 /* We cannot ignore const expressions because it might be a reference
3532 to a const array but whose index contains side-effects. But we can
3533 ignore things that are actual constant or that already have been
3534 handled by this function. */
3536 if (tree_invariant_p (e))
3539 switch (TREE_CODE_CLASS (code))
3541 case tcc_exceptional:
3543 case tcc_declaration:
3544 case tcc_comparison:
3546 case tcc_expression:
3549 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3550 so that it will only be evaluated once. */
3551 /* The reference (r) and comparison (<) classes could be handled as
3552 below, but it is generally faster to only evaluate them once. */
3553 if (TREE_SIDE_EFFECTS (e))
3554 return save_expr (e);
3558 /* Constants need no processing. In fact, we should never reach
3563 /* Division is slow and tends to be compiled with jumps,
3564 especially the division by powers of 2 that is often
3565 found inside of an array reference. So do it just once. */
3566 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3567 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3568 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3569 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3570 return save_expr (e);
3571 /* Recursively stabilize each operand. */
3572 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3573 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3577 /* Recursively stabilize each operand. */
3578 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3585 TREE_TYPE (result) = TREE_TYPE (e);
3586 TREE_READONLY (result) = TREE_READONLY (e);
3587 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3588 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3593 /* Low-level constructors for expressions. */
3595 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3596 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3599 recompute_tree_invariant_for_addr_expr (tree t)
3602 bool tc = true, se = false;
3604 /* We started out assuming this address is both invariant and constant, but
3605 does not have side effects. Now go down any handled components and see if
3606 any of them involve offsets that are either non-constant or non-invariant.
3607 Also check for side-effects.
3609 ??? Note that this code makes no attempt to deal with the case where
3610 taking the address of something causes a copy due to misalignment. */
3612 #define UPDATE_FLAGS(NODE) \
3613 do { tree _node = (NODE); \
3614 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3615 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3617 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3618 node = TREE_OPERAND (node, 0))
3620 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3621 array reference (probably made temporarily by the G++ front end),
3622 so ignore all the operands. */
3623 if ((TREE_CODE (node) == ARRAY_REF
3624 || TREE_CODE (node) == ARRAY_RANGE_REF)
3625 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3627 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3628 if (TREE_OPERAND (node, 2))
3629 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3630 if (TREE_OPERAND (node, 3))
3631 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3633 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3634 FIELD_DECL, apparently. The G++ front end can put something else
3635 there, at least temporarily. */
3636 else if (TREE_CODE (node) == COMPONENT_REF
3637 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3639 if (TREE_OPERAND (node, 2))
3640 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3642 else if (TREE_CODE (node) == BIT_FIELD_REF)
3643 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3646 node = lang_hooks.expr_to_decl (node, &tc, &se);
3648 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3649 the address, since &(*a)->b is a form of addition. If it's a constant, the
3650 address is constant too. If it's a decl, its address is constant if the
3651 decl is static. Everything else is not constant and, furthermore,
3652 taking the address of a volatile variable is not volatile. */
3653 if (TREE_CODE (node) == INDIRECT_REF
3654 || TREE_CODE (node) == MEM_REF)
3655 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3656 else if (CONSTANT_CLASS_P (node))
3658 else if (DECL_P (node))
3659 tc &= (staticp (node) != NULL_TREE);
3663 se |= TREE_SIDE_EFFECTS (node);
3667 TREE_CONSTANT (t) = tc;
3668 TREE_SIDE_EFFECTS (t) = se;
3672 /* Build an expression of code CODE, data type TYPE, and operands as
3673 specified. Expressions and reference nodes can be created this way.
3674 Constants, decls, types and misc nodes cannot be.
3676 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3677 enough for all extant tree codes. */
3680 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3684 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3686 t = make_node_stat (code PASS_MEM_STAT);
3693 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3695 int length = sizeof (struct tree_exp);
3698 record_node_allocation_statistics (code, length);
3700 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3702 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
3704 memset (t, 0, sizeof (struct tree_common));
3706 TREE_SET_CODE (t, code);
3708 TREE_TYPE (t) = type;
3709 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3710 TREE_OPERAND (t, 0) = node;
3711 TREE_BLOCK (t) = NULL_TREE;
3712 if (node && !TYPE_P (node))
3714 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3715 TREE_READONLY (t) = TREE_READONLY (node);
3718 if (TREE_CODE_CLASS (code) == tcc_statement)
3719 TREE_SIDE_EFFECTS (t) = 1;
3723 /* All of these have side-effects, no matter what their
3725 TREE_SIDE_EFFECTS (t) = 1;
3726 TREE_READONLY (t) = 0;
3730 /* Whether a dereference is readonly has nothing to do with whether
3731 its operand is readonly. */
3732 TREE_READONLY (t) = 0;
3737 recompute_tree_invariant_for_addr_expr (t);
3741 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3742 && node && !TYPE_P (node)
3743 && TREE_CONSTANT (node))
3744 TREE_CONSTANT (t) = 1;
3745 if (TREE_CODE_CLASS (code) == tcc_reference
3746 && node && TREE_THIS_VOLATILE (node))
3747 TREE_THIS_VOLATILE (t) = 1;
3754 #define PROCESS_ARG(N) \
3756 TREE_OPERAND (t, N) = arg##N; \
3757 if (arg##N &&!TYPE_P (arg##N)) \
3759 if (TREE_SIDE_EFFECTS (arg##N)) \
3761 if (!TREE_READONLY (arg##N) \
3762 && !CONSTANT_CLASS_P (arg##N)) \
3763 (void) (read_only = 0); \
3764 if (!TREE_CONSTANT (arg##N)) \
3765 (void) (constant = 0); \
3770 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3772 bool constant, read_only, side_effects;
3775 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3777 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3778 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3779 /* When sizetype precision doesn't match that of pointers
3780 we need to be able to build explicit extensions or truncations
3781 of the offset argument. */
3782 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3783 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3784 && TREE_CODE (arg1) == INTEGER_CST);
3786 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3787 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3788 && ptrofftype_p (TREE_TYPE (arg1)));
3790 t = make_node_stat (code PASS_MEM_STAT);
3793 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3794 result based on those same flags for the arguments. But if the
3795 arguments aren't really even `tree' expressions, we shouldn't be trying
3798 /* Expressions without side effects may be constant if their
3799 arguments are as well. */
3800 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3801 || TREE_CODE_CLASS (code) == tcc_binary);
3803 side_effects = TREE_SIDE_EFFECTS (t);
3808 TREE_READONLY (t) = read_only;
3809 TREE_CONSTANT (t) = constant;
3810 TREE_SIDE_EFFECTS (t) = side_effects;
3811 TREE_THIS_VOLATILE (t)
3812 = (TREE_CODE_CLASS (code) == tcc_reference
3813 && arg0 && TREE_THIS_VOLATILE (arg0));
3820 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3821 tree arg2 MEM_STAT_DECL)
3823 bool constant, read_only, side_effects;
3826 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3827 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3829 t = make_node_stat (code PASS_MEM_STAT);
3834 /* As a special exception, if COND_EXPR has NULL branches, we
3835 assume that it is a gimple statement and always consider
3836 it to have side effects. */
3837 if (code == COND_EXPR
3838 && tt == void_type_node
3839 && arg1 == NULL_TREE
3840 && arg2 == NULL_TREE)
3841 side_effects = true;
3843 side_effects = TREE_SIDE_EFFECTS (t);
3849 if (code == COND_EXPR)
3850 TREE_READONLY (t) = read_only;
3852 TREE_SIDE_EFFECTS (t) = side_effects;
3853 TREE_THIS_VOLATILE (t)
3854 = (TREE_CODE_CLASS (code) == tcc_reference
3855 && arg0 && TREE_THIS_VOLATILE (arg0));
3861 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3862 tree arg2, tree arg3 MEM_STAT_DECL)
3864 bool constant, read_only, side_effects;
3867 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3869 t = make_node_stat (code PASS_MEM_STAT);
3872 side_effects = TREE_SIDE_EFFECTS (t);
3879 TREE_SIDE_EFFECTS (t) = side_effects;
3880 TREE_THIS_VOLATILE (t)
3881 = (TREE_CODE_CLASS (code) == tcc_reference
3882 && arg0 && TREE_THIS_VOLATILE (arg0));
3888 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3889 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3891 bool constant, read_only, side_effects;
3894 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3896 t = make_node_stat (code PASS_MEM_STAT);
3899 side_effects = TREE_SIDE_EFFECTS (t);
3907 TREE_SIDE_EFFECTS (t) = side_effects;
3908 TREE_THIS_VOLATILE (t)
3909 = (TREE_CODE_CLASS (code) == tcc_reference
3910 && arg0 && TREE_THIS_VOLATILE (arg0));
3916 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3917 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3919 bool constant, read_only, side_effects;
3922 gcc_assert (code == TARGET_MEM_REF);
3924 t = make_node_stat (code PASS_MEM_STAT);
3927 side_effects = TREE_SIDE_EFFECTS (t);
3934 if (code == TARGET_MEM_REF)
3938 TREE_SIDE_EFFECTS (t) = side_effects;
3939 TREE_THIS_VOLATILE (t)
3940 = (code == TARGET_MEM_REF
3941 && arg5 && TREE_THIS_VOLATILE (arg5));
3946 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3947 on the pointer PTR. */
3950 build_simple_mem_ref_loc (location_t loc, tree ptr)
3952 HOST_WIDE_INT offset = 0;
3953 tree ptype = TREE_TYPE (ptr);
3955 /* For convenience allow addresses that collapse to a simple base
3957 if (TREE_CODE (ptr) == ADDR_EXPR
3958 && (handled_component_p (TREE_OPERAND (ptr, 0))
3959 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
3961 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
3963 ptr = build_fold_addr_expr (ptr);
3964 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
3966 tem = build2 (MEM_REF, TREE_TYPE (ptype),
3967 ptr, build_int_cst (ptype, offset));
3968 SET_EXPR_LOCATION (tem, loc);
3972 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3975 mem_ref_offset (const_tree t)
3977 tree toff = TREE_OPERAND (t, 1);
3978 return double_int_sext (tree_to_double_int (toff),
3979 TYPE_PRECISION (TREE_TYPE (toff)));
3982 /* Return the pointer-type relevant for TBAA purposes from the
3983 gimple memory reference tree T. This is the type to be used for
3984 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3987 reference_alias_ptr_type (const_tree t)
3989 const_tree base = t;
3990 while (handled_component_p (base))
3991 base = TREE_OPERAND (base, 0);
3992 if (TREE_CODE (base) == MEM_REF)
3993 return TREE_TYPE (TREE_OPERAND (base, 1));
3994 else if (TREE_CODE (base) == TARGET_MEM_REF)
3995 return TREE_TYPE (TMR_OFFSET (base));
3997 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base)));
4000 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4001 offsetted by OFFSET units. */
4004 build_invariant_address (tree type, tree base, HOST_WIDE_INT offset)
4006 tree ref = fold_build2 (MEM_REF, TREE_TYPE (type),
4007 build_fold_addr_expr (base),
4008 build_int_cst (ptr_type_node, offset));
4009 tree addr = build1 (ADDR_EXPR, type, ref);
4010 recompute_tree_invariant_for_addr_expr (addr);
4014 /* Similar except don't specify the TREE_TYPE
4015 and leave the TREE_SIDE_EFFECTS as 0.
4016 It is permissible for arguments to be null,
4017 or even garbage if their values do not matter. */
4020 build_nt (enum tree_code code, ...)
4027 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4031 t = make_node (code);
4032 length = TREE_CODE_LENGTH (code);
4034 for (i = 0; i < length; i++)
4035 TREE_OPERAND (t, i) = va_arg (p, tree);
4041 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4045 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
4050 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
4051 CALL_EXPR_FN (ret) = fn;
4052 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
4053 FOR_EACH_VEC_ELT (tree, args, ix, t)
4054 CALL_EXPR_ARG (ret, ix) = t;
4058 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4059 We do NOT enter this node in any sort of symbol table.
4061 LOC is the location of the decl.
4063 layout_decl is used to set up the decl's storage layout.
4064 Other slots are initialized to 0 or null pointers. */
4067 build_decl_stat (location_t loc, enum tree_code code, tree name,
4068 tree type MEM_STAT_DECL)
4072 t = make_node_stat (code PASS_MEM_STAT);
4073 DECL_SOURCE_LOCATION (t) = loc;
4075 /* if (type == error_mark_node)
4076 type = integer_type_node; */
4077 /* That is not done, deliberately, so that having error_mark_node
4078 as the type can suppress useless errors in the use of this variable. */
4080 DECL_NAME (t) = name;
4081 TREE_TYPE (t) = type;
4083 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4089 /* Builds and returns function declaration with NAME and TYPE. */
4092 build_fn_decl (const char *name, tree type)
4094 tree id = get_identifier (name);
4095 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4097 DECL_EXTERNAL (decl) = 1;
4098 TREE_PUBLIC (decl) = 1;
4099 DECL_ARTIFICIAL (decl) = 1;
4100 TREE_NOTHROW (decl) = 1;
4105 VEC(tree,gc) *all_translation_units;
4107 /* Builds a new translation-unit decl with name NAME, queues it in the
4108 global list of translation-unit decls and returns it. */
4111 build_translation_unit_decl (tree name)
4113 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4115 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4116 VEC_safe_push (tree, gc, all_translation_units, tu);
4121 /* BLOCK nodes are used to represent the structure of binding contours
4122 and declarations, once those contours have been exited and their contents
4123 compiled. This information is used for outputting debugging info. */
4126 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4128 tree block = make_node (BLOCK);
4130 BLOCK_VARS (block) = vars;
4131 BLOCK_SUBBLOCKS (block) = subblocks;
4132 BLOCK_SUPERCONTEXT (block) = supercontext;
4133 BLOCK_CHAIN (block) = chain;
4138 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4140 LOC is the location to use in tree T. */
4143 protected_set_expr_location (tree t, location_t loc)
4145 if (t && CAN_HAVE_LOCATION_P (t))
4146 SET_EXPR_LOCATION (t, loc);
4149 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4153 build_decl_attribute_variant (tree ddecl, tree attribute)
4155 DECL_ATTRIBUTES (ddecl) = attribute;
4159 /* Borrowed from hashtab.c iterative_hash implementation. */
4160 #define mix(a,b,c) \
4162 a -= b; a -= c; a ^= (c>>13); \
4163 b -= c; b -= a; b ^= (a<< 8); \
4164 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4165 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4166 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4167 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4168 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4169 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4170 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4174 /* Produce good hash value combining VAL and VAL2. */
4176 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4178 /* the golden ratio; an arbitrary value. */
4179 hashval_t a = 0x9e3779b9;
4185 /* Produce good hash value combining VAL and VAL2. */
4187 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4189 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4190 return iterative_hash_hashval_t (val, val2);
4193 hashval_t a = (hashval_t) val;
4194 /* Avoid warnings about shifting of more than the width of the type on
4195 hosts that won't execute this path. */
4197 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4199 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4201 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4202 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4209 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4210 is ATTRIBUTE and its qualifiers are QUALS.
4212 Record such modified types already made so we don't make duplicates. */
4215 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4217 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4219 hashval_t hashcode = 0;
4221 enum tree_code code = TREE_CODE (ttype);
4223 /* Building a distinct copy of a tagged type is inappropriate; it
4224 causes breakage in code that expects there to be a one-to-one
4225 relationship between a struct and its fields.
4226 build_duplicate_type is another solution (as used in
4227 handle_transparent_union_attribute), but that doesn't play well
4228 with the stronger C++ type identity model. */
4229 if (TREE_CODE (ttype) == RECORD_TYPE
4230 || TREE_CODE (ttype) == UNION_TYPE
4231 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4232 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4234 warning (OPT_Wattributes,
4235 "ignoring attributes applied to %qT after definition",
4236 TYPE_MAIN_VARIANT (ttype));
4237 return build_qualified_type (ttype, quals);
4240 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4241 ntype = build_distinct_type_copy (ttype);
4243 TYPE_ATTRIBUTES (ntype) = attribute;
4245 hashcode = iterative_hash_object (code, hashcode);
4246 if (TREE_TYPE (ntype))
4247 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4249 hashcode = attribute_hash_list (attribute, hashcode);
4251 switch (TREE_CODE (ntype))
4254 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4257 if (TYPE_DOMAIN (ntype))
4258 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4262 hashcode = iterative_hash_object
4263 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4264 hashcode = iterative_hash_object
4265 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4268 case FIXED_POINT_TYPE:
4270 unsigned int precision = TYPE_PRECISION (ntype);
4271 hashcode = iterative_hash_object (precision, hashcode);
4278 ntype = type_hash_canon (hashcode, ntype);
4280 /* If the target-dependent attributes make NTYPE different from
4281 its canonical type, we will need to use structural equality
4282 checks for this type. */
4283 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4284 || !comp_type_attributes (ntype, ttype))
4285 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4286 else if (TYPE_CANONICAL (ntype) == ntype)
4287 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4289 ttype = build_qualified_type (ntype, quals);
4291 else if (TYPE_QUALS (ttype) != quals)
4292 ttype = build_qualified_type (ttype, quals);
4297 /* Compare two attributes for their value identity. Return true if the
4298 attribute values are known to be equal; otherwise return false.
4302 attribute_value_equal (const_tree attr1, const_tree attr2)
4304 if (TREE_VALUE (attr1) == TREE_VALUE (attr2))
4307 if (TREE_VALUE (attr1) != NULL_TREE
4308 && TREE_CODE (TREE_VALUE (attr1)) == TREE_LIST
4309 && TREE_VALUE (attr2) != NULL
4310 && TREE_CODE (TREE_VALUE (attr2)) == TREE_LIST)
4311 return (simple_cst_list_equal (TREE_VALUE (attr1),
4312 TREE_VALUE (attr2)) == 1);
4314 return (simple_cst_equal (TREE_VALUE (attr1), TREE_VALUE (attr2)) == 1);
4317 /* Return 0 if the attributes for two types are incompatible, 1 if they
4318 are compatible, and 2 if they are nearly compatible (which causes a
4319 warning to be generated). */
4321 comp_type_attributes (const_tree type1, const_tree type2)
4323 const_tree a1 = TYPE_ATTRIBUTES (type1);
4324 const_tree a2 = TYPE_ATTRIBUTES (type2);
4329 for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a))
4331 const struct attribute_spec *as;
4334 as = lookup_attribute_spec (TREE_PURPOSE (a));
4335 if (!as || as->affects_type_identity == false)
4338 attr = lookup_attribute (as->name, CONST_CAST_TREE (a2));
4339 if (!attr || !attribute_value_equal (a, attr))
4344 for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a))
4346 const struct attribute_spec *as;
4348 as = lookup_attribute_spec (TREE_PURPOSE (a));
4349 if (!as || as->affects_type_identity == false)
4352 if (!lookup_attribute (as->name, CONST_CAST_TREE (a1)))
4354 /* We don't need to compare trees again, as we did this
4355 already in first loop. */
4357 /* All types - affecting identity - are equal, so
4358 there is no need to call target hook for comparison. */
4362 /* As some type combinations - like default calling-convention - might
4363 be compatible, we have to call the target hook to get the final result. */
4364 return targetm.comp_type_attributes (type1, type2);
4367 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4370 Record such modified types already made so we don't make duplicates. */
4373 build_type_attribute_variant (tree ttype, tree attribute)
4375 return build_type_attribute_qual_variant (ttype, attribute,
4376 TYPE_QUALS (ttype));
4380 /* Reset the expression *EXPR_P, a size or position.
4382 ??? We could reset all non-constant sizes or positions. But it's cheap
4383 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4385 We need to reset self-referential sizes or positions because they cannot
4386 be gimplified and thus can contain a CALL_EXPR after the gimplification
4387 is finished, which will run afoul of LTO streaming. And they need to be
4388 reset to something essentially dummy but not constant, so as to preserve
4389 the properties of the object they are attached to. */
4392 free_lang_data_in_one_sizepos (tree *expr_p)
4394 tree expr = *expr_p;
4395 if (CONTAINS_PLACEHOLDER_P (expr))
4396 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4400 /* Reset all the fields in a binfo node BINFO. We only keep
4401 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4404 free_lang_data_in_binfo (tree binfo)
4409 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4411 BINFO_VIRTUALS (binfo) = NULL_TREE;
4412 BINFO_BASE_ACCESSES (binfo) = NULL;
4413 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4414 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4416 FOR_EACH_VEC_ELT (tree, BINFO_BASE_BINFOS (binfo), i, t)
4417 free_lang_data_in_binfo (t);
4421 /* Reset all language specific information still present in TYPE. */
4424 free_lang_data_in_type (tree type)
4426 gcc_assert (TYPE_P (type));
4428 /* Give the FE a chance to remove its own data first. */
4429 lang_hooks.free_lang_data (type);
4431 TREE_LANG_FLAG_0 (type) = 0;
4432 TREE_LANG_FLAG_1 (type) = 0;
4433 TREE_LANG_FLAG_2 (type) = 0;
4434 TREE_LANG_FLAG_3 (type) = 0;
4435 TREE_LANG_FLAG_4 (type) = 0;
4436 TREE_LANG_FLAG_5 (type) = 0;
4437 TREE_LANG_FLAG_6 (type) = 0;
4439 if (TREE_CODE (type) == FUNCTION_TYPE)
4441 /* Remove the const and volatile qualifiers from arguments. The
4442 C++ front end removes them, but the C front end does not,
4443 leading to false ODR violation errors when merging two
4444 instances of the same function signature compiled by
4445 different front ends. */
4448 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4450 tree arg_type = TREE_VALUE (p);
4452 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4454 int quals = TYPE_QUALS (arg_type)
4456 & ~TYPE_QUAL_VOLATILE;
4457 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4458 free_lang_data_in_type (TREE_VALUE (p));
4463 /* Remove members that are not actually FIELD_DECLs from the field
4464 list of an aggregate. These occur in C++. */
4465 if (RECORD_OR_UNION_TYPE_P (type))
4469 /* Note that TYPE_FIELDS can be shared across distinct
4470 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4471 to be removed, we cannot set its TREE_CHAIN to NULL.
4472 Otherwise, we would not be able to find all the other fields
4473 in the other instances of this TREE_TYPE.
4475 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4477 member = TYPE_FIELDS (type);
4480 if (TREE_CODE (member) == FIELD_DECL
4481 || TREE_CODE (member) == TYPE_DECL)
4484 TREE_CHAIN (prev) = member;
4486 TYPE_FIELDS (type) = member;
4490 member = TREE_CHAIN (member);
4494 TREE_CHAIN (prev) = NULL_TREE;
4496 TYPE_FIELDS (type) = NULL_TREE;
4498 TYPE_METHODS (type) = NULL_TREE;
4499 if (TYPE_BINFO (type))
4500 free_lang_data_in_binfo (TYPE_BINFO (type));
4504 /* For non-aggregate types, clear out the language slot (which
4505 overloads TYPE_BINFO). */
4506 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4508 if (INTEGRAL_TYPE_P (type)
4509 || SCALAR_FLOAT_TYPE_P (type)
4510 || FIXED_POINT_TYPE_P (type))
4512 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4513 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4517 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4518 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4520 if (debug_info_level < DINFO_LEVEL_TERSE
4521 || (TYPE_CONTEXT (type)
4522 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4523 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4524 TYPE_CONTEXT (type) = NULL_TREE;
4528 /* Return true if DECL may need an assembler name to be set. */
4531 need_assembler_name_p (tree decl)
4533 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4534 if (TREE_CODE (decl) != FUNCTION_DECL
4535 && TREE_CODE (decl) != VAR_DECL)
4538 /* If DECL already has its assembler name set, it does not need a
4540 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4541 || DECL_ASSEMBLER_NAME_SET_P (decl))
4544 /* Abstract decls do not need an assembler name. */
4545 if (DECL_ABSTRACT (decl))
4548 /* For VAR_DECLs, only static, public and external symbols need an
4550 if (TREE_CODE (decl) == VAR_DECL
4551 && !TREE_STATIC (decl)
4552 && !TREE_PUBLIC (decl)
4553 && !DECL_EXTERNAL (decl))
4556 if (TREE_CODE (decl) == FUNCTION_DECL)
4558 /* Do not set assembler name on builtins. Allow RTL expansion to
4559 decide whether to expand inline or via a regular call. */
4560 if (DECL_BUILT_IN (decl)
4561 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4564 /* Functions represented in the callgraph need an assembler name. */
4565 if (cgraph_get_node (decl) != NULL)
4568 /* Unused and not public functions don't need an assembler name. */
4569 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4577 /* Reset all language specific information still present in symbol
4581 free_lang_data_in_decl (tree decl)
4583 gcc_assert (DECL_P (decl));
4585 /* Give the FE a chance to remove its own data first. */
4586 lang_hooks.free_lang_data (decl);
4588 TREE_LANG_FLAG_0 (decl) = 0;
4589 TREE_LANG_FLAG_1 (decl) = 0;
4590 TREE_LANG_FLAG_2 (decl) = 0;
4591 TREE_LANG_FLAG_3 (decl) = 0;
4592 TREE_LANG_FLAG_4 (decl) = 0;
4593 TREE_LANG_FLAG_5 (decl) = 0;
4594 TREE_LANG_FLAG_6 (decl) = 0;
4596 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4597 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4598 if (TREE_CODE (decl) == FIELD_DECL)
4599 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4601 if (TREE_CODE (decl) == FUNCTION_DECL)
4603 if (gimple_has_body_p (decl))
4607 /* If DECL has a gimple body, then the context for its
4608 arguments must be DECL. Otherwise, it doesn't really
4609 matter, as we will not be emitting any code for DECL. In
4610 general, there may be other instances of DECL created by
4611 the front end and since PARM_DECLs are generally shared,
4612 their DECL_CONTEXT changes as the replicas of DECL are
4613 created. The only time where DECL_CONTEXT is important
4614 is for the FUNCTION_DECLs that have a gimple body (since
4615 the PARM_DECL will be used in the function's body). */
4616 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4617 DECL_CONTEXT (t) = decl;
4620 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4621 At this point, it is not needed anymore. */
4622 DECL_SAVED_TREE (decl) = NULL_TREE;
4624 /* Clear the abstract origin if it refers to a method. Otherwise
4625 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4626 origin will not be output correctly. */
4627 if (DECL_ABSTRACT_ORIGIN (decl)
4628 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))
4629 && RECORD_OR_UNION_TYPE_P
4630 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))))
4631 DECL_ABSTRACT_ORIGIN (decl) = NULL_TREE;
4633 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4634 DECL_VINDEX referring to itself into a vtable slot number as it
4635 should. Happens with functions that are copied and then forgotten
4636 about. Just clear it, it won't matter anymore. */
4637 if (DECL_VINDEX (decl) && !host_integerp (DECL_VINDEX (decl), 0))
4638 DECL_VINDEX (decl) = NULL_TREE;
4640 else if (TREE_CODE (decl) == VAR_DECL)
4642 if ((DECL_EXTERNAL (decl)
4643 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4644 || (decl_function_context (decl) && !TREE_STATIC (decl)))
4645 DECL_INITIAL (decl) = NULL_TREE;
4647 else if (TREE_CODE (decl) == TYPE_DECL
4648 || TREE_CODE (decl) == FIELD_DECL)
4649 DECL_INITIAL (decl) = NULL_TREE;
4650 else if (TREE_CODE (decl) == TRANSLATION_UNIT_DECL
4651 && DECL_INITIAL (decl)
4652 && TREE_CODE (DECL_INITIAL (decl)) == BLOCK)
4654 /* Strip builtins from the translation-unit BLOCK. We still have targets
4655 without builtin_decl_explicit support and also builtins are shared
4656 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4657 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
4661 if (TREE_CODE (var) == FUNCTION_DECL
4662 && DECL_BUILT_IN (var))
4663 *nextp = TREE_CHAIN (var);
4665 nextp = &TREE_CHAIN (var);
4671 /* Data used when collecting DECLs and TYPEs for language data removal. */
4673 struct free_lang_data_d
4675 /* Worklist to avoid excessive recursion. */
4676 VEC(tree,heap) *worklist;
4678 /* Set of traversed objects. Used to avoid duplicate visits. */
4679 struct pointer_set_t *pset;
4681 /* Array of symbols to process with free_lang_data_in_decl. */
4682 VEC(tree,heap) *decls;
4684 /* Array of types to process with free_lang_data_in_type. */
4685 VEC(tree,heap) *types;
4689 /* Save all language fields needed to generate proper debug information
4690 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4693 save_debug_info_for_decl (tree t)
4695 /*struct saved_debug_info_d *sdi;*/
4697 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4699 /* FIXME. Partial implementation for saving debug info removed. */
4703 /* Save all language fields needed to generate proper debug information
4704 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4707 save_debug_info_for_type (tree t)
4709 /*struct saved_debug_info_d *sdi;*/
4711 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4713 /* FIXME. Partial implementation for saving debug info removed. */
4717 /* Add type or decl T to one of the list of tree nodes that need their
4718 language data removed. The lists are held inside FLD. */
4721 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4725 VEC_safe_push (tree, heap, fld->decls, t);
4726 if (debug_info_level > DINFO_LEVEL_TERSE)
4727 save_debug_info_for_decl (t);
4729 else if (TYPE_P (t))
4731 VEC_safe_push (tree, heap, fld->types, t);
4732 if (debug_info_level > DINFO_LEVEL_TERSE)
4733 save_debug_info_for_type (t);
4739 /* Push tree node T into FLD->WORKLIST. */
4742 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4744 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4745 VEC_safe_push (tree, heap, fld->worklist, (t));
4749 /* Operand callback helper for free_lang_data_in_node. *TP is the
4750 subtree operand being considered. */
4753 find_decls_types_r (tree *tp, int *ws, void *data)
4756 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4758 if (TREE_CODE (t) == TREE_LIST)
4761 /* Language specific nodes will be removed, so there is no need
4762 to gather anything under them. */
4763 if (is_lang_specific (t))
4771 /* Note that walk_tree does not traverse every possible field in
4772 decls, so we have to do our own traversals here. */
4773 add_tree_to_fld_list (t, fld);
4775 fld_worklist_push (DECL_NAME (t), fld);
4776 fld_worklist_push (DECL_CONTEXT (t), fld);
4777 fld_worklist_push (DECL_SIZE (t), fld);
4778 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4780 /* We are going to remove everything under DECL_INITIAL for
4781 TYPE_DECLs. No point walking them. */
4782 if (TREE_CODE (t) != TYPE_DECL)
4783 fld_worklist_push (DECL_INITIAL (t), fld);
4785 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4786 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4788 if (TREE_CODE (t) == FUNCTION_DECL)
4790 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4791 fld_worklist_push (DECL_RESULT (t), fld);
4793 else if (TREE_CODE (t) == TYPE_DECL)
4795 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4796 fld_worklist_push (DECL_VINDEX (t), fld);
4797 fld_worklist_push (DECL_ORIGINAL_TYPE (t), fld);
4799 else if (TREE_CODE (t) == FIELD_DECL)
4801 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4802 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4803 fld_worklist_push (DECL_QUALIFIER (t), fld);
4804 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4805 fld_worklist_push (DECL_FCONTEXT (t), fld);
4807 else if (TREE_CODE (t) == VAR_DECL)
4809 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4810 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4813 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4814 && DECL_HAS_VALUE_EXPR_P (t))
4815 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4817 if (TREE_CODE (t) != FIELD_DECL
4818 && TREE_CODE (t) != TYPE_DECL)
4819 fld_worklist_push (TREE_CHAIN (t), fld);
4822 else if (TYPE_P (t))
4824 /* Note that walk_tree does not traverse every possible field in
4825 types, so we have to do our own traversals here. */
4826 add_tree_to_fld_list (t, fld);
4828 if (!RECORD_OR_UNION_TYPE_P (t))
4829 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4830 fld_worklist_push (TYPE_SIZE (t), fld);
4831 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4832 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4833 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4834 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4835 fld_worklist_push (TYPE_NAME (t), fld);
4836 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4837 them and thus do not and want not to reach unused pointer types
4839 if (!POINTER_TYPE_P (t))
4840 fld_worklist_push (TYPE_MINVAL (t), fld);
4841 if (!RECORD_OR_UNION_TYPE_P (t))
4842 fld_worklist_push (TYPE_MAXVAL (t), fld);
4843 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4844 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4845 do not and want not to reach unused variants this way. */
4846 fld_worklist_push (TYPE_CONTEXT (t), fld);
4847 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4848 and want not to reach unused types this way. */
4850 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4854 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4856 fld_worklist_push (TREE_TYPE (tem), fld);
4857 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4859 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4860 && TREE_CODE (tem) == TREE_LIST)
4863 fld_worklist_push (TREE_VALUE (tem), fld);
4864 tem = TREE_CHAIN (tem);
4868 if (RECORD_OR_UNION_TYPE_P (t))
4871 /* Push all TYPE_FIELDS - there can be interleaving interesting
4872 and non-interesting things. */
4873 tem = TYPE_FIELDS (t);
4876 if (TREE_CODE (tem) == FIELD_DECL
4877 || TREE_CODE (tem) == TYPE_DECL)
4878 fld_worklist_push (tem, fld);
4879 tem = TREE_CHAIN (tem);
4883 fld_worklist_push (TYPE_STUB_DECL (t), fld);
4886 else if (TREE_CODE (t) == BLOCK)
4889 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4890 fld_worklist_push (tem, fld);
4891 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4892 fld_worklist_push (tem, fld);
4893 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4896 if (TREE_CODE (t) != IDENTIFIER_NODE
4897 && CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_TYPED))
4898 fld_worklist_push (TREE_TYPE (t), fld);
4904 /* Find decls and types in T. */
4907 find_decls_types (tree t, struct free_lang_data_d *fld)
4911 if (!pointer_set_contains (fld->pset, t))
4912 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4913 if (VEC_empty (tree, fld->worklist))
4915 t = VEC_pop (tree, fld->worklist);
4919 /* Translate all the types in LIST with the corresponding runtime
4923 get_eh_types_for_runtime (tree list)
4927 if (list == NULL_TREE)
4930 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4932 list = TREE_CHAIN (list);
4935 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4936 TREE_CHAIN (prev) = n;
4937 prev = TREE_CHAIN (prev);
4938 list = TREE_CHAIN (list);
4945 /* Find decls and types referenced in EH region R and store them in
4946 FLD->DECLS and FLD->TYPES. */
4949 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4960 /* The types referenced in each catch must first be changed to the
4961 EH types used at runtime. This removes references to FE types
4963 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4965 c->type_list = get_eh_types_for_runtime (c->type_list);
4966 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4971 case ERT_ALLOWED_EXCEPTIONS:
4972 r->u.allowed.type_list
4973 = get_eh_types_for_runtime (r->u.allowed.type_list);
4974 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4977 case ERT_MUST_NOT_THROW:
4978 walk_tree (&r->u.must_not_throw.failure_decl,
4979 find_decls_types_r, fld, fld->pset);
4985 /* Find decls and types referenced in cgraph node N and store them in
4986 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4987 look for *every* kind of DECL and TYPE node reachable from N,
4988 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4989 NAMESPACE_DECLs, etc). */
4992 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4995 struct function *fn;
4999 find_decls_types (n->decl, fld);
5001 if (!gimple_has_body_p (n->decl))
5004 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
5006 fn = DECL_STRUCT_FUNCTION (n->decl);
5008 /* Traverse locals. */
5009 FOR_EACH_LOCAL_DECL (fn, ix, t)
5010 find_decls_types (t, fld);
5012 /* Traverse EH regions in FN. */
5015 FOR_ALL_EH_REGION_FN (r, fn)
5016 find_decls_types_in_eh_region (r, fld);
5019 /* Traverse every statement in FN. */
5020 FOR_EACH_BB_FN (bb, fn)
5022 gimple_stmt_iterator si;
5025 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
5027 gimple phi = gsi_stmt (si);
5029 for (i = 0; i < gimple_phi_num_args (phi); i++)
5031 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
5032 find_decls_types (*arg_p, fld);
5036 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5038 gimple stmt = gsi_stmt (si);
5040 if (is_gimple_call (stmt))
5041 find_decls_types (gimple_call_fntype (stmt), fld);
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 HOST_WIDE_INT least significant bits of T, a sizetype
6516 kind INTEGER_CST. This makes sure to properly sign-extend the
6520 size_low_cst (const_tree t)
6522 double_int d = tree_to_double_int (t);
6523 return double_int_sext (d, TYPE_PRECISION (TREE_TYPE (t))).low;
6526 /* Return the most significant (sign) bit of T. */
6529 tree_int_cst_sign_bit (const_tree t)
6531 unsigned bitno = TYPE_PRECISION (TREE_TYPE (t)) - 1;
6532 unsigned HOST_WIDE_INT w;
6534 if (bitno < HOST_BITS_PER_WIDE_INT)
6535 w = TREE_INT_CST_LOW (t);
6538 w = TREE_INT_CST_HIGH (t);
6539 bitno -= HOST_BITS_PER_WIDE_INT;
6542 return (w >> bitno) & 1;
6545 /* Return an indication of the sign of the integer constant T.
6546 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6547 Note that -1 will never be returned if T's type is unsigned. */
6550 tree_int_cst_sgn (const_tree t)
6552 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6554 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6556 else if (TREE_INT_CST_HIGH (t) < 0)
6562 /* Return the minimum number of bits needed to represent VALUE in a
6563 signed or unsigned type, UNSIGNEDP says which. */
6566 tree_int_cst_min_precision (tree value, bool unsignedp)
6570 /* If the value is negative, compute its negative minus 1. The latter
6571 adjustment is because the absolute value of the largest negative value
6572 is one larger than the largest positive value. This is equivalent to
6573 a bit-wise negation, so use that operation instead. */
6575 if (tree_int_cst_sgn (value) < 0)
6576 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6578 /* Return the number of bits needed, taking into account the fact
6579 that we need one more bit for a signed than unsigned type. */
6581 if (integer_zerop (value))
6584 log = tree_floor_log2 (value);
6586 return log + 1 + !unsignedp;
6589 /* Compare two constructor-element-type constants. Return 1 if the lists
6590 are known to be equal; otherwise return 0. */
6593 simple_cst_list_equal (const_tree l1, const_tree l2)
6595 while (l1 != NULL_TREE && l2 != NULL_TREE)
6597 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6600 l1 = TREE_CHAIN (l1);
6601 l2 = TREE_CHAIN (l2);
6607 /* Return truthvalue of whether T1 is the same tree structure as T2.
6608 Return 1 if they are the same.
6609 Return 0 if they are understandably different.
6610 Return -1 if either contains tree structure not understood by
6614 simple_cst_equal (const_tree t1, const_tree t2)
6616 enum tree_code code1, code2;
6622 if (t1 == 0 || t2 == 0)
6625 code1 = TREE_CODE (t1);
6626 code2 = TREE_CODE (t2);
6628 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6630 if (CONVERT_EXPR_CODE_P (code2)
6631 || code2 == NON_LVALUE_EXPR)
6632 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6634 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6637 else if (CONVERT_EXPR_CODE_P (code2)
6638 || code2 == NON_LVALUE_EXPR)
6639 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6647 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6648 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6651 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6654 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6657 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6658 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6659 TREE_STRING_LENGTH (t1)));
6663 unsigned HOST_WIDE_INT idx;
6664 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6665 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6667 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6670 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6671 /* ??? Should we handle also fields here? */
6672 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6673 VEC_index (constructor_elt, v2, idx)->value))
6679 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6682 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6685 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6688 const_tree arg1, arg2;
6689 const_call_expr_arg_iterator iter1, iter2;
6690 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6691 arg2 = first_const_call_expr_arg (t2, &iter2);
6693 arg1 = next_const_call_expr_arg (&iter1),
6694 arg2 = next_const_call_expr_arg (&iter2))
6696 cmp = simple_cst_equal (arg1, arg2);
6700 return arg1 == arg2;
6704 /* Special case: if either target is an unallocated VAR_DECL,
6705 it means that it's going to be unified with whatever the
6706 TARGET_EXPR is really supposed to initialize, so treat it
6707 as being equivalent to anything. */
6708 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6709 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6710 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6711 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6712 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6713 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6716 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6721 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6723 case WITH_CLEANUP_EXPR:
6724 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6728 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6731 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6732 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6746 /* This general rule works for most tree codes. All exceptions should be
6747 handled above. If this is a language-specific tree code, we can't
6748 trust what might be in the operand, so say we don't know
6750 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6753 switch (TREE_CODE_CLASS (code1))
6757 case tcc_comparison:
6758 case tcc_expression:
6762 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6764 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6776 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6777 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6778 than U, respectively. */
6781 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6783 if (tree_int_cst_sgn (t) < 0)
6785 else if (TREE_INT_CST_HIGH (t) != 0)
6787 else if (TREE_INT_CST_LOW (t) == u)
6789 else if (TREE_INT_CST_LOW (t) < u)
6795 /* Return true if CODE represents an associative tree code. Otherwise
6798 associative_tree_code (enum tree_code code)
6817 /* Return true if CODE represents a commutative tree code. Otherwise
6820 commutative_tree_code (enum tree_code code)
6833 case UNORDERED_EXPR:
6837 case TRUTH_AND_EXPR:
6838 case TRUTH_XOR_EXPR:
6848 /* Return true if CODE represents a ternary tree code for which the
6849 first two operands are commutative. Otherwise return false. */
6851 commutative_ternary_tree_code (enum tree_code code)
6855 case WIDEN_MULT_PLUS_EXPR:
6856 case WIDEN_MULT_MINUS_EXPR:
6865 /* Generate a hash value for an expression. This can be used iteratively
6866 by passing a previous result as the VAL argument.
6868 This function is intended to produce the same hash for expressions which
6869 would compare equal using operand_equal_p. */
6872 iterative_hash_expr (const_tree t, hashval_t val)
6875 enum tree_code code;
6879 return iterative_hash_hashval_t (0, val);
6881 code = TREE_CODE (t);
6885 /* Alas, constants aren't shared, so we can't rely on pointer
6888 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6889 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6892 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6894 return iterative_hash_hashval_t (val2, val);
6898 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6900 return iterative_hash_hashval_t (val2, val);
6903 return iterative_hash (TREE_STRING_POINTER (t),
6904 TREE_STRING_LENGTH (t), val);
6906 val = iterative_hash_expr (TREE_REALPART (t), val);
6907 return iterative_hash_expr (TREE_IMAGPART (t), val);
6909 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6911 /* We can just compare by pointer. */
6912 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6913 case PLACEHOLDER_EXPR:
6914 /* The node itself doesn't matter. */
6917 /* A list of expressions, for a CALL_EXPR or as the elements of a
6919 for (; t; t = TREE_CHAIN (t))
6920 val = iterative_hash_expr (TREE_VALUE (t), val);
6924 unsigned HOST_WIDE_INT idx;
6926 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6928 val = iterative_hash_expr (field, val);
6929 val = iterative_hash_expr (value, val);
6935 /* The type of the second operand is relevant, except for
6936 its top-level qualifiers. */
6937 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t, 1)));
6939 val = iterative_hash_object (TYPE_HASH (type), val);
6941 /* We could use the standard hash computation from this point
6943 val = iterative_hash_object (code, val);
6944 val = iterative_hash_expr (TREE_OPERAND (t, 1), val);
6945 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6949 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6950 Otherwise nodes that compare equal according to operand_equal_p might
6951 get different hash codes. However, don't do this for machine specific
6952 or front end builtins, since the function code is overloaded in those
6954 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6955 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t)))
6957 t = builtin_decl_explicit (DECL_FUNCTION_CODE (t));
6958 code = TREE_CODE (t);
6962 tclass = TREE_CODE_CLASS (code);
6964 if (tclass == tcc_declaration)
6966 /* DECL's have a unique ID */
6967 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6971 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6973 val = iterative_hash_object (code, val);
6975 /* Don't hash the type, that can lead to having nodes which
6976 compare equal according to operand_equal_p, but which
6977 have different hash codes. */
6978 if (CONVERT_EXPR_CODE_P (code)
6979 || code == NON_LVALUE_EXPR)
6981 /* Make sure to include signness in the hash computation. */
6982 val += TYPE_UNSIGNED (TREE_TYPE (t));
6983 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6986 else if (commutative_tree_code (code))
6988 /* It's a commutative expression. We want to hash it the same
6989 however it appears. We do this by first hashing both operands
6990 and then rehashing based on the order of their independent
6992 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6993 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6997 t = one, one = two, two = t;
6999 val = iterative_hash_hashval_t (one, val);
7000 val = iterative_hash_hashval_t (two, val);
7003 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
7004 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
7010 /* Generate a hash value for a pair of expressions. This can be used
7011 iteratively by passing a previous result as the VAL argument.
7013 The same hash value is always returned for a given pair of expressions,
7014 regardless of the order in which they are presented. This is useful in
7015 hashing the operands of commutative functions. */
7018 iterative_hash_exprs_commutative (const_tree t1,
7019 const_tree t2, hashval_t val)
7021 hashval_t one = iterative_hash_expr (t1, 0);
7022 hashval_t two = iterative_hash_expr (t2, 0);
7026 t = one, one = two, two = t;
7027 val = iterative_hash_hashval_t (one, val);
7028 val = iterative_hash_hashval_t (two, val);
7033 /* Constructors for pointer, array and function types.
7034 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7035 constructed by language-dependent code, not here.) */
7037 /* Construct, lay out and return the type of pointers to TO_TYPE with
7038 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7039 reference all of memory. If such a type has already been
7040 constructed, reuse it. */
7043 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
7048 if (to_type == error_mark_node)
7049 return error_mark_node;
7051 /* If the pointed-to type has the may_alias attribute set, force
7052 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7053 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7054 can_alias_all = true;
7056 /* In some cases, languages will have things that aren't a POINTER_TYPE
7057 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7058 In that case, return that type without regard to the rest of our
7061 ??? This is a kludge, but consistent with the way this function has
7062 always operated and there doesn't seem to be a good way to avoid this
7064 if (TYPE_POINTER_TO (to_type) != 0
7065 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
7066 return TYPE_POINTER_TO (to_type);
7068 /* First, if we already have a type for pointers to TO_TYPE and it's
7069 the proper mode, use it. */
7070 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
7071 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7074 t = make_node (POINTER_TYPE);
7076 TREE_TYPE (t) = to_type;
7077 SET_TYPE_MODE (t, mode);
7078 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7079 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
7080 TYPE_POINTER_TO (to_type) = t;
7082 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7083 SET_TYPE_STRUCTURAL_EQUALITY (t);
7084 else if (TYPE_CANONICAL (to_type) != to_type)
7086 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
7087 mode, can_alias_all);
7089 /* Lay out the type. This function has many callers that are concerned
7090 with expression-construction, and this simplifies them all. */
7096 /* By default build pointers in ptr_mode. */
7099 build_pointer_type (tree to_type)
7101 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7102 : TYPE_ADDR_SPACE (to_type);
7103 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7104 return build_pointer_type_for_mode (to_type, pointer_mode, false);
7107 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7110 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
7115 if (to_type == error_mark_node)
7116 return error_mark_node;
7118 /* If the pointed-to type has the may_alias attribute set, force
7119 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7120 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7121 can_alias_all = true;
7123 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7124 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7125 In that case, return that type without regard to the rest of our
7128 ??? This is a kludge, but consistent with the way this function has
7129 always operated and there doesn't seem to be a good way to avoid this
7131 if (TYPE_REFERENCE_TO (to_type) != 0
7132 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7133 return TYPE_REFERENCE_TO (to_type);
7135 /* First, if we already have a type for pointers to TO_TYPE and it's
7136 the proper mode, use it. */
7137 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7138 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7141 t = make_node (REFERENCE_TYPE);
7143 TREE_TYPE (t) = to_type;
7144 SET_TYPE_MODE (t, mode);
7145 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7146 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7147 TYPE_REFERENCE_TO (to_type) = t;
7149 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7150 SET_TYPE_STRUCTURAL_EQUALITY (t);
7151 else if (TYPE_CANONICAL (to_type) != to_type)
7153 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7154 mode, can_alias_all);
7162 /* Build the node for the type of references-to-TO_TYPE by default
7166 build_reference_type (tree to_type)
7168 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7169 : TYPE_ADDR_SPACE (to_type);
7170 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7171 return build_reference_type_for_mode (to_type, pointer_mode, false);
7174 /* Build a type that is compatible with t but has no cv quals anywhere
7177 const char *const *const * -> char ***. */
7180 build_type_no_quals (tree t)
7182 switch (TREE_CODE (t))
7185 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7187 TYPE_REF_CAN_ALIAS_ALL (t));
7188 case REFERENCE_TYPE:
7190 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7192 TYPE_REF_CAN_ALIAS_ALL (t));
7194 return TYPE_MAIN_VARIANT (t);
7198 #define MAX_INT_CACHED_PREC \
7199 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7200 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7202 /* Builds a signed or unsigned integer type of precision PRECISION.
7203 Used for C bitfields whose precision does not match that of
7204 built-in target types. */
7206 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7212 unsignedp = MAX_INT_CACHED_PREC + 1;
7214 if (precision <= MAX_INT_CACHED_PREC)
7216 itype = nonstandard_integer_type_cache[precision + unsignedp];
7221 itype = make_node (INTEGER_TYPE);
7222 TYPE_PRECISION (itype) = precision;
7225 fixup_unsigned_type (itype);
7227 fixup_signed_type (itype);
7230 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7231 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7232 if (precision <= MAX_INT_CACHED_PREC)
7233 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7238 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7239 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7240 is true, reuse such a type that has already been constructed. */
7243 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7245 tree itype = make_node (INTEGER_TYPE);
7246 hashval_t hashcode = 0;
7248 TREE_TYPE (itype) = type;
7250 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7251 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7253 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7254 SET_TYPE_MODE (itype, TYPE_MODE (type));
7255 TYPE_SIZE (itype) = TYPE_SIZE (type);
7256 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7257 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7258 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7263 if ((TYPE_MIN_VALUE (itype)
7264 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7265 || (TYPE_MAX_VALUE (itype)
7266 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7268 /* Since we cannot reliably merge this type, we need to compare it using
7269 structural equality checks. */
7270 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7274 hashcode = iterative_hash_expr (TYPE_MIN_VALUE (itype), hashcode);
7275 hashcode = iterative_hash_expr (TYPE_MAX_VALUE (itype), hashcode);
7276 hashcode = iterative_hash_hashval_t (TYPE_HASH (type), hashcode);
7277 itype = type_hash_canon (hashcode, itype);
7282 /* Wrapper around build_range_type_1 with SHARED set to true. */
7285 build_range_type (tree type, tree lowval, tree highval)
7287 return build_range_type_1 (type, lowval, highval, true);
7290 /* Wrapper around build_range_type_1 with SHARED set to false. */
7293 build_nonshared_range_type (tree type, tree lowval, tree highval)
7295 return build_range_type_1 (type, lowval, highval, false);
7298 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7299 MAXVAL should be the maximum value in the domain
7300 (one less than the length of the array).
7302 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7303 We don't enforce this limit, that is up to caller (e.g. language front end).
7304 The limit exists because the result is a signed type and we don't handle
7305 sizes that use more than one HOST_WIDE_INT. */
7308 build_index_type (tree maxval)
7310 return build_range_type (sizetype, size_zero_node, maxval);
7313 /* Return true if the debug information for TYPE, a subtype, should be emitted
7314 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7315 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7316 debug info and doesn't reflect the source code. */
7319 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7321 tree base_type = TREE_TYPE (type), low, high;
7323 /* Subrange types have a base type which is an integral type. */
7324 if (!INTEGRAL_TYPE_P (base_type))
7327 /* Get the real bounds of the subtype. */
7328 if (lang_hooks.types.get_subrange_bounds)
7329 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7332 low = TYPE_MIN_VALUE (type);
7333 high = TYPE_MAX_VALUE (type);
7336 /* If the type and its base type have the same representation and the same
7337 name, then the type is not a subrange but a copy of the base type. */
7338 if ((TREE_CODE (base_type) == INTEGER_TYPE
7339 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7340 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7341 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7342 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7344 tree type_name = TYPE_NAME (type);
7345 tree base_type_name = TYPE_NAME (base_type);
7347 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7348 type_name = DECL_NAME (type_name);
7350 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7351 base_type_name = DECL_NAME (base_type_name);
7353 if (type_name == base_type_name)
7364 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7365 and number of elements specified by the range of values of INDEX_TYPE.
7366 If SHARED is true, reuse such a type that has already been constructed. */
7369 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7373 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7375 error ("arrays of functions are not meaningful");
7376 elt_type = integer_type_node;
7379 t = make_node (ARRAY_TYPE);
7380 TREE_TYPE (t) = elt_type;
7381 TYPE_DOMAIN (t) = index_type;
7382 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7385 /* If the element type is incomplete at this point we get marked for
7386 structural equality. Do not record these types in the canonical
7388 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7393 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7395 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7396 t = type_hash_canon (hashcode, t);
7399 if (TYPE_CANONICAL (t) == t)
7401 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7402 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7403 SET_TYPE_STRUCTURAL_EQUALITY (t);
7404 else if (TYPE_CANONICAL (elt_type) != elt_type
7405 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7407 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7409 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7416 /* Wrapper around build_array_type_1 with SHARED set to true. */
7419 build_array_type (tree elt_type, tree index_type)
7421 return build_array_type_1 (elt_type, index_type, true);
7424 /* Wrapper around build_array_type_1 with SHARED set to false. */
7427 build_nonshared_array_type (tree elt_type, tree index_type)
7429 return build_array_type_1 (elt_type, index_type, false);
7432 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7436 build_array_type_nelts (tree elt_type, unsigned HOST_WIDE_INT nelts)
7438 return build_array_type (elt_type, build_index_type (size_int (nelts - 1)));
7441 /* Recursively examines the array elements of TYPE, until a non-array
7442 element type is found. */
7445 strip_array_types (tree type)
7447 while (TREE_CODE (type) == ARRAY_TYPE)
7448 type = TREE_TYPE (type);
7453 /* Computes the canonical argument types from the argument type list
7456 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7457 on entry to this function, or if any of the ARGTYPES are
7460 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7461 true on entry to this function, or if any of the ARGTYPES are
7464 Returns a canonical argument list, which may be ARGTYPES when the
7465 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7466 true) or would not differ from ARGTYPES. */
7469 maybe_canonicalize_argtypes(tree argtypes,
7470 bool *any_structural_p,
7471 bool *any_noncanonical_p)
7474 bool any_noncanonical_argtypes_p = false;
7476 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7478 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7479 /* Fail gracefully by stating that the type is structural. */
7480 *any_structural_p = true;
7481 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7482 *any_structural_p = true;
7483 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7484 || TREE_PURPOSE (arg))
7485 /* If the argument has a default argument, we consider it
7486 non-canonical even though the type itself is canonical.
7487 That way, different variants of function and method types
7488 with default arguments will all point to the variant with
7489 no defaults as their canonical type. */
7490 any_noncanonical_argtypes_p = true;
7493 if (*any_structural_p)
7496 if (any_noncanonical_argtypes_p)
7498 /* Build the canonical list of argument types. */
7499 tree canon_argtypes = NULL_TREE;
7500 bool is_void = false;
7502 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7504 if (arg == void_list_node)
7507 canon_argtypes = tree_cons (NULL_TREE,
7508 TYPE_CANONICAL (TREE_VALUE (arg)),
7512 canon_argtypes = nreverse (canon_argtypes);
7514 canon_argtypes = chainon (canon_argtypes, void_list_node);
7516 /* There is a non-canonical type. */
7517 *any_noncanonical_p = true;
7518 return canon_argtypes;
7521 /* The canonical argument types are the same as ARGTYPES. */
7525 /* Construct, lay out and return
7526 the type of functions returning type VALUE_TYPE
7527 given arguments of types ARG_TYPES.
7528 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7529 are data type nodes for the arguments of the function.
7530 If such a type has already been constructed, reuse it. */
7533 build_function_type (tree value_type, tree arg_types)
7536 hashval_t hashcode = 0;
7537 bool any_structural_p, any_noncanonical_p;
7538 tree canon_argtypes;
7540 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7542 error ("function return type cannot be function");
7543 value_type = integer_type_node;
7546 /* Make a node of the sort we want. */
7547 t = make_node (FUNCTION_TYPE);
7548 TREE_TYPE (t) = value_type;
7549 TYPE_ARG_TYPES (t) = arg_types;
7551 /* If we already have such a type, use the old one. */
7552 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7553 hashcode = type_hash_list (arg_types, hashcode);
7554 t = type_hash_canon (hashcode, t);
7556 /* Set up the canonical type. */
7557 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7558 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7559 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7561 &any_noncanonical_p);
7562 if (any_structural_p)
7563 SET_TYPE_STRUCTURAL_EQUALITY (t);
7564 else if (any_noncanonical_p)
7565 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7568 if (!COMPLETE_TYPE_P (t))
7573 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7574 return value if SKIP_RETURN is true. */
7577 build_function_type_skip_args (tree orig_type, bitmap args_to_skip,
7580 tree new_type = NULL;
7581 tree args, new_args = NULL, t;
7585 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7586 args = TREE_CHAIN (args), i++)
7587 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
7588 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7590 new_reversed = nreverse (new_args);
7594 TREE_CHAIN (new_args) = void_list_node;
7596 new_reversed = void_list_node;
7599 /* Use copy_node to preserve as much as possible from original type
7600 (debug info, attribute lists etc.)
7601 Exception is METHOD_TYPEs must have THIS argument.
7602 When we are asked to remove it, we need to build new FUNCTION_TYPE
7604 if (TREE_CODE (orig_type) != METHOD_TYPE
7606 || !bitmap_bit_p (args_to_skip, 0))
7608 new_type = build_distinct_type_copy (orig_type);
7609 TYPE_ARG_TYPES (new_type) = new_reversed;
7614 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7616 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7620 TREE_TYPE (new_type) = void_type_node;
7622 /* This is a new type, not a copy of an old type. Need to reassociate
7623 variants. We can handle everything except the main variant lazily. */
7624 t = TYPE_MAIN_VARIANT (orig_type);
7627 t = build_function_type_skip_args (t, args_to_skip, skip_return);
7628 TYPE_MAIN_VARIANT (new_type) = t;
7629 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7630 TYPE_NEXT_VARIANT (t) = new_type;
7634 TYPE_MAIN_VARIANT (new_type) = new_type;
7635 TYPE_NEXT_VARIANT (new_type) = NULL;
7641 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7642 return value if SKIP_RETURN is true.
7644 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7645 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7646 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7649 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip,
7652 tree new_decl = copy_node (orig_decl);
7655 new_type = TREE_TYPE (orig_decl);
7656 if (prototype_p (new_type)
7657 || (skip_return && !VOID_TYPE_P (TREE_TYPE (new_type))))
7659 = build_function_type_skip_args (new_type, args_to_skip, skip_return);
7660 TREE_TYPE (new_decl) = new_type;
7662 /* For declarations setting DECL_VINDEX (i.e. methods)
7663 we expect first argument to be THIS pointer. */
7664 if (args_to_skip && bitmap_bit_p (args_to_skip, 0))
7665 DECL_VINDEX (new_decl) = NULL_TREE;
7667 /* When signature changes, we need to clear builtin info. */
7668 if (DECL_BUILT_IN (new_decl)
7670 && !bitmap_empty_p (args_to_skip))
7672 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7673 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7678 /* Build a function type. The RETURN_TYPE is the type returned by the
7679 function. If VAARGS is set, no void_type_node is appended to the
7680 the list. ARGP must be always be terminated be a NULL_TREE. */
7683 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7687 t = va_arg (argp, tree);
7688 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7689 args = tree_cons (NULL_TREE, t, args);
7694 if (args != NULL_TREE)
7695 args = nreverse (args);
7696 gcc_assert (last != void_list_node);
7698 else if (args == NULL_TREE)
7699 args = void_list_node;
7703 args = nreverse (args);
7704 TREE_CHAIN (last) = void_list_node;
7706 args = build_function_type (return_type, args);
7711 /* Build a function type. The RETURN_TYPE is the type returned by the
7712 function. If additional arguments are provided, they are
7713 additional argument types. The list of argument types must always
7714 be terminated by NULL_TREE. */
7717 build_function_type_list (tree return_type, ...)
7722 va_start (p, return_type);
7723 args = build_function_type_list_1 (false, return_type, p);
7728 /* Build a variable argument function type. The RETURN_TYPE is the
7729 type returned by the function. If additional arguments are provided,
7730 they are additional argument types. The list of argument types must
7731 always be terminated by NULL_TREE. */
7734 build_varargs_function_type_list (tree return_type, ...)
7739 va_start (p, return_type);
7740 args = build_function_type_list_1 (true, return_type, p);
7746 /* Build a function type. RETURN_TYPE is the type returned by the
7747 function; VAARGS indicates whether the function takes varargs. The
7748 function takes N named arguments, the types of which are provided in
7752 build_function_type_array_1 (bool vaargs, tree return_type, int n,
7756 tree t = vaargs ? NULL_TREE : void_list_node;
7758 for (i = n - 1; i >= 0; i--)
7759 t = tree_cons (NULL_TREE, arg_types[i], t);
7761 return build_function_type (return_type, t);
7764 /* Build a function type. RETURN_TYPE is the type returned by the
7765 function. The function takes N named arguments, the types of which
7766 are provided in ARG_TYPES. */
7769 build_function_type_array (tree return_type, int n, tree *arg_types)
7771 return build_function_type_array_1 (false, return_type, n, arg_types);
7774 /* Build a variable argument function type. RETURN_TYPE is the type
7775 returned by the function. The function takes N named arguments, the
7776 types of which are provided in ARG_TYPES. */
7779 build_varargs_function_type_array (tree return_type, int n, tree *arg_types)
7781 return build_function_type_array_1 (true, return_type, n, arg_types);
7784 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7785 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7786 for the method. An implicit additional parameter (of type
7787 pointer-to-BASETYPE) is added to the ARGTYPES. */
7790 build_method_type_directly (tree basetype,
7797 bool any_structural_p, any_noncanonical_p;
7798 tree canon_argtypes;
7800 /* Make a node of the sort we want. */
7801 t = make_node (METHOD_TYPE);
7803 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7804 TREE_TYPE (t) = rettype;
7805 ptype = build_pointer_type (basetype);
7807 /* The actual arglist for this function includes a "hidden" argument
7808 which is "this". Put it into the list of argument types. */
7809 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7810 TYPE_ARG_TYPES (t) = argtypes;
7812 /* If we already have such a type, use the old one. */
7813 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7814 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7815 hashcode = type_hash_list (argtypes, hashcode);
7816 t = type_hash_canon (hashcode, t);
7818 /* Set up the canonical type. */
7820 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7821 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7823 = (TYPE_CANONICAL (basetype) != basetype
7824 || TYPE_CANONICAL (rettype) != rettype);
7825 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7827 &any_noncanonical_p);
7828 if (any_structural_p)
7829 SET_TYPE_STRUCTURAL_EQUALITY (t);
7830 else if (any_noncanonical_p)
7832 = build_method_type_directly (TYPE_CANONICAL (basetype),
7833 TYPE_CANONICAL (rettype),
7835 if (!COMPLETE_TYPE_P (t))
7841 /* Construct, lay out and return the type of methods belonging to class
7842 BASETYPE and whose arguments and values are described by TYPE.
7843 If that type exists already, reuse it.
7844 TYPE must be a FUNCTION_TYPE node. */
7847 build_method_type (tree basetype, tree type)
7849 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7851 return build_method_type_directly (basetype,
7853 TYPE_ARG_TYPES (type));
7856 /* Construct, lay out and return the type of offsets to a value
7857 of type TYPE, within an object of type BASETYPE.
7858 If a suitable offset type exists already, reuse it. */
7861 build_offset_type (tree basetype, tree type)
7864 hashval_t hashcode = 0;
7866 /* Make a node of the sort we want. */
7867 t = make_node (OFFSET_TYPE);
7869 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7870 TREE_TYPE (t) = type;
7872 /* If we already have such a type, use the old one. */
7873 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7874 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7875 t = type_hash_canon (hashcode, t);
7877 if (!COMPLETE_TYPE_P (t))
7880 if (TYPE_CANONICAL (t) == t)
7882 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7883 || TYPE_STRUCTURAL_EQUALITY_P (type))
7884 SET_TYPE_STRUCTURAL_EQUALITY (t);
7885 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7886 || TYPE_CANONICAL (type) != type)
7888 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7889 TYPE_CANONICAL (type));
7895 /* Create a complex type whose components are COMPONENT_TYPE. */
7898 build_complex_type (tree component_type)
7903 gcc_assert (INTEGRAL_TYPE_P (component_type)
7904 || SCALAR_FLOAT_TYPE_P (component_type)
7905 || FIXED_POINT_TYPE_P (component_type));
7907 /* Make a node of the sort we want. */
7908 t = make_node (COMPLEX_TYPE);
7910 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7912 /* If we already have such a type, use the old one. */
7913 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7914 t = type_hash_canon (hashcode, t);
7916 if (!COMPLETE_TYPE_P (t))
7919 if (TYPE_CANONICAL (t) == t)
7921 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7922 SET_TYPE_STRUCTURAL_EQUALITY (t);
7923 else if (TYPE_CANONICAL (component_type) != component_type)
7925 = build_complex_type (TYPE_CANONICAL (component_type));
7928 /* We need to create a name, since complex is a fundamental type. */
7929 if (! TYPE_NAME (t))
7932 if (component_type == char_type_node)
7933 name = "complex char";
7934 else if (component_type == signed_char_type_node)
7935 name = "complex signed char";
7936 else if (component_type == unsigned_char_type_node)
7937 name = "complex unsigned char";
7938 else if (component_type == short_integer_type_node)
7939 name = "complex short int";
7940 else if (component_type == short_unsigned_type_node)
7941 name = "complex short unsigned int";
7942 else if (component_type == integer_type_node)
7943 name = "complex int";
7944 else if (component_type == unsigned_type_node)
7945 name = "complex unsigned int";
7946 else if (component_type == long_integer_type_node)
7947 name = "complex long int";
7948 else if (component_type == long_unsigned_type_node)
7949 name = "complex long unsigned int";
7950 else if (component_type == long_long_integer_type_node)
7951 name = "complex long long int";
7952 else if (component_type == long_long_unsigned_type_node)
7953 name = "complex long long unsigned int";
7958 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7959 get_identifier (name), t);
7962 return build_qualified_type (t, TYPE_QUALS (component_type));
7965 /* If TYPE is a real or complex floating-point type and the target
7966 does not directly support arithmetic on TYPE then return the wider
7967 type to be used for arithmetic on TYPE. Otherwise, return
7971 excess_precision_type (tree type)
7973 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7975 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7976 switch (TREE_CODE (type))
7979 switch (flt_eval_method)
7982 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7983 return double_type_node;
7986 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7987 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7988 return long_double_type_node;
7995 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7997 switch (flt_eval_method)
8000 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
8001 return complex_double_type_node;
8004 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
8005 || (TYPE_MODE (TREE_TYPE (type))
8006 == TYPE_MODE (double_type_node)))
8007 return complex_long_double_type_node;
8020 /* Return OP, stripped of any conversions to wider types as much as is safe.
8021 Converting the value back to OP's type makes a value equivalent to OP.
8023 If FOR_TYPE is nonzero, we return a value which, if converted to
8024 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8026 OP must have integer, real or enumeral type. Pointers are not allowed!
8028 There are some cases where the obvious value we could return
8029 would regenerate to OP if converted to OP's type,
8030 but would not extend like OP to wider types.
8031 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8032 For example, if OP is (unsigned short)(signed char)-1,
8033 we avoid returning (signed char)-1 if FOR_TYPE is int,
8034 even though extending that to an unsigned short would regenerate OP,
8035 since the result of extending (signed char)-1 to (int)
8036 is different from (int) OP. */
8039 get_unwidened (tree op, tree for_type)
8041 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8042 tree type = TREE_TYPE (op);
8044 = TYPE_PRECISION (for_type != 0 ? for_type : type);
8046 = (for_type != 0 && for_type != type
8047 && final_prec > TYPE_PRECISION (type)
8048 && TYPE_UNSIGNED (type));
8051 while (CONVERT_EXPR_P (op))
8055 /* TYPE_PRECISION on vector types has different meaning
8056 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8057 so avoid them here. */
8058 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
8061 bitschange = TYPE_PRECISION (TREE_TYPE (op))
8062 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
8064 /* Truncations are many-one so cannot be removed.
8065 Unless we are later going to truncate down even farther. */
8067 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
8070 /* See what's inside this conversion. If we decide to strip it,
8072 op = TREE_OPERAND (op, 0);
8074 /* If we have not stripped any zero-extensions (uns is 0),
8075 we can strip any kind of extension.
8076 If we have previously stripped a zero-extension,
8077 only zero-extensions can safely be stripped.
8078 Any extension can be stripped if the bits it would produce
8079 are all going to be discarded later by truncating to FOR_TYPE. */
8083 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
8085 /* TYPE_UNSIGNED says whether this is a zero-extension.
8086 Let's avoid computing it if it does not affect WIN
8087 and if UNS will not be needed again. */
8089 || CONVERT_EXPR_P (op))
8090 && TYPE_UNSIGNED (TREE_TYPE (op)))
8098 /* If we finally reach a constant see if it fits in for_type and
8099 in that case convert it. */
8101 && TREE_CODE (win) == INTEGER_CST
8102 && TREE_TYPE (win) != for_type
8103 && int_fits_type_p (win, for_type))
8104 win = fold_convert (for_type, win);
8109 /* Return OP or a simpler expression for a narrower value
8110 which can be sign-extended or zero-extended to give back OP.
8111 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8112 or 0 if the value should be sign-extended. */
8115 get_narrower (tree op, int *unsignedp_ptr)
8120 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
8122 while (TREE_CODE (op) == NOP_EXPR)
8125 = (TYPE_PRECISION (TREE_TYPE (op))
8126 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
8128 /* Truncations are many-one so cannot be removed. */
8132 /* See what's inside this conversion. If we decide to strip it,
8137 op = TREE_OPERAND (op, 0);
8138 /* An extension: the outermost one can be stripped,
8139 but remember whether it is zero or sign extension. */
8141 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8142 /* Otherwise, if a sign extension has been stripped,
8143 only sign extensions can now be stripped;
8144 if a zero extension has been stripped, only zero-extensions. */
8145 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
8149 else /* bitschange == 0 */
8151 /* A change in nominal type can always be stripped, but we must
8152 preserve the unsignedness. */
8154 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8156 op = TREE_OPERAND (op, 0);
8157 /* Keep trying to narrow, but don't assign op to win if it
8158 would turn an integral type into something else. */
8159 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
8166 if (TREE_CODE (op) == COMPONENT_REF
8167 /* Since type_for_size always gives an integer type. */
8168 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8169 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8170 /* Ensure field is laid out already. */
8171 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8172 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
8174 unsigned HOST_WIDE_INT innerprec
8175 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
8176 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8177 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8178 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8180 /* We can get this structure field in a narrower type that fits it,
8181 but the resulting extension to its nominal type (a fullword type)
8182 must satisfy the same conditions as for other extensions.
8184 Do this only for fields that are aligned (not bit-fields),
8185 because when bit-field insns will be used there is no
8186 advantage in doing this. */
8188 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8189 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8190 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8194 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8195 win = fold_convert (type, op);
8199 *unsignedp_ptr = uns;
8203 /* Returns true if integer constant C has a value that is permissible
8204 for type TYPE (an INTEGER_TYPE). */
8207 int_fits_type_p (const_tree c, const_tree type)
8209 tree type_low_bound, type_high_bound;
8210 bool ok_for_low_bound, ok_for_high_bound, unsc;
8213 dc = tree_to_double_int (c);
8214 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
8216 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
8217 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
8219 /* So c is an unsigned integer whose type is sizetype and type is not.
8220 sizetype'd integers are sign extended even though they are
8221 unsigned. If the integer value fits in the lower end word of c,
8222 and if the higher end word has all its bits set to 1, that
8223 means the higher end bits are set to 1 only for sign extension.
8224 So let's convert c into an equivalent zero extended unsigned
8226 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
8229 type_low_bound = TYPE_MIN_VALUE (type);
8230 type_high_bound = TYPE_MAX_VALUE (type);
8232 /* If at least one bound of the type is a constant integer, we can check
8233 ourselves and maybe make a decision. If no such decision is possible, but
8234 this type is a subtype, try checking against that. Otherwise, use
8235 double_int_fits_to_tree_p, which checks against the precision.
8237 Compute the status for each possibly constant bound, and return if we see
8238 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8239 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8240 for "constant known to fit". */
8242 /* Check if c >= type_low_bound. */
8243 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8245 dd = tree_to_double_int (type_low_bound);
8246 if (TREE_CODE (type) == INTEGER_TYPE
8247 && TYPE_IS_SIZETYPE (type)
8248 && TYPE_UNSIGNED (type))
8249 dd = double_int_zext (dd, TYPE_PRECISION (type));
8250 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
8252 int c_neg = (!unsc && double_int_negative_p (dc));
8253 int t_neg = (unsc && double_int_negative_p (dd));
8255 if (c_neg && !t_neg)
8257 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
8260 else if (double_int_cmp (dc, dd, unsc) < 0)
8262 ok_for_low_bound = true;
8265 ok_for_low_bound = false;
8267 /* Check if c <= type_high_bound. */
8268 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8270 dd = tree_to_double_int (type_high_bound);
8271 if (TREE_CODE (type) == INTEGER_TYPE
8272 && TYPE_IS_SIZETYPE (type)
8273 && TYPE_UNSIGNED (type))
8274 dd = double_int_zext (dd, TYPE_PRECISION (type));
8275 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8277 int c_neg = (!unsc && double_int_negative_p (dc));
8278 int t_neg = (unsc && double_int_negative_p (dd));
8280 if (t_neg && !c_neg)
8282 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
8285 else if (double_int_cmp (dc, dd, unsc) > 0)
8287 ok_for_high_bound = true;
8290 ok_for_high_bound = false;
8292 /* If the constant fits both bounds, the result is known. */
8293 if (ok_for_low_bound && ok_for_high_bound)
8296 /* Perform some generic filtering which may allow making a decision
8297 even if the bounds are not constant. First, negative integers
8298 never fit in unsigned types, */
8299 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8302 /* Second, narrower types always fit in wider ones. */
8303 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8306 /* Third, unsigned integers with top bit set never fit signed types. */
8307 if (! TYPE_UNSIGNED (type) && unsc)
8309 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8310 if (prec < HOST_BITS_PER_WIDE_INT)
8312 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8315 else if (((((unsigned HOST_WIDE_INT) 1)
8316 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8320 /* If we haven't been able to decide at this point, there nothing more we
8321 can check ourselves here. Look at the base type if we have one and it
8322 has the same precision. */
8323 if (TREE_CODE (type) == INTEGER_TYPE
8324 && TREE_TYPE (type) != 0
8325 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8327 type = TREE_TYPE (type);
8331 /* Or to double_int_fits_to_tree_p, if nothing else. */
8332 return double_int_fits_to_tree_p (type, dc);
8335 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8336 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8337 represented (assuming two's-complement arithmetic) within the bit
8338 precision of the type are returned instead. */
8341 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8343 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8344 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8345 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8346 TYPE_UNSIGNED (type));
8349 if (TYPE_UNSIGNED (type))
8350 mpz_set_ui (min, 0);
8354 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8355 mn = double_int_sext (double_int_add (mn, double_int_one),
8356 TYPE_PRECISION (type));
8357 mpz_set_double_int (min, mn, false);
8361 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8362 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8363 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8364 TYPE_UNSIGNED (type));
8367 if (TYPE_UNSIGNED (type))
8368 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8371 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8376 /* Return true if VAR is an automatic variable defined in function FN. */
8379 auto_var_in_fn_p (const_tree var, const_tree fn)
8381 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8382 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8383 || TREE_CODE (var) == PARM_DECL)
8384 && ! TREE_STATIC (var))
8385 || TREE_CODE (var) == LABEL_DECL
8386 || TREE_CODE (var) == RESULT_DECL));
8389 /* Subprogram of following function. Called by walk_tree.
8391 Return *TP if it is an automatic variable or parameter of the
8392 function passed in as DATA. */
8395 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8397 tree fn = (tree) data;
8402 else if (DECL_P (*tp)
8403 && auto_var_in_fn_p (*tp, fn))
8409 /* Returns true if T is, contains, or refers to a type with variable
8410 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8411 arguments, but not the return type. If FN is nonzero, only return
8412 true if a modifier of the type or position of FN is a variable or
8413 parameter inside FN.
8415 This concept is more general than that of C99 'variably modified types':
8416 in C99, a struct type is never variably modified because a VLA may not
8417 appear as a structure member. However, in GNU C code like:
8419 struct S { int i[f()]; };
8421 is valid, and other languages may define similar constructs. */
8424 variably_modified_type_p (tree type, tree fn)
8428 /* Test if T is either variable (if FN is zero) or an expression containing
8429 a variable in FN. */
8430 #define RETURN_TRUE_IF_VAR(T) \
8431 do { tree _t = (T); \
8432 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8433 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8434 return true; } while (0)
8436 if (type == error_mark_node)
8439 /* If TYPE itself has variable size, it is variably modified. */
8440 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8441 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8443 switch (TREE_CODE (type))
8446 case REFERENCE_TYPE:
8448 if (variably_modified_type_p (TREE_TYPE (type), fn))
8454 /* If TYPE is a function type, it is variably modified if the
8455 return type is variably modified. */
8456 if (variably_modified_type_p (TREE_TYPE (type), fn))
8462 case FIXED_POINT_TYPE:
8465 /* Scalar types are variably modified if their end points
8467 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8468 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8473 case QUAL_UNION_TYPE:
8474 /* We can't see if any of the fields are variably-modified by the
8475 definition we normally use, since that would produce infinite
8476 recursion via pointers. */
8477 /* This is variably modified if some field's type is. */
8478 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8479 if (TREE_CODE (t) == FIELD_DECL)
8481 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8482 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8483 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8485 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8486 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8491 /* Do not call ourselves to avoid infinite recursion. This is
8492 variably modified if the element type is. */
8493 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8494 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8501 /* The current language may have other cases to check, but in general,
8502 all other types are not variably modified. */
8503 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8505 #undef RETURN_TRUE_IF_VAR
8508 /* Given a DECL or TYPE, return the scope in which it was declared, or
8509 NULL_TREE if there is no containing scope. */
8512 get_containing_scope (const_tree t)
8514 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8517 /* Return the innermost context enclosing DECL that is
8518 a FUNCTION_DECL, or zero if none. */
8521 decl_function_context (const_tree decl)
8525 if (TREE_CODE (decl) == ERROR_MARK)
8528 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8529 where we look up the function at runtime. Such functions always take
8530 a first argument of type 'pointer to real context'.
8532 C++ should really be fixed to use DECL_CONTEXT for the real context,
8533 and use something else for the "virtual context". */
8534 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8537 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8539 context = DECL_CONTEXT (decl);
8541 while (context && TREE_CODE (context) != FUNCTION_DECL)
8543 if (TREE_CODE (context) == BLOCK)
8544 context = BLOCK_SUPERCONTEXT (context);
8546 context = get_containing_scope (context);
8552 /* Return the innermost context enclosing DECL that is
8553 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8554 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8557 decl_type_context (const_tree decl)
8559 tree context = DECL_CONTEXT (decl);
8562 switch (TREE_CODE (context))
8564 case NAMESPACE_DECL:
8565 case TRANSLATION_UNIT_DECL:
8570 case QUAL_UNION_TYPE:
8575 context = DECL_CONTEXT (context);
8579 context = BLOCK_SUPERCONTEXT (context);
8589 /* CALL is a CALL_EXPR. Return the declaration for the function
8590 called, or NULL_TREE if the called function cannot be
8594 get_callee_fndecl (const_tree call)
8598 if (call == error_mark_node)
8599 return error_mark_node;
8601 /* It's invalid to call this function with anything but a
8603 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8605 /* The first operand to the CALL is the address of the function
8607 addr = CALL_EXPR_FN (call);
8611 /* If this is a readonly function pointer, extract its initial value. */
8612 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8613 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8614 && DECL_INITIAL (addr))
8615 addr = DECL_INITIAL (addr);
8617 /* If the address is just `&f' for some function `f', then we know
8618 that `f' is being called. */
8619 if (TREE_CODE (addr) == ADDR_EXPR
8620 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8621 return TREE_OPERAND (addr, 0);
8623 /* We couldn't figure out what was being called. */
8627 /* Print debugging information about tree nodes generated during the compile,
8628 and any language-specific information. */
8631 dump_tree_statistics (void)
8633 #ifdef GATHER_STATISTICS
8635 int total_nodes, total_bytes;
8638 fprintf (stderr, "\n??? tree nodes created\n\n");
8639 #ifdef GATHER_STATISTICS
8640 fprintf (stderr, "Kind Nodes Bytes\n");
8641 fprintf (stderr, "---------------------------------------\n");
8642 total_nodes = total_bytes = 0;
8643 for (i = 0; i < (int) all_kinds; i++)
8645 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8646 tree_node_counts[i], tree_node_sizes[i]);
8647 total_nodes += tree_node_counts[i];
8648 total_bytes += tree_node_sizes[i];
8650 fprintf (stderr, "---------------------------------------\n");
8651 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8652 fprintf (stderr, "---------------------------------------\n");
8653 fprintf (stderr, "Code Nodes\n");
8654 fprintf (stderr, "----------------------------\n");
8655 for (i = 0; i < (int) MAX_TREE_CODES; i++)
8656 fprintf (stderr, "%-20s %7d\n", tree_code_name[i], tree_code_counts[i]);
8657 fprintf (stderr, "----------------------------\n");
8658 ssanames_print_statistics ();
8659 phinodes_print_statistics ();
8661 fprintf (stderr, "(No per-node statistics)\n");
8663 print_type_hash_statistics ();
8664 print_debug_expr_statistics ();
8665 print_value_expr_statistics ();
8666 lang_hooks.print_statistics ();
8669 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8671 /* Generate a crc32 of a byte. */
8674 crc32_byte (unsigned chksum, char byte)
8676 unsigned value = (unsigned) byte << 24;
8679 for (ix = 8; ix--; value <<= 1)
8683 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8691 /* Generate a crc32 of a string. */
8694 crc32_string (unsigned chksum, const char *string)
8698 chksum = crc32_byte (chksum, *string);
8704 /* P is a string that will be used in a symbol. Mask out any characters
8705 that are not valid in that context. */
8708 clean_symbol_name (char *p)
8712 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8715 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8722 /* Generate a name for a special-purpose function.
8723 The generated name may need to be unique across the whole link.
8724 Changes to this function may also require corresponding changes to
8725 xstrdup_mask_random.
8726 TYPE is some string to identify the purpose of this function to the
8727 linker or collect2; it must start with an uppercase letter,
8729 I - for constructors
8731 N - for C++ anonymous namespaces
8732 F - for DWARF unwind frame information. */
8735 get_file_function_name (const char *type)
8741 /* If we already have a name we know to be unique, just use that. */
8742 if (first_global_object_name)
8743 p = q = ASTRDUP (first_global_object_name);
8744 /* If the target is handling the constructors/destructors, they
8745 will be local to this file and the name is only necessary for
8747 We also assign sub_I and sub_D sufixes to constructors called from
8748 the global static constructors. These are always local. */
8749 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8750 || (strncmp (type, "sub_", 4) == 0
8751 && (type[4] == 'I' || type[4] == 'D')))
8753 const char *file = main_input_filename;
8755 file = input_filename;
8756 /* Just use the file's basename, because the full pathname
8757 might be quite long. */
8758 p = q = ASTRDUP (lbasename (file));
8762 /* Otherwise, the name must be unique across the entire link.
8763 We don't have anything that we know to be unique to this translation
8764 unit, so use what we do have and throw in some randomness. */
8766 const char *name = weak_global_object_name;
8767 const char *file = main_input_filename;
8772 file = input_filename;
8774 len = strlen (file);
8775 q = (char *) alloca (9 + 17 + len + 1);
8776 memcpy (q, file, len + 1);
8778 snprintf (q + len, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX,
8779 crc32_string (0, name), get_random_seed (false));
8784 clean_symbol_name (q);
8785 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8788 /* Set up the name of the file-level functions we may need.
8789 Use a global object (which is already required to be unique over
8790 the program) rather than the file name (which imposes extra
8792 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8794 return get_identifier (buf);
8797 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8799 /* Complain that the tree code of NODE does not match the expected 0
8800 terminated list of trailing codes. The trailing code list can be
8801 empty, for a more vague error message. FILE, LINE, and FUNCTION
8802 are of the caller. */
8805 tree_check_failed (const_tree node, const char *file,
8806 int line, const char *function, ...)
8810 unsigned length = 0;
8813 va_start (args, function);
8814 while ((code = va_arg (args, int)))
8815 length += 4 + strlen (tree_code_name[code]);
8820 va_start (args, function);
8821 length += strlen ("expected ");
8822 buffer = tmp = (char *) alloca (length);
8824 while ((code = va_arg (args, int)))
8826 const char *prefix = length ? " or " : "expected ";
8828 strcpy (tmp + length, prefix);
8829 length += strlen (prefix);
8830 strcpy (tmp + length, tree_code_name[code]);
8831 length += strlen (tree_code_name[code]);
8836 buffer = "unexpected node";
8838 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8839 buffer, tree_code_name[TREE_CODE (node)],
8840 function, trim_filename (file), line);
8843 /* Complain that the tree code of NODE does match the expected 0
8844 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8848 tree_not_check_failed (const_tree node, const char *file,
8849 int line, const char *function, ...)
8853 unsigned length = 0;
8856 va_start (args, function);
8857 while ((code = va_arg (args, int)))
8858 length += 4 + strlen (tree_code_name[code]);
8860 va_start (args, function);
8861 buffer = (char *) alloca (length);
8863 while ((code = va_arg (args, int)))
8867 strcpy (buffer + length, " or ");
8870 strcpy (buffer + length, tree_code_name[code]);
8871 length += strlen (tree_code_name[code]);
8875 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8876 buffer, tree_code_name[TREE_CODE (node)],
8877 function, trim_filename (file), line);
8880 /* Similar to tree_check_failed, except that we check for a class of tree
8881 code, given in CL. */
8884 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8885 const char *file, int line, const char *function)
8888 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8889 TREE_CODE_CLASS_STRING (cl),
8890 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8891 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8894 /* Similar to tree_check_failed, except that instead of specifying a
8895 dozen codes, use the knowledge that they're all sequential. */
8898 tree_range_check_failed (const_tree node, const char *file, int line,
8899 const char *function, enum tree_code c1,
8903 unsigned length = 0;
8906 for (c = c1; c <= c2; ++c)
8907 length += 4 + strlen (tree_code_name[c]);
8909 length += strlen ("expected ");
8910 buffer = (char *) alloca (length);
8913 for (c = c1; c <= c2; ++c)
8915 const char *prefix = length ? " or " : "expected ";
8917 strcpy (buffer + length, prefix);
8918 length += strlen (prefix);
8919 strcpy (buffer + length, tree_code_name[c]);
8920 length += strlen (tree_code_name[c]);
8923 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8924 buffer, tree_code_name[TREE_CODE (node)],
8925 function, trim_filename (file), line);
8929 /* Similar to tree_check_failed, except that we check that a tree does
8930 not have the specified code, given in CL. */
8933 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8934 const char *file, int line, const char *function)
8937 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8938 TREE_CODE_CLASS_STRING (cl),
8939 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8940 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8944 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8947 omp_clause_check_failed (const_tree node, const char *file, int line,
8948 const char *function, enum omp_clause_code code)
8950 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8951 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8952 function, trim_filename (file), line);
8956 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8959 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8960 const char *function, enum omp_clause_code c1,
8961 enum omp_clause_code c2)
8964 unsigned length = 0;
8967 for (c = c1; c <= c2; ++c)
8968 length += 4 + strlen (omp_clause_code_name[c]);
8970 length += strlen ("expected ");
8971 buffer = (char *) alloca (length);
8974 for (c = c1; c <= c2; ++c)
8976 const char *prefix = length ? " or " : "expected ";
8978 strcpy (buffer + length, prefix);
8979 length += strlen (prefix);
8980 strcpy (buffer + length, omp_clause_code_name[c]);
8981 length += strlen (omp_clause_code_name[c]);
8984 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8985 buffer, omp_clause_code_name[TREE_CODE (node)],
8986 function, trim_filename (file), line);
8990 #undef DEFTREESTRUCT
8991 #define DEFTREESTRUCT(VAL, NAME) NAME,
8993 static const char *ts_enum_names[] = {
8994 #include "treestruct.def"
8996 #undef DEFTREESTRUCT
8998 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9000 /* Similar to tree_class_check_failed, except that we check for
9001 whether CODE contains the tree structure identified by EN. */
9004 tree_contains_struct_check_failed (const_tree node,
9005 const enum tree_node_structure_enum en,
9006 const char *file, int line,
9007 const char *function)
9010 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9012 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
9016 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9017 (dynamically sized) vector. */
9020 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
9021 const char *function)
9024 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9025 idx + 1, len, function, trim_filename (file), line);
9028 /* Similar to above, except that the check is for the bounds of the operand
9029 vector of an expression node EXP. */
9032 tree_operand_check_failed (int idx, const_tree exp, const char *file,
9033 int line, const char *function)
9035 int code = TREE_CODE (exp);
9037 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9038 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
9039 function, trim_filename (file), line);
9042 /* Similar to above, except that the check is for the number of
9043 operands of an OMP_CLAUSE node. */
9046 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
9047 int line, const char *function)
9050 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9051 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
9052 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
9053 trim_filename (file), line);
9055 #endif /* ENABLE_TREE_CHECKING */
9057 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9058 and mapped to the machine mode MODE. Initialize its fields and build
9059 the information necessary for debugging output. */
9062 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
9065 hashval_t hashcode = 0;
9067 t = make_node (VECTOR_TYPE);
9068 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
9069 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
9070 SET_TYPE_MODE (t, mode);
9072 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
9073 SET_TYPE_STRUCTURAL_EQUALITY (t);
9074 else if (TYPE_CANONICAL (innertype) != innertype
9075 || mode != VOIDmode)
9077 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
9081 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
9082 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
9083 hashcode = iterative_hash_host_wide_int (mode, hashcode);
9084 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
9085 t = type_hash_canon (hashcode, t);
9087 /* We have built a main variant, based on the main variant of the
9088 inner type. Use it to build the variant we return. */
9089 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
9090 && TREE_TYPE (t) != innertype)
9091 return build_type_attribute_qual_variant (t,
9092 TYPE_ATTRIBUTES (innertype),
9093 TYPE_QUALS (innertype));
9099 make_or_reuse_type (unsigned size, int unsignedp)
9101 if (size == INT_TYPE_SIZE)
9102 return unsignedp ? unsigned_type_node : integer_type_node;
9103 if (size == CHAR_TYPE_SIZE)
9104 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
9105 if (size == SHORT_TYPE_SIZE)
9106 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
9107 if (size == LONG_TYPE_SIZE)
9108 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
9109 if (size == LONG_LONG_TYPE_SIZE)
9110 return (unsignedp ? long_long_unsigned_type_node
9111 : long_long_integer_type_node);
9112 if (size == 128 && int128_integer_type_node)
9113 return (unsignedp ? int128_unsigned_type_node
9114 : int128_integer_type_node);
9117 return make_unsigned_type (size);
9119 return make_signed_type (size);
9122 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9125 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
9129 if (size == SHORT_FRACT_TYPE_SIZE)
9130 return unsignedp ? sat_unsigned_short_fract_type_node
9131 : sat_short_fract_type_node;
9132 if (size == FRACT_TYPE_SIZE)
9133 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
9134 if (size == LONG_FRACT_TYPE_SIZE)
9135 return unsignedp ? sat_unsigned_long_fract_type_node
9136 : sat_long_fract_type_node;
9137 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9138 return unsignedp ? sat_unsigned_long_long_fract_type_node
9139 : sat_long_long_fract_type_node;
9143 if (size == SHORT_FRACT_TYPE_SIZE)
9144 return unsignedp ? unsigned_short_fract_type_node
9145 : short_fract_type_node;
9146 if (size == FRACT_TYPE_SIZE)
9147 return unsignedp ? unsigned_fract_type_node : fract_type_node;
9148 if (size == LONG_FRACT_TYPE_SIZE)
9149 return unsignedp ? unsigned_long_fract_type_node
9150 : long_fract_type_node;
9151 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9152 return unsignedp ? unsigned_long_long_fract_type_node
9153 : long_long_fract_type_node;
9156 return make_fract_type (size, unsignedp, satp);
9159 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9162 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
9166 if (size == SHORT_ACCUM_TYPE_SIZE)
9167 return unsignedp ? sat_unsigned_short_accum_type_node
9168 : sat_short_accum_type_node;
9169 if (size == ACCUM_TYPE_SIZE)
9170 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
9171 if (size == LONG_ACCUM_TYPE_SIZE)
9172 return unsignedp ? sat_unsigned_long_accum_type_node
9173 : sat_long_accum_type_node;
9174 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9175 return unsignedp ? sat_unsigned_long_long_accum_type_node
9176 : sat_long_long_accum_type_node;
9180 if (size == SHORT_ACCUM_TYPE_SIZE)
9181 return unsignedp ? unsigned_short_accum_type_node
9182 : short_accum_type_node;
9183 if (size == ACCUM_TYPE_SIZE)
9184 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9185 if (size == LONG_ACCUM_TYPE_SIZE)
9186 return unsignedp ? unsigned_long_accum_type_node
9187 : long_accum_type_node;
9188 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9189 return unsignedp ? unsigned_long_long_accum_type_node
9190 : long_long_accum_type_node;
9193 return make_accum_type (size, unsignedp, satp);
9196 /* Create nodes for all integer types (and error_mark_node) using the sizes
9197 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9198 SHORT_DOUBLE specifies whether double should be of the same precision
9202 build_common_tree_nodes (bool signed_char, bool short_double)
9204 error_mark_node = make_node (ERROR_MARK);
9205 TREE_TYPE (error_mark_node) = error_mark_node;
9207 initialize_sizetypes ();
9209 /* Define both `signed char' and `unsigned char'. */
9210 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9211 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9212 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9213 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9215 /* Define `char', which is like either `signed char' or `unsigned char'
9216 but not the same as either. */
9219 ? make_signed_type (CHAR_TYPE_SIZE)
9220 : make_unsigned_type (CHAR_TYPE_SIZE));
9221 TYPE_STRING_FLAG (char_type_node) = 1;
9223 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9224 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9225 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9226 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9227 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9228 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9229 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9230 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9231 #if HOST_BITS_PER_WIDE_INT >= 64
9232 /* TODO: This isn't correct, but as logic depends at the moment on
9233 host's instead of target's wide-integer.
9234 If there is a target not supporting TImode, but has an 128-bit
9235 integer-scalar register, this target check needs to be adjusted. */
9236 if (targetm.scalar_mode_supported_p (TImode))
9238 int128_integer_type_node = make_signed_type (128);
9239 int128_unsigned_type_node = make_unsigned_type (128);
9243 /* Define a boolean type. This type only represents boolean values but
9244 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9245 Front ends which want to override this size (i.e. Java) can redefine
9246 boolean_type_node before calling build_common_tree_nodes_2. */
9247 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9248 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9249 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9250 TYPE_PRECISION (boolean_type_node) = 1;
9252 /* Define what type to use for size_t. */
9253 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
9254 size_type_node = unsigned_type_node;
9255 else if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
9256 size_type_node = long_unsigned_type_node;
9257 else if (strcmp (SIZE_TYPE, "long long unsigned int") == 0)
9258 size_type_node = long_long_unsigned_type_node;
9259 else if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
9260 size_type_node = short_unsigned_type_node;
9264 /* Fill in the rest of the sized types. Reuse existing type nodes
9266 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9267 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9268 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9269 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9270 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9272 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9273 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9274 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9275 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9276 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9278 access_public_node = get_identifier ("public");
9279 access_protected_node = get_identifier ("protected");
9280 access_private_node = get_identifier ("private");
9282 /* Define these next since types below may used them. */
9283 integer_zero_node = build_int_cst (integer_type_node, 0);
9284 integer_one_node = build_int_cst (integer_type_node, 1);
9285 integer_three_node = build_int_cst (integer_type_node, 3);
9286 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9288 size_zero_node = size_int (0);
9289 size_one_node = size_int (1);
9290 bitsize_zero_node = bitsize_int (0);
9291 bitsize_one_node = bitsize_int (1);
9292 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9294 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9295 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9297 void_type_node = make_node (VOID_TYPE);
9298 layout_type (void_type_node);
9300 /* We are not going to have real types in C with less than byte alignment,
9301 so we might as well not have any types that claim to have it. */
9302 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9303 TYPE_USER_ALIGN (void_type_node) = 0;
9305 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9306 layout_type (TREE_TYPE (null_pointer_node));
9308 ptr_type_node = build_pointer_type (void_type_node);
9310 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9311 fileptr_type_node = ptr_type_node;
9313 float_type_node = make_node (REAL_TYPE);
9314 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9315 layout_type (float_type_node);
9317 double_type_node = make_node (REAL_TYPE);
9319 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9321 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9322 layout_type (double_type_node);
9324 long_double_type_node = make_node (REAL_TYPE);
9325 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9326 layout_type (long_double_type_node);
9328 float_ptr_type_node = build_pointer_type (float_type_node);
9329 double_ptr_type_node = build_pointer_type (double_type_node);
9330 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9331 integer_ptr_type_node = build_pointer_type (integer_type_node);
9333 /* Fixed size integer types. */
9334 uint32_type_node = build_nonstandard_integer_type (32, true);
9335 uint64_type_node = build_nonstandard_integer_type (64, true);
9337 /* Decimal float types. */
9338 dfloat32_type_node = make_node (REAL_TYPE);
9339 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9340 layout_type (dfloat32_type_node);
9341 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9342 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9344 dfloat64_type_node = make_node (REAL_TYPE);
9345 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9346 layout_type (dfloat64_type_node);
9347 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9348 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9350 dfloat128_type_node = make_node (REAL_TYPE);
9351 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9352 layout_type (dfloat128_type_node);
9353 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9354 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9356 complex_integer_type_node = build_complex_type (integer_type_node);
9357 complex_float_type_node = build_complex_type (float_type_node);
9358 complex_double_type_node = build_complex_type (double_type_node);
9359 complex_long_double_type_node = build_complex_type (long_double_type_node);
9361 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9362 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9363 sat_ ## KIND ## _type_node = \
9364 make_sat_signed_ ## KIND ## _type (SIZE); \
9365 sat_unsigned_ ## KIND ## _type_node = \
9366 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9367 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9368 unsigned_ ## KIND ## _type_node = \
9369 make_unsigned_ ## KIND ## _type (SIZE);
9371 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9372 sat_ ## WIDTH ## KIND ## _type_node = \
9373 make_sat_signed_ ## KIND ## _type (SIZE); \
9374 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9375 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9376 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9377 unsigned_ ## WIDTH ## KIND ## _type_node = \
9378 make_unsigned_ ## KIND ## _type (SIZE);
9380 /* Make fixed-point type nodes based on four different widths. */
9381 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9382 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9383 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9384 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9385 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9387 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9388 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9389 NAME ## _type_node = \
9390 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9391 u ## NAME ## _type_node = \
9392 make_or_reuse_unsigned_ ## KIND ## _type \
9393 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9394 sat_ ## NAME ## _type_node = \
9395 make_or_reuse_sat_signed_ ## KIND ## _type \
9396 (GET_MODE_BITSIZE (MODE ## mode)); \
9397 sat_u ## NAME ## _type_node = \
9398 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9399 (GET_MODE_BITSIZE (U ## MODE ## mode));
9401 /* Fixed-point type and mode nodes. */
9402 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9403 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9404 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9405 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9406 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9407 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9408 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9409 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9410 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9411 MAKE_FIXED_MODE_NODE (accum, da, DA)
9412 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9415 tree t = targetm.build_builtin_va_list ();
9417 /* Many back-ends define record types without setting TYPE_NAME.
9418 If we copied the record type here, we'd keep the original
9419 record type without a name. This breaks name mangling. So,
9420 don't copy record types and let c_common_nodes_and_builtins()
9421 declare the type to be __builtin_va_list. */
9422 if (TREE_CODE (t) != RECORD_TYPE)
9423 t = build_variant_type_copy (t);
9425 va_list_type_node = t;
9429 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9432 local_define_builtin (const char *name, tree type, enum built_in_function code,
9433 const char *library_name, int ecf_flags)
9437 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9438 library_name, NULL_TREE);
9439 if (ecf_flags & ECF_CONST)
9440 TREE_READONLY (decl) = 1;
9441 if (ecf_flags & ECF_PURE)
9442 DECL_PURE_P (decl) = 1;
9443 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9444 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9445 if (ecf_flags & ECF_NORETURN)
9446 TREE_THIS_VOLATILE (decl) = 1;
9447 if (ecf_flags & ECF_NOTHROW)
9448 TREE_NOTHROW (decl) = 1;
9449 if (ecf_flags & ECF_MALLOC)
9450 DECL_IS_MALLOC (decl) = 1;
9451 if (ecf_flags & ECF_LEAF)
9452 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9453 NULL, DECL_ATTRIBUTES (decl));
9454 if ((ecf_flags & ECF_TM_PURE) && flag_tm)
9455 apply_tm_attr (decl, get_identifier ("transaction_pure"));
9457 set_builtin_decl (code, decl, true);
9460 /* Call this function after instantiating all builtins that the language
9461 front end cares about. This will build the rest of the builtins that
9462 are relied upon by the tree optimizers and the middle-end. */
9465 build_common_builtin_nodes (void)
9470 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY)
9471 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9473 ftype = build_function_type_list (ptr_type_node,
9474 ptr_type_node, const_ptr_type_node,
9475 size_type_node, NULL_TREE);
9477 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY))
9478 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9479 "memcpy", ECF_NOTHROW | ECF_LEAF);
9480 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9481 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9482 "memmove", ECF_NOTHROW | ECF_LEAF);
9485 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP))
9487 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9488 const_ptr_type_node, size_type_node,
9490 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9491 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9494 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET))
9496 ftype = build_function_type_list (ptr_type_node,
9497 ptr_type_node, integer_type_node,
9498 size_type_node, NULL_TREE);
9499 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9500 "memset", ECF_NOTHROW | ECF_LEAF);
9503 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA))
9505 ftype = build_function_type_list (ptr_type_node,
9506 size_type_node, NULL_TREE);
9507 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9508 "alloca", ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9511 ftype = build_function_type_list (ptr_type_node, size_type_node,
9512 size_type_node, NULL_TREE);
9513 local_define_builtin ("__builtin_alloca_with_align", ftype,
9514 BUILT_IN_ALLOCA_WITH_ALIGN, "alloca",
9515 ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9517 /* If we're checking the stack, `alloca' can throw. */
9518 if (flag_stack_check)
9520 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA)) = 0;
9521 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN)) = 0;
9524 ftype = build_function_type_list (void_type_node,
9525 ptr_type_node, ptr_type_node,
9526 ptr_type_node, NULL_TREE);
9527 local_define_builtin ("__builtin_init_trampoline", ftype,
9528 BUILT_IN_INIT_TRAMPOLINE,
9529 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9530 local_define_builtin ("__builtin_init_heap_trampoline", ftype,
9531 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9532 "__builtin_init_heap_trampoline",
9533 ECF_NOTHROW | ECF_LEAF);
9535 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9536 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9537 BUILT_IN_ADJUST_TRAMPOLINE,
9538 "__builtin_adjust_trampoline",
9539 ECF_CONST | ECF_NOTHROW);
9541 ftype = build_function_type_list (void_type_node,
9542 ptr_type_node, ptr_type_node, NULL_TREE);
9543 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9544 BUILT_IN_NONLOCAL_GOTO,
9545 "__builtin_nonlocal_goto",
9546 ECF_NORETURN | ECF_NOTHROW);
9548 ftype = build_function_type_list (void_type_node,
9549 ptr_type_node, ptr_type_node, NULL_TREE);
9550 local_define_builtin ("__builtin_setjmp_setup", ftype,
9551 BUILT_IN_SETJMP_SETUP,
9552 "__builtin_setjmp_setup", ECF_NOTHROW);
9554 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9555 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9556 BUILT_IN_SETJMP_DISPATCHER,
9557 "__builtin_setjmp_dispatcher",
9558 ECF_PURE | ECF_NOTHROW);
9560 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9561 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9562 BUILT_IN_SETJMP_RECEIVER,
9563 "__builtin_setjmp_receiver", ECF_NOTHROW);
9565 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9566 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9567 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9569 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9570 local_define_builtin ("__builtin_stack_restore", ftype,
9571 BUILT_IN_STACK_RESTORE,
9572 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9574 /* If there's a possibility that we might use the ARM EABI, build the
9575 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9576 if (targetm.arm_eabi_unwinder)
9578 ftype = build_function_type_list (void_type_node, NULL_TREE);
9579 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9580 BUILT_IN_CXA_END_CLEANUP,
9581 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9584 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9585 local_define_builtin ("__builtin_unwind_resume", ftype,
9586 BUILT_IN_UNWIND_RESUME,
9587 ((targetm_common.except_unwind_info (&global_options)
9589 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9592 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS) == NULL_TREE)
9594 ftype = build_function_type_list (ptr_type_node, integer_type_node,
9596 local_define_builtin ("__builtin_return_address", ftype,
9597 BUILT_IN_RETURN_ADDRESS,
9598 "__builtin_return_address",
9602 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER)
9603 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
9605 ftype = build_function_type_list (void_type_node, ptr_type_node,
9606 ptr_type_node, NULL_TREE);
9607 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER))
9608 local_define_builtin ("__cyg_profile_func_enter", ftype,
9609 BUILT_IN_PROFILE_FUNC_ENTER,
9610 "__cyg_profile_func_enter", 0);
9611 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
9612 local_define_builtin ("__cyg_profile_func_exit", ftype,
9613 BUILT_IN_PROFILE_FUNC_EXIT,
9614 "__cyg_profile_func_exit", 0);
9617 /* The exception object and filter values from the runtime. The argument
9618 must be zero before exception lowering, i.e. from the front end. After
9619 exception lowering, it will be the region number for the exception
9620 landing pad. These functions are PURE instead of CONST to prevent
9621 them from being hoisted past the exception edge that will initialize
9622 its value in the landing pad. */
9623 ftype = build_function_type_list (ptr_type_node,
9624 integer_type_node, NULL_TREE);
9625 ecf_flags = ECF_PURE | ECF_NOTHROW | ECF_LEAF;
9626 /* Only use TM_PURE if we we have TM language support. */
9627 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1))
9628 ecf_flags |= ECF_TM_PURE;
9629 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9630 "__builtin_eh_pointer", ecf_flags);
9632 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9633 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9634 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9635 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9637 ftype = build_function_type_list (void_type_node,
9638 integer_type_node, integer_type_node,
9640 local_define_builtin ("__builtin_eh_copy_values", ftype,
9641 BUILT_IN_EH_COPY_VALUES,
9642 "__builtin_eh_copy_values", ECF_NOTHROW);
9644 /* Complex multiplication and division. These are handled as builtins
9645 rather than optabs because emit_library_call_value doesn't support
9646 complex. Further, we can do slightly better with folding these
9647 beasties if the real and complex parts of the arguments are separate. */
9651 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9653 char mode_name_buf[4], *q;
9655 enum built_in_function mcode, dcode;
9656 tree type, inner_type;
9657 const char *prefix = "__";
9659 if (targetm.libfunc_gnu_prefix)
9662 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9665 inner_type = TREE_TYPE (type);
9667 ftype = build_function_type_list (type, inner_type, inner_type,
9668 inner_type, inner_type, NULL_TREE);
9670 mcode = ((enum built_in_function)
9671 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9672 dcode = ((enum built_in_function)
9673 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9675 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9679 built_in_names[mcode] = concat (prefix, "mul", mode_name_buf, "3",
9681 local_define_builtin (built_in_names[mcode], ftype, mcode,
9682 built_in_names[mcode],
9683 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9685 built_in_names[dcode] = concat (prefix, "div", mode_name_buf, "3",
9687 local_define_builtin (built_in_names[dcode], ftype, dcode,
9688 built_in_names[dcode],
9689 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9694 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9697 If we requested a pointer to a vector, build up the pointers that
9698 we stripped off while looking for the inner type. Similarly for
9699 return values from functions.
9701 The argument TYPE is the top of the chain, and BOTTOM is the
9702 new type which we will point to. */
9705 reconstruct_complex_type (tree type, tree bottom)
9709 if (TREE_CODE (type) == POINTER_TYPE)
9711 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9712 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9713 TYPE_REF_CAN_ALIAS_ALL (type));
9715 else if (TREE_CODE (type) == REFERENCE_TYPE)
9717 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9718 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9719 TYPE_REF_CAN_ALIAS_ALL (type));
9721 else if (TREE_CODE (type) == ARRAY_TYPE)
9723 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9724 outer = build_array_type (inner, TYPE_DOMAIN (type));
9726 else if (TREE_CODE (type) == FUNCTION_TYPE)
9728 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9729 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9731 else if (TREE_CODE (type) == METHOD_TYPE)
9733 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9734 /* The build_method_type_directly() routine prepends 'this' to argument list,
9735 so we must compensate by getting rid of it. */
9737 = build_method_type_directly
9738 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9740 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9742 else if (TREE_CODE (type) == OFFSET_TYPE)
9744 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9745 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9750 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9754 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9757 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9761 switch (GET_MODE_CLASS (mode))
9763 case MODE_VECTOR_INT:
9764 case MODE_VECTOR_FLOAT:
9765 case MODE_VECTOR_FRACT:
9766 case MODE_VECTOR_UFRACT:
9767 case MODE_VECTOR_ACCUM:
9768 case MODE_VECTOR_UACCUM:
9769 nunits = GET_MODE_NUNITS (mode);
9773 /* Check that there are no leftover bits. */
9774 gcc_assert (GET_MODE_BITSIZE (mode)
9775 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9777 nunits = GET_MODE_BITSIZE (mode)
9778 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9785 return make_vector_type (innertype, nunits, mode);
9788 /* Similarly, but takes the inner type and number of units, which must be
9792 build_vector_type (tree innertype, int nunits)
9794 return make_vector_type (innertype, nunits, VOIDmode);
9797 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9800 build_opaque_vector_type (tree innertype, int nunits)
9802 tree t = make_vector_type (innertype, nunits, VOIDmode);
9804 /* We always build the non-opaque variant before the opaque one,
9805 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9806 cand = TYPE_NEXT_VARIANT (t);
9808 && TYPE_VECTOR_OPAQUE (cand)
9809 && check_qualified_type (cand, t, TYPE_QUALS (t)))
9811 /* Othewise build a variant type and make sure to queue it after
9812 the non-opaque type. */
9813 cand = build_distinct_type_copy (t);
9814 TYPE_VECTOR_OPAQUE (cand) = true;
9815 TYPE_CANONICAL (cand) = TYPE_CANONICAL (t);
9816 TYPE_NEXT_VARIANT (cand) = TYPE_NEXT_VARIANT (t);
9817 TYPE_NEXT_VARIANT (t) = cand;
9818 TYPE_MAIN_VARIANT (cand) = TYPE_MAIN_VARIANT (t);
9823 /* Given an initializer INIT, return TRUE if INIT is zero or some
9824 aggregate of zeros. Otherwise return FALSE. */
9826 initializer_zerop (const_tree init)
9832 switch (TREE_CODE (init))
9835 return integer_zerop (init);
9838 /* ??? Note that this is not correct for C4X float formats. There,
9839 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9840 negative exponent. */
9841 return real_zerop (init)
9842 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9845 return fixed_zerop (init);
9848 return integer_zerop (init)
9849 || (real_zerop (init)
9850 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9851 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9854 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9855 if (!initializer_zerop (TREE_VALUE (elt)))
9861 unsigned HOST_WIDE_INT idx;
9863 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9864 if (!initializer_zerop (elt))
9873 /* We need to loop through all elements to handle cases like
9874 "\0" and "\0foobar". */
9875 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9876 if (TREE_STRING_POINTER (init)[i] != '\0')
9887 /* Build an empty statement at location LOC. */
9890 build_empty_stmt (location_t loc)
9892 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9893 SET_EXPR_LOCATION (t, loc);
9898 /* Build an OpenMP clause with code CODE. LOC is the location of the
9902 build_omp_clause (location_t loc, enum omp_clause_code code)
9907 length = omp_clause_num_ops[code];
9908 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9910 record_node_allocation_statistics (OMP_CLAUSE, size);
9912 t = ggc_alloc_tree_node (size);
9913 memset (t, 0, size);
9914 TREE_SET_CODE (t, OMP_CLAUSE);
9915 OMP_CLAUSE_SET_CODE (t, code);
9916 OMP_CLAUSE_LOCATION (t) = loc;
9921 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9922 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9923 Except for the CODE and operand count field, other storage for the
9924 object is initialized to zeros. */
9927 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9930 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9932 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9933 gcc_assert (len >= 1);
9935 record_node_allocation_statistics (code, length);
9937 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9939 TREE_SET_CODE (t, code);
9941 /* Can't use TREE_OPERAND to store the length because if checking is
9942 enabled, it will try to check the length before we store it. :-P */
9943 t->exp.operands[0] = build_int_cst (sizetype, len);
9948 /* Helper function for build_call_* functions; build a CALL_EXPR with
9949 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9950 the argument slots. */
9953 build_call_1 (tree return_type, tree fn, int nargs)
9957 t = build_vl_exp (CALL_EXPR, nargs + 3);
9958 TREE_TYPE (t) = return_type;
9959 CALL_EXPR_FN (t) = fn;
9960 CALL_EXPR_STATIC_CHAIN (t) = NULL;
9965 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9966 FN and a null static chain slot. NARGS is the number of call arguments
9967 which are specified as "..." arguments. */
9970 build_call_nary (tree return_type, tree fn, int nargs, ...)
9974 va_start (args, nargs);
9975 ret = build_call_valist (return_type, fn, nargs, args);
9980 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9981 FN and a null static chain slot. NARGS is the number of call arguments
9982 which are specified as a va_list ARGS. */
9985 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9990 t = build_call_1 (return_type, fn, nargs);
9991 for (i = 0; i < nargs; i++)
9992 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9993 process_call_operands (t);
9997 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9998 FN and a null static chain slot. NARGS is the number of call arguments
9999 which are specified as a tree array ARGS. */
10002 build_call_array_loc (location_t loc, tree return_type, tree fn,
10003 int nargs, const tree *args)
10008 t = build_call_1 (return_type, fn, nargs);
10009 for (i = 0; i < nargs; i++)
10010 CALL_EXPR_ARG (t, i) = args[i];
10011 process_call_operands (t);
10012 SET_EXPR_LOCATION (t, loc);
10016 /* Like build_call_array, but takes a VEC. */
10019 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
10024 ret = build_call_1 (return_type, fn, VEC_length (tree, args));
10025 FOR_EACH_VEC_ELT (tree, args, ix, t)
10026 CALL_EXPR_ARG (ret, ix) = t;
10027 process_call_operands (ret);
10032 /* Returns true if it is possible to prove that the index of
10033 an array access REF (an ARRAY_REF expression) falls into the
10037 in_array_bounds_p (tree ref)
10039 tree idx = TREE_OPERAND (ref, 1);
10042 if (TREE_CODE (idx) != INTEGER_CST)
10045 min = array_ref_low_bound (ref);
10046 max = array_ref_up_bound (ref);
10049 || TREE_CODE (min) != INTEGER_CST
10050 || TREE_CODE (max) != INTEGER_CST)
10053 if (tree_int_cst_lt (idx, min)
10054 || tree_int_cst_lt (max, idx))
10060 /* Returns true if it is possible to prove that the range of
10061 an array access REF (an ARRAY_RANGE_REF expression) falls
10062 into the array bounds. */
10065 range_in_array_bounds_p (tree ref)
10067 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
10068 tree range_min, range_max, min, max;
10070 range_min = TYPE_MIN_VALUE (domain_type);
10071 range_max = TYPE_MAX_VALUE (domain_type);
10074 || TREE_CODE (range_min) != INTEGER_CST
10075 || TREE_CODE (range_max) != INTEGER_CST)
10078 min = array_ref_low_bound (ref);
10079 max = array_ref_up_bound (ref);
10082 || TREE_CODE (min) != INTEGER_CST
10083 || TREE_CODE (max) != INTEGER_CST)
10086 if (tree_int_cst_lt (range_min, min)
10087 || tree_int_cst_lt (max, range_max))
10093 /* Return true if T (assumed to be a DECL) must be assigned a memory
10097 needs_to_live_in_memory (const_tree t)
10099 if (TREE_CODE (t) == SSA_NAME)
10100 t = SSA_NAME_VAR (t);
10102 return (TREE_ADDRESSABLE (t)
10103 || is_global_var (t)
10104 || (TREE_CODE (t) == RESULT_DECL
10105 && !DECL_BY_REFERENCE (t)
10106 && aggregate_value_p (t, current_function_decl)));
10109 /* Return value of a constant X and sign-extend it. */
10112 int_cst_value (const_tree x)
10114 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10115 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
10117 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10118 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10119 || TREE_INT_CST_HIGH (x) == -1);
10121 if (bits < HOST_BITS_PER_WIDE_INT)
10123 bool negative = ((val >> (bits - 1)) & 1) != 0;
10125 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
10127 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
10133 /* Return value of a constant X and sign-extend it. */
10136 widest_int_cst_value (const_tree x)
10138 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10139 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
10141 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10142 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
10143 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
10144 << HOST_BITS_PER_WIDE_INT);
10146 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10147 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10148 || TREE_INT_CST_HIGH (x) == -1);
10151 if (bits < HOST_BITS_PER_WIDEST_INT)
10153 bool negative = ((val >> (bits - 1)) & 1) != 0;
10155 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
10157 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
10163 /* If TYPE is an integral type, return an equivalent type which is
10164 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
10165 return TYPE itself. */
10168 signed_or_unsigned_type_for (int unsignedp, tree type)
10171 if (POINTER_TYPE_P (type))
10173 /* If the pointer points to the normal address space, use the
10174 size_type_node. Otherwise use an appropriate size for the pointer
10175 based on the named address space it points to. */
10176 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
10177 t = size_type_node;
10179 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10182 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
10185 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10188 /* Returns unsigned variant of TYPE. */
10191 unsigned_type_for (tree type)
10193 return signed_or_unsigned_type_for (1, type);
10196 /* Returns signed variant of TYPE. */
10199 signed_type_for (tree type)
10201 return signed_or_unsigned_type_for (0, type);
10204 /* Returns the largest value obtainable by casting something in INNER type to
10208 upper_bound_in_type (tree outer, tree inner)
10211 unsigned int det = 0;
10212 unsigned oprec = TYPE_PRECISION (outer);
10213 unsigned iprec = TYPE_PRECISION (inner);
10216 /* Compute a unique number for every combination. */
10217 det |= (oprec > iprec) ? 4 : 0;
10218 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10219 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10221 /* Determine the exponent to use. */
10226 /* oprec <= iprec, outer: signed, inner: don't care. */
10231 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10235 /* oprec > iprec, outer: signed, inner: signed. */
10239 /* oprec > iprec, outer: signed, inner: unsigned. */
10243 /* oprec > iprec, outer: unsigned, inner: signed. */
10247 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10251 gcc_unreachable ();
10254 /* Compute 2^^prec - 1. */
10255 if (prec <= HOST_BITS_PER_WIDE_INT)
10258 high.low = ((~(unsigned HOST_WIDE_INT) 0)
10259 >> (HOST_BITS_PER_WIDE_INT - prec));
10263 high.high = ((~(unsigned HOST_WIDE_INT) 0)
10264 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
10265 high.low = ~(unsigned HOST_WIDE_INT) 0;
10268 return double_int_to_tree (outer, high);
10271 /* Returns the smallest value obtainable by casting something in INNER type to
10275 lower_bound_in_type (tree outer, tree inner)
10278 unsigned oprec = TYPE_PRECISION (outer);
10279 unsigned iprec = TYPE_PRECISION (inner);
10281 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10283 if (TYPE_UNSIGNED (outer)
10284 /* If we are widening something of an unsigned type, OUTER type
10285 contains all values of INNER type. In particular, both INNER
10286 and OUTER types have zero in common. */
10287 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10288 low.low = low.high = 0;
10291 /* If we are widening a signed type to another signed type, we
10292 want to obtain -2^^(iprec-1). If we are keeping the
10293 precision or narrowing to a signed type, we want to obtain
10295 unsigned prec = oprec > iprec ? iprec : oprec;
10297 if (prec <= HOST_BITS_PER_WIDE_INT)
10299 low.high = ~(unsigned HOST_WIDE_INT) 0;
10300 low.low = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10304 low.high = ((~(unsigned HOST_WIDE_INT) 0)
10305 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10310 return double_int_to_tree (outer, low);
10313 /* Return nonzero if two operands that are suitable for PHI nodes are
10314 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10315 SSA_NAME or invariant. Note that this is strictly an optimization.
10316 That is, callers of this function can directly call operand_equal_p
10317 and get the same result, only slower. */
10320 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10324 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10326 return operand_equal_p (arg0, arg1, 0);
10329 /* Returns number of zeros at the end of binary representation of X.
10331 ??? Use ffs if available? */
10334 num_ending_zeros (const_tree x)
10336 unsigned HOST_WIDE_INT fr, nfr;
10337 unsigned num, abits;
10338 tree type = TREE_TYPE (x);
10340 if (TREE_INT_CST_LOW (x) == 0)
10342 num = HOST_BITS_PER_WIDE_INT;
10343 fr = TREE_INT_CST_HIGH (x);
10348 fr = TREE_INT_CST_LOW (x);
10351 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10354 if (nfr << abits == fr)
10361 if (num > TYPE_PRECISION (type))
10362 num = TYPE_PRECISION (type);
10364 return build_int_cst_type (type, num);
10368 #define WALK_SUBTREE(NODE) \
10371 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10377 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10378 be walked whenever a type is seen in the tree. Rest of operands and return
10379 value are as for walk_tree. */
10382 walk_type_fields (tree type, walk_tree_fn func, void *data,
10383 struct pointer_set_t *pset, walk_tree_lh lh)
10385 tree result = NULL_TREE;
10387 switch (TREE_CODE (type))
10390 case REFERENCE_TYPE:
10391 /* We have to worry about mutually recursive pointers. These can't
10392 be written in C. They can in Ada. It's pathological, but
10393 there's an ACATS test (c38102a) that checks it. Deal with this
10394 by checking if we're pointing to another pointer, that one
10395 points to another pointer, that one does too, and we have no htab.
10396 If so, get a hash table. We check three levels deep to avoid
10397 the cost of the hash table if we don't need one. */
10398 if (POINTER_TYPE_P (TREE_TYPE (type))
10399 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10400 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10403 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10411 /* ... fall through ... */
10414 WALK_SUBTREE (TREE_TYPE (type));
10418 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10420 /* Fall through. */
10422 case FUNCTION_TYPE:
10423 WALK_SUBTREE (TREE_TYPE (type));
10427 /* We never want to walk into default arguments. */
10428 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10429 WALK_SUBTREE (TREE_VALUE (arg));
10434 /* Don't follow this nodes's type if a pointer for fear that
10435 we'll have infinite recursion. If we have a PSET, then we
10438 || (!POINTER_TYPE_P (TREE_TYPE (type))
10439 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10440 WALK_SUBTREE (TREE_TYPE (type));
10441 WALK_SUBTREE (TYPE_DOMAIN (type));
10445 WALK_SUBTREE (TREE_TYPE (type));
10446 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10456 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10457 called with the DATA and the address of each sub-tree. If FUNC returns a
10458 non-NULL value, the traversal is stopped, and the value returned by FUNC
10459 is returned. If PSET is non-NULL it is used to record the nodes visited,
10460 and to avoid visiting a node more than once. */
10463 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10464 struct pointer_set_t *pset, walk_tree_lh lh)
10466 enum tree_code code;
10470 #define WALK_SUBTREE_TAIL(NODE) \
10474 goto tail_recurse; \
10479 /* Skip empty subtrees. */
10483 /* Don't walk the same tree twice, if the user has requested
10484 that we avoid doing so. */
10485 if (pset && pointer_set_insert (pset, *tp))
10488 /* Call the function. */
10490 result = (*func) (tp, &walk_subtrees, data);
10492 /* If we found something, return it. */
10496 code = TREE_CODE (*tp);
10498 /* Even if we didn't, FUNC may have decided that there was nothing
10499 interesting below this point in the tree. */
10500 if (!walk_subtrees)
10502 /* But we still need to check our siblings. */
10503 if (code == TREE_LIST)
10504 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10505 else if (code == OMP_CLAUSE)
10506 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10513 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10514 if (result || !walk_subtrees)
10521 case IDENTIFIER_NODE:
10528 case PLACEHOLDER_EXPR:
10532 /* None of these have subtrees other than those already walked
10537 WALK_SUBTREE (TREE_VALUE (*tp));
10538 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10543 int len = TREE_VEC_LENGTH (*tp);
10548 /* Walk all elements but the first. */
10550 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10552 /* Now walk the first one as a tail call. */
10553 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10557 WALK_SUBTREE (TREE_REALPART (*tp));
10558 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10562 unsigned HOST_WIDE_INT idx;
10563 constructor_elt *ce;
10566 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10568 WALK_SUBTREE (ce->value);
10573 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10578 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10580 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10581 into declarations that are just mentioned, rather than
10582 declared; they don't really belong to this part of the tree.
10583 And, we can see cycles: the initializer for a declaration
10584 can refer to the declaration itself. */
10585 WALK_SUBTREE (DECL_INITIAL (decl));
10586 WALK_SUBTREE (DECL_SIZE (decl));
10587 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10589 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10592 case STATEMENT_LIST:
10594 tree_stmt_iterator i;
10595 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10596 WALK_SUBTREE (*tsi_stmt_ptr (i));
10601 switch (OMP_CLAUSE_CODE (*tp))
10603 case OMP_CLAUSE_PRIVATE:
10604 case OMP_CLAUSE_SHARED:
10605 case OMP_CLAUSE_FIRSTPRIVATE:
10606 case OMP_CLAUSE_COPYIN:
10607 case OMP_CLAUSE_COPYPRIVATE:
10608 case OMP_CLAUSE_FINAL:
10609 case OMP_CLAUSE_IF:
10610 case OMP_CLAUSE_NUM_THREADS:
10611 case OMP_CLAUSE_SCHEDULE:
10612 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10615 case OMP_CLAUSE_NOWAIT:
10616 case OMP_CLAUSE_ORDERED:
10617 case OMP_CLAUSE_DEFAULT:
10618 case OMP_CLAUSE_UNTIED:
10619 case OMP_CLAUSE_MERGEABLE:
10620 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10622 case OMP_CLAUSE_LASTPRIVATE:
10623 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10624 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10625 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10627 case OMP_CLAUSE_COLLAPSE:
10630 for (i = 0; i < 3; i++)
10631 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10632 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10635 case OMP_CLAUSE_REDUCTION:
10638 for (i = 0; i < 4; i++)
10639 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10640 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10644 gcc_unreachable ();
10652 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10653 But, we only want to walk once. */
10654 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10655 for (i = 0; i < len; ++i)
10656 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10657 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10661 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10662 defining. We only want to walk into these fields of a type in this
10663 case and not in the general case of a mere reference to the type.
10665 The criterion is as follows: if the field can be an expression, it
10666 must be walked only here. This should be in keeping with the fields
10667 that are directly gimplified in gimplify_type_sizes in order for the
10668 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10669 variable-sized types.
10671 Note that DECLs get walked as part of processing the BIND_EXPR. */
10672 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10674 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10675 if (TREE_CODE (*type_p) == ERROR_MARK)
10678 /* Call the function for the type. See if it returns anything or
10679 doesn't want us to continue. If we are to continue, walk both
10680 the normal fields and those for the declaration case. */
10681 result = (*func) (type_p, &walk_subtrees, data);
10682 if (result || !walk_subtrees)
10685 /* But do not walk a pointed-to type since it may itself need to
10686 be walked in the declaration case if it isn't anonymous. */
10687 if (!POINTER_TYPE_P (*type_p))
10689 result = walk_type_fields (*type_p, func, data, pset, lh);
10694 /* If this is a record type, also walk the fields. */
10695 if (RECORD_OR_UNION_TYPE_P (*type_p))
10699 for (field = TYPE_FIELDS (*type_p); field;
10700 field = DECL_CHAIN (field))
10702 /* We'd like to look at the type of the field, but we can
10703 easily get infinite recursion. So assume it's pointed
10704 to elsewhere in the tree. Also, ignore things that
10706 if (TREE_CODE (field) != FIELD_DECL)
10709 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10710 WALK_SUBTREE (DECL_SIZE (field));
10711 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10712 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10713 WALK_SUBTREE (DECL_QUALIFIER (field));
10717 /* Same for scalar types. */
10718 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10719 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10720 || TREE_CODE (*type_p) == INTEGER_TYPE
10721 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10722 || TREE_CODE (*type_p) == REAL_TYPE)
10724 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10725 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10728 WALK_SUBTREE (TYPE_SIZE (*type_p));
10729 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10734 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10738 /* Walk over all the sub-trees of this operand. */
10739 len = TREE_OPERAND_LENGTH (*tp);
10741 /* Go through the subtrees. We need to do this in forward order so
10742 that the scope of a FOR_EXPR is handled properly. */
10745 for (i = 0; i < len - 1; ++i)
10746 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10747 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10750 /* If this is a type, walk the needed fields in the type. */
10751 else if (TYPE_P (*tp))
10752 return walk_type_fields (*tp, func, data, pset, lh);
10756 /* We didn't find what we were looking for. */
10759 #undef WALK_SUBTREE_TAIL
10761 #undef WALK_SUBTREE
10763 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10766 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10770 struct pointer_set_t *pset;
10772 pset = pointer_set_create ();
10773 result = walk_tree_1 (tp, func, data, pset, lh);
10774 pointer_set_destroy (pset);
10780 tree_block (tree t)
10782 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10784 if (IS_EXPR_CODE_CLASS (c))
10785 return &t->exp.block;
10786 gcc_unreachable ();
10790 /* Create a nameless artificial label and put it in the current
10791 function context. The label has a location of LOC. Returns the
10792 newly created label. */
10795 create_artificial_label (location_t loc)
10797 tree lab = build_decl (loc,
10798 LABEL_DECL, NULL_TREE, void_type_node);
10800 DECL_ARTIFICIAL (lab) = 1;
10801 DECL_IGNORED_P (lab) = 1;
10802 DECL_CONTEXT (lab) = current_function_decl;
10806 /* Given a tree, try to return a useful variable name that we can use
10807 to prefix a temporary that is being assigned the value of the tree.
10808 I.E. given <temp> = &A, return A. */
10813 tree stripped_decl;
10816 STRIP_NOPS (stripped_decl);
10817 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10818 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10821 switch (TREE_CODE (stripped_decl))
10824 return get_name (TREE_OPERAND (stripped_decl, 0));
10831 /* Return true if TYPE has a variable argument list. */
10834 stdarg_p (const_tree fntype)
10836 function_args_iterator args_iter;
10837 tree n = NULL_TREE, t;
10842 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10847 return n != NULL_TREE && n != void_type_node;
10850 /* Return true if TYPE has a prototype. */
10853 prototype_p (tree fntype)
10857 gcc_assert (fntype != NULL_TREE);
10859 t = TYPE_ARG_TYPES (fntype);
10860 return (t != NULL_TREE);
10863 /* If BLOCK is inlined from an __attribute__((__artificial__))
10864 routine, return pointer to location from where it has been
10867 block_nonartificial_location (tree block)
10869 location_t *ret = NULL;
10871 while (block && TREE_CODE (block) == BLOCK
10872 && BLOCK_ABSTRACT_ORIGIN (block))
10874 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10876 while (TREE_CODE (ao) == BLOCK
10877 && BLOCK_ABSTRACT_ORIGIN (ao)
10878 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10879 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10881 if (TREE_CODE (ao) == FUNCTION_DECL)
10883 /* If AO is an artificial inline, point RET to the
10884 call site locus at which it has been inlined and continue
10885 the loop, in case AO's caller is also an artificial
10887 if (DECL_DECLARED_INLINE_P (ao)
10888 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10889 ret = &BLOCK_SOURCE_LOCATION (block);
10893 else if (TREE_CODE (ao) != BLOCK)
10896 block = BLOCK_SUPERCONTEXT (block);
10902 /* If EXP is inlined from an __attribute__((__artificial__))
10903 function, return the location of the original call expression. */
10906 tree_nonartificial_location (tree exp)
10908 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10913 return EXPR_LOCATION (exp);
10917 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10920 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10923 cl_option_hash_hash (const void *x)
10925 const_tree const t = (const_tree) x;
10929 hashval_t hash = 0;
10931 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10933 p = (const char *)TREE_OPTIMIZATION (t);
10934 len = sizeof (struct cl_optimization);
10937 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10939 p = (const char *)TREE_TARGET_OPTION (t);
10940 len = sizeof (struct cl_target_option);
10944 gcc_unreachable ();
10946 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10948 for (i = 0; i < len; i++)
10950 hash = (hash << 4) ^ ((i << 2) | p[i]);
10955 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10956 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10960 cl_option_hash_eq (const void *x, const void *y)
10962 const_tree const xt = (const_tree) x;
10963 const_tree const yt = (const_tree) y;
10968 if (TREE_CODE (xt) != TREE_CODE (yt))
10971 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10973 xp = (const char *)TREE_OPTIMIZATION (xt);
10974 yp = (const char *)TREE_OPTIMIZATION (yt);
10975 len = sizeof (struct cl_optimization);
10978 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10980 xp = (const char *)TREE_TARGET_OPTION (xt);
10981 yp = (const char *)TREE_TARGET_OPTION (yt);
10982 len = sizeof (struct cl_target_option);
10986 gcc_unreachable ();
10988 return (memcmp (xp, yp, len) == 0);
10991 /* Build an OPTIMIZATION_NODE based on the current options. */
10994 build_optimization_node (void)
10999 /* Use the cache of optimization nodes. */
11001 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
11004 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
11008 /* Insert this one into the hash table. */
11009 t = cl_optimization_node;
11012 /* Make a new node for next time round. */
11013 cl_optimization_node = make_node (OPTIMIZATION_NODE);
11019 /* Build a TARGET_OPTION_NODE based on the current options. */
11022 build_target_option_node (void)
11027 /* Use the cache of optimization nodes. */
11029 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
11032 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
11036 /* Insert this one into the hash table. */
11037 t = cl_target_option_node;
11040 /* Make a new node for next time round. */
11041 cl_target_option_node = make_node (TARGET_OPTION_NODE);
11047 /* Determine the "ultimate origin" of a block. The block may be an inlined
11048 instance of an inlined instance of a block which is local to an inline
11049 function, so we have to trace all of the way back through the origin chain
11050 to find out what sort of node actually served as the original seed for the
11054 block_ultimate_origin (const_tree block)
11056 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
11058 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11059 nodes in the function to point to themselves; ignore that if
11060 we're trying to output the abstract instance of this function. */
11061 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
11064 if (immediate_origin == NULL_TREE)
11069 tree lookahead = immediate_origin;
11073 ret_val = lookahead;
11074 lookahead = (TREE_CODE (ret_val) == BLOCK
11075 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
11077 while (lookahead != NULL && lookahead != ret_val);
11079 /* The block's abstract origin chain may not be the *ultimate* origin of
11080 the block. It could lead to a DECL that has an abstract origin set.
11081 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11082 will give us if it has one). Note that DECL's abstract origins are
11083 supposed to be the most distant ancestor (or so decl_ultimate_origin
11084 claims), so we don't need to loop following the DECL origins. */
11085 if (DECL_P (ret_val))
11086 return DECL_ORIGIN (ret_val);
11092 /* Return true if T1 and T2 are equivalent lists. */
11095 list_equal_p (const_tree t1, const_tree t2)
11097 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
11098 if (TREE_VALUE (t1) != TREE_VALUE (t2))
11103 /* Return true iff conversion in EXP generates no instruction. Mark
11104 it inline so that we fully inline into the stripping functions even
11105 though we have two uses of this function. */
11108 tree_nop_conversion (const_tree exp)
11110 tree outer_type, inner_type;
11112 if (!CONVERT_EXPR_P (exp)
11113 && TREE_CODE (exp) != NON_LVALUE_EXPR)
11115 if (TREE_OPERAND (exp, 0) == error_mark_node)
11118 outer_type = TREE_TYPE (exp);
11119 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11124 /* Use precision rather then machine mode when we can, which gives
11125 the correct answer even for submode (bit-field) types. */
11126 if ((INTEGRAL_TYPE_P (outer_type)
11127 || POINTER_TYPE_P (outer_type)
11128 || TREE_CODE (outer_type) == OFFSET_TYPE)
11129 && (INTEGRAL_TYPE_P (inner_type)
11130 || POINTER_TYPE_P (inner_type)
11131 || TREE_CODE (inner_type) == OFFSET_TYPE))
11132 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
11134 /* Otherwise fall back on comparing machine modes (e.g. for
11135 aggregate types, floats). */
11136 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
11139 /* Return true iff conversion in EXP generates no instruction. Don't
11140 consider conversions changing the signedness. */
11143 tree_sign_nop_conversion (const_tree exp)
11145 tree outer_type, inner_type;
11147 if (!tree_nop_conversion (exp))
11150 outer_type = TREE_TYPE (exp);
11151 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11153 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
11154 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
11157 /* Strip conversions from EXP according to tree_nop_conversion and
11158 return the resulting expression. */
11161 tree_strip_nop_conversions (tree exp)
11163 while (tree_nop_conversion (exp))
11164 exp = TREE_OPERAND (exp, 0);
11168 /* Strip conversions from EXP according to tree_sign_nop_conversion
11169 and return the resulting expression. */
11172 tree_strip_sign_nop_conversions (tree exp)
11174 while (tree_sign_nop_conversion (exp))
11175 exp = TREE_OPERAND (exp, 0);
11179 /* Strip out all handled components that produce invariant
11183 strip_invariant_refs (const_tree op)
11185 while (handled_component_p (op))
11187 switch (TREE_CODE (op))
11190 case ARRAY_RANGE_REF:
11191 if (!is_gimple_constant (TREE_OPERAND (op, 1))
11192 || TREE_OPERAND (op, 2) != NULL_TREE
11193 || TREE_OPERAND (op, 3) != NULL_TREE)
11197 case COMPONENT_REF:
11198 if (TREE_OPERAND (op, 2) != NULL_TREE)
11204 op = TREE_OPERAND (op, 0);
11210 static GTY(()) tree gcc_eh_personality_decl;
11212 /* Return the GCC personality function decl. */
11215 lhd_gcc_personality (void)
11217 if (!gcc_eh_personality_decl)
11218 gcc_eh_personality_decl = build_personality_function ("gcc");
11219 return gcc_eh_personality_decl;
11222 /* Try to find a base info of BINFO that would have its field decl at offset
11223 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11224 found, return, otherwise return NULL_TREE. */
11227 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
11229 tree type = BINFO_TYPE (binfo);
11233 HOST_WIDE_INT pos, size;
11237 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (expected_type))
11242 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
11244 if (TREE_CODE (fld) != FIELD_DECL)
11247 pos = int_bit_position (fld);
11248 size = tree_low_cst (DECL_SIZE (fld), 1);
11249 if (pos <= offset && (pos + size) > offset)
11252 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
11255 if (!DECL_ARTIFICIAL (fld))
11257 binfo = TYPE_BINFO (TREE_TYPE (fld));
11261 /* Offset 0 indicates the primary base, whose vtable contents are
11262 represented in the binfo for the derived class. */
11263 else if (offset != 0)
11265 tree base_binfo, found_binfo = NULL_TREE;
11266 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
11267 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
11269 found_binfo = base_binfo;
11274 binfo = found_binfo;
11277 type = TREE_TYPE (fld);
11282 /* Returns true if X is a typedef decl. */
11285 is_typedef_decl (tree x)
11287 return (x && TREE_CODE (x) == TYPE_DECL
11288 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
11291 /* Returns true iff TYPE is a type variant created for a typedef. */
11294 typedef_variant_p (tree type)
11296 return is_typedef_decl (TYPE_NAME (type));
11299 /* Warn about a use of an identifier which was marked deprecated. */
11301 warn_deprecated_use (tree node, tree attr)
11305 if (node == 0 || !warn_deprecated_decl)
11311 attr = DECL_ATTRIBUTES (node);
11312 else if (TYPE_P (node))
11314 tree decl = TYPE_STUB_DECL (node);
11316 attr = lookup_attribute ("deprecated",
11317 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
11322 attr = lookup_attribute ("deprecated", attr);
11325 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
11331 expanded_location xloc = expand_location (DECL_SOURCE_LOCATION (node));
11333 warning (OPT_Wdeprecated_declarations,
11334 "%qD is deprecated (declared at %s:%d): %s",
11335 node, xloc.file, xloc.line, msg);
11337 warning (OPT_Wdeprecated_declarations,
11338 "%qD is deprecated (declared at %s:%d)",
11339 node, xloc.file, xloc.line);
11341 else if (TYPE_P (node))
11343 tree what = NULL_TREE;
11344 tree decl = TYPE_STUB_DECL (node);
11346 if (TYPE_NAME (node))
11348 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
11349 what = TYPE_NAME (node);
11350 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
11351 && DECL_NAME (TYPE_NAME (node)))
11352 what = DECL_NAME (TYPE_NAME (node));
11357 expanded_location xloc
11358 = expand_location (DECL_SOURCE_LOCATION (decl));
11362 warning (OPT_Wdeprecated_declarations,
11363 "%qE is deprecated (declared at %s:%d): %s",
11364 what, xloc.file, xloc.line, msg);
11366 warning (OPT_Wdeprecated_declarations,
11367 "%qE is deprecated (declared at %s:%d)", what,
11368 xloc.file, xloc.line);
11373 warning (OPT_Wdeprecated_declarations,
11374 "type is deprecated (declared at %s:%d): %s",
11375 xloc.file, xloc.line, msg);
11377 warning (OPT_Wdeprecated_declarations,
11378 "type is deprecated (declared at %s:%d)",
11379 xloc.file, xloc.line);
11387 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
11390 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
11395 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
11398 warning (OPT_Wdeprecated_declarations, "type is deprecated");
11404 #include "gt-tree.h"