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"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack *h, void *obj);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts[(int) all_kinds];
127 int tree_node_sizes[(int) all_kinds];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names[] = {
148 #endif /* GATHER_STATISTICS */
150 /* Unique id for next decl created. */
151 static GTY(()) int next_decl_uid;
152 /* Unique id for next type created. */
153 static GTY(()) int next_type_uid = 1;
154 /* Unique id for next debug decl created. Use negative numbers,
155 to catch erroneous uses. */
156 static GTY(()) int next_debug_decl_uid;
158 /* Since we cannot rehash a type after it is in the table, we have to
159 keep the hash code. */
161 struct GTY(()) type_hash {
166 /* Initial size of the hash table (rounded to next prime). */
167 #define TYPE_HASH_INITIAL_SIZE 1000
169 /* Now here is the hash table. When recording a type, it is added to
170 the slot whose index is the hash code. Note that the hash table is
171 used for several kinds of types (function types, array types and
172 array index range types, for now). While all these live in the
173 same table, they are completely independent, and the hash code is
174 computed differently for each of these. */
176 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
177 htab_t type_hash_table;
179 /* Hash table and temporary node for larger integer const values. */
180 static GTY (()) tree int_cst_node;
181 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
182 htab_t int_cst_hash_table;
184 /* Hash table for optimization flags and target option flags. Use the same
185 hash table for both sets of options. Nodes for building the current
186 optimization and target option nodes. The assumption is most of the time
187 the options created will already be in the hash table, so we avoid
188 allocating and freeing up a node repeatably. */
189 static GTY (()) tree cl_optimization_node;
190 static GTY (()) tree cl_target_option_node;
191 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
192 htab_t cl_option_hash_table;
194 /* General tree->tree mapping structure for use in hash tables. */
197 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
198 htab_t debug_expr_for_decl;
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
201 htab_t value_expr_for_decl;
203 static GTY ((if_marked ("tree_priority_map_marked_p"),
204 param_is (struct tree_priority_map)))
205 htab_t init_priority_for_decl;
207 static void set_type_quals (tree, int);
208 static int type_hash_eq (const void *, const void *);
209 static hashval_t type_hash_hash (const void *);
210 static hashval_t int_cst_hash_hash (const void *);
211 static int int_cst_hash_eq (const void *, const void *);
212 static hashval_t cl_option_hash_hash (const void *);
213 static int cl_option_hash_eq (const void *, const void *);
214 static void print_type_hash_statistics (void);
215 static void print_debug_expr_statistics (void);
216 static void print_value_expr_statistics (void);
217 static int type_hash_marked_p (const void *);
218 static unsigned int type_hash_list (const_tree, hashval_t);
219 static unsigned int attribute_hash_list (const_tree, hashval_t);
221 tree global_trees[TI_MAX];
222 tree integer_types[itk_none];
224 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
226 /* Number of operands for each OpenMP clause. */
227 unsigned const char omp_clause_num_ops[] =
229 0, /* OMP_CLAUSE_ERROR */
230 1, /* OMP_CLAUSE_PRIVATE */
231 1, /* OMP_CLAUSE_SHARED */
232 1, /* OMP_CLAUSE_FIRSTPRIVATE */
233 2, /* OMP_CLAUSE_LASTPRIVATE */
234 4, /* OMP_CLAUSE_REDUCTION */
235 1, /* OMP_CLAUSE_COPYIN */
236 1, /* OMP_CLAUSE_COPYPRIVATE */
237 1, /* OMP_CLAUSE_IF */
238 1, /* OMP_CLAUSE_NUM_THREADS */
239 1, /* OMP_CLAUSE_SCHEDULE */
240 0, /* OMP_CLAUSE_NOWAIT */
241 0, /* OMP_CLAUSE_ORDERED */
242 0, /* OMP_CLAUSE_DEFAULT */
243 3, /* OMP_CLAUSE_COLLAPSE */
244 0 /* OMP_CLAUSE_UNTIED */
247 const char * const omp_clause_code_name[] =
268 /* Return the tree node structure used by tree code CODE. */
270 static inline enum tree_node_structure_enum
271 tree_node_structure_for_code (enum tree_code code)
273 switch (TREE_CODE_CLASS (code))
275 case tcc_declaration:
280 return TS_FIELD_DECL;
286 return TS_LABEL_DECL;
288 return TS_RESULT_DECL;
289 case DEBUG_EXPR_DECL:
292 return TS_CONST_DECL;
296 return TS_FUNCTION_DECL;
297 case TRANSLATION_UNIT_DECL:
298 return TS_TRANSLATION_UNIT_DECL;
300 return TS_DECL_NON_COMMON;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST: return TS_INT_CST;
320 case REAL_CST: return TS_REAL_CST;
321 case FIXED_CST: return TS_FIXED_CST;
322 case COMPLEX_CST: return TS_COMPLEX;
323 case VECTOR_CST: return TS_VECTOR;
324 case STRING_CST: return TS_STRING;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK: return TS_COMMON;
327 case IDENTIFIER_NODE: return TS_IDENTIFIER;
328 case TREE_LIST: return TS_LIST;
329 case TREE_VEC: return TS_VEC;
330 case SSA_NAME: return TS_SSA_NAME;
331 case PLACEHOLDER_EXPR: return TS_COMMON;
332 case STATEMENT_LIST: return TS_STATEMENT_LIST;
333 case BLOCK: return TS_BLOCK;
334 case CONSTRUCTOR: return TS_CONSTRUCTOR;
335 case TREE_BINFO: return TS_BINFO;
336 case OMP_CLAUSE: return TS_OMP_CLAUSE;
337 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
338 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
398 enum tree_node_structure_enum ts_code;
400 code = (enum tree_code) i;
401 ts_code = tree_node_structure_for_code (code);
403 /* Mark the TS structure itself. */
404 tree_contains_struct[code][ts_code] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL:
428 case TS_STATEMENT_LIST:
431 case TS_OPTIMIZATION:
432 case TS_TARGET_OPTION:
433 MARK_TS_COMMON (code);
437 MARK_TS_DECL_MINIMAL (code);
441 MARK_TS_DECL_COMMON (code);
444 case TS_DECL_NON_COMMON:
445 MARK_TS_DECL_WITH_VIS (code);
448 case TS_DECL_WITH_VIS:
453 MARK_TS_DECL_WRTL (code);
457 MARK_TS_DECL_COMMON (code);
461 MARK_TS_DECL_WITH_VIS (code);
465 case TS_FUNCTION_DECL:
466 MARK_TS_DECL_NON_COMMON (code);
469 case TS_TRANSLATION_UNIT_DECL:
470 MARK_TS_DECL_COMMON (code);
478 /* Basic consistency checks for attributes used in fold. */
479 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
480 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
481 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
482 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
483 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
484 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
485 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
486 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
487 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
488 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
489 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
490 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
491 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
492 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
493 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
494 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
495 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
496 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
498 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
499 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
500 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
501 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
503 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
504 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
505 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
506 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
507 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
508 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
509 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
510 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
511 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
512 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
513 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
514 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
515 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
516 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
517 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
520 #undef MARK_TS_COMMON
521 #undef MARK_TS_DECL_MINIMAL
522 #undef MARK_TS_DECL_COMMON
523 #undef MARK_TS_DECL_WRTL
524 #undef MARK_TS_DECL_WITH_VIS
525 #undef MARK_TS_DECL_NON_COMMON
534 /* Initialize the hash table of types. */
535 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
538 debug_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
539 tree_decl_map_eq, 0);
541 value_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
542 tree_decl_map_eq, 0);
543 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
544 tree_priority_map_eq, 0);
546 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
547 int_cst_hash_eq, NULL);
549 int_cst_node = make_node (INTEGER_CST);
551 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
552 cl_option_hash_eq, NULL);
554 cl_optimization_node = make_node (OPTIMIZATION_NODE);
555 cl_target_option_node = make_node (TARGET_OPTION_NODE);
557 /* Initialize the tree_contains_struct array. */
558 initialize_tree_contains_struct ();
559 lang_hooks.init_ts ();
563 /* The name of the object as the assembler will see it (but before any
564 translations made by ASM_OUTPUT_LABELREF). Often this is the same
565 as DECL_NAME. It is an IDENTIFIER_NODE. */
567 decl_assembler_name (tree decl)
569 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
570 lang_hooks.set_decl_assembler_name (decl);
571 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
574 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
577 decl_assembler_name_equal (tree decl, const_tree asmname)
579 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
580 const char *decl_str;
581 const char *asmname_str;
584 if (decl_asmname == asmname)
587 decl_str = IDENTIFIER_POINTER (decl_asmname);
588 asmname_str = IDENTIFIER_POINTER (asmname);
591 /* If the target assembler name was set by the user, things are trickier.
592 We have a leading '*' to begin with. After that, it's arguable what
593 is the correct thing to do with -fleading-underscore. Arguably, we've
594 historically been doing the wrong thing in assemble_alias by always
595 printing the leading underscore. Since we're not changing that, make
596 sure user_label_prefix follows the '*' before matching. */
597 if (decl_str[0] == '*')
599 size_t ulp_len = strlen (user_label_prefix);
605 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
606 decl_str += ulp_len, test=true;
610 if (asmname_str[0] == '*')
612 size_t ulp_len = strlen (user_label_prefix);
618 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
619 asmname_str += ulp_len, test=true;
626 return strcmp (decl_str, asmname_str) == 0;
629 /* Hash asmnames ignoring the user specified marks. */
632 decl_assembler_name_hash (const_tree asmname)
634 if (IDENTIFIER_POINTER (asmname)[0] == '*')
636 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
637 size_t ulp_len = strlen (user_label_prefix);
641 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
644 return htab_hash_string (decl_str);
647 return htab_hash_string (IDENTIFIER_POINTER (asmname));
650 /* Compute the number of bytes occupied by a tree with code CODE.
651 This function cannot be used for nodes that have variable sizes,
652 including TREE_VEC, STRING_CST, and CALL_EXPR. */
654 tree_code_size (enum tree_code code)
656 switch (TREE_CODE_CLASS (code))
658 case tcc_declaration: /* A decl node */
663 return sizeof (struct tree_field_decl);
665 return sizeof (struct tree_parm_decl);
667 return sizeof (struct tree_var_decl);
669 return sizeof (struct tree_label_decl);
671 return sizeof (struct tree_result_decl);
673 return sizeof (struct tree_const_decl);
675 return sizeof (struct tree_type_decl);
677 return sizeof (struct tree_function_decl);
678 case DEBUG_EXPR_DECL:
679 return sizeof (struct tree_decl_with_rtl);
681 return sizeof (struct tree_decl_non_common);
685 case tcc_type: /* a type node */
686 return sizeof (struct tree_type);
688 case tcc_reference: /* a reference */
689 case tcc_expression: /* an expression */
690 case tcc_statement: /* an expression with side effects */
691 case tcc_comparison: /* a comparison expression */
692 case tcc_unary: /* a unary arithmetic expression */
693 case tcc_binary: /* a binary arithmetic expression */
694 return (sizeof (struct tree_exp)
695 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
697 case tcc_constant: /* a constant */
700 case INTEGER_CST: return sizeof (struct tree_int_cst);
701 case REAL_CST: return sizeof (struct tree_real_cst);
702 case FIXED_CST: return sizeof (struct tree_fixed_cst);
703 case COMPLEX_CST: return sizeof (struct tree_complex);
704 case VECTOR_CST: return sizeof (struct tree_vector);
705 case STRING_CST: gcc_unreachable ();
707 return lang_hooks.tree_size (code);
710 case tcc_exceptional: /* something random, like an identifier. */
713 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
714 case TREE_LIST: return sizeof (struct tree_list);
717 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
720 case OMP_CLAUSE: gcc_unreachable ();
722 case SSA_NAME: return sizeof (struct tree_ssa_name);
724 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
725 case BLOCK: return sizeof (struct tree_block);
726 case CONSTRUCTOR: return sizeof (struct tree_constructor);
727 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
728 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
731 return lang_hooks.tree_size (code);
739 /* Compute the number of bytes occupied by NODE. This routine only
740 looks at TREE_CODE, except for those nodes that have variable sizes. */
742 tree_size (const_tree node)
744 const enum tree_code code = TREE_CODE (node);
748 return (offsetof (struct tree_binfo, base_binfos)
749 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
752 return (sizeof (struct tree_vec)
753 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
756 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
759 return (sizeof (struct tree_omp_clause)
760 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
764 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
765 return (sizeof (struct tree_exp)
766 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
768 return tree_code_size (code);
772 /* Return a newly allocated node of code CODE. For decl and type
773 nodes, some other fields are initialized. The rest of the node is
774 initialized to zero. This function cannot be used for TREE_VEC or
775 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
777 Achoo! I got a code in the node. */
780 make_node_stat (enum tree_code code MEM_STAT_DECL)
783 enum tree_code_class type = TREE_CODE_CLASS (code);
784 size_t length = tree_code_size (code);
785 #ifdef GATHER_STATISTICS
790 case tcc_declaration: /* A decl node */
794 case tcc_type: /* a type node */
798 case tcc_statement: /* an expression with side effects */
802 case tcc_reference: /* a reference */
806 case tcc_expression: /* an expression */
807 case tcc_comparison: /* a comparison expression */
808 case tcc_unary: /* a unary arithmetic expression */
809 case tcc_binary: /* a binary arithmetic expression */
813 case tcc_constant: /* a constant */
817 case tcc_exceptional: /* something random, like an identifier. */
820 case IDENTIFIER_NODE:
833 kind = ssa_name_kind;
854 tree_node_counts[(int) kind]++;
855 tree_node_sizes[(int) kind] += length;
858 t = ggc_alloc_zone_cleared_tree_node_stat (
859 (code == IDENTIFIER_NODE) ? &tree_id_zone : &tree_zone,
860 length PASS_MEM_STAT);
861 TREE_SET_CODE (t, code);
866 TREE_SIDE_EFFECTS (t) = 1;
869 case tcc_declaration:
870 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
872 if (code == FUNCTION_DECL)
874 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
875 DECL_MODE (t) = FUNCTION_MODE;
880 DECL_SOURCE_LOCATION (t) = input_location;
881 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
882 DECL_UID (t) = --next_debug_decl_uid;
885 DECL_UID (t) = next_decl_uid++;
886 SET_DECL_PT_UID (t, -1);
888 if (TREE_CODE (t) == LABEL_DECL)
889 LABEL_DECL_UID (t) = -1;
894 TYPE_UID (t) = next_type_uid++;
895 TYPE_ALIGN (t) = BITS_PER_UNIT;
896 TYPE_USER_ALIGN (t) = 0;
897 TYPE_MAIN_VARIANT (t) = t;
898 TYPE_CANONICAL (t) = t;
900 /* Default to no attributes for type, but let target change that. */
901 TYPE_ATTRIBUTES (t) = NULL_TREE;
902 targetm.set_default_type_attributes (t);
904 /* We have not yet computed the alias set for this type. */
905 TYPE_ALIAS_SET (t) = -1;
909 TREE_CONSTANT (t) = 1;
918 case PREDECREMENT_EXPR:
919 case PREINCREMENT_EXPR:
920 case POSTDECREMENT_EXPR:
921 case POSTINCREMENT_EXPR:
922 /* All of these have side-effects, no matter what their
924 TREE_SIDE_EFFECTS (t) = 1;
933 /* Other classes need no special treatment. */
940 /* Return a new node with the same contents as NODE except that its
941 TREE_CHAIN is zero and it has a fresh uid. */
944 copy_node_stat (tree node MEM_STAT_DECL)
947 enum tree_code code = TREE_CODE (node);
950 gcc_assert (code != STATEMENT_LIST);
952 length = tree_size (node);
953 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
954 memcpy (t, node, length);
957 TREE_ASM_WRITTEN (t) = 0;
958 TREE_VISITED (t) = 0;
959 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
960 *DECL_VAR_ANN_PTR (t) = 0;
962 if (TREE_CODE_CLASS (code) == tcc_declaration)
964 if (code == DEBUG_EXPR_DECL)
965 DECL_UID (t) = --next_debug_decl_uid;
968 DECL_UID (t) = next_decl_uid++;
969 if (DECL_PT_UID_SET_P (node))
970 SET_DECL_PT_UID (t, DECL_PT_UID (node));
972 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
973 && DECL_HAS_VALUE_EXPR_P (node))
975 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
976 DECL_HAS_VALUE_EXPR_P (t) = 1;
978 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
980 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
981 DECL_HAS_INIT_PRIORITY_P (t) = 1;
984 else if (TREE_CODE_CLASS (code) == tcc_type)
986 TYPE_UID (t) = next_type_uid++;
987 /* The following is so that the debug code for
988 the copy is different from the original type.
989 The two statements usually duplicate each other
990 (because they clear fields of the same union),
991 but the optimizer should catch that. */
992 TYPE_SYMTAB_POINTER (t) = 0;
993 TYPE_SYMTAB_ADDRESS (t) = 0;
995 /* Do not copy the values cache. */
996 if (TYPE_CACHED_VALUES_P(t))
998 TYPE_CACHED_VALUES_P (t) = 0;
999 TYPE_CACHED_VALUES (t) = NULL_TREE;
1006 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1007 For example, this can copy a list made of TREE_LIST nodes. */
1010 copy_list (tree list)
1018 head = prev = copy_node (list);
1019 next = TREE_CHAIN (list);
1022 TREE_CHAIN (prev) = copy_node (next);
1023 prev = TREE_CHAIN (prev);
1024 next = TREE_CHAIN (next);
1030 /* Create an INT_CST node with a LOW value sign extended. */
1033 build_int_cst (tree type, HOST_WIDE_INT low)
1035 /* Support legacy code. */
1037 type = integer_type_node;
1039 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1042 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1043 if it is negative. This function is similar to build_int_cst, but
1044 the extra bits outside of the type precision are cleared. Constants
1045 with these extra bits may confuse the fold so that it detects overflows
1046 even in cases when they do not occur, and in general should be avoided.
1047 We cannot however make this a default behavior of build_int_cst without
1048 more intrusive changes, since there are parts of gcc that rely on the extra
1049 precision of the integer constants. */
1052 build_int_cst_type (tree type, HOST_WIDE_INT low)
1056 return double_int_to_tree (type, shwi_to_double_int (low));
1059 /* Constructs tree in type TYPE from with value given by CST. Signedness
1060 of CST is assumed to be the same as the signedness of TYPE. */
1063 double_int_to_tree (tree type, double_int cst)
1065 /* Size types *are* sign extended. */
1066 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1067 || (TREE_CODE (type) == INTEGER_TYPE
1068 && TYPE_IS_SIZETYPE (type)));
1070 cst = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1072 return build_int_cst_wide (type, cst.low, cst.high);
1075 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1076 to be the same as the signedness of TYPE. */
1079 double_int_fits_to_tree_p (const_tree type, double_int cst)
1081 /* Size types *are* sign extended. */
1082 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1083 || (TREE_CODE (type) == INTEGER_TYPE
1084 && TYPE_IS_SIZETYPE (type)));
1087 = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1089 return double_int_equal_p (cst, ext);
1092 /* We force the double_int CST to the range of the type TYPE by sign or
1093 zero extending it. OVERFLOWABLE indicates if we are interested in
1094 overflow of the value, when >0 we are only interested in signed
1095 overflow, for <0 we are interested in any overflow. OVERFLOWED
1096 indicates whether overflow has already occurred. CONST_OVERFLOWED
1097 indicates whether constant overflow has already occurred. We force
1098 T's value to be within range of T's type (by setting to 0 or 1 all
1099 the bits outside the type's range). We set TREE_OVERFLOWED if,
1100 OVERFLOWED is nonzero,
1101 or OVERFLOWABLE is >0 and signed overflow occurs
1102 or OVERFLOWABLE is <0 and any overflow occurs
1103 We return a new tree node for the extended double_int. The node
1104 is shared if no overflow flags are set. */
1108 force_fit_type_double (tree type, double_int cst, int overflowable,
1111 bool sign_extended_type;
1113 /* Size types *are* sign extended. */
1114 sign_extended_type = (!TYPE_UNSIGNED (type)
1115 || (TREE_CODE (type) == INTEGER_TYPE
1116 && TYPE_IS_SIZETYPE (type)));
1118 /* If we need to set overflow flags, return a new unshared node. */
1119 if (overflowed || !double_int_fits_to_tree_p(type, cst))
1123 || (overflowable > 0 && sign_extended_type))
1125 tree t = make_node (INTEGER_CST);
1126 TREE_INT_CST (t) = double_int_ext (cst, TYPE_PRECISION (type),
1127 !sign_extended_type);
1128 TREE_TYPE (t) = type;
1129 TREE_OVERFLOW (t) = 1;
1134 /* Else build a shared node. */
1135 return double_int_to_tree (type, cst);
1138 /* These are the hash table functions for the hash table of INTEGER_CST
1139 nodes of a sizetype. */
1141 /* Return the hash code code X, an INTEGER_CST. */
1144 int_cst_hash_hash (const void *x)
1146 const_tree const t = (const_tree) x;
1148 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1149 ^ htab_hash_pointer (TREE_TYPE (t)));
1152 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1153 is the same as that given by *Y, which is the same. */
1156 int_cst_hash_eq (const void *x, const void *y)
1158 const_tree const xt = (const_tree) x;
1159 const_tree const yt = (const_tree) y;
1161 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1162 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1163 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1166 /* Create an INT_CST node of TYPE and value HI:LOW.
1167 The returned node is always shared. For small integers we use a
1168 per-type vector cache, for larger ones we use a single hash table. */
1171 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1179 switch (TREE_CODE (type))
1182 gcc_assert (hi == 0 && low == 0);
1186 case REFERENCE_TYPE:
1187 /* Cache NULL pointer. */
1196 /* Cache false or true. */
1204 if (TYPE_UNSIGNED (type))
1207 limit = INTEGER_SHARE_LIMIT;
1208 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1214 limit = INTEGER_SHARE_LIMIT + 1;
1215 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1217 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1231 /* Look for it in the type's vector of small shared ints. */
1232 if (!TYPE_CACHED_VALUES_P (type))
1234 TYPE_CACHED_VALUES_P (type) = 1;
1235 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1238 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1241 /* Make sure no one is clobbering the shared constant. */
1242 gcc_assert (TREE_TYPE (t) == type);
1243 gcc_assert (TREE_INT_CST_LOW (t) == low);
1244 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1248 /* Create a new shared int. */
1249 t = make_node (INTEGER_CST);
1251 TREE_INT_CST_LOW (t) = low;
1252 TREE_INT_CST_HIGH (t) = hi;
1253 TREE_TYPE (t) = type;
1255 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1260 /* Use the cache of larger shared ints. */
1263 TREE_INT_CST_LOW (int_cst_node) = low;
1264 TREE_INT_CST_HIGH (int_cst_node) = hi;
1265 TREE_TYPE (int_cst_node) = type;
1267 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1271 /* Insert this one into the hash table. */
1274 /* Make a new node for next time round. */
1275 int_cst_node = make_node (INTEGER_CST);
1282 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1283 and the rest are zeros. */
1286 build_low_bits_mask (tree type, unsigned bits)
1290 gcc_assert (bits <= TYPE_PRECISION (type));
1292 if (bits == TYPE_PRECISION (type)
1293 && !TYPE_UNSIGNED (type))
1294 /* Sign extended all-ones mask. */
1295 mask = double_int_minus_one;
1297 mask = double_int_mask (bits);
1299 return build_int_cst_wide (type, mask.low, mask.high);
1302 /* Checks that X is integer constant that can be expressed in (unsigned)
1303 HOST_WIDE_INT without loss of precision. */
1306 cst_and_fits_in_hwi (const_tree x)
1308 if (TREE_CODE (x) != INTEGER_CST)
1311 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1314 return (TREE_INT_CST_HIGH (x) == 0
1315 || TREE_INT_CST_HIGH (x) == -1);
1318 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1319 are in a list pointed to by VALS. */
1322 build_vector (tree type, tree vals)
1324 tree v = make_node (VECTOR_CST);
1329 TREE_VECTOR_CST_ELTS (v) = vals;
1330 TREE_TYPE (v) = type;
1332 /* Iterate through elements and check for overflow. */
1333 for (link = vals; link; link = TREE_CHAIN (link))
1335 tree value = TREE_VALUE (link);
1338 /* Don't crash if we get an address constant. */
1339 if (!CONSTANT_CLASS_P (value))
1342 over |= TREE_OVERFLOW (value);
1345 gcc_assert (cnt == TYPE_VECTOR_SUBPARTS (type));
1347 TREE_OVERFLOW (v) = over;
1351 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1352 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1355 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1357 tree list = NULL_TREE;
1358 unsigned HOST_WIDE_INT idx;
1361 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1362 list = tree_cons (NULL_TREE, value, list);
1363 for (; idx < TYPE_VECTOR_SUBPARTS (type); ++idx)
1364 list = tree_cons (NULL_TREE,
1365 build_zero_cst (TREE_TYPE (type)), list);
1366 return build_vector (type, nreverse (list));
1369 /* Build a vector of type VECTYPE where all the elements are SCs. */
1371 build_vector_from_val (tree vectype, tree sc)
1373 int i, nunits = TYPE_VECTOR_SUBPARTS (vectype);
1374 VEC(constructor_elt, gc) *v = NULL;
1376 if (sc == error_mark_node)
1379 /* Verify that the vector type is suitable for SC. Note that there
1380 is some inconsistency in the type-system with respect to restrict
1381 qualifications of pointers. Vector types always have a main-variant
1382 element type and the qualification is applied to the vector-type.
1383 So TREE_TYPE (vector-type) does not return a properly qualified
1384 vector element-type. */
1385 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc)),
1386 TREE_TYPE (vectype)));
1388 v = VEC_alloc (constructor_elt, gc, nunits);
1389 for (i = 0; i < nunits; ++i)
1390 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, sc);
1392 if (CONSTANT_CLASS_P (sc))
1393 return build_vector_from_ctor (vectype, v);
1395 return build_constructor (vectype, v);
1398 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1399 are in the VEC pointed to by VALS. */
1401 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1403 tree c = make_node (CONSTRUCTOR);
1405 constructor_elt *elt;
1406 bool constant_p = true;
1408 TREE_TYPE (c) = type;
1409 CONSTRUCTOR_ELTS (c) = vals;
1411 FOR_EACH_VEC_ELT (constructor_elt, vals, i, elt)
1412 if (!TREE_CONSTANT (elt->value))
1418 TREE_CONSTANT (c) = constant_p;
1423 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1426 build_constructor_single (tree type, tree index, tree value)
1428 VEC(constructor_elt,gc) *v;
1429 constructor_elt *elt;
1431 v = VEC_alloc (constructor_elt, gc, 1);
1432 elt = VEC_quick_push (constructor_elt, v, NULL);
1436 return build_constructor (type, v);
1440 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1441 are in a list pointed to by VALS. */
1443 build_constructor_from_list (tree type, tree vals)
1446 VEC(constructor_elt,gc) *v = NULL;
1450 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1451 for (t = vals; t; t = TREE_CHAIN (t))
1452 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1455 return build_constructor (type, v);
1458 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1461 build_fixed (tree type, FIXED_VALUE_TYPE f)
1464 FIXED_VALUE_TYPE *fp;
1466 v = make_node (FIXED_CST);
1467 fp = ggc_alloc_fixed_value ();
1468 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1470 TREE_TYPE (v) = type;
1471 TREE_FIXED_CST_PTR (v) = fp;
1475 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1478 build_real (tree type, REAL_VALUE_TYPE d)
1481 REAL_VALUE_TYPE *dp;
1484 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1485 Consider doing it via real_convert now. */
1487 v = make_node (REAL_CST);
1488 dp = ggc_alloc_real_value ();
1489 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1491 TREE_TYPE (v) = type;
1492 TREE_REAL_CST_PTR (v) = dp;
1493 TREE_OVERFLOW (v) = overflow;
1497 /* Return a new REAL_CST node whose type is TYPE
1498 and whose value is the integer value of the INTEGER_CST node I. */
1501 real_value_from_int_cst (const_tree type, const_tree i)
1505 /* Clear all bits of the real value type so that we can later do
1506 bitwise comparisons to see if two values are the same. */
1507 memset (&d, 0, sizeof d);
1509 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1510 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1511 TYPE_UNSIGNED (TREE_TYPE (i)));
1515 /* Given a tree representing an integer constant I, return a tree
1516 representing the same value as a floating-point constant of type TYPE. */
1519 build_real_from_int_cst (tree type, const_tree i)
1522 int overflow = TREE_OVERFLOW (i);
1524 v = build_real (type, real_value_from_int_cst (type, i));
1526 TREE_OVERFLOW (v) |= overflow;
1530 /* Return a newly constructed STRING_CST node whose value is
1531 the LEN characters at STR.
1532 The TREE_TYPE is not initialized. */
1535 build_string (int len, const char *str)
1540 /* Do not waste bytes provided by padding of struct tree_string. */
1541 length = len + offsetof (struct tree_string, str) + 1;
1543 #ifdef GATHER_STATISTICS
1544 tree_node_counts[(int) c_kind]++;
1545 tree_node_sizes[(int) c_kind] += length;
1548 s = ggc_alloc_tree_node (length);
1550 memset (s, 0, sizeof (struct tree_common));
1551 TREE_SET_CODE (s, STRING_CST);
1552 TREE_CONSTANT (s) = 1;
1553 TREE_STRING_LENGTH (s) = len;
1554 memcpy (s->string.str, str, len);
1555 s->string.str[len] = '\0';
1560 /* Return a newly constructed COMPLEX_CST node whose value is
1561 specified by the real and imaginary parts REAL and IMAG.
1562 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1563 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1566 build_complex (tree type, tree real, tree imag)
1568 tree t = make_node (COMPLEX_CST);
1570 TREE_REALPART (t) = real;
1571 TREE_IMAGPART (t) = imag;
1572 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1573 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1577 /* Return a constant of arithmetic type TYPE which is the
1578 multiplicative identity of the set TYPE. */
1581 build_one_cst (tree type)
1583 switch (TREE_CODE (type))
1585 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1586 case POINTER_TYPE: case REFERENCE_TYPE:
1588 return build_int_cst (type, 1);
1591 return build_real (type, dconst1);
1593 case FIXED_POINT_TYPE:
1594 /* We can only generate 1 for accum types. */
1595 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1596 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1600 tree scalar = build_one_cst (TREE_TYPE (type));
1602 return build_vector_from_val (type, scalar);
1606 return build_complex (type,
1607 build_one_cst (TREE_TYPE (type)),
1608 build_zero_cst (TREE_TYPE (type)));
1615 /* Build 0 constant of type TYPE. This is used by constructor folding
1616 and thus the constant should be represented in memory by
1620 build_zero_cst (tree type)
1622 switch (TREE_CODE (type))
1624 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1625 case POINTER_TYPE: case REFERENCE_TYPE:
1627 return build_int_cst (type, 0);
1630 return build_real (type, dconst0);
1632 case FIXED_POINT_TYPE:
1633 return build_fixed (type, FCONST0 (TYPE_MODE (type)));
1637 tree scalar = build_zero_cst (TREE_TYPE (type));
1639 return build_vector_from_val (type, scalar);
1644 tree zero = build_zero_cst (TREE_TYPE (type));
1646 return build_complex (type, zero, zero);
1650 if (!AGGREGATE_TYPE_P (type))
1651 return fold_convert (type, integer_zero_node);
1652 return build_constructor (type, NULL);
1657 /* Build a BINFO with LEN language slots. */
1660 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1663 size_t length = (offsetof (struct tree_binfo, base_binfos)
1664 + VEC_embedded_size (tree, base_binfos));
1666 #ifdef GATHER_STATISTICS
1667 tree_node_counts[(int) binfo_kind]++;
1668 tree_node_sizes[(int) binfo_kind] += length;
1671 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1673 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1675 TREE_SET_CODE (t, TREE_BINFO);
1677 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1683 /* Build a newly constructed TREE_VEC node of length LEN. */
1686 make_tree_vec_stat (int len MEM_STAT_DECL)
1689 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1691 #ifdef GATHER_STATISTICS
1692 tree_node_counts[(int) vec_kind]++;
1693 tree_node_sizes[(int) vec_kind] += 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 /* Note that using TYPE_PRECISION here is wrong. We care about the
1763 actual bits, not the (arbitrary) range of the type. */
1764 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1765 if (prec >= HOST_BITS_PER_WIDE_INT)
1767 HOST_WIDE_INT high_value;
1770 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1772 /* Can not handle precisions greater than twice the host int size. */
1773 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1774 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1775 /* Shifting by the host word size is undefined according to the ANSI
1776 standard, so we must handle this as a special case. */
1779 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1781 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1782 && TREE_INT_CST_HIGH (expr) == high_value);
1785 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1788 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1792 integer_pow2p (const_tree expr)
1795 HOST_WIDE_INT high, low;
1799 if (TREE_CODE (expr) == COMPLEX_CST
1800 && integer_pow2p (TREE_REALPART (expr))
1801 && integer_zerop (TREE_IMAGPART (expr)))
1804 if (TREE_CODE (expr) != INTEGER_CST)
1807 prec = TYPE_PRECISION (TREE_TYPE (expr));
1808 high = TREE_INT_CST_HIGH (expr);
1809 low = TREE_INT_CST_LOW (expr);
1811 /* First clear all bits that are beyond the type's precision in case
1812 we've been sign extended. */
1814 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1816 else if (prec > HOST_BITS_PER_WIDE_INT)
1817 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1821 if (prec < HOST_BITS_PER_WIDE_INT)
1822 low &= ~((HOST_WIDE_INT) (-1) << prec);
1825 if (high == 0 && low == 0)
1828 return ((high == 0 && (low & (low - 1)) == 0)
1829 || (low == 0 && (high & (high - 1)) == 0));
1832 /* Return 1 if EXPR is an integer constant other than zero or a
1833 complex constant other than zero. */
1836 integer_nonzerop (const_tree expr)
1840 return ((TREE_CODE (expr) == INTEGER_CST
1841 && (TREE_INT_CST_LOW (expr) != 0
1842 || TREE_INT_CST_HIGH (expr) != 0))
1843 || (TREE_CODE (expr) == COMPLEX_CST
1844 && (integer_nonzerop (TREE_REALPART (expr))
1845 || integer_nonzerop (TREE_IMAGPART (expr)))));
1848 /* Return 1 if EXPR is the fixed-point constant zero. */
1851 fixed_zerop (const_tree expr)
1853 return (TREE_CODE (expr) == FIXED_CST
1854 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1857 /* Return the power of two represented by a tree node known to be a
1861 tree_log2 (const_tree expr)
1864 HOST_WIDE_INT high, low;
1868 if (TREE_CODE (expr) == COMPLEX_CST)
1869 return tree_log2 (TREE_REALPART (expr));
1871 prec = TYPE_PRECISION (TREE_TYPE (expr));
1872 high = TREE_INT_CST_HIGH (expr);
1873 low = TREE_INT_CST_LOW (expr);
1875 /* First clear all bits that are beyond the type's precision in case
1876 we've been sign extended. */
1878 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1880 else if (prec > HOST_BITS_PER_WIDE_INT)
1881 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1885 if (prec < HOST_BITS_PER_WIDE_INT)
1886 low &= ~((HOST_WIDE_INT) (-1) << prec);
1889 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1890 : exact_log2 (low));
1893 /* Similar, but return the largest integer Y such that 2 ** Y is less
1894 than or equal to EXPR. */
1897 tree_floor_log2 (const_tree expr)
1900 HOST_WIDE_INT high, low;
1904 if (TREE_CODE (expr) == COMPLEX_CST)
1905 return tree_log2 (TREE_REALPART (expr));
1907 prec = TYPE_PRECISION (TREE_TYPE (expr));
1908 high = TREE_INT_CST_HIGH (expr);
1909 low = TREE_INT_CST_LOW (expr);
1911 /* First clear all bits that are beyond the type's precision in case
1912 we've been sign extended. Ignore if type's precision hasn't been set
1913 since what we are doing is setting it. */
1915 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1917 else if (prec > HOST_BITS_PER_WIDE_INT)
1918 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1922 if (prec < HOST_BITS_PER_WIDE_INT)
1923 low &= ~((HOST_WIDE_INT) (-1) << prec);
1926 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1927 : floor_log2 (low));
1930 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1931 decimal float constants, so don't return 1 for them. */
1934 real_zerop (const_tree expr)
1938 return ((TREE_CODE (expr) == REAL_CST
1939 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1940 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1941 || (TREE_CODE (expr) == COMPLEX_CST
1942 && real_zerop (TREE_REALPART (expr))
1943 && real_zerop (TREE_IMAGPART (expr))));
1946 /* Return 1 if EXPR is the real constant one in real or complex form.
1947 Trailing zeroes matter for decimal float constants, so don't return
1951 real_onep (const_tree expr)
1955 return ((TREE_CODE (expr) == REAL_CST
1956 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1957 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1958 || (TREE_CODE (expr) == COMPLEX_CST
1959 && real_onep (TREE_REALPART (expr))
1960 && real_zerop (TREE_IMAGPART (expr))));
1963 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1964 for decimal float constants, so don't return 1 for them. */
1967 real_twop (const_tree expr)
1971 return ((TREE_CODE (expr) == REAL_CST
1972 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1973 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1974 || (TREE_CODE (expr) == COMPLEX_CST
1975 && real_twop (TREE_REALPART (expr))
1976 && real_zerop (TREE_IMAGPART (expr))));
1979 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1980 matter for decimal float constants, so don't return 1 for them. */
1983 real_minus_onep (const_tree expr)
1987 return ((TREE_CODE (expr) == REAL_CST
1988 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1989 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1990 || (TREE_CODE (expr) == COMPLEX_CST
1991 && real_minus_onep (TREE_REALPART (expr))
1992 && real_zerop (TREE_IMAGPART (expr))));
1995 /* Nonzero if EXP is a constant or a cast of a constant. */
1998 really_constant_p (const_tree exp)
2000 /* This is not quite the same as STRIP_NOPS. It does more. */
2001 while (CONVERT_EXPR_P (exp)
2002 || TREE_CODE (exp) == NON_LVALUE_EXPR)
2003 exp = TREE_OPERAND (exp, 0);
2004 return TREE_CONSTANT (exp);
2007 /* Return first list element whose TREE_VALUE is ELEM.
2008 Return 0 if ELEM is not in LIST. */
2011 value_member (tree elem, tree list)
2015 if (elem == TREE_VALUE (list))
2017 list = TREE_CHAIN (list);
2022 /* Return first list element whose TREE_PURPOSE is ELEM.
2023 Return 0 if ELEM is not in LIST. */
2026 purpose_member (const_tree elem, tree list)
2030 if (elem == TREE_PURPOSE (list))
2032 list = TREE_CHAIN (list);
2037 /* Return true if ELEM is in V. */
2040 vec_member (const_tree elem, VEC(tree,gc) *v)
2044 FOR_EACH_VEC_ELT (tree, v, ix, t)
2050 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2054 chain_index (int idx, tree chain)
2056 for (; chain && idx > 0; --idx)
2057 chain = TREE_CHAIN (chain);
2061 /* Return nonzero if ELEM is part of the chain CHAIN. */
2064 chain_member (const_tree elem, const_tree chain)
2070 chain = DECL_CHAIN (chain);
2076 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2077 We expect a null pointer to mark the end of the chain.
2078 This is the Lisp primitive `length'. */
2081 list_length (const_tree t)
2084 #ifdef ENABLE_TREE_CHECKING
2092 #ifdef ENABLE_TREE_CHECKING
2095 gcc_assert (p != q);
2103 /* Returns the number of FIELD_DECLs in TYPE. */
2106 fields_length (const_tree type)
2108 tree t = TYPE_FIELDS (type);
2111 for (; t; t = DECL_CHAIN (t))
2112 if (TREE_CODE (t) == FIELD_DECL)
2118 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2119 UNION_TYPE TYPE, or NULL_TREE if none. */
2122 first_field (const_tree type)
2124 tree t = TYPE_FIELDS (type);
2125 while (t && TREE_CODE (t) != FIELD_DECL)
2130 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2131 by modifying the last node in chain 1 to point to chain 2.
2132 This is the Lisp primitive `nconc'. */
2135 chainon (tree op1, tree op2)
2144 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2146 TREE_CHAIN (t1) = op2;
2148 #ifdef ENABLE_TREE_CHECKING
2151 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2152 gcc_assert (t2 != t1);
2159 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2162 tree_last (tree chain)
2166 while ((next = TREE_CHAIN (chain)))
2171 /* Reverse the order of elements in the chain T,
2172 and return the new head of the chain (old last element). */
2177 tree prev = 0, decl, next;
2178 for (decl = t; decl; decl = next)
2180 /* We shouldn't be using this function to reverse BLOCK chains; we
2181 have blocks_nreverse for that. */
2182 gcc_checking_assert (TREE_CODE (decl) != BLOCK);
2183 next = TREE_CHAIN (decl);
2184 TREE_CHAIN (decl) = prev;
2190 /* Return a newly created TREE_LIST node whose
2191 purpose and value fields are PARM and VALUE. */
2194 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2196 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2197 TREE_PURPOSE (t) = parm;
2198 TREE_VALUE (t) = value;
2202 /* Build a chain of TREE_LIST nodes from a vector. */
2205 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2207 tree ret = NULL_TREE;
2211 FOR_EACH_VEC_ELT (tree, vec, i, t)
2213 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2214 pp = &TREE_CHAIN (*pp);
2219 /* Return a newly created TREE_LIST node whose
2220 purpose and value fields are PURPOSE and VALUE
2221 and whose TREE_CHAIN is CHAIN. */
2224 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2228 node = ggc_alloc_zone_tree_node_stat (&tree_zone, sizeof (struct tree_list)
2230 memset (node, 0, sizeof (struct tree_common));
2232 #ifdef GATHER_STATISTICS
2233 tree_node_counts[(int) x_kind]++;
2234 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2237 TREE_SET_CODE (node, TREE_LIST);
2238 TREE_CHAIN (node) = chain;
2239 TREE_PURPOSE (node) = purpose;
2240 TREE_VALUE (node) = value;
2244 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2248 ctor_to_vec (tree ctor)
2250 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2254 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2255 VEC_quick_push (tree, vec, val);
2260 /* Return the size nominally occupied by an object of type TYPE
2261 when it resides in memory. The value is measured in units of bytes,
2262 and its data type is that normally used for type sizes
2263 (which is the first type created by make_signed_type or
2264 make_unsigned_type). */
2267 size_in_bytes (const_tree type)
2271 if (type == error_mark_node)
2272 return integer_zero_node;
2274 type = TYPE_MAIN_VARIANT (type);
2275 t = TYPE_SIZE_UNIT (type);
2279 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2280 return size_zero_node;
2286 /* Return the size of TYPE (in bytes) as a wide integer
2287 or return -1 if the size can vary or is larger than an integer. */
2290 int_size_in_bytes (const_tree type)
2294 if (type == error_mark_node)
2297 type = TYPE_MAIN_VARIANT (type);
2298 t = TYPE_SIZE_UNIT (type);
2300 || TREE_CODE (t) != INTEGER_CST
2301 || TREE_INT_CST_HIGH (t) != 0
2302 /* If the result would appear negative, it's too big to represent. */
2303 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2306 return TREE_INT_CST_LOW (t);
2309 /* Return the maximum size of TYPE (in bytes) as a wide integer
2310 or return -1 if the size can vary or is larger than an integer. */
2313 max_int_size_in_bytes (const_tree type)
2315 HOST_WIDE_INT size = -1;
2318 /* If this is an array type, check for a possible MAX_SIZE attached. */
2320 if (TREE_CODE (type) == ARRAY_TYPE)
2322 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2324 if (size_tree && host_integerp (size_tree, 1))
2325 size = tree_low_cst (size_tree, 1);
2328 /* If we still haven't been able to get a size, see if the language
2329 can compute a maximum size. */
2333 size_tree = lang_hooks.types.max_size (type);
2335 if (size_tree && host_integerp (size_tree, 1))
2336 size = tree_low_cst (size_tree, 1);
2342 /* Returns a tree for the size of EXP in bytes. */
2345 tree_expr_size (const_tree exp)
2348 && DECL_SIZE_UNIT (exp) != 0)
2349 return DECL_SIZE_UNIT (exp);
2351 return size_in_bytes (TREE_TYPE (exp));
2354 /* Return the bit position of FIELD, in bits from the start of the record.
2355 This is a tree of type bitsizetype. */
2358 bit_position (const_tree field)
2360 return bit_from_pos (DECL_FIELD_OFFSET (field),
2361 DECL_FIELD_BIT_OFFSET (field));
2364 /* Likewise, but return as an integer. It must be representable in
2365 that way (since it could be a signed value, we don't have the
2366 option of returning -1 like int_size_in_byte can. */
2369 int_bit_position (const_tree field)
2371 return tree_low_cst (bit_position (field), 0);
2374 /* Return the byte position of FIELD, in bytes from the start of the record.
2375 This is a tree of type sizetype. */
2378 byte_position (const_tree field)
2380 return byte_from_pos (DECL_FIELD_OFFSET (field),
2381 DECL_FIELD_BIT_OFFSET (field));
2384 /* Likewise, but return as an integer. It must be representable in
2385 that way (since it could be a signed value, we don't have the
2386 option of returning -1 like int_size_in_byte can. */
2389 int_byte_position (const_tree field)
2391 return tree_low_cst (byte_position (field), 0);
2394 /* Return the strictest alignment, in bits, that T is known to have. */
2397 expr_align (const_tree t)
2399 unsigned int align0, align1;
2401 switch (TREE_CODE (t))
2403 CASE_CONVERT: case NON_LVALUE_EXPR:
2404 /* If we have conversions, we know that the alignment of the
2405 object must meet each of the alignments of the types. */
2406 align0 = expr_align (TREE_OPERAND (t, 0));
2407 align1 = TYPE_ALIGN (TREE_TYPE (t));
2408 return MAX (align0, align1);
2410 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2411 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2412 case CLEANUP_POINT_EXPR:
2413 /* These don't change the alignment of an object. */
2414 return expr_align (TREE_OPERAND (t, 0));
2417 /* The best we can do is say that the alignment is the least aligned
2419 align0 = expr_align (TREE_OPERAND (t, 1));
2420 align1 = expr_align (TREE_OPERAND (t, 2));
2421 return MIN (align0, align1);
2423 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2424 meaningfully, it's always 1. */
2425 case LABEL_DECL: case CONST_DECL:
2426 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2428 gcc_assert (DECL_ALIGN (t) != 0);
2429 return DECL_ALIGN (t);
2435 /* Otherwise take the alignment from that of the type. */
2436 return TYPE_ALIGN (TREE_TYPE (t));
2439 /* Return, as a tree node, the number of elements for TYPE (which is an
2440 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2443 array_type_nelts (const_tree type)
2445 tree index_type, min, max;
2447 /* If they did it with unspecified bounds, then we should have already
2448 given an error about it before we got here. */
2449 if (! TYPE_DOMAIN (type))
2450 return error_mark_node;
2452 index_type = TYPE_DOMAIN (type);
2453 min = TYPE_MIN_VALUE (index_type);
2454 max = TYPE_MAX_VALUE (index_type);
2456 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2458 return error_mark_node;
2460 return (integer_zerop (min)
2462 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2465 /* If arg is static -- a reference to an object in static storage -- then
2466 return the object. This is not the same as the C meaning of `static'.
2467 If arg isn't static, return NULL. */
2472 switch (TREE_CODE (arg))
2475 /* Nested functions are static, even though taking their address will
2476 involve a trampoline as we unnest the nested function and create
2477 the trampoline on the tree level. */
2481 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2482 && ! DECL_THREAD_LOCAL_P (arg)
2483 && ! DECL_DLLIMPORT_P (arg)
2487 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2491 return TREE_STATIC (arg) ? arg : NULL;
2498 /* If the thing being referenced is not a field, then it is
2499 something language specific. */
2500 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2502 /* If we are referencing a bitfield, we can't evaluate an
2503 ADDR_EXPR at compile time and so it isn't a constant. */
2504 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2507 return staticp (TREE_OPERAND (arg, 0));
2513 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2516 case ARRAY_RANGE_REF:
2517 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2518 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2519 return staticp (TREE_OPERAND (arg, 0));
2523 case COMPOUND_LITERAL_EXPR:
2524 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2534 /* Return whether OP is a DECL whose address is function-invariant. */
2537 decl_address_invariant_p (const_tree op)
2539 /* The conditions below are slightly less strict than the one in
2542 switch (TREE_CODE (op))
2551 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2552 || DECL_THREAD_LOCAL_P (op)
2553 || DECL_CONTEXT (op) == current_function_decl
2554 || decl_function_context (op) == current_function_decl)
2559 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2560 || decl_function_context (op) == current_function_decl)
2571 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2574 decl_address_ip_invariant_p (const_tree op)
2576 /* The conditions below are slightly less strict than the one in
2579 switch (TREE_CODE (op))
2587 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2588 && !DECL_DLLIMPORT_P (op))
2589 || DECL_THREAD_LOCAL_P (op))
2594 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2606 /* Return true if T is function-invariant (internal function, does
2607 not handle arithmetic; that's handled in skip_simple_arithmetic and
2608 tree_invariant_p). */
2610 static bool tree_invariant_p (tree t);
2613 tree_invariant_p_1 (tree t)
2617 if (TREE_CONSTANT (t)
2618 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2621 switch (TREE_CODE (t))
2627 op = TREE_OPERAND (t, 0);
2628 while (handled_component_p (op))
2630 switch (TREE_CODE (op))
2633 case ARRAY_RANGE_REF:
2634 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2635 || TREE_OPERAND (op, 2) != NULL_TREE
2636 || TREE_OPERAND (op, 3) != NULL_TREE)
2641 if (TREE_OPERAND (op, 2) != NULL_TREE)
2647 op = TREE_OPERAND (op, 0);
2650 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2659 /* Return true if T is function-invariant. */
2662 tree_invariant_p (tree t)
2664 tree inner = skip_simple_arithmetic (t);
2665 return tree_invariant_p_1 (inner);
2668 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2669 Do this to any expression which may be used in more than one place,
2670 but must be evaluated only once.
2672 Normally, expand_expr would reevaluate the expression each time.
2673 Calling save_expr produces something that is evaluated and recorded
2674 the first time expand_expr is called on it. Subsequent calls to
2675 expand_expr just reuse the recorded value.
2677 The call to expand_expr that generates code that actually computes
2678 the value is the first call *at compile time*. Subsequent calls
2679 *at compile time* generate code to use the saved value.
2680 This produces correct result provided that *at run time* control
2681 always flows through the insns made by the first expand_expr
2682 before reaching the other places where the save_expr was evaluated.
2683 You, the caller of save_expr, must make sure this is so.
2685 Constants, and certain read-only nodes, are returned with no
2686 SAVE_EXPR because that is safe. Expressions containing placeholders
2687 are not touched; see tree.def for an explanation of what these
2691 save_expr (tree expr)
2693 tree t = fold (expr);
2696 /* If the tree evaluates to a constant, then we don't want to hide that
2697 fact (i.e. this allows further folding, and direct checks for constants).
2698 However, a read-only object that has side effects cannot be bypassed.
2699 Since it is no problem to reevaluate literals, we just return the
2701 inner = skip_simple_arithmetic (t);
2702 if (TREE_CODE (inner) == ERROR_MARK)
2705 if (tree_invariant_p_1 (inner))
2708 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2709 it means that the size or offset of some field of an object depends on
2710 the value within another field.
2712 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2713 and some variable since it would then need to be both evaluated once and
2714 evaluated more than once. Front-ends must assure this case cannot
2715 happen by surrounding any such subexpressions in their own SAVE_EXPR
2716 and forcing evaluation at the proper time. */
2717 if (contains_placeholder_p (inner))
2720 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2721 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2723 /* This expression might be placed ahead of a jump to ensure that the
2724 value was computed on both sides of the jump. So make sure it isn't
2725 eliminated as dead. */
2726 TREE_SIDE_EFFECTS (t) = 1;
2730 /* Look inside EXPR and into any simple arithmetic operations. Return
2731 the innermost non-arithmetic node. */
2734 skip_simple_arithmetic (tree expr)
2738 /* We don't care about whether this can be used as an lvalue in this
2740 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2741 expr = TREE_OPERAND (expr, 0);
2743 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2744 a constant, it will be more efficient to not make another SAVE_EXPR since
2745 it will allow better simplification and GCSE will be able to merge the
2746 computations if they actually occur. */
2750 if (UNARY_CLASS_P (inner))
2751 inner = TREE_OPERAND (inner, 0);
2752 else if (BINARY_CLASS_P (inner))
2754 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2755 inner = TREE_OPERAND (inner, 0);
2756 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2757 inner = TREE_OPERAND (inner, 1);
2769 /* Return which tree structure is used by T. */
2771 enum tree_node_structure_enum
2772 tree_node_structure (const_tree t)
2774 const enum tree_code code = TREE_CODE (t);
2775 return tree_node_structure_for_code (code);
2778 /* Set various status flags when building a CALL_EXPR object T. */
2781 process_call_operands (tree t)
2783 bool side_effects = TREE_SIDE_EFFECTS (t);
2784 bool read_only = false;
2785 int i = call_expr_flags (t);
2787 /* Calls have side-effects, except those to const or pure functions. */
2788 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2789 side_effects = true;
2790 /* Propagate TREE_READONLY of arguments for const functions. */
2794 if (!side_effects || read_only)
2795 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2797 tree op = TREE_OPERAND (t, i);
2798 if (op && TREE_SIDE_EFFECTS (op))
2799 side_effects = true;
2800 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2804 TREE_SIDE_EFFECTS (t) = side_effects;
2805 TREE_READONLY (t) = read_only;
2808 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2809 size or offset that depends on a field within a record. */
2812 contains_placeholder_p (const_tree exp)
2814 enum tree_code code;
2819 code = TREE_CODE (exp);
2820 if (code == PLACEHOLDER_EXPR)
2823 switch (TREE_CODE_CLASS (code))
2826 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2827 position computations since they will be converted into a
2828 WITH_RECORD_EXPR involving the reference, which will assume
2829 here will be valid. */
2830 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2832 case tcc_exceptional:
2833 if (code == TREE_LIST)
2834 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2835 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2840 case tcc_comparison:
2841 case tcc_expression:
2845 /* Ignoring the first operand isn't quite right, but works best. */
2846 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2849 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2850 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2851 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2854 /* The save_expr function never wraps anything containing
2855 a PLACEHOLDER_EXPR. */
2862 switch (TREE_CODE_LENGTH (code))
2865 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2867 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2868 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2879 const_call_expr_arg_iterator iter;
2880 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2881 if (CONTAINS_PLACEHOLDER_P (arg))
2895 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2896 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2900 type_contains_placeholder_1 (const_tree type)
2902 /* If the size contains a placeholder or the parent type (component type in
2903 the case of arrays) type involves a placeholder, this type does. */
2904 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2905 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2906 || (!POINTER_TYPE_P (type)
2908 && type_contains_placeholder_p (TREE_TYPE (type))))
2911 /* Now do type-specific checks. Note that the last part of the check above
2912 greatly limits what we have to do below. */
2913 switch (TREE_CODE (type))
2921 case REFERENCE_TYPE:
2929 case FIXED_POINT_TYPE:
2930 /* Here we just check the bounds. */
2931 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2932 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2935 /* We have already checked the component type above, so just check the
2937 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2941 case QUAL_UNION_TYPE:
2945 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2946 if (TREE_CODE (field) == FIELD_DECL
2947 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2948 || (TREE_CODE (type) == QUAL_UNION_TYPE
2949 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2950 || type_contains_placeholder_p (TREE_TYPE (field))))
2961 /* Wrapper around above function used to cache its result. */
2964 type_contains_placeholder_p (tree type)
2968 /* If the contains_placeholder_bits field has been initialized,
2969 then we know the answer. */
2970 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2971 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2973 /* Indicate that we've seen this type node, and the answer is false.
2974 This is what we want to return if we run into recursion via fields. */
2975 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2977 /* Compute the real value. */
2978 result = type_contains_placeholder_1 (type);
2980 /* Store the real value. */
2981 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2986 /* Push tree EXP onto vector QUEUE if it is not already present. */
2989 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2994 FOR_EACH_VEC_ELT (tree, *queue, i, iter)
2995 if (simple_cst_equal (iter, exp) == 1)
2999 VEC_safe_push (tree, heap, *queue, exp);
3002 /* Given a tree EXP, find all occurences of references to fields
3003 in a PLACEHOLDER_EXPR and place them in vector REFS without
3004 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3005 we assume here that EXP contains only arithmetic expressions
3006 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3010 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
3012 enum tree_code code = TREE_CODE (exp);
3016 /* We handle TREE_LIST and COMPONENT_REF separately. */
3017 if (code == TREE_LIST)
3019 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
3020 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
3022 else if (code == COMPONENT_REF)
3024 for (inner = TREE_OPERAND (exp, 0);
3025 REFERENCE_CLASS_P (inner);
3026 inner = TREE_OPERAND (inner, 0))
3029 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
3030 push_without_duplicates (exp, refs);
3032 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
3035 switch (TREE_CODE_CLASS (code))
3040 case tcc_declaration:
3041 /* Variables allocated to static storage can stay. */
3042 if (!TREE_STATIC (exp))
3043 push_without_duplicates (exp, refs);
3046 case tcc_expression:
3047 /* This is the pattern built in ada/make_aligning_type. */
3048 if (code == ADDR_EXPR
3049 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
3051 push_without_duplicates (exp, refs);
3055 /* Fall through... */
3057 case tcc_exceptional:
3060 case tcc_comparison:
3062 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3063 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3067 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3068 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3076 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3077 return a tree with all occurrences of references to F in a
3078 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3079 CONST_DECLs. Note that we assume here that EXP contains only
3080 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3081 occurring only in their argument list. */
3084 substitute_in_expr (tree exp, tree f, tree r)
3086 enum tree_code code = TREE_CODE (exp);
3087 tree op0, op1, op2, op3;
3090 /* We handle TREE_LIST and COMPONENT_REF separately. */
3091 if (code == TREE_LIST)
3093 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3094 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3095 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3098 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3100 else if (code == COMPONENT_REF)
3104 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3105 and it is the right field, replace it with R. */
3106 for (inner = TREE_OPERAND (exp, 0);
3107 REFERENCE_CLASS_P (inner);
3108 inner = TREE_OPERAND (inner, 0))
3112 op1 = TREE_OPERAND (exp, 1);
3114 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3117 /* If this expression hasn't been completed let, leave it alone. */
3118 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3121 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3122 if (op0 == TREE_OPERAND (exp, 0))
3126 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3129 switch (TREE_CODE_CLASS (code))
3134 case tcc_declaration:
3140 case tcc_expression:
3144 /* Fall through... */
3146 case tcc_exceptional:
3149 case tcc_comparison:
3151 switch (TREE_CODE_LENGTH (code))
3157 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3158 if (op0 == TREE_OPERAND (exp, 0))
3161 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3165 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3166 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3168 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3171 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3175 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3176 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3177 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3179 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3180 && op2 == TREE_OPERAND (exp, 2))
3183 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3187 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3188 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3189 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3190 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3192 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3193 && op2 == TREE_OPERAND (exp, 2)
3194 && op3 == TREE_OPERAND (exp, 3))
3198 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3210 new_tree = NULL_TREE;
3212 /* If we are trying to replace F with a constant, inline back
3213 functions which do nothing else than computing a value from
3214 the arguments they are passed. This makes it possible to
3215 fold partially or entirely the replacement expression. */
3216 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3218 tree t = maybe_inline_call_in_expr (exp);
3220 return SUBSTITUTE_IN_EXPR (t, f, r);
3223 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3225 tree op = TREE_OPERAND (exp, i);
3226 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3230 new_tree = copy_node (exp);
3231 TREE_OPERAND (new_tree, i) = new_op;
3237 new_tree = fold (new_tree);
3238 if (TREE_CODE (new_tree) == CALL_EXPR)
3239 process_call_operands (new_tree);
3250 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3252 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3253 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3258 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3259 for it within OBJ, a tree that is an object or a chain of references. */
3262 substitute_placeholder_in_expr (tree exp, tree obj)
3264 enum tree_code code = TREE_CODE (exp);
3265 tree op0, op1, op2, op3;
3268 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3269 in the chain of OBJ. */
3270 if (code == PLACEHOLDER_EXPR)
3272 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3275 for (elt = obj; elt != 0;
3276 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3277 || TREE_CODE (elt) == COND_EXPR)
3278 ? TREE_OPERAND (elt, 1)
3279 : (REFERENCE_CLASS_P (elt)
3280 || UNARY_CLASS_P (elt)
3281 || BINARY_CLASS_P (elt)
3282 || VL_EXP_CLASS_P (elt)
3283 || EXPRESSION_CLASS_P (elt))
3284 ? TREE_OPERAND (elt, 0) : 0))
3285 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3288 for (elt = obj; elt != 0;
3289 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3290 || TREE_CODE (elt) == COND_EXPR)
3291 ? TREE_OPERAND (elt, 1)
3292 : (REFERENCE_CLASS_P (elt)
3293 || UNARY_CLASS_P (elt)
3294 || BINARY_CLASS_P (elt)
3295 || VL_EXP_CLASS_P (elt)
3296 || EXPRESSION_CLASS_P (elt))
3297 ? TREE_OPERAND (elt, 0) : 0))
3298 if (POINTER_TYPE_P (TREE_TYPE (elt))
3299 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3301 return fold_build1 (INDIRECT_REF, need_type, elt);
3303 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3304 survives until RTL generation, there will be an error. */
3308 /* TREE_LIST is special because we need to look at TREE_VALUE
3309 and TREE_CHAIN, not TREE_OPERANDS. */
3310 else if (code == TREE_LIST)
3312 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3313 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3314 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3317 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3320 switch (TREE_CODE_CLASS (code))
3323 case tcc_declaration:
3326 case tcc_exceptional:
3329 case tcc_comparison:
3330 case tcc_expression:
3333 switch (TREE_CODE_LENGTH (code))
3339 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3340 if (op0 == TREE_OPERAND (exp, 0))
3343 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3347 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3348 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3350 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3353 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3357 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3358 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3359 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3361 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3362 && op2 == TREE_OPERAND (exp, 2))
3365 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3369 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3370 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3371 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3372 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3374 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3375 && op2 == TREE_OPERAND (exp, 2)
3376 && op3 == TREE_OPERAND (exp, 3))
3380 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3392 new_tree = NULL_TREE;
3394 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3396 tree op = TREE_OPERAND (exp, i);
3397 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3401 new_tree = copy_node (exp);
3402 TREE_OPERAND (new_tree, i) = new_op;
3408 new_tree = fold (new_tree);
3409 if (TREE_CODE (new_tree) == CALL_EXPR)
3410 process_call_operands (new_tree);
3421 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3423 if (code == INDIRECT_REF || code == ARRAY_REF || code == ARRAY_RANGE_REF)
3424 TREE_THIS_NOTRAP (new_tree) |= TREE_THIS_NOTRAP (exp);
3429 /* Stabilize a reference so that we can use it any number of times
3430 without causing its operands to be evaluated more than once.
3431 Returns the stabilized reference. This works by means of save_expr,
3432 so see the caveats in the comments about save_expr.
3434 Also allows conversion expressions whose operands are references.
3435 Any other kind of expression is returned unchanged. */
3438 stabilize_reference (tree ref)
3441 enum tree_code code = TREE_CODE (ref);
3448 /* No action is needed in this case. */
3453 case FIX_TRUNC_EXPR:
3454 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3458 result = build_nt (INDIRECT_REF,
3459 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3463 result = build_nt (COMPONENT_REF,
3464 stabilize_reference (TREE_OPERAND (ref, 0)),
3465 TREE_OPERAND (ref, 1), NULL_TREE);
3469 result = build_nt (BIT_FIELD_REF,
3470 stabilize_reference (TREE_OPERAND (ref, 0)),
3471 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3472 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3476 result = build_nt (ARRAY_REF,
3477 stabilize_reference (TREE_OPERAND (ref, 0)),
3478 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3479 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3482 case ARRAY_RANGE_REF:
3483 result = build_nt (ARRAY_RANGE_REF,
3484 stabilize_reference (TREE_OPERAND (ref, 0)),
3485 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3486 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3490 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3491 it wouldn't be ignored. This matters when dealing with
3493 return stabilize_reference_1 (ref);
3495 /* If arg isn't a kind of lvalue we recognize, make no change.
3496 Caller should recognize the error for an invalid lvalue. */
3501 return error_mark_node;
3504 TREE_TYPE (result) = TREE_TYPE (ref);
3505 TREE_READONLY (result) = TREE_READONLY (ref);
3506 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3507 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3512 /* Subroutine of stabilize_reference; this is called for subtrees of
3513 references. Any expression with side-effects must be put in a SAVE_EXPR
3514 to ensure that it is only evaluated once.
3516 We don't put SAVE_EXPR nodes around everything, because assigning very
3517 simple expressions to temporaries causes us to miss good opportunities
3518 for optimizations. Among other things, the opportunity to fold in the
3519 addition of a constant into an addressing mode often gets lost, e.g.
3520 "y[i+1] += x;". In general, we take the approach that we should not make
3521 an assignment unless we are forced into it - i.e., that any non-side effect
3522 operator should be allowed, and that cse should take care of coalescing
3523 multiple utterances of the same expression should that prove fruitful. */
3526 stabilize_reference_1 (tree e)
3529 enum tree_code code = TREE_CODE (e);
3531 /* We cannot ignore const expressions because it might be a reference
3532 to a const array but whose index contains side-effects. But we can
3533 ignore things that are actual constant or that already have been
3534 handled by this function. */
3536 if (tree_invariant_p (e))
3539 switch (TREE_CODE_CLASS (code))
3541 case tcc_exceptional:
3543 case tcc_declaration:
3544 case tcc_comparison:
3546 case tcc_expression:
3549 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3550 so that it will only be evaluated once. */
3551 /* The reference (r) and comparison (<) classes could be handled as
3552 below, but it is generally faster to only evaluate them once. */
3553 if (TREE_SIDE_EFFECTS (e))
3554 return save_expr (e);
3558 /* Constants need no processing. In fact, we should never reach
3563 /* Division is slow and tends to be compiled with jumps,
3564 especially the division by powers of 2 that is often
3565 found inside of an array reference. So do it just once. */
3566 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3567 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3568 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3569 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3570 return save_expr (e);
3571 /* Recursively stabilize each operand. */
3572 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3573 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3577 /* Recursively stabilize each operand. */
3578 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3585 TREE_TYPE (result) = TREE_TYPE (e);
3586 TREE_READONLY (result) = TREE_READONLY (e);
3587 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3588 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3593 /* Low-level constructors for expressions. */
3595 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3596 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3599 recompute_tree_invariant_for_addr_expr (tree t)
3602 bool tc = true, se = false;
3604 /* We started out assuming this address is both invariant and constant, but
3605 does not have side effects. Now go down any handled components and see if
3606 any of them involve offsets that are either non-constant or non-invariant.
3607 Also check for side-effects.
3609 ??? Note that this code makes no attempt to deal with the case where
3610 taking the address of something causes a copy due to misalignment. */
3612 #define UPDATE_FLAGS(NODE) \
3613 do { tree _node = (NODE); \
3614 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3615 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3617 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3618 node = TREE_OPERAND (node, 0))
3620 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3621 array reference (probably made temporarily by the G++ front end),
3622 so ignore all the operands. */
3623 if ((TREE_CODE (node) == ARRAY_REF
3624 || TREE_CODE (node) == ARRAY_RANGE_REF)
3625 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3627 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3628 if (TREE_OPERAND (node, 2))
3629 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3630 if (TREE_OPERAND (node, 3))
3631 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3633 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3634 FIELD_DECL, apparently. The G++ front end can put something else
3635 there, at least temporarily. */
3636 else if (TREE_CODE (node) == COMPONENT_REF
3637 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3639 if (TREE_OPERAND (node, 2))
3640 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3642 else if (TREE_CODE (node) == BIT_FIELD_REF)
3643 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3646 node = lang_hooks.expr_to_decl (node, &tc, &se);
3648 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3649 the address, since &(*a)->b is a form of addition. If it's a constant, the
3650 address is constant too. If it's a decl, its address is constant if the
3651 decl is static. Everything else is not constant and, furthermore,
3652 taking the address of a volatile variable is not volatile. */
3653 if (TREE_CODE (node) == INDIRECT_REF
3654 || TREE_CODE (node) == MEM_REF)
3655 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3656 else if (CONSTANT_CLASS_P (node))
3658 else if (DECL_P (node))
3659 tc &= (staticp (node) != NULL_TREE);
3663 se |= TREE_SIDE_EFFECTS (node);
3667 TREE_CONSTANT (t) = tc;
3668 TREE_SIDE_EFFECTS (t) = se;
3672 /* Build an expression of code CODE, data type TYPE, and operands as
3673 specified. Expressions and reference nodes can be created this way.
3674 Constants, decls, types and misc nodes cannot be.
3676 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3677 enough for all extant tree codes. */
3680 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3684 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3686 t = make_node_stat (code PASS_MEM_STAT);
3693 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3695 int length = sizeof (struct tree_exp);
3696 #ifdef GATHER_STATISTICS
3697 tree_node_kind kind;
3701 #ifdef GATHER_STATISTICS
3702 switch (TREE_CODE_CLASS (code))
3704 case tcc_statement: /* an expression with side effects */
3707 case tcc_reference: /* a reference */
3715 tree_node_counts[(int) kind]++;
3716 tree_node_sizes[(int) kind] += length;
3719 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3721 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
3723 memset (t, 0, sizeof (struct tree_common));
3725 TREE_SET_CODE (t, code);
3727 TREE_TYPE (t) = type;
3728 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3729 TREE_OPERAND (t, 0) = node;
3730 TREE_BLOCK (t) = NULL_TREE;
3731 if (node && !TYPE_P (node))
3733 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3734 TREE_READONLY (t) = TREE_READONLY (node);
3737 if (TREE_CODE_CLASS (code) == tcc_statement)
3738 TREE_SIDE_EFFECTS (t) = 1;
3742 /* All of these have side-effects, no matter what their
3744 TREE_SIDE_EFFECTS (t) = 1;
3745 TREE_READONLY (t) = 0;
3749 /* Whether a dereference is readonly has nothing to do with whether
3750 its operand is readonly. */
3751 TREE_READONLY (t) = 0;
3756 recompute_tree_invariant_for_addr_expr (t);
3760 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3761 && node && !TYPE_P (node)
3762 && TREE_CONSTANT (node))
3763 TREE_CONSTANT (t) = 1;
3764 if (TREE_CODE_CLASS (code) == tcc_reference
3765 && node && TREE_THIS_VOLATILE (node))
3766 TREE_THIS_VOLATILE (t) = 1;
3773 #define PROCESS_ARG(N) \
3775 TREE_OPERAND (t, N) = arg##N; \
3776 if (arg##N &&!TYPE_P (arg##N)) \
3778 if (TREE_SIDE_EFFECTS (arg##N)) \
3780 if (!TREE_READONLY (arg##N) \
3781 && !CONSTANT_CLASS_P (arg##N)) \
3782 (void) (read_only = 0); \
3783 if (!TREE_CONSTANT (arg##N)) \
3784 (void) (constant = 0); \
3789 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3791 bool constant, read_only, side_effects;
3794 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3796 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3797 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3798 /* When sizetype precision doesn't match that of pointers
3799 we need to be able to build explicit extensions or truncations
3800 of the offset argument. */
3801 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3802 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3803 && TREE_CODE (arg1) == INTEGER_CST);
3805 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3806 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3807 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3808 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3810 t = make_node_stat (code PASS_MEM_STAT);
3813 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3814 result based on those same flags for the arguments. But if the
3815 arguments aren't really even `tree' expressions, we shouldn't be trying
3818 /* Expressions without side effects may be constant if their
3819 arguments are as well. */
3820 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3821 || TREE_CODE_CLASS (code) == tcc_binary);
3823 side_effects = TREE_SIDE_EFFECTS (t);
3828 TREE_READONLY (t) = read_only;
3829 TREE_CONSTANT (t) = constant;
3830 TREE_SIDE_EFFECTS (t) = side_effects;
3831 TREE_THIS_VOLATILE (t)
3832 = (TREE_CODE_CLASS (code) == tcc_reference
3833 && arg0 && TREE_THIS_VOLATILE (arg0));
3840 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3841 tree arg2 MEM_STAT_DECL)
3843 bool constant, read_only, side_effects;
3846 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3847 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3849 t = make_node_stat (code PASS_MEM_STAT);
3854 /* As a special exception, if COND_EXPR has NULL branches, we
3855 assume that it is a gimple statement and always consider
3856 it to have side effects. */
3857 if (code == COND_EXPR
3858 && tt == void_type_node
3859 && arg1 == NULL_TREE
3860 && arg2 == NULL_TREE)
3861 side_effects = true;
3863 side_effects = TREE_SIDE_EFFECTS (t);
3869 if (code == COND_EXPR)
3870 TREE_READONLY (t) = read_only;
3872 TREE_SIDE_EFFECTS (t) = side_effects;
3873 TREE_THIS_VOLATILE (t)
3874 = (TREE_CODE_CLASS (code) == tcc_reference
3875 && arg0 && TREE_THIS_VOLATILE (arg0));
3881 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3882 tree arg2, tree arg3 MEM_STAT_DECL)
3884 bool constant, read_only, side_effects;
3887 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3889 t = make_node_stat (code PASS_MEM_STAT);
3892 side_effects = TREE_SIDE_EFFECTS (t);
3899 TREE_SIDE_EFFECTS (t) = side_effects;
3900 TREE_THIS_VOLATILE (t)
3901 = (TREE_CODE_CLASS (code) == tcc_reference
3902 && arg0 && TREE_THIS_VOLATILE (arg0));
3908 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3909 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3911 bool constant, read_only, side_effects;
3914 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3916 t = make_node_stat (code PASS_MEM_STAT);
3919 side_effects = TREE_SIDE_EFFECTS (t);
3927 TREE_SIDE_EFFECTS (t) = side_effects;
3928 TREE_THIS_VOLATILE (t)
3929 = (TREE_CODE_CLASS (code) == tcc_reference
3930 && arg0 && TREE_THIS_VOLATILE (arg0));
3936 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3937 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3939 bool constant, read_only, side_effects;
3942 gcc_assert (code == TARGET_MEM_REF);
3944 t = make_node_stat (code PASS_MEM_STAT);
3947 side_effects = TREE_SIDE_EFFECTS (t);
3954 if (code == TARGET_MEM_REF)
3958 TREE_SIDE_EFFECTS (t) = side_effects;
3959 TREE_THIS_VOLATILE (t)
3960 = (code == TARGET_MEM_REF
3961 && arg5 && TREE_THIS_VOLATILE (arg5));
3966 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3967 on the pointer PTR. */
3970 build_simple_mem_ref_loc (location_t loc, tree ptr)
3972 HOST_WIDE_INT offset = 0;
3973 tree ptype = TREE_TYPE (ptr);
3975 /* For convenience allow addresses that collapse to a simple base
3977 if (TREE_CODE (ptr) == ADDR_EXPR
3978 && (handled_component_p (TREE_OPERAND (ptr, 0))
3979 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
3981 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
3983 ptr = build_fold_addr_expr (ptr);
3984 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
3986 tem = build2 (MEM_REF, TREE_TYPE (ptype),
3987 ptr, build_int_cst (ptype, offset));
3988 SET_EXPR_LOCATION (tem, loc);
3992 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3995 mem_ref_offset (const_tree t)
3997 tree toff = TREE_OPERAND (t, 1);
3998 return double_int_sext (tree_to_double_int (toff),
3999 TYPE_PRECISION (TREE_TYPE (toff)));
4002 /* Return the pointer-type relevant for TBAA purposes from the
4003 gimple memory reference tree T. This is the type to be used for
4004 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4007 reference_alias_ptr_type (const_tree t)
4009 const_tree base = t;
4010 while (handled_component_p (base))
4011 base = TREE_OPERAND (base, 0);
4012 if (TREE_CODE (base) == MEM_REF)
4013 return TREE_TYPE (TREE_OPERAND (base, 1));
4014 else if (TREE_CODE (base) == TARGET_MEM_REF)
4015 return TREE_TYPE (TMR_OFFSET (base));
4017 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base)));
4020 /* Similar except don't specify the TREE_TYPE
4021 and leave the TREE_SIDE_EFFECTS as 0.
4022 It is permissible for arguments to be null,
4023 or even garbage if their values do not matter. */
4026 build_nt (enum tree_code code, ...)
4033 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
4037 t = make_node (code);
4038 length = TREE_CODE_LENGTH (code);
4040 for (i = 0; i < length; i++)
4041 TREE_OPERAND (t, i) = va_arg (p, tree);
4047 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4051 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
4056 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
4057 CALL_EXPR_FN (ret) = fn;
4058 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
4059 FOR_EACH_VEC_ELT (tree, args, ix, t)
4060 CALL_EXPR_ARG (ret, ix) = t;
4064 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4065 We do NOT enter this node in any sort of symbol table.
4067 LOC is the location of the decl.
4069 layout_decl is used to set up the decl's storage layout.
4070 Other slots are initialized to 0 or null pointers. */
4073 build_decl_stat (location_t loc, enum tree_code code, tree name,
4074 tree type MEM_STAT_DECL)
4078 t = make_node_stat (code PASS_MEM_STAT);
4079 DECL_SOURCE_LOCATION (t) = loc;
4081 /* if (type == error_mark_node)
4082 type = integer_type_node; */
4083 /* That is not done, deliberately, so that having error_mark_node
4084 as the type can suppress useless errors in the use of this variable. */
4086 DECL_NAME (t) = name;
4087 TREE_TYPE (t) = type;
4089 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4095 /* Builds and returns function declaration with NAME and TYPE. */
4098 build_fn_decl (const char *name, tree type)
4100 tree id = get_identifier (name);
4101 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4103 DECL_EXTERNAL (decl) = 1;
4104 TREE_PUBLIC (decl) = 1;
4105 DECL_ARTIFICIAL (decl) = 1;
4106 TREE_NOTHROW (decl) = 1;
4111 VEC(tree,gc) *all_translation_units;
4113 /* Builds a new translation-unit decl with name NAME, queues it in the
4114 global list of translation-unit decls and returns it. */
4117 build_translation_unit_decl (tree name)
4119 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4121 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4122 VEC_safe_push (tree, gc, all_translation_units, tu);
4127 /* BLOCK nodes are used to represent the structure of binding contours
4128 and declarations, once those contours have been exited and their contents
4129 compiled. This information is used for outputting debugging info. */
4132 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4134 tree block = make_node (BLOCK);
4136 BLOCK_VARS (block) = vars;
4137 BLOCK_SUBBLOCKS (block) = subblocks;
4138 BLOCK_SUPERCONTEXT (block) = supercontext;
4139 BLOCK_CHAIN (block) = chain;
4144 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4146 LOC is the location to use in tree T. */
4149 protected_set_expr_location (tree t, location_t loc)
4151 if (t && CAN_HAVE_LOCATION_P (t))
4152 SET_EXPR_LOCATION (t, loc);
4155 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4159 build_decl_attribute_variant (tree ddecl, tree attribute)
4161 DECL_ATTRIBUTES (ddecl) = attribute;
4165 /* Borrowed from hashtab.c iterative_hash implementation. */
4166 #define mix(a,b,c) \
4168 a -= b; a -= c; a ^= (c>>13); \
4169 b -= c; b -= a; b ^= (a<< 8); \
4170 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4171 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4172 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4173 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4174 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4175 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4176 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4180 /* Produce good hash value combining VAL and VAL2. */
4182 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4184 /* the golden ratio; an arbitrary value. */
4185 hashval_t a = 0x9e3779b9;
4191 /* Produce good hash value combining VAL and VAL2. */
4193 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4195 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4196 return iterative_hash_hashval_t (val, val2);
4199 hashval_t a = (hashval_t) val;
4200 /* Avoid warnings about shifting of more than the width of the type on
4201 hosts that won't execute this path. */
4203 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4205 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4207 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4208 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4215 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4216 is ATTRIBUTE and its qualifiers are QUALS.
4218 Record such modified types already made so we don't make duplicates. */
4221 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4223 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4225 hashval_t hashcode = 0;
4227 enum tree_code code = TREE_CODE (ttype);
4229 /* Building a distinct copy of a tagged type is inappropriate; it
4230 causes breakage in code that expects there to be a one-to-one
4231 relationship between a struct and its fields.
4232 build_duplicate_type is another solution (as used in
4233 handle_transparent_union_attribute), but that doesn't play well
4234 with the stronger C++ type identity model. */
4235 if (TREE_CODE (ttype) == RECORD_TYPE
4236 || TREE_CODE (ttype) == UNION_TYPE
4237 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4238 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4240 warning (OPT_Wattributes,
4241 "ignoring attributes applied to %qT after definition",
4242 TYPE_MAIN_VARIANT (ttype));
4243 return build_qualified_type (ttype, quals);
4246 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4247 ntype = build_distinct_type_copy (ttype);
4249 TYPE_ATTRIBUTES (ntype) = attribute;
4251 hashcode = iterative_hash_object (code, hashcode);
4252 if (TREE_TYPE (ntype))
4253 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4255 hashcode = attribute_hash_list (attribute, hashcode);
4257 switch (TREE_CODE (ntype))
4260 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4263 if (TYPE_DOMAIN (ntype))
4264 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4268 hashcode = iterative_hash_object
4269 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4270 hashcode = iterative_hash_object
4271 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4274 case FIXED_POINT_TYPE:
4276 unsigned int precision = TYPE_PRECISION (ntype);
4277 hashcode = iterative_hash_object (precision, hashcode);
4284 ntype = type_hash_canon (hashcode, ntype);
4286 /* If the target-dependent attributes make NTYPE different from
4287 its canonical type, we will need to use structural equality
4288 checks for this type. */
4289 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4290 || !targetm.comp_type_attributes (ntype, ttype))
4291 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4292 else if (TYPE_CANONICAL (ntype) == ntype)
4293 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4295 ttype = build_qualified_type (ntype, quals);
4297 else if (TYPE_QUALS (ttype) != quals)
4298 ttype = build_qualified_type (ttype, quals);
4304 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4307 Record such modified types already made so we don't make duplicates. */
4310 build_type_attribute_variant (tree ttype, tree attribute)
4312 return build_type_attribute_qual_variant (ttype, attribute,
4313 TYPE_QUALS (ttype));
4317 /* Reset the expression *EXPR_P, a size or position.
4319 ??? We could reset all non-constant sizes or positions. But it's cheap
4320 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4322 We need to reset self-referential sizes or positions because they cannot
4323 be gimplified and thus can contain a CALL_EXPR after the gimplification
4324 is finished, which will run afoul of LTO streaming. And they need to be
4325 reset to something essentially dummy but not constant, so as to preserve
4326 the properties of the object they are attached to. */
4329 free_lang_data_in_one_sizepos (tree *expr_p)
4331 tree expr = *expr_p;
4332 if (CONTAINS_PLACEHOLDER_P (expr))
4333 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4337 /* Reset all the fields in a binfo node BINFO. We only keep
4338 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4341 free_lang_data_in_binfo (tree binfo)
4346 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4348 BINFO_VTABLE (binfo) = NULL_TREE;
4349 BINFO_BASE_ACCESSES (binfo) = NULL;
4350 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4351 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4353 FOR_EACH_VEC_ELT (tree, BINFO_BASE_BINFOS (binfo), i, t)
4354 free_lang_data_in_binfo (t);
4358 /* Reset all language specific information still present in TYPE. */
4361 free_lang_data_in_type (tree type)
4363 gcc_assert (TYPE_P (type));
4365 /* Give the FE a chance to remove its own data first. */
4366 lang_hooks.free_lang_data (type);
4368 TREE_LANG_FLAG_0 (type) = 0;
4369 TREE_LANG_FLAG_1 (type) = 0;
4370 TREE_LANG_FLAG_2 (type) = 0;
4371 TREE_LANG_FLAG_3 (type) = 0;
4372 TREE_LANG_FLAG_4 (type) = 0;
4373 TREE_LANG_FLAG_5 (type) = 0;
4374 TREE_LANG_FLAG_6 (type) = 0;
4376 if (TREE_CODE (type) == FUNCTION_TYPE)
4378 /* Remove the const and volatile qualifiers from arguments. The
4379 C++ front end removes them, but the C front end does not,
4380 leading to false ODR violation errors when merging two
4381 instances of the same function signature compiled by
4382 different front ends. */
4385 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4387 tree arg_type = TREE_VALUE (p);
4389 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4391 int quals = TYPE_QUALS (arg_type)
4393 & ~TYPE_QUAL_VOLATILE;
4394 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4395 free_lang_data_in_type (TREE_VALUE (p));
4400 /* Remove members that are not actually FIELD_DECLs from the field
4401 list of an aggregate. These occur in C++. */
4402 if (RECORD_OR_UNION_TYPE_P (type))
4406 /* Note that TYPE_FIELDS can be shared across distinct
4407 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4408 to be removed, we cannot set its TREE_CHAIN to NULL.
4409 Otherwise, we would not be able to find all the other fields
4410 in the other instances of this TREE_TYPE.
4412 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4414 member = TYPE_FIELDS (type);
4417 if (TREE_CODE (member) == FIELD_DECL)
4420 TREE_CHAIN (prev) = member;
4422 TYPE_FIELDS (type) = member;
4426 member = TREE_CHAIN (member);
4430 TREE_CHAIN (prev) = NULL_TREE;
4432 TYPE_FIELDS (type) = NULL_TREE;
4434 TYPE_METHODS (type) = NULL_TREE;
4435 if (TYPE_BINFO (type))
4436 free_lang_data_in_binfo (TYPE_BINFO (type));
4440 /* For non-aggregate types, clear out the language slot (which
4441 overloads TYPE_BINFO). */
4442 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4444 if (INTEGRAL_TYPE_P (type)
4445 || SCALAR_FLOAT_TYPE_P (type)
4446 || FIXED_POINT_TYPE_P (type))
4448 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4449 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4453 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4454 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4456 if (debug_info_level < DINFO_LEVEL_TERSE
4457 || (TYPE_CONTEXT (type)
4458 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4459 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4460 TYPE_CONTEXT (type) = NULL_TREE;
4462 if (debug_info_level < DINFO_LEVEL_TERSE)
4463 TYPE_STUB_DECL (type) = NULL_TREE;
4467 /* Return true if DECL may need an assembler name to be set. */
4470 need_assembler_name_p (tree decl)
4472 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4473 if (TREE_CODE (decl) != FUNCTION_DECL
4474 && TREE_CODE (decl) != VAR_DECL)
4477 /* If DECL already has its assembler name set, it does not need a
4479 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4480 || DECL_ASSEMBLER_NAME_SET_P (decl))
4483 /* Abstract decls do not need an assembler name. */
4484 if (DECL_ABSTRACT (decl))
4487 /* For VAR_DECLs, only static, public and external symbols need an
4489 if (TREE_CODE (decl) == VAR_DECL
4490 && !TREE_STATIC (decl)
4491 && !TREE_PUBLIC (decl)
4492 && !DECL_EXTERNAL (decl))
4495 if (TREE_CODE (decl) == FUNCTION_DECL)
4497 /* Do not set assembler name on builtins. Allow RTL expansion to
4498 decide whether to expand inline or via a regular call. */
4499 if (DECL_BUILT_IN (decl)
4500 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4503 /* Functions represented in the callgraph need an assembler name. */
4504 if (cgraph_get_node (decl) != NULL)
4507 /* Unused and not public functions don't need an assembler name. */
4508 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4516 /* Reset all language specific information still present in symbol
4520 free_lang_data_in_decl (tree decl)
4522 gcc_assert (DECL_P (decl));
4524 /* Give the FE a chance to remove its own data first. */
4525 lang_hooks.free_lang_data (decl);
4527 TREE_LANG_FLAG_0 (decl) = 0;
4528 TREE_LANG_FLAG_1 (decl) = 0;
4529 TREE_LANG_FLAG_2 (decl) = 0;
4530 TREE_LANG_FLAG_3 (decl) = 0;
4531 TREE_LANG_FLAG_4 (decl) = 0;
4532 TREE_LANG_FLAG_5 (decl) = 0;
4533 TREE_LANG_FLAG_6 (decl) = 0;
4535 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4536 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4537 if (TREE_CODE (decl) == FIELD_DECL)
4538 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4540 /* DECL_FCONTEXT is only used for debug info generation. */
4541 if (TREE_CODE (decl) == FIELD_DECL
4542 && debug_info_level < DINFO_LEVEL_TERSE)
4543 DECL_FCONTEXT (decl) = NULL_TREE;
4545 if (TREE_CODE (decl) == FUNCTION_DECL)
4547 if (gimple_has_body_p (decl))
4551 /* If DECL has a gimple body, then the context for its
4552 arguments must be DECL. Otherwise, it doesn't really
4553 matter, as we will not be emitting any code for DECL. In
4554 general, there may be other instances of DECL created by
4555 the front end and since PARM_DECLs are generally shared,
4556 their DECL_CONTEXT changes as the replicas of DECL are
4557 created. The only time where DECL_CONTEXT is important
4558 is for the FUNCTION_DECLs that have a gimple body (since
4559 the PARM_DECL will be used in the function's body). */
4560 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4561 DECL_CONTEXT (t) = decl;
4564 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4565 At this point, it is not needed anymore. */
4566 DECL_SAVED_TREE (decl) = NULL_TREE;
4568 /* Clear the abstract origin if it refers to a method. Otherwise
4569 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4570 origin will not be output correctly. */
4571 if (DECL_ABSTRACT_ORIGIN (decl)
4572 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))
4573 && RECORD_OR_UNION_TYPE_P
4574 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl))))
4575 DECL_ABSTRACT_ORIGIN (decl) = NULL_TREE;
4577 else if (TREE_CODE (decl) == VAR_DECL)
4579 if ((DECL_EXTERNAL (decl)
4580 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4581 || (decl_function_context (decl) && !TREE_STATIC (decl)))
4582 DECL_INITIAL (decl) = NULL_TREE;
4584 else if (TREE_CODE (decl) == TYPE_DECL)
4585 DECL_INITIAL (decl) = NULL_TREE;
4586 else if (TREE_CODE (decl) == TRANSLATION_UNIT_DECL
4587 && DECL_INITIAL (decl)
4588 && TREE_CODE (DECL_INITIAL (decl)) == BLOCK)
4590 /* Strip builtins from the translation-unit BLOCK. We still have
4591 targets without builtin_decl support and also builtins are
4592 shared nodes and thus we can't use TREE_CHAIN in multiple
4594 tree *nextp = &BLOCK_VARS (DECL_INITIAL (decl));
4598 if (TREE_CODE (var) == FUNCTION_DECL
4599 && DECL_BUILT_IN (var))
4600 *nextp = TREE_CHAIN (var);
4602 nextp = &TREE_CHAIN (var);
4608 /* Data used when collecting DECLs and TYPEs for language data removal. */
4610 struct free_lang_data_d
4612 /* Worklist to avoid excessive recursion. */
4613 VEC(tree,heap) *worklist;
4615 /* Set of traversed objects. Used to avoid duplicate visits. */
4616 struct pointer_set_t *pset;
4618 /* Array of symbols to process with free_lang_data_in_decl. */
4619 VEC(tree,heap) *decls;
4621 /* Array of types to process with free_lang_data_in_type. */
4622 VEC(tree,heap) *types;
4626 /* Save all language fields needed to generate proper debug information
4627 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4630 save_debug_info_for_decl (tree t)
4632 /*struct saved_debug_info_d *sdi;*/
4634 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4636 /* FIXME. Partial implementation for saving debug info removed. */
4640 /* Save all language fields needed to generate proper debug information
4641 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4644 save_debug_info_for_type (tree t)
4646 /*struct saved_debug_info_d *sdi;*/
4648 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4650 /* FIXME. Partial implementation for saving debug info removed. */
4654 /* Add type or decl T to one of the list of tree nodes that need their
4655 language data removed. The lists are held inside FLD. */
4658 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4662 VEC_safe_push (tree, heap, fld->decls, t);
4663 if (debug_info_level > DINFO_LEVEL_TERSE)
4664 save_debug_info_for_decl (t);
4666 else if (TYPE_P (t))
4668 VEC_safe_push (tree, heap, fld->types, t);
4669 if (debug_info_level > DINFO_LEVEL_TERSE)
4670 save_debug_info_for_type (t);
4676 /* Push tree node T into FLD->WORKLIST. */
4679 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4681 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4682 VEC_safe_push (tree, heap, fld->worklist, (t));
4686 /* Operand callback helper for free_lang_data_in_node. *TP is the
4687 subtree operand being considered. */
4690 find_decls_types_r (tree *tp, int *ws, void *data)
4693 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4695 if (TREE_CODE (t) == TREE_LIST)
4698 /* Language specific nodes will be removed, so there is no need
4699 to gather anything under them. */
4700 if (is_lang_specific (t))
4708 /* Note that walk_tree does not traverse every possible field in
4709 decls, so we have to do our own traversals here. */
4710 add_tree_to_fld_list (t, fld);
4712 fld_worklist_push (DECL_NAME (t), fld);
4713 fld_worklist_push (DECL_CONTEXT (t), fld);
4714 fld_worklist_push (DECL_SIZE (t), fld);
4715 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4717 /* We are going to remove everything under DECL_INITIAL for
4718 TYPE_DECLs. No point walking them. */
4719 if (TREE_CODE (t) != TYPE_DECL)
4720 fld_worklist_push (DECL_INITIAL (t), fld);
4722 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4723 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4725 if (TREE_CODE (t) == FUNCTION_DECL)
4727 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4728 fld_worklist_push (DECL_RESULT (t), fld);
4730 else if (TREE_CODE (t) == TYPE_DECL)
4732 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4733 fld_worklist_push (DECL_VINDEX (t), fld);
4735 else if (TREE_CODE (t) == FIELD_DECL)
4737 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4738 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4739 fld_worklist_push (DECL_QUALIFIER (t), fld);
4740 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4741 fld_worklist_push (DECL_FCONTEXT (t), fld);
4743 else if (TREE_CODE (t) == VAR_DECL)
4745 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4746 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4749 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4750 && DECL_HAS_VALUE_EXPR_P (t))
4751 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4753 if (TREE_CODE (t) != FIELD_DECL
4754 && TREE_CODE (t) != TYPE_DECL)
4755 fld_worklist_push (TREE_CHAIN (t), fld);
4758 else if (TYPE_P (t))
4760 /* Note that walk_tree does not traverse every possible field in
4761 types, so we have to do our own traversals here. */
4762 add_tree_to_fld_list (t, fld);
4764 if (!RECORD_OR_UNION_TYPE_P (t))
4765 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4766 fld_worklist_push (TYPE_SIZE (t), fld);
4767 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4768 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4769 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4770 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4771 fld_worklist_push (TYPE_NAME (t), fld);
4772 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4773 them and thus do not and want not to reach unused pointer types
4775 if (!POINTER_TYPE_P (t))
4776 fld_worklist_push (TYPE_MINVAL (t), fld);
4777 if (!RECORD_OR_UNION_TYPE_P (t))
4778 fld_worklist_push (TYPE_MAXVAL (t), fld);
4779 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4780 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4781 do not and want not to reach unused variants this way. */
4782 fld_worklist_push (TYPE_CONTEXT (t), fld);
4783 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4784 and want not to reach unused types this way. */
4786 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4790 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4792 fld_worklist_push (TREE_TYPE (tem), fld);
4793 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4795 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4796 && TREE_CODE (tem) == TREE_LIST)
4799 fld_worklist_push (TREE_VALUE (tem), fld);
4800 tem = TREE_CHAIN (tem);
4804 if (RECORD_OR_UNION_TYPE_P (t))
4807 /* Push all TYPE_FIELDS - there can be interleaving interesting
4808 and non-interesting things. */
4809 tem = TYPE_FIELDS (t);
4812 if (TREE_CODE (tem) == FIELD_DECL)
4813 fld_worklist_push (tem, fld);
4814 tem = TREE_CHAIN (tem);
4818 fld_worklist_push (TREE_CHAIN (t), fld);
4821 else if (TREE_CODE (t) == BLOCK)
4824 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4825 fld_worklist_push (tem, fld);
4826 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4827 fld_worklist_push (tem, fld);
4828 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4831 if (TREE_CODE (t) != IDENTIFIER_NODE)
4832 fld_worklist_push (TREE_TYPE (t), fld);
4838 /* Find decls and types in T. */
4841 find_decls_types (tree t, struct free_lang_data_d *fld)
4845 if (!pointer_set_contains (fld->pset, t))
4846 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4847 if (VEC_empty (tree, fld->worklist))
4849 t = VEC_pop (tree, fld->worklist);
4853 /* Translate all the types in LIST with the corresponding runtime
4857 get_eh_types_for_runtime (tree list)
4861 if (list == NULL_TREE)
4864 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4866 list = TREE_CHAIN (list);
4869 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4870 TREE_CHAIN (prev) = n;
4871 prev = TREE_CHAIN (prev);
4872 list = TREE_CHAIN (list);
4879 /* Find decls and types referenced in EH region R and store them in
4880 FLD->DECLS and FLD->TYPES. */
4883 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4894 /* The types referenced in each catch must first be changed to the
4895 EH types used at runtime. This removes references to FE types
4897 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4899 c->type_list = get_eh_types_for_runtime (c->type_list);
4900 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4905 case ERT_ALLOWED_EXCEPTIONS:
4906 r->u.allowed.type_list
4907 = get_eh_types_for_runtime (r->u.allowed.type_list);
4908 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4911 case ERT_MUST_NOT_THROW:
4912 walk_tree (&r->u.must_not_throw.failure_decl,
4913 find_decls_types_r, fld, fld->pset);
4919 /* Find decls and types referenced in cgraph node N and store them in
4920 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4921 look for *every* kind of DECL and TYPE node reachable from N,
4922 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4923 NAMESPACE_DECLs, etc). */
4926 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4929 struct function *fn;
4933 find_decls_types (n->decl, fld);
4935 if (!gimple_has_body_p (n->decl))
4938 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4940 fn = DECL_STRUCT_FUNCTION (n->decl);
4942 /* Traverse locals. */
4943 FOR_EACH_LOCAL_DECL (fn, ix, t)
4944 find_decls_types (t, fld);
4946 /* Traverse EH regions in FN. */
4949 FOR_ALL_EH_REGION_FN (r, fn)
4950 find_decls_types_in_eh_region (r, fld);
4953 /* Traverse every statement in FN. */
4954 FOR_EACH_BB_FN (bb, fn)
4956 gimple_stmt_iterator si;
4959 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4961 gimple phi = gsi_stmt (si);
4963 for (i = 0; i < gimple_phi_num_args (phi); i++)
4965 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4966 find_decls_types (*arg_p, fld);
4970 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4972 gimple stmt = gsi_stmt (si);
4974 for (i = 0; i < gimple_num_ops (stmt); i++)
4976 tree arg = gimple_op (stmt, i);
4977 find_decls_types (arg, fld);
4984 /* Find decls and types referenced in varpool node N and store them in
4985 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4986 look for *every* kind of DECL and TYPE node reachable from N,
4987 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4988 NAMESPACE_DECLs, etc). */
4991 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4993 find_decls_types (v->decl, fld);
4996 /* If T needs an assembler name, have one created for it. */
4999 assign_assembler_name_if_neeeded (tree t)
5001 if (need_assembler_name_p (t))
5003 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5004 diagnostics that use input_location to show locus
5005 information. The problem here is that, at this point,
5006 input_location is generally anchored to the end of the file
5007 (since the parser is long gone), so we don't have a good
5008 position to pin it to.
5010 To alleviate this problem, this uses the location of T's
5011 declaration. Examples of this are
5012 testsuite/g++.dg/template/cond2.C and
5013 testsuite/g++.dg/template/pr35240.C. */
5014 location_t saved_location = input_location;
5015 input_location = DECL_SOURCE_LOCATION (t);
5017 decl_assembler_name (t);
5019 input_location = saved_location;
5024 /* Free language specific information for every operand and expression
5025 in every node of the call graph. This process operates in three stages:
5027 1- Every callgraph node and varpool node is traversed looking for
5028 decls and types embedded in them. This is a more exhaustive
5029 search than that done by find_referenced_vars, because it will
5030 also collect individual fields, decls embedded in types, etc.
5032 2- All the decls found are sent to free_lang_data_in_decl.
5034 3- All the types found are sent to free_lang_data_in_type.
5036 The ordering between decls and types is important because
5037 free_lang_data_in_decl sets assembler names, which includes
5038 mangling. So types cannot be freed up until assembler names have
5042 free_lang_data_in_cgraph (void)
5044 struct cgraph_node *n;
5045 struct varpool_node *v;
5046 struct free_lang_data_d fld;
5051 /* Initialize sets and arrays to store referenced decls and types. */
5052 fld.pset = pointer_set_create ();
5053 fld.worklist = NULL;
5054 fld.decls = VEC_alloc (tree, heap, 100);
5055 fld.types = VEC_alloc (tree, heap, 100);
5057 /* Find decls and types in the body of every function in the callgraph. */
5058 for (n = cgraph_nodes; n; n = n->next)
5059 find_decls_types_in_node (n, &fld);
5061 FOR_EACH_VEC_ELT (alias_pair, alias_pairs, i, p)
5062 find_decls_types (p->decl, &fld);
5064 /* Find decls and types in every varpool symbol. */
5065 for (v = varpool_nodes; v; v = v->next)
5066 find_decls_types_in_var (v, &fld);
5068 /* Set the assembler name on every decl found. We need to do this
5069 now because free_lang_data_in_decl will invalidate data needed
5070 for mangling. This breaks mangling on interdependent decls. */
5071 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5072 assign_assembler_name_if_neeeded (t);
5074 /* Traverse every decl found freeing its language data. */
5075 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5076 free_lang_data_in_decl (t);
5078 /* Traverse every type found freeing its language data. */
5079 FOR_EACH_VEC_ELT (tree, fld.types, i, t)
5080 free_lang_data_in_type (t);
5082 pointer_set_destroy (fld.pset);
5083 VEC_free (tree, heap, fld.worklist);
5084 VEC_free (tree, heap, fld.decls);
5085 VEC_free (tree, heap, fld.types);
5089 /* Free resources that are used by FE but are not needed once they are done. */
5092 free_lang_data (void)
5096 /* If we are the LTO frontend we have freed lang-specific data already. */
5098 || !flag_generate_lto)
5101 /* Allocate and assign alias sets to the standard integer types
5102 while the slots are still in the way the frontends generated them. */
5103 for (i = 0; i < itk_none; ++i)
5104 if (integer_types[i])
5105 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5107 /* Traverse the IL resetting language specific information for
5108 operands, expressions, etc. */
5109 free_lang_data_in_cgraph ();
5111 /* Create gimple variants for common types. */
5112 ptrdiff_type_node = integer_type_node;
5113 fileptr_type_node = ptr_type_node;
5114 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
5115 || (TYPE_MODE (boolean_type_node)
5116 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
5117 || TYPE_PRECISION (boolean_type_node) != 1
5118 || !TYPE_UNSIGNED (boolean_type_node))
5120 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5121 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5122 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5123 TYPE_PRECISION (boolean_type_node) = 1;
5124 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5125 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5128 /* Unify char_type_node with its properly signed variant. */
5129 if (TYPE_UNSIGNED (char_type_node))
5130 unsigned_char_type_node = char_type_node;
5132 signed_char_type_node = char_type_node;
5134 /* Reset some langhooks. Do not reset types_compatible_p, it may
5135 still be used indirectly via the get_alias_set langhook. */
5136 lang_hooks.callgraph.analyze_expr = NULL;
5137 lang_hooks.dwarf_name = lhd_dwarf_name;
5138 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5139 /* We do not want the default decl_assembler_name implementation,
5140 rather if we have fixed everything we want a wrapper around it
5141 asserting that all non-local symbols already got their assembler
5142 name and only produce assembler names for local symbols. Or rather
5143 make sure we never call decl_assembler_name on local symbols and
5144 devise a separate, middle-end private scheme for it. */
5146 /* Reset diagnostic machinery. */
5147 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5148 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5149 diagnostic_format_decoder (global_dc) = default_tree_printer;
5155 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5159 "*free_lang_data", /* name */
5161 free_lang_data, /* execute */
5164 0, /* static_pass_number */
5165 TV_IPA_FREE_LANG_DATA, /* tv_id */
5166 0, /* properties_required */
5167 0, /* properties_provided */
5168 0, /* properties_destroyed */
5169 0, /* todo_flags_start */
5170 TODO_ggc_collect /* todo_flags_finish */
5174 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5177 We try both `text' and `__text__', ATTR may be either one. */
5178 /* ??? It might be a reasonable simplification to require ATTR to be only
5179 `text'. One might then also require attribute lists to be stored in
5180 their canonicalized form. */
5183 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5188 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5191 p = IDENTIFIER_POINTER (ident);
5192 ident_len = IDENTIFIER_LENGTH (ident);
5194 if (ident_len == attr_len
5195 && strcmp (attr, p) == 0)
5198 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5201 gcc_assert (attr[1] == '_');
5202 gcc_assert (attr[attr_len - 2] == '_');
5203 gcc_assert (attr[attr_len - 1] == '_');
5204 if (ident_len == attr_len - 4
5205 && strncmp (attr + 2, p, attr_len - 4) == 0)
5210 if (ident_len == attr_len + 4
5211 && p[0] == '_' && p[1] == '_'
5212 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5213 && strncmp (attr, p + 2, attr_len) == 0)
5220 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5223 We try both `text' and `__text__', ATTR may be either one. */
5226 is_attribute_p (const char *attr, const_tree ident)
5228 return is_attribute_with_length_p (attr, strlen (attr), ident);
5231 /* Given an attribute name and a list of attributes, return a pointer to the
5232 attribute's list element if the attribute is part of the list, or NULL_TREE
5233 if not found. If the attribute appears more than once, this only
5234 returns the first occurrence; the TREE_CHAIN of the return value should
5235 be passed back in if further occurrences are wanted. */
5238 lookup_attribute (const char *attr_name, tree list)
5241 size_t attr_len = strlen (attr_name);
5243 for (l = list; l; l = TREE_CHAIN (l))
5245 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5246 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5252 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5256 remove_attribute (const char *attr_name, tree list)
5259 size_t attr_len = strlen (attr_name);
5261 for (p = &list; *p; )
5264 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5265 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5266 *p = TREE_CHAIN (l);
5268 p = &TREE_CHAIN (l);
5274 /* Return an attribute list that is the union of a1 and a2. */
5277 merge_attributes (tree a1, tree a2)
5281 /* Either one unset? Take the set one. */
5283 if ((attributes = a1) == 0)
5286 /* One that completely contains the other? Take it. */
5288 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5290 if (attribute_list_contained (a2, a1))
5294 /* Pick the longest list, and hang on the other list. */
5296 if (list_length (a1) < list_length (a2))
5297 attributes = a2, a2 = a1;
5299 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5302 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5305 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5308 if (TREE_VALUE (a) != NULL
5309 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5310 && TREE_VALUE (a2) != NULL
5311 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5313 if (simple_cst_list_equal (TREE_VALUE (a),
5314 TREE_VALUE (a2)) == 1)
5317 else if (simple_cst_equal (TREE_VALUE (a),
5318 TREE_VALUE (a2)) == 1)
5323 a1 = copy_node (a2);
5324 TREE_CHAIN (a1) = attributes;
5333 /* Given types T1 and T2, merge their attributes and return
5337 merge_type_attributes (tree t1, tree t2)
5339 return merge_attributes (TYPE_ATTRIBUTES (t1),
5340 TYPE_ATTRIBUTES (t2));
5343 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5347 merge_decl_attributes (tree olddecl, tree newdecl)
5349 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5350 DECL_ATTRIBUTES (newdecl));
5353 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5355 /* Specialization of merge_decl_attributes for various Windows targets.
5357 This handles the following situation:
5359 __declspec (dllimport) int foo;
5362 The second instance of `foo' nullifies the dllimport. */
5365 merge_dllimport_decl_attributes (tree old, tree new_tree)
5368 int delete_dllimport_p = 1;
5370 /* What we need to do here is remove from `old' dllimport if it doesn't
5371 appear in `new'. dllimport behaves like extern: if a declaration is
5372 marked dllimport and a definition appears later, then the object
5373 is not dllimport'd. We also remove a `new' dllimport if the old list
5374 contains dllexport: dllexport always overrides dllimport, regardless
5375 of the order of declaration. */
5376 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5377 delete_dllimport_p = 0;
5378 else if (DECL_DLLIMPORT_P (new_tree)
5379 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5381 DECL_DLLIMPORT_P (new_tree) = 0;
5382 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5383 "dllimport ignored", new_tree);
5385 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5387 /* Warn about overriding a symbol that has already been used, e.g.:
5388 extern int __attribute__ ((dllimport)) foo;
5389 int* bar () {return &foo;}
5392 if (TREE_USED (old))
5394 warning (0, "%q+D redeclared without dllimport attribute "
5395 "after being referenced with dll linkage", new_tree);
5396 /* If we have used a variable's address with dllimport linkage,
5397 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5398 decl may already have had TREE_CONSTANT computed.
5399 We still remove the attribute so that assembler code refers
5400 to '&foo rather than '_imp__foo'. */
5401 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5402 DECL_DLLIMPORT_P (new_tree) = 1;
5405 /* Let an inline definition silently override the external reference,
5406 but otherwise warn about attribute inconsistency. */
5407 else if (TREE_CODE (new_tree) == VAR_DECL
5408 || !DECL_DECLARED_INLINE_P (new_tree))
5409 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5410 "previous dllimport ignored", new_tree);
5413 delete_dllimport_p = 0;
5415 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5417 if (delete_dllimport_p)
5420 const size_t attr_len = strlen ("dllimport");
5422 /* Scan the list for dllimport and delete it. */
5423 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5425 if (is_attribute_with_length_p ("dllimport", attr_len,
5428 if (prev == NULL_TREE)
5431 TREE_CHAIN (prev) = TREE_CHAIN (t);
5440 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5441 struct attribute_spec.handler. */
5444 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5450 /* These attributes may apply to structure and union types being created,
5451 but otherwise should pass to the declaration involved. */
5454 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5455 | (int) ATTR_FLAG_ARRAY_NEXT))
5457 *no_add_attrs = true;
5458 return tree_cons (name, args, NULL_TREE);
5460 if (TREE_CODE (node) == RECORD_TYPE
5461 || TREE_CODE (node) == UNION_TYPE)
5463 node = TYPE_NAME (node);
5469 warning (OPT_Wattributes, "%qE attribute ignored",
5471 *no_add_attrs = true;
5476 if (TREE_CODE (node) != FUNCTION_DECL
5477 && TREE_CODE (node) != VAR_DECL
5478 && TREE_CODE (node) != TYPE_DECL)
5480 *no_add_attrs = true;
5481 warning (OPT_Wattributes, "%qE attribute ignored",
5486 if (TREE_CODE (node) == TYPE_DECL
5487 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5488 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5490 *no_add_attrs = true;
5491 warning (OPT_Wattributes, "%qE attribute ignored",
5496 is_dllimport = is_attribute_p ("dllimport", name);
5498 /* Report error on dllimport ambiguities seen now before they cause
5502 /* Honor any target-specific overrides. */
5503 if (!targetm.valid_dllimport_attribute_p (node))
5504 *no_add_attrs = true;
5506 else if (TREE_CODE (node) == FUNCTION_DECL
5507 && DECL_DECLARED_INLINE_P (node))
5509 warning (OPT_Wattributes, "inline function %q+D declared as "
5510 " dllimport: attribute ignored", node);
5511 *no_add_attrs = true;
5513 /* Like MS, treat definition of dllimported variables and
5514 non-inlined functions on declaration as syntax errors. */
5515 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5517 error ("function %q+D definition is marked dllimport", node);
5518 *no_add_attrs = true;
5521 else if (TREE_CODE (node) == VAR_DECL)
5523 if (DECL_INITIAL (node))
5525 error ("variable %q+D definition is marked dllimport",
5527 *no_add_attrs = true;
5530 /* `extern' needn't be specified with dllimport.
5531 Specify `extern' now and hope for the best. Sigh. */
5532 DECL_EXTERNAL (node) = 1;
5533 /* Also, implicitly give dllimport'd variables declared within
5534 a function global scope, unless declared static. */
5535 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5536 TREE_PUBLIC (node) = 1;
5539 if (*no_add_attrs == false)
5540 DECL_DLLIMPORT_P (node) = 1;
5542 else if (TREE_CODE (node) == FUNCTION_DECL
5543 && DECL_DECLARED_INLINE_P (node)
5544 && flag_keep_inline_dllexport)
5545 /* An exported function, even if inline, must be emitted. */
5546 DECL_EXTERNAL (node) = 0;
5548 /* Report error if symbol is not accessible at global scope. */
5549 if (!TREE_PUBLIC (node)
5550 && (TREE_CODE (node) == VAR_DECL
5551 || TREE_CODE (node) == FUNCTION_DECL))
5553 error ("external linkage required for symbol %q+D because of "
5554 "%qE attribute", node, name);
5555 *no_add_attrs = true;
5558 /* A dllexport'd entity must have default visibility so that other
5559 program units (shared libraries or the main executable) can see
5560 it. A dllimport'd entity must have default visibility so that
5561 the linker knows that undefined references within this program
5562 unit can be resolved by the dynamic linker. */
5565 if (DECL_VISIBILITY_SPECIFIED (node)
5566 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5567 error ("%qE implies default visibility, but %qD has already "
5568 "been declared with a different visibility",
5570 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5571 DECL_VISIBILITY_SPECIFIED (node) = 1;
5577 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5579 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5580 of the various TYPE_QUAL values. */
5583 set_type_quals (tree type, int type_quals)
5585 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5586 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5587 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5588 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5591 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5594 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5596 return (TYPE_QUALS (cand) == type_quals
5597 && TYPE_NAME (cand) == TYPE_NAME (base)
5598 /* Apparently this is needed for Objective-C. */
5599 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5600 /* Check alignment. */
5601 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
5602 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5603 TYPE_ATTRIBUTES (base)));
5606 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5609 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
5611 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
5612 && TYPE_NAME (cand) == TYPE_NAME (base)
5613 /* Apparently this is needed for Objective-C. */
5614 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5615 /* Check alignment. */
5616 && TYPE_ALIGN (cand) == align
5617 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5618 TYPE_ATTRIBUTES (base)));
5621 /* Return a version of the TYPE, qualified as indicated by the
5622 TYPE_QUALS, if one exists. If no qualified version exists yet,
5623 return NULL_TREE. */
5626 get_qualified_type (tree type, int type_quals)
5630 if (TYPE_QUALS (type) == type_quals)
5633 /* Search the chain of variants to see if there is already one there just
5634 like the one we need to have. If so, use that existing one. We must
5635 preserve the TYPE_NAME, since there is code that depends on this. */
5636 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5637 if (check_qualified_type (t, type, type_quals))
5643 /* Like get_qualified_type, but creates the type if it does not
5644 exist. This function never returns NULL_TREE. */
5647 build_qualified_type (tree type, int type_quals)
5651 /* See if we already have the appropriate qualified variant. */
5652 t = get_qualified_type (type, type_quals);
5654 /* If not, build it. */
5657 t = build_variant_type_copy (type);
5658 set_type_quals (t, type_quals);
5660 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5661 /* Propagate structural equality. */
5662 SET_TYPE_STRUCTURAL_EQUALITY (t);
5663 else if (TYPE_CANONICAL (type) != type)
5664 /* Build the underlying canonical type, since it is different
5666 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5669 /* T is its own canonical type. */
5670 TYPE_CANONICAL (t) = t;
5677 /* Create a variant of type T with alignment ALIGN. */
5680 build_aligned_type (tree type, unsigned int align)
5684 if (TYPE_PACKED (type)
5685 || TYPE_ALIGN (type) == align)
5688 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5689 if (check_aligned_type (t, type, align))
5692 t = build_variant_type_copy (type);
5693 TYPE_ALIGN (t) = align;
5698 /* Create a new distinct copy of TYPE. The new type is made its own
5699 MAIN_VARIANT. If TYPE requires structural equality checks, the
5700 resulting type requires structural equality checks; otherwise, its
5701 TYPE_CANONICAL points to itself. */
5704 build_distinct_type_copy (tree type)
5706 tree t = copy_node (type);
5708 TYPE_POINTER_TO (t) = 0;
5709 TYPE_REFERENCE_TO (t) = 0;
5711 /* Set the canonical type either to a new equivalence class, or
5712 propagate the need for structural equality checks. */
5713 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5714 SET_TYPE_STRUCTURAL_EQUALITY (t);
5716 TYPE_CANONICAL (t) = t;
5718 /* Make it its own variant. */
5719 TYPE_MAIN_VARIANT (t) = t;
5720 TYPE_NEXT_VARIANT (t) = 0;
5722 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5723 whose TREE_TYPE is not t. This can also happen in the Ada
5724 frontend when using subtypes. */
5729 /* Create a new variant of TYPE, equivalent but distinct. This is so
5730 the caller can modify it. TYPE_CANONICAL for the return type will
5731 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5732 are considered equal by the language itself (or that both types
5733 require structural equality checks). */
5736 build_variant_type_copy (tree type)
5738 tree t, m = TYPE_MAIN_VARIANT (type);
5740 t = build_distinct_type_copy (type);
5742 /* Since we're building a variant, assume that it is a non-semantic
5743 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5744 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5746 /* Add the new type to the chain of variants of TYPE. */
5747 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5748 TYPE_NEXT_VARIANT (m) = t;
5749 TYPE_MAIN_VARIANT (t) = m;
5754 /* Return true if the from tree in both tree maps are equal. */
5757 tree_map_base_eq (const void *va, const void *vb)
5759 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5760 *const b = (const struct tree_map_base *) vb;
5761 return (a->from == b->from);
5764 /* Hash a from tree in a tree_base_map. */
5767 tree_map_base_hash (const void *item)
5769 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5772 /* Return true if this tree map structure is marked for garbage collection
5773 purposes. We simply return true if the from tree is marked, so that this
5774 structure goes away when the from tree goes away. */
5777 tree_map_base_marked_p (const void *p)
5779 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5782 /* Hash a from tree in a tree_map. */
5785 tree_map_hash (const void *item)
5787 return (((const struct tree_map *) item)->hash);
5790 /* Hash a from tree in a tree_decl_map. */
5793 tree_decl_map_hash (const void *item)
5795 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
5798 /* Return the initialization priority for DECL. */
5801 decl_init_priority_lookup (tree decl)
5803 struct tree_priority_map *h;
5804 struct tree_map_base in;
5806 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5808 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5809 return h ? h->init : DEFAULT_INIT_PRIORITY;
5812 /* Return the finalization priority for DECL. */
5815 decl_fini_priority_lookup (tree decl)
5817 struct tree_priority_map *h;
5818 struct tree_map_base in;
5820 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5822 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5823 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5826 /* Return the initialization and finalization priority information for
5827 DECL. If there is no previous priority information, a freshly
5828 allocated structure is returned. */
5830 static struct tree_priority_map *
5831 decl_priority_info (tree decl)
5833 struct tree_priority_map in;
5834 struct tree_priority_map *h;
5837 in.base.from = decl;
5838 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5839 h = (struct tree_priority_map *) *loc;
5842 h = ggc_alloc_cleared_tree_priority_map ();
5844 h->base.from = decl;
5845 h->init = DEFAULT_INIT_PRIORITY;
5846 h->fini = DEFAULT_INIT_PRIORITY;
5852 /* Set the initialization priority for DECL to PRIORITY. */
5855 decl_init_priority_insert (tree decl, priority_type priority)
5857 struct tree_priority_map *h;
5859 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5860 h = decl_priority_info (decl);
5864 /* Set the finalization priority for DECL to PRIORITY. */
5867 decl_fini_priority_insert (tree decl, priority_type priority)
5869 struct tree_priority_map *h;
5871 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5872 h = decl_priority_info (decl);
5876 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5879 print_debug_expr_statistics (void)
5881 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5882 (long) htab_size (debug_expr_for_decl),
5883 (long) htab_elements (debug_expr_for_decl),
5884 htab_collisions (debug_expr_for_decl));
5887 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5890 print_value_expr_statistics (void)
5892 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5893 (long) htab_size (value_expr_for_decl),
5894 (long) htab_elements (value_expr_for_decl),
5895 htab_collisions (value_expr_for_decl));
5898 /* Lookup a debug expression for FROM, and return it if we find one. */
5901 decl_debug_expr_lookup (tree from)
5903 struct tree_decl_map *h, in;
5904 in.base.from = from;
5906 h = (struct tree_decl_map *)
5907 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
5913 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5916 decl_debug_expr_insert (tree from, tree to)
5918 struct tree_decl_map *h;
5921 h = ggc_alloc_tree_decl_map ();
5922 h->base.from = from;
5924 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
5926 *(struct tree_decl_map **) loc = h;
5929 /* Lookup a value expression for FROM, and return it if we find one. */
5932 decl_value_expr_lookup (tree from)
5934 struct tree_decl_map *h, in;
5935 in.base.from = from;
5937 h = (struct tree_decl_map *)
5938 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
5944 /* Insert a mapping FROM->TO in the value expression hashtable. */
5947 decl_value_expr_insert (tree from, tree to)
5949 struct tree_decl_map *h;
5952 h = ggc_alloc_tree_decl_map ();
5953 h->base.from = from;
5955 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
5957 *(struct tree_decl_map **) loc = h;
5960 /* Hashing of types so that we don't make duplicates.
5961 The entry point is `type_hash_canon'. */
5963 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5964 with types in the TREE_VALUE slots), by adding the hash codes
5965 of the individual types. */
5968 type_hash_list (const_tree list, hashval_t hashcode)
5972 for (tail = list; tail; tail = TREE_CHAIN (tail))
5973 if (TREE_VALUE (tail) != error_mark_node)
5974 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5980 /* These are the Hashtable callback functions. */
5982 /* Returns true iff the types are equivalent. */
5985 type_hash_eq (const void *va, const void *vb)
5987 const struct type_hash *const a = (const struct type_hash *) va,
5988 *const b = (const struct type_hash *) vb;
5990 /* First test the things that are the same for all types. */
5991 if (a->hash != b->hash
5992 || TREE_CODE (a->type) != TREE_CODE (b->type)
5993 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5994 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5995 TYPE_ATTRIBUTES (b->type))
5996 || (TREE_CODE (a->type) != COMPLEX_TYPE
5997 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
6000 /* Be careful about comparing arrays before and after the element type
6001 has been completed; don't compare TYPE_ALIGN unless both types are
6003 if (COMPLETE_TYPE_P (a->type) && COMPLETE_TYPE_P (b->type)
6004 && (TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
6005 || TYPE_MODE (a->type) != TYPE_MODE (b->type)))
6008 switch (TREE_CODE (a->type))
6013 case REFERENCE_TYPE:
6017 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
6020 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
6021 && !(TYPE_VALUES (a->type)
6022 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
6023 && TYPE_VALUES (b->type)
6024 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
6025 && type_list_equal (TYPE_VALUES (a->type),
6026 TYPE_VALUES (b->type))))
6029 /* ... fall through ... */
6034 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
6035 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
6036 TYPE_MAX_VALUE (b->type)))
6037 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
6038 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
6039 TYPE_MIN_VALUE (b->type))));
6041 case FIXED_POINT_TYPE:
6042 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
6045 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
6048 if (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
6049 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6050 || (TYPE_ARG_TYPES (a->type)
6051 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6052 && TYPE_ARG_TYPES (b->type)
6053 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6054 && type_list_equal (TYPE_ARG_TYPES (a->type),
6055 TYPE_ARG_TYPES (b->type)))))
6059 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
6063 case QUAL_UNION_TYPE:
6064 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
6065 || (TYPE_FIELDS (a->type)
6066 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
6067 && TYPE_FIELDS (b->type)
6068 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
6069 && type_list_equal (TYPE_FIELDS (a->type),
6070 TYPE_FIELDS (b->type))));
6073 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
6074 || (TYPE_ARG_TYPES (a->type)
6075 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
6076 && TYPE_ARG_TYPES (b->type)
6077 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
6078 && type_list_equal (TYPE_ARG_TYPES (a->type),
6079 TYPE_ARG_TYPES (b->type))))
6087 if (lang_hooks.types.type_hash_eq != NULL)
6088 return lang_hooks.types.type_hash_eq (a->type, b->type);
6093 /* Return the cached hash value. */
6096 type_hash_hash (const void *item)
6098 return ((const struct type_hash *) item)->hash;
6101 /* Look in the type hash table for a type isomorphic to TYPE.
6102 If one is found, return it. Otherwise return 0. */
6105 type_hash_lookup (hashval_t hashcode, tree type)
6107 struct type_hash *h, in;
6109 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6110 must call that routine before comparing TYPE_ALIGNs. */
6116 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6123 /* Add an entry to the type-hash-table
6124 for a type TYPE whose hash code is HASHCODE. */
6127 type_hash_add (hashval_t hashcode, tree type)
6129 struct type_hash *h;
6132 h = ggc_alloc_type_hash ();
6135 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6139 /* Given TYPE, and HASHCODE its hash code, return the canonical
6140 object for an identical type if one already exists.
6141 Otherwise, return TYPE, and record it as the canonical object.
6143 To use this function, first create a type of the sort you want.
6144 Then compute its hash code from the fields of the type that
6145 make it different from other similar types.
6146 Then call this function and use the value. */
6149 type_hash_canon (unsigned int hashcode, tree type)
6153 /* The hash table only contains main variants, so ensure that's what we're
6155 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6157 /* See if the type is in the hash table already. If so, return it.
6158 Otherwise, add the type. */
6159 t1 = type_hash_lookup (hashcode, type);
6162 #ifdef GATHER_STATISTICS
6163 tree_node_counts[(int) t_kind]--;
6164 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
6170 type_hash_add (hashcode, type);
6175 /* See if the data pointed to by the type hash table is marked. We consider
6176 it marked if the type is marked or if a debug type number or symbol
6177 table entry has been made for the type. */
6180 type_hash_marked_p (const void *p)
6182 const_tree const type = ((const struct type_hash *) p)->type;
6184 return ggc_marked_p (type);
6188 print_type_hash_statistics (void)
6190 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6191 (long) htab_size (type_hash_table),
6192 (long) htab_elements (type_hash_table),
6193 htab_collisions (type_hash_table));
6196 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6197 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6198 by adding the hash codes of the individual attributes. */
6201 attribute_hash_list (const_tree list, hashval_t hashcode)
6205 for (tail = list; tail; tail = TREE_CHAIN (tail))
6206 /* ??? Do we want to add in TREE_VALUE too? */
6207 hashcode = iterative_hash_object
6208 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6212 /* Given two lists of attributes, return true if list l2 is
6213 equivalent to l1. */
6216 attribute_list_equal (const_tree l1, const_tree l2)
6218 return attribute_list_contained (l1, l2)
6219 && attribute_list_contained (l2, l1);
6222 /* Given two lists of attributes, return true if list L2 is
6223 completely contained within L1. */
6224 /* ??? This would be faster if attribute names were stored in a canonicalized
6225 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6226 must be used to show these elements are equivalent (which they are). */
6227 /* ??? It's not clear that attributes with arguments will always be handled
6231 attribute_list_contained (const_tree l1, const_tree l2)
6235 /* First check the obvious, maybe the lists are identical. */
6239 /* Maybe the lists are similar. */
6240 for (t1 = l1, t2 = l2;
6242 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6243 && TREE_VALUE (t1) == TREE_VALUE (t2);
6244 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6246 /* Maybe the lists are equal. */
6247 if (t1 == 0 && t2 == 0)
6250 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6253 /* This CONST_CAST is okay because lookup_attribute does not
6254 modify its argument and the return value is assigned to a
6256 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6257 CONST_CAST_TREE(l1));
6259 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6262 if (TREE_VALUE (t2) != NULL
6263 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6264 && TREE_VALUE (attr) != NULL
6265 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6267 if (simple_cst_list_equal (TREE_VALUE (t2),
6268 TREE_VALUE (attr)) == 1)
6271 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6282 /* Given two lists of types
6283 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6284 return 1 if the lists contain the same types in the same order.
6285 Also, the TREE_PURPOSEs must match. */
6288 type_list_equal (const_tree l1, const_tree l2)
6292 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6293 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6294 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6295 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6296 && (TREE_TYPE (TREE_PURPOSE (t1))
6297 == TREE_TYPE (TREE_PURPOSE (t2))))))
6303 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6304 given by TYPE. If the argument list accepts variable arguments,
6305 then this function counts only the ordinary arguments. */
6308 type_num_arguments (const_tree type)
6313 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6314 /* If the function does not take a variable number of arguments,
6315 the last element in the list will have type `void'. */
6316 if (VOID_TYPE_P (TREE_VALUE (t)))
6324 /* Nonzero if integer constants T1 and T2
6325 represent the same constant value. */
6328 tree_int_cst_equal (const_tree t1, const_tree t2)
6333 if (t1 == 0 || t2 == 0)
6336 if (TREE_CODE (t1) == INTEGER_CST
6337 && TREE_CODE (t2) == INTEGER_CST
6338 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6339 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6345 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6346 The precise way of comparison depends on their data type. */
6349 tree_int_cst_lt (const_tree t1, const_tree t2)
6354 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6356 int t1_sgn = tree_int_cst_sgn (t1);
6357 int t2_sgn = tree_int_cst_sgn (t2);
6359 if (t1_sgn < t2_sgn)
6361 else if (t1_sgn > t2_sgn)
6363 /* Otherwise, both are non-negative, so we compare them as
6364 unsigned just in case one of them would overflow a signed
6367 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6368 return INT_CST_LT (t1, t2);
6370 return INT_CST_LT_UNSIGNED (t1, t2);
6373 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6376 tree_int_cst_compare (const_tree t1, const_tree t2)
6378 if (tree_int_cst_lt (t1, t2))
6380 else if (tree_int_cst_lt (t2, t1))
6386 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6387 the host. If POS is zero, the value can be represented in a single
6388 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6389 be represented in a single unsigned HOST_WIDE_INT. */
6392 host_integerp (const_tree t, int pos)
6397 return (TREE_CODE (t) == INTEGER_CST
6398 && ((TREE_INT_CST_HIGH (t) == 0
6399 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6400 || (! pos && TREE_INT_CST_HIGH (t) == -1
6401 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6402 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6403 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6404 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6405 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6408 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6409 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6410 be non-negative. We must be able to satisfy the above conditions. */
6413 tree_low_cst (const_tree t, int pos)
6415 gcc_assert (host_integerp (t, pos));
6416 return TREE_INT_CST_LOW (t);
6419 /* Return the most significant bit of the integer constant T. */
6422 tree_int_cst_msb (const_tree t)
6426 unsigned HOST_WIDE_INT l;
6428 /* Note that using TYPE_PRECISION here is wrong. We care about the
6429 actual bits, not the (arbitrary) range of the type. */
6430 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6431 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6432 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6433 return (l & 1) == 1;
6436 /* Return an indication of the sign of the integer constant T.
6437 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6438 Note that -1 will never be returned if T's type is unsigned. */
6441 tree_int_cst_sgn (const_tree t)
6443 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6445 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6447 else if (TREE_INT_CST_HIGH (t) < 0)
6453 /* Return the minimum number of bits needed to represent VALUE in a
6454 signed or unsigned type, UNSIGNEDP says which. */
6457 tree_int_cst_min_precision (tree value, bool unsignedp)
6461 /* If the value is negative, compute its negative minus 1. The latter
6462 adjustment is because the absolute value of the largest negative value
6463 is one larger than the largest positive value. This is equivalent to
6464 a bit-wise negation, so use that operation instead. */
6466 if (tree_int_cst_sgn (value) < 0)
6467 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6469 /* Return the number of bits needed, taking into account the fact
6470 that we need one more bit for a signed than unsigned type. */
6472 if (integer_zerop (value))
6475 log = tree_floor_log2 (value);
6477 return log + 1 + !unsignedp;
6480 /* Compare two constructor-element-type constants. Return 1 if the lists
6481 are known to be equal; otherwise return 0. */
6484 simple_cst_list_equal (const_tree l1, const_tree l2)
6486 while (l1 != NULL_TREE && l2 != NULL_TREE)
6488 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6491 l1 = TREE_CHAIN (l1);
6492 l2 = TREE_CHAIN (l2);
6498 /* Return truthvalue of whether T1 is the same tree structure as T2.
6499 Return 1 if they are the same.
6500 Return 0 if they are understandably different.
6501 Return -1 if either contains tree structure not understood by
6505 simple_cst_equal (const_tree t1, const_tree t2)
6507 enum tree_code code1, code2;
6513 if (t1 == 0 || t2 == 0)
6516 code1 = TREE_CODE (t1);
6517 code2 = TREE_CODE (t2);
6519 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6521 if (CONVERT_EXPR_CODE_P (code2)
6522 || code2 == NON_LVALUE_EXPR)
6523 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6525 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6528 else if (CONVERT_EXPR_CODE_P (code2)
6529 || code2 == NON_LVALUE_EXPR)
6530 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6538 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6539 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6542 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6545 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6548 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6549 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6550 TREE_STRING_LENGTH (t1)));
6554 unsigned HOST_WIDE_INT idx;
6555 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6556 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6558 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6561 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6562 /* ??? Should we handle also fields here? */
6563 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6564 VEC_index (constructor_elt, v2, idx)->value))
6570 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6573 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6576 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6579 const_tree arg1, arg2;
6580 const_call_expr_arg_iterator iter1, iter2;
6581 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6582 arg2 = first_const_call_expr_arg (t2, &iter2);
6584 arg1 = next_const_call_expr_arg (&iter1),
6585 arg2 = next_const_call_expr_arg (&iter2))
6587 cmp = simple_cst_equal (arg1, arg2);
6591 return arg1 == arg2;
6595 /* Special case: if either target is an unallocated VAR_DECL,
6596 it means that it's going to be unified with whatever the
6597 TARGET_EXPR is really supposed to initialize, so treat it
6598 as being equivalent to anything. */
6599 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6600 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6601 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6602 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6603 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6604 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6607 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6612 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6614 case WITH_CLEANUP_EXPR:
6615 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6619 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6622 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6623 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6637 /* This general rule works for most tree codes. All exceptions should be
6638 handled above. If this is a language-specific tree code, we can't
6639 trust what might be in the operand, so say we don't know
6641 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6644 switch (TREE_CODE_CLASS (code1))
6648 case tcc_comparison:
6649 case tcc_expression:
6653 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6655 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6667 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6668 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6669 than U, respectively. */
6672 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6674 if (tree_int_cst_sgn (t) < 0)
6676 else if (TREE_INT_CST_HIGH (t) != 0)
6678 else if (TREE_INT_CST_LOW (t) == u)
6680 else if (TREE_INT_CST_LOW (t) < u)
6686 /* Return true if CODE represents an associative tree code. Otherwise
6689 associative_tree_code (enum tree_code code)
6708 /* Return true if CODE represents a commutative tree code. Otherwise
6711 commutative_tree_code (enum tree_code code)
6724 case UNORDERED_EXPR:
6728 case TRUTH_AND_EXPR:
6729 case TRUTH_XOR_EXPR:
6739 /* Return true if CODE represents a ternary tree code for which the
6740 first two operands are commutative. Otherwise return false. */
6742 commutative_ternary_tree_code (enum tree_code code)
6746 case WIDEN_MULT_PLUS_EXPR:
6747 case WIDEN_MULT_MINUS_EXPR:
6756 /* Generate a hash value for an expression. This can be used iteratively
6757 by passing a previous result as the VAL argument.
6759 This function is intended to produce the same hash for expressions which
6760 would compare equal using operand_equal_p. */
6763 iterative_hash_expr (const_tree t, hashval_t val)
6766 enum tree_code code;
6770 return iterative_hash_hashval_t (0, val);
6772 code = TREE_CODE (t);
6776 /* Alas, constants aren't shared, so we can't rely on pointer
6779 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6780 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6783 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6785 return iterative_hash_hashval_t (val2, val);
6789 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6791 return iterative_hash_hashval_t (val2, val);
6794 return iterative_hash (TREE_STRING_POINTER (t),
6795 TREE_STRING_LENGTH (t), val);
6797 val = iterative_hash_expr (TREE_REALPART (t), val);
6798 return iterative_hash_expr (TREE_IMAGPART (t), val);
6800 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6802 /* We can just compare by pointer. */
6803 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6804 case PLACEHOLDER_EXPR:
6805 /* The node itself doesn't matter. */
6808 /* A list of expressions, for a CALL_EXPR or as the elements of a
6810 for (; t; t = TREE_CHAIN (t))
6811 val = iterative_hash_expr (TREE_VALUE (t), val);
6815 unsigned HOST_WIDE_INT idx;
6817 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6819 val = iterative_hash_expr (field, val);
6820 val = iterative_hash_expr (value, val);
6826 /* The type of the second operand is relevant, except for
6827 its top-level qualifiers. */
6828 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t, 1)));
6830 val = iterative_hash_object (TYPE_HASH (type), val);
6832 /* We could use the standard hash computation from this point
6834 val = iterative_hash_object (code, val);
6835 val = iterative_hash_expr (TREE_OPERAND (t, 1), val);
6836 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6840 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6841 Otherwise nodes that compare equal according to operand_equal_p might
6842 get different hash codes. However, don't do this for machine specific
6843 or front end builtins, since the function code is overloaded in those
6845 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6846 && built_in_decls[DECL_FUNCTION_CODE (t)])
6848 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6849 code = TREE_CODE (t);
6853 tclass = TREE_CODE_CLASS (code);
6855 if (tclass == tcc_declaration)
6857 /* DECL's have a unique ID */
6858 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6862 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6864 val = iterative_hash_object (code, val);
6866 /* Don't hash the type, that can lead to having nodes which
6867 compare equal according to operand_equal_p, but which
6868 have different hash codes. */
6869 if (CONVERT_EXPR_CODE_P (code)
6870 || code == NON_LVALUE_EXPR)
6872 /* Make sure to include signness in the hash computation. */
6873 val += TYPE_UNSIGNED (TREE_TYPE (t));
6874 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6877 else if (commutative_tree_code (code))
6879 /* It's a commutative expression. We want to hash it the same
6880 however it appears. We do this by first hashing both operands
6881 and then rehashing based on the order of their independent
6883 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6884 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6888 t = one, one = two, two = t;
6890 val = iterative_hash_hashval_t (one, val);
6891 val = iterative_hash_hashval_t (two, val);
6894 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6895 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6902 /* Generate a hash value for a pair of expressions. This can be used
6903 iteratively by passing a previous result as the VAL argument.
6905 The same hash value is always returned for a given pair of expressions,
6906 regardless of the order in which they are presented. This is useful in
6907 hashing the operands of commutative functions. */
6910 iterative_hash_exprs_commutative (const_tree t1,
6911 const_tree t2, hashval_t val)
6913 hashval_t one = iterative_hash_expr (t1, 0);
6914 hashval_t two = iterative_hash_expr (t2, 0);
6918 t = one, one = two, two = t;
6919 val = iterative_hash_hashval_t (one, val);
6920 val = iterative_hash_hashval_t (two, val);
6925 /* Constructors for pointer, array and function types.
6926 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6927 constructed by language-dependent code, not here.) */
6929 /* Construct, lay out and return the type of pointers to TO_TYPE with
6930 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6931 reference all of memory. If such a type has already been
6932 constructed, reuse it. */
6935 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6940 if (to_type == error_mark_node)
6941 return error_mark_node;
6943 /* If the pointed-to type has the may_alias attribute set, force
6944 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6945 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6946 can_alias_all = true;
6948 /* In some cases, languages will have things that aren't a POINTER_TYPE
6949 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6950 In that case, return that type without regard to the rest of our
6953 ??? This is a kludge, but consistent with the way this function has
6954 always operated and there doesn't seem to be a good way to avoid this
6956 if (TYPE_POINTER_TO (to_type) != 0
6957 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6958 return TYPE_POINTER_TO (to_type);
6960 /* First, if we already have a type for pointers to TO_TYPE and it's
6961 the proper mode, use it. */
6962 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6963 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6966 t = make_node (POINTER_TYPE);
6968 TREE_TYPE (t) = to_type;
6969 SET_TYPE_MODE (t, mode);
6970 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6971 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6972 TYPE_POINTER_TO (to_type) = t;
6974 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6975 SET_TYPE_STRUCTURAL_EQUALITY (t);
6976 else if (TYPE_CANONICAL (to_type) != to_type)
6978 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6979 mode, can_alias_all);
6981 /* Lay out the type. This function has many callers that are concerned
6982 with expression-construction, and this simplifies them all. */
6988 /* By default build pointers in ptr_mode. */
6991 build_pointer_type (tree to_type)
6993 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6994 : TYPE_ADDR_SPACE (to_type);
6995 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6996 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6999 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7002 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
7007 if (to_type == error_mark_node)
7008 return error_mark_node;
7010 /* If the pointed-to type has the may_alias attribute set, force
7011 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7012 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
7013 can_alias_all = true;
7015 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7016 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7017 In that case, return that type without regard to the rest of our
7020 ??? This is a kludge, but consistent with the way this function has
7021 always operated and there doesn't seem to be a good way to avoid this
7023 if (TYPE_REFERENCE_TO (to_type) != 0
7024 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
7025 return TYPE_REFERENCE_TO (to_type);
7027 /* First, if we already have a type for pointers to TO_TYPE and it's
7028 the proper mode, use it. */
7029 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
7030 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
7033 t = make_node (REFERENCE_TYPE);
7035 TREE_TYPE (t) = to_type;
7036 SET_TYPE_MODE (t, mode);
7037 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
7038 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
7039 TYPE_REFERENCE_TO (to_type) = t;
7041 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
7042 SET_TYPE_STRUCTURAL_EQUALITY (t);
7043 else if (TYPE_CANONICAL (to_type) != to_type)
7045 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
7046 mode, can_alias_all);
7054 /* Build the node for the type of references-to-TO_TYPE by default
7058 build_reference_type (tree to_type)
7060 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
7061 : TYPE_ADDR_SPACE (to_type);
7062 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
7063 return build_reference_type_for_mode (to_type, pointer_mode, false);
7066 /* Build a type that is compatible with t but has no cv quals anywhere
7069 const char *const *const * -> char ***. */
7072 build_type_no_quals (tree t)
7074 switch (TREE_CODE (t))
7077 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7079 TYPE_REF_CAN_ALIAS_ALL (t));
7080 case REFERENCE_TYPE:
7082 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
7084 TYPE_REF_CAN_ALIAS_ALL (t));
7086 return TYPE_MAIN_VARIANT (t);
7090 #define MAX_INT_CACHED_PREC \
7091 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7092 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7094 /* Builds a signed or unsigned integer type of precision PRECISION.
7095 Used for C bitfields whose precision does not match that of
7096 built-in target types. */
7098 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7104 unsignedp = MAX_INT_CACHED_PREC + 1;
7106 if (precision <= MAX_INT_CACHED_PREC)
7108 itype = nonstandard_integer_type_cache[precision + unsignedp];
7113 itype = make_node (INTEGER_TYPE);
7114 TYPE_PRECISION (itype) = precision;
7117 fixup_unsigned_type (itype);
7119 fixup_signed_type (itype);
7122 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7123 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7124 if (precision <= MAX_INT_CACHED_PREC)
7125 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7130 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7131 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7132 is true, reuse such a type that has already been constructed. */
7135 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7137 tree itype = make_node (INTEGER_TYPE);
7138 hashval_t hashcode = 0;
7140 TREE_TYPE (itype) = type;
7142 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7143 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7145 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7146 SET_TYPE_MODE (itype, TYPE_MODE (type));
7147 TYPE_SIZE (itype) = TYPE_SIZE (type);
7148 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7149 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7150 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7155 if ((TYPE_MIN_VALUE (itype)
7156 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7157 || (TYPE_MAX_VALUE (itype)
7158 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7160 /* Since we cannot reliably merge this type, we need to compare it using
7161 structural equality checks. */
7162 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7166 hashcode = iterative_hash_expr (TYPE_MIN_VALUE (itype), hashcode);
7167 hashcode = iterative_hash_expr (TYPE_MAX_VALUE (itype), hashcode);
7168 hashcode = iterative_hash_hashval_t (TYPE_HASH (type), hashcode);
7169 itype = type_hash_canon (hashcode, itype);
7174 /* Wrapper around build_range_type_1 with SHARED set to true. */
7177 build_range_type (tree type, tree lowval, tree highval)
7179 return build_range_type_1 (type, lowval, highval, true);
7182 /* Wrapper around build_range_type_1 with SHARED set to false. */
7185 build_nonshared_range_type (tree type, tree lowval, tree highval)
7187 return build_range_type_1 (type, lowval, highval, false);
7190 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7191 MAXVAL should be the maximum value in the domain
7192 (one less than the length of the array).
7194 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7195 We don't enforce this limit, that is up to caller (e.g. language front end).
7196 The limit exists because the result is a signed type and we don't handle
7197 sizes that use more than one HOST_WIDE_INT. */
7200 build_index_type (tree maxval)
7202 return build_range_type (sizetype, size_zero_node, maxval);
7205 /* Return true if the debug information for TYPE, a subtype, should be emitted
7206 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7207 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7208 debug info and doesn't reflect the source code. */
7211 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7213 tree base_type = TREE_TYPE (type), low, high;
7215 /* Subrange types have a base type which is an integral type. */
7216 if (!INTEGRAL_TYPE_P (base_type))
7219 /* Get the real bounds of the subtype. */
7220 if (lang_hooks.types.get_subrange_bounds)
7221 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7224 low = TYPE_MIN_VALUE (type);
7225 high = TYPE_MAX_VALUE (type);
7228 /* If the type and its base type have the same representation and the same
7229 name, then the type is not a subrange but a copy of the base type. */
7230 if ((TREE_CODE (base_type) == INTEGER_TYPE
7231 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7232 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7233 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7234 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7236 tree type_name = TYPE_NAME (type);
7237 tree base_type_name = TYPE_NAME (base_type);
7239 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7240 type_name = DECL_NAME (type_name);
7242 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7243 base_type_name = DECL_NAME (base_type_name);
7245 if (type_name == base_type_name)
7256 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7257 and number of elements specified by the range of values of INDEX_TYPE.
7258 If SHARED is true, reuse such a type that has already been constructed. */
7261 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7265 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7267 error ("arrays of functions are not meaningful");
7268 elt_type = integer_type_node;
7271 t = make_node (ARRAY_TYPE);
7272 TREE_TYPE (t) = elt_type;
7273 TYPE_DOMAIN (t) = index_type;
7274 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7277 /* If the element type is incomplete at this point we get marked for
7278 structural equality. Do not record these types in the canonical
7280 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7285 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7287 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7288 t = type_hash_canon (hashcode, t);
7291 if (TYPE_CANONICAL (t) == t)
7293 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7294 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7295 SET_TYPE_STRUCTURAL_EQUALITY (t);
7296 else if (TYPE_CANONICAL (elt_type) != elt_type
7297 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7299 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7301 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7308 /* Wrapper around build_array_type_1 with SHARED set to true. */
7311 build_array_type (tree elt_type, tree index_type)
7313 return build_array_type_1 (elt_type, index_type, true);
7316 /* Wrapper around build_array_type_1 with SHARED set to false. */
7319 build_nonshared_array_type (tree elt_type, tree index_type)
7321 return build_array_type_1 (elt_type, index_type, false);
7324 /* Recursively examines the array elements of TYPE, until a non-array
7325 element type is found. */
7328 strip_array_types (tree type)
7330 while (TREE_CODE (type) == ARRAY_TYPE)
7331 type = TREE_TYPE (type);
7336 /* Computes the canonical argument types from the argument type list
7339 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7340 on entry to this function, or if any of the ARGTYPES are
7343 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7344 true on entry to this function, or if any of the ARGTYPES are
7347 Returns a canonical argument list, which may be ARGTYPES when the
7348 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7349 true) or would not differ from ARGTYPES. */
7352 maybe_canonicalize_argtypes(tree argtypes,
7353 bool *any_structural_p,
7354 bool *any_noncanonical_p)
7357 bool any_noncanonical_argtypes_p = false;
7359 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7361 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7362 /* Fail gracefully by stating that the type is structural. */
7363 *any_structural_p = true;
7364 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7365 *any_structural_p = true;
7366 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7367 || TREE_PURPOSE (arg))
7368 /* If the argument has a default argument, we consider it
7369 non-canonical even though the type itself is canonical.
7370 That way, different variants of function and method types
7371 with default arguments will all point to the variant with
7372 no defaults as their canonical type. */
7373 any_noncanonical_argtypes_p = true;
7376 if (*any_structural_p)
7379 if (any_noncanonical_argtypes_p)
7381 /* Build the canonical list of argument types. */
7382 tree canon_argtypes = NULL_TREE;
7383 bool is_void = false;
7385 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7387 if (arg == void_list_node)
7390 canon_argtypes = tree_cons (NULL_TREE,
7391 TYPE_CANONICAL (TREE_VALUE (arg)),
7395 canon_argtypes = nreverse (canon_argtypes);
7397 canon_argtypes = chainon (canon_argtypes, void_list_node);
7399 /* There is a non-canonical type. */
7400 *any_noncanonical_p = true;
7401 return canon_argtypes;
7404 /* The canonical argument types are the same as ARGTYPES. */
7408 /* Construct, lay out and return
7409 the type of functions returning type VALUE_TYPE
7410 given arguments of types ARG_TYPES.
7411 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7412 are data type nodes for the arguments of the function.
7413 If such a type has already been constructed, reuse it. */
7416 build_function_type (tree value_type, tree arg_types)
7419 hashval_t hashcode = 0;
7420 bool any_structural_p, any_noncanonical_p;
7421 tree canon_argtypes;
7423 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7425 error ("function return type cannot be function");
7426 value_type = integer_type_node;
7429 /* Make a node of the sort we want. */
7430 t = make_node (FUNCTION_TYPE);
7431 TREE_TYPE (t) = value_type;
7432 TYPE_ARG_TYPES (t) = arg_types;
7434 /* If we already have such a type, use the old one. */
7435 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7436 hashcode = type_hash_list (arg_types, hashcode);
7437 t = type_hash_canon (hashcode, t);
7439 /* Set up the canonical type. */
7440 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7441 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7442 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7444 &any_noncanonical_p);
7445 if (any_structural_p)
7446 SET_TYPE_STRUCTURAL_EQUALITY (t);
7447 else if (any_noncanonical_p)
7448 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7451 if (!COMPLETE_TYPE_P (t))
7456 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7459 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7461 tree new_type = NULL;
7462 tree args, new_args = NULL, t;
7466 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7467 args = TREE_CHAIN (args), i++)
7468 if (!bitmap_bit_p (args_to_skip, i))
7469 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7471 new_reversed = nreverse (new_args);
7475 TREE_CHAIN (new_args) = void_list_node;
7477 new_reversed = void_list_node;
7480 /* Use copy_node to preserve as much as possible from original type
7481 (debug info, attribute lists etc.)
7482 Exception is METHOD_TYPEs must have THIS argument.
7483 When we are asked to remove it, we need to build new FUNCTION_TYPE
7485 if (TREE_CODE (orig_type) != METHOD_TYPE
7486 || !bitmap_bit_p (args_to_skip, 0))
7488 new_type = build_distinct_type_copy (orig_type);
7489 TYPE_ARG_TYPES (new_type) = new_reversed;
7494 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7496 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7499 /* This is a new type, not a copy of an old type. Need to reassociate
7500 variants. We can handle everything except the main variant lazily. */
7501 t = TYPE_MAIN_VARIANT (orig_type);
7504 TYPE_MAIN_VARIANT (new_type) = t;
7505 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7506 TYPE_NEXT_VARIANT (t) = new_type;
7510 TYPE_MAIN_VARIANT (new_type) = new_type;
7511 TYPE_NEXT_VARIANT (new_type) = NULL;
7516 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7518 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7519 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7520 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7523 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7525 tree new_decl = copy_node (orig_decl);
7528 new_type = TREE_TYPE (orig_decl);
7529 if (prototype_p (new_type))
7530 new_type = build_function_type_skip_args (new_type, args_to_skip);
7531 TREE_TYPE (new_decl) = new_type;
7533 /* For declarations setting DECL_VINDEX (i.e. methods)
7534 we expect first argument to be THIS pointer. */
7535 if (bitmap_bit_p (args_to_skip, 0))
7536 DECL_VINDEX (new_decl) = NULL_TREE;
7538 /* When signature changes, we need to clear builtin info. */
7539 if (DECL_BUILT_IN (new_decl) && !bitmap_empty_p (args_to_skip))
7541 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7542 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7547 /* Build a function type. The RETURN_TYPE is the type returned by the
7548 function. If VAARGS is set, no void_type_node is appended to the
7549 the list. ARGP must be always be terminated be a NULL_TREE. */
7552 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7556 t = va_arg (argp, tree);
7557 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7558 args = tree_cons (NULL_TREE, t, args);
7563 if (args != NULL_TREE)
7564 args = nreverse (args);
7565 gcc_assert (last != void_list_node);
7567 else if (args == NULL_TREE)
7568 args = void_list_node;
7572 args = nreverse (args);
7573 TREE_CHAIN (last) = void_list_node;
7575 args = build_function_type (return_type, args);
7580 /* Build a function type. The RETURN_TYPE is the type returned by the
7581 function. If additional arguments are provided, they are
7582 additional argument types. The list of argument types must always
7583 be terminated by NULL_TREE. */
7586 build_function_type_list (tree return_type, ...)
7591 va_start (p, return_type);
7592 args = build_function_type_list_1 (false, return_type, p);
7597 /* Build a variable argument function type. The RETURN_TYPE is the
7598 type returned by the function. If additional arguments are provided,
7599 they are additional argument types. The list of argument types must
7600 always be terminated by NULL_TREE. */
7603 build_varargs_function_type_list (tree return_type, ...)
7608 va_start (p, return_type);
7609 args = build_function_type_list_1 (true, return_type, p);
7615 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7616 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7617 for the method. An implicit additional parameter (of type
7618 pointer-to-BASETYPE) is added to the ARGTYPES. */
7621 build_method_type_directly (tree basetype,
7628 bool any_structural_p, any_noncanonical_p;
7629 tree canon_argtypes;
7631 /* Make a node of the sort we want. */
7632 t = make_node (METHOD_TYPE);
7634 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7635 TREE_TYPE (t) = rettype;
7636 ptype = build_pointer_type (basetype);
7638 /* The actual arglist for this function includes a "hidden" argument
7639 which is "this". Put it into the list of argument types. */
7640 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7641 TYPE_ARG_TYPES (t) = argtypes;
7643 /* If we already have such a type, use the old one. */
7644 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7645 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7646 hashcode = type_hash_list (argtypes, hashcode);
7647 t = type_hash_canon (hashcode, t);
7649 /* Set up the canonical type. */
7651 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7652 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7654 = (TYPE_CANONICAL (basetype) != basetype
7655 || TYPE_CANONICAL (rettype) != rettype);
7656 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7658 &any_noncanonical_p);
7659 if (any_structural_p)
7660 SET_TYPE_STRUCTURAL_EQUALITY (t);
7661 else if (any_noncanonical_p)
7663 = build_method_type_directly (TYPE_CANONICAL (basetype),
7664 TYPE_CANONICAL (rettype),
7666 if (!COMPLETE_TYPE_P (t))
7672 /* Construct, lay out and return the type of methods belonging to class
7673 BASETYPE and whose arguments and values are described by TYPE.
7674 If that type exists already, reuse it.
7675 TYPE must be a FUNCTION_TYPE node. */
7678 build_method_type (tree basetype, tree type)
7680 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7682 return build_method_type_directly (basetype,
7684 TYPE_ARG_TYPES (type));
7687 /* Construct, lay out and return the type of offsets to a value
7688 of type TYPE, within an object of type BASETYPE.
7689 If a suitable offset type exists already, reuse it. */
7692 build_offset_type (tree basetype, tree type)
7695 hashval_t hashcode = 0;
7697 /* Make a node of the sort we want. */
7698 t = make_node (OFFSET_TYPE);
7700 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7701 TREE_TYPE (t) = type;
7703 /* If we already have such a type, use the old one. */
7704 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7705 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7706 t = type_hash_canon (hashcode, t);
7708 if (!COMPLETE_TYPE_P (t))
7711 if (TYPE_CANONICAL (t) == t)
7713 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7714 || TYPE_STRUCTURAL_EQUALITY_P (type))
7715 SET_TYPE_STRUCTURAL_EQUALITY (t);
7716 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7717 || TYPE_CANONICAL (type) != type)
7719 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7720 TYPE_CANONICAL (type));
7726 /* Create a complex type whose components are COMPONENT_TYPE. */
7729 build_complex_type (tree component_type)
7734 gcc_assert (INTEGRAL_TYPE_P (component_type)
7735 || SCALAR_FLOAT_TYPE_P (component_type)
7736 || FIXED_POINT_TYPE_P (component_type));
7738 /* Make a node of the sort we want. */
7739 t = make_node (COMPLEX_TYPE);
7741 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7743 /* If we already have such a type, use the old one. */
7744 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7745 t = type_hash_canon (hashcode, t);
7747 if (!COMPLETE_TYPE_P (t))
7750 if (TYPE_CANONICAL (t) == t)
7752 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7753 SET_TYPE_STRUCTURAL_EQUALITY (t);
7754 else if (TYPE_CANONICAL (component_type) != component_type)
7756 = build_complex_type (TYPE_CANONICAL (component_type));
7759 /* We need to create a name, since complex is a fundamental type. */
7760 if (! TYPE_NAME (t))
7763 if (component_type == char_type_node)
7764 name = "complex char";
7765 else if (component_type == signed_char_type_node)
7766 name = "complex signed char";
7767 else if (component_type == unsigned_char_type_node)
7768 name = "complex unsigned char";
7769 else if (component_type == short_integer_type_node)
7770 name = "complex short int";
7771 else if (component_type == short_unsigned_type_node)
7772 name = "complex short unsigned int";
7773 else if (component_type == integer_type_node)
7774 name = "complex int";
7775 else if (component_type == unsigned_type_node)
7776 name = "complex unsigned int";
7777 else if (component_type == long_integer_type_node)
7778 name = "complex long int";
7779 else if (component_type == long_unsigned_type_node)
7780 name = "complex long unsigned int";
7781 else if (component_type == long_long_integer_type_node)
7782 name = "complex long long int";
7783 else if (component_type == long_long_unsigned_type_node)
7784 name = "complex long long unsigned int";
7789 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7790 get_identifier (name), t);
7793 return build_qualified_type (t, TYPE_QUALS (component_type));
7796 /* If TYPE is a real or complex floating-point type and the target
7797 does not directly support arithmetic on TYPE then return the wider
7798 type to be used for arithmetic on TYPE. Otherwise, return
7802 excess_precision_type (tree type)
7804 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7806 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7807 switch (TREE_CODE (type))
7810 switch (flt_eval_method)
7813 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7814 return double_type_node;
7817 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7818 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7819 return long_double_type_node;
7826 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7828 switch (flt_eval_method)
7831 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7832 return complex_double_type_node;
7835 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7836 || (TYPE_MODE (TREE_TYPE (type))
7837 == TYPE_MODE (double_type_node)))
7838 return complex_long_double_type_node;
7851 /* Return OP, stripped of any conversions to wider types as much as is safe.
7852 Converting the value back to OP's type makes a value equivalent to OP.
7854 If FOR_TYPE is nonzero, we return a value which, if converted to
7855 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7857 OP must have integer, real or enumeral type. Pointers are not allowed!
7859 There are some cases where the obvious value we could return
7860 would regenerate to OP if converted to OP's type,
7861 but would not extend like OP to wider types.
7862 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7863 For example, if OP is (unsigned short)(signed char)-1,
7864 we avoid returning (signed char)-1 if FOR_TYPE is int,
7865 even though extending that to an unsigned short would regenerate OP,
7866 since the result of extending (signed char)-1 to (int)
7867 is different from (int) OP. */
7870 get_unwidened (tree op, tree for_type)
7872 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7873 tree type = TREE_TYPE (op);
7875 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7877 = (for_type != 0 && for_type != type
7878 && final_prec > TYPE_PRECISION (type)
7879 && TYPE_UNSIGNED (type));
7882 while (CONVERT_EXPR_P (op))
7886 /* TYPE_PRECISION on vector types has different meaning
7887 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7888 so avoid them here. */
7889 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7892 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7893 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7895 /* Truncations are many-one so cannot be removed.
7896 Unless we are later going to truncate down even farther. */
7898 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7901 /* See what's inside this conversion. If we decide to strip it,
7903 op = TREE_OPERAND (op, 0);
7905 /* If we have not stripped any zero-extensions (uns is 0),
7906 we can strip any kind of extension.
7907 If we have previously stripped a zero-extension,
7908 only zero-extensions can safely be stripped.
7909 Any extension can be stripped if the bits it would produce
7910 are all going to be discarded later by truncating to FOR_TYPE. */
7914 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7916 /* TYPE_UNSIGNED says whether this is a zero-extension.
7917 Let's avoid computing it if it does not affect WIN
7918 and if UNS will not be needed again. */
7920 || CONVERT_EXPR_P (op))
7921 && TYPE_UNSIGNED (TREE_TYPE (op)))
7929 /* If we finally reach a constant see if it fits in for_type and
7930 in that case convert it. */
7932 && TREE_CODE (win) == INTEGER_CST
7933 && TREE_TYPE (win) != for_type
7934 && int_fits_type_p (win, for_type))
7935 win = fold_convert (for_type, win);
7940 /* Return OP or a simpler expression for a narrower value
7941 which can be sign-extended or zero-extended to give back OP.
7942 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7943 or 0 if the value should be sign-extended. */
7946 get_narrower (tree op, int *unsignedp_ptr)
7951 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7953 while (TREE_CODE (op) == NOP_EXPR)
7956 = (TYPE_PRECISION (TREE_TYPE (op))
7957 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7959 /* Truncations are many-one so cannot be removed. */
7963 /* See what's inside this conversion. If we decide to strip it,
7968 op = TREE_OPERAND (op, 0);
7969 /* An extension: the outermost one can be stripped,
7970 but remember whether it is zero or sign extension. */
7972 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7973 /* Otherwise, if a sign extension has been stripped,
7974 only sign extensions can now be stripped;
7975 if a zero extension has been stripped, only zero-extensions. */
7976 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7980 else /* bitschange == 0 */
7982 /* A change in nominal type can always be stripped, but we must
7983 preserve the unsignedness. */
7985 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7987 op = TREE_OPERAND (op, 0);
7988 /* Keep trying to narrow, but don't assign op to win if it
7989 would turn an integral type into something else. */
7990 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7997 if (TREE_CODE (op) == COMPONENT_REF
7998 /* Since type_for_size always gives an integer type. */
7999 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
8000 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
8001 /* Ensure field is laid out already. */
8002 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
8003 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
8005 unsigned HOST_WIDE_INT innerprec
8006 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
8007 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
8008 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
8009 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
8011 /* We can get this structure field in a narrower type that fits it,
8012 but the resulting extension to its nominal type (a fullword type)
8013 must satisfy the same conditions as for other extensions.
8015 Do this only for fields that are aligned (not bit-fields),
8016 because when bit-field insns will be used there is no
8017 advantage in doing this. */
8019 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
8020 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
8021 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
8025 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
8026 win = fold_convert (type, op);
8030 *unsignedp_ptr = uns;
8034 /* Returns true if integer constant C has a value that is permissible
8035 for type TYPE (an INTEGER_TYPE). */
8038 int_fits_type_p (const_tree c, const_tree type)
8040 tree type_low_bound, type_high_bound;
8041 bool ok_for_low_bound, ok_for_high_bound, unsc;
8044 dc = tree_to_double_int (c);
8045 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
8047 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
8048 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
8050 /* So c is an unsigned integer whose type is sizetype and type is not.
8051 sizetype'd integers are sign extended even though they are
8052 unsigned. If the integer value fits in the lower end word of c,
8053 and if the higher end word has all its bits set to 1, that
8054 means the higher end bits are set to 1 only for sign extension.
8055 So let's convert c into an equivalent zero extended unsigned
8057 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
8060 type_low_bound = TYPE_MIN_VALUE (type);
8061 type_high_bound = TYPE_MAX_VALUE (type);
8063 /* If at least one bound of the type is a constant integer, we can check
8064 ourselves and maybe make a decision. If no such decision is possible, but
8065 this type is a subtype, try checking against that. Otherwise, use
8066 double_int_fits_to_tree_p, which checks against the precision.
8068 Compute the status for each possibly constant bound, and return if we see
8069 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8070 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8071 for "constant known to fit". */
8073 /* Check if c >= type_low_bound. */
8074 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
8076 dd = tree_to_double_int (type_low_bound);
8077 if (TREE_CODE (type) == INTEGER_TYPE
8078 && TYPE_IS_SIZETYPE (type)
8079 && TYPE_UNSIGNED (type))
8080 dd = double_int_zext (dd, TYPE_PRECISION (type));
8081 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
8083 int c_neg = (!unsc && double_int_negative_p (dc));
8084 int t_neg = (unsc && double_int_negative_p (dd));
8086 if (c_neg && !t_neg)
8088 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
8091 else if (double_int_cmp (dc, dd, unsc) < 0)
8093 ok_for_low_bound = true;
8096 ok_for_low_bound = false;
8098 /* Check if c <= type_high_bound. */
8099 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8101 dd = tree_to_double_int (type_high_bound);
8102 if (TREE_CODE (type) == INTEGER_TYPE
8103 && TYPE_IS_SIZETYPE (type)
8104 && TYPE_UNSIGNED (type))
8105 dd = double_int_zext (dd, TYPE_PRECISION (type));
8106 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8108 int c_neg = (!unsc && double_int_negative_p (dc));
8109 int t_neg = (unsc && double_int_negative_p (dd));
8111 if (t_neg && !c_neg)
8113 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
8116 else if (double_int_cmp (dc, dd, unsc) > 0)
8118 ok_for_high_bound = true;
8121 ok_for_high_bound = false;
8123 /* If the constant fits both bounds, the result is known. */
8124 if (ok_for_low_bound && ok_for_high_bound)
8127 /* Perform some generic filtering which may allow making a decision
8128 even if the bounds are not constant. First, negative integers
8129 never fit in unsigned types, */
8130 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8133 /* Second, narrower types always fit in wider ones. */
8134 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8137 /* Third, unsigned integers with top bit set never fit signed types. */
8138 if (! TYPE_UNSIGNED (type) && unsc)
8140 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8141 if (prec < HOST_BITS_PER_WIDE_INT)
8143 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8146 else if (((((unsigned HOST_WIDE_INT) 1)
8147 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8151 /* If we haven't been able to decide at this point, there nothing more we
8152 can check ourselves here. Look at the base type if we have one and it
8153 has the same precision. */
8154 if (TREE_CODE (type) == INTEGER_TYPE
8155 && TREE_TYPE (type) != 0
8156 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8158 type = TREE_TYPE (type);
8162 /* Or to double_int_fits_to_tree_p, if nothing else. */
8163 return double_int_fits_to_tree_p (type, dc);
8166 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8167 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8168 represented (assuming two's-complement arithmetic) within the bit
8169 precision of the type are returned instead. */
8172 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8174 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8175 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8176 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8177 TYPE_UNSIGNED (type));
8180 if (TYPE_UNSIGNED (type))
8181 mpz_set_ui (min, 0);
8185 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8186 mn = double_int_sext (double_int_add (mn, double_int_one),
8187 TYPE_PRECISION (type));
8188 mpz_set_double_int (min, mn, false);
8192 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8193 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8194 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8195 TYPE_UNSIGNED (type));
8198 if (TYPE_UNSIGNED (type))
8199 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8202 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8207 /* Return true if VAR is an automatic variable defined in function FN. */
8210 auto_var_in_fn_p (const_tree var, const_tree fn)
8212 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8213 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8214 || TREE_CODE (var) == PARM_DECL)
8215 && ! TREE_STATIC (var))
8216 || TREE_CODE (var) == LABEL_DECL
8217 || TREE_CODE (var) == RESULT_DECL));
8220 /* Subprogram of following function. Called by walk_tree.
8222 Return *TP if it is an automatic variable or parameter of the
8223 function passed in as DATA. */
8226 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8228 tree fn = (tree) data;
8233 else if (DECL_P (*tp)
8234 && auto_var_in_fn_p (*tp, fn))
8240 /* Returns true if T is, contains, or refers to a type with variable
8241 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8242 arguments, but not the return type. If FN is nonzero, only return
8243 true if a modifier of the type or position of FN is a variable or
8244 parameter inside FN.
8246 This concept is more general than that of C99 'variably modified types':
8247 in C99, a struct type is never variably modified because a VLA may not
8248 appear as a structure member. However, in GNU C code like:
8250 struct S { int i[f()]; };
8252 is valid, and other languages may define similar constructs. */
8255 variably_modified_type_p (tree type, tree fn)
8259 /* Test if T is either variable (if FN is zero) or an expression containing
8260 a variable in FN. */
8261 #define RETURN_TRUE_IF_VAR(T) \
8262 do { tree _t = (T); \
8263 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8264 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8265 return true; } while (0)
8267 if (type == error_mark_node)
8270 /* If TYPE itself has variable size, it is variably modified. */
8271 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8272 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8274 switch (TREE_CODE (type))
8277 case REFERENCE_TYPE:
8279 if (variably_modified_type_p (TREE_TYPE (type), fn))
8285 /* If TYPE is a function type, it is variably modified if the
8286 return type is variably modified. */
8287 if (variably_modified_type_p (TREE_TYPE (type), fn))
8293 case FIXED_POINT_TYPE:
8296 /* Scalar types are variably modified if their end points
8298 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8299 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8304 case QUAL_UNION_TYPE:
8305 /* We can't see if any of the fields are variably-modified by the
8306 definition we normally use, since that would produce infinite
8307 recursion via pointers. */
8308 /* This is variably modified if some field's type is. */
8309 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8310 if (TREE_CODE (t) == FIELD_DECL)
8312 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8313 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8314 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8316 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8317 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8322 /* Do not call ourselves to avoid infinite recursion. This is
8323 variably modified if the element type is. */
8324 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8325 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8332 /* The current language may have other cases to check, but in general,
8333 all other types are not variably modified. */
8334 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8336 #undef RETURN_TRUE_IF_VAR
8339 /* Given a DECL or TYPE, return the scope in which it was declared, or
8340 NULL_TREE if there is no containing scope. */
8343 get_containing_scope (const_tree t)
8345 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8348 /* Return the innermost context enclosing DECL that is
8349 a FUNCTION_DECL, or zero if none. */
8352 decl_function_context (const_tree decl)
8356 if (TREE_CODE (decl) == ERROR_MARK)
8359 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8360 where we look up the function at runtime. Such functions always take
8361 a first argument of type 'pointer to real context'.
8363 C++ should really be fixed to use DECL_CONTEXT for the real context,
8364 and use something else for the "virtual context". */
8365 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8368 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8370 context = DECL_CONTEXT (decl);
8372 while (context && TREE_CODE (context) != FUNCTION_DECL)
8374 if (TREE_CODE (context) == BLOCK)
8375 context = BLOCK_SUPERCONTEXT (context);
8377 context = get_containing_scope (context);
8383 /* Return the innermost context enclosing DECL that is
8384 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8385 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8388 decl_type_context (const_tree decl)
8390 tree context = DECL_CONTEXT (decl);
8393 switch (TREE_CODE (context))
8395 case NAMESPACE_DECL:
8396 case TRANSLATION_UNIT_DECL:
8401 case QUAL_UNION_TYPE:
8406 context = DECL_CONTEXT (context);
8410 context = BLOCK_SUPERCONTEXT (context);
8420 /* CALL is a CALL_EXPR. Return the declaration for the function
8421 called, or NULL_TREE if the called function cannot be
8425 get_callee_fndecl (const_tree call)
8429 if (call == error_mark_node)
8430 return error_mark_node;
8432 /* It's invalid to call this function with anything but a
8434 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8436 /* The first operand to the CALL is the address of the function
8438 addr = CALL_EXPR_FN (call);
8442 /* If this is a readonly function pointer, extract its initial value. */
8443 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8444 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8445 && DECL_INITIAL (addr))
8446 addr = DECL_INITIAL (addr);
8448 /* If the address is just `&f' for some function `f', then we know
8449 that `f' is being called. */
8450 if (TREE_CODE (addr) == ADDR_EXPR
8451 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8452 return TREE_OPERAND (addr, 0);
8454 /* We couldn't figure out what was being called. */
8458 /* Print debugging information about tree nodes generated during the compile,
8459 and any language-specific information. */
8462 dump_tree_statistics (void)
8464 #ifdef GATHER_STATISTICS
8466 int total_nodes, total_bytes;
8469 fprintf (stderr, "\n??? tree nodes created\n\n");
8470 #ifdef GATHER_STATISTICS
8471 fprintf (stderr, "Kind Nodes Bytes\n");
8472 fprintf (stderr, "---------------------------------------\n");
8473 total_nodes = total_bytes = 0;
8474 for (i = 0; i < (int) all_kinds; i++)
8476 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8477 tree_node_counts[i], tree_node_sizes[i]);
8478 total_nodes += tree_node_counts[i];
8479 total_bytes += tree_node_sizes[i];
8481 fprintf (stderr, "---------------------------------------\n");
8482 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8483 fprintf (stderr, "---------------------------------------\n");
8484 ssanames_print_statistics ();
8485 phinodes_print_statistics ();
8487 fprintf (stderr, "(No per-node statistics)\n");
8489 print_type_hash_statistics ();
8490 print_debug_expr_statistics ();
8491 print_value_expr_statistics ();
8492 lang_hooks.print_statistics ();
8495 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8497 /* Generate a crc32 of a string. */
8500 crc32_string (unsigned chksum, const char *string)
8504 unsigned value = *string << 24;
8507 for (ix = 8; ix--; value <<= 1)
8511 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8520 /* P is a string that will be used in a symbol. Mask out any characters
8521 that are not valid in that context. */
8524 clean_symbol_name (char *p)
8528 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8531 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8538 /* Generate a name for a special-purpose function function.
8539 The generated name may need to be unique across the whole link.
8540 TYPE is some string to identify the purpose of this function to the
8541 linker or collect2; it must start with an uppercase letter,
8543 I - for constructors
8545 N - for C++ anonymous namespaces
8546 F - for DWARF unwind frame information. */
8549 get_file_function_name (const char *type)
8555 /* If we already have a name we know to be unique, just use that. */
8556 if (first_global_object_name)
8557 p = q = ASTRDUP (first_global_object_name);
8558 /* If the target is handling the constructors/destructors, they
8559 will be local to this file and the name is only necessary for
8561 We also assign sub_I and sub_D sufixes to constructors called from
8562 the global static constructors. These are always local. */
8563 else if (((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8564 || (strncmp (type, "sub_", 4) == 0
8565 && (type[4] == 'I' || type[4] == 'D')))
8567 const char *file = main_input_filename;
8569 file = input_filename;
8570 /* Just use the file's basename, because the full pathname
8571 might be quite long. */
8572 p = strrchr (file, '/');
8577 p = q = ASTRDUP (p);
8581 /* Otherwise, the name must be unique across the entire link.
8582 We don't have anything that we know to be unique to this translation
8583 unit, so use what we do have and throw in some randomness. */
8585 const char *name = weak_global_object_name;
8586 const char *file = main_input_filename;
8591 file = input_filename;
8593 len = strlen (file);
8594 q = (char *) alloca (9 * 2 + len + 1);
8595 memcpy (q, file, len + 1);
8597 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8598 crc32_string (0, get_random_seed (false)));
8603 clean_symbol_name (q);
8604 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8607 /* Set up the name of the file-level functions we may need.
8608 Use a global object (which is already required to be unique over
8609 the program) rather than the file name (which imposes extra
8611 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8613 return get_identifier (buf);
8616 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8618 /* Complain that the tree code of NODE does not match the expected 0
8619 terminated list of trailing codes. The trailing code list can be
8620 empty, for a more vague error message. FILE, LINE, and FUNCTION
8621 are of the caller. */
8624 tree_check_failed (const_tree node, const char *file,
8625 int line, const char *function, ...)
8629 unsigned length = 0;
8632 va_start (args, function);
8633 while ((code = va_arg (args, int)))
8634 length += 4 + strlen (tree_code_name[code]);
8639 va_start (args, function);
8640 length += strlen ("expected ");
8641 buffer = tmp = (char *) alloca (length);
8643 while ((code = va_arg (args, int)))
8645 const char *prefix = length ? " or " : "expected ";
8647 strcpy (tmp + length, prefix);
8648 length += strlen (prefix);
8649 strcpy (tmp + length, tree_code_name[code]);
8650 length += strlen (tree_code_name[code]);
8655 buffer = "unexpected node";
8657 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8658 buffer, tree_code_name[TREE_CODE (node)],
8659 function, trim_filename (file), line);
8662 /* Complain that the tree code of NODE does match the expected 0
8663 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8667 tree_not_check_failed (const_tree node, const char *file,
8668 int line, const char *function, ...)
8672 unsigned length = 0;
8675 va_start (args, function);
8676 while ((code = va_arg (args, int)))
8677 length += 4 + strlen (tree_code_name[code]);
8679 va_start (args, function);
8680 buffer = (char *) alloca (length);
8682 while ((code = va_arg (args, int)))
8686 strcpy (buffer + length, " or ");
8689 strcpy (buffer + length, tree_code_name[code]);
8690 length += strlen (tree_code_name[code]);
8694 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8695 buffer, tree_code_name[TREE_CODE (node)],
8696 function, trim_filename (file), line);
8699 /* Similar to tree_check_failed, except that we check for a class of tree
8700 code, given in CL. */
8703 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8704 const char *file, int line, const char *function)
8707 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8708 TREE_CODE_CLASS_STRING (cl),
8709 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8710 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8713 /* Similar to tree_check_failed, except that instead of specifying a
8714 dozen codes, use the knowledge that they're all sequential. */
8717 tree_range_check_failed (const_tree node, const char *file, int line,
8718 const char *function, enum tree_code c1,
8722 unsigned length = 0;
8725 for (c = c1; c <= c2; ++c)
8726 length += 4 + strlen (tree_code_name[c]);
8728 length += strlen ("expected ");
8729 buffer = (char *) alloca (length);
8732 for (c = c1; c <= c2; ++c)
8734 const char *prefix = length ? " or " : "expected ";
8736 strcpy (buffer + length, prefix);
8737 length += strlen (prefix);
8738 strcpy (buffer + length, tree_code_name[c]);
8739 length += strlen (tree_code_name[c]);
8742 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8743 buffer, tree_code_name[TREE_CODE (node)],
8744 function, trim_filename (file), line);
8748 /* Similar to tree_check_failed, except that we check that a tree does
8749 not have the specified code, given in CL. */
8752 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8753 const char *file, int line, const char *function)
8756 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8757 TREE_CODE_CLASS_STRING (cl),
8758 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8759 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8763 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8766 omp_clause_check_failed (const_tree node, const char *file, int line,
8767 const char *function, enum omp_clause_code code)
8769 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8770 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8771 function, trim_filename (file), line);
8775 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8778 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8779 const char *function, enum omp_clause_code c1,
8780 enum omp_clause_code c2)
8783 unsigned length = 0;
8786 for (c = c1; c <= c2; ++c)
8787 length += 4 + strlen (omp_clause_code_name[c]);
8789 length += strlen ("expected ");
8790 buffer = (char *) alloca (length);
8793 for (c = c1; c <= c2; ++c)
8795 const char *prefix = length ? " or " : "expected ";
8797 strcpy (buffer + length, prefix);
8798 length += strlen (prefix);
8799 strcpy (buffer + length, omp_clause_code_name[c]);
8800 length += strlen (omp_clause_code_name[c]);
8803 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8804 buffer, omp_clause_code_name[TREE_CODE (node)],
8805 function, trim_filename (file), line);
8809 #undef DEFTREESTRUCT
8810 #define DEFTREESTRUCT(VAL, NAME) NAME,
8812 static const char *ts_enum_names[] = {
8813 #include "treestruct.def"
8815 #undef DEFTREESTRUCT
8817 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8819 /* Similar to tree_class_check_failed, except that we check for
8820 whether CODE contains the tree structure identified by EN. */
8823 tree_contains_struct_check_failed (const_tree node,
8824 const enum tree_node_structure_enum en,
8825 const char *file, int line,
8826 const char *function)
8829 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8831 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8835 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8836 (dynamically sized) vector. */
8839 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8840 const char *function)
8843 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8844 idx + 1, len, function, trim_filename (file), line);
8847 /* Similar to above, except that the check is for the bounds of the operand
8848 vector of an expression node EXP. */
8851 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8852 int line, const char *function)
8854 int code = TREE_CODE (exp);
8856 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8857 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8858 function, trim_filename (file), line);
8861 /* Similar to above, except that the check is for the number of
8862 operands of an OMP_CLAUSE node. */
8865 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8866 int line, const char *function)
8869 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8870 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8871 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8872 trim_filename (file), line);
8874 #endif /* ENABLE_TREE_CHECKING */
8876 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8877 and mapped to the machine mode MODE. Initialize its fields and build
8878 the information necessary for debugging output. */
8881 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8884 hashval_t hashcode = 0;
8886 t = make_node (VECTOR_TYPE);
8887 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8888 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8889 SET_TYPE_MODE (t, mode);
8891 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8892 SET_TYPE_STRUCTURAL_EQUALITY (t);
8893 else if (TYPE_CANONICAL (innertype) != innertype
8894 || mode != VOIDmode)
8896 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8900 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8901 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8902 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8903 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8904 t = type_hash_canon (hashcode, t);
8906 /* We have built a main variant, based on the main variant of the
8907 inner type. Use it to build the variant we return. */
8908 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8909 && TREE_TYPE (t) != innertype)
8910 return build_type_attribute_qual_variant (t,
8911 TYPE_ATTRIBUTES (innertype),
8912 TYPE_QUALS (innertype));
8918 make_or_reuse_type (unsigned size, int unsignedp)
8920 if (size == INT_TYPE_SIZE)
8921 return unsignedp ? unsigned_type_node : integer_type_node;
8922 if (size == CHAR_TYPE_SIZE)
8923 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8924 if (size == SHORT_TYPE_SIZE)
8925 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8926 if (size == LONG_TYPE_SIZE)
8927 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8928 if (size == LONG_LONG_TYPE_SIZE)
8929 return (unsignedp ? long_long_unsigned_type_node
8930 : long_long_integer_type_node);
8931 if (size == 128 && int128_integer_type_node)
8932 return (unsignedp ? int128_unsigned_type_node
8933 : int128_integer_type_node);
8936 return make_unsigned_type (size);
8938 return make_signed_type (size);
8941 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8944 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8948 if (size == SHORT_FRACT_TYPE_SIZE)
8949 return unsignedp ? sat_unsigned_short_fract_type_node
8950 : sat_short_fract_type_node;
8951 if (size == FRACT_TYPE_SIZE)
8952 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8953 if (size == LONG_FRACT_TYPE_SIZE)
8954 return unsignedp ? sat_unsigned_long_fract_type_node
8955 : sat_long_fract_type_node;
8956 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8957 return unsignedp ? sat_unsigned_long_long_fract_type_node
8958 : sat_long_long_fract_type_node;
8962 if (size == SHORT_FRACT_TYPE_SIZE)
8963 return unsignedp ? unsigned_short_fract_type_node
8964 : short_fract_type_node;
8965 if (size == FRACT_TYPE_SIZE)
8966 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8967 if (size == LONG_FRACT_TYPE_SIZE)
8968 return unsignedp ? unsigned_long_fract_type_node
8969 : long_fract_type_node;
8970 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8971 return unsignedp ? unsigned_long_long_fract_type_node
8972 : long_long_fract_type_node;
8975 return make_fract_type (size, unsignedp, satp);
8978 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8981 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8985 if (size == SHORT_ACCUM_TYPE_SIZE)
8986 return unsignedp ? sat_unsigned_short_accum_type_node
8987 : sat_short_accum_type_node;
8988 if (size == ACCUM_TYPE_SIZE)
8989 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8990 if (size == LONG_ACCUM_TYPE_SIZE)
8991 return unsignedp ? sat_unsigned_long_accum_type_node
8992 : sat_long_accum_type_node;
8993 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8994 return unsignedp ? sat_unsigned_long_long_accum_type_node
8995 : sat_long_long_accum_type_node;
8999 if (size == SHORT_ACCUM_TYPE_SIZE)
9000 return unsignedp ? unsigned_short_accum_type_node
9001 : short_accum_type_node;
9002 if (size == ACCUM_TYPE_SIZE)
9003 return unsignedp ? unsigned_accum_type_node : accum_type_node;
9004 if (size == LONG_ACCUM_TYPE_SIZE)
9005 return unsignedp ? unsigned_long_accum_type_node
9006 : long_accum_type_node;
9007 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
9008 return unsignedp ? unsigned_long_long_accum_type_node
9009 : long_long_accum_type_node;
9012 return make_accum_type (size, unsignedp, satp);
9015 /* Create nodes for all integer types (and error_mark_node) using the sizes
9016 of C datatypes. The caller should call set_sizetype soon after calling
9017 this function to select one of the types as sizetype. */
9020 build_common_tree_nodes (bool signed_char)
9022 error_mark_node = make_node (ERROR_MARK);
9023 TREE_TYPE (error_mark_node) = error_mark_node;
9025 initialize_sizetypes ();
9027 /* Define both `signed char' and `unsigned char'. */
9028 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
9029 TYPE_STRING_FLAG (signed_char_type_node) = 1;
9030 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
9031 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
9033 /* Define `char', which is like either `signed char' or `unsigned char'
9034 but not the same as either. */
9037 ? make_signed_type (CHAR_TYPE_SIZE)
9038 : make_unsigned_type (CHAR_TYPE_SIZE));
9039 TYPE_STRING_FLAG (char_type_node) = 1;
9041 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
9042 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
9043 integer_type_node = make_signed_type (INT_TYPE_SIZE);
9044 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
9045 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
9046 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
9047 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
9048 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
9049 #if HOST_BITS_PER_WIDE_INT >= 64
9050 /* TODO: This isn't correct, but as logic depends at the moment on
9051 host's instead of target's wide-integer.
9052 If there is a target not supporting TImode, but has an 128-bit
9053 integer-scalar register, this target check needs to be adjusted. */
9054 if (targetm.scalar_mode_supported_p (TImode))
9056 int128_integer_type_node = make_signed_type (128);
9057 int128_unsigned_type_node = make_unsigned_type (128);
9060 /* Define a boolean type. This type only represents boolean values but
9061 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9062 Front ends which want to override this size (i.e. Java) can redefine
9063 boolean_type_node before calling build_common_tree_nodes_2. */
9064 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
9065 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
9066 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
9067 TYPE_PRECISION (boolean_type_node) = 1;
9069 /* Fill in the rest of the sized types. Reuse existing type nodes
9071 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
9072 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
9073 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
9074 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
9075 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
9077 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
9078 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
9079 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
9080 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
9081 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
9083 access_public_node = get_identifier ("public");
9084 access_protected_node = get_identifier ("protected");
9085 access_private_node = get_identifier ("private");
9088 /* Call this function after calling build_common_tree_nodes and set_sizetype.
9089 It will create several other common tree nodes. */
9092 build_common_tree_nodes_2 (int short_double)
9094 /* Define these next since types below may used them. */
9095 integer_zero_node = build_int_cst (integer_type_node, 0);
9096 integer_one_node = build_int_cst (integer_type_node, 1);
9097 integer_three_node = build_int_cst (integer_type_node, 3);
9098 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9100 size_zero_node = size_int (0);
9101 size_one_node = size_int (1);
9102 bitsize_zero_node = bitsize_int (0);
9103 bitsize_one_node = bitsize_int (1);
9104 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9106 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9107 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9109 void_type_node = make_node (VOID_TYPE);
9110 layout_type (void_type_node);
9112 /* We are not going to have real types in C with less than byte alignment,
9113 so we might as well not have any types that claim to have it. */
9114 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9115 TYPE_USER_ALIGN (void_type_node) = 0;
9117 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9118 layout_type (TREE_TYPE (null_pointer_node));
9120 ptr_type_node = build_pointer_type (void_type_node);
9122 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9123 fileptr_type_node = ptr_type_node;
9125 float_type_node = make_node (REAL_TYPE);
9126 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9127 layout_type (float_type_node);
9129 double_type_node = make_node (REAL_TYPE);
9131 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9133 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9134 layout_type (double_type_node);
9136 long_double_type_node = make_node (REAL_TYPE);
9137 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9138 layout_type (long_double_type_node);
9140 float_ptr_type_node = build_pointer_type (float_type_node);
9141 double_ptr_type_node = build_pointer_type (double_type_node);
9142 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9143 integer_ptr_type_node = build_pointer_type (integer_type_node);
9145 /* Fixed size integer types. */
9146 uint32_type_node = build_nonstandard_integer_type (32, true);
9147 uint64_type_node = build_nonstandard_integer_type (64, true);
9149 /* Decimal float types. */
9150 dfloat32_type_node = make_node (REAL_TYPE);
9151 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9152 layout_type (dfloat32_type_node);
9153 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9154 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9156 dfloat64_type_node = make_node (REAL_TYPE);
9157 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9158 layout_type (dfloat64_type_node);
9159 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9160 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9162 dfloat128_type_node = make_node (REAL_TYPE);
9163 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9164 layout_type (dfloat128_type_node);
9165 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9166 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9168 complex_integer_type_node = build_complex_type (integer_type_node);
9169 complex_float_type_node = build_complex_type (float_type_node);
9170 complex_double_type_node = build_complex_type (double_type_node);
9171 complex_long_double_type_node = build_complex_type (long_double_type_node);
9173 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9174 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9175 sat_ ## KIND ## _type_node = \
9176 make_sat_signed_ ## KIND ## _type (SIZE); \
9177 sat_unsigned_ ## KIND ## _type_node = \
9178 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9179 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9180 unsigned_ ## KIND ## _type_node = \
9181 make_unsigned_ ## KIND ## _type (SIZE);
9183 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9184 sat_ ## WIDTH ## KIND ## _type_node = \
9185 make_sat_signed_ ## KIND ## _type (SIZE); \
9186 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9187 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9188 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9189 unsigned_ ## WIDTH ## KIND ## _type_node = \
9190 make_unsigned_ ## KIND ## _type (SIZE);
9192 /* Make fixed-point type nodes based on four different widths. */
9193 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9194 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9195 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9196 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9197 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9199 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9200 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9201 NAME ## _type_node = \
9202 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9203 u ## NAME ## _type_node = \
9204 make_or_reuse_unsigned_ ## KIND ## _type \
9205 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9206 sat_ ## NAME ## _type_node = \
9207 make_or_reuse_sat_signed_ ## KIND ## _type \
9208 (GET_MODE_BITSIZE (MODE ## mode)); \
9209 sat_u ## NAME ## _type_node = \
9210 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9211 (GET_MODE_BITSIZE (U ## MODE ## mode));
9213 /* Fixed-point type and mode nodes. */
9214 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9215 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9216 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9217 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9218 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9219 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9220 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9221 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9222 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9223 MAKE_FIXED_MODE_NODE (accum, da, DA)
9224 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9227 tree t = targetm.build_builtin_va_list ();
9229 /* Many back-ends define record types without setting TYPE_NAME.
9230 If we copied the record type here, we'd keep the original
9231 record type without a name. This breaks name mangling. So,
9232 don't copy record types and let c_common_nodes_and_builtins()
9233 declare the type to be __builtin_va_list. */
9234 if (TREE_CODE (t) != RECORD_TYPE)
9235 t = build_variant_type_copy (t);
9237 va_list_type_node = t;
9241 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9244 local_define_builtin (const char *name, tree type, enum built_in_function code,
9245 const char *library_name, int ecf_flags)
9249 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9250 library_name, NULL_TREE);
9251 if (ecf_flags & ECF_CONST)
9252 TREE_READONLY (decl) = 1;
9253 if (ecf_flags & ECF_PURE)
9254 DECL_PURE_P (decl) = 1;
9255 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9256 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9257 if (ecf_flags & ECF_NORETURN)
9258 TREE_THIS_VOLATILE (decl) = 1;
9259 if (ecf_flags & ECF_NOTHROW)
9260 TREE_NOTHROW (decl) = 1;
9261 if (ecf_flags & ECF_MALLOC)
9262 DECL_IS_MALLOC (decl) = 1;
9263 if (ecf_flags & ECF_LEAF)
9264 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9265 NULL, DECL_ATTRIBUTES (decl));
9267 built_in_decls[code] = decl;
9268 implicit_built_in_decls[code] = decl;
9271 /* Call this function after instantiating all builtins that the language
9272 front end cares about. This will build the rest of the builtins that
9273 are relied upon by the tree optimizers and the middle-end. */
9276 build_common_builtin_nodes (void)
9280 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9281 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9283 ftype = build_function_type_list (ptr_type_node,
9284 ptr_type_node, const_ptr_type_node,
9285 size_type_node, NULL_TREE);
9287 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9288 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9289 "memcpy", ECF_NOTHROW | ECF_LEAF);
9290 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9291 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9292 "memmove", ECF_NOTHROW | ECF_LEAF);
9295 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9297 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9298 const_ptr_type_node, size_type_node,
9300 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9301 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9304 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9306 ftype = build_function_type_list (ptr_type_node,
9307 ptr_type_node, integer_type_node,
9308 size_type_node, NULL_TREE);
9309 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9310 "memset", ECF_NOTHROW | ECF_LEAF);
9313 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9315 ftype = build_function_type_list (ptr_type_node,
9316 size_type_node, NULL_TREE);
9317 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9318 "alloca", ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9321 /* If we're checking the stack, `alloca' can throw. */
9322 if (flag_stack_check)
9323 TREE_NOTHROW (built_in_decls[BUILT_IN_ALLOCA]) = 0;
9325 ftype = build_function_type_list (void_type_node,
9326 ptr_type_node, ptr_type_node,
9327 ptr_type_node, NULL_TREE);
9328 local_define_builtin ("__builtin_init_trampoline", ftype,
9329 BUILT_IN_INIT_TRAMPOLINE,
9330 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9332 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9333 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9334 BUILT_IN_ADJUST_TRAMPOLINE,
9335 "__builtin_adjust_trampoline",
9336 ECF_CONST | ECF_NOTHROW);
9338 ftype = build_function_type_list (void_type_node,
9339 ptr_type_node, ptr_type_node, NULL_TREE);
9340 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9341 BUILT_IN_NONLOCAL_GOTO,
9342 "__builtin_nonlocal_goto",
9343 ECF_NORETURN | ECF_NOTHROW);
9345 ftype = build_function_type_list (void_type_node,
9346 ptr_type_node, ptr_type_node, NULL_TREE);
9347 local_define_builtin ("__builtin_setjmp_setup", ftype,
9348 BUILT_IN_SETJMP_SETUP,
9349 "__builtin_setjmp_setup", ECF_NOTHROW);
9351 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9352 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9353 BUILT_IN_SETJMP_DISPATCHER,
9354 "__builtin_setjmp_dispatcher",
9355 ECF_PURE | ECF_NOTHROW);
9357 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9358 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9359 BUILT_IN_SETJMP_RECEIVER,
9360 "__builtin_setjmp_receiver", ECF_NOTHROW);
9362 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9363 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9364 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9366 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9367 local_define_builtin ("__builtin_stack_restore", ftype,
9368 BUILT_IN_STACK_RESTORE,
9369 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9371 /* If there's a possibility that we might use the ARM EABI, build the
9372 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9373 if (targetm.arm_eabi_unwinder)
9375 ftype = build_function_type_list (void_type_node, NULL_TREE);
9376 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9377 BUILT_IN_CXA_END_CLEANUP,
9378 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9381 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9382 local_define_builtin ("__builtin_unwind_resume", ftype,
9383 BUILT_IN_UNWIND_RESUME,
9384 ((targetm.except_unwind_info (&global_options)
9386 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9389 if (built_in_decls[BUILT_IN_RETURN_ADDRESS] == NULL_TREE)
9391 ftype = build_function_type_list (ptr_type_node, integer_type_node,
9393 local_define_builtin ("__builtin_return_address", ftype,
9394 BUILT_IN_RETURN_ADDRESS,
9395 "__builtin_return_address",
9399 if (built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER] == NULL_TREE
9400 || built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT] == NULL_TREE)
9402 ftype = build_function_type_list (void_type_node, ptr_type_node,
9403 ptr_type_node, NULL_TREE);
9404 if (built_in_decls[BUILT_IN_PROFILE_FUNC_ENTER] == NULL_TREE)
9405 local_define_builtin ("__cyg_profile_func_enter", ftype,
9406 BUILT_IN_PROFILE_FUNC_ENTER,
9407 "__cyg_profile_func_enter", 0);
9408 if (built_in_decls[BUILT_IN_PROFILE_FUNC_EXIT] == NULL_TREE)
9409 local_define_builtin ("__cyg_profile_func_exit", ftype,
9410 BUILT_IN_PROFILE_FUNC_EXIT,
9411 "__cyg_profile_func_exit", 0);
9414 /* The exception object and filter values from the runtime. The argument
9415 must be zero before exception lowering, i.e. from the front end. After
9416 exception lowering, it will be the region number for the exception
9417 landing pad. These functions are PURE instead of CONST to prevent
9418 them from being hoisted past the exception edge that will initialize
9419 its value in the landing pad. */
9420 ftype = build_function_type_list (ptr_type_node,
9421 integer_type_node, NULL_TREE);
9422 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9423 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9425 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9426 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9427 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9428 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9430 ftype = build_function_type_list (void_type_node,
9431 integer_type_node, integer_type_node,
9433 local_define_builtin ("__builtin_eh_copy_values", ftype,
9434 BUILT_IN_EH_COPY_VALUES,
9435 "__builtin_eh_copy_values", ECF_NOTHROW);
9437 /* Complex multiplication and division. These are handled as builtins
9438 rather than optabs because emit_library_call_value doesn't support
9439 complex. Further, we can do slightly better with folding these
9440 beasties if the real and complex parts of the arguments are separate. */
9444 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9446 char mode_name_buf[4], *q;
9448 enum built_in_function mcode, dcode;
9449 tree type, inner_type;
9451 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9454 inner_type = TREE_TYPE (type);
9456 ftype = build_function_type_list (type, inner_type, inner_type,
9457 inner_type, inner_type, NULL_TREE);
9459 mcode = ((enum built_in_function)
9460 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9461 dcode = ((enum built_in_function)
9462 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9464 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9468 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9469 local_define_builtin (built_in_names[mcode], ftype, mcode,
9470 built_in_names[mcode], ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9472 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9473 local_define_builtin (built_in_names[dcode], ftype, dcode,
9474 built_in_names[dcode], ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9479 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9482 If we requested a pointer to a vector, build up the pointers that
9483 we stripped off while looking for the inner type. Similarly for
9484 return values from functions.
9486 The argument TYPE is the top of the chain, and BOTTOM is the
9487 new type which we will point to. */
9490 reconstruct_complex_type (tree type, tree bottom)
9494 if (TREE_CODE (type) == POINTER_TYPE)
9496 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9497 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9498 TYPE_REF_CAN_ALIAS_ALL (type));
9500 else if (TREE_CODE (type) == REFERENCE_TYPE)
9502 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9503 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9504 TYPE_REF_CAN_ALIAS_ALL (type));
9506 else if (TREE_CODE (type) == ARRAY_TYPE)
9508 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9509 outer = build_array_type (inner, TYPE_DOMAIN (type));
9511 else if (TREE_CODE (type) == FUNCTION_TYPE)
9513 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9514 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9516 else if (TREE_CODE (type) == METHOD_TYPE)
9518 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9519 /* The build_method_type_directly() routine prepends 'this' to argument list,
9520 so we must compensate by getting rid of it. */
9522 = build_method_type_directly
9523 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9525 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9527 else if (TREE_CODE (type) == OFFSET_TYPE)
9529 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9530 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9535 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9539 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9542 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9546 switch (GET_MODE_CLASS (mode))
9548 case MODE_VECTOR_INT:
9549 case MODE_VECTOR_FLOAT:
9550 case MODE_VECTOR_FRACT:
9551 case MODE_VECTOR_UFRACT:
9552 case MODE_VECTOR_ACCUM:
9553 case MODE_VECTOR_UACCUM:
9554 nunits = GET_MODE_NUNITS (mode);
9558 /* Check that there are no leftover bits. */
9559 gcc_assert (GET_MODE_BITSIZE (mode)
9560 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9562 nunits = GET_MODE_BITSIZE (mode)
9563 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9570 return make_vector_type (innertype, nunits, mode);
9573 /* Similarly, but takes the inner type and number of units, which must be
9577 build_vector_type (tree innertype, int nunits)
9579 return make_vector_type (innertype, nunits, VOIDmode);
9582 /* Similarly, but takes the inner type and number of units, which must be
9586 build_opaque_vector_type (tree innertype, int nunits)
9589 innertype = build_distinct_type_copy (innertype);
9590 t = make_vector_type (innertype, nunits, VOIDmode);
9591 TYPE_VECTOR_OPAQUE (t) = true;
9596 /* Given an initializer INIT, return TRUE if INIT is zero or some
9597 aggregate of zeros. Otherwise return FALSE. */
9599 initializer_zerop (const_tree init)
9605 switch (TREE_CODE (init))
9608 return integer_zerop (init);
9611 /* ??? Note that this is not correct for C4X float formats. There,
9612 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9613 negative exponent. */
9614 return real_zerop (init)
9615 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9618 return fixed_zerop (init);
9621 return integer_zerop (init)
9622 || (real_zerop (init)
9623 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9624 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9627 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9628 if (!initializer_zerop (TREE_VALUE (elt)))
9634 unsigned HOST_WIDE_INT idx;
9636 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9637 if (!initializer_zerop (elt))
9646 /* We need to loop through all elements to handle cases like
9647 "\0" and "\0foobar". */
9648 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9649 if (TREE_STRING_POINTER (init)[i] != '\0')
9660 /* Build an empty statement at location LOC. */
9663 build_empty_stmt (location_t loc)
9665 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9666 SET_EXPR_LOCATION (t, loc);
9671 /* Build an OpenMP clause with code CODE. LOC is the location of the
9675 build_omp_clause (location_t loc, enum omp_clause_code code)
9680 length = omp_clause_num_ops[code];
9681 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9683 t = ggc_alloc_tree_node (size);
9684 memset (t, 0, size);
9685 TREE_SET_CODE (t, OMP_CLAUSE);
9686 OMP_CLAUSE_SET_CODE (t, code);
9687 OMP_CLAUSE_LOCATION (t) = loc;
9689 #ifdef GATHER_STATISTICS
9690 tree_node_counts[(int) omp_clause_kind]++;
9691 tree_node_sizes[(int) omp_clause_kind] += size;
9697 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9698 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9699 Except for the CODE and operand count field, other storage for the
9700 object is initialized to zeros. */
9703 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9706 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9708 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9709 gcc_assert (len >= 1);
9711 #ifdef GATHER_STATISTICS
9712 tree_node_counts[(int) e_kind]++;
9713 tree_node_sizes[(int) e_kind] += length;
9716 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9718 TREE_SET_CODE (t, code);
9720 /* Can't use TREE_OPERAND to store the length because if checking is
9721 enabled, it will try to check the length before we store it. :-P */
9722 t->exp.operands[0] = build_int_cst (sizetype, len);
9727 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9728 FN and a null static chain slot. NARGS is the number of call arguments
9729 which are specified as "..." arguments. */
9732 build_call_nary (tree return_type, tree fn, int nargs, ...)
9736 va_start (args, nargs);
9737 ret = build_call_valist (return_type, fn, nargs, args);
9742 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9743 FN and a null static chain slot. NARGS is the number of call arguments
9744 which are specified as a va_list ARGS. */
9747 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9752 t = build_vl_exp (CALL_EXPR, nargs + 3);
9753 TREE_TYPE (t) = return_type;
9754 CALL_EXPR_FN (t) = fn;
9755 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9756 for (i = 0; i < nargs; i++)
9757 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9758 process_call_operands (t);
9762 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9763 FN and a null static chain slot. NARGS is the number of call arguments
9764 which are specified as a tree array ARGS. */
9767 build_call_array_loc (location_t loc, tree return_type, tree fn,
9768 int nargs, const tree *args)
9773 t = build_vl_exp (CALL_EXPR, nargs + 3);
9774 TREE_TYPE (t) = return_type;
9775 CALL_EXPR_FN (t) = fn;
9776 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9777 for (i = 0; i < nargs; i++)
9778 CALL_EXPR_ARG (t, i) = args[i];
9779 process_call_operands (t);
9780 SET_EXPR_LOCATION (t, loc);
9784 /* Like build_call_array, but takes a VEC. */
9787 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9792 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9793 TREE_TYPE (ret) = return_type;
9794 CALL_EXPR_FN (ret) = fn;
9795 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9796 FOR_EACH_VEC_ELT (tree, args, ix, t)
9797 CALL_EXPR_ARG (ret, ix) = t;
9798 process_call_operands (ret);
9803 /* Returns true if it is possible to prove that the index of
9804 an array access REF (an ARRAY_REF expression) falls into the
9808 in_array_bounds_p (tree ref)
9810 tree idx = TREE_OPERAND (ref, 1);
9813 if (TREE_CODE (idx) != INTEGER_CST)
9816 min = array_ref_low_bound (ref);
9817 max = array_ref_up_bound (ref);
9820 || TREE_CODE (min) != INTEGER_CST
9821 || TREE_CODE (max) != INTEGER_CST)
9824 if (tree_int_cst_lt (idx, min)
9825 || tree_int_cst_lt (max, idx))
9831 /* Returns true if it is possible to prove that the range of
9832 an array access REF (an ARRAY_RANGE_REF expression) falls
9833 into the array bounds. */
9836 range_in_array_bounds_p (tree ref)
9838 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9839 tree range_min, range_max, min, max;
9841 range_min = TYPE_MIN_VALUE (domain_type);
9842 range_max = TYPE_MAX_VALUE (domain_type);
9845 || TREE_CODE (range_min) != INTEGER_CST
9846 || TREE_CODE (range_max) != INTEGER_CST)
9849 min = array_ref_low_bound (ref);
9850 max = array_ref_up_bound (ref);
9853 || TREE_CODE (min) != INTEGER_CST
9854 || TREE_CODE (max) != INTEGER_CST)
9857 if (tree_int_cst_lt (range_min, min)
9858 || tree_int_cst_lt (max, range_max))
9864 /* Return true if T (assumed to be a DECL) must be assigned a memory
9868 needs_to_live_in_memory (const_tree t)
9870 if (TREE_CODE (t) == SSA_NAME)
9871 t = SSA_NAME_VAR (t);
9873 return (TREE_ADDRESSABLE (t)
9874 || is_global_var (t)
9875 || (TREE_CODE (t) == RESULT_DECL
9876 && !DECL_BY_REFERENCE (t)
9877 && aggregate_value_p (t, current_function_decl)));
9880 /* There are situations in which a language considers record types
9881 compatible which have different field lists. Decide if two fields
9882 are compatible. It is assumed that the parent records are compatible. */
9885 fields_compatible_p (const_tree f1, const_tree f2)
9887 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9888 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9891 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9892 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9895 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9901 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9904 find_compatible_field (tree record, tree orig_field)
9908 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9909 if (TREE_CODE (f) == FIELD_DECL
9910 && fields_compatible_p (f, orig_field))
9913 /* ??? Why isn't this on the main fields list? */
9914 f = TYPE_VFIELD (record);
9915 if (f && TREE_CODE (f) == FIELD_DECL
9916 && fields_compatible_p (f, orig_field))
9919 /* ??? We should abort here, but Java appears to do Bad Things
9920 with inherited fields. */
9924 /* Return value of a constant X and sign-extend it. */
9927 int_cst_value (const_tree x)
9929 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9930 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9932 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9933 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9934 || TREE_INT_CST_HIGH (x) == -1);
9936 if (bits < HOST_BITS_PER_WIDE_INT)
9938 bool negative = ((val >> (bits - 1)) & 1) != 0;
9940 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9942 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9948 /* Return value of a constant X and sign-extend it. */
9951 widest_int_cst_value (const_tree x)
9953 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9954 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9956 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9957 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9958 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9959 << HOST_BITS_PER_WIDE_INT);
9961 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9962 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9963 || TREE_INT_CST_HIGH (x) == -1);
9966 if (bits < HOST_BITS_PER_WIDEST_INT)
9968 bool negative = ((val >> (bits - 1)) & 1) != 0;
9970 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9972 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9978 /* If TYPE is an integral type, return an equivalent type which is
9979 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9980 return TYPE itself. */
9983 signed_or_unsigned_type_for (int unsignedp, tree type)
9986 if (POINTER_TYPE_P (type))
9988 /* If the pointer points to the normal address space, use the
9989 size_type_node. Otherwise use an appropriate size for the pointer
9990 based on the named address space it points to. */
9991 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9994 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9997 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
10000 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
10003 /* Returns unsigned variant of TYPE. */
10006 unsigned_type_for (tree type)
10008 return signed_or_unsigned_type_for (1, type);
10011 /* Returns signed variant of TYPE. */
10014 signed_type_for (tree type)
10016 return signed_or_unsigned_type_for (0, type);
10019 /* Returns the largest value obtainable by casting something in INNER type to
10023 upper_bound_in_type (tree outer, tree inner)
10025 unsigned HOST_WIDE_INT lo, hi;
10026 unsigned int det = 0;
10027 unsigned oprec = TYPE_PRECISION (outer);
10028 unsigned iprec = TYPE_PRECISION (inner);
10031 /* Compute a unique number for every combination. */
10032 det |= (oprec > iprec) ? 4 : 0;
10033 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
10034 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
10036 /* Determine the exponent to use. */
10041 /* oprec <= iprec, outer: signed, inner: don't care. */
10046 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10050 /* oprec > iprec, outer: signed, inner: signed. */
10054 /* oprec > iprec, outer: signed, inner: unsigned. */
10058 /* oprec > iprec, outer: unsigned, inner: signed. */
10062 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10066 gcc_unreachable ();
10069 /* Compute 2^^prec - 1. */
10070 if (prec <= HOST_BITS_PER_WIDE_INT)
10073 lo = ((~(unsigned HOST_WIDE_INT) 0)
10074 >> (HOST_BITS_PER_WIDE_INT - prec));
10078 hi = ((~(unsigned HOST_WIDE_INT) 0)
10079 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
10080 lo = ~(unsigned HOST_WIDE_INT) 0;
10083 return build_int_cst_wide (outer, lo, hi);
10086 /* Returns the smallest value obtainable by casting something in INNER type to
10090 lower_bound_in_type (tree outer, tree inner)
10092 unsigned HOST_WIDE_INT lo, hi;
10093 unsigned oprec = TYPE_PRECISION (outer);
10094 unsigned iprec = TYPE_PRECISION (inner);
10096 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10098 if (TYPE_UNSIGNED (outer)
10099 /* If we are widening something of an unsigned type, OUTER type
10100 contains all values of INNER type. In particular, both INNER
10101 and OUTER types have zero in common. */
10102 || (oprec > iprec && TYPE_UNSIGNED (inner)))
10106 /* If we are widening a signed type to another signed type, we
10107 want to obtain -2^^(iprec-1). If we are keeping the
10108 precision or narrowing to a signed type, we want to obtain
10110 unsigned prec = oprec > iprec ? iprec : oprec;
10112 if (prec <= HOST_BITS_PER_WIDE_INT)
10114 hi = ~(unsigned HOST_WIDE_INT) 0;
10115 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10119 hi = ((~(unsigned HOST_WIDE_INT) 0)
10120 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10125 return build_int_cst_wide (outer, lo, hi);
10128 /* Return nonzero if two operands that are suitable for PHI nodes are
10129 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10130 SSA_NAME or invariant. Note that this is strictly an optimization.
10131 That is, callers of this function can directly call operand_equal_p
10132 and get the same result, only slower. */
10135 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10139 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10141 return operand_equal_p (arg0, arg1, 0);
10144 /* Returns number of zeros at the end of binary representation of X.
10146 ??? Use ffs if available? */
10149 num_ending_zeros (const_tree x)
10151 unsigned HOST_WIDE_INT fr, nfr;
10152 unsigned num, abits;
10153 tree type = TREE_TYPE (x);
10155 if (TREE_INT_CST_LOW (x) == 0)
10157 num = HOST_BITS_PER_WIDE_INT;
10158 fr = TREE_INT_CST_HIGH (x);
10163 fr = TREE_INT_CST_LOW (x);
10166 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10169 if (nfr << abits == fr)
10176 if (num > TYPE_PRECISION (type))
10177 num = TYPE_PRECISION (type);
10179 return build_int_cst_type (type, num);
10183 #define WALK_SUBTREE(NODE) \
10186 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10192 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10193 be walked whenever a type is seen in the tree. Rest of operands and return
10194 value are as for walk_tree. */
10197 walk_type_fields (tree type, walk_tree_fn func, void *data,
10198 struct pointer_set_t *pset, walk_tree_lh lh)
10200 tree result = NULL_TREE;
10202 switch (TREE_CODE (type))
10205 case REFERENCE_TYPE:
10206 /* We have to worry about mutually recursive pointers. These can't
10207 be written in C. They can in Ada. It's pathological, but
10208 there's an ACATS test (c38102a) that checks it. Deal with this
10209 by checking if we're pointing to another pointer, that one
10210 points to another pointer, that one does too, and we have no htab.
10211 If so, get a hash table. We check three levels deep to avoid
10212 the cost of the hash table if we don't need one. */
10213 if (POINTER_TYPE_P (TREE_TYPE (type))
10214 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10215 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10218 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10226 /* ... fall through ... */
10229 WALK_SUBTREE (TREE_TYPE (type));
10233 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10235 /* Fall through. */
10237 case FUNCTION_TYPE:
10238 WALK_SUBTREE (TREE_TYPE (type));
10242 /* We never want to walk into default arguments. */
10243 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10244 WALK_SUBTREE (TREE_VALUE (arg));
10249 /* Don't follow this nodes's type if a pointer for fear that
10250 we'll have infinite recursion. If we have a PSET, then we
10253 || (!POINTER_TYPE_P (TREE_TYPE (type))
10254 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10255 WALK_SUBTREE (TREE_TYPE (type));
10256 WALK_SUBTREE (TYPE_DOMAIN (type));
10260 WALK_SUBTREE (TREE_TYPE (type));
10261 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10271 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10272 called with the DATA and the address of each sub-tree. If FUNC returns a
10273 non-NULL value, the traversal is stopped, and the value returned by FUNC
10274 is returned. If PSET is non-NULL it is used to record the nodes visited,
10275 and to avoid visiting a node more than once. */
10278 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10279 struct pointer_set_t *pset, walk_tree_lh lh)
10281 enum tree_code code;
10285 #define WALK_SUBTREE_TAIL(NODE) \
10289 goto tail_recurse; \
10294 /* Skip empty subtrees. */
10298 /* Don't walk the same tree twice, if the user has requested
10299 that we avoid doing so. */
10300 if (pset && pointer_set_insert (pset, *tp))
10303 /* Call the function. */
10305 result = (*func) (tp, &walk_subtrees, data);
10307 /* If we found something, return it. */
10311 code = TREE_CODE (*tp);
10313 /* Even if we didn't, FUNC may have decided that there was nothing
10314 interesting below this point in the tree. */
10315 if (!walk_subtrees)
10317 /* But we still need to check our siblings. */
10318 if (code == TREE_LIST)
10319 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10320 else if (code == OMP_CLAUSE)
10321 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10328 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10329 if (result || !walk_subtrees)
10336 case IDENTIFIER_NODE:
10343 case PLACEHOLDER_EXPR:
10347 /* None of these have subtrees other than those already walked
10352 WALK_SUBTREE (TREE_VALUE (*tp));
10353 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10358 int len = TREE_VEC_LENGTH (*tp);
10363 /* Walk all elements but the first. */
10365 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10367 /* Now walk the first one as a tail call. */
10368 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10372 WALK_SUBTREE (TREE_REALPART (*tp));
10373 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10377 unsigned HOST_WIDE_INT idx;
10378 constructor_elt *ce;
10381 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10383 WALK_SUBTREE (ce->value);
10388 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10393 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10395 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10396 into declarations that are just mentioned, rather than
10397 declared; they don't really belong to this part of the tree.
10398 And, we can see cycles: the initializer for a declaration
10399 can refer to the declaration itself. */
10400 WALK_SUBTREE (DECL_INITIAL (decl));
10401 WALK_SUBTREE (DECL_SIZE (decl));
10402 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10404 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10407 case STATEMENT_LIST:
10409 tree_stmt_iterator i;
10410 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10411 WALK_SUBTREE (*tsi_stmt_ptr (i));
10416 switch (OMP_CLAUSE_CODE (*tp))
10418 case OMP_CLAUSE_PRIVATE:
10419 case OMP_CLAUSE_SHARED:
10420 case OMP_CLAUSE_FIRSTPRIVATE:
10421 case OMP_CLAUSE_COPYIN:
10422 case OMP_CLAUSE_COPYPRIVATE:
10423 case OMP_CLAUSE_IF:
10424 case OMP_CLAUSE_NUM_THREADS:
10425 case OMP_CLAUSE_SCHEDULE:
10426 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10429 case OMP_CLAUSE_NOWAIT:
10430 case OMP_CLAUSE_ORDERED:
10431 case OMP_CLAUSE_DEFAULT:
10432 case OMP_CLAUSE_UNTIED:
10433 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10435 case OMP_CLAUSE_LASTPRIVATE:
10436 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10437 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10438 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10440 case OMP_CLAUSE_COLLAPSE:
10443 for (i = 0; i < 3; i++)
10444 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10445 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10448 case OMP_CLAUSE_REDUCTION:
10451 for (i = 0; i < 4; i++)
10452 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10453 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10457 gcc_unreachable ();
10465 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10466 But, we only want to walk once. */
10467 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10468 for (i = 0; i < len; ++i)
10469 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10470 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10474 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10475 defining. We only want to walk into these fields of a type in this
10476 case and not in the general case of a mere reference to the type.
10478 The criterion is as follows: if the field can be an expression, it
10479 must be walked only here. This should be in keeping with the fields
10480 that are directly gimplified in gimplify_type_sizes in order for the
10481 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10482 variable-sized types.
10484 Note that DECLs get walked as part of processing the BIND_EXPR. */
10485 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10487 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10488 if (TREE_CODE (*type_p) == ERROR_MARK)
10491 /* Call the function for the type. See if it returns anything or
10492 doesn't want us to continue. If we are to continue, walk both
10493 the normal fields and those for the declaration case. */
10494 result = (*func) (type_p, &walk_subtrees, data);
10495 if (result || !walk_subtrees)
10498 /* But do not walk a pointed-to type since it may itself need to
10499 be walked in the declaration case if it isn't anonymous. */
10500 if (!POINTER_TYPE_P (*type_p))
10502 result = walk_type_fields (*type_p, func, data, pset, lh);
10507 /* If this is a record type, also walk the fields. */
10508 if (RECORD_OR_UNION_TYPE_P (*type_p))
10512 for (field = TYPE_FIELDS (*type_p); field;
10513 field = DECL_CHAIN (field))
10515 /* We'd like to look at the type of the field, but we can
10516 easily get infinite recursion. So assume it's pointed
10517 to elsewhere in the tree. Also, ignore things that
10519 if (TREE_CODE (field) != FIELD_DECL)
10522 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10523 WALK_SUBTREE (DECL_SIZE (field));
10524 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10525 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10526 WALK_SUBTREE (DECL_QUALIFIER (field));
10530 /* Same for scalar types. */
10531 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10532 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10533 || TREE_CODE (*type_p) == INTEGER_TYPE
10534 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10535 || TREE_CODE (*type_p) == REAL_TYPE)
10537 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10538 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10541 WALK_SUBTREE (TYPE_SIZE (*type_p));
10542 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10547 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10551 /* Walk over all the sub-trees of this operand. */
10552 len = TREE_OPERAND_LENGTH (*tp);
10554 /* Go through the subtrees. We need to do this in forward order so
10555 that the scope of a FOR_EXPR is handled properly. */
10558 for (i = 0; i < len - 1; ++i)
10559 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10560 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10563 /* If this is a type, walk the needed fields in the type. */
10564 else if (TYPE_P (*tp))
10565 return walk_type_fields (*tp, func, data, pset, lh);
10569 /* We didn't find what we were looking for. */
10572 #undef WALK_SUBTREE_TAIL
10574 #undef WALK_SUBTREE
10576 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10579 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10583 struct pointer_set_t *pset;
10585 pset = pointer_set_create ();
10586 result = walk_tree_1 (tp, func, data, pset, lh);
10587 pointer_set_destroy (pset);
10593 tree_block (tree t)
10595 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10597 if (IS_EXPR_CODE_CLASS (c))
10598 return &t->exp.block;
10599 gcc_unreachable ();
10603 /* Create a nameless artificial label and put it in the current
10604 function context. The label has a location of LOC. Returns the
10605 newly created label. */
10608 create_artificial_label (location_t loc)
10610 tree lab = build_decl (loc,
10611 LABEL_DECL, NULL_TREE, void_type_node);
10613 DECL_ARTIFICIAL (lab) = 1;
10614 DECL_IGNORED_P (lab) = 1;
10615 DECL_CONTEXT (lab) = current_function_decl;
10619 /* Given a tree, try to return a useful variable name that we can use
10620 to prefix a temporary that is being assigned the value of the tree.
10621 I.E. given <temp> = &A, return A. */
10626 tree stripped_decl;
10629 STRIP_NOPS (stripped_decl);
10630 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10631 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10634 switch (TREE_CODE (stripped_decl))
10637 return get_name (TREE_OPERAND (stripped_decl, 0));
10644 /* Return true if TYPE has a variable argument list. */
10647 stdarg_p (const_tree fntype)
10649 function_args_iterator args_iter;
10650 tree n = NULL_TREE, t;
10655 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10660 return n != NULL_TREE && n != void_type_node;
10663 /* Return true if TYPE has a prototype. */
10666 prototype_p (tree fntype)
10670 gcc_assert (fntype != NULL_TREE);
10672 t = TYPE_ARG_TYPES (fntype);
10673 return (t != NULL_TREE);
10676 /* If BLOCK is inlined from an __attribute__((__artificial__))
10677 routine, return pointer to location from where it has been
10680 block_nonartificial_location (tree block)
10682 location_t *ret = NULL;
10684 while (block && TREE_CODE (block) == BLOCK
10685 && BLOCK_ABSTRACT_ORIGIN (block))
10687 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10689 while (TREE_CODE (ao) == BLOCK
10690 && BLOCK_ABSTRACT_ORIGIN (ao)
10691 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10692 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10694 if (TREE_CODE (ao) == FUNCTION_DECL)
10696 /* If AO is an artificial inline, point RET to the
10697 call site locus at which it has been inlined and continue
10698 the loop, in case AO's caller is also an artificial
10700 if (DECL_DECLARED_INLINE_P (ao)
10701 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10702 ret = &BLOCK_SOURCE_LOCATION (block);
10706 else if (TREE_CODE (ao) != BLOCK)
10709 block = BLOCK_SUPERCONTEXT (block);
10715 /* If EXP is inlined from an __attribute__((__artificial__))
10716 function, return the location of the original call expression. */
10719 tree_nonartificial_location (tree exp)
10721 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10726 return EXPR_LOCATION (exp);
10730 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10733 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10736 cl_option_hash_hash (const void *x)
10738 const_tree const t = (const_tree) x;
10742 hashval_t hash = 0;
10744 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10746 p = (const char *)TREE_OPTIMIZATION (t);
10747 len = sizeof (struct cl_optimization);
10750 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10752 p = (const char *)TREE_TARGET_OPTION (t);
10753 len = sizeof (struct cl_target_option);
10757 gcc_unreachable ();
10759 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10761 for (i = 0; i < len; i++)
10763 hash = (hash << 4) ^ ((i << 2) | p[i]);
10768 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10769 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10773 cl_option_hash_eq (const void *x, const void *y)
10775 const_tree const xt = (const_tree) x;
10776 const_tree const yt = (const_tree) y;
10781 if (TREE_CODE (xt) != TREE_CODE (yt))
10784 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10786 xp = (const char *)TREE_OPTIMIZATION (xt);
10787 yp = (const char *)TREE_OPTIMIZATION (yt);
10788 len = sizeof (struct cl_optimization);
10791 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10793 xp = (const char *)TREE_TARGET_OPTION (xt);
10794 yp = (const char *)TREE_TARGET_OPTION (yt);
10795 len = sizeof (struct cl_target_option);
10799 gcc_unreachable ();
10801 return (memcmp (xp, yp, len) == 0);
10804 /* Build an OPTIMIZATION_NODE based on the current options. */
10807 build_optimization_node (void)
10812 /* Use the cache of optimization nodes. */
10814 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
10817 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10821 /* Insert this one into the hash table. */
10822 t = cl_optimization_node;
10825 /* Make a new node for next time round. */
10826 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10832 /* Build a TARGET_OPTION_NODE based on the current options. */
10835 build_target_option_node (void)
10840 /* Use the cache of optimization nodes. */
10842 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
10845 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10849 /* Insert this one into the hash table. */
10850 t = cl_target_option_node;
10853 /* Make a new node for next time round. */
10854 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10860 /* Determine the "ultimate origin" of a block. The block may be an inlined
10861 instance of an inlined instance of a block which is local to an inline
10862 function, so we have to trace all of the way back through the origin chain
10863 to find out what sort of node actually served as the original seed for the
10867 block_ultimate_origin (const_tree block)
10869 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10871 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10872 nodes in the function to point to themselves; ignore that if
10873 we're trying to output the abstract instance of this function. */
10874 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10877 if (immediate_origin == NULL_TREE)
10882 tree lookahead = immediate_origin;
10886 ret_val = lookahead;
10887 lookahead = (TREE_CODE (ret_val) == BLOCK
10888 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10890 while (lookahead != NULL && lookahead != ret_val);
10892 /* The block's abstract origin chain may not be the *ultimate* origin of
10893 the block. It could lead to a DECL that has an abstract origin set.
10894 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10895 will give us if it has one). Note that DECL's abstract origins are
10896 supposed to be the most distant ancestor (or so decl_ultimate_origin
10897 claims), so we don't need to loop following the DECL origins. */
10898 if (DECL_P (ret_val))
10899 return DECL_ORIGIN (ret_val);
10905 /* Return true if T1 and T2 are equivalent lists. */
10908 list_equal_p (const_tree t1, const_tree t2)
10910 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10911 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10916 /* Return true iff conversion in EXP generates no instruction. Mark
10917 it inline so that we fully inline into the stripping functions even
10918 though we have two uses of this function. */
10921 tree_nop_conversion (const_tree exp)
10923 tree outer_type, inner_type;
10925 if (!CONVERT_EXPR_P (exp)
10926 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10928 if (TREE_OPERAND (exp, 0) == error_mark_node)
10931 outer_type = TREE_TYPE (exp);
10932 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10937 /* Use precision rather then machine mode when we can, which gives
10938 the correct answer even for submode (bit-field) types. */
10939 if ((INTEGRAL_TYPE_P (outer_type)
10940 || POINTER_TYPE_P (outer_type)
10941 || TREE_CODE (outer_type) == OFFSET_TYPE)
10942 && (INTEGRAL_TYPE_P (inner_type)
10943 || POINTER_TYPE_P (inner_type)
10944 || TREE_CODE (inner_type) == OFFSET_TYPE))
10945 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10947 /* Otherwise fall back on comparing machine modes (e.g. for
10948 aggregate types, floats). */
10949 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10952 /* Return true iff conversion in EXP generates no instruction. Don't
10953 consider conversions changing the signedness. */
10956 tree_sign_nop_conversion (const_tree exp)
10958 tree outer_type, inner_type;
10960 if (!tree_nop_conversion (exp))
10963 outer_type = TREE_TYPE (exp);
10964 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10966 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10967 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10970 /* Strip conversions from EXP according to tree_nop_conversion and
10971 return the resulting expression. */
10974 tree_strip_nop_conversions (tree exp)
10976 while (tree_nop_conversion (exp))
10977 exp = TREE_OPERAND (exp, 0);
10981 /* Strip conversions from EXP according to tree_sign_nop_conversion
10982 and return the resulting expression. */
10985 tree_strip_sign_nop_conversions (tree exp)
10987 while (tree_sign_nop_conversion (exp))
10988 exp = TREE_OPERAND (exp, 0);
10992 static GTY(()) tree gcc_eh_personality_decl;
10994 /* Return the GCC personality function decl. */
10997 lhd_gcc_personality (void)
10999 if (!gcc_eh_personality_decl)
11000 gcc_eh_personality_decl = build_personality_function ("gcc");
11001 return gcc_eh_personality_decl;
11004 /* Try to find a base info of BINFO that would have its field decl at offset
11005 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11006 found, return, otherwise return NULL_TREE. */
11009 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
11011 tree type = BINFO_TYPE (binfo);
11015 HOST_WIDE_INT pos, size;
11019 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (expected_type))
11024 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
11026 if (TREE_CODE (fld) != FIELD_DECL)
11029 pos = int_bit_position (fld);
11030 size = tree_low_cst (DECL_SIZE (fld), 1);
11031 if (pos <= offset && (pos + size) > offset)
11034 if (!fld || TREE_CODE (TREE_TYPE (fld)) != RECORD_TYPE)
11037 if (!DECL_ARTIFICIAL (fld))
11039 binfo = TYPE_BINFO (TREE_TYPE (fld));
11043 /* Offset 0 indicates the primary base, whose vtable contents are
11044 represented in the binfo for the derived class. */
11045 else if (offset != 0)
11047 tree base_binfo, found_binfo = NULL_TREE;
11048 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
11049 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
11051 found_binfo = base_binfo;
11056 binfo = found_binfo;
11059 type = TREE_TYPE (fld);
11064 /* Returns true if X is a typedef decl. */
11067 is_typedef_decl (tree x)
11069 return (x && TREE_CODE (x) == TYPE_DECL
11070 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
11073 /* Returns true iff TYPE is a type variant created for a typedef. */
11076 typedef_variant_p (tree type)
11078 return is_typedef_decl (TYPE_NAME (type));
11081 /* Warn about a use of an identifier which was marked deprecated. */
11083 warn_deprecated_use (tree node, tree attr)
11087 if (node == 0 || !warn_deprecated_decl)
11093 attr = DECL_ATTRIBUTES (node);
11094 else if (TYPE_P (node))
11096 tree decl = TYPE_STUB_DECL (node);
11098 attr = lookup_attribute ("deprecated",
11099 TYPE_ATTRIBUTES (TREE_TYPE (decl)));
11104 attr = lookup_attribute ("deprecated", attr);
11107 msg = TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr)));
11113 expanded_location xloc = expand_location (DECL_SOURCE_LOCATION (node));
11115 warning (OPT_Wdeprecated_declarations,
11116 "%qD is deprecated (declared at %s:%d): %s",
11117 node, xloc.file, xloc.line, msg);
11119 warning (OPT_Wdeprecated_declarations,
11120 "%qD is deprecated (declared at %s:%d)",
11121 node, xloc.file, xloc.line);
11123 else if (TYPE_P (node))
11125 tree what = NULL_TREE;
11126 tree decl = TYPE_STUB_DECL (node);
11128 if (TYPE_NAME (node))
11130 if (TREE_CODE (TYPE_NAME (node)) == IDENTIFIER_NODE)
11131 what = TYPE_NAME (node);
11132 else if (TREE_CODE (TYPE_NAME (node)) == TYPE_DECL
11133 && DECL_NAME (TYPE_NAME (node)))
11134 what = DECL_NAME (TYPE_NAME (node));
11139 expanded_location xloc
11140 = expand_location (DECL_SOURCE_LOCATION (decl));
11144 warning (OPT_Wdeprecated_declarations,
11145 "%qE is deprecated (declared at %s:%d): %s",
11146 what, xloc.file, xloc.line, msg);
11148 warning (OPT_Wdeprecated_declarations,
11149 "%qE is deprecated (declared at %s:%d)", what,
11150 xloc.file, xloc.line);
11155 warning (OPT_Wdeprecated_declarations,
11156 "type is deprecated (declared at %s:%d): %s",
11157 xloc.file, xloc.line, msg);
11159 warning (OPT_Wdeprecated_declarations,
11160 "type is deprecated (declared at %s:%d)",
11161 xloc.file, xloc.line);
11169 warning (OPT_Wdeprecated_declarations, "%qE is deprecated: %s",
11172 warning (OPT_Wdeprecated_declarations, "%qE is deprecated", what);
11177 warning (OPT_Wdeprecated_declarations, "type is deprecated: %s",
11180 warning (OPT_Wdeprecated_declarations, "type is deprecated");
11186 #include "gt-tree.h"