1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
44 #include "filenames.h"
47 #include "common/common-target.h"
48 #include "langhooks.h"
49 #include "tree-inline.h"
50 #include "tree-iterator.h"
51 #include "basic-block.h"
52 #include "tree-flow.h"
54 #include "pointer-set.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
58 #include "tree-diagnostic.h"
59 #include "tree-pretty-print.h"
66 /* Tree code classes. */
68 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
69 #define END_OF_BASE_TREE_CODES tcc_exceptional,
71 const enum tree_code_class tree_code_type[] = {
72 #include "all-tree.def"
76 #undef END_OF_BASE_TREE_CODES
78 /* Table indexed by tree code giving number of expression
79 operands beyond the fixed part of the node structure.
80 Not used for types or decls. */
82 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
83 #define END_OF_BASE_TREE_CODES 0,
85 const unsigned char tree_code_length[] = {
86 #include "all-tree.def"
90 #undef END_OF_BASE_TREE_CODES
92 /* Names of tree components.
93 Used for printing out the tree and error messages. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
95 #define END_OF_BASE_TREE_CODES "@dummy",
97 const char *const tree_code_name[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Each tree code class has an associated string representation.
105 These must correspond to the tree_code_class entries. */
107 const char *const tree_code_class_strings[] =
122 /* obstack.[ch] explicitly declined to prototype this. */
123 extern int _obstack_allocated_p (struct obstack *h, void *obj);
125 #ifdef GATHER_STATISTICS
126 /* Statistics-gathering stuff. */
128 static int tree_code_counts[MAX_TREE_CODES];
129 int tree_node_counts[(int) all_kinds];
130 int tree_node_sizes[(int) all_kinds];
132 /* Keep in sync with tree.h:enum tree_node_kind. */
133 static const char * const tree_node_kind_names[] = {
151 #endif /* GATHER_STATISTICS */
153 /* Unique id for next decl created. */
154 static GTY(()) int next_decl_uid;
155 /* Unique id for next type created. */
156 static GTY(()) int next_type_uid = 1;
157 /* Unique id for next debug decl created. Use negative numbers,
158 to catch erroneous uses. */
159 static GTY(()) int next_debug_decl_uid;
161 /* Since we cannot rehash a type after it is in the table, we have to
162 keep the hash code. */
164 struct GTY(()) type_hash {
169 /* Initial size of the hash table (rounded to next prime). */
170 #define TYPE_HASH_INITIAL_SIZE 1000
172 /* Now here is the hash table. When recording a type, it is added to
173 the slot whose index is the hash code. Note that the hash table is
174 used for several kinds of types (function types, array types and
175 array index range types, for now). While all these live in the
176 same table, they are completely independent, and the hash code is
177 computed differently for each of these. */
179 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
180 htab_t type_hash_table;
182 /* Hash table and temporary node for larger integer const values. */
183 static GTY (()) tree int_cst_node;
184 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
185 htab_t int_cst_hash_table;
187 /* Hash table for optimization flags and target option flags. Use the same
188 hash table for both sets of options. Nodes for building the current
189 optimization and target option nodes. The assumption is most of the time
190 the options created will already be in the hash table, so we avoid
191 allocating and freeing up a node repeatably. */
192 static GTY (()) tree cl_optimization_node;
193 static GTY (()) tree cl_target_option_node;
194 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
195 htab_t cl_option_hash_table;
197 /* General tree->tree mapping structure for use in hash tables. */
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
201 htab_t debug_expr_for_decl;
203 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
204 htab_t value_expr_for_decl;
206 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map)))
207 htab_t debug_args_for_decl;
209 static GTY ((if_marked ("tree_priority_map_marked_p"),
210 param_is (struct tree_priority_map)))
211 htab_t init_priority_for_decl;
213 static void set_type_quals (tree, int);
214 static int type_hash_eq (const void *, const void *);
215 static hashval_t type_hash_hash (const void *);
216 static hashval_t int_cst_hash_hash (const void *);
217 static int int_cst_hash_eq (const void *, const void *);
218 static hashval_t cl_option_hash_hash (const void *);
219 static int cl_option_hash_eq (const void *, const void *);
220 static void print_type_hash_statistics (void);
221 static void print_debug_expr_statistics (void);
222 static void print_value_expr_statistics (void);
223 static int type_hash_marked_p (const void *);
224 static unsigned int type_hash_list (const_tree, hashval_t);
225 static unsigned int attribute_hash_list (const_tree, hashval_t);
227 tree global_trees[TI_MAX];
228 tree integer_types[itk_none];
230 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
232 /* Number of operands for each OpenMP clause. */
233 unsigned const char omp_clause_num_ops[] =
235 0, /* OMP_CLAUSE_ERROR */
236 1, /* OMP_CLAUSE_PRIVATE */
237 1, /* OMP_CLAUSE_SHARED */
238 1, /* OMP_CLAUSE_FIRSTPRIVATE */
239 2, /* OMP_CLAUSE_LASTPRIVATE */
240 4, /* OMP_CLAUSE_REDUCTION */
241 1, /* OMP_CLAUSE_COPYIN */
242 1, /* OMP_CLAUSE_COPYPRIVATE */
243 1, /* OMP_CLAUSE_IF */
244 1, /* OMP_CLAUSE_NUM_THREADS */
245 1, /* OMP_CLAUSE_SCHEDULE */
246 0, /* OMP_CLAUSE_NOWAIT */
247 0, /* OMP_CLAUSE_ORDERED */
248 0, /* OMP_CLAUSE_DEFAULT */
249 3, /* OMP_CLAUSE_COLLAPSE */
250 0 /* OMP_CLAUSE_UNTIED */
253 const char * const omp_clause_code_name[] =
274 /* Return the tree node structure used by tree code CODE. */
276 static inline enum tree_node_structure_enum
277 tree_node_structure_for_code (enum tree_code code)
279 switch (TREE_CODE_CLASS (code))
281 case tcc_declaration:
286 return TS_FIELD_DECL;
292 return TS_LABEL_DECL;
294 return TS_RESULT_DECL;
295 case DEBUG_EXPR_DECL:
298 return TS_CONST_DECL;
302 return TS_FUNCTION_DECL;
303 case TRANSLATION_UNIT_DECL:
304 return TS_TRANSLATION_UNIT_DECL;
306 return TS_DECL_NON_COMMON;
310 return TS_TYPE_NON_COMMON;
319 default: /* tcc_constant and tcc_exceptional */
324 /* tcc_constant cases. */
325 case INTEGER_CST: return TS_INT_CST;
326 case REAL_CST: return TS_REAL_CST;
327 case FIXED_CST: return TS_FIXED_CST;
328 case COMPLEX_CST: return TS_COMPLEX;
329 case VECTOR_CST: return TS_VECTOR;
330 case STRING_CST: return TS_STRING;
331 /* tcc_exceptional cases. */
332 case ERROR_MARK: return TS_COMMON;
333 case IDENTIFIER_NODE: return TS_IDENTIFIER;
334 case TREE_LIST: return TS_LIST;
335 case TREE_VEC: return TS_VEC;
336 case SSA_NAME: return TS_SSA_NAME;
337 case PLACEHOLDER_EXPR: return TS_COMMON;
338 case STATEMENT_LIST: return TS_STATEMENT_LIST;
339 case BLOCK: return TS_BLOCK;
340 case CONSTRUCTOR: return TS_CONSTRUCTOR;
341 case TREE_BINFO: return TS_BINFO;
342 case OMP_CLAUSE: return TS_OMP_CLAUSE;
343 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
344 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
352 /* Initialize tree_contains_struct to describe the hierarchy of tree
356 initialize_tree_contains_struct (void)
360 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
363 enum tree_node_structure_enum ts_code;
365 code = (enum tree_code) i;
366 ts_code = tree_node_structure_for_code (code);
368 /* Mark the TS structure itself. */
369 tree_contains_struct[code][ts_code] = 1;
371 /* Mark all the structures that TS is derived from. */
389 case TS_STATEMENT_LIST:
390 MARK_TS_TYPED (code);
394 case TS_DECL_MINIMAL:
400 case TS_OPTIMIZATION:
401 case TS_TARGET_OPTION:
402 MARK_TS_COMMON (code);
405 case TS_TYPE_WITH_LANG_SPECIFIC:
406 MARK_TS_TYPE_COMMON (code);
409 case TS_TYPE_NON_COMMON:
410 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code);
414 MARK_TS_DECL_MINIMAL (code);
419 MARK_TS_DECL_COMMON (code);
422 case TS_DECL_NON_COMMON:
423 MARK_TS_DECL_WITH_VIS (code);
426 case TS_DECL_WITH_VIS:
430 MARK_TS_DECL_WRTL (code);
434 MARK_TS_DECL_COMMON (code);
438 MARK_TS_DECL_WITH_VIS (code);
442 case TS_FUNCTION_DECL:
443 MARK_TS_DECL_NON_COMMON (code);
446 case TS_TRANSLATION_UNIT_DECL:
447 MARK_TS_DECL_COMMON (code);
455 /* Basic consistency checks for attributes used in fold. */
456 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
457 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
458 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
459 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
460 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
461 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
462 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
463 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
464 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
465 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
466 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
467 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
468 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
469 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
470 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
471 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
472 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
473 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
474 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
475 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
476 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
478 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
479 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
480 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
481 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
482 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
483 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
484 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
485 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
486 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
487 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
488 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
489 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
490 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
492 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
493 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
502 /* Initialize the hash table of types. */
503 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
506 debug_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
507 tree_decl_map_eq, 0);
509 value_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
510 tree_decl_map_eq, 0);
511 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
512 tree_priority_map_eq, 0);
514 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
515 int_cst_hash_eq, NULL);
517 int_cst_node = make_node (INTEGER_CST);
519 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
520 cl_option_hash_eq, NULL);
522 cl_optimization_node = make_node (OPTIMIZATION_NODE);
523 cl_target_option_node = make_node (TARGET_OPTION_NODE);
525 /* Initialize the tree_contains_struct array. */
526 initialize_tree_contains_struct ();
527 lang_hooks.init_ts ();
531 /* The name of the object as the assembler will see it (but before any
532 translations made by ASM_OUTPUT_LABELREF). Often this is the same
533 as DECL_NAME. It is an IDENTIFIER_NODE. */
535 decl_assembler_name (tree decl)
537 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
538 lang_hooks.set_decl_assembler_name (decl);
539 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
542 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
545 decl_assembler_name_equal (tree decl, const_tree asmname)
547 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
548 const char *decl_str;
549 const char *asmname_str;
552 if (decl_asmname == asmname)
555 decl_str = IDENTIFIER_POINTER (decl_asmname);
556 asmname_str = IDENTIFIER_POINTER (asmname);
559 /* If the target assembler name was set by the user, things are trickier.
560 We have a leading '*' to begin with. After that, it's arguable what
561 is the correct thing to do with -fleading-underscore. Arguably, we've
562 historically been doing the wrong thing in assemble_alias by always
563 printing the leading underscore. Since we're not changing that, make
564 sure user_label_prefix follows the '*' before matching. */
565 if (decl_str[0] == '*')
567 size_t ulp_len = strlen (user_label_prefix);
573 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
574 decl_str += ulp_len, test=true;
578 if (asmname_str[0] == '*')
580 size_t ulp_len = strlen (user_label_prefix);
586 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
587 asmname_str += ulp_len, test=true;
594 return strcmp (decl_str, asmname_str) == 0;
597 /* Hash asmnames ignoring the user specified marks. */
600 decl_assembler_name_hash (const_tree asmname)
602 if (IDENTIFIER_POINTER (asmname)[0] == '*')
604 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
605 size_t ulp_len = strlen (user_label_prefix);
609 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
612 return htab_hash_string (decl_str);
615 return htab_hash_string (IDENTIFIER_POINTER (asmname));
618 /* Compute the number of bytes occupied by a tree with code CODE.
619 This function cannot be used for nodes that have variable sizes,
620 including TREE_VEC, STRING_CST, and CALL_EXPR. */
622 tree_code_size (enum tree_code code)
624 switch (TREE_CODE_CLASS (code))
626 case tcc_declaration: /* A decl node */
631 return sizeof (struct tree_field_decl);
633 return sizeof (struct tree_parm_decl);
635 return sizeof (struct tree_var_decl);
637 return sizeof (struct tree_label_decl);
639 return sizeof (struct tree_result_decl);
641 return sizeof (struct tree_const_decl);
643 return sizeof (struct tree_type_decl);
645 return sizeof (struct tree_function_decl);
646 case DEBUG_EXPR_DECL:
647 return sizeof (struct tree_decl_with_rtl);
649 return sizeof (struct tree_decl_non_common);
653 case tcc_type: /* a type node */
654 return sizeof (struct tree_type_non_common);
656 case tcc_reference: /* a reference */
657 case tcc_expression: /* an expression */
658 case tcc_statement: /* an expression with side effects */
659 case tcc_comparison: /* a comparison expression */
660 case tcc_unary: /* a unary arithmetic expression */
661 case tcc_binary: /* a binary arithmetic expression */
662 return (sizeof (struct tree_exp)
663 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
665 case tcc_constant: /* a constant */
668 case INTEGER_CST: return sizeof (struct tree_int_cst);
669 case REAL_CST: return sizeof (struct tree_real_cst);
670 case FIXED_CST: return sizeof (struct tree_fixed_cst);
671 case COMPLEX_CST: return sizeof (struct tree_complex);
672 case VECTOR_CST: return sizeof (struct tree_vector);
673 case STRING_CST: gcc_unreachable ();
675 return lang_hooks.tree_size (code);
678 case tcc_exceptional: /* something random, like an identifier. */
681 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
682 case TREE_LIST: return sizeof (struct tree_list);
685 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
688 case OMP_CLAUSE: gcc_unreachable ();
690 case SSA_NAME: return sizeof (struct tree_ssa_name);
692 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
693 case BLOCK: return sizeof (struct tree_block);
694 case CONSTRUCTOR: return sizeof (struct tree_constructor);
695 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
696 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
699 return lang_hooks.tree_size (code);
707 /* Compute the number of bytes occupied by NODE. This routine only
708 looks at TREE_CODE, except for those nodes that have variable sizes. */
710 tree_size (const_tree node)
712 const enum tree_code code = TREE_CODE (node);
716 return (offsetof (struct tree_binfo, base_binfos)
717 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
720 return (sizeof (struct tree_vec)
721 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
724 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
727 return (sizeof (struct tree_omp_clause)
728 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
732 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
733 return (sizeof (struct tree_exp)
734 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
736 return tree_code_size (code);
740 /* Record interesting allocation statistics for a tree node with CODE
744 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED,
745 size_t length ATTRIBUTE_UNUSED)
747 #ifdef GATHER_STATISTICS
748 enum tree_code_class type = TREE_CODE_CLASS (code);
753 case tcc_declaration: /* A decl node */
757 case tcc_type: /* a type node */
761 case tcc_statement: /* an expression with side effects */
765 case tcc_reference: /* a reference */
769 case tcc_expression: /* an expression */
770 case tcc_comparison: /* a comparison expression */
771 case tcc_unary: /* a unary arithmetic expression */
772 case tcc_binary: /* a binary arithmetic expression */
776 case tcc_constant: /* a constant */
780 case tcc_exceptional: /* something random, like an identifier. */
783 case IDENTIFIER_NODE:
796 kind = ssa_name_kind;
808 kind = omp_clause_kind;
825 tree_code_counts[(int) code]++;
826 tree_node_counts[(int) kind]++;
827 tree_node_sizes[(int) kind] += length;
831 /* Allocate and return a new UID from the DECL_UID namespace. */
834 allocate_decl_uid (void)
836 return next_decl_uid++;
839 /* Return a newly allocated node of code CODE. For decl and type
840 nodes, some other fields are initialized. The rest of the node is
841 initialized to zero. This function cannot be used for TREE_VEC or
842 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
844 Achoo! I got a code in the node. */
847 make_node_stat (enum tree_code code MEM_STAT_DECL)
850 enum tree_code_class type = TREE_CODE_CLASS (code);
851 size_t length = tree_code_size (code);
853 record_node_allocation_statistics (code, length);
855 t = ggc_alloc_zone_cleared_tree_node_stat (
856 (code == IDENTIFIER_NODE) ? &tree_id_zone : &tree_zone,
857 length PASS_MEM_STAT);
858 TREE_SET_CODE (t, code);
863 TREE_SIDE_EFFECTS (t) = 1;
866 case tcc_declaration:
867 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
869 if (code == FUNCTION_DECL)
871 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
872 DECL_MODE (t) = FUNCTION_MODE;
877 DECL_SOURCE_LOCATION (t) = input_location;
878 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
879 DECL_UID (t) = --next_debug_decl_uid;
882 DECL_UID (t) = allocate_decl_uid ();
883 SET_DECL_PT_UID (t, -1);
885 if (TREE_CODE (t) == LABEL_DECL)
886 LABEL_DECL_UID (t) = -1;
891 TYPE_UID (t) = next_type_uid++;
892 TYPE_ALIGN (t) = BITS_PER_UNIT;
893 TYPE_USER_ALIGN (t) = 0;
894 TYPE_MAIN_VARIANT (t) = t;
895 TYPE_CANONICAL (t) = t;
897 /* Default to no attributes for type, but let target change that. */
898 TYPE_ATTRIBUTES (t) = NULL_TREE;
899 targetm.set_default_type_attributes (t);
901 /* We have not yet computed the alias set for this type. */
902 TYPE_ALIAS_SET (t) = -1;
906 TREE_CONSTANT (t) = 1;
915 case PREDECREMENT_EXPR:
916 case PREINCREMENT_EXPR:
917 case POSTDECREMENT_EXPR:
918 case POSTINCREMENT_EXPR:
919 /* All of these have side-effects, no matter what their
921 TREE_SIDE_EFFECTS (t) = 1;
930 /* Other classes need no special treatment. */
937 /* Return a new node with the same contents as NODE except that its
938 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
941 copy_node_stat (tree node MEM_STAT_DECL)
944 enum tree_code code = TREE_CODE (node);
947 gcc_assert (code != STATEMENT_LIST);
949 length = tree_size (node);
950 record_node_allocation_statistics (code, length);
951 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
952 memcpy (t, node, length);
954 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
956 TREE_ASM_WRITTEN (t) = 0;
957 TREE_VISITED (t) = 0;
958 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
959 *DECL_VAR_ANN_PTR (t) = 0;
961 if (TREE_CODE_CLASS (code) == tcc_declaration)
963 if (code == DEBUG_EXPR_DECL)
964 DECL_UID (t) = --next_debug_decl_uid;
967 DECL_UID (t) = allocate_decl_uid ();
968 if (DECL_PT_UID_SET_P (node))
969 SET_DECL_PT_UID (t, DECL_PT_UID (node));
971 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
972 && DECL_HAS_VALUE_EXPR_P (node))
974 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
975 DECL_HAS_VALUE_EXPR_P (t) = 1;
977 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
979 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
980 DECL_HAS_INIT_PRIORITY_P (t) = 1;
983 else if (TREE_CODE_CLASS (code) == tcc_type)
985 TYPE_UID (t) = next_type_uid++;
986 /* The following is so that the debug code for
987 the copy is different from the original type.
988 The two statements usually duplicate each other
989 (because they clear fields of the same union),
990 but the optimizer should catch that. */
991 TYPE_SYMTAB_POINTER (t) = 0;
992 TYPE_SYMTAB_ADDRESS (t) = 0;
994 /* Do not copy the values cache. */
995 if (TYPE_CACHED_VALUES_P(t))
997 TYPE_CACHED_VALUES_P (t) = 0;
998 TYPE_CACHED_VALUES (t) = NULL_TREE;
1005 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1006 For example, this can copy a list made of TREE_LIST nodes. */
1009 copy_list (tree list)
1017 head = prev = copy_node (list);
1018 next = TREE_CHAIN (list);
1021 TREE_CHAIN (prev) = copy_node (next);
1022 prev = TREE_CHAIN (prev);
1023 next = TREE_CHAIN (next);
1029 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1032 build_int_cst (tree type, HOST_WIDE_INT low)
1034 /* Support legacy code. */
1036 type = integer_type_node;
1038 return double_int_to_tree (type, shwi_to_double_int (low));
1041 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1044 build_int_cst_type (tree type, HOST_WIDE_INT low)
1048 return double_int_to_tree (type, shwi_to_double_int (low));
1051 /* Constructs tree in type TYPE from with value given by CST. Signedness
1052 of CST is assumed to be the same as the signedness of TYPE. */
1055 double_int_to_tree (tree type, double_int cst)
1057 /* Size types *are* sign extended. */
1058 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1059 || (TREE_CODE (type) == INTEGER_TYPE
1060 && TYPE_IS_SIZETYPE (type)));
1062 cst = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1064 return build_int_cst_wide (type, cst.low, cst.high);
1067 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1068 to be the same as the signedness of TYPE. */
1071 double_int_fits_to_tree_p (const_tree type, double_int cst)
1073 /* Size types *are* sign extended. */
1074 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1075 || (TREE_CODE (type) == INTEGER_TYPE
1076 && TYPE_IS_SIZETYPE (type)));
1079 = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1081 return double_int_equal_p (cst, ext);
1084 /* We force the double_int CST to the range of the type TYPE by sign or
1085 zero extending it. OVERFLOWABLE indicates if we are interested in
1086 overflow of the value, when >0 we are only interested in signed
1087 overflow, for <0 we are interested in any overflow. OVERFLOWED
1088 indicates whether overflow has already occurred. CONST_OVERFLOWED
1089 indicates whether constant overflow has already occurred. We force
1090 T's value to be within range of T's type (by setting to 0 or 1 all
1091 the bits outside the type's range). We set TREE_OVERFLOWED if,
1092 OVERFLOWED is nonzero,
1093 or OVERFLOWABLE is >0 and signed overflow occurs
1094 or OVERFLOWABLE is <0 and any overflow occurs
1095 We return a new tree node for the extended double_int. The node
1096 is shared if no overflow flags are set. */
1100 force_fit_type_double (tree type, double_int cst, int overflowable,
1103 bool sign_extended_type;
1105 /* Size types *are* sign extended. */
1106 sign_extended_type = (!TYPE_UNSIGNED (type)
1107 || (TREE_CODE (type) == INTEGER_TYPE
1108 && TYPE_IS_SIZETYPE (type)));
1110 /* If we need to set overflow flags, return a new unshared node. */
1111 if (overflowed || !double_int_fits_to_tree_p(type, cst))
1115 || (overflowable > 0 && sign_extended_type))
1117 tree t = make_node (INTEGER_CST);
1118 TREE_INT_CST (t) = double_int_ext (cst, TYPE_PRECISION (type),
1119 !sign_extended_type);
1120 TREE_TYPE (t) = type;
1121 TREE_OVERFLOW (t) = 1;
1126 /* Else build a shared node. */
1127 return double_int_to_tree (type, cst);
1130 /* These are the hash table functions for the hash table of INTEGER_CST
1131 nodes of a sizetype. */
1133 /* Return the hash code code X, an INTEGER_CST. */
1136 int_cst_hash_hash (const void *x)
1138 const_tree const t = (const_tree) x;
1140 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1141 ^ htab_hash_pointer (TREE_TYPE (t)));
1144 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1145 is the same as that given by *Y, which is the same. */
1148 int_cst_hash_eq (const void *x, const void *y)
1150 const_tree const xt = (const_tree) x;
1151 const_tree const yt = (const_tree) y;
1153 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1154 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1155 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1158 /* Create an INT_CST node of TYPE and value HI:LOW.
1159 The returned node is always shared. For small integers we use a
1160 per-type vector cache, for larger ones we use a single hash table. */
1163 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1171 switch (TREE_CODE (type))
1174 gcc_assert (hi == 0 && low == 0);
1178 case REFERENCE_TYPE:
1179 /* Cache NULL pointer. */
1188 /* Cache false or true. */
1196 if (TYPE_UNSIGNED (type))
1199 limit = INTEGER_SHARE_LIMIT;
1200 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1206 limit = INTEGER_SHARE_LIMIT + 1;
1207 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1209 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1223 /* Look for it in the type's vector of small shared ints. */
1224 if (!TYPE_CACHED_VALUES_P (type))
1226 TYPE_CACHED_VALUES_P (type) = 1;
1227 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1230 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1233 /* Make sure no one is clobbering the shared constant. */
1234 gcc_assert (TREE_TYPE (t) == type);
1235 gcc_assert (TREE_INT_CST_LOW (t) == low);
1236 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1240 /* Create a new shared int. */
1241 t = make_node (INTEGER_CST);
1243 TREE_INT_CST_LOW (t) = low;
1244 TREE_INT_CST_HIGH (t) = hi;
1245 TREE_TYPE (t) = type;
1247 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1252 /* Use the cache of larger shared ints. */
1255 TREE_INT_CST_LOW (int_cst_node) = low;
1256 TREE_INT_CST_HIGH (int_cst_node) = hi;
1257 TREE_TYPE (int_cst_node) = type;
1259 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1263 /* Insert this one into the hash table. */
1266 /* Make a new node for next time round. */
1267 int_cst_node = make_node (INTEGER_CST);
1274 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1275 and the rest are zeros. */
1278 build_low_bits_mask (tree type, unsigned bits)
1282 gcc_assert (bits <= TYPE_PRECISION (type));
1284 if (bits == TYPE_PRECISION (type)
1285 && !TYPE_UNSIGNED (type))
1286 /* Sign extended all-ones mask. */
1287 mask = double_int_minus_one;
1289 mask = double_int_mask (bits);
1291 return build_int_cst_wide (type, mask.low, mask.high);
1294 /* Checks that X is integer constant that can be expressed in (unsigned)
1295 HOST_WIDE_INT without loss of precision. */
1298 cst_and_fits_in_hwi (const_tree x)
1300 if (TREE_CODE (x) != INTEGER_CST)
1303 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1306 return (TREE_INT_CST_HIGH (x) == 0
1307 || TREE_INT_CST_HIGH (x) == -1);
1310 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1311 are in a list pointed to by VALS. */
1314 build_vector (tree type, tree vals)
1316 tree v = make_node (VECTOR_CST);
1321 TREE_VECTOR_CST_ELTS (v) = vals;
1322 TREE_TYPE (v) = type;
1324 /* Iterate through elements and check for overflow. */
1325 for (link = vals; link; link = TREE_CHAIN (link))
1327 tree value = TREE_VALUE (link);
1330 /* Don't crash if we get an address constant. */
1331 if (!CONSTANT_CLASS_P (value))
1334 over |= TREE_OVERFLOW (value);
1337 gcc_assert (cnt == TYPE_VECTOR_SUBPARTS (type));
1339 TREE_OVERFLOW (v) = over;
1343 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1344 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1347 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1349 tree list = NULL_TREE;
1350 unsigned HOST_WIDE_INT idx;
1353 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1354 list = tree_cons (NULL_TREE, value, list);
1355 for (; idx < TYPE_VECTOR_SUBPARTS (type); ++idx)
1356 list = tree_cons (NULL_TREE,
1357 build_zero_cst (TREE_TYPE (type)), list);
1358 return build_vector (type, nreverse (list));
1361 /* Build a vector of type VECTYPE where all the elements are SCs. */
1363 build_vector_from_val (tree vectype, tree sc)
1365 int i, nunits = TYPE_VECTOR_SUBPARTS (vectype);
1366 VEC(constructor_elt, gc) *v = NULL;
1368 if (sc == error_mark_node)
1371 /* Verify that the vector type is suitable for SC. Note that there
1372 is some inconsistency in the type-system with respect to restrict
1373 qualifications of pointers. Vector types always have a main-variant
1374 element type and the qualification is applied to the vector-type.
1375 So TREE_TYPE (vector-type) does not return a properly qualified
1376 vector element-type. */
1377 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc)),
1378 TREE_TYPE (vectype)));
1380 v = VEC_alloc (constructor_elt, gc, nunits);
1381 for (i = 0; i < nunits; ++i)
1382 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, sc);
1384 if (CONSTANT_CLASS_P (sc))
1385 return build_vector_from_ctor (vectype, v);
1387 return build_constructor (vectype, v);
1390 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1391 are in the VEC pointed to by VALS. */
1393 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1395 tree c = make_node (CONSTRUCTOR);
1397 constructor_elt *elt;
1398 bool constant_p = true;
1400 TREE_TYPE (c) = type;
1401 CONSTRUCTOR_ELTS (c) = vals;
1403 FOR_EACH_VEC_ELT (constructor_elt, vals, i, elt)
1404 if (!TREE_CONSTANT (elt->value))
1410 TREE_CONSTANT (c) = constant_p;
1415 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1418 build_constructor_single (tree type, tree index, tree value)
1420 VEC(constructor_elt,gc) *v;
1421 constructor_elt *elt;
1423 v = VEC_alloc (constructor_elt, gc, 1);
1424 elt = VEC_quick_push (constructor_elt, v, NULL);
1428 return build_constructor (type, v);
1432 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1433 are in a list pointed to by VALS. */
1435 build_constructor_from_list (tree type, tree vals)
1438 VEC(constructor_elt,gc) *v = NULL;
1442 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1443 for (t = vals; t; t = TREE_CHAIN (t))
1444 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1447 return build_constructor (type, v);
1450 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1453 build_fixed (tree type, FIXED_VALUE_TYPE f)
1456 FIXED_VALUE_TYPE *fp;
1458 v = make_node (FIXED_CST);
1459 fp = ggc_alloc_fixed_value ();
1460 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1462 TREE_TYPE (v) = type;
1463 TREE_FIXED_CST_PTR (v) = fp;
1467 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1470 build_real (tree type, REAL_VALUE_TYPE d)
1473 REAL_VALUE_TYPE *dp;
1476 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1477 Consider doing it via real_convert now. */
1479 v = make_node (REAL_CST);
1480 dp = ggc_alloc_real_value ();
1481 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1483 TREE_TYPE (v) = type;
1484 TREE_REAL_CST_PTR (v) = dp;
1485 TREE_OVERFLOW (v) = overflow;
1489 /* Return a new REAL_CST node whose type is TYPE
1490 and whose value is the integer value of the INTEGER_CST node I. */
1493 real_value_from_int_cst (const_tree type, const_tree i)
1497 /* Clear all bits of the real value type so that we can later do
1498 bitwise comparisons to see if two values are the same. */
1499 memset (&d, 0, sizeof d);
1501 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1502 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1503 TYPE_UNSIGNED (TREE_TYPE (i)));
1507 /* Given a tree representing an integer constant I, return a tree
1508 representing the same value as a floating-point constant of type TYPE. */
1511 build_real_from_int_cst (tree type, const_tree i)
1514 int overflow = TREE_OVERFLOW (i);
1516 v = build_real (type, real_value_from_int_cst (type, i));
1518 TREE_OVERFLOW (v) |= overflow;
1522 /* Return a newly constructed STRING_CST node whose value is
1523 the LEN characters at STR.
1524 The TREE_TYPE is not initialized. */
1527 build_string (int len, const char *str)
1532 /* Do not waste bytes provided by padding of struct tree_string. */
1533 length = len + offsetof (struct tree_string, str) + 1;
1535 record_node_allocation_statistics (STRING_CST, length);
1537 s = ggc_alloc_tree_node (length);
1539 memset (s, 0, sizeof (struct tree_typed));
1540 TREE_SET_CODE (s, STRING_CST);
1541 TREE_CONSTANT (s) = 1;
1542 TREE_STRING_LENGTH (s) = len;
1543 memcpy (s->string.str, str, len);
1544 s->string.str[len] = '\0';
1549 /* Return a newly constructed COMPLEX_CST node whose value is
1550 specified by the real and imaginary parts REAL and IMAG.
1551 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1552 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1555 build_complex (tree type, tree real, tree imag)
1557 tree t = make_node (COMPLEX_CST);
1559 TREE_REALPART (t) = real;
1560 TREE_IMAGPART (t) = imag;
1561 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1562 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1566 /* Return a constant of arithmetic type TYPE which is the
1567 multiplicative identity of the set TYPE. */
1570 build_one_cst (tree type)
1572 switch (TREE_CODE (type))
1574 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1575 case POINTER_TYPE: case REFERENCE_TYPE:
1577 return build_int_cst (type, 1);
1580 return build_real (type, dconst1);
1582 case FIXED_POINT_TYPE:
1583 /* We can only generate 1 for accum types. */
1584 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1585 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1589 tree scalar = build_one_cst (TREE_TYPE (type));
1591 return build_vector_from_val (type, scalar);
1595 return build_complex (type,
1596 build_one_cst (TREE_TYPE (type)),
1597 build_zero_cst (TREE_TYPE (type)));
1604 /* Build 0 constant of type TYPE. This is used by constructor folding
1605 and thus the constant should be represented in memory by
1609 build_zero_cst (tree type)
1611 switch (TREE_CODE (type))
1613 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1614 case POINTER_TYPE: case REFERENCE_TYPE:
1616 return build_int_cst (type, 0);
1619 return build_real (type, dconst0);
1621 case FIXED_POINT_TYPE:
1622 return build_fixed (type, FCONST0 (TYPE_MODE (type)));
1626 tree scalar = build_zero_cst (TREE_TYPE (type));
1628 return build_vector_from_val (type, scalar);
1633 tree zero = build_zero_cst (TREE_TYPE (type));
1635 return build_complex (type, zero, zero);
1639 if (!AGGREGATE_TYPE_P (type))
1640 return fold_convert (type, integer_zero_node);
1641 return build_constructor (type, NULL);
1646 /* Build a BINFO with LEN language slots. */
1649 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1652 size_t length = (offsetof (struct tree_binfo, base_binfos)
1653 + VEC_embedded_size (tree, base_binfos));
1655 record_node_allocation_statistics (TREE_BINFO, length);
1657 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1659 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1661 TREE_SET_CODE (t, TREE_BINFO);
1663 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1668 /* Create a CASE_LABEL_EXPR tree node and return it. */
1671 build_case_label (tree low_value, tree high_value, tree label_decl)
1673 tree t = make_node (CASE_LABEL_EXPR);
1675 TREE_TYPE (t) = void_type_node;
1676 SET_EXPR_LOCATION (t, DECL_SOURCE_LOCATION (label_decl));
1678 CASE_LOW (t) = low_value;
1679 CASE_HIGH (t) = high_value;
1680 CASE_LABEL (t) = label_decl;
1681 CASE_CHAIN (t) = NULL_TREE;
1686 /* Build a newly constructed TREE_VEC node of length LEN. */
1689 make_tree_vec_stat (int len MEM_STAT_DECL)
1692 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1694 record_node_allocation_statistics (TREE_VEC, length);
1696 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1698 TREE_SET_CODE (t, TREE_VEC);
1699 TREE_VEC_LENGTH (t) = len;
1704 /* Return 1 if EXPR is the integer constant zero or a complex constant
1708 integer_zerop (const_tree expr)
1712 return ((TREE_CODE (expr) == INTEGER_CST
1713 && TREE_INT_CST_LOW (expr) == 0
1714 && TREE_INT_CST_HIGH (expr) == 0)
1715 || (TREE_CODE (expr) == COMPLEX_CST
1716 && integer_zerop (TREE_REALPART (expr))
1717 && integer_zerop (TREE_IMAGPART (expr))));
1720 /* Return 1 if EXPR is the integer constant one or the corresponding
1721 complex constant. */
1724 integer_onep (const_tree expr)
1728 return ((TREE_CODE (expr) == INTEGER_CST
1729 && TREE_INT_CST_LOW (expr) == 1
1730 && TREE_INT_CST_HIGH (expr) == 0)
1731 || (TREE_CODE (expr) == COMPLEX_CST
1732 && integer_onep (TREE_REALPART (expr))
1733 && integer_zerop (TREE_IMAGPART (expr))));
1736 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1737 it contains. Likewise for the corresponding complex constant. */
1740 integer_all_onesp (const_tree expr)
1747 if (TREE_CODE (expr) == COMPLEX_CST
1748 && integer_all_onesp (TREE_REALPART (expr))
1749 && integer_zerop (TREE_IMAGPART (expr)))
1752 else if (TREE_CODE (expr) != INTEGER_CST)
1755 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1756 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1757 && TREE_INT_CST_HIGH (expr) == -1)
1762 prec = TYPE_PRECISION (TREE_TYPE (expr));
1763 if (prec >= HOST_BITS_PER_WIDE_INT)
1765 HOST_WIDE_INT high_value;
1768 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1770 /* Can not handle precisions greater than twice the host int size. */
1771 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1772 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1773 /* Shifting by the host word size is undefined according to the ANSI
1774 standard, so we must handle this as a special case. */
1777 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1779 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1780 && TREE_INT_CST_HIGH (expr) == high_value);
1783 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1786 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1790 integer_pow2p (const_tree expr)
1793 HOST_WIDE_INT high, low;
1797 if (TREE_CODE (expr) == COMPLEX_CST
1798 && integer_pow2p (TREE_REALPART (expr))
1799 && integer_zerop (TREE_IMAGPART (expr)))
1802 if (TREE_CODE (expr) != INTEGER_CST)
1805 prec = TYPE_PRECISION (TREE_TYPE (expr));
1806 high = TREE_INT_CST_HIGH (expr);
1807 low = TREE_INT_CST_LOW (expr);
1809 /* First clear all bits that are beyond the type's precision in case
1810 we've been sign extended. */
1812 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1814 else if (prec > HOST_BITS_PER_WIDE_INT)
1815 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1819 if (prec < HOST_BITS_PER_WIDE_INT)
1820 low &= ~((HOST_WIDE_INT) (-1) << prec);
1823 if (high == 0 && low == 0)
1826 return ((high == 0 && (low & (low - 1)) == 0)
1827 || (low == 0 && (high & (high - 1)) == 0));
1830 /* Return 1 if EXPR is an integer constant other than zero or a
1831 complex constant other than zero. */
1834 integer_nonzerop (const_tree expr)
1838 return ((TREE_CODE (expr) == INTEGER_CST
1839 && (TREE_INT_CST_LOW (expr) != 0
1840 || TREE_INT_CST_HIGH (expr) != 0))
1841 || (TREE_CODE (expr) == COMPLEX_CST
1842 && (integer_nonzerop (TREE_REALPART (expr))
1843 || integer_nonzerop (TREE_IMAGPART (expr)))));
1846 /* Return 1 if EXPR is the fixed-point constant zero. */
1849 fixed_zerop (const_tree expr)
1851 return (TREE_CODE (expr) == FIXED_CST
1852 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1855 /* Return the power of two represented by a tree node known to be a
1859 tree_log2 (const_tree expr)
1862 HOST_WIDE_INT high, low;
1866 if (TREE_CODE (expr) == COMPLEX_CST)
1867 return tree_log2 (TREE_REALPART (expr));
1869 prec = TYPE_PRECISION (TREE_TYPE (expr));
1870 high = TREE_INT_CST_HIGH (expr);
1871 low = TREE_INT_CST_LOW (expr);
1873 /* First clear all bits that are beyond the type's precision in case
1874 we've been sign extended. */
1876 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1878 else if (prec > HOST_BITS_PER_WIDE_INT)
1879 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1883 if (prec < HOST_BITS_PER_WIDE_INT)
1884 low &= ~((HOST_WIDE_INT) (-1) << prec);
1887 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1888 : exact_log2 (low));
1891 /* Similar, but return the largest integer Y such that 2 ** Y is less
1892 than or equal to EXPR. */
1895 tree_floor_log2 (const_tree expr)
1898 HOST_WIDE_INT high, low;
1902 if (TREE_CODE (expr) == COMPLEX_CST)
1903 return tree_log2 (TREE_REALPART (expr));
1905 prec = TYPE_PRECISION (TREE_TYPE (expr));
1906 high = TREE_INT_CST_HIGH (expr);
1907 low = TREE_INT_CST_LOW (expr);
1909 /* First clear all bits that are beyond the type's precision in case
1910 we've been sign extended. Ignore if type's precision hasn't been set
1911 since what we are doing is setting it. */
1913 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1915 else if (prec > HOST_BITS_PER_WIDE_INT)
1916 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1920 if (prec < HOST_BITS_PER_WIDE_INT)
1921 low &= ~((HOST_WIDE_INT) (-1) << prec);
1924 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1925 : floor_log2 (low));
1928 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1929 decimal float constants, so don't return 1 for them. */
1932 real_zerop (const_tree expr)
1936 return ((TREE_CODE (expr) == REAL_CST
1937 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1938 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1939 || (TREE_CODE (expr) == COMPLEX_CST
1940 && real_zerop (TREE_REALPART (expr))
1941 && real_zerop (TREE_IMAGPART (expr))));
1944 /* Return 1 if EXPR is the real constant one in real or complex form.
1945 Trailing zeroes matter for decimal float constants, so don't return
1949 real_onep (const_tree expr)
1953 return ((TREE_CODE (expr) == REAL_CST
1954 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1955 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1956 || (TREE_CODE (expr) == COMPLEX_CST
1957 && real_onep (TREE_REALPART (expr))
1958 && real_zerop (TREE_IMAGPART (expr))));
1961 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1962 for decimal float constants, so don't return 1 for them. */
1965 real_twop (const_tree expr)
1969 return ((TREE_CODE (expr) == REAL_CST
1970 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1971 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1972 || (TREE_CODE (expr) == COMPLEX_CST
1973 && real_twop (TREE_REALPART (expr))
1974 && real_zerop (TREE_IMAGPART (expr))));
1977 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1978 matter for decimal float constants, so don't return 1 for them. */
1981 real_minus_onep (const_tree expr)
1985 return ((TREE_CODE (expr) == REAL_CST
1986 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1987 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1988 || (TREE_CODE (expr) == COMPLEX_CST
1989 && real_minus_onep (TREE_REALPART (expr))
1990 && real_zerop (TREE_IMAGPART (expr))));
1993 /* Nonzero if EXP is a constant or a cast of a constant. */
1996 really_constant_p (const_tree exp)
1998 /* This is not quite the same as STRIP_NOPS. It does more. */
1999 while (CONVERT_EXPR_P (exp)
2000 || TREE_CODE (exp) == NON_LVALUE_EXPR)
2001 exp = TREE_OPERAND (exp, 0);
2002 return TREE_CONSTANT (exp);
2005 /* Return first list element whose TREE_VALUE is ELEM.
2006 Return 0 if ELEM is not in LIST. */
2009 value_member (tree elem, tree list)
2013 if (elem == TREE_VALUE (list))
2015 list = TREE_CHAIN (list);
2020 /* Return first list element whose TREE_PURPOSE is ELEM.
2021 Return 0 if ELEM is not in LIST. */
2024 purpose_member (const_tree elem, tree list)
2028 if (elem == TREE_PURPOSE (list))
2030 list = TREE_CHAIN (list);
2035 /* Return true if ELEM is in V. */
2038 vec_member (const_tree elem, VEC(tree,gc) *v)
2042 FOR_EACH_VEC_ELT (tree, v, ix, t)
2048 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2052 chain_index (int idx, tree chain)
2054 for (; chain && idx > 0; --idx)
2055 chain = TREE_CHAIN (chain);
2059 /* Return nonzero if ELEM is part of the chain CHAIN. */
2062 chain_member (const_tree elem, const_tree chain)
2068 chain = DECL_CHAIN (chain);
2074 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2075 We expect a null pointer to mark the end of the chain.
2076 This is the Lisp primitive `length'. */
2079 list_length (const_tree t)
2082 #ifdef ENABLE_TREE_CHECKING
2090 #ifdef ENABLE_TREE_CHECKING
2093 gcc_assert (p != q);
2101 /* Returns the number of FIELD_DECLs in TYPE. */
2104 fields_length (const_tree type)
2106 tree t = TYPE_FIELDS (type);
2109 for (; t; t = DECL_CHAIN (t))
2110 if (TREE_CODE (t) == FIELD_DECL)
2116 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2117 UNION_TYPE TYPE, or NULL_TREE if none. */
2120 first_field (const_tree type)
2122 tree t = TYPE_FIELDS (type);
2123 while (t && TREE_CODE (t) != FIELD_DECL)
2128 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2129 by modifying the last node in chain 1 to point to chain 2.
2130 This is the Lisp primitive `nconc'. */
2133 chainon (tree op1, tree op2)
2142 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2144 TREE_CHAIN (t1) = op2;
2146 #ifdef ENABLE_TREE_CHECKING
2149 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2150 gcc_assert (t2 != t1);
2157 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2160 tree_last (tree chain)
2164 while ((next = TREE_CHAIN (chain)))
2169 /* Reverse the order of elements in the chain T,
2170 and return the new head of the chain (old last element). */
2175 tree prev = 0, decl, next;
2176 for (decl = t; decl; decl = next)
2178 /* We shouldn't be using this function to reverse BLOCK chains; we
2179 have blocks_nreverse for that. */
2180 gcc_checking_assert (TREE_CODE (decl) != BLOCK);
2181 next = TREE_CHAIN (decl);
2182 TREE_CHAIN (decl) = prev;
2188 /* Return a newly created TREE_LIST node whose
2189 purpose and value fields are PARM and VALUE. */
2192 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2194 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2195 TREE_PURPOSE (t) = parm;
2196 TREE_VALUE (t) = value;
2200 /* Build a chain of TREE_LIST nodes from a vector. */
2203 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2205 tree ret = NULL_TREE;
2209 FOR_EACH_VEC_ELT (tree, vec, i, t)
2211 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2212 pp = &TREE_CHAIN (*pp);
2217 /* Return a newly created TREE_LIST node whose
2218 purpose and value fields are PURPOSE and VALUE
2219 and whose TREE_CHAIN is CHAIN. */
2222 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2226 node = ggc_alloc_zone_tree_node_stat (&tree_zone, sizeof (struct tree_list)
2228 memset (node, 0, sizeof (struct tree_common));
2230 record_node_allocation_statistics (TREE_LIST, sizeof (struct tree_list));
2232 TREE_SET_CODE (node, TREE_LIST);
2233 TREE_CHAIN (node) = chain;
2234 TREE_PURPOSE (node) = purpose;
2235 TREE_VALUE (node) = value;
2239 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2243 ctor_to_vec (tree ctor)
2245 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2249 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2250 VEC_quick_push (tree, vec, val);
2255 /* Return the size nominally occupied by an object of type TYPE
2256 when it resides in memory. The value is measured in units of bytes,
2257 and its data type is that normally used for type sizes
2258 (which is the first type created by make_signed_type or
2259 make_unsigned_type). */
2262 size_in_bytes (const_tree type)
2266 if (type == error_mark_node)
2267 return integer_zero_node;
2269 type = TYPE_MAIN_VARIANT (type);
2270 t = TYPE_SIZE_UNIT (type);
2274 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2275 return size_zero_node;
2281 /* Return the size of TYPE (in bytes) as a wide integer
2282 or return -1 if the size can vary or is larger than an integer. */
2285 int_size_in_bytes (const_tree type)
2289 if (type == error_mark_node)
2292 type = TYPE_MAIN_VARIANT (type);
2293 t = TYPE_SIZE_UNIT (type);
2295 || TREE_CODE (t) != INTEGER_CST
2296 || TREE_INT_CST_HIGH (t) != 0
2297 /* If the result would appear negative, it's too big to represent. */
2298 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2301 return TREE_INT_CST_LOW (t);
2304 /* Return the maximum size of TYPE (in bytes) as a wide integer
2305 or return -1 if the size can vary or is larger than an integer. */
2308 max_int_size_in_bytes (const_tree type)
2310 HOST_WIDE_INT size = -1;
2313 /* If this is an array type, check for a possible MAX_SIZE attached. */
2315 if (TREE_CODE (type) == ARRAY_TYPE)
2317 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2319 if (size_tree && host_integerp (size_tree, 1))
2320 size = tree_low_cst (size_tree, 1);
2323 /* If we still haven't been able to get a size, see if the language
2324 can compute a maximum size. */
2328 size_tree = lang_hooks.types.max_size (type);
2330 if (size_tree && host_integerp (size_tree, 1))
2331 size = tree_low_cst (size_tree, 1);
2337 /* Returns a tree for the size of EXP in bytes. */
2340 tree_expr_size (const_tree exp)
2343 && DECL_SIZE_UNIT (exp) != 0)
2344 return DECL_SIZE_UNIT (exp);
2346 return size_in_bytes (TREE_TYPE (exp));
2349 /* Return the bit position of FIELD, in bits from the start of the record.
2350 This is a tree of type bitsizetype. */
2353 bit_position (const_tree field)
2355 return bit_from_pos (DECL_FIELD_OFFSET (field),
2356 DECL_FIELD_BIT_OFFSET (field));
2359 /* Likewise, but return as an integer. It must be representable in
2360 that way (since it could be a signed value, we don't have the
2361 option of returning -1 like int_size_in_byte can. */
2364 int_bit_position (const_tree field)
2366 return tree_low_cst (bit_position (field), 0);
2369 /* Return the byte position of FIELD, in bytes from the start of the record.
2370 This is a tree of type sizetype. */
2373 byte_position (const_tree field)
2375 return byte_from_pos (DECL_FIELD_OFFSET (field),
2376 DECL_FIELD_BIT_OFFSET (field));
2379 /* Likewise, but return as an integer. It must be representable in
2380 that way (since it could be a signed value, we don't have the
2381 option of returning -1 like int_size_in_byte can. */
2384 int_byte_position (const_tree field)
2386 return tree_low_cst (byte_position (field), 0);
2389 /* Return the strictest alignment, in bits, that T is known to have. */
2392 expr_align (const_tree t)
2394 unsigned int align0, align1;
2396 switch (TREE_CODE (t))
2398 CASE_CONVERT: case NON_LVALUE_EXPR:
2399 /* If we have conversions, we know that the alignment of the
2400 object must meet each of the alignments of the types. */
2401 align0 = expr_align (TREE_OPERAND (t, 0));
2402 align1 = TYPE_ALIGN (TREE_TYPE (t));
2403 return MAX (align0, align1);
2405 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2406 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2407 case CLEANUP_POINT_EXPR:
2408 /* These don't change the alignment of an object. */
2409 return expr_align (TREE_OPERAND (t, 0));
2412 /* The best we can do is say that the alignment is the least aligned
2414 align0 = expr_align (TREE_OPERAND (t, 1));
2415 align1 = expr_align (TREE_OPERAND (t, 2));
2416 return MIN (align0, align1);
2418 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2419 meaningfully, it's always 1. */
2420 case LABEL_DECL: case CONST_DECL:
2421 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2423 gcc_assert (DECL_ALIGN (t) != 0);
2424 return DECL_ALIGN (t);
2430 /* Otherwise take the alignment from that of the type. */
2431 return TYPE_ALIGN (TREE_TYPE (t));
2434 /* Return, as a tree node, the number of elements for TYPE (which is an
2435 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2438 array_type_nelts (const_tree type)
2440 tree index_type, min, max;
2442 /* If they did it with unspecified bounds, then we should have already
2443 given an error about it before we got here. */
2444 if (! TYPE_DOMAIN (type))
2445 return error_mark_node;
2447 index_type = TYPE_DOMAIN (type);
2448 min = TYPE_MIN_VALUE (index_type);
2449 max = TYPE_MAX_VALUE (index_type);
2451 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2453 return error_mark_node;
2455 return (integer_zerop (min)
2457 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2460 /* If arg is static -- a reference to an object in static storage -- then
2461 return the object. This is not the same as the C meaning of `static'.
2462 If arg isn't static, return NULL. */
2467 switch (TREE_CODE (arg))
2470 /* Nested functions are static, even though taking their address will
2471 involve a trampoline as we unnest the nested function and create
2472 the trampoline on the tree level. */
2476 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2477 && ! DECL_THREAD_LOCAL_P (arg)
2478 && ! DECL_DLLIMPORT_P (arg)
2482 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2486 return TREE_STATIC (arg) ? arg : NULL;
2493 /* If the thing being referenced is not a field, then it is
2494 something language specific. */
2495 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2497 /* If we are referencing a bitfield, we can't evaluate an
2498 ADDR_EXPR at compile time and so it isn't a constant. */
2499 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2502 return staticp (TREE_OPERAND (arg, 0));
2508 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2511 case ARRAY_RANGE_REF:
2512 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2513 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2514 return staticp (TREE_OPERAND (arg, 0));
2518 case COMPOUND_LITERAL_EXPR:
2519 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2529 /* Return whether OP is a DECL whose address is function-invariant. */
2532 decl_address_invariant_p (const_tree op)
2534 /* The conditions below are slightly less strict than the one in
2537 switch (TREE_CODE (op))
2546 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2547 || DECL_THREAD_LOCAL_P (op)
2548 || DECL_CONTEXT (op) == current_function_decl
2549 || decl_function_context (op) == current_function_decl)
2554 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2555 || decl_function_context (op) == current_function_decl)
2566 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2569 decl_address_ip_invariant_p (const_tree op)
2571 /* The conditions below are slightly less strict than the one in
2574 switch (TREE_CODE (op))
2582 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2583 && !DECL_DLLIMPORT_P (op))
2584 || DECL_THREAD_LOCAL_P (op))
2589 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2601 /* Return true if T is function-invariant (internal function, does
2602 not handle arithmetic; that's handled in skip_simple_arithmetic and
2603 tree_invariant_p). */
2605 static bool tree_invariant_p (tree t);
2608 tree_invariant_p_1 (tree t)
2612 if (TREE_CONSTANT (t)
2613 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2616 switch (TREE_CODE (t))
2622 op = TREE_OPERAND (t, 0);
2623 while (handled_component_p (op))
2625 switch (TREE_CODE (op))
2628 case ARRAY_RANGE_REF:
2629 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2630 || TREE_OPERAND (op, 2) != NULL_TREE
2631 || TREE_OPERAND (op, 3) != NULL_TREE)
2636 if (TREE_OPERAND (op, 2) != NULL_TREE)
2642 op = TREE_OPERAND (op, 0);
2645 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2654 /* Return true if T is function-invariant. */
2657 tree_invariant_p (tree t)
2659 tree inner = skip_simple_arithmetic (t);
2660 return tree_invariant_p_1 (inner);
2663 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2664 Do this to any expression which may be used in more than one place,
2665 but must be evaluated only once.
2667 Normally, expand_expr would reevaluate the expression each time.
2668 Calling save_expr produces something that is evaluated and recorded
2669 the first time expand_expr is called on it. Subsequent calls to
2670 expand_expr just reuse the recorded value.
2672 The call to expand_expr that generates code that actually computes
2673 the value is the first call *at compile time*. Subsequent calls
2674 *at compile time* generate code to use the saved value.
2675 This produces correct result provided that *at run time* control
2676 always flows through the insns made by the first expand_expr
2677 before reaching the other places where the save_expr was evaluated.
2678 You, the caller of save_expr, must make sure this is so.
2680 Constants, and certain read-only nodes, are returned with no
2681 SAVE_EXPR because that is safe. Expressions containing placeholders
2682 are not touched; see tree.def for an explanation of what these
2686 save_expr (tree expr)
2688 tree t = fold (expr);
2691 /* If the tree evaluates to a constant, then we don't want to hide that
2692 fact (i.e. this allows further folding, and direct checks for constants).
2693 However, a read-only object that has side effects cannot be bypassed.
2694 Since it is no problem to reevaluate literals, we just return the
2696 inner = skip_simple_arithmetic (t);
2697 if (TREE_CODE (inner) == ERROR_MARK)
2700 if (tree_invariant_p_1 (inner))
2703 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2704 it means that the size or offset of some field of an object depends on
2705 the value within another field.
2707 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2708 and some variable since it would then need to be both evaluated once and
2709 evaluated more than once. Front-ends must assure this case cannot
2710 happen by surrounding any such subexpressions in their own SAVE_EXPR
2711 and forcing evaluation at the proper time. */
2712 if (contains_placeholder_p (inner))
2715 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2716 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2718 /* This expression might be placed ahead of a jump to ensure that the
2719 value was computed on both sides of the jump. So make sure it isn't
2720 eliminated as dead. */
2721 TREE_SIDE_EFFECTS (t) = 1;
2725 /* Look inside EXPR and into any simple arithmetic operations. Return
2726 the innermost non-arithmetic node. */
2729 skip_simple_arithmetic (tree expr)
2733 /* We don't care about whether this can be used as an lvalue in this
2735 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2736 expr = TREE_OPERAND (expr, 0);
2738 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2739 a constant, it will be more efficient to not make another SAVE_EXPR since
2740 it will allow better simplification and GCSE will be able to merge the
2741 computations if they actually occur. */
2745 if (UNARY_CLASS_P (inner))
2746 inner = TREE_OPERAND (inner, 0);
2747 else if (BINARY_CLASS_P (inner))
2749 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2750 inner = TREE_OPERAND (inner, 0);
2751 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2752 inner = TREE_OPERAND (inner, 1);
2764 /* Return which tree structure is used by T. */
2766 enum tree_node_structure_enum
2767 tree_node_structure (const_tree t)
2769 const enum tree_code code = TREE_CODE (t);
2770 return tree_node_structure_for_code (code);
2773 /* Set various status flags when building a CALL_EXPR object T. */
2776 process_call_operands (tree t)
2778 bool side_effects = TREE_SIDE_EFFECTS (t);
2779 bool read_only = false;
2780 int i = call_expr_flags (t);
2782 /* Calls have side-effects, except those to const or pure functions. */
2783 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2784 side_effects = true;
2785 /* Propagate TREE_READONLY of arguments for const functions. */
2789 if (!side_effects || read_only)
2790 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2792 tree op = TREE_OPERAND (t, i);
2793 if (op && TREE_SIDE_EFFECTS (op))
2794 side_effects = true;
2795 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2799 TREE_SIDE_EFFECTS (t) = side_effects;
2800 TREE_READONLY (t) = read_only;
2803 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2804 size or offset that depends on a field within a record. */
2807 contains_placeholder_p (const_tree exp)
2809 enum tree_code code;
2814 code = TREE_CODE (exp);
2815 if (code == PLACEHOLDER_EXPR)
2818 switch (TREE_CODE_CLASS (code))
2821 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2822 position computations since they will be converted into a
2823 WITH_RECORD_EXPR involving the reference, which will assume
2824 here will be valid. */
2825 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2827 case tcc_exceptional:
2828 if (code == TREE_LIST)
2829 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2830 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2835 case tcc_comparison:
2836 case tcc_expression:
2840 /* Ignoring the first operand isn't quite right, but works best. */
2841 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2844 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2845 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2846 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2849 /* The save_expr function never wraps anything containing
2850 a PLACEHOLDER_EXPR. */
2857 switch (TREE_CODE_LENGTH (code))
2860 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2862 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2863 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2874 const_call_expr_arg_iterator iter;
2875 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2876 if (CONTAINS_PLACEHOLDER_P (arg))
2890 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2891 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2895 type_contains_placeholder_1 (const_tree type)
2897 /* If the size contains a placeholder or the parent type (component type in
2898 the case of arrays) type involves a placeholder, this type does. */
2899 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2900 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2901 || (!POINTER_TYPE_P (type)
2903 && type_contains_placeholder_p (TREE_TYPE (type))))
2906 /* Now do type-specific checks. Note that the last part of the check above
2907 greatly limits what we have to do below. */
2908 switch (TREE_CODE (type))
2916 case REFERENCE_TYPE:
2924 case FIXED_POINT_TYPE:
2925 /* Here we just check the bounds. */
2926 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2927 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2930 /* We have already checked the component type above, so just check the
2932 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2936 case QUAL_UNION_TYPE:
2940 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2941 if (TREE_CODE (field) == FIELD_DECL
2942 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2943 || (TREE_CODE (type) == QUAL_UNION_TYPE
2944 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2945 || type_contains_placeholder_p (TREE_TYPE (field))))
2956 /* Wrapper around above function used to cache its result. */
2959 type_contains_placeholder_p (tree type)
2963 /* If the contains_placeholder_bits field has been initialized,
2964 then we know the answer. */
2965 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2966 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2968 /* Indicate that we've seen this type node, and the answer is false.
2969 This is what we want to return if we run into recursion via fields. */
2970 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2972 /* Compute the real value. */
2973 result = type_contains_placeholder_1 (type);
2975 /* Store the real value. */
2976 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2981 /* Push tree EXP onto vector QUEUE if it is not already present. */
2984 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2989 FOR_EACH_VEC_ELT (tree, *queue, i, iter)
2990 if (simple_cst_equal (iter, exp) == 1)
2994 VEC_safe_push (tree, heap, *queue, exp);
2997 /* Given a tree EXP, find all occurences of references to fields
2998 in a PLACEHOLDER_EXPR and place them in vector REFS without
2999 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3000 we assume here that EXP contains only arithmetic expressions
3001 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3005 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
3007 enum tree_code code = TREE_CODE (exp);
3011 /* We handle TREE_LIST and COMPONENT_REF separately. */
3012 if (code == TREE_LIST)
3014 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
3015 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
3017 else if (code == COMPONENT_REF)
3019 for (inner = TREE_OPERAND (exp, 0);
3020 REFERENCE_CLASS_P (inner);
3021 inner = TREE_OPERAND (inner, 0))
3024 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
3025 push_without_duplicates (exp, refs);
3027 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
3030 switch (TREE_CODE_CLASS (code))
3035 case tcc_declaration:
3036 /* Variables allocated to static storage can stay. */
3037 if (!TREE_STATIC (exp))
3038 push_without_duplicates (exp, refs);
3041 case tcc_expression:
3042 /* This is the pattern built in ada/make_aligning_type. */
3043 if (code == ADDR_EXPR
3044 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
3046 push_without_duplicates (exp, refs);
3050 /* Fall through... */
3052 case tcc_exceptional:
3055 case tcc_comparison:
3057 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3058 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3062 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3063 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3071 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3072 return a tree with all occurrences of references to F in a
3073 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3074 CONST_DECLs. Note that we assume here that EXP contains only
3075 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3076 occurring only in their argument list. */
3079 substitute_in_expr (tree exp, tree f, tree r)
3081 enum tree_code code = TREE_CODE (exp);
3082 tree op0, op1, op2, op3;
3085 /* We handle TREE_LIST and COMPONENT_REF separately. */
3086 if (code == TREE_LIST)
3088 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3089 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3090 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3093 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3095 else if (code == COMPONENT_REF)
3099 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3100 and it is the right field, replace it with R. */
3101 for (inner = TREE_OPERAND (exp, 0);
3102 REFERENCE_CLASS_P (inner);
3103 inner = TREE_OPERAND (inner, 0))
3107 op1 = TREE_OPERAND (exp, 1);
3109 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3112 /* If this expression hasn't been completed let, leave it alone. */
3113 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3116 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3117 if (op0 == TREE_OPERAND (exp, 0))
3121 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3124 switch (TREE_CODE_CLASS (code))
3129 case tcc_declaration:
3135 case tcc_expression:
3139 /* Fall through... */
3141 case tcc_exceptional:
3144 case tcc_comparison:
3146 switch (TREE_CODE_LENGTH (code))
3152 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3153 if (op0 == TREE_OPERAND (exp, 0))
3156 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3160 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3161 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3163 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3166 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3170 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3171 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3172 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3174 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3175 && op2 == TREE_OPERAND (exp, 2))
3178 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3182 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3183 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3184 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3185 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3187 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3188 && op2 == TREE_OPERAND (exp, 2)
3189 && op3 == TREE_OPERAND (exp, 3))
3193 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3205 new_tree = NULL_TREE;
3207 /* If we are trying to replace F with a constant, inline back
3208 functions which do nothing else than computing a value from
3209 the arguments they are passed. This makes it possible to
3210 fold partially or entirely the replacement expression. */
3211 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3213 tree t = maybe_inline_call_in_expr (exp);
3215 return SUBSTITUTE_IN_EXPR (t, f, r);
3218 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3220 tree op = TREE_OPERAND (exp, i);
3221 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3225 new_tree = copy_node (exp);
3226 TREE_OPERAND (new_tree, i) = new_op;
3232 new_tree = fold (new_tree);
3233 if (TREE_CODE (new_tree) == CALL_EXPR)
3234 process_call_operands (new_tree);
3245 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3247 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3248 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3253 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3254 for it within OBJ, a tree that is an object or a chain of references. */
3257 substitute_placeholder_in_expr (tree exp, tree obj)
3259 enum tree_code code = TREE_CODE (exp);
3260 tree op0, op1, op2, op3;
3263 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3264 in the chain of OBJ. */
3265 if (code == PLACEHOLDER_EXPR)
3267 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3270 for (elt = obj; elt != 0;
3271 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3272 || TREE_CODE (elt) == COND_EXPR)
3273 ? TREE_OPERAND (elt, 1)
3274 : (REFERENCE_CLASS_P (elt)
3275 || UNARY_CLASS_P (elt)
3276 || BINARY_CLASS_P (elt)
3277 || VL_EXP_CLASS_P (elt)
3278 || EXPRESSION_CLASS_P (elt))
3279 ? TREE_OPERAND (elt, 0) : 0))
3280 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3283 for (elt = obj; elt != 0;
3284 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3285 || TREE_CODE (elt) == COND_EXPR)
3286 ? TREE_OPERAND (elt, 1)
3287 : (REFERENCE_CLASS_P (elt)
3288 || UNARY_CLASS_P (elt)
3289 || BINARY_CLASS_P (elt)
3290 || VL_EXP_CLASS_P (elt)
3291 || EXPRESSION_CLASS_P (elt))
3292 ? TREE_OPERAND (elt, 0) : 0))
3293 if (POINTER_TYPE_P (TREE_TYPE (elt))
3294 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3296 return fold_build1 (INDIRECT_REF, need_type, elt);
3298 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3299 survives until RTL generation, there will be an error. */
3303 /* TREE_LIST is special because we need to look at TREE_VALUE
3304 and TREE_CHAIN, not TREE_OPERANDS. */
3305 else if (code == TREE_LIST)
3307 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3308 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3309 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3312 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3315 switch (TREE_CODE_CLASS (code))
3318 case tcc_declaration:
3321 case tcc_exceptional:
3324 case tcc_comparison:
3325 case tcc_expression:
3328 switch (TREE_CODE_LENGTH (code))
3334 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3335 if (op0 == TREE_OPERAND (exp, 0))
3338 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3342 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3343 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3345 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3348 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3352 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3353 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3354 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3356 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3357 && op2 == TREE_OPERAND (exp, 2))
3360 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3364 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3365 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3366 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3367 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3369 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3370 && op2 == TREE_OPERAND (exp, 2)
3371 && op3 == TREE_OPERAND (exp, 3))
3375 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3387 new_tree = NULL_TREE;
3389 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3391 tree op = TREE_OPERAND (exp, i);
3392 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3396 new_tree = copy_node (exp);
3397 TREE_OPERAND (new_tree, i) = new_op;
3403 new_tree = fold (new_tree);
3404 if (TREE_CODE (new_tree) == CALL_EXPR)
3405 process_call_operands (new_tree);
3416 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3418 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3419 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3424 /* Stabilize a reference so that we can use it any number of times
3425 without causing its operands to be evaluated more than once.
3426 Returns the stabilized reference. This works by means of save_expr,
3427 so see the caveats in the comments about save_expr.
3429 Also allows conversion expressions whose operands are references.
3430 Any other kind of expression is returned unchanged. */
3433 stabilize_reference (tree ref)
3436 enum tree_code code = TREE_CODE (ref);
3443 /* No action is needed in this case. */
3448 case FIX_TRUNC_EXPR:
3449 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3453 result = build_nt (INDIRECT_REF,
3454 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3458 result = build_nt (COMPONENT_REF,
3459 stabilize_reference (TREE_OPERAND (ref, 0)),
3460 TREE_OPERAND (ref, 1), NULL_TREE);
3464 result = build_nt (BIT_FIELD_REF,
3465 stabilize_reference (TREE_OPERAND (ref, 0)),
3466 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3467 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3471 result = build_nt (ARRAY_REF,
3472 stabilize_reference (TREE_OPERAND (ref, 0)),
3473 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3474 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3477 case ARRAY_RANGE_REF:
3478 result = build_nt (ARRAY_RANGE_REF,
3479 stabilize_reference (TREE_OPERAND (ref, 0)),
3480 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3481 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3485 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3486 it wouldn't be ignored. This matters when dealing with
3488 return stabilize_reference_1 (ref);
3490 /* If arg isn't a kind of lvalue we recognize, make no change.
3491 Caller should recognize the error for an invalid lvalue. */
3496 return error_mark_node;
3499 TREE_TYPE (result) = TREE_TYPE (ref);
3500 TREE_READONLY (result) = TREE_READONLY (ref);
3501 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3502 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3507 /* Subroutine of stabilize_reference; this is called for subtrees of
3508 references. Any expression with side-effects must be put in a SAVE_EXPR
3509 to ensure that it is only evaluated once.
3511 We don't put SAVE_EXPR nodes around everything, because assigning very
3512 simple expressions to temporaries causes us to miss good opportunities
3513 for optimizations. Among other things, the opportunity to fold in the
3514 addition of a constant into an addressing mode often gets lost, e.g.
3515 "y[i+1] += x;". In general, we take the approach that we should not make
3516 an assignment unless we are forced into it - i.e., that any non-side effect
3517 operator should be allowed, and that cse should take care of coalescing
3518 multiple utterances of the same expression should that prove fruitful. */
3521 stabilize_reference_1 (tree e)
3524 enum tree_code code = TREE_CODE (e);
3526 /* We cannot ignore const expressions because it might be a reference
3527 to a const array but whose index contains side-effects. But we can
3528 ignore things that are actual constant or that already have been
3529 handled by this function. */
3531 if (tree_invariant_p (e))
3534 switch (TREE_CODE_CLASS (code))
3536 case tcc_exceptional:
3538 case tcc_declaration:
3539 case tcc_comparison:
3541 case tcc_expression:
3544 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3545 so that it will only be evaluated once. */
3546 /* The reference (r) and comparison (<) classes could be handled as
3547 below, but it is generally faster to only evaluate them once. */
3548 if (TREE_SIDE_EFFECTS (e))
3549 return save_expr (e);
3553 /* Constants need no processing. In fact, we should never reach
3558 /* Division is slow and tends to be compiled with jumps,
3559 especially the division by powers of 2 that is often
3560 found inside of an array reference. So do it just once. */
3561 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3562 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3563 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3564 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3565 return save_expr (e);
3566 /* Recursively stabilize each operand. */
3567 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3568 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3572 /* Recursively stabilize each operand. */
3573 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3580 TREE_TYPE (result) = TREE_TYPE (e);
3581 TREE_READONLY (result) = TREE_READONLY (e);
3582 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3583 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3588 /* Low-level constructors for expressions. */
3590 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3591 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3594 recompute_tree_invariant_for_addr_expr (tree t)
3597 bool tc = true, se = false;
3599 /* We started out assuming this address is both invariant and constant, but
3600 does not have side effects. Now go down any handled components and see if
3601 any of them involve offsets that are either non-constant or non-invariant.
3602 Also check for side-effects.
3604 ??? Note that this code makes no attempt to deal with the case where
3605 taking the address of something causes a copy due to misalignment. */
3607 #define UPDATE_FLAGS(NODE) \
3608 do { tree _node = (NODE); \
3609 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3610 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3612 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3613 node = TREE_OPERAND (node, 0))
3615 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3616 array reference (probably made temporarily by the G++ front end),
3617 so ignore all the operands. */
3618 if ((TREE_CODE (node) == ARRAY_REF
3619 || TREE_CODE (node) == ARRAY_RANGE_REF)
3620 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3622 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3623 if (TREE_OPERAND (node, 2))
3624 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3625 if (TREE_OPERAND (node, 3))
3626 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3628 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3629 FIELD_DECL, apparently. The G++ front end can put something else
3630 there, at least temporarily. */
3631 else if (TREE_CODE (node) == COMPONENT_REF
3632 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3634 if (TREE_OPERAND (node, 2))
3635 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3637 else if (TREE_CODE (node) == BIT_FIELD_REF)
3638 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3641 node = lang_hooks.expr_to_decl (node, &tc, &se);
3643 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3644 the address, since &(*a)->b is a form of addition. If it's a constant, the
3645 address is constant too. If it's a decl, its address is constant if the
3646 decl is static. Everything else is not constant and, furthermore,
3647 taking the address of a volatile variable is not volatile. */
3648 if (TREE_CODE (node) == INDIRECT_REF
3649 || TREE_CODE (node) == MEM_REF)
3650 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3651 else if (CONSTANT_CLASS_P (node))
3653 else if (DECL_P (node))
3654 tc &= (staticp (node) != NULL_TREE);
3658 se |= TREE_SIDE_EFFECTS (node);
3662 TREE_CONSTANT (t) = tc;
3663 TREE_SIDE_EFFECTS (t) = se;
3667 /* Build an expression of code CODE, data type TYPE, and operands as
3668 specified. Expressions and reference nodes can be created this way.
3669 Constants, decls, types and misc nodes cannot be.
3671 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3672 enough for all extant tree codes. */
3675 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3679 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3681 t = make_node_stat (code PASS_MEM_STAT);
3688 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3690 int length = sizeof (struct tree_exp);
3693 record_node_allocation_statistics (code, length);
3695 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3697 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
3699 memset (t, 0, sizeof (struct tree_common));
3701 TREE_SET_CODE (t, code);
3703 TREE_TYPE (t) = type;
3704 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3705 TREE_OPERAND (t, 0) = node;
3706 TREE_BLOCK (t) = NULL_TREE;
3707 if (node && !TYPE_P (node))
3709 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3710 TREE_READONLY (t) = TREE_READONLY (node);
3713 if (TREE_CODE_CLASS (code) == tcc_statement)
3714 TREE_SIDE_EFFECTS (t) = 1;
3718 /* All of these have side-effects, no matter what their
3720 TREE_SIDE_EFFECTS (t) = 1;
3721 TREE_READONLY (t) = 0;
3725 /* Whether a dereference is readonly has nothing to do with whether
3726 its operand is readonly. */
3727 TREE_READONLY (t) = 0;
3732 recompute_tree_invariant_for_addr_expr (t);
3736 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3737 && node && !TYPE_P (node)
3738 && TREE_CONSTANT (node))
3739 TREE_CONSTANT (t) = 1;
3740 if (TREE_CODE_CLASS (code) == tcc_reference
3741 && node && TREE_THIS_VOLATILE (node))
3742 TREE_THIS_VOLATILE (t) = 1;
3749 #define PROCESS_ARG(N) \
3751 TREE_OPERAND (t, N) = arg##N; \
3752 if (arg##N &&!TYPE_P (arg##N)) \
3754 if (TREE_SIDE_EFFECTS (arg##N)) \
3756 if (!TREE_READONLY (arg##N) \
3757 && !CONSTANT_CLASS_P (arg##N)) \
3758 (void) (read_only = 0); \
3759 if (!TREE_CONSTANT (arg##N)) \
3760 (void) (constant = 0); \
3765 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3767 bool constant, read_only, side_effects;
3770 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3772 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3773 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3774 /* When sizetype precision doesn't match that of pointers
3775 we need to be able to build explicit extensions or truncations
3776 of the offset argument. */
3777 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3778 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3779 && TREE_CODE (arg1) == INTEGER_CST);
3781 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3782 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3783 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3784 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3786 t = make_node_stat (code PASS_MEM_STAT);
3789 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3790 result based on those same flags for the arguments. But if the
3791 arguments aren't really even `tree' expressions, we shouldn't be trying
3794 /* Expressions without side effects may be constant if their
3795 arguments are as well. */
3796 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3797 || TREE_CODE_CLASS (code) == tcc_binary);
3799 side_effects = TREE_SIDE_EFFECTS (t);
3804 TREE_READONLY (t) = read_only;
3805 TREE_CONSTANT (t) = constant;
3806 TREE_SIDE_EFFECTS (t) = side_effects;
3807 TREE_THIS_VOLATILE (t)
3808 = (TREE_CODE_CLASS (code) == tcc_reference
3809 && arg0 && TREE_THIS_VOLATILE (arg0));
3816 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3817 tree arg2 MEM_STAT_DECL)
3819 bool constant, read_only, side_effects;
3822 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3823 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3825 t = make_node_stat (code PASS_MEM_STAT);
3830 /* As a special exception, if COND_EXPR has NULL branches, we
3831 assume that it is a gimple statement and always consider
3832 it to have side effects. */
3833 if (code == COND_EXPR
3834 && tt == void_type_node
3835 && arg1 == NULL_TREE
3836 && arg2 == NULL_TREE)
3837 side_effects = true;
3839 side_effects = TREE_SIDE_EFFECTS (t);
3845 if (code == COND_EXPR)
3846 TREE_READONLY (t) = read_only;
3848 TREE_SIDE_EFFECTS (t) = side_effects;
3849 TREE_THIS_VOLATILE (t)
3850 = (TREE_CODE_CLASS (code) == tcc_reference
3851 && arg0 && TREE_THIS_VOLATILE (arg0));
3857 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3858 tree arg2, tree arg3 MEM_STAT_DECL)
3860 bool constant, read_only, side_effects;
3863 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3865 t = make_node_stat (code PASS_MEM_STAT);
3868 side_effects = TREE_SIDE_EFFECTS (t);
3875 TREE_SIDE_EFFECTS (t) = side_effects;
3876 TREE_THIS_VOLATILE (t)
3877 = (TREE_CODE_CLASS (code) == tcc_reference
3878 && arg0 && TREE_THIS_VOLATILE (arg0));
3884 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3885 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3887 bool constant, read_only, side_effects;
3890 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3892 t = make_node_stat (code PASS_MEM_STAT);
3895 side_effects = TREE_SIDE_EFFECTS (t);
3903 TREE_SIDE_EFFECTS (t) = side_effects;
3904 TREE_THIS_VOLATILE (t)
3905 = (TREE_CODE_CLASS (code) == tcc_reference
3906 && arg0 && TREE_THIS_VOLATILE (arg0));
3912 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3913 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3915 bool constant, read_only, side_effects;
3918 gcc_assert (code == TARGET_MEM_REF);
3920 t = make_node_stat (code PASS_MEM_STAT);
3923 side_effects = TREE_SIDE_EFFECTS (t);
3930 if (code == TARGET_MEM_REF)
3934 TREE_SIDE_EFFECTS (t) = side_effects;
3935 TREE_THIS_VOLATILE (t)
3936 = (code == TARGET_MEM_REF
3937 && arg5 && TREE_THIS_VOLATILE (arg5));
3942 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3943 on the pointer PTR. */
3946 build_simple_mem_ref_loc (location_t loc, tree ptr)
3948 HOST_WIDE_INT offset = 0;
3949 tree ptype = TREE_TYPE (ptr);
3951 /* For convenience allow addresses that collapse to a simple base
3953 if (TREE_CODE (ptr) == ADDR_EXPR
3954 && (handled_component_p (TREE_OPERAND (ptr, 0))
3955 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
3957 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
3959 ptr = build_fold_addr_expr (ptr);
3960 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
3962 tem = build2 (MEM_REF, TREE_TYPE (ptype),
3963 ptr, build_int_cst (ptype, offset));
3964 SET_EXPR_LOCATION (tem, loc);
3968 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3971 mem_ref_offset (const_tree t)
3973 tree toff = TREE_OPERAND (t, 1);
3974 return double_int_sext (tree_to_double_int (toff),
3975 TYPE_PRECISION (TREE_TYPE (toff)));
3978 /* Return the pointer-type relevant for TBAA purposes from the
3979 gimple memory reference tree T. This is the type to be used for
3980 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3983 reference_alias_ptr_type (const_tree t)
3985 const_tree base = t;
3986 while (handled_component_p (base))
3987 base = TREE_OPERAND (base, 0);
3988 if (TREE_CODE (base) == MEM_REF)
3989 return TREE_TYPE (TREE_OPERAND (base, 1));
3990 else if (TREE_CODE (base) == TARGET_MEM_REF)
3991 return TREE_TYPE (TMR_OFFSET (base));
3993 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base)));
3996 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
3997 offsetted by OFFSET units. */
4000 build_invariant_address (tree type, tree base, HOST_WIDE_INT offset)
4002 tree ref = fold_build2 (MEM_REF, TREE_TYPE (type),
4003 build_fold_addr_expr (base),
4004 build_int_cst (ptr_type_node, offset));
4005 tree addr = build1 (ADDR_EXPR, type, ref);
4006 recompute_tree_invariant_for_addr_expr (addr);
4010 /* Similar except don't specify the TREE_TYPE
4011 and leave the TREE_SIDE_EFFECTS as 0.
4012 It is permissible for arguments to be null,
4013 or even garbage if their values do not matter. */
4016 build_nt (enum tree_code code, ...)
4023 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4027 t = make_node (code);
4028 length = TREE_CODE_LENGTH (code);
4030 for (i = 0; i < length; i++)
4031 TREE_OPERAND (t, i) = va_arg (p, tree);
4037 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4041 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
4046 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
4047 CALL_EXPR_FN (ret) = fn;
4048 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
4049 FOR_EACH_VEC_ELT (tree, args, ix, t)
4050 CALL_EXPR_ARG (ret, ix) = t;
4054 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4055 We do NOT enter this node in any sort of symbol table.
4057 LOC is the location of the decl.
4059 layout_decl is used to set up the decl's storage layout.
4060 Other slots are initialized to 0 or null pointers. */
4063 build_decl_stat (location_t loc, enum tree_code code, tree name,
4064 tree type MEM_STAT_DECL)
4068 t = make_node_stat (code PASS_MEM_STAT);
4069 DECL_SOURCE_LOCATION (t) = loc;
4071 /* if (type == error_mark_node)
4072 type = integer_type_node; */
4073 /* That is not done, deliberately, so that having error_mark_node
4074 as the type can suppress useless errors in the use of this variable. */
4076 DECL_NAME (t) = name;
4077 TREE_TYPE (t) = type;
4079 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4085 /* Builds and returns function declaration with NAME and TYPE. */
4088 build_fn_decl (const char *name, tree type)
4090 tree id = get_identifier (name);
4091 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4093 DECL_EXTERNAL (decl) = 1;
4094 TREE_PUBLIC (decl) = 1;
4095 DECL_ARTIFICIAL (decl) = 1;
4096 TREE_NOTHROW (decl) = 1;
4101 VEC(tree,gc) *all_translation_units;
4103 /* Builds a new translation-unit decl with name NAME, queues it in the
4104 global list of translation-unit decls and returns it. */
4107 build_translation_unit_decl (tree name)
4109 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4111 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4112 VEC_safe_push (tree, gc, all_translation_units, tu);
4117 /* BLOCK nodes are used to represent the structure of binding contours
4118 and declarations, once those contours have been exited and their contents
4119 compiled. This information is used for outputting debugging info. */
4122 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4124 tree block = make_node (BLOCK);
4126 BLOCK_VARS (block) = vars;
4127 BLOCK_SUBBLOCKS (block) = subblocks;
4128 BLOCK_SUPERCONTEXT (block) = supercontext;
4129 BLOCK_CHAIN (block) = chain;
4134 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4136 LOC is the location to use in tree T. */
4139 protected_set_expr_location (tree t, location_t loc)
4141 if (t && CAN_HAVE_LOCATION_P (t))
4142 SET_EXPR_LOCATION (t, loc);
4145 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4149 build_decl_attribute_variant (tree ddecl, tree attribute)
4151 DECL_ATTRIBUTES (ddecl) = attribute;
4155 /* Borrowed from hashtab.c iterative_hash implementation. */
4156 #define mix(a,b,c) \
4158 a -= b; a -= c; a ^= (c>>13); \
4159 b -= c; b -= a; b ^= (a<< 8); \
4160 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4161 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4162 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4163 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4164 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4165 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4166 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4170 /* Produce good hash value combining VAL and VAL2. */
4172 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4174 /* the golden ratio; an arbitrary value. */
4175 hashval_t a = 0x9e3779b9;
4181 /* Produce good hash value combining VAL and VAL2. */
4183 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4185 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4186 return iterative_hash_hashval_t (val, val2);
4189 hashval_t a = (hashval_t) val;
4190 /* Avoid warnings about shifting of more than the width of the type on
4191 hosts that won't execute this path. */
4193 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4195 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4197 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4198 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4205 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4206 is ATTRIBUTE and its qualifiers are QUALS.
4208 Record such modified types already made so we don't make duplicates. */
4211 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4213 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4215 hashval_t hashcode = 0;
4217 enum tree_code code = TREE_CODE (ttype);
4219 /* Building a distinct copy of a tagged type is inappropriate; it
4220 causes breakage in code that expects there to be a one-to-one
4221 relationship between a struct and its fields.
4222 build_duplicate_type is another solution (as used in
4223 handle_transparent_union_attribute), but that doesn't play well
4224 with the stronger C++ type identity model. */
4225 if (TREE_CODE (ttype) == RECORD_TYPE
4226 || TREE_CODE (ttype) == UNION_TYPE
4227 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4228 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4230 warning (OPT_Wattributes,
4231 "ignoring attributes applied to %qT after definition",
4232 TYPE_MAIN_VARIANT (ttype));
4233 return build_qualified_type (ttype, quals);
4236 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4237 ntype = build_distinct_type_copy (ttype);
4239 TYPE_ATTRIBUTES (ntype) = attribute;
4241 hashcode = iterative_hash_object (code, hashcode);
4242 if (TREE_TYPE (ntype))
4243 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4245 hashcode = attribute_hash_list (attribute, hashcode);
4247 switch (TREE_CODE (ntype))
4250 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4253 if (TYPE_DOMAIN (ntype))
4254 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4258 hashcode = iterative_hash_object
4259 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4260 hashcode = iterative_hash_object
4261 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4264 case FIXED_POINT_TYPE:
4266 unsigned int precision = TYPE_PRECISION (ntype);
4267 hashcode = iterative_hash_object (precision, hashcode);
4274 ntype = type_hash_canon (hashcode, ntype);
4276 /* If the target-dependent attributes make NTYPE different from
4277 its canonical type, we will need to use structural equality
4278 checks for this type. */
4279 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4280 || !comp_type_attributes (ntype, ttype))
4281 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4282 else if (TYPE_CANONICAL (ntype) == ntype)
4283 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4285 ttype = build_qualified_type (ntype, quals);
4287 else if (TYPE_QUALS (ttype) != quals)
4288 ttype = build_qualified_type (ttype, quals);
4293 /* Compare two attributes for their value identity. Return true if the
4294 attribute values are known to be equal; otherwise return false.
4298 attribute_value_equal (const_tree attr1, const_tree attr2)
4300 if (TREE_VALUE (attr1) == TREE_VALUE (attr2))
4303 if (TREE_VALUE (attr1) != NULL_TREE
4304 && TREE_CODE (TREE_VALUE (attr1)) == TREE_LIST
4305 && TREE_VALUE (attr2) != NULL
4306 && TREE_CODE (TREE_VALUE (attr2)) == TREE_LIST)
4307 return (simple_cst_list_equal (TREE_VALUE (attr1),
4308 TREE_VALUE (attr2)) == 1);
4310 return (simple_cst_equal (TREE_VALUE (attr1), TREE_VALUE (attr2)) == 1);
4313 /* Return 0 if the attributes for two types are incompatible, 1 if they
4314 are compatible, and 2 if they are nearly compatible (which causes a
4315 warning to be generated). */
4317 comp_type_attributes (const_tree type1, const_tree type2)
4319 const_tree a1 = TYPE_ATTRIBUTES (type1);
4320 const_tree a2 = TYPE_ATTRIBUTES (type2);
4325 for (a = a1; a != NULL_TREE; a = TREE_CHAIN (a))
4327 const struct attribute_spec *as;
4330 as = lookup_attribute_spec (TREE_PURPOSE (a));
4331 if (!as || as->affects_type_identity == false)
4334 attr = lookup_attribute (as->name, CONST_CAST_TREE (a2));
4335 if (!attr || !attribute_value_equal (a, attr))
4340 for (a = a2; a != NULL_TREE; a = TREE_CHAIN (a))
4342 const struct attribute_spec *as;
4344 as = lookup_attribute_spec (TREE_PURPOSE (a));
4345 if (!as || as->affects_type_identity == false)
4348 if (!lookup_attribute (as->name, CONST_CAST_TREE (a1)))
4350 /* We don't need to compare trees again, as we did this
4351 already in first loop. */
4353 /* All types - affecting identity - are equal, so
4354 there is no need to call target hook for comparison. */
4358 /* As some type combinations - like default calling-convention - might
4359 be compatible, we have to call the target hook to get the final result. */
4360 return targetm.comp_type_attributes (type1, type2);
4363 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4366 Record such modified types already made so we don't make duplicates. */
4369 build_type_attribute_variant (tree ttype, tree attribute)
4371 return build_type_attribute_qual_variant (ttype, attribute,
4372 TYPE_QUALS (ttype));
4376 /* Reset the expression *EXPR_P, a size or position.
4378 ??? We could reset all non-constant sizes or positions. But it's cheap
4379 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4381 We need to reset self-referential sizes or positions because they cannot
4382 be gimplified and thus can contain a CALL_EXPR after the gimplification
4383 is finished, which will run afoul of LTO streaming. And they need to be
4384 reset to something essentially dummy but not constant, so as to preserve
4385 the properties of the object they are attached to. */
4388 free_lang_data_in_one_sizepos (tree *expr_p)
4390 tree expr = *expr_p;
4391 if (CONTAINS_PLACEHOLDER_P (expr))
4392 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4396 /* Reset all the fields in a binfo node BINFO. We only keep
4397 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4400 free_lang_data_in_binfo (tree binfo)
4405 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4407 BINFO_VTABLE (binfo) = NULL_TREE;
4408 BINFO_BASE_ACCESSES (binfo) = NULL;
4409 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4410 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4412 FOR_EACH_VEC_ELT (tree, BINFO_BASE_BINFOS (binfo), i, t)
4413 free_lang_data_in_binfo (t);
4417 /* Reset all language specific information still present in TYPE. */
4420 free_lang_data_in_type (tree type)
4422 gcc_assert (TYPE_P (type));
4424 /* Give the FE a chance to remove its own data first. */
4425 lang_hooks.free_lang_data (type);
4427 TREE_LANG_FLAG_0 (type) = 0;
4428 TREE_LANG_FLAG_1 (type) = 0;
4429 TREE_LANG_FLAG_2 (type) = 0;
4430 TREE_LANG_FLAG_3 (type) = 0;
4431 TREE_LANG_FLAG_4 (type) = 0;
4432 TREE_LANG_FLAG_5 (type) = 0;
4433 TREE_LANG_FLAG_6 (type) = 0;
4435 if (TREE_CODE (type) == FUNCTION_TYPE)
4437 /* Remove the const and volatile qualifiers from arguments. The
4438 C++ front end removes them, but the C front end does not,
4439 leading to false ODR violation errors when merging two
4440 instances of the same function signature compiled by
4441 different front ends. */
4444 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4446 tree arg_type = TREE_VALUE (p);
4448 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4450 int quals = TYPE_QUALS (arg_type)
4452 & ~TYPE_QUAL_VOLATILE;
4453 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4454 free_lang_data_in_type (TREE_VALUE (p));
4459 /* Remove members that are not actually FIELD_DECLs from the field
4460 list of an aggregate. These occur in C++. */
4461 if (RECORD_OR_UNION_TYPE_P (type))
4465 /* Note that TYPE_FIELDS can be shared across distinct
4466 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4467 to be removed, we cannot set its TREE_CHAIN to NULL.
4468 Otherwise, we would not be able to find all the other fields
4469 in the other instances of this TREE_TYPE.
4471 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4473 member = TYPE_FIELDS (type);
4476 if (TREE_CODE (member) == FIELD_DECL)
4479 TREE_CHAIN (prev) = member;
4481 TYPE_FIELDS (type) = member;
4485 member = TREE_CHAIN (member);
4489 TREE_CHAIN (prev) = NULL_TREE;
4491 TYPE_FIELDS (type) = NULL_TREE;
4493 TYPE_METHODS (type) = NULL_TREE;
4494 if (TYPE_BINFO (type))
4495 free_lang_data_in_binfo (TYPE_BINFO (type));
4499 /* For non-aggregate types, clear out the language slot (which
4500 overloads TYPE_BINFO). */
4501 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4503 if (INTEGRAL_TYPE_P (type)
4504 || SCALAR_FLOAT_TYPE_P (type)
4505 || FIXED_POINT_TYPE_P (type))
4507 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4508 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4512 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4513 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4515 if (debug_info_level < DINFO_LEVEL_TERSE
4516 || (TYPE_CONTEXT (type)
4517 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4518 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4519 TYPE_CONTEXT (type) = NULL_TREE;
4521 if (debug_info_level < DINFO_LEVEL_TERSE)
4522 TYPE_STUB_DECL (type) = NULL_TREE;
4526 /* Return true if DECL may need an assembler name to be set. */
4529 need_assembler_name_p (tree decl)
4531 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4532 if (TREE_CODE (decl) != FUNCTION_DECL
4533 && TREE_CODE (decl) != VAR_DECL)
4536 /* If DECL already has its assembler name set, it does not need a
4538 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4539 || DECL_ASSEMBLER_NAME_SET_P (decl))
4542 /* Abstract decls do not need an assembler name. */
4543 if (DECL_ABSTRACT (decl))
4546 /* For VAR_DECLs, only static, public and external symbols need an
4548 if (TREE_CODE (decl) == VAR_DECL
4549 && !TREE_STATIC (decl)
4550 && !TREE_PUBLIC (decl)
4551 && !DECL_EXTERNAL (decl))
4554 if (TREE_CODE (decl) == FUNCTION_DECL)
4556 /* Do not set assembler name on builtins. Allow RTL expansion to
4557 decide whether to expand inline or via a regular call. */
4558 if (DECL_BUILT_IN (decl)
4559 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4562 /* Functions represented in the callgraph need an assembler name. */
4563 if (cgraph_get_node (decl) != NULL)
4566 /* Unused and not public functions don't need an assembler name. */
4567 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4575 /* Reset all language specific information still present in symbol
4579 free_lang_data_in_decl (tree decl)
4581 gcc_assert (DECL_P (decl));
4583 /* Give the FE a chance to remove its own data first. */
4584 lang_hooks.free_lang_data (decl);
4586 TREE_LANG_FLAG_0 (decl) = 0;
4587 TREE_LANG_FLAG_1 (decl) = 0;
4588 TREE_LANG_FLAG_2 (decl) = 0;
4589 TREE_LANG_FLAG_3 (decl) = 0;
4590 TREE_LANG_FLAG_4 (decl) = 0;
4591 TREE_LANG_FLAG_5 (decl) = 0;
4592 TREE_LANG_FLAG_6 (decl) = 0;
4594 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4595 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4596 if (TREE_CODE (decl) == FIELD_DECL)
4597 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4599 /* DECL_FCONTEXT is only used for debug info generation. */
4600 if (TREE_CODE (decl) == FIELD_DECL
4601 && debug_info_level < DINFO_LEVEL_TERSE)
4602 DECL_FCONTEXT (decl) = NULL_TREE;
4604 if (TREE_CODE (decl) == FUNCTION_DECL)
4606 if (gimple_has_body_p (decl))
4610 /* If DECL has a gimple body, then the context for its
4611 arguments must be DECL. Otherwise, it doesn't really
4612 matter, as we will not be emitting any code for DECL. In
4613 general, there may be other instances of DECL created by
4614 the front end and since PARM_DECLs are generally shared,
4615 their DECL_CONTEXT changes as the replicas of DECL are
4616 created. The only time where DECL_CONTEXT is important
4617 is for the FUNCTION_DECLs that have a gimple body (since
4618 the PARM_DECL will be used in the function's body). */
4619 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4620 DECL_CONTEXT (t) = decl;
4623 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4624 At this point, it is not needed anymore. */
4625 DECL_SAVED_TREE (decl) = NULL_TREE;
4627 /* Clear the abstract origin if it refers to a method. Otherwise
4628 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4629 origin will not be output correctly. */
4630 if (DECL_ABSTRACT_ORIGIN (decl)
4631 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))
4632 && RECORD_OR_UNION_TYPE_P
4633 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))))
4634 DECL_ABSTRACT_ORIGIN (decl) = NULL_TREE;
4636 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4637 DECL_VINDEX referring to itself into a vtable slot number as it
4638 should. Happens with functions that are copied and then forgotten
4639 about. Just clear it, it won't matter anymore. */
4640 if (DECL_VINDEX (decl) && !host_integerp (DECL_VINDEX (decl), 0))
4641 DECL_VINDEX (decl) = NULL_TREE;
4643 else if (TREE_CODE (decl) == VAR_DECL)
4645 if ((DECL_EXTERNAL (decl)
4646 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4647 || (decl_function_context (decl) && !TREE_STATIC (decl)))
4648 DECL_INITIAL (decl) = NULL_TREE;
4650 else if (TREE_CODE (decl) == TYPE_DECL)
4651 DECL_INITIAL (decl) = NULL_TREE;
4652 else if (TREE_CODE (decl) == TRANSLATION_UNIT_DECL
4653 && DECL_INITIAL (decl)
4654 && TREE_CODE (DECL_INITIAL (decl)) == BLOCK)
4656 /* Strip builtins from the translation-unit BLOCK. We still have
4657 targets without builtin_decl support and also builtins are
4658 shared nodes and thus we can't use TREE_CHAIN in multiple
4660 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
4664 if (TREE_CODE (var) == FUNCTION_DECL
4665 && DECL_BUILT_IN (var))
4666 *nextp = TREE_CHAIN (var);
4668 nextp = &TREE_CHAIN (var);
4674 /* Data used when collecting DECLs and TYPEs for language data removal. */
4676 struct free_lang_data_d
4678 /* Worklist to avoid excessive recursion. */
4679 VEC(tree,heap) *worklist;
4681 /* Set of traversed objects. Used to avoid duplicate visits. */
4682 struct pointer_set_t *pset;
4684 /* Array of symbols to process with free_lang_data_in_decl. */
4685 VEC(tree,heap) *decls;
4687 /* Array of types to process with free_lang_data_in_type. */
4688 VEC(tree,heap) *types;
4692 /* Save all language fields needed to generate proper debug information
4693 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4696 save_debug_info_for_decl (tree t)
4698 /*struct saved_debug_info_d *sdi;*/
4700 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4702 /* FIXME. Partial implementation for saving debug info removed. */
4706 /* Save all language fields needed to generate proper debug information
4707 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4710 save_debug_info_for_type (tree t)
4712 /*struct saved_debug_info_d *sdi;*/
4714 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4716 /* FIXME. Partial implementation for saving debug info removed. */
4720 /* Add type or decl T to one of the list of tree nodes that need their
4721 language data removed. The lists are held inside FLD. */
4724 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4728 VEC_safe_push (tree, heap, fld->decls, t);
4729 if (debug_info_level > DINFO_LEVEL_TERSE)
4730 save_debug_info_for_decl (t);
4732 else if (TYPE_P (t))
4734 VEC_safe_push (tree, heap, fld->types, t);
4735 if (debug_info_level > DINFO_LEVEL_TERSE)
4736 save_debug_info_for_type (t);
4742 /* Push tree node T into FLD->WORKLIST. */
4745 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4747 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4748 VEC_safe_push (tree, heap, fld->worklist, (t));
4752 /* Operand callback helper for free_lang_data_in_node. *TP is the
4753 subtree operand being considered. */
4756 find_decls_types_r (tree *tp, int *ws, void *data)
4759 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4761 if (TREE_CODE (t) == TREE_LIST)
4764 /* Language specific nodes will be removed, so there is no need
4765 to gather anything under them. */
4766 if (is_lang_specific (t))
4774 /* Note that walk_tree does not traverse every possible field in
4775 decls, so we have to do our own traversals here. */
4776 add_tree_to_fld_list (t, fld);
4778 fld_worklist_push (DECL_NAME (t), fld);
4779 fld_worklist_push (DECL_CONTEXT (t), fld);
4780 fld_worklist_push (DECL_SIZE (t), fld);
4781 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4783 /* We are going to remove everything under DECL_INITIAL for
4784 TYPE_DECLs. No point walking them. */
4785 if (TREE_CODE (t) != TYPE_DECL)
4786 fld_worklist_push (DECL_INITIAL (t), fld);
4788 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4789 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4791 if (TREE_CODE (t) == FUNCTION_DECL)
4793 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4794 fld_worklist_push (DECL_RESULT (t), fld);
4796 else if (TREE_CODE (t) == TYPE_DECL)
4798 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4799 fld_worklist_push (DECL_VINDEX (t), fld);
4801 else if (TREE_CODE (t) == FIELD_DECL)
4803 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4804 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4805 fld_worklist_push (DECL_QUALIFIER (t), fld);
4806 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4807 fld_worklist_push (DECL_FCONTEXT (t), fld);
4809 else if (TREE_CODE (t) == VAR_DECL)
4811 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4812 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4815 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4816 && DECL_HAS_VALUE_EXPR_P (t))
4817 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4819 if (TREE_CODE (t) != FIELD_DECL
4820 && TREE_CODE (t) != TYPE_DECL)
4821 fld_worklist_push (TREE_CHAIN (t), fld);
4824 else if (TYPE_P (t))
4826 /* Note that walk_tree does not traverse every possible field in
4827 types, so we have to do our own traversals here. */
4828 add_tree_to_fld_list (t, fld);
4830 if (!RECORD_OR_UNION_TYPE_P (t))
4831 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4832 fld_worklist_push (TYPE_SIZE (t), fld);
4833 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4834 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4835 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4836 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4837 fld_worklist_push (TYPE_NAME (t), fld);
4838 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4839 them and thus do not and want not to reach unused pointer types
4841 if (!POINTER_TYPE_P (t))
4842 fld_worklist_push (TYPE_MINVAL (t), fld);
4843 if (!RECORD_OR_UNION_TYPE_P (t))
4844 fld_worklist_push (TYPE_MAXVAL (t), fld);
4845 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4846 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4847 do not and want not to reach unused variants this way. */
4848 fld_worklist_push (TYPE_CONTEXT (t), fld);
4849 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4850 and want not to reach unused types this way. */
4852 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4856 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4858 fld_worklist_push (TREE_TYPE (tem), fld);
4859 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4861 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4862 && TREE_CODE (tem) == TREE_LIST)
4865 fld_worklist_push (TREE_VALUE (tem), fld);
4866 tem = TREE_CHAIN (tem);
4870 if (RECORD_OR_UNION_TYPE_P (t))
4873 /* Push all TYPE_FIELDS - there can be interleaving interesting
4874 and non-interesting things. */
4875 tem = TYPE_FIELDS (t);
4878 if (TREE_CODE (tem) == FIELD_DECL)
4879 fld_worklist_push (tem, fld);
4880 tem = TREE_CHAIN (tem);
4884 fld_worklist_push (TREE_CHAIN (t), fld);
4887 else if (TREE_CODE (t) == BLOCK)
4890 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4891 fld_worklist_push (tem, fld);
4892 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4893 fld_worklist_push (tem, fld);
4894 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4897 if (TREE_CODE (t) != IDENTIFIER_NODE
4898 && CODE_CONTAINS_STRUCT (TREE_CODE (t), TS_TYPED))
4899 fld_worklist_push (TREE_TYPE (t), fld);
4905 /* Find decls and types in T. */
4908 find_decls_types (tree t, struct free_lang_data_d *fld)
4912 if (!pointer_set_contains (fld->pset, t))
4913 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4914 if (VEC_empty (tree, fld->worklist))
4916 t = VEC_pop (tree, fld->worklist);
4920 /* Translate all the types in LIST with the corresponding runtime
4924 get_eh_types_for_runtime (tree list)
4928 if (list == NULL_TREE)
4931 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4933 list = TREE_CHAIN (list);
4936 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4937 TREE_CHAIN (prev) = n;
4938 prev = TREE_CHAIN (prev);
4939 list = TREE_CHAIN (list);
4946 /* Find decls and types referenced in EH region R and store them in
4947 FLD->DECLS and FLD->TYPES. */
4950 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4961 /* The types referenced in each catch must first be changed to the
4962 EH types used at runtime. This removes references to FE types
4964 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4966 c->type_list = get_eh_types_for_runtime (c->type_list);
4967 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4972 case ERT_ALLOWED_EXCEPTIONS:
4973 r->u.allowed.type_list
4974 = get_eh_types_for_runtime (r->u.allowed.type_list);
4975 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4978 case ERT_MUST_NOT_THROW:
4979 walk_tree (&r->u.must_not_throw.failure_decl,
4980 find_decls_types_r, fld, fld->pset);
4986 /* Find decls and types referenced in cgraph node N and store them in
4987 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4988 look for *every* kind of DECL and TYPE node reachable from N,
4989 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4990 NAMESPACE_DECLs, etc). */
4993 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4996 struct function *fn;
5000 find_decls_types (n->decl, fld);
5002 if (!gimple_has_body_p (n->decl))
5005 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
5007 fn = DECL_STRUCT_FUNCTION (n->decl);
5009 /* Traverse locals. */
5010 FOR_EACH_LOCAL_DECL (fn, ix, t)
5011 find_decls_types (t, fld);
5013 /* Traverse EH regions in FN. */
5016 FOR_ALL_EH_REGION_FN (r, fn)
5017 find_decls_types_in_eh_region (r, fld);
5020 /* Traverse every statement in FN. */
5021 FOR_EACH_BB_FN (bb, fn)
5023 gimple_stmt_iterator si;
5026 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
5028 gimple phi = gsi_stmt (si);
5030 for (i = 0; i < gimple_phi_num_args (phi); i++)
5032 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
5033 find_decls_types (*arg_p, fld);
5037 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5039 gimple stmt = gsi_stmt (si);
5041 for (i = 0; i < gimple_num_ops (stmt); i++)
5043 tree arg = gimple_op (stmt, i);
5044 find_decls_types (arg, fld);
5051 /* Find decls and types referenced in varpool node N and store them in
5052 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5053 look for *every* kind of DECL and TYPE node reachable from N,
5054 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5055 NAMESPACE_DECLs, etc). */
5058 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
5060 find_decls_types (v->decl, fld);
5063 /* If T needs an assembler name, have one created for it. */
5066 assign_assembler_name_if_neeeded (tree t)
5068 if (need_assembler_name_p (t))
5070 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5071 diagnostics that use input_location to show locus
5072 information. The problem here is that, at this point,
5073 input_location is generally anchored to the end of the file
5074 (since the parser is long gone), so we don't have a good
5075 position to pin it to.
5077 To alleviate this problem, this uses the location of T's
5078 declaration. Examples of this are
5079 testsuite/g++.dg/template/cond2.C and
5080 testsuite/g++.dg/template/pr35240.C. */
5081 location_t saved_location = input_location;
5082 input_location = DECL_SOURCE_LOCATION (t);
5084 decl_assembler_name (t);
5086 input_location = saved_location;
5091 /* Free language specific information for every operand and expression
5092 in every node of the call graph. This process operates in three stages:
5094 1- Every callgraph node and varpool node is traversed looking for
5095 decls and types embedded in them. This is a more exhaustive
5096 search than that done by find_referenced_vars, because it will
5097 also collect individual fields, decls embedded in types, etc.
5099 2- All the decls found are sent to free_lang_data_in_decl.
5101 3- All the types found are sent to free_lang_data_in_type.
5103 The ordering between decls and types is important because
5104 free_lang_data_in_decl sets assembler names, which includes
5105 mangling. So types cannot be freed up until assembler names have
5109 free_lang_data_in_cgraph (void)
5111 struct cgraph_node *n;
5112 struct varpool_node *v;
5113 struct free_lang_data_d fld;
5118 /* Initialize sets and arrays to store referenced decls and types. */
5119 fld.pset = pointer_set_create ();
5120 fld.worklist = NULL;
5121 fld.decls = VEC_alloc (tree, heap, 100);
5122 fld.types = VEC_alloc (tree, heap, 100);
5124 /* Find decls and types in the body of every function in the callgraph. */
5125 for (n = cgraph_nodes; n; n = n->next)
5126 find_decls_types_in_node (n, &fld);
5128 FOR_EACH_VEC_ELT (alias_pair, alias_pairs, i, p)
5129 find_decls_types (p->decl, &fld);
5131 /* Find decls and types in every varpool symbol. */
5132 for (v = varpool_nodes; v; v = v->next)
5133 find_decls_types_in_var (v, &fld);
5135 /* Set the assembler name on every decl found. We need to do this
5136 now because free_lang_data_in_decl will invalidate data needed
5137 for mangling. This breaks mangling on interdependent decls. */
5138 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5139 assign_assembler_name_if_neeeded (t);
5141 /* Traverse every decl found freeing its language data. */
5142 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5143 free_lang_data_in_decl (t);
5145 /* Traverse every type found freeing its language data. */
5146 FOR_EACH_VEC_ELT (tree, fld.types, i, t)
5147 free_lang_data_in_type (t);
5149 pointer_set_destroy (fld.pset);
5150 VEC_free (tree, heap, fld.worklist);
5151 VEC_free (tree, heap, fld.decls);
5152 VEC_free (tree, heap, fld.types);
5156 /* Free resources that are used by FE but are not needed once they are done. */
5159 free_lang_data (void)
5163 /* If we are the LTO frontend we have freed lang-specific data already. */
5165 || !flag_generate_lto)
5168 /* Allocate and assign alias sets to the standard integer types
5169 while the slots are still in the way the frontends generated them. */
5170 for (i = 0; i < itk_none; ++i)
5171 if (integer_types[i])
5172 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5174 /* Traverse the IL resetting language specific information for
5175 operands, expressions, etc. */
5176 free_lang_data_in_cgraph ();
5178 /* Create gimple variants for common types. */
5179 ptrdiff_type_node = integer_type_node;
5180 fileptr_type_node = ptr_type_node;
5182 /* Reset some langhooks. Do not reset types_compatible_p, it may
5183 still be used indirectly via the get_alias_set langhook. */
5184 lang_hooks.callgraph.analyze_expr = NULL;
5185 lang_hooks.dwarf_name = lhd_dwarf_name;
5186 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5187 /* We do not want the default decl_assembler_name implementation,
5188 rather if we have fixed everything we want a wrapper around it
5189 asserting that all non-local symbols already got their assembler
5190 name and only produce assembler names for local symbols. Or rather
5191 make sure we never call decl_assembler_name on local symbols and
5192 devise a separate, middle-end private scheme for it. */
5194 /* Reset diagnostic machinery. */
5195 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5196 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5197 diagnostic_format_decoder (global_dc) = default_tree_printer;
5203 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5207 "*free_lang_data", /* name */
5209 free_lang_data, /* execute */
5212 0, /* static_pass_number */
5213 TV_IPA_FREE_LANG_DATA, /* tv_id */
5214 0, /* properties_required */
5215 0, /* properties_provided */
5216 0, /* properties_destroyed */
5217 0, /* todo_flags_start */
5218 TODO_ggc_collect /* todo_flags_finish */
5222 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5223 ATTR_NAME. Also used internally by remove_attribute(). */
5225 private_is_attribute_p (const char *attr_name, size_t attr_len, const_tree ident)
5227 size_t ident_len = IDENTIFIER_LENGTH (ident);
5229 if (ident_len == attr_len)
5231 if (strcmp (attr_name, IDENTIFIER_POINTER (ident)) == 0)
5234 else if (ident_len == attr_len + 4)
5236 /* There is the possibility that ATTR is 'text' and IDENT is
5238 const char *p = IDENTIFIER_POINTER (ident);
5239 if (p[0] == '_' && p[1] == '_'
5240 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5241 && strncmp (attr_name, p + 2, attr_len) == 0)
5248 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5249 of ATTR_NAME, and LIST is not NULL_TREE. */
5251 private_lookup_attribute (const char *attr_name, size_t attr_len, tree list)
5255 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5257 if (ident_len == attr_len)
5259 if (strcmp (attr_name, IDENTIFIER_POINTER (TREE_PURPOSE (list))) == 0)
5262 /* TODO: If we made sure that attributes were stored in the
5263 canonical form without '__...__' (ie, as in 'text' as opposed
5264 to '__text__') then we could avoid the following case. */
5265 else if (ident_len == attr_len + 4)
5267 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5268 if (p[0] == '_' && p[1] == '_'
5269 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5270 && strncmp (attr_name, p + 2, attr_len) == 0)
5273 list = TREE_CHAIN (list);
5279 /* A variant of lookup_attribute() that can be used with an identifier
5280 as the first argument, and where the identifier can be either
5281 'text' or '__text__'.
5283 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5284 return a pointer to the attribute's list element if the attribute
5285 is part of the list, or NULL_TREE if not found. If the attribute
5286 appears more than once, this only returns the first occurrence; the
5287 TREE_CHAIN of the return value should be passed back in if further
5288 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5289 can be in the form 'text' or '__text__'. */
5291 lookup_ident_attribute (tree attr_identifier, tree list)
5293 gcc_checking_assert (TREE_CODE (attr_identifier) == IDENTIFIER_NODE);
5297 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list)) == IDENTIFIER_NODE);
5299 /* Identifiers can be compared directly for equality. */
5300 if (attr_identifier == TREE_PURPOSE (list))
5303 /* If they are not equal, they may still be one in the form
5304 'text' while the other one is in the form '__text__'. TODO:
5305 If we were storing attributes in normalized 'text' form, then
5306 this could all go away and we could take full advantage of
5307 the fact that we're comparing identifiers. :-) */
5309 size_t attr_len = IDENTIFIER_LENGTH (attr_identifier);
5310 size_t ident_len = IDENTIFIER_LENGTH (TREE_PURPOSE (list));
5312 if (ident_len == attr_len + 4)
5314 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5315 const char *q = IDENTIFIER_POINTER (attr_identifier);
5316 if (p[0] == '_' && p[1] == '_'
5317 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5318 && strncmp (q, p + 2, attr_len) == 0)
5321 else if (ident_len + 4 == attr_len)
5323 const char *p = IDENTIFIER_POINTER (TREE_PURPOSE (list));
5324 const char *q = IDENTIFIER_POINTER (attr_identifier);
5325 if (q[0] == '_' && q[1] == '_'
5326 && q[attr_len - 2] == '_' && q[attr_len - 1] == '_'
5327 && strncmp (q + 2, p, ident_len) == 0)
5331 list = TREE_CHAIN (list);
5337 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5341 remove_attribute (const char *attr_name, tree list)
5344 size_t attr_len = strlen (attr_name);
5346 gcc_checking_assert (attr_name[0] != '_');
5348 for (p = &list; *p; )
5351 /* TODO: If we were storing attributes in normalized form, here
5352 we could use a simple strcmp(). */
5353 if (private_is_attribute_p (attr_name, attr_len, TREE_PURPOSE (l)))
5354 *p = TREE_CHAIN (l);
5356 p = &TREE_CHAIN (l);
5362 /* Return an attribute list that is the union of a1 and a2. */
5365 merge_attributes (tree a1, tree a2)
5369 /* Either one unset? Take the set one. */
5371 if ((attributes = a1) == 0)
5374 /* One that completely contains the other? Take it. */
5376 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5378 if (attribute_list_contained (a2, a1))
5382 /* Pick the longest list, and hang on the other list. */
5384 if (list_length (a1) < list_length (a2))
5385 attributes = a2, a2 = a1;
5387 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5390 for (a = lookup_ident_attribute (TREE_PURPOSE (a2), attributes);
5391 a != NULL_TREE && !attribute_value_equal (a, a2);
5392 a = lookup_ident_attribute (TREE_PURPOSE (a2), TREE_CHAIN (a)))
5396 a1 = copy_node (a2);
5397 TREE_CHAIN (a1) = attributes;
5406 /* Given types T1 and T2, merge their attributes and return
5410 merge_type_attributes (tree t1, tree t2)
5412 return merge_attributes (TYPE_ATTRIBUTES (t1),
5413 TYPE_ATTRIBUTES (t2));
5416 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5420 merge_decl_attributes (tree olddecl, tree newdecl)
5422 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5423 DECL_ATTRIBUTES (newdecl));
5426 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5428 /* Specialization of merge_decl_attributes for various Windows targets.
5430 This handles the following situation:
5432 __declspec (dllimport) int foo;
5435 The second instance of `foo' nullifies the dllimport. */
5438 merge_dllimport_decl_attributes (tree old, tree new_tree)
5441 int delete_dllimport_p = 1;
5443 /* What we need to do here is remove from `old' dllimport if it doesn't
5444 appear in `new'. dllimport behaves like extern: if a declaration is
5445 marked dllimport and a definition appears later, then the object
5446 is not dllimport'd. We also remove a `new' dllimport if the old list
5447 contains dllexport: dllexport always overrides dllimport, regardless
5448 of the order of declaration. */
5449 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5450 delete_dllimport_p = 0;
5451 else if (DECL_DLLIMPORT_P (new_tree)
5452 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5454 DECL_DLLIMPORT_P (new_tree) = 0;
5455 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5456 "dllimport ignored", new_tree);
5458 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5460 /* Warn about overriding a symbol that has already been used, e.g.:
5461 extern int __attribute__ ((dllimport)) foo;
5462 int* bar () {return &foo;}
5465 if (TREE_USED (old))
5467 warning (0, "%q+D redeclared without dllimport attribute "
5468 "after being referenced with dll linkage", new_tree);
5469 /* If we have used a variable's address with dllimport linkage,
5470 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5471 decl may already have had TREE_CONSTANT computed.
5472 We still remove the attribute so that assembler code refers
5473 to '&foo rather than '_imp__foo'. */
5474 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5475 DECL_DLLIMPORT_P (new_tree) = 1;
5478 /* Let an inline definition silently override the external reference,
5479 but otherwise warn about attribute inconsistency. */
5480 else if (TREE_CODE (new_tree) == VAR_DECL
5481 || !DECL_DECLARED_INLINE_P (new_tree))
5482 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5483 "previous dllimport ignored", new_tree);
5486 delete_dllimport_p = 0;
5488 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5490 if (delete_dllimport_p)
5491 a = remove_attribute ("dllimport", a);
5496 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5497 struct attribute_spec.handler. */
5500 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5506 /* These attributes may apply to structure and union types being created,
5507 but otherwise should pass to the declaration involved. */
5510 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5511 | (int) ATTR_FLAG_ARRAY_NEXT))
5513 *no_add_attrs = true;
5514 return tree_cons (name, args, NULL_TREE);
5516 if (TREE_CODE (node) == RECORD_TYPE
5517 || TREE_CODE (node) == UNION_TYPE)
5519 node = TYPE_NAME (node);
5525 warning (OPT_Wattributes, "%qE attribute ignored",
5527 *no_add_attrs = true;
5532 if (TREE_CODE (node) != FUNCTION_DECL
5533 && TREE_CODE (node) != VAR_DECL
5534 && TREE_CODE (node) != TYPE_DECL)
5536 *no_add_attrs = true;
5537 warning (OPT_Wattributes, "%qE attribute ignored",
5542 if (TREE_CODE (node) == TYPE_DECL
5543 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5544 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5546 *no_add_attrs = true;
5547 warning (OPT_Wattributes, "%qE attribute ignored",
5552 is_dllimport = is_attribute_p ("dllimport", name);
5554 /* Report error on dllimport ambiguities seen now before they cause
5558 /* Honor any target-specific overrides. */
5559 if (!targetm.valid_dllimport_attribute_p (node))
5560 *no_add_attrs = true;
5562 else if (TREE_CODE (node) == FUNCTION_DECL
5563 && DECL_DECLARED_INLINE_P (node))
5565 warning (OPT_Wattributes, "inline function %q+D declared as "
5566 " dllimport: attribute ignored", node);
5567 *no_add_attrs = true;
5569 /* Like MS, treat definition of dllimported variables and
5570 non-inlined functions on declaration as syntax errors. */
5571 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5573 error ("function %q+D definition is marked dllimport", node);
5574 *no_add_attrs = true;
5577 else if (TREE_CODE (node) == VAR_DECL)
5579 if (DECL_INITIAL (node))
5581 error ("variable %q+D definition is marked dllimport",
5583 *no_add_attrs = true;
5586 /* `extern' needn't be specified with dllimport.
5587 Specify `extern' now and hope for the best. Sigh. */
5588 DECL_EXTERNAL (node) = 1;
5589 /* Also, implicitly give dllimport'd variables declared within
5590 a function global scope, unless declared static. */
5591 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5592 TREE_PUBLIC (node) = 1;
5595 if (*no_add_attrs == false)
5596 DECL_DLLIMPORT_P (node) = 1;
5598 else if (TREE_CODE (node) == FUNCTION_DECL
5599 && DECL_DECLARED_INLINE_P (node)
5600 && flag_keep_inline_dllexport)
5601 /* An exported function, even if inline, must be emitted. */
5602 DECL_EXTERNAL (node) = 0;
5604 /* Report error if symbol is not accessible at global scope. */
5605 if (!TREE_PUBLIC (node)
5606 && (TREE_CODE (node) == VAR_DECL
5607 || TREE_CODE (node) == FUNCTION_DECL))
5609 error ("external linkage required for symbol %q+D because of "
5610 "%qE attribute", node, name);
5611 *no_add_attrs = true;
5614 /* A dllexport'd entity must have default visibility so that other
5615 program units (shared libraries or the main executable) can see
5616 it. A dllimport'd entity must have default visibility so that
5617 the linker knows that undefined references within this program
5618 unit can be resolved by the dynamic linker. */
5621 if (DECL_VISIBILITY_SPECIFIED (node)
5622 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5623 error ("%qE implies default visibility, but %qD has already "
5624 "been declared with a different visibility",
5626 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5627 DECL_VISIBILITY_SPECIFIED (node) = 1;
5633 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5635 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5636 of the various TYPE_QUAL values. */
5639 set_type_quals (tree type, int type_quals)
5641 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5642 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5643 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5644 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5647 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5650 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5652 return (TYPE_QUALS (cand) == type_quals
5653 && TYPE_NAME (cand) == TYPE_NAME (base)
5654 /* Apparently this is needed for Objective-C. */
5655 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5656 /* Check alignment. */
5657 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
5658 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5659 TYPE_ATTRIBUTES (base)));
5662 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5665 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
5667 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
5668 && TYPE_NAME (cand) == TYPE_NAME (base)
5669 /* Apparently this is needed for Objective-C. */
5670 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5671 /* Check alignment. */
5672 && TYPE_ALIGN (cand) == align
5673 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5674 TYPE_ATTRIBUTES (base)));
5677 /* Return a version of the TYPE, qualified as indicated by the
5678 TYPE_QUALS, if one exists. If no qualified version exists yet,
5679 return NULL_TREE. */
5682 get_qualified_type (tree type, int type_quals)
5686 if (TYPE_QUALS (type) == type_quals)
5689 /* Search the chain of variants to see if there is already one there just
5690 like the one we need to have. If so, use that existing one. We must
5691 preserve the TYPE_NAME, since there is code that depends on this. */
5692 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5693 if (check_qualified_type (t, type, type_quals))
5699 /* Like get_qualified_type, but creates the type if it does not
5700 exist. This function never returns NULL_TREE. */
5703 build_qualified_type (tree type, int type_quals)
5707 /* See if we already have the appropriate qualified variant. */
5708 t = get_qualified_type (type, type_quals);
5710 /* If not, build it. */
5713 t = build_variant_type_copy (type);
5714 set_type_quals (t, type_quals);
5716 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5717 /* Propagate structural equality. */
5718 SET_TYPE_STRUCTURAL_EQUALITY (t);
5719 else if (TYPE_CANONICAL (type) != type)
5720 /* Build the underlying canonical type, since it is different
5722 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5725 /* T is its own canonical type. */
5726 TYPE_CANONICAL (t) = t;
5733 /* Create a variant of type T with alignment ALIGN. */
5736 build_aligned_type (tree type, unsigned int align)
5740 if (TYPE_PACKED (type)
5741 || TYPE_ALIGN (type) == align)
5744 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5745 if (check_aligned_type (t, type, align))
5748 t = build_variant_type_copy (type);
5749 TYPE_ALIGN (t) = align;
5754 /* Create a new distinct copy of TYPE. The new type is made its own
5755 MAIN_VARIANT. If TYPE requires structural equality checks, the
5756 resulting type requires structural equality checks; otherwise, its
5757 TYPE_CANONICAL points to itself. */
5760 build_distinct_type_copy (tree type)
5762 tree t = copy_node (type);
5764 TYPE_POINTER_TO (t) = 0;
5765 TYPE_REFERENCE_TO (t) = 0;
5767 /* Set the canonical type either to a new equivalence class, or
5768 propagate the need for structural equality checks. */
5769 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5770 SET_TYPE_STRUCTURAL_EQUALITY (t);
5772 TYPE_CANONICAL (t) = t;
5774 /* Make it its own variant. */
5775 TYPE_MAIN_VARIANT (t) = t;
5776 TYPE_NEXT_VARIANT (t) = 0;
5778 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5779 whose TREE_TYPE is not t. This can also happen in the Ada
5780 frontend when using subtypes. */
5785 /* Create a new variant of TYPE, equivalent but distinct. This is so
5786 the caller can modify it. TYPE_CANONICAL for the return type will
5787 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5788 are considered equal by the language itself (or that both types
5789 require structural equality checks). */
5792 build_variant_type_copy (tree type)
5794 tree t, m = TYPE_MAIN_VARIANT (type);
5796 t = build_distinct_type_copy (type);
5798 /* Since we're building a variant, assume that it is a non-semantic
5799 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5800 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5802 /* Add the new type to the chain of variants of TYPE. */
5803 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5804 TYPE_NEXT_VARIANT (m) = t;
5805 TYPE_MAIN_VARIANT (t) = m;
5810 /* Return true if the from tree in both tree maps are equal. */
5813 tree_map_base_eq (const void *va, const void *vb)
5815 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5816 *const b = (const struct tree_map_base *) vb;
5817 return (a->from == b->from);
5820 /* Hash a from tree in a tree_base_map. */
5823 tree_map_base_hash (const void *item)
5825 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5828 /* Return true if this tree map structure is marked for garbage collection
5829 purposes. We simply return true if the from tree is marked, so that this
5830 structure goes away when the from tree goes away. */
5833 tree_map_base_marked_p (const void *p)
5835 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5838 /* Hash a from tree in a tree_map. */
5841 tree_map_hash (const void *item)
5843 return (((const struct tree_map *) item)->hash);
5846 /* Hash a from tree in a tree_decl_map. */
5849 tree_decl_map_hash (const void *item)
5851 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
5854 /* Return the initialization priority for DECL. */
5857 decl_init_priority_lookup (tree decl)
5859 struct tree_priority_map *h;
5860 struct tree_map_base in;
5862 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5864 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5865 return h ? h->init : DEFAULT_INIT_PRIORITY;
5868 /* Return the finalization priority for DECL. */
5871 decl_fini_priority_lookup (tree decl)
5873 struct tree_priority_map *h;
5874 struct tree_map_base in;
5876 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5878 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5879 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5882 /* Return the initialization and finalization priority information for
5883 DECL. If there is no previous priority information, a freshly
5884 allocated structure is returned. */
5886 static struct tree_priority_map *
5887 decl_priority_info (tree decl)
5889 struct tree_priority_map in;
5890 struct tree_priority_map *h;
5893 in.base.from = decl;
5894 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5895 h = (struct tree_priority_map *) *loc;
5898 h = ggc_alloc_cleared_tree_priority_map ();
5900 h->base.from = decl;
5901 h->init = DEFAULT_INIT_PRIORITY;
5902 h->fini = DEFAULT_INIT_PRIORITY;
5908 /* Set the initialization priority for DECL to PRIORITY. */
5911 decl_init_priority_insert (tree decl, priority_type priority)
5913 struct tree_priority_map *h;
5915 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5916 if (priority == DEFAULT_INIT_PRIORITY)
5918 h = decl_priority_info (decl);
5922 /* Set the finalization priority for DECL to PRIORITY. */
5925 decl_fini_priority_insert (tree decl, priority_type priority)
5927 struct tree_priority_map *h;
5929 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5930 if (priority == DEFAULT_INIT_PRIORITY)
5932 h = decl_priority_info (decl);
5936 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5939 print_debug_expr_statistics (void)
5941 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5942 (long) htab_size (debug_expr_for_decl),
5943 (long) htab_elements (debug_expr_for_decl),
5944 htab_collisions (debug_expr_for_decl));
5947 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5950 print_value_expr_statistics (void)
5952 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5953 (long) htab_size (value_expr_for_decl),
5954 (long) htab_elements (value_expr_for_decl),
5955 htab_collisions (value_expr_for_decl));
5958 /* Lookup a debug expression for FROM, and return it if we find one. */
5961 decl_debug_expr_lookup (tree from)
5963 struct tree_decl_map *h, in;
5964 in.base.from = from;
5966 h = (struct tree_decl_map *)
5967 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
5973 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5976 decl_debug_expr_insert (tree from, tree to)
5978 struct tree_decl_map *h;
5981 h = ggc_alloc_tree_decl_map ();
5982 h->base.from = from;
5984 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
5986 *(struct tree_decl_map **) loc = h;
5989 /* Lookup a value expression for FROM, and return it if we find one. */
5992 decl_value_expr_lookup (tree from)
5994 struct tree_decl_map *h, in;
5995 in.base.from = from;
5997 h = (struct tree_decl_map *)
5998 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
6004 /* Insert a mapping FROM->TO in the value expression hashtable. */
6007 decl_value_expr_insert (tree from, tree to)
6009 struct tree_decl_map *h;
6012 h = ggc_alloc_tree_decl_map ();
6013 h->base.from = from;
6015 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
6017 *(struct tree_decl_map **) loc = h;
6020 /* Lookup a vector of debug arguments for FROM, and return it if we
6024 decl_debug_args_lookup (tree from)
6026 struct tree_vec_map *h, in;
6028 if (!DECL_HAS_DEBUG_ARGS_P (from))
6030 gcc_checking_assert (debug_args_for_decl != NULL);
6031 in.base.from = from;
6032 h = (struct tree_vec_map *)
6033 htab_find_with_hash (debug_args_for_decl, &in, DECL_UID (from));
6039 /* Insert a mapping FROM->empty vector of debug arguments in the value
6040 expression hashtable. */
6043 decl_debug_args_insert (tree from)
6045 struct tree_vec_map *h;
6048 if (DECL_HAS_DEBUG_ARGS_P (from))
6049 return decl_debug_args_lookup (from);
6050 if (debug_args_for_decl == NULL)
6051 debug_args_for_decl = htab_create_ggc (64, tree_vec_map_hash,
6052 tree_vec_map_eq, 0);
6053 h = ggc_alloc_tree_vec_map ();
6054 h->base.from = from;
6056 loc = htab_find_slot_with_hash (debug_args_for_decl, h, DECL_UID (from),
6058 *(struct tree_vec_map **) loc = h;
6059 DECL_HAS_DEBUG_ARGS_P (from) = 1;
6063 /* Hashing of types so that we don't make duplicates.
6064 The entry point is `type_hash_canon'. */
6066 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6067 with types in the TREE_VALUE slots), by adding the hash codes
6068 of the individual types. */
6071 type_hash_list (const_tree list, hashval_t hashcode)
6075 for (tail = list; tail; tail = TREE_CHAIN (tail))
6076 if (TREE_VALUE (tail) != error_mark_node)
6077 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
6083 /* These are the Hashtable callback functions. */
6085 /* Returns true iff the types are equivalent. */
6088 type_hash_eq (const void *va, const void *vb)
6090 const struct type_hash *const a = (const struct type_hash *) va,
6091 *const b = (const struct type_hash *) vb;
6093 /* First test the things that are the same for all types. */
6094 if (a->hash != b->hash
6095 || TREE_CODE (a->type) != TREE_CODE (b->type)
6096 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
6097 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
6098 TYPE_ATTRIBUTES (b->type))
6099 || (TREE_CODE (a->type) != COMPLEX_TYPE
6100 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
6103 /* Be careful about comparing arrays before and after the element type
6104 has been completed; don't compare TYPE_ALIGN unless both types are
6106 if (COMPLETE_TYPE_P (a->type) && COMPLETE_TYPE_P (b->type)
6107 && (TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
6108 || TYPE_MODE (a->type) != TYPE_MODE (b->type)))
6111 switch (TREE_CODE (a->type))
6116 case REFERENCE_TYPE:
6120 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
6123 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
6124 && !(TYPE_VALUES (a->type)
6125 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
6126 && TYPE_VALUES (b->type)
6127 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
6128 && type_list_equal (TYPE_VALUES (a->type),
6129 TYPE_VALUES (b->type))))
6132 /* ... fall through ... */
6137 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
6138 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
6139 TYPE_MAX_VALUE (b->type)))
6140 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
6141 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
6142 TYPE_MIN_VALUE (b->type))));
6144 case FIXED_POINT_TYPE:
6145 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
6148 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
6151 if (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
6152 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6153 || (TYPE_ARG_TYPES (a->type)
6154 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6155 && TYPE_ARG_TYPES (b->type)
6156 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6157 && type_list_equal (TYPE_ARG_TYPES (a->type),
6158 TYPE_ARG_TYPES (b->type)))))
6162 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
6166 case QUAL_UNION_TYPE:
6167 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
6168 || (TYPE_FIELDS (a->type)
6169 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
6170 && TYPE_FIELDS (b->type)
6171 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
6172 && type_list_equal (TYPE_FIELDS (a->type),
6173 TYPE_FIELDS (b->type))));
6176 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6177 || (TYPE_ARG_TYPES (a->type)
6178 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6179 && TYPE_ARG_TYPES (b->type)
6180 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6181 && type_list_equal (TYPE_ARG_TYPES (a->type),
6182 TYPE_ARG_TYPES (b->type))))
6190 if (lang_hooks.types.type_hash_eq != NULL)
6191 return lang_hooks.types.type_hash_eq (a->type, b->type);
6196 /* Return the cached hash value. */
6199 type_hash_hash (const void *item)
6201 return ((const struct type_hash *) item)->hash;
6204 /* Look in the type hash table for a type isomorphic to TYPE.
6205 If one is found, return it. Otherwise return 0. */
6208 type_hash_lookup (hashval_t hashcode, tree type)
6210 struct type_hash *h, in;
6212 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6213 must call that routine before comparing TYPE_ALIGNs. */
6219 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6226 /* Add an entry to the type-hash-table
6227 for a type TYPE whose hash code is HASHCODE. */
6230 type_hash_add (hashval_t hashcode, tree type)
6232 struct type_hash *h;
6235 h = ggc_alloc_type_hash ();
6238 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6242 /* Given TYPE, and HASHCODE its hash code, return the canonical
6243 object for an identical type if one already exists.
6244 Otherwise, return TYPE, and record it as the canonical object.
6246 To use this function, first create a type of the sort you want.
6247 Then compute its hash code from the fields of the type that
6248 make it different from other similar types.
6249 Then call this function and use the value. */
6252 type_hash_canon (unsigned int hashcode, tree type)
6256 /* The hash table only contains main variants, so ensure that's what we're
6258 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6260 /* See if the type is in the hash table already. If so, return it.
6261 Otherwise, add the type. */
6262 t1 = type_hash_lookup (hashcode, type);
6265 #ifdef GATHER_STATISTICS
6266 tree_code_counts[(int) TREE_CODE (type)]--;
6267 tree_node_counts[(int) t_kind]--;
6268 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type_non_common);
6274 type_hash_add (hashcode, type);
6279 /* See if the data pointed to by the type hash table is marked. We consider
6280 it marked if the type is marked or if a debug type number or symbol
6281 table entry has been made for the type. */
6284 type_hash_marked_p (const void *p)
6286 const_tree const type = ((const struct type_hash *) p)->type;
6288 return ggc_marked_p (type);
6292 print_type_hash_statistics (void)
6294 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6295 (long) htab_size (type_hash_table),
6296 (long) htab_elements (type_hash_table),
6297 htab_collisions (type_hash_table));
6300 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6301 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6302 by adding the hash codes of the individual attributes. */
6305 attribute_hash_list (const_tree list, hashval_t hashcode)
6309 for (tail = list; tail; tail = TREE_CHAIN (tail))
6310 /* ??? Do we want to add in TREE_VALUE too? */
6311 hashcode = iterative_hash_object
6312 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6316 /* Given two lists of attributes, return true if list l2 is
6317 equivalent to l1. */
6320 attribute_list_equal (const_tree l1, const_tree l2)
6325 return attribute_list_contained (l1, l2)
6326 && attribute_list_contained (l2, l1);
6329 /* Given two lists of attributes, return true if list L2 is
6330 completely contained within L1. */
6331 /* ??? This would be faster if attribute names were stored in a canonicalized
6332 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6333 must be used to show these elements are equivalent (which they are). */
6334 /* ??? It's not clear that attributes with arguments will always be handled
6338 attribute_list_contained (const_tree l1, const_tree l2)
6342 /* First check the obvious, maybe the lists are identical. */
6346 /* Maybe the lists are similar. */
6347 for (t1 = l1, t2 = l2;
6349 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6350 && TREE_VALUE (t1) == TREE_VALUE (t2);
6351 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6354 /* Maybe the lists are equal. */
6355 if (t1 == 0 && t2 == 0)
6358 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6361 /* This CONST_CAST is okay because lookup_attribute does not
6362 modify its argument and the return value is assigned to a
6364 for (attr = lookup_ident_attribute (TREE_PURPOSE (t2), CONST_CAST_TREE(l1));
6365 attr != NULL_TREE && !attribute_value_equal (t2, attr);
6366 attr = lookup_ident_attribute (TREE_PURPOSE (t2), TREE_CHAIN (attr)))
6369 if (attr == NULL_TREE)
6376 /* Given two lists of types
6377 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6378 return 1 if the lists contain the same types in the same order.
6379 Also, the TREE_PURPOSEs must match. */
6382 type_list_equal (const_tree l1, const_tree l2)
6386 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6387 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6388 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6389 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6390 && (TREE_TYPE (TREE_PURPOSE (t1))
6391 == TREE_TYPE (TREE_PURPOSE (t2))))))
6397 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6398 given by TYPE. If the argument list accepts variable arguments,
6399 then this function counts only the ordinary arguments. */
6402 type_num_arguments (const_tree type)
6407 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6408 /* If the function does not take a variable number of arguments,
6409 the last element in the list will have type `void'. */
6410 if (VOID_TYPE_P (TREE_VALUE (t)))
6418 /* Nonzero if integer constants T1 and T2
6419 represent the same constant value. */
6422 tree_int_cst_equal (const_tree t1, const_tree t2)
6427 if (t1 == 0 || t2 == 0)
6430 if (TREE_CODE (t1) == INTEGER_CST
6431 && TREE_CODE (t2) == INTEGER_CST
6432 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6433 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6439 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6440 The precise way of comparison depends on their data type. */
6443 tree_int_cst_lt (const_tree t1, const_tree t2)
6448 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6450 int t1_sgn = tree_int_cst_sgn (t1);
6451 int t2_sgn = tree_int_cst_sgn (t2);
6453 if (t1_sgn < t2_sgn)
6455 else if (t1_sgn > t2_sgn)
6457 /* Otherwise, both are non-negative, so we compare them as
6458 unsigned just in case one of them would overflow a signed
6461 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6462 return INT_CST_LT (t1, t2);
6464 return INT_CST_LT_UNSIGNED (t1, t2);
6467 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6470 tree_int_cst_compare (const_tree t1, const_tree t2)
6472 if (tree_int_cst_lt (t1, t2))
6474 else if (tree_int_cst_lt (t2, t1))
6480 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6481 the host. If POS is zero, the value can be represented in a single
6482 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6483 be represented in a single unsigned HOST_WIDE_INT. */
6486 host_integerp (const_tree t, int pos)
6491 return (TREE_CODE (t) == INTEGER_CST
6492 && ((TREE_INT_CST_HIGH (t) == 0
6493 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6494 || (! pos && TREE_INT_CST_HIGH (t) == -1
6495 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6496 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6497 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6498 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6499 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6502 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6503 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6504 be non-negative. We must be able to satisfy the above conditions. */
6507 tree_low_cst (const_tree t, int pos)
6509 gcc_assert (host_integerp (t, pos));
6510 return TREE_INT_CST_LOW (t);
6513 /* Return the most significant bit of the integer constant T. */
6516 tree_int_cst_msb (const_tree t)
6520 unsigned HOST_WIDE_INT l;
6522 /* Note that using TYPE_PRECISION here is wrong. We care about the
6523 actual bits, not the (arbitrary) range of the type. */
6524 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6525 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6526 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6527 return (l & 1) == 1;
6530 /* Return an indication of the sign of the integer constant T.
6531 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6532 Note that -1 will never be returned if T's type is unsigned. */
6535 tree_int_cst_sgn (const_tree t)
6537 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6539 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6541 else if (TREE_INT_CST_HIGH (t) < 0)
6547 /* Return the minimum number of bits needed to represent VALUE in a
6548 signed or unsigned type, UNSIGNEDP says which. */
6551 tree_int_cst_min_precision (tree value, bool unsignedp)
6555 /* If the value is negative, compute its negative minus 1. The latter
6556 adjustment is because the absolute value of the largest negative value
6557 is one larger than the largest positive value. This is equivalent to
6558 a bit-wise negation, so use that operation instead. */
6560 if (tree_int_cst_sgn (value) < 0)
6561 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6563 /* Return the number of bits needed, taking into account the fact
6564 that we need one more bit for a signed than unsigned type. */
6566 if (integer_zerop (value))
6569 log = tree_floor_log2 (value);
6571 return log + 1 + !unsignedp;
6574 /* Compare two constructor-element-type constants. Return 1 if the lists
6575 are known to be equal; otherwise return 0. */
6578 simple_cst_list_equal (const_tree l1, const_tree l2)
6580 while (l1 != NULL_TREE && l2 != NULL_TREE)
6582 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6585 l1 = TREE_CHAIN (l1);
6586 l2 = TREE_CHAIN (l2);
6592 /* Return truthvalue of whether T1 is the same tree structure as T2.
6593 Return 1 if they are the same.
6594 Return 0 if they are understandably different.
6595 Return -1 if either contains tree structure not understood by
6599 simple_cst_equal (const_tree t1, const_tree t2)
6601 enum tree_code code1, code2;
6607 if (t1 == 0 || t2 == 0)
6610 code1 = TREE_CODE (t1);
6611 code2 = TREE_CODE (t2);
6613 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6615 if (CONVERT_EXPR_CODE_P (code2)
6616 || code2 == NON_LVALUE_EXPR)
6617 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6619 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6622 else if (CONVERT_EXPR_CODE_P (code2)
6623 || code2 == NON_LVALUE_EXPR)
6624 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6632 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6633 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6636 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6639 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6642 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6643 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6644 TREE_STRING_LENGTH (t1)));
6648 unsigned HOST_WIDE_INT idx;
6649 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6650 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6652 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6655 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6656 /* ??? Should we handle also fields here? */
6657 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6658 VEC_index (constructor_elt, v2, idx)->value))
6664 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6667 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6670 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6673 const_tree arg1, arg2;
6674 const_call_expr_arg_iterator iter1, iter2;
6675 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6676 arg2 = first_const_call_expr_arg (t2, &iter2);
6678 arg1 = next_const_call_expr_arg (&iter1),
6679 arg2 = next_const_call_expr_arg (&iter2))
6681 cmp = simple_cst_equal (arg1, arg2);
6685 return arg1 == arg2;
6689 /* Special case: if either target is an unallocated VAR_DECL,
6690 it means that it's going to be unified with whatever the
6691 TARGET_EXPR is really supposed to initialize, so treat it
6692 as being equivalent to anything. */
6693 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6694 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6695 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6696 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6697 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6698 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6701 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6706 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6708 case WITH_CLEANUP_EXPR:
6709 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6713 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6716 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6717 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6731 /* This general rule works for most tree codes. All exceptions should be
6732 handled above. If this is a language-specific tree code, we can't
6733 trust what might be in the operand, so say we don't know
6735 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6738 switch (TREE_CODE_CLASS (code1))
6742 case tcc_comparison:
6743 case tcc_expression:
6747 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6749 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6761 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6762 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6763 than U, respectively. */
6766 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6768 if (tree_int_cst_sgn (t) < 0)
6770 else if (TREE_INT_CST_HIGH (t) != 0)
6772 else if (TREE_INT_CST_LOW (t) == u)
6774 else if (TREE_INT_CST_LOW (t) < u)
6780 /* Return true if CODE represents an associative tree code. Otherwise
6783 associative_tree_code (enum tree_code code)
6802 /* Return true if CODE represents a commutative tree code. Otherwise
6805 commutative_tree_code (enum tree_code code)
6818 case UNORDERED_EXPR:
6822 case TRUTH_AND_EXPR:
6823 case TRUTH_XOR_EXPR:
6833 /* Return true if CODE represents a ternary tree code for which the
6834 first two operands are commutative. Otherwise return false. */
6836 commutative_ternary_tree_code (enum tree_code code)
6840 case WIDEN_MULT_PLUS_EXPR:
6841 case WIDEN_MULT_MINUS_EXPR:
6850 /* Generate a hash value for an expression. This can be used iteratively
6851 by passing a previous result as the VAL argument.
6853 This function is intended to produce the same hash for expressions which
6854 would compare equal using operand_equal_p. */
6857 iterative_hash_expr (const_tree t, hashval_t val)
6860 enum tree_code code;
6864 return iterative_hash_hashval_t (0, val);
6866 code = TREE_CODE (t);
6870 /* Alas, constants aren't shared, so we can't rely on pointer
6873 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6874 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6877 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6879 return iterative_hash_hashval_t (val2, val);
6883 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6885 return iterative_hash_hashval_t (val2, val);
6888 return iterative_hash (TREE_STRING_POINTER (t),
6889 TREE_STRING_LENGTH (t), val);
6891 val = iterative_hash_expr (TREE_REALPART (t), val);
6892 return iterative_hash_expr (TREE_IMAGPART (t), val);
6894 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6896 /* We can just compare by pointer. */
6897 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6898 case PLACEHOLDER_EXPR:
6899 /* The node itself doesn't matter. */
6902 /* A list of expressions, for a CALL_EXPR or as the elements of a
6904 for (; t; t = TREE_CHAIN (t))
6905 val = iterative_hash_expr (TREE_VALUE (t), val);
6909 unsigned HOST_WIDE_INT idx;
6911 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6913 val = iterative_hash_expr (field, val);
6914 val = iterative_hash_expr (value, val);
6920 /* The type of the second operand is relevant, except for
6921 its top-level qualifiers. */
6922 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t, 1)));
6924 val = iterative_hash_object (TYPE_HASH (type), val);
6926 /* We could use the standard hash computation from this point
6928 val = iterative_hash_object (code, val);
6929 val = iterative_hash_expr (TREE_OPERAND (t, 1), val);
6930 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6934 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6935 Otherwise nodes that compare equal according to operand_equal_p might
6936 get different hash codes. However, don't do this for machine specific
6937 or front end builtins, since the function code is overloaded in those
6939 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6940 && built_in_decls[DECL_FUNCTION_CODE (t)])
6942 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6943 code = TREE_CODE (t);
6947 tclass = TREE_CODE_CLASS (code);
6949 if (tclass == tcc_declaration)
6951 /* DECL's have a unique ID */
6952 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6956 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6958 val = iterative_hash_object (code, val);
6960 /* Don't hash the type, that can lead to having nodes which
6961 compare equal according to operand_equal_p, but which
6962 have different hash codes. */
6963 if (CONVERT_EXPR_CODE_P (code)
6964 || code == NON_LVALUE_EXPR)
6966 /* Make sure to include signness in the hash computation. */
6967 val += TYPE_UNSIGNED (TREE_TYPE (t));
6968 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6971 else if (commutative_tree_code (code))
6973 /* It's a commutative expression. We want to hash it the same
6974 however it appears. We do this by first hashing both operands
6975 and then rehashing based on the order of their independent
6977 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6978 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6982 t = one, one = two, two = t;
6984 val = iterative_hash_hashval_t (one, val);
6985 val = iterative_hash_hashval_t (two, val);
6988 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6989 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6996 /* Generate a hash value for a pair of expressions. This can be used
6997 iteratively by passing a previous result as the VAL argument.
6999 The same hash value is always returned for a given pair of expressions,
7000 regardless of the order in which they are presented. This is useful in
7001 hashing the operands of commutative functions. */
7004 iterative_hash_exprs_commutative (const_tree t1,
7005 const_tree t2, hashval_t val)
7007 hashval_t one = iterative_hash_expr (t1, 0);
7008 hashval_t two = iterative_hash_expr (t2, 0);
7012 t = one, one = two, two = t;
7013 val = iterative_hash_hashval_t (one, val);
7014 val = iterative_hash_hashval_t (two, val);
7019 /* Constructors for pointer, array and function types.
7020 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7021 constructed by language-dependent code, not here.) */
7023 /* Construct, lay out and return the type of pointers to TO_TYPE with
7024 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7025 reference all of memory. If such a type has already been
7026 constructed, reuse it. */
7029 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
7034 if (to_type == error_mark_node)
7035 return error_mark_node;
7037 /* If the pointed-to type has the may_alias attribute set, force
7038 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7039 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7040 can_alias_all = true;
7042 /* In some cases, languages will have things that aren't a POINTER_TYPE
7043 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7044 In that case, return that type without regard to the rest of our
7047 ??? This is a kludge, but consistent with the way this function has
7048 always operated and there doesn't seem to be a good way to avoid this
7050 if (TYPE_POINTER_TO (to_type) != 0
7051 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
7052 return TYPE_POINTER_TO (to_type);
7054 /* First, if we already have a type for pointers to TO_TYPE and it's
7055 the proper mode, use it. */
7056 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
7057 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7060 t = make_node (POINTER_TYPE);
7062 TREE_TYPE (t) = to_type;
7063 SET_TYPE_MODE (t, mode);
7064 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7065 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
7066 TYPE_POINTER_TO (to_type) = t;
7068 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7069 SET_TYPE_STRUCTURAL_EQUALITY (t);
7070 else if (TYPE_CANONICAL (to_type) != to_type)
7072 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
7073 mode, can_alias_all);
7075 /* Lay out the type. This function has many callers that are concerned
7076 with expression-construction, and this simplifies them all. */
7082 /* By default build pointers in ptr_mode. */
7085 build_pointer_type (tree to_type)
7087 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7088 : TYPE_ADDR_SPACE (to_type);
7089 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7090 return build_pointer_type_for_mode (to_type, pointer_mode, false);
7093 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7096 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
7101 if (to_type == error_mark_node)
7102 return error_mark_node;
7104 /* If the pointed-to type has the may_alias attribute set, force
7105 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7106 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7107 can_alias_all = true;
7109 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7110 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7111 In that case, return that type without regard to the rest of our
7114 ??? This is a kludge, but consistent with the way this function has
7115 always operated and there doesn't seem to be a good way to avoid this
7117 if (TYPE_REFERENCE_TO (to_type) != 0
7118 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7119 return TYPE_REFERENCE_TO (to_type);
7121 /* First, if we already have a type for pointers to TO_TYPE and it's
7122 the proper mode, use it. */
7123 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7124 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7127 t = make_node (REFERENCE_TYPE);
7129 TREE_TYPE (t) = to_type;
7130 SET_TYPE_MODE (t, mode);
7131 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7132 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7133 TYPE_REFERENCE_TO (to_type) = t;
7135 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7136 SET_TYPE_STRUCTURAL_EQUALITY (t);
7137 else if (TYPE_CANONICAL (to_type) != to_type)
7139 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7140 mode, can_alias_all);
7148 /* Build the node for the type of references-to-TO_TYPE by default
7152 build_reference_type (tree to_type)
7154 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7155 : TYPE_ADDR_SPACE (to_type);
7156 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7157 return build_reference_type_for_mode (to_type, pointer_mode, false);
7160 /* Build a type that is compatible with t but has no cv quals anywhere
7163 const char *const *const * -> char ***. */
7166 build_type_no_quals (tree t)
7168 switch (TREE_CODE (t))
7171 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7173 TYPE_REF_CAN_ALIAS_ALL (t));
7174 case REFERENCE_TYPE:
7176 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7178 TYPE_REF_CAN_ALIAS_ALL (t));
7180 return TYPE_MAIN_VARIANT (t);
7184 #define MAX_INT_CACHED_PREC \
7185 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7186 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7188 /* Builds a signed or unsigned integer type of precision PRECISION.
7189 Used for C bitfields whose precision does not match that of
7190 built-in target types. */
7192 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7198 unsignedp = MAX_INT_CACHED_PREC + 1;
7200 if (precision <= MAX_INT_CACHED_PREC)
7202 itype = nonstandard_integer_type_cache[precision + unsignedp];
7207 itype = make_node (INTEGER_TYPE);
7208 TYPE_PRECISION (itype) = precision;
7211 fixup_unsigned_type (itype);
7213 fixup_signed_type (itype);
7216 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7217 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7218 if (precision <= MAX_INT_CACHED_PREC)
7219 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7224 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7225 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7226 is true, reuse such a type that has already been constructed. */
7229 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7231 tree itype = make_node (INTEGER_TYPE);
7232 hashval_t hashcode = 0;
7234 TREE_TYPE (itype) = type;
7236 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7237 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7239 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7240 SET_TYPE_MODE (itype, TYPE_MODE (type));
7241 TYPE_SIZE (itype) = TYPE_SIZE (type);
7242 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7243 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7244 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7249 if ((TYPE_MIN_VALUE (itype)
7250 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7251 || (TYPE_MAX_VALUE (itype)
7252 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7254 /* Since we cannot reliably merge this type, we need to compare it using
7255 structural equality checks. */
7256 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7260 hashcode = iterative_hash_expr (TYPE_MIN_VALUE (itype), hashcode);
7261 hashcode = iterative_hash_expr (TYPE_MAX_VALUE (itype), hashcode);
7262 hashcode = iterative_hash_hashval_t (TYPE_HASH (type), hashcode);
7263 itype = type_hash_canon (hashcode, itype);
7268 /* Wrapper around build_range_type_1 with SHARED set to true. */
7271 build_range_type (tree type, tree lowval, tree highval)
7273 return build_range_type_1 (type, lowval, highval, true);
7276 /* Wrapper around build_range_type_1 with SHARED set to false. */
7279 build_nonshared_range_type (tree type, tree lowval, tree highval)
7281 return build_range_type_1 (type, lowval, highval, false);
7284 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7285 MAXVAL should be the maximum value in the domain
7286 (one less than the length of the array).
7288 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7289 We don't enforce this limit, that is up to caller (e.g. language front end).
7290 The limit exists because the result is a signed type and we don't handle
7291 sizes that use more than one HOST_WIDE_INT. */
7294 build_index_type (tree maxval)
7296 return build_range_type (sizetype, size_zero_node, maxval);
7299 /* Return true if the debug information for TYPE, a subtype, should be emitted
7300 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7301 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7302 debug info and doesn't reflect the source code. */
7305 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7307 tree base_type = TREE_TYPE (type), low, high;
7309 /* Subrange types have a base type which is an integral type. */
7310 if (!INTEGRAL_TYPE_P (base_type))
7313 /* Get the real bounds of the subtype. */
7314 if (lang_hooks.types.get_subrange_bounds)
7315 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7318 low = TYPE_MIN_VALUE (type);
7319 high = TYPE_MAX_VALUE (type);
7322 /* If the type and its base type have the same representation and the same
7323 name, then the type is not a subrange but a copy of the base type. */
7324 if ((TREE_CODE (base_type) == INTEGER_TYPE
7325 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7326 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7327 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7328 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7330 tree type_name = TYPE_NAME (type);
7331 tree base_type_name = TYPE_NAME (base_type);
7333 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7334 type_name = DECL_NAME (type_name);
7336 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7337 base_type_name = DECL_NAME (base_type_name);
7339 if (type_name == base_type_name)
7350 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7351 and number of elements specified by the range of values of INDEX_TYPE.
7352 If SHARED is true, reuse such a type that has already been constructed. */
7355 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7359 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7361 error ("arrays of functions are not meaningful");
7362 elt_type = integer_type_node;
7365 t = make_node (ARRAY_TYPE);
7366 TREE_TYPE (t) = elt_type;
7367 TYPE_DOMAIN (t) = index_type;
7368 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7371 /* If the element type is incomplete at this point we get marked for
7372 structural equality. Do not record these types in the canonical
7374 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7379 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7381 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7382 t = type_hash_canon (hashcode, t);
7385 if (TYPE_CANONICAL (t) == t)
7387 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7388 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7389 SET_TYPE_STRUCTURAL_EQUALITY (t);
7390 else if (TYPE_CANONICAL (elt_type) != elt_type
7391 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7393 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7395 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7402 /* Wrapper around build_array_type_1 with SHARED set to true. */
7405 build_array_type (tree elt_type, tree index_type)
7407 return build_array_type_1 (elt_type, index_type, true);
7410 /* Wrapper around build_array_type_1 with SHARED set to false. */
7413 build_nonshared_array_type (tree elt_type, tree index_type)
7415 return build_array_type_1 (elt_type, index_type, false);
7418 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7422 build_array_type_nelts (tree elt_type, unsigned HOST_WIDE_INT nelts)
7424 return build_array_type (elt_type, build_index_type (size_int (nelts - 1)));
7427 /* Recursively examines the array elements of TYPE, until a non-array
7428 element type is found. */
7431 strip_array_types (tree type)
7433 while (TREE_CODE (type) == ARRAY_TYPE)
7434 type = TREE_TYPE (type);
7439 /* Computes the canonical argument types from the argument type list
7442 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7443 on entry to this function, or if any of the ARGTYPES are
7446 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7447 true on entry to this function, or if any of the ARGTYPES are
7450 Returns a canonical argument list, which may be ARGTYPES when the
7451 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7452 true) or would not differ from ARGTYPES. */
7455 maybe_canonicalize_argtypes(tree argtypes,
7456 bool *any_structural_p,
7457 bool *any_noncanonical_p)
7460 bool any_noncanonical_argtypes_p = false;
7462 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7464 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7465 /* Fail gracefully by stating that the type is structural. */
7466 *any_structural_p = true;
7467 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7468 *any_structural_p = true;
7469 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7470 || TREE_PURPOSE (arg))
7471 /* If the argument has a default argument, we consider it
7472 non-canonical even though the type itself is canonical.
7473 That way, different variants of function and method types
7474 with default arguments will all point to the variant with
7475 no defaults as their canonical type. */
7476 any_noncanonical_argtypes_p = true;
7479 if (*any_structural_p)
7482 if (any_noncanonical_argtypes_p)
7484 /* Build the canonical list of argument types. */
7485 tree canon_argtypes = NULL_TREE;
7486 bool is_void = false;
7488 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7490 if (arg == void_list_node)
7493 canon_argtypes = tree_cons (NULL_TREE,
7494 TYPE_CANONICAL (TREE_VALUE (arg)),
7498 canon_argtypes = nreverse (canon_argtypes);
7500 canon_argtypes = chainon (canon_argtypes, void_list_node);
7502 /* There is a non-canonical type. */
7503 *any_noncanonical_p = true;
7504 return canon_argtypes;
7507 /* The canonical argument types are the same as ARGTYPES. */
7511 /* Construct, lay out and return
7512 the type of functions returning type VALUE_TYPE
7513 given arguments of types ARG_TYPES.
7514 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7515 are data type nodes for the arguments of the function.
7516 If such a type has already been constructed, reuse it. */
7519 build_function_type (tree value_type, tree arg_types)
7522 hashval_t hashcode = 0;
7523 bool any_structural_p, any_noncanonical_p;
7524 tree canon_argtypes;
7526 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7528 error ("function return type cannot be function");
7529 value_type = integer_type_node;
7532 /* Make a node of the sort we want. */
7533 t = make_node (FUNCTION_TYPE);
7534 TREE_TYPE (t) = value_type;
7535 TYPE_ARG_TYPES (t) = arg_types;
7537 /* If we already have such a type, use the old one. */
7538 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7539 hashcode = type_hash_list (arg_types, hashcode);
7540 t = type_hash_canon (hashcode, t);
7542 /* Set up the canonical type. */
7543 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7544 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7545 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7547 &any_noncanonical_p);
7548 if (any_structural_p)
7549 SET_TYPE_STRUCTURAL_EQUALITY (t);
7550 else if (any_noncanonical_p)
7551 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7554 if (!COMPLETE_TYPE_P (t))
7559 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7562 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7564 tree new_type = NULL;
7565 tree args, new_args = NULL, t;
7569 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7570 args = TREE_CHAIN (args), i++)
7571 if (!bitmap_bit_p (args_to_skip, i))
7572 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7574 new_reversed = nreverse (new_args);
7578 TREE_CHAIN (new_args) = void_list_node;
7580 new_reversed = void_list_node;
7583 /* Use copy_node to preserve as much as possible from original type
7584 (debug info, attribute lists etc.)
7585 Exception is METHOD_TYPEs must have THIS argument.
7586 When we are asked to remove it, we need to build new FUNCTION_TYPE
7588 if (TREE_CODE (orig_type) != METHOD_TYPE
7589 || !bitmap_bit_p (args_to_skip, 0))
7591 new_type = build_distinct_type_copy (orig_type);
7592 TYPE_ARG_TYPES (new_type) = new_reversed;
7597 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7599 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7602 /* This is a new type, not a copy of an old type. Need to reassociate
7603 variants. We can handle everything except the main variant lazily. */
7604 t = TYPE_MAIN_VARIANT (orig_type);
7607 TYPE_MAIN_VARIANT (new_type) = t;
7608 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7609 TYPE_NEXT_VARIANT (t) = new_type;
7613 TYPE_MAIN_VARIANT (new_type) = new_type;
7614 TYPE_NEXT_VARIANT (new_type) = NULL;
7619 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7621 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7622 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7623 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7626 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7628 tree new_decl = copy_node (orig_decl);
7631 new_type = TREE_TYPE (orig_decl);
7632 if (prototype_p (new_type))
7633 new_type = build_function_type_skip_args (new_type, args_to_skip);
7634 TREE_TYPE (new_decl) = new_type;
7636 /* For declarations setting DECL_VINDEX (i.e. methods)
7637 we expect first argument to be THIS pointer. */
7638 if (bitmap_bit_p (args_to_skip, 0))
7639 DECL_VINDEX (new_decl) = NULL_TREE;
7641 /* When signature changes, we need to clear builtin info. */
7642 if (DECL_BUILT_IN (new_decl) && !bitmap_empty_p (args_to_skip))
7644 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7645 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7650 /* Build a function type. The RETURN_TYPE is the type returned by the
7651 function. If VAARGS is set, no void_type_node is appended to the
7652 the list. ARGP must be always be terminated be a NULL_TREE. */
7655 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7659 t = va_arg (argp, tree);
7660 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7661 args = tree_cons (NULL_TREE, t, args);
7666 if (args != NULL_TREE)
7667 args = nreverse (args);
7668 gcc_assert (last != void_list_node);
7670 else if (args == NULL_TREE)
7671 args = void_list_node;
7675 args = nreverse (args);
7676 TREE_CHAIN (last) = void_list_node;
7678 args = build_function_type (return_type, args);
7683 /* Build a function type. The RETURN_TYPE is the type returned by the
7684 function. If additional arguments are provided, they are
7685 additional argument types. The list of argument types must always
7686 be terminated by NULL_TREE. */
7689 build_function_type_list (tree return_type, ...)
7694 va_start (p, return_type);
7695 args = build_function_type_list_1 (false, return_type, p);
7700 /* Build a variable argument function type. The RETURN_TYPE is the
7701 type returned by the function. If additional arguments are provided,
7702 they are additional argument types. The list of argument types must
7703 always be terminated by NULL_TREE. */
7706 build_varargs_function_type_list (tree return_type, ...)
7711 va_start (p, return_type);
7712 args = build_function_type_list_1 (true, return_type, p);
7718 /* Build a function type. RETURN_TYPE is the type returned by the
7719 function; VAARGS indicates whether the function takes varargs. The
7720 function takes N named arguments, the types of which are provided in
7724 build_function_type_array_1 (bool vaargs, tree return_type, int n,
7728 tree t = vaargs ? NULL_TREE : void_list_node;
7730 for (i = n - 1; i >= 0; i--)
7731 t = tree_cons (NULL_TREE, arg_types[i], t);
7733 return build_function_type (return_type, t);
7736 /* Build a function type. RETURN_TYPE is the type returned by the
7737 function. The function takes N named arguments, the types of which
7738 are provided in ARG_TYPES. */
7741 build_function_type_array (tree return_type, int n, tree *arg_types)
7743 return build_function_type_array_1 (false, return_type, n, arg_types);
7746 /* Build a variable argument function type. RETURN_TYPE is the type
7747 returned by the function. The function takes N named arguments, the
7748 types of which are provided in ARG_TYPES. */
7751 build_varargs_function_type_array (tree return_type, int n, tree *arg_types)
7753 return build_function_type_array_1 (true, return_type, n, arg_types);
7756 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7757 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7758 for the method. An implicit additional parameter (of type
7759 pointer-to-BASETYPE) is added to the ARGTYPES. */
7762 build_method_type_directly (tree basetype,
7769 bool any_structural_p, any_noncanonical_p;
7770 tree canon_argtypes;
7772 /* Make a node of the sort we want. */
7773 t = make_node (METHOD_TYPE);
7775 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7776 TREE_TYPE (t) = rettype;
7777 ptype = build_pointer_type (basetype);
7779 /* The actual arglist for this function includes a "hidden" argument
7780 which is "this". Put it into the list of argument types. */
7781 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7782 TYPE_ARG_TYPES (t) = argtypes;
7784 /* If we already have such a type, use the old one. */
7785 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7786 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7787 hashcode = type_hash_list (argtypes, hashcode);
7788 t = type_hash_canon (hashcode, t);
7790 /* Set up the canonical type. */
7792 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7793 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7795 = (TYPE_CANONICAL (basetype) != basetype
7796 || TYPE_CANONICAL (rettype) != rettype);
7797 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7799 &any_noncanonical_p);
7800 if (any_structural_p)
7801 SET_TYPE_STRUCTURAL_EQUALITY (t);
7802 else if (any_noncanonical_p)
7804 = build_method_type_directly (TYPE_CANONICAL (basetype),
7805 TYPE_CANONICAL (rettype),
7807 if (!COMPLETE_TYPE_P (t))
7813 /* Construct, lay out and return the type of methods belonging to class
7814 BASETYPE and whose arguments and values are described by TYPE.
7815 If that type exists already, reuse it.
7816 TYPE must be a FUNCTION_TYPE node. */
7819 build_method_type (tree basetype, tree type)
7821 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7823 return build_method_type_directly (basetype,
7825 TYPE_ARG_TYPES (type));
7828 /* Construct, lay out and return the type of offsets to a value
7829 of type TYPE, within an object of type BASETYPE.
7830 If a suitable offset type exists already, reuse it. */
7833 build_offset_type (tree basetype, tree type)
7836 hashval_t hashcode = 0;
7838 /* Make a node of the sort we want. */
7839 t = make_node (OFFSET_TYPE);
7841 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7842 TREE_TYPE (t) = type;
7844 /* If we already have such a type, use the old one. */
7845 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7846 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7847 t = type_hash_canon (hashcode, t);
7849 if (!COMPLETE_TYPE_P (t))
7852 if (TYPE_CANONICAL (t) == t)
7854 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7855 || TYPE_STRUCTURAL_EQUALITY_P (type))
7856 SET_TYPE_STRUCTURAL_EQUALITY (t);
7857 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7858 || TYPE_CANONICAL (type) != type)
7860 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7861 TYPE_CANONICAL (type));
7867 /* Create a complex type whose components are COMPONENT_TYPE. */
7870 build_complex_type (tree component_type)
7875 gcc_assert (INTEGRAL_TYPE_P (component_type)
7876 || SCALAR_FLOAT_TYPE_P (component_type)
7877 || FIXED_POINT_TYPE_P (component_type));
7879 /* Make a node of the sort we want. */
7880 t = make_node (COMPLEX_TYPE);
7882 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7884 /* If we already have such a type, use the old one. */
7885 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7886 t = type_hash_canon (hashcode, t);
7888 if (!COMPLETE_TYPE_P (t))
7891 if (TYPE_CANONICAL (t) == t)
7893 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7894 SET_TYPE_STRUCTURAL_EQUALITY (t);
7895 else if (TYPE_CANONICAL (component_type) != component_type)
7897 = build_complex_type (TYPE_CANONICAL (component_type));
7900 /* We need to create a name, since complex is a fundamental type. */
7901 if (! TYPE_NAME (t))
7904 if (component_type == char_type_node)
7905 name = "complex char";
7906 else if (component_type == signed_char_type_node)
7907 name = "complex signed char";
7908 else if (component_type == unsigned_char_type_node)
7909 name = "complex unsigned char";
7910 else if (component_type == short_integer_type_node)
7911 name = "complex short int";
7912 else if (component_type == short_unsigned_type_node)
7913 name = "complex short unsigned int";
7914 else if (component_type == integer_type_node)
7915 name = "complex int";
7916 else if (component_type == unsigned_type_node)
7917 name = "complex unsigned int";
7918 else if (component_type == long_integer_type_node)
7919 name = "complex long int";
7920 else if (component_type == long_unsigned_type_node)
7921 name = "complex long unsigned int";
7922 else if (component_type == long_long_integer_type_node)
7923 name = "complex long long int";
7924 else if (component_type == long_long_unsigned_type_node)
7925 name = "complex long long unsigned int";
7930 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7931 get_identifier (name), t);
7934 return build_qualified_type (t, TYPE_QUALS (component_type));
7937 /* If TYPE is a real or complex floating-point type and the target
7938 does not directly support arithmetic on TYPE then return the wider
7939 type to be used for arithmetic on TYPE. Otherwise, return
7943 excess_precision_type (tree type)
7945 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7947 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7948 switch (TREE_CODE (type))
7951 switch (flt_eval_method)
7954 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7955 return double_type_node;
7958 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7959 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7960 return long_double_type_node;
7967 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7969 switch (flt_eval_method)
7972 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7973 return complex_double_type_node;
7976 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7977 || (TYPE_MODE (TREE_TYPE (type))
7978 == TYPE_MODE (double_type_node)))
7979 return complex_long_double_type_node;
7992 /* Return OP, stripped of any conversions to wider types as much as is safe.
7993 Converting the value back to OP's type makes a value equivalent to OP.
7995 If FOR_TYPE is nonzero, we return a value which, if converted to
7996 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7998 OP must have integer, real or enumeral type. Pointers are not allowed!
8000 There are some cases where the obvious value we could return
8001 would regenerate to OP if converted to OP's type,
8002 but would not extend like OP to wider types.
8003 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8004 For example, if OP is (unsigned short)(signed char)-1,
8005 we avoid returning (signed char)-1 if FOR_TYPE is int,
8006 even though extending that to an unsigned short would regenerate OP,
8007 since the result of extending (signed char)-1 to (int)
8008 is different from (int) OP. */
8011 get_unwidened (tree op, tree for_type)
8013 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8014 tree type = TREE_TYPE (op);
8016 = TYPE_PRECISION (for_type != 0 ? for_type : type);
8018 = (for_type != 0 && for_type != type
8019 && final_prec > TYPE_PRECISION (type)
8020 && TYPE_UNSIGNED (type));
8023 while (CONVERT_EXPR_P (op))
8027 /* TYPE_PRECISION on vector types has different meaning
8028 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8029 so avoid them here. */
8030 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
8033 bitschange = TYPE_PRECISION (TREE_TYPE (op))
8034 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
8036 /* Truncations are many-one so cannot be removed.
8037 Unless we are later going to truncate down even farther. */
8039 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
8042 /* See what's inside this conversion. If we decide to strip it,
8044 op = TREE_OPERAND (op, 0);
8046 /* If we have not stripped any zero-extensions (uns is 0),
8047 we can strip any kind of extension.
8048 If we have previously stripped a zero-extension,
8049 only zero-extensions can safely be stripped.
8050 Any extension can be stripped if the bits it would produce
8051 are all going to be discarded later by truncating to FOR_TYPE. */
8055 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
8057 /* TYPE_UNSIGNED says whether this is a zero-extension.
8058 Let's avoid computing it if it does not affect WIN
8059 and if UNS will not be needed again. */
8061 || CONVERT_EXPR_P (op))
8062 && TYPE_UNSIGNED (TREE_TYPE (op)))
8070 /* If we finally reach a constant see if it fits in for_type and
8071 in that case convert it. */
8073 && TREE_CODE (win) == INTEGER_CST
8074 && TREE_TYPE (win) != for_type
8075 && int_fits_type_p (win, for_type))
8076 win = fold_convert (for_type, win);
8081 /* Return OP or a simpler expression for a narrower value
8082 which can be sign-extended or zero-extended to give back OP.
8083 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8084 or 0 if the value should be sign-extended. */
8087 get_narrower (tree op, int *unsignedp_ptr)
8092 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
8094 while (TREE_CODE (op) == NOP_EXPR)
8097 = (TYPE_PRECISION (TREE_TYPE (op))
8098 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
8100 /* Truncations are many-one so cannot be removed. */
8104 /* See what's inside this conversion. If we decide to strip it,
8109 op = TREE_OPERAND (op, 0);
8110 /* An extension: the outermost one can be stripped,
8111 but remember whether it is zero or sign extension. */
8113 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8114 /* Otherwise, if a sign extension has been stripped,
8115 only sign extensions can now be stripped;
8116 if a zero extension has been stripped, only zero-extensions. */
8117 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
8121 else /* bitschange == 0 */
8123 /* A change in nominal type can always be stripped, but we must
8124 preserve the unsignedness. */
8126 uns = TYPE_UNSIGNED (TREE_TYPE (op));
8128 op = TREE_OPERAND (op, 0);
8129 /* Keep trying to narrow, but don't assign op to win if it
8130 would turn an integral type into something else. */
8131 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
8138 if (TREE_CODE (op) == COMPONENT_REF
8139 /* Since type_for_size always gives an integer type. */
8140 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8141 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8142 /* Ensure field is laid out already. */
8143 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8144 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
8146 unsigned HOST_WIDE_INT innerprec
8147 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
8148 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8149 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8150 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8152 /* We can get this structure field in a narrower type that fits it,
8153 but the resulting extension to its nominal type (a fullword type)
8154 must satisfy the same conditions as for other extensions.
8156 Do this only for fields that are aligned (not bit-fields),
8157 because when bit-field insns will be used there is no
8158 advantage in doing this. */
8160 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8161 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8162 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8166 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8167 win = fold_convert (type, op);
8171 *unsignedp_ptr = uns;
8175 /* Returns true if integer constant C has a value that is permissible
8176 for type TYPE (an INTEGER_TYPE). */
8179 int_fits_type_p (const_tree c, const_tree type)
8181 tree type_low_bound, type_high_bound;
8182 bool ok_for_low_bound, ok_for_high_bound, unsc;
8185 dc = tree_to_double_int (c);
8186 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
8188 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
8189 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
8191 /* So c is an unsigned integer whose type is sizetype and type is not.
8192 sizetype'd integers are sign extended even though they are
8193 unsigned. If the integer value fits in the lower end word of c,
8194 and if the higher end word has all its bits set to 1, that
8195 means the higher end bits are set to 1 only for sign extension.
8196 So let's convert c into an equivalent zero extended unsigned
8198 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
8201 type_low_bound = TYPE_MIN_VALUE (type);
8202 type_high_bound = TYPE_MAX_VALUE (type);
8204 /* If at least one bound of the type is a constant integer, we can check
8205 ourselves and maybe make a decision. If no such decision is possible, but
8206 this type is a subtype, try checking against that. Otherwise, use
8207 double_int_fits_to_tree_p, which checks against the precision.
8209 Compute the status for each possibly constant bound, and return if we see
8210 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8211 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8212 for "constant known to fit". */
8214 /* Check if c >= type_low_bound. */
8215 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8217 dd = tree_to_double_int (type_low_bound);
8218 if (TREE_CODE (type) == INTEGER_TYPE
8219 && TYPE_IS_SIZETYPE (type)
8220 && TYPE_UNSIGNED (type))
8221 dd = double_int_zext (dd, TYPE_PRECISION (type));
8222 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
8224 int c_neg = (!unsc && double_int_negative_p (dc));
8225 int t_neg = (unsc && double_int_negative_p (dd));
8227 if (c_neg && !t_neg)
8229 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
8232 else if (double_int_cmp (dc, dd, unsc) < 0)
8234 ok_for_low_bound = true;
8237 ok_for_low_bound = false;
8239 /* Check if c <= type_high_bound. */
8240 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8242 dd = tree_to_double_int (type_high_bound);
8243 if (TREE_CODE (type) == INTEGER_TYPE
8244 && TYPE_IS_SIZETYPE (type)
8245 && TYPE_UNSIGNED (type))
8246 dd = double_int_zext (dd, TYPE_PRECISION (type));
8247 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8249 int c_neg = (!unsc && double_int_negative_p (dc));
8250 int t_neg = (unsc && double_int_negative_p (dd));
8252 if (t_neg && !c_neg)
8254 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
8257 else if (double_int_cmp (dc, dd, unsc) > 0)
8259 ok_for_high_bound = true;
8262 ok_for_high_bound = false;
8264 /* If the constant fits both bounds, the result is known. */
8265 if (ok_for_low_bound && ok_for_high_bound)
8268 /* Perform some generic filtering which may allow making a decision
8269 even if the bounds are not constant. First, negative integers
8270 never fit in unsigned types, */
8271 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8274 /* Second, narrower types always fit in wider ones. */
8275 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8278 /* Third, unsigned integers with top bit set never fit signed types. */
8279 if (! TYPE_UNSIGNED (type) && unsc)
8281 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8282 if (prec < HOST_BITS_PER_WIDE_INT)
8284 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8287 else if (((((unsigned HOST_WIDE_INT) 1)
8288 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8292 /* If we haven't been able to decide at this point, there nothing more we
8293 can check ourselves here. Look at the base type if we have one and it
8294 has the same precision. */
8295 if (TREE_CODE (type) == INTEGER_TYPE
8296 && TREE_TYPE (type) != 0
8297 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8299 type = TREE_TYPE (type);
8303 /* Or to double_int_fits_to_tree_p, if nothing else. */
8304 return double_int_fits_to_tree_p (type, dc);
8307 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8308 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8309 represented (assuming two's-complement arithmetic) within the bit
8310 precision of the type are returned instead. */
8313 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8315 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8316 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8317 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8318 TYPE_UNSIGNED (type));
8321 if (TYPE_UNSIGNED (type))
8322 mpz_set_ui (min, 0);
8326 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8327 mn = double_int_sext (double_int_add (mn, double_int_one),
8328 TYPE_PRECISION (type));
8329 mpz_set_double_int (min, mn, false);
8333 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8334 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8335 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8336 TYPE_UNSIGNED (type));
8339 if (TYPE_UNSIGNED (type))
8340 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8343 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8348 /* Return true if VAR is an automatic variable defined in function FN. */
8351 auto_var_in_fn_p (const_tree var, const_tree fn)
8353 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8354 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8355 || TREE_CODE (var) == PARM_DECL)
8356 && ! TREE_STATIC (var))
8357 || TREE_CODE (var) == LABEL_DECL
8358 || TREE_CODE (var) == RESULT_DECL));
8361 /* Subprogram of following function. Called by walk_tree.
8363 Return *TP if it is an automatic variable or parameter of the
8364 function passed in as DATA. */
8367 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8369 tree fn = (tree) data;
8374 else if (DECL_P (*tp)
8375 && auto_var_in_fn_p (*tp, fn))
8381 /* Returns true if T is, contains, or refers to a type with variable
8382 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8383 arguments, but not the return type. If FN is nonzero, only return
8384 true if a modifier of the type or position of FN is a variable or
8385 parameter inside FN.
8387 This concept is more general than that of C99 'variably modified types':
8388 in C99, a struct type is never variably modified because a VLA may not
8389 appear as a structure member. However, in GNU C code like:
8391 struct S { int i[f()]; };
8393 is valid, and other languages may define similar constructs. */
8396 variably_modified_type_p (tree type, tree fn)
8400 /* Test if T is either variable (if FN is zero) or an expression containing
8401 a variable in FN. */
8402 #define RETURN_TRUE_IF_VAR(T) \
8403 do { tree _t = (T); \
8404 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8405 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8406 return true; } while (0)
8408 if (type == error_mark_node)
8411 /* If TYPE itself has variable size, it is variably modified. */
8412 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8413 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8415 switch (TREE_CODE (type))
8418 case REFERENCE_TYPE:
8420 if (variably_modified_type_p (TREE_TYPE (type), fn))
8426 /* If TYPE is a function type, it is variably modified if the
8427 return type is variably modified. */
8428 if (variably_modified_type_p (TREE_TYPE (type), fn))
8434 case FIXED_POINT_TYPE:
8437 /* Scalar types are variably modified if their end points
8439 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8440 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8445 case QUAL_UNION_TYPE:
8446 /* We can't see if any of the fields are variably-modified by the
8447 definition we normally use, since that would produce infinite
8448 recursion via pointers. */
8449 /* This is variably modified if some field's type is. */
8450 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8451 if (TREE_CODE (t) == FIELD_DECL)
8453 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8454 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8455 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8457 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8458 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8463 /* Do not call ourselves to avoid infinite recursion. This is
8464 variably modified if the element type is. */
8465 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8466 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8473 /* The current language may have other cases to check, but in general,
8474 all other types are not variably modified. */
8475 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8477 #undef RETURN_TRUE_IF_VAR
8480 /* Given a DECL or TYPE, return the scope in which it was declared, or
8481 NULL_TREE if there is no containing scope. */
8484 get_containing_scope (const_tree t)
8486 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8489 /* Return the innermost context enclosing DECL that is
8490 a FUNCTION_DECL, or zero if none. */
8493 decl_function_context (const_tree decl)
8497 if (TREE_CODE (decl) == ERROR_MARK)
8500 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8501 where we look up the function at runtime. Such functions always take
8502 a first argument of type 'pointer to real context'.
8504 C++ should really be fixed to use DECL_CONTEXT for the real context,
8505 and use something else for the "virtual context". */
8506 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8509 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8511 context = DECL_CONTEXT (decl);
8513 while (context && TREE_CODE (context) != FUNCTION_DECL)
8515 if (TREE_CODE (context) == BLOCK)
8516 context = BLOCK_SUPERCONTEXT (context);
8518 context = get_containing_scope (context);
8524 /* Return the innermost context enclosing DECL that is
8525 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8526 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8529 decl_type_context (const_tree decl)
8531 tree context = DECL_CONTEXT (decl);
8534 switch (TREE_CODE (context))
8536 case NAMESPACE_DECL:
8537 case TRANSLATION_UNIT_DECL:
8542 case QUAL_UNION_TYPE:
8547 context = DECL_CONTEXT (context);
8551 context = BLOCK_SUPERCONTEXT (context);
8561 /* CALL is a CALL_EXPR. Return the declaration for the function
8562 called, or NULL_TREE if the called function cannot be
8566 get_callee_fndecl (const_tree call)
8570 if (call == error_mark_node)
8571 return error_mark_node;
8573 /* It's invalid to call this function with anything but a
8575 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8577 /* The first operand to the CALL is the address of the function
8579 addr = CALL_EXPR_FN (call);
8583 /* If this is a readonly function pointer, extract its initial value. */
8584 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8585 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8586 && DECL_INITIAL (addr))
8587 addr = DECL_INITIAL (addr);
8589 /* If the address is just `&f' for some function `f', then we know
8590 that `f' is being called. */
8591 if (TREE_CODE (addr) == ADDR_EXPR
8592 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8593 return TREE_OPERAND (addr, 0);
8595 /* We couldn't figure out what was being called. */
8599 /* Print debugging information about tree nodes generated during the compile,
8600 and any language-specific information. */
8603 dump_tree_statistics (void)
8605 #ifdef GATHER_STATISTICS
8607 int total_nodes, total_bytes;
8610 fprintf (stderr, "\n??? tree nodes created\n\n");
8611 #ifdef GATHER_STATISTICS
8612 fprintf (stderr, "Kind Nodes Bytes\n");
8613 fprintf (stderr, "---------------------------------------\n");
8614 total_nodes = total_bytes = 0;
8615 for (i = 0; i < (int) all_kinds; i++)
8617 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8618 tree_node_counts[i], tree_node_sizes[i]);
8619 total_nodes += tree_node_counts[i];
8620 total_bytes += tree_node_sizes[i];
8622 fprintf (stderr, "---------------------------------------\n");
8623 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8624 fprintf (stderr, "---------------------------------------\n");
8625 fprintf (stderr, "Code Nodes\n");
8626 fprintf (stderr, "----------------------------\n");
8627 for (i = 0; i < (int) MAX_TREE_CODES; i++)
8628 fprintf (stderr, "%-20s %7d\n", tree_code_name[i], tree_code_counts[i]);
8629 fprintf (stderr, "----------------------------\n");
8630 ssanames_print_statistics ();
8631 phinodes_print_statistics ();
8633 fprintf (stderr, "(No per-node statistics)\n");
8635 print_type_hash_statistics ();
8636 print_debug_expr_statistics ();
8637 print_value_expr_statistics ();
8638 lang_hooks.print_statistics ();
8641 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8643 /* Generate a crc32 of a byte. */
8646 crc32_byte (unsigned chksum, char byte)
8648 unsigned value = (unsigned) byte << 24;
8651 for (ix = 8; ix--; value <<= 1)
8655 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8663 /* Generate a crc32 of a string. */
8666 crc32_string (unsigned chksum, const char *string)
8670 chksum = crc32_byte (chksum, *string);
8676 /* P is a string that will be used in a symbol. Mask out any characters
8677 that are not valid in that context. */
8680 clean_symbol_name (char *p)
8684 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8687 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8694 /* Generate a name for a special-purpose function.
8695 The generated name may need to be unique across the whole link.
8696 Changes to this function may also require corresponding changes to
8697 xstrdup_mask_random.
8698 TYPE is some string to identify the purpose of this function to the
8699 linker or collect2; it must start with an uppercase letter,
8701 I - for constructors
8703 N - for C++ anonymous namespaces
8704 F - for DWARF unwind frame information. */
8707 get_file_function_name (const char *type)
8713 /* If we already have a name we know to be unique, just use that. */
8714 if (first_global_object_name)
8715 p = q = ASTRDUP (first_global_object_name);
8716 /* If the target is handling the constructors/destructors, they
8717 will be local to this file and the name is only necessary for
8719 We also assign sub_I and sub_D sufixes to constructors called from
8720 the global static constructors. These are always local. */
8721 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8722 || (strncmp (type, "sub_", 4) == 0
8723 && (type[4] == 'I' || type[4] == 'D')))
8725 const char *file = main_input_filename;
8727 file = input_filename;
8728 /* Just use the file's basename, because the full pathname
8729 might be quite long. */
8730 p = q = ASTRDUP (lbasename (file));
8734 /* Otherwise, the name must be unique across the entire link.
8735 We don't have anything that we know to be unique to this translation
8736 unit, so use what we do have and throw in some randomness. */
8738 const char *name = weak_global_object_name;
8739 const char *file = main_input_filename;
8744 file = input_filename;
8746 len = strlen (file);
8747 q = (char *) alloca (9 * 2 + len + 1);
8748 memcpy (q, file, len + 1);
8750 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8751 crc32_string (0, get_random_seed (false)));
8756 clean_symbol_name (q);
8757 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8760 /* Set up the name of the file-level functions we may need.
8761 Use a global object (which is already required to be unique over
8762 the program) rather than the file name (which imposes extra
8764 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8766 return get_identifier (buf);
8769 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8771 /* Complain that the tree code of NODE does not match the expected 0
8772 terminated list of trailing codes. The trailing code list can be
8773 empty, for a more vague error message. FILE, LINE, and FUNCTION
8774 are of the caller. */
8777 tree_check_failed (const_tree node, const char *file,
8778 int line, const char *function, ...)
8782 unsigned length = 0;
8785 va_start (args, function);
8786 while ((code = va_arg (args, int)))
8787 length += 4 + strlen (tree_code_name[code]);
8792 va_start (args, function);
8793 length += strlen ("expected ");
8794 buffer = tmp = (char *) alloca (length);
8796 while ((code = va_arg (args, int)))
8798 const char *prefix = length ? " or " : "expected ";
8800 strcpy (tmp + length, prefix);
8801 length += strlen (prefix);
8802 strcpy (tmp + length, tree_code_name[code]);
8803 length += strlen (tree_code_name[code]);
8808 buffer = "unexpected node";
8810 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8811 buffer, tree_code_name[TREE_CODE (node)],
8812 function, trim_filename (file), line);
8815 /* Complain that the tree code of NODE does match the expected 0
8816 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8820 tree_not_check_failed (const_tree node, const char *file,
8821 int line, const char *function, ...)
8825 unsigned length = 0;
8828 va_start (args, function);
8829 while ((code = va_arg (args, int)))
8830 length += 4 + strlen (tree_code_name[code]);
8832 va_start (args, function);
8833 buffer = (char *) alloca (length);
8835 while ((code = va_arg (args, int)))
8839 strcpy (buffer + length, " or ");
8842 strcpy (buffer + length, tree_code_name[code]);
8843 length += strlen (tree_code_name[code]);
8847 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8848 buffer, tree_code_name[TREE_CODE (node)],
8849 function, trim_filename (file), line);
8852 /* Similar to tree_check_failed, except that we check for a class of tree
8853 code, given in CL. */
8856 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8857 const char *file, int line, const char *function)
8860 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8861 TREE_CODE_CLASS_STRING (cl),
8862 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8863 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8866 /* Similar to tree_check_failed, except that instead of specifying a
8867 dozen codes, use the knowledge that they're all sequential. */
8870 tree_range_check_failed (const_tree node, const char *file, int line,
8871 const char *function, enum tree_code c1,
8875 unsigned length = 0;
8878 for (c = c1; c <= c2; ++c)
8879 length += 4 + strlen (tree_code_name[c]);
8881 length += strlen ("expected ");
8882 buffer = (char *) alloca (length);
8885 for (c = c1; c <= c2; ++c)
8887 const char *prefix = length ? " or " : "expected ";
8889 strcpy (buffer + length, prefix);
8890 length += strlen (prefix);
8891 strcpy (buffer + length, tree_code_name[c]);
8892 length += strlen (tree_code_name[c]);
8895 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8896 buffer, tree_code_name[TREE_CODE (node)],
8897 function, trim_filename (file), line);
8901 /* Similar to tree_check_failed, except that we check that a tree does
8902 not have the specified code, given in CL. */
8905 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8906 const char *file, int line, const char *function)
8909 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8910 TREE_CODE_CLASS_STRING (cl),
8911 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8912 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8916 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8919 omp_clause_check_failed (const_tree node, const char *file, int line,
8920 const char *function, enum omp_clause_code code)
8922 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8923 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8924 function, trim_filename (file), line);
8928 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8931 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8932 const char *function, enum omp_clause_code c1,
8933 enum omp_clause_code c2)
8936 unsigned length = 0;
8939 for (c = c1; c <= c2; ++c)
8940 length += 4 + strlen (omp_clause_code_name[c]);
8942 length += strlen ("expected ");
8943 buffer = (char *) alloca (length);
8946 for (c = c1; c <= c2; ++c)
8948 const char *prefix = length ? " or " : "expected ";
8950 strcpy (buffer + length, prefix);
8951 length += strlen (prefix);
8952 strcpy (buffer + length, omp_clause_code_name[c]);
8953 length += strlen (omp_clause_code_name[c]);
8956 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8957 buffer, omp_clause_code_name[TREE_CODE (node)],
8958 function, trim_filename (file), line);
8962 #undef DEFTREESTRUCT
8963 #define DEFTREESTRUCT(VAL, NAME) NAME,
8965 static const char *ts_enum_names[] = {
8966 #include "treestruct.def"
8968 #undef DEFTREESTRUCT
8970 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8972 /* Similar to tree_class_check_failed, except that we check for
8973 whether CODE contains the tree structure identified by EN. */
8976 tree_contains_struct_check_failed (const_tree node,
8977 const enum tree_node_structure_enum en,
8978 const char *file, int line,
8979 const char *function)
8982 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8984 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8988 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8989 (dynamically sized) vector. */
8992 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8993 const char *function)
8996 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8997 idx + 1, len, function, trim_filename (file), line);
9000 /* Similar to above, except that the check is for the bounds of the operand
9001 vector of an expression node EXP. */
9004 tree_operand_check_failed (int idx, const_tree exp, const char *file,
9005 int line, const char *function)
9007 int code = TREE_CODE (exp);
9009 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9010 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
9011 function, trim_filename (file), line);
9014 /* Similar to above, except that the check is for the number of
9015 operands of an OMP_CLAUSE node. */
9018 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
9019 int line, const char *function)
9022 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9023 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
9024 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
9025 trim_filename (file), line);
9027 #endif /* ENABLE_TREE_CHECKING */
9029 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9030 and mapped to the machine mode MODE. Initialize its fields and build
9031 the information necessary for debugging output. */
9034 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
9037 hashval_t hashcode = 0;
9039 t = make_node (VECTOR_TYPE);
9040 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
9041 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
9042 SET_TYPE_MODE (t, mode);
9044 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
9045 SET_TYPE_STRUCTURAL_EQUALITY (t);
9046 else if (TYPE_CANONICAL (innertype) != innertype
9047 || mode != VOIDmode)
9049 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
9053 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
9054 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
9055 hashcode = iterative_hash_host_wide_int (mode, hashcode);
9056 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
9057 t = type_hash_canon (hashcode, t);
9059 /* We have built a main variant, based on the main variant of the
9060 inner type. Use it to build the variant we return. */
9061 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
9062 && TREE_TYPE (t) != innertype)
9063 return build_type_attribute_qual_variant (t,
9064 TYPE_ATTRIBUTES (innertype),
9065 TYPE_QUALS (innertype));
9071 make_or_reuse_type (unsigned size, int unsignedp)
9073 if (size == INT_TYPE_SIZE)
9074 return unsignedp ? unsigned_type_node : integer_type_node;
9075 if (size == CHAR_TYPE_SIZE)
9076 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
9077 if (size == SHORT_TYPE_SIZE)
9078 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
9079 if (size == LONG_TYPE_SIZE)
9080 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
9081 if (size == LONG_LONG_TYPE_SIZE)
9082 return (unsignedp ? long_long_unsigned_type_node
9083 : long_long_integer_type_node);
9084 if (size == 128 && int128_integer_type_node)
9085 return (unsignedp ? int128_unsigned_type_node
9086 : int128_integer_type_node);
9089 return make_unsigned_type (size);
9091 return make_signed_type (size);
9094 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9097 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
9101 if (size == SHORT_FRACT_TYPE_SIZE)
9102 return unsignedp ? sat_unsigned_short_fract_type_node
9103 : sat_short_fract_type_node;
9104 if (size == FRACT_TYPE_SIZE)
9105 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
9106 if (size == LONG_FRACT_TYPE_SIZE)
9107 return unsignedp ? sat_unsigned_long_fract_type_node
9108 : sat_long_fract_type_node;
9109 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9110 return unsignedp ? sat_unsigned_long_long_fract_type_node
9111 : sat_long_long_fract_type_node;
9115 if (size == SHORT_FRACT_TYPE_SIZE)
9116 return unsignedp ? unsigned_short_fract_type_node
9117 : short_fract_type_node;
9118 if (size == FRACT_TYPE_SIZE)
9119 return unsignedp ? unsigned_fract_type_node : fract_type_node;
9120 if (size == LONG_FRACT_TYPE_SIZE)
9121 return unsignedp ? unsigned_long_fract_type_node
9122 : long_fract_type_node;
9123 if (size == LONG_LONG_FRACT_TYPE_SIZE)
9124 return unsignedp ? unsigned_long_long_fract_type_node
9125 : long_long_fract_type_node;
9128 return make_fract_type (size, unsignedp, satp);
9131 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9134 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
9138 if (size == SHORT_ACCUM_TYPE_SIZE)
9139 return unsignedp ? sat_unsigned_short_accum_type_node
9140 : sat_short_accum_type_node;
9141 if (size == ACCUM_TYPE_SIZE)
9142 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
9143 if (size == LONG_ACCUM_TYPE_SIZE)
9144 return unsignedp ? sat_unsigned_long_accum_type_node
9145 : sat_long_accum_type_node;
9146 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9147 return unsignedp ? sat_unsigned_long_long_accum_type_node
9148 : sat_long_long_accum_type_node;
9152 if (size == SHORT_ACCUM_TYPE_SIZE)
9153 return unsignedp ? unsigned_short_accum_type_node
9154 : short_accum_type_node;
9155 if (size == ACCUM_TYPE_SIZE)
9156 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9157 if (size == LONG_ACCUM_TYPE_SIZE)
9158 return unsignedp ? unsigned_long_accum_type_node
9159 : long_accum_type_node;
9160 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9161 return unsignedp ? unsigned_long_long_accum_type_node
9162 : long_long_accum_type_node;
9165 return make_accum_type (size, unsignedp, satp);
9168 /* Create nodes for all integer types (and error_mark_node) using the sizes
9169 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9170 SHORT_DOUBLE specifies whether double should be of the same precision
9174 build_common_tree_nodes (bool signed_char, bool short_double)
9176 error_mark_node = make_node (ERROR_MARK);
9177 TREE_TYPE (error_mark_node) = error_mark_node;
9179 initialize_sizetypes ();
9181 /* Define both `signed char' and `unsigned char'. */
9182 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9183 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9184 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9185 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9187 /* Define `char', which is like either `signed char' or `unsigned char'
9188 but not the same as either. */
9191 ? make_signed_type (CHAR_TYPE_SIZE)
9192 : make_unsigned_type (CHAR_TYPE_SIZE));
9193 TYPE_STRING_FLAG (char_type_node) = 1;
9195 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9196 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9197 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9198 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9199 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9200 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9201 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9202 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9203 #if HOST_BITS_PER_WIDE_INT >= 64
9204 /* TODO: This isn't correct, but as logic depends at the moment on
9205 host's instead of target's wide-integer.
9206 If there is a target not supporting TImode, but has an 128-bit
9207 integer-scalar register, this target check needs to be adjusted. */
9208 if (targetm.scalar_mode_supported_p (TImode))
9210 int128_integer_type_node = make_signed_type (128);
9211 int128_unsigned_type_node = make_unsigned_type (128);
9215 /* Define a boolean type. This type only represents boolean values but
9216 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9217 Front ends which want to override this size (i.e. Java) can redefine
9218 boolean_type_node before calling build_common_tree_nodes_2. */
9219 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9220 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9221 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9222 TYPE_PRECISION (boolean_type_node) = 1;
9224 /* Define what type to use for size_t. */
9225 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
9226 size_type_node = unsigned_type_node;
9227 else if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
9228 size_type_node = long_unsigned_type_node;
9229 else if (strcmp (SIZE_TYPE, "long long unsigned int") == 0)
9230 size_type_node = long_long_unsigned_type_node;
9231 else if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
9232 size_type_node = short_unsigned_type_node;
9236 /* Fill in the rest of the sized types. Reuse existing type nodes
9238 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9239 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9240 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9241 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9242 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9244 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9245 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9246 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9247 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9248 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9250 access_public_node = get_identifier ("public");
9251 access_protected_node = get_identifier ("protected");
9252 access_private_node = get_identifier ("private");
9254 /* Define these next since types below may used them. */
9255 integer_zero_node = build_int_cst (integer_type_node, 0);
9256 integer_one_node = build_int_cst (integer_type_node, 1);
9257 integer_three_node = build_int_cst (integer_type_node, 3);
9258 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9260 size_zero_node = size_int (0);
9261 size_one_node = size_int (1);
9262 bitsize_zero_node = bitsize_int (0);
9263 bitsize_one_node = bitsize_int (1);
9264 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9266 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9267 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9269 void_type_node = make_node (VOID_TYPE);
9270 layout_type (void_type_node);
9272 /* We are not going to have real types in C with less than byte alignment,
9273 so we might as well not have any types that claim to have it. */
9274 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9275 TYPE_USER_ALIGN (void_type_node) = 0;
9277 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9278 layout_type (TREE_TYPE (null_pointer_node));
9280 ptr_type_node = build_pointer_type (void_type_node);
9282 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9283 fileptr_type_node = ptr_type_node;
9285 float_type_node = make_node (REAL_TYPE);
9286 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9287 layout_type (float_type_node);
9289 double_type_node = make_node (REAL_TYPE);
9291 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9293 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9294 layout_type (double_type_node);
9296 long_double_type_node = make_node (REAL_TYPE);
9297 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9298 layout_type (long_double_type_node);
9300 float_ptr_type_node = build_pointer_type (float_type_node);
9301 double_ptr_type_node = build_pointer_type (double_type_node);
9302 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9303 integer_ptr_type_node = build_pointer_type (integer_type_node);
9305 /* Fixed size integer types. */
9306 uint32_type_node = build_nonstandard_integer_type (32, true);
9307 uint64_type_node = build_nonstandard_integer_type (64, true);
9309 /* Decimal float types. */
9310 dfloat32_type_node = make_node (REAL_TYPE);
9311 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9312 layout_type (dfloat32_type_node);
9313 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9314 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9316 dfloat64_type_node = make_node (REAL_TYPE);
9317 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9318 layout_type (dfloat64_type_node);
9319 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9320 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9322 dfloat128_type_node = make_node (REAL_TYPE);
9323 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9324 layout_type (dfloat128_type_node);
9325 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9326 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9328 complex_integer_type_node = build_complex_type (integer_type_node);
9329 complex_float_type_node = build_complex_type (float_type_node);
9330 complex_double_type_node = build_complex_type (double_type_node);
9331 complex_long_double_type_node = build_complex_type (long_double_type_node);
9333 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9334 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9335 sat_ ## KIND ## _type_node = \
9336 make_sat_signed_ ## KIND ## _type (SIZE); \
9337 sat_unsigned_ ## KIND ## _type_node = \
9338 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9339 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9340 unsigned_ ## KIND ## _type_node = \
9341 make_unsigned_ ## KIND ## _type (SIZE);
9343 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9344 sat_ ## WIDTH ## KIND ## _type_node = \
9345 make_sat_signed_ ## KIND ## _type (SIZE); \
9346 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9347 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9348 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9349 unsigned_ ## WIDTH ## KIND ## _type_node = \
9350 make_unsigned_ ## KIND ## _type (SIZE);
9352 /* Make fixed-point type nodes based on four different widths. */
9353 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9354 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9355 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9356 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9357 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9359 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9360 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9361 NAME ## _type_node = \
9362 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9363 u ## NAME ## _type_node = \
9364 make_or_reuse_unsigned_ ## KIND ## _type \
9365 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9366 sat_ ## NAME ## _type_node = \
9367 make_or_reuse_sat_signed_ ## KIND ## _type \
9368 (GET_MODE_BITSIZE (MODE ## mode)); \
9369 sat_u ## NAME ## _type_node = \
9370 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9371 (GET_MODE_BITSIZE (U ## MODE ## mode));
9373 /* Fixed-point type and mode nodes. */
9374 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9375 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9376 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9377 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9378 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9379 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9380 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9381 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9382 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9383 MAKE_FIXED_MODE_NODE (accum, da, DA)
9384 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9387 tree t = targetm.build_builtin_va_list ();
9389 /* Many back-ends define record types without setting TYPE_NAME.
9390 If we copied the record type here, we'd keep the original
9391 record type without a name. This breaks name mangling. So,
9392 don't copy record types and let c_common_nodes_and_builtins()
9393 declare the type to be __builtin_va_list. */
9394 if (TREE_CODE (t) != RECORD_TYPE)
9395 t = build_variant_type_copy (t);
9397 va_list_type_node = t;
9401 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9404 local_define_builtin (const char *name, tree type, enum built_in_function code,
9405 const char *library_name, int ecf_flags)
9409 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9410 library_name, NULL_TREE);
9411 if (ecf_flags & ECF_CONST)
9412 TREE_READONLY (decl) = 1;
9413 if (ecf_flags & ECF_PURE)
9414 DECL_PURE_P (decl) = 1;
9415 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9416 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9417 if (ecf_flags & ECF_NORETURN)
9418 TREE_THIS_VOLATILE (decl) = 1;
9419 if (ecf_flags & ECF_NOTHROW)
9420 TREE_NOTHROW (decl) = 1;
9421 if (ecf_flags & ECF_MALLOC)
9422 DECL_IS_MALLOC (decl) = 1;
9423 if (ecf_flags & ECF_LEAF)
9424 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9425 NULL, DECL_ATTRIBUTES (decl));
9427 built_in_decls[code] = decl;
9428 implicit_built_in_decls[code] = decl;
9431 /* Call this function after instantiating all builtins that the language
9432 front end cares about. This will build the rest of the builtins that
9433 are relied upon by the tree optimizers and the middle-end. */
9436 build_common_builtin_nodes (void)
9440 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9441 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9443 ftype = build_function_type_list (ptr_type_node,
9444 ptr_type_node, const_ptr_type_node,
9445 size_type_node, NULL_TREE);
9447 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9448 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9449 "memcpy", ECF_NOTHROW | ECF_LEAF);
9450 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9451 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9452 "memmove", ECF_NOTHROW | ECF_LEAF);
9455 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9457 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9458 const_ptr_type_node, size_type_node,
9460 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9461 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9464 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9466 ftype = build_function_type_list (ptr_type_node,
9467 ptr_type_node, integer_type_node,
9468 size_type_node, NULL_TREE);
9469 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9470 "memset", ECF_NOTHROW | ECF_LEAF);
9473 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9475 ftype = build_function_type_list (ptr_type_node,
9476 size_type_node, NULL_TREE);
9477 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9478 "alloca", ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9481 /* If we're checking the stack, `alloca' can throw. */
9482 if (flag_stack_check)
9483 TREE_NOTHROW (built_in_decls[BUILT_IN_ALLOCA]) = 0;
9485 ftype = build_function_type_list (void_type_node,
9486 ptr_type_node, ptr_type_node,
9487 ptr_type_node, NULL_TREE);
9488 local_define_builtin ("__builtin_init_trampoline", ftype,
9489 BUILT_IN_INIT_TRAMPOLINE,
9490 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9492 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9493 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9494 BUILT_IN_ADJUST_TRAMPOLINE,
9495 "__builtin_adjust_trampoline",
9496 ECF_CONST | ECF_NOTHROW);
9498 ftype = build_function_type_list (void_type_node,
9499 ptr_type_node, ptr_type_node, NULL_TREE);
9500 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9501 BUILT_IN_NONLOCAL_GOTO,
9502 "__builtin_nonlocal_goto",
9503 ECF_NORETURN | ECF_NOTHROW);
9505 ftype = build_function_type_list (void_type_node,
9506 ptr_type_node, ptr_type_node, NULL_TREE);
9507 local_define_builtin ("__builtin_setjmp_setup", ftype,
9508 BUILT_IN_SETJMP_SETUP,
9509 "__builtin_setjmp_setup", ECF_NOTHROW);
9511 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9512 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9513 BUILT_IN_SETJMP_DISPATCHER,
9514 "__builtin_setjmp_dispatcher",
9515 ECF_PURE | ECF_NOTHROW);
9517 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9518 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9519 BUILT_IN_SETJMP_RECEIVER,
9520 "__builtin_setjmp_receiver", ECF_NOTHROW);
9522 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9523 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9524 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9526 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9527 local_define_builtin ("__builtin_stack_restore", ftype,
9528 BUILT_IN_STACK_RESTORE,
9529 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9531 /* If there's a possibility that we might use the ARM EABI, build the
9532 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9533 if (targetm.arm_eabi_unwinder)
9535 ftype = build_function_type_list (void_type_node, NULL_TREE);
9536 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9537 BUILT_IN_CXA_END_CLEANUP,
9538 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9541 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9542 local_define_builtin ("__builtin_unwind_resume", ftype,
9543 BUILT_IN_UNWIND_RESUME,
9544 ((targetm_common.except_unwind_info (&global_options)
9546 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9549 if (built_in_decls[BUILT_IN_RETURN_ADDRESS] == NULL_TREE)
9551 ftype = build_function_type_list (ptr_type_node, integer_type_node,
9553 local_define_builtin ("__builtin_return_address", ftype,
9554 BUILT_IN_RETURN_ADDRESS,
9555 "__builtin_return_address",
9559 if (built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER] == NULL_TREE
9560 || built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT] == NULL_TREE)
9562 ftype = build_function_type_list (void_type_node, ptr_type_node,
9563 ptr_type_node, NULL_TREE);
9564 if (built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER] == NULL_TREE)
9565 local_define_builtin ("__cyg_profile_func_enter", ftype,
9566 BUILT_IN_PROFILE_FUNC_ENTER,
9567 "__cyg_profile_func_enter", 0);
9568 if (built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT] == NULL_TREE)
9569 local_define_builtin ("__cyg_profile_func_exit", ftype,
9570 BUILT_IN_PROFILE_FUNC_EXIT,
9571 "__cyg_profile_func_exit", 0);
9574 /* The exception object and filter values from the runtime. The argument
9575 must be zero before exception lowering, i.e. from the front end. After
9576 exception lowering, it will be the region number for the exception
9577 landing pad. These functions are PURE instead of CONST to prevent
9578 them from being hoisted past the exception edge that will initialize
9579 its value in the landing pad. */
9580 ftype = build_function_type_list (ptr_type_node,
9581 integer_type_node, NULL_TREE);
9582 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9583 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9585 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9586 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9587 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9588 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9590 ftype = build_function_type_list (void_type_node,
9591 integer_type_node, integer_type_node,
9593 local_define_builtin ("__builtin_eh_copy_values", ftype,
9594 BUILT_IN_EH_COPY_VALUES,
9595 "__builtin_eh_copy_values", ECF_NOTHROW);
9597 /* Complex multiplication and division. These are handled as builtins
9598 rather than optabs because emit_library_call_value doesn't support
9599 complex. Further, we can do slightly better with folding these
9600 beasties if the real and complex parts of the arguments are separate. */
9604 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9606 char mode_name_buf[4], *q;
9608 enum built_in_function mcode, dcode;
9609 tree type, inner_type;
9610 const char *prefix = "__";
9612 if (targetm.libfunc_gnu_prefix)
9615 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9618 inner_type = TREE_TYPE (type);
9620 ftype = build_function_type_list (type, inner_type, inner_type,
9621 inner_type, inner_type, NULL_TREE);
9623 mcode = ((enum built_in_function)
9624 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9625 dcode = ((enum built_in_function)
9626 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9628 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9632 built_in_names[mcode] = concat (prefix, "mul", mode_name_buf, "3",
9634 local_define_builtin (built_in_names[mcode], ftype, mcode,
9635 built_in_names[mcode],
9636 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9638 built_in_names[dcode] = concat (prefix, "div", mode_name_buf, "3",
9640 local_define_builtin (built_in_names[dcode], ftype, dcode,
9641 built_in_names[dcode],
9642 ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9647 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9650 If we requested a pointer to a vector, build up the pointers that
9651 we stripped off while looking for the inner type. Similarly for
9652 return values from functions.
9654 The argument TYPE is the top of the chain, and BOTTOM is the
9655 new type which we will point to. */
9658 reconstruct_complex_type (tree type, tree bottom)
9662 if (TREE_CODE (type) == POINTER_TYPE)
9664 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9665 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9666 TYPE_REF_CAN_ALIAS_ALL (type));
9668 else if (TREE_CODE (type) == REFERENCE_TYPE)
9670 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9671 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9672 TYPE_REF_CAN_ALIAS_ALL (type));
9674 else if (TREE_CODE (type) == ARRAY_TYPE)
9676 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9677 outer = build_array_type (inner, TYPE_DOMAIN (type));
9679 else if (TREE_CODE (type) == FUNCTION_TYPE)
9681 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9682 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9684 else if (TREE_CODE (type) == METHOD_TYPE)
9686 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9687 /* The build_method_type_directly() routine prepends 'this' to argument list,
9688 so we must compensate by getting rid of it. */
9690 = build_method_type_directly
9691 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9693 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9695 else if (TREE_CODE (type) == OFFSET_TYPE)
9697 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9698 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9703 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9707 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9710 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9714 switch (GET_MODE_CLASS (mode))
9716 case MODE_VECTOR_INT:
9717 case MODE_VECTOR_FLOAT:
9718 case MODE_VECTOR_FRACT:
9719 case MODE_VECTOR_UFRACT:
9720 case MODE_VECTOR_ACCUM:
9721 case MODE_VECTOR_UACCUM:
9722 nunits = GET_MODE_NUNITS (mode);
9726 /* Check that there are no leftover bits. */
9727 gcc_assert (GET_MODE_BITSIZE (mode)
9728 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9730 nunits = GET_MODE_BITSIZE (mode)
9731 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9738 return make_vector_type (innertype, nunits, mode);
9741 /* Similarly, but takes the inner type and number of units, which must be
9745 build_vector_type (tree innertype, int nunits)
9747 return make_vector_type (innertype, nunits, VOIDmode);
9750 /* Similarly, but takes the inner type and number of units, which must be
9754 build_opaque_vector_type (tree innertype, int nunits)
9757 innertype = build_distinct_type_copy (innertype);
9758 t = make_vector_type (innertype, nunits, VOIDmode);
9759 TYPE_VECTOR_OPAQUE (t) = true;
9764 /* Given an initializer INIT, return TRUE if INIT is zero or some
9765 aggregate of zeros. Otherwise return FALSE. */
9767 initializer_zerop (const_tree init)
9773 switch (TREE_CODE (init))
9776 return integer_zerop (init);
9779 /* ??? Note that this is not correct for C4X float formats. There,
9780 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9781 negative exponent. */
9782 return real_zerop (init)
9783 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9786 return fixed_zerop (init);
9789 return integer_zerop (init)
9790 || (real_zerop (init)
9791 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9792 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9795 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9796 if (!initializer_zerop (TREE_VALUE (elt)))
9802 unsigned HOST_WIDE_INT idx;
9804 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9805 if (!initializer_zerop (elt))
9814 /* We need to loop through all elements to handle cases like
9815 "\0" and "\0foobar". */
9816 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9817 if (TREE_STRING_POINTER (init)[i] != '\0')
9828 /* Build an empty statement at location LOC. */
9831 build_empty_stmt (location_t loc)
9833 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9834 SET_EXPR_LOCATION (t, loc);
9839 /* Build an OpenMP clause with code CODE. LOC is the location of the
9843 build_omp_clause (location_t loc, enum omp_clause_code code)
9848 length = omp_clause_num_ops[code];
9849 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9851 record_node_allocation_statistics (OMP_CLAUSE, size);
9853 t = ggc_alloc_tree_node (size);
9854 memset (t, 0, size);
9855 TREE_SET_CODE (t, OMP_CLAUSE);
9856 OMP_CLAUSE_SET_CODE (t, code);
9857 OMP_CLAUSE_LOCATION (t) = loc;
9862 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9863 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9864 Except for the CODE and operand count field, other storage for the
9865 object is initialized to zeros. */
9868 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9871 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9873 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9874 gcc_assert (len >= 1);
9876 record_node_allocation_statistics (code, length);
9878 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9880 TREE_SET_CODE (t, code);
9882 /* Can't use TREE_OPERAND to store the length because if checking is
9883 enabled, it will try to check the length before we store it. :-P */
9884 t->exp.operands[0] = build_int_cst (sizetype, len);
9889 /* Helper function for build_call_* functions; build a CALL_EXPR with
9890 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9891 the argument slots. */
9894 build_call_1 (tree return_type, tree fn, int nargs)
9898 t = build_vl_exp (CALL_EXPR, nargs + 3);
9899 TREE_TYPE (t) = return_type;
9900 CALL_EXPR_FN (t) = fn;
9901 CALL_EXPR_STATIC_CHAIN (t) = NULL;
9906 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9907 FN and a null static chain slot. NARGS is the number of call arguments
9908 which are specified as "..." arguments. */
9911 build_call_nary (tree return_type, tree fn, int nargs, ...)
9915 va_start (args, nargs);
9916 ret = build_call_valist (return_type, fn, nargs, args);
9921 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9922 FN and a null static chain slot. NARGS is the number of call arguments
9923 which are specified as a va_list ARGS. */
9926 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9931 t = build_call_1 (return_type, fn, nargs);
9932 for (i = 0; i < nargs; i++)
9933 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9934 process_call_operands (t);
9938 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9939 FN and a null static chain slot. NARGS is the number of call arguments
9940 which are specified as a tree array ARGS. */
9943 build_call_array_loc (location_t loc, tree return_type, tree fn,
9944 int nargs, const tree *args)
9949 t = build_call_1 (return_type, fn, nargs);
9950 for (i = 0; i < nargs; i++)
9951 CALL_EXPR_ARG (t, i) = args[i];
9952 process_call_operands (t);
9953 SET_EXPR_LOCATION (t, loc);
9957 /* Like build_call_array, but takes a VEC. */
9960 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9965 ret = build_call_1 (return_type, fn, VEC_length (tree, args));
9966 FOR_EACH_VEC_ELT (tree, args, ix, t)
9967 CALL_EXPR_ARG (ret, ix) = t;
9968 process_call_operands (ret);
9973 /* Returns true if it is possible to prove that the index of
9974 an array access REF (an ARRAY_REF expression) falls into the
9978 in_array_bounds_p (tree ref)
9980 tree idx = TREE_OPERAND (ref, 1);
9983 if (TREE_CODE (idx) != INTEGER_CST)
9986 min = array_ref_low_bound (ref);
9987 max = array_ref_up_bound (ref);
9990 || TREE_CODE (min) != INTEGER_CST
9991 || TREE_CODE (max) != INTEGER_CST)
9994 if (tree_int_cst_lt (idx, min)
9995 || tree_int_cst_lt (max, idx))
10001 /* Returns true if it is possible to prove that the range of
10002 an array access REF (an ARRAY_RANGE_REF expression) falls
10003 into the array bounds. */
10006 range_in_array_bounds_p (tree ref)
10008 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
10009 tree range_min, range_max, min, max;
10011 range_min = TYPE_MIN_VALUE (domain_type);
10012 range_max = TYPE_MAX_VALUE (domain_type);
10015 || TREE_CODE (range_min) != INTEGER_CST
10016 || TREE_CODE (range_max) != INTEGER_CST)
10019 min = array_ref_low_bound (ref);
10020 max = array_ref_up_bound (ref);
10023 || TREE_CODE (min) != INTEGER_CST
10024 || TREE_CODE (max) != INTEGER_CST)
10027 if (tree_int_cst_lt (range_min, min)
10028 || tree_int_cst_lt (max, range_max))
10034 /* Return true if T (assumed to be a DECL) must be assigned a memory
10038 needs_to_live_in_memory (const_tree t)
10040 if (TREE_CODE (t) == SSA_NAME)
10041 t = SSA_NAME_VAR (t);
10043 return (TREE_ADDRESSABLE (t)
10044 || is_global_var (t)
10045 || (TREE_CODE (t) == RESULT_DECL
10046 && !DECL_BY_REFERENCE (t)
10047 && aggregate_value_p (t, current_function_decl)));
10050 /* Return value of a constant X and sign-extend it. */
10053 int_cst_value (const_tree x)
10055 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10056 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
10058 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10059 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10060 || TREE_INT_CST_HIGH (x) == -1);
10062 if (bits < HOST_BITS_PER_WIDE_INT)
10064 bool negative = ((val >> (bits - 1)) & 1) != 0;
10066 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
10068 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
10074 /* Return value of a constant X and sign-extend it. */
10077 widest_int_cst_value (const_tree x)
10079 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
10080 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
10082 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10083 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
10084 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
10085 << HOST_BITS_PER_WIDE_INT);
10087 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10088 gcc_assert (TREE_INT_CST_HIGH (x) == 0
10089 || TREE_INT_CST_HIGH (x) == -1);
10092 if (bits < HOST_BITS_PER_WIDEST_INT)
10094 bool negative = ((val >> (bits - 1)) & 1) != 0;
10096 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
10098 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
10104 /* If TYPE is an integral type, return an equivalent type which is
10105 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
10106 return TYPE itself. */
10109 signed_or_unsigned_type_for (int unsignedp, tree type)
10112 if (POINTER_TYPE_P (type))
10114 /* If the pointer points to the normal address space, use the
10115 size_type_node. Otherwise use an appropriate size for the pointer
10116 based on the named address space it points to. */
10117 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
10118 t = size_type_node;
10120 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10123 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
10126 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10129 /* Returns unsigned variant of TYPE. */
10132 unsigned_type_for (tree type)
10134 return signed_or_unsigned_type_for (1, type);
10137 /* Returns signed variant of TYPE. */
10140 signed_type_for (tree type)
10142 return signed_or_unsigned_type_for (0, type);
10145 /* Returns the largest value obtainable by casting something in INNER type to
10149 upper_bound_in_type (tree outer, tree inner)
10152 unsigned int det = 0;
10153 unsigned oprec = TYPE_PRECISION (outer);
10154 unsigned iprec = TYPE_PRECISION (inner);
10157 /* Compute a unique number for every combination. */
10158 det |= (oprec > iprec) ? 4 : 0;
10159 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10160 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10162 /* Determine the exponent to use. */
10167 /* oprec <= iprec, outer: signed, inner: don't care. */
10172 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10176 /* oprec > iprec, outer: signed, inner: signed. */
10180 /* oprec > iprec, outer: signed, inner: unsigned. */
10184 /* oprec > iprec, outer: unsigned, inner: signed. */
10188 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10192 gcc_unreachable ();
10195 /* Compute 2^^prec - 1. */
10196 if (prec <= HOST_BITS_PER_WIDE_INT)
10199 high.low = ((~(unsigned HOST_WIDE_INT) 0)
10200 >> (HOST_BITS_PER_WIDE_INT - prec));
10204 high.high = ((~(unsigned HOST_WIDE_INT) 0)
10205 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
10206 high.low = ~(unsigned HOST_WIDE_INT) 0;
10209 return double_int_to_tree (outer, high);
10212 /* Returns the smallest value obtainable by casting something in INNER type to
10216 lower_bound_in_type (tree outer, tree inner)
10219 unsigned oprec = TYPE_PRECISION (outer);
10220 unsigned iprec = TYPE_PRECISION (inner);
10222 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10224 if (TYPE_UNSIGNED (outer)
10225 /* If we are widening something of an unsigned type, OUTER type
10226 contains all values of INNER type. In particular, both INNER
10227 and OUTER types have zero in common. */
10228 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10229 low.low = low.high = 0;
10232 /* If we are widening a signed type to another signed type, we
10233 want to obtain -2^^(iprec-1). If we are keeping the
10234 precision or narrowing to a signed type, we want to obtain
10236 unsigned prec = oprec > iprec ? iprec : oprec;
10238 if (prec <= HOST_BITS_PER_WIDE_INT)
10240 low.high = ~(unsigned HOST_WIDE_INT) 0;
10241 low.low = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10245 low.high = ((~(unsigned HOST_WIDE_INT) 0)
10246 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10251 return double_int_to_tree (outer, low);
10254 /* Return nonzero if two operands that are suitable for PHI nodes are
10255 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10256 SSA_NAME or invariant. Note that this is strictly an optimization.
10257 That is, callers of this function can directly call operand_equal_p
10258 and get the same result, only slower. */
10261 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10265 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10267 return operand_equal_p (arg0, arg1, 0);
10270 /* Returns number of zeros at the end of binary representation of X.
10272 ??? Use ffs if available? */
10275 num_ending_zeros (const_tree x)
10277 unsigned HOST_WIDE_INT fr, nfr;
10278 unsigned num, abits;
10279 tree type = TREE_TYPE (x);
10281 if (TREE_INT_CST_LOW (x) == 0)
10283 num = HOST_BITS_PER_WIDE_INT;
10284 fr = TREE_INT_CST_HIGH (x);
10289 fr = TREE_INT_CST_LOW (x);
10292 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10295 if (nfr << abits == fr)
10302 if (num > TYPE_PRECISION (type))
10303 num = TYPE_PRECISION (type);
10305 return build_int_cst_type (type, num);
10309 #define WALK_SUBTREE(NODE) \
10312 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10318 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10319 be walked whenever a type is seen in the tree. Rest of operands and return
10320 value are as for walk_tree. */
10323 walk_type_fields (tree type, walk_tree_fn func, void *data,
10324 struct pointer_set_t *pset, walk_tree_lh lh)
10326 tree result = NULL_TREE;
10328 switch (TREE_CODE (type))
10331 case REFERENCE_TYPE:
10332 /* We have to worry about mutually recursive pointers. These can't
10333 be written in C. They can in Ada. It's pathological, but
10334 there's an ACATS test (c38102a) that checks it. Deal with this
10335 by checking if we're pointing to another pointer, that one
10336 points to another pointer, that one does too, and we have no htab.
10337 If so, get a hash table. We check three levels deep to avoid
10338 the cost of the hash table if we don't need one. */
10339 if (POINTER_TYPE_P (TREE_TYPE (type))
10340 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10341 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10344 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10352 /* ... fall through ... */
10355 WALK_SUBTREE (TREE_TYPE (type));
10359 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10361 /* Fall through. */
10363 case FUNCTION_TYPE:
10364 WALK_SUBTREE (TREE_TYPE (type));
10368 /* We never want to walk into default arguments. */
10369 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10370 WALK_SUBTREE (TREE_VALUE (arg));
10375 /* Don't follow this nodes's type if a pointer for fear that
10376 we'll have infinite recursion. If we have a PSET, then we
10379 || (!POINTER_TYPE_P (TREE_TYPE (type))
10380 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10381 WALK_SUBTREE (TREE_TYPE (type));
10382 WALK_SUBTREE (TYPE_DOMAIN (type));
10386 WALK_SUBTREE (TREE_TYPE (type));
10387 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10397 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10398 called with the DATA and the address of each sub-tree. If FUNC returns a
10399 non-NULL value, the traversal is stopped, and the value returned by FUNC
10400 is returned. If PSET is non-NULL it is used to record the nodes visited,
10401 and to avoid visiting a node more than once. */
10404 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10405 struct pointer_set_t *pset, walk_tree_lh lh)
10407 enum tree_code code;
10411 #define WALK_SUBTREE_TAIL(NODE) \
10415 goto tail_recurse; \
10420 /* Skip empty subtrees. */
10424 /* Don't walk the same tree twice, if the user has requested
10425 that we avoid doing so. */
10426 if (pset && pointer_set_insert (pset, *tp))
10429 /* Call the function. */
10431 result = (*func) (tp, &walk_subtrees, data);
10433 /* If we found something, return it. */
10437 code = TREE_CODE (*tp);
10439 /* Even if we didn't, FUNC may have decided that there was nothing
10440 interesting below this point in the tree. */
10441 if (!walk_subtrees)
10443 /* But we still need to check our siblings. */
10444 if (code == TREE_LIST)
10445 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10446 else if (code == OMP_CLAUSE)
10447 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10454 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10455 if (result || !walk_subtrees)
10462 case IDENTIFIER_NODE:
10469 case PLACEHOLDER_EXPR:
10473 /* None of these have subtrees other than those already walked
10478 WALK_SUBTREE (TREE_VALUE (*tp));
10479 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10484 int len = TREE_VEC_LENGTH (*tp);
10489 /* Walk all elements but the first. */
10491 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10493 /* Now walk the first one as a tail call. */
10494 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10498 WALK_SUBTREE (TREE_REALPART (*tp));
10499 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10503 unsigned HOST_WIDE_INT idx;
10504 constructor_elt *ce;
10507 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10509 WALK_SUBTREE (ce->value);
10514 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10519 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10521 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10522 into declarations that are just mentioned, rather than
10523 declared; they don't really belong to this part of the tree.
10524 And, we can see cycles: the initializer for a declaration
10525 can refer to the declaration itself. */
10526 WALK_SUBTREE (DECL_INITIAL (decl));
10527 WALK_SUBTREE (DECL_SIZE (decl));
10528 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10530 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10533 case STATEMENT_LIST:
10535 tree_stmt_iterator i;
10536 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10537 WALK_SUBTREE (*tsi_stmt_ptr (i));
10542 switch (OMP_CLAUSE_CODE (*tp))
10544 case OMP_CLAUSE_PRIVATE:
10545 case OMP_CLAUSE_SHARED:
10546 case OMP_CLAUSE_FIRSTPRIVATE:
10547 case OMP_CLAUSE_COPYIN:
10548 case OMP_CLAUSE_COPYPRIVATE:
10549 case OMP_CLAUSE_IF:
10550 case OMP_CLAUSE_NUM_THREADS:
10551 case OMP_CLAUSE_SCHEDULE:
10552 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10555 case OMP_CLAUSE_NOWAIT:
10556 case OMP_CLAUSE_ORDERED:
10557 case OMP_CLAUSE_DEFAULT:
10558 case OMP_CLAUSE_UNTIED:
10559 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10561 case OMP_CLAUSE_LASTPRIVATE:
10562 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10563 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10564 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10566 case OMP_CLAUSE_COLLAPSE:
10569 for (i = 0; i < 3; i++)
10570 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10571 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10574 case OMP_CLAUSE_REDUCTION:
10577 for (i = 0; i < 4; i++)
10578 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10579 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10583 gcc_unreachable ();
10591 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10592 But, we only want to walk once. */
10593 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10594 for (i = 0; i < len; ++i)
10595 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10596 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10600 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10601 defining. We only want to walk into these fields of a type in this
10602 case and not in the general case of a mere reference to the type.
10604 The criterion is as follows: if the field can be an expression, it
10605 must be walked only here. This should be in keeping with the fields
10606 that are directly gimplified in gimplify_type_sizes in order for the
10607 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10608 variable-sized types.
10610 Note that DECLs get walked as part of processing the BIND_EXPR. */
10611 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10613 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10614 if (TREE_CODE (*type_p) == ERROR_MARK)
10617 /* Call the function for the type. See if it returns anything or
10618 doesn't want us to continue. If we are to continue, walk both
10619 the normal fields and those for the declaration case. */
10620 result = (*func) (type_p, &walk_subtrees, data);
10621 if (result || !walk_subtrees)
10624 /* But do not walk a pointed-to type since it may itself need to
10625 be walked in the declaration case if it isn't anonymous. */
10626 if (!POINTER_TYPE_P (*type_p))
10628 result = walk_type_fields (*type_p, func, data, pset, lh);
10633 /* If this is a record type, also walk the fields. */
10634 if (RECORD_OR_UNION_TYPE_P (*type_p))
10638 for (field = TYPE_FIELDS (*type_p); field;
10639 field = DECL_CHAIN (field))
10641 /* We'd like to look at the type of the field, but we can
10642 easily get infinite recursion. So assume it's pointed
10643 to elsewhere in the tree. Also, ignore things that
10645 if (TREE_CODE (field) != FIELD_DECL)
10648 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10649 WALK_SUBTREE (DECL_SIZE (field));
10650 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10651 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10652 WALK_SUBTREE (DECL_QUALIFIER (field));
10656 /* Same for scalar types. */
10657 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10658 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10659 || TREE_CODE (*type_p) == INTEGER_TYPE
10660 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10661 || TREE_CODE (*type_p) == REAL_TYPE)
10663 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10664 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10667 WALK_SUBTREE (TYPE_SIZE (*type_p));
10668 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10673 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10677 /* Walk over all the sub-trees of this operand. */
10678 len = TREE_OPERAND_LENGTH (*tp);
10680 /* Go through the subtrees. We need to do this in forward order so
10681 that the scope of a FOR_EXPR is handled properly. */
10684 for (i = 0; i < len - 1; ++i)
10685 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10686 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10689 /* If this is a type, walk the needed fields in the type. */
10690 else if (TYPE_P (*tp))
10691 return walk_type_fields (*tp, func, data, pset, lh);
10695 /* We didn't find what we were looking for. */
10698 #undef WALK_SUBTREE_TAIL
10700 #undef WALK_SUBTREE
10702 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10705 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10709 struct pointer_set_t *pset;
10711 pset = pointer_set_create ();
10712 result = walk_tree_1 (tp, func, data, pset, lh);
10713 pointer_set_destroy (pset);
10719 tree_block (tree t)
10721 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10723 if (IS_EXPR_CODE_CLASS (c))
10724 return &t->exp.block;
10725 gcc_unreachable ();
10729 /* Create a nameless artificial label and put it in the current
10730 function context. The label has a location of LOC. Returns the
10731 newly created label. */
10734 create_artificial_label (location_t loc)
10736 tree lab = build_decl (loc,
10737 LABEL_DECL, NULL_TREE, void_type_node);
10739 DECL_ARTIFICIAL (lab) = 1;
10740 DECL_IGNORED_P (lab) = 1;
10741 DECL_CONTEXT (lab) = current_function_decl;
10745 /* Given a tree, try to return a useful variable name that we can use
10746 to prefix a temporary that is being assigned the value of the tree.
10747 I.E. given <temp> = &A, return A. */
10752 tree stripped_decl;
10755 STRIP_NOPS (stripped_decl);
10756 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10757 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10760 switch (TREE_CODE (stripped_decl))
10763 return get_name (TREE_OPERAND (stripped_decl, 0));
10770 /* Return true if TYPE has a variable argument list. */
10773 stdarg_p (const_tree fntype)
10775 function_args_iterator args_iter;
10776 tree n = NULL_TREE, t;
10781 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10786 return n != NULL_TREE && n != void_type_node;
10789 /* Return true if TYPE has a prototype. */
10792 prototype_p (tree fntype)
10796 gcc_assert (fntype != NULL_TREE);
10798 t = TYPE_ARG_TYPES (fntype);
10799 return (t != NULL_TREE);
10802 /* If BLOCK is inlined from an __attribute__((__artificial__))
10803 routine, return pointer to location from where it has been
10806 block_nonartificial_location (tree block)
10808 location_t *ret = NULL;
10810 while (block && TREE_CODE (block) == BLOCK
10811 && BLOCK_ABSTRACT_ORIGIN (block))
10813 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10815 while (TREE_CODE (ao) == BLOCK
10816 && BLOCK_ABSTRACT_ORIGIN (ao)
10817 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10818 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10820 if (TREE_CODE (ao) == FUNCTION_DECL)
10822 /* If AO is an artificial inline, point RET to the
10823 call site locus at which it has been inlined and continue
10824 the loop, in case AO's caller is also an artificial
10826 if (DECL_DECLARED_INLINE_P (ao)
10827 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10828 ret = &BLOCK_SOURCE_LOCATION (block);
10832 else if (TREE_CODE (ao) != BLOCK)
10835 block = BLOCK_SUPERCONTEXT (block);
10841 /* If EXP is inlined from an __attribute__((__artificial__))
10842 function, return the location of the original call expression. */
10845 tree_nonartificial_location (tree exp)
10847 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10852 return EXPR_LOCATION (exp);
10856 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10859 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10862 cl_option_hash_hash (const void *x)
10864 const_tree const t = (const_tree) x;
10868 hashval_t hash = 0;
10870 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10872 p = (const char *)TREE_OPTIMIZATION (t);
10873 len = sizeof (struct cl_optimization);
10876 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10878 p = (const char *)TREE_TARGET_OPTION (t);
10879 len = sizeof (struct cl_target_option);
10883 gcc_unreachable ();
10885 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10887 for (i = 0; i < len; i++)
10889 hash = (hash << 4) ^ ((i << 2) | p[i]);
10894 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10895 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10899 cl_option_hash_eq (const void *x, const void *y)
10901 const_tree const xt = (const_tree) x;
10902 const_tree const yt = (const_tree) y;
10907 if (TREE_CODE (xt) != TREE_CODE (yt))
10910 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10912 xp = (const char *)TREE_OPTIMIZATION (xt);
10913 yp = (const char *)TREE_OPTIMIZATION (yt);
10914 len = sizeof (struct cl_optimization);
10917 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10919 xp = (const char *)TREE_TARGET_OPTION (xt);
10920 yp = (const char *)TREE_TARGET_OPTION (yt);
10921 len = sizeof (struct cl_target_option);
10925 gcc_unreachable ();
10927 return (memcmp (xp, yp, len) == 0);
10930 /* Build an OPTIMIZATION_NODE based on the current options. */
10933 build_optimization_node (void)
10938 /* Use the cache of optimization nodes. */
10940 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
10943 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10947 /* Insert this one into the hash table. */
10948 t = cl_optimization_node;
10951 /* Make a new node for next time round. */
10952 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10958 /* Build a TARGET_OPTION_NODE based on the current options. */
10961 build_target_option_node (void)
10966 /* Use the cache of optimization nodes. */
10968 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
10971 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10975 /* Insert this one into the hash table. */
10976 t = cl_target_option_node;
10979 /* Make a new node for next time round. */
10980 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10986 /* Determine the "ultimate origin" of a block. The block may be an inlined
10987 instance of an inlined instance of a block which is local to an inline
10988 function, so we have to trace all of the way back through the origin chain
10989 to find out what sort of node actually served as the original seed for the
10993 block_ultimate_origin (const_tree block)
10995 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10997 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10998 nodes in the function to point to themselves; ignore that if
10999 we're trying to output the abstract instance of this function. */
11000 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
11003 if (immediate_origin == NULL_TREE)
11008 tree lookahead = immediate_origin;
11012 ret_val = lookahead;
11013 lookahead = (TREE_CODE (ret_val) == BLOCK
11014 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
11016 while (lookahead != NULL && lookahead != ret_val);
11018 /* The block's abstract origin chain may not be the *ultimate* origin of
11019 the block. It could lead to a DECL that has an abstract origin set.
11020 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11021 will give us if it has one). Note that DECL's abstract origins are
11022 supposed to be the most distant ancestor (or so decl_ultimate_origin
11023 claims), so we don't need to loop following the DECL origins. */
11024 if (DECL_P (ret_val))
11025 return DECL_ORIGIN (ret_val);
11031 /* Return true if T1 and T2 are equivalent lists. */
11034 list_equal_p (const_tree t1, const_tree t2)
11036 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
11037 if (TREE_VALUE (t1) != TREE_VALUE (t2))
11042 /* Return true iff conversion in EXP generates no instruction. Mark
11043 it inline so that we fully inline into the stripping functions even
11044 though we have two uses of this function. */
11047 tree_nop_conversion (const_tree exp)
11049 tree outer_type, inner_type;
11051 if (!CONVERT_EXPR_P (exp)
11052 && TREE_CODE (exp) != NON_LVALUE_EXPR)
11054 if (TREE_OPERAND (exp, 0) == error_mark_node)
11057 outer_type = TREE_TYPE (exp);
11058 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11063 /* Use precision rather then machine mode when we can, which gives
11064 the correct answer even for submode (bit-field) types. */
11065 if ((INTEGRAL_TYPE_P (outer_type)
11066 || POINTER_TYPE_P (outer_type)
11067 || TREE_CODE (outer_type) == OFFSET_TYPE)
11068 && (INTEGRAL_TYPE_P (inner_type)
11069 || POINTER_TYPE_P (inner_type)
11070 || TREE_CODE (inner_type) == OFFSET_TYPE))
11071 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
11073 /* Otherwise fall back on comparing machine modes (e.g. for
11074 aggregate types, floats). */
11075 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
11078 /* Return true iff conversion in EXP generates no instruction. Don't
11079 consider conversions changing the signedness. */
11082 tree_sign_nop_conversion (const_tree exp)
11084 tree outer_type, inner_type;
11086 if (!tree_nop_conversion (exp))
11089 outer_type = TREE_TYPE (exp);
11090 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
11092 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
11093 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
11096 /* Strip conversions from EXP according to tree_nop_conversion and
11097 return the resulting expression. */
11100 tree_strip_nop_conversions (tree exp)
11102 while (tree_nop_conversion (exp))
11103 exp = TREE_OPERAND (exp, 0);
11107 /* Strip conversions from EXP according to tree_sign_nop_conversion
11108 and return the resulting expression. */
11111 tree_strip_sign_nop_conversions (tree exp)
11113 while (tree_sign_nop_conversion (exp))
11114 exp = TREE_OPERAND (exp, 0);
11118 static GTY(()) tree gcc_eh_personality_decl;
11120 /* Return the GCC personality function decl. */
11123 lhd_gcc_personality (void)
11125 if (!gcc_eh_personality_decl)
11126 gcc_eh_personality_decl = build_personality_function ("gcc");
11127 return gcc_eh_personality_decl;
11130 /* Try to find a base info of BINFO that would have its field decl at offset
11131 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11132 found, return, otherwise return NULL_TREE. */
11135 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
11137 tree type = BINFO_TYPE (binfo);
11141 HOST_WIDE_INT pos, size;
11145 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (expected_type))
11150 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
11152 if (TREE_CODE (fld) != FIELD_DECL)
11155 pos = int_bit_position (fld);
11156 size = tree_low_cst (DECL_SIZE (fld), 1);
11157 if (pos <= offset && (pos + size) > offset)
11160 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
11163 if (!DECL_ARTIFICIAL (fld))
11165 binfo = TYPE_BINFO (TREE_TYPE (fld));
11169 /* Offset 0 indicates the primary base, whose vtable contents are
11170 represented in the binfo for the derived class. */
11171 else if (offset != 0)
11173 tree base_binfo, found_binfo = NULL_TREE;
11174 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
11175 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
11177 found_binfo = base_binfo;
11182 binfo = found_binfo;
11185 type = TREE_TYPE (fld);
11190 /* Returns true if X is a typedef decl. */
11193 is_typedef_decl (tree x)
11195 return (x && TREE_CODE (x) == TYPE_DECL
11196 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
11199 /* Returns true iff TYPE is a type variant created for a typedef. */
11202 typedef_variant_p (tree type)
11204 return is_typedef_decl (TYPE_NAME (type));
11207 /* Warn about a use of an identifier which was marked deprecated. */
11209 warn_deprecated_use (tree node, tree attr)
11213 if (node == 0 || !warn_deprecated_decl)
11219 attr = DECL_ATTRIBUTES (node);
11220 else if (TYPE_P (node))
11222 tree decl = TYPE_STUB_DECL (node);
11224 attr = lookup_attribute ("deprecated",
11225 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
11230 attr = lookup_attribute ("deprecated", attr);
11233 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
11239 expanded_location xloc = expand_location (DECL_SOURCE_LOCATION (node));
11241 warning (OPT_Wdeprecated_declarations,
11242 "%qD is deprecated (declared at %s:%d): %s",
11243 node, xloc.file, xloc.line, msg);
11245 warning (OPT_Wdeprecated_declarations,
11246 "%qD is deprecated (declared at %s:%d)",
11247 node, xloc.file, xloc.line);
11249 else if (TYPE_P (node))
11251 tree what = NULL_TREE;
11252 tree decl = TYPE_STUB_DECL (node);
11254 if (TYPE_NAME (node))
11256 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
11257 what = TYPE_NAME (node);
11258 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
11259 && DECL_NAME (TYPE_NAME (node)))
11260 what = DECL_NAME (TYPE_NAME (node));
11265 expanded_location xloc
11266 = expand_location (DECL_SOURCE_LOCATION (decl));
11270 warning (OPT_Wdeprecated_declarations,
11271 "%qE is deprecated (declared at %s:%d): %s",
11272 what, xloc.file, xloc.line, msg);
11274 warning (OPT_Wdeprecated_declarations,
11275 "%qE is deprecated (declared at %s:%d)", what,
11276 xloc.file, xloc.line);
11281 warning (OPT_Wdeprecated_declarations,
11282 "type is deprecated (declared at %s:%d): %s",
11283 xloc.file, xloc.line, msg);
11285 warning (OPT_Wdeprecated_declarations,
11286 "type is deprecated (declared at %s:%d)",
11287 xloc.file, xloc.line);
11295 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
11298 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
11303 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
11306 warning (OPT_Wdeprecated_declarations, "type is deprecated");
11312 #include "gt-tree.h"