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:
1620 case OFFSET_TYPE: case NULLPTR_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:
2930 case FIXED_POINT_TYPE:
2931 /* Here we just check the bounds. */
2932 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2933 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2936 /* We have already checked the component type above, so just check the
2938 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2942 case QUAL_UNION_TYPE:
2946 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2947 if (TREE_CODE (field) == FIELD_DECL
2948 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2949 || (TREE_CODE (type) == QUAL_UNION_TYPE
2950 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2951 || type_contains_placeholder_p (TREE_TYPE (field))))
2962 /* Wrapper around above function used to cache its result. */
2965 type_contains_placeholder_p (tree type)
2969 /* If the contains_placeholder_bits field has been initialized,
2970 then we know the answer. */
2971 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2972 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2974 /* Indicate that we've seen this type node, and the answer is false.
2975 This is what we want to return if we run into recursion via fields. */
2976 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2978 /* Compute the real value. */
2979 result = type_contains_placeholder_1 (type);
2981 /* Store the real value. */
2982 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2987 /* Push tree EXP onto vector QUEUE if it is not already present. */
2990 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2995 FOR_EACH_VEC_ELT (tree, *queue, i, iter)
2996 if (simple_cst_equal (iter, exp) == 1)
3000 VEC_safe_push (tree, heap, *queue, exp);
3003 /* Given a tree EXP, find all occurences of references to fields
3004 in a PLACEHOLDER_EXPR and place them in vector REFS without
3005 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3006 we assume here that EXP contains only arithmetic expressions
3007 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3011 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
3013 enum tree_code code = TREE_CODE (exp);
3017 /* We handle TREE_LIST and COMPONENT_REF separately. */
3018 if (code == TREE_LIST)
3020 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
3021 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
3023 else if (code == COMPONENT_REF)
3025 for (inner = TREE_OPERAND (exp, 0);
3026 REFERENCE_CLASS_P (inner);
3027 inner = TREE_OPERAND (inner, 0))
3030 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
3031 push_without_duplicates (exp, refs);
3033 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
3036 switch (TREE_CODE_CLASS (code))
3041 case tcc_declaration:
3042 /* Variables allocated to static storage can stay. */
3043 if (!TREE_STATIC (exp))
3044 push_without_duplicates (exp, refs);
3047 case tcc_expression:
3048 /* This is the pattern built in ada/make_aligning_type. */
3049 if (code == ADDR_EXPR
3050 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
3052 push_without_duplicates (exp, refs);
3056 /* Fall through... */
3058 case tcc_exceptional:
3061 case tcc_comparison:
3063 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3064 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3068 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3069 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3077 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3078 return a tree with all occurrences of references to F in a
3079 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3080 CONST_DECLs. Note that we assume here that EXP contains only
3081 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3082 occurring only in their argument list. */
3085 substitute_in_expr (tree exp, tree f, tree r)
3087 enum tree_code code = TREE_CODE (exp);
3088 tree op0, op1, op2, op3;
3091 /* We handle TREE_LIST and COMPONENT_REF separately. */
3092 if (code == TREE_LIST)
3094 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3095 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3096 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3099 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3101 else if (code == COMPONENT_REF)
3105 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3106 and it is the right field, replace it with R. */
3107 for (inner = TREE_OPERAND (exp, 0);
3108 REFERENCE_CLASS_P (inner);
3109 inner = TREE_OPERAND (inner, 0))
3113 op1 = TREE_OPERAND (exp, 1);
3115 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3118 /* If this expression hasn't been completed let, leave it alone. */
3119 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3122 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3123 if (op0 == TREE_OPERAND (exp, 0))
3127 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3130 switch (TREE_CODE_CLASS (code))
3135 case tcc_declaration:
3141 case tcc_expression:
3145 /* Fall through... */
3147 case tcc_exceptional:
3150 case tcc_comparison:
3152 switch (TREE_CODE_LENGTH (code))
3158 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3159 if (op0 == TREE_OPERAND (exp, 0))
3162 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3166 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3167 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3169 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3172 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3176 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3177 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3178 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3180 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3181 && op2 == TREE_OPERAND (exp, 2))
3184 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3188 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3189 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3190 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3191 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3193 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3194 && op2 == TREE_OPERAND (exp, 2)
3195 && op3 == TREE_OPERAND (exp, 3))
3199 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3211 new_tree = NULL_TREE;
3213 /* If we are trying to replace F with a constant, inline back
3214 functions which do nothing else than computing a value from
3215 the arguments they are passed. This makes it possible to
3216 fold partially or entirely the replacement expression. */
3217 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3219 tree t = maybe_inline_call_in_expr (exp);
3221 return SUBSTITUTE_IN_EXPR (t, f, r);
3224 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3226 tree op = TREE_OPERAND (exp, i);
3227 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3231 new_tree = copy_node (exp);
3232 TREE_OPERAND (new_tree, i) = new_op;
3238 new_tree = fold (new_tree);
3239 if (TREE_CODE (new_tree) == CALL_EXPR)
3240 process_call_operands (new_tree);
3251 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3253 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3254 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3259 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3260 for it within OBJ, a tree that is an object or a chain of references. */
3263 substitute_placeholder_in_expr (tree exp, tree obj)
3265 enum tree_code code = TREE_CODE (exp);
3266 tree op0, op1, op2, op3;
3269 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3270 in the chain of OBJ. */
3271 if (code == PLACEHOLDER_EXPR)
3273 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3276 for (elt = obj; elt != 0;
3277 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3278 || TREE_CODE (elt) == COND_EXPR)
3279 ? TREE_OPERAND (elt, 1)
3280 : (REFERENCE_CLASS_P (elt)
3281 || UNARY_CLASS_P (elt)
3282 || BINARY_CLASS_P (elt)
3283 || VL_EXP_CLASS_P (elt)
3284 || EXPRESSION_CLASS_P (elt))
3285 ? TREE_OPERAND (elt, 0) : 0))
3286 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3289 for (elt = obj; elt != 0;
3290 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3291 || TREE_CODE (elt) == COND_EXPR)
3292 ? TREE_OPERAND (elt, 1)
3293 : (REFERENCE_CLASS_P (elt)
3294 || UNARY_CLASS_P (elt)
3295 || BINARY_CLASS_P (elt)
3296 || VL_EXP_CLASS_P (elt)
3297 || EXPRESSION_CLASS_P (elt))
3298 ? TREE_OPERAND (elt, 0) : 0))
3299 if (POINTER_TYPE_P (TREE_TYPE (elt))
3300 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3302 return fold_build1 (INDIRECT_REF, need_type, elt);
3304 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3305 survives until RTL generation, there will be an error. */
3309 /* TREE_LIST is special because we need to look at TREE_VALUE
3310 and TREE_CHAIN, not TREE_OPERANDS. */
3311 else if (code == TREE_LIST)
3313 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3314 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3315 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3318 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3321 switch (TREE_CODE_CLASS (code))
3324 case tcc_declaration:
3327 case tcc_exceptional:
3330 case tcc_comparison:
3331 case tcc_expression:
3334 switch (TREE_CODE_LENGTH (code))
3340 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3341 if (op0 == TREE_OPERAND (exp, 0))
3344 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3348 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3349 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3351 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3354 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3358 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3359 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3360 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3362 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3363 && op2 == TREE_OPERAND (exp, 2))
3366 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3370 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3371 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3372 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3373 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3375 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3376 && op2 == TREE_OPERAND (exp, 2)
3377 && op3 == TREE_OPERAND (exp, 3))
3381 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3393 new_tree = NULL_TREE;
3395 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3397 tree op = TREE_OPERAND (exp, i);
3398 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3402 new_tree = copy_node (exp);
3403 TREE_OPERAND (new_tree, i) = new_op;
3409 new_tree = fold (new_tree);
3410 if (TREE_CODE (new_tree) == CALL_EXPR)
3411 process_call_operands (new_tree);
3422 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3424 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3425 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3430 /* Stabilize a reference so that we can use it any number of times
3431 without causing its operands to be evaluated more than once.
3432 Returns the stabilized reference. This works by means of save_expr,
3433 so see the caveats in the comments about save_expr.
3435 Also allows conversion expressions whose operands are references.
3436 Any other kind of expression is returned unchanged. */
3439 stabilize_reference (tree ref)
3442 enum tree_code code = TREE_CODE (ref);
3449 /* No action is needed in this case. */
3454 case FIX_TRUNC_EXPR:
3455 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3459 result = build_nt (INDIRECT_REF,
3460 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3464 result = build_nt (COMPONENT_REF,
3465 stabilize_reference (TREE_OPERAND (ref, 0)),
3466 TREE_OPERAND (ref, 1), NULL_TREE);
3470 result = build_nt (BIT_FIELD_REF,
3471 stabilize_reference (TREE_OPERAND (ref, 0)),
3472 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3473 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3477 result = build_nt (ARRAY_REF,
3478 stabilize_reference (TREE_OPERAND (ref, 0)),
3479 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3480 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3483 case ARRAY_RANGE_REF:
3484 result = build_nt (ARRAY_RANGE_REF,
3485 stabilize_reference (TREE_OPERAND (ref, 0)),
3486 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3487 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3491 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3492 it wouldn't be ignored. This matters when dealing with
3494 return stabilize_reference_1 (ref);
3496 /* If arg isn't a kind of lvalue we recognize, make no change.
3497 Caller should recognize the error for an invalid lvalue. */
3502 return error_mark_node;
3505 TREE_TYPE (result) = TREE_TYPE (ref);
3506 TREE_READONLY (result) = TREE_READONLY (ref);
3507 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3508 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3513 /* Subroutine of stabilize_reference; this is called for subtrees of
3514 references. Any expression with side-effects must be put in a SAVE_EXPR
3515 to ensure that it is only evaluated once.
3517 We don't put SAVE_EXPR nodes around everything, because assigning very
3518 simple expressions to temporaries causes us to miss good opportunities
3519 for optimizations. Among other things, the opportunity to fold in the
3520 addition of a constant into an addressing mode often gets lost, e.g.
3521 "y[i+1] += x;". In general, we take the approach that we should not make
3522 an assignment unless we are forced into it - i.e., that any non-side effect
3523 operator should be allowed, and that cse should take care of coalescing
3524 multiple utterances of the same expression should that prove fruitful. */
3527 stabilize_reference_1 (tree e)
3530 enum tree_code code = TREE_CODE (e);
3532 /* We cannot ignore const expressions because it might be a reference
3533 to a const array but whose index contains side-effects. But we can
3534 ignore things that are actual constant or that already have been
3535 handled by this function. */
3537 if (tree_invariant_p (e))
3540 switch (TREE_CODE_CLASS (code))
3542 case tcc_exceptional:
3544 case tcc_declaration:
3545 case tcc_comparison:
3547 case tcc_expression:
3550 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3551 so that it will only be evaluated once. */
3552 /* The reference (r) and comparison (<) classes could be handled as
3553 below, but it is generally faster to only evaluate them once. */
3554 if (TREE_SIDE_EFFECTS (e))
3555 return save_expr (e);
3559 /* Constants need no processing. In fact, we should never reach
3564 /* Division is slow and tends to be compiled with jumps,
3565 especially the division by powers of 2 that is often
3566 found inside of an array reference. So do it just once. */
3567 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3568 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3569 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3570 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3571 return save_expr (e);
3572 /* Recursively stabilize each operand. */
3573 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3574 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3578 /* Recursively stabilize each operand. */
3579 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3586 TREE_TYPE (result) = TREE_TYPE (e);
3587 TREE_READONLY (result) = TREE_READONLY (e);
3588 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3589 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3594 /* Low-level constructors for expressions. */
3596 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3597 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3600 recompute_tree_invariant_for_addr_expr (tree t)
3603 bool tc = true, se = false;
3605 /* We started out assuming this address is both invariant and constant, but
3606 does not have side effects. Now go down any handled components and see if
3607 any of them involve offsets that are either non-constant or non-invariant.
3608 Also check for side-effects.
3610 ??? Note that this code makes no attempt to deal with the case where
3611 taking the address of something causes a copy due to misalignment. */
3613 #define UPDATE_FLAGS(NODE) \
3614 do { tree _node = (NODE); \
3615 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3616 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3618 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3619 node = TREE_OPERAND (node, 0))
3621 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3622 array reference (probably made temporarily by the G++ front end),
3623 so ignore all the operands. */
3624 if ((TREE_CODE (node) == ARRAY_REF
3625 || TREE_CODE (node) == ARRAY_RANGE_REF)
3626 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3628 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3629 if (TREE_OPERAND (node, 2))
3630 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3631 if (TREE_OPERAND (node, 3))
3632 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3634 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3635 FIELD_DECL, apparently. The G++ front end can put something else
3636 there, at least temporarily. */
3637 else if (TREE_CODE (node) == COMPONENT_REF
3638 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3640 if (TREE_OPERAND (node, 2))
3641 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3643 else if (TREE_CODE (node) == BIT_FIELD_REF)
3644 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3647 node = lang_hooks.expr_to_decl (node, &tc, &se);
3649 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3650 the address, since &(*a)->b is a form of addition. If it's a constant, the
3651 address is constant too. If it's a decl, its address is constant if the
3652 decl is static. Everything else is not constant and, furthermore,
3653 taking the address of a volatile variable is not volatile. */
3654 if (TREE_CODE (node) == INDIRECT_REF
3655 || TREE_CODE (node) == MEM_REF)
3656 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3657 else if (CONSTANT_CLASS_P (node))
3659 else if (DECL_P (node))
3660 tc &= (staticp (node) != NULL_TREE);
3664 se |= TREE_SIDE_EFFECTS (node);
3668 TREE_CONSTANT (t) = tc;
3669 TREE_SIDE_EFFECTS (t) = se;
3673 /* Build an expression of code CODE, data type TYPE, and operands as
3674 specified. Expressions and reference nodes can be created this way.
3675 Constants, decls, types and misc nodes cannot be.
3677 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3678 enough for all extant tree codes. */
3681 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3685 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3687 t = make_node_stat (code PASS_MEM_STAT);
3694 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3696 int length = sizeof (struct tree_exp);
3699 record_node_allocation_statistics (code, length);
3701 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3703 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
3705 memset (t, 0, sizeof (struct tree_common));
3707 TREE_SET_CODE (t, code);
3709 TREE_TYPE (t) = type;
3710 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3711 TREE_OPERAND (t, 0) = node;
3712 TREE_BLOCK (t) = NULL_TREE;
3713 if (node && !TYPE_P (node))
3715 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3716 TREE_READONLY (t) = TREE_READONLY (node);
3719 if (TREE_CODE_CLASS (code) == tcc_statement)
3720 TREE_SIDE_EFFECTS (t) = 1;
3724 /* All of these have side-effects, no matter what their
3726 TREE_SIDE_EFFECTS (t) = 1;
3727 TREE_READONLY (t) = 0;
3731 /* Whether a dereference is readonly has nothing to do with whether
3732 its operand is readonly. */
3733 TREE_READONLY (t) = 0;
3738 recompute_tree_invariant_for_addr_expr (t);
3742 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3743 && node && !TYPE_P (node)
3744 && TREE_CONSTANT (node))
3745 TREE_CONSTANT (t) = 1;
3746 if (TREE_CODE_CLASS (code) == tcc_reference
3747 && node && TREE_THIS_VOLATILE (node))
3748 TREE_THIS_VOLATILE (t) = 1;
3755 #define PROCESS_ARG(N) \
3757 TREE_OPERAND (t, N) = arg##N; \
3758 if (arg##N &&!TYPE_P (arg##N)) \
3760 if (TREE_SIDE_EFFECTS (arg##N)) \
3762 if (!TREE_READONLY (arg##N) \
3763 && !CONSTANT_CLASS_P (arg##N)) \
3764 (void) (read_only = 0); \
3765 if (!TREE_CONSTANT (arg##N)) \
3766 (void) (constant = 0); \
3771 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3773 bool constant, read_only, side_effects;
3776 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3778 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3779 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3780 /* When sizetype precision doesn't match that of pointers
3781 we need to be able to build explicit extensions or truncations
3782 of the offset argument. */
3783 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3784 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3785 && TREE_CODE (arg1) == INTEGER_CST);
3787 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3788 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3789 && ptrofftype_p (TREE_TYPE (arg1)));
3791 t = make_node_stat (code PASS_MEM_STAT);
3794 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3795 result based on those same flags for the arguments. But if the
3796 arguments aren't really even `tree' expressions, we shouldn't be trying
3799 /* Expressions without side effects may be constant if their
3800 arguments are as well. */
3801 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3802 || TREE_CODE_CLASS (code) == tcc_binary);
3804 side_effects = TREE_SIDE_EFFECTS (t);
3809 TREE_READONLY (t) = read_only;
3810 TREE_CONSTANT (t) = constant;
3811 TREE_SIDE_EFFECTS (t) = side_effects;
3812 TREE_THIS_VOLATILE (t)
3813 = (TREE_CODE_CLASS (code) == tcc_reference
3814 && arg0 && TREE_THIS_VOLATILE (arg0));
3821 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3822 tree arg2 MEM_STAT_DECL)
3824 bool constant, read_only, side_effects;
3827 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3828 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3830 t = make_node_stat (code PASS_MEM_STAT);
3835 /* As a special exception, if COND_EXPR has NULL branches, we
3836 assume that it is a gimple statement and always consider
3837 it to have side effects. */
3838 if (code == COND_EXPR
3839 && tt == void_type_node
3840 && arg1 == NULL_TREE
3841 && arg2 == NULL_TREE)
3842 side_effects = true;
3844 side_effects = TREE_SIDE_EFFECTS (t);
3850 if (code == COND_EXPR)
3851 TREE_READONLY (t) = read_only;
3853 TREE_SIDE_EFFECTS (t) = side_effects;
3854 TREE_THIS_VOLATILE (t)
3855 = (TREE_CODE_CLASS (code) == tcc_reference
3856 && arg0 && TREE_THIS_VOLATILE (arg0));
3862 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3863 tree arg2, tree arg3 MEM_STAT_DECL)
3865 bool constant, read_only, side_effects;
3868 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3870 t = make_node_stat (code PASS_MEM_STAT);
3873 side_effects = TREE_SIDE_EFFECTS (t);
3880 TREE_SIDE_EFFECTS (t) = side_effects;
3881 TREE_THIS_VOLATILE (t)
3882 = (TREE_CODE_CLASS (code) == tcc_reference
3883 && arg0 && TREE_THIS_VOLATILE (arg0));
3889 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3890 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3892 bool constant, read_only, side_effects;
3895 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3897 t = make_node_stat (code PASS_MEM_STAT);
3900 side_effects = TREE_SIDE_EFFECTS (t);
3908 TREE_SIDE_EFFECTS (t) = side_effects;
3909 TREE_THIS_VOLATILE (t)
3910 = (TREE_CODE_CLASS (code) == tcc_reference
3911 && arg0 && TREE_THIS_VOLATILE (arg0));
3917 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3918 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3920 bool constant, read_only, side_effects;
3923 gcc_assert (code == TARGET_MEM_REF);
3925 t = make_node_stat (code PASS_MEM_STAT);
3928 side_effects = TREE_SIDE_EFFECTS (t);
3935 if (code == TARGET_MEM_REF)
3939 TREE_SIDE_EFFECTS (t) = side_effects;
3940 TREE_THIS_VOLATILE (t)
3941 = (code == TARGET_MEM_REF
3942 && arg5 && TREE_THIS_VOLATILE (arg5));
3947 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3948 on the pointer PTR. */
3951 build_simple_mem_ref_loc (location_t loc, tree ptr)
3953 HOST_WIDE_INT offset = 0;
3954 tree ptype = TREE_TYPE (ptr);
3956 /* For convenience allow addresses that collapse to a simple base
3958 if (TREE_CODE (ptr) == ADDR_EXPR
3959 && (handled_component_p (TREE_OPERAND (ptr, 0))
3960 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
3962 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
3964 ptr = build_fold_addr_expr (ptr);
3965 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
3967 tem = build2 (MEM_REF, TREE_TYPE (ptype),
3968 ptr, build_int_cst (ptype, offset));
3969 SET_EXPR_LOCATION (tem, loc);
3973 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3976 mem_ref_offset (const_tree t)
3978 tree toff = TREE_OPERAND (t, 1);
3979 return double_int_sext (tree_to_double_int (toff),
3980 TYPE_PRECISION (TREE_TYPE (toff)));
3983 /* Return the pointer-type relevant for TBAA purposes from the
3984 gimple memory reference tree T. This is the type to be used for
3985 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3988 reference_alias_ptr_type (const_tree t)
3990 const_tree base = t;
3991 while (handled_component_p (base))
3992 base = TREE_OPERAND (base, 0);
3993 if (TREE_CODE (base) == MEM_REF)
3994 return TREE_TYPE (TREE_OPERAND (base, 1));
3995 else if (TREE_CODE (base) == TARGET_MEM_REF)
3996 return TREE_TYPE (TMR_OFFSET (base));
3998 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base)));
4001 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4002 offsetted by OFFSET units. */
4005 build_invariant_address (tree type, tree base, HOST_WIDE_INT offset)
4007 tree ref = fold_build2 (MEM_REF, TREE_TYPE (type),
4008 build_fold_addr_expr (base),
4009 build_int_cst (ptr_type_node, offset));
4010 tree addr = build1 (ADDR_EXPR, type, ref);
4011 recompute_tree_invariant_for_addr_expr (addr);
4015 /* Similar except don't specify the TREE_TYPE
4016 and leave the TREE_SIDE_EFFECTS as 0.
4017 It is permissible for arguments to be null,
4018 or even garbage if their values do not matter. */
4021 build_nt (enum tree_code code, ...)
4028 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4032 t = make_node (code);
4033 length = TREE_CODE_LENGTH (code);
4035 for (i = 0; i < length; i++)
4036 TREE_OPERAND (t, i) = va_arg (p, tree);
4042 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4046 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
4051 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
4052 CALL_EXPR_FN (ret) = fn;
4053 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
4054 FOR_EACH_VEC_ELT (tree, args, ix, t)
4055 CALL_EXPR_ARG (ret, ix) = t;
4059 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4060 We do NOT enter this node in any sort of symbol table.
4062 LOC is the location of the decl.
4064 layout_decl is used to set up the decl's storage layout.
4065 Other slots are initialized to 0 or null pointers. */
4068 build_decl_stat (location_t loc, enum tree_code code, tree name,
4069 tree type MEM_STAT_DECL)
4073 t = make_node_stat (code PASS_MEM_STAT);
4074 DECL_SOURCE_LOCATION (t) = loc;
4076 /* if (type == error_mark_node)
4077 type = integer_type_node; */
4078 /* That is not done, deliberately, so that having error_mark_node
4079 as the type can suppress useless errors in the use of this variable. */
4081 DECL_NAME (t) = name;
4082 TREE_TYPE (t) = type;
4084 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4090 /* Builds and returns function declaration with NAME and TYPE. */
4093 build_fn_decl (const char *name, tree type)
4095 tree id = get_identifier (name);
4096 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4098 DECL_EXTERNAL (decl) = 1;
4099 TREE_PUBLIC (decl) = 1;
4100 DECL_ARTIFICIAL (decl) = 1;
4101 TREE_NOTHROW (decl) = 1;
4106 VEC(tree,gc) *all_translation_units;
4108 /* Builds a new translation-unit decl with name NAME, queues it in the
4109 global list of translation-unit decls and returns it. */
4112 build_translation_unit_decl (tree name)
4114 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4116 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4117 VEC_safe_push (tree, gc, all_translation_units, tu);
4122 /* BLOCK nodes are used to represent the structure of binding contours
4123 and declarations, once those contours have been exited and their contents
4124 compiled. This information is used for outputting debugging info. */
4127 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4129 tree block = make_node (BLOCK);
4131 BLOCK_VARS (block) = vars;
4132 BLOCK_SUBBLOCKS (block) = subblocks;
4133 BLOCK_SUPERCONTEXT (block) = supercontext;
4134 BLOCK_CHAIN (block) = chain;
4139 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4141 LOC is the location to use in tree T. */
4144 protected_set_expr_location (tree t, location_t loc)
4146 if (t && CAN_HAVE_LOCATION_P (t))
4147 SET_EXPR_LOCATION (t, loc);
4150 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4154 build_decl_attribute_variant (tree ddecl, tree attribute)
4156 DECL_ATTRIBUTES (ddecl) = attribute;
4160 /* Borrowed from hashtab.c iterative_hash implementation. */
4161 #define mix(a,b,c) \
4163 a -= b; a -= c; a ^= (c>>13); \
4164 b -= c; b -= a; b ^= (a<< 8); \
4165 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4166 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4167 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4168 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4169 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4170 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4171 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4175 /* Produce good hash value combining VAL and VAL2. */
4177 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4179 /* the golden ratio; an arbitrary value. */
4180 hashval_t a = 0x9e3779b9;
4186 /* Produce good hash value combining VAL and VAL2. */
4188 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4190 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4191 return iterative_hash_hashval_t (val, val2);
4194 hashval_t a = (hashval_t) val;
4195 /* Avoid warnings about shifting of more than the width of the type on
4196 hosts that won't execute this path. */
4198 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4200 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4202 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4203 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4210 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4211 is ATTRIBUTE and its qualifiers are QUALS.
4213 Record such modified types already made so we don't make duplicates. */
4216 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4218 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4220 hashval_t hashcode = 0;
4222 enum tree_code code = TREE_CODE (ttype);
4224 /* Building a distinct copy of a tagged type is inappropriate; it
4225 causes breakage in code that expects there to be a one-to-one
4226 relationship between a struct and its fields.
4227 build_duplicate_type is another solution (as used in
4228 handle_transparent_union_attribute), but that doesn't play well
4229 with the stronger C++ type identity model. */
4230 if (TREE_CODE (ttype) == RECORD_TYPE
4231 || TREE_CODE (ttype) == UNION_TYPE
4232 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4233 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4235 warning (OPT_Wattributes,
4236 "ignoring attributes applied to %qT after definition",
4237 TYPE_MAIN_VARIANT (ttype));
4238 return build_qualified_type (ttype, quals);
4241 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4242 ntype = build_distinct_type_copy (ttype);
4244 TYPE_ATTRIBUTES (ntype) = attribute;
4246 hashcode = iterative_hash_object (code, hashcode);
4247 if (TREE_TYPE (ntype))
4248 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4250 hashcode = attribute_hash_list (attribute, hashcode);
4252 switch (TREE_CODE (ntype))
4255 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4258 if (TYPE_DOMAIN (ntype))
4259 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4263 hashcode = iterative_hash_object
4264 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4265 hashcode = iterative_hash_object
4266 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4269 case FIXED_POINT_TYPE:
4271 unsigned int precision = TYPE_PRECISION (ntype);
4272 hashcode = iterative_hash_object (precision, hashcode);
4279 ntype = type_hash_canon (hashcode, ntype);
4281 /* If the target-dependent attributes make NTYPE different from
4282 its canonical type, we will need to use structural equality
4283 checks for this type. */
4284 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4285 || !comp_type_attributes (ntype, ttype))
4286 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4287 else if (TYPE_CANONICAL (ntype) == ntype)
4288 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4290 ttype = build_qualified_type (ntype, quals);
4292 else if (TYPE_QUALS (ttype) != quals)
4293 ttype = build_qualified_type (ttype, quals);
4298 /* Compare two attributes for their value identity. Return true if the
4299 attribute values are known to be equal; otherwise return false.
4303 attribute_value_equal (const_tree attr1, const_tree attr2)
4305 if (TREE_VALUE (attr1) == TREE_VALUE (attr2))
4308 if (TREE_VALUE (attr1) != NULL_TREE
4309 && TREE_CODE (TREE_VALUE (attr1)) == TREE_LIST
4310 && TREE_VALUE (attr2) != NULL
4311 && TREE_CODE (TREE_VALUE (attr2)) == TREE_LIST)
4312 return (simple_cst_list_equal (TREE_VALUE (attr1),
4313 TREE_VALUE (attr2)) == 1);
4315 return (simple_cst_equal (TREE_VALUE (attr1), TREE_VALUE (attr2)) == 1);
4318 /* Return 0 if the attributes for two types are incompatible, 1 if they
4319 are compatible, and 2 if they are nearly compatible (which causes a
4320 warning to be generated). */
4322 comp_type_attributes (const_tree type1, const_tree type2)
4324 const_tree a1 = TYPE_ATTRIBUTES (type1);
4325 const_tree a2 = TYPE_ATTRIBUTES (type2);
4330 for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a))
4332 const struct attribute_spec *as;
4335 as = lookup_attribute_spec (TREE_PURPOSE (a));
4336 if (!as || as->affects_type_identity == false)
4339 attr = lookup_attribute (as->name, CONST_CAST_TREE (a2));
4340 if (!attr || !attribute_value_equal (a, attr))
4345 for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a))
4347 const struct attribute_spec *as;
4349 as = lookup_attribute_spec (TREE_PURPOSE (a));
4350 if (!as || as->affects_type_identity == false)
4353 if (!lookup_attribute (as->name, CONST_CAST_TREE (a1)))
4355 /* We don't need to compare trees again, as we did this
4356 already in first loop. */
4358 /* All types - affecting identity - are equal, so
4359 there is no need to call target hook for comparison. */
4363 /* As some type combinations - like default calling-convention - might
4364 be compatible, we have to call the target hook to get the final result. */
4365 return targetm.comp_type_attributes (type1, type2);
4368 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4371 Record such modified types already made so we don't make duplicates. */
4374 build_type_attribute_variant (tree ttype, tree attribute)
4376 return build_type_attribute_qual_variant (ttype, attribute,
4377 TYPE_QUALS (ttype));
4381 /* Reset the expression *EXPR_P, a size or position.
4383 ??? We could reset all non-constant sizes or positions. But it's cheap
4384 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4386 We need to reset self-referential sizes or positions because they cannot
4387 be gimplified and thus can contain a CALL_EXPR after the gimplification
4388 is finished, which will run afoul of LTO streaming. And they need to be
4389 reset to something essentially dummy but not constant, so as to preserve
4390 the properties of the object they are attached to. */
4393 free_lang_data_in_one_sizepos (tree *expr_p)
4395 tree expr = *expr_p;
4396 if (CONTAINS_PLACEHOLDER_P (expr))
4397 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4401 /* Reset all the fields in a binfo node BINFO. We only keep
4402 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4405 free_lang_data_in_binfo (tree binfo)
4410 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4412 BINFO_VIRTUALS (binfo) = NULL_TREE;
4413 BINFO_BASE_ACCESSES (binfo) = NULL;
4414 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4415 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4417 FOR_EACH_VEC_ELT (tree, BINFO_BASE_BINFOS (binfo), i, t)
4418 free_lang_data_in_binfo (t);
4422 /* Reset all language specific information still present in TYPE. */
4425 free_lang_data_in_type (tree type)
4427 gcc_assert (TYPE_P (type));
4429 /* Give the FE a chance to remove its own data first. */
4430 lang_hooks.free_lang_data (type);
4432 TREE_LANG_FLAG_0 (type) = 0;
4433 TREE_LANG_FLAG_1 (type) = 0;
4434 TREE_LANG_FLAG_2 (type) = 0;
4435 TREE_LANG_FLAG_3 (type) = 0;
4436 TREE_LANG_FLAG_4 (type) = 0;
4437 TREE_LANG_FLAG_5 (type) = 0;
4438 TREE_LANG_FLAG_6 (type) = 0;
4440 if (TREE_CODE (type) == FUNCTION_TYPE)
4442 /* Remove the const and volatile qualifiers from arguments. The
4443 C++ front end removes them, but the C front end does not,
4444 leading to false ODR violation errors when merging two
4445 instances of the same function signature compiled by
4446 different front ends. */
4449 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4451 tree arg_type = TREE_VALUE (p);
4453 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4455 int quals = TYPE_QUALS (arg_type)
4457 & ~TYPE_QUAL_VOLATILE;
4458 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4459 free_lang_data_in_type (TREE_VALUE (p));
4464 /* Remove members that are not actually FIELD_DECLs from the field
4465 list of an aggregate. These occur in C++. */
4466 if (RECORD_OR_UNION_TYPE_P (type))
4470 /* Note that TYPE_FIELDS can be shared across distinct
4471 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4472 to be removed, we cannot set its TREE_CHAIN to NULL.
4473 Otherwise, we would not be able to find all the other fields
4474 in the other instances of this TREE_TYPE.
4476 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4478 member = TYPE_FIELDS (type);
4481 if (TREE_CODE (member) == FIELD_DECL
4482 || TREE_CODE (member) == TYPE_DECL)
4485 TREE_CHAIN (prev) = member;
4487 TYPE_FIELDS (type) = member;
4491 member = TREE_CHAIN (member);
4495 TREE_CHAIN (prev) = NULL_TREE;
4497 TYPE_FIELDS (type) = NULL_TREE;
4499 TYPE_METHODS (type) = NULL_TREE;
4500 if (TYPE_BINFO (type))
4501 free_lang_data_in_binfo (TYPE_BINFO (type));
4505 /* For non-aggregate types, clear out the language slot (which
4506 overloads TYPE_BINFO). */
4507 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4509 if (INTEGRAL_TYPE_P (type)
4510 || SCALAR_FLOAT_TYPE_P (type)
4511 || FIXED_POINT_TYPE_P (type))
4513 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4514 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4518 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4519 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4521 if (TYPE_CONTEXT (type)
4522 && TREE_CODE (TYPE_CONTEXT (type)) == BLOCK)
4524 tree ctx = TYPE_CONTEXT (type);
4527 ctx = BLOCK_SUPERCONTEXT (ctx);
4529 while (ctx && TREE_CODE (ctx) == BLOCK);
4530 TYPE_CONTEXT (type) = ctx;
4535 /* Return true if DECL may need an assembler name to be set. */
4538 need_assembler_name_p (tree decl)
4540 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4541 if (TREE_CODE (decl) != FUNCTION_DECL
4542 && TREE_CODE (decl) != VAR_DECL)
4545 /* If DECL already has its assembler name set, it does not need a
4547 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4548 || DECL_ASSEMBLER_NAME_SET_P (decl))
4551 /* Abstract decls do not need an assembler name. */
4552 if (DECL_ABSTRACT (decl))
4555 /* For VAR_DECLs, only static, public and external symbols need an
4557 if (TREE_CODE (decl) == VAR_DECL
4558 && !TREE_STATIC (decl)
4559 && !TREE_PUBLIC (decl)
4560 && !DECL_EXTERNAL (decl))
4563 if (TREE_CODE (decl) == FUNCTION_DECL)
4565 /* Do not set assembler name on builtins. Allow RTL expansion to
4566 decide whether to expand inline or via a regular call. */
4567 if (DECL_BUILT_IN (decl)
4568 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4571 /* Functions represented in the callgraph need an assembler name. */
4572 if (cgraph_get_node (decl) != NULL)
4575 /* Unused and not public functions don't need an assembler name. */
4576 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4584 /* Reset all language specific information still present in symbol
4588 free_lang_data_in_decl (tree decl)
4590 gcc_assert (DECL_P (decl));
4592 /* Give the FE a chance to remove its own data first. */
4593 lang_hooks.free_lang_data (decl);
4595 TREE_LANG_FLAG_0 (decl) = 0;
4596 TREE_LANG_FLAG_1 (decl) = 0;
4597 TREE_LANG_FLAG_2 (decl) = 0;
4598 TREE_LANG_FLAG_3 (decl) = 0;
4599 TREE_LANG_FLAG_4 (decl) = 0;
4600 TREE_LANG_FLAG_5 (decl) = 0;
4601 TREE_LANG_FLAG_6 (decl) = 0;
4603 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4604 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4605 if (TREE_CODE (decl) == FIELD_DECL)
4607 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4608 if (TREE_CODE (DECL_CONTEXT (decl)) == QUAL_UNION_TYPE)
4609 DECL_QUALIFIER (decl) = NULL_TREE;
4612 if (TREE_CODE (decl) == FUNCTION_DECL)
4614 if (gimple_has_body_p (decl))
4618 /* If DECL has a gimple body, then the context for its
4619 arguments must be DECL. Otherwise, it doesn't really
4620 matter, as we will not be emitting any code for DECL. In
4621 general, there may be other instances of DECL created by
4622 the front end and since PARM_DECLs are generally shared,
4623 their DECL_CONTEXT changes as the replicas of DECL are
4624 created. The only time where DECL_CONTEXT is important
4625 is for the FUNCTION_DECLs that have a gimple body (since
4626 the PARM_DECL will be used in the function's body). */
4627 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4628 DECL_CONTEXT (t) = decl;
4631 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4632 At this point, it is not needed anymore. */
4633 DECL_SAVED_TREE (decl) = NULL_TREE;
4635 /* Clear the abstract origin if it refers to a method. Otherwise
4636 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4637 origin will not be output correctly. */
4638 if (DECL_ABSTRACT_ORIGIN (decl)
4639 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))
4640 && RECORD_OR_UNION_TYPE_P
4641 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))))
4642 DECL_ABSTRACT_ORIGIN (decl) = NULL_TREE;
4644 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4645 DECL_VINDEX referring to itself into a vtable slot number as it
4646 should. Happens with functions that are copied and then forgotten
4647 about. Just clear it, it won't matter anymore. */
4648 if (DECL_VINDEX (decl) && !host_integerp (DECL_VINDEX (decl), 0))
4649 DECL_VINDEX (decl) = NULL_TREE;
4651 else if (TREE_CODE (decl) == VAR_DECL)
4653 if ((DECL_EXTERNAL (decl)
4654 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4655 || (decl_function_context (decl) && !TREE_STATIC (decl)))
4656 DECL_INITIAL (decl) = NULL_TREE;
4658 else if (TREE_CODE (decl) == TYPE_DECL
4659 || TREE_CODE (decl) == FIELD_DECL)
4660 DECL_INITIAL (decl) = NULL_TREE;
4661 else if (TREE_CODE (decl) == TRANSLATION_UNIT_DECL
4662 && DECL_INITIAL (decl)
4663 && TREE_CODE (DECL_INITIAL (decl)) == BLOCK)
4665 /* Strip builtins from the translation-unit BLOCK. We still have targets
4666 without builtin_decl_explicit support and also builtins are shared
4667 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4668 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
4672 if (TREE_CODE (var) == FUNCTION_DECL
4673 && DECL_BUILT_IN (var))
4674 *nextp = TREE_CHAIN (var);
4676 nextp = &TREE_CHAIN (var);
4682 /* Data used when collecting DECLs and TYPEs for language data removal. */
4684 struct free_lang_data_d
4686 /* Worklist to avoid excessive recursion. */
4687 VEC(tree,heap) *worklist;
4689 /* Set of traversed objects. Used to avoid duplicate visits. */
4690 struct pointer_set_t *pset;
4692 /* Array of symbols to process with free_lang_data_in_decl. */
4693 VEC(tree,heap) *decls;
4695 /* Array of types to process with free_lang_data_in_type. */
4696 VEC(tree,heap) *types;
4700 /* Save all language fields needed to generate proper debug information
4701 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4704 save_debug_info_for_decl (tree t)
4706 /*struct saved_debug_info_d *sdi;*/
4708 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4710 /* FIXME. Partial implementation for saving debug info removed. */
4714 /* Save all language fields needed to generate proper debug information
4715 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4718 save_debug_info_for_type (tree t)
4720 /*struct saved_debug_info_d *sdi;*/
4722 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4724 /* FIXME. Partial implementation for saving debug info removed. */
4728 /* Add type or decl T to one of the list of tree nodes that need their
4729 language data removed. The lists are held inside FLD. */
4732 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4736 VEC_safe_push (tree, heap, fld->decls, t);
4737 if (debug_info_level > DINFO_LEVEL_TERSE)
4738 save_debug_info_for_decl (t);
4740 else if (TYPE_P (t))
4742 VEC_safe_push (tree, heap, fld->types, t);
4743 if (debug_info_level > DINFO_LEVEL_TERSE)
4744 save_debug_info_for_type (t);
4750 /* Push tree node T into FLD->WORKLIST. */
4753 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4755 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4756 VEC_safe_push (tree, heap, fld->worklist, (t));
4760 /* Operand callback helper for free_lang_data_in_node. *TP is the
4761 subtree operand being considered. */
4764 find_decls_types_r (tree *tp, int *ws, void *data)
4767 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4769 if (TREE_CODE (t) == TREE_LIST)
4772 /* Language specific nodes will be removed, so there is no need
4773 to gather anything under them. */
4774 if (is_lang_specific (t))
4782 /* Note that walk_tree does not traverse every possible field in
4783 decls, so we have to do our own traversals here. */
4784 add_tree_to_fld_list (t, fld);
4786 fld_worklist_push (DECL_NAME (t), fld);
4787 fld_worklist_push (DECL_CONTEXT (t), fld);
4788 fld_worklist_push (DECL_SIZE (t), fld);
4789 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4791 /* We are going to remove everything under DECL_INITIAL for
4792 TYPE_DECLs. No point walking them. */
4793 if (TREE_CODE (t) != TYPE_DECL)
4794 fld_worklist_push (DECL_INITIAL (t), fld);
4796 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4797 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4799 if (TREE_CODE (t) == FUNCTION_DECL)
4801 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4802 fld_worklist_push (DECL_RESULT (t), fld);
4804 else if (TREE_CODE (t) == TYPE_DECL)
4806 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4807 fld_worklist_push (DECL_VINDEX (t), fld);
4808 fld_worklist_push (DECL_ORIGINAL_TYPE (t), fld);
4810 else if (TREE_CODE (t) == FIELD_DECL)
4812 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4813 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4814 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4815 fld_worklist_push (DECL_FCONTEXT (t), fld);
4817 else if (TREE_CODE (t) == VAR_DECL)
4819 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4820 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4823 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4824 && DECL_HAS_VALUE_EXPR_P (t))
4825 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4827 if (TREE_CODE (t) != FIELD_DECL
4828 && TREE_CODE (t) != TYPE_DECL)
4829 fld_worklist_push (TREE_CHAIN (t), fld);
4832 else if (TYPE_P (t))
4834 /* Note that walk_tree does not traverse every possible field in
4835 types, so we have to do our own traversals here. */
4836 add_tree_to_fld_list (t, fld);
4838 if (!RECORD_OR_UNION_TYPE_P (t))
4839 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4840 fld_worklist_push (TYPE_SIZE (t), fld);
4841 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4842 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4843 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4844 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4845 fld_worklist_push (TYPE_NAME (t), fld);
4846 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4847 them and thus do not and want not to reach unused pointer types
4849 if (!POINTER_TYPE_P (t))
4850 fld_worklist_push (TYPE_MINVAL (t), fld);
4851 if (!RECORD_OR_UNION_TYPE_P (t))
4852 fld_worklist_push (TYPE_MAXVAL (t), fld);
4853 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4854 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4855 do not and want not to reach unused variants this way. */
4856 if (TYPE_CONTEXT (t))
4858 tree ctx = TYPE_CONTEXT (t);
4859 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
4860 So push that instead. */
4861 while (ctx && TREE_CODE (ctx) == BLOCK)
4862 ctx = BLOCK_SUPERCONTEXT (ctx);
4863 fld_worklist_push (ctx, fld);
4865 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4866 and want not to reach unused types this way. */
4868 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4872 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4874 fld_worklist_push (TREE_TYPE (tem), fld);
4875 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4877 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4878 && TREE_CODE (tem) == TREE_LIST)
4881 fld_worklist_push (TREE_VALUE (tem), fld);
4882 tem = TREE_CHAIN (tem);
4886 if (RECORD_OR_UNION_TYPE_P (t))
4889 /* Push all TYPE_FIELDS - there can be interleaving interesting
4890 and non-interesting things. */
4891 tem = TYPE_FIELDS (t);
4894 if (TREE_CODE (tem) == FIELD_DECL
4895 || TREE_CODE (tem) == TYPE_DECL)
4896 fld_worklist_push (tem, fld);
4897 tem = TREE_CHAIN (tem);
4901 fld_worklist_push (TYPE_STUB_DECL (t), fld);
4904 else if (TREE_CODE (t) == BLOCK)
4907 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4908 fld_worklist_push (tem, fld);
4909 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4910 fld_worklist_push (tem, fld);
4911 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4914 if (TREE_CODE (t) != IDENTIFIER_NODE
4915 && CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_TYPED))
4916 fld_worklist_push (TREE_TYPE (t), fld);
4922 /* Find decls and types in T. */
4925 find_decls_types (tree t, struct free_lang_data_d *fld)
4929 if (!pointer_set_contains (fld->pset, t))
4930 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4931 if (VEC_empty (tree, fld->worklist))
4933 t = VEC_pop (tree, fld->worklist);
4937 /* Translate all the types in LIST with the corresponding runtime
4941 get_eh_types_for_runtime (tree list)
4945 if (list == NULL_TREE)
4948 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4950 list = TREE_CHAIN (list);
4953 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4954 TREE_CHAIN (prev) = n;
4955 prev = TREE_CHAIN (prev);
4956 list = TREE_CHAIN (list);
4963 /* Find decls and types referenced in EH region R and store them in
4964 FLD->DECLS and FLD->TYPES. */
4967 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4978 /* The types referenced in each catch must first be changed to the
4979 EH types used at runtime. This removes references to FE types
4981 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4983 c->type_list = get_eh_types_for_runtime (c->type_list);
4984 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4989 case ERT_ALLOWED_EXCEPTIONS:
4990 r->u.allowed.type_list
4991 = get_eh_types_for_runtime (r->u.allowed.type_list);
4992 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4995 case ERT_MUST_NOT_THROW:
4996 walk_tree (&r->u.must_not_throw.failure_decl,
4997 find_decls_types_r, fld, fld->pset);
5003 /* Find decls and types referenced in cgraph node N and store them in
5004 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5005 look for *every* kind of DECL and TYPE node reachable from N,
5006 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5007 NAMESPACE_DECLs, etc). */
5010 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
5013 struct function *fn;
5017 find_decls_types (n->decl, fld);
5019 if (!gimple_has_body_p (n->decl))
5022 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
5024 fn = DECL_STRUCT_FUNCTION (n->decl);
5026 /* Traverse locals. */
5027 FOR_EACH_LOCAL_DECL (fn, ix, t)
5028 find_decls_types (t, fld);
5030 /* Traverse EH regions in FN. */
5033 FOR_ALL_EH_REGION_FN (r, fn)
5034 find_decls_types_in_eh_region (r, fld);
5037 /* Traverse every statement in FN. */
5038 FOR_EACH_BB_FN (bb, fn)
5040 gimple_stmt_iterator si;
5043 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
5045 gimple phi = gsi_stmt (si);
5047 for (i = 0; i < gimple_phi_num_args (phi); i++)
5049 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
5050 find_decls_types (*arg_p, fld);
5054 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5056 gimple stmt = gsi_stmt (si);
5058 if (is_gimple_call (stmt))
5059 find_decls_types (gimple_call_fntype (stmt), fld);
5061 for (i = 0; i < gimple_num_ops (stmt); i++)
5063 tree arg = gimple_op (stmt, i);
5064 find_decls_types (arg, fld);
5071 /* Find decls and types referenced in varpool node N and store them in
5072 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5073 look for *every* kind of DECL and TYPE node reachable from N,
5074 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5075 NAMESPACE_DECLs, etc). */
5078 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
5080 find_decls_types (v->decl, fld);
5083 /* If T needs an assembler name, have one created for it. */
5086 assign_assembler_name_if_neeeded (tree t)
5088 if (need_assembler_name_p (t))
5090 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5091 diagnostics that use input_location to show locus
5092 information. The problem here is that, at this point,
5093 input_location is generally anchored to the end of the file
5094 (since the parser is long gone), so we don't have a good
5095 position to pin it to.
5097 To alleviate this problem, this uses the location of T's
5098 declaration. Examples of this are
5099 testsuite/g++.dg/template/cond2.C and
5100 testsuite/g++.dg/template/pr35240.C. */
5101 location_t saved_location = input_location;
5102 input_location = DECL_SOURCE_LOCATION (t);
5104 decl_assembler_name (t);
5106 input_location = saved_location;
5111 /* Free language specific information for every operand and expression
5112 in every node of the call graph. This process operates in three stages:
5114 1- Every callgraph node and varpool node is traversed looking for
5115 decls and types embedded in them. This is a more exhaustive
5116 search than that done by find_referenced_vars, because it will
5117 also collect individual fields, decls embedded in types, etc.
5119 2- All the decls found are sent to free_lang_data_in_decl.
5121 3- All the types found are sent to free_lang_data_in_type.
5123 The ordering between decls and types is important because
5124 free_lang_data_in_decl sets assembler names, which includes
5125 mangling. So types cannot be freed up until assembler names have
5129 free_lang_data_in_cgraph (void)
5131 struct cgraph_node *n;
5132 struct varpool_node *v;
5133 struct free_lang_data_d fld;
5138 /* Initialize sets and arrays to store referenced decls and types. */
5139 fld.pset = pointer_set_create ();
5140 fld.worklist = NULL;
5141 fld.decls = VEC_alloc (tree, heap, 100);
5142 fld.types = VEC_alloc (tree, heap, 100);
5144 /* Find decls and types in the body of every function in the callgraph. */
5145 for (n = cgraph_nodes; n; n = n->next)
5146 find_decls_types_in_node (n, &fld);
5148 FOR_EACH_VEC_ELT (alias_pair, alias_pairs, i, p)
5149 find_decls_types (p->decl, &fld);
5151 /* Find decls and types in every varpool symbol. */
5152 for (v = varpool_nodes; v; v = v->next)
5153 find_decls_types_in_var (v, &fld);
5155 /* Set the assembler name on every decl found. We need to do this
5156 now because free_lang_data_in_decl will invalidate data needed
5157 for mangling. This breaks mangling on interdependent decls. */
5158 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5159 assign_assembler_name_if_neeeded (t);
5161 /* Traverse every decl found freeing its language data. */
5162 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5163 free_lang_data_in_decl (t);
5165 /* Traverse every type found freeing its language data. */
5166 FOR_EACH_VEC_ELT (tree, fld.types, i, t)
5167 free_lang_data_in_type (t);
5169 pointer_set_destroy (fld.pset);
5170 VEC_free (tree, heap, fld.worklist);
5171 VEC_free (tree, heap, fld.decls);
5172 VEC_free (tree, heap, fld.types);
5176 /* Free resources that are used by FE but are not needed once they are done. */
5179 free_lang_data (void)
5183 /* If we are the LTO frontend we have freed lang-specific data already. */
5185 || !flag_generate_lto)
5188 /* Allocate and assign alias sets to the standard integer types
5189 while the slots are still in the way the frontends generated them. */
5190 for (i = 0; i < itk_none; ++i)
5191 if (integer_types[i])
5192 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5194 /* Traverse the IL resetting language specific information for
5195 operands, expressions, etc. */
5196 free_lang_data_in_cgraph ();
5198 /* Create gimple variants for common types. */
5199 ptrdiff_type_node = integer_type_node;
5200 fileptr_type_node = ptr_type_node;
5202 /* Reset some langhooks. Do not reset types_compatible_p, it may
5203 still be used indirectly via the get_alias_set langhook. */
5204 lang_hooks.callgraph.analyze_expr = NULL;
5205 lang_hooks.dwarf_name = lhd_dwarf_name;
5206 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5207 /* We do not want the default decl_assembler_name implementation,
5208 rather if we have fixed everything we want a wrapper around it
5209 asserting that all non-local symbols already got their assembler
5210 name and only produce assembler names for local symbols. Or rather
5211 make sure we never call decl_assembler_name on local symbols and
5212 devise a separate, middle-end private scheme for it. */
5214 /* Reset diagnostic machinery. */
5215 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5216 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5217 diagnostic_format_decoder (global_dc) = default_tree_printer;
5223 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5227 "*free_lang_data", /* name */
5229 free_lang_data, /* execute */
5232 0, /* static_pass_number */
5233 TV_IPA_FREE_LANG_DATA, /* tv_id */
5234 0, /* properties_required */
5235 0, /* properties_provided */
5236 0, /* properties_destroyed */
5237 0, /* todo_flags_start */
5238 TODO_ggc_collect /* todo_flags_finish */
5242 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5243 ATTR_NAME. Also used internally by remove_attribute(). */
5245 private_is_attribute_p (const char *attr_name, size_t attr_len, const_tree ident)
5247 size_t ident_len = IDENTIFIER_LENGTH (ident);
5249 if (ident_len == attr_len)
5251 if (strcmp (attr_name, IDENTIFIER_POINTER (ident)) == 0)
5254 else if (ident_len == attr_len + 4)
5256 /* There is the possibility that ATTR is 'text' and IDENT is
5258 const char *p = IDENTIFIER_POINTER (ident);
5259 if (p[0] == '_' && p[1] == '_'
5260 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5261 && strncmp (attr_name, p + 2, attr_len) == 0)
5268 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5269 of ATTR_NAME, and LIST is not NULL_TREE. */
5271 private_lookup_attribute (const char *attr_name, size_t attr_len, tree list)
5275 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5277 if (ident_len == attr_len)
5279 if (strcmp (attr_name, IDENTIFIER_POINTER (TREE_PURPOSE (list))) == 0)
5282 /* TODO: If we made sure that attributes were stored in the
5283 canonical form without '__...__' (ie, as in 'text' as opposed
5284 to '__text__') then we could avoid the following case. */
5285 else if (ident_len == attr_len + 4)
5287 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5288 if (p[0] == '_' && p[1] == '_'
5289 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5290 && strncmp (attr_name, p + 2, attr_len) == 0)
5293 list = TREE_CHAIN (list);
5299 /* A variant of lookup_attribute() that can be used with an identifier
5300 as the first argument, and where the identifier can be either
5301 'text' or '__text__'.
5303 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5304 return a pointer to the attribute's list element if the attribute
5305 is part of the list, or NULL_TREE if not found. If the attribute
5306 appears more than once, this only returns the first occurrence; the
5307 TREE_CHAIN of the return value should be passed back in if further
5308 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5309 can be in the form 'text' or '__text__'. */
5311 lookup_ident_attribute (tree attr_identifier, tree list)
5313 gcc_checking_assert (TREE_CODE (attr_identifier) == IDENTIFIER_NODE);
5317 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list)) == IDENTIFIER_NODE);
5319 /* Identifiers can be compared directly for equality. */
5320 if (attr_identifier == TREE_PURPOSE (list))
5323 /* If they are not equal, they may still be one in the form
5324 'text' while the other one is in the form '__text__'. TODO:
5325 If we were storing attributes in normalized 'text' form, then
5326 this could all go away and we could take full advantage of
5327 the fact that we're comparing identifiers. :-) */
5329 size_t attr_len = IDENTIFIER_LENGTH (attr_identifier);
5330 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5332 if (ident_len == attr_len + 4)
5334 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5335 const char *q = IDENTIFIER_POINTER (attr_identifier);
5336 if (p[0] == '_' && p[1] == '_'
5337 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5338 && strncmp (q, p + 2, attr_len) == 0)
5341 else if (ident_len + 4 == attr_len)
5343 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5344 const char *q = IDENTIFIER_POINTER (attr_identifier);
5345 if (q[0] == '_' && q[1] == '_'
5346 && q[attr_len - 2] == '_' && q[attr_len - 1] == '_'
5347 && strncmp (q + 2, p, ident_len) == 0)
5351 list = TREE_CHAIN (list);
5357 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5361 remove_attribute (const char *attr_name, tree list)
5364 size_t attr_len = strlen (attr_name);
5366 gcc_checking_assert (attr_name[0] != '_');
5368 for (p = &list; *p; )
5371 /* TODO: If we were storing attributes in normalized form, here
5372 we could use a simple strcmp(). */
5373 if (private_is_attribute_p (attr_name, attr_len, TREE_PURPOSE (l)))
5374 *p = TREE_CHAIN (l);
5376 p = &TREE_CHAIN (l);
5382 /* Return an attribute list that is the union of a1 and a2. */
5385 merge_attributes (tree a1, tree a2)
5389 /* Either one unset? Take the set one. */
5391 if ((attributes = a1) == 0)
5394 /* One that completely contains the other? Take it. */
5396 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5398 if (attribute_list_contained (a2, a1))
5402 /* Pick the longest list, and hang on the other list. */
5404 if (list_length (a1) < list_length (a2))
5405 attributes = a2, a2 = a1;
5407 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5410 for (a = lookup_ident_attribute (TREE_PURPOSE (a2), attributes);
5411 a != NULL_TREE && !attribute_value_equal (a, a2);
5412 a = lookup_ident_attribute (TREE_PURPOSE (a2), TREE_CHAIN (a)))
5416 a1 = copy_node (a2);
5417 TREE_CHAIN (a1) = attributes;
5426 /* Given types T1 and T2, merge their attributes and return
5430 merge_type_attributes (tree t1, tree t2)
5432 return merge_attributes (TYPE_ATTRIBUTES (t1),
5433 TYPE_ATTRIBUTES (t2));
5436 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5440 merge_decl_attributes (tree olddecl, tree newdecl)
5442 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5443 DECL_ATTRIBUTES (newdecl));
5446 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5448 /* Specialization of merge_decl_attributes for various Windows targets.
5450 This handles the following situation:
5452 __declspec (dllimport) int foo;
5455 The second instance of `foo' nullifies the dllimport. */
5458 merge_dllimport_decl_attributes (tree old, tree new_tree)
5461 int delete_dllimport_p = 1;
5463 /* What we need to do here is remove from `old' dllimport if it doesn't
5464 appear in `new'. dllimport behaves like extern: if a declaration is
5465 marked dllimport and a definition appears later, then the object
5466 is not dllimport'd. We also remove a `new' dllimport if the old list
5467 contains dllexport: dllexport always overrides dllimport, regardless
5468 of the order of declaration. */
5469 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5470 delete_dllimport_p = 0;
5471 else if (DECL_DLLIMPORT_P (new_tree)
5472 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5474 DECL_DLLIMPORT_P (new_tree) = 0;
5475 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5476 "dllimport ignored", new_tree);
5478 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5480 /* Warn about overriding a symbol that has already been used, e.g.:
5481 extern int __attribute__ ((dllimport)) foo;
5482 int* bar () {return &foo;}
5485 if (TREE_USED (old))
5487 warning (0, "%q+D redeclared without dllimport attribute "
5488 "after being referenced with dll linkage", new_tree);
5489 /* If we have used a variable's address with dllimport linkage,
5490 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5491 decl may already have had TREE_CONSTANT computed.
5492 We still remove the attribute so that assembler code refers
5493 to '&foo rather than '_imp__foo'. */
5494 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5495 DECL_DLLIMPORT_P (new_tree) = 1;
5498 /* Let an inline definition silently override the external reference,
5499 but otherwise warn about attribute inconsistency. */
5500 else if (TREE_CODE (new_tree) == VAR_DECL
5501 || !DECL_DECLARED_INLINE_P (new_tree))
5502 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5503 "previous dllimport ignored", new_tree);
5506 delete_dllimport_p = 0;
5508 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5510 if (delete_dllimport_p)
5511 a = remove_attribute ("dllimport", a);
5516 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5517 struct attribute_spec.handler. */
5520 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5526 /* These attributes may apply to structure and union types being created,
5527 but otherwise should pass to the declaration involved. */
5530 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5531 | (int) ATTR_FLAG_ARRAY_NEXT))
5533 *no_add_attrs = true;
5534 return tree_cons (name, args, NULL_TREE);
5536 if (TREE_CODE (node) == RECORD_TYPE
5537 || TREE_CODE (node) == UNION_TYPE)
5539 node = TYPE_NAME (node);
5545 warning (OPT_Wattributes, "%qE attribute ignored",
5547 *no_add_attrs = true;
5552 if (TREE_CODE (node) != FUNCTION_DECL
5553 && TREE_CODE (node) != VAR_DECL
5554 && TREE_CODE (node) != TYPE_DECL)
5556 *no_add_attrs = true;
5557 warning (OPT_Wattributes, "%qE attribute ignored",
5562 if (TREE_CODE (node) == TYPE_DECL
5563 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5564 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5566 *no_add_attrs = true;
5567 warning (OPT_Wattributes, "%qE attribute ignored",
5572 is_dllimport = is_attribute_p ("dllimport", name);
5574 /* Report error on dllimport ambiguities seen now before they cause
5578 /* Honor any target-specific overrides. */
5579 if (!targetm.valid_dllimport_attribute_p (node))
5580 *no_add_attrs = true;
5582 else if (TREE_CODE (node) == FUNCTION_DECL
5583 && DECL_DECLARED_INLINE_P (node))
5585 warning (OPT_Wattributes, "inline function %q+D declared as "
5586 " dllimport: attribute ignored", node);
5587 *no_add_attrs = true;
5589 /* Like MS, treat definition of dllimported variables and
5590 non-inlined functions on declaration as syntax errors. */
5591 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5593 error ("function %q+D definition is marked dllimport", node);
5594 *no_add_attrs = true;
5597 else if (TREE_CODE (node) == VAR_DECL)
5599 if (DECL_INITIAL (node))
5601 error ("variable %q+D definition is marked dllimport",
5603 *no_add_attrs = true;
5606 /* `extern' needn't be specified with dllimport.
5607 Specify `extern' now and hope for the best. Sigh. */
5608 DECL_EXTERNAL (node) = 1;
5609 /* Also, implicitly give dllimport'd variables declared within
5610 a function global scope, unless declared static. */
5611 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5612 TREE_PUBLIC (node) = 1;
5615 if (*no_add_attrs == false)
5616 DECL_DLLIMPORT_P (node) = 1;
5618 else if (TREE_CODE (node) == FUNCTION_DECL
5619 && DECL_DECLARED_INLINE_P (node)
5620 && flag_keep_inline_dllexport)
5621 /* An exported function, even if inline, must be emitted. */
5622 DECL_EXTERNAL (node) = 0;
5624 /* Report error if symbol is not accessible at global scope. */
5625 if (!TREE_PUBLIC (node)
5626 && (TREE_CODE (node) == VAR_DECL
5627 || TREE_CODE (node) == FUNCTION_DECL))
5629 error ("external linkage required for symbol %q+D because of "
5630 "%qE attribute", node, name);
5631 *no_add_attrs = true;
5634 /* A dllexport'd entity must have default visibility so that other
5635 program units (shared libraries or the main executable) can see
5636 it. A dllimport'd entity must have default visibility so that
5637 the linker knows that undefined references within this program
5638 unit can be resolved by the dynamic linker. */
5641 if (DECL_VISIBILITY_SPECIFIED (node)
5642 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5643 error ("%qE implies default visibility, but %qD has already "
5644 "been declared with a different visibility",
5646 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5647 DECL_VISIBILITY_SPECIFIED (node) = 1;
5653 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5655 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5656 of the various TYPE_QUAL values. */
5659 set_type_quals (tree type, int type_quals)
5661 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5662 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5663 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5664 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5667 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5670 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5672 return (TYPE_QUALS (cand) == type_quals
5673 && TYPE_NAME (cand) == TYPE_NAME (base)
5674 /* Apparently this is needed for Objective-C. */
5675 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5676 /* Check alignment. */
5677 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
5678 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5679 TYPE_ATTRIBUTES (base)));
5682 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5685 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
5687 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
5688 && TYPE_NAME (cand) == TYPE_NAME (base)
5689 /* Apparently this is needed for Objective-C. */
5690 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5691 /* Check alignment. */
5692 && TYPE_ALIGN (cand) == align
5693 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5694 TYPE_ATTRIBUTES (base)));
5697 /* Return a version of the TYPE, qualified as indicated by the
5698 TYPE_QUALS, if one exists. If no qualified version exists yet,
5699 return NULL_TREE. */
5702 get_qualified_type (tree type, int type_quals)
5706 if (TYPE_QUALS (type) == type_quals)
5709 /* Search the chain of variants to see if there is already one there just
5710 like the one we need to have. If so, use that existing one. We must
5711 preserve the TYPE_NAME, since there is code that depends on this. */
5712 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5713 if (check_qualified_type (t, type, type_quals))
5719 /* Like get_qualified_type, but creates the type if it does not
5720 exist. This function never returns NULL_TREE. */
5723 build_qualified_type (tree type, int type_quals)
5727 /* See if we already have the appropriate qualified variant. */
5728 t = get_qualified_type (type, type_quals);
5730 /* If not, build it. */
5733 t = build_variant_type_copy (type);
5734 set_type_quals (t, type_quals);
5736 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5737 /* Propagate structural equality. */
5738 SET_TYPE_STRUCTURAL_EQUALITY (t);
5739 else if (TYPE_CANONICAL (type) != type)
5740 /* Build the underlying canonical type, since it is different
5742 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5745 /* T is its own canonical type. */
5746 TYPE_CANONICAL (t) = t;
5753 /* Create a variant of type T with alignment ALIGN. */
5756 build_aligned_type (tree type, unsigned int align)
5760 if (TYPE_PACKED (type)
5761 || TYPE_ALIGN (type) == align)
5764 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5765 if (check_aligned_type (t, type, align))
5768 t = build_variant_type_copy (type);
5769 TYPE_ALIGN (t) = align;
5774 /* Create a new distinct copy of TYPE. The new type is made its own
5775 MAIN_VARIANT. If TYPE requires structural equality checks, the
5776 resulting type requires structural equality checks; otherwise, its
5777 TYPE_CANONICAL points to itself. */
5780 build_distinct_type_copy (tree type)
5782 tree t = copy_node (type);
5784 TYPE_POINTER_TO (t) = 0;
5785 TYPE_REFERENCE_TO (t) = 0;
5787 /* Set the canonical type either to a new equivalence class, or
5788 propagate the need for structural equality checks. */
5789 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5790 SET_TYPE_STRUCTURAL_EQUALITY (t);
5792 TYPE_CANONICAL (t) = t;
5794 /* Make it its own variant. */
5795 TYPE_MAIN_VARIANT (t) = t;
5796 TYPE_NEXT_VARIANT (t) = 0;
5798 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5799 whose TREE_TYPE is not t. This can also happen in the Ada
5800 frontend when using subtypes. */
5805 /* Create a new variant of TYPE, equivalent but distinct. This is so
5806 the caller can modify it. TYPE_CANONICAL for the return type will
5807 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5808 are considered equal by the language itself (or that both types
5809 require structural equality checks). */
5812 build_variant_type_copy (tree type)
5814 tree t, m = TYPE_MAIN_VARIANT (type);
5816 t = build_distinct_type_copy (type);
5818 /* Since we're building a variant, assume that it is a non-semantic
5819 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5820 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5822 /* Add the new type to the chain of variants of TYPE. */
5823 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5824 TYPE_NEXT_VARIANT (m) = t;
5825 TYPE_MAIN_VARIANT (t) = m;
5830 /* Return true if the from tree in both tree maps are equal. */
5833 tree_map_base_eq (const void *va, const void *vb)
5835 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5836 *const b = (const struct tree_map_base *) vb;
5837 return (a->from == b->from);
5840 /* Hash a from tree in a tree_base_map. */
5843 tree_map_base_hash (const void *item)
5845 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5848 /* Return true if this tree map structure is marked for garbage collection
5849 purposes. We simply return true if the from tree is marked, so that this
5850 structure goes away when the from tree goes away. */
5853 tree_map_base_marked_p (const void *p)
5855 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5858 /* Hash a from tree in a tree_map. */
5861 tree_map_hash (const void *item)
5863 return (((const struct tree_map *) item)->hash);
5866 /* Hash a from tree in a tree_decl_map. */
5869 tree_decl_map_hash (const void *item)
5871 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
5874 /* Return the initialization priority for DECL. */
5877 decl_init_priority_lookup (tree decl)
5879 struct tree_priority_map *h;
5880 struct tree_map_base in;
5882 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5884 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5885 return h ? h->init : DEFAULT_INIT_PRIORITY;
5888 /* Return the finalization priority for DECL. */
5891 decl_fini_priority_lookup (tree decl)
5893 struct tree_priority_map *h;
5894 struct tree_map_base in;
5896 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5898 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5899 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5902 /* Return the initialization and finalization priority information for
5903 DECL. If there is no previous priority information, a freshly
5904 allocated structure is returned. */
5906 static struct tree_priority_map *
5907 decl_priority_info (tree decl)
5909 struct tree_priority_map in;
5910 struct tree_priority_map *h;
5913 in.base.from = decl;
5914 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5915 h = (struct tree_priority_map *) *loc;
5918 h = ggc_alloc_cleared_tree_priority_map ();
5920 h->base.from = decl;
5921 h->init = DEFAULT_INIT_PRIORITY;
5922 h->fini = DEFAULT_INIT_PRIORITY;
5928 /* Set the initialization priority for DECL to PRIORITY. */
5931 decl_init_priority_insert (tree decl, priority_type priority)
5933 struct tree_priority_map *h;
5935 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5936 if (priority == DEFAULT_INIT_PRIORITY)
5938 h = decl_priority_info (decl);
5942 /* Set the finalization priority for DECL to PRIORITY. */
5945 decl_fini_priority_insert (tree decl, priority_type priority)
5947 struct tree_priority_map *h;
5949 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5950 if (priority == DEFAULT_INIT_PRIORITY)
5952 h = decl_priority_info (decl);
5956 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5959 print_debug_expr_statistics (void)
5961 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5962 (long) htab_size (debug_expr_for_decl),
5963 (long) htab_elements (debug_expr_for_decl),
5964 htab_collisions (debug_expr_for_decl));
5967 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5970 print_value_expr_statistics (void)
5972 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5973 (long) htab_size (value_expr_for_decl),
5974 (long) htab_elements (value_expr_for_decl),
5975 htab_collisions (value_expr_for_decl));
5978 /* Lookup a debug expression for FROM, and return it if we find one. */
5981 decl_debug_expr_lookup (tree from)
5983 struct tree_decl_map *h, in;
5984 in.base.from = from;
5986 h = (struct tree_decl_map *)
5987 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
5993 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5996 decl_debug_expr_insert (tree from, tree to)
5998 struct tree_decl_map *h;
6001 h = ggc_alloc_tree_decl_map ();
6002 h->base.from = from;
6004 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
6006 *(struct tree_decl_map **) loc = h;
6009 /* Lookup a value expression for FROM, and return it if we find one. */
6012 decl_value_expr_lookup (tree from)
6014 struct tree_decl_map *h, in;
6015 in.base.from = from;
6017 h = (struct tree_decl_map *)
6018 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
6024 /* Insert a mapping FROM->TO in the value expression hashtable. */
6027 decl_value_expr_insert (tree from, tree to)
6029 struct tree_decl_map *h;
6032 h = ggc_alloc_tree_decl_map ();
6033 h->base.from = from;
6035 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
6037 *(struct tree_decl_map **) loc = h;
6040 /* Lookup a vector of debug arguments for FROM, and return it if we
6044 decl_debug_args_lookup (tree from)
6046 struct tree_vec_map *h, in;
6048 if (!DECL_HAS_DEBUG_ARGS_P (from))
6050 gcc_checking_assert (debug_args_for_decl != NULL);
6051 in.base.from = from;
6052 h = (struct tree_vec_map *)
6053 htab_find_with_hash (debug_args_for_decl, &in, DECL_UID (from));
6059 /* Insert a mapping FROM->empty vector of debug arguments in the value
6060 expression hashtable. */
6063 decl_debug_args_insert (tree from)
6065 struct tree_vec_map *h;
6068 if (DECL_HAS_DEBUG_ARGS_P (from))
6069 return decl_debug_args_lookup (from);
6070 if (debug_args_for_decl == NULL)
6071 debug_args_for_decl = htab_create_ggc (64, tree_vec_map_hash,
6072 tree_vec_map_eq, 0);
6073 h = ggc_alloc_tree_vec_map ();
6074 h->base.from = from;
6076 loc = htab_find_slot_with_hash (debug_args_for_decl, h, DECL_UID (from),
6078 *(struct tree_vec_map **) loc = h;
6079 DECL_HAS_DEBUG_ARGS_P (from) = 1;
6083 /* Hashing of types so that we don't make duplicates.
6084 The entry point is `type_hash_canon'. */
6086 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6087 with types in the TREE_VALUE slots), by adding the hash codes
6088 of the individual types. */
6091 type_hash_list (const_tree list, hashval_t hashcode)
6095 for (tail = list; tail; tail = TREE_CHAIN (tail))
6096 if (TREE_VALUE (tail) != error_mark_node)
6097 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
6103 /* These are the Hashtable callback functions. */
6105 /* Returns true iff the types are equivalent. */
6108 type_hash_eq (const void *va, const void *vb)
6110 const struct type_hash *const a = (const struct type_hash *) va,
6111 *const b = (const struct type_hash *) vb;
6113 /* First test the things that are the same for all types. */
6114 if (a->hash != b->hash
6115 || TREE_CODE (a->type) != TREE_CODE (b->type)
6116 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
6117 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
6118 TYPE_ATTRIBUTES (b->type))
6119 || (TREE_CODE (a->type) != COMPLEX_TYPE
6120 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
6123 /* Be careful about comparing arrays before and after the element type
6124 has been completed; don't compare TYPE_ALIGN unless both types are
6126 if (COMPLETE_TYPE_P (a->type) && COMPLETE_TYPE_P (b->type)
6127 && (TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
6128 || TYPE_MODE (a->type) != TYPE_MODE (b->type)))
6131 switch (TREE_CODE (a->type))
6136 case REFERENCE_TYPE:
6141 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
6144 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
6145 && !(TYPE_VALUES (a->type)
6146 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
6147 && TYPE_VALUES (b->type)
6148 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
6149 && type_list_equal (TYPE_VALUES (a->type),
6150 TYPE_VALUES (b->type))))
6153 /* ... fall through ... */
6158 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
6159 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
6160 TYPE_MAX_VALUE (b->type)))
6161 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
6162 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
6163 TYPE_MIN_VALUE (b->type))));
6165 case FIXED_POINT_TYPE:
6166 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
6169 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
6172 if (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
6173 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6174 || (TYPE_ARG_TYPES (a->type)
6175 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6176 && TYPE_ARG_TYPES (b->type)
6177 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6178 && type_list_equal (TYPE_ARG_TYPES (a->type),
6179 TYPE_ARG_TYPES (b->type)))))
6183 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
6187 case QUAL_UNION_TYPE:
6188 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
6189 || (TYPE_FIELDS (a->type)
6190 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
6191 && TYPE_FIELDS (b->type)
6192 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
6193 && type_list_equal (TYPE_FIELDS (a->type),
6194 TYPE_FIELDS (b->type))));
6197 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6198 || (TYPE_ARG_TYPES (a->type)
6199 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6200 && TYPE_ARG_TYPES (b->type)
6201 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6202 && type_list_equal (TYPE_ARG_TYPES (a->type),
6203 TYPE_ARG_TYPES (b->type))))
6211 if (lang_hooks.types.type_hash_eq != NULL)
6212 return lang_hooks.types.type_hash_eq (a->type, b->type);
6217 /* Return the cached hash value. */
6220 type_hash_hash (const void *item)
6222 return ((const struct type_hash *) item)->hash;
6225 /* Look in the type hash table for a type isomorphic to TYPE.
6226 If one is found, return it. Otherwise return 0. */
6229 type_hash_lookup (hashval_t hashcode, tree type)
6231 struct type_hash *h, in;
6233 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6234 must call that routine before comparing TYPE_ALIGNs. */
6240 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6247 /* Add an entry to the type-hash-table
6248 for a type TYPE whose hash code is HASHCODE. */
6251 type_hash_add (hashval_t hashcode, tree type)
6253 struct type_hash *h;
6256 h = ggc_alloc_type_hash ();
6259 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6263 /* Given TYPE, and HASHCODE its hash code, return the canonical
6264 object for an identical type if one already exists.
6265 Otherwise, return TYPE, and record it as the canonical object.
6267 To use this function, first create a type of the sort you want.
6268 Then compute its hash code from the fields of the type that
6269 make it different from other similar types.
6270 Then call this function and use the value. */
6273 type_hash_canon (unsigned int hashcode, tree type)
6277 /* The hash table only contains main variants, so ensure that's what we're
6279 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6281 /* See if the type is in the hash table already. If so, return it.
6282 Otherwise, add the type. */
6283 t1 = type_hash_lookup (hashcode, type);
6286 #ifdef GATHER_STATISTICS
6287 tree_code_counts[(int) TREE_CODE (type)]--;
6288 tree_node_counts[(int) t_kind]--;
6289 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type_non_common);
6295 type_hash_add (hashcode, type);
6300 /* See if the data pointed to by the type hash table is marked. We consider
6301 it marked if the type is marked or if a debug type number or symbol
6302 table entry has been made for the type. */
6305 type_hash_marked_p (const void *p)
6307 const_tree const type = ((const struct type_hash *) p)->type;
6309 return ggc_marked_p (type);
6313 print_type_hash_statistics (void)
6315 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6316 (long) htab_size (type_hash_table),
6317 (long) htab_elements (type_hash_table),
6318 htab_collisions (type_hash_table));
6321 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6322 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6323 by adding the hash codes of the individual attributes. */
6326 attribute_hash_list (const_tree list, hashval_t hashcode)
6330 for (tail = list; tail; tail = TREE_CHAIN (tail))
6331 /* ??? Do we want to add in TREE_VALUE too? */
6332 hashcode = iterative_hash_object
6333 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6337 /* Given two lists of attributes, return true if list l2 is
6338 equivalent to l1. */
6341 attribute_list_equal (const_tree l1, const_tree l2)
6346 return attribute_list_contained (l1, l2)
6347 && attribute_list_contained (l2, l1);
6350 /* Given two lists of attributes, return true if list L2 is
6351 completely contained within L1. */
6352 /* ??? This would be faster if attribute names were stored in a canonicalized
6353 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6354 must be used to show these elements are equivalent (which they are). */
6355 /* ??? It's not clear that attributes with arguments will always be handled
6359 attribute_list_contained (const_tree l1, const_tree l2)
6363 /* First check the obvious, maybe the lists are identical. */
6367 /* Maybe the lists are similar. */
6368 for (t1 = l1, t2 = l2;
6370 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6371 && TREE_VALUE (t1) == TREE_VALUE (t2);
6372 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6375 /* Maybe the lists are equal. */
6376 if (t1 == 0 && t2 == 0)
6379 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6382 /* This CONST_CAST is okay because lookup_attribute does not
6383 modify its argument and the return value is assigned to a
6385 for (attr = lookup_ident_attribute (TREE_PURPOSE (t2), CONST_CAST_TREE(l1));
6386 attr != NULL_TREE && !attribute_value_equal (t2, attr);
6387 attr = lookup_ident_attribute (TREE_PURPOSE (t2), TREE_CHAIN (attr)))
6390 if (attr == NULL_TREE)
6397 /* Given two lists of types
6398 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6399 return 1 if the lists contain the same types in the same order.
6400 Also, the TREE_PURPOSEs must match. */
6403 type_list_equal (const_tree l1, const_tree l2)
6407 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6408 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6409 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6410 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6411 && (TREE_TYPE (TREE_PURPOSE (t1))
6412 == TREE_TYPE (TREE_PURPOSE (t2))))))
6418 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6419 given by TYPE. If the argument list accepts variable arguments,
6420 then this function counts only the ordinary arguments. */
6423 type_num_arguments (const_tree type)
6428 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6429 /* If the function does not take a variable number of arguments,
6430 the last element in the list will have type `void'. */
6431 if (VOID_TYPE_P (TREE_VALUE (t)))
6439 /* Nonzero if integer constants T1 and T2
6440 represent the same constant value. */
6443 tree_int_cst_equal (const_tree t1, const_tree t2)
6448 if (t1 == 0 || t2 == 0)
6451 if (TREE_CODE (t1) == INTEGER_CST
6452 && TREE_CODE (t2) == INTEGER_CST
6453 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6454 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6460 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6461 The precise way of comparison depends on their data type. */
6464 tree_int_cst_lt (const_tree t1, const_tree t2)
6469 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6471 int t1_sgn = tree_int_cst_sgn (t1);
6472 int t2_sgn = tree_int_cst_sgn (t2);
6474 if (t1_sgn < t2_sgn)
6476 else if (t1_sgn > t2_sgn)
6478 /* Otherwise, both are non-negative, so we compare them as
6479 unsigned just in case one of them would overflow a signed
6482 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6483 return INT_CST_LT (t1, t2);
6485 return INT_CST_LT_UNSIGNED (t1, t2);
6488 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6491 tree_int_cst_compare (const_tree t1, const_tree t2)
6493 if (tree_int_cst_lt (t1, t2))
6495 else if (tree_int_cst_lt (t2, t1))
6501 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6502 the host. If POS is zero, the value can be represented in a single
6503 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6504 be represented in a single unsigned HOST_WIDE_INT. */
6507 host_integerp (const_tree t, int pos)
6512 return (TREE_CODE (t) == INTEGER_CST
6513 && ((TREE_INT_CST_HIGH (t) == 0
6514 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6515 || (! pos && TREE_INT_CST_HIGH (t) == -1
6516 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6517 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6518 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6519 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6520 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6523 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6524 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6525 be non-negative. We must be able to satisfy the above conditions. */
6528 tree_low_cst (const_tree t, int pos)
6530 gcc_assert (host_integerp (t, pos));
6531 return TREE_INT_CST_LOW (t);
6534 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6535 kind INTEGER_CST. This makes sure to properly sign-extend the
6539 size_low_cst (const_tree t)
6541 double_int d = tree_to_double_int (t);
6542 return double_int_sext (d, TYPE_PRECISION (TREE_TYPE (t))).low;
6545 /* Return the most significant (sign) bit of T. */
6548 tree_int_cst_sign_bit (const_tree t)
6550 unsigned bitno = TYPE_PRECISION (TREE_TYPE (t)) - 1;
6551 unsigned HOST_WIDE_INT w;
6553 if (bitno < HOST_BITS_PER_WIDE_INT)
6554 w = TREE_INT_CST_LOW (t);
6557 w = TREE_INT_CST_HIGH (t);
6558 bitno -= HOST_BITS_PER_WIDE_INT;
6561 return (w >> bitno) & 1;
6564 /* Return an indication of the sign of the integer constant T.
6565 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6566 Note that -1 will never be returned if T's type is unsigned. */
6569 tree_int_cst_sgn (const_tree t)
6571 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6573 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6575 else if (TREE_INT_CST_HIGH (t) < 0)
6581 /* Return the minimum number of bits needed to represent VALUE in a
6582 signed or unsigned type, UNSIGNEDP says which. */
6585 tree_int_cst_min_precision (tree value, bool unsignedp)
6589 /* If the value is negative, compute its negative minus 1. The latter
6590 adjustment is because the absolute value of the largest negative value
6591 is one larger than the largest positive value. This is equivalent to
6592 a bit-wise negation, so use that operation instead. */
6594 if (tree_int_cst_sgn (value) < 0)
6595 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6597 /* Return the number of bits needed, taking into account the fact
6598 that we need one more bit for a signed than unsigned type. */
6600 if (integer_zerop (value))
6603 log = tree_floor_log2 (value);
6605 return log + 1 + !unsignedp;
6608 /* Compare two constructor-element-type constants. Return 1 if the lists
6609 are known to be equal; otherwise return 0. */
6612 simple_cst_list_equal (const_tree l1, const_tree l2)
6614 while (l1 != NULL_TREE && l2 != NULL_TREE)
6616 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6619 l1 = TREE_CHAIN (l1);
6620 l2 = TREE_CHAIN (l2);
6626 /* Return truthvalue of whether T1 is the same tree structure as T2.
6627 Return 1 if they are the same.
6628 Return 0 if they are understandably different.
6629 Return -1 if either contains tree structure not understood by
6633 simple_cst_equal (const_tree t1, const_tree t2)
6635 enum tree_code code1, code2;
6641 if (t1 == 0 || t2 == 0)
6644 code1 = TREE_CODE (t1);
6645 code2 = TREE_CODE (t2);
6647 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6649 if (CONVERT_EXPR_CODE_P (code2)
6650 || code2 == NON_LVALUE_EXPR)
6651 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6653 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6656 else if (CONVERT_EXPR_CODE_P (code2)
6657 || code2 == NON_LVALUE_EXPR)
6658 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6666 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6667 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6670 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6673 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6676 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6677 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6678 TREE_STRING_LENGTH (t1)));
6682 unsigned HOST_WIDE_INT idx;
6683 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6684 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6686 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6689 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6690 /* ??? Should we handle also fields here? */
6691 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6692 VEC_index (constructor_elt, v2, idx)->value))
6698 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6701 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6704 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6707 const_tree arg1, arg2;
6708 const_call_expr_arg_iterator iter1, iter2;
6709 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6710 arg2 = first_const_call_expr_arg (t2, &iter2);
6712 arg1 = next_const_call_expr_arg (&iter1),
6713 arg2 = next_const_call_expr_arg (&iter2))
6715 cmp = simple_cst_equal (arg1, arg2);
6719 return arg1 == arg2;
6723 /* Special case: if either target is an unallocated VAR_DECL,
6724 it means that it's going to be unified with whatever the
6725 TARGET_EXPR is really supposed to initialize, so treat it
6726 as being equivalent to anything. */
6727 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6728 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6729 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6730 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6731 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6732 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6735 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6740 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6742 case WITH_CLEANUP_EXPR:
6743 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6747 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6750 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6751 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6765 /* This general rule works for most tree codes. All exceptions should be
6766 handled above. If this is a language-specific tree code, we can't
6767 trust what might be in the operand, so say we don't know
6769 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6772 switch (TREE_CODE_CLASS (code1))
6776 case tcc_comparison:
6777 case tcc_expression:
6781 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6783 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6795 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6796 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6797 than U, respectively. */
6800 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6802 if (tree_int_cst_sgn (t) < 0)
6804 else if (TREE_INT_CST_HIGH (t) != 0)
6806 else if (TREE_INT_CST_LOW (t) == u)
6808 else if (TREE_INT_CST_LOW (t) < u)
6814 /* Return true if CODE represents an associative tree code. Otherwise
6817 associative_tree_code (enum tree_code code)
6836 /* Return true if CODE represents a commutative tree code. Otherwise
6839 commutative_tree_code (enum tree_code code)
6852 case UNORDERED_EXPR:
6856 case TRUTH_AND_EXPR:
6857 case TRUTH_XOR_EXPR:
6867 /* Return true if CODE represents a ternary tree code for which the
6868 first two operands are commutative. Otherwise return false. */
6870 commutative_ternary_tree_code (enum tree_code code)
6874 case WIDEN_MULT_PLUS_EXPR:
6875 case WIDEN_MULT_MINUS_EXPR:
6884 /* Generate a hash value for an expression. This can be used iteratively
6885 by passing a previous result as the VAL argument.
6887 This function is intended to produce the same hash for expressions which
6888 would compare equal using operand_equal_p. */
6891 iterative_hash_expr (const_tree t, hashval_t val)
6894 enum tree_code code;
6898 return iterative_hash_hashval_t (0, val);
6900 code = TREE_CODE (t);
6904 /* Alas, constants aren't shared, so we can't rely on pointer
6907 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6908 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6911 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6913 return iterative_hash_hashval_t (val2, val);
6917 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6919 return iterative_hash_hashval_t (val2, val);
6922 return iterative_hash (TREE_STRING_POINTER (t),
6923 TREE_STRING_LENGTH (t), val);
6925 val = iterative_hash_expr (TREE_REALPART (t), val);
6926 return iterative_hash_expr (TREE_IMAGPART (t), val);
6928 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6930 /* We can just compare by pointer. */
6931 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6932 case PLACEHOLDER_EXPR:
6933 /* The node itself doesn't matter. */
6936 /* A list of expressions, for a CALL_EXPR or as the elements of a
6938 for (; t; t = TREE_CHAIN (t))
6939 val = iterative_hash_expr (TREE_VALUE (t), val);
6943 unsigned HOST_WIDE_INT idx;
6945 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6947 val = iterative_hash_expr (field, val);
6948 val = iterative_hash_expr (value, val);
6954 /* The type of the second operand is relevant, except for
6955 its top-level qualifiers. */
6956 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t, 1)));
6958 val = iterative_hash_object (TYPE_HASH (type), val);
6960 /* We could use the standard hash computation from this point
6962 val = iterative_hash_object (code, val);
6963 val = iterative_hash_expr (TREE_OPERAND (t, 1), val);
6964 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6968 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6969 Otherwise nodes that compare equal according to operand_equal_p might
6970 get different hash codes. However, don't do this for machine specific
6971 or front end builtins, since the function code is overloaded in those
6973 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6974 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t)))
6976 t = builtin_decl_explicit (DECL_FUNCTION_CODE (t));
6977 code = TREE_CODE (t);
6981 tclass = TREE_CODE_CLASS (code);
6983 if (tclass == tcc_declaration)
6985 /* DECL's have a unique ID */
6986 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6990 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6992 val = iterative_hash_object (code, val);
6994 /* Don't hash the type, that can lead to having nodes which
6995 compare equal according to operand_equal_p, but which
6996 have different hash codes. */
6997 if (CONVERT_EXPR_CODE_P (code)
6998 || code == NON_LVALUE_EXPR)
7000 /* Make sure to include signness in the hash computation. */
7001 val += TYPE_UNSIGNED (TREE_TYPE (t));
7002 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
7005 else if (commutative_tree_code (code))
7007 /* It's a commutative expression. We want to hash it the same
7008 however it appears. We do this by first hashing both operands
7009 and then rehashing based on the order of their independent
7011 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
7012 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
7016 t = one, one = two, two = t;
7018 val = iterative_hash_hashval_t (one, val);
7019 val = iterative_hash_hashval_t (two, val);
7022 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
7023 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
7029 /* Generate a hash value for a pair of expressions. This can be used
7030 iteratively by passing a previous result as the VAL argument.
7032 The same hash value is always returned for a given pair of expressions,
7033 regardless of the order in which they are presented. This is useful in
7034 hashing the operands of commutative functions. */
7037 iterative_hash_exprs_commutative (const_tree t1,
7038 const_tree t2, hashval_t val)
7040 hashval_t one = iterative_hash_expr (t1, 0);
7041 hashval_t two = iterative_hash_expr (t2, 0);
7045 t = one, one = two, two = t;
7046 val = iterative_hash_hashval_t (one, val);
7047 val = iterative_hash_hashval_t (two, val);
7052 /* Constructors for pointer, array and function types.
7053 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7054 constructed by language-dependent code, not here.) */
7056 /* Construct, lay out and return the type of pointers to TO_TYPE with
7057 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7058 reference all of memory. If such a type has already been
7059 constructed, reuse it. */
7062 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
7067 if (to_type == error_mark_node)
7068 return error_mark_node;
7070 /* If the pointed-to type has the may_alias attribute set, force
7071 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7072 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7073 can_alias_all = true;
7075 /* In some cases, languages will have things that aren't a POINTER_TYPE
7076 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7077 In that case, return that type without regard to the rest of our
7080 ??? This is a kludge, but consistent with the way this function has
7081 always operated and there doesn't seem to be a good way to avoid this
7083 if (TYPE_POINTER_TO (to_type) != 0
7084 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
7085 return TYPE_POINTER_TO (to_type);
7087 /* First, if we already have a type for pointers to TO_TYPE and it's
7088 the proper mode, use it. */
7089 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
7090 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7093 t = make_node (POINTER_TYPE);
7095 TREE_TYPE (t) = to_type;
7096 SET_TYPE_MODE (t, mode);
7097 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7098 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
7099 TYPE_POINTER_TO (to_type) = t;
7101 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7102 SET_TYPE_STRUCTURAL_EQUALITY (t);
7103 else if (TYPE_CANONICAL (to_type) != to_type)
7105 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
7106 mode, can_alias_all);
7108 /* Lay out the type. This function has many callers that are concerned
7109 with expression-construction, and this simplifies them all. */
7115 /* By default build pointers in ptr_mode. */
7118 build_pointer_type (tree to_type)
7120 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7121 : TYPE_ADDR_SPACE (to_type);
7122 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7123 return build_pointer_type_for_mode (to_type, pointer_mode, false);
7126 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7129 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
7134 if (to_type == error_mark_node)
7135 return error_mark_node;
7137 /* If the pointed-to type has the may_alias attribute set, force
7138 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7139 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7140 can_alias_all = true;
7142 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7143 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7144 In that case, return that type without regard to the rest of our
7147 ??? This is a kludge, but consistent with the way this function has
7148 always operated and there doesn't seem to be a good way to avoid this
7150 if (TYPE_REFERENCE_TO (to_type) != 0
7151 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7152 return TYPE_REFERENCE_TO (to_type);
7154 /* First, if we already have a type for pointers to TO_TYPE and it's
7155 the proper mode, use it. */
7156 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7157 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7160 t = make_node (REFERENCE_TYPE);
7162 TREE_TYPE (t) = to_type;
7163 SET_TYPE_MODE (t, mode);
7164 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7165 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7166 TYPE_REFERENCE_TO (to_type) = t;
7168 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7169 SET_TYPE_STRUCTURAL_EQUALITY (t);
7170 else if (TYPE_CANONICAL (to_type) != to_type)
7172 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7173 mode, can_alias_all);
7181 /* Build the node for the type of references-to-TO_TYPE by default
7185 build_reference_type (tree to_type)
7187 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7188 : TYPE_ADDR_SPACE (to_type);
7189 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7190 return build_reference_type_for_mode (to_type, pointer_mode, false);
7193 /* Build a type that is compatible with t but has no cv quals anywhere
7196 const char *const *const * -> char ***. */
7199 build_type_no_quals (tree t)
7201 switch (TREE_CODE (t))
7204 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7206 TYPE_REF_CAN_ALIAS_ALL (t));
7207 case REFERENCE_TYPE:
7209 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7211 TYPE_REF_CAN_ALIAS_ALL (t));
7213 return TYPE_MAIN_VARIANT (t);
7217 #define MAX_INT_CACHED_PREC \
7218 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7219 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7221 /* Builds a signed or unsigned integer type of precision PRECISION.
7222 Used for C bitfields whose precision does not match that of
7223 built-in target types. */
7225 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7231 unsignedp = MAX_INT_CACHED_PREC + 1;
7233 if (precision <= MAX_INT_CACHED_PREC)
7235 itype = nonstandard_integer_type_cache[precision + unsignedp];
7240 itype = make_node (INTEGER_TYPE);
7241 TYPE_PRECISION (itype) = precision;
7244 fixup_unsigned_type (itype);
7246 fixup_signed_type (itype);
7249 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7250 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7251 if (precision <= MAX_INT_CACHED_PREC)
7252 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7257 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7258 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7259 is true, reuse such a type that has already been constructed. */
7262 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7264 tree itype = make_node (INTEGER_TYPE);
7265 hashval_t hashcode = 0;
7267 TREE_TYPE (itype) = type;
7269 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7270 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7272 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7273 SET_TYPE_MODE (itype, TYPE_MODE (type));
7274 TYPE_SIZE (itype) = TYPE_SIZE (type);
7275 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7276 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7277 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7282 if ((TYPE_MIN_VALUE (itype)
7283 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7284 || (TYPE_MAX_VALUE (itype)
7285 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7287 /* Since we cannot reliably merge this type, we need to compare it using
7288 structural equality checks. */
7289 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7293 hashcode = iterative_hash_expr (TYPE_MIN_VALUE (itype), hashcode);
7294 hashcode = iterative_hash_expr (TYPE_MAX_VALUE (itype), hashcode);
7295 hashcode = iterative_hash_hashval_t (TYPE_HASH (type), hashcode);
7296 itype = type_hash_canon (hashcode, itype);
7301 /* Wrapper around build_range_type_1 with SHARED set to true. */
7304 build_range_type (tree type, tree lowval, tree highval)
7306 return build_range_type_1 (type, lowval, highval, true);
7309 /* Wrapper around build_range_type_1 with SHARED set to false. */
7312 build_nonshared_range_type (tree type, tree lowval, tree highval)
7314 return build_range_type_1 (type, lowval, highval, false);
7317 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7318 MAXVAL should be the maximum value in the domain
7319 (one less than the length of the array).
7321 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7322 We don't enforce this limit, that is up to caller (e.g. language front end).
7323 The limit exists because the result is a signed type and we don't handle
7324 sizes that use more than one HOST_WIDE_INT. */
7327 build_index_type (tree maxval)
7329 return build_range_type (sizetype, size_zero_node, maxval);
7332 /* Return true if the debug information for TYPE, a subtype, should be emitted
7333 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7334 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7335 debug info and doesn't reflect the source code. */
7338 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7340 tree base_type = TREE_TYPE (type), low, high;
7342 /* Subrange types have a base type which is an integral type. */
7343 if (!INTEGRAL_TYPE_P (base_type))
7346 /* Get the real bounds of the subtype. */
7347 if (lang_hooks.types.get_subrange_bounds)
7348 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7351 low = TYPE_MIN_VALUE (type);
7352 high = TYPE_MAX_VALUE (type);
7355 /* If the type and its base type have the same representation and the same
7356 name, then the type is not a subrange but a copy of the base type. */
7357 if ((TREE_CODE (base_type) == INTEGER_TYPE
7358 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7359 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7360 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7361 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7363 tree type_name = TYPE_NAME (type);
7364 tree base_type_name = TYPE_NAME (base_type);
7366 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7367 type_name = DECL_NAME (type_name);
7369 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7370 base_type_name = DECL_NAME (base_type_name);
7372 if (type_name == base_type_name)
7383 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7384 and number of elements specified by the range of values of INDEX_TYPE.
7385 If SHARED is true, reuse such a type that has already been constructed. */
7388 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7392 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7394 error ("arrays of functions are not meaningful");
7395 elt_type = integer_type_node;
7398 t = make_node (ARRAY_TYPE);
7399 TREE_TYPE (t) = elt_type;
7400 TYPE_DOMAIN (t) = index_type;
7401 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7404 /* If the element type is incomplete at this point we get marked for
7405 structural equality. Do not record these types in the canonical
7407 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7412 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7414 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7416 t = type_hash_canon (hashcode, t);
7418 /* Lay it out again in case the element type has been completed since
7419 the array was added to the hash table. */
7423 if (TYPE_CANONICAL (t) == t)
7425 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7426 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7427 SET_TYPE_STRUCTURAL_EQUALITY (t);
7428 else if (TYPE_CANONICAL (elt_type) != elt_type
7429 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7431 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7433 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7440 /* Wrapper around build_array_type_1 with SHARED set to true. */
7443 build_array_type (tree elt_type, tree index_type)
7445 return build_array_type_1 (elt_type, index_type, true);
7448 /* Wrapper around build_array_type_1 with SHARED set to false. */
7451 build_nonshared_array_type (tree elt_type, tree index_type)
7453 return build_array_type_1 (elt_type, index_type, false);
7456 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7460 build_array_type_nelts (tree elt_type, unsigned HOST_WIDE_INT nelts)
7462 return build_array_type (elt_type, build_index_type (size_int (nelts - 1)));
7465 /* Recursively examines the array elements of TYPE, until a non-array
7466 element type is found. */
7469 strip_array_types (tree type)
7471 while (TREE_CODE (type) == ARRAY_TYPE)
7472 type = TREE_TYPE (type);
7477 /* Computes the canonical argument types from the argument type list
7480 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7481 on entry to this function, or if any of the ARGTYPES are
7484 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7485 true on entry to this function, or if any of the ARGTYPES are
7488 Returns a canonical argument list, which may be ARGTYPES when the
7489 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7490 true) or would not differ from ARGTYPES. */
7493 maybe_canonicalize_argtypes(tree argtypes,
7494 bool *any_structural_p,
7495 bool *any_noncanonical_p)
7498 bool any_noncanonical_argtypes_p = false;
7500 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7502 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7503 /* Fail gracefully by stating that the type is structural. */
7504 *any_structural_p = true;
7505 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7506 *any_structural_p = true;
7507 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7508 || TREE_PURPOSE (arg))
7509 /* If the argument has a default argument, we consider it
7510 non-canonical even though the type itself is canonical.
7511 That way, different variants of function and method types
7512 with default arguments will all point to the variant with
7513 no defaults as their canonical type. */
7514 any_noncanonical_argtypes_p = true;
7517 if (*any_structural_p)
7520 if (any_noncanonical_argtypes_p)
7522 /* Build the canonical list of argument types. */
7523 tree canon_argtypes = NULL_TREE;
7524 bool is_void = false;
7526 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7528 if (arg == void_list_node)
7531 canon_argtypes = tree_cons (NULL_TREE,
7532 TYPE_CANONICAL (TREE_VALUE (arg)),
7536 canon_argtypes = nreverse (canon_argtypes);
7538 canon_argtypes = chainon (canon_argtypes, void_list_node);
7540 /* There is a non-canonical type. */
7541 *any_noncanonical_p = true;
7542 return canon_argtypes;
7545 /* The canonical argument types are the same as ARGTYPES. */
7549 /* Construct, lay out and return
7550 the type of functions returning type VALUE_TYPE
7551 given arguments of types ARG_TYPES.
7552 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7553 are data type nodes for the arguments of the function.
7554 If such a type has already been constructed, reuse it. */
7557 build_function_type (tree value_type, tree arg_types)
7560 hashval_t hashcode = 0;
7561 bool any_structural_p, any_noncanonical_p;
7562 tree canon_argtypes;
7564 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7566 error ("function return type cannot be function");
7567 value_type = integer_type_node;
7570 /* Make a node of the sort we want. */
7571 t = make_node (FUNCTION_TYPE);
7572 TREE_TYPE (t) = value_type;
7573 TYPE_ARG_TYPES (t) = arg_types;
7575 /* If we already have such a type, use the old one. */
7576 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7577 hashcode = type_hash_list (arg_types, hashcode);
7578 t = type_hash_canon (hashcode, t);
7580 /* Set up the canonical type. */
7581 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7582 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7583 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7585 &any_noncanonical_p);
7586 if (any_structural_p)
7587 SET_TYPE_STRUCTURAL_EQUALITY (t);
7588 else if (any_noncanonical_p)
7589 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7592 if (!COMPLETE_TYPE_P (t))
7597 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7598 return value if SKIP_RETURN is true. */
7601 build_function_type_skip_args (tree orig_type, bitmap args_to_skip,
7604 tree new_type = NULL;
7605 tree args, new_args = NULL, t;
7609 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7610 args = TREE_CHAIN (args), i++)
7611 if (!args_to_skip || !bitmap_bit_p (args_to_skip, i))
7612 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7614 new_reversed = nreverse (new_args);
7618 TREE_CHAIN (new_args) = void_list_node;
7620 new_reversed = void_list_node;
7623 /* Use copy_node to preserve as much as possible from original type
7624 (debug info, attribute lists etc.)
7625 Exception is METHOD_TYPEs must have THIS argument.
7626 When we are asked to remove it, we need to build new FUNCTION_TYPE
7628 if (TREE_CODE (orig_type) != METHOD_TYPE
7630 || !bitmap_bit_p (args_to_skip, 0))
7632 new_type = build_distinct_type_copy (orig_type);
7633 TYPE_ARG_TYPES (new_type) = new_reversed;
7638 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7640 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7644 TREE_TYPE (new_type) = void_type_node;
7646 /* This is a new type, not a copy of an old type. Need to reassociate
7647 variants. We can handle everything except the main variant lazily. */
7648 t = TYPE_MAIN_VARIANT (orig_type);
7651 t = build_function_type_skip_args (t, args_to_skip, skip_return);
7652 TYPE_MAIN_VARIANT (new_type) = t;
7653 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7654 TYPE_NEXT_VARIANT (t) = new_type;
7658 TYPE_MAIN_VARIANT (new_type) = new_type;
7659 TYPE_NEXT_VARIANT (new_type) = NULL;
7665 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7666 return value if SKIP_RETURN is true.
7668 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7669 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7670 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7673 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip,
7676 tree new_decl = copy_node (orig_decl);
7679 new_type = TREE_TYPE (orig_decl);
7680 if (prototype_p (new_type)
7681 || (skip_return && !VOID_TYPE_P (TREE_TYPE (new_type))))
7683 = build_function_type_skip_args (new_type, args_to_skip, skip_return);
7684 TREE_TYPE (new_decl) = new_type;
7686 /* For declarations setting DECL_VINDEX (i.e. methods)
7687 we expect first argument to be THIS pointer. */
7688 if (args_to_skip && bitmap_bit_p (args_to_skip, 0))
7689 DECL_VINDEX (new_decl) = NULL_TREE;
7691 /* When signature changes, we need to clear builtin info. */
7692 if (DECL_BUILT_IN (new_decl)
7694 && !bitmap_empty_p (args_to_skip))
7696 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7697 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7702 /* Build a function type. The RETURN_TYPE is the type returned by the
7703 function. If VAARGS is set, no void_type_node is appended to the
7704 the list. ARGP must be always be terminated be a NULL_TREE. */
7707 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7711 t = va_arg (argp, tree);
7712 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7713 args = tree_cons (NULL_TREE, t, args);
7718 if (args != NULL_TREE)
7719 args = nreverse (args);
7720 gcc_assert (last != void_list_node);
7722 else if (args == NULL_TREE)
7723 args = void_list_node;
7727 args = nreverse (args);
7728 TREE_CHAIN (last) = void_list_node;
7730 args = build_function_type (return_type, args);
7735 /* Build a function type. The RETURN_TYPE is the type returned by the
7736 function. If additional arguments are provided, they are
7737 additional argument types. The list of argument types must always
7738 be terminated by NULL_TREE. */
7741 build_function_type_list (tree return_type, ...)
7746 va_start (p, return_type);
7747 args = build_function_type_list_1 (false, return_type, p);
7752 /* Build a variable argument function type. The RETURN_TYPE is the
7753 type returned by the function. If additional arguments are provided,
7754 they are additional argument types. The list of argument types must
7755 always be terminated by NULL_TREE. */
7758 build_varargs_function_type_list (tree return_type, ...)
7763 va_start (p, return_type);
7764 args = build_function_type_list_1 (true, return_type, p);
7770 /* Build a function type. RETURN_TYPE is the type returned by the
7771 function; VAARGS indicates whether the function takes varargs. The
7772 function takes N named arguments, the types of which are provided in
7776 build_function_type_array_1 (bool vaargs, tree return_type, int n,
7780 tree t = vaargs ? NULL_TREE : void_list_node;
7782 for (i = n - 1; i >= 0; i--)
7783 t = tree_cons (NULL_TREE, arg_types[i], t);
7785 return build_function_type (return_type, t);
7788 /* Build a function type. RETURN_TYPE is the type returned by the
7789 function. The function takes N named arguments, the types of which
7790 are provided in ARG_TYPES. */
7793 build_function_type_array (tree return_type, int n, tree *arg_types)
7795 return build_function_type_array_1 (false, return_type, n, arg_types);
7798 /* Build a variable argument function type. RETURN_TYPE is the type
7799 returned by the function. The function takes N named arguments, the
7800 types of which are provided in ARG_TYPES. */
7803 build_varargs_function_type_array (tree return_type, int n, tree *arg_types)
7805 return build_function_type_array_1 (true, return_type, n, arg_types);
7808 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7809 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7810 for the method. An implicit additional parameter (of type
7811 pointer-to-BASETYPE) is added to the ARGTYPES. */
7814 build_method_type_directly (tree basetype,
7821 bool any_structural_p, any_noncanonical_p;
7822 tree canon_argtypes;
7824 /* Make a node of the sort we want. */
7825 t = make_node (METHOD_TYPE);
7827 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7828 TREE_TYPE (t) = rettype;
7829 ptype = build_pointer_type (basetype);
7831 /* The actual arglist for this function includes a "hidden" argument
7832 which is "this". Put it into the list of argument types. */
7833 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7834 TYPE_ARG_TYPES (t) = argtypes;
7836 /* If we already have such a type, use the old one. */
7837 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7838 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7839 hashcode = type_hash_list (argtypes, hashcode);
7840 t = type_hash_canon (hashcode, t);
7842 /* Set up the canonical type. */
7844 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7845 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7847 = (TYPE_CANONICAL (basetype) != basetype
7848 || TYPE_CANONICAL (rettype) != rettype);
7849 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7851 &any_noncanonical_p);
7852 if (any_structural_p)
7853 SET_TYPE_STRUCTURAL_EQUALITY (t);
7854 else if (any_noncanonical_p)
7856 = build_method_type_directly (TYPE_CANONICAL (basetype),
7857 TYPE_CANONICAL (rettype),
7859 if (!COMPLETE_TYPE_P (t))
7865 /* Construct, lay out and return the type of methods belonging to class
7866 BASETYPE and whose arguments and values are described by TYPE.
7867 If that type exists already, reuse it.
7868 TYPE must be a FUNCTION_TYPE node. */
7871 build_method_type (tree basetype, tree type)
7873 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7875 return build_method_type_directly (basetype,
7877 TYPE_ARG_TYPES (type));
7880 /* Construct, lay out and return the type of offsets to a value
7881 of type TYPE, within an object of type BASETYPE.
7882 If a suitable offset type exists already, reuse it. */
7885 build_offset_type (tree basetype, tree type)
7888 hashval_t hashcode = 0;
7890 /* Make a node of the sort we want. */
7891 t = make_node (OFFSET_TYPE);
7893 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7894 TREE_TYPE (t) = type;
7896 /* If we already have such a type, use the old one. */
7897 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7898 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7899 t = type_hash_canon (hashcode, t);
7901 if (!COMPLETE_TYPE_P (t))
7904 if (TYPE_CANONICAL (t) == t)
7906 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7907 || TYPE_STRUCTURAL_EQUALITY_P (type))
7908 SET_TYPE_STRUCTURAL_EQUALITY (t);
7909 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7910 || TYPE_CANONICAL (type) != type)
7912 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7913 TYPE_CANONICAL (type));
7919 /* Create a complex type whose components are COMPONENT_TYPE. */
7922 build_complex_type (tree component_type)
7927 gcc_assert (INTEGRAL_TYPE_P (component_type)
7928 || SCALAR_FLOAT_TYPE_P (component_type)
7929 || FIXED_POINT_TYPE_P (component_type));
7931 /* Make a node of the sort we want. */
7932 t = make_node (COMPLEX_TYPE);
7934 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7936 /* If we already have such a type, use the old one. */
7937 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7938 t = type_hash_canon (hashcode, t);
7940 if (!COMPLETE_TYPE_P (t))
7943 if (TYPE_CANONICAL (t) == t)
7945 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7946 SET_TYPE_STRUCTURAL_EQUALITY (t);
7947 else if (TYPE_CANONICAL (component_type) != component_type)
7949 = build_complex_type (TYPE_CANONICAL (component_type));
7952 /* We need to create a name, since complex is a fundamental type. */
7953 if (! TYPE_NAME (t))
7956 if (component_type == char_type_node)
7957 name = "complex char";
7958 else if (component_type == signed_char_type_node)
7959 name = "complex signed char";
7960 else if (component_type == unsigned_char_type_node)
7961 name = "complex unsigned char";
7962 else if (component_type == short_integer_type_node)
7963 name = "complex short int";
7964 else if (component_type == short_unsigned_type_node)
7965 name = "complex short unsigned int";
7966 else if (component_type == integer_type_node)
7967 name = "complex int";
7968 else if (component_type == unsigned_type_node)
7969 name = "complex unsigned int";
7970 else if (component_type == long_integer_type_node)
7971 name = "complex long int";
7972 else if (component_type == long_unsigned_type_node)
7973 name = "complex long unsigned int";
7974 else if (component_type == long_long_integer_type_node)
7975 name = "complex long long int";
7976 else if (component_type == long_long_unsigned_type_node)
7977 name = "complex long long unsigned int";
7982 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7983 get_identifier (name), t);
7986 return build_qualified_type (t, TYPE_QUALS (component_type));
7989 /* If TYPE is a real or complex floating-point type and the target
7990 does not directly support arithmetic on TYPE then return the wider
7991 type to be used for arithmetic on TYPE. Otherwise, return
7995 excess_precision_type (tree type)
7997 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7999 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
8000 switch (TREE_CODE (type))
8003 switch (flt_eval_method)
8006 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
8007 return double_type_node;
8010 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
8011 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
8012 return long_double_type_node;
8019 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
8021 switch (flt_eval_method)
8024 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
8025 return complex_double_type_node;
8028 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
8029 || (TYPE_MODE (TREE_TYPE (type))
8030 == TYPE_MODE (double_type_node)))
8031 return complex_long_double_type_node;
8044 /* Return OP, stripped of any conversions to wider types as much as is safe.
8045 Converting the value back to OP's type makes a value equivalent to OP.
8047 If FOR_TYPE is nonzero, we return a value which, if converted to
8048 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8050 OP must have integer, real or enumeral type. Pointers are not allowed!
8052 There are some cases where the obvious value we could return
8053 would regenerate to OP if converted to OP's type,
8054 but would not extend like OP to wider types.
8055 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8056 For example, if OP is (unsigned short)(signed char)-1,
8057 we avoid returning (signed char)-1 if FOR_TYPE is int,
8058 even though extending that to an unsigned short would regenerate OP,
8059 since the result of extending (signed char)-1 to (int)
8060 is different from (int) OP. */
8063 get_unwidened (tree op, tree for_type)
8065 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8066 tree type = TREE_TYPE (op);
8068 = TYPE_PRECISION (for_type != 0 ? for_type : type);
8070 = (for_type != 0 && for_type != type
8071 && final_prec > TYPE_PRECISION (type)
8072 && TYPE_UNSIGNED (type));
8075 while (CONVERT_EXPR_P (op))
8079 /* TYPE_PRECISION on vector types has different meaning
8080 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8081 so avoid them here. */
8082 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
8085 bitschange = TYPE_PRECISION (TREE_TYPE (op))
8086 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
8088 /* Truncations are many-one so cannot be removed.
8089 Unless we are later going to truncate down even farther. */
8091 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
8094 /* See what's inside this conversion. If we decide to strip it,
8096 op = TREE_OPERAND (op, 0);
8098 /* If we have not stripped any zero-extensions (uns is 0),
8099 we can strip any kind of extension.
8100 If we have previously stripped a zero-extension,
8101 only zero-extensions can safely be stripped.
8102 Any extension can be stripped if the bits it would produce
8103 are all going to be discarded later by truncating to FOR_TYPE. */
8107 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
8109 /* TYPE_UNSIGNED says whether this is a zero-extension.
8110 Let's avoid computing it if it does not affect WIN
8111 and if UNS will not be needed again. */
8113 || CONVERT_EXPR_P (op))
8114 && TYPE_UNSIGNED (TREE_TYPE (op)))
8122 /* If we finally reach a constant see if it fits in for_type and
8123 in that case convert it. */
8125 && TREE_CODE (win) == INTEGER_CST
8126 && TREE_TYPE (win) != for_type
8127 && int_fits_type_p (win, for_type))
8128 win = fold_convert (for_type, win);
8133 /* Return OP or a simpler expression for a narrower value
8134 which can be sign-extended or zero-extended to give back OP.
8135 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8136 or 0 if the value should be sign-extended. */
8139 get_narrower (tree op, int *unsignedp_ptr)
8144 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
8146 while (TREE_CODE (op) == NOP_EXPR)
8149 = (TYPE_PRECISION (TREE_TYPE (op))
8150 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
8152 /* Truncations are many-one so cannot be removed. */
8156 /* See what's inside this conversion. If we decide to strip it,
8161 op = TREE_OPERAND (op, 0);
8162 /* An extension: the outermost one can be stripped,
8163 but remember whether it is zero or sign extension. */
8165 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8166 /* Otherwise, if a sign extension has been stripped,
8167 only sign extensions can now be stripped;
8168 if a zero extension has been stripped, only zero-extensions. */
8169 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
8173 else /* bitschange == 0 */
8175 /* A change in nominal type can always be stripped, but we must
8176 preserve the unsignedness. */
8178 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8180 op = TREE_OPERAND (op, 0);
8181 /* Keep trying to narrow, but don't assign op to win if it
8182 would turn an integral type into something else. */
8183 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
8190 if (TREE_CODE (op) == COMPONENT_REF
8191 /* Since type_for_size always gives an integer type. */
8192 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8193 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8194 /* Ensure field is laid out already. */
8195 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8196 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
8198 unsigned HOST_WIDE_INT innerprec
8199 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
8200 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8201 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8202 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8204 /* We can get this structure field in a narrower type that fits it,
8205 but the resulting extension to its nominal type (a fullword type)
8206 must satisfy the same conditions as for other extensions.
8208 Do this only for fields that are aligned (not bit-fields),
8209 because when bit-field insns will be used there is no
8210 advantage in doing this. */
8212 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8213 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8214 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8218 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8219 win = fold_convert (type, op);
8223 *unsignedp_ptr = uns;
8227 /* Returns true if integer constant C has a value that is permissible
8228 for type TYPE (an INTEGER_TYPE). */
8231 int_fits_type_p (const_tree c, const_tree type)
8233 tree type_low_bound, type_high_bound;
8234 bool ok_for_low_bound, ok_for_high_bound, unsc;
8237 dc = tree_to_double_int (c);
8238 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
8240 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
8241 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
8243 /* So c is an unsigned integer whose type is sizetype and type is not.
8244 sizetype'd integers are sign extended even though they are
8245 unsigned. If the integer value fits in the lower end word of c,
8246 and if the higher end word has all its bits set to 1, that
8247 means the higher end bits are set to 1 only for sign extension.
8248 So let's convert c into an equivalent zero extended unsigned
8250 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
8253 type_low_bound = TYPE_MIN_VALUE (type);
8254 type_high_bound = TYPE_MAX_VALUE (type);
8256 /* If at least one bound of the type is a constant integer, we can check
8257 ourselves and maybe make a decision. If no such decision is possible, but
8258 this type is a subtype, try checking against that. Otherwise, use
8259 double_int_fits_to_tree_p, which checks against the precision.
8261 Compute the status for each possibly constant bound, and return if we see
8262 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8263 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8264 for "constant known to fit". */
8266 /* Check if c >= type_low_bound. */
8267 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8269 dd = tree_to_double_int (type_low_bound);
8270 if (TREE_CODE (type) == INTEGER_TYPE
8271 && TYPE_IS_SIZETYPE (type)
8272 && TYPE_UNSIGNED (type))
8273 dd = double_int_zext (dd, TYPE_PRECISION (type));
8274 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
8276 int c_neg = (!unsc && double_int_negative_p (dc));
8277 int t_neg = (unsc && double_int_negative_p (dd));
8279 if (c_neg && !t_neg)
8281 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
8284 else if (double_int_cmp (dc, dd, unsc) < 0)
8286 ok_for_low_bound = true;
8289 ok_for_low_bound = false;
8291 /* Check if c <= type_high_bound. */
8292 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8294 dd = tree_to_double_int (type_high_bound);
8295 if (TREE_CODE (type) == INTEGER_TYPE
8296 && TYPE_IS_SIZETYPE (type)
8297 && TYPE_UNSIGNED (type))
8298 dd = double_int_zext (dd, TYPE_PRECISION (type));
8299 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8301 int c_neg = (!unsc && double_int_negative_p (dc));
8302 int t_neg = (unsc && double_int_negative_p (dd));
8304 if (t_neg && !c_neg)
8306 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
8309 else if (double_int_cmp (dc, dd, unsc) > 0)
8311 ok_for_high_bound = true;
8314 ok_for_high_bound = false;
8316 /* If the constant fits both bounds, the result is known. */
8317 if (ok_for_low_bound && ok_for_high_bound)
8320 /* Perform some generic filtering which may allow making a decision
8321 even if the bounds are not constant. First, negative integers
8322 never fit in unsigned types, */
8323 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8326 /* Second, narrower types always fit in wider ones. */
8327 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8330 /* Third, unsigned integers with top bit set never fit signed types. */
8331 if (! TYPE_UNSIGNED (type) && unsc)
8333 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8334 if (prec < HOST_BITS_PER_WIDE_INT)
8336 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8339 else if (((((unsigned HOST_WIDE_INT) 1)
8340 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8344 /* If we haven't been able to decide at this point, there nothing more we
8345 can check ourselves here. Look at the base type if we have one and it
8346 has the same precision. */
8347 if (TREE_CODE (type) == INTEGER_TYPE
8348 && TREE_TYPE (type) != 0
8349 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8351 type = TREE_TYPE (type);
8355 /* Or to double_int_fits_to_tree_p, if nothing else. */
8356 return double_int_fits_to_tree_p (type, dc);
8359 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8360 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8361 represented (assuming two's-complement arithmetic) within the bit
8362 precision of the type are returned instead. */
8365 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8367 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8368 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8369 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8370 TYPE_UNSIGNED (type));
8373 if (TYPE_UNSIGNED (type))
8374 mpz_set_ui (min, 0);
8378 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8379 mn = double_int_sext (double_int_add (mn, double_int_one),
8380 TYPE_PRECISION (type));
8381 mpz_set_double_int (min, mn, false);
8385 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8386 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8387 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8388 TYPE_UNSIGNED (type));
8391 if (TYPE_UNSIGNED (type))
8392 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8395 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8400 /* Return true if VAR is an automatic variable defined in function FN. */
8403 auto_var_in_fn_p (const_tree var, const_tree fn)
8405 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8406 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8407 || TREE_CODE (var) == PARM_DECL)
8408 && ! TREE_STATIC (var))
8409 || TREE_CODE (var) == LABEL_DECL
8410 || TREE_CODE (var) == RESULT_DECL));
8413 /* Subprogram of following function. Called by walk_tree.
8415 Return *TP if it is an automatic variable or parameter of the
8416 function passed in as DATA. */
8419 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8421 tree fn = (tree) data;
8426 else if (DECL_P (*tp)
8427 && auto_var_in_fn_p (*tp, fn))
8433 /* Returns true if T is, contains, or refers to a type with variable
8434 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8435 arguments, but not the return type. If FN is nonzero, only return
8436 true if a modifier of the type or position of FN is a variable or
8437 parameter inside FN.
8439 This concept is more general than that of C99 'variably modified types':
8440 in C99, a struct type is never variably modified because a VLA may not
8441 appear as a structure member. However, in GNU C code like:
8443 struct S { int i[f()]; };
8445 is valid, and other languages may define similar constructs. */
8448 variably_modified_type_p (tree type, tree fn)
8452 /* Test if T is either variable (if FN is zero) or an expression containing
8453 a variable in FN. If TYPE isn't gimplified, return true also if
8454 gimplify_one_sizepos would gimplify the expression into a local
8456 #define RETURN_TRUE_IF_VAR(T) \
8457 do { tree _t = (T); \
8458 if (_t != NULL_TREE \
8459 && _t != error_mark_node \
8460 && TREE_CODE (_t) != INTEGER_CST \
8461 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8463 || (!TYPE_SIZES_GIMPLIFIED (type) \
8464 && !is_gimple_sizepos (_t)) \
8465 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8466 return true; } while (0)
8468 if (type == error_mark_node)
8471 /* If TYPE itself has variable size, it is variably modified. */
8472 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8473 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8475 switch (TREE_CODE (type))
8478 case REFERENCE_TYPE:
8480 if (variably_modified_type_p (TREE_TYPE (type), fn))
8486 /* If TYPE is a function type, it is variably modified if the
8487 return type is variably modified. */
8488 if (variably_modified_type_p (TREE_TYPE (type), fn))
8494 case FIXED_POINT_TYPE:
8497 /* Scalar types are variably modified if their end points
8499 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8500 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8505 case QUAL_UNION_TYPE:
8506 /* We can't see if any of the fields are variably-modified by the
8507 definition we normally use, since that would produce infinite
8508 recursion via pointers. */
8509 /* This is variably modified if some field's type is. */
8510 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8511 if (TREE_CODE (t) == FIELD_DECL)
8513 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8514 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8515 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8517 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8518 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8523 /* Do not call ourselves to avoid infinite recursion. This is
8524 variably modified if the element type is. */
8525 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8526 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8533 /* The current language may have other cases to check, but in general,
8534 all other types are not variably modified. */
8535 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8537 #undef RETURN_TRUE_IF_VAR
8540 /* Given a DECL or TYPE, return the scope in which it was declared, or
8541 NULL_TREE if there is no containing scope. */
8544 get_containing_scope (const_tree t)
8546 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8549 /* Return the innermost context enclosing DECL that is
8550 a FUNCTION_DECL, or zero if none. */
8553 decl_function_context (const_tree decl)
8557 if (TREE_CODE (decl) == ERROR_MARK)
8560 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8561 where we look up the function at runtime. Such functions always take
8562 a first argument of type 'pointer to real context'.
8564 C++ should really be fixed to use DECL_CONTEXT for the real context,
8565 and use something else for the "virtual context". */
8566 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8569 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8571 context = DECL_CONTEXT (decl);
8573 while (context && TREE_CODE (context) != FUNCTION_DECL)
8575 if (TREE_CODE (context) == BLOCK)
8576 context = BLOCK_SUPERCONTEXT (context);
8578 context = get_containing_scope (context);
8584 /* Return the innermost context enclosing DECL that is
8585 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8586 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8589 decl_type_context (const_tree decl)
8591 tree context = DECL_CONTEXT (decl);
8594 switch (TREE_CODE (context))
8596 case NAMESPACE_DECL:
8597 case TRANSLATION_UNIT_DECL:
8602 case QUAL_UNION_TYPE:
8607 context = DECL_CONTEXT (context);
8611 context = BLOCK_SUPERCONTEXT (context);
8621 /* CALL is a CALL_EXPR. Return the declaration for the function
8622 called, or NULL_TREE if the called function cannot be
8626 get_callee_fndecl (const_tree call)
8630 if (call == error_mark_node)
8631 return error_mark_node;
8633 /* It's invalid to call this function with anything but a
8635 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8637 /* The first operand to the CALL is the address of the function
8639 addr = CALL_EXPR_FN (call);
8643 /* If this is a readonly function pointer, extract its initial value. */
8644 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8645 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8646 && DECL_INITIAL (addr))
8647 addr = DECL_INITIAL (addr);
8649 /* If the address is just `&f' for some function `f', then we know
8650 that `f' is being called. */
8651 if (TREE_CODE (addr) == ADDR_EXPR
8652 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8653 return TREE_OPERAND (addr, 0);
8655 /* We couldn't figure out what was being called. */
8659 /* Print debugging information about tree nodes generated during the compile,
8660 and any language-specific information. */
8663 dump_tree_statistics (void)
8665 #ifdef GATHER_STATISTICS
8667 int total_nodes, total_bytes;
8670 fprintf (stderr, "\n??? tree nodes created\n\n");
8671 #ifdef GATHER_STATISTICS
8672 fprintf (stderr, "Kind Nodes Bytes\n");
8673 fprintf (stderr, "---------------------------------------\n");
8674 total_nodes = total_bytes = 0;
8675 for (i = 0; i < (int) all_kinds; i++)
8677 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8678 tree_node_counts[i], tree_node_sizes[i]);
8679 total_nodes += tree_node_counts[i];
8680 total_bytes += tree_node_sizes[i];
8682 fprintf (stderr, "---------------------------------------\n");
8683 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8684 fprintf (stderr, "---------------------------------------\n");
8685 fprintf (stderr, "Code Nodes\n");
8686 fprintf (stderr, "----------------------------\n");
8687 for (i = 0; i < (int) MAX_TREE_CODES; i++)
8688 fprintf (stderr, "%-20s %7d\n", tree_code_name[i], tree_code_counts[i]);
8689 fprintf (stderr, "----------------------------\n");
8690 ssanames_print_statistics ();
8691 phinodes_print_statistics ();
8693 fprintf (stderr, "(No per-node statistics)\n");
8695 print_type_hash_statistics ();
8696 print_debug_expr_statistics ();
8697 print_value_expr_statistics ();
8698 lang_hooks.print_statistics ();
8701 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8703 /* Generate a crc32 of a byte. */
8706 crc32_byte (unsigned chksum, char byte)
8708 unsigned value = (unsigned) byte << 24;
8711 for (ix = 8; ix--; value <<= 1)
8715 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8723 /* Generate a crc32 of a string. */
8726 crc32_string (unsigned chksum, const char *string)
8730 chksum = crc32_byte (chksum, *string);
8736 /* P is a string that will be used in a symbol. Mask out any characters
8737 that are not valid in that context. */
8740 clean_symbol_name (char *p)
8744 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8747 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8754 /* Generate a name for a special-purpose function.
8755 The generated name may need to be unique across the whole link.
8756 Changes to this function may also require corresponding changes to
8757 xstrdup_mask_random.
8758 TYPE is some string to identify the purpose of this function to the
8759 linker or collect2; it must start with an uppercase letter,
8761 I - for constructors
8763 N - for C++ anonymous namespaces
8764 F - for DWARF unwind frame information. */
8767 get_file_function_name (const char *type)
8773 /* If we already have a name we know to be unique, just use that. */
8774 if (first_global_object_name)
8775 p = q = ASTRDUP (first_global_object_name);
8776 /* If the target is handling the constructors/destructors, they
8777 will be local to this file and the name is only necessary for
8779 We also assign sub_I and sub_D sufixes to constructors called from
8780 the global static constructors. These are always local. */
8781 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8782 || (strncmp (type, "sub_", 4) == 0
8783 && (type[4] == 'I' || type[4] == 'D')))
8785 const char *file = main_input_filename;
8787 file = input_filename;
8788 /* Just use the file's basename, because the full pathname
8789 might be quite long. */
8790 p = q = ASTRDUP (lbasename (file));
8794 /* Otherwise, the name must be unique across the entire link.
8795 We don't have anything that we know to be unique to this translation
8796 unit, so use what we do have and throw in some randomness. */
8798 const char *name = weak_global_object_name;
8799 const char *file = main_input_filename;
8804 file = input_filename;
8806 len = strlen (file);
8807 q = (char *) alloca (9 + 17 + len + 1);
8808 memcpy (q, file, len + 1);
8810 snprintf (q + len, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX,
8811 crc32_string (0, name), get_random_seed (false));
8816 clean_symbol_name (q);
8817 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8820 /* Set up the name of the file-level functions we may need.
8821 Use a global object (which is already required to be unique over
8822 the program) rather than the file name (which imposes extra
8824 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8826 return get_identifier (buf);
8829 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8831 /* Complain that the tree code of NODE does not match the expected 0
8832 terminated list of trailing codes. The trailing code list can be
8833 empty, for a more vague error message. FILE, LINE, and FUNCTION
8834 are of the caller. */
8837 tree_check_failed (const_tree node, const char *file,
8838 int line, const char *function, ...)
8842 unsigned length = 0;
8845 va_start (args, function);
8846 while ((code = va_arg (args, int)))
8847 length += 4 + strlen (tree_code_name[code]);
8852 va_start (args, function);
8853 length += strlen ("expected ");
8854 buffer = tmp = (char *) alloca (length);
8856 while ((code = va_arg (args, int)))
8858 const char *prefix = length ? " or " : "expected ";
8860 strcpy (tmp + length, prefix);
8861 length += strlen (prefix);
8862 strcpy (tmp + length, tree_code_name[code]);
8863 length += strlen (tree_code_name[code]);
8868 buffer = "unexpected node";
8870 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8871 buffer, tree_code_name[TREE_CODE (node)],
8872 function, trim_filename (file), line);
8875 /* Complain that the tree code of NODE does match the expected 0
8876 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8880 tree_not_check_failed (const_tree node, const char *file,
8881 int line, const char *function, ...)
8885 unsigned length = 0;
8888 va_start (args, function);
8889 while ((code = va_arg (args, int)))
8890 length += 4 + strlen (tree_code_name[code]);
8892 va_start (args, function);
8893 buffer = (char *) alloca (length);
8895 while ((code = va_arg (args, int)))
8899 strcpy (buffer + length, " or ");
8902 strcpy (buffer + length, tree_code_name[code]);
8903 length += strlen (tree_code_name[code]);
8907 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8908 buffer, tree_code_name[TREE_CODE (node)],
8909 function, trim_filename (file), line);
8912 /* Similar to tree_check_failed, except that we check for a class of tree
8913 code, given in CL. */
8916 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8917 const char *file, int line, const char *function)
8920 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8921 TREE_CODE_CLASS_STRING (cl),
8922 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8923 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8926 /* Similar to tree_check_failed, except that instead of specifying a
8927 dozen codes, use the knowledge that they're all sequential. */
8930 tree_range_check_failed (const_tree node, const char *file, int line,
8931 const char *function, enum tree_code c1,
8935 unsigned length = 0;
8938 for (c = c1; c <= c2; ++c)
8939 length += 4 + strlen (tree_code_name[c]);
8941 length += strlen ("expected ");
8942 buffer = (char *) alloca (length);
8945 for (c = c1; c <= c2; ++c)
8947 const char *prefix = length ? " or " : "expected ";
8949 strcpy (buffer + length, prefix);
8950 length += strlen (prefix);
8951 strcpy (buffer + length, tree_code_name[c]);
8952 length += strlen (tree_code_name[c]);
8955 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8956 buffer, tree_code_name[TREE_CODE (node)],
8957 function, trim_filename (file), line);
8961 /* Similar to tree_check_failed, except that we check that a tree does
8962 not have the specified code, given in CL. */
8965 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8966 const char *file, int line, const char *function)
8969 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8970 TREE_CODE_CLASS_STRING (cl),
8971 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8972 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8976 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8979 omp_clause_check_failed (const_tree node, const char *file, int line,
8980 const char *function, enum omp_clause_code code)
8982 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8983 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8984 function, trim_filename (file), line);
8988 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8991 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8992 const char *function, enum omp_clause_code c1,
8993 enum omp_clause_code c2)
8996 unsigned length = 0;
8999 for (c = c1; c <= c2; ++c)
9000 length += 4 + strlen (omp_clause_code_name[c]);
9002 length += strlen ("expected ");
9003 buffer = (char *) alloca (length);
9006 for (c = c1; c <= c2; ++c)
9008 const char *prefix = length ? " or " : "expected ";
9010 strcpy (buffer + length, prefix);
9011 length += strlen (prefix);
9012 strcpy (buffer + length, omp_clause_code_name[c]);
9013 length += strlen (omp_clause_code_name[c]);
9016 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9017 buffer, omp_clause_code_name[TREE_CODE (node)],
9018 function, trim_filename (file), line);
9022 #undef DEFTREESTRUCT
9023 #define DEFTREESTRUCT(VAL, NAME) NAME,
9025 static const char *ts_enum_names[] = {
9026 #include "treestruct.def"
9028 #undef DEFTREESTRUCT
9030 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9032 /* Similar to tree_class_check_failed, except that we check for
9033 whether CODE contains the tree structure identified by EN. */
9036 tree_contains_struct_check_failed (const_tree node,
9037 const enum tree_node_structure_enum en,
9038 const char *file, int line,
9039 const char *function)
9042 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9044 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
9048 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9049 (dynamically sized) vector. */
9052 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
9053 const char *function)
9056 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9057 idx + 1, len, function, trim_filename (file), line);
9060 /* Similar to above, except that the check is for the bounds of the operand
9061 vector of an expression node EXP. */
9064 tree_operand_check_failed (int idx, const_tree exp, const char *file,
9065 int line, const char *function)
9067 int code = TREE_CODE (exp);
9069 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9070 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
9071 function, trim_filename (file), line);
9074 /* Similar to above, except that the check is for the number of
9075 operands of an OMP_CLAUSE node. */
9078 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
9079 int line, const char *function)
9082 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9083 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
9084 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
9085 trim_filename (file), line);
9087 #endif /* ENABLE_TREE_CHECKING */
9089 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9090 and mapped to the machine mode MODE. Initialize its fields and build
9091 the information necessary for debugging output. */
9094 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
9097 hashval_t hashcode = 0;
9099 t = make_node (VECTOR_TYPE);
9100 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
9101 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
9102 SET_TYPE_MODE (t, mode);
9104 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
9105 SET_TYPE_STRUCTURAL_EQUALITY (t);
9106 else if (TYPE_CANONICAL (innertype) != innertype
9107 || mode != VOIDmode)
9109 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
9113 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
9114 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
9115 hashcode = iterative_hash_host_wide_int (mode, hashcode);
9116 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
9117 t = type_hash_canon (hashcode, t);
9119 /* We have built a main variant, based on the main variant of the
9120 inner type. Use it to build the variant we return. */
9121 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
9122 && TREE_TYPE (t) != innertype)
9123 return build_type_attribute_qual_variant (t,
9124 TYPE_ATTRIBUTES (innertype),
9125 TYPE_QUALS (innertype));
9131 make_or_reuse_type (unsigned size, int unsignedp)
9133 if (size == INT_TYPE_SIZE)
9134 return unsignedp ? unsigned_type_node : integer_type_node;
9135 if (size == CHAR_TYPE_SIZE)
9136 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
9137 if (size == SHORT_TYPE_SIZE)
9138 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
9139 if (size == LONG_TYPE_SIZE)
9140 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
9141 if (size == LONG_LONG_TYPE_SIZE)
9142 return (unsignedp ? long_long_unsigned_type_node
9143 : long_long_integer_type_node);
9144 if (size == 128 && int128_integer_type_node)
9145 return (unsignedp ? int128_unsigned_type_node
9146 : int128_integer_type_node);
9149 return make_unsigned_type (size);
9151 return make_signed_type (size);
9154 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9157 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
9161 if (size == SHORT_FRACT_TYPE_SIZE)
9162 return unsignedp ? sat_unsigned_short_fract_type_node
9163 : sat_short_fract_type_node;
9164 if (size == FRACT_TYPE_SIZE)
9165 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
9166 if (size == LONG_FRACT_TYPE_SIZE)
9167 return unsignedp ? sat_unsigned_long_fract_type_node
9168 : sat_long_fract_type_node;
9169 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9170 return unsignedp ? sat_unsigned_long_long_fract_type_node
9171 : sat_long_long_fract_type_node;
9175 if (size == SHORT_FRACT_TYPE_SIZE)
9176 return unsignedp ? unsigned_short_fract_type_node
9177 : short_fract_type_node;
9178 if (size == FRACT_TYPE_SIZE)
9179 return unsignedp ? unsigned_fract_type_node : fract_type_node;
9180 if (size == LONG_FRACT_TYPE_SIZE)
9181 return unsignedp ? unsigned_long_fract_type_node
9182 : long_fract_type_node;
9183 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9184 return unsignedp ? unsigned_long_long_fract_type_node
9185 : long_long_fract_type_node;
9188 return make_fract_type (size, unsignedp, satp);
9191 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9194 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
9198 if (size == SHORT_ACCUM_TYPE_SIZE)
9199 return unsignedp ? sat_unsigned_short_accum_type_node
9200 : sat_short_accum_type_node;
9201 if (size == ACCUM_TYPE_SIZE)
9202 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
9203 if (size == LONG_ACCUM_TYPE_SIZE)
9204 return unsignedp ? sat_unsigned_long_accum_type_node
9205 : sat_long_accum_type_node;
9206 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9207 return unsignedp ? sat_unsigned_long_long_accum_type_node
9208 : sat_long_long_accum_type_node;
9212 if (size == SHORT_ACCUM_TYPE_SIZE)
9213 return unsignedp ? unsigned_short_accum_type_node
9214 : short_accum_type_node;
9215 if (size == ACCUM_TYPE_SIZE)
9216 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9217 if (size == LONG_ACCUM_TYPE_SIZE)
9218 return unsignedp ? unsigned_long_accum_type_node
9219 : long_accum_type_node;
9220 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9221 return unsignedp ? unsigned_long_long_accum_type_node
9222 : long_long_accum_type_node;
9225 return make_accum_type (size, unsignedp, satp);
9228 /* Create nodes for all integer types (and error_mark_node) using the sizes
9229 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9230 SHORT_DOUBLE specifies whether double should be of the same precision
9234 build_common_tree_nodes (bool signed_char, bool short_double)
9236 error_mark_node = make_node (ERROR_MARK);
9237 TREE_TYPE (error_mark_node) = error_mark_node;
9239 initialize_sizetypes ();
9241 /* Define both `signed char' and `unsigned char'. */
9242 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9243 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9244 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9245 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9247 /* Define `char', which is like either `signed char' or `unsigned char'
9248 but not the same as either. */
9251 ? make_signed_type (CHAR_TYPE_SIZE)
9252 : make_unsigned_type (CHAR_TYPE_SIZE));
9253 TYPE_STRING_FLAG (char_type_node) = 1;
9255 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9256 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9257 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9258 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9259 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9260 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9261 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9262 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9263 #if HOST_BITS_PER_WIDE_INT >= 64
9264 /* TODO: This isn't correct, but as logic depends at the moment on
9265 host's instead of target's wide-integer.
9266 If there is a target not supporting TImode, but has an 128-bit
9267 integer-scalar register, this target check needs to be adjusted. */
9268 if (targetm.scalar_mode_supported_p (TImode))
9270 int128_integer_type_node = make_signed_type (128);
9271 int128_unsigned_type_node = make_unsigned_type (128);
9275 /* Define a boolean type. This type only represents boolean values but
9276 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9277 Front ends which want to override this size (i.e. Java) can redefine
9278 boolean_type_node before calling build_common_tree_nodes_2. */
9279 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9280 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9281 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9282 TYPE_PRECISION (boolean_type_node) = 1;
9284 /* Define what type to use for size_t. */
9285 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
9286 size_type_node = unsigned_type_node;
9287 else if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
9288 size_type_node = long_unsigned_type_node;
9289 else if (strcmp (SIZE_TYPE, "long long unsigned int") == 0)
9290 size_type_node = long_long_unsigned_type_node;
9291 else if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
9292 size_type_node = short_unsigned_type_node;
9296 /* Fill in the rest of the sized types. Reuse existing type nodes
9298 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9299 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9300 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9301 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9302 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9304 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9305 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9306 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9307 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9308 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9310 access_public_node = get_identifier ("public");
9311 access_protected_node = get_identifier ("protected");
9312 access_private_node = get_identifier ("private");
9314 /* Define these next since types below may used them. */
9315 integer_zero_node = build_int_cst (integer_type_node, 0);
9316 integer_one_node = build_int_cst (integer_type_node, 1);
9317 integer_three_node = build_int_cst (integer_type_node, 3);
9318 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9320 size_zero_node = size_int (0);
9321 size_one_node = size_int (1);
9322 bitsize_zero_node = bitsize_int (0);
9323 bitsize_one_node = bitsize_int (1);
9324 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9326 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9327 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9329 void_type_node = make_node (VOID_TYPE);
9330 layout_type (void_type_node);
9332 /* We are not going to have real types in C with less than byte alignment,
9333 so we might as well not have any types that claim to have it. */
9334 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9335 TYPE_USER_ALIGN (void_type_node) = 0;
9337 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9338 layout_type (TREE_TYPE (null_pointer_node));
9340 ptr_type_node = build_pointer_type (void_type_node);
9342 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9343 fileptr_type_node = ptr_type_node;
9345 float_type_node = make_node (REAL_TYPE);
9346 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9347 layout_type (float_type_node);
9349 double_type_node = make_node (REAL_TYPE);
9351 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9353 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9354 layout_type (double_type_node);
9356 long_double_type_node = make_node (REAL_TYPE);
9357 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9358 layout_type (long_double_type_node);
9360 float_ptr_type_node = build_pointer_type (float_type_node);
9361 double_ptr_type_node = build_pointer_type (double_type_node);
9362 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9363 integer_ptr_type_node = build_pointer_type (integer_type_node);
9365 /* Fixed size integer types. */
9366 uint32_type_node = build_nonstandard_integer_type (32, true);
9367 uint64_type_node = build_nonstandard_integer_type (64, true);
9369 /* Decimal float types. */
9370 dfloat32_type_node = make_node (REAL_TYPE);
9371 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9372 layout_type (dfloat32_type_node);
9373 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9374 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9376 dfloat64_type_node = make_node (REAL_TYPE);
9377 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9378 layout_type (dfloat64_type_node);
9379 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9380 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9382 dfloat128_type_node = make_node (REAL_TYPE);
9383 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9384 layout_type (dfloat128_type_node);
9385 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9386 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9388 complex_integer_type_node = build_complex_type (integer_type_node);
9389 complex_float_type_node = build_complex_type (float_type_node);
9390 complex_double_type_node = build_complex_type (double_type_node);
9391 complex_long_double_type_node = build_complex_type (long_double_type_node);
9393 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9394 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9395 sat_ ## KIND ## _type_node = \
9396 make_sat_signed_ ## KIND ## _type (SIZE); \
9397 sat_unsigned_ ## KIND ## _type_node = \
9398 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9399 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9400 unsigned_ ## KIND ## _type_node = \
9401 make_unsigned_ ## KIND ## _type (SIZE);
9403 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9404 sat_ ## WIDTH ## KIND ## _type_node = \
9405 make_sat_signed_ ## KIND ## _type (SIZE); \
9406 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9407 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9408 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9409 unsigned_ ## WIDTH ## KIND ## _type_node = \
9410 make_unsigned_ ## KIND ## _type (SIZE);
9412 /* Make fixed-point type nodes based on four different widths. */
9413 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9414 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9415 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9416 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9417 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9419 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9420 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9421 NAME ## _type_node = \
9422 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9423 u ## NAME ## _type_node = \
9424 make_or_reuse_unsigned_ ## KIND ## _type \
9425 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9426 sat_ ## NAME ## _type_node = \
9427 make_or_reuse_sat_signed_ ## KIND ## _type \
9428 (GET_MODE_BITSIZE (MODE ## mode)); \
9429 sat_u ## NAME ## _type_node = \
9430 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9431 (GET_MODE_BITSIZE (U ## MODE ## mode));
9433 /* Fixed-point type and mode nodes. */
9434 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9435 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9436 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9437 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9438 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9439 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9440 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9441 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9442 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9443 MAKE_FIXED_MODE_NODE (accum, da, DA)
9444 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9447 tree t = targetm.build_builtin_va_list ();
9449 /* Many back-ends define record types without setting TYPE_NAME.
9450 If we copied the record type here, we'd keep the original
9451 record type without a name. This breaks name mangling. So,
9452 don't copy record types and let c_common_nodes_and_builtins()
9453 declare the type to be __builtin_va_list. */
9454 if (TREE_CODE (t) != RECORD_TYPE)
9455 t = build_variant_type_copy (t);
9457 va_list_type_node = t;
9461 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9464 local_define_builtin (const char *name, tree type, enum built_in_function code,
9465 const char *library_name, int ecf_flags)
9469 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9470 library_name, NULL_TREE);
9471 if (ecf_flags & ECF_CONST)
9472 TREE_READONLY (decl) = 1;
9473 if (ecf_flags & ECF_PURE)
9474 DECL_PURE_P (decl) = 1;
9475 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9476 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9477 if (ecf_flags & ECF_NORETURN)
9478 TREE_THIS_VOLATILE (decl) = 1;
9479 if (ecf_flags & ECF_NOTHROW)
9480 TREE_NOTHROW (decl) = 1;
9481 if (ecf_flags & ECF_MALLOC)
9482 DECL_IS_MALLOC (decl) = 1;
9483 if (ecf_flags & ECF_LEAF)
9484 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9485 NULL, DECL_ATTRIBUTES (decl));
9486 if ((ecf_flags & ECF_TM_PURE) && flag_tm)
9487 apply_tm_attr (decl, get_identifier ("transaction_pure"));
9489 set_builtin_decl (code, decl, true);
9492 /* Call this function after instantiating all builtins that the language
9493 front end cares about. This will build the rest of the builtins that
9494 are relied upon by the tree optimizers and the middle-end. */
9497 build_common_builtin_nodes (void)
9502 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY)
9503 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9505 ftype = build_function_type_list (ptr_type_node,
9506 ptr_type_node, const_ptr_type_node,
9507 size_type_node, NULL_TREE);
9509 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY))
9510 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9511 "memcpy", ECF_NOTHROW | ECF_LEAF);
9512 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE))
9513 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9514 "memmove", ECF_NOTHROW | ECF_LEAF);
9517 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP))
9519 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9520 const_ptr_type_node, size_type_node,
9522 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9523 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9526 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET))
9528 ftype = build_function_type_list (ptr_type_node,
9529 ptr_type_node, integer_type_node,
9530 size_type_node, NULL_TREE);
9531 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9532 "memset", ECF_NOTHROW | ECF_LEAF);
9535 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA))
9537 ftype = build_function_type_list (ptr_type_node,
9538 size_type_node, NULL_TREE);
9539 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9540 "alloca", ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9543 ftype = build_function_type_list (ptr_type_node, size_type_node,
9544 size_type_node, NULL_TREE);
9545 local_define_builtin ("__builtin_alloca_with_align", ftype,
9546 BUILT_IN_ALLOCA_WITH_ALIGN, "alloca",
9547 ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9549 /* If we're checking the stack, `alloca' can throw. */
9550 if (flag_stack_check)
9552 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA)) = 0;
9553 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN)) = 0;
9556 ftype = build_function_type_list (void_type_node,
9557 ptr_type_node, ptr_type_node,
9558 ptr_type_node, NULL_TREE);
9559 local_define_builtin ("__builtin_init_trampoline", ftype,
9560 BUILT_IN_INIT_TRAMPOLINE,
9561 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9562 local_define_builtin ("__builtin_init_heap_trampoline", ftype,
9563 BUILT_IN_INIT_HEAP_TRAMPOLINE,
9564 "__builtin_init_heap_trampoline",
9565 ECF_NOTHROW | ECF_LEAF);
9567 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9568 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9569 BUILT_IN_ADJUST_TRAMPOLINE,
9570 "__builtin_adjust_trampoline",
9571 ECF_CONST | ECF_NOTHROW);
9573 ftype = build_function_type_list (void_type_node,
9574 ptr_type_node, ptr_type_node, NULL_TREE);
9575 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9576 BUILT_IN_NONLOCAL_GOTO,
9577 "__builtin_nonlocal_goto",
9578 ECF_NORETURN | ECF_NOTHROW);
9580 ftype = build_function_type_list (void_type_node,
9581 ptr_type_node, ptr_type_node, NULL_TREE);
9582 local_define_builtin ("__builtin_setjmp_setup", ftype,
9583 BUILT_IN_SETJMP_SETUP,
9584 "__builtin_setjmp_setup", ECF_NOTHROW);
9586 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9587 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9588 BUILT_IN_SETJMP_DISPATCHER,
9589 "__builtin_setjmp_dispatcher",
9590 ECF_PURE | ECF_NOTHROW);
9592 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9593 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9594 BUILT_IN_SETJMP_RECEIVER,
9595 "__builtin_setjmp_receiver", ECF_NOTHROW);
9597 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9598 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9599 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9601 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9602 local_define_builtin ("__builtin_stack_restore", ftype,
9603 BUILT_IN_STACK_RESTORE,
9604 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9606 /* If there's a possibility that we might use the ARM EABI, build the
9607 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9608 if (targetm.arm_eabi_unwinder)
9610 ftype = build_function_type_list (void_type_node, NULL_TREE);
9611 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9612 BUILT_IN_CXA_END_CLEANUP,
9613 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9616 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9617 local_define_builtin ("__builtin_unwind_resume", ftype,
9618 BUILT_IN_UNWIND_RESUME,
9619 ((targetm_common.except_unwind_info (&global_options)
9621 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9624 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS) == NULL_TREE)
9626 ftype = build_function_type_list (ptr_type_node, integer_type_node,
9628 local_define_builtin ("__builtin_return_address", ftype,
9629 BUILT_IN_RETURN_ADDRESS,
9630 "__builtin_return_address",
9634 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER)
9635 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
9637 ftype = build_function_type_list (void_type_node, ptr_type_node,
9638 ptr_type_node, NULL_TREE);
9639 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER))
9640 local_define_builtin ("__cyg_profile_func_enter", ftype,
9641 BUILT_IN_PROFILE_FUNC_ENTER,
9642 "__cyg_profile_func_enter", 0);
9643 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT))
9644 local_define_builtin ("__cyg_profile_func_exit", ftype,
9645 BUILT_IN_PROFILE_FUNC_EXIT,
9646 "__cyg_profile_func_exit", 0);
9649 /* The exception object and filter values from the runtime. The argument
9650 must be zero before exception lowering, i.e. from the front end. After
9651 exception lowering, it will be the region number for the exception
9652 landing pad. These functions are PURE instead of CONST to prevent
9653 them from being hoisted past the exception edge that will initialize
9654 its value in the landing pad. */
9655 ftype = build_function_type_list (ptr_type_node,
9656 integer_type_node, NULL_TREE);
9657 ecf_flags = ECF_PURE | ECF_NOTHROW | ECF_LEAF;
9658 /* Only use TM_PURE if we we have TM language support. */
9659 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1))
9660 ecf_flags |= ECF_TM_PURE;
9661 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9662 "__builtin_eh_pointer", ecf_flags);
9664 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9665 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9666 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9667 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9669 ftype = build_function_type_list (void_type_node,
9670 integer_type_node, integer_type_node,
9672 local_define_builtin ("__builtin_eh_copy_values", ftype,
9673 BUILT_IN_EH_COPY_VALUES,
9674 "__builtin_eh_copy_values", ECF_NOTHROW);
9676 /* Complex multiplication and division. These are handled as builtins
9677 rather than optabs because emit_library_call_value doesn't support
9678 complex. Further, we can do slightly better with folding these
9679 beasties if the real and complex parts of the arguments are separate. */
9683 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9685 char mode_name_buf[4], *q;
9687 enum built_in_function mcode, dcode;
9688 tree type, inner_type;
9689 const char *prefix = "__";
9691 if (targetm.libfunc_gnu_prefix)
9694 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9697 inner_type = TREE_TYPE (type);
9699 ftype = build_function_type_list (type, inner_type, inner_type,
9700 inner_type, inner_type, NULL_TREE);
9702 mcode = ((enum built_in_function)
9703 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9704 dcode = ((enum built_in_function)
9705 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9707 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9711 built_in_names[mcode] = concat (prefix, "mul", mode_name_buf, "3",
9713 local_define_builtin (built_in_names[mcode], ftype, mcode,
9714 built_in_names[mcode],
9715 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9717 built_in_names[dcode] = concat (prefix, "div", mode_name_buf, "3",
9719 local_define_builtin (built_in_names[dcode], ftype, dcode,
9720 built_in_names[dcode],
9721 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9726 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9729 If we requested a pointer to a vector, build up the pointers that
9730 we stripped off while looking for the inner type. Similarly for
9731 return values from functions.
9733 The argument TYPE is the top of the chain, and BOTTOM is the
9734 new type which we will point to. */
9737 reconstruct_complex_type (tree type, tree bottom)
9741 if (TREE_CODE (type) == POINTER_TYPE)
9743 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9744 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9745 TYPE_REF_CAN_ALIAS_ALL (type));
9747 else if (TREE_CODE (type) == REFERENCE_TYPE)
9749 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9750 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9751 TYPE_REF_CAN_ALIAS_ALL (type));
9753 else if (TREE_CODE (type) == ARRAY_TYPE)
9755 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9756 outer = build_array_type (inner, TYPE_DOMAIN (type));
9758 else if (TREE_CODE (type) == FUNCTION_TYPE)
9760 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9761 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9763 else if (TREE_CODE (type) == METHOD_TYPE)
9765 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9766 /* The build_method_type_directly() routine prepends 'this' to argument list,
9767 so we must compensate by getting rid of it. */
9769 = build_method_type_directly
9770 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9772 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9774 else if (TREE_CODE (type) == OFFSET_TYPE)
9776 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9777 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9782 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9786 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9789 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9793 switch (GET_MODE_CLASS (mode))
9795 case MODE_VECTOR_INT:
9796 case MODE_VECTOR_FLOAT:
9797 case MODE_VECTOR_FRACT:
9798 case MODE_VECTOR_UFRACT:
9799 case MODE_VECTOR_ACCUM:
9800 case MODE_VECTOR_UACCUM:
9801 nunits = GET_MODE_NUNITS (mode);
9805 /* Check that there are no leftover bits. */
9806 gcc_assert (GET_MODE_BITSIZE (mode)
9807 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9809 nunits = GET_MODE_BITSIZE (mode)
9810 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9817 return make_vector_type (innertype, nunits, mode);
9820 /* Similarly, but takes the inner type and number of units, which must be
9824 build_vector_type (tree innertype, int nunits)
9826 return make_vector_type (innertype, nunits, VOIDmode);
9829 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9832 build_opaque_vector_type (tree innertype, int nunits)
9834 tree t = make_vector_type (innertype, nunits, VOIDmode);
9836 /* We always build the non-opaque variant before the opaque one,
9837 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9838 cand = TYPE_NEXT_VARIANT (t);
9840 && TYPE_VECTOR_OPAQUE (cand)
9841 && check_qualified_type (cand, t, TYPE_QUALS (t)))
9843 /* Othewise build a variant type and make sure to queue it after
9844 the non-opaque type. */
9845 cand = build_distinct_type_copy (t);
9846 TYPE_VECTOR_OPAQUE (cand) = true;
9847 TYPE_CANONICAL (cand) = TYPE_CANONICAL (t);
9848 TYPE_NEXT_VARIANT (cand) = TYPE_NEXT_VARIANT (t);
9849 TYPE_NEXT_VARIANT (t) = cand;
9850 TYPE_MAIN_VARIANT (cand) = TYPE_MAIN_VARIANT (t);
9855 /* Given an initializer INIT, return TRUE if INIT is zero or some
9856 aggregate of zeros. Otherwise return FALSE. */
9858 initializer_zerop (const_tree init)
9864 switch (TREE_CODE (init))
9867 return integer_zerop (init);
9870 /* ??? Note that this is not correct for C4X float formats. There,
9871 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9872 negative exponent. */
9873 return real_zerop (init)
9874 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9877 return fixed_zerop (init);
9880 return integer_zerop (init)
9881 || (real_zerop (init)
9882 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9883 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9886 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9887 if (!initializer_zerop (TREE_VALUE (elt)))
9893 unsigned HOST_WIDE_INT idx;
9895 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9896 if (!initializer_zerop (elt))
9905 /* We need to loop through all elements to handle cases like
9906 "\0" and "\0foobar". */
9907 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9908 if (TREE_STRING_POINTER (init)[i] != '\0')
9919 /* Build an empty statement at location LOC. */
9922 build_empty_stmt (location_t loc)
9924 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9925 SET_EXPR_LOCATION (t, loc);
9930 /* Build an OpenMP clause with code CODE. LOC is the location of the
9934 build_omp_clause (location_t loc, enum omp_clause_code code)
9939 length = omp_clause_num_ops[code];
9940 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9942 record_node_allocation_statistics (OMP_CLAUSE, size);
9944 t = ggc_alloc_tree_node (size);
9945 memset (t, 0, size);
9946 TREE_SET_CODE (t, OMP_CLAUSE);
9947 OMP_CLAUSE_SET_CODE (t, code);
9948 OMP_CLAUSE_LOCATION (t) = loc;
9953 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9954 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9955 Except for the CODE and operand count field, other storage for the
9956 object is initialized to zeros. */
9959 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9962 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9964 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9965 gcc_assert (len >= 1);
9967 record_node_allocation_statistics (code, length);
9969 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9971 TREE_SET_CODE (t, code);
9973 /* Can't use TREE_OPERAND to store the length because if checking is
9974 enabled, it will try to check the length before we store it. :-P */
9975 t->exp.operands[0] = build_int_cst (sizetype, len);
9980 /* Helper function for build_call_* functions; build a CALL_EXPR with
9981 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9982 the argument slots. */
9985 build_call_1 (tree return_type, tree fn, int nargs)
9989 t = build_vl_exp (CALL_EXPR, nargs + 3);
9990 TREE_TYPE (t) = return_type;
9991 CALL_EXPR_FN (t) = fn;
9992 CALL_EXPR_STATIC_CHAIN (t) = NULL;
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 "..." arguments. */
10002 build_call_nary (tree return_type, tree fn, int nargs, ...)
10006 va_start (args, nargs);
10007 ret = build_call_valist (return_type, fn, nargs, args);
10012 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10013 FN and a null static chain slot. NARGS is the number of call arguments
10014 which are specified as a va_list ARGS. */
10017 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
10022 t = build_call_1 (return_type, fn, nargs);
10023 for (i = 0; i < nargs; i++)
10024 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
10025 process_call_operands (t);
10029 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10030 FN and a null static chain slot. NARGS is the number of call arguments
10031 which are specified as a tree array ARGS. */
10034 build_call_array_loc (location_t loc, tree return_type, tree fn,
10035 int nargs, const tree *args)
10040 t = build_call_1 (return_type, fn, nargs);
10041 for (i = 0; i < nargs; i++)
10042 CALL_EXPR_ARG (t, i) = args[i];
10043 process_call_operands (t);
10044 SET_EXPR_LOCATION (t, loc);
10048 /* Like build_call_array, but takes a VEC. */
10051 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
10056 ret = build_call_1 (return_type, fn, VEC_length (tree, args));
10057 FOR_EACH_VEC_ELT (tree, args, ix, t)
10058 CALL_EXPR_ARG (ret, ix) = t;
10059 process_call_operands (ret);
10064 /* Returns true if it is possible to prove that the index of
10065 an array access REF (an ARRAY_REF expression) falls into the
10069 in_array_bounds_p (tree ref)
10071 tree idx = TREE_OPERAND (ref, 1);
10074 if (TREE_CODE (idx) != INTEGER_CST)
10077 min = array_ref_low_bound (ref);
10078 max = array_ref_up_bound (ref);
10081 || TREE_CODE (min) != INTEGER_CST
10082 || TREE_CODE (max) != INTEGER_CST)
10085 if (tree_int_cst_lt (idx, min)
10086 || tree_int_cst_lt (max, idx))
10092 /* Returns true if it is possible to prove that the range of
10093 an array access REF (an ARRAY_RANGE_REF expression) falls
10094 into the array bounds. */
10097 range_in_array_bounds_p (tree ref)
10099 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
10100 tree range_min, range_max, min, max;
10102 range_min = TYPE_MIN_VALUE (domain_type);
10103 range_max = TYPE_MAX_VALUE (domain_type);
10106 || TREE_CODE (range_min) != INTEGER_CST
10107 || TREE_CODE (range_max) != INTEGER_CST)
10110 min = array_ref_low_bound (ref);
10111 max = array_ref_up_bound (ref);
10114 || TREE_CODE (min) != INTEGER_CST
10115 || TREE_CODE (max) != INTEGER_CST)
10118 if (tree_int_cst_lt (range_min, min)
10119 || tree_int_cst_lt (max, range_max))
10125 /* Return true if T (assumed to be a DECL) must be assigned a memory
10129 needs_to_live_in_memory (const_tree t)
10131 if (TREE_CODE (t) == SSA_NAME)
10132 t = SSA_NAME_VAR (t);
10134 return (TREE_ADDRESSABLE (t)
10135 || is_global_var (t)
10136 || (TREE_CODE (t) == RESULT_DECL
10137 && !DECL_BY_REFERENCE (t)
10138 && aggregate_value_p (t, current_function_decl)));
10141 /* Return value of a constant X and sign-extend it. */
10144 int_cst_value (const_tree x)
10146 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10147 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
10149 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10150 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10151 || TREE_INT_CST_HIGH (x) == -1);
10153 if (bits < HOST_BITS_PER_WIDE_INT)
10155 bool negative = ((val >> (bits - 1)) & 1) != 0;
10157 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
10159 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
10165 /* Return value of a constant X and sign-extend it. */
10168 widest_int_cst_value (const_tree x)
10170 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10171 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
10173 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10174 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
10175 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
10176 << HOST_BITS_PER_WIDE_INT);
10178 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10179 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10180 || TREE_INT_CST_HIGH (x) == -1);
10183 if (bits < HOST_BITS_PER_WIDEST_INT)
10185 bool negative = ((val >> (bits - 1)) & 1) != 0;
10187 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
10189 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
10195 /* If TYPE is an integral type, return an equivalent type which is
10196 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
10197 return TYPE itself. */
10200 signed_or_unsigned_type_for (int unsignedp, tree type)
10203 if (POINTER_TYPE_P (type))
10205 /* If the pointer points to the normal address space, use the
10206 size_type_node. Otherwise use an appropriate size for the pointer
10207 based on the named address space it points to. */
10208 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
10209 t = size_type_node;
10211 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10214 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
10217 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10220 /* Returns unsigned variant of TYPE. */
10223 unsigned_type_for (tree type)
10225 return signed_or_unsigned_type_for (1, type);
10228 /* Returns signed variant of TYPE. */
10231 signed_type_for (tree type)
10233 return signed_or_unsigned_type_for (0, type);
10236 /* Returns the largest value obtainable by casting something in INNER type to
10240 upper_bound_in_type (tree outer, tree inner)
10243 unsigned int det = 0;
10244 unsigned oprec = TYPE_PRECISION (outer);
10245 unsigned iprec = TYPE_PRECISION (inner);
10248 /* Compute a unique number for every combination. */
10249 det |= (oprec > iprec) ? 4 : 0;
10250 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10251 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10253 /* Determine the exponent to use. */
10258 /* oprec <= iprec, outer: signed, inner: don't care. */
10263 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10267 /* oprec > iprec, outer: signed, inner: signed. */
10271 /* oprec > iprec, outer: signed, inner: unsigned. */
10275 /* oprec > iprec, outer: unsigned, inner: signed. */
10279 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10283 gcc_unreachable ();
10286 /* Compute 2^^prec - 1. */
10287 if (prec <= HOST_BITS_PER_WIDE_INT)
10290 high.low = ((~(unsigned HOST_WIDE_INT) 0)
10291 >> (HOST_BITS_PER_WIDE_INT - prec));
10295 high.high = ((~(unsigned HOST_WIDE_INT) 0)
10296 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
10297 high.low = ~(unsigned HOST_WIDE_INT) 0;
10300 return double_int_to_tree (outer, high);
10303 /* Returns the smallest value obtainable by casting something in INNER type to
10307 lower_bound_in_type (tree outer, tree inner)
10310 unsigned oprec = TYPE_PRECISION (outer);
10311 unsigned iprec = TYPE_PRECISION (inner);
10313 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10315 if (TYPE_UNSIGNED (outer)
10316 /* If we are widening something of an unsigned type, OUTER type
10317 contains all values of INNER type. In particular, both INNER
10318 and OUTER types have zero in common. */
10319 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10320 low.low = low.high = 0;
10323 /* If we are widening a signed type to another signed type, we
10324 want to obtain -2^^(iprec-1). If we are keeping the
10325 precision or narrowing to a signed type, we want to obtain
10327 unsigned prec = oprec > iprec ? iprec : oprec;
10329 if (prec <= HOST_BITS_PER_WIDE_INT)
10331 low.high = ~(unsigned HOST_WIDE_INT) 0;
10332 low.low = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10336 low.high = ((~(unsigned HOST_WIDE_INT) 0)
10337 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10342 return double_int_to_tree (outer, low);
10345 /* Return nonzero if two operands that are suitable for PHI nodes are
10346 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10347 SSA_NAME or invariant. Note that this is strictly an optimization.
10348 That is, callers of this function can directly call operand_equal_p
10349 and get the same result, only slower. */
10352 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10356 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10358 return operand_equal_p (arg0, arg1, 0);
10361 /* Returns number of zeros at the end of binary representation of X.
10363 ??? Use ffs if available? */
10366 num_ending_zeros (const_tree x)
10368 unsigned HOST_WIDE_INT fr, nfr;
10369 unsigned num, abits;
10370 tree type = TREE_TYPE (x);
10372 if (TREE_INT_CST_LOW (x) == 0)
10374 num = HOST_BITS_PER_WIDE_INT;
10375 fr = TREE_INT_CST_HIGH (x);
10380 fr = TREE_INT_CST_LOW (x);
10383 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10386 if (nfr << abits == fr)
10393 if (num > TYPE_PRECISION (type))
10394 num = TYPE_PRECISION (type);
10396 return build_int_cst_type (type, num);
10400 #define WALK_SUBTREE(NODE) \
10403 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10409 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10410 be walked whenever a type is seen in the tree. Rest of operands and return
10411 value are as for walk_tree. */
10414 walk_type_fields (tree type, walk_tree_fn func, void *data,
10415 struct pointer_set_t *pset, walk_tree_lh lh)
10417 tree result = NULL_TREE;
10419 switch (TREE_CODE (type))
10422 case REFERENCE_TYPE:
10423 /* We have to worry about mutually recursive pointers. These can't
10424 be written in C. They can in Ada. It's pathological, but
10425 there's an ACATS test (c38102a) that checks it. Deal with this
10426 by checking if we're pointing to another pointer, that one
10427 points to another pointer, that one does too, and we have no htab.
10428 If so, get a hash table. We check three levels deep to avoid
10429 the cost of the hash table if we don't need one. */
10430 if (POINTER_TYPE_P (TREE_TYPE (type))
10431 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10432 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10435 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10443 /* ... fall through ... */
10446 WALK_SUBTREE (TREE_TYPE (type));
10450 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10452 /* Fall through. */
10454 case FUNCTION_TYPE:
10455 WALK_SUBTREE (TREE_TYPE (type));
10459 /* We never want to walk into default arguments. */
10460 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10461 WALK_SUBTREE (TREE_VALUE (arg));
10466 /* Don't follow this nodes's type if a pointer for fear that
10467 we'll have infinite recursion. If we have a PSET, then we
10470 || (!POINTER_TYPE_P (TREE_TYPE (type))
10471 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10472 WALK_SUBTREE (TREE_TYPE (type));
10473 WALK_SUBTREE (TYPE_DOMAIN (type));
10477 WALK_SUBTREE (TREE_TYPE (type));
10478 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10488 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10489 called with the DATA and the address of each sub-tree. If FUNC returns a
10490 non-NULL value, the traversal is stopped, and the value returned by FUNC
10491 is returned. If PSET is non-NULL it is used to record the nodes visited,
10492 and to avoid visiting a node more than once. */
10495 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10496 struct pointer_set_t *pset, walk_tree_lh lh)
10498 enum tree_code code;
10502 #define WALK_SUBTREE_TAIL(NODE) \
10506 goto tail_recurse; \
10511 /* Skip empty subtrees. */
10515 /* Don't walk the same tree twice, if the user has requested
10516 that we avoid doing so. */
10517 if (pset && pointer_set_insert (pset, *tp))
10520 /* Call the function. */
10522 result = (*func) (tp, &walk_subtrees, data);
10524 /* If we found something, return it. */
10528 code = TREE_CODE (*tp);
10530 /* Even if we didn't, FUNC may have decided that there was nothing
10531 interesting below this point in the tree. */
10532 if (!walk_subtrees)
10534 /* But we still need to check our siblings. */
10535 if (code == TREE_LIST)
10536 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10537 else if (code == OMP_CLAUSE)
10538 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10545 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10546 if (result || !walk_subtrees)
10553 case IDENTIFIER_NODE:
10560 case PLACEHOLDER_EXPR:
10564 /* None of these have subtrees other than those already walked
10569 WALK_SUBTREE (TREE_VALUE (*tp));
10570 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10575 int len = TREE_VEC_LENGTH (*tp);
10580 /* Walk all elements but the first. */
10582 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10584 /* Now walk the first one as a tail call. */
10585 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10589 WALK_SUBTREE (TREE_REALPART (*tp));
10590 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10594 unsigned HOST_WIDE_INT idx;
10595 constructor_elt *ce;
10598 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10600 WALK_SUBTREE (ce->value);
10605 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10610 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10612 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10613 into declarations that are just mentioned, rather than
10614 declared; they don't really belong to this part of the tree.
10615 And, we can see cycles: the initializer for a declaration
10616 can refer to the declaration itself. */
10617 WALK_SUBTREE (DECL_INITIAL (decl));
10618 WALK_SUBTREE (DECL_SIZE (decl));
10619 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10621 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10624 case STATEMENT_LIST:
10626 tree_stmt_iterator i;
10627 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10628 WALK_SUBTREE (*tsi_stmt_ptr (i));
10633 switch (OMP_CLAUSE_CODE (*tp))
10635 case OMP_CLAUSE_PRIVATE:
10636 case OMP_CLAUSE_SHARED:
10637 case OMP_CLAUSE_FIRSTPRIVATE:
10638 case OMP_CLAUSE_COPYIN:
10639 case OMP_CLAUSE_COPYPRIVATE:
10640 case OMP_CLAUSE_FINAL:
10641 case OMP_CLAUSE_IF:
10642 case OMP_CLAUSE_NUM_THREADS:
10643 case OMP_CLAUSE_SCHEDULE:
10644 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10647 case OMP_CLAUSE_NOWAIT:
10648 case OMP_CLAUSE_ORDERED:
10649 case OMP_CLAUSE_DEFAULT:
10650 case OMP_CLAUSE_UNTIED:
10651 case OMP_CLAUSE_MERGEABLE:
10652 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10654 case OMP_CLAUSE_LASTPRIVATE:
10655 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10656 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10657 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10659 case OMP_CLAUSE_COLLAPSE:
10662 for (i = 0; i < 3; i++)
10663 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10664 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10667 case OMP_CLAUSE_REDUCTION:
10670 for (i = 0; i < 4; i++)
10671 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10672 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10676 gcc_unreachable ();
10684 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10685 But, we only want to walk once. */
10686 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10687 for (i = 0; i < len; ++i)
10688 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10689 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10693 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10694 defining. We only want to walk into these fields of a type in this
10695 case and not in the general case of a mere reference to the type.
10697 The criterion is as follows: if the field can be an expression, it
10698 must be walked only here. This should be in keeping with the fields
10699 that are directly gimplified in gimplify_type_sizes in order for the
10700 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10701 variable-sized types.
10703 Note that DECLs get walked as part of processing the BIND_EXPR. */
10704 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10706 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10707 if (TREE_CODE (*type_p) == ERROR_MARK)
10710 /* Call the function for the type. See if it returns anything or
10711 doesn't want us to continue. If we are to continue, walk both
10712 the normal fields and those for the declaration case. */
10713 result = (*func) (type_p, &walk_subtrees, data);
10714 if (result || !walk_subtrees)
10717 /* But do not walk a pointed-to type since it may itself need to
10718 be walked in the declaration case if it isn't anonymous. */
10719 if (!POINTER_TYPE_P (*type_p))
10721 result = walk_type_fields (*type_p, func, data, pset, lh);
10726 /* If this is a record type, also walk the fields. */
10727 if (RECORD_OR_UNION_TYPE_P (*type_p))
10731 for (field = TYPE_FIELDS (*type_p); field;
10732 field = DECL_CHAIN (field))
10734 /* We'd like to look at the type of the field, but we can
10735 easily get infinite recursion. So assume it's pointed
10736 to elsewhere in the tree. Also, ignore things that
10738 if (TREE_CODE (field) != FIELD_DECL)
10741 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10742 WALK_SUBTREE (DECL_SIZE (field));
10743 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10744 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10745 WALK_SUBTREE (DECL_QUALIFIER (field));
10749 /* Same for scalar types. */
10750 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10751 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10752 || TREE_CODE (*type_p) == INTEGER_TYPE
10753 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10754 || TREE_CODE (*type_p) == REAL_TYPE)
10756 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10757 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10760 WALK_SUBTREE (TYPE_SIZE (*type_p));
10761 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10766 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10770 /* Walk over all the sub-trees of this operand. */
10771 len = TREE_OPERAND_LENGTH (*tp);
10773 /* Go through the subtrees. We need to do this in forward order so
10774 that the scope of a FOR_EXPR is handled properly. */
10777 for (i = 0; i < len - 1; ++i)
10778 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10779 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10782 /* If this is a type, walk the needed fields in the type. */
10783 else if (TYPE_P (*tp))
10784 return walk_type_fields (*tp, func, data, pset, lh);
10788 /* We didn't find what we were looking for. */
10791 #undef WALK_SUBTREE_TAIL
10793 #undef WALK_SUBTREE
10795 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10798 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10802 struct pointer_set_t *pset;
10804 pset = pointer_set_create ();
10805 result = walk_tree_1 (tp, func, data, pset, lh);
10806 pointer_set_destroy (pset);
10812 tree_block (tree t)
10814 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10816 if (IS_EXPR_CODE_CLASS (c))
10817 return &t->exp.block;
10818 gcc_unreachable ();
10822 /* Create a nameless artificial label and put it in the current
10823 function context. The label has a location of LOC. Returns the
10824 newly created label. */
10827 create_artificial_label (location_t loc)
10829 tree lab = build_decl (loc,
10830 LABEL_DECL, NULL_TREE, void_type_node);
10832 DECL_ARTIFICIAL (lab) = 1;
10833 DECL_IGNORED_P (lab) = 1;
10834 DECL_CONTEXT (lab) = current_function_decl;
10838 /* Given a tree, try to return a useful variable name that we can use
10839 to prefix a temporary that is being assigned the value of the tree.
10840 I.E. given <temp> = &A, return A. */
10845 tree stripped_decl;
10848 STRIP_NOPS (stripped_decl);
10849 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10850 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10853 switch (TREE_CODE (stripped_decl))
10856 return get_name (TREE_OPERAND (stripped_decl, 0));
10863 /* Return true if TYPE has a variable argument list. */
10866 stdarg_p (const_tree fntype)
10868 function_args_iterator args_iter;
10869 tree n = NULL_TREE, t;
10874 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10879 return n != NULL_TREE && n != void_type_node;
10882 /* Return true if TYPE has a prototype. */
10885 prototype_p (tree fntype)
10889 gcc_assert (fntype != NULL_TREE);
10891 t = TYPE_ARG_TYPES (fntype);
10892 return (t != NULL_TREE);
10895 /* If BLOCK is inlined from an __attribute__((__artificial__))
10896 routine, return pointer to location from where it has been
10899 block_nonartificial_location (tree block)
10901 location_t *ret = NULL;
10903 while (block && TREE_CODE (block) == BLOCK
10904 && BLOCK_ABSTRACT_ORIGIN (block))
10906 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10908 while (TREE_CODE (ao) == BLOCK
10909 && BLOCK_ABSTRACT_ORIGIN (ao)
10910 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10911 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10913 if (TREE_CODE (ao) == FUNCTION_DECL)
10915 /* If AO is an artificial inline, point RET to the
10916 call site locus at which it has been inlined and continue
10917 the loop, in case AO's caller is also an artificial
10919 if (DECL_DECLARED_INLINE_P (ao)
10920 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10921 ret = &BLOCK_SOURCE_LOCATION (block);
10925 else if (TREE_CODE (ao) != BLOCK)
10928 block = BLOCK_SUPERCONTEXT (block);
10934 /* If EXP is inlined from an __attribute__((__artificial__))
10935 function, return the location of the original call expression. */
10938 tree_nonartificial_location (tree exp)
10940 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10945 return EXPR_LOCATION (exp);
10949 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10952 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10955 cl_option_hash_hash (const void *x)
10957 const_tree const t = (const_tree) x;
10961 hashval_t hash = 0;
10963 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10965 p = (const char *)TREE_OPTIMIZATION (t);
10966 len = sizeof (struct cl_optimization);
10969 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10971 p = (const char *)TREE_TARGET_OPTION (t);
10972 len = sizeof (struct cl_target_option);
10976 gcc_unreachable ();
10978 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10980 for (i = 0; i < len; i++)
10982 hash = (hash << 4) ^ ((i << 2) | p[i]);
10987 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10988 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10992 cl_option_hash_eq (const void *x, const void *y)
10994 const_tree const xt = (const_tree) x;
10995 const_tree const yt = (const_tree) y;
11000 if (TREE_CODE (xt) != TREE_CODE (yt))
11003 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
11005 xp = (const char *)TREE_OPTIMIZATION (xt);
11006 yp = (const char *)TREE_OPTIMIZATION (yt);
11007 len = sizeof (struct cl_optimization);
11010 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
11012 xp = (const char *)TREE_TARGET_OPTION (xt);
11013 yp = (const char *)TREE_TARGET_OPTION (yt);
11014 len = sizeof (struct cl_target_option);
11018 gcc_unreachable ();
11020 return (memcmp (xp, yp, len) == 0);
11023 /* Build an OPTIMIZATION_NODE based on the current options. */
11026 build_optimization_node (void)
11031 /* Use the cache of optimization nodes. */
11033 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
11036 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
11040 /* Insert this one into the hash table. */
11041 t = cl_optimization_node;
11044 /* Make a new node for next time round. */
11045 cl_optimization_node = make_node (OPTIMIZATION_NODE);
11051 /* Build a TARGET_OPTION_NODE based on the current options. */
11054 build_target_option_node (void)
11059 /* Use the cache of optimization nodes. */
11061 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
11064 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
11068 /* Insert this one into the hash table. */
11069 t = cl_target_option_node;
11072 /* Make a new node for next time round. */
11073 cl_target_option_node = make_node (TARGET_OPTION_NODE);
11079 /* Determine the "ultimate origin" of a block. The block may be an inlined
11080 instance of an inlined instance of a block which is local to an inline
11081 function, so we have to trace all of the way back through the origin chain
11082 to find out what sort of node actually served as the original seed for the
11086 block_ultimate_origin (const_tree block)
11088 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
11090 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11091 nodes in the function to point to themselves; ignore that if
11092 we're trying to output the abstract instance of this function. */
11093 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
11096 if (immediate_origin == NULL_TREE)
11101 tree lookahead = immediate_origin;
11105 ret_val = lookahead;
11106 lookahead = (TREE_CODE (ret_val) == BLOCK
11107 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
11109 while (lookahead != NULL && lookahead != ret_val);
11111 /* The block's abstract origin chain may not be the *ultimate* origin of
11112 the block. It could lead to a DECL that has an abstract origin set.
11113 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11114 will give us if it has one). Note that DECL's abstract origins are
11115 supposed to be the most distant ancestor (or so decl_ultimate_origin
11116 claims), so we don't need to loop following the DECL origins. */
11117 if (DECL_P (ret_val))
11118 return DECL_ORIGIN (ret_val);
11124 /* Return true if T1 and T2 are equivalent lists. */
11127 list_equal_p (const_tree t1, const_tree t2)
11129 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
11130 if (TREE_VALUE (t1) != TREE_VALUE (t2))
11135 /* Return true iff conversion in EXP generates no instruction. Mark
11136 it inline so that we fully inline into the stripping functions even
11137 though we have two uses of this function. */
11140 tree_nop_conversion (const_tree exp)
11142 tree outer_type, inner_type;
11144 if (!CONVERT_EXPR_P (exp)
11145 && TREE_CODE (exp) != NON_LVALUE_EXPR)
11147 if (TREE_OPERAND (exp, 0) == error_mark_node)
11150 outer_type = TREE_TYPE (exp);
11151 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11156 /* Use precision rather then machine mode when we can, which gives
11157 the correct answer even for submode (bit-field) types. */
11158 if ((INTEGRAL_TYPE_P (outer_type)
11159 || POINTER_TYPE_P (outer_type)
11160 || TREE_CODE (outer_type) == OFFSET_TYPE)
11161 && (INTEGRAL_TYPE_P (inner_type)
11162 || POINTER_TYPE_P (inner_type)
11163 || TREE_CODE (inner_type) == OFFSET_TYPE))
11164 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
11166 /* Otherwise fall back on comparing machine modes (e.g. for
11167 aggregate types, floats). */
11168 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
11171 /* Return true iff conversion in EXP generates no instruction. Don't
11172 consider conversions changing the signedness. */
11175 tree_sign_nop_conversion (const_tree exp)
11177 tree outer_type, inner_type;
11179 if (!tree_nop_conversion (exp))
11182 outer_type = TREE_TYPE (exp);
11183 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11185 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
11186 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
11189 /* Strip conversions from EXP according to tree_nop_conversion and
11190 return the resulting expression. */
11193 tree_strip_nop_conversions (tree exp)
11195 while (tree_nop_conversion (exp))
11196 exp = TREE_OPERAND (exp, 0);
11200 /* Strip conversions from EXP according to tree_sign_nop_conversion
11201 and return the resulting expression. */
11204 tree_strip_sign_nop_conversions (tree exp)
11206 while (tree_sign_nop_conversion (exp))
11207 exp = TREE_OPERAND (exp, 0);
11211 /* Strip out all handled components that produce invariant
11215 strip_invariant_refs (const_tree op)
11217 while (handled_component_p (op))
11219 switch (TREE_CODE (op))
11222 case ARRAY_RANGE_REF:
11223 if (!is_gimple_constant (TREE_OPERAND (op, 1))
11224 || TREE_OPERAND (op, 2) != NULL_TREE
11225 || TREE_OPERAND (op, 3) != NULL_TREE)
11229 case COMPONENT_REF:
11230 if (TREE_OPERAND (op, 2) != NULL_TREE)
11236 op = TREE_OPERAND (op, 0);
11242 static GTY(()) tree gcc_eh_personality_decl;
11244 /* Return the GCC personality function decl. */
11247 lhd_gcc_personality (void)
11249 if (!gcc_eh_personality_decl)
11250 gcc_eh_personality_decl = build_personality_function ("gcc");
11251 return gcc_eh_personality_decl;
11254 /* Try to find a base info of BINFO that would have its field decl at offset
11255 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11256 found, return, otherwise return NULL_TREE. */
11259 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
11261 tree type = BINFO_TYPE (binfo);
11265 HOST_WIDE_INT pos, size;
11269 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (expected_type))
11274 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
11276 if (TREE_CODE (fld) != FIELD_DECL)
11279 pos = int_bit_position (fld);
11280 size = tree_low_cst (DECL_SIZE (fld), 1);
11281 if (pos <= offset && (pos + size) > offset)
11284 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
11287 if (!DECL_ARTIFICIAL (fld))
11289 binfo = TYPE_BINFO (TREE_TYPE (fld));
11293 /* Offset 0 indicates the primary base, whose vtable contents are
11294 represented in the binfo for the derived class. */
11295 else if (offset != 0)
11297 tree base_binfo, found_binfo = NULL_TREE;
11298 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
11299 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
11301 found_binfo = base_binfo;
11306 binfo = found_binfo;
11309 type = TREE_TYPE (fld);
11314 /* Returns true if X is a typedef decl. */
11317 is_typedef_decl (tree x)
11319 return (x && TREE_CODE (x) == TYPE_DECL
11320 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
11323 /* Returns true iff TYPE is a type variant created for a typedef. */
11326 typedef_variant_p (tree type)
11328 return is_typedef_decl (TYPE_NAME (type));
11331 /* Warn about a use of an identifier which was marked deprecated. */
11333 warn_deprecated_use (tree node, tree attr)
11337 if (node == 0 || !warn_deprecated_decl)
11343 attr = DECL_ATTRIBUTES (node);
11344 else if (TYPE_P (node))
11346 tree decl = TYPE_STUB_DECL (node);
11348 attr = lookup_attribute ("deprecated",
11349 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
11354 attr = lookup_attribute ("deprecated", attr);
11357 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
11363 expanded_location xloc = expand_location (DECL_SOURCE_LOCATION (node));
11365 warning (OPT_Wdeprecated_declarations,
11366 "%qD is deprecated (declared at %s:%d): %s",
11367 node, xloc.file, xloc.line, msg);
11369 warning (OPT_Wdeprecated_declarations,
11370 "%qD is deprecated (declared at %s:%d)",
11371 node, xloc.file, xloc.line);
11373 else if (TYPE_P (node))
11375 tree what = NULL_TREE;
11376 tree decl = TYPE_STUB_DECL (node);
11378 if (TYPE_NAME (node))
11380 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
11381 what = TYPE_NAME (node);
11382 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
11383 && DECL_NAME (TYPE_NAME (node)))
11384 what = DECL_NAME (TYPE_NAME (node));
11389 expanded_location xloc
11390 = expand_location (DECL_SOURCE_LOCATION (decl));
11394 warning (OPT_Wdeprecated_declarations,
11395 "%qE is deprecated (declared at %s:%d): %s",
11396 what, xloc.file, xloc.line, msg);
11398 warning (OPT_Wdeprecated_declarations,
11399 "%qE is deprecated (declared at %s:%d)", what,
11400 xloc.file, xloc.line);
11405 warning (OPT_Wdeprecated_declarations,
11406 "type is deprecated (declared at %s:%d): %s",
11407 xloc.file, xloc.line, msg);
11409 warning (OPT_Wdeprecated_declarations,
11410 "type is deprecated (declared at %s:%d)",
11411 xloc.file, xloc.line);
11419 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
11422 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
11427 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
11430 warning (OPT_Wdeprecated_declarations, "type is deprecated");
11436 #include "gt-tree.h"